Home
last modified time | relevance | path

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

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/
A Dregex_internal.h97 #define BITSET_WORDS (SBC_MAX / BITSET_WORD_BITS) macro
98 typedef bitset_word_t bitset_t[BITSET_WORDS];
635 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i) in bitset_not()
643 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i) in bitset_merge()
651 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i) in bitset_mask()
A Dregexec.c3359 for (i = 0; i < BITSET_WORDS; ++i) in build_trtable()
3389 for (i = 0; i < BITSET_WORDS; ++i) in build_trtable()
3524 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3528 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3543 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3547 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3569 for (k = 0; k < BITSET_WORDS; ++k) in group_nodes_into_DFAstates()
3577 for (k = 0; k < BITSET_WORDS; ++k) in group_nodes_into_DFAstates()
A Dregcomp.c329 for (i = 0, ch = 0; i < BITSET_WORDS; ++i) in re_compile_fastmap_iter()
866 for (i = 0, ch = 0; i < BITSET_WORDS; ++i) in init_dfa()
896 for (i = 0, ch = 0; i < BITSET_WORDS; ++i) in init_word_char()
1045 for (i = 0x80 / BITSET_WORD_BITS; i < BITSET_WORDS; ++i) in optimize_utf8()
3183 for (sbc_idx = 0; sbc_idx < BITSET_WORDS; ++sbc_idx) in parse_bracket_exp()
3188 if (sbc_idx < BITSET_WORDS) in parse_bracket_exp()

Completed in 17 milliseconds