301   for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)  in re_compile_fastmap_iter()
1016     for (i = 0; i < init_nodes.nelem; ++i)  in create_initial_state()
1024 	for (clexp_idx = 0; clexp_idx < init_nodes.nelem; ++clexp_idx)  in create_initial_state()
1032 	if (clexp_idx == init_nodes.nelem)  in create_initial_state()
1512       else if (dfa->edests[org_node].nelem == 0)  in duplicate_node_closure()
1520       else if (dfa->edests[org_node].nelem == 1)  in duplicate_node_closure()
1638       for (idx = 0; idx < dfa->eclosures[src].nelem; ++idx)  in calc_inveclosure()
1671       DEBUG_ASSERT (dfa->eclosures[node_idx].nelem != -1);  in calc_eclosure()
1674       if (dfa->eclosures[node_idx].nelem != 0)  in calc_eclosure()
1681       if (dfa->eclosures[node_idx].nelem == 0)  in calc_eclosure()
1699   err = re_node_set_alloc (&eclosure, dfa->edests[node].nelem + 1);  in calc_eclosure_iter()
1704   eclosure.elems[eclosure.nelem++] = node;  in calc_eclosure_iter()
1708   dfa->eclosures[node].nelem = -1;  in calc_eclosure_iter()
1713       && dfa->edests[node].nelem  in calc_eclosure_iter()
1724     for (i = 0; i < dfa->edests[node].nelem; ++i)  in calc_eclosure_iter()
1730 	if (dfa->eclosures[edest].nelem == -1)  in calc_eclosure_iter()
1737 	if (dfa->eclosures[edest].nelem == 0)  in calc_eclosure_iter()
1751 	if (dfa->eclosures[edest].nelem == 0)  in calc_eclosure_iter()
1759     dfa->eclosures[node].nelem = 0;  in calc_eclosure_iter()