Lines Matching defs:node_idx
1003 first = dfa->str_tree->first->node_idx;
1016 int node_idx = init_nodes.elems[i];
1017 re_token_type_t type = dfa->nodes[node_idx].type;
1027 && clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx)
1035 int dest_idx = dfa->edests[node_idx].elems[0];
1377 node->node_idx = node->left->node_idx;
1382 node->node_idx = re_dfa_add_node (dfa, node->token);
1383 if (BE (node->node_idx == -1, 0))
1386 dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type;
1419 int idx = node->node_idx;
1437 left = node->left->first->node_idx;
1439 left = node->next->node_idx;
1441 right = node->right->first->node_idx;
1443 right = node->next->node_idx;
1453 err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);
1457 dfa->nexts[idx] = node->next->node_idx;
1464 dfa->nexts[idx] = node->next->node_idx;
1642 int node_idx, incomplete;
1648 for (node_idx = 0; ; ++node_idx)
1652 if (node_idx == dfa->nodes_len)
1657 node_idx = 0;
1661 assert (dfa->eclosures[node_idx].nelem != -1);
1665 if (dfa->eclosures[node_idx].nelem != 0)
1667 /* Calculate epsilon closure of `node_idx'. */
1668 err = calc_eclosure_iter (&eclosure_elem, dfa, node_idx, 1);
1672 if (dfa->eclosures[node_idx].nelem == 0)
3772 tree->node_idx = -1;