|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /*-
23: * Copyright (c) 1992, 1993
24: * The Regents of the University of California. All rights reserved.
25: *
26: * Redistribution and use in source and binary forms, with or without
27: * modification, are permitted provided that the following conditions
28: * are met:
29: * 1. Redistributions of source code must retain the above copyright
30: * notice, this list of conditions and the following disclaimer.
31: * 2. Redistributions in binary form must reproduce the above copyright
32: * notice, this list of conditions and the following disclaimer in the
33: * documentation and/or other materials provided with the distribution.
34: * 3. All advertising materials mentioning features or use of this software
35: * must display the following acknowledgement:
36: * This product includes software developed by the University of
37: * California, Berkeley and its contributors.
38: * 4. Neither the name of the University nor the names of its contributors
39: * may be used to endorse or promote products derived from this software
40: * without specific prior written permission.
41: *
42: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
43: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
46: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
47: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
48: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
49: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
50: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
51: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52: * SUCH DAMAGE.
53: *
54: * @(#)libkern.h 8.1 (Berkeley) 6/10/93
55: */
56:
57: #ifndef _LIBKERN_LIBKERN_H_
58: #define _LIBKERN_LIBKERN_H_
59:
60: #include <sys/cdefs.h>
61: #include <sys/types.h>
62:
63: /* BCD conversions. */
64: extern u_char const bcd2bin_data[];
65: extern u_char const bin2bcd_data[];
66: extern char const hex2ascii_data[];
67:
68: #define bcd2bin(bcd) (bcd2bin_data[bcd])
69: #define bin2bcd(bin) (bin2bcd_data[bin])
70: #define hex2ascii(hex) (hex2ascii_data[hex])
71:
72:
73: __BEGIN_DECLS
74: static inline int
75: imax(int a, int b)
76: {
77: return (a > b ? a : b);
78: }
79: static inline int
80: imin(int a, int b)
81: {
82: return (a < b ? a : b);
83: }
84: static inline long
85: lmax(long a, long b)
86: {
87: return (a > b ? a : b);
88: }
89: static inline long
90: lmin(long a, long b)
91: {
92: return (a < b ? a : b);
93: }
94: static inline u_int
95: max(u_int a, u_int b)
96: {
97: return (a > b ? a : b);
98: }
99: static inline u_int
100: min(u_int a, u_int b)
101: {
102: return (a < b ? a : b);
103: }
104: static inline u_long
105: ulmax(u_long a, u_long b)
106: {
107: return (a > b ? a : b);
108: }
109: static inline u_long
110: ulmin(u_long a, u_long b)
111: {
112: return (a < b ? a : b);
113: }
114:
115: /* Prototypes for non-quad routines. */
116: int bcmp __P((const void *, const void *, size_t));
117: int ffs __P((int));
118: int locc __P((int, char *, u_int));
119: u_long random __P((void));
120: char *rindex __P((const char *, int));
121: int scanc __P((u_int, u_char *, u_char *, int));
122: int skpc __P((int, int, char *));
123: char *strcat __P((char *, const char *));
124: char *strcpy __P((char *, const char *));
125: size_t strlen __P((const char *));
126: char *strncpy __P((char *, const char *, size_t));
127: long strtol __P((const char*, char **, int));
128: __END_DECLS
129:
130: #endif /* _LIBKERN_LIBKERN_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.