| | 1 | /*- |
| | 2 | * Copyright (c) 1992, 1993 |
| | 3 | * The Regents of the University of California. All rights reserved. |
| | 4 | * |
| | 5 | * Redistribution and use in source and binary forms, with or without |
| | 6 | * modification, are permitted provided that the following conditions |
| | 7 | * are met: |
| | 8 | * 1. Redistributions of source code must retain the above copyright |
| | 9 | * notice, this list of conditions and the following disclaimer. |
| | 10 | * 2. Redistributions in binary form must reproduce the above copyright |
| | 11 | * notice, this list of conditions and the following disclaimer in the |
| | 12 | * documentation and/or other materials provided with the distribution. |
| | 13 | * 3. All advertising materials mentioning features or use of this software |
| | 14 | * must display the following acknowledgement: |
| | 15 | * This product includes software developed by the University of |
| | 16 | * California, Berkeley and its contributors. |
| | 17 | * 4. Neither the name of the University nor the names of its contributors |
| | 18 | * may be used to endorse or promote products derived from this software |
| | 19 | * without specific prior written permission. |
| | 20 | * |
| | 21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| | 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| | 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| | 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| | 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| | 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| | 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| | 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| | 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| | 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| | 31 | * SUCH DAMAGE. |
| | 32 | * |
| | 33 | * @(#)libkern.h 8.1 (Berkeley) 6/10/93 |
| | 34 | * $FreeBSD: src/sys/sys/libkern.h,v 1.20.2.2 2001/09/30 21:12:54 luigi Exp $ |
| | 35 | * $DragonFly: src/sys/sys/libkern.h,v 1.7 2004/05/05 00:17:45 hsu Exp $ |
| | 36 | */ |
| | 37 | |
| | 38 | #ifndef _SYS_LIBKERN_H_ |
| | 39 | #define _SYS_LIBKERN_H_ |
| | 40 | |
| | 41 | #include <sys/cdefs.h> |
| | 42 | #include <sys/types.h> |
| | 43 | #ifdef _KERNEL |
| | 44 | #include <sys/systm.h> |
| | 45 | #endif |
| | 46 | |
| | 47 | /* BCD conversions. */ |
| | 48 | extern u_char const bcd2bin_data[]; |
| | 49 | extern u_char const bin2bcd_data[]; |
| | 50 | extern char const hex2ascii_data[]; |
| | 51 | |
| | 52 | #define bcd2bin(bcd) (bcd2bin_data[bcd]) |
| | 53 | #define bin2bcd(bin) (bin2bcd_data[bin]) |
| | 54 | #define hex2ascii(hex) (hex2ascii_data[hex]) |
| | 55 | |
| | 56 | static __inline int imax(int a, int b) { return (a > b ? a : b); } |
| | 57 | static __inline int imin(int a, int b) { return (a < b ? a : b); } |
| | 58 | static __inline long lmax(long a, long b) { return (a > b ? a : b); } |
| | 59 | static __inline long lmin(long a, long b) { return (a < b ? a : b); } |
| | 60 | static __inline u_int max(u_int a, u_int b) { return (a > b ? a : b); } |
| | 61 | static __inline u_int min(u_int a, u_int b) { return (a < b ? a : b); } |
| | 62 | static __inline quad_t qmax(quad_t a, quad_t b) { return (a > b ? a : b); } |
| | 63 | static __inline quad_t qmin(quad_t a, quad_t b) { return (a < b ? a : b); } |
| | 64 | static __inline u_long ulmax(u_long a, u_long b) { return (a > b ? a : b); } |
| | 65 | static __inline u_long ulmin(u_long a, u_long b) { return (a < b ? a : b); } |
| | 66 | |
| | 67 | /* Prototypes for non-quad routines. */ |
| | 68 | u_int32_t arc4random (void); |
| | 69 | int bcmp (const void *, const void *, size_t); |
| | 70 | #ifndef HAVE_INLINE_FFS |
| | 71 | int ffs (int); |
| | 72 | #endif |
| | 73 | #ifndef HAVE_INLINE_FLS |
| | 74 | int fls (int); |
| | 75 | #endif |
| | 76 | int locc (int, char *, u_int); |
| | 77 | void qsort (void *base, size_t nmemb, size_t size, |
| | 78 | int (*compar)(const void *, const void *)); |
| | 79 | u_long random (void); |
| | 80 | char *index (const char *, int); |
| | 81 | char *rindex (const char *, int); |
| | 82 | int scanc (u_int, const u_char *, const u_char *, int); |
| | 83 | int skpc (int, int, char *); |
| | 84 | void srandom (u_long); |
| | 85 | char *strcat (char * __restrict, const char * __restrict); |
| | 86 | int strcmp (const char *, const char *); |
| | 87 | char *strcpy (char * __restrict, const char * __restrict); |
| | 88 | size_t strlcat (char *, const char *, size_t); |
| | 89 | size_t strlcpy (char *, const char *, size_t); |
| | 90 | size_t strlen (const char *); |
| | 91 | int strncmp (const char *, const char *, size_t); |
| | 92 | char *strncpy (char * __restrict, const char * __restrict, size_t); |
| | 93 | int _fnmatch(const char *, const char *, int, int); |
| | 94 | |
| | 95 | static __inline int |
| | 96 | fnmatch(const char *pattern, const char *string, int flags) |
| | 97 | { |
| | 98 | return(_fnmatch(pattern, string, flags, 0)); |
| | 99 | } |
| | 100 | |
| | 101 | static __inline int |
| | 102 | memcmp(const void *b1, const void *b2, size_t len) |
| | 103 | { |
| | 104 | return (bcmp(b1, b2, len)); |
| | 105 | } |
| | 106 | |
| | 107 | static __inline void * |
| | 108 | memset(void *b, int c, size_t len) |
| | 109 | { |
| | 110 | char *bb; |
| | 111 | |
| | 112 | if (c == 0) |
| | 113 | bzero(b, len); |
| | 114 | else |
| | 115 | for (bb = (char *)b; len--; ) |
| | 116 | *bb++ = c; |
| | 117 | return (b); |
| | 118 | } |
| | 119 | |
| | 120 | /* fnmatch() return values. */ |
| | 121 | #define FNM_NOMATCH 1 /* Match failed. */ |
| | 122 | |
| | 123 | /* fnmatch() flags. */ |
| | 124 | #define FNM_NOESCAPE 0x01 /* Disable backslash escaping. */ |
| | 125 | #define FNM_PATHNAME 0x02 /* Slash must be matched by slash. */ |
| | 126 | #define FNM_PERIOD 0x04 /* Period must be matched by period. */ |
| | 127 | #define FNM_LEADING_DIR 0x08 /* Ignore /<tail> after Imatch. */ |
| | 128 | #define FNM_CASEFOLD 0x10 /* Case insensitive search. */ |
| | 129 | #define FNM_IGNORECASE FNM_CASEFOLD |
| | 130 | #define FNM_FILE_NAME FNM_PATHNAME |
| | 131 | |
| | 132 | #endif /* !_SYS_LIBKERN_H_ */ |
projects / dragonfly.git / blame_incremental