LLVM  6.0.0svn
Scalar.h
Go to the documentation of this file.
1 //===-- Scalar.h - Scalar Transformations -----------------------*- C++ -*-===//
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 header file defines prototypes for accessor functions that expose passes
11 // in the Scalar transformations library.
12 //
13 //===----------------------------------------------------------------------===//
14 
15 #ifndef LLVM_TRANSFORMS_SCALAR_H
16 #define LLVM_TRANSFORMS_SCALAR_H
17 
18 #include <functional>
19 
20 namespace llvm {
21 
22 class BasicBlockPass;
23 class Function;
24 class FunctionPass;
25 class ModulePass;
26 class Pass;
27 class GetElementPtrInst;
28 class PassInfo;
29 class TerminatorInst;
30 class TargetLowering;
31 class TargetMachine;
32 
33 //===----------------------------------------------------------------------===//
34 //
35 // ConstantPropagation - A worklist driven constant propagation pass
36 //
37 FunctionPass *createConstantPropagationPass();
38 
39 //===----------------------------------------------------------------------===//
40 //
41 // AlignmentFromAssumptions - Use assume intrinsics to set load/store
42 // alignments.
43 //
45 
46 //===----------------------------------------------------------------------===//
47 //
48 // SCCP - Sparse conditional constant propagation.
49 //
50 FunctionPass *createSCCPPass();
51 
52 //===----------------------------------------------------------------------===//
53 //
54 // DeadInstElimination - This pass quickly removes trivially dead instructions
55 // without modifying the CFG of the function. It is a BasicBlockPass, so it
56 // runs efficiently when queued next to other BasicBlockPass's.
57 //
59 
60 //===----------------------------------------------------------------------===//
61 //
62 // DeadCodeElimination - This pass is more powerful than DeadInstElimination,
63 // because it is worklist driven that can potentially revisit instructions when
64 // their other instructions become dead, to eliminate chains of dead
65 // computations.
66 //
67 FunctionPass *createDeadCodeEliminationPass();
68 
69 //===----------------------------------------------------------------------===//
70 //
71 // DeadStoreElimination - This pass deletes stores that are post-dominated by
72 // must-aliased stores and are not loaded used between the stores.
73 //
74 FunctionPass *createDeadStoreEliminationPass();
75 
76 
77 //===----------------------------------------------------------------------===//
78 //
79 // CallSiteSplitting - This pass split call-site based on its known argument
80 // values.
81 FunctionPass *createCallSiteSplittingPass();
82 
83 
84 //===----------------------------------------------------------------------===//
85 //
86 // AggressiveDCE - This pass uses the SSA based Aggressive DCE algorithm. This
87 // algorithm assumes instructions are dead until proven otherwise, which makes
88 // it more successful are removing non-obviously dead instructions.
89 //
90 FunctionPass *createAggressiveDCEPass();
91 
92 
93 //===----------------------------------------------------------------------===//
94 //
95 // GuardWidening - An optimization over the @llvm.experimental.guard intrinsic
96 // that (optimistically) combines multiple guards into one to have fewer checks
97 // at runtime.
98 //
99 FunctionPass *createGuardWideningPass();
100 
101 
102 //===----------------------------------------------------------------------===//
103 //
104 // BitTrackingDCE - This pass uses a bit-tracking DCE algorithm in order to
105 // remove computations of dead bits.
106 //
107 FunctionPass *createBitTrackingDCEPass();
108 
109 //===----------------------------------------------------------------------===//
110 //
111 // SROA - Replace aggregates or pieces of aggregates with scalar SSA values.
112 //
113 FunctionPass *createSROAPass();
114 
115 //===----------------------------------------------------------------------===//
116 //
117 // InductiveRangeCheckElimination - Transform loops to elide range checks on
118 // linear functions of the induction variable.
119 //
121 
122 //===----------------------------------------------------------------------===//
123 //
124 // InductionVariableSimplify - Transform induction variables in a program to all
125 // use a single canonical induction variable per loop.
126 //
128 
129 //===----------------------------------------------------------------------===//
130 //
131 // InstructionCombining - Combine instructions to form fewer, simple
132 // instructions. This pass does not modify the CFG, and has a tendency to make
133 // instructions dead, so a subsequent DCE pass is useful.
134 //
135 // This pass combines things like:
136 // %Y = add int 1, %X
137 // %Z = add int 1, %Y
138 // into:
139 // %Z = add int 2, %X
140 //
141 FunctionPass *createInstructionCombiningPass(bool ExpensiveCombines = true);
142 
143 //===----------------------------------------------------------------------===//
144 //
145 // LICM - This pass is a loop invariant code motion and memory promotion pass.
146 //
148 
149 //===----------------------------------------------------------------------===//
150 //
151 // LoopSink - This pass sinks invariants from preheader to loop body where
152 // frequency is lower than loop preheader.
153 //
155 
156 //===----------------------------------------------------------------------===//
157 //
158 // LoopPredication - This pass does loop predication on guards.
159 //
161 
162 //===----------------------------------------------------------------------===//
163 //
164 // LoopInterchange - This pass interchanges loops to provide a more
165 // cache-friendly memory access patterns.
166 //
168 
169 //===----------------------------------------------------------------------===//
170 //
171 // LoopStrengthReduce - This pass is strength reduces GEP instructions that use
172 // a loop's canonical induction variable as one of their indices.
173 //
175 
176 //===----------------------------------------------------------------------===//
177 //
178 // LoopUnswitch - This pass is a simple loop unswitching pass.
179 //
180 Pass *createLoopUnswitchPass(bool OptimizeForSize = false,
181  bool hasBranchDivergence = false);
182 
183 //===----------------------------------------------------------------------===//
184 //
185 // LoopInstSimplify - This pass simplifies instructions in a loop's body.
186 //
188 
189 //===----------------------------------------------------------------------===//
190 //
191 // LoopUnroll - This pass is a simple loop unrolling pass.
192 //
193 Pass *createLoopUnrollPass(int OptLevel = 2, int Threshold = -1, int Count = -1,
194  int AllowPartial = -1, int Runtime = -1,
195  int UpperBound = -1, int AllowPeeling = -1);
196 // Create an unrolling pass for full unrolling that uses exact trip count only.
197 Pass *createSimpleLoopUnrollPass(int OptLevel = 2);
198 
199 //===----------------------------------------------------------------------===//
200 //
201 // LoopReroll - This pass is a simple loop rerolling pass.
202 //
204 
205 //===----------------------------------------------------------------------===//
206 //
207 // LoopRotate - This pass is a simple loop rotating pass.
208 //
209 Pass *createLoopRotatePass(int MaxHeaderSize = -1);
210 
211 //===----------------------------------------------------------------------===//
212 //
213 // LoopIdiom - This pass recognizes and replaces idioms in loops.
214 //
216 
217 //===----------------------------------------------------------------------===//
218 //
219 // LoopVersioningLICM - This pass is a loop versioning pass for LICM.
220 //
222 
223 //===----------------------------------------------------------------------===//
224 //
225 // PromoteMemoryToRegister - This pass is used to promote memory references to
226 // be register references. A simple example of the transformation performed by
227 // this pass is:
228 //
229 // FROM CODE TO CODE
230 // %X = alloca i32, i32 1 ret i32 42
231 // store i32 42, i32 *%X
232 // %Y = load i32* %X
233 // ret i32 %Y
234 //
235 FunctionPass *createPromoteMemoryToRegisterPass();
236 
237 //===----------------------------------------------------------------------===//
238 //
239 // DemoteRegisterToMemoryPass - This pass is used to demote registers to memory
240 // references. In basically undoes the PromoteMemoryToRegister pass to make cfg
241 // hacking easier.
242 //
243 FunctionPass *createDemoteRegisterToMemoryPass();
244 extern char &DemoteRegisterToMemoryID;
245 
246 //===----------------------------------------------------------------------===//
247 //
248 // Reassociate - This pass reassociates commutative expressions in an order that
249 // is designed to promote better constant propagation, GCSE, LICM, PRE...
250 //
251 // For example: 4 + (x + 5) -> x + (4 + 5)
252 //
253 FunctionPass *createReassociatePass();
254 
255 //===----------------------------------------------------------------------===//
256 //
257 // JumpThreading - Thread control through mult-pred/multi-succ blocks where some
258 // preds always go to some succ. Thresholds other than minus one override the
259 // internal BB duplication default threshold.
260 //
261 FunctionPass *createJumpThreadingPass(int Threshold = -1);
262 
263 //===----------------------------------------------------------------------===//
264 //
265 // CFGSimplification - Merge basic blocks, eliminate unreachable blocks,
266 // simplify terminator instructions, convert switches to lookup tables, etc.
267 //
268 FunctionPass *createCFGSimplificationPass(
269  unsigned Threshold = 1, bool ForwardSwitchCond = false,
270  bool ConvertSwitch = false, bool KeepLoops = true,
271  std::function<bool(const Function &)> Ftor = nullptr);
272 
273 //===----------------------------------------------------------------------===//
274 //
275 // FlattenCFG - flatten CFG, reduce number of conditional branches by using
276 // parallel-and and parallel-or mode, etc...
277 //
278 FunctionPass *createFlattenCFGPass();
279 
280 //===----------------------------------------------------------------------===//
281 //
282 // CFG Structurization - Remove irreducible control flow
283 //
284 ///
285 /// When \p SkipUniformRegions is true the structizer will not structurize
286 /// regions that only contain uniform branches.
287 Pass *createStructurizeCFGPass(bool SkipUniformRegions = false);
288 
289 //===----------------------------------------------------------------------===//
290 //
291 // BreakCriticalEdges - Break all of the critical edges in the CFG by inserting
292 // a dummy basic block. This pass may be "required" by passes that cannot deal
293 // with critical edges. For this usage, a pass must call:
294 //
295 // AU.addRequiredID(BreakCriticalEdgesID);
296 //
297 // This pass obviously invalidates the CFG, but can update forward dominator
298 // (set, immediate dominators, tree, and frontier) information.
299 //
300 FunctionPass *createBreakCriticalEdgesPass();
301 extern char &BreakCriticalEdgesID;
302 
303 //===----------------------------------------------------------------------===//
304 //
305 // LoopSimplify - Insert Pre-header blocks into the CFG for every function in
306 // the module. This pass updates dominator information, loop information, and
307 // does not add critical edges to the CFG.
308 //
309 // AU.addRequiredID(LoopSimplifyID);
310 //
312 extern char &LoopSimplifyID;
313 
314 //===----------------------------------------------------------------------===//
315 //
316 // TailCallElimination - This pass eliminates call instructions to the current
317 // function which occur immediately before return instructions.
318 //
319 FunctionPass *createTailCallEliminationPass();
320 
321 //===----------------------------------------------------------------------===//
322 //
323 // LowerSwitch - This pass converts SwitchInst instructions into a sequence of
324 // chained binary branch instructions.
325 //
326 FunctionPass *createLowerSwitchPass();
327 extern char &LowerSwitchID;
328 
329 //===----------------------------------------------------------------------===//
330 //
331 // LowerInvoke - This pass removes invoke instructions, converting them to call
332 // instructions.
333 //
334 FunctionPass *createLowerInvokePass();
335 extern char &LowerInvokePassID;
336 
337 //===----------------------------------------------------------------------===//
338 //
339 // LCSSA - This pass inserts phi nodes at loop boundaries to simplify other loop
340 // optimizations.
341 //
343 extern char &LCSSAID;
344 
345 //===----------------------------------------------------------------------===//
346 //
347 // EarlyCSE - This pass performs a simple and fast CSE pass over the dominator
348 // tree.
349 //
350 FunctionPass *createEarlyCSEPass(bool UseMemorySSA = false);
351 
352 //===----------------------------------------------------------------------===//
353 //
354 // GVNHoist - This pass performs a simple and fast GVN pass over the dominator
355 // tree to hoist common expressions from sibling branches.
356 //
357 FunctionPass *createGVNHoistPass();
358 
359 //===----------------------------------------------------------------------===//
360 //
361 // GVNSink - This pass uses an "inverted" value numbering to decide the
362 // similarity of expressions and sinks similar expressions into successors.
363 //
364 FunctionPass *createGVNSinkPass();
365 
366 //===----------------------------------------------------------------------===//
367 //
368 // MergedLoadStoreMotion - This pass merges loads and stores in diamonds. Loads
369 // are hoisted into the header, while stores sink into the footer.
370 //
371 FunctionPass *createMergedLoadStoreMotionPass();
372 
373 //===----------------------------------------------------------------------===//
374 //
375 // GVN - This pass performs global value numbering and redundant load
376 // elimination cotemporaneously.
377 //
378 FunctionPass *createNewGVNPass();
379 
380 //===----------------------------------------------------------------------===//
381 //
382 // DivRemPairs - Hoist/decompose integer division and remainder instructions.
383 //
384 FunctionPass *createDivRemPairsPass();
385 
386 //===----------------------------------------------------------------------===//
387 //
388 // MemCpyOpt - This pass performs optimizations related to eliminating memcpy
389 // calls and/or combining multiple stores into memset's.
390 //
391 FunctionPass *createMemCpyOptPass();
392 
393 //===----------------------------------------------------------------------===//
394 //
395 // LoopDeletion - This pass performs DCE of non-infinite loops that it
396 // can prove are dead.
397 //
399 
400 //===----------------------------------------------------------------------===//
401 //
402 // ConstantHoisting - This pass prepares a function for expensive constants.
403 //
404 FunctionPass *createConstantHoistingPass();
405 
406 //===----------------------------------------------------------------------===//
407 //
408 // InstructionNamer - Give any unnamed non-void instructions "tmp" names.
409 //
410 FunctionPass *createInstructionNamerPass();
411 extern char &InstructionNamerID;
412 
413 //===----------------------------------------------------------------------===//
414 //
415 // Sink - Code Sinking
416 //
417 FunctionPass *createSinkingPass();
418 
419 //===----------------------------------------------------------------------===//
420 //
421 // LowerAtomic - Lower atomic intrinsics to non-atomic form
422 //
424 
425 //===----------------------------------------------------------------------===//
426 //
427 // LowerGuardIntrinsic - Lower guard intrinsics to normal control flow.
428 //
430 
431 //===----------------------------------------------------------------------===//
432 //
433 // MergeICmps - Merge integer comparison chains into a memcmp
434 //
436 
437 //===----------------------------------------------------------------------===//
438 //
439 // ValuePropagation - Propagate CFG-derived value information
440 //
442 
443 //===----------------------------------------------------------------------===//
444 //
445 // InferAddressSpaces - Modify users of addrspacecast instructions with values
446 // in the source address space if using the destination address space is slower
447 // on the target.
448 //
449 FunctionPass *createInferAddressSpacesPass();
450 extern char &InferAddressSpacesID;
451 
452 //===----------------------------------------------------------------------===//
453 //
454 // InstructionSimplifier - Remove redundant instructions.
455 //
456 FunctionPass *createInstructionSimplifierPass();
457 extern char &InstructionSimplifierID;
458 
459 //===----------------------------------------------------------------------===//
460 //
461 // LowerExpectIntrinsics - Removes llvm.expect intrinsics and creates
462 // "block_weights" metadata.
463 FunctionPass *createLowerExpectIntrinsicPass();
464 
465 //===----------------------------------------------------------------------===//
466 //
467 // PartiallyInlineLibCalls - Tries to inline the fast path of library
468 // calls such as sqrt.
469 //
470 FunctionPass *createPartiallyInlineLibCallsPass();
471 
472 //===----------------------------------------------------------------------===//
473 //
474 // ScalarizerPass - Converts vector operations into scalar operations
475 //
476 FunctionPass *createScalarizerPass();
477 
478 //===----------------------------------------------------------------------===//
479 //
480 // AddDiscriminators - Add DWARF path discriminators to the IR.
481 FunctionPass *createAddDiscriminatorsPass();
482 
483 //===----------------------------------------------------------------------===//
484 //
485 // SeparateConstOffsetFromGEP - Split GEPs for better CSE
486 //
487 FunctionPass *
488 createSeparateConstOffsetFromGEPPass(const TargetMachine *TM = nullptr,
489  bool LowerGEP = false);
490 
491 //===----------------------------------------------------------------------===//
492 //
493 // SpeculativeExecution - Aggressively hoist instructions to enable
494 // speculative execution on targets where branches are expensive.
495 //
496 FunctionPass *createSpeculativeExecutionPass();
497 
498 // Same as createSpeculativeExecutionPass, but does nothing unless
499 // TargetTransformInfo::hasBranchDivergence() is true.
501 
502 //===----------------------------------------------------------------------===//
503 //
504 // StraightLineStrengthReduce - This pass strength-reduces some certain
505 // instruction patterns in straight-line code.
506 //
508 
509 //===----------------------------------------------------------------------===//
510 //
511 // PlaceSafepoints - Rewrite any IR calls to gc.statepoints and insert any
512 // safepoint polls (method entry, backedge) that might be required. This pass
513 // does not generate explicit relocation sequences - that's handled by
514 // RewriteStatepointsForGC which can be run at an arbitrary point in the pass
515 // order following this pass.
516 //
517 FunctionPass *createPlaceSafepointsPass();
518 
519 //===----------------------------------------------------------------------===//
520 //
521 // RewriteStatepointsForGC - Rewrite any gc.statepoints which do not yet have
522 // explicit relocations to include explicit relocations.
523 //
525 
526 //===----------------------------------------------------------------------===//
527 //
528 // StripGCRelocates - Remove GC relocates that have been inserted by
529 // RewriteStatepointsForGC. The resulting IR is incorrect, but this is useful
530 // for manual inspection.
531 FunctionPass *createStripGCRelocatesPass();
532 
533 //===----------------------------------------------------------------------===//
534 //
535 // Float2Int - Demote floats to ints where possible.
536 //
537 FunctionPass *createFloat2IntPass();
538 
539 //===----------------------------------------------------------------------===//
540 //
541 // NaryReassociate - Simplify n-ary operations by reassociation.
542 //
543 FunctionPass *createNaryReassociatePass();
544 
545 //===----------------------------------------------------------------------===//
546 //
547 // LoopDistribute - Distribute loops.
548 //
549 FunctionPass *createLoopDistributePass();
550 
551 //===----------------------------------------------------------------------===//
552 //
553 // LoopLoadElimination - Perform loop-aware load elimination.
554 //
555 FunctionPass *createLoopLoadEliminationPass();
556 
557 //===----------------------------------------------------------------------===//
558 //
559 // LoopSimplifyCFG - This pass performs basic CFG simplification on loops,
560 // primarily to help other loop passes.
561 //
563 
564 //===----------------------------------------------------------------------===//
565 //
566 // LoopVersioning - Perform loop multi-versioning.
567 //
568 FunctionPass *createLoopVersioningPass();
569 
570 //===----------------------------------------------------------------------===//
571 //
572 // LoopDataPrefetch - Perform data prefetching in loops.
573 //
574 FunctionPass *createLoopDataPrefetchPass();
575 
576 ///===---------------------------------------------------------------------===//
577 ModulePass *createNameAnonGlobalPass();
578 
579 //===----------------------------------------------------------------------===//
580 //
581 // LibCallsShrinkWrap - Shrink-wraps a call to function if the result is not
582 // used.
583 //
584 FunctionPass *createLibCallsShrinkWrapPass();
585 
586 //===----------------------------------------------------------------------===//
587 //
588 // EntryExitInstrumenter pass - Instrument function entry/exit with calls to
589 // mcount(), @__cyg_profile_func_{enter,exit} and the like. There are two
590 // variants, intended to run pre- and post-inlining, respectively.
591 //
592 FunctionPass *createEntryExitInstrumenterPass();
594 
595 } // End llvm namespace
596 
597 #endif
FunctionPass * createSpeculativeExecutionPass()
FunctionPass * createStraightLineStrengthReducePass()
ModulePass * createNameAnonGlobalPass()
===------------------------------------------------------------------—===//
Pass * createLoopRerollPass()
Pass * createLoopSimplifyPass()
Pass * createLoopStrengthReducePass()
Compute iterated dominance frontiers using a linear time algorithm.
Definition: AllocatorList.h:24
FunctionPass * createLowerSwitchPass()
FunctionPass * createCFGSimplificationPass(unsigned Threshold=1, bool ForwardSwitchCond=false, bool ConvertSwitch=false, bool KeepLoops=true, std::function< bool(const Function &)> Ftor=nullptr)
Pass * createDeadInstEliminationPass()
Pass * createLoopUnrollPass(int OptLevel=2, int Threshold=-1, int Count=-1, int AllowPartial=-1, int Runtime=-1, int UpperBound=-1, int AllowPeeling=-1)
char & DemoteRegisterToMemoryID
Definition: Reg2Mem.cpp:125
char & LowerInvokePassID
Definition: LowerInvoke.cpp:81
FunctionPass * createFloat2IntPass()
Definition: Float2Int.cpp:514
Pass * createLCSSAPass()
Definition: LCSSA.cpp:412
FunctionPass * createGVNHoistPass()
Definition: GVNHoist.cpp:1207
FunctionPass * createDemoteRegisterToMemoryPass()
Definition: Reg2Mem.cpp:126
FunctionPass * createAlignmentFromAssumptionsPass()
FunctionPass * createJumpThreadingPass(int Threshold=-1)
FunctionPass * createLoopDataPrefetchPass()
FunctionPass * createLowerInvokePass()
Definition: LowerInvoke.cpp:84
FunctionPass * createConstantPropagationPass()
FunctionPass * createReassociatePass()
Pass * createSimpleLoopUnrollPass(int OptLevel=2)
FunctionPass * createSinkingPass()
Definition: Sink.cpp:306
Pass * createMergeICmpsPass()
Definition: MergeICmps.cpp:652
FunctionPass * createSCCPPass()
Definition: SCCP.cpp:1798
FunctionPass * createStripGCRelocatesPass()
char & InstructionSimplifierID
FunctionPass * createPartiallyInlineLibCallsPass()
FunctionPass * createDeadCodeEliminationPass()
Definition: DCE.cpp:161
Pass * createLoopInstSimplifyPass()
FunctionPass * createInstructionCombiningPass(bool ExpensiveCombines=true)
Pass * createCorrelatedValuePropagationPass()
FunctionPass * createSeparateConstOffsetFromGEPPass(const TargetMachine *TM=nullptr, bool LowerGEP=false)
FunctionPass * createPlaceSafepointsPass()
FunctionPass * createFlattenCFGPass()
FunctionPass * createTailCallEliminationPass()
char & BreakCriticalEdgesID
FunctionPass * createPromoteMemoryToRegisterPass()
Definition: Mem2Reg.cpp:114
FunctionPass * createBreakCriticalEdgesPass()
char & LCSSAID
Definition: LCSSA.cpp:413
Pass * createLICMPass()
Definition: LICM.cpp:231
FunctionPass * createDivRemPairsPass()
FunctionPass * createDeadStoreEliminationPass()
Pass * createLoopPredicationPass()
FunctionPass * createMemCpyOptPass()
The public interface to this file...
FunctionPass * createBitTrackingDCEPass()
Definition: BDCE.cpp:173
Pass * createLoopSinkPass()
char & LowerSwitchID
Pass * createLoopVersioningLICMPass()
Pass * createLowerGuardIntrinsicPass()
char & LoopSimplifyID
print lazy value Lazy Value Info Printer Pass
FunctionPass * createLoopVersioningPass()
Pass * createLoopInterchangePass()
FunctionPass * createLoopLoadEliminationPass()
Pass * createLoopSimplifyCFGPass()
Pass * createLowerAtomicPass()
FunctionPass * createSpeculativeExecutionIfHasBranchDivergencePass()
FunctionPass * createMergedLoadStoreMotionPass()
createMergedLoadStoreMotionPass - The public interface to this file.
FunctionPass * createLibCallsShrinkWrapPass()
Pass * createLoopDeletionPass()
Pass * createLoopUnswitchPass(bool OptimizeForSize=false, bool hasBranchDivergence=false)
FunctionPass * createPostInlineEntryExitInstrumenterPass()
Pass * createLoopIdiomPass()
char & InferAddressSpacesID
FunctionPass * createInferAddressSpacesPass()
FunctionPass * createGVNSinkPass()
Definition: GVNSink.cpp:926
FunctionPass * createSROAPass()
Definition: SROA.cpp:4435
char & InstructionNamerID
FunctionPass * createInstructionNamerPass()
static int const Threshold
TODO: Write a new FunctionPass AliasAnalysis so that it can keep a cache.
ModulePass * createRewriteStatepointsForGCPass()
FunctionPass * createGuardWideningPass()
FunctionPass * createEarlyCSEPass(bool UseMemorySSA=false)
Definition: EarlyCSE.cpp:1140
print Print MemDeps of function
FunctionPass * createScalarizerPass()
Definition: Scalarizer.cpp:800
FunctionPass * createNewGVNPass()
Definition: NewGVN.cpp:4232
FunctionPass * createEntryExitInstrumenterPass()
FunctionPass * createInstructionSimplifierPass()
Pass * createStructurizeCFGPass(bool SkipUniformRegions=false)
When SkipUniformRegions is true the structizer will not structurize regions that only contain uniform...
Pass * createLoopRotatePass(int MaxHeaderSize=-1)
Pass * createIndVarSimplifyPass()
FunctionPass * createAddDiscriminatorsPass()
Pass * createInductiveRangeCheckEliminationPass()
FunctionPass * createAggressiveDCEPass()
Definition: ADCE.cpp:730
FunctionPass * createLoopDistributePass()
FunctionPass * createLowerExpectIntrinsicPass()
FunctionPass * createConstantHoistingPass()
FunctionPass * createNaryReassociatePass()
FunctionPass * createCallSiteSplittingPass()