Lines Matching defs:BYTEWIDTH

398 # define BYTEWIDTH 8 /* In bits.  */
786 while (i < (1 << BYTEWIDTH))
792 while (i < (1 << BYTEWIDTH) && fastmap[i])
2159 (b[((unsigned char) (c)) / BYTEWIDTH] \
2160 |= 1 << (((unsigned char) c) % BYTEWIDTH))
3134 BUF_PUSH ((1 << BYTEWIDTH) / BYTEWIDTH);
3137 bzero (b, (1 << BYTEWIDTH) / BYTEWIDTH);
3248 for (ch = 0; ch < 1 << BYTEWIDTH; ++ch)
3288 for (ch = 0; ch < 1 << BYTEWIDTH; ch++)
4121 || *pending_exact == (1 << BYTEWIDTH) - 1
4506 end_char = ((unsigned)TRANSLATE(p[0]) & ((1 << BYTEWIDTH) - 1));
4521 BUFP. A fastmap records which of the (1 << BYTEWIDTH) possible
4525 The caller must supply the address of a (1 << BYTEWIDTH)-byte data
4596 bzero (fastmap, 1 << BYTEWIDTH); /* Assume nothing's valid. */
4665 for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
4666 if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))
4673 for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++)
4676 for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
4677 if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))))
4683 for (j = 0; j < (1 << BYTEWIDTH); j++)
4690 for (j = 0; j < (1 << BYTEWIDTH); j++)
4701 for (j = 0; j < (1 << BYTEWIDTH); j++)
4720 for (j = 0; j < (1 << BYTEWIDTH); j++)
4728 for (j = 0; j < (1 << BYTEWIDTH); j++)
5399 #define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH)
6570 if (c < (unsigned) (*p * BYTEWIDTH)
6571 && p[1 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
7068 if (c < (unsigned) (p1[4] * BYTEWIDTH)
7069 && p1[5 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
7088 && ! ((int) p2[1] * BYTEWIDTH > (int) p1[5]
7089 && (p2[2 + p1[5] / BYTEWIDTH]
7090 & (1 << (p1[5] % BYTEWIDTH)))))
7850 re_comp_buf.fastmap = (char *) malloc (1 << BYTEWIDTH);
7943 preg->fastmap = (char *) malloc (1 << BYTEWIDTH);