66 lines
2.7 KiB
C
66 lines
2.7 KiB
C
/*-
|
|
* Copyright (c) 1988, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)general.h 8.1 (Berkeley) 6/6/93
|
|
*/
|
|
|
|
/*
|
|
* Some general definitions.
|
|
*/
|
|
|
|
#define numberof(x) (sizeof x/sizeof x[0])
|
|
#define highestof(x) (numberof(x)-1)
|
|
|
|
#if defined(unix)
|
|
#define ClearElement(x) bzero((char *)&x, sizeof x)
|
|
#define ClearArray(x) bzero((char *)x, sizeof x)
|
|
#else /* defined(unix) */
|
|
#define ClearElement(x) memset((char *)&x, 0, sizeof x)
|
|
#define ClearArray(x) memset((char *)x, 0, sizeof x)
|
|
#endif /* defined(unix) */
|
|
|
|
#if defined(unix) /* Define BSD equivalent mem* functions */
|
|
#define memcpy(dest,src,n) bcopy(src,dest,n)
|
|
#define memmove(dest,src,n) bcopy(src,dest,n)
|
|
#define memset(s,c,n) if (c == 0) { \
|
|
bzero(s,n); \
|
|
} else { \
|
|
register char *src = (char *)s; \
|
|
register int count = n; \
|
|
\
|
|
while (count--) { \
|
|
*src++ = c; \
|
|
} \
|
|
}
|
|
#define memcmp(s1,s2,n) bcmp(s1,s2,n)
|
|
#endif /* defined(unix) */
|