Lines Matching defs:candidates
96 const re_node_set *candidates)
112 const re_node_set *candidates,
118 int str_idx, const re_node_set *candidates)
1793 const re_node_set *candidates;
1794 candidates = ((mctx->state_log[str_idx] == NULL) ? NULL
1801 if (candidates)
1805 err = add_epsilon_src_nodes (dfa, dest_nodes, candidates);
1812 err = check_subexp_limits (dfa, dest_nodes, candidates, &sctx->limits,
1824 if (candidates && mctx->state_log[str_idx]->has_backref)
1826 err = sift_states_bkref (mctx, sctx, str_idx, candidates);
1836 const re_node_set *candidates)
1858 return re_node_set_add_intersect (dest_nodes, candidates,
1865 const re_node_set *candidates)
1888 err = re_node_set_add_intersect (&except_nodes, candidates,
2061 const re_node_set *candidates, re_node_set *limits,
2098 candidates);
2116 candidates);
2136 candidates);
2149 int str_idx, const re_node_set *candidates)
2162 for (node_idx = 0; node_idx < candidates->nelem; ++node_idx)
2167 node = candidates->elems[node_idx];
2696 /* Enumerate all the candidates which the backreference BKREF_NODE can match
2698 Note that we might collect inappropriate candidates here.