1 //===-- InstrProfiling.cpp - Frontend instrumentation based profiling -----===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 // 9 // This pass lowers instrprof_* intrinsics emitted by a frontend for profiling. 10 // It also builds the data structures and initialization code needed for 11 // updating execution counts and emitting the profile at runtime. 12 // 13 //===----------------------------------------------------------------------===// 14 15 #include "llvm/Transforms/Instrumentation/InstrProfiling.h" 16 #include "llvm/ADT/ArrayRef.h" 17 #include "llvm/ADT/SmallVector.h" 18 #include "llvm/ADT/StringRef.h" 19 #include "llvm/ADT/Triple.h" 20 #include "llvm/ADT/Twine.h" 21 #include "llvm/Analysis/BlockFrequencyInfo.h" 22 #include "llvm/Analysis/BranchProbabilityInfo.h" 23 #include "llvm/Analysis/LoopInfo.h" 24 #include "llvm/Analysis/TargetLibraryInfo.h" 25 #include "llvm/IR/Attributes.h" 26 #include "llvm/IR/BasicBlock.h" 27 #include "llvm/IR/Constant.h" 28 #include "llvm/IR/Constants.h" 29 #include "llvm/IR/DerivedTypes.h" 30 #include "llvm/IR/Dominators.h" 31 #include "llvm/IR/Function.h" 32 #include "llvm/IR/GlobalValue.h" 33 #include "llvm/IR/GlobalVariable.h" 34 #include "llvm/IR/IRBuilder.h" 35 #include "llvm/IR/Instruction.h" 36 #include "llvm/IR/Instructions.h" 37 #include "llvm/IR/IntrinsicInst.h" 38 #include "llvm/IR/Module.h" 39 #include "llvm/IR/Type.h" 40 #include "llvm/InitializePasses.h" 41 #include "llvm/Pass.h" 42 #include "llvm/ProfileData/InstrProf.h" 43 #include "llvm/Support/Casting.h" 44 #include "llvm/Support/CommandLine.h" 45 #include "llvm/Support/Error.h" 46 #include "llvm/Support/ErrorHandling.h" 47 #include "llvm/Transforms/Utils/BasicBlockUtils.h" 48 #include "llvm/Transforms/Utils/ModuleUtils.h" 49 #include "llvm/Transforms/Utils/SSAUpdater.h" 50 #include <algorithm> 51 #include <cassert> 52 #include <cstddef> 53 #include <cstdint> 54 #include <string> 55 56 using namespace llvm; 57 58 #define DEBUG_TYPE "instrprof" 59 60 namespace { 61 62 cl::opt<bool> DoHashBasedCounterSplit( 63 "hash-based-counter-split", 64 cl::desc("Rename counter variable of a comdat function based on cfg hash"), 65 cl::init(true)); 66 67 cl::opt<bool> RuntimeCounterRelocation( 68 "runtime-counter-relocation", 69 cl::desc("Enable relocating counters at runtime."), 70 cl::init(false)); 71 72 cl::opt<bool> ValueProfileStaticAlloc( 73 "vp-static-alloc", 74 cl::desc("Do static counter allocation for value profiler"), 75 cl::init(true)); 76 77 cl::opt<double> NumCountersPerValueSite( 78 "vp-counters-per-site", 79 cl::desc("The average number of profile counters allocated " 80 "per value profiling site."), 81 // This is set to a very small value because in real programs, only 82 // a very small percentage of value sites have non-zero targets, e.g, 1/30. 83 // For those sites with non-zero profile, the average number of targets 84 // is usually smaller than 2. 85 cl::init(1.0)); 86 87 cl::opt<bool> AtomicCounterUpdateAll( 88 "instrprof-atomic-counter-update-all", cl::ZeroOrMore, 89 cl::desc("Make all profile counter updates atomic (for testing only)"), 90 cl::init(false)); 91 92 cl::opt<bool> AtomicCounterUpdatePromoted( 93 "atomic-counter-update-promoted", cl::ZeroOrMore, 94 cl::desc("Do counter update using atomic fetch add " 95 " for promoted counters only"), 96 cl::init(false)); 97 98 cl::opt<bool> AtomicFirstCounter( 99 "atomic-first-counter", cl::ZeroOrMore, 100 cl::desc("Use atomic fetch add for first counter in a function (usually " 101 "the entry counter)"), 102 cl::init(false)); 103 104 // If the option is not specified, the default behavior about whether 105 // counter promotion is done depends on how instrumentaiton lowering 106 // pipeline is setup, i.e., the default value of true of this option 107 // does not mean the promotion will be done by default. Explicitly 108 // setting this option can override the default behavior. 109 cl::opt<bool> DoCounterPromotion("do-counter-promotion", cl::ZeroOrMore, 110 cl::desc("Do counter register promotion"), 111 cl::init(false)); 112 cl::opt<unsigned> MaxNumOfPromotionsPerLoop( 113 cl::ZeroOrMore, "max-counter-promotions-per-loop", cl::init(20), 114 cl::desc("Max number counter promotions per loop to avoid" 115 " increasing register pressure too much")); 116 117 // A debug option 118 cl::opt<int> 119 MaxNumOfPromotions(cl::ZeroOrMore, "max-counter-promotions", cl::init(-1), 120 cl::desc("Max number of allowed counter promotions")); 121 122 cl::opt<unsigned> SpeculativeCounterPromotionMaxExiting( 123 cl::ZeroOrMore, "speculative-counter-promotion-max-exiting", cl::init(3), 124 cl::desc("The max number of exiting blocks of a loop to allow " 125 " speculative counter promotion")); 126 127 cl::opt<bool> SpeculativeCounterPromotionToLoop( 128 cl::ZeroOrMore, "speculative-counter-promotion-to-loop", cl::init(false), 129 cl::desc("When the option is false, if the target block is in a loop, " 130 "the promotion will be disallowed unless the promoted counter " 131 " update can be further/iteratively promoted into an acyclic " 132 " region.")); 133 134 cl::opt<bool> IterativeCounterPromotion( 135 cl::ZeroOrMore, "iterative-counter-promotion", cl::init(true), 136 cl::desc("Allow counter promotion across the whole loop nest.")); 137 138 cl::opt<bool> SkipRetExitBlock( 139 cl::ZeroOrMore, "skip-ret-exit-block", cl::init(true), 140 cl::desc("Suppress counter promotion if exit blocks contain ret.")); 141 142 class InstrProfilingLegacyPass : public ModulePass { 143 InstrProfiling InstrProf; 144 145 public: 146 static char ID; 147 148 InstrProfilingLegacyPass() : ModulePass(ID) {} 149 InstrProfilingLegacyPass(const InstrProfOptions &Options, bool IsCS = false) 150 : ModulePass(ID), InstrProf(Options, IsCS) { 151 initializeInstrProfilingLegacyPassPass(*PassRegistry::getPassRegistry()); 152 } 153 154 StringRef getPassName() const override { 155 return "Frontend instrumentation-based coverage lowering"; 156 } 157 158 bool runOnModule(Module &M) override { 159 auto GetTLI = [this](Function &F) -> TargetLibraryInfo & { 160 return this->getAnalysis<TargetLibraryInfoWrapperPass>().getTLI(F); 161 }; 162 return InstrProf.run(M, GetTLI); 163 } 164 165 void getAnalysisUsage(AnalysisUsage &AU) const override { 166 AU.setPreservesCFG(); 167 AU.addRequired<TargetLibraryInfoWrapperPass>(); 168 } 169 }; 170 171 /// 172 /// A helper class to promote one counter RMW operation in the loop 173 /// into register update. 174 /// 175 /// RWM update for the counter will be sinked out of the loop after 176 /// the transformation. 177 /// 178 class PGOCounterPromoterHelper : public LoadAndStorePromoter { 179 public: 180 PGOCounterPromoterHelper( 181 Instruction *L, Instruction *S, SSAUpdater &SSA, Value *Init, 182 BasicBlock *PH, ArrayRef<BasicBlock *> ExitBlocks, 183 ArrayRef<Instruction *> InsertPts, 184 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> &LoopToCands, 185 LoopInfo &LI) 186 : LoadAndStorePromoter({L, S}, SSA), Store(S), ExitBlocks(ExitBlocks), 187 InsertPts(InsertPts), LoopToCandidates(LoopToCands), LI(LI) { 188 assert(isa<LoadInst>(L)); 189 assert(isa<StoreInst>(S)); 190 SSA.AddAvailableValue(PH, Init); 191 } 192 193 void doExtraRewritesBeforeFinalDeletion() override { 194 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) { 195 BasicBlock *ExitBlock = ExitBlocks[i]; 196 Instruction *InsertPos = InsertPts[i]; 197 // Get LiveIn value into the ExitBlock. If there are multiple 198 // predecessors, the value is defined by a PHI node in this 199 // block. 200 Value *LiveInValue = SSA.GetValueInMiddleOfBlock(ExitBlock); 201 Value *Addr = cast<StoreInst>(Store)->getPointerOperand(); 202 Type *Ty = LiveInValue->getType(); 203 IRBuilder<> Builder(InsertPos); 204 if (AtomicCounterUpdatePromoted) 205 // automic update currently can only be promoted across the current 206 // loop, not the whole loop nest. 207 Builder.CreateAtomicRMW(AtomicRMWInst::Add, Addr, LiveInValue, 208 MaybeAlign(), 209 AtomicOrdering::SequentiallyConsistent); 210 else { 211 LoadInst *OldVal = Builder.CreateLoad(Ty, Addr, "pgocount.promoted"); 212 auto *NewVal = Builder.CreateAdd(OldVal, LiveInValue); 213 auto *NewStore = Builder.CreateStore(NewVal, Addr); 214 215 // Now update the parent loop's candidate list: 216 if (IterativeCounterPromotion) { 217 auto *TargetLoop = LI.getLoopFor(ExitBlock); 218 if (TargetLoop) 219 LoopToCandidates[TargetLoop].emplace_back(OldVal, NewStore); 220 } 221 } 222 } 223 } 224 225 private: 226 Instruction *Store; 227 ArrayRef<BasicBlock *> ExitBlocks; 228 ArrayRef<Instruction *> InsertPts; 229 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> &LoopToCandidates; 230 LoopInfo &LI; 231 }; 232 233 /// A helper class to do register promotion for all profile counter 234 /// updates in a loop. 235 /// 236 class PGOCounterPromoter { 237 public: 238 PGOCounterPromoter( 239 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> &LoopToCands, 240 Loop &CurLoop, LoopInfo &LI, BlockFrequencyInfo *BFI) 241 : LoopToCandidates(LoopToCands), ExitBlocks(), InsertPts(), L(CurLoop), 242 LI(LI), BFI(BFI) { 243 244 // Skip collection of ExitBlocks and InsertPts for loops that will not be 245 // able to have counters promoted. 246 SmallVector<BasicBlock *, 8> LoopExitBlocks; 247 SmallPtrSet<BasicBlock *, 8> BlockSet; 248 249 L.getExitBlocks(LoopExitBlocks); 250 if (!isPromotionPossible(&L, LoopExitBlocks)) 251 return; 252 253 for (BasicBlock *ExitBlock : LoopExitBlocks) { 254 if (BlockSet.insert(ExitBlock).second) { 255 ExitBlocks.push_back(ExitBlock); 256 InsertPts.push_back(&*ExitBlock->getFirstInsertionPt()); 257 } 258 } 259 } 260 261 bool run(int64_t *NumPromoted) { 262 // Skip 'infinite' loops: 263 if (ExitBlocks.size() == 0) 264 return false; 265 266 // Skip if any of the ExitBlocks contains a ret instruction. 267 // This is to prevent dumping of incomplete profile -- if the 268 // the loop is a long running loop and dump is called in the middle 269 // of the loop, the result profile is incomplete. 270 // FIXME: add other heuristics to detect long running loops. 271 if (SkipRetExitBlock) { 272 for (auto BB : ExitBlocks) 273 if (isa<ReturnInst>(BB->getTerminator())) 274 return false; 275 } 276 277 unsigned MaxProm = getMaxNumOfPromotionsInLoop(&L); 278 if (MaxProm == 0) 279 return false; 280 281 unsigned Promoted = 0; 282 for (auto &Cand : LoopToCandidates[&L]) { 283 284 SmallVector<PHINode *, 4> NewPHIs; 285 SSAUpdater SSA(&NewPHIs); 286 Value *InitVal = ConstantInt::get(Cand.first->getType(), 0); 287 288 // If BFI is set, we will use it to guide the promotions. 289 if (BFI) { 290 auto *BB = Cand.first->getParent(); 291 auto InstrCount = BFI->getBlockProfileCount(BB); 292 if (!InstrCount) 293 continue; 294 auto PreheaderCount = BFI->getBlockProfileCount(L.getLoopPreheader()); 295 // If the average loop trip count is not greater than 1.5, we skip 296 // promotion. 297 if (PreheaderCount && 298 (PreheaderCount.getValue() * 3) >= (InstrCount.getValue() * 2)) 299 continue; 300 } 301 302 PGOCounterPromoterHelper Promoter(Cand.first, Cand.second, SSA, InitVal, 303 L.getLoopPreheader(), ExitBlocks, 304 InsertPts, LoopToCandidates, LI); 305 Promoter.run(SmallVector<Instruction *, 2>({Cand.first, Cand.second})); 306 Promoted++; 307 if (Promoted >= MaxProm) 308 break; 309 310 (*NumPromoted)++; 311 if (MaxNumOfPromotions != -1 && *NumPromoted >= MaxNumOfPromotions) 312 break; 313 } 314 315 LLVM_DEBUG(dbgs() << Promoted << " counters promoted for loop (depth=" 316 << L.getLoopDepth() << ")\n"); 317 return Promoted != 0; 318 } 319 320 private: 321 bool allowSpeculativeCounterPromotion(Loop *LP) { 322 SmallVector<BasicBlock *, 8> ExitingBlocks; 323 L.getExitingBlocks(ExitingBlocks); 324 // Not considierered speculative. 325 if (ExitingBlocks.size() == 1) 326 return true; 327 if (ExitingBlocks.size() > SpeculativeCounterPromotionMaxExiting) 328 return false; 329 return true; 330 } 331 332 // Check whether the loop satisfies the basic conditions needed to perform 333 // Counter Promotions. 334 bool isPromotionPossible(Loop *LP, 335 const SmallVectorImpl<BasicBlock *> &LoopExitBlocks) { 336 // We can't insert into a catchswitch. 337 if (llvm::any_of(LoopExitBlocks, [](BasicBlock *Exit) { 338 return isa<CatchSwitchInst>(Exit->getTerminator()); 339 })) 340 return false; 341 342 if (!LP->hasDedicatedExits()) 343 return false; 344 345 BasicBlock *PH = LP->getLoopPreheader(); 346 if (!PH) 347 return false; 348 349 return true; 350 } 351 352 // Returns the max number of Counter Promotions for LP. 353 unsigned getMaxNumOfPromotionsInLoop(Loop *LP) { 354 SmallVector<BasicBlock *, 8> LoopExitBlocks; 355 LP->getExitBlocks(LoopExitBlocks); 356 if (!isPromotionPossible(LP, LoopExitBlocks)) 357 return 0; 358 359 SmallVector<BasicBlock *, 8> ExitingBlocks; 360 LP->getExitingBlocks(ExitingBlocks); 361 362 // If BFI is set, we do more aggressive promotions based on BFI. 363 if (BFI) 364 return (unsigned)-1; 365 366 // Not considierered speculative. 367 if (ExitingBlocks.size() == 1) 368 return MaxNumOfPromotionsPerLoop; 369 370 if (ExitingBlocks.size() > SpeculativeCounterPromotionMaxExiting) 371 return 0; 372 373 // Whether the target block is in a loop does not matter: 374 if (SpeculativeCounterPromotionToLoop) 375 return MaxNumOfPromotionsPerLoop; 376 377 // Now check the target block: 378 unsigned MaxProm = MaxNumOfPromotionsPerLoop; 379 for (auto *TargetBlock : LoopExitBlocks) { 380 auto *TargetLoop = LI.getLoopFor(TargetBlock); 381 if (!TargetLoop) 382 continue; 383 unsigned MaxPromForTarget = getMaxNumOfPromotionsInLoop(TargetLoop); 384 unsigned PendingCandsInTarget = LoopToCandidates[TargetLoop].size(); 385 MaxProm = 386 std::min(MaxProm, std::max(MaxPromForTarget, PendingCandsInTarget) - 387 PendingCandsInTarget); 388 } 389 return MaxProm; 390 } 391 392 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> &LoopToCandidates; 393 SmallVector<BasicBlock *, 8> ExitBlocks; 394 SmallVector<Instruction *, 8> InsertPts; 395 Loop &L; 396 LoopInfo &LI; 397 BlockFrequencyInfo *BFI; 398 }; 399 400 enum class ValueProfilingCallType { 401 // Individual values are tracked. Currently used for indiret call target 402 // profiling. 403 Default, 404 405 // MemOp: the memop size value profiling. 406 MemOp 407 }; 408 409 } // end anonymous namespace 410 411 PreservedAnalyses InstrProfiling::run(Module &M, ModuleAnalysisManager &AM) { 412 FunctionAnalysisManager &FAM = 413 AM.getResult<FunctionAnalysisManagerModuleProxy>(M).getManager(); 414 auto GetTLI = [&FAM](Function &F) -> TargetLibraryInfo & { 415 return FAM.getResult<TargetLibraryAnalysis>(F); 416 }; 417 if (!run(M, GetTLI)) 418 return PreservedAnalyses::all(); 419 420 return PreservedAnalyses::none(); 421 } 422 423 char InstrProfilingLegacyPass::ID = 0; 424 INITIALIZE_PASS_BEGIN( 425 InstrProfilingLegacyPass, "instrprof", 426 "Frontend instrumentation-based coverage lowering.", false, false) 427 INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass) 428 INITIALIZE_PASS_END( 429 InstrProfilingLegacyPass, "instrprof", 430 "Frontend instrumentation-based coverage lowering.", false, false) 431 432 ModulePass * 433 llvm::createInstrProfilingLegacyPass(const InstrProfOptions &Options, 434 bool IsCS) { 435 return new InstrProfilingLegacyPass(Options, IsCS); 436 } 437 438 static InstrProfIncrementInst *castToIncrementInst(Instruction *Instr) { 439 InstrProfIncrementInst *Inc = dyn_cast<InstrProfIncrementInstStep>(Instr); 440 if (Inc) 441 return Inc; 442 return dyn_cast<InstrProfIncrementInst>(Instr); 443 } 444 445 bool InstrProfiling::lowerIntrinsics(Function *F) { 446 bool MadeChange = false; 447 PromotionCandidates.clear(); 448 for (BasicBlock &BB : *F) { 449 for (auto I = BB.begin(), E = BB.end(); I != E;) { 450 auto Instr = I++; 451 InstrProfIncrementInst *Inc = castToIncrementInst(&*Instr); 452 if (Inc) { 453 lowerIncrement(Inc); 454 MadeChange = true; 455 } else if (auto *Ind = dyn_cast<InstrProfValueProfileInst>(Instr)) { 456 lowerValueProfileInst(Ind); 457 MadeChange = true; 458 } 459 } 460 } 461 462 if (!MadeChange) 463 return false; 464 465 promoteCounterLoadStores(F); 466 return true; 467 } 468 469 bool InstrProfiling::isRuntimeCounterRelocationEnabled() const { 470 if (RuntimeCounterRelocation.getNumOccurrences() > 0) 471 return RuntimeCounterRelocation; 472 473 return TT.isOSFuchsia(); 474 } 475 476 bool InstrProfiling::isCounterPromotionEnabled() const { 477 if (DoCounterPromotion.getNumOccurrences() > 0) 478 return DoCounterPromotion; 479 480 return Options.DoCounterPromotion; 481 } 482 483 void InstrProfiling::promoteCounterLoadStores(Function *F) { 484 if (!isCounterPromotionEnabled()) 485 return; 486 487 DominatorTree DT(*F); 488 LoopInfo LI(DT); 489 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> LoopPromotionCandidates; 490 491 std::unique_ptr<BlockFrequencyInfo> BFI; 492 if (Options.UseBFIInPromotion) { 493 std::unique_ptr<BranchProbabilityInfo> BPI; 494 BPI.reset(new BranchProbabilityInfo(*F, LI, &GetTLI(*F))); 495 BFI.reset(new BlockFrequencyInfo(*F, *BPI, LI)); 496 } 497 498 for (const auto &LoadStore : PromotionCandidates) { 499 auto *CounterLoad = LoadStore.first; 500 auto *CounterStore = LoadStore.second; 501 BasicBlock *BB = CounterLoad->getParent(); 502 Loop *ParentLoop = LI.getLoopFor(BB); 503 if (!ParentLoop) 504 continue; 505 LoopPromotionCandidates[ParentLoop].emplace_back(CounterLoad, CounterStore); 506 } 507 508 SmallVector<Loop *, 4> Loops = LI.getLoopsInPreorder(); 509 510 // Do a post-order traversal of the loops so that counter updates can be 511 // iteratively hoisted outside the loop nest. 512 for (auto *Loop : llvm::reverse(Loops)) { 513 PGOCounterPromoter Promoter(LoopPromotionCandidates, *Loop, LI, BFI.get()); 514 Promoter.run(&TotalCountersPromoted); 515 } 516 } 517 518 /// Check if the module contains uses of any profiling intrinsics. 519 static bool containsProfilingIntrinsics(Module &M) { 520 if (auto *F = M.getFunction( 521 Intrinsic::getName(llvm::Intrinsic::instrprof_increment))) 522 if (!F->use_empty()) 523 return true; 524 if (auto *F = M.getFunction( 525 Intrinsic::getName(llvm::Intrinsic::instrprof_increment_step))) 526 if (!F->use_empty()) 527 return true; 528 if (auto *F = M.getFunction( 529 Intrinsic::getName(llvm::Intrinsic::instrprof_value_profile))) 530 if (!F->use_empty()) 531 return true; 532 return false; 533 } 534 535 bool InstrProfiling::run( 536 Module &M, std::function<const TargetLibraryInfo &(Function &F)> GetTLI) { 537 this->M = &M; 538 this->GetTLI = std::move(GetTLI); 539 NamesVar = nullptr; 540 NamesSize = 0; 541 ProfileDataMap.clear(); 542 UsedVars.clear(); 543 TT = Triple(M.getTargetTriple()); 544 545 // Emit the runtime hook even if no counters are present. 546 bool MadeChange = emitRuntimeHook(); 547 548 // Improve compile time by avoiding linear scans when there is no work. 549 GlobalVariable *CoverageNamesVar = 550 M.getNamedGlobal(getCoverageUnusedNamesVarName()); 551 if (!containsProfilingIntrinsics(M) && !CoverageNamesVar) 552 return MadeChange; 553 554 // We did not know how many value sites there would be inside 555 // the instrumented function. This is counting the number of instrumented 556 // target value sites to enter it as field in the profile data variable. 557 for (Function &F : M) { 558 InstrProfIncrementInst *FirstProfIncInst = nullptr; 559 for (BasicBlock &BB : F) 560 for (auto I = BB.begin(), E = BB.end(); I != E; I++) 561 if (auto *Ind = dyn_cast<InstrProfValueProfileInst>(I)) 562 computeNumValueSiteCounts(Ind); 563 else if (FirstProfIncInst == nullptr) 564 FirstProfIncInst = dyn_cast<InstrProfIncrementInst>(I); 565 566 // Value profiling intrinsic lowering requires per-function profile data 567 // variable to be created first. 568 if (FirstProfIncInst != nullptr) 569 static_cast<void>(getOrCreateRegionCounters(FirstProfIncInst)); 570 } 571 572 for (Function &F : M) 573 MadeChange |= lowerIntrinsics(&F); 574 575 if (CoverageNamesVar) { 576 lowerCoverageData(CoverageNamesVar); 577 MadeChange = true; 578 } 579 580 if (!MadeChange) 581 return false; 582 583 emitVNodes(); 584 emitNameData(); 585 emitRegistration(); 586 emitUses(); 587 emitInitialization(); 588 return true; 589 } 590 591 static FunctionCallee getOrInsertValueProfilingCall( 592 Module &M, const TargetLibraryInfo &TLI, 593 ValueProfilingCallType CallType = ValueProfilingCallType::Default) { 594 LLVMContext &Ctx = M.getContext(); 595 auto *ReturnTy = Type::getVoidTy(M.getContext()); 596 597 AttributeList AL; 598 if (auto AK = TLI.getExtAttrForI32Param(false)) 599 AL = AL.addParamAttribute(M.getContext(), 2, AK); 600 601 assert((CallType == ValueProfilingCallType::Default || 602 CallType == ValueProfilingCallType::MemOp) && 603 "Must be Default or MemOp"); 604 Type *ParamTypes[] = { 605 #define VALUE_PROF_FUNC_PARAM(ParamType, ParamName, ParamLLVMType) ParamLLVMType 606 #include "llvm/ProfileData/InstrProfData.inc" 607 }; 608 auto *ValueProfilingCallTy = 609 FunctionType::get(ReturnTy, makeArrayRef(ParamTypes), false); 610 StringRef FuncName = CallType == ValueProfilingCallType::Default 611 ? getInstrProfValueProfFuncName() 612 : getInstrProfValueProfMemOpFuncName(); 613 return M.getOrInsertFunction(FuncName, ValueProfilingCallTy, AL); 614 } 615 616 void InstrProfiling::computeNumValueSiteCounts(InstrProfValueProfileInst *Ind) { 617 GlobalVariable *Name = Ind->getName(); 618 uint64_t ValueKind = Ind->getValueKind()->getZExtValue(); 619 uint64_t Index = Ind->getIndex()->getZExtValue(); 620 auto It = ProfileDataMap.find(Name); 621 if (It == ProfileDataMap.end()) { 622 PerFunctionProfileData PD; 623 PD.NumValueSites[ValueKind] = Index + 1; 624 ProfileDataMap[Name] = PD; 625 } else if (It->second.NumValueSites[ValueKind] <= Index) 626 It->second.NumValueSites[ValueKind] = Index + 1; 627 } 628 629 void InstrProfiling::lowerValueProfileInst(InstrProfValueProfileInst *Ind) { 630 GlobalVariable *Name = Ind->getName(); 631 auto It = ProfileDataMap.find(Name); 632 assert(It != ProfileDataMap.end() && It->second.DataVar && 633 "value profiling detected in function with no counter incerement"); 634 635 GlobalVariable *DataVar = It->second.DataVar; 636 uint64_t ValueKind = Ind->getValueKind()->getZExtValue(); 637 uint64_t Index = Ind->getIndex()->getZExtValue(); 638 for (uint32_t Kind = IPVK_First; Kind < ValueKind; ++Kind) 639 Index += It->second.NumValueSites[Kind]; 640 641 IRBuilder<> Builder(Ind); 642 bool IsMemOpSize = (Ind->getValueKind()->getZExtValue() == 643 llvm::InstrProfValueKind::IPVK_MemOPSize); 644 CallInst *Call = nullptr; 645 auto *TLI = &GetTLI(*Ind->getFunction()); 646 647 // To support value profiling calls within Windows exception handlers, funclet 648 // information contained within operand bundles needs to be copied over to 649 // the library call. This is required for the IR to be processed by the 650 // WinEHPrepare pass. 651 SmallVector<OperandBundleDef, 1> OpBundles; 652 Ind->getOperandBundlesAsDefs(OpBundles); 653 if (!IsMemOpSize) { 654 Value *Args[3] = {Ind->getTargetValue(), 655 Builder.CreateBitCast(DataVar, Builder.getInt8PtrTy()), 656 Builder.getInt32(Index)}; 657 Call = Builder.CreateCall(getOrInsertValueProfilingCall(*M, *TLI), Args, 658 OpBundles); 659 } else { 660 Value *Args[3] = {Ind->getTargetValue(), 661 Builder.CreateBitCast(DataVar, Builder.getInt8PtrTy()), 662 Builder.getInt32(Index)}; 663 Call = Builder.CreateCall( 664 getOrInsertValueProfilingCall(*M, *TLI, ValueProfilingCallType::MemOp), 665 Args, OpBundles); 666 } 667 if (auto AK = TLI->getExtAttrForI32Param(false)) 668 Call->addParamAttr(2, AK); 669 Ind->replaceAllUsesWith(Call); 670 Ind->eraseFromParent(); 671 } 672 673 void InstrProfiling::lowerIncrement(InstrProfIncrementInst *Inc) { 674 GlobalVariable *Counters = getOrCreateRegionCounters(Inc); 675 676 IRBuilder<> Builder(Inc); 677 uint64_t Index = Inc->getIndex()->getZExtValue(); 678 Value *Addr = Builder.CreateConstInBoundsGEP2_64(Counters->getValueType(), 679 Counters, 0, Index); 680 681 if (isRuntimeCounterRelocationEnabled()) { 682 Type *Int64Ty = Type::getInt64Ty(M->getContext()); 683 Type *Int64PtrTy = Type::getInt64PtrTy(M->getContext()); 684 Function *Fn = Inc->getParent()->getParent(); 685 Instruction &I = Fn->getEntryBlock().front(); 686 LoadInst *LI = dyn_cast<LoadInst>(&I); 687 if (!LI) { 688 IRBuilder<> Builder(&I); 689 Type *Int64Ty = Type::getInt64Ty(M->getContext()); 690 GlobalVariable *Bias = M->getGlobalVariable(getInstrProfCounterBiasVarName()); 691 if (!Bias) { 692 Bias = new GlobalVariable(*M, Int64Ty, false, GlobalValue::LinkOnceODRLinkage, 693 Constant::getNullValue(Int64Ty), 694 getInstrProfCounterBiasVarName()); 695 Bias->setVisibility(GlobalVariable::HiddenVisibility); 696 } 697 LI = Builder.CreateLoad(Int64Ty, Bias); 698 } 699 auto *Add = Builder.CreateAdd(Builder.CreatePtrToInt(Addr, Int64Ty), LI); 700 Addr = Builder.CreateIntToPtr(Add, Int64PtrTy); 701 } 702 703 if (Options.Atomic || AtomicCounterUpdateAll || 704 (Index == 0 && AtomicFirstCounter)) { 705 Builder.CreateAtomicRMW(AtomicRMWInst::Add, Addr, Inc->getStep(), 706 MaybeAlign(), AtomicOrdering::Monotonic); 707 } else { 708 Value *IncStep = Inc->getStep(); 709 Value *Load = Builder.CreateLoad(IncStep->getType(), Addr, "pgocount"); 710 auto *Count = Builder.CreateAdd(Load, Inc->getStep()); 711 auto *Store = Builder.CreateStore(Count, Addr); 712 if (isCounterPromotionEnabled()) 713 PromotionCandidates.emplace_back(cast<Instruction>(Load), Store); 714 } 715 Inc->eraseFromParent(); 716 } 717 718 void InstrProfiling::lowerCoverageData(GlobalVariable *CoverageNamesVar) { 719 ConstantArray *Names = 720 cast<ConstantArray>(CoverageNamesVar->getInitializer()); 721 for (unsigned I = 0, E = Names->getNumOperands(); I < E; ++I) { 722 Constant *NC = Names->getOperand(I); 723 Value *V = NC->stripPointerCasts(); 724 assert(isa<GlobalVariable>(V) && "Missing reference to function name"); 725 GlobalVariable *Name = cast<GlobalVariable>(V); 726 727 Name->setLinkage(GlobalValue::PrivateLinkage); 728 ReferencedNames.push_back(Name); 729 NC->dropAllReferences(); 730 } 731 CoverageNamesVar->eraseFromParent(); 732 } 733 734 /// Get the name of a profiling variable for a particular function. 735 static std::string getVarName(InstrProfIncrementInst *Inc, StringRef Prefix) { 736 StringRef NamePrefix = getInstrProfNameVarPrefix(); 737 StringRef Name = Inc->getName()->getName().substr(NamePrefix.size()); 738 Function *F = Inc->getParent()->getParent(); 739 Module *M = F->getParent(); 740 if (!DoHashBasedCounterSplit || !isIRPGOFlagSet(M) || 741 !canRenameComdatFunc(*F)) 742 return (Prefix + Name).str(); 743 uint64_t FuncHash = Inc->getHash()->getZExtValue(); 744 SmallVector<char, 24> HashPostfix; 745 if (Name.endswith((Twine(".") + Twine(FuncHash)).toStringRef(HashPostfix))) 746 return (Prefix + Name).str(); 747 return (Prefix + Name + "." + Twine(FuncHash)).str(); 748 } 749 750 static inline bool shouldRecordFunctionAddr(Function *F) { 751 // Check the linkage 752 bool HasAvailableExternallyLinkage = F->hasAvailableExternallyLinkage(); 753 if (!F->hasLinkOnceLinkage() && !F->hasLocalLinkage() && 754 !HasAvailableExternallyLinkage) 755 return true; 756 757 // A function marked 'alwaysinline' with available_externally linkage can't 758 // have its address taken. Doing so would create an undefined external ref to 759 // the function, which would fail to link. 760 if (HasAvailableExternallyLinkage && 761 F->hasFnAttribute(Attribute::AlwaysInline)) 762 return false; 763 764 // Prohibit function address recording if the function is both internal and 765 // COMDAT. This avoids the profile data variable referencing internal symbols 766 // in COMDAT. 767 if (F->hasLocalLinkage() && F->hasComdat()) 768 return false; 769 770 // Check uses of this function for other than direct calls or invokes to it. 771 // Inline virtual functions have linkeOnceODR linkage. When a key method 772 // exists, the vtable will only be emitted in the TU where the key method 773 // is defined. In a TU where vtable is not available, the function won't 774 // be 'addresstaken'. If its address is not recorded here, the profile data 775 // with missing address may be picked by the linker leading to missing 776 // indirect call target info. 777 return F->hasAddressTaken() || F->hasLinkOnceLinkage(); 778 } 779 780 static bool needsRuntimeRegistrationOfSectionRange(const Triple &TT) { 781 // Don't do this for Darwin. compiler-rt uses linker magic. 782 if (TT.isOSDarwin()) 783 return false; 784 // Use linker script magic to get data/cnts/name start/end. 785 if (TT.isOSLinux() || TT.isOSFreeBSD() || TT.isOSNetBSD() || 786 TT.isOSSolaris() || TT.isOSFuchsia() || TT.isPS4CPU() || 787 TT.isOSWindows()) 788 return false; 789 790 return true; 791 } 792 793 GlobalVariable * 794 InstrProfiling::getOrCreateRegionCounters(InstrProfIncrementInst *Inc) { 795 GlobalVariable *NamePtr = Inc->getName(); 796 auto It = ProfileDataMap.find(NamePtr); 797 PerFunctionProfileData PD; 798 if (It != ProfileDataMap.end()) { 799 if (It->second.RegionCounters) 800 return It->second.RegionCounters; 801 PD = It->second; 802 } 803 804 // Match the linkage and visibility of the name global. COFF supports using 805 // comdats with internal symbols, so do that if we can. 806 Function *Fn = Inc->getParent()->getParent(); 807 GlobalValue::LinkageTypes Linkage = NamePtr->getLinkage(); 808 GlobalValue::VisibilityTypes Visibility = NamePtr->getVisibility(); 809 if (TT.isOSBinFormatCOFF()) { 810 Linkage = GlobalValue::InternalLinkage; 811 Visibility = GlobalValue::DefaultVisibility; 812 } 813 814 // Move the name variable to the right section. Place them in a COMDAT group 815 // if the associated function is a COMDAT. This will make sure that only one 816 // copy of counters of the COMDAT function will be emitted after linking. Keep 817 // in mind that this pass may run before the inliner, so we need to create a 818 // new comdat group for the counters and profiling data. If we use the comdat 819 // of the parent function, that will result in relocations against discarded 820 // sections. 821 bool NeedComdat = needsComdatForCounter(*Fn, *M); 822 if (NeedComdat) { 823 if (TT.isOSBinFormatCOFF()) { 824 // For COFF, put the counters, data, and values each into their own 825 // comdats. We can't use a group because the Visual C++ linker will 826 // report duplicate symbol errors if there are multiple external symbols 827 // with the same name marked IMAGE_COMDAT_SELECT_ASSOCIATIVE. 828 Linkage = GlobalValue::LinkOnceODRLinkage; 829 Visibility = GlobalValue::HiddenVisibility; 830 } 831 } 832 std::string DataVarName = getVarName(Inc, getInstrProfDataVarPrefix()); 833 auto MaybeSetComdat = [=](GlobalVariable *GV) { 834 // For ELF, when not using COMDAT, put counters, data and values into 835 // a noduplicates COMDAT which is lowered to a zero-flag section group. 836 // This allows linker GC to discard the entire group when the function 837 // is discarded. 838 bool UseComdat = (NeedComdat || TT.isOSBinFormatELF()); 839 if (UseComdat) { 840 auto GroupName = TT.isOSBinFormatCOFF() ? GV->getName() : DataVarName; 841 Comdat *C = M->getOrInsertComdat(GroupName); 842 if (!NeedComdat) 843 C->setSelectionKind(Comdat::NoDuplicates); 844 GV->setComdat(C); 845 } 846 }; 847 848 uint64_t NumCounters = Inc->getNumCounters()->getZExtValue(); 849 LLVMContext &Ctx = M->getContext(); 850 ArrayType *CounterTy = ArrayType::get(Type::getInt64Ty(Ctx), NumCounters); 851 852 // Create the counters variable. 853 auto *CounterPtr = 854 new GlobalVariable(*M, CounterTy, false, Linkage, 855 Constant::getNullValue(CounterTy), 856 getVarName(Inc, getInstrProfCountersVarPrefix())); 857 CounterPtr->setVisibility(Visibility); 858 CounterPtr->setSection( 859 getInstrProfSectionName(IPSK_cnts, TT.getObjectFormat())); 860 CounterPtr->setAlignment(Align(8)); 861 MaybeSetComdat(CounterPtr); 862 CounterPtr->setLinkage(Linkage); 863 864 auto *Int8PtrTy = Type::getInt8PtrTy(Ctx); 865 // Allocate statically the array of pointers to value profile nodes for 866 // the current function. 867 Constant *ValuesPtrExpr = ConstantPointerNull::get(Int8PtrTy); 868 if (ValueProfileStaticAlloc && !needsRuntimeRegistrationOfSectionRange(TT)) { 869 uint64_t NS = 0; 870 for (uint32_t Kind = IPVK_First; Kind <= IPVK_Last; ++Kind) 871 NS += PD.NumValueSites[Kind]; 872 if (NS) { 873 ArrayType *ValuesTy = ArrayType::get(Type::getInt64Ty(Ctx), NS); 874 875 auto *ValuesVar = 876 new GlobalVariable(*M, ValuesTy, false, Linkage, 877 Constant::getNullValue(ValuesTy), 878 getVarName(Inc, getInstrProfValuesVarPrefix())); 879 ValuesVar->setVisibility(Visibility); 880 ValuesVar->setSection( 881 getInstrProfSectionName(IPSK_vals, TT.getObjectFormat())); 882 ValuesVar->setAlignment(Align(8)); 883 MaybeSetComdat(ValuesVar); 884 ValuesPtrExpr = 885 ConstantExpr::getBitCast(ValuesVar, Type::getInt8PtrTy(Ctx)); 886 } 887 } 888 889 // Create data variable. 890 auto *Int16Ty = Type::getInt16Ty(Ctx); 891 auto *Int16ArrayTy = ArrayType::get(Int16Ty, IPVK_Last + 1); 892 Type *DataTypes[] = { 893 #define INSTR_PROF_DATA(Type, LLVMType, Name, Init) LLVMType, 894 #include "llvm/ProfileData/InstrProfData.inc" 895 }; 896 auto *DataTy = StructType::get(Ctx, makeArrayRef(DataTypes)); 897 898 Constant *FunctionAddr = shouldRecordFunctionAddr(Fn) 899 ? ConstantExpr::getBitCast(Fn, Int8PtrTy) 900 : ConstantPointerNull::get(Int8PtrTy); 901 902 Constant *Int16ArrayVals[IPVK_Last + 1]; 903 for (uint32_t Kind = IPVK_First; Kind <= IPVK_Last; ++Kind) 904 Int16ArrayVals[Kind] = ConstantInt::get(Int16Ty, PD.NumValueSites[Kind]); 905 906 Constant *DataVals[] = { 907 #define INSTR_PROF_DATA(Type, LLVMType, Name, Init) Init, 908 #include "llvm/ProfileData/InstrProfData.inc" 909 }; 910 auto *Data = 911 new GlobalVariable(*M, DataTy, false, Linkage, 912 ConstantStruct::get(DataTy, DataVals), DataVarName); 913 Data->setVisibility(Visibility); 914 Data->setSection(getInstrProfSectionName(IPSK_data, TT.getObjectFormat())); 915 Data->setAlignment(Align(INSTR_PROF_DATA_ALIGNMENT)); 916 MaybeSetComdat(Data); 917 Data->setLinkage(Linkage); 918 919 PD.RegionCounters = CounterPtr; 920 PD.DataVar = Data; 921 ProfileDataMap[NamePtr] = PD; 922 923 // Mark the data variable as used so that it isn't stripped out. 924 UsedVars.push_back(Data); 925 // Now that the linkage set by the FE has been passed to the data and counter 926 // variables, reset Name variable's linkage and visibility to private so that 927 // it can be removed later by the compiler. 928 NamePtr->setLinkage(GlobalValue::PrivateLinkage); 929 // Collect the referenced names to be used by emitNameData. 930 ReferencedNames.push_back(NamePtr); 931 932 return CounterPtr; 933 } 934 935 void InstrProfiling::emitVNodes() { 936 if (!ValueProfileStaticAlloc) 937 return; 938 939 // For now only support this on platforms that do 940 // not require runtime registration to discover 941 // named section start/end. 942 if (needsRuntimeRegistrationOfSectionRange(TT)) 943 return; 944 945 size_t TotalNS = 0; 946 for (auto &PD : ProfileDataMap) { 947 for (uint32_t Kind = IPVK_First; Kind <= IPVK_Last; ++Kind) 948 TotalNS += PD.second.NumValueSites[Kind]; 949 } 950 951 if (!TotalNS) 952 return; 953 954 uint64_t NumCounters = TotalNS * NumCountersPerValueSite; 955 // Heuristic for small programs with very few total value sites. 956 // The default value of vp-counters-per-site is chosen based on 957 // the observation that large apps usually have a low percentage 958 // of value sites that actually have any profile data, and thus 959 // the average number of counters per site is low. For small 960 // apps with very few sites, this may not be true. Bump up the 961 // number of counters in this case. 962 #define INSTR_PROF_MIN_VAL_COUNTS 10 963 if (NumCounters < INSTR_PROF_MIN_VAL_COUNTS) 964 NumCounters = std::max(INSTR_PROF_MIN_VAL_COUNTS, (int)NumCounters * 2); 965 966 auto &Ctx = M->getContext(); 967 Type *VNodeTypes[] = { 968 #define INSTR_PROF_VALUE_NODE(Type, LLVMType, Name, Init) LLVMType, 969 #include "llvm/ProfileData/InstrProfData.inc" 970 }; 971 auto *VNodeTy = StructType::get(Ctx, makeArrayRef(VNodeTypes)); 972 973 ArrayType *VNodesTy = ArrayType::get(VNodeTy, NumCounters); 974 auto *VNodesVar = new GlobalVariable( 975 *M, VNodesTy, false, GlobalValue::PrivateLinkage, 976 Constant::getNullValue(VNodesTy), getInstrProfVNodesVarName()); 977 VNodesVar->setSection( 978 getInstrProfSectionName(IPSK_vnodes, TT.getObjectFormat())); 979 UsedVars.push_back(VNodesVar); 980 } 981 982 void InstrProfiling::emitNameData() { 983 std::string UncompressedData; 984 985 if (ReferencedNames.empty()) 986 return; 987 988 std::string CompressedNameStr; 989 if (Error E = collectPGOFuncNameStrings(ReferencedNames, CompressedNameStr, 990 DoInstrProfNameCompression)) { 991 report_fatal_error(toString(std::move(E)), false); 992 } 993 994 auto &Ctx = M->getContext(); 995 auto *NamesVal = ConstantDataArray::getString( 996 Ctx, StringRef(CompressedNameStr), false); 997 NamesVar = new GlobalVariable(*M, NamesVal->getType(), true, 998 GlobalValue::PrivateLinkage, NamesVal, 999 getInstrProfNamesVarName()); 1000 NamesSize = CompressedNameStr.size(); 1001 NamesVar->setSection( 1002 getInstrProfSectionName(IPSK_name, TT.getObjectFormat())); 1003 // On COFF, it's important to reduce the alignment down to 1 to prevent the 1004 // linker from inserting padding before the start of the names section or 1005 // between names entries. 1006 NamesVar->setAlignment(Align(1)); 1007 UsedVars.push_back(NamesVar); 1008 1009 for (auto *NamePtr : ReferencedNames) 1010 NamePtr->eraseFromParent(); 1011 } 1012 1013 void InstrProfiling::emitRegistration() { 1014 if (!needsRuntimeRegistrationOfSectionRange(TT)) 1015 return; 1016 1017 // Construct the function. 1018 auto *VoidTy = Type::getVoidTy(M->getContext()); 1019 auto *VoidPtrTy = Type::getInt8PtrTy(M->getContext()); 1020 auto *Int64Ty = Type::getInt64Ty(M->getContext()); 1021 auto *RegisterFTy = FunctionType::get(VoidTy, false); 1022 auto *RegisterF = Function::Create(RegisterFTy, GlobalValue::InternalLinkage, 1023 getInstrProfRegFuncsName(), M); 1024 RegisterF->setUnnamedAddr(GlobalValue::UnnamedAddr::Global); 1025 if (Options.NoRedZone) 1026 RegisterF->addFnAttr(Attribute::NoRedZone); 1027 1028 auto *RuntimeRegisterTy = FunctionType::get(VoidTy, VoidPtrTy, false); 1029 auto *RuntimeRegisterF = 1030 Function::Create(RuntimeRegisterTy, GlobalVariable::ExternalLinkage, 1031 getInstrProfRegFuncName(), M); 1032 1033 IRBuilder<> IRB(BasicBlock::Create(M->getContext(), "", RegisterF)); 1034 for (Value *Data : UsedVars) 1035 if (Data != NamesVar && !isa<Function>(Data)) 1036 IRB.CreateCall(RuntimeRegisterF, IRB.CreateBitCast(Data, VoidPtrTy)); 1037 1038 if (NamesVar) { 1039 Type *ParamTypes[] = {VoidPtrTy, Int64Ty}; 1040 auto *NamesRegisterTy = 1041 FunctionType::get(VoidTy, makeArrayRef(ParamTypes), false); 1042 auto *NamesRegisterF = 1043 Function::Create(NamesRegisterTy, GlobalVariable::ExternalLinkage, 1044 getInstrProfNamesRegFuncName(), M); 1045 IRB.CreateCall(NamesRegisterF, {IRB.CreateBitCast(NamesVar, VoidPtrTy), 1046 IRB.getInt64(NamesSize)}); 1047 } 1048 1049 IRB.CreateRetVoid(); 1050 } 1051 1052 bool InstrProfiling::emitRuntimeHook() { 1053 // We expect the linker to be invoked with -u<hook_var> flag for Linux or 1054 // Fuchsia, in which case there is no need to emit the user function. 1055 if (TT.isOSLinux() || TT.isOSFuchsia()) 1056 return false; 1057 1058 // If the module's provided its own runtime, we don't need to do anything. 1059 if (M->getGlobalVariable(getInstrProfRuntimeHookVarName())) 1060 return false; 1061 1062 // Declare an external variable that will pull in the runtime initialization. 1063 auto *Int32Ty = Type::getInt32Ty(M->getContext()); 1064 auto *Var = 1065 new GlobalVariable(*M, Int32Ty, false, GlobalValue::ExternalLinkage, 1066 nullptr, getInstrProfRuntimeHookVarName()); 1067 1068 // Make a function that uses it. 1069 auto *User = Function::Create(FunctionType::get(Int32Ty, false), 1070 GlobalValue::LinkOnceODRLinkage, 1071 getInstrProfRuntimeHookVarUseFuncName(), M); 1072 User->addFnAttr(Attribute::NoInline); 1073 if (Options.NoRedZone) 1074 User->addFnAttr(Attribute::NoRedZone); 1075 User->setVisibility(GlobalValue::HiddenVisibility); 1076 if (TT.supportsCOMDAT()) 1077 User->setComdat(M->getOrInsertComdat(User->getName())); 1078 1079 IRBuilder<> IRB(BasicBlock::Create(M->getContext(), "", User)); 1080 auto *Load = IRB.CreateLoad(Int32Ty, Var); 1081 IRB.CreateRet(Load); 1082 1083 // Mark the user variable as used so that it isn't stripped out. 1084 UsedVars.push_back(User); 1085 return true; 1086 } 1087 1088 void InstrProfiling::emitUses() { 1089 // The metadata sections are parallel arrays. Optimizers (e.g. 1090 // GlobalOpt/ConstantMerge) may not discard associated sections as a unit, so 1091 // we conservatively retain all unconditionally in the compiler. 1092 // 1093 // On ELF, the linker can guarantee the associated sections will be retained 1094 // or discarded as a unit, so llvm.compiler.used is sufficient. Otherwise, 1095 // conservatively make all of them retained by the linker. 1096 if (TT.isOSBinFormatELF()) 1097 appendToCompilerUsed(*M, UsedVars); 1098 else 1099 appendToUsed(*M, UsedVars); 1100 } 1101 1102 void InstrProfiling::emitInitialization() { 1103 // Create ProfileFileName variable. Don't don't this for the 1104 // context-sensitive instrumentation lowering: This lowering is after 1105 // LTO/ThinLTO linking. Pass PGOInstrumentationGenCreateVar should 1106 // have already create the variable before LTO/ThinLTO linking. 1107 if (!IsCS) 1108 createProfileFileNameVar(*M, Options.InstrProfileOutput); 1109 Function *RegisterF = M->getFunction(getInstrProfRegFuncsName()); 1110 if (!RegisterF) 1111 return; 1112 1113 // Create the initialization function. 1114 auto *VoidTy = Type::getVoidTy(M->getContext()); 1115 auto *F = Function::Create(FunctionType::get(VoidTy, false), 1116 GlobalValue::InternalLinkage, 1117 getInstrProfInitFuncName(), M); 1118 F->setUnnamedAddr(GlobalValue::UnnamedAddr::Global); 1119 F->addFnAttr(Attribute::NoInline); 1120 if (Options.NoRedZone) 1121 F->addFnAttr(Attribute::NoRedZone); 1122 1123 // Add the basic block and the necessary calls. 1124 IRBuilder<> IRB(BasicBlock::Create(M->getContext(), "", F)); 1125 IRB.CreateCall(RegisterF, {}); 1126 IRB.CreateRetVoid(); 1127 1128 appendToGlobalCtors(*M, F, 0); 1129 } 1130