85 				Idx node_idx, Idx str_idx, Idx max_str_idx)
190 static int check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx,
1969   Idx node_idx;  in check_dst_limits_calc_pos_1()  local
1973   for (node_idx = 0; node_idx < eclosures->nelem; ++node_idx)  in check_dst_limits_calc_pos_1()
1975       Idx node = eclosures->elems[node_idx];  in check_dst_limits_calc_pos_1()
2081   Idx node_idx, lim_idx;  in check_subexp_limits()  local
2097 	  for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx)  in check_subexp_limits()
2099 	      Idx node = dest_nodes->elems[node_idx];  in check_subexp_limits()
2121 	    for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx)  in check_subexp_limits()
2123 		Idx node = dest_nodes->elems[node_idx];  in check_subexp_limits()
2135 		    --node_idx;  in check_subexp_limits()
2141 	  for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx)  in check_subexp_limits()
2143 	      Idx node = dest_nodes->elems[node_idx];  in check_subexp_limits()
2169   Idx node_idx, node;  in sift_states_bkref()  local
2178   for (node_idx = 0; node_idx < candidates->nelem; ++node_idx)  in sift_states_bkref()
2183       node = candidates->elems[node_idx];  in sift_states_bkref()
2265 		     Idx node_idx, Idx str_idx, Idx max_str_idx)  in sift_states_iter_mb()  argument
2270   naccepted = check_node_accept_bytes (dfa, node_idx, &mctx->input, str_idx);  in sift_states_iter_mb()
2273 			    dfa->nexts[node_idx]))  in sift_states_iter_mb()
2466   Idx node_idx;  in check_subexp_matching_top()  local
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()
2616       Idx node_idx = nodes->elems[i];  in transit_state_bkref()  local
2618       const re_token_t *node = dfa->nodes + node_idx;  in transit_state_bkref()
2636       err = get_subexp (mctx, node_idx, cur_str_idx);  in transit_state_bkref()
2643       assert (dfa->nexts[node_idx] != REG_MISSING);  in transit_state_bkref()
2651 	  if (bkref_ent->node != node_idx || bkref_ent->str_idx != cur_str_idx)  in transit_state_bkref()
2655 			    ? dfa->eclosures + dfa->edests[node_idx].elems[0]  in transit_state_bkref()
2656 			    : dfa->eclosures + dfa->nexts[node_idx]);  in transit_state_bkref()
3779 check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx,  in check_node_accept_bytes()  argument
3782   const re_token_t *node = dfa->nodes + node_idx;  in check_node_accept_bytes()