Lines Matching refs:cur_node
68 regmatch_t *prev_idx_match, Idx cur_node,
1445 Idx idx, cur_node;
1466 cur_node = dfa->init_node;
1485 update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);
1487 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node)
1502 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1515 cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node,
1518 if (BE (! REG_VALID_INDEX (cur_node), 0))
1520 if (BE (cur_node == REG_ERROR, 0))
1529 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1566 regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch)
1568 int type = dfa->nodes[cur_node].type;
1571 Idx reg_num = dfa->nodes[cur_node].opr.idx + 1;
1582 Idx reg_num = dfa->nodes[cur_node].opr.idx + 1;
1595 if (dfa->nodes[cur_node].opt_subexp
1892 Idx cur_node = inv_eclosure->elems[ecl_idx];
1893 if (cur_node == node)
1895 if (IS_EPSILON_NODE (dfa->nodes[cur_node].type))
1897 Idx edst1 = dfa->edests[cur_node].elems[0];
1898 Idx edst2 = ((dfa->edests[cur_node].nelem > 1)
1899 ? dfa->edests[cur_node].elems[1] : REG_MISSING);
1907 dfa->inveclosures + cur_node);
1918 Idx cur_node = inv_eclosure->elems[ecl_idx];
1919 if (!re_node_set_contains (&except_nodes, cur_node))
1921 Idx idx = re_node_set_contains (dest_nodes, cur_node) - 1;
2513 Idx cur_node = state->nodes.elems[node_cnt];
2514 if (check_node_accept (mctx, dfa->nodes + cur_node, cur_str_idx))
2517 dfa->eclosures + dfa->nexts[cur_node]);
3101 Idx cur_node = cur_nodes->elems[cur_idx];
3103 re_token_type_t type = dfa->nodes[cur_node].type;
3108 if (dfa->nodes[cur_node].accept_mb)
3110 naccepted = check_node_accept_bytes (dfa, cur_node, &mctx->input,
3115 Idx next_node = dfa->nexts[cur_node];
3146 || check_node_accept (mctx, dfa->nodes + cur_node, str_idx))
3148 ok = re_node_set_insert (next_nodes, dfa->nexts[cur_node]);
3185 Idx cur_node = cur_nodes->elems[idx];
3186 const re_node_set *eclosure = dfa->eclosures + cur_node;
3201 err = check_arrival_expand_ecl_sub (dfa, &new_nodes, cur_node,
3224 Idx cur_node;
3225 for (cur_node = target; !re_node_set_contains (dst_nodes, cur_node);)
3229 if (dfa->nodes[cur_node].type == type
3230 && dfa->nodes[cur_node].opr.idx == ex_subexp)
3234 ok = re_node_set_insert (dst_nodes, cur_node);
3240 ok = re_node_set_insert (dst_nodes, cur_node);
3243 if (dfa->edests[cur_node].nelem == 0)
3245 if (dfa->edests[cur_node].nelem == 2)
3249 dfa->edests[cur_node].elems[1],
3254 cur_node = dfa->edests[cur_node].elems[0];
