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