281   unsigned getSize() const { return PartitionContainer.size(); }  in getSize()
287     if (PartitionContainer.empty() || !PartitionContainer.back().hasDepCycle())  in addToCyclicPartition()
288       PartitionContainer.emplace_back(Inst, L, /*DepCycle=*/true);  in addToCyclicPartition()
290       PartitionContainer.back().add(Inst);  in addToCyclicPartition()
299     PartitionContainer.emplace_back(Inst, L);  in addToNewNonCyclicPartition()
356     for (PartitionContainerT::iterator I = PartitionContainer.begin(),  in mergeToAvoidDuplicatedLoads()
357                                        E = PartitionContainer.end();  in mergeToAvoidDuplicatedLoads()
403     PartitionContainer.remove_if(  in mergeToAvoidDuplicatedLoads()
413     for (const auto &Partition : PartitionContainer) {  in setupPartitionIdOnInstructions()
430     for (auto &P : PartitionContainer)  in populateUsedSet()
446     assert(!PartitionContainer.empty() && "at least two partitions expected");  in cloneLoops()
460     for (auto &Part : llvm::drop_begin(llvm::reverse(PartitionContainer))) {  in cloneLoops()
472     setNewLoopID(OrigLoopID, &PartitionContainer.back());  in cloneLoops()
477     for (auto Curr = PartitionContainer.cbegin(),  in cloneLoops()
478               Next = std::next(PartitionContainer.cbegin()),  in cloneLoops()
479               E = PartitionContainer.cend();  in cloneLoops()
488     for (auto &Partition : PartitionContainer)  in removeUnusedInsts()
532     for (const auto &P : PartitionContainer) {  in print()
550     for (const auto &P : PartitionContainer) {  in printBlocks()
560   PartitionContainerT PartitionContainer;  member in __anonf8d248c20111::InstPartitionContainer
575     for (auto I = PartitionContainer.begin(); I != PartitionContainer.end();) {  in mergeAdjacentPartitionsIf()
582         I = PartitionContainer.erase(I);  in mergeAdjacentPartitionsIf()