Home
last modified time | relevance | path

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

/posix/
A Dregex_internal.h201 #define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS) macro
203 typedef bitset_word_t bitset_t[BITSET_WORDS];
744 set[BITSET_WORDS - 1] = in bitset_set_all()
761 set[BITSET_WORDS - 1] = in bitset_not()
763 & ~set[BITSET_WORDS - 1]); in bitset_not()
770 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i) in bitset_merge()
778 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i) in bitset_mask()
A Dregexec.c3372 for (i = 0; i < BITSET_WORDS; ++i) in build_trtable()
3403 for (i = 0; i < BITSET_WORDS; ++i) in build_trtable()
3534 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3538 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3553 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3557 for (j = 0; j < BITSET_WORDS; ++j) in group_nodes_into_DFAstates()
3579 for (k = 0; k < BITSET_WORDS; ++k) in group_nodes_into_DFAstates()
3587 for (k = 0; k < BITSET_WORDS; ++k) in group_nodes_into_DFAstates()
A Dregcomp.c335 for (i = 0, ch = 0; i < BITSET_WORDS; ++i) in re_compile_fastmap_iter()
903 for (i = 0, ch = 0; i < BITSET_WORDS; ++i) in init_dfa()
969 for (; i < BITSET_WORDS; ++i) in init_word_char()
1130 for (i = ASCII_CHARS / BITSET_WORD_BITS; i < BITSET_WORDS; ++i) in optimize_utf8()
3356 for (sbc_idx = 0; sbc_idx < BITSET_WORDS; ++sbc_idx) in parse_bracket_exp()
3361 if (sbc_idx < BITSET_WORDS) in parse_bracket_exp()

Completed in 19 milliseconds