BYTEWIDTH
(b[((unsigned char) (c)) / BYTEWIDTH] \
|= 1 << (((unsigned char) c) % BYTEWIDTH))
BUF_PUSH ((1 << BYTEWIDTH) / BYTEWIDTH);
bzero (b, (1 << BYTEWIDTH) / BYTEWIDTH);
for (ch = 0; ch < 1 << BYTEWIDTH; ch++)
|| *pending_exact == (1 << BYTEWIDTH) - 1
bzero (fastmap, 1 << BYTEWIDTH); /* Assume nothing's valid. */
for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))
for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++)
for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))))
for (j = 0; j < (1 << BYTEWIDTH); j++)
for (j = 0; j < (1 << BYTEWIDTH); j++)
for (j = 0; j < (1 << BYTEWIDTH); j++)
for (j = 0; j < (1 << BYTEWIDTH); j++)
for (j = 0; j < (1 << BYTEWIDTH); j++)
#define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH)
if (c < (unsigned) (*p * BYTEWIDTH)
&& p[1 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
if (c < (unsigned char) (p1[4] * BYTEWIDTH)
&& p1[5 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
re_comp_buf.fastmap = (char *) malloc (1 << BYTEWIDTH);
while (i < (1 << BYTEWIDTH))
while (i < (1 << BYTEWIDTH) && fastmap[i])
for (bit = 0; bit < BYTEWIDTH; bit++)
printchar (c * BYTEWIDTH + bit);