Home | History | Annotate | Line # | Download | only in libkern
libkern.h revision 1.55.4.2
      1  1.55.4.2      elad /*	$NetBSD: libkern.h,v 1.55.4.2 2006/05/11 23:31:08 elad 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.1       cgd #include <sys/types.h>
     38  1.55.4.2      elad #include <sys/inttypes.h>
     39      1.52  christos #include <sys/null.h>
     40       1.4       cgd 
     41       1.7  christos #ifndef LIBKERN_INLINE
     42      1.55     perry #define LIBKERN_INLINE	static __inline
     43       1.7  christos #define LIBKERN_BODY
     44       1.7  christos #endif
     45       1.7  christos 
     46      1.14       cgd LIBKERN_INLINE int imax __P((int, int)) __attribute__ ((unused));
     47      1.14       cgd LIBKERN_INLINE int imin __P((int, int)) __attribute__ ((unused));
     48      1.14       cgd LIBKERN_INLINE u_int max __P((u_int, u_int)) __attribute__ ((unused));
     49      1.14       cgd LIBKERN_INLINE u_int min __P((u_int, u_int)) __attribute__ ((unused));
     50      1.14       cgd LIBKERN_INLINE long lmax __P((long, long)) __attribute__ ((unused));
     51      1.14       cgd LIBKERN_INLINE long lmin __P((long, long)) __attribute__ ((unused));
     52      1.14       cgd LIBKERN_INLINE u_long ulmax __P((u_long, u_long)) __attribute__ ((unused));
     53      1.14       cgd LIBKERN_INLINE u_long ulmin __P((u_long, u_long)) __attribute__ ((unused));
     54      1.14       cgd LIBKERN_INLINE int abs __P((int)) __attribute__ ((unused));
     55       1.1       cgd 
     56      1.33   thorpej LIBKERN_INLINE int isspace __P((int)) __attribute__((__unused__));
     57      1.33   thorpej LIBKERN_INLINE int isascii __P((int)) __attribute__((__unused__));
     58      1.33   thorpej LIBKERN_INLINE int isupper __P((int)) __attribute__((__unused__));
     59      1.33   thorpej LIBKERN_INLINE int islower __P((int)) __attribute__((__unused__));
     60      1.33   thorpej LIBKERN_INLINE int isalpha __P((int)) __attribute__((__unused__));
     61      1.33   thorpej LIBKERN_INLINE int isdigit __P((int)) __attribute__((__unused__));
     62      1.33   thorpej LIBKERN_INLINE int isxdigit __P((int)) __attribute__((__unused__));
     63      1.33   thorpej LIBKERN_INLINE int toupper __P((int)) __attribute__((__unused__));
     64      1.33   thorpej LIBKERN_INLINE int tolower __P((int)) __attribute__((__unused__));
     65      1.33   thorpej 
     66       1.7  christos #ifdef LIBKERN_BODY
     67       1.7  christos LIBKERN_INLINE int
     68      1.44      matt imax(int a, int b)
     69       1.1       cgd {
     70       1.1       cgd 	return (a > b ? a : b);
     71       1.1       cgd }
     72       1.7  christos LIBKERN_INLINE int
     73      1.44      matt imin(int a, int 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.44      matt lmax(long a, long b)
     79       1.1       cgd {
     80       1.1       cgd 	return (a > b ? a : b);
     81       1.1       cgd }
     82       1.7  christos LIBKERN_INLINE long
     83      1.44      matt lmin(long a, long b)
     84       1.1       cgd {
     85       1.1       cgd 	return (a < b ? a : b);
     86       1.1       cgd }
     87       1.7  christos LIBKERN_INLINE u_int
     88      1.44      matt max(u_int a, u_int b)
     89       1.1       cgd {
     90       1.1       cgd 	return (a > b ? a : b);
     91       1.1       cgd }
     92       1.7  christos LIBKERN_INLINE u_int
     93      1.44      matt min(u_int a, u_int b)
     94       1.1       cgd {
     95       1.1       cgd 	return (a < b ? a : b);
     96       1.1       cgd }
     97       1.7  christos LIBKERN_INLINE u_long
     98      1.44      matt ulmax(u_long a, u_long b)
     99       1.1       cgd {
    100       1.1       cgd 	return (a > b ? a : b);
    101       1.1       cgd }
    102       1.7  christos LIBKERN_INLINE u_long
    103      1.44      matt ulmin(u_long a, u_long 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.44      matt abs(int j)
    110       1.5       leo {
    111       1.5       leo 	return(j < 0 ? -j : j);
    112      1.33   thorpej }
    113      1.33   thorpej 
    114      1.33   thorpej LIBKERN_INLINE int
    115      1.44      matt isspace(int ch)
    116      1.33   thorpej {
    117      1.33   thorpej 	return (ch == ' ' || (ch >= '\t' && ch <= '\r'));
    118      1.33   thorpej }
    119      1.33   thorpej 
    120      1.33   thorpej LIBKERN_INLINE int
    121      1.44      matt isascii(int ch)
    122      1.33   thorpej {
    123      1.33   thorpej 	return ((ch & ~0x7f) == 0);
    124      1.33   thorpej }
    125      1.33   thorpej 
    126      1.33   thorpej LIBKERN_INLINE int
    127      1.44      matt isupper(int ch)
    128      1.33   thorpej {
    129      1.33   thorpej 	return (ch >= 'A' && ch <= 'Z');
    130      1.33   thorpej }
    131      1.33   thorpej 
    132      1.33   thorpej LIBKERN_INLINE int
    133      1.44      matt islower(int ch)
    134      1.33   thorpej {
    135      1.33   thorpej 	return (ch >= 'a' && ch <= 'z');
    136      1.33   thorpej }
    137      1.33   thorpej 
    138      1.33   thorpej LIBKERN_INLINE int
    139      1.44      matt isalpha(int ch)
    140      1.33   thorpej {
    141      1.33   thorpej 	return (isupper(ch) || islower(ch));
    142      1.33   thorpej }
    143      1.33   thorpej 
    144      1.33   thorpej LIBKERN_INLINE int
    145      1.44      matt isdigit(int ch)
    146      1.33   thorpej {
    147      1.33   thorpej 	return (ch >= '0' && ch <= '9');
    148      1.33   thorpej }
    149      1.33   thorpej 
    150      1.33   thorpej LIBKERN_INLINE int
    151      1.44      matt isxdigit(int ch)
    152      1.33   thorpej {
    153      1.33   thorpej 	return (isdigit(ch) ||
    154      1.33   thorpej 	    (ch >= 'A' && ch <= 'F') ||
    155      1.33   thorpej 	    (ch >= 'a' && ch <= 'f'));
    156      1.33   thorpej }
    157      1.33   thorpej 
    158      1.33   thorpej LIBKERN_INLINE int
    159      1.44      matt toupper(int ch)
    160      1.33   thorpej {
    161      1.33   thorpej 	if (islower(ch))
    162      1.33   thorpej 		return (ch - 0x20);
    163      1.33   thorpej 	return (ch);
    164      1.33   thorpej }
    165      1.33   thorpej 
    166      1.33   thorpej LIBKERN_INLINE int
    167      1.44      matt tolower(int ch)
    168      1.33   thorpej {
    169      1.33   thorpej 	if (isupper(ch))
    170      1.33   thorpej 		return (ch + 0x20);
    171      1.33   thorpej 	return (ch);
    172       1.1       cgd }
    173       1.7  christos #endif
    174       1.1       cgd 
    175  1.55.4.1      elad /*
    176  1.55.4.1      elad  * Return the number of elements in a statically-allocated array,
    177  1.55.4.1      elad  * __x.
    178  1.55.4.1      elad  */
    179  1.55.4.1      elad #define	__arraycount(__x)	(sizeof(__x) / sizeof(__x[0]))
    180  1.55.4.1      elad 
    181  1.55.4.1      elad /* __BIT(n): nth bit, where __BIT(0) == 0x1. */
    182  1.55.4.1      elad #define	__BIT(__n) (((__n) == 32) ? 0 : ((uint32_t)1 << (__n)))
    183  1.55.4.1      elad 
    184  1.55.4.1      elad /* __BITS(m, n): bits m through n, m < n. */
    185  1.55.4.1      elad #define	__BITS(__m, __n)	\
    186  1.55.4.1      elad 	((__BIT(MAX((__m), (__n)) + 1) - 1) ^ (__BIT(MIN((__m), (__n))) - 1))
    187  1.55.4.1      elad 
    188  1.55.4.1      elad /* find least significant bit that is set */
    189  1.55.4.1      elad #define	__LOWEST_SET_BIT(__mask) ((((__mask) - 1) & (__mask)) ^ (__mask))
    190  1.55.4.1      elad 
    191  1.55.4.1      elad #define	SHIFTOUT(__x, __mask) (((__x) & (__mask)) / __LOWEST_SET_BIT(__mask))
    192  1.55.4.1      elad #define	SHIFTIN(__x, __mask) ((__x) * __LOWEST_SET_BIT(__mask))
    193  1.55.4.1      elad #define	SHIFTOUT_MASK(__mask) SHIFTOUT((__mask), (__mask))
    194  1.55.4.1      elad 
    195       1.9       cgd #ifdef NDEBUG						/* tradition! */
    196       1.9       cgd #define	assert(e)	((void)0)
    197      1.10       cgd #else
    198       1.9       cgd #ifdef __STDC__
    199      1.30   thorpej #define	assert(e)	(__predict_true((e)) ? (void)0 :		    \
    200       1.9       cgd 			    __assert("", __FILE__, __LINE__, #e))
    201       1.9       cgd #else
    202      1.30   thorpej #define	assert(e)	(__predict_true((e)) ? (void)0 :		    \
    203       1.9       cgd 			    __assert("", __FILE__, __LINE__, "e"))
    204       1.9       cgd #endif
    205       1.9       cgd #endif
    206       1.9       cgd 
    207  1.55.4.1      elad #ifdef __COVERITY__
    208  1.55.4.1      elad #ifndef DIAGNOSTIC
    209  1.55.4.1      elad #define DIAGNOSTIC
    210  1.55.4.1      elad #endif
    211  1.55.4.1      elad #endif
    212  1.55.4.1      elad 
    213       1.9       cgd #ifndef DIAGNOSTIC
    214      1.52  christos #define _DIAGASSERT(a)	(void)0
    215      1.34     lukem #ifdef lint
    216      1.34     lukem #define	KASSERT(e)	/* NOTHING */
    217      1.34     lukem #else /* !lint */
    218       1.9       cgd #define	KASSERT(e)	((void)0)
    219      1.34     lukem #endif /* !lint */
    220      1.52  christos #else /* DIAGNOSTIC */
    221      1.52  christos #define _DIAGASSERT(a)	assert(a)
    222       1.9       cgd #ifdef __STDC__
    223      1.30   thorpej #define	KASSERT(e)	(__predict_true((e)) ? (void)0 :		    \
    224       1.9       cgd 			    __assert("diagnostic ", __FILE__, __LINE__, #e))
    225       1.9       cgd #else
    226      1.30   thorpej #define	KASSERT(e)	(__predict_true((e)) ? (void)0 :		    \
    227       1.9       cgd 			    __assert("diagnostic ", __FILE__, __LINE__, "e"))
    228       1.9       cgd #endif
    229       1.9       cgd #endif
    230       1.9       cgd 
    231       1.9       cgd #ifndef DEBUG
    232      1.34     lukem #ifdef lint
    233      1.34     lukem #define	KDASSERT(e)	/* NOTHING */
    234      1.34     lukem #else /* lint */
    235       1.9       cgd #define	KDASSERT(e)	((void)0)
    236      1.34     lukem #endif /* lint */
    237       1.9       cgd #else
    238       1.9       cgd #ifdef __STDC__
    239      1.30   thorpej #define	KDASSERT(e)	(__predict_true((e)) ? (void)0 :		    \
    240       1.9       cgd 			    __assert("debugging ", __FILE__, __LINE__, #e))
    241       1.9       cgd #else
    242      1.30   thorpej #define	KDASSERT(e)	(__predict_true((e)) ? (void)0 :		    \
    243       1.9       cgd 			    __assert("debugging ", __FILE__, __LINE__, "e"))
    244       1.9       cgd #endif
    245       1.9       cgd #endif
    246      1.53  christos /*
    247      1.53  christos  * XXX: For compatibility we use SMALL_RANDOM by default.
    248      1.53  christos  */
    249      1.53  christos #define SMALL_RANDOM
    250      1.19   thorpej 
    251      1.31   msaitoh #ifndef offsetof
    252      1.47  christos #define	offsetof(type, member) \
    253      1.47  christos     ((size_t)(unsigned long)(&(((type *)0)->member)))
    254      1.31   msaitoh #endif
    255       1.9       cgd 
    256       1.1       cgd /* Prototypes for non-quad routines. */
    257      1.37     perry /* XXX notyet #ifdef _STANDALONE */
    258      1.36    simonb int	 bcmp __P((const void *, const void *, size_t));
    259      1.36    simonb void	 bzero __P((void *, size_t));
    260      1.37     perry /* #endif */
    261      1.38   thorpej 
    262      1.38   thorpej /* Prototypes for which GCC built-ins exist. */
    263      1.38   thorpej void	*memcpy __P((void *, const void *, size_t));
    264      1.38   thorpej int	 memcmp __P((const void *, const void *, size_t));
    265      1.38   thorpej void	*memset __P((void *, int, size_t));
    266      1.50     ragge #if __GNUC_PREREQ__(2, 95) && !defined(__vax__)
    267      1.38   thorpej #define	memcpy(d, s, l)		__builtin_memcpy(d, s, l)
    268      1.38   thorpej #define	memcmp(a, b, l)		__builtin_memcmp(a, b, l)
    269      1.38   thorpej #define	memset(d, v, l)		__builtin_memset(d, v, l)
    270      1.38   thorpej #endif
    271      1.38   thorpej 
    272      1.38   thorpej char	*strcpy __P((char *, const char *));
    273      1.38   thorpej int	 strcmp __P((const char *, const char *));
    274      1.38   thorpej size_t	 strlen __P((const char *));
    275  1.55.4.1      elad char	*strsep(char **, const char *);
    276      1.38   thorpej #if __GNUC_PREREQ__(2, 95)
    277      1.38   thorpej #define	strcpy(d, s)		__builtin_strcpy(d, s)
    278      1.38   thorpej #define	strcmp(a, b)		__builtin_strcmp(a, b)
    279      1.38   thorpej #define	strlen(a)		__builtin_strlen(a)
    280      1.39   thorpej #endif
    281      1.39   thorpej 
    282      1.39   thorpej /* Functions for which we always use built-ins. */
    283      1.39   thorpej #ifdef __GNUC__
    284      1.39   thorpej #define	alloca(s)		__builtin_alloca(s)
    285      1.38   thorpej #endif
    286      1.38   thorpej 
    287      1.38   thorpej /* These exist in GCC 3.x, but we don't bother. */
    288      1.38   thorpej char	*strcat __P((char *, const char *));
    289      1.38   thorpej char	*strncpy __P((char *, const char *, size_t));
    290      1.38   thorpej int	 strncmp __P((const char *, const char *, size_t));
    291      1.38   thorpej char	*strchr __P((const char *, int));
    292      1.38   thorpej char	*strrchr __P((const char *, int));
    293      1.45  junyoung 
    294      1.45  junyoung char	*strstr __P((const char *, const char *));
    295      1.38   thorpej 
    296      1.42     ragge /*
    297      1.42     ragge  * ffs is an instruction on vax.
    298      1.42     ragge  */
    299      1.38   thorpej int	 ffs __P((int));
    300      1.43   thorpej #if __GNUC_PREREQ__(2, 95) && !defined(__vax__)
    301      1.41   thorpej #define	ffs(x)			__builtin_ffs(x)
    302      1.41   thorpej #endif
    303      1.38   thorpej 
    304       1.9       cgd void	 __assert __P((const char *, const char *, int, const char *))
    305       1.9       cgd 	    __attribute__((__noreturn__));
    306  1.55.4.1      elad unsigned int
    307  1.55.4.1      elad 	bcdtobin __P((unsigned int));
    308  1.55.4.1      elad unsigned int
    309  1.55.4.1      elad 	bintobcd __P((unsigned int));
    310      1.28    simonb u_int32_t
    311      1.52  christos 	inet_addr __P((const char *));
    312      1.52  christos struct in_addr;
    313      1.52  christos int	inet_aton __P((const char *, struct in_addr *));
    314      1.28    simonb char	*intoa __P((u_int32_t));
    315      1.28    simonb #define inet_ntoa(a) intoa((a).s_addr)
    316      1.15    mjacob void	*memchr __P((const void *, int, size_t));
    317      1.23     perry void	*memmove __P((void *, const void *, size_t));
    318      1.22  christos int	 pmatch __P((const char *, const char *, const char **));
    319      1.40    itojun u_int32_t arc4random __P((void));
    320      1.46       tls void	 arc4randbytes __P((void *, size_t));
    321      1.53  christos #ifndef SMALL_RANDOM
    322      1.53  christos void	 srandom __P((unsigned long));
    323      1.53  christos char	*initstate __P((unsigned long, char *, size_t));
    324      1.53  christos char	*setstate __P((char *));
    325      1.53  christos #endif /* SMALL_RANDOM */
    326      1.53  christos long	 random __P((void));
    327      1.11       cgd int	 scanc __P((u_int, const u_char *, const u_char *, int));
    328       1.7  christos int	 skpc __P((int, size_t, u_char *));
    329      1.32   thorpej int	 strcasecmp __P((const char *, const char *));
    330      1.48    itojun size_t	 strlcpy __P((char *, const char *, size_t));
    331      1.48    itojun size_t	 strlcat __P((char *, const char *, size_t));
    332      1.28    simonb int	 strncasecmp __P((const char *, const char *, size_t));
    333      1.28    simonb u_long	 strtoul __P((const char *, char **, int));
    334  1.55.4.2      elad uintmax_t strtoumax __P((const char *, char **, int));
    335      1.29    simonb #endif /* !_LIB_LIBKERN_LIBKERN_H_ */
    336