1 |
30 |
unneback |
/*-
|
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 |
|
|
* $Id: libkern.h,v 1.2 2001-09-27 12:02:00 chris Exp $
|
35 |
|
|
*/
|
36 |
|
|
|
37 |
|
|
#ifndef _SYS_LIBKERN_H_
|
38 |
|
|
#define _SYS_LIBKERN_H_
|
39 |
|
|
|
40 |
|
|
#include <sys/cdefs.h>
|
41 |
|
|
#include <sys/types.h>
|
42 |
|
|
|
43 |
|
|
/* BCD conversions. */
|
44 |
|
|
extern u_char const bcd2bin_data[];
|
45 |
|
|
extern u_char const bin2bcd_data[];
|
46 |
|
|
extern char const hex2ascii_data[];
|
47 |
|
|
|
48 |
|
|
#define bcd2bin(bcd) (bcd2bin_data[bcd])
|
49 |
|
|
#define bin2bcd(bin) (bin2bcd_data[bin])
|
50 |
|
|
#define hex2ascii(hex) (hex2ascii_data[hex])
|
51 |
|
|
|
52 |
|
|
static __inline int imax(int a, int b) { return (a > b ? a : b); }
|
53 |
|
|
static __inline int imin(int a, int b) { return (a < b ? a : b); }
|
54 |
|
|
static __inline long lmax(long a, long b) { return (a > b ? a : b); }
|
55 |
|
|
static __inline long lmin(long a, long b) { return (a < b ? a : b); }
|
56 |
|
|
static __inline u_int max(u_int a, u_int b) { return (a > b ? a : b); }
|
57 |
|
|
static __inline u_int min(u_int a, u_int b) { return (a < b ? a : b); }
|
58 |
|
|
static __inline quad_t qmax(quad_t a, quad_t b) { return (a > b ? a : b); }
|
59 |
|
|
static __inline quad_t qmin(quad_t a, quad_t b) { return (a < b ? a : b); }
|
60 |
|
|
static __inline u_long ulmax(u_long a, u_long b) { return (a > b ? a : b); }
|
61 |
|
|
static __inline u_long ulmin(u_long a, u_long b) { return (a < b ? a : b); }
|
62 |
|
|
|
63 |
|
|
/* Prototypes for non-quad routines. */
|
64 |
|
|
int bcmp __P((const void *, const void *, size_t));
|
65 |
|
|
#ifndef HAVE_INLINE_FFS
|
66 |
|
|
int ffs __P((int));
|
67 |
|
|
#endif
|
68 |
|
|
#ifndef HAVE_INLINE_FLS
|
69 |
|
|
int fls __P((int));
|
70 |
|
|
#endif
|
71 |
|
|
int locc __P((int, char *, u_int));
|
72 |
|
|
void qsort __P((void *base, size_t nmemb, size_t size,
|
73 |
|
|
int (*compar)(const void *, const void *)));
|
74 |
|
|
u_long random __P((void));
|
75 |
|
|
char *index __P((const char *, int));
|
76 |
|
|
char *rindex __P((const char *, int));
|
77 |
|
|
int scanc __P((u_int, const u_char *, const u_char *, int));
|
78 |
|
|
int skpc __P((int, int, char *));
|
79 |
|
|
void srandom __P((u_long));
|
80 |
|
|
char *strcat __P((char *, const char *));
|
81 |
|
|
int strcmp __P((const char *, const char *));
|
82 |
|
|
char *strdup __P((const char *s));
|
83 |
|
|
char *strcpy __P((char *, const char *));
|
84 |
|
|
size_t strlen __P((const char *));
|
85 |
|
|
int strncmp __P((const char *, const char *, size_t));
|
86 |
|
|
char *strncpy __P((char *, const char *, size_t));
|
87 |
|
|
char *strerror __P((int errnum));
|
88 |
|
|
|
89 |
|
|
#endif /* !_SYS_LIBKERN_H_ */
|