33   if (Partitioner) {  in writeDOTGraphNode()
34     Partitioner->emitDescription(OS);  in writeDOTGraphNode()
35     OS << "|" << Partitioner->getNumPartitions() << " partitions|";  in writeDOTGraphNode()
49   if (!Partitioner && !IsFullyTraversed)  in writeDOTGraphNode()
51   if (!Partitioner && !IsFullyTested) {  in writeDOTGraphNode()
64   if (!Partitioner &&  in writeDOTGraphNode()
77     Partitioner->emitPartitionName(OS, Child.index());  in writeDOTGraphEdges()
210   for (auto &Partitioner : Partitioners) {  in evaluatePartitioners()  local
212                Partitioner->emitDescription(dbgs()); dbgs() << "\n");  in evaluatePartitioners()
213     Partitioner->repartition(Leaves);  in evaluatePartitioners()
214     LLVM_DEBUG(Partitioner->emitPartitionResults(dbgs()));  in evaluatePartitioners()
229   for (const auto &Partitioner : Partitioners)  in runStep()  local
230     LLVM_DEBUG(dbgs() << "    "; Partitioner->emitDescription(dbgs());  in runStep()
257   for (const auto &Partitioner : Partitioners)  in runStep()  local
258     LLVM_DEBUG(dbgs() << "    "; Partitioner->emitDescription(dbgs());  in runStep()
333   std::unique_ptr<GIMatchTreePartitioner> Partitioner = std::move(*PartitionerI);  in runStep()  local
336              Partitioner->emitDescription(dbgs()); dbgs() << "\n");  in runStep()
338   assert(Partitioner->getNumPartitions() > 0 &&  in runStep()
341   TreeNode->setNumChildren(Partitioner->getNumPartitions());  in runStep()
344     Partitioner->applyForPartition(C.index(), *this, SubtreeBuilders.back());  in runStep()
347   TreeNode->setPartitioner(std::move(Partitioner));  in runStep()
352     for (const auto &Partitioner : Partitioners)  in runStep()  local
353       SubtreeBuilder.addPartitioner(Partitioner->clone());  in runStep()