623   if (dfa->init_state->nodes.nelem == 0  in re_search_internal()
624       && dfa->init_state_word->nodes.nelem == 0  in re_search_internal()
625       && (dfa->init_state_nl->nodes.nelem == 0  in re_search_internal()
1200   for (i = 0; i < state->nodes.nelem; ++i)  in check_halt_state_context()
1232       for (Idx i = 0; i < edests->nelem; i++)  in proceed_next_node()
1630   for (i = 0; i < cur_src->nelem; i++)  in build_sifted_states()
1655       if (sctx->limits.nelem)  in build_sifted_states()
1735   if (dest_nodes->nelem == 0)  in update_cur_sifted_state()
1748 	  if (sctx->limits.nelem)  in update_cur_sifted_state()
1785       err = re_node_set_alloc (&state->inveclosure, dest_nodes->nelem);  in add_epsilon_src_nodes()
1788       for (i = 0; i < dest_nodes->nelem; i++)  in add_epsilon_src_nodes()
1809     for (ecl_idx = 0; ecl_idx < inv_eclosure->nelem; ++ecl_idx)  in sub_epsilon_src_nodes()
1817 	    Idx edst2 = ((dfa->edests[cur_node].nelem > 1)  in sub_epsilon_src_nodes()
1835     for (ecl_idx = 0; ecl_idx < inv_eclosure->nelem; ++ecl_idx)  in sub_epsilon_src_nodes()
1857   for (lim_idx = 0; lim_idx < limits->nelem; ++lim_idx)  in check_dst_limits()
1893   for (node_idx = 0; node_idx < eclosures->nelem; ++node_idx)  in check_dst_limits_calc_pos_1()
2001   for (lim_idx = 0; lim_idx < limits->nelem; ++lim_idx)  in check_subexp_limits()
2015 	  for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx)  in check_subexp_limits()
2039 	    for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx)  in check_subexp_limits()
2059 	  for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx)  in check_subexp_limits()
2096   for (node_idx = 0; node_idx < candidates->nelem; ++node_idx)  in sift_states_bkref()
2389   for (node_idx = 0; node_idx < cur_nodes->nelem; ++node_idx)  in check_subexp_matching_top()
2419   *err = re_node_set_alloc (&next_nodes, state->nodes.nelem + 1);
2422   for (node_cnt = 0; node_cnt < state->nodes.nelem; ++node_cnt)
2455   for (i = 0; i < pstate->nodes.nelem; ++i)  in transit_state_mb()
2525   for (i = 0; i < nodes->nelem; ++i)  in transit_state_bkref()
2573 			: mctx->state_log[cur_str_idx]->nodes.nelem);  in transit_state_bkref()
2605 	      && mctx->state_log[cur_str_idx]->nodes.nelem > prev_nelem)  in transit_state_bkref()
2815   for (cls_idx = 0; cls_idx < nodes->nelem; ++cls_idx)  in find_subexp_node()
2903       if (next_nodes.nelem)  in check_arrival()
2947       if (next_nodes.nelem)  in check_arrival()
3010   for (cur_idx = 0; cur_idx < cur_nodes->nelem; ++cur_idx)  in check_arrival_add_next_nodes()
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()
3150       if (dfa->edests[cur_node].nelem == 0)  in check_arrival_expand_ecl_sub()
3152       if (dfa->edests[cur_node].nelem == 2)  in check_arrival_expand_ecl_sub()
3321       for (j = 0; j < dests_node[i].nelem; ++j)  in build_trtable()
3463   for (i = 0; i < cur_nodes->nelem; ++i)  in group_nodes_into_DFAstates()