Lines Matching refs:PartitionContainer

286   unsigned getSize() const { return PartitionContainer.size(); }  in getSize()
292 if (PartitionContainer.empty() || !PartitionContainer.back().hasDepCycle()) in addToCyclicPartition()
293 PartitionContainer.emplace_back(Inst, L, /*DepCycle=*/true); in addToCyclicPartition()
295 PartitionContainer.back().add(Inst); in addToCyclicPartition()
304 PartitionContainer.emplace_back(Inst, L); in addToNewNonCyclicPartition()
361 for (PartitionContainerT::iterator I = PartitionContainer.begin(), in mergeToAvoidDuplicatedLoads()
362 E = PartitionContainer.end(); in mergeToAvoidDuplicatedLoads()
408 PartitionContainer.remove_if( in mergeToAvoidDuplicatedLoads()
418 for (const auto &Partition : PartitionContainer) { in setupPartitionIdOnInstructions()
435 for (auto &P : PartitionContainer) in populateUsedSet()
451 assert(!PartitionContainer.empty() && "at least two partitions expected"); in cloneLoops()
465 for (auto I = std::next(PartitionContainer.rbegin()), in cloneLoops()
466 E = PartitionContainer.rend(); in cloneLoops()
479 setNewLoopID(OrigLoopID, &PartitionContainer.back()); in cloneLoops()
484 for (auto Curr = PartitionContainer.cbegin(), in cloneLoops()
485 Next = std::next(PartitionContainer.cbegin()), in cloneLoops()
486 E = PartitionContainer.cend(); in cloneLoops()
495 for (auto &Partition : PartitionContainer) in removeUnusedInsts()
539 for (const auto &P : PartitionContainer) { in print()
557 for (const auto &P : PartitionContainer) { in printBlocks()
567 PartitionContainerT PartitionContainer; member in __anonc25583c00111::InstPartitionContainer
582 for (auto I = PartitionContainer.begin(); I != PartitionContainer.end();) { in mergeAdjacentPartitionsIf()
589 I = PartitionContainer.erase(I); in mergeAdjacentPartitionsIf()