mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-29 15:04:57 +00:00
New header file to replace all of the Scalar/*.h files.
llvm-svn: 2533
This commit is contained in:
parent
5cae7abf34
commit
bb3896eed3
120
include/llvm/Transforms/Scalar.h
Normal file
120
include/llvm/Transforms/Scalar.h
Normal file
@ -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
|
Loading…
Reference in New Issue
Block a user