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