1 //===-- Scalar.h - Scalar Transformations -----------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This header file defines prototypes for accessor functions that expose passes
11 // in the Scalar transformations library.
13 //===----------------------------------------------------------------------===//
15 #ifndef LLVM_TRANSFORMS_SCALAR_H
16 #define LLVM_TRANSFORMS_SCALAR_H
22 class GetElementPtrInst;
26 //===----------------------------------------------------------------------===//
28 // RaisePointerReferences - Try to eliminate as many pointer arithmetic
29 // expressions as possible, by converting expressions to use getelementptr and
32 FunctionPass *createRaisePointerReferencesPass();
34 //===----------------------------------------------------------------------===//
36 // Constant Propagation Pass - A worklist driven constant propagation pass
38 FunctionPass *createConstantPropagationPass();
41 //===----------------------------------------------------------------------===//
43 // Sparse Conditional Constant Propagation Pass
45 FunctionPass *createSCCPPass();
48 //===----------------------------------------------------------------------===//
50 // DeadInstElimination - This pass quickly removes trivially dead instructions
51 // without modifying the CFG of the function. It is a BasicBlockPass, so it
52 // runs efficiently when queued next to other BasicBlockPass's.
54 FunctionPass *createDeadInstEliminationPass();
57 //===----------------------------------------------------------------------===//
59 // DeadCodeElimination - This pass is more powerful than DeadInstElimination,
60 // because it is worklist driven that can potentially revisit instructions when
61 // their other instructions become dead, to eliminate chains of dead
64 FunctionPass *createDeadCodeEliminationPass();
66 //===----------------------------------------------------------------------===//
68 // DeadStoreElimination - This pass deletes stores that are post-dominated by
69 // must-aliased stores and are not loaded used between the stores.
71 FunctionPass *createDeadStoreEliminationPass();
73 //===----------------------------------------------------------------------===//
75 // AggressiveDCE - This pass uses the SSA based Aggressive DCE algorithm. This
76 // algorithm assumes instructions are dead until proven otherwise, which makes
77 // it more successful are removing non-obviously dead instructions.
79 FunctionPass *createAggressiveDCEPass();
82 //===----------------------------------------------------------------------===//
84 // Scalar Replacement of Aggregates - Break up alloca's of aggregates into
85 // multiple allocas if possible.
87 FunctionPass *createScalarReplAggregatesPass();
90 //===----------------------------------------------------------------------===//
92 // GCSE - This pass is designed to be a very quick global transformation that
93 // eliminates global common subexpressions from a function. It does this by
94 // examining the SSA value graph of the function, instead of doing slow
95 // bit-vector computations.
97 FunctionPass *createGCSEPass();
100 //===----------------------------------------------------------------------===//
102 // InductionVariableSimplify - Transform induction variables in a program to all
103 // use a single canonical induction variable per loop.
105 FunctionPass *createIndVarSimplifyPass();
108 //===----------------------------------------------------------------------===//
110 // InstructionCombining - Combine instructions to form fewer, simple
111 // instructions. This pass does not modify the CFG, and has a tendency to
112 // make instructions dead, so a subsequent DCE pass is useful.
114 // This pass combines things like:
115 // %Y = add int 1, %X
116 // %Z = add int 1, %Y
118 // %Z = add int 2, %X
120 FunctionPass *createInstructionCombiningPass();
123 //===----------------------------------------------------------------------===//
125 // LICM - This pass is a loop invariant code motion and memory promotion pass.
127 FunctionPass *createLICMPass();
129 //===----------------------------------------------------------------------===//
131 // LoopStrengthReduce - This pass is strength reduces GEP instructions that use
132 // a loop's canonical induction variable as one of their indices.
134 FunctionPass *createLoopStrengthReducePass();
136 //===----------------------------------------------------------------------===//
138 // LoopUnswitch - This pass is a simple loop unswitching pass.
140 FunctionPass *createLoopUnswitchPass();
143 //===----------------------------------------------------------------------===//
145 // LoopUnroll - This pass is a simple loop unrolling pass.
147 FunctionPass *createLoopUnrollPass();
149 //===----------------------------------------------------------------------===//
151 // This pass is used to promote memory references to be register references. A
152 // simple example of the transformation performed by this pass is:
155 // %X = alloca int, uint 1 ret int 42
156 // store int 42, int *%X
160 FunctionPass *createPromoteMemoryToRegister();
163 //===----------------------------------------------------------------------===//
165 // This pass reassociates commutative expressions in an order that is designed
166 // to promote better constant propagation, GCSE, LICM, PRE...
168 // For example: 4 + (x + 5) -> x + (4 + 5)
170 FunctionPass *createReassociatePass();
172 //===----------------------------------------------------------------------===//
174 // This pass eliminates correlated conditions, such as these:
176 // if (X > 2) ; // Known false
180 FunctionPass *createCorrelatedExpressionEliminationPass();
182 //===----------------------------------------------------------------------===//
184 // TailDuplication - Eliminate unconditional branches through controlled code
185 // duplication, creating simpler CFG structures.
187 FunctionPass *createTailDuplicationPass();
190 //===----------------------------------------------------------------------===//
192 // CFG Simplification - Merge basic blocks, eliminate unreachable blocks,
193 // simplify terminator instructions, etc...
195 FunctionPass *createCFGSimplificationPass();
198 //===----------------------------------------------------------------------===//
200 // BreakCriticalEdges pass - Break all of the critical edges in the CFG by
201 // inserting a dummy basic block. This pass may be "required" by passes that
202 // cannot deal with critical edges. For this usage, a pass must call:
204 // AU.addRequiredID(BreakCriticalEdgesID);
206 // This pass obviously invalidates the CFG, but can update forward dominator
207 // (set, immediate dominators, tree, and frontier) information.
209 FunctionPass *createBreakCriticalEdgesPass();
210 extern const PassInfo *BreakCriticalEdgesID;
212 //===----------------------------------------------------------------------===//
214 // LoopSimplify pass - Insert Pre-header blocks into the CFG for every function
215 // in the module. This pass updates dominator information, loop information,
216 // and does not add critical edges to the CFG.
218 // AU.addRequiredID(LoopSimplifyID);
220 FunctionPass *createLoopSimplifyPass();
221 extern const PassInfo *LoopSimplifyID;
223 //===----------------------------------------------------------------------===//
225 // This pass eliminates call instructions to the current function which occur
226 // immediately before return instructions.
228 FunctionPass *createTailCallEliminationPass();
231 //===----------------------------------------------------------------------===//
232 // This pass convert malloc and free instructions to %malloc & %free function
235 FunctionPass *createLowerAllocationsPass();
237 //===----------------------------------------------------------------------===//
238 // This pass converts SwitchInst instructions into a sequence of chained binary
239 // branch instructions.
241 FunctionPass *createLowerSwitchPass();
243 //===----------------------------------------------------------------------===//
244 // This pass converts SelectInst instructions into conditional branch and PHI
245 // instructions. If the OnlyFP flag is set to true, then only floating point
246 // select instructions are lowered.
248 FunctionPass *createLowerSelectPass(bool OnlyFP = false);
250 //===----------------------------------------------------------------------===//
251 // This pass converts PackedType operations into low-level scalar operations.
253 FunctionPass *createLowerPackedPass();
255 //===----------------------------------------------------------------------===//
256 // This pass converts invoke and unwind instructions to use sjlj exception
257 // handling mechanisms. Note that after this pass runs the CFG is not entirely
258 // accurate (exceptional control flow edges are not correct anymore) so only
259 // very simple things should be done after the lowerinvoke pass has run (like
260 // generation of native code). This should *NOT* be used as a general purpose
261 // "my LLVM-to-LLVM pass doesn't support the invoke instruction yet" lowering
264 FunctionPass *createLowerInvokePass();
265 extern const PassInfo *LowerInvokePassID;
268 //===----------------------------------------------------------------------===//
269 /// createLowerGCPass - This function returns an instance of the "lowergc"
270 /// pass, which lowers garbage collection intrinsics to normal LLVM code.
272 FunctionPass *createLowerGCPass();
274 //===----------------------------------------------------------------------===//
275 // Returns a pass which converts all instances of ConstantExpression
276 // into regular LLVM instructions.
277 FunctionPass* createLowerConstantExpressionsPass();
279 } // End llvm namespace