620       if (dfa->eclosures != NULL)  in free_dfa_content()
621 	re_node_set_free (dfa->eclosures + i);  in free_dfa_content()
628   re_free (dfa->eclosures);  in free_dfa_content()
988   err = re_node_set_init_copy (&init_nodes, dfa->eclosures + first);  in create_initial_state()
1021 		re_node_set_merge (&init_nodes, dfa->eclosures + dest_idx);  in create_initial_state()
1149   dfa->eclosures = re_malloc (re_node_set, dfa->nodes_alloc);  in analyze()
1151 	  || dfa->eclosures == NULL, 0))  in analyze()
1615       Idx *elems = dfa->eclosures[src].elems;  in calc_inveclosure()
1616       for (idx = 0; idx < dfa->eclosures[src].nelem; ++idx)  in calc_inveclosure()
1652       assert (dfa->eclosures[node_idx].nelem != REG_MISSING);  in calc_eclosure()
1656       if (dfa->eclosures[node_idx].nelem != 0)  in calc_eclosure()
1663       if (dfa->eclosures[node_idx].nelem == 0)  in calc_eclosure()
1689   dfa->eclosures[node].nelem = REG_MISSING;  in calc_eclosure_iter()
1711 	if (dfa->eclosures[edest].nelem == REG_MISSING)  in calc_eclosure_iter()
1718 	if (dfa->eclosures[edest].nelem == 0)  in calc_eclosure_iter()
1725 	  eclosure_elem = dfa->eclosures[edest];  in calc_eclosure_iter()
1730 	if (dfa->eclosures[edest].nelem == 0)  in calc_eclosure_iter()
1742     dfa->eclosures[node].nelem = 0;  in calc_eclosure_iter()
1744     dfa->eclosures[node] = eclosure;  in calc_eclosure_iter()