X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=docs%2FLexicon.html;h=c6c3a81ab50fecf8eb5ce104a18d622c90459e81;hb=dba95737e0827380c2be9b762af0c2740c4ebce7;hp=81dbf4e91c67286ac618eff175cab22c46b5b234;hpb=d3f876c93c9ce33899a9feca3c0e8de1a895008f;p=oota-llvm.git diff --git a/docs/Lexicon.html b/docs/Lexicon.html index 81dbf4e91c6..c6c3a81ab50 100644 --- a/docs/Lexicon.html +++ b/docs/Lexicon.html @@ -9,104 +9,131 @@ content="A glossary of terms used with the LLVM project."> -
The LLVM Lexicon
+

The LLVM Lexicon

NOTE: This document is a work in progress!

-
Table Of Contents
+

Table Of Contents

-
+
- - - - - - + + - - + + + + + + + + - - + + - - + + + + + + + + + - - + + + + + + + + - - + + +
- A -
ADCE
- B -
BURS
- C -
CSE
- D -
DAGDerived Pointer DSA DSE
- F -
FCA
- G -
GC
- I -
IPA IPOISel
- L -
LCSSA LICM Load-VNLTO
- M -
MC
- O -
Object Pointer
- P -
PRE
- R -
RAUWReassociationRoot
- S -
Safe PointSCC SCCPSSASDISelSRoAStack Map
-
Definitions
+

Definitions

+
-
- A -
-
+

- A -

+
ADCE
Aggressive Dead Code Elimination
-
- B -
-
+

- B -

+
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.
-
- C -
-
+

- C -

+
CSE
Common Subexpression Elimination. An optimization that removes common 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).
-
- D -
-
+

- D -

+
+
DAG
+
Directed Acyclic Graph
+
Derived Pointer
+
A pointer to the interior of an object, such that a garbage collector + is unable to use the pointer for reachability analysis. While a derived + pointer is live, the corresponding object pointer must be kept in a root, + otherwise the collector might free the referenced object. With copying + collectors, derived pointers pose an additional hazard that they may be + invalidated at any safe point. This term is used in + opposition to object pointer.
DSA
Data Structure Analysis
DSE
@@ -114,8 +141,34 @@ href="http://www.program-transformation.org/Transform/BURG">BURG tool.
-
- I -
-
+

- F -

+
+
+
FCA
+
First Class Aggregate
+
+
+ +

- G -

+
+
+
GC
+
Garbage Collection. The practice of using reachability analysis instead + of explicit memory management to reclaim unused memory.
+
+
+ +

- H -

+
+
+
Heap
+
In garbage collection, the region of memory which is managed using + reachability analysis.
+
+
+ +

- I -

+
IPA
Inter-Procedural Analysis. Refers to any variety of code analysis that @@ -124,44 +177,113 @@ href="http://www.program-transformation.org/Transform/BURG">BURG tool.
Inter-Procedural Optimization. Refers to any variety of code optimization that occurs between procedures, functions or compilation units (modules).
+
ISel
+
Instruction Selection.
-
- L -
-
+

- L -

+
+
LCSSA
+
Loop-Closed Static Single Assignment Form
LICM
Loop Invariant Code Motion
Load-VN
Load Value Numbering
+
LTO
+
Link-Time Optimization
+
+
+ +

- M -

+
+
+
MC
+
Machine Code
-
- P -
-
+

- O -

+
+
+
Object Pointer
+
A pointer to an object such that the garbage collector is able to trace + references contained within the object. This term is used in opposition to + derived pointer.
+
+
+ + +

- P -

+
PRE
Partial Redundancy Elimination
+ -
- S -
-
+

- R -

+
+
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).
+
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.
+
+
+ + +

- S -

+
+
+
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 +
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.
+ +
Valid CSS!Valid HTML 4.01!The LLVM Team
-The LLVM Compiler Infrastructure
+The LLVM Compiler Infrastructure
Last modified: $Date$