Home
last modified time | relevance | path

Searched refs:word_char (Results 1 – 4 of 4) sorted by relevance

/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.h399 unsigned int word_char : 1; member
448 re_const_bitset_ptr_t word_char; member
735 bitset_t word_char; member
H A Dregcomp.c957 dfa->word_char[0] = bits1 << 31 << 1 | bits0; in init_word_char()
958 dfa->word_char[1] = bits3 << 31 << 1 | bits2; in init_word_char()
963 dfa->word_char[0] = bits0; in init_word_char()
964 dfa->word_char[1] = bits1; in init_word_char()
965 dfa->word_char[2] = bits2; in init_word_char()
966 dfa->word_char[3] = bits3; in init_word_char()
975 memset (&dfa->word_char[i], '\0', (SBC_MAX - ch) / 8); in init_word_char()
984 dfa->word_char[i] |= (bitset_word_t) 1 << j; in init_word_char()
1810 token->word_char = 0; in peek_token()
1838 token->word_char = IS_WIDE_WORD_CHAR (wc) != 0; in peek_token()
[all …]
H A Dregex_internal.c65 pstr->word_char = dfa->word_char; in re_string_allocate()
794 pstr->tip_context = (bitset_contain (pstr->word_char, c) in re_string_reconstruct()
959 if (bitset_contain (input->word_char, c)) in re_string_context_at()
H A Dregexec.c3441 if (dfa->word_char[i] & mask) in build_trtable()
3590 if (type == CHARACTER && !node->word_char) in group_nodes_into_DFAstates()
3598 any_set |= (accepts[j] &= (dfa->word_char[j] | ~dfa->sb_char[j])); in group_nodes_into_DFAstates()
3602 any_set |= (accepts[j] &= dfa->word_char[j]); in group_nodes_into_DFAstates()
3609 if (type == CHARACTER && node->word_char) in group_nodes_into_DFAstates()
3617 any_set |= (accepts[j] &= ~(dfa->word_char[j] & dfa->sb_char[j])); in group_nodes_into_DFAstates()
3621 any_set |= (accepts[j] &= ~dfa->word_char[j]); in group_nodes_into_DFAstates()