248     CallBase &CB, InlineFunctionInfo &IFI,  in inlineCallIfPossible()
307                 function_ref<InlineCost(CallBase &CB)> GetInlineCost,  in inlineCallsImpl()
322   SmallVector<std::pair<CallBase *, int>, 16> CallSites;  in inlineCallsImpl()
338         auto *CB = dyn_cast<CallBase>(&I);  in inlineCallsImpl()
394       CallBase &CB = *P.first;  in inlineCallsImpl()
481           DenseSet<CallBase *> DbgCallSites;  in inlineCallsImpl()
488             assert(DbgCallSites.count(dyn_cast<CallBase>(Ptr)) == 0);  in inlineCallsImpl()
491                 std::make_pair(dyn_cast<CallBase>(Ptr), NewHistoryID));  in inlineCallsImpl()
549       [&](CallBase &CB) { return getInlineCost(CB); }, LegacyAARGetter(*this),  in inlineCalls()
735   static Priority evaluate(CallBase *CB) {  in evaluate()
744 class PriorityInlineOrder : public InlineOrder<std::pair<CallBase *, int>> {
745   using T = std::pair<CallBase *, int>;
746   using HeapT = std::pair<CallBase *, PriorityT>;
764       CallBase *CB = Heap.front().first;  in adjust()
781     CallBase *CB = Elt.first;  in push()
794     CallBase *CB = Heap.front().first;  in pop()
806     CallBase *CB = Heap.front().first;  in front()
821   DenseMap<CallBase *, int> InlineHistoryMap;
869   std::unique_ptr<InlineOrder<std::pair<CallBase *, int>>> Calls;  in run()
873     Calls = std::make_unique<DefaultInlineOrder<std::pair<CallBase *, int>>>();  in run()
886       if (auto *CB = dyn_cast<CallBase>(&I))  in run()
951       CallBase *CB = P.first;  in run()
1008         for (CallBase *ICB : reverse(IFI.InlinedCallSites)) {  in run()
1039           Calls->erase_if([&](const std::pair<CallBase *, int> &Call) {  in run()  argument