998   first = dfa->str_tree->first->node_idx;  in create_initial_state()
1011 	int node_idx = init_nodes.elems[i];  in create_initial_state()  local
1012 	re_token_type_t type = dfa->nodes[node_idx].type;  in create_initial_state()
1022 		&& clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx)  in create_initial_state()
1030 	    int dest_idx = dfa->edests[node_idx].elems[0];  in create_initial_state()
1370       node->node_idx = node->left->node_idx;  in calc_first()
1375       node->node_idx = re_dfa_add_node (dfa, node->token);  in calc_first()
1376       if (BE (node->node_idx == -1, 0))  in calc_first()
1379 	dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type;  in calc_first()
1412   int idx = node->node_idx;  in link_nfa_nodes()
1430 	  left = node->left->first->node_idx;  in link_nfa_nodes()
1432 	  left = node->next->node_idx;  in link_nfa_nodes()
1434 	  right = node->right->first->node_idx;  in link_nfa_nodes()
1436 	  right = node->next->node_idx;  in link_nfa_nodes()
1446       err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);  in link_nfa_nodes()
1450       dfa->nexts[idx] = node->next->node_idx;  in link_nfa_nodes()
1457       dfa->nexts[idx] = node->next->node_idx;  in link_nfa_nodes()
1635   int node_idx, incomplete;  in calc_eclosure()  local
1641   for (node_idx = 0; ; ++node_idx)  in calc_eclosure()
1645       if (node_idx == dfa->nodes_len)  in calc_eclosure()
1650 	  node_idx = 0;  in calc_eclosure()
1654       assert (dfa->eclosures[node_idx].nelem != -1);  in calc_eclosure()
1658       if (dfa->eclosures[node_idx].nelem != 0)  in calc_eclosure()
1661       err = calc_eclosure_iter (&eclosure_elem, dfa, node_idx, 1);  in calc_eclosure()
1665       if (dfa->eclosures[node_idx].nelem == 0)  in calc_eclosure()
3761   tree->node_idx = -1;  in create_token_tree()