docs/Lexicon.html

   1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
   2 <html>
   3 <head>
   4   <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
   5   <title>The LLVM Lexicon</title>
   6   <link rel="stylesheet" href="llvm.css" type="text/css">
   7   <meta name="author" content="Various">
   8   <meta name="description"
   9   content="A glossary of terms used with the LLVM project.">
  10 </head>
  11 <body>
  12 <div class="doc_title">The LLVM Lexicon</div>
  13 <p class="doc_warning">NOTE: This document is a work in progress!</p>
  14 <!-- *********************************************************************** -->
  15 <div class="doc_section">Table Of Contents</div>
  16 <!-- *********************************************************************** -->
  17 <div class="doc_text">
  18   <table>
  19     <tr><th colspan="8"><b>- <a href="#A">A</a> -</b></th></tr>
  20     <tr>
  21       <td><a href="#ADCE">ADCE</a></td>
  22     </tr>
  23     <tr><th colspan="8"><b>- <a href="#B">B</a> -</b></th></tr>
  24     <tr>
  25       <td><a href="#BURS">BURS</a></td>
  26     </tr>
  27     <tr><th colspan="8"><b>- <a href="#C">C</a> -</b></th></tr>
  28     <tr>
  29       <td><a href="#CSE">CSE</a></td>
  30     </tr>
  31     <tr><th colspan="8"><b>- <a href="#D">D</a> -</b></th></tr>
  32     <tr>
  33       <td><a href="#DSA">DSA</a></td>
  34       <td><a href="#DSE">DSE</a></td>
  35     </tr>
  36     <tr><th colspan="8"><b>- <a href="#I">I</a> -</b></th></tr>
  37     <tr>
  38       <td><a href="#IPA">IPA</a></td>
  39       <td><a href="#IPO">IPO</a></td>
  40     </tr>
  41     <tr><th colspan="8"><b>- <a href="#L">L</a> -</b></th></tr>
  42     <tr>
  43       <td><a href="#LICM">LICM</a></td>
  44       <td><a href="#Load-VN">Load-VN</a></td>
  45     </tr>
  46     <tr><th colspan="8"><b>- <a href="#P">P</a> -</b></th></tr>
  47     <tr>
  48       <td><a href="#PRE">PRE</a></td>
  49     </tr>
  50     <tr><th colspan="8"><b>- <a href="#R">R</a> -</b></th></tr>
  51     <tr>
  52       <td><a href="#Reassociation">Reassociation</a></td>
  53     </tr>
  54     <tr><th colspan="8"><b>- <a href="#S">S</a> -</b></th></tr>
  55     <tr>
  56       <td><a href="#SCC">SCC</a></td>
  57       <td><a href="#SCCP">SCCP</a></td>
  58       <td><a href="#SSA">SSA</a></td>
  59     </tr>
  60   </table>
  61 </div>
  62
  63 <!-- *********************************************************************** -->
  64 <div class="doc_section">Definitions</div>
  65 <!-- *********************************************************************** -->
  66 <!-- _______________________________________________________________________ -->
  67 <div class="doc_subsection"><a name="A">- A -</a></div>
  68 <div class="doc_text">
  69   <dl>
  70     <dt><a name="ADCE"><b>ADCE</b></a></dt>
  71     <dd>Aggressive Dead Code Elimination</dd>
  72   </dl>
  73 </div>
  74 <!-- _______________________________________________________________________ -->
  75 <div class="doc_subsection"><a name="B">- B -</a></div>
  76 <div class="doc_text">
  77   <dl>
  78     <dt><a name="BURS"><b>BURS</b></a></dt>
  79     <dd>Bottom Up Rewriting System - A method of instruction selection for
  80         code generation.  An example is the <a
  81 href="http://www.program-transformation.org/Transform/BURG">BURG</a> tool.</dd>
  82   </dl>
  83 </div>
  84 <!-- _______________________________________________________________________ -->
  85 <div class="doc_subsection"><a name="C">- C -</a></div>
  86 <div class="doc_text">
  87   <dl>
  88     <dt><a name="CSE"><b>CSE</b></a></dt>
  89     <dd>Common Subexpression Elimination. An optimization that removes common
  90     subexpression compuation. For example <tt>(a+b)*(a+b)</tt> has two
  91     subexpressions that are the same: <tt>(a+b)</tt>. This optimization would
  92     perform the addition only once and then perform the multiply (but only if
  93     its compulationally correct/safe).
  94   </dl>
  95 </div>
  96 <!-- _______________________________________________________________________ -->
  97 <div class="doc_subsection"><a name="D">- D -</a></div>
  98 <div class="doc_text">
  99   <dl>
 100     <dt><a name="DSA"><b>DSA</b></a></dt>
 101     <dd>Data Structure Analysis</dd>
 102     <dt><a name="DSE"><b>DSE</b></a></dt>
 103     <dd>Dead Store Elimination</dd>
 104   </dl>
 105 </div>
 106 <!-- _______________________________________________________________________ -->
 107 <div class="doc_subsection"><a name="I">- I -</a></div>
 108 <div class="doc_text">
 109   <dl>
 110     <dt><a name="IPA"><b>IPA</b></a></dt>
 111     <dd>Inter-Procedural Analysis. Refers to any variety of code analysis that
 112     occurs between procedures, functions or compilation units (modules).</dd>
 113     <dt><a name="IPO"><b>IPO</b></a></dt>
 114     <dd>Inter-Procedural Optimization. Refers to any variety of code
 115     optimization that occurs between procedures, functions or compilation units
 116     (modules).</dd>
 117   </dl>
 118 </div>
 119 <!-- _______________________________________________________________________ -->
 120 <div class="doc_subsection"><a name="L">- L -</a></div>
 121 <div class="doc_text">
 122   <dl>
 123     <dt><a name="LICM"><b>LICM</b></a></dt>
 124     <dd>Loop Invariant Code Motion</dd>
 125     <dt><a name="Load-VN"><b>Load-VN</b></a></dt>
 126     <dd>Load Value Numbering</dd>
 127   </dl>
 128 </div>
 129
 130 <!-- _______________________________________________________________________ -->
 131 <div class="doc_subsection"><a name="P">- P -</a></div>
 132 <div class="doc_text">
 133   <dl>
 134     <dt><a name="PRE"><b>PRE</b></a></dt>
 135     <dd>Partial Redundancy Elimination</dd>
 136   </dl>
 137 </div>
 138
 139 <!-- _______________________________________________________________________ -->
 140 <div class="doc_subsection"><a name="R">- R -</a></div>
 141 <div class="doc_text">
 142   <dl>
 143     <dt><a name="Reassociation"><b>Reassociation</b></a></dt> <dd>Rearranging
 144     associative expressions to promote better redundancy elimination and other
 145     optimization.  For example, changing (A+B-A) into (B+A-A), permitting it to
 146     be optimized into (B+0) then (B).
 147   </dl>
 148 </div>
 149
 150 <!-- _______________________________________________________________________ -->
 151 <div class="doc_subsection"><a name="S">- S -</a></div>
 152 <div class="doc_text">
 153   <dl>
 154     <dt><a name="SCC"><b>SCC</b></a></dt>
 155     <dd>Strongly Connected Component</dd>
 156     <dt><a name="SCCP"><b>SCCP</b></a></dt>
 157     <dd>Sparse Conditional Constant Propagation</dd>
 158     <dt><a name="SSA"><b>SSA</b></a></dt>
 159     <dd>Static Single Assignment</dd>
 160   </dl>
 161 </div>
 162 <!-- *********************************************************************** -->
 163 <hr>
 164 <address> <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
 165  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a><a
 166  href="http://validator.w3.org/check/referer"><img
 167  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a><a
 168  href="http://llvm.cs.uiuc.edu/">The LLVM Team</a><br>
 169 <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a><br>
 170 Last modified: $Date$
 171 </address>
 172 <!-- vim: sw=2
 173 -->
 174 </body>
 175 </html>