Lines Matching refs:PartitionContainer
287 unsigned getSize() const { return PartitionContainer.size(); } in getSize()
293 if (PartitionContainer.empty() || !PartitionContainer.back().hasDepCycle()) in addToCyclicPartition()
294 PartitionContainer.emplace_back(Inst, L, /*DepCycle=*/true); in addToCyclicPartition()
296 PartitionContainer.back().add(Inst); in addToCyclicPartition()
305 PartitionContainer.emplace_back(Inst, L); in addToNewNonCyclicPartition()
362 for (PartitionContainerT::iterator I = PartitionContainer.begin(), in mergeToAvoidDuplicatedLoads()
363 E = PartitionContainer.end(); in mergeToAvoidDuplicatedLoads()
409 PartitionContainer.remove_if( in mergeToAvoidDuplicatedLoads()
419 for (const auto &Partition : PartitionContainer) { in setupPartitionIdOnInstructions()
436 for (auto &P : PartitionContainer) in populateUsedSet()
452 assert(!PartitionContainer.empty() && "at least two partitions expected"); in cloneLoops()
466 for (auto I = std::next(PartitionContainer.rbegin()), in cloneLoops()
467 E = PartitionContainer.rend(); in cloneLoops()
480 setNewLoopID(OrigLoopID, &PartitionContainer.back()); in cloneLoops()
485 for (auto Curr = PartitionContainer.cbegin(), in cloneLoops()
486 Next = std::next(PartitionContainer.cbegin()), in cloneLoops()
487 E = PartitionContainer.cend(); in cloneLoops()
496 for (auto &Partition : PartitionContainer) in removeUnusedInsts()
540 for (const auto &P : PartitionContainer) { in print()
558 for (const auto &P : PartitionContainer) { in printBlocks()
568 PartitionContainerT PartitionContainer; member in __anonfcfe86310111::InstPartitionContainer
583 for (auto I = PartitionContainer.begin(); I != PartitionContainer.end();) { in mergeAdjacentPartitionsIf()
590 I = PartitionContainer.erase(I); in mergeAdjacentPartitionsIf()