Home | History | Annotate | Line # | Download | only in libkern
libkern.h revision 1.130
      1  1.130  riastrad /*	$NetBSD: libkern.h,v 1.130 2018/09/03 16:29:35 riastradh 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.49       agc  * 3. Neither the name of the University nor the names of its contributors
     16    1.1       cgd  *    may be used to endorse or promote products derived from this software
     17    1.1       cgd  *    without specific prior written permission.
     18    1.1       cgd  *
     19    1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20    1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21    1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22    1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23    1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24    1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25    1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26    1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27    1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28    1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29    1.1       cgd  * SUCH DAMAGE.
     30    1.1       cgd  *
     31   1.21      fvdl  *	@(#)libkern.h	8.2 (Berkeley) 8/5/94
     32    1.1       cgd  */
     33    1.1       cgd 
     34   1.29    simonb #ifndef _LIB_LIBKERN_LIBKERN_H_
     35   1.29    simonb #define _LIB_LIBKERN_LIBKERN_H_
     36   1.29    simonb 
     37  1.121  uebayasi #ifdef _KERNEL_OPT
     38  1.121  uebayasi #include "opt_diagnostic.h"
     39  1.128      maxv #include "opt_kasan.h"
     40  1.121  uebayasi #endif
     41  1.121  uebayasi 
     42    1.1       cgd #include <sys/types.h>
     43   1.62   thorpej #include <sys/inttypes.h>
     44   1.52  christos #include <sys/null.h>
     45    1.4       cgd 
     46    1.7  christos #ifndef LIBKERN_INLINE
     47   1.55     perry #define LIBKERN_INLINE	static __inline
     48    1.7  christos #define LIBKERN_BODY
     49    1.7  christos #endif
     50    1.7  christos 
     51   1.86       dsl LIBKERN_INLINE int imax(int, int) __unused;
     52   1.86       dsl LIBKERN_INLINE int imin(int, int) __unused;
     53  1.130  riastrad LIBKERN_INLINE u_int uimax(u_int, u_int) __unused;
     54  1.130  riastrad LIBKERN_INLINE u_int uimin(u_int, u_int) __unused;
     55   1.86       dsl LIBKERN_INLINE long lmax(long, long) __unused;
     56   1.86       dsl LIBKERN_INLINE long lmin(long, long) __unused;
     57   1.86       dsl LIBKERN_INLINE u_long ulmax(u_long, u_long) __unused;
     58   1.86       dsl LIBKERN_INLINE u_long ulmin(u_long, u_long) __unused;
     59   1.86       dsl LIBKERN_INLINE int abs(int) __unused;
     60  1.113     joerg LIBKERN_INLINE long labs(long) __unused;
     61  1.113     joerg LIBKERN_INLINE long long llabs(long long) __unused;
     62  1.113     joerg LIBKERN_INLINE intmax_t imaxabs(intmax_t) __unused;
     63   1.86       dsl 
     64   1.86       dsl LIBKERN_INLINE int isspace(int) __unused;
     65   1.86       dsl LIBKERN_INLINE int isascii(int) __unused;
     66   1.86       dsl LIBKERN_INLINE int isupper(int) __unused;
     67   1.86       dsl LIBKERN_INLINE int islower(int) __unused;
     68   1.86       dsl LIBKERN_INLINE int isalpha(int) __unused;
     69  1.114     lneto LIBKERN_INLINE int isalnum(int) __unused;
     70   1.86       dsl LIBKERN_INLINE int isdigit(int) __unused;
     71   1.86       dsl LIBKERN_INLINE int isxdigit(int) __unused;
     72  1.114     lneto LIBKERN_INLINE int iscntrl(int) __unused;
     73  1.114     lneto LIBKERN_INLINE int isgraph(int) __unused;
     74  1.114     lneto LIBKERN_INLINE int isprint(int) __unused;
     75  1.114     lneto LIBKERN_INLINE int ispunct(int) __unused;
     76   1.86       dsl LIBKERN_INLINE int toupper(int) __unused;
     77   1.86       dsl LIBKERN_INLINE int tolower(int) __unused;
     78   1.33   thorpej 
     79    1.7  christos #ifdef LIBKERN_BODY
     80    1.7  christos LIBKERN_INLINE int
     81   1.44      matt imax(int a, int b)
     82    1.1       cgd {
     83    1.1       cgd 	return (a > b ? a : b);
     84    1.1       cgd }
     85    1.7  christos LIBKERN_INLINE int
     86   1.44      matt imin(int a, int b)
     87    1.1       cgd {
     88    1.1       cgd 	return (a < b ? a : b);
     89    1.1       cgd }
     90    1.7  christos LIBKERN_INLINE long
     91   1.44      matt lmax(long a, long b)
     92    1.1       cgd {
     93    1.1       cgd 	return (a > b ? a : b);
     94    1.1       cgd }
     95    1.7  christos LIBKERN_INLINE long
     96   1.44      matt lmin(long a, long b)
     97    1.1       cgd {
     98    1.1       cgd 	return (a < b ? a : b);
     99    1.1       cgd }
    100    1.7  christos LIBKERN_INLINE u_int
    101  1.130  riastrad uimax(u_int a, u_int b)
    102    1.1       cgd {
    103    1.1       cgd 	return (a > b ? a : b);
    104    1.1       cgd }
    105    1.7  christos LIBKERN_INLINE u_int
    106  1.130  riastrad uimin(u_int a, u_int b)
    107    1.1       cgd {
    108    1.1       cgd 	return (a < b ? a : b);
    109    1.1       cgd }
    110    1.7  christos LIBKERN_INLINE u_long
    111   1.44      matt ulmax(u_long a, u_long b)
    112    1.1       cgd {
    113    1.1       cgd 	return (a > b ? a : b);
    114    1.1       cgd }
    115    1.7  christos LIBKERN_INLINE u_long
    116   1.44      matt ulmin(u_long a, u_long b)
    117    1.1       cgd {
    118    1.1       cgd 	return (a < b ? a : b);
    119    1.5       leo }
    120    1.5       leo 
    121    1.7  christos LIBKERN_INLINE int
    122   1.44      matt abs(int j)
    123    1.5       leo {
    124    1.5       leo 	return(j < 0 ? -j : j);
    125   1.33   thorpej }
    126   1.33   thorpej 
    127  1.113     joerg LIBKERN_INLINE long
    128  1.113     joerg labs(long j)
    129  1.113     joerg {
    130  1.113     joerg 	return(j < 0 ? -j : j);
    131  1.113     joerg }
    132  1.113     joerg 
    133  1.113     joerg LIBKERN_INLINE long long
    134  1.113     joerg llabs(long long j)
    135  1.113     joerg {
    136  1.113     joerg 	return(j < 0 ? -j : j);
    137  1.113     joerg }
    138  1.113     joerg 
    139  1.113     joerg LIBKERN_INLINE intmax_t
    140  1.113     joerg imaxabs(intmax_t j)
    141  1.113     joerg {
    142  1.113     joerg 	return(j < 0 ? -j : j);
    143  1.113     joerg }
    144  1.113     joerg 
    145   1.33   thorpej LIBKERN_INLINE int
    146   1.44      matt isspace(int ch)
    147   1.33   thorpej {
    148   1.33   thorpej 	return (ch == ' ' || (ch >= '\t' && ch <= '\r'));
    149   1.33   thorpej }
    150   1.33   thorpej 
    151   1.33   thorpej LIBKERN_INLINE int
    152   1.44      matt isascii(int ch)
    153   1.33   thorpej {
    154   1.33   thorpej 	return ((ch & ~0x7f) == 0);
    155   1.33   thorpej }
    156   1.33   thorpej 
    157   1.33   thorpej LIBKERN_INLINE int
    158   1.44      matt isupper(int ch)
    159   1.33   thorpej {
    160   1.33   thorpej 	return (ch >= 'A' && ch <= 'Z');
    161   1.33   thorpej }
    162   1.33   thorpej 
    163   1.33   thorpej LIBKERN_INLINE int
    164   1.44      matt islower(int ch)
    165   1.33   thorpej {
    166   1.33   thorpej 	return (ch >= 'a' && ch <= 'z');
    167   1.33   thorpej }
    168   1.33   thorpej 
    169   1.33   thorpej LIBKERN_INLINE int
    170   1.44      matt isalpha(int ch)
    171   1.33   thorpej {
    172   1.33   thorpej 	return (isupper(ch) || islower(ch));
    173   1.33   thorpej }
    174   1.33   thorpej 
    175   1.33   thorpej LIBKERN_INLINE int
    176  1.114     lneto isalnum(int ch)
    177  1.114     lneto {
    178  1.114     lneto 	return (isalpha(ch) || isdigit(ch));
    179  1.114     lneto }
    180  1.114     lneto 
    181  1.114     lneto LIBKERN_INLINE int
    182   1.44      matt isdigit(int ch)
    183   1.33   thorpej {
    184   1.33   thorpej 	return (ch >= '0' && ch <= '9');
    185   1.33   thorpej }
    186   1.33   thorpej 
    187   1.33   thorpej LIBKERN_INLINE int
    188   1.44      matt isxdigit(int ch)
    189   1.33   thorpej {
    190   1.33   thorpej 	return (isdigit(ch) ||
    191   1.33   thorpej 	    (ch >= 'A' && ch <= 'F') ||
    192   1.33   thorpej 	    (ch >= 'a' && ch <= 'f'));
    193   1.33   thorpej }
    194   1.33   thorpej 
    195   1.33   thorpej LIBKERN_INLINE int
    196  1.114     lneto iscntrl(int ch)
    197  1.114     lneto {
    198  1.114     lneto 	return ((ch >= 0x00 && ch <= 0x1F) || ch == 0x7F);
    199  1.114     lneto }
    200  1.114     lneto 
    201  1.114     lneto LIBKERN_INLINE int
    202  1.114     lneto isgraph(int ch)
    203  1.114     lneto {
    204  1.114     lneto 	return (ch != ' ' && isprint(ch));
    205  1.114     lneto }
    206  1.114     lneto 
    207  1.114     lneto LIBKERN_INLINE int
    208  1.114     lneto isprint(int ch)
    209  1.114     lneto {
    210  1.114     lneto 	return (ch >= 0x20 && ch <= 0x7E);
    211  1.114     lneto }
    212  1.114     lneto 
    213  1.114     lneto LIBKERN_INLINE int
    214  1.114     lneto ispunct(int ch)
    215  1.114     lneto {
    216  1.114     lneto 	return (isprint(ch) && ch != ' ' && !isalnum(ch));
    217  1.114     lneto }
    218  1.114     lneto 
    219  1.114     lneto LIBKERN_INLINE int
    220   1.44      matt toupper(int ch)
    221   1.33   thorpej {
    222   1.33   thorpej 	if (islower(ch))
    223   1.33   thorpej 		return (ch - 0x20);
    224   1.33   thorpej 	return (ch);
    225   1.33   thorpej }
    226   1.33   thorpej 
    227   1.33   thorpej LIBKERN_INLINE int
    228   1.44      matt tolower(int ch)
    229   1.33   thorpej {
    230   1.33   thorpej 	if (isupper(ch))
    231   1.33   thorpej 		return (ch + 0x20);
    232   1.33   thorpej 	return (ch);
    233    1.1       cgd }
    234    1.7  christos #endif
    235    1.1       cgd 
    236   1.64      matt #define	__NULL_STMT		do { } while (/* CONSTCOND */ 0)
    237   1.59    dyoung 
    238  1.101       jym #define __KASSERTSTR  "kernel %sassertion \"%s\" failed: file \"%s\", line %d "
    239  1.101       jym 
    240    1.9       cgd #ifdef NDEBUG						/* tradition! */
    241    1.9       cgd #define	assert(e)	((void)0)
    242   1.10       cgd #else
    243   1.30   thorpej #define	assert(e)	(__predict_true((e)) ? (void)0 :		    \
    244  1.102  christos 			    kern_assert(__KASSERTSTR, "", #e, __FILE__, __LINE__))
    245    1.9       cgd #endif
    246    1.9       cgd 
    247   1.61  christos #ifdef __COVERITY__
    248   1.61  christos #ifndef DIAGNOSTIC
    249   1.61  christos #define DIAGNOSTIC
    250   1.61  christos #endif
    251   1.61  christos #endif
    252   1.61  christos 
    253  1.111     pooka #ifndef	CTASSERT
    254   1.97      matt #define	CTASSERT(x)		__CTASSERT(x)
    255  1.111     pooka #endif
    256  1.111     pooka #ifndef	CTASSERT_SIGNED
    257  1.105     rmind #define	CTASSERT_SIGNED(x)	__CTASSERT(((typeof(x))-1) < 0)
    258  1.111     pooka #endif
    259  1.111     pooka #ifndef	CTASSERT_UNSIGNED
    260  1.105     rmind #define	CTASSERT_UNSIGNED(x)	__CTASSERT(((typeof(x))-1) >= 0)
    261  1.111     pooka #endif
    262   1.80      matt 
    263   1.61  christos #ifndef DIAGNOSTIC
    264   1.52  christos #define _DIAGASSERT(a)	(void)0
    265   1.34     lukem #ifdef lint
    266  1.101       jym #define	KASSERTMSG(e, msg, ...)	/* NOTHING */
    267   1.81      matt #define	KASSERT(e)		/* NOTHING */
    268   1.34     lukem #else /* !lint */
    269  1.101       jym #define	KASSERTMSG(e, msg, ...)	((void)0)
    270   1.81      matt #define	KASSERT(e)		((void)0)
    271   1.34     lukem #endif /* !lint */
    272   1.61  christos #else /* DIAGNOSTIC */
    273   1.52  christos #define _DIAGASSERT(a)	assert(a)
    274  1.101       jym #define	KASSERTMSG(e, msg, ...)		\
    275  1.101       jym 			(__predict_true((e)) ? (void)0 :		    \
    276  1.102  christos 			    kern_assert(__KASSERTSTR msg, "diagnostic ", #e,	    \
    277  1.101       jym 				__FILE__, __LINE__, ## __VA_ARGS__))
    278  1.101       jym 
    279   1.30   thorpej #define	KASSERT(e)	(__predict_true((e)) ? (void)0 :		    \
    280  1.102  christos 			    kern_assert(__KASSERTSTR, "diagnostic ", #e,	    \
    281  1.101       jym 				__FILE__, __LINE__))
    282    1.9       cgd #endif
    283    1.9       cgd 
    284    1.9       cgd #ifndef DEBUG
    285   1.34     lukem #ifdef lint
    286  1.101       jym #define	KDASSERTMSG(e,msg, ...)	/* NOTHING */
    287   1.96      matt #define	KDASSERT(e)		/* NOTHING */
    288   1.34     lukem #else /* lint */
    289  1.101       jym #define	KDASSERTMSG(e,msg, ...)	((void)0)
    290   1.96      matt #define	KDASSERT(e)		((void)0)
    291   1.34     lukem #endif /* lint */
    292    1.9       cgd #else
    293  1.101       jym #define	KDASSERTMSG(e, msg, ...)	\
    294  1.101       jym 			(__predict_true((e)) ? (void)0 :		    \
    295  1.102  christos 			    kern_assert(__KASSERTSTR msg, "debugging ", #e,	    \
    296  1.101       jym 				__FILE__, __LINE__, ## __VA_ARGS__))
    297  1.101       jym 
    298   1.30   thorpej #define	KDASSERT(e)	(__predict_true((e)) ? (void)0 :		    \
    299  1.102  christos 			    kern_assert(__KASSERTSTR, "debugging ", #e,	    \
    300  1.101       jym 				__FILE__, __LINE__))
    301    1.9       cgd #endif
    302  1.101       jym 
    303   1.53  christos /*
    304   1.53  christos  * XXX: For compatibility we use SMALL_RANDOM by default.
    305   1.53  christos  */
    306   1.53  christos #define SMALL_RANDOM
    307   1.19   thorpej 
    308   1.31   msaitoh #ifndef offsetof
    309   1.98      matt #if __GNUC_PREREQ__(4, 0)
    310   1.98      matt #define offsetof(type, member)	__builtin_offsetof(type, member)
    311   1.98      matt #else
    312   1.47  christos #define	offsetof(type, member) \
    313   1.47  christos     ((size_t)(unsigned long)(&(((type *)0)->member)))
    314   1.31   msaitoh #endif
    315   1.98      matt #endif
    316    1.9       cgd 
    317  1.118  riastrad /*
    318  1.118  riastrad  * Return the container of an embedded struct.  Given x = &c->f,
    319  1.118  riastrad  * container_of(x, T, f) yields c, where T is the type of c.  Example:
    320  1.118  riastrad  *
    321  1.118  riastrad  *	struct foo { ... };
    322  1.118  riastrad  *	struct bar {
    323  1.118  riastrad  *		int b_x;
    324  1.118  riastrad  *		struct foo b_foo;
    325  1.118  riastrad  *		...
    326  1.118  riastrad  *	};
    327  1.118  riastrad  *
    328  1.118  riastrad  *	struct bar b;
    329  1.118  riastrad  *	struct foo *fp = b.b_foo;
    330  1.118  riastrad  *
    331  1.118  riastrad  * Now we can get at b from fp by:
    332  1.118  riastrad  *
    333  1.118  riastrad  *	struct bar *bp = container_of(fp, struct bar, b_foo);
    334  1.118  riastrad  *
    335  1.118  riastrad  * The 0*sizeof((PTR) - ...) causes the compiler to warn if the type of
    336  1.118  riastrad  * *fp does not match the type of struct bar::b_foo.
    337  1.119  christos  * We skip the validation for coverity runs to avoid warnings.
    338  1.118  riastrad  */
    339  1.119  christos #ifdef __COVERITY__
    340  1.119  christos #define __validate_container_of(PTR, TYPE, FIELD) 0
    341  1.123       rtr #define __validate_const_container_of(PTR, TYPE, FIELD) 0
    342  1.119  christos #else
    343  1.119  christos #define __validate_container_of(PTR, TYPE, FIELD)			\
    344  1.119  christos     (0 * sizeof((PTR) - &((TYPE *)(((char *)(PTR)) -			\
    345  1.119  christos     offsetof(TYPE, FIELD)))->FIELD))
    346  1.123       rtr #define __validate_const_container_of(PTR, TYPE, FIELD)			\
    347  1.123       rtr     (0 * sizeof((PTR) - &((const TYPE *)(((const char *)(PTR)) -	\
    348  1.123       rtr     offsetof(TYPE, FIELD)))->FIELD))
    349  1.119  christos #endif
    350  1.119  christos 
    351  1.118  riastrad #define	container_of(PTR, TYPE, FIELD)					\
    352  1.119  christos     ((TYPE *)(((char *)(PTR)) - offsetof(TYPE, FIELD))			\
    353  1.119  christos 	+ __validate_container_of(PTR, TYPE, FIELD))
    354  1.123       rtr #define	const_container_of(PTR, TYPE, FIELD)				\
    355  1.123       rtr     ((const TYPE *)(((const char *)(PTR)) - offsetof(TYPE, FIELD))	\
    356  1.123       rtr 	+ __validate_const_container_of(PTR, TYPE, FIELD))
    357  1.118  riastrad 
    358   1.73      matt #define	MTPRNG_RLEN		624
    359   1.73      matt struct mtprng_state {
    360  1.124   msaitoh 	unsigned int mt_idx;
    361   1.73      matt 	uint32_t mt_elem[MTPRNG_RLEN];
    362   1.75      matt 	uint32_t mt_count;
    363   1.74      matt 	uint32_t mt_sparse[3];
    364   1.73      matt };
    365   1.73      matt 
    366   1.38   thorpej /* Prototypes for which GCC built-ins exist. */
    367   1.86       dsl void	*memcpy(void *, const void *, size_t);
    368   1.86       dsl int	 memcmp(const void *, const void *, size_t);
    369   1.86       dsl void	*memset(void *, int, size_t);
    370  1.127  christos void	*memmem(const void *, size_t, const void *, size_t);
    371  1.103       chs #if __GNUC_PREREQ__(2, 95) && !defined(_STANDALONE)
    372  1.128      maxv #if defined(_KERNEL) && defined(KASAN)
    373  1.128      maxv void	*kasan_memset(void *, int, size_t);
    374  1.129      maxv int	 kasan_memcmp(const void *, const void *, size_t);
    375  1.128      maxv void	*kasan_memcpy(void *, const void *, size_t);
    376  1.128      maxv #define	memcpy(d, s, l)		kasan_memcpy(d, s, l)
    377  1.128      maxv #define	memcmp(a, b, l)		kasan_memcmp(a, b, l)
    378  1.128      maxv #define	memset(d, v, l)		kasan_memset(d, v, l)
    379  1.128      maxv #else
    380   1.38   thorpej #define	memcpy(d, s, l)		__builtin_memcpy(d, s, l)
    381   1.38   thorpej #define	memcmp(a, b, l)		__builtin_memcmp(a, b, l)
    382   1.38   thorpej #define	memset(d, v, l)		__builtin_memset(d, v, l)
    383  1.128      maxv #endif /* _KERNEL && KASAN */
    384   1.38   thorpej #endif
    385   1.38   thorpej 
    386   1.86       dsl char	*strcpy(char *, const char *);
    387   1.86       dsl int	 strcmp(const char *, const char *);
    388   1.86       dsl size_t	 strlen(const char *);
    389   1.99       jym size_t	 strnlen(const char *, size_t);
    390   1.56    dyoung char	*strsep(char **, const char *);
    391   1.88   tsutsui #if __GNUC_PREREQ__(2, 95) && !defined(_STANDALONE)
    392  1.129      maxv #if defined(_KERNEL) && defined(KASAN)
    393  1.129      maxv char	*kasan_strcpy(char *, const char *);
    394  1.129      maxv int	 kasan_strcmp(const char *, const char *);
    395  1.129      maxv size_t	 kasan_strlen(const char *);
    396  1.129      maxv #define	strcpy(d, s)		kasan_strcpy(d, s)
    397  1.129      maxv #define	strcmp(a, b)		kasan_strcmp(a, b)
    398  1.129      maxv #define	strlen(a)		kasan_strlen(a)
    399  1.129      maxv #else
    400   1.38   thorpej #define	strcpy(d, s)		__builtin_strcpy(d, s)
    401   1.38   thorpej #define	strcmp(a, b)		__builtin_strcmp(a, b)
    402   1.38   thorpej #define	strlen(a)		__builtin_strlen(a)
    403  1.129      maxv #endif /* _KERNEL && KASAN */
    404   1.39   thorpej #endif
    405   1.39   thorpej 
    406   1.39   thorpej /* Functions for which we always use built-ins. */
    407   1.39   thorpej #ifdef __GNUC__
    408   1.39   thorpej #define	alloca(s)		__builtin_alloca(s)
    409   1.38   thorpej #endif
    410   1.38   thorpej 
    411   1.38   thorpej /* These exist in GCC 3.x, but we don't bother. */
    412   1.86       dsl char	*strcat(char *, const char *);
    413  1.114     lneto size_t	 strcspn(const char *, const char *);
    414   1.86       dsl char	*strncpy(char *, const char *, size_t);
    415  1.112  christos char	*strncat(char *, const char *, size_t);
    416   1.86       dsl int	 strncmp(const char *, const char *, size_t);
    417   1.86       dsl char	*strchr(const char *, int);
    418   1.86       dsl char	*strrchr(const char *, int);
    419   1.86       dsl char	*strstr(const char *, const char *);
    420  1.114     lneto char	*strpbrk(const char *, const char *);
    421  1.114     lneto size_t	 strspn(const char *, const char *);
    422   1.38   thorpej 
    423   1.42     ragge /*
    424   1.42     ragge  * ffs is an instruction on vax.
    425   1.42     ragge  */
    426   1.86       dsl int	 ffs(int);
    427   1.69      matt #if __GNUC_PREREQ__(2, 95) && (!defined(__vax__) || __GNUC_PREREQ__(4,1))
    428   1.63      matt #define	ffs(x)		__builtin_ffs(x)
    429   1.41   thorpej #endif
    430   1.38   thorpej 
    431  1.102  christos void	 kern_assert(const char *, ...)
    432  1.102  christos     __attribute__((__format__(__printf__, 1, 2)));
    433   1.28    simonb u_int32_t
    434   1.86       dsl 	inet_addr(const char *);
    435   1.52  christos struct in_addr;
    436   1.86       dsl int	inet_aton(const char *, struct in_addr *);
    437   1.86       dsl char	*intoa(u_int32_t);
    438   1.28    simonb #define inet_ntoa(a) intoa((a).s_addr)
    439   1.86       dsl void	*memchr(const void *, int, size_t);
    440   1.86       dsl void	*memmove(void *, const void *, size_t);
    441   1.86       dsl int	 pmatch(const char *, const char *, const char **);
    442   1.53  christos #ifndef SMALL_RANDOM
    443   1.86       dsl void	 srandom(unsigned long);
    444   1.86       dsl char	*initstate(unsigned long, char *, size_t);
    445   1.86       dsl char	*setstate(char *);
    446   1.53  christos #endif /* SMALL_RANDOM */
    447   1.86       dsl long	 random(void);
    448  1.110     joerg void	 mi_vector_hash(const void * __restrict, size_t, uint32_t,
    449  1.110     joerg 	    uint32_t[3]);
    450   1.74      matt void	 mtprng_init32(struct mtprng_state *, uint32_t);
    451   1.74      matt void	 mtprng_initarray(struct mtprng_state *, const uint32_t *, size_t);
    452   1.74      matt uint32_t mtprng_rawrandom(struct mtprng_state *);
    453   1.74      matt uint32_t mtprng_random(struct mtprng_state *);
    454   1.86       dsl int	 scanc(u_int, const u_char *, const u_char *, int);
    455   1.86       dsl int	 skpc(int, size_t, u_char *);
    456   1.86       dsl int	 strcasecmp(const char *, const char *);
    457   1.86       dsl size_t	 strlcpy(char *, const char *, size_t);
    458   1.86       dsl size_t	 strlcat(char *, const char *, size_t);
    459   1.86       dsl int	 strncasecmp(const char *, const char *, size_t);
    460   1.86       dsl u_long	 strtoul(const char *, char **, int);
    461   1.86       dsl long long strtoll(const char *, char **, int);
    462   1.86       dsl unsigned long long strtoull(const char *, char **, int);
    463  1.109     lneto intmax_t  strtoimax(const char *, char **, int);
    464   1.86       dsl uintmax_t strtoumax(const char *, char **, int);
    465  1.117  christos intmax_t strtoi(const char * __restrict, char ** __restrict, int, intmax_t,
    466  1.117  christos     intmax_t, int *);
    467  1.117  christos uintmax_t strtou(const char * __restrict, char ** __restrict, int, uintmax_t,
    468  1.117  christos     uintmax_t, int *);
    469  1.126  christos void	 hexdump(void (*)(const char *, ...) __printflike(1, 2),
    470  1.126  christos     const char *, const void *, size_t);
    471  1.117  christos 
    472   1.86       dsl int	 snprintb(char *, size_t, const char *, uint64_t);
    473   1.91  pgoyette int	 snprintb_m(char *, size_t, const char *, uint64_t, size_t);
    474   1.84        ad int	 kheapsort(void *, size_t, size_t, int (*)(const void *, const void *),
    475   1.84        ad 		   void *);
    476   1.90       tls uint32_t crc32(uint32_t, const uint8_t *, size_t);
    477  1.120      matt #if __GNUC_PREREQ__(4, 5) \
    478  1.120      matt     && (defined(__alpha_cix__) || defined(__mips_popcount))
    479  1.120      matt #define	popcount	__builtin_popcount
    480  1.120      matt #define	popcountl	__builtin_popcountl
    481  1.120      matt #define	popcountll	__builtin_popcountll
    482  1.120      matt #define	popcount32	__builtin_popcount
    483  1.120      matt #define	popcount64	__builtin_popcountll
    484  1.120      matt #else
    485   1.92     joerg unsigned int	popcount(unsigned int) __constfunc;
    486   1.92     joerg unsigned int	popcountl(unsigned long) __constfunc;
    487   1.92     joerg unsigned int	popcountll(unsigned long long) __constfunc;
    488   1.92     joerg unsigned int	popcount32(uint32_t) __constfunc;
    489   1.92     joerg unsigned int	popcount64(uint64_t) __constfunc;
    490  1.120      matt #endif
    491  1.106  drochner 
    492  1.108  riastrad void	*explicit_memset(void *, int, size_t);
    493  1.107  riastrad int	consttime_memequal(const void *, const void *, size_t);
    494  1.122  christos int	strnvisx(char *, size_t, const char *, size_t, int);
    495  1.122  christos #define VIS_OCTAL	0x01
    496  1.122  christos #define VIS_SAFE	0x20
    497  1.122  christos #define VIS_TRIM	0x40
    498  1.115       tls 
    499  1.115       tls #ifdef notyet
    500  1.115       tls /*
    501  1.115       tls  * LZF hashtable/state size: on uncompressible data and on a system with
    502  1.115       tls  * a sufficiently large d-cache, a larger table produces a considerable
    503  1.115       tls  * speed benefit.  On systems with small memory and caches, however...
    504  1.115       tls  */
    505  1.115       tls #if defined(__vax__) || defined(__m68k__)
    506  1.115       tls #define LZF_HLOG 14
    507  1.115       tls #else
    508  1.115       tls #define LZF_HLOG 15
    509  1.115       tls #endif
    510  1.115       tls typedef const uint8_t *LZF_STATE[1 << LZF_HLOG];
    511  1.115       tls 
    512  1.115       tls unsigned int lzf_compress_r (const void *const, unsigned int, void *,
    513  1.115       tls 			     unsigned int, LZF_STATE);
    514  1.115       tls unsigned int lzf_decompress (const void *const, unsigned int, void *,
    515  1.115       tls 			     unsigned int);
    516  1.115       tls #endif
    517  1.115       tls 
    518   1.29    simonb #endif /* !_LIB_LIBKERN_LIBKERN_H_ */
    519