Lines Matching defs:candidate
245 dgraph_entry_t * candidate = NULL;
257 candidate = dgraph->graph[candidate_index];
262 if (candidate == scan_entry) {
269 /* If the dependency being checked is the candidate,
270 * then the candidate can't be the root.
274 if (check == candidate) {
275 candidate = NULL;
280 /* If the candidate was rejected, then hop out of this loop.
282 if (!candidate) {
287 /* If we got here, the candidate is a valid one. However, if we already
291 if (candidate) {
294 "(%s and %s)" KNL, root->name, candidate->name);
297 root = candidate;