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