1 //===- PassManagerBuilder.cpp - Build Standard Pass -----------------------===// 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 defines the PassManagerBuilder class, which is used to set up a 11 // "standard" optimization sequence suitable for languages like C and C++. 12 // 13 //===----------------------------------------------------------------------===// 14 15 16 #include "llvm/Transforms/IPO/PassManagerBuilder.h" 17 #include "llvm-c/Transforms/PassManagerBuilder.h" 18 #include "llvm/ADT/SmallVector.h" 19 #include "llvm/Analysis/Passes.h" 20 #include "llvm/IR/DataLayout.h" 21 #include "llvm/IR/Verifier.h" 22 #include "llvm/IR/LegacyPassManager.h" 23 #include "llvm/Support/CommandLine.h" 24 #include "llvm/Support/ManagedStatic.h" 25 #include "llvm/Analysis/TargetLibraryInfo.h" 26 #include "llvm/Target/TargetMachine.h" 27 #include "llvm/Transforms/IPO.h" 28 #include "llvm/Transforms/Scalar.h" 29 #include "llvm/Transforms/Vectorize.h" 30 31 using namespace llvm; 32 33 static cl::opt<bool> 34 RunLoopVectorization("vectorize-loops", cl::Hidden, 35 cl::desc("Run the Loop vectorization passes")); 36 37 static cl::opt<bool> 38 RunSLPVectorization("vectorize-slp", cl::Hidden, 39 cl::desc("Run the SLP vectorization passes")); 40 41 static cl::opt<bool> 42 RunBBVectorization("vectorize-slp-aggressive", cl::Hidden, 43 cl::desc("Run the BB vectorization passes")); 44 45 static cl::opt<bool> 46 UseGVNAfterVectorization("use-gvn-after-vectorization", 47 cl::init(false), cl::Hidden, 48 cl::desc("Run GVN instead of Early CSE after vectorization passes")); 49 50 static cl::opt<bool> ExtraVectorizerPasses( 51 "extra-vectorizer-passes", cl::init(false), cl::Hidden, 52 cl::desc("Run cleanup optimization passes after vectorization.")); 53 54 static cl::opt<bool> UseNewSROA("use-new-sroa", 55 cl::init(true), cl::Hidden, 56 cl::desc("Enable the new, experimental SROA pass")); 57 58 static cl::opt<bool> 59 RunLoopRerolling("reroll-loops", cl::Hidden, 60 cl::desc("Run the loop rerolling pass")); 61 62 static cl::opt<bool> 63 RunFloat2Int("float-to-int", cl::Hidden, cl::init(true), 64 cl::desc("Run the float2int (float demotion) pass")); 65 66 static cl::opt<bool> RunLoadCombine("combine-loads", cl::init(false), 67 cl::Hidden, 68 cl::desc("Run the load combining pass")); 69 70 static cl::opt<bool> 71 RunSLPAfterLoopVectorization("run-slp-after-loop-vectorization", 72 cl::init(true), cl::Hidden, 73 cl::desc("Run the SLP vectorizer (and BB vectorizer) after the Loop " 74 "vectorizer instead of before")); 75 76 static cl::opt<bool> UseCFLAA("use-cfl-aa", 77 cl::init(false), cl::Hidden, 78 cl::desc("Enable the new, experimental CFL alias analysis")); 79 80 static cl::opt<bool> 81 EnableMLSM("mlsm", cl::init(true), cl::Hidden, 82 cl::desc("Enable motion of merged load and store")); 83 84 static cl::opt<bool> EnableLoopInterchange( 85 "enable-loopinterchange", cl::init(false), cl::Hidden, 86 cl::desc("Enable the new, experimental LoopInterchange Pass")); 87 88 static cl::opt<bool> EnableLoopDistribute( 89 "enable-loop-distribute", cl::init(false), cl::Hidden, 90 cl::desc("Enable the new, experimental LoopDistribution Pass")); 91 92 PassManagerBuilder::PassManagerBuilder() { 93 OptLevel = 2; 94 SizeLevel = 0; 95 LibraryInfo = nullptr; 96 Inliner = nullptr; 97 DisableUnitAtATime = false; 98 DisableUnrollLoops = false; 99 BBVectorize = RunBBVectorization; 100 SLPVectorize = RunSLPVectorization; 101 LoopVectorize = RunLoopVectorization; 102 RerollLoops = RunLoopRerolling; 103 LoadCombine = RunLoadCombine; 104 DisableGVNLoadPRE = false; 105 VerifyInput = false; 106 VerifyOutput = false; 107 MergeFunctions = false; 108 } 109 110 PassManagerBuilder::~PassManagerBuilder() { 111 delete LibraryInfo; 112 delete Inliner; 113 } 114 115 /// Set of global extensions, automatically added as part of the standard set. 116 static ManagedStatic<SmallVector<std::pair<PassManagerBuilder::ExtensionPointTy, 117 PassManagerBuilder::ExtensionFn>, 8> > GlobalExtensions; 118 119 void PassManagerBuilder::addGlobalExtension( 120 PassManagerBuilder::ExtensionPointTy Ty, 121 PassManagerBuilder::ExtensionFn Fn) { 122 GlobalExtensions->push_back(std::make_pair(Ty, Fn)); 123 } 124 125 void PassManagerBuilder::addExtension(ExtensionPointTy Ty, ExtensionFn Fn) { 126 Extensions.push_back(std::make_pair(Ty, Fn)); 127 } 128 129 void PassManagerBuilder::addExtensionsToPM(ExtensionPointTy ETy, 130 legacy::PassManagerBase &PM) const { 131 for (unsigned i = 0, e = GlobalExtensions->size(); i != e; ++i) 132 if ((*GlobalExtensions)[i].first == ETy) 133 (*GlobalExtensions)[i].second(*this, PM); 134 for (unsigned i = 0, e = Extensions.size(); i != e; ++i) 135 if (Extensions[i].first == ETy) 136 Extensions[i].second(*this, PM); 137 } 138 139 void PassManagerBuilder::addInitialAliasAnalysisPasses( 140 legacy::PassManagerBase &PM) const { 141 // Add TypeBasedAliasAnalysis before BasicAliasAnalysis so that 142 // BasicAliasAnalysis wins if they disagree. This is intended to help 143 // support "obvious" type-punning idioms. 144 if (UseCFLAA) 145 PM.add(createCFLAliasAnalysisPass()); 146 PM.add(createTypeBasedAliasAnalysisPass()); 147 PM.add(createScopedNoAliasAAPass()); 148 PM.add(createBasicAliasAnalysisPass()); 149 } 150 151 void PassManagerBuilder::populateFunctionPassManager( 152 legacy::FunctionPassManager &FPM) { 153 addExtensionsToPM(EP_EarlyAsPossible, FPM); 154 155 // Add LibraryInfo if we have some. 156 if (LibraryInfo) 157 FPM.add(new TargetLibraryInfoWrapperPass(*LibraryInfo)); 158 159 if (OptLevel == 0) return; 160 161 addInitialAliasAnalysisPasses(FPM); 162 163 FPM.add(createCFGSimplificationPass()); 164 if (UseNewSROA) 165 FPM.add(createSROAPass()); 166 else 167 FPM.add(createScalarReplAggregatesPass()); 168 FPM.add(createEarlyCSEPass()); 169 FPM.add(createLowerExpectIntrinsicPass()); 170 } 171 172 void PassManagerBuilder::populateModulePassManager( 173 legacy::PassManagerBase &MPM) { 174 // If all optimizations are disabled, just run the always-inline pass and, 175 // if enabled, the function merging pass. 176 if (OptLevel == 0) { 177 if (Inliner) { 178 MPM.add(Inliner); 179 Inliner = nullptr; 180 } 181 182 // FIXME: The BarrierNoopPass is a HACK! The inliner pass above implicitly 183 // creates a CGSCC pass manager, but we don't want to add extensions into 184 // that pass manager. To prevent this we insert a no-op module pass to reset 185 // the pass manager to get the same behavior as EP_OptimizerLast in non-O0 186 // builds. The function merging pass is 187 if (MergeFunctions) 188 MPM.add(createMergeFunctionsPass()); 189 else if (!GlobalExtensions->empty() || !Extensions.empty()) 190 MPM.add(createBarrierNoopPass()); 191 192 addExtensionsToPM(EP_EnabledOnOptLevel0, MPM); 193 return; 194 } 195 196 // Add LibraryInfo if we have some. 197 if (LibraryInfo) 198 MPM.add(new TargetLibraryInfoWrapperPass(*LibraryInfo)); 199 200 addInitialAliasAnalysisPasses(MPM); 201 202 if (!DisableUnitAtATime) { 203 addExtensionsToPM(EP_ModuleOptimizerEarly, MPM); 204 205 MPM.add(createIPSCCPPass()); // IP SCCP 206 MPM.add(createGlobalOptimizerPass()); // Optimize out global vars 207 208 MPM.add(createDeadArgEliminationPass()); // Dead argument elimination 209 210 MPM.add(createInstructionCombiningPass());// Clean up after IPCP & DAE 211 addExtensionsToPM(EP_Peephole, MPM); 212 MPM.add(createCFGSimplificationPass()); // Clean up after IPCP & DAE 213 } 214 215 // Start of CallGraph SCC passes. 216 if (!DisableUnitAtATime) 217 MPM.add(createPruneEHPass()); // Remove dead EH info 218 if (Inliner) { 219 MPM.add(Inliner); 220 Inliner = nullptr; 221 } 222 if (!DisableUnitAtATime) 223 MPM.add(createFunctionAttrsPass()); // Set readonly/readnone attrs 224 if (OptLevel > 2) 225 MPM.add(createArgumentPromotionPass()); // Scalarize uninlined fn args 226 227 // Start of function pass. 228 // Break up aggregate allocas, using SSAUpdater. 229 if (UseNewSROA) 230 MPM.add(createSROAPass(/*RequiresDomTree*/ false)); 231 else 232 MPM.add(createScalarReplAggregatesPass(-1, false)); 233 MPM.add(createEarlyCSEPass()); // Catch trivial redundancies 234 MPM.add(createJumpThreadingPass()); // Thread jumps. 235 MPM.add(createCorrelatedValuePropagationPass()); // Propagate conditionals 236 MPM.add(createCFGSimplificationPass()); // Merge & remove BBs 237 MPM.add(createInstructionCombiningPass()); // Combine silly seq's 238 addExtensionsToPM(EP_Peephole, MPM); 239 240 MPM.add(createTailCallEliminationPass()); // Eliminate tail calls 241 MPM.add(createCFGSimplificationPass()); // Merge & remove BBs 242 MPM.add(createReassociatePass()); // Reassociate expressions 243 // Rotate Loop - disable header duplication at -Oz 244 MPM.add(createLoopRotatePass(SizeLevel == 2 ? 0 : -1)); 245 MPM.add(createLICMPass()); // Hoist loop invariants 246 MPM.add(createLoopUnswitchPass(SizeLevel || OptLevel < 3)); 247 MPM.add(createInstructionCombiningPass()); 248 MPM.add(createIndVarSimplifyPass()); // Canonicalize indvars 249 MPM.add(createLoopIdiomPass()); // Recognize idioms like memset. 250 MPM.add(createLoopDeletionPass()); // Delete dead loops 251 if (EnableLoopInterchange) { 252 MPM.add(createLoopInterchangePass()); // Interchange loops 253 MPM.add(createCFGSimplificationPass()); 254 } 255 if (!DisableUnrollLoops) 256 MPM.add(createSimpleLoopUnrollPass()); // Unroll small loops 257 addExtensionsToPM(EP_LoopOptimizerEnd, MPM); 258 259 if (OptLevel > 1) { 260 if (EnableMLSM) 261 MPM.add(createMergedLoadStoreMotionPass()); // Merge ld/st in diamonds 262 MPM.add(createGVNPass(DisableGVNLoadPRE)); // Remove redundancies 263 } 264 MPM.add(createMemCpyOptPass()); // Remove memcpy / form memset 265 MPM.add(createSCCPPass()); // Constant prop with SCCP 266 267 // Delete dead bit computations (instcombine runs after to fold away the dead 268 // computations, and then ADCE will run later to exploit any new DCE 269 // opportunities that creates). 270 MPM.add(createBitTrackingDCEPass()); // Delete dead bit computations 271 272 // Run instcombine after redundancy elimination to exploit opportunities 273 // opened up by them. 274 MPM.add(createInstructionCombiningPass()); 275 addExtensionsToPM(EP_Peephole, MPM); 276 MPM.add(createJumpThreadingPass()); // Thread jumps 277 MPM.add(createCorrelatedValuePropagationPass()); 278 MPM.add(createDeadStoreEliminationPass()); // Delete dead stores 279 MPM.add(createLICMPass()); 280 281 addExtensionsToPM(EP_ScalarOptimizerLate, MPM); 282 283 if (RerollLoops) 284 MPM.add(createLoopRerollPass()); 285 if (!RunSLPAfterLoopVectorization) { 286 if (SLPVectorize) 287 MPM.add(createSLPVectorizerPass()); // Vectorize parallel scalar chains. 288 289 if (BBVectorize) { 290 MPM.add(createBBVectorizePass()); 291 MPM.add(createInstructionCombiningPass()); 292 addExtensionsToPM(EP_Peephole, MPM); 293 if (OptLevel > 1 && UseGVNAfterVectorization) 294 MPM.add(createGVNPass(DisableGVNLoadPRE)); // Remove redundancies 295 else 296 MPM.add(createEarlyCSEPass()); // Catch trivial redundancies 297 298 // BBVectorize may have significantly shortened a loop body; unroll again. 299 if (!DisableUnrollLoops) 300 MPM.add(createLoopUnrollPass()); 301 } 302 } 303 304 if (LoadCombine) 305 MPM.add(createLoadCombinePass()); 306 307 MPM.add(createAggressiveDCEPass()); // Delete dead instructions 308 MPM.add(createCFGSimplificationPass()); // Merge & remove BBs 309 MPM.add(createInstructionCombiningPass()); // Clean up after everything. 310 addExtensionsToPM(EP_Peephole, MPM); 311 312 // FIXME: This is a HACK! The inliner pass above implicitly creates a CGSCC 313 // pass manager that we are specifically trying to avoid. To prevent this 314 // we must insert a no-op module pass to reset the pass manager. 315 MPM.add(createBarrierNoopPass()); 316 317 if (RunFloat2Int) 318 MPM.add(createFloat2IntPass()); 319 320 // Re-rotate loops in all our loop nests. These may have fallout out of 321 // rotated form due to GVN or other transformations, and the vectorizer relies 322 // on the rotated form. 323 MPM.add(createLoopRotatePass()); 324 325 // Distribute loops to allow partial vectorization. I.e. isolate dependences 326 // into separate loop that would otherwise inhibit vectorization. 327 if (EnableLoopDistribute) 328 MPM.add(createLoopDistributePass()); 329 330 MPM.add(createLoopVectorizePass(DisableUnrollLoops, LoopVectorize)); 331 // FIXME: Because of #pragma vectorize enable, the passes below are always 332 // inserted in the pipeline, even when the vectorizer doesn't run (ex. when 333 // on -O1 and no #pragma is found). Would be good to have these two passes 334 // as function calls, so that we can only pass them when the vectorizer 335 // changed the code. 336 MPM.add(createInstructionCombiningPass()); 337 if (OptLevel > 1 && ExtraVectorizerPasses) { 338 // At higher optimization levels, try to clean up any runtime overlap and 339 // alignment checks inserted by the vectorizer. We want to track correllated 340 // runtime checks for two inner loops in the same outer loop, fold any 341 // common computations, hoist loop-invariant aspects out of any outer loop, 342 // and unswitch the runtime checks if possible. Once hoisted, we may have 343 // dead (or speculatable) control flows or more combining opportunities. 344 MPM.add(createEarlyCSEPass()); 345 MPM.add(createCorrelatedValuePropagationPass()); 346 MPM.add(createInstructionCombiningPass()); 347 MPM.add(createLICMPass()); 348 MPM.add(createLoopUnswitchPass(SizeLevel || OptLevel < 3)); 349 MPM.add(createCFGSimplificationPass()); 350 MPM.add(createInstructionCombiningPass()); 351 } 352 353 if (RunSLPAfterLoopVectorization) { 354 if (SLPVectorize) { 355 MPM.add(createSLPVectorizerPass()); // Vectorize parallel scalar chains. 356 if (OptLevel > 1 && ExtraVectorizerPasses) { 357 MPM.add(createEarlyCSEPass()); 358 } 359 } 360 361 if (BBVectorize) { 362 MPM.add(createBBVectorizePass()); 363 MPM.add(createInstructionCombiningPass()); 364 addExtensionsToPM(EP_Peephole, MPM); 365 if (OptLevel > 1 && UseGVNAfterVectorization) 366 MPM.add(createGVNPass(DisableGVNLoadPRE)); // Remove redundancies 367 else 368 MPM.add(createEarlyCSEPass()); // Catch trivial redundancies 369 370 // BBVectorize may have significantly shortened a loop body; unroll again. 371 if (!DisableUnrollLoops) 372 MPM.add(createLoopUnrollPass()); 373 } 374 } 375 376 addExtensionsToPM(EP_Peephole, MPM); 377 MPM.add(createCFGSimplificationPass()); 378 MPM.add(createInstructionCombiningPass()); 379 380 if (!DisableUnrollLoops) { 381 MPM.add(createLoopUnrollPass()); // Unroll small loops 382 383 // LoopUnroll may generate some redundency to cleanup. 384 MPM.add(createInstructionCombiningPass()); 385 386 // Runtime unrolling will introduce runtime check in loop prologue. If the 387 // unrolled loop is a inner loop, then the prologue will be inside the 388 // outer loop. LICM pass can help to promote the runtime check out if the 389 // checked value is loop invariant. 390 MPM.add(createLICMPass()); 391 } 392 393 // After vectorization and unrolling, assume intrinsics may tell us more 394 // about pointer alignments. 395 MPM.add(createAlignmentFromAssumptionsPass()); 396 397 if (!DisableUnitAtATime) { 398 // FIXME: We shouldn't bother with this anymore. 399 MPM.add(createStripDeadPrototypesPass()); // Get rid of dead prototypes 400 401 // GlobalOpt already deletes dead functions and globals, at -O2 try a 402 // late pass of GlobalDCE. It is capable of deleting dead cycles. 403 if (OptLevel > 1) { 404 MPM.add(createGlobalDCEPass()); // Remove dead fns and globals. 405 MPM.add(createConstantMergePass()); // Merge dup global constants 406 } 407 } 408 409 if (MergeFunctions) 410 MPM.add(createMergeFunctionsPass()); 411 412 addExtensionsToPM(EP_OptimizerLast, MPM); 413 } 414 415 void PassManagerBuilder::addLTOOptimizationPasses(legacy::PassManagerBase &PM) { 416 // Provide AliasAnalysis services for optimizations. 417 addInitialAliasAnalysisPasses(PM); 418 419 // Propagate constants at call sites into the functions they call. This 420 // opens opportunities for globalopt (and inlining) by substituting function 421 // pointers passed as arguments to direct uses of functions. 422 PM.add(createIPSCCPPass()); 423 424 // Now that we internalized some globals, see if we can hack on them! 425 PM.add(createGlobalOptimizerPass()); 426 427 // Linking modules together can lead to duplicated global constants, only 428 // keep one copy of each constant. 429 PM.add(createConstantMergePass()); 430 431 // Remove unused arguments from functions. 432 PM.add(createDeadArgEliminationPass()); 433 434 // Reduce the code after globalopt and ipsccp. Both can open up significant 435 // simplification opportunities, and both can propagate functions through 436 // function pointers. When this happens, we often have to resolve varargs 437 // calls, etc, so let instcombine do this. 438 PM.add(createInstructionCombiningPass()); 439 addExtensionsToPM(EP_Peephole, PM); 440 441 // Inline small functions 442 bool RunInliner = Inliner; 443 if (RunInliner) { 444 PM.add(Inliner); 445 Inliner = nullptr; 446 } 447 448 PM.add(createPruneEHPass()); // Remove dead EH info. 449 450 // Optimize globals again if we ran the inliner. 451 if (RunInliner) 452 PM.add(createGlobalOptimizerPass()); 453 PM.add(createGlobalDCEPass()); // Remove dead functions. 454 455 // If we didn't decide to inline a function, check to see if we can 456 // transform it to pass arguments by value instead of by reference. 457 PM.add(createArgumentPromotionPass()); 458 459 // The IPO passes may leave cruft around. Clean up after them. 460 PM.add(createInstructionCombiningPass()); 461 addExtensionsToPM(EP_Peephole, PM); 462 PM.add(createJumpThreadingPass()); 463 464 // Break up allocas 465 if (UseNewSROA) 466 PM.add(createSROAPass()); 467 else 468 PM.add(createScalarReplAggregatesPass()); 469 470 // Run a few AA driven optimizations here and now, to cleanup the code. 471 PM.add(createFunctionAttrsPass()); // Add nocapture. 472 PM.add(createGlobalsModRefPass()); // IP alias analysis. 473 474 PM.add(createLICMPass()); // Hoist loop invariants. 475 if (EnableMLSM) 476 PM.add(createMergedLoadStoreMotionPass()); // Merge ld/st in diamonds. 477 PM.add(createGVNPass(DisableGVNLoadPRE)); // Remove redundancies. 478 PM.add(createMemCpyOptPass()); // Remove dead memcpys. 479 480 // Nuke dead stores. 481 PM.add(createDeadStoreEliminationPass()); 482 483 // More loops are countable; try to optimize them. 484 PM.add(createIndVarSimplifyPass()); 485 PM.add(createLoopDeletionPass()); 486 if (EnableLoopInterchange) 487 PM.add(createLoopInterchangePass()); 488 489 PM.add(createLoopVectorizePass(true, LoopVectorize)); 490 491 // More scalar chains could be vectorized due to more alias information 492 if (RunSLPAfterLoopVectorization) 493 if (SLPVectorize) 494 PM.add(createSLPVectorizerPass()); // Vectorize parallel scalar chains. 495 496 // After vectorization, assume intrinsics may tell us more about pointer 497 // alignments. 498 PM.add(createAlignmentFromAssumptionsPass()); 499 500 if (LoadCombine) 501 PM.add(createLoadCombinePass()); 502 503 // Cleanup and simplify the code after the scalar optimizations. 504 PM.add(createInstructionCombiningPass()); 505 addExtensionsToPM(EP_Peephole, PM); 506 507 PM.add(createJumpThreadingPass()); 508 } 509 510 void PassManagerBuilder::addLateLTOOptimizationPasses( 511 legacy::PassManagerBase &PM) { 512 // Delete basic blocks, which optimization passes may have killed. 513 PM.add(createCFGSimplificationPass()); 514 515 // Now that we have optimized the program, discard unreachable functions. 516 PM.add(createGlobalDCEPass()); 517 518 // FIXME: this is profitable (for compiler time) to do at -O0 too, but 519 // currently it damages debug info. 520 if (MergeFunctions) 521 PM.add(createMergeFunctionsPass()); 522 } 523 524 void PassManagerBuilder::populateLTOPassManager(legacy::PassManagerBase &PM) { 525 if (LibraryInfo) 526 PM.add(new TargetLibraryInfoWrapperPass(*LibraryInfo)); 527 528 if (VerifyInput) 529 PM.add(createVerifierPass()); 530 531 if (OptLevel > 1) 532 addLTOOptimizationPasses(PM); 533 534 // Lower bit sets to globals. This pass supports Clang's control flow 535 // integrity mechanisms (-fsanitize=cfi*) and needs to run at link time if CFI 536 // is enabled. The pass does nothing if CFI is disabled. 537 PM.add(createLowerBitSetsPass()); 538 539 if (OptLevel != 0) 540 addLateLTOOptimizationPasses(PM); 541 542 if (VerifyOutput) 543 PM.add(createVerifierPass()); 544 } 545 546 inline PassManagerBuilder *unwrap(LLVMPassManagerBuilderRef P) { 547 return reinterpret_cast<PassManagerBuilder*>(P); 548 } 549 550 inline LLVMPassManagerBuilderRef wrap(PassManagerBuilder *P) { 551 return reinterpret_cast<LLVMPassManagerBuilderRef>(P); 552 } 553 554 LLVMPassManagerBuilderRef LLVMPassManagerBuilderCreate() { 555 PassManagerBuilder *PMB = new PassManagerBuilder(); 556 return wrap(PMB); 557 } 558 559 void LLVMPassManagerBuilderDispose(LLVMPassManagerBuilderRef PMB) { 560 PassManagerBuilder *Builder = unwrap(PMB); 561 delete Builder; 562 } 563 564 void 565 LLVMPassManagerBuilderSetOptLevel(LLVMPassManagerBuilderRef PMB, 566 unsigned OptLevel) { 567 PassManagerBuilder *Builder = unwrap(PMB); 568 Builder->OptLevel = OptLevel; 569 } 570 571 void 572 LLVMPassManagerBuilderSetSizeLevel(LLVMPassManagerBuilderRef PMB, 573 unsigned SizeLevel) { 574 PassManagerBuilder *Builder = unwrap(PMB); 575 Builder->SizeLevel = SizeLevel; 576 } 577 578 void 579 LLVMPassManagerBuilderSetDisableUnitAtATime(LLVMPassManagerBuilderRef PMB, 580 LLVMBool Value) { 581 PassManagerBuilder *Builder = unwrap(PMB); 582 Builder->DisableUnitAtATime = Value; 583 } 584 585 void 586 LLVMPassManagerBuilderSetDisableUnrollLoops(LLVMPassManagerBuilderRef PMB, 587 LLVMBool Value) { 588 PassManagerBuilder *Builder = unwrap(PMB); 589 Builder->DisableUnrollLoops = Value; 590 } 591 592 void 593 LLVMPassManagerBuilderSetDisableSimplifyLibCalls(LLVMPassManagerBuilderRef PMB, 594 LLVMBool Value) { 595 // NOTE: The simplify-libcalls pass has been removed. 596 } 597 598 void 599 LLVMPassManagerBuilderUseInlinerWithThreshold(LLVMPassManagerBuilderRef PMB, 600 unsigned Threshold) { 601 PassManagerBuilder *Builder = unwrap(PMB); 602 Builder->Inliner = createFunctionInliningPass(Threshold); 603 } 604 605 void 606 LLVMPassManagerBuilderPopulateFunctionPassManager(LLVMPassManagerBuilderRef PMB, 607 LLVMPassManagerRef PM) { 608 PassManagerBuilder *Builder = unwrap(PMB); 609 legacy::FunctionPassManager *FPM = unwrap<legacy::FunctionPassManager>(PM); 610 Builder->populateFunctionPassManager(*FPM); 611 } 612 613 void 614 LLVMPassManagerBuilderPopulateModulePassManager(LLVMPassManagerBuilderRef PMB, 615 LLVMPassManagerRef PM) { 616 PassManagerBuilder *Builder = unwrap(PMB); 617 legacy::PassManagerBase *MPM = unwrap(PM); 618 Builder->populateModulePassManager(*MPM); 619 } 620 621 void LLVMPassManagerBuilderPopulateLTOPassManager(LLVMPassManagerBuilderRef PMB, 622 LLVMPassManagerRef PM, 623 LLVMBool Internalize, 624 LLVMBool RunInliner) { 625 PassManagerBuilder *Builder = unwrap(PMB); 626 legacy::PassManagerBase *LPM = unwrap(PM); 627 628 // A small backwards compatibility hack. populateLTOPassManager used to take 629 // an RunInliner option. 630 if (RunInliner && !Builder->Inliner) 631 Builder->Inliner = createFunctionInliningPass(); 632 633 Builder->populateLTOPassManager(*LPM); 634 } 635