1 /* $NetBSD: libkern.h,v 1.3 1994/10/26 06:42:26 cgd Exp $ */ 2 3 /*- 4 * Copyright (c) 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * @(#)libkern.h 8.1 (Berkeley) 6/10/93 36 */ 37 38 #include <sys/types.h> 39 40 static __inline int 41 imax(a, b) 42 int a, b; 43 { 44 return (a > b ? a : b); 45 } 46 static __inline int 47 imin(a, b) 48 int a, b; 49 { 50 return (a < b ? a : b); 51 } 52 static __inline long 53 lmax(a, b) 54 long a, b; 55 { 56 return (a > b ? a : b); 57 } 58 static __inline long 59 lmin(a, b) 60 long a, b; 61 { 62 return (a < b ? a : b); 63 } 64 static __inline u_int 65 max(a, b) 66 u_int a, b; 67 { 68 return (a > b ? a : b); 69 } 70 static __inline u_int 71 min(a, b) 72 u_int a, b; 73 { 74 return (a < b ? a : b); 75 } 76 static __inline u_long 77 ulmax(a, b) 78 u_long a, b; 79 { 80 return (a > b ? a : b); 81 } 82 static __inline u_long 83 ulmin(a, b) 84 u_long a, b; 85 { 86 return (a < b ? a : b); 87 } 88 89 /* Prototypes for non-quad routines. */ 90 int bcmp __P((const void *, const void *, size_t)); 91 int ffs __P((int)); 92 int locc __P((int, char *, u_int)); 93 u_long random __P((void)); 94 char *rindex __P((const char *, int)); 95 int scanc __P((u_int, u_char *, u_char *, int)); 96 int skpc __P((int, int, char *)); 97 char *strcat __P((char *, const char *)); 98 char *strcpy __P((char *, const char *)); 99 size_t strlen __P((const char *)); 100 char *strncpy __P((char *, const char *, size_t)); 101