Lines Matching defs:node_idx
995 first = dfa->str_tree->first->node_idx;
1008 Idx node_idx = init_nodes.elems[i];
1009 re_token_type_t type = dfa->nodes[node_idx].type;
1019 && clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx)
1027 Idx dest_idx = dfa->edests[node_idx].elems[0];
1378 node->node_idx = node->left->node_idx;
1383 node->node_idx = re_dfa_add_node (dfa, node->token);
1384 if (BE (node->node_idx == REG_MISSING, 0))
1387 dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type;
1420 Idx idx = node->node_idx;
1438 left = node->left->first->node_idx;
1440 left = node->next->node_idx;
1442 right = node->right->first->node_idx;
1444 right = node->next->node_idx;
1454 err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);
1458 dfa->nexts[idx] = node->next->node_idx;
1465 dfa->nexts[idx] = node->next->node_idx;
1645 Idx node_idx;
1652 for (node_idx = 0; ; ++node_idx)
1656 if (node_idx == dfa->nodes_len)
1661 node_idx = 0;
1665 assert (dfa->eclosures[node_idx].nelem != REG_MISSING);
1669 if (dfa->eclosures[node_idx].nelem != 0)
1671 /* Calculate epsilon closure of `node_idx'. */
1672 err = calc_eclosure_iter (&eclosure_elem, dfa, node_idx, true);
1676 if (dfa->eclosures[node_idx].nelem == 0)
3813 tree->node_idx = REG_MISSING;