285   unsigned getSize() const { return PartitionContainer.size(); }  in getSize()
291     if (PartitionContainer.empty() || !PartitionContainer.back().hasDepCycle())  in addToCyclicPartition()
292       PartitionContainer.emplace_back(Inst, L, /*DepCycle=*/true);  in addToCyclicPartition()
294       PartitionContainer.back().add(Inst);  in addToCyclicPartition()
303     PartitionContainer.emplace_back(Inst, L);  in addToNewNonCyclicPartition()
360     for (PartitionContainerT::iterator I = PartitionContainer.begin(),  in mergeToAvoidDuplicatedLoads()
361                                        E = PartitionContainer.end();  in mergeToAvoidDuplicatedLoads()
407     PartitionContainer.remove_if(  in mergeToAvoidDuplicatedLoads()
417     for (const auto &Partition : PartitionContainer) {  in setupPartitionIdOnInstructions()
434     for (auto &P : PartitionContainer)  in populateUsedSet()
450     assert(!PartitionContainer.empty() && "at least two partitions expected");  in cloneLoops()
464     for (auto I = std::next(PartitionContainer.rbegin()),  in cloneLoops()
465               E = PartitionContainer.rend();  in cloneLoops()
478     setNewLoopID(OrigLoopID, &PartitionContainer.back());  in cloneLoops()
483     for (auto Curr = PartitionContainer.cbegin(),  in cloneLoops()
484               Next = std::next(PartitionContainer.cbegin()),  in cloneLoops()
485               E = PartitionContainer.cend();  in cloneLoops()
494     for (auto &Partition : PartitionContainer)  in removeUnusedInsts()
538     for (const auto &P : PartitionContainer) {  in print()
556     for (const auto &P : PartitionContainer) {  in printBlocks()
566   PartitionContainerT PartitionContainer;  member in __anon4e01e93c0111::InstPartitionContainer
581     for (auto I = PartitionContainer.begin(); I != PartitionContainer.end();) {  in mergeAdjacentPartitionsIf()
588         I = PartitionContainer.erase(I);  in mergeAdjacentPartitionsIf()