216 static void findBestInsertionSet(DominatorTree &DT, BlockFrequencyInfo &BFI,  in findBestInsertionSet()  argument
285       if (InsertPtsFreq > BFI.getBlockFreq(Node) ||  in findBestInsertionSet()
286           (InsertPtsFreq == BFI.getBlockFreq(Node) && InsertPts.size() > 1))  in findBestInsertionSet()
306          (InsertPtsFreq > BFI.getBlockFreq(Node) ||  in findBestInsertionSet()
307           (InsertPtsFreq == BFI.getBlockFreq(Node) && InsertPts.size() > 1)))) {  in findBestInsertionSet()
309       ParentPtsFreq += BFI.getBlockFreq(Node);  in findBestInsertionSet()
335   if (BFI) {  in findConstantInsertionPoint()
336     findBestInsertionSet(*DT, *BFI, Entry, BBs);  in findConstantInsertionPoint()
947                                    DominatorTree &DT, BlockFrequencyInfo *BFI,  in runImpl()  argument
951   this->BFI = BFI;  in runImpl()
957                      llvm::shouldOptimizeForSize(Entry.getParent(), PSI, BFI,  in runImpl()
993   auto BFI = ConstHoistWithBlockFrequency  in run()  local
998   if (!runImpl(F, TTI, DT, BFI, F.getEntryBlock(), PSI))  in run()