Home
last modified time | relevance | path

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

/posix/
A Dregex_internal.h364 unsigned int word_char : 1; member
413 re_const_bitset_ptr_t word_char; member
676 bitset_t word_char; member
A Dregcomp.c945 dfa->word_char[0] = bits1 << 31 << 1 | bits0; in init_word_char()
946 dfa->word_char[1] = bits3 << 31 << 1 | bits2; in init_word_char()
951 dfa->word_char[0] = bits0; in init_word_char()
952 dfa->word_char[1] = bits1; in init_word_char()
953 dfa->word_char[2] = bits2; in init_word_char()
954 dfa->word_char[3] = bits3; in init_word_char()
972 dfa->word_char[i] |= (bitset_word_t) 1 << j; in init_word_char()
1794 token->word_char = 0; in peek_token()
1822 token->word_char = IS_WIDE_WORD_CHAR (wc) != 0; in peek_token()
1826 token->word_char = IS_WORD_CHAR (c2) != 0; in peek_token()
[all …]
A Dregex_internal.c65 pstr->word_char = dfa->word_char; in re_string_allocate()
796 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()
A Dregexec.c3384 if (dfa->word_char[i] & mask) in build_trtable()
3527 if (type == CHARACTER && !node->word_char) in group_nodes_into_DFAstates()
3535 any_set |= (accepts[j] &= (dfa->word_char[j] | ~dfa->sb_char[j])); in group_nodes_into_DFAstates()
3539 any_set |= (accepts[j] &= dfa->word_char[j]); in group_nodes_into_DFAstates()
3546 if (type == CHARACTER && node->word_char) in group_nodes_into_DFAstates()
3554 any_set |= (accepts[j] &= ~(dfa->word_char[j] & dfa->sb_char[j])); in group_nodes_into_DFAstates()
3558 any_set |= (accepts[j] &= ~dfa->word_char[j]); in group_nodes_into_DFAstates()

Completed in 23 milliseconds