Lines Matching refs:cur_nodes
119 re_node_set *cur_nodes,
146 re_node_set *cur_nodes,
149 re_node_set *cur_nodes,
156 re_node_set *cur_nodes, Idx cur_str,
1220 re_node_set *cur_nodes = &mctx->state_log[*pidx]->nodes; in proceed_next_node() local
1235 if (!re_node_set_contains (cur_nodes, candidate)) in proceed_next_node()
2377 check_subexp_matching_top (re_match_context_t *mctx, re_node_set *cur_nodes, in check_subexp_matching_top() argument
2389 for (node_idx = 0; node_idx < cur_nodes->nelem; ++node_idx) in check_subexp_matching_top()
2391 Idx node = cur_nodes->elems[node_idx]; in check_subexp_matching_top()
2841 re_node_set *cur_nodes, next_nodes; in check_arrival() local
2974 cur_nodes = (mctx->state_log[last_str] == NULL ? NULL in check_arrival()
2983 if (cur_nodes != NULL && re_node_set_contains (cur_nodes, last_node)) in check_arrival()
3000 re_node_set *cur_nodes, re_node_set *next_nodes) in check_arrival_add_next_nodes() argument
3010 for (cur_idx = 0; cur_idx < cur_nodes->nelem; ++cur_idx) in check_arrival_add_next_nodes()
3013 Idx cur_node = cur_nodes->elems[cur_idx]; in check_arrival_add_next_nodes()
3077 check_arrival_expand_ecl (const re_dfa_t *dfa, re_node_set *cur_nodes, in check_arrival_expand_ecl() argument
3083 DEBUG_ASSERT (cur_nodes->nelem); in check_arrival_expand_ecl()
3084 err = re_node_set_alloc (&new_nodes, cur_nodes->nelem); in check_arrival_expand_ecl()
3090 for (idx = 0; idx < cur_nodes->nelem; ++idx) in check_arrival_expand_ecl()
3092 Idx cur_node = cur_nodes->elems[idx]; in check_arrival_expand_ecl()
3117 re_node_set_free (cur_nodes); in check_arrival_expand_ecl()
3118 *cur_nodes = new_nodes; in check_arrival_expand_ecl()
3173 expand_bkref_cache (re_match_context_t *mctx, re_node_set *cur_nodes, in expand_bkref_cache() argument
3191 if (!re_node_set_contains (cur_nodes, ent->node)) in expand_bkref_cache()
3204 if (re_node_set_contains (cur_nodes, next_node)) in expand_bkref_cache()
3208 err3 = re_node_set_merge (cur_nodes, &new_dests); in expand_bkref_cache()
3458 const re_node_set *cur_nodes = &state->nodes; in group_nodes_into_DFAstates() local
3463 for (i = 0; i < cur_nodes->nelem; ++i) in group_nodes_into_DFAstates()
3465 re_token_t *node = &dfa->nodes[cur_nodes->elems[i]]; in group_nodes_into_DFAstates()
3606 ok = re_node_set_insert (&dests_node[j], cur_nodes->elems[i]); in group_nodes_into_DFAstates()
3618 err = re_node_set_init_1 (dests_node + ndests, cur_nodes->elems[i]); in group_nodes_into_DFAstates()