32   if (Partitioner) {  in writeDOTGraphNode()
33     Partitioner->emitDescription(OS);  in writeDOTGraphNode()
34     OS << "|" << Partitioner->getNumPartitions() << " partitions|";  in writeDOTGraphNode()
48   if (!Partitioner && !IsFullyTraversed)  in writeDOTGraphNode()
50   if (!Partitioner && !IsFullyTested) {  in writeDOTGraphNode()
63   if (!Partitioner &&  in writeDOTGraphNode()
76     Partitioner->emitPartitionName(OS, Child.index());  in writeDOTGraphEdges()
211   for (auto &Partitioner : Partitioners) {  in evaluatePartitioners()  local
213                Partitioner->emitDescription(dbgs()); dbgs() << "\n");  in evaluatePartitioners()
214     Partitioner->repartition(Leaves);  in evaluatePartitioners()
215     LLVM_DEBUG(Partitioner->emitPartitionResults(dbgs()));  in evaluatePartitioners()
230   for (const auto &Partitioner : Partitioners)  in runStep()  local
231     LLVM_DEBUG(dbgs() << "    "; Partitioner->emitDescription(dbgs());  in runStep()
258   for (const auto &Partitioner : Partitioners)  in runStep()  local
259     LLVM_DEBUG(dbgs() << "    "; Partitioner->emitDescription(dbgs());  in runStep()
335   std::unique_ptr<GIMatchTreePartitioner> Partitioner = std::move(*PartitionerI);  in runStep()  local
338              Partitioner->emitDescription(dbgs()); dbgs() << "\n");  in runStep()
340   assert(Partitioner->getNumPartitions() > 0 &&  in runStep()
343   TreeNode->setNumChildren(Partitioner->getNumPartitions());  in runStep()
346     Partitioner->applyForPartition(C.index(), *this, SubtreeBuilders.back());  in runStep()
349   TreeNode->setPartitioner(std::move(Partitioner));  in runStep()
354     for (const auto &Partitioner : Partitioners)  in runStep()  local
355       SubtreeBuilder.addPartitioner(Partitioner->clone());  in runStep()