BITSPERBYTE
(nbfi == (obfi + BITSPERBYTE))) {
new_defect->nbits += (8*BITSPERBYTE);
int i = BITSPERBYTE * AR_PORT_WORD;
while ((i -= BITSPERBYTE) >= 0) {
assert(fdi <= sizeof (fault_leds[side]) * BITSPERBYTE);
assert(fdi <= sizeof (ok2rem_leds[side]) * BITSPERBYTE);
#define BITS(type) (BITSPERBYTE * (long)sizeof (type))
#define BITSUSED (BITSPERBYTE * sizeof (int))
#define NCHARS (1 << BITSPERBYTE)
#define _ISMARK2(x) (mks[(x) / BITSPERBYTE] & (1<<((x) % BITSPERBYTE)))
nc = (COLS / BITSPERBYTE) + (COLS % BITSPERBYTE ? 1 : 0);
nc = (COLS / BITSPERBYTE) + (COLS % BITSPERBYTE ? 1 : 0);
mkp += x / BITSPERBYTE;
if ((m = x % BITSPERBYTE) == 0)
for (; m < BITSPERBYTE; ++m)
m = x / BITSPERBYTE + 1;
mkp += x / BITSPERBYTE;
if ((m = x % BITSPERBYTE) == 0)
for (; m < BITSPERBYTE; ++m)
BITSPERBYTE + (COLS %BITSPERBYTE ? 1 : 0);
int m = x / BITSPERBYTE + 1;
color_marks[y][x / BITSPERBYTE] |= (1 << (x % BITSPERBYTE));
nc = scrco / BITSPERBYTE - (scrco %
BITSPERBYTE ? 0 : 1);
#define _ISMARK1(y, x) (marks[y][x / BITSPERBYTE] & (1 << (x % BITSPERBYTE)))
#define _ISMARK2(y, x) (color_marks ? (color_marks[y][x / BITSPERBYTE] & \
(1 << (x % BITSPERBYTE))) : FALSE)
marks[y][x / BITSPERBYTE] |= (1 << (x % BITSPERBYTE));
if (shift >= (sizeof(number)*BITSPERBYTE)) {
if (shift >= (sizeof(number)*BITSPERBYTE)) {
bestcount = BITSPERBYTE * sizeof (uint32_t); /* worst match */
((seg)->booleans[(offset)/BITSPERBYTE] & \
(1<<((BITSPERBYTE-1)-((offset)%BITSPERBYTE))))
(seg)->ints[(offset)/BITSPERBYTE] |= \
(1<<((BITSPERBYTE-1)-((offset)%BITSPERBYTE)))
(seg)->ints[(offset)/BITSPERBYTE] &= \
(~(1<<((BITSPERBYTE-1)-((offset)%BITSPERBYTE))))
((seg)->ints[(offset)/BITSPERBYTE] & \
(1<<((BITSPERBYTE-1)-((offset)%BITSPERBYTE))))
#define VUID_BIT_ARRAY_SIZE (VUID_SEG_SIZE/((sizeof (char))*BITSPERBYTE))
(seg)->booleans[(offset)/BITSPERBYTE] |= \
(1<<((BITSPERBYTE-1)-((offset)%BITSPERBYTE)))
(seg)->booleans[(offset)/BITSPERBYTE] &= \
(~(1<<((BITSPERBYTE-1)-((offset)%BITSPERBYTE))))