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 */ 35 36 #include <sys/types.h> 37 38 static inline int 39 imax(a, b) 40 int a, b; 41 { 42 return (a > b ? a : b); 43 } 44 static inline int 45 imin(a, b) 46 int a, b; 47 { 48 return (a < b ? a : b); 49 } 50 static inline long 51 lmax(a, b) 52 long a, b; 53 { 54 return (a > b ? a : b); 55 } 56 static inline long 57 lmin(a, b) 58 long a, b; 59 { 60 return (a < b ? a : b); 61 } 62 static inline u_int 63 max(a, b) 64 u_int a, b; 65 { 66 return (a > b ? a : b); 67 } 68 static inline u_int 69 min(a, b) 70 u_int a, b; 71 { 72 return (a < b ? a : b); 73 } 74 static inline u_long 75 ulmax(a, b) 76 u_long a, b; 77 { 78 return (a > b ? a : b); 79 } 80 static inline u_long 81 ulmin(a, b) 82 u_long a, b; 83 { 84 return (a < b ? a : b); 85 } 86 87 /* Prototypes for non-quad routines. */ 88 int bcmp __P((const void *, const void *, size_t)); 89 int ffs __P((int)); 90 int locc __P((int, char *, u_int)); 91 u_long random __P((void)); 92 char *rindex __P((const char *, int)); 93 int scanc __P((u_int, u_char *, u_char *, int)); 94 int skpc __P((int, int, char *)); 95 char *strcat __P((char *, const char *)); 96 char *strcpy __P((char *, const char *)); 97 size_t strlen __P((const char *)); 98 char *strncpy __P((char *, const char *, size_t)); 99