Lines Matching defs:CB

45 llvm::InlineCost getInlineCostWrapper(CallBase &CB,
48   Function &Caller = *CB.getCaller();
52               *CB.getParent()->getParent()->getParent());
65   Function &Callee = *CB.getCalledFunction();
70   return getInlineCost(CB, Params, CalleeTTI, GetAssumptionCache, GetTLI,
77   SizePriority(const CallBase *CB, FunctionAnalysisManager &,
79     Function *Callee = CB->getCalledFunction();
94   CostPriority(const CallBase *CB, FunctionAnalysisManager &FAM,
96     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);
114   CostBenefitPriority(const CallBase *CB, FunctionAnalysisManager &FAM,
116     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);
185   MLPriority(const CallBase *CB, FunctionAnalysisManager &FAM,
187     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);
213   bool updateAndCheckDecreased(const CallBase *CB) {
214     auto It = Priorities.find(CB);
216     It->second = PriorityT(CB, FAM, Params);
247     CallBase *CB = Elt.first;
250     Heap.push_back(CB);
251     Priorities[CB] = PriorityT(CB, FAM, Params);
253     InlineHistoryMap[CB] = InlineHistoryID;
260     CallBase *CB = Heap.pop_back_val();
261     T Result = std::make_pair(CB, InlineHistoryMap[CB]);
262     InlineHistoryMap.erase(CB);
267     auto PredWrapper = [=](CallBase *CB) -> bool {
268       return Pred(std::make_pair(CB, InlineHistoryMap[CB]));