libkern.h revision 1.32 1 1.32 thorpej /* $NetBSD: libkern.h,v 1.32 2000/11/01 19:37:18 thorpej 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.21 fvdl * @(#)libkern.h 8.2 (Berkeley) 8/5/94
36 1.1 cgd */
37 1.1 cgd
38 1.29 simonb #ifndef _LIB_LIBKERN_LIBKERN_H_
39 1.29 simonb #define _LIB_LIBKERN_LIBKERN_H_
40 1.29 simonb
41 1.1 cgd #include <sys/types.h>
42 1.4 cgd
43 1.7 christos #ifndef LIBKERN_INLINE
44 1.7 christos #define LIBKERN_INLINE static __inline
45 1.7 christos #define LIBKERN_BODY
46 1.7 christos #endif
47 1.7 christos
48 1.14 cgd LIBKERN_INLINE int imax __P((int, int)) __attribute__ ((unused));
49 1.14 cgd LIBKERN_INLINE int imin __P((int, int)) __attribute__ ((unused));
50 1.14 cgd LIBKERN_INLINE u_int max __P((u_int, u_int)) __attribute__ ((unused));
51 1.14 cgd LIBKERN_INLINE u_int min __P((u_int, u_int)) __attribute__ ((unused));
52 1.14 cgd LIBKERN_INLINE long lmax __P((long, long)) __attribute__ ((unused));
53 1.14 cgd LIBKERN_INLINE long lmin __P((long, long)) __attribute__ ((unused));
54 1.14 cgd LIBKERN_INLINE u_long ulmax __P((u_long, u_long)) __attribute__ ((unused));
55 1.14 cgd LIBKERN_INLINE u_long ulmin __P((u_long, u_long)) __attribute__ ((unused));
56 1.14 cgd LIBKERN_INLINE int abs __P((int)) __attribute__ ((unused));
57 1.1 cgd
58 1.7 christos #ifdef LIBKERN_BODY
59 1.7 christos LIBKERN_INLINE int
60 1.1 cgd imax(a, b)
61 1.1 cgd int a, b;
62 1.1 cgd {
63 1.1 cgd return (a > b ? a : b);
64 1.1 cgd }
65 1.7 christos LIBKERN_INLINE int
66 1.1 cgd imin(a, b)
67 1.1 cgd int a, b;
68 1.1 cgd {
69 1.1 cgd return (a < b ? a : b);
70 1.1 cgd }
71 1.7 christos LIBKERN_INLINE long
72 1.1 cgd lmax(a, b)
73 1.1 cgd long a, b;
74 1.1 cgd {
75 1.1 cgd return (a > b ? a : b);
76 1.1 cgd }
77 1.7 christos LIBKERN_INLINE long
78 1.1 cgd lmin(a, b)
79 1.1 cgd long a, b;
80 1.1 cgd {
81 1.1 cgd return (a < b ? a : b);
82 1.1 cgd }
83 1.7 christos LIBKERN_INLINE u_int
84 1.1 cgd max(a, b)
85 1.1 cgd u_int a, b;
86 1.1 cgd {
87 1.1 cgd return (a > b ? a : b);
88 1.1 cgd }
89 1.7 christos LIBKERN_INLINE u_int
90 1.1 cgd min(a, b)
91 1.1 cgd u_int a, b;
92 1.1 cgd {
93 1.1 cgd return (a < b ? a : b);
94 1.1 cgd }
95 1.7 christos LIBKERN_INLINE u_long
96 1.1 cgd ulmax(a, b)
97 1.1 cgd u_long a, b;
98 1.1 cgd {
99 1.1 cgd return (a > b ? a : b);
100 1.1 cgd }
101 1.7 christos LIBKERN_INLINE u_long
102 1.1 cgd ulmin(a, b)
103 1.1 cgd u_long a, b;
104 1.1 cgd {
105 1.1 cgd return (a < b ? a : b);
106 1.5 leo }
107 1.5 leo
108 1.7 christos LIBKERN_INLINE int
109 1.5 leo abs(j)
110 1.5 leo int j;
111 1.5 leo {
112 1.5 leo return(j < 0 ? -j : j);
113 1.1 cgd }
114 1.7 christos #endif
115 1.1 cgd
116 1.9 cgd #ifdef NDEBUG /* tradition! */
117 1.9 cgd #define assert(e) ((void)0)
118 1.10 cgd #else
119 1.9 cgd #ifdef __STDC__
120 1.30 thorpej #define assert(e) (__predict_true((e)) ? (void)0 : \
121 1.9 cgd __assert("", __FILE__, __LINE__, #e))
122 1.9 cgd #else
123 1.30 thorpej #define assert(e) (__predict_true((e)) ? (void)0 : \
124 1.9 cgd __assert("", __FILE__, __LINE__, "e"))
125 1.9 cgd #endif
126 1.9 cgd #endif
127 1.9 cgd
128 1.9 cgd #ifndef DIAGNOSTIC
129 1.9 cgd #define KASSERT(e) ((void)0)
130 1.9 cgd #else
131 1.9 cgd #ifdef __STDC__
132 1.30 thorpej #define KASSERT(e) (__predict_true((e)) ? (void)0 : \
133 1.9 cgd __assert("diagnostic ", __FILE__, __LINE__, #e))
134 1.9 cgd #else
135 1.30 thorpej #define KASSERT(e) (__predict_true((e)) ? (void)0 : \
136 1.9 cgd __assert("diagnostic ", __FILE__, __LINE__, "e"))
137 1.9 cgd #endif
138 1.9 cgd #endif
139 1.9 cgd
140 1.9 cgd #ifndef DEBUG
141 1.9 cgd #define KDASSERT(e) ((void)0)
142 1.9 cgd #else
143 1.9 cgd #ifdef __STDC__
144 1.30 thorpej #define KDASSERT(e) (__predict_true((e)) ? (void)0 : \
145 1.9 cgd __assert("debugging ", __FILE__, __LINE__, #e))
146 1.9 cgd #else
147 1.30 thorpej #define KDASSERT(e) (__predict_true((e)) ? (void)0 : \
148 1.9 cgd __assert("debugging ", __FILE__, __LINE__, "e"))
149 1.9 cgd #endif
150 1.9 cgd #endif
151 1.19 thorpej
152 1.31 msaitoh #ifndef offsetof
153 1.19 thorpej #define offsetof(type, member) ((size_t)(&((type *)0)->member))
154 1.31 msaitoh #endif
155 1.9 cgd
156 1.1 cgd /* Prototypes for non-quad routines. */
157 1.9 cgd void __assert __P((const char *, const char *, int, const char *))
158 1.9 cgd __attribute__((__noreturn__));
159 1.1 cgd int bcmp __P((const void *, const void *, size_t));
160 1.13 drochner void bzero __P((void *, size_t));
161 1.1 cgd int ffs __P((int));
162 1.28 simonb u_int32_t
163 1.28 simonb inet_addr __P((const char *));
164 1.28 simonb char *intoa __P((u_int32_t));
165 1.28 simonb #define inet_ntoa(a) intoa((a).s_addr)
166 1.15 mjacob void *memchr __P((const void *, int, size_t));
167 1.27 tron int memcmp __P((const void *, const void *, size_t));
168 1.20 mycroft void *memcpy __P((void *, const void *, size_t));
169 1.23 perry void *memmove __P((void *, const void *, size_t));
170 1.20 mycroft void *memset __P((void *, int, size_t));
171 1.22 christos int pmatch __P((const char *, const char *, const char **));
172 1.1 cgd u_long random __P((void));
173 1.11 cgd int scanc __P((u_int, const u_char *, const u_char *, int));
174 1.7 christos int skpc __P((int, size_t, u_char *));
175 1.1 cgd char *strcat __P((char *, const char *));
176 1.12 cgd char *strchr __P((const char *, int));
177 1.6 christos int strcmp __P((const char *, const char *));
178 1.32 thorpej int strcasecmp __P((const char *, const char *));
179 1.20 mycroft char *strcpy __P((char *, const char *));
180 1.20 mycroft size_t strlen __P((const char *));
181 1.28 simonb int strncasecmp __P((const char *, const char *, size_t));
182 1.6 christos int strncmp __P((const char *, const char *, size_t));
183 1.20 mycroft char *strncpy __P((char *, const char *, size_t));
184 1.20 mycroft char *strrchr __P((const char *, int));
185 1.28 simonb u_long strtoul __P((const char *, char **, int));
186 1.29 simonb #endif /* !_LIB_LIBKERN_LIBKERN_H_ */
187