45 llvm::InlineCost getInlineCostWrapper(CallBase &CB,  in getInlineCostWrapper()  argument
48   Function &Caller = *CB.getCaller();  in getInlineCostWrapper()
52               *CB.getParent()->getParent()->getParent());  in getInlineCostWrapper()
65   Function &Callee = *CB.getCalledFunction();  in getInlineCostWrapper()
70   return getInlineCost(CB, Params, CalleeTTI, GetAssumptionCache, GetTLI,  in getInlineCostWrapper()
77   SizePriority(const CallBase *CB, FunctionAnalysisManager &,  in SizePriority()  argument
79     Function *Callee = CB->getCalledFunction();  in SizePriority()
94   CostPriority(const CallBase *CB, FunctionAnalysisManager &FAM,  in CostPriority()  argument
96     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);  in CostPriority()
114   CostBenefitPriority(const CallBase *CB, FunctionAnalysisManager &FAM,  in CostBenefitPriority()  argument
116     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);  in CostBenefitPriority()
182   MLPriority(const CallBase *CB, FunctionAnalysisManager &FAM,  in MLPriority()  argument
184     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);  in MLPriority()
210   bool updateAndCheckDecreased(const CallBase *CB) {  in updateAndCheckDecreased()  argument
211     auto It = Priorities.find(CB);  in updateAndCheckDecreased()
213     It->second = PriorityT(CB, FAM, Params);  in updateAndCheckDecreased()
244     CallBase *CB = Elt.first;  in push()  local
247     Heap.push_back(CB);  in push()
248     Priorities[CB] = PriorityT(CB, FAM, Params);  in push()
250     InlineHistoryMap[CB] = InlineHistoryID;  in push()
257     CallBase *CB = Heap.pop_back_val();  in pop()  local
258     T Result = std::make_pair(CB, InlineHistoryMap[CB]);  in pop()
259     InlineHistoryMap.erase(CB);  in pop()
264     auto PredWrapper = [=](CallBase *CB) -> bool {  in erase_if()  argument
265       return Pred(std::make_pair(CB, InlineHistoryMap[CB]));  in erase_if()