Home
last modified time | relevance | path

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

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/
A Dregex_internal.h95 #define BITSET_WORD_BITS (sizeof (bitset_word_t) * CHAR_BIT) macro
97 #define BITSET_WORDS (SBC_MAX / BITSET_WORD_BITS)
103 (set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS)
105 (set[i / BITSET_WORD_BITS] &= ~((bitset_word_t) 1 << i % BITSET_WORD_BITS))
107 (set[i / BITSET_WORD_BITS] & ((bitset_word_t) 1 << i % BITSET_WORD_BITS))
A Dregcomp.c333 for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch) in re_compile_fastmap_iter()
537 [0 ... 0x80 / BITSET_WORD_BITS - 1] = BITSET_WORD_MAX
867 for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch) in init_dfa()
897 for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch) in init_word_char()
1044 assert (0x80 % BITSET_WORD_BITS == 0); in optimize_utf8()
1045 for (i = 0x80 / BITSET_WORD_BITS; i < BITSET_WORDS; ++i) in optimize_utf8()
1223 if (other_idx < BITSET_WORD_BITS) in optimize_subexps()
1267 && (node->token.opr.idx >= BITSET_WORD_BITS in lower_subexp()
A Dregexec.c1861 if (subexp_idx < BITSET_WORD_BITS in check_dst_limits_calc_pos_1()
1889 if (subexp_idx < BITSET_WORD_BITS) in check_dst_limits_calc_pos_1()
2349 && dfa->nodes[node].opr.idx < BITSET_WORD_BITS in check_subexp_matching_top()
3360 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1; in build_trtable()
3390 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1; in build_trtable()

Completed in 21 milliseconds