X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=docs%2FLexicon.html;h=820fdd6f022b91a42ecdb3e0d702cb19ff982dbe;hb=edb8997821d6d7ae3cb8fc03e9b50190e990154a;hp=14510b4662587d9e285e58d37d947b9289271625;hpb=59f7f2156a770bfeb91ea672faeb64fefe9d69f4;p=oota-llvm.git
diff --git a/docs/Lexicon.html b/docs/Lexicon.html
index 14510b46625..820fdd6f022 100644
--- a/docs/Lexicon.html
+++ b/docs/Lexicon.html
@@ -30,32 +30,49 @@
- BURS
- - Bottom Up Rewriting System - A method of instruction selection for
+
- Bottom Up Rewriting System—A method of instruction selection for
code generation. An example is the BURG tool.
@@ -90,13 +107,23 @@ href="http://www.program-transformation.org/Transform/BURG">BURG tool.
subexpression compuation. For example
(a+b)*(a+b) has two
subexpressions that are the same:
(a+b). This optimization would
perform the addition only once and then perform the multiply (but only if
- its compulationally correct/safe).
+ it's compulationally correct/safe).
@@ -140,10 +200,22 @@ href="http://www.program-transformation.org/Transform/BURG">BURG tool.
+ - RAUW
- An abbreviation for Replace
+ All Uses With. The functions User::replaceUsesOfWith(),
+ Value::replaceAllUsesWith(), and Constant::replaceUsesOfWithOnConstant()
+ implement the replacement of one Value with another by iterating over its
+ def/use chain and fixing up all of the pointers to point to the new value.
+ See also def/use chains.
+
- Reassociation
- 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).
+ be optimized into (B+0) then (B).
+ - Root
- In garbage collection, a
+ pointer variable lying outside of the heap from which
+ the collector begins its reachability analysis. In the context of code
+ generation, "root" almost always refers to a "stack root" -- a local or
+ temporary variable within an executing function.
@@ -151,22 +223,38 @@ href="http://www.program-transformation.org/Transform/BURG">BURG tool.
+ - Safe Point
+ - In garbage collection, it is necessary to identify stack
+ roots so that reachability analysis may proceed. It may be infeasible to
+ provide this information for every instruction, so instead the information
+ may is calculated only at designated safe points. With a copying collector,
+ derived pointers must not be retained across
+ safe points and object pointers must be
+ reloaded from stack roots.
+ - SDISel
+ - Selection DAG Instruction Selection.
- SCC
- Strongly Connected Component
- SCCP
- Sparse Conditional Constant Propagation
+ - SRoA
+ - Scalar Replacement of Aggregates
- SSA
- Static Single Assignment
+ - Stack Map
+ - In garbage collection, metadata emitted by the code generator which
+ identifies roots within the stack frame of an executing
+ function.
The LLVM Team
-The LLVM Compiler Infrastructure
+ src="http://www.w3.org/Icons/valid-html401-blue" alt="Valid HTML 4.01">The LLVM Team
+The LLVM Compiler Infrastructure
Last modified: $Date$