1 /* $NetBSD: libkern.h,v 1.121 2015/08/30 07:55:45 uebayasi Exp $ */
4 * Copyright (c) 1992, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * @(#)libkern.h 8.2 (Berkeley) 8/5/94
34 #ifndef _LIB_LIBKERN_LIBKERN_H_
35 #define _LIB_LIBKERN_LIBKERN_H_
38 #include "opt_diagnostic.h"
41 #include <sys/types.h>
42 #include <sys/inttypes.h>
45 #ifndef LIBKERN_INLINE
46 #define LIBKERN_INLINE static __inline
50 LIBKERN_INLINE
int imax(int, int) __unused
;
51 LIBKERN_INLINE
int imin(int, int) __unused
;
52 LIBKERN_INLINE u_int
max(u_int
, u_int
) __unused
;
53 LIBKERN_INLINE u_int
min(u_int
, u_int
) __unused
;
54 LIBKERN_INLINE
long lmax(long, long) __unused
;
55 LIBKERN_INLINE
long lmin(long, long) __unused
;
56 LIBKERN_INLINE u_long
ulmax(u_long
, u_long
) __unused
;
57 LIBKERN_INLINE u_long
ulmin(u_long
, u_long
) __unused
;
58 LIBKERN_INLINE
int abs(int) __unused
;
59 LIBKERN_INLINE
long labs(long) __unused
;
60 LIBKERN_INLINE
long long llabs(long long) __unused
;
61 LIBKERN_INLINE
intmax_t imaxabs(intmax_t) __unused
;
63 LIBKERN_INLINE
int isspace(int) __unused
;
64 LIBKERN_INLINE
int isascii(int) __unused
;
65 LIBKERN_INLINE
int isupper(int) __unused
;
66 LIBKERN_INLINE
int islower(int) __unused
;
67 LIBKERN_INLINE
int isalpha(int) __unused
;
68 LIBKERN_INLINE
int isalnum(int) __unused
;
69 LIBKERN_INLINE
int isdigit(int) __unused
;
70 LIBKERN_INLINE
int isxdigit(int) __unused
;
71 LIBKERN_INLINE
int iscntrl(int) __unused
;
72 LIBKERN_INLINE
int isgraph(int) __unused
;
73 LIBKERN_INLINE
int isprint(int) __unused
;
74 LIBKERN_INLINE
int ispunct(int) __unused
;
75 LIBKERN_INLINE
int toupper(int) __unused
;
76 LIBKERN_INLINE
int tolower(int) __unused
;
82 return (a
> b
? a
: b
);
87 return (a
< b
? a
: b
);
92 return (a
> b
? a
: b
);
97 return (a
< b
? a
: b
);
100 max(u_int a
, u_int b
)
102 return (a
> b
? a
: b
);
105 min(u_int a
, u_int b
)
107 return (a
< b
? a
: b
);
109 LIBKERN_INLINE u_long
110 ulmax(u_long a
, u_long b
)
112 return (a
> b
? a
: b
);
114 LIBKERN_INLINE u_long
115 ulmin(u_long a
, u_long b
)
117 return (a
< b
? a
: b
);
123 return(j
< 0 ? -j
: j
);
129 return(j
< 0 ? -j
: j
);
132 LIBKERN_INLINE
long long
135 return(j
< 0 ? -j
: j
);
138 LIBKERN_INLINE
intmax_t
141 return(j
< 0 ? -j
: j
);
147 return (ch
== ' ' || (ch
>= '\t' && ch
<= '\r'));
153 return ((ch
& ~0x7f) == 0);
159 return (ch
>= 'A' && ch
<= 'Z');
165 return (ch
>= 'a' && ch
<= 'z');
171 return (isupper(ch
) || islower(ch
));
177 return (isalpha(ch
) || isdigit(ch
));
183 return (ch
>= '0' && ch
<= '9');
189 return (isdigit(ch
) ||
190 (ch
>= 'A' && ch
<= 'F') ||
191 (ch
>= 'a' && ch
<= 'f'));
197 return ((ch
>= 0x00 && ch
<= 0x1F) || ch
== 0x7F);
203 return (ch
!= ' ' && isprint(ch
));
209 return (ch
>= 0x20 && ch
<= 0x7E);
215 return (isprint(ch
) && ch
!= ' ' && !isalnum(ch
));
235 #define __NULL_STMT do { } while (/* CONSTCOND */ 0)
237 #define __KASSERTSTR "kernel %sassertion \"%s\" failed: file \"%s\", line %d "
239 #ifdef NDEBUG /* tradition! */
240 #define assert(e) ((void)0)
242 #define assert(e) (__predict_true((e)) ? (void)0 : \
243 kern_assert(__KASSERTSTR, "", #e, __FILE__, __LINE__))
253 #define CTASSERT(x) __CTASSERT(x)
255 #ifndef CTASSERT_SIGNED
256 #define CTASSERT_SIGNED(x) __CTASSERT(((typeof(x))-1) < 0)
258 #ifndef CTASSERT_UNSIGNED
259 #define CTASSERT_UNSIGNED(x) __CTASSERT(((typeof(x))-1) >= 0)
263 #define _DIAGASSERT(a) (void)0
265 #define KASSERTMSG(e, msg, ...) /* NOTHING */
266 #define KASSERT(e) /* NOTHING */
268 #define KASSERTMSG(e, msg, ...) ((void)0)
269 #define KASSERT(e) ((void)0)
271 #else /* DIAGNOSTIC */
272 #define _DIAGASSERT(a) assert(a)
273 #define KASSERTMSG(e, msg, ...) \
274 (__predict_true((e)) ? (void)0 : \
275 kern_assert(__KASSERTSTR msg, "diagnostic ", #e, \
276 __FILE__, __LINE__, ## __VA_ARGS__))
278 #define KASSERT(e) (__predict_true((e)) ? (void)0 : \
279 kern_assert(__KASSERTSTR, "diagnostic ", #e, \
285 #define KDASSERTMSG(e,msg, ...) /* NOTHING */
286 #define KDASSERT(e) /* NOTHING */
288 #define KDASSERTMSG(e,msg, ...) ((void)0)
289 #define KDASSERT(e) ((void)0)
292 #define KDASSERTMSG(e, msg, ...) \
293 (__predict_true((e)) ? (void)0 : \
294 kern_assert(__KASSERTSTR msg, "debugging ", #e, \
295 __FILE__, __LINE__, ## __VA_ARGS__))
297 #define KDASSERT(e) (__predict_true((e)) ? (void)0 : \
298 kern_assert(__KASSERTSTR, "debugging ", #e, \
303 * XXX: For compatibility we use SMALL_RANDOM by default.
308 #if __GNUC_PREREQ__(4, 0)
309 #define offsetof(type, member) __builtin_offsetof(type, member)
311 #define offsetof(type, member) \
312 ((size_t)(unsigned long)(&(((type *)0)->member)))
317 * Return the container of an embedded struct. Given x = &c->f,
318 * container_of(x, T, f) yields c, where T is the type of c. Example:
320 * struct foo { ... };
328 * struct foo *fp = b.b_foo;
330 * Now we can get at b from fp by:
332 * struct bar *bp = container_of(fp, struct bar, b_foo);
334 * The 0*sizeof((PTR) - ...) causes the compiler to warn if the type of
335 * *fp does not match the type of struct bar::b_foo.
336 * We skip the validation for coverity runs to avoid warnings.
339 #define __validate_container_of(PTR, TYPE, FIELD) 0
341 #define __validate_container_of(PTR, TYPE, FIELD) \
342 (0 * sizeof((PTR) - &((TYPE *)(((char *)(PTR)) - \
343 offsetof(TYPE, FIELD)))->FIELD))
346 #define container_of(PTR, TYPE, FIELD) \
347 ((TYPE *)(((char *)(PTR)) - offsetof(TYPE, FIELD)) \
348 + __validate_container_of(PTR, TYPE, FIELD))
350 #define MTPRNG_RLEN 624
351 struct mtprng_state
{
353 uint32_t mt_elem
[MTPRNG_RLEN
];
355 uint32_t mt_sparse
[3];
358 /* Prototypes for which GCC built-ins exist. */
359 void *memcpy(void *, const void *, size_t);
360 int memcmp(const void *, const void *, size_t);
361 void *memset(void *, int, size_t);
362 #if __GNUC_PREREQ__(2, 95) && !defined(_STANDALONE)
363 #define memcpy(d, s, l) __builtin_memcpy(d, s, l)
364 #define memcmp(a, b, l) __builtin_memcmp(a, b, l)
366 #if __GNUC_PREREQ__(2, 95) && !defined(_STANDALONE)
367 #define memset(d, v, l) __builtin_memset(d, v, l)
370 char *strcpy(char *, const char *);
371 int strcmp(const char *, const char *);
372 size_t strlen(const char *);
373 size_t strnlen(const char *, size_t);
374 char *strsep(char **, const char *);
375 #if __GNUC_PREREQ__(2, 95) && !defined(_STANDALONE)
376 #define strcpy(d, s) __builtin_strcpy(d, s)
377 #define strcmp(a, b) __builtin_strcmp(a, b)
378 #define strlen(a) __builtin_strlen(a)
381 /* Functions for which we always use built-ins. */
383 #define alloca(s) __builtin_alloca(s)
386 /* These exist in GCC 3.x, but we don't bother. */
387 char *strcat(char *, const char *);
388 size_t strcspn(const char *, const char *);
389 char *strncpy(char *, const char *, size_t);
390 char *strncat(char *, const char *, size_t);
391 int strncmp(const char *, const char *, size_t);
392 char *strchr(const char *, int);
393 char *strrchr(const char *, int);
394 char *strstr(const char *, const char *);
395 char *strpbrk(const char *, const char *);
396 size_t strspn(const char *, const char *);
399 * ffs is an instruction on vax.
402 #if __GNUC_PREREQ__(2, 95) && (!defined(__vax__) || __GNUC_PREREQ__(4,1))
403 #define ffs(x) __builtin_ffs(x)
406 void kern_assert(const char *, ...)
407 __attribute__((__format__(__printf__
, 1, 2)));
409 inet_addr(const char *);
411 int inet_aton(const char *, struct in_addr
*);
412 char *intoa(u_int32_t
);
413 #define inet_ntoa(a) intoa((a).s_addr)
414 void *memchr(const void *, int, size_t);
415 void *memmove(void *, const void *, size_t);
416 int pmatch(const char *, const char *, const char **);
418 void srandom(unsigned long);
419 char *initstate(unsigned long, char *, size_t);
420 char *setstate(char *);
421 #endif /* SMALL_RANDOM */
423 void mi_vector_hash(const void * __restrict
, size_t, uint32_t,
425 void mtprng_init32(struct mtprng_state
*, uint32_t);
426 void mtprng_initarray(struct mtprng_state
*, const uint32_t *, size_t);
427 uint32_t mtprng_rawrandom(struct mtprng_state
*);
428 uint32_t mtprng_random(struct mtprng_state
*);
429 int scanc(u_int
, const u_char
*, const u_char
*, int);
430 int skpc(int, size_t, u_char
*);
431 int strcasecmp(const char *, const char *);
432 size_t strlcpy(char *, const char *, size_t);
433 size_t strlcat(char *, const char *, size_t);
434 int strncasecmp(const char *, const char *, size_t);
435 u_long
strtoul(const char *, char **, int);
436 long long strtoll(const char *, char **, int);
437 unsigned long long strtoull(const char *, char **, int);
438 intmax_t strtoimax(const char *, char **, int);
439 uintmax_t strtoumax(const char *, char **, int);
440 intmax_t strtoi(const char * __restrict
, char ** __restrict
, int, intmax_t,
442 uintmax_t strtou(const char * __restrict
, char ** __restrict
, int, uintmax_t,
445 int snprintb(char *, size_t, const char *, uint64_t);
446 int snprintb_m(char *, size_t, const char *, uint64_t, size_t);
447 int kheapsort(void *, size_t, size_t, int (*)(const void *, const void *),
449 uint32_t crc32(uint32_t, const uint8_t *, size_t);
450 #if __GNUC_PREREQ__(4, 5) \
451 && (defined(__alpha_cix__) || defined(__mips_popcount))
452 #define popcount __builtin_popcount
453 #define popcountl __builtin_popcountl
454 #define popcountll __builtin_popcountll
455 #define popcount32 __builtin_popcount
456 #define popcount64 __builtin_popcountll
458 unsigned int popcount(unsigned int) __constfunc
;
459 unsigned int popcountl(unsigned long) __constfunc
;
460 unsigned int popcountll(unsigned long long) __constfunc
;
461 unsigned int popcount32(uint32_t) __constfunc
;
462 unsigned int popcount64(uint64_t) __constfunc
;
465 void *explicit_memset(void *, int, size_t);
466 int consttime_memequal(const void *, const void *, size_t);
470 * LZF hashtable/state size: on uncompressible data and on a system with
471 * a sufficiently large d-cache, a larger table produces a considerable
472 * speed benefit. On systems with small memory and caches, however...
474 #if defined(__vax__) || defined(__m68k__)
479 typedef const uint8_t *LZF_STATE
[1 << LZF_HLOG
];
481 unsigned int lzf_compress_r (const void *const, unsigned int, void *,
482 unsigned int, LZF_STATE
);
483 unsigned int lzf_decompress (const void *const, unsigned int, void *,
487 #endif /* !_LIB_LIBKERN_LIBKERN_H_ */