From 332f3679d042a8c91afe9920e95fa7b5972fe408 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Tue, 7 May 2002 19:37:18 +0000 Subject: [PATCH] New header file to replace all of the Scalar/*.h files. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2533 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/Transforms/Scalar.h | 120 +++++++++++++++++++++++++++++++ 1 file changed, 120 insertions(+) create mode 100644 include/llvm/Transforms/Scalar.h diff --git a/include/llvm/Transforms/Scalar.h b/include/llvm/Transforms/Scalar.h new file mode 100644 index 00000000000..91cc81a1b2e --- /dev/null +++ b/include/llvm/Transforms/Scalar.h @@ -0,0 +1,120 @@ +//===-- Scalar.h - Scalar Transformations ------------------------*- C++ -*-==// +// +// This header file defines prototypes for accessor functions that expose passes +// in the Scalar transformations library. +// +//===----------------------------------------------------------------------===// + +#ifndef LLVM_TRANSFORMS_SCALAR_H +#define LLVM_TRANSFORMS_SCALAR_H + +class Pass; + +//===----------------------------------------------------------------------===// +// +// Constant Propogation Pass - A worklist driven constant propogation pass +// +Pass *createConstantPropogationPass(); + + +//===----------------------------------------------------------------------===// +// +// Sparse Conditional Constant Propogation Pass +// +Pass *createSCCPPass(); + + +//===----------------------------------------------------------------------===// +// +// DeadInstElimination - This pass quickly removes trivially dead instructions +// without modifying the CFG of the function. It is a BasicBlockPass, so it +// runs efficiently when queued next to other BasicBlockPass's. +// +Pass *createDeadInstEliminationPass(); + + +//===----------------------------------------------------------------------===// +// +// DeadCodeElimination - This pass is more powerful than DeadInstElimination, +// because it is worklist driven that can potentially revisit instructions when +// their other instructions become dead, to eliminate chains of dead +// computations. +// +Pass *createDeadCodeEliminationPass(); + + +//===----------------------------------------------------------------------===// +// +// AgressiveDCE - This pass uses the SSA based Agressive DCE algorithm. This +// algorithm assumes instructions are dead until proven otherwise, which makes +// it more successful are removing non-obviously dead instructions. +// +Pass *createAgressiveDCEPass(); + + +//===----------------------------------------------------------------------===// +// +// 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]). +// +Pass *createDecomposeMultiDimRefsPass(); + + +//===----------------------------------------------------------------------===// +// +// GCSE - This pass is designed to be a very quick global transformation that +// eliminates global common subexpressions from a function. It does this by +// examining the SSA value graph of the function, instead of doing slow +// bit-vector computations. +// +Pass *createGCSEPass(); + + +//===----------------------------------------------------------------------===// +// +// InductionVariableSimplify - Transform induction variables in a program to all +// use a single cannonical induction variable per loop. +// +Pass *createIndVarSimplifyPass(); + + +//===----------------------------------------------------------------------===// +// +// InstructionCombining - Combine instructions to form fewer, simple +// instructions. This pass does not modify the CFG, and has a tendancy to +// make instructions dead, so a subsequent DCE pass is useful. +// +// This pass combines things like: +// %Y = add int 1, %X +// %Z = add int 1, %Y +// into: +// %Z = add int 2, %X +// +Pass *createInstructionCombiningPass(); + + +//===----------------------------------------------------------------------===// +// +// This pass is used to promote memory references to be register references. A +// simple example of the transformation performed by this pass is: +// +// FROM CODE TO CODE +// %X = alloca int, uint 1 ret int 42 +// store int 42, int *%X +// %Y = load int* %X +// ret int %Y +// +Pass *createPromoteMemoryToRegister(); + + +//===----------------------------------------------------------------------===// +// +// These functions removes symbols from functions and modules. +// +Pass *createSymbolStrippingPass(); +Pass *createFullSymbolStrippingPass(); + +#endif