Lines Matching defs:candidates
97 const re_node_set *candidates)
113 const re_node_set *candidates,
119 int str_idx, const re_node_set *candidates)
1770 const re_node_set *candidates;
1771 candidates = ((mctx->state_log[str_idx] == NULL) ? NULL
1778 if (candidates)
1782 err = add_epsilon_src_nodes (dfa, dest_nodes, candidates);
1789 err = check_subexp_limits (dfa, dest_nodes, candidates, &sctx->limits,
1801 if (candidates && mctx->state_log[str_idx]->has_backref)
1803 err = sift_states_bkref (mctx, sctx, str_idx, candidates);
1813 const re_node_set *candidates)
1831 return re_node_set_add_intersect (dest_nodes, candidates,
1838 const re_node_set *candidates)
1861 err = re_node_set_add_intersect (&except_nodes, candidates,
2034 const re_node_set *candidates, re_node_set *limits,
2071 candidates);
2089 candidates);
2109 candidates);
2122 int str_idx, const re_node_set *candidates)
2135 for (node_idx = 0; node_idx < candidates->nelem; ++node_idx)
2140 node = candidates->elems[node_idx];
2669 /* Enumerate all the candidates which the backreference BKREF_NODE can match
2671 Note that we might collect inappropriate candidates here.