Home | History | Annotate | Line # | Download | only in libkern
libkern.h revision 1.5
      1  1.5  leo /*	$NetBSD: libkern.h,v 1.5 1995/09/23 20:35:47 leo Exp $	*/
      2  1.3  cgd 
      3  1.1  cgd /*-
      4  1.1  cgd  * Copyright (c) 1992, 1993
      5  1.1  cgd  *	The Regents of the University of California.  All rights reserved.
      6  1.1  cgd  *
      7  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      8  1.1  cgd  * modification, are permitted provided that the following conditions
      9  1.1  cgd  * are met:
     10  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     12  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     14  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     15  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1  cgd  *    must display the following acknowledgement:
     17  1.1  cgd  *	This product includes software developed by the University of
     18  1.1  cgd  *	California, Berkeley and its contributors.
     19  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1  cgd  *    may be used to endorse or promote products derived from this software
     21  1.1  cgd  *    without specific prior written permission.
     22  1.1  cgd  *
     23  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1  cgd  * SUCH DAMAGE.
     34  1.1  cgd  *
     35  1.1  cgd  *	@(#)libkern.h	8.1 (Berkeley) 6/10/93
     36  1.1  cgd  */
     37  1.1  cgd 
     38  1.1  cgd #include <sys/types.h>
     39  1.4  cgd 
     40  1.4  cgd static __inline int imax __P((int, int));
     41  1.4  cgd static __inline int imin __P((int, int));
     42  1.4  cgd static __inline u_int max __P((u_int, u_int));
     43  1.4  cgd static __inline u_int min __P((u_int, u_int));
     44  1.4  cgd static __inline long lmax __P((long, long));
     45  1.4  cgd static __inline long lmin __P((long, long));
     46  1.4  cgd static __inline u_long ulmax __P((u_long, u_long));
     47  1.4  cgd static __inline u_long ulmin __P((u_long, u_long));
     48  1.5  leo static __inline int abs __P((int));
     49  1.1  cgd 
     50  1.2  cgd static __inline int
     51  1.1  cgd imax(a, b)
     52  1.1  cgd 	int a, b;
     53  1.1  cgd {
     54  1.1  cgd 	return (a > b ? a : b);
     55  1.1  cgd }
     56  1.2  cgd static __inline int
     57  1.1  cgd imin(a, b)
     58  1.1  cgd 	int a, b;
     59  1.1  cgd {
     60  1.1  cgd 	return (a < b ? a : b);
     61  1.1  cgd }
     62  1.2  cgd static __inline long
     63  1.1  cgd lmax(a, b)
     64  1.1  cgd 	long a, b;
     65  1.1  cgd {
     66  1.1  cgd 	return (a > b ? a : b);
     67  1.1  cgd }
     68  1.2  cgd static __inline long
     69  1.1  cgd lmin(a, b)
     70  1.1  cgd 	long a, b;
     71  1.1  cgd {
     72  1.1  cgd 	return (a < b ? a : b);
     73  1.1  cgd }
     74  1.2  cgd static __inline u_int
     75  1.1  cgd max(a, b)
     76  1.1  cgd 	u_int a, b;
     77  1.1  cgd {
     78  1.1  cgd 	return (a > b ? a : b);
     79  1.1  cgd }
     80  1.2  cgd static __inline u_int
     81  1.1  cgd min(a, b)
     82  1.1  cgd 	u_int a, b;
     83  1.1  cgd {
     84  1.1  cgd 	return (a < b ? a : b);
     85  1.1  cgd }
     86  1.2  cgd static __inline u_long
     87  1.1  cgd ulmax(a, b)
     88  1.1  cgd 	u_long a, b;
     89  1.1  cgd {
     90  1.1  cgd 	return (a > b ? a : b);
     91  1.1  cgd }
     92  1.2  cgd static __inline u_long
     93  1.1  cgd ulmin(a, b)
     94  1.1  cgd 	u_long a, b;
     95  1.1  cgd {
     96  1.1  cgd 	return (a < b ? a : b);
     97  1.5  leo }
     98  1.5  leo 
     99  1.5  leo static __inline int
    100  1.5  leo abs(j)
    101  1.5  leo 	int j;
    102  1.5  leo {
    103  1.5  leo 	return(j < 0 ? -j : j);
    104  1.1  cgd }
    105  1.1  cgd 
    106  1.1  cgd /* Prototypes for non-quad routines. */
    107  1.1  cgd int	 bcmp __P((const void *, const void *, size_t));
    108  1.1  cgd int	 ffs __P((int));
    109  1.1  cgd int	 locc __P((int, char *, u_int));
    110  1.1  cgd u_long	 random __P((void));
    111  1.1  cgd char	*rindex __P((const char *, int));
    112  1.1  cgd int	 scanc __P((u_int, u_char *, u_char *, int));
    113  1.1  cgd int	 skpc __P((int, int, char *));
    114  1.1  cgd char	*strcat __P((char *, const char *));
    115  1.1  cgd char	*strcpy __P((char *, const char *));
    116  1.1  cgd size_t	 strlen __P((const char *));
    117  1.1  cgd char	*strncpy __P((char *, const char *, size_t));
    118