67 lines
1.7 KiB
C
67 lines
1.7 KiB
C
/*
|
|
* bit.h --
|
|
*
|
|
* Definition of macros for setting and clearing bits in an array
|
|
* of integers.
|
|
*
|
|
* It is assumed that "int" is 32 bits wide.
|
|
*
|
|
* Copyright 1987 Regents of the University of California
|
|
* All rights reserved.
|
|
*
|
|
*
|
|
* Header: bit.h,v 2.0 87/08/11 09:31:57 brent Exp $ SPRITE (Berkeley)
|
|
*/
|
|
|
|
#ifndef _BIT
|
|
#define _BIT
|
|
|
|
#include "sprite.h"
|
|
|
|
#define BIT_NUM_BITS_PER_INT 32
|
|
#define BIT_NUM_BITS_PER_BYTE 8
|
|
|
|
#define Bit_NumInts(numBits) \
|
|
(((numBits)+BIT_NUM_BITS_PER_INT -1)/BIT_NUM_BITS_PER_INT)
|
|
|
|
#define Bit_NumBytes(numBits) \
|
|
(Bit_NumInts(numBits) * sizeof(int))
|
|
|
|
#define Bit_Alloc(numBits, bitArrayPtr) \
|
|
bitArrayPtr = (int *)malloc((unsigned)Bit_NumBytes(numBits)); \
|
|
Bit_Zero((numBits), (bitArrayPtr))
|
|
|
|
#define Bit_Free(bitArrayPtr) \
|
|
free((char *)bitArrayPtr)
|
|
|
|
#define Bit_Set(numBits, bitArrayPtr) \
|
|
((bitArrayPtr)[(numBits)/BIT_NUM_BITS_PER_INT] |= \
|
|
(1 << ((numBits) % BIT_NUM_BITS_PER_INT)))
|
|
|
|
#define Bit_IsSet(numBits, bitArrayPtr) \
|
|
((bitArrayPtr)[(numBits)/BIT_NUM_BITS_PER_INT] & \
|
|
(1 << ((numBits) % BIT_NUM_BITS_PER_INT)))
|
|
|
|
#define Bit_Clear(numBits, bitArrayPtr) \
|
|
((bitArrayPtr)[(numBits)/BIT_NUM_BITS_PER_INT] &= \
|
|
~(1 << ((numBits) % BIT_NUM_BITS_PER_INT)))
|
|
|
|
#define Bit_IsClear(numBits, bitArrayPtr) \
|
|
(!(Bit_IsSet((numBits), (bitArrayPtr))))
|
|
|
|
#define Bit_Copy(numBits, srcArrayPtr, destArrayPtr) \
|
|
bcopy((char *)(srcArrayPtr), (char *)(destArrayPtr), \
|
|
Bit_NumBytes(numBits))
|
|
|
|
#define Bit_Zero(numBits, bitArrayPtr) \
|
|
bzero((char *)(bitArrayPtr), Bit_NumBytes(numBits))
|
|
|
|
extern int Bit_FindFirstSet();
|
|
extern int Bit_FindFirstClear();
|
|
extern Boolean Bit_Intersect();
|
|
extern Boolean Bit_Union();
|
|
extern Boolean Bit_AnySet();
|
|
extern int *Bit_Expand();
|
|
|
|
#endif _BIT
|