602       if (dfa->edests != NULL)  in free_dfa_content()
603 	re_node_set_free (dfa->edests + i);  in free_dfa_content()
605   re_free (dfa->edests);  in free_dfa_content()
1000 	    int dest_idx = dfa->edests[node_idx].elems[0];  in create_initial_state()
1120   dfa->edests = re_malloc (re_node_set, dfa->nodes_alloc);  in analyze()
1122   if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL  in analyze()
1405 	err = re_node_set_init_2 (dfa->edests + idx, left, right);  in link_nfa_nodes()
1412       err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);  in link_nfa_nodes()
1418 	re_node_set_init_1 (dfa->edests + idx, dfa->nexts[idx]);  in link_nfa_nodes()
1451 	  re_node_set_empty (dfa->edests + clone_node);  in duplicate_node_closure()
1456 	  ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);  in duplicate_node_closure()
1460       else if (dfa->edests[org_node].nelem == 0)  in duplicate_node_closure()
1468       else if (dfa->edests[org_node].nelem == 1)  in duplicate_node_closure()
1472 	  org_dest = dfa->edests[org_node].elems[0];  in duplicate_node_closure()
1473 	  re_node_set_empty (dfa->edests + clone_node);  in duplicate_node_closure()
1478 	      ret = re_node_set_insert (dfa->edests + clone_node, org_dest);  in duplicate_node_closure()
1488 	  ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);  in duplicate_node_closure()
1496 	  org_dest = dfa->edests[org_node].elems[0];  in duplicate_node_closure()
1497 	  re_node_set_empty (dfa->edests + clone_node);  in duplicate_node_closure()
1507 	      ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);  in duplicate_node_closure()
1519 	      ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);  in duplicate_node_closure()
1524 	  org_dest = dfa->edests[org_node].elems[1];  in duplicate_node_closure()
1528 	  ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);  in duplicate_node_closure()
1649   err = re_node_set_alloc (&eclosure, dfa->edests[node].nelem + 1);  in calc_eclosure_iter()
1660       && dfa->edests[node].nelem  in calc_eclosure_iter()
1661       && !dfa->nodes[dfa->edests[node].elems[0]].duplicated)  in calc_eclosure_iter()
1671     for (i = 0; i < dfa->edests[node].nelem; ++i)  in calc_eclosure_iter()
1674 	int edest = dfa->edests[node].elems[i];  in calc_eclosure_iter()