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,
1298       re_node_set *cur_nodes = &mctx->state_log[*pidx]->nodes;  in proceed_next_node()  local
1309 	  if (!re_node_set_contains (cur_nodes, candidate))  in proceed_next_node()
2462 check_subexp_matching_top (re_match_context_t *mctx, re_node_set *cur_nodes,  in check_subexp_matching_top()  argument
2474   for (node_idx = 0; node_idx < cur_nodes->nelem; ++node_idx)  in check_subexp_matching_top()
2476       Idx node = cur_nodes->elems[node_idx];  in check_subexp_matching_top()
2928   re_node_set *cur_nodes, next_nodes;  in check_arrival()  local
3058   cur_nodes = (mctx->state_log[last_str] == NULL ? NULL  in check_arrival()
3067   if (cur_nodes != NULL && re_node_set_contains (cur_nodes, last_node))  in check_arrival()
3084 			      re_node_set *cur_nodes, re_node_set *next_nodes)  in check_arrival_add_next_nodes()  argument
3094   for (cur_idx = 0; cur_idx < cur_nodes->nelem; ++cur_idx)  in check_arrival_add_next_nodes()
3097       Idx cur_node = cur_nodes->elems[cur_idx];  in check_arrival_add_next_nodes()
3164 check_arrival_expand_ecl (const re_dfa_t *dfa, re_node_set *cur_nodes,  in check_arrival_expand_ecl()  argument
3171   assert (cur_nodes->nelem);  in check_arrival_expand_ecl()
3173   err = re_node_set_alloc (&new_nodes, cur_nodes->nelem);  in check_arrival_expand_ecl()
3179   for (idx = 0; idx < cur_nodes->nelem; ++idx)  in check_arrival_expand_ecl()
3181       Idx cur_node = cur_nodes->elems[idx];  in check_arrival_expand_ecl()
3206   re_node_set_free (cur_nodes);  in check_arrival_expand_ecl()
3207   *cur_nodes = new_nodes;  in check_arrival_expand_ecl()
3262 expand_bkref_cache (re_match_context_t *mctx, re_node_set *cur_nodes,  in expand_bkref_cache()  argument
3280       if (!re_node_set_contains (cur_nodes, ent->node))  in expand_bkref_cache()
3293 	  if (re_node_set_contains (cur_nodes, next_node))  in expand_bkref_cache()
3297 	  err3 = re_node_set_merge (cur_nodes, &new_dests);  in expand_bkref_cache()
3594   const re_node_set *cur_nodes = &state->nodes;  in group_nodes_into_DFAstates()  local
3599   for (i = 0; i < cur_nodes->nelem; ++i)  in group_nodes_into_DFAstates()
3601       re_token_t *node = &dfa->nodes[cur_nodes->elems[i]];  in group_nodes_into_DFAstates()
3742 	  ok = re_node_set_insert (&dests_node[j], cur_nodes->elems[i]);  in group_nodes_into_DFAstates()
3754 	  err = re_node_set_init_1 (dests_node + ndests, cur_nodes->elems[i]);  in group_nodes_into_DFAstates()