Lines Matching defs:candidates
93 const re_node_set *candidates) internal_function;
107 const re_node_set *candidates,
113 Idx str_idx, const re_node_set *candidates) internal_function;
1766 const re_node_set *candidates;
1767 candidates = ((mctx->state_log[str_idx] == NULL) ? NULL
1774 if (candidates)
1778 err = add_epsilon_src_nodes (dfa, dest_nodes, candidates);
1785 err = check_subexp_limits (dfa, dest_nodes, candidates, &sctx->limits,
1797 if (candidates && mctx->state_log[str_idx]->has_backref)
1799 err = sift_states_bkref (mctx, sctx, str_idx, candidates);
1809 const re_node_set *candidates)
1827 return re_node_set_add_intersect (dest_nodes, candidates,
1834 const re_node_set *candidates)
1857 err = re_node_set_add_intersect (&except_nodes, candidates,
2031 const re_node_set *candidates, re_node_set *limits,
2068 candidates);
2086 candidates);
2106 candidates);
2119 Idx str_idx, const re_node_set *candidates)
2132 for (node_idx = 0; node_idx < candidates->nelem; ++node_idx)
2137 node = candidates->elems[node_idx];
2664 /* Enumerate all the candidates which the backreference BKREF_NODE can match
2666 Note that we might collect inappropriate candidates here.