1 //===- PassManagerBuilder.cpp - Build Standard Pass -----------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
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++.
13 //===----------------------------------------------------------------------===//
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"
34 RunLoopVectorization("vectorize-loops", cl::Hidden,
35 cl::desc("Run the Loop vectorization passes"));
38 RunSLPVectorization("vectorize-slp", cl::Hidden,
39 cl::desc("Run the SLP vectorization passes"));
42 RunBBVectorization("vectorize-slp-aggressive", cl::Hidden,
43 cl::desc("Run the BB vectorization passes"));
46 UseGVNAfterVectorization("use-gvn-after-vectorization",
47 cl::init(false), cl::Hidden,
48 cl::desc("Run GVN instead of Early CSE after vectorization passes"));
50 static cl::opt<bool> ExtraVectorizerPasses(
51 "extra-vectorizer-passes", cl::init(false), cl::Hidden,
52 cl::desc("Run cleanup optimization passes after vectorization."));
54 static cl::opt<bool> UseNewSROA("use-new-sroa",
55 cl::init(true), cl::Hidden,
56 cl::desc("Enable the new, experimental SROA pass"));
59 RunLoopRerolling("reroll-loops", cl::Hidden,
60 cl::desc("Run the loop rerolling pass"));
63 RunFloat2Int("float-to-int", cl::Hidden, cl::init(true),
64 cl::desc("Run the float2int (float demotion) pass"));
66 static cl::opt<bool> RunLoadCombine("combine-loads", cl::init(false),
68 cl::desc("Run the load combining pass"));
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"));
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"));
81 EnableMLSM("mlsm", cl::init(true), cl::Hidden,
82 cl::desc("Enable motion of merged load and store"));
84 static cl::opt<bool> EnableLoopInterchange(
85 "enable-loopinterchange", cl::init(false), cl::Hidden,
86 cl::desc("Enable the new, experimental LoopInterchange Pass"));
88 static cl::opt<bool> EnableLoopDistribute(
89 "enable-loop-distribute", cl::init(false), cl::Hidden,
90 cl::desc("Enable the new, experimental LoopDistribution Pass"));
92 PassManagerBuilder::PassManagerBuilder() {
95 LibraryInfo = 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;
106 VerifyOutput = false;
107 MergeFunctions = false;
108 PrepareForLTO = false;
111 PassManagerBuilder::~PassManagerBuilder() {
116 /// Set of global extensions, automatically added as part of the standard set.
117 static ManagedStatic<SmallVector<std::pair<PassManagerBuilder::ExtensionPointTy,
118 PassManagerBuilder::ExtensionFn>, 8> > GlobalExtensions;
120 void PassManagerBuilder::addGlobalExtension(
121 PassManagerBuilder::ExtensionPointTy Ty,
122 PassManagerBuilder::ExtensionFn Fn) {
123 GlobalExtensions->push_back(std::make_pair(Ty, Fn));
126 void PassManagerBuilder::addExtension(ExtensionPointTy Ty, ExtensionFn Fn) {
127 Extensions.push_back(std::make_pair(Ty, Fn));
130 void PassManagerBuilder::addExtensionsToPM(ExtensionPointTy ETy,
131 legacy::PassManagerBase &PM) const {
132 for (unsigned i = 0, e = GlobalExtensions->size(); i != e; ++i)
133 if ((*GlobalExtensions)[i].first == ETy)
134 (*GlobalExtensions)[i].second(*this, PM);
135 for (unsigned i = 0, e = Extensions.size(); i != e; ++i)
136 if (Extensions[i].first == ETy)
137 Extensions[i].second(*this, PM);
140 void PassManagerBuilder::addInitialAliasAnalysisPasses(
141 legacy::PassManagerBase &PM) const {
142 // Add TypeBasedAliasAnalysis before BasicAliasAnalysis so that
143 // BasicAliasAnalysis wins if they disagree. This is intended to help
144 // support "obvious" type-punning idioms.
146 PM.add(createCFLAliasAnalysisPass());
147 PM.add(createTypeBasedAliasAnalysisPass());
148 PM.add(createScopedNoAliasAAPass());
149 PM.add(createBasicAliasAnalysisPass());
152 void PassManagerBuilder::populateFunctionPassManager(
153 legacy::FunctionPassManager &FPM) {
154 addExtensionsToPM(EP_EarlyAsPossible, FPM);
156 // Add LibraryInfo if we have some.
158 FPM.add(new TargetLibraryInfoWrapperPass(*LibraryInfo));
160 if (OptLevel == 0) return;
162 addInitialAliasAnalysisPasses(FPM);
164 FPM.add(createCFGSimplificationPass());
166 FPM.add(createSROAPass());
168 FPM.add(createScalarReplAggregatesPass());
169 FPM.add(createEarlyCSEPass());
170 FPM.add(createLowerExpectIntrinsicPass());
173 void PassManagerBuilder::populateModulePassManager(
174 legacy::PassManagerBase &MPM) {
175 // If all optimizations are disabled, just run the always-inline pass and,
176 // if enabled, the function merging pass.
183 // FIXME: The BarrierNoopPass is a HACK! The inliner pass above implicitly
184 // creates a CGSCC pass manager, but we don't want to add extensions into
185 // that pass manager. To prevent this we insert a no-op module pass to reset
186 // the pass manager to get the same behavior as EP_OptimizerLast in non-O0
187 // builds. The function merging pass is
189 MPM.add(createMergeFunctionsPass());
190 else if (!GlobalExtensions->empty() || !Extensions.empty())
191 MPM.add(createBarrierNoopPass());
193 addExtensionsToPM(EP_EnabledOnOptLevel0, MPM);
197 // Add LibraryInfo if we have some.
199 MPM.add(new TargetLibraryInfoWrapperPass(*LibraryInfo));
201 addInitialAliasAnalysisPasses(MPM);
203 if (!DisableUnitAtATime) {
204 addExtensionsToPM(EP_ModuleOptimizerEarly, MPM);
206 MPM.add(createIPSCCPPass()); // IP SCCP
207 MPM.add(createGlobalOptimizerPass()); // Optimize out global vars
209 MPM.add(createDeadArgEliminationPass()); // Dead argument elimination
211 MPM.add(createInstructionCombiningPass());// Clean up after IPCP & DAE
212 addExtensionsToPM(EP_Peephole, MPM);
213 MPM.add(createCFGSimplificationPass()); // Clean up after IPCP & DAE
216 // Start of CallGraph SCC passes.
217 if (!DisableUnitAtATime)
218 MPM.add(createPruneEHPass()); // Remove dead EH info
223 if (!DisableUnitAtATime)
224 MPM.add(createFunctionAttrsPass()); // Set readonly/readnone attrs
226 MPM.add(createArgumentPromotionPass()); // Scalarize uninlined fn args
228 // Start of function pass.
229 // Break up aggregate allocas, using SSAUpdater.
231 MPM.add(createSROAPass(/*RequiresDomTree*/ false));
233 MPM.add(createScalarReplAggregatesPass(-1, false));
234 MPM.add(createEarlyCSEPass()); // Catch trivial redundancies
235 MPM.add(createJumpThreadingPass()); // Thread jumps.
236 MPM.add(createCorrelatedValuePropagationPass()); // Propagate conditionals
237 MPM.add(createCFGSimplificationPass()); // Merge & remove BBs
238 MPM.add(createInstructionCombiningPass()); // Combine silly seq's
239 addExtensionsToPM(EP_Peephole, MPM);
241 MPM.add(createTailCallEliminationPass()); // Eliminate tail calls
242 MPM.add(createCFGSimplificationPass()); // Merge & remove BBs
243 MPM.add(createReassociatePass()); // Reassociate expressions
244 // Rotate Loop - disable header duplication at -Oz
245 MPM.add(createLoopRotatePass(SizeLevel == 2 ? 0 : -1));
246 MPM.add(createLICMPass()); // Hoist loop invariants
247 MPM.add(createLoopUnswitchPass(SizeLevel || OptLevel < 3));
248 MPM.add(createInstructionCombiningPass());
249 MPM.add(createIndVarSimplifyPass()); // Canonicalize indvars
250 MPM.add(createLoopIdiomPass()); // Recognize idioms like memset.
251 MPM.add(createLoopDeletionPass()); // Delete dead loops
252 if (EnableLoopInterchange) {
253 MPM.add(createLoopInterchangePass()); // Interchange loops
254 MPM.add(createCFGSimplificationPass());
256 if (!DisableUnrollLoops)
257 MPM.add(createSimpleLoopUnrollPass()); // Unroll small loops
258 addExtensionsToPM(EP_LoopOptimizerEnd, MPM);
262 MPM.add(createMergedLoadStoreMotionPass()); // Merge ld/st in diamonds
263 MPM.add(createGVNPass(DisableGVNLoadPRE)); // Remove redundancies
265 MPM.add(createMemCpyOptPass()); // Remove memcpy / form memset
266 MPM.add(createSCCPPass()); // Constant prop with SCCP
268 // Delete dead bit computations (instcombine runs after to fold away the dead
269 // computations, and then ADCE will run later to exploit any new DCE
270 // opportunities that creates).
271 MPM.add(createBitTrackingDCEPass()); // Delete dead bit computations
273 // Run instcombine after redundancy elimination to exploit opportunities
274 // opened up by them.
275 MPM.add(createInstructionCombiningPass());
276 addExtensionsToPM(EP_Peephole, MPM);
277 MPM.add(createJumpThreadingPass()); // Thread jumps
278 MPM.add(createCorrelatedValuePropagationPass());
279 MPM.add(createDeadStoreEliminationPass()); // Delete dead stores
280 MPM.add(createLICMPass());
282 addExtensionsToPM(EP_ScalarOptimizerLate, MPM);
285 MPM.add(createLoopRerollPass());
286 if (!RunSLPAfterLoopVectorization) {
288 MPM.add(createSLPVectorizerPass()); // Vectorize parallel scalar chains.
291 MPM.add(createBBVectorizePass());
292 MPM.add(createInstructionCombiningPass());
293 addExtensionsToPM(EP_Peephole, MPM);
294 if (OptLevel > 1 && UseGVNAfterVectorization)
295 MPM.add(createGVNPass(DisableGVNLoadPRE)); // Remove redundancies
297 MPM.add(createEarlyCSEPass()); // Catch trivial redundancies
299 // BBVectorize may have significantly shortened a loop body; unroll again.
300 if (!DisableUnrollLoops)
301 MPM.add(createLoopUnrollPass());
306 MPM.add(createLoadCombinePass());
308 MPM.add(createAggressiveDCEPass()); // Delete dead instructions
309 MPM.add(createCFGSimplificationPass()); // Merge & remove BBs
310 MPM.add(createInstructionCombiningPass()); // Clean up after everything.
311 addExtensionsToPM(EP_Peephole, MPM);
313 // FIXME: This is a HACK! The inliner pass above implicitly creates a CGSCC
314 // pass manager that we are specifically trying to avoid. To prevent this
315 // we must insert a no-op module pass to reset the pass manager.
316 MPM.add(createBarrierNoopPass());
319 MPM.add(createFloat2IntPass());
321 addExtensionsToPM(EP_VectorizerStart, MPM);
323 // Re-rotate loops in all our loop nests. These may have fallout out of
324 // rotated form due to GVN or other transformations, and the vectorizer relies
325 // on the rotated form. Disable header duplication at -Oz.
326 MPM.add(createLoopRotatePass(SizeLevel == 2 ? 0 : -1));
328 // Distribute loops to allow partial vectorization. I.e. isolate dependences
329 // into separate loop that would otherwise inhibit vectorization.
330 if (EnableLoopDistribute)
331 MPM.add(createLoopDistributePass());
333 MPM.add(createLoopVectorizePass(DisableUnrollLoops, LoopVectorize));
334 // FIXME: Because of #pragma vectorize enable, the passes below are always
335 // inserted in the pipeline, even when the vectorizer doesn't run (ex. when
336 // on -O1 and no #pragma is found). Would be good to have these two passes
337 // as function calls, so that we can only pass them when the vectorizer
339 MPM.add(createInstructionCombiningPass());
340 if (OptLevel > 1 && ExtraVectorizerPasses) {
341 // At higher optimization levels, try to clean up any runtime overlap and
342 // alignment checks inserted by the vectorizer. We want to track correllated
343 // runtime checks for two inner loops in the same outer loop, fold any
344 // common computations, hoist loop-invariant aspects out of any outer loop,
345 // and unswitch the runtime checks if possible. Once hoisted, we may have
346 // dead (or speculatable) control flows or more combining opportunities.
347 MPM.add(createEarlyCSEPass());
348 MPM.add(createCorrelatedValuePropagationPass());
349 MPM.add(createInstructionCombiningPass());
350 MPM.add(createLICMPass());
351 MPM.add(createLoopUnswitchPass(SizeLevel || OptLevel < 3));
352 MPM.add(createCFGSimplificationPass());
353 MPM.add(createInstructionCombiningPass());
356 if (RunSLPAfterLoopVectorization) {
358 MPM.add(createSLPVectorizerPass()); // Vectorize parallel scalar chains.
359 if (OptLevel > 1 && ExtraVectorizerPasses) {
360 MPM.add(createEarlyCSEPass());
365 MPM.add(createBBVectorizePass());
366 MPM.add(createInstructionCombiningPass());
367 addExtensionsToPM(EP_Peephole, MPM);
368 if (OptLevel > 1 && UseGVNAfterVectorization)
369 MPM.add(createGVNPass(DisableGVNLoadPRE)); // Remove redundancies
371 MPM.add(createEarlyCSEPass()); // Catch trivial redundancies
373 // BBVectorize may have significantly shortened a loop body; unroll again.
374 if (!DisableUnrollLoops)
375 MPM.add(createLoopUnrollPass());
379 addExtensionsToPM(EP_Peephole, MPM);
380 MPM.add(createCFGSimplificationPass());
381 MPM.add(createInstructionCombiningPass());
383 if (!DisableUnrollLoops) {
384 MPM.add(createLoopUnrollPass()); // Unroll small loops
386 // LoopUnroll may generate some redundency to cleanup.
387 MPM.add(createInstructionCombiningPass());
389 // Runtime unrolling will introduce runtime check in loop prologue. If the
390 // unrolled loop is a inner loop, then the prologue will be inside the
391 // outer loop. LICM pass can help to promote the runtime check out if the
392 // checked value is loop invariant.
393 MPM.add(createLICMPass());
396 // After vectorization and unrolling, assume intrinsics may tell us more
397 // about pointer alignments.
398 MPM.add(createAlignmentFromAssumptionsPass());
400 if (!DisableUnitAtATime) {
401 // FIXME: We shouldn't bother with this anymore.
402 MPM.add(createStripDeadPrototypesPass()); // Get rid of dead prototypes
404 // GlobalOpt already deletes dead functions and globals, at -O2 try a
405 // late pass of GlobalDCE. It is capable of deleting dead cycles.
407 if (!PrepareForLTO) {
408 // Remove avail extern fns and globals definitions if we aren't
409 // compiling an object file for later LTO. For LTO we want to preserve
410 // these so they are eligible for inlining at link-time. Note if they
411 // are unreferenced they will be removed by GlobalDCE below, so
412 // this only impacts referenced available externally globals.
413 // Eventually they will be suppressed during codegen, but eliminating
414 // here enables more opportunity for GlobalDCE as it may make
415 // globals referenced by available external functions dead.
416 MPM.add(createEliminateAvailableExternallyPass());
418 MPM.add(createGlobalDCEPass()); // Remove dead fns and globals.
419 MPM.add(createConstantMergePass()); // Merge dup global constants
424 MPM.add(createMergeFunctionsPass());
426 addExtensionsToPM(EP_OptimizerLast, MPM);
429 void PassManagerBuilder::addLTOOptimizationPasses(legacy::PassManagerBase &PM) {
430 // Provide AliasAnalysis services for optimizations.
431 addInitialAliasAnalysisPasses(PM);
433 // Propagate constants at call sites into the functions they call. This
434 // opens opportunities for globalopt (and inlining) by substituting function
435 // pointers passed as arguments to direct uses of functions.
436 PM.add(createIPSCCPPass());
438 // Now that we internalized some globals, see if we can hack on them!
439 PM.add(createGlobalOptimizerPass());
441 // Linking modules together can lead to duplicated global constants, only
442 // keep one copy of each constant.
443 PM.add(createConstantMergePass());
445 // Remove unused arguments from functions.
446 PM.add(createDeadArgEliminationPass());
448 // Reduce the code after globalopt and ipsccp. Both can open up significant
449 // simplification opportunities, and both can propagate functions through
450 // function pointers. When this happens, we often have to resolve varargs
451 // calls, etc, so let instcombine do this.
452 PM.add(createInstructionCombiningPass());
453 addExtensionsToPM(EP_Peephole, PM);
455 // Inline small functions
456 bool RunInliner = Inliner;
462 PM.add(createPruneEHPass()); // Remove dead EH info.
464 // Optimize globals again if we ran the inliner.
466 PM.add(createGlobalOptimizerPass());
467 PM.add(createGlobalDCEPass()); // Remove dead functions.
469 // If we didn't decide to inline a function, check to see if we can
470 // transform it to pass arguments by value instead of by reference.
471 PM.add(createArgumentPromotionPass());
473 // The IPO passes may leave cruft around. Clean up after them.
474 PM.add(createInstructionCombiningPass());
475 addExtensionsToPM(EP_Peephole, PM);
476 PM.add(createJumpThreadingPass());
480 PM.add(createSROAPass());
482 PM.add(createScalarReplAggregatesPass());
484 // Run a few AA driven optimizations here and now, to cleanup the code.
485 PM.add(createFunctionAttrsPass()); // Add nocapture.
486 PM.add(createGlobalsModRefPass()); // IP alias analysis.
488 PM.add(createLICMPass()); // Hoist loop invariants.
490 PM.add(createMergedLoadStoreMotionPass()); // Merge ld/st in diamonds.
491 PM.add(createGVNPass(DisableGVNLoadPRE)); // Remove redundancies.
492 PM.add(createMemCpyOptPass()); // Remove dead memcpys.
495 PM.add(createDeadStoreEliminationPass());
497 // More loops are countable; try to optimize them.
498 PM.add(createIndVarSimplifyPass());
499 PM.add(createLoopDeletionPass());
500 if (EnableLoopInterchange)
501 PM.add(createLoopInterchangePass());
503 PM.add(createLoopVectorizePass(true, LoopVectorize));
505 // More scalar chains could be vectorized due to more alias information
506 if (RunSLPAfterLoopVectorization)
508 PM.add(createSLPVectorizerPass()); // Vectorize parallel scalar chains.
510 // After vectorization, assume intrinsics may tell us more about pointer
512 PM.add(createAlignmentFromAssumptionsPass());
515 PM.add(createLoadCombinePass());
517 // Cleanup and simplify the code after the scalar optimizations.
518 PM.add(createInstructionCombiningPass());
519 addExtensionsToPM(EP_Peephole, PM);
521 PM.add(createJumpThreadingPass());
524 void PassManagerBuilder::addLateLTOOptimizationPasses(
525 legacy::PassManagerBase &PM) {
526 // Delete basic blocks, which optimization passes may have killed.
527 PM.add(createCFGSimplificationPass());
529 // Now that we have optimized the program, discard unreachable functions.
530 PM.add(createGlobalDCEPass());
532 // FIXME: this is profitable (for compiler time) to do at -O0 too, but
533 // currently it damages debug info.
535 PM.add(createMergeFunctionsPass());
538 void PassManagerBuilder::populateLTOPassManager(legacy::PassManagerBase &PM) {
540 PM.add(new TargetLibraryInfoWrapperPass(*LibraryInfo));
543 PM.add(createVerifierPass());
546 addLTOOptimizationPasses(PM);
548 // Lower bit sets to globals. This pass supports Clang's control flow
549 // integrity mechanisms (-fsanitize=cfi*) and needs to run at link time if CFI
550 // is enabled. The pass does nothing if CFI is disabled.
551 PM.add(createLowerBitSetsPass());
554 addLateLTOOptimizationPasses(PM);
557 PM.add(createVerifierPass());
560 inline PassManagerBuilder *unwrap(LLVMPassManagerBuilderRef P) {
561 return reinterpret_cast<PassManagerBuilder*>(P);
564 inline LLVMPassManagerBuilderRef wrap(PassManagerBuilder *P) {
565 return reinterpret_cast<LLVMPassManagerBuilderRef>(P);
568 LLVMPassManagerBuilderRef LLVMPassManagerBuilderCreate() {
569 PassManagerBuilder *PMB = new PassManagerBuilder();
573 void LLVMPassManagerBuilderDispose(LLVMPassManagerBuilderRef PMB) {
574 PassManagerBuilder *Builder = unwrap(PMB);
579 LLVMPassManagerBuilderSetOptLevel(LLVMPassManagerBuilderRef PMB,
581 PassManagerBuilder *Builder = unwrap(PMB);
582 Builder->OptLevel = OptLevel;
586 LLVMPassManagerBuilderSetSizeLevel(LLVMPassManagerBuilderRef PMB,
587 unsigned SizeLevel) {
588 PassManagerBuilder *Builder = unwrap(PMB);
589 Builder->SizeLevel = SizeLevel;
593 LLVMPassManagerBuilderSetDisableUnitAtATime(LLVMPassManagerBuilderRef PMB,
595 PassManagerBuilder *Builder = unwrap(PMB);
596 Builder->DisableUnitAtATime = Value;
600 LLVMPassManagerBuilderSetDisableUnrollLoops(LLVMPassManagerBuilderRef PMB,
602 PassManagerBuilder *Builder = unwrap(PMB);
603 Builder->DisableUnrollLoops = Value;
607 LLVMPassManagerBuilderSetDisableSimplifyLibCalls(LLVMPassManagerBuilderRef PMB,
609 // NOTE: The simplify-libcalls pass has been removed.
613 LLVMPassManagerBuilderUseInlinerWithThreshold(LLVMPassManagerBuilderRef PMB,
614 unsigned Threshold) {
615 PassManagerBuilder *Builder = unwrap(PMB);
616 Builder->Inliner = createFunctionInliningPass(Threshold);
620 LLVMPassManagerBuilderPopulateFunctionPassManager(LLVMPassManagerBuilderRef PMB,
621 LLVMPassManagerRef PM) {
622 PassManagerBuilder *Builder = unwrap(PMB);
623 legacy::FunctionPassManager *FPM = unwrap<legacy::FunctionPassManager>(PM);
624 Builder->populateFunctionPassManager(*FPM);
628 LLVMPassManagerBuilderPopulateModulePassManager(LLVMPassManagerBuilderRef PMB,
629 LLVMPassManagerRef PM) {
630 PassManagerBuilder *Builder = unwrap(PMB);
631 legacy::PassManagerBase *MPM = unwrap(PM);
632 Builder->populateModulePassManager(*MPM);
635 void LLVMPassManagerBuilderPopulateLTOPassManager(LLVMPassManagerBuilderRef PMB,
636 LLVMPassManagerRef PM,
637 LLVMBool Internalize,
638 LLVMBool RunInliner) {
639 PassManagerBuilder *Builder = unwrap(PMB);
640 legacy::PassManagerBase *LPM = unwrap(PM);
642 // A small backwards compatibility hack. populateLTOPassManager used to take
643 // an RunInliner option.
644 if (RunInliner && !Builder->Inliner)
645 Builder->Inliner = createFunctionInliningPass();
647 Builder->populateLTOPassManager(*LPM);