Lines Matching full:candidates
102 const re_node_set *candidates)
118 const re_node_set *candidates,
124 Idx str_idx, const re_node_set *candidates)
1815 const re_node_set *candidates;
1816 candidates = ((mctx->state_log[str_idx] == NULL) ? NULL
1823 if (candidates)
1827 err = add_epsilon_src_nodes (dfa, dest_nodes, candidates);
1834 err = check_subexp_limits (dfa, dest_nodes, candidates, &sctx->limits,
1846 if (candidates && mctx->state_log[str_idx]->has_backref)
1848 err = sift_states_bkref (mctx, sctx, str_idx, candidates);
1858 const re_node_set *candidates)
1876 return re_node_set_add_intersect (dest_nodes, candidates,
1883 const re_node_set *candidates)
1906 err = re_node_set_add_intersect (&except_nodes, candidates,
2080 const re_node_set *candidates, re_node_set *limits,
2117 candidates);
2135 candidates);
2155 candidates);
2168 Idx str_idx, const re_node_set *candidates)
2181 for (node_idx = 0; node_idx < candidates->nelem; ++node_idx)
2186 node = candidates->elems[node_idx];
2716 /* Enumerate all the candidates which the backreference BKREF_NODE can match
2718 Note that we might collect inappropriate candidates here.
