Home
last modified time | relevance | path

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

/posix/
A Dregcomp.c1029 && clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx) in create_initial_state()
1374 op->token.opr.idx = cls->token.opr.idx = node->token.opr.idx; in lower_subexp()
1792 token->opr.c = c; in peek_token()
1815 token->opr.c = c2; in peek_token()
2028 token->opr.c = c; in peek_token_bracket()
2046 token->opr.c = c2; in peek_token_bracket()
2058 token->opr.c = c2; in peek_token_bracket()
2079 token->opr.c = c; in peek_token_bracket()
3294 start_elem.opr.name); in parse_bracket_exp()
3440 elem->opr.ch = token->opr.c; in parse_bracket_element()
[all …]
A Dregexec.c1271 Idx subexp_idx = dfa->nodes[node].opr.idx + 1; in proceed_next_node()
1862 subexp_idx = dfa->nodes[ent->node].opr.idx; in check_dst_limits()
2020 && subexp_idx == dfa->nodes[node].opr.idx) in check_subexp_limits()
2065 if (subexp_idx != dfa->nodes[node].opr.idx) in check_subexp_limits()
2647 subexp_num = dfa->nodes[bkref_node].opr.idx; in get_subexp()
2820 && node->opr.idx == subexp_idx) in find_subexp_node()
2845 subexp_num = dfa->nodes[top_node].opr.idx; in check_arrival()
3137 && dfa->nodes[cur_node].opr.idx == ex_subexp) in check_arrival_expand_ecl_sub()
3471 bitset_set (accepts, node->opr.c); in group_nodes_into_DFAstates()
3474 bitset_merge (accepts, node->opr.sbcset); in group_nodes_into_DFAstates()
[all …]
A Dregex_internal.h349 } opr; member
709 } opr; member

Completed in 21 milliseconds