Searched refs:candidates (Results 1 – 4 of 4) sorted by relevance
564 ScopedArenaVector<SchedulingNode*> candidates(allocator.Adapter(kArenaAllocScheduler)); in Schedule() local570 candidates.push_back(node); in Schedule()577 initial_candidates.assign(candidates.begin(), candidates.end()); in Schedule()582 while (!candidates.empty()) { in Schedule()583 SchedulingNode* node = selector_->PopHighestPriorityNode(&candidates, scheduling_graph); in Schedule()584 Schedule(node, &candidates); in Schedule()598 /*inout*/ ScopedArenaVector<SchedulingNode*>* candidates) { in Schedule() argument607 candidates->push_back(predecessor); in Schedule()617 candidates->push_back(predecessor); in Schedule()
1428 ScopedArenaVector<HBoundsCheck*> candidates( in AddComparesWithDeoptimization() local1444 candidates.clear(); in AddComparesWithDeoptimization()1458 candidates.push_back(other_bounds_check); in AddComparesWithDeoptimization()1471 candidates.push_back(other_bounds_check); in AddComparesWithDeoptimization()1482 if (candidates.size() >= threshold && in AddComparesWithDeoptimization()1486 for (HBoundsCheck* other_bounds_check : candidates) { in AddComparesWithDeoptimization()1548 ScopedArenaVector<HBoundsCheck*> candidates( in TransformLoopForDynamicBCE() local1575 candidates.push_back(other_bounds_check); in TransformLoopForDynamicBCE()1584 candidates.push_back(other_bounds_check); in TransformLoopForDynamicBCE()1589 DCHECK_LT(0u, candidates.size()); in TransformLoopForDynamicBCE()[all …]
545 /*inout*/ ScopedArenaVector<SchedulingNode*>* candidates);
1009 const ArenaVector<std::pair<InstructionType*, SlowPathCode*>>& candidates = iter->second; in NewSlowPath() local1010 for (const auto& it : candidates) { in NewSlowPath()