diff options
author | Dan Gohman <djg@cray.com> | 2007-07-18 16:29:46 +0000 |
---|---|---|
committer | Dan Gohman <djg@cray.com> | 2007-07-18 16:29:46 +0000 |
commit | f17a25c88b892d30c2b41ba7ecdfbdfb2b4be9cc (patch) | |
tree | ebb79ea1ee5e3bc1fdf38541a811a8b804f0679a /docs/Lexicon.html | |
download | external_llvm-f17a25c88b892d30c2b41ba7ecdfbdfb2b4be9cc.zip external_llvm-f17a25c88b892d30c2b41ba7ecdfbdfb2b4be9cc.tar.gz external_llvm-f17a25c88b892d30c2b41ba7ecdfbdfb2b4be9cc.tar.bz2 |
It's not necessary to do rounding for alloca operations when the requested
alignment is equal to the stack alignment.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@40004 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs/Lexicon.html')
-rw-r--r-- | docs/Lexicon.html | 181 |
1 files changed, 181 insertions, 0 deletions
diff --git a/docs/Lexicon.html b/docs/Lexicon.html new file mode 100644 index 0000000..dac1ead --- /dev/null +++ b/docs/Lexicon.html @@ -0,0 +1,181 @@ +<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> +<html> +<head> + <meta http-equiv="Content-Type" content="text/html; charset=utf-8"> + <title>The LLVM Lexicon</title> + <link rel="stylesheet" href="llvm.css" type="text/css"> + <meta name="author" content="Various"> + <meta name="description" + content="A glossary of terms used with the LLVM project."> +</head> +<body> +<div class="doc_title">The LLVM Lexicon</div> +<p class="doc_warning">NOTE: This document is a work in progress!</p> +<!-- *********************************************************************** --> +<div class="doc_section">Table Of Contents</div> +<!-- *********************************************************************** --> +<div class="doc_text"> + <table> + <tr><th colspan="8"><b>- <a href="#A">A</a> -</b></th></tr> + <tr> + <td><a href="#ADCE">ADCE</a></td> + </tr> + <tr><th colspan="8"><b>- <a href="#B">B</a> -</b></th></tr> + <tr> + <td><a href="#BURS">BURS</a></td> + </tr> + <tr><th colspan="8"><b>- <a href="#C">C</a> -</b></th></tr> + <tr> + <td><a href="#CSE">CSE</a></td> + </tr> + <tr><th colspan="8"><b>- <a href="#D">D</a> -</b></th></tr> + <tr> + <td><a href="#DSA">DSA</a></td> + <td><a href="#DSE">DSE</a></td> + </tr> + <tr><th colspan="8"><b>- <a href="#I">I</a> -</b></th></tr> + <tr> + <td><a href="#IPA">IPA</a></td> + <td><a href="#IPO">IPO</a></td> + </tr> + <tr><th colspan="8"><b>- <a href="#L">L</a> -</b></th></tr> + <tr> + <td><a href="#LCSSA">LCSSA</a></td> + <td><a href="#LICM">LICM</a></td> + <td><a href="#Load-VN">Load-VN</a></td> + </tr> + <tr><th colspan="8"><b>- <a href="#P">P</a> -</b></th></tr> + <tr> + <td><a href="#PRE">PRE</a></td> + </tr> + <tr><th colspan="8"><b>- <a href="#R">R</a> -</b></th></tr> + <tr> + <td><a href="#Reassociation">Reassociation</a></td> + </tr> + <tr><th colspan="8"><b>- <a href="#S">S</a> -</b></th></tr> + <tr> + <td><a href="#SCC">SCC</a></td> + <td><a href="#SCCP">SCCP</a></td> + <td><a href="#SRoA">SRoA</a></td> + <td><a href="#SSA">SSA</a></td> + </tr> + </table> +</div> + +<!-- *********************************************************************** --> +<div class="doc_section">Definitions</div> +<!-- *********************************************************************** --> +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="A">- A -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="ADCE"><b>ADCE</b></a></dt> + <dd>Aggressive Dead Code Elimination</dd> + </dl> +</div> +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="B">- B -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="BURS"><b>BURS</b></a></dt> + <dd>Bottom Up Rewriting System - A method of instruction selection for + code generation. An example is the <a +href="http://www.program-transformation.org/Transform/BURG">BURG</a> tool.</dd> + </dl> +</div> +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="C">- C -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="CSE"><b>CSE</b></a></dt> + <dd>Common Subexpression Elimination. An optimization that removes common + subexpression compuation. For example <tt>(a+b)*(a+b)</tt> has two + subexpressions that are the same: <tt>(a+b)</tt>. This optimization would + perform the addition only once and then perform the multiply (but only if + its compulationally correct/safe). + </dl> +</div> +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="D">- D -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="DSA"><b>DSA</b></a></dt> + <dd>Data Structure Analysis</dd> + <dt><a name="DSE"><b>DSE</b></a></dt> + <dd>Dead Store Elimination</dd> + </dl> +</div> +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="I">- I -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="IPA"><b>IPA</b></a></dt> + <dd>Inter-Procedural Analysis. Refers to any variety of code analysis that + occurs between procedures, functions or compilation units (modules).</dd> + <dt><a name="IPO"><b>IPO</b></a></dt> + <dd>Inter-Procedural Optimization. Refers to any variety of code + optimization that occurs between procedures, functions or compilation units + (modules).</dd> + </dl> +</div> +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="L">- L -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="LCSSA"><b>LCSSA</b></a></dt> + <dd>Loop-Closed Static Single Assignment Form</dd> + <dt><a name="LICM"><b>LICM</b></a></dt> + <dd>Loop Invariant Code Motion</dd> + <dt><a name="Load-VN"><b>Load-VN</b></a></dt> + <dd>Load Value Numbering</dd> + </dl> +</div> + +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="P">- P -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="PRE"><b>PRE</b></a></dt> + <dd>Partial Redundancy Elimination</dd> + </dl> +</div> + +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="R">- R -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="Reassociation"><b>Reassociation</b></a></dt> <dd>Rearranging + associative expressions to promote better redundancy elimination and other + optimization. For example, changing (A+B-A) into (B+A-A), permitting it to + be optimized into (B+0) then (B). + </dl> +</div> + +<!-- _______________________________________________________________________ --> +<div class="doc_subsection"><a name="S">- S -</a></div> +<div class="doc_text"> + <dl> + <dt><a name="SCC"><b>SCC</b></a></dt> + <dd>Strongly Connected Component</dd> + <dt><a name="SCCP"><b>SCCP</b></a></dt> + <dd>Sparse Conditional Constant Propagation</dd> + <dt><a name="SRoA"><b>SRoA</b></a></dt> + <dd>Scalar Replacement of Aggregates</dd> + <dt><a name="SSA"><b>SSA</b></a></dt> + <dd>Static Single Assignment</dd> + </dl> +</div> +<!-- *********************************************************************** --> +<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="http://llvm.org/">The LLVM Team</a><br> +<a href="http://llvm.org">The LLVM Compiler Infrastructure</a><br> +Last modified: $Date$ +</address> +<!-- vim: sw=2 +--> +</body> +</html> |