1 /* $OpenBSD: stdd.h,v 1.6 2010/09/07 19:58:09 marco Exp $ */ 2 /* $NetBSD: stdd.h,v 1.2 1995/09/28 05:37:50 tls Exp $ */ 3 4 /*- 5 * SPDX-License-Identifier: BSD-3-Clause 6 * 7 * Copyright (c) 1991, 1993 8 * The Regents of the University of California. All rights reserved. 9 * 10 * This code is derived from software contributed to Berkeley by 11 * Ozan Yigit at York University. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * @(#)stdd.h 8.1 (Berkeley) 6/6/93 38 */ 39 40 /* 41 * standard defines 42 */ 43 44 #define max(a,b) ((a) > (b)? (a): (b)) 45 #define min(a,b) ((a) < (b)? (a): (b)) 46 47 #define iswhite(c) ((c) == ' ' || (c) == '\t') 48 49 /* 50 * STREQ is an optimised strcmp(a,b)==0 51 * STREQN is an optimised strncmp(a,b,n)==0; assumes n > 0 52 */ 53 #define STREQ(a, b) ((a)[0] == (b)[0] && strcmp(a, b) == 0) 54 #define STREQN(a, b, n) ((a)[0] == (b)[0] && strncmp(a, b, n) == 0) 55 56 #define YES 1 57 #define NO 0 58