Home
last modified time | relevance | path

Searched refs:BITSET_WORD_BITS (Results 1 – 3 of 3) sorted by relevance

/posix/
A Dregex_internal.h198 #define BITSET_WORD_BITS ULONG_WIDTH macro
201 #define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS)
718 set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS; in bitset_set()
724 set[i / BITSET_WORD_BITS] &= ~ ((bitset_word_t) 1 << i % BITSET_WORD_BITS); in bitset_clear()
730 return (set[i / BITSET_WORD_BITS] >> i % BITSET_WORD_BITS) & 1; in bitset_contain()
742 memset (set, -1, sizeof (bitset_word_t) * (SBC_MAX / BITSET_WORD_BITS)); in bitset_set_all()
743 if (SBC_MAX % BITSET_WORD_BITS != 0) in bitset_set_all()
745 ((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1; in bitset_set_all()
758 for (bitset_i = 0; bitset_i < SBC_MAX / BITSET_WORD_BITS; ++bitset_i) in bitset_not()
760 if (SBC_MAX % BITSET_WORD_BITS != 0) in bitset_not()
[all …]
A Dregcomp.c564 # if 4 * BITSET_WORD_BITS < ASCII_CHARS
566 # elif 3 * BITSET_WORD_BITS < ASCII_CHARS
568 # elif 2 * BITSET_WORD_BITS < ASCII_CHARS
570 # elif 1 * BITSET_WORD_BITS < ASCII_CHARS
574 >> (SBC_MAX % BITSET_WORD_BITS == 0
576 : BITSET_WORD_BITS - SBC_MAX % BITSET_WORD_BITS))
942 if (BITSET_WORD_BITS == 64) in init_word_char()
949 else if (BITSET_WORD_BITS == 32) in init_word_char()
970 for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch) in init_word_char()
1129 : BITSET_WORD_BITS - ASCII_CHARS % BITSET_WORD_BITS); in optimize_utf8()
[all …]
A Dregexec.c1910 if (subexp_idx < BITSET_WORD_BITS in check_dst_limits_calc_pos_1()
1938 if (subexp_idx < BITSET_WORD_BITS) in check_dst_limits_calc_pos_1()
2393 && dfa->nodes[node].opr.idx < BITSET_WORD_BITS in check_subexp_matching_top()
3373 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1; in build_trtable()
3404 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1; in build_trtable()
3492 if (ASCII_CHARS % BITSET_WORD_BITS == 0) in group_nodes_into_DFAstates()

Completed in 20 milliseconds