diff options
| author | Reid Spencer <rspencer@reidspencer.com> | 2004-10-30 21:40:28 +0000 |
|---|---|---|
| committer | Reid Spencer <rspencer@reidspencer.com> | 2004-10-30 21:40:28 +0000 |
| commit | a07e0b5e18412a1f896b84db14dd840a81d03920 (patch) | |
| tree | b47518e2405e3c6d09a22719a3caa7d0071fe922 /docs/Lexicon.html | |
| parent | a79e58c22eb4fa4277dffbdd7e0fe27a39abab5b (diff) | |
Add a few more terms.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@17364 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs/Lexicon.html')
| -rw-r--r-- | docs/Lexicon.html | 39 |
1 files changed, 39 insertions, 0 deletions
diff --git a/docs/Lexicon.html b/docs/Lexicon.html index 8023c24711e..55315f1022e 100644 --- a/docs/Lexicon.html +++ b/docs/Lexicon.html @@ -36,6 +36,12 @@ <td></td> <td></td> </tr> + <tr><td colspan="8"><b>- <a href="#C">C</a> -</b></td></tr> + <tr> + <td><a href="#CSE">CSE</a></td> + <td></td> + <td></td> + </tr> <tr><td colspan="8"><b>- <a href="#D">D</a> -</b></td></tr> <tr> <td><a href="#DSA">DSA</a></td> @@ -43,11 +49,19 @@ <td></td> <td></td> </tr> + <tr><td colspan="8"><b>- <a href="#I">L</a> -</b></td></tr> + <tr> + <td><a href="#IPA">IPA</a></td> + <td><a href="#IPO">IPO</a></td> + <td></td> + <td></td> + </tr> <tr><td colspan="8"><b>- <a href="#L">L</a> -</b></td></tr> <tr> <td><a href="#LICM">LICM</a></td> <td><a href="#Load-VN">Load-VN</a></td> <td></td> + <td></td> </tr> <tr><td colspan="8"><b>- <a href="#P">P</a> -</b></td></tr> <tr> @@ -86,6 +100,18 @@ 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> @@ -96,6 +122,19 @@ href="http://www.program-transformation.org/Transform/BURG">BURG</a> tool.</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> |