1 //===-- IndirectCallPromotion.cpp - Optimizations based on value profiling ===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // This file implements the transformation that promotes indirect calls to 11 // conditional direct calls when the indirect-call value profile metadata is 12 // available. 13 // 14 //===----------------------------------------------------------------------===// 15 16 #include "llvm/ADT/ArrayRef.h" 17 #include "llvm/ADT/Statistic.h" 18 #include "llvm/ADT/StringRef.h" 19 #include "llvm/ADT/Twine.h" 20 #include "llvm/Analysis/BlockFrequencyInfo.h" 21 #include "llvm/Analysis/GlobalsModRef.h" 22 #include "llvm/Analysis/IndirectCallPromotionAnalysis.h" 23 #include "llvm/Analysis/IndirectCallSiteVisitor.h" 24 #include "llvm/Analysis/OptimizationDiagnosticInfo.h" 25 #include "llvm/Analysis/ProfileSummaryInfo.h" 26 #include "llvm/IR/BasicBlock.h" 27 #include "llvm/IR/CallSite.h" 28 #include "llvm/IR/DerivedTypes.h" 29 #include "llvm/IR/DiagnosticInfo.h" 30 #include "llvm/IR/Function.h" 31 #include "llvm/IR/IRBuilder.h" 32 #include "llvm/IR/InstrTypes.h" 33 #include "llvm/IR/Instruction.h" 34 #include "llvm/IR/Instructions.h" 35 #include "llvm/IR/LLVMContext.h" 36 #include "llvm/IR/MDBuilder.h" 37 #include "llvm/IR/PassManager.h" 38 #include "llvm/IR/Type.h" 39 #include "llvm/Pass.h" 40 #include "llvm/PassRegistry.h" 41 #include "llvm/PassSupport.h" 42 #include "llvm/ProfileData/InstrProf.h" 43 #include "llvm/Support/Casting.h" 44 #include "llvm/Support/CommandLine.h" 45 #include "llvm/Support/Debug.h" 46 #include "llvm/Support/ErrorHandling.h" 47 #include "llvm/Support/MathExtras.h" 48 #include "llvm/Transforms/Instrumentation.h" 49 #include "llvm/Transforms/PGOInstrumentation.h" 50 #include "llvm/Transforms/Utils/BasicBlockUtils.h" 51 #include <cassert> 52 #include <cstdint> 53 #include <vector> 54 55 using namespace llvm; 56 57 #define DEBUG_TYPE "pgo-icall-prom" 58 59 STATISTIC(NumOfPGOICallPromotion, "Number of indirect call promotions."); 60 STATISTIC(NumOfPGOICallsites, "Number of indirect call candidate sites."); 61 62 // Command line option to disable indirect-call promotion with the default as 63 // false. This is for debug purpose. 64 static cl::opt<bool> DisableICP("disable-icp", cl::init(false), cl::Hidden, 65 cl::desc("Disable indirect call promotion")); 66 67 // Set the cutoff value for the promotion. If the value is other than 0, we 68 // stop the transformation once the total number of promotions equals the cutoff 69 // value. 70 // For debug use only. 71 static cl::opt<unsigned> 72 ICPCutOff("icp-cutoff", cl::init(0), cl::Hidden, cl::ZeroOrMore, 73 cl::desc("Max number of promotions for this compilation")); 74 75 // If ICPCSSkip is non zero, the first ICPCSSkip callsites will be skipped. 76 // For debug use only. 77 static cl::opt<unsigned> 78 ICPCSSkip("icp-csskip", cl::init(0), cl::Hidden, cl::ZeroOrMore, 79 cl::desc("Skip Callsite up to this number for this compilation")); 80 81 // Set if the pass is called in LTO optimization. The difference for LTO mode 82 // is the pass won't prefix the source module name to the internal linkage 83 // symbols. 84 static cl::opt<bool> ICPLTOMode("icp-lto", cl::init(false), cl::Hidden, 85 cl::desc("Run indirect-call promotion in LTO " 86 "mode")); 87 88 // Set if the pass is called in SamplePGO mode. The difference for SamplePGO 89 // mode is it will add prof metadatato the created direct call. 90 static cl::opt<bool> 91 ICPSamplePGOMode("icp-samplepgo", cl::init(false), cl::Hidden, 92 cl::desc("Run indirect-call promotion in SamplePGO mode")); 93 94 // If the option is set to true, only call instructions will be considered for 95 // transformation -- invoke instructions will be ignored. 96 static cl::opt<bool> 97 ICPCallOnly("icp-call-only", cl::init(false), cl::Hidden, 98 cl::desc("Run indirect-call promotion for call instructions " 99 "only")); 100 101 // If the option is set to true, only invoke instructions will be considered for 102 // transformation -- call instructions will be ignored. 103 static cl::opt<bool> ICPInvokeOnly("icp-invoke-only", cl::init(false), 104 cl::Hidden, 105 cl::desc("Run indirect-call promotion for " 106 "invoke instruction only")); 107 108 // Dump the function level IR if the transformation happened in this 109 // function. For debug use only. 110 static cl::opt<bool> 111 ICPDUMPAFTER("icp-dumpafter", cl::init(false), cl::Hidden, 112 cl::desc("Dump IR after transformation happens")); 113 114 namespace { 115 class PGOIndirectCallPromotionLegacyPass : public ModulePass { 116 public: 117 static char ID; 118 119 PGOIndirectCallPromotionLegacyPass(bool InLTO = false, bool SamplePGO = false) 120 : ModulePass(ID), InLTO(InLTO), SamplePGO(SamplePGO) { 121 initializePGOIndirectCallPromotionLegacyPassPass( 122 *PassRegistry::getPassRegistry()); 123 } 124 125 void getAnalysisUsage(AnalysisUsage &AU) const override { 126 AU.addRequired<ProfileSummaryInfoWrapperPass>(); 127 } 128 129 StringRef getPassName() const override { return "PGOIndirectCallPromotion"; } 130 131 private: 132 bool runOnModule(Module &M) override; 133 134 // If this pass is called in LTO. We need to special handling the PGOFuncName 135 // for the static variables due to LTO's internalization. 136 bool InLTO; 137 138 // If this pass is called in SamplePGO. We need to add the prof metadata to 139 // the promoted direct call. 140 bool SamplePGO; 141 }; 142 } // end anonymous namespace 143 144 char PGOIndirectCallPromotionLegacyPass::ID = 0; 145 INITIALIZE_PASS_BEGIN(PGOIndirectCallPromotionLegacyPass, "pgo-icall-prom", 146 "Use PGO instrumentation profile to promote indirect " 147 "calls to direct calls.", 148 false, false) 149 INITIALIZE_PASS_DEPENDENCY(ProfileSummaryInfoWrapperPass) 150 INITIALIZE_PASS_END(PGOIndirectCallPromotionLegacyPass, "pgo-icall-prom", 151 "Use PGO instrumentation profile to promote indirect " 152 "calls to direct calls.", 153 false, false) 154 155 ModulePass *llvm::createPGOIndirectCallPromotionLegacyPass(bool InLTO, 156 bool SamplePGO) { 157 return new PGOIndirectCallPromotionLegacyPass(InLTO, SamplePGO); 158 } 159 160 namespace { 161 // The class for main data structure to promote indirect calls to conditional 162 // direct calls. 163 class ICallPromotionFunc { 164 private: 165 Function &F; 166 Module *M; 167 168 // Symtab that maps indirect call profile values to function names and 169 // defines. 170 InstrProfSymtab *Symtab; 171 172 bool SamplePGO; 173 174 OptimizationRemarkEmitter &ORE; 175 176 // A struct that records the direct target and it's call count. 177 struct PromotionCandidate { 178 Function *TargetFunction; 179 uint64_t Count; 180 PromotionCandidate(Function *F, uint64_t C) : TargetFunction(F), Count(C) {} 181 }; 182 183 // Check if the indirect-call call site should be promoted. Return the number 184 // of promotions. Inst is the candidate indirect call, ValueDataRef 185 // contains the array of value profile data for profiled targets, 186 // TotalCount is the total profiled count of call executions, and 187 // NumCandidates is the number of candidate entries in ValueDataRef. 188 std::vector<PromotionCandidate> getPromotionCandidatesForCallSite( 189 Instruction *Inst, const ArrayRef<InstrProfValueData> &ValueDataRef, 190 uint64_t TotalCount, uint32_t NumCandidates); 191 192 // Promote a list of targets for one indirect-call callsite. Return 193 // the number of promotions. 194 uint32_t tryToPromote(Instruction *Inst, 195 const std::vector<PromotionCandidate> &Candidates, 196 uint64_t &TotalCount); 197 198 // Noncopyable 199 ICallPromotionFunc(const ICallPromotionFunc &other) = delete; 200 ICallPromotionFunc &operator=(const ICallPromotionFunc &other) = delete; 201 202 public: 203 ICallPromotionFunc(Function &Func, Module *Modu, InstrProfSymtab *Symtab, 204 bool SamplePGO, OptimizationRemarkEmitter &ORE) 205 : F(Func), M(Modu), Symtab(Symtab), SamplePGO(SamplePGO), ORE(ORE) {} 206 207 bool processFunction(ProfileSummaryInfo *PSI); 208 }; 209 } // end anonymous namespace 210 211 bool llvm::isLegalToPromote(Instruction *Inst, Function *F, 212 const char **Reason) { 213 // Check the return type. 214 Type *CallRetType = Inst->getType(); 215 if (!CallRetType->isVoidTy()) { 216 Type *FuncRetType = F->getReturnType(); 217 if (FuncRetType != CallRetType && 218 !CastInst::isBitCastable(FuncRetType, CallRetType)) { 219 if (Reason) 220 *Reason = "Return type mismatch"; 221 return false; 222 } 223 } 224 225 // Check if the arguments are compatible with the parameters 226 FunctionType *DirectCalleeType = F->getFunctionType(); 227 unsigned ParamNum = DirectCalleeType->getFunctionNumParams(); 228 CallSite CS(Inst); 229 unsigned ArgNum = CS.arg_size(); 230 231 if (ParamNum != ArgNum && !DirectCalleeType->isVarArg()) { 232 if (Reason) 233 *Reason = "The number of arguments mismatch"; 234 return false; 235 } 236 237 for (unsigned I = 0; I < ParamNum; ++I) { 238 Type *PTy = DirectCalleeType->getFunctionParamType(I); 239 Type *ATy = CS.getArgument(I)->getType(); 240 if (PTy == ATy) 241 continue; 242 if (!CastInst::castIsValid(Instruction::BitCast, CS.getArgument(I), PTy)) { 243 if (Reason) 244 *Reason = "Argument type mismatch"; 245 return false; 246 } 247 } 248 249 DEBUG(dbgs() << " #" << NumOfPGOICallPromotion << " Promote the icall to " 250 << F->getName() << "\n"); 251 return true; 252 } 253 254 // Indirect-call promotion heuristic. The direct targets are sorted based on 255 // the count. Stop at the first target that is not promoted. 256 std::vector<ICallPromotionFunc::PromotionCandidate> 257 ICallPromotionFunc::getPromotionCandidatesForCallSite( 258 Instruction *Inst, const ArrayRef<InstrProfValueData> &ValueDataRef, 259 uint64_t TotalCount, uint32_t NumCandidates) { 260 std::vector<PromotionCandidate> Ret; 261 262 DEBUG(dbgs() << " \nWork on callsite #" << NumOfPGOICallsites << *Inst 263 << " Num_targets: " << ValueDataRef.size() 264 << " Num_candidates: " << NumCandidates << "\n"); 265 NumOfPGOICallsites++; 266 if (ICPCSSkip != 0 && NumOfPGOICallsites <= ICPCSSkip) { 267 DEBUG(dbgs() << " Skip: User options.\n"); 268 return Ret; 269 } 270 271 for (uint32_t I = 0; I < NumCandidates; I++) { 272 uint64_t Count = ValueDataRef[I].Count; 273 assert(Count <= TotalCount); 274 uint64_t Target = ValueDataRef[I].Value; 275 DEBUG(dbgs() << " Candidate " << I << " Count=" << Count 276 << " Target_func: " << Target << "\n"); 277 278 if (ICPInvokeOnly && dyn_cast<CallInst>(Inst)) { 279 DEBUG(dbgs() << " Not promote: User options.\n"); 280 ORE.emit(OptimizationRemarkMissed(DEBUG_TYPE, "UserOptions", Inst) 281 << " Not promote: User options"); 282 break; 283 } 284 if (ICPCallOnly && dyn_cast<InvokeInst>(Inst)) { 285 DEBUG(dbgs() << " Not promote: User option.\n"); 286 ORE.emit(OptimizationRemarkMissed(DEBUG_TYPE, "UserOptions", Inst) 287 << " Not promote: User options"); 288 break; 289 } 290 if (ICPCutOff != 0 && NumOfPGOICallPromotion >= ICPCutOff) { 291 DEBUG(dbgs() << " Not promote: Cutoff reached.\n"); 292 ORE.emit(OptimizationRemarkMissed(DEBUG_TYPE, "CutOffReached", Inst) 293 << " Not promote: Cutoff reached"); 294 break; 295 } 296 297 Function *TargetFunction = Symtab->getFunction(Target); 298 if (TargetFunction == nullptr) { 299 DEBUG(dbgs() << " Not promote: Cannot find the target\n"); 300 ORE.emit(OptimizationRemarkMissed(DEBUG_TYPE, "UnableToFindTarget", Inst) 301 << "Cannot promote indirect call: target not found"); 302 break; 303 } 304 305 const char *Reason = nullptr; 306 if (!isLegalToPromote(Inst, TargetFunction, &Reason)) { 307 using namespace ore; 308 ORE.emit(OptimizationRemarkMissed(DEBUG_TYPE, "UnableToPromote", Inst) 309 << "Cannot promote indirect call to " 310 << NV("TargetFunction", TargetFunction) << " with count of " 311 << NV("Count", Count) << ": " << Reason); 312 break; 313 } 314 315 Ret.push_back(PromotionCandidate(TargetFunction, Count)); 316 TotalCount -= Count; 317 } 318 return Ret; 319 } 320 321 // Create a diamond structure for If_Then_Else. Also update the profile 322 // count. Do the fix-up for the invoke instruction. 323 static void createIfThenElse(Instruction *Inst, Function *DirectCallee, 324 uint64_t Count, uint64_t TotalCount, 325 BasicBlock **DirectCallBB, 326 BasicBlock **IndirectCallBB, 327 BasicBlock **MergeBB) { 328 CallSite CS(Inst); 329 Value *OrigCallee = CS.getCalledValue(); 330 331 IRBuilder<> BBBuilder(Inst); 332 LLVMContext &Ctx = Inst->getContext(); 333 Value *BCI1 = 334 BBBuilder.CreateBitCast(OrigCallee, Type::getInt8PtrTy(Ctx), ""); 335 Value *BCI2 = 336 BBBuilder.CreateBitCast(DirectCallee, Type::getInt8PtrTy(Ctx), ""); 337 Value *PtrCmp = BBBuilder.CreateICmpEQ(BCI1, BCI2, ""); 338 339 uint64_t ElseCount = TotalCount - Count; 340 uint64_t MaxCount = (Count >= ElseCount ? Count : ElseCount); 341 uint64_t Scale = calculateCountScale(MaxCount); 342 MDBuilder MDB(Inst->getContext()); 343 MDNode *BranchWeights = MDB.createBranchWeights( 344 scaleBranchCount(Count, Scale), scaleBranchCount(ElseCount, Scale)); 345 TerminatorInst *ThenTerm, *ElseTerm; 346 SplitBlockAndInsertIfThenElse(PtrCmp, Inst, &ThenTerm, &ElseTerm, 347 BranchWeights); 348 *DirectCallBB = ThenTerm->getParent(); 349 (*DirectCallBB)->setName("if.true.direct_targ"); 350 *IndirectCallBB = ElseTerm->getParent(); 351 (*IndirectCallBB)->setName("if.false.orig_indirect"); 352 *MergeBB = Inst->getParent(); 353 (*MergeBB)->setName("if.end.icp"); 354 355 // Special handing of Invoke instructions. 356 InvokeInst *II = dyn_cast<InvokeInst>(Inst); 357 if (!II) 358 return; 359 360 // We don't need branch instructions for invoke. 361 ThenTerm->eraseFromParent(); 362 ElseTerm->eraseFromParent(); 363 364 // Add jump from Merge BB to the NormalDest. This is needed for the newly 365 // created direct invoke stmt -- as its NormalDst will be fixed up to MergeBB. 366 BranchInst::Create(II->getNormalDest(), *MergeBB); 367 } 368 369 // Find the PHI in BB that have the CallResult as the operand. 370 static bool getCallRetPHINode(BasicBlock *BB, Instruction *Inst) { 371 BasicBlock *From = Inst->getParent(); 372 for (auto &I : *BB) { 373 PHINode *PHI = dyn_cast<PHINode>(&I); 374 if (!PHI) 375 continue; 376 int IX = PHI->getBasicBlockIndex(From); 377 if (IX == -1) 378 continue; 379 Value *V = PHI->getIncomingValue(IX); 380 if (dyn_cast<Instruction>(V) == Inst) 381 return true; 382 } 383 return false; 384 } 385 386 // This method fixes up PHI nodes in BB where BB is the UnwindDest of an 387 // invoke instruction. In BB, there may be PHIs with incoming block being 388 // OrigBB (the MergeBB after if-then-else splitting). After moving the invoke 389 // instructions to its own BB, OrigBB is no longer the predecessor block of BB. 390 // Instead two new predecessors are added: IndirectCallBB and DirectCallBB, 391 // so the PHI node's incoming BBs need to be fixed up accordingly. 392 static void fixupPHINodeForUnwind(Instruction *Inst, BasicBlock *BB, 393 BasicBlock *OrigBB, 394 BasicBlock *IndirectCallBB, 395 BasicBlock *DirectCallBB) { 396 for (auto &I : *BB) { 397 PHINode *PHI = dyn_cast<PHINode>(&I); 398 if (!PHI) 399 continue; 400 int IX = PHI->getBasicBlockIndex(OrigBB); 401 if (IX == -1) 402 continue; 403 Value *V = PHI->getIncomingValue(IX); 404 PHI->addIncoming(V, IndirectCallBB); 405 PHI->setIncomingBlock(IX, DirectCallBB); 406 } 407 } 408 409 // This method fixes up PHI nodes in BB where BB is the NormalDest of an 410 // invoke instruction. In BB, there may be PHIs with incoming block being 411 // OrigBB (the MergeBB after if-then-else splitting). After moving the invoke 412 // instructions to its own BB, a new incoming edge will be added to the original 413 // NormalDstBB from the IndirectCallBB. 414 static void fixupPHINodeForNormalDest(Instruction *Inst, BasicBlock *BB, 415 BasicBlock *OrigBB, 416 BasicBlock *IndirectCallBB, 417 Instruction *NewInst) { 418 for (auto &I : *BB) { 419 PHINode *PHI = dyn_cast<PHINode>(&I); 420 if (!PHI) 421 continue; 422 int IX = PHI->getBasicBlockIndex(OrigBB); 423 if (IX == -1) 424 continue; 425 Value *V = PHI->getIncomingValue(IX); 426 if (dyn_cast<Instruction>(V) == Inst) { 427 PHI->setIncomingBlock(IX, IndirectCallBB); 428 PHI->addIncoming(NewInst, OrigBB); 429 continue; 430 } 431 PHI->addIncoming(V, IndirectCallBB); 432 } 433 } 434 435 // Add a bitcast instruction to the direct-call return value if needed. 436 static Instruction *insertCallRetCast(const Instruction *Inst, 437 Instruction *DirectCallInst, 438 Function *DirectCallee) { 439 if (Inst->getType()->isVoidTy()) 440 return DirectCallInst; 441 442 Type *CallRetType = Inst->getType(); 443 Type *FuncRetType = DirectCallee->getReturnType(); 444 if (FuncRetType == CallRetType) 445 return DirectCallInst; 446 447 BasicBlock *InsertionBB; 448 if (CallInst *CI = dyn_cast<CallInst>(DirectCallInst)) 449 InsertionBB = CI->getParent(); 450 else 451 InsertionBB = (dyn_cast<InvokeInst>(DirectCallInst))->getNormalDest(); 452 453 return (new BitCastInst(DirectCallInst, CallRetType, "", 454 InsertionBB->getTerminator())); 455 } 456 457 // Create a DirectCall instruction in the DirectCallBB. 458 // Parameter Inst is the indirect-call (invoke) instruction. 459 // DirectCallee is the decl of the direct-call (invoke) target. 460 // DirecallBB is the BB that the direct-call (invoke) instruction is inserted. 461 // MergeBB is the bottom BB of the if-then-else-diamond after the 462 // transformation. For invoke instruction, the edges from DirectCallBB and 463 // IndirectCallBB to MergeBB are removed before this call (during 464 // createIfThenElse). Stores the pointer to the Instruction that cast 465 // the direct call in \p CastInst. 466 static Instruction *createDirectCallInst(const Instruction *Inst, 467 Function *DirectCallee, 468 BasicBlock *DirectCallBB, 469 BasicBlock *MergeBB, 470 Instruction *&CastInst) { 471 Instruction *NewInst = Inst->clone(); 472 if (CallInst *CI = dyn_cast<CallInst>(NewInst)) { 473 CI->setCalledFunction(DirectCallee); 474 CI->mutateFunctionType(DirectCallee->getFunctionType()); 475 } else { 476 // Must be an invoke instruction. Direct invoke's normal destination is 477 // fixed up to MergeBB. MergeBB is the place where return cast is inserted. 478 // Also since IndirectCallBB does not have an edge to MergeBB, there is no 479 // need to insert new PHIs into MergeBB. 480 InvokeInst *II = dyn_cast<InvokeInst>(NewInst); 481 assert(II); 482 II->setCalledFunction(DirectCallee); 483 II->mutateFunctionType(DirectCallee->getFunctionType()); 484 II->setNormalDest(MergeBB); 485 } 486 487 DirectCallBB->getInstList().insert(DirectCallBB->getFirstInsertionPt(), 488 NewInst); 489 490 // Clear the value profile data. 491 NewInst->setMetadata(LLVMContext::MD_prof, nullptr); 492 CallSite NewCS(NewInst); 493 FunctionType *DirectCalleeType = DirectCallee->getFunctionType(); 494 unsigned ParamNum = DirectCalleeType->getFunctionNumParams(); 495 for (unsigned I = 0; I < ParamNum; ++I) { 496 Type *ATy = NewCS.getArgument(I)->getType(); 497 Type *PTy = DirectCalleeType->getParamType(I); 498 if (ATy != PTy) { 499 BitCastInst *BI = new BitCastInst(NewCS.getArgument(I), PTy, "", NewInst); 500 NewCS.setArgument(I, BI); 501 } 502 } 503 504 CastInst = insertCallRetCast(Inst, NewInst, DirectCallee); 505 return NewInst; 506 } 507 508 // Create a PHI to unify the return values of calls. 509 static void insertCallRetPHI(Instruction *Inst, Instruction *CallResult, 510 Function *DirectCallee) { 511 if (Inst->getType()->isVoidTy()) 512 return; 513 514 if (Inst->use_empty()) 515 return; 516 517 BasicBlock *RetValBB = CallResult->getParent(); 518 519 BasicBlock *PHIBB; 520 if (InvokeInst *II = dyn_cast<InvokeInst>(CallResult)) 521 RetValBB = II->getNormalDest(); 522 523 PHIBB = RetValBB->getSingleSuccessor(); 524 if (getCallRetPHINode(PHIBB, Inst)) 525 return; 526 527 PHINode *CallRetPHI = PHINode::Create(Inst->getType(), 0); 528 PHIBB->getInstList().push_front(CallRetPHI); 529 Inst->replaceAllUsesWith(CallRetPHI); 530 CallRetPHI->addIncoming(Inst, Inst->getParent()); 531 CallRetPHI->addIncoming(CallResult, RetValBB); 532 } 533 534 // This function does the actual indirect-call promotion transformation: 535 // For an indirect-call like: 536 // Ret = (*Foo)(Args); 537 // It transforms to: 538 // if (Foo == DirectCallee) 539 // Ret1 = DirectCallee(Args); 540 // else 541 // Ret2 = (*Foo)(Args); 542 // Ret = phi(Ret1, Ret2); 543 // It adds type casts for the args do not match the parameters and the return 544 // value. Branch weights metadata also updated. 545 // If \p AttachProfToDirectCall is true, a prof metadata is attached to the 546 // new direct call to contain \p Count. This is used by SamplePGO inliner to 547 // check callsite hotness. 548 // Returns the promoted direct call instruction. 549 Instruction *llvm::promoteIndirectCall(Instruction *Inst, 550 Function *DirectCallee, uint64_t Count, 551 uint64_t TotalCount, 552 bool AttachProfToDirectCall, 553 OptimizationRemarkEmitter *ORE) { 554 assert(DirectCallee != nullptr); 555 BasicBlock *BB = Inst->getParent(); 556 // Just to suppress the non-debug build warning. 557 (void)BB; 558 DEBUG(dbgs() << "\n\n== Basic Block Before ==\n"); 559 DEBUG(dbgs() << *BB << "\n"); 560 561 BasicBlock *DirectCallBB, *IndirectCallBB, *MergeBB; 562 createIfThenElse(Inst, DirectCallee, Count, TotalCount, &DirectCallBB, 563 &IndirectCallBB, &MergeBB); 564 565 // If the return type of the NewInst is not the same as the Inst, a CastInst 566 // is needed for type casting. Otherwise CastInst is the same as NewInst. 567 Instruction *CastInst = nullptr; 568 Instruction *NewInst = 569 createDirectCallInst(Inst, DirectCallee, DirectCallBB, MergeBB, CastInst); 570 571 if (AttachProfToDirectCall) { 572 SmallVector<uint32_t, 1> Weights; 573 Weights.push_back(Count); 574 MDBuilder MDB(NewInst->getContext()); 575 NewInst->setMetadata(LLVMContext::MD_prof, MDB.createBranchWeights(Weights)); 576 } 577 578 // Move Inst from MergeBB to IndirectCallBB. 579 Inst->removeFromParent(); 580 IndirectCallBB->getInstList().insert(IndirectCallBB->getFirstInsertionPt(), 581 Inst); 582 583 if (InvokeInst *II = dyn_cast<InvokeInst>(Inst)) { 584 // At this point, the original indirect invoke instruction has the original 585 // UnwindDest and NormalDest. For the direct invoke instruction, the 586 // NormalDest points to MergeBB, and MergeBB jumps to the original 587 // NormalDest. MergeBB might have a new bitcast instruction for the return 588 // value. The PHIs are with the original NormalDest. Since we now have two 589 // incoming edges to NormalDest and UnwindDest, we have to do some fixups. 590 // 591 // UnwindDest will not use the return value. So pass nullptr here. 592 fixupPHINodeForUnwind(Inst, II->getUnwindDest(), MergeBB, IndirectCallBB, 593 DirectCallBB); 594 // We don't need to update the operand from NormalDest for DirectCallBB. 595 // Pass nullptr here. 596 fixupPHINodeForNormalDest(Inst, II->getNormalDest(), MergeBB, 597 IndirectCallBB, CastInst); 598 } 599 600 insertCallRetPHI(Inst, CastInst, DirectCallee); 601 602 DEBUG(dbgs() << "\n== Basic Blocks After ==\n"); 603 DEBUG(dbgs() << *BB << *DirectCallBB << *IndirectCallBB << *MergeBB << "\n"); 604 605 using namespace ore; 606 if (ORE) 607 ORE->emit(OptimizationRemark(DEBUG_TYPE, "Promoted", Inst) 608 << "Promote indirect call to " << NV("DirectCallee", DirectCallee) 609 << " with count " << NV("Count", Count) << " out of " 610 << NV("TotalCount", TotalCount)); 611 return NewInst; 612 } 613 614 // Promote indirect-call to conditional direct-call for one callsite. 615 uint32_t ICallPromotionFunc::tryToPromote( 616 Instruction *Inst, const std::vector<PromotionCandidate> &Candidates, 617 uint64_t &TotalCount) { 618 uint32_t NumPromoted = 0; 619 620 for (auto &C : Candidates) { 621 uint64_t Count = C.Count; 622 promoteIndirectCall(Inst, C.TargetFunction, Count, TotalCount, SamplePGO, 623 &ORE); 624 assert(TotalCount >= Count); 625 TotalCount -= Count; 626 NumOfPGOICallPromotion++; 627 NumPromoted++; 628 } 629 return NumPromoted; 630 } 631 632 // Traverse all the indirect-call callsite and get the value profile 633 // annotation to perform indirect-call promotion. 634 bool ICallPromotionFunc::processFunction(ProfileSummaryInfo *PSI) { 635 bool Changed = false; 636 ICallPromotionAnalysis ICallAnalysis; 637 for (auto &I : findIndirectCallSites(F)) { 638 uint32_t NumVals, NumCandidates; 639 uint64_t TotalCount; 640 auto ICallProfDataRef = ICallAnalysis.getPromotionCandidatesForInstruction( 641 I, NumVals, TotalCount, NumCandidates); 642 if (!NumCandidates || 643 (PSI && PSI->hasProfileSummary() && !PSI->isHotCount(TotalCount))) 644 continue; 645 auto PromotionCandidates = getPromotionCandidatesForCallSite( 646 I, ICallProfDataRef, TotalCount, NumCandidates); 647 uint32_t NumPromoted = tryToPromote(I, PromotionCandidates, TotalCount); 648 if (NumPromoted == 0) 649 continue; 650 651 Changed = true; 652 // Adjust the MD.prof metadata. First delete the old one. 653 I->setMetadata(LLVMContext::MD_prof, nullptr); 654 // If all promoted, we don't need the MD.prof metadata. 655 if (TotalCount == 0 || NumPromoted == NumVals) 656 continue; 657 // Otherwise we need update with the un-promoted records back. 658 annotateValueSite(*M, *I, ICallProfDataRef.slice(NumPromoted), TotalCount, 659 IPVK_IndirectCallTarget, NumCandidates); 660 } 661 return Changed; 662 } 663 664 // A wrapper function that does the actual work. 665 static bool promoteIndirectCalls(Module &M, ProfileSummaryInfo *PSI, 666 bool InLTO, bool SamplePGO, 667 ModuleAnalysisManager *AM = nullptr) { 668 if (DisableICP) 669 return false; 670 InstrProfSymtab Symtab; 671 if (Error E = Symtab.create(M, InLTO)) { 672 std::string SymtabFailure = toString(std::move(E)); 673 DEBUG(dbgs() << "Failed to create symtab: " << SymtabFailure << "\n"); 674 (void)SymtabFailure; 675 return false; 676 } 677 bool Changed = false; 678 for (auto &F : M) { 679 if (F.isDeclaration()) 680 continue; 681 if (F.hasFnAttribute(Attribute::OptimizeNone)) 682 continue; 683 684 std::unique_ptr<OptimizationRemarkEmitter> OwnedORE; 685 OptimizationRemarkEmitter *ORE; 686 if (AM) { 687 auto &FAM = 688 AM->getResult<FunctionAnalysisManagerModuleProxy>(M).getManager(); 689 ORE = &FAM.getResult<OptimizationRemarkEmitterAnalysis>(F); 690 } else { 691 OwnedORE = make_unique<OptimizationRemarkEmitter>(&F); 692 ORE = OwnedORE.get(); 693 } 694 695 ICallPromotionFunc ICallPromotion(F, &M, &Symtab, SamplePGO, *ORE); 696 bool FuncChanged = ICallPromotion.processFunction(PSI); 697 if (ICPDUMPAFTER && FuncChanged) { 698 DEBUG(dbgs() << "\n== IR Dump After =="; F.print(dbgs())); 699 DEBUG(dbgs() << "\n"); 700 } 701 Changed |= FuncChanged; 702 if (ICPCutOff != 0 && NumOfPGOICallPromotion >= ICPCutOff) { 703 DEBUG(dbgs() << " Stop: Cutoff reached.\n"); 704 break; 705 } 706 } 707 return Changed; 708 } 709 710 bool PGOIndirectCallPromotionLegacyPass::runOnModule(Module &M) { 711 ProfileSummaryInfo *PSI = 712 getAnalysis<ProfileSummaryInfoWrapperPass>().getPSI(); 713 714 // Command-line option has the priority for InLTO. 715 return promoteIndirectCalls(M, PSI, InLTO | ICPLTOMode, 716 SamplePGO | ICPSamplePGOMode); 717 } 718 719 PreservedAnalyses PGOIndirectCallPromotion::run(Module &M, 720 ModuleAnalysisManager &AM) { 721 ProfileSummaryInfo *PSI = &AM.getResult<ProfileSummaryAnalysis>(M); 722 723 if (!promoteIndirectCalls(M, PSI, InLTO | ICPLTOMode, 724 SamplePGO | ICPSamplePGOMode, &AM)) 725 return PreservedAnalyses::all(); 726 727 return PreservedAnalyses::none(); 728 } 729