2007-03-26 09:32:31 +00:00
|
|
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
|
|
|
|
|
"http://www.w3.org/TR/html4/strict.dtd">
|
|
|
|
|
<html>
|
|
|
|
|
<head>
|
|
|
|
|
<title>LLVM's Analysis and Transform Passes</title>
|
|
|
|
|
<link rel="stylesheet" href="llvm.css" type="text/css">
|
2007-10-25 08:58:56 +00:00
|
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
2007-03-26 09:32:31 +00:00
|
|
|
</head>
|
|
|
|
|
<body>
|
|
|
|
|
|
2007-10-25 08:46:12 +00:00
|
|
|
<!--
|
|
|
|
|
|
|
|
|
|
If Passes.html is up to date, the following "one-liner" should print
|
|
|
|
|
an empty diff.
|
|
|
|
|
|
|
|
|
|
egrep -e '^<tr><td><a href="#.*">-.*</a></td><td>.*</td></tr>$' \
|
|
|
|
|
-e '^ <a name=".*">.*</a>$' < Passes.html >html; \
|
|
|
|
|
perl >help <<'EOT' && diff -u help html; rm -f help html
|
|
|
|
|
open HTML, "<Passes.html" or die "open: Passes.html: $!\n";
|
|
|
|
|
while (<HTML>) {
|
|
|
|
|
m:^<tr><td><a href="#(.*)">-.*</a></td><td>.*</td></tr>$: or next;
|
|
|
|
|
$order{$1} = sprintf("%03d", 1 + int %order);
|
|
|
|
|
}
|
2007-10-25 08:58:56 +00:00
|
|
|
open HELP, "../Release/bin/opt -help|" or die "open: opt -help: $!\n";
|
2007-10-25 08:46:12 +00:00
|
|
|
while (<HELP>) {
|
|
|
|
|
m:^ -([^ ]+) +- (.*)$: or next;
|
|
|
|
|
my $o = $order{$1};
|
|
|
|
|
$o = "000" unless defined $o;
|
|
|
|
|
push @x, "$o<tr><td><a href=\"#$1\">-$1</a></td><td>$2</td></tr>\n";
|
|
|
|
|
push @y, "$o <a name=\"$1\">$2</a>\n";
|
|
|
|
|
}
|
|
|
|
|
@x = map { s/^\d\d\d//; $_ } sort @x;
|
|
|
|
|
@y = map { s/^\d\d\d//; $_ } sort @y;
|
|
|
|
|
print @x, @y;
|
|
|
|
|
EOT
|
|
|
|
|
|
2007-10-25 10:18:27 +00:00
|
|
|
This (real) one-liner can also be helpful when converting comments to HTML:
|
|
|
|
|
|
|
|
|
|
perl -e '$/ = undef; for (split(/\n/, <>)) { s:^ *///? ?::; print " <p>\n" if !$on && $_ =~ /\S/; print " </p>\n" if $on && $_ =~ /^\s*$/; print " $_\n"; $on = ($_ =~ /\S/); } print " </p>\n" if $on'
|
|
|
|
|
|
2007-10-25 08:46:12 +00:00
|
|
|
-->
|
|
|
|
|
|
2007-03-26 09:32:31 +00:00
|
|
|
<div class="doc_title">LLVM's Analysis and Transform Passes</div>
|
|
|
|
|
|
|
|
|
|
<ol>
|
|
|
|
|
<li><a href="#intro">Introduction</a></li>
|
|
|
|
|
<li><a href="#analyses">Analysis Passes</a>
|
|
|
|
|
<li><a href="#transforms">Transform Passes</a></li>
|
|
|
|
|
<li><a href="#utilities">Utility Passes</a></li>
|
|
|
|
|
</ol>
|
|
|
|
|
|
|
|
|
|
<div class="doc_author">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>Written by <a href="mailto:rspencer@x10sys.com">Reid Spencer</a>
|
|
|
|
|
and Gordon Henriksen</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-- ======================================================================= -->
|
|
|
|
|
<div class="doc_section"> <a name="intro">Introduction</a> </div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>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.
|
2007-10-25 08:46:12 +00:00
|
|
|
The table below divides the passes that LLVM provides into three categories.
|
2007-03-26 09:32:31 +00:00
|
|
|
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.
|
2007-10-25 08:46:12 +00:00
|
|
|
Utility passes provides some utility but don't otherwise fit categorization.
|
2007-07-06 22:07:22 +00:00
|
|
|
For example passes to extract functions to bitcode or write a module to
|
|
|
|
|
bitcode are neither analysis nor transform passes.
|
2007-03-26 09:32:31 +00:00
|
|
|
<p>The table below provides a quick summary of each pass and links to the more
|
|
|
|
|
complete pass description later in the document.</p>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text" >
|
|
|
|
|
<table>
|
2007-10-25 08:58:56 +00:00
|
|
|
<tr><th colspan="2"><b>ANALYSIS PASSES</b></th></tr>
|
|
|
|
|
<tr><th>Option</th><th>Name</th></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#aa-eval">-aa-eval</a></td><td>Exhaustive Alias Analysis Precision Evaluator</td></tr>
|
|
|
|
|
<tr><td><a href="#anders-aa">-anders-aa</a></td><td>Andersen's Interprocedural Alias Analysis</td></tr>
|
|
|
|
|
<tr><td><a href="#basicaa">-basicaa</a></td><td>Basic Alias Analysis (default AA impl)</td></tr>
|
|
|
|
|
<tr><td><a href="#basiccg">-basiccg</a></td><td>Basic CallGraph Construction</td></tr>
|
|
|
|
|
<tr><td><a href="#basicvn">-basicvn</a></td><td>Basic Value Numbering (default GVN impl)</td></tr>
|
|
|
|
|
<tr><td><a href="#callgraph">-callgraph</a></td><td>Print a call graph</td></tr>
|
|
|
|
|
<tr><td><a href="#callscc">-callscc</a></td><td>Print SCCs of the Call Graph</td></tr>
|
|
|
|
|
<tr><td><a href="#cfgscc">-cfgscc</a></td><td>Print SCCs of each function CFG</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#codegenprepare">-codegenprepare</a></td><td>Optimize for code generation</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#count-aa">-count-aa</a></td><td>Count Alias Analysis Query Responses</td></tr>
|
|
|
|
|
<tr><td><a href="#debug-aa">-debug-aa</a></td><td>AA use debugger</td></tr>
|
|
|
|
|
<tr><td><a href="#domfrontier">-domfrontier</a></td><td>Dominance Frontier Construction</td></tr>
|
|
|
|
|
<tr><td><a href="#domtree">-domtree</a></td><td>Dominator Tree Construction</td></tr>
|
|
|
|
|
<tr><td><a href="#externalfnconstants">-externalfnconstants</a></td><td>Print external fn callsites passed constants</td></tr>
|
|
|
|
|
<tr><td><a href="#globalsmodref-aa">-globalsmodref-aa</a></td><td>Simple mod/ref analysis for globals</td></tr>
|
|
|
|
|
<tr><td><a href="#instcount">-instcount</a></td><td>Counts the various types of Instructions</td></tr>
|
|
|
|
|
<tr><td><a href="#intervals">-intervals</a></td><td>Interval Partition Construction</td></tr>
|
|
|
|
|
<tr><td><a href="#load-vn">-load-vn</a></td><td>Load Value Numbering</td></tr>
|
|
|
|
|
<tr><td><a href="#loops">-loops</a></td><td>Natural Loop Construction</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#memdep">-memdep</a></td><td>Memory Dependence Analysis</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#no-aa">-no-aa</a></td><td>No Alias Analysis (always returns 'may' alias)</td></tr>
|
|
|
|
|
<tr><td><a href="#no-profile">-no-profile</a></td><td>No Profile Information</td></tr>
|
|
|
|
|
<tr><td><a href="#postdomfrontier">-postdomfrontier</a></td><td>Post-Dominance Frontier Construction</td></tr>
|
|
|
|
|
<tr><td><a href="#postdomtree">-postdomtree</a></td><td>Post-Dominator Tree Construction</td></tr>
|
|
|
|
|
<tr><td><a href="#print">-print</a></td><td>Print function to stderr</td></tr>
|
|
|
|
|
<tr><td><a href="#print-alias-sets">-print-alias-sets</a></td><td>Alias Set Printer</td></tr>
|
|
|
|
|
<tr><td><a href="#print-callgraph">-print-callgraph</a></td><td>Print Call Graph to 'dot' file</td></tr>
|
|
|
|
|
<tr><td><a href="#print-cfg">-print-cfg</a></td><td>Print CFG of function to 'dot' file</td></tr>
|
|
|
|
|
<tr><td><a href="#print-cfg-only">-print-cfg-only</a></td><td>Print CFG of function to 'dot' file (with no function bodies)</td></tr>
|
|
|
|
|
<tr><td><a href="#printm">-printm</a></td><td>Print module to stderr</td></tr>
|
|
|
|
|
<tr><td><a href="#printusedtypes">-printusedtypes</a></td><td>Find Used Types</td></tr>
|
|
|
|
|
<tr><td><a href="#profile-loader">-profile-loader</a></td><td>Load profile information from llvmprof.out</td></tr>
|
|
|
|
|
<tr><td><a href="#scalar-evolution">-scalar-evolution</a></td><td>Scalar Evolution Analysis</td></tr>
|
|
|
|
|
<tr><td><a href="#targetdata">-targetdata</a></td><td>Target Data Layout</td></tr>
|
|
|
|
|
|
|
|
|
|
|
2007-10-25 08:58:56 +00:00
|
|
|
<tr><th colspan="2"><b>TRANSFORM PASSES</b></th></tr>
|
|
|
|
|
<tr><th>Option</th><th>Name</th></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#adce">-adce</a></td><td>Aggressive Dead Code Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#argpromotion">-argpromotion</a></td><td>Promote 'by reference' arguments to scalars</td></tr>
|
|
|
|
|
<tr><td><a href="#block-placement">-block-placement</a></td><td>Profile Guided Basic Block Placement</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#break-crit-edges">-break-crit-edges</a></td><td>Break critical edges in CFG</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#cee">-cee</a></td><td>Correlated Expression Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#condprop">-condprop</a></td><td>Conditional Propagation</td></tr>
|
|
|
|
|
<tr><td><a href="#constmerge">-constmerge</a></td><td>Merge Duplicate Global Constants</td></tr>
|
|
|
|
|
<tr><td><a href="#constprop">-constprop</a></td><td>Simple constant propagation</td></tr>
|
|
|
|
|
<tr><td><a href="#dce">-dce</a></td><td>Dead Code Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#deadargelim">-deadargelim</a></td><td>Dead Argument Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#deadtypeelim">-deadtypeelim</a></td><td>Dead Type Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#die">-die</a></td><td>Dead Instruction Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#dse">-dse</a></td><td>Dead Store Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#gcse">-gcse</a></td><td>Global Common Subexpression Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#globaldce">-globaldce</a></td><td>Dead Global Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#globalopt">-globalopt</a></td><td>Global Variable Optimizer</td></tr>
|
2007-10-25 10:18:27 +00:00
|
|
|
<tr><td><a href="#gvn">-gvn</a></td><td>Global Value Numbering</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#gvnpre">-gvnpre</a></td><td>Global Value Numbering/Partial Redundancy Elimination</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#indmemrem">-indmemrem</a></td><td>Indirect Malloc and Free Removal</td></tr>
|
|
|
|
|
<tr><td><a href="#indvars">-indvars</a></td><td>Canonicalize Induction Variables</td></tr>
|
|
|
|
|
<tr><td><a href="#inline">-inline</a></td><td>Function Integration/Inlining</td></tr>
|
|
|
|
|
<tr><td><a href="#insert-block-profiling">-insert-block-profiling</a></td><td>Insert instrumentation for block profiling</td></tr>
|
|
|
|
|
<tr><td><a href="#insert-edge-profiling">-insert-edge-profiling</a></td><td>Insert instrumentation for edge profiling</td></tr>
|
|
|
|
|
<tr><td><a href="#insert-function-profiling">-insert-function-profiling</a></td><td>Insert instrumentation for function profiling</td></tr>
|
|
|
|
|
<tr><td><a href="#insert-null-profiling-rs">-insert-null-profiling-rs</a></td><td>Measure profiling framework overhead</td></tr>
|
|
|
|
|
<tr><td><a href="#insert-rs-profiling-framework">-insert-rs-profiling-framework</a></td><td>Insert random sampling instrumentation framework</td></tr>
|
|
|
|
|
<tr><td><a href="#instcombine">-instcombine</a></td><td>Combine redundant instructions</td></tr>
|
|
|
|
|
<tr><td><a href="#internalize">-internalize</a></td><td>Internalize Global Symbols</td></tr>
|
|
|
|
|
<tr><td><a href="#ipconstprop">-ipconstprop</a></td><td>Interprocedural constant propagation</td></tr>
|
|
|
|
|
<tr><td><a href="#ipsccp">-ipsccp</a></td><td>Interprocedural Sparse Conditional Constant Propagation</td></tr>
|
|
|
|
|
<tr><td><a href="#lcssa">-lcssa</a></td><td>Loop-Closed SSA Form Pass</td></tr>
|
|
|
|
|
<tr><td><a href="#licm">-licm</a></td><td>Loop Invariant Code Motion</td></tr>
|
|
|
|
|
<tr><td><a href="#loop-extract">-loop-extract</a></td><td>Extract loops into new functions</td></tr>
|
|
|
|
|
<tr><td><a href="#loop-extract-single">-loop-extract-single</a></td><td>Extract at most one loop into a new function</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#loop-index-split">-loop-index-split</a></td><td>Index Split Loops</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#loop-reduce">-loop-reduce</a></td><td>Loop Strength Reduction</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#loop-rotate">-loop-rotate</a></td><td>Rotate Loops</td></tr>
|
|
|
|
|
<tr><td><a href="#loop-unroll">-loop-unroll</a></td><td>Unroll loops</td></tr>
|
|
|
|
|
<tr><td><a href="#loop-unswitch">-loop-unswitch</a></td><td>Unswitch loops</td></tr>
|
|
|
|
|
<tr><td><a href="#loopsimplify">-loopsimplify</a></td><td>Canonicalize natural loops</td></tr>
|
|
|
|
|
<tr><td><a href="#lower-packed">-lower-packed</a></td><td>lowers packed operations to operations on smaller packed datatypes</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#lowerallocs">-lowerallocs</a></td><td>Lower allocations from instructions to calls</td></tr>
|
|
|
|
|
<tr><td><a href="#lowergc">-lowergc</a></td><td>Lower GC intrinsics, for GCless code generators</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#lowerinvoke">-lowerinvoke</a></td><td>Lower invoke and unwind, for unwindless code generators</td></tr>
|
|
|
|
|
<tr><td><a href="#lowerselect">-lowerselect</a></td><td>Lower select instructions to branches</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#lowersetjmp">-lowersetjmp</a></td><td>Lower Set Jump</td></tr>
|
|
|
|
|
<tr><td><a href="#lowerswitch">-lowerswitch</a></td><td>Lower SwitchInst's to branches</td></tr>
|
|
|
|
|
<tr><td><a href="#mem2reg">-mem2reg</a></td><td>Promote Memory to Register</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#mergereturn">-mergereturn</a></td><td>Unify function exit nodes</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#predsimplify">-predsimplify</a></td><td>Predicate Simplifier</td></tr>
|
|
|
|
|
<tr><td><a href="#prune-eh">-prune-eh</a></td><td>Remove unused exception handling info</td></tr>
|
|
|
|
|
<tr><td><a href="#raiseallocs">-raiseallocs</a></td><td>Raise allocations from calls to instructions</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#reassociate">-reassociate</a></td><td>Reassociate expressions</td></tr>
|
|
|
|
|
<tr><td><a href="#reg2mem">-reg2mem</a></td><td>Demote all values to stack slots</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#scalarrepl">-scalarrepl</a></td><td>Scalar Replacement of Aggregates</td></tr>
|
|
|
|
|
<tr><td><a href="#sccp">-sccp</a></td><td>Sparse Conditional Constant Propagation</td></tr>
|
|
|
|
|
<tr><td><a href="#simplify-libcalls">-simplify-libcalls</a></td><td>Simplify well-known library calls</td></tr>
|
|
|
|
|
<tr><td><a href="#simplifycfg">-simplifycfg</a></td><td>Simplify the CFG</td></tr>
|
|
|
|
|
<tr><td><a href="#strip">-strip</a></td><td>Strip all symbols from a module</td></tr>
|
|
|
|
|
<tr><td><a href="#tailcallelim">-tailcallelim</a></td><td>Tail Call Elimination</td></tr>
|
|
|
|
|
<tr><td><a href="#tailduplicate">-tailduplicate</a></td><td>Tail Duplication</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
|
|
|
|
|
|
2007-10-25 08:58:56 +00:00
|
|
|
<tr><th colspan="2"><b>UTILITY PASSES</b></th></tr>
|
|
|
|
|
<tr><th>Option</th><th>Name</th></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#deadarghaX0r">-deadarghaX0r</a></td><td>Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE)</td></tr>
|
|
|
|
|
<tr><td><a href="#extract-blocks">-extract-blocks</a></td><td>Extract Basic Blocks From Module (for bugpoint use)</td></tr>
|
2007-07-06 22:07:22 +00:00
|
|
|
<tr><td><a href="#emitbitcode">-emitbitcode</a></td><td>Bitcode Writer</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
<tr><td><a href="#verify">-verify</a></td><td>Module Verifier</td></tr>
|
2007-10-25 08:46:12 +00:00
|
|
|
<tr><td><a href="#view-cfg">-view-cfg</a></td><td>View CFG of function</td></tr>
|
|
|
|
|
<tr><td><a href="#view-cfg-only">-view-cfg-only</a></td><td>View CFG of function (with no function bodies)</td></tr>
|
2007-03-26 09:32:31 +00:00
|
|
|
</table>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-- ======================================================================= -->
|
|
|
|
|
<div class="doc_section"> <a name="example">Analysis Passes</a></div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>This section describes the LLVM Analysis Passes.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="aa-eval">Exhaustive Alias Analysis Precision Evaluator</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>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.</p>
|
|
|
|
|
|
|
|
|
|
<p>This is inspired and adapted from code by: Naveen Neelakantam, Francesco
|
|
|
|
|
Spadini, and Wojciech Stryjewski.</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="anders-aa">Andersen's Interprocedural Alias Analysis</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This is an implementation of Andersen's interprocedural alias
|
|
|
|
|
analysis
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
In pointer analysis terms, this is a subset-based, flow-insensitive,
|
|
|
|
|
field-sensitive, and context-insensitive algorithm pointer algorithm.
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
This algorithm is implemented as three stages:
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<ol>
|
|
|
|
|
<li>Object identification.</li>
|
|
|
|
|
<li>Inclusion constraint identification.</li>
|
|
|
|
|
<li>Offline constraint graph optimization.</li>
|
|
|
|
|
<li>Inclusion constraint solving.</li>
|
|
|
|
|
</ol>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
The object identification stage identifies all of the memory objects in the
|
|
|
|
|
program, which includes globals, heap allocated objects, and stack allocated
|
|
|
|
|
objects.
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
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
|
|
|
|
|
<code><var>A</var> = <var>B</var></code>, this statement is processed to
|
|
|
|
|
indicate that <var>A</var> can point to anything that <var>B</var> can point
|
|
|
|
|
to. Constraints can handle copies, loads, and stores, and address taking.
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
The inclusion constraint solving phase iteratively propagates the inclusion
|
|
|
|
|
constraints until a fixed point is reached. This is an O(<var>n</var>³)
|
|
|
|
|
algorithm.
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
Function constraints are handled as if they were structs with <var>X</var>
|
|
|
|
|
fields. Thus, an access to argument <var>X</var> of function <var>Y</var> is
|
|
|
|
|
an access to node index <code>getNode(<var>Y</var>) + <var>X</var></code>.
|
|
|
|
|
This representation allows handling of indirect calls without any issues. To
|
|
|
|
|
wit, an indirect call <code><var>Y</var>(<var>a</var>,<var>b</var>)</code> is
|
|
|
|
|
equivalent to <code>*(<var>Y</var> + 1) = <var>a</var>, *(<var>Y</var> + 2) =
|
|
|
|
|
<var>b</var></code>. The return node for a function <var>F</var> is always
|
|
|
|
|
located at <code>getNode(<var>F</var>) + CallReturnPos</code>. The arguments
|
|
|
|
|
start at <code>getNode(<var>F</var>) + CallArgPos</code>.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="basicaa">Basic Alias Analysis (default AA impl)</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="basiccg">Basic CallGraph Construction</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="basicvn">Basic Value Numbering (default GVN impl)</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This is the default implementation of the <code>ValueNumbering</code>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="callgraph">Print a call graph</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This pass, only available in <code>opt</code>, prints
|
|
|
|
|
the call graph into a <code>.dot</code> graph. This graph can then be processed with the
|
|
|
|
|
"dot" tool to convert it to postscript or some other suitable format.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="callscc">Print SCCs of the Call Graph</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This pass, only available in <code>opt</code>, prints
|
|
|
|
|
the SCCs of the call graph to standard output in a human-readable form.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="cfgscc">Print SCCs of each function CFG</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This pass, only available in <code>opt</code>, prints
|
|
|
|
|
the SCCs of each function CFG to standard output in a human-readable form.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="codegenprepare">Optimize for code generation</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="count-aa">Count Alias Analysis Query Responses</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
A pass which can be used to count how many alias queries
|
|
|
|
|
are being made and how the alias analysis implementation being used responds.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="debug-aa">AA use debugger</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
Yes keeping track of every value in the program is expensive, but this is
|
|
|
|
|
a debugging pass.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="domfrontier">Dominance Frontier Construction</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This pass is a simple dominator construction algorithm for finding forward
|
|
|
|
|
dominator frontiers.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="domtree">Dominator Tree Construction</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This pass is a simple dominator construction algorithm for finding forward
|
|
|
|
|
dominators.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="externalfnconstants">Print external fn callsites passed constants</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This pass, only available in <code>opt</code>, 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.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="globalsmodref-aa">Simple mod/ref analysis for globals</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="instcount">Counts the various types of Instructions</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This pass collects the count of all instructions and reports them
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="intervals">Interval Partition Construction</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
This analysis calculates and represents the interval partition of a function,
|
|
|
|
|
or a preexisting interval partition.
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
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).
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="load-vn">Load Value Numbering</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
|
|
|
|
|
|
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="loops">Natural Loop Construction</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="memdep">Memory Dependence Analysis</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="no-aa">No Alias Analysis (always returns 'may' alias)</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="no-profile">No Profile Information</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="postdomfrontier">Post-Dominance Frontier Construction</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="postdomtree">Post-Dominator Tree Construction</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="print">Print function to stderr</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="print-alias-sets">Alias Set Printer</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="print-callgraph">Print Call Graph to 'dot' file</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="print-cfg">Print CFG of function to 'dot' file</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="print-cfg-only">Print CFG of function to 'dot' file (with no function bodies)</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="printm">Print module to stderr</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="printusedtypes">Find Used Types</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="profile-loader">Load profile information from llvmprof.out</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="scalar-evolution">Scalar Evolution Analysis</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="targetdata">Target Data Layout</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-- ======================================================================= -->
|
|
|
|
|
<div class="doc_section"> <a name="transform">Transform Passes</a></div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>This section describes the LLVM Transform Passes.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="adce">Aggressive Dead Code Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-03-27 02:49:31 +00:00
|
|
|
<p>ADCE aggressively tries to eliminate code. This pass is similar to
|
|
|
|
|
<a href="#dce">DCE</a> but it assumes that values are dead until proven
|
|
|
|
|
otherwise. This is similar to <a href="#sccp">SCCP</a>, except applied to
|
|
|
|
|
the liveness of values.</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="argpromotion">Promote 'by reference' arguments to scalars</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="block-placement">Profile Guided Basic Block Placement</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-03-27 02:49:31 +00:00
|
|
|
<p>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.</p>
|
|
|
|
|
<p>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.</p>
|
2007-10-25 10:18:27 +00:00
|
|
|
|
2007-03-27 02:49:31 +00:00
|
|
|
<p>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 <b>extremely</b> 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.</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="break-crit-edges">Break critical edges in CFG</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="cee">Correlated Expression Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-03-27 02:49:31 +00:00
|
|
|
<p>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,
|
2007-10-25 08:58:56 +00:00
|
|
|
allowing transformations like these for example:</p>
|
|
|
|
|
|
|
|
|
|
<blockquote><pre>
|
|
|
|
|
if (i == 7)
|
|
|
|
|
... 4*i; // constant propagation
|
2007-03-27 02:49:31 +00:00
|
|
|
|
2007-10-25 08:58:56 +00:00
|
|
|
M = i+1; N = j+1;
|
|
|
|
|
if (i == j)
|
|
|
|
|
X = M-N; // = M-M == 0;
|
|
|
|
|
</pre></blockquote>
|
2007-03-27 02:49:31 +00:00
|
|
|
|
|
|
|
|
<p>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.</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="condprop">Conditional Propagation</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-03-27 02:49:31 +00:00
|
|
|
<p>This pass propagates information about conditional expressions through the
|
|
|
|
|
program, allowing it to eliminate conditional branches in some cases.</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="constmerge">Merge Duplicate Global Constants</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="constprop">Simple constant propagation</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-03-27 02:49:31 +00:00
|
|
|
<p>This file implements constant propagation and merging. It looks for
|
|
|
|
|
instructions involving only constant operands and replaces them with a
|
2007-10-25 08:58:56 +00:00
|
|
|
constant value instead of an instruction. For example:</p>
|
|
|
|
|
<blockquote><pre>add i32 1, 2</pre></blockquote>
|
|
|
|
|
<p>becomes</p>
|
|
|
|
|
<blockquote><pre>i32 3</pre></blockquote>
|
2007-03-27 02:49:31 +00:00
|
|
|
<p>NOTE: this pass has a habit of making definitions be dead. It is a good
|
|
|
|
|
idea to to run a <a href="#die">DIE</a> (Dead Instruction Elimination) pass
|
|
|
|
|
sometime after running this pass.</p>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="dce">Dead Code Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="deadargelim">Dead Argument Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="deadtypeelim">Dead Type Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="die">Dead Instruction Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="dse">Dead Store Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="gcse">Global Common Subexpression Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="globaldce">Dead Global Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="globalopt">Global Variable Optimizer</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
2007-10-25 10:18:27 +00:00
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="gvn">Global Value Numbering</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>
|
|
|
|
|
This pass performs global value numbering to eliminate fully redundant
|
|
|
|
|
instructions. It also performs simple dead load elimination.
|
|
|
|
|
</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
2007-10-25 08:46:12 +00:00
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="gvnpre">Global Value Numbering/Partial Redundancy Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
2007-10-25 10:18:27 +00:00
|
|
|
<p>
|
|
|
|
|
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.
|
|
|
|
|
</p>
|
2007-10-25 08:46:12 +00:00
|
|
|
</div>
|
|
|
|
|
|
2007-03-26 09:32:31 +00:00
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="indmemrem">Indirect Malloc and Free Removal</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="indvars">Canonicalize Induction Variables</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="inline">Function Integration/Inlining</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="insert-block-profiling">Insert instrumentation for block profiling</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="insert-edge-profiling">Insert instrumentation for edge profiling</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="insert-function-profiling">Insert instrumentation for function profiling</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="insert-null-profiling-rs">Measure profiling framework overhead</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="insert-rs-profiling-framework">Insert random sampling instrumentation framework</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="instcombine">Combine redundant instructions</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="internalize">Internalize Global Symbols</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="ipconstprop">Interprocedural constant propagation</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="ipsccp">Interprocedural Sparse Conditional Constant Propagation</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="lcssa">Loop-Closed SSA Form Pass</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="licm">Loop Invariant Code Motion</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="loop-extract">Extract loops into new functions</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="loop-extract-single">Extract at most one loop into a new function</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
2007-10-25 08:46:12 +00:00
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="loop-index-split">Index Split Loops</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
2007-03-26 09:32:31 +00:00
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="loop-reduce">Loop Strength Reduction</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="loop-rotate">Rotate Loops</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="loop-unroll">Unroll loops</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="loop-unswitch">Unswitch loops</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="loopsimplify">Canonicalize natural loops</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="lower-packed">lowers packed operations to operations on smaller packed datatypes</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="lowerallocs">Lower allocations from instructions to calls</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="lowergc">Lower GC intrinsics, for GCless code generators</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="lowerinvoke">Lower invoke and unwind, for unwindless code generators</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="lowerselect">Lower select instructions to branches</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="lowersetjmp">Lower Set Jump</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="lowerswitch">Lower SwitchInst's to branches</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="mem2reg">Promote Memory to Register</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="mergereturn">Unify function exit nodes</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="predsimplify">Predicate Simplifier</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="prune-eh">Remove unused exception handling info</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="raiseallocs">Raise allocations from calls to instructions</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="reassociate">Reassociate expressions</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="reg2mem">Demote all values to stack slots</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="scalarrepl">Scalar Replacement of Aggregates</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="sccp">Sparse Conditional Constant Propagation</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="simplify-libcalls">Simplify well-known library calls</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="simplifycfg">Simplify the CFG</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="strip">Strip all symbols from a module</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="tailcallelim">Tail Call Elimination</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="tailduplicate">Tail Duplication</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-- ======================================================================= -->
|
|
|
|
|
<div class="doc_section"> <a name="transform">Utility Passes</a></div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>This section describes the LLVM Utility Passes.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="deadarghaX0r">Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE)</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-10-25 08:46:12 +00:00
|
|
|
<a name="extract-blocks">Extract Basic Blocks From Module (for bugpoint use)</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
2007-07-06 22:07:22 +00:00
|
|
|
<a name="emitbitcode">Bitcode Writer</a>
|
2007-03-26 09:32:31 +00:00
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="verify">Module Verifier</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
2007-10-25 08:46:12 +00:00
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="view-cfg">View CFG of function</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
<!-------------------------------------------------------------------------- -->
|
|
|
|
|
<div class="doc_subsection">
|
|
|
|
|
<a name="view-cfg-only">View CFG of function (with no function bodies)</a>
|
|
|
|
|
</div>
|
|
|
|
|
<div class="doc_text">
|
|
|
|
|
<p>Yet to be written.</p>
|
|
|
|
|
</div>
|
|
|
|
|
|
2007-03-26 09:32:31 +00:00
|
|
|
<!-- *********************************************************************** -->
|
|
|
|
|
|
|
|
|
|
<hr>
|
|
|
|
|
<address>
|
|
|
|
|
<a href="http://jigsaw.w3.org/css-validator/check/referer"><img
|
|
|
|
|
src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
|
|
|
|
|
<a href="http://validator.w3.org/check/referer"><img
|
|
|
|
|
src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
|
|
|
|
|
|
|
|
|
|
<a href="mailto:rspencer@x10sys.com">Reid Spencer</a><br>
|
|
|
|
|
<a href="http://llvm.org">LLVM Compiler Infrastructure</a><br>
|
|
|
|
|
Last modified: $Date$
|
|
|
|
|
</address>
|
|
|
|
|
|
|
|
|
|
</body>
|
|
|
|
|
</html>
|
