Searched refs:candidates (Results 1 – 4 of 4) sorted by relevance
617 ScopedArenaVector<SchedulingNode*> candidates(allocator.Adapter(kArenaAllocScheduler)); in Schedule() local623 candidates.push_back(node); in Schedule()630 initial_candidates.assign(candidates.begin(), candidates.end()); in Schedule()635 while (!candidates.empty()) { in Schedule()636 SchedulingNode* node = selector_->PopHighestPriorityNode(&candidates, scheduling_graph); in Schedule()637 Schedule(node, &candidates); in Schedule()651 /*inout*/ ScopedArenaVector<SchedulingNode*>* candidates) { in Schedule() argument660 candidates->push_back(predecessor); in Schedule()670 candidates->push_back(predecessor); in Schedule()
1315 ScopedArenaVector<HBoundsCheck*> candidates( in AddComparesWithDeoptimization() local1331 candidates.clear(); in AddComparesWithDeoptimization()1345 candidates.push_back(other_bounds_check); in AddComparesWithDeoptimization()1358 candidates.push_back(other_bounds_check); in AddComparesWithDeoptimization()1369 if (candidates.size() >= threshold && in AddComparesWithDeoptimization()1373 for (HBoundsCheck* other_bounds_check : candidates) { in AddComparesWithDeoptimization()1434 ScopedArenaVector<HBoundsCheck*> candidates( in TransformLoopForDynamicBCE() local1460 candidates.push_back(other_bounds_check); in TransformLoopForDynamicBCE()1469 candidates.push_back(other_bounds_check); in TransformLoopForDynamicBCE()1474 DCHECK_LT(0u, candidates.size()); in TransformLoopForDynamicBCE()[all …]
448 /*inout*/ ScopedArenaVector<SchedulingNode*>* candidates);
877 const ArenaVector<std::pair<InstructionType*, SlowPathCode*>>& candidates = iter->second; in NewSlowPath() local878 for (const auto& it : candidates) { in NewSlowPath()