Lines Matching defs:candidates
100 const re_node_set *candidates)
116 const re_node_set *candidates,
122 Idx str_idx, const re_node_set *candidates)
1807 const re_node_set *candidates;
1808 candidates = ((mctx->state_log[str_idx] == NULL) ? NULL
1815 if (candidates)
1819 err = add_epsilon_src_nodes (dfa, dest_nodes, candidates);
1826 err = check_subexp_limits (dfa, dest_nodes, candidates, &sctx->limits,
1838 if (candidates && mctx->state_log[str_idx]->has_backref)
1840 err = sift_states_bkref (mctx, sctx, str_idx, candidates);
1850 const re_node_set *candidates)
1868 return re_node_set_add_intersect (dest_nodes, candidates,
1875 const re_node_set *candidates)
1898 err = re_node_set_add_intersect (&except_nodes, candidates,
2072 const re_node_set *candidates, re_node_set *limits,
2109 candidates);
2127 candidates);
2147 candidates);
2160 Idx str_idx, const re_node_set *candidates)
2173 for (node_idx = 0; node_idx < candidates->nelem; ++node_idx)
2178 node = candidates->elems[node_idx];
2708 /* Enumerate all the candidates which the backreference BKREF_NODE can match
2710 Note that we might collect inappropriate candidates here.