LLVM  7.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 // AggressiveInstCombiner - Combine expression patterns to form expressions with
146 // fewer, simple instructions. This pass does not modify the CFG.
147 //
148 FunctionPass *createAggressiveInstCombinerPass();
149 
150 //===----------------------------------------------------------------------===//
151 //
152 // LICM - This pass is a loop invariant code motion and memory promotion pass.
153 //
155 
156 //===----------------------------------------------------------------------===//
157 //
158 // LoopSink - This pass sinks invariants from preheader to loop body where
159 // frequency is lower than loop preheader.
160 //
162 
163 //===----------------------------------------------------------------------===//
164 //
165 // LoopPredication - This pass does loop predication on guards.
166 //
168 
169 //===----------------------------------------------------------------------===//
170 //
171 // LoopInterchange - This pass interchanges loops to provide a more
172 // cache-friendly memory access patterns.
173 //
175 
176 //===----------------------------------------------------------------------===//
177 //
178 // LoopStrengthReduce - This pass is strength reduces GEP instructions that use
179 // a loop's canonical induction variable as one of their indices.
180 //
182 
183 //===----------------------------------------------------------------------===//
184 //
185 // LoopUnswitch - This pass is a simple loop unswitching pass.
186 //
187 Pass *createLoopUnswitchPass(bool OptimizeForSize = false,
188  bool hasBranchDivergence = false);
189 
190 //===----------------------------------------------------------------------===//
191 //
192 // LoopInstSimplify - This pass simplifies instructions in a loop's body.
193 //
195 
196 //===----------------------------------------------------------------------===//
197 //
198 // LoopUnroll - This pass is a simple loop unrolling pass.
199 //
200 Pass *createLoopUnrollPass(int OptLevel = 2, int Threshold = -1, int Count = -1,
201  int AllowPartial = -1, int Runtime = -1,
202  int UpperBound = -1, int AllowPeeling = -1);
203 // Create an unrolling pass for full unrolling that uses exact trip count only.
204 Pass *createSimpleLoopUnrollPass(int OptLevel = 2);
205 
206 //===----------------------------------------------------------------------===//
207 //
208 // LoopReroll - This pass is a simple loop rerolling pass.
209 //
211 
212 //===----------------------------------------------------------------------===//
213 //
214 // LoopRotate - This pass is a simple loop rotating pass.
215 //
216 Pass *createLoopRotatePass(int MaxHeaderSize = -1);
217 
218 //===----------------------------------------------------------------------===//
219 //
220 // LoopIdiom - This pass recognizes and replaces idioms in loops.
221 //
223 
224 //===----------------------------------------------------------------------===//
225 //
226 // LoopVersioningLICM - This pass is a loop versioning pass for LICM.
227 //
229 
230 //===----------------------------------------------------------------------===//
231 //
232 // PromoteMemoryToRegister - This pass is used to promote memory references to
233 // be register references. A simple example of the transformation performed by
234 // this pass is:
235 //
236 // FROM CODE TO CODE
237 // %X = alloca i32, i32 1 ret i32 42
238 // store i32 42, i32 *%X
239 // %Y = load i32* %X
240 // ret i32 %Y
241 //
242 FunctionPass *createPromoteMemoryToRegisterPass();
243 
244 //===----------------------------------------------------------------------===//
245 //
246 // DemoteRegisterToMemoryPass - This pass is used to demote registers to memory
247 // references. In basically undoes the PromoteMemoryToRegister pass to make cfg
248 // hacking easier.
249 //
250 FunctionPass *createDemoteRegisterToMemoryPass();
251 extern char &DemoteRegisterToMemoryID;
252 
253 //===----------------------------------------------------------------------===//
254 //
255 // Reassociate - This pass reassociates commutative expressions in an order that
256 // is designed to promote better constant propagation, GCSE, LICM, PRE...
257 //
258 // For example: 4 + (x + 5) -> x + (4 + 5)
259 //
260 FunctionPass *createReassociatePass();
261 
262 //===----------------------------------------------------------------------===//
263 //
264 // JumpThreading - Thread control through mult-pred/multi-succ blocks where some
265 // preds always go to some succ. Thresholds other than minus one override the
266 // internal BB duplication default threshold.
267 //
268 FunctionPass *createJumpThreadingPass(int Threshold = -1);
269 
270 //===----------------------------------------------------------------------===//
271 //
272 // CFGSimplification - Merge basic blocks, eliminate unreachable blocks,
273 // simplify terminator instructions, convert switches to lookup tables, etc.
274 //
275 FunctionPass *createCFGSimplificationPass(
276  unsigned Threshold = 1, bool ForwardSwitchCond = false,
277  bool ConvertSwitch = false, bool KeepLoops = true, bool SinkCommon = false,
278  std::function<bool(const Function &)> Ftor = nullptr);
279 
280 //===----------------------------------------------------------------------===//
281 //
282 // FlattenCFG - flatten CFG, reduce number of conditional branches by using
283 // parallel-and and parallel-or mode, etc...
284 //
285 FunctionPass *createFlattenCFGPass();
286 
287 //===----------------------------------------------------------------------===//
288 //
289 // CFG Structurization - Remove irreducible control flow
290 //
291 ///
292 /// When \p SkipUniformRegions is true the structizer will not structurize
293 /// regions that only contain uniform branches.
294 Pass *createStructurizeCFGPass(bool SkipUniformRegions = false);
295 
296 //===----------------------------------------------------------------------===//
297 //
298 // BreakCriticalEdges - Break all of the critical edges in the CFG by inserting
299 // a dummy basic block. This pass may be "required" by passes that cannot deal
300 // with critical edges. For this usage, a pass must call:
301 //
302 // AU.addRequiredID(BreakCriticalEdgesID);
303 //
304 // This pass obviously invalidates the CFG, but can update forward dominator
305 // (set, immediate dominators, tree, and frontier) information.
306 //
307 FunctionPass *createBreakCriticalEdgesPass();
308 extern char &BreakCriticalEdgesID;
309 
310 //===----------------------------------------------------------------------===//
311 //
312 // LoopSimplify - Insert Pre-header blocks into the CFG for every function in
313 // the module. This pass updates dominator information, loop information, and
314 // does not add critical edges to the CFG.
315 //
316 // AU.addRequiredID(LoopSimplifyID);
317 //
319 extern char &LoopSimplifyID;
320 
321 //===----------------------------------------------------------------------===//
322 //
323 // TailCallElimination - This pass eliminates call instructions to the current
324 // function which occur immediately before return instructions.
325 //
326 FunctionPass *createTailCallEliminationPass();
327 
328 //===----------------------------------------------------------------------===//
329 //
330 // LowerSwitch - This pass converts SwitchInst instructions into a sequence of
331 // chained binary branch instructions.
332 //
333 FunctionPass *createLowerSwitchPass();
334 extern char &LowerSwitchID;
335 
336 //===----------------------------------------------------------------------===//
337 //
338 // LowerInvoke - This pass removes invoke instructions, converting them to call
339 // instructions.
340 //
341 FunctionPass *createLowerInvokePass();
342 extern char &LowerInvokePassID;
343 
344 //===----------------------------------------------------------------------===//
345 //
346 // LCSSA - This pass inserts phi nodes at loop boundaries to simplify other loop
347 // optimizations.
348 //
350 extern char &LCSSAID;
351 
352 //===----------------------------------------------------------------------===//
353 //
354 // EarlyCSE - This pass performs a simple and fast CSE pass over the dominator
355 // tree.
356 //
357 FunctionPass *createEarlyCSEPass(bool UseMemorySSA = false);
358 
359 //===----------------------------------------------------------------------===//
360 //
361 // GVNHoist - This pass performs a simple and fast GVN pass over the dominator
362 // tree to hoist common expressions from sibling branches.
363 //
364 FunctionPass *createGVNHoistPass();
365 
366 //===----------------------------------------------------------------------===//
367 //
368 // GVNSink - This pass uses an "inverted" value numbering to decide the
369 // similarity of expressions and sinks similar expressions into successors.
370 //
371 FunctionPass *createGVNSinkPass();
372 
373 //===----------------------------------------------------------------------===//
374 //
375 // MergedLoadStoreMotion - This pass merges loads and stores in diamonds. Loads
376 // are hoisted into the header, while stores sink into the footer.
377 //
378 FunctionPass *createMergedLoadStoreMotionPass();
379 
380 //===----------------------------------------------------------------------===//
381 //
382 // GVN - This pass performs global value numbering and redundant load
383 // elimination cotemporaneously.
384 //
385 FunctionPass *createNewGVNPass();
386 
387 //===----------------------------------------------------------------------===//
388 //
389 // DivRemPairs - Hoist/decompose integer division and remainder instructions.
390 //
391 FunctionPass *createDivRemPairsPass();
392 
393 //===----------------------------------------------------------------------===//
394 //
395 // MemCpyOpt - This pass performs optimizations related to eliminating memcpy
396 // calls and/or combining multiple stores into memset's.
397 //
398 FunctionPass *createMemCpyOptPass();
399 
400 //===----------------------------------------------------------------------===//
401 //
402 // LoopDeletion - This pass performs DCE of non-infinite loops that it
403 // can prove are dead.
404 //
406 
407 //===----------------------------------------------------------------------===//
408 //
409 // ConstantHoisting - This pass prepares a function for expensive constants.
410 //
411 FunctionPass *createConstantHoistingPass();
412 
413 //===----------------------------------------------------------------------===//
414 //
415 // InstructionNamer - Give any unnamed non-void instructions "tmp" names.
416 //
417 FunctionPass *createInstructionNamerPass();
418 extern char &InstructionNamerID;
419 
420 //===----------------------------------------------------------------------===//
421 //
422 // Sink - Code Sinking
423 //
424 FunctionPass *createSinkingPass();
425 
426 //===----------------------------------------------------------------------===//
427 //
428 // LowerAtomic - Lower atomic intrinsics to non-atomic form
429 //
431 
432 //===----------------------------------------------------------------------===//
433 //
434 // LowerGuardIntrinsic - Lower guard intrinsics to normal control flow.
435 //
437 
438 //===----------------------------------------------------------------------===//
439 //
440 // MergeICmps - Merge integer comparison chains into a memcmp
441 //
443 
444 //===----------------------------------------------------------------------===//
445 //
446 // ValuePropagation - Propagate CFG-derived value information
447 //
449 
450 //===----------------------------------------------------------------------===//
451 //
452 // InferAddressSpaces - Modify users of addrspacecast instructions with values
453 // in the source address space if using the destination address space is slower
454 // on the target.
455 //
456 FunctionPass *createInferAddressSpacesPass();
457 extern char &InferAddressSpacesID;
458 
459 //===----------------------------------------------------------------------===//
460 //
461 // InstructionSimplifier - Remove redundant instructions.
462 //
463 FunctionPass *createInstructionSimplifierPass();
464 extern char &InstructionSimplifierID;
465 
466 //===----------------------------------------------------------------------===//
467 //
468 // LowerExpectIntrinsics - Removes llvm.expect intrinsics and creates
469 // "block_weights" metadata.
470 FunctionPass *createLowerExpectIntrinsicPass();
471 
472 //===----------------------------------------------------------------------===//
473 //
474 // PartiallyInlineLibCalls - Tries to inline the fast path of library
475 // calls such as sqrt.
476 //
477 FunctionPass *createPartiallyInlineLibCallsPass();
478 
479 //===----------------------------------------------------------------------===//
480 //
481 // ScalarizerPass - Converts vector operations into scalar operations
482 //
483 FunctionPass *createScalarizerPass();
484 
485 //===----------------------------------------------------------------------===//
486 //
487 // AddDiscriminators - Add DWARF path discriminators to the IR.
488 FunctionPass *createAddDiscriminatorsPass();
489 
490 //===----------------------------------------------------------------------===//
491 //
492 // SeparateConstOffsetFromGEP - Split GEPs for better CSE
493 //
494 FunctionPass *
495 createSeparateConstOffsetFromGEPPass(const TargetMachine *TM = nullptr,
496  bool LowerGEP = false);
497 
498 //===----------------------------------------------------------------------===//
499 //
500 // SpeculativeExecution - Aggressively hoist instructions to enable
501 // speculative execution on targets where branches are expensive.
502 //
503 FunctionPass *createSpeculativeExecutionPass();
504 
505 // Same as createSpeculativeExecutionPass, but does nothing unless
506 // TargetTransformInfo::hasBranchDivergence() is true.
508 
509 //===----------------------------------------------------------------------===//
510 //
511 // StraightLineStrengthReduce - This pass strength-reduces some certain
512 // instruction patterns in straight-line code.
513 //
515 
516 //===----------------------------------------------------------------------===//
517 //
518 // PlaceSafepoints - Rewrite any IR calls to gc.statepoints and insert any
519 // safepoint polls (method entry, backedge) that might be required. This pass
520 // does not generate explicit relocation sequences - that's handled by
521 // RewriteStatepointsForGC which can be run at an arbitrary point in the pass
522 // order following this pass.
523 //
524 FunctionPass *createPlaceSafepointsPass();
525 
526 //===----------------------------------------------------------------------===//
527 //
528 // RewriteStatepointsForGC - Rewrite any gc.statepoints which do not yet have
529 // explicit relocations to include explicit relocations.
530 //
532 
533 //===----------------------------------------------------------------------===//
534 //
535 // StripGCRelocates - Remove GC relocates that have been inserted by
536 // RewriteStatepointsForGC. The resulting IR is incorrect, but this is useful
537 // for manual inspection.
538 FunctionPass *createStripGCRelocatesPass();
539 
540 //===----------------------------------------------------------------------===//
541 //
542 // Float2Int - Demote floats to ints where possible.
543 //
544 FunctionPass *createFloat2IntPass();
545 
546 //===----------------------------------------------------------------------===//
547 //
548 // NaryReassociate - Simplify n-ary operations by reassociation.
549 //
550 FunctionPass *createNaryReassociatePass();
551 
552 //===----------------------------------------------------------------------===//
553 //
554 // LoopDistribute - Distribute loops.
555 //
556 FunctionPass *createLoopDistributePass();
557 
558 //===----------------------------------------------------------------------===//
559 //
560 // LoopLoadElimination - Perform loop-aware load elimination.
561 //
562 FunctionPass *createLoopLoadEliminationPass();
563 
564 //===----------------------------------------------------------------------===//
565 //
566 // LoopSimplifyCFG - This pass performs basic CFG simplification on loops,
567 // primarily to help other loop passes.
568 //
570 
571 //===----------------------------------------------------------------------===//
572 //
573 // LoopVersioning - Perform loop multi-versioning.
574 //
575 FunctionPass *createLoopVersioningPass();
576 
577 //===----------------------------------------------------------------------===//
578 //
579 // LoopDataPrefetch - Perform data prefetching in loops.
580 //
581 FunctionPass *createLoopDataPrefetchPass();
582 
583 ///===---------------------------------------------------------------------===//
584 ModulePass *createNameAnonGlobalPass();
585 
586 //===----------------------------------------------------------------------===//
587 //
588 // LibCallsShrinkWrap - Shrink-wraps a call to function if the result is not
589 // used.
590 //
591 FunctionPass *createLibCallsShrinkWrapPass();
592 
593 //===----------------------------------------------------------------------===//
594 //
595 // EntryExitInstrumenter pass - Instrument function entry/exit with calls to
596 // mcount(), @__cyg_profile_func_{enter,exit} and the like. There are two
597 // variants, intended to run pre- and post-inlining, respectively.
598 //
599 FunctionPass *createEntryExitInstrumenterPass();
601 
602 } // End llvm namespace
603 
604 #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()
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:1208
FunctionPass * createDemoteRegisterToMemoryPass()
Definition: Reg2Mem.cpp:126
FunctionPass * createAlignmentFromAssumptionsPass()
FunctionPass * createJumpThreadingPass(int Threshold=-1)
FunctionPass * createLoopDataPrefetchPass()
FunctionPass * createCFGSimplificationPass(unsigned Threshold=1, bool ForwardSwitchCond=false, bool ConvertSwitch=false, bool KeepLoops=true, bool SinkCommon=false, std::function< bool(const Function &)> Ftor=nullptr)
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:655
FunctionPass * createAggressiveInstCombinerPass()
FunctionPass * createSCCPPass()
Definition: SCCP.cpp:1796
FunctionPass * createStripGCRelocatesPass()
char & InstructionSimplifierID
FunctionPass * createPartiallyInlineLibCallsPass()
FunctionPass * createDeadCodeEliminationPass()
Definition: DCE.cpp:164
static cl::opt< bool > SinkCommon("simplifycfg-sink-common", cl::Hidden, cl::init(true), cl::desc("Sink common instructions down to the end block"))
Pass * createLoopInstSimplifyPass()
ModulePass * createRewriteStatepointsForGCLegacyPass()
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:237
FunctionPass * createDivRemPairsPass()
FunctionPass * createDeadStoreEliminationPass()
Pass * createLoopPredicationPass()
FunctionPass * createMemCpyOptPass()
The public interface to this file...
FunctionPass * createBitTrackingDCEPass()
Definition: BDCE.cpp:172
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:922
FunctionPass * createSROAPass()
Definition: SROA.cpp:4471
char & InstructionNamerID
FunctionPass * createInstructionNamerPass()
static int const Threshold
TODO: Write a new FunctionPass AliasAnalysis so that it can keep a cache.
FunctionPass * createGuardWideningPass()
FunctionPass * createEarlyCSEPass(bool UseMemorySSA=false)
Definition: EarlyCSE.cpp:1171
print Print MemDeps of function
FunctionPass * createScalarizerPass()
Definition: Scalarizer.cpp:800
FunctionPass * createNewGVNPass()
Definition: NewGVN.cpp:4235
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()