//===-- Scalar.h - Scalar Transformations -----------------------*- C++ -*-===//
-//
+//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
-//
+//
//===----------------------------------------------------------------------===//
//
// This header file defines prototypes for accessor functions that expose passes
namespace llvm {
-class Pass;
+class ModulePass;
class FunctionPass;
class GetElementPtrInst;
class PassInfo;
// expressions as possible, by converting expressions to use getelementptr and
// friends.
//
-Pass *createRaisePointerReferencesPass();
+FunctionPass *createRaisePointerReferencesPass();
//===----------------------------------------------------------------------===//
//
// Constant Propagation Pass - A worklist driven constant propagation pass
//
-Pass *createConstantPropagationPass();
+FunctionPass *createConstantPropagationPass();
//===----------------------------------------------------------------------===//
//
// Sparse Conditional Constant Propagation Pass
//
-Pass *createSCCPPass();
+FunctionPass *createSCCPPass();
//===----------------------------------------------------------------------===//
// without modifying the CFG of the function. It is a BasicBlockPass, so it
// runs efficiently when queued next to other BasicBlockPass's.
//
-Pass *createDeadInstEliminationPass();
+FunctionPass *createDeadInstEliminationPass();
//===----------------------------------------------------------------------===//
// DeadStoreElimination - This pass deletes stores that are post-dominated by
// must-aliased stores and are not loaded used between the stores.
//
-Pass *createDeadStoreEliminationPass();
+FunctionPass *createDeadStoreEliminationPass();
//===----------------------------------------------------------------------===//
//
// algorithm assumes instructions are dead until proven otherwise, which makes
// it more successful are removing non-obviously dead instructions.
//
-Pass *createAggressiveDCEPass();
+FunctionPass *createAggressiveDCEPass();
//===----------------------------------------------------------------------===//
// Scalar Replacement of Aggregates - Break up alloca's of aggregates into
// multiple allocas if possible.
//
-Pass *createScalarReplAggregatesPass();
-
-//===----------------------------------------------------------------------===//
-//
-// DecomposeMultiDimRefs - Convert multi-dimensional references consisting of
-// any combination of 2 or more array and structure indices into a sequence of
-// instructions (using getelementpr and cast) so that each instruction has at
-// most one index (except structure references, which need an extra leading
-// index of [0]).
-
-// This pass decomposes all multi-dimensional references in a function.
-FunctionPass *createDecomposeMultiDimRefsPass();
+FunctionPass *createScalarReplAggregatesPass();
-// This function decomposes a single instance of such a reference.
-// Return value: true if the instruction was replaced; false otherwise.
-//
-bool DecomposeArrayRef(GetElementPtrInst* GEP);
//===----------------------------------------------------------------------===//
//
// InductionVariableSimplify - Transform induction variables in a program to all
// use a single canonical induction variable per loop.
//
-Pass *createIndVarSimplifyPass();
+FunctionPass *createIndVarSimplifyPass();
//===----------------------------------------------------------------------===//
//
FunctionPass *createLICMPass();
+//===----------------------------------------------------------------------===//
+//
+// LoopStrengthReduce - This pass is strength reduces GEP instructions that use
+// a loop's canonical induction variable as one of their indices. The
+// MaxTargetAMSize is the largest element size that the target architecture
+// can handle in its addressing modes. Power of two multipliers less than or
+// equal to this value are not reduced.
+//
+FunctionPass *createLoopStrengthReducePass(unsigned MaxTargetAMSize = 1);
//===----------------------------------------------------------------------===//
//
//
FunctionPass *createLoopUnrollPass();
-
//===----------------------------------------------------------------------===//
//
// This pass is used to promote memory references to be register references. A
// %Y = load int* %X
// ret int %Y
//
-Pass *createPromoteMemoryToRegister();
+FunctionPass *createPromoteMemoryToRegisterPass();
//===----------------------------------------------------------------------===//
// else
// Y = X * Z; // = 0
//
-Pass *createCorrelatedExpressionEliminationPass();
+FunctionPass *createCorrelatedExpressionEliminationPass();
+
+
+// createCondPropagationPass - This pass propagates information about
+// conditional expressions through the program, allowing it to eliminate
+// conditional branches in some cases.
+//
+FunctionPass *createCondPropagationPass();
//===----------------------------------------------------------------------===//
//
// TailDuplication - Eliminate unconditional branches through controlled code
// duplication, creating simpler CFG structures.
//
-Pass *createTailDuplicationPass();
+FunctionPass *createTailDuplicationPass();
//===----------------------------------------------------------------------===//
//
// AU.addRequiredID(LoopSimplifyID);
//
-Pass *createLoopSimplifyPass();
+FunctionPass *createLoopSimplifyPass();
extern const PassInfo *LoopSimplifyID;
//===----------------------------------------------------------------------===//
-//
+//
// This pass eliminates call instructions to the current function which occur
// immediately before return instructions.
//
// This pass convert malloc and free instructions to %malloc & %free function
// calls.
//
-FunctionPass *createLowerAllocationsPass();
+FunctionPass *createLowerAllocationsPass(bool LowerMallocArgToInteger = false);
//===----------------------------------------------------------------------===//
// This pass converts SwitchInst instructions into a sequence of chained binary
//
FunctionPass *createLowerSelectPass(bool OnlyFP = false);
+//===----------------------------------------------------------------------===//
+// This pass converts PackedType operations into low-level scalar operations.
+//
+FunctionPass *createLowerPackedPass();
+
//===----------------------------------------------------------------------===//
// This pass converts invoke and unwind instructions to use sjlj exception
// handling mechanisms. Note that after this pass runs the CFG is not entirely
FunctionPass *createLowerInvokePass();
extern const PassInfo *LowerInvokePassID;
-
+
//===----------------------------------------------------------------------===//
/// createLowerGCPass - This function returns an instance of the "lowergc"
/// pass, which lowers garbage collection intrinsics to normal LLVM code.
// Returns a pass which converts all instances of ConstantExpression
// into regular LLVM instructions.
FunctionPass* createLowerConstantExpressionsPass();
-
//===----------------------------------------------------------------------===//
-//
-// These functions removes symbols from functions and modules.
-//
-Pass *createSymbolStrippingPass();
-Pass *createFullSymbolStrippingPass();
+// This pass reorders basic blocks in order to increase the number of fall-
+// through conditional branches.
+FunctionPass *createBlockPlacementPass();
+
+//===----------------------------------------------------------------------===//
+// This pass does partial redundancy elimination.
+FunctionPass *createPREPass();
} // End llvm namespace
projects / oota-llvm.git / blobdiff