986   first = dfa->str_tree->first->node_idx;  in create_initial_state()
999 	Idx node_idx = init_nodes.elems[i];  in create_initial_state()  local
1000 	re_token_type_t type = dfa->nodes[node_idx].type;  in create_initial_state()
1010 		&& clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx)  in create_initial_state()
1018 	    Idx dest_idx = dfa->edests[node_idx].elems[0];  in create_initial_state()
1364       node->node_idx = node->left->node_idx;  in calc_first()
1369       node->node_idx = re_dfa_add_node (dfa, node->token);  in calc_first()
1370       if (BE (node->node_idx == REG_MISSING, 0))  in calc_first()
1373         dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type;  in calc_first()
1406   Idx idx = node->node_idx;  in link_nfa_nodes()
1424 	  left = node->left->first->node_idx;  in link_nfa_nodes()
1426 	  left = node->next->node_idx;  in link_nfa_nodes()
1428 	  right = node->right->first->node_idx;  in link_nfa_nodes()
1430 	  right = node->next->node_idx;  in link_nfa_nodes()
1440       err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);  in link_nfa_nodes()
1444       dfa->nexts[idx] = node->next->node_idx;  in link_nfa_nodes()
1451       dfa->nexts[idx] = node->next->node_idx;  in link_nfa_nodes()
1632   Idx node_idx;  in calc_eclosure()  local
1639   for (node_idx = 0; ; ++node_idx)  in calc_eclosure()
1643       if (node_idx == dfa->nodes_len)  in calc_eclosure()
1648 	  node_idx = 0;  in calc_eclosure()
1652       assert (dfa->eclosures[node_idx].nelem != REG_MISSING);  in calc_eclosure()
1656       if (dfa->eclosures[node_idx].nelem != 0)  in calc_eclosure()
1659       err = calc_eclosure_iter (&eclosure_elem, dfa, node_idx, true);  in calc_eclosure()
1663       if (dfa->eclosures[node_idx].nelem == 0)  in calc_eclosure()
3763   tree->node_idx = REG_MISSING;  in create_token_tree()