Lines Matching refs:bit
20 ** Data structure for bit maps.
22 ** Each bit in this map can be referenced by an ascii character.
23 ** This is 256 possible bits, or 32 8-bit bytes.
26 # define BITMAPBITS 256 /* number of bits in a bit map */
28 # define BITMAPBYTES (BITMAPBITS / BYTEBITS) /* number of bytes in bit map */
34 # define _BITWORD(bit) (((unsigned char)(bit) / (BYTEBITS * sizeof (int))) & BITMAPMAX)
35 # define _BITBIT(bit) ((unsigned int)1 << ((unsigned char)(bit) % (BYTEBITS * sizeof (int))))
39 /* properly case and truncate bit */
40 # define bitidx(bit) ((unsigned int) (bit) & 0xff)
42 /* test bit number N */
43 # define bitnset(bit, map) ((map)[_BITWORD(bit)] & _BITBIT(bit))
45 /* set bit number N */
46 # define setbitn(bit, map) (map)[_BITWORD(bit)] |= _BITBIT(bit)
48 /* clear bit number N */
49 # define clrbitn(bit, map) (map)[_BITWORD(bit)] &= ~_BITBIT(bit)
51 /* clear an entire bit map */
54 /* bit hacking */
55 # define bitset(bit, word) (((word) & (bit)) != 0)