Home
last modified time | relevance | path

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

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/
A Dregex_internal.h269 unsigned int word_char : 1; member
318 re_const_bitset_ptr_t word_char; member
591 bitset_t word_char; member
A Dregex_internal.c55 pstr->word_char = dfa->word_char; in re_string_allocate()
702 pstr->tip_context = (bitset_contain (pstr->word_char, c) in re_string_reconstruct()
866 if (bitset_contain (input->word_char, c)) in re_string_context_at()
A Dregcomp.c899 dfa->word_char[i] |= (bitset_word_t) 1 << j; in init_word_char()
1711 token->word_char = 0; in peek_token()
1739 token->word_char = IS_WIDE_WORD_CHAR (wc) != 0; in peek_token()
1743 token->word_char = IS_WORD_CHAR (c2) != 0; in peek_token()
1852 token->word_char = IS_WIDE_WORD_CHAR (wc) != 0; in peek_token()
1856 token->word_char = IS_WORD_CHAR (token->opr.c); in peek_token()
A Dregexec.c3371 if (dfa->word_char[i] & mask) in build_trtable()
3517 if (type == CHARACTER && !node->word_char) in group_nodes_into_DFAstates()
3525 any_set |= (accepts[j] &= (dfa->word_char[j] | ~dfa->sb_char[j])); in group_nodes_into_DFAstates()
3529 any_set |= (accepts[j] &= dfa->word_char[j]); in group_nodes_into_DFAstates()
3536 if (type == CHARACTER && node->word_char) in group_nodes_into_DFAstates()
3544 any_set |= (accepts[j] &= ~(dfa->word_char[j] & dfa->sb_char[j])); in group_nodes_into_DFAstates()
3548 any_set |= (accepts[j] &= ~dfa->word_char[j]); in group_nodes_into_DFAstates()

Completed in 19 milliseconds