This document serves as a high level summary of the optimization features that LLVM provides. Optimizations are implemented as Passes that traverse some portion of a program to either collect information or transform the program. The table below divides the passes that LLVM provides into three categories. Analysis passes compute information that other passes can use or for debugging or program visualization purposes. Transform passes can use (or invalidate) the analysis passes. Transform passes all mutate the program in some way. Utility passes provides some utility but don't otherwise fit categorization. For example passes to extract functions to bitcode or write a module to bitcode are neither analysis nor transform passes.
The table below provides a quick summary of each pass and links to the more complete pass description later in the document.
ANALYSIS PASSES | |
---|---|
Option | Name |
-aa-eval | Exhaustive Alias Analysis Precision Evaluator |
-anders-aa | Andersen's Interprocedural Alias Analysis |
-basicaa | Basic Alias Analysis (default AA impl) |
-basiccg | Basic CallGraph Construction |
-basicvn | Basic Value Numbering (default GVN impl) |
-callgraph | Print a call graph |
-callscc | Print SCCs of the Call Graph |
-cfgscc | Print SCCs of each function CFG |
-codegenprepare | Optimize for code generation |
-count-aa | Count Alias Analysis Query Responses |
-debug-aa | AA use debugger |
-domfrontier | Dominance Frontier Construction |
-domtree | Dominator Tree Construction |
-externalfnconstants | Print external fn callsites passed constants |
-globalsmodref-aa | Simple mod/ref analysis for globals |
-instcount | Counts the various types of Instructions |
-intervals | Interval Partition Construction |
-load-vn | Load Value Numbering |
-loops | Natural Loop Construction |
-memdep | Memory Dependence Analysis |
-no-aa | No Alias Analysis (always returns 'may' alias) |
-no-profile | No Profile Information |
-postdomfrontier | Post-Dominance Frontier Construction |
-postdomtree | Post-Dominator Tree Construction |
Print function to stderr | |
-print-alias-sets | Alias Set Printer |
-print-callgraph | Print Call Graph to 'dot' file |
-print-cfg | Print CFG of function to 'dot' file |
-print-cfg-only | Print CFG of function to 'dot' file (with no function bodies) |
-printm | Print module to stderr |
-printusedtypes | Find Used Types |
-profile-loader | Load profile information from llvmprof.out |
-scalar-evolution | Scalar Evolution Analysis |
-targetdata | Target Data Layout |
TRANSFORM PASSES | |
Option | Name |
-adce | Aggressive Dead Code Elimination |
-argpromotion | Promote 'by reference' arguments to scalars |
-block-placement | Profile Guided Basic Block Placement |
-break-crit-edges | Break critical edges in CFG |
-cee | Correlated Expression Elimination |
-condprop | Conditional Propagation |
-constmerge | Merge Duplicate Global Constants |
-constprop | Simple constant propagation |
-dce | Dead Code Elimination |
-deadargelim | Dead Argument Elimination |
-deadtypeelim | Dead Type Elimination |
-die | Dead Instruction Elimination |
-dse | Dead Store Elimination |
-gcse | Global Common Subexpression Elimination |
-globaldce | Dead Global Elimination |
-globalopt | Global Variable Optimizer |
-gvn | Global Value Numbering |
-gvnpre | Global Value Numbering/Partial Redundancy Elimination |
-indmemrem | Indirect Malloc and Free Removal |
-indvars | Canonicalize Induction Variables |
-inline | Function Integration/Inlining |
-insert-block-profiling | Insert instrumentation for block profiling |
-insert-edge-profiling | Insert instrumentation for edge profiling |
-insert-function-profiling | Insert instrumentation for function profiling |
-insert-null-profiling-rs | Measure profiling framework overhead |
-insert-rs-profiling-framework | Insert random sampling instrumentation framework |
-instcombine | Combine redundant instructions |
-internalize | Internalize Global Symbols |
-ipconstprop | Interprocedural constant propagation |
-ipsccp | Interprocedural Sparse Conditional Constant Propagation |
-lcssa | Loop-Closed SSA Form Pass |
-licm | Loop Invariant Code Motion |
-loop-extract | Extract loops into new functions |
-loop-extract-single | Extract at most one loop into a new function |
-loop-index-split | Index Split Loops |
-loop-reduce | Loop Strength Reduction |
-loop-rotate | Rotate Loops |
-loop-unroll | Unroll loops |
-loop-unswitch | Unswitch loops |
-loopsimplify | Canonicalize natural loops |
-lower-packed | lowers packed operations to operations on smaller packed datatypes |
-lowerallocs | Lower allocations from instructions to calls |
-lowergc | Lower GC intrinsics, for GCless code generators |
-lowerinvoke | Lower invoke and unwind, for unwindless code generators |
-lowerselect | Lower select instructions to branches |
-lowersetjmp | Lower Set Jump |
-lowerswitch | Lower SwitchInst's to branches |
-mem2reg | Promote Memory to Register |
-mergereturn | Unify function exit nodes |
-predsimplify | Predicate Simplifier |
-prune-eh | Remove unused exception handling info |
-raiseallocs | Raise allocations from calls to instructions |
-reassociate | Reassociate expressions |
-reg2mem | Demote all values to stack slots |
-scalarrepl | Scalar Replacement of Aggregates |
-sccp | Sparse Conditional Constant Propagation |
-simplify-libcalls | Simplify well-known library calls |
-simplifycfg | Simplify the CFG |
-strip | Strip all symbols from a module |
-tailcallelim | Tail Call Elimination |
-tailduplicate | Tail Duplication |
UTILITY PASSES | |
Option | Name |
-deadarghaX0r | Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE) |
-extract-blocks | Extract Basic Blocks From Module (for bugpoint use) |
-emitbitcode | Bitcode Writer |
-verify | Module Verifier |
-view-cfg | View CFG of function |
-view-cfg-only | View CFG of function (with no function bodies) |
This section describes the LLVM Analysis Passes.
This is a simple N^2 alias analysis accuracy evaluator. Basically, for each function in the program, it simply queries to see how the alias analysis implementation answers alias queries between each pair of pointers in the function.
This is inspired and adapted from code by: Naveen Neelakantam, Francesco Spadini, and Wojciech Stryjewski.
This is an implementation of Andersen's interprocedural alias analysis
In pointer analysis terms, this is a subset-based, flow-insensitive, field-sensitive, and context-insensitive algorithm pointer algorithm.
This algorithm is implemented as three stages:
The object identification stage identifies all of the memory objects in the program, which includes globals, heap allocated objects, and stack allocated objects.
The inclusion constraint identification stage finds all inclusion constraints
in the program by scanning the program, looking for pointer assignments and
other statements that effect the points-to graph. For a statement like
A = B
, this statement is processed to
indicate that A can point to anything that B can point
to. Constraints can handle copies, loads, and stores, and address taking.
The offline constraint graph optimization portion includes offline variable substitution algorithms intended to computer pointer and location equivalences. Pointer equivalences are those pointers that will have the same points-to sets, and location equivalences are those variables that always appear together in points-to sets.
The inclusion constraint solving phase iteratively propagates the inclusion constraints until a fixed point is reached. This is an O(n³) algorithm.
Function constraints are handled as if they were structs with X
fields. Thus, an access to argument X of function Y is
an access to node index getNode(Y) + X
.
This representation allows handling of indirect calls without any issues. To
wit, an indirect call Y(a,b)
is
equivalent to *(Y + 1) = a, *(Y + 2) =
b
. The return node for a function F is always
located at getNode(F) + CallReturnPos
. The arguments
start at getNode(F) + CallArgPos
.
This is the default implementation of the Alias Analysis interface that simply implements a few identities (two different globals cannot alias, etc), but otherwise does no analysis.
Yet to be written.
This is the default implementation of the ValueNumbering
interface. It walks the SSA def-use chains to trivially identify
lexically identical expressions. This does not require any ahead of time
analysis, so it is a very fast default implementation.
This pass, only available in opt
, prints
the call graph into a .dot
graph. This graph can then be processed with the
"dot" tool to convert it to postscript or some other suitable format.
This pass, only available in opt
, prints
the SCCs of the call graph to standard output in a human-readable form.
This pass, only available in opt
, prints
the SCCs of each function CFG to standard output in a human-readable form.
This pass munges the code in the input function to better prepare it for SelectionDAG-based code generation. This works around limitations in it's basic-block-at-a-time approach. It should eventually be removed.
A pass which can be used to count how many alias queries are being made and how the alias analysis implementation being used responds.
This simple pass checks alias analysis users to ensure that if they create a new value, they do not query AA without informing it of the value. It acts as a shim over any other AA pass you want.
Yes keeping track of every value in the program is expensive, but this is a debugging pass.
This pass is a simple dominator construction algorithm for finding forward dominator frontiers.
This pass is a simple dominator construction algorithm for finding forward dominators.
This pass, only available in opt
, prints out call sites to
external functions that are called with constant arguments. This can be
useful when looking for standard library functions we should constant fold
or handle in alias analyses.
This simple pass provides alias and mod/ref information for global values that do not have their address taken, and keeps track of whether functions read or write memory (are "pure"). For this simple (but very common) case, we can provide pretty accurate and useful information.
This pass collects the count of all instructions and reports them
This analysis calculates and represents the interval partition of a function, or a preexisting interval partition.
In this way, the interval partition may be used to reduce a flow graph down to its degenerate single node interval partition (unless it is irreducible).
This pass value numbers load and call instructions. To do this, it finds lexically identical load instructions, and uses alias analysis to determine which loads are guaranteed to produce the same value. To value number call instructions, it looks for calls to functions that do not write to memory which do not have intervening instructions that clobber the memory that is read from.
This pass builds off of another value numbering pass to implement value numbering for non-load and non-call instructions. It uses Alias Analysis so that it can disambiguate the load instructions. The more powerful these base analyses are, the more powerful the resultant value numbering will be.
This analysis is used to identify natural loops and determine the loop depth of various nodes of the CFG. Note that the loops identified may actually be several natural loops that share the same header node... not just a single natural loop.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
This section describes the LLVM Transform Passes.
ADCE aggressively tries to eliminate code. This pass is similar to DCE but it assumes that values are dead until proven otherwise. This is similar to SCCP, except applied to the liveness of values.
Yet to be written.
This pass implements a very simple profile guided basic block placement algorithm. The idea is to put frequently executed blocks together at the start of the function, and hopefully increase the number of fall-through conditional branches. If there is no profile information for a particular function, this pass basically orders blocks in depth-first order.
The algorithm implemented here is basically "Algo1" from "Profile Guided Code Positioning" by Pettis and Hansen, except that it uses basic block counts instead of edge counts. This could be improved in many ways, but is very simple for now.
Basically we "place" the entry block, then loop over all successors in a DFO, placing the most frequently executed successor until we run out of blocks. Did we mention that this was extremely simplistic? This is also much slower than it could be. When it becomes important, this pass will be rewritten to use a better algorithm, and then we can worry about efficiency.
Yet to be written.
Correlated Expression Elimination propagates information from conditional branches to blocks dominated by destinations of the branch. It propagates information from the condition check itself into the body of the branch, allowing transformations like these for example:
if (i == 7) ... 4*i; // constant propagation M = i+1; N = j+1; if (i == j) X = M-N; // = M-M == 0;
This is called Correlated Expression Elimination because we eliminate or simplify expressions that are correlated with the direction of a branch. In this way we use static information to give us some information about the dynamic value of a variable.
This pass propagates information about conditional expressions through the program, allowing it to eliminate conditional branches in some cases.
Yet to be written.
This file implements constant propagation and merging. It looks for instructions involving only constant operands and replaces them with a constant value instead of an instruction. For example:
add i32 1, 2
becomes
i32 3
NOTE: this pass has a habit of making definitions be dead. It is a good idea to to run a DIE (Dead Instruction Elimination) pass sometime after running this pass.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
This pass performs global value numbering to eliminate fully redundant instructions. It also performs simple dead load elimination.
This pass performs a hybrid of global value numbering and partial redundancy elimination, known as GVN-PRE. It performs partial redundancy elimination on values, rather than lexical expressions, allowing a more comprehensive view the optimization. It replaces redundant values with uses of earlier occurences of the same value. While this is beneficial in that it eliminates unneeded computation, it also increases register pressure by creating large live ranges, and should be used with caution on platforms that are very sensitive to register pressure.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
This section describes the LLVM Utility Passes.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.
Yet to be written.