Searched refs:CHAR_BIT (Results 1 – 12 of 12) sorted by relevance
31 int lt = (p1[i] - p2[i]) >> CHAR_BIT; in timingsafe_memcmp()34 int gt = (p2[i] - p1[i]) >> CHAR_BIT; in timingsafe_memcmp()
38 return (sizeof(i) * CHAR_BIT - __builtin_clz(i)); in fls()
38 return (sizeof(i) * CHAR_BIT - __builtin_clzl(i)); in flsl()
38 return (sizeof(i) * CHAR_BIT - __builtin_clzll(i)); in flsll()
52 #if CHAR_BIT < 10299 size_t shift_table[1U << CHAR_BIT]; /* See below. */ in two_way_long_needle()310 for (i = 0; i < 1U << CHAR_BIT; i++) in two_way_long_needle()
80 || CHAR_BIT > 8
30 # undef CHAR_BIT31 # define CHAR_BIT 8 macro
84 #define MAX_LONG_LEN ((CHAR_BIT * sizeof (long) - 1) * 4 / 13 + 2)
148 #define MAX_LONG_LEN ((CHAR_BIT * sizeof (long) - 1) * 4 / 13 + 2)
141 #define MAX_LONG_LEN ((CHAR_BIT * sizeof (long) - 1) * 4 / 13 + 2)
551 # define BACKSL (1<<CHAR_BIT) in p_simp_re()1171 p->ncsalloc += CHAR_BIT; in allocset()1173 assert(nc % CHAR_BIT == 0); in allocset()1174 nbytes = nc / CHAR_BIT * css; in allocset()1191 cs[i].ptr = setbits + css*(i/CHAR_BIT); in allocset()1197 cs->ptr = p->g->setbits + css*((no)/CHAR_BIT); in allocset()1198 cs->mask = 1 << ((no) % CHAR_BIT); in allocset()1412 int ncols = (g->ncsets+(CHAR_BIT-1)) / CHAR_BIT; in isinsets()1430 int ncols = (g->ncsets+(CHAR_BIT-1)) / CHAR_BIT; in samesets()
176 if (g->nstates <= (sopno) (CHAR_BIT*sizeof(states1)) && !(eflags®_LARGE)) in regexec()
