Home
last modified time | relevance | path

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

/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.h236 #define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS) macro
238 typedef bitset_word_t bitset_t[BITSET_WORDS];
803 set[BITSET_WORDS - 1] = in bitset_set_all()
820 set[BITSET_WORDS - 1] = in bitset_not()
822 & ~set[BITSET_WORDS - 1]); in bitset_not()
829 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i) in bitset_merge()
837 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i) in bitset_mask()
H A Dregexec.c3429 for (i = 0; i < BITSET_WORDS; ++i) in build_trtable()
3460 for (i = 0; i < BITSET_WORDS; ++i) in build_trtable()
3597 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3601 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3616 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3620 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3642 for (k = 0; k < BITSET_WORDS; ++k) in group_nodes_into_DFAstates()
3650 for (k = 0; k < BITSET_WORDS; ++k) in group_nodes_into_DFAstates()
H A Dregcomp.c341 for (i = 0, ch = 0; i < BITSET_WORDS; ++i) in re_compile_fastmap_iter()
915 for (i = 0, ch = 0; i < BITSET_WORDS; ++i) in init_dfa()
981 for (; i < BITSET_WORDS; ++i) in init_word_char()
1141 for (i = ASCII_CHARS / BITSET_WORD_BITS; i < BITSET_WORDS; ++i) in optimize_utf8()
3348 for (sbc_idx = 0; sbc_idx < BITSET_WORDS; ++sbc_idx) in parse_bracket_exp()
3353 if (sbc_idx < BITSET_WORDS) in parse_bracket_exp()