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="#SCCP">SCCP</a></td>
  57       <td><a href="#SSA">SSA</a></td>
  58     </tr>
  59   </table>
  60 </div>
  61
  62 <!-- *********************************************************************** -->
  63 <div class="doc_section">Definitions</div>
  64 <!-- *********************************************************************** -->
  65 <!-- _______________________________________________________________________ -->
  66 <div class="doc_subsection"><a name="A">- A -</a></div>
  67 <div class="doc_text">
  68   <dl>
  69     <dt><a name="ADCE"><b>ADCE</b></a></dt>
  70     <dd>Aggressive Dead Code Elimination</dd>
  71   </dl>
  72 </div>
  73 <!-- _______________________________________________________________________ -->
  74 <div class="doc_subsection"><a name="B">- B -</a></div>
  75 <div class="doc_text">
  76   <dl>
  77     <dt><a name="BURS"><b>BURS</b></a></dt>
  78     <dd>Bottom Up Rewriting System - A method of instruction selection for
  79         code generation.  An example is the <a
  80 href="http://www.program-transformation.org/Transform/BURG">BURG</a> tool.</dd>
  81   </dl>
  82 </div>
  83 <!-- _______________________________________________________________________ -->
  84 <div class="doc_subsection"><a name="C">- C -</a></div>
  85 <div class="doc_text">
  86   <dl>
  87     <dt><a name="CSE"><b>CSE</b></a></dt>
  88     <dd>Common Subexpression Elimination. An optimization that removes common
  89     subexpression compuation. For example <tt>(a+b)*(a+b)</tt> has two
  90     subexpressions that are the same: <tt>(a+b)</tt>. This optimization would
  91     perform the addition only once and then perform the multiply (but only if
  92     its compulationally correct/safe).
  93   </dl>
  94 </div>
  95 <!-- _______________________________________________________________________ -->
  96 <div class="doc_subsection"><a name="D">- D -</a></div>
  97 <div class="doc_text">
  98   <dl>
  99     <dt><a name="DSA"><b>DSA</b></a></dt>
 100     <dd>Data Structure Analysis</dd>
 101     <dt><a name="DSE"><b>DSE</b></a></dt>
 102     <dd>Dead Store Elimination</dd>
 103   </dl>
 104 </div>
 105 <!-- _______________________________________________________________________ -->
 106 <div class="doc_subsection"><a name="I">- I -</a></div>
 107 <div class="doc_text">
 108   <dl>
 109     <dt><a name="IPA"><b>IPA</b></a></dt>
 110     <dd>Inter-Procedural Analysis. Refers to any variety of code analysis that
 111     occurs between procedures, functions or compilation units (modules).</dd>
 112     <dt><a name="IPO"><b>IPO</b></a></dt>
 113     <dd>Inter-Procedural Optimization. Refers to any variety of code
 114     optimization that occurs between procedures, functions or compilation units
 115     (modules).</dd>
 116   </dl>
 117 </div>
 118 <!-- _______________________________________________________________________ -->
 119 <div class="doc_subsection"><a name="L">- L -</a></div>
 120 <div class="doc_text">
 121   <dl>
 122     <dt><a name="LICM"><b>LICM</b></a></dt>
 123     <dd>Loop Invariant Code Motion</dd>
 124     <dt><a name="Load-VN"><b>Load-VN</b></a></dt>
 125     <dd>Load Value Numbering</dd>
 126   </dl>
 127 </div>
 128
 129 <!-- _______________________________________________________________________ -->
 130 <div class="doc_subsection"><a name="P">- P -</a></div>
 131 <div class="doc_text">
 132   <dl>
 133     <dt><a name="PRE"><b>PRE</b></a></dt>
 134     <dd>Partial Redundancy Elimination</dd>
 135   </dl>
 136 </div>
 137
 138 <!-- _______________________________________________________________________ -->
 139 <div class="doc_subsection"><a name="R">- R -</a></div>
 140 <div class="doc_text">
 141   <dl>
 142     <dt><a name="Reassociation"><b>Reassociation</b></a></dt> <dd>Rearranging
 143     associative expressions to promote better redundancy elimination and other
 144     optimization.  For example, changing (A+B-A) into (B+A-A), permitting it to
 145     be optimized into (B+0) then (B).
 146   </dl>
 147 </div>
 148
 149 <!-- _______________________________________________________________________ -->
 150 <div class="doc_subsection"><a name="S">- S -</a></div>
 151 <div class="doc_text">
 152   <dl>
 153     <dt><a name="SCCP"><b>SCCP</b></a></dt>
 154     <dd>Sparse Conditional Constant Propagation
 155     <dt><a name="SSA"><b>SSA</b></a></dt>
 156     <dd>Static Single Assignment</dd>
 157   </dl>
 158 </div>
 159 <!-- *********************************************************************** -->
 160 <hr>
 161 <address> <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
 162  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a><a
 163  href="http://validator.w3.org/check/referer"><img
 164  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a><a
 165  href="http://llvm.cs.uiuc.edu/">The LLVM Team</a><br>
 166 <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a><br>
 167 Last modified: $Date$
 168 </address>
 169 <!-- vim: sw=2
 170 -->
 171 </body>
 172 </html>