Searched refs:node_idx (Results 1 – 3 of 3) sorted by relevance
90 int node_idx, int str_idx, int max_str_idx) internal_function;181 static int check_node_accept_bytes (re_dfa_t *dfa, int node_idx,1898 int node_idx; local1902 for (node_idx = 0; node_idx < eclosures->nelem; ++node_idx)1904 int node = eclosures->elems[node_idx];2008 int node_idx, lim_idx; local2024 for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx)2026 int node = dest_nodes->elems[node_idx];2048 for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx)2050 int node = dest_nodes->elems[node_idx];[all …]
984 first = dfa->str_tree->first->node_idx;997 int node_idx = init_nodes.elems[i]; local998 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;[all …]
441 int node_idx; member