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