Lines Matching refs:node_idx
984 first = dfa->str_tree->first->node_idx;
997 int node_idx = init_nodes.elems[i]; local
998 re_token_type_t type = dfa->nodes[node_idx].type;
1008 && clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx)
1016 int dest_idx = dfa->edests[node_idx].elems[0];
1363 node->node_idx = node->left->node_idx;
1368 node->node_idx = re_dfa_add_node (dfa, node->token);
1369 if (BE (node->node_idx == -1, 0))
1407 int idx = node->node_idx;
1425 left = node->left->first->node_idx;
1427 left = node->next->node_idx;
1429 right = node->right->first->node_idx;
1431 right = node->next->node_idx;
1441 err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);
1445 dfa->nexts[idx] = node->next->node_idx;
1452 dfa->nexts[idx] = node->next->node_idx;
1645 int node_idx, incomplete; local
1651 for (node_idx = 0; ; ++node_idx)
1655 if (node_idx == dfa->nodes_len)
1660 node_idx = 0;
1664 assert (dfa->eclosures[node_idx].nelem != -1);
1668 if (dfa->eclosures[node_idx].nelem != 0)
1671 err = calc_eclosure_iter (&eclosure_elem, dfa, node_idx, 1);
1675 if (dfa->eclosures[node_idx].nelem == 0)
3830 tree->node_idx = -1;