Searched refs:CHAR_BIT (Results 1 – 8 of 8) sorted by relevance
50 static const size_t size = CHAR_BIT * sizeof(value); in Enqueue()98 static const size_t size = CHAR_BIT * sizeof(value); in Dequeue()
48 static const size_t size = CHAR_BIT * sizeof(value); in pop_front()
53 #define SQRT_SIZE_MAX (((size_t)1) << (sizeof(size_t) * CHAR_BIT / 2)) in __weak_alias()
58 #define CHAR_BIT 8 macro
216 ((p)->ncsalloc / CHAR_BIT * (p)->g->csetsize + \623 # define BACKSL (1<<CHAR_BIT) in p_simp_re()1245 p->ncsalloc += CHAR_BIT; in allocset()1247 assert(nc % CHAR_BIT == 0); in allocset()1248 nbytes = nc / CHAR_BIT * css; in allocset()1254 if (reallocarr(&p->g->setbits, nc / CHAR_BIT, css)) { in allocset()1260 p->g->sets[i].ptr = p->g->setbits + css*(i/CHAR_BIT); in allocset()1266 cs->ptr = p->g->setbits + css*((no)/CHAR_BIT); in allocset()1267 cs->mask = 1 << (unsigned int)((no) % CHAR_BIT); in allocset()1565 ncols = (g->ncsets+(CHAR_BIT-1)) / CHAR_BIT; in isinsets()[all …]
230 if (g->nstates <= (sopno)(CHAR_BIT*sizeof(states1)) && !(eflags®_LARGE))
492 #define TYPE_BIT(type) (sizeof (type) * CHAR_BIT)
1659 for (j = 0; j < CHAR_BIT; ++j) { in _common_prefix_len()1660 if (x & (1 << (CHAR_BIT - 1))) { in _common_prefix_len()1661 return i * CHAR_BIT + j; in _common_prefix_len()1666 return sizeof(*a1) * CHAR_BIT; in _common_prefix_len()