2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)libkern.h 8.1 (Berkeley) 6/10/93
36 #include <sys/types.h>
38 static __inline
int imax(int a
, int b
) { return (a
> b
? a
: b
); }
39 static __inline
int imin(int a
, int b
) { return (a
< b
? a
: b
); }
40 static __inline
long lmax(long a
, long b
) { return (a
> b
? a
: b
); }
41 static __inline
long lmin(long a
, long b
) { return (a
< b
? a
: b
); }
48 static __inline u_int
max(u_int a
, u_int b
) { return (a
> b
? a
: b
); }
49 static __inline u_int
min(u_int a
, u_int b
) { return (a
< b
? a
: b
); }
50 static __inline quad_t
qmax(quad_t a
, quad_t b
) { return (a
> b
? a
: b
); }
51 static __inline quad_t
qmin(quad_t a
, quad_t b
) { return (a
< b
? a
: b
); }
52 static __inline u_long
ulmax(u_long a
, u_long b
) { return (a
> b
? a
: b
); }
53 static __inline u_long
ulmin(u_long a
, u_long b
) { return (a
< b
? a
: b
); }
55 /* Prototypes for non-quad routines. */
56 int bcmp
__P((const void *, const void *, size_t));
57 #ifndef HAVE_INLINE_FFS
60 int locc
__P((int, char *, u_int
));
61 u_long random
__P((void));
62 char *rindex
__P((const char *, int));
63 int scanc
__P((u_int
, u_char
*, u_char
*, int));
64 int skpc
__P((int, int, char *));
65 char *strcat
__P((char *, const char *));
66 int strcmp
__P((const char *, const char *));
67 char *strcpy
__P((char *, const char *));
68 size_t strlen
__P((const char *));
69 int strncmp
__P((const char *, const char *, size_t));
70 char *strncpy
__P((char *, const char *, size_t));