Lines Matching full:cur_nodes
140 re_node_set *cur_nodes,
172 re_node_set *cur_nodes,
176 re_node_set *cur_nodes,
184 re_node_set *cur_nodes, Idx cur_str,
1301 re_node_set *cur_nodes = &mctx->state_log[*pidx]->nodes;
1312 if (!re_node_set_contains (cur_nodes, candidate))
2459 /* From the node set CUR_NODES, pick up the nodes whose types are
2466 check_subexp_matching_top (re_match_context_t *mctx, re_node_set *cur_nodes,
2478 for (node_idx = 0; node_idx < cur_nodes->nelem; ++node_idx)
2480 Idx node = cur_nodes->elems[node_idx];
2932 re_node_set *cur_nodes, next_nodes;
3062 cur_nodes = (mctx->state_log[last_str] == NULL ? NULL
3071 if (cur_nodes != NULL && re_node_set_contains (cur_nodes, last_node))
3079 /* Calculate the destination nodes of CUR_NODES at STR_IDX, and append them
3088 re_node_set *cur_nodes, re_node_set *next_nodes)
3098 for (cur_idx = 0; cur_idx < cur_nodes->nelem; ++cur_idx)
3101 Idx cur_node = cur_nodes->elems[cur_idx];
3160 /* For all the nodes in CUR_NODES, add the epsilon closures of them to
3161 CUR_NODES, however exclude the nodes which are:
3168 check_arrival_expand_ecl (const re_dfa_t *dfa, re_node_set *cur_nodes,
3175 assert (cur_nodes->nelem);
3177 err = re_node_set_alloc (&new_nodes, cur_nodes->nelem);
3181 closures of the node in CUR_NODES. */
3183 for (idx = 0; idx < cur_nodes->nelem; ++idx)
3185 Idx cur_node = cur_nodes->elems[idx];
3210 re_node_set_free (cur_nodes);
3211 *cur_nodes = new_nodes;
3266 expand_bkref_cache (re_match_context_t *mctx, re_node_set *cur_nodes,
3284 if (!re_node_set_contains (cur_nodes, ent->node))
3297 if (re_node_set_contains (cur_nodes, next_node))
3301 err3 = re_node_set_merge (cur_nodes, &new_dests);
3598 const re_node_set *cur_nodes = &state->nodes;
3603 for (i = 0; i < cur_nodes->nelem; ++i)
3605 re_token_t *node = &dfa->nodes[cur_nodes->elems[i]];
3746 ok = re_node_set_insert (&dests_node[j], cur_nodes->elems[i]);
3758 err = re_node_set_init_1 (dests_node + ndests, cur_nodes->elems[i]);
