1 /* 2 * Copyright (c) 1988, 1989, 1990 The Regents of the University of California. 3 * Copyright (c) 1988, 1989 by Adam de Boor 4 * Copyright (c) 1989 by Berkeley Softworks 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Adam de Boor. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)bit.h 5.3 (Berkeley) 6/1/90 39 */ 40 41 /* 42 * bit.h -- 43 * 44 * Definition of macros for setting and clearing bits in an array 45 * of integers. 46 * 47 * It is assumed that "int" is 32 bits wide. 48 */ 49 50 #ifndef _BIT 51 #define _BIT 52 53 #include "sprite.h" 54 55 #define BIT_NUM_BITS_PER_INT 32 56 #define BIT_NUM_BITS_PER_BYTE 8 57 58 #define Bit_NumInts(numBits) \ 59 (((numBits)+BIT_NUM_BITS_PER_INT -1)/BIT_NUM_BITS_PER_INT) 60 61 #define Bit_NumBytes(numBits) \ 62 (Bit_NumInts(numBits) * sizeof(int)) 63 64 #define Bit_Alloc(numBits, bitArrayPtr) \ 65 bitArrayPtr = (int *)malloc((unsigned)Bit_NumBytes(numBits)); \ 66 Bit_Zero((numBits), (bitArrayPtr)) 67 68 #define Bit_Free(bitArrayPtr) \ 69 free((char *)bitArrayPtr) 70 71 #define Bit_Set(numBits, bitArrayPtr) \ 72 ((bitArrayPtr)[(numBits)/BIT_NUM_BITS_PER_INT] |= \ 73 (1 << ((numBits) % BIT_NUM_BITS_PER_INT))) 74 75 #define Bit_IsSet(numBits, bitArrayPtr) \ 76 ((bitArrayPtr)[(numBits)/BIT_NUM_BITS_PER_INT] & \ 77 (1 << ((numBits) % BIT_NUM_BITS_PER_INT))) 78 79 #define Bit_Clear(numBits, bitArrayPtr) \ 80 ((bitArrayPtr)[(numBits)/BIT_NUM_BITS_PER_INT] &= \ 81 ~(1 << ((numBits) % BIT_NUM_BITS_PER_INT))) 82 83 #define Bit_IsClear(numBits, bitArrayPtr) \ 84 (!(Bit_IsSet((numBits), (bitArrayPtr)))) 85 86 #define Bit_Copy(numBits, srcArrayPtr, destArrayPtr) \ 87 bcopy((char *)(srcArrayPtr), (char *)(destArrayPtr), \ 88 Bit_NumBytes(numBits)) 89 90 #define Bit_Zero(numBits, bitArrayPtr) \ 91 bzero((char *)(bitArrayPtr), Bit_NumBytes(numBits)) 92 93 extern int Bit_FindFirstSet(); 94 extern int Bit_FindFirstClear(); 95 extern Boolean Bit_Intersect(); 96 extern Boolean Bit_Union(); 97 extern Boolean Bit_AnySet(); 98 extern int *Bit_Expand(); 99 100 #endif _BIT 101