Lines Matching refs:candidate
18 // the next best candidate to schedule.
30 auto candidate = nodes_.end();
34 candidate = iterator;
39 if (candidate != nodes_.end()) {
40 ScheduleGraphNode* result = *candidate;
41 nodes_.erase(candidate);
52 auto candidate = nodes_.begin();
53 std::advance(candidate, random_number_generator()->NextInt(
55 ScheduleGraphNode* result = *candidate;
56 nodes_.erase(candidate);
228 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle);
230 if (candidate != nullptr) {
231 sequence()->AddInstruction(candidate->instruction());
233 for (ScheduleGraphNode* successor : candidate->successors()) {
236 std::max(successor->start_cycle(), cycle + candidate->latency()));