The LLVM Lexicon
NOTE: This document is a work in progress!
Table Of Contents
- Aggressive Dead Code Elimination
- Bottom Up Rewriting System - A method of instruction selection for
code generation. An example is the BURG tool.
- 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).
- Data Structure Analysis
- Dead Store Elimination
- Inter-Procedural Analysis. Refers to any variety of code analysis that
occurs between procedures, functions or compilation units (modules).
- Inter-Procedural Optimization. Refers to any variety of code
optimization that occurs between procedures, functions or compilation units
- Loop-Closed Static Single Assignment Form
- Loop Invariant Code Motion
- Load Value Numbering
- Partial Redundancy Elimination
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).
- Strongly Connected Component
- Sparse Conditional Constant Propagation
- Scalar Replacement of Aggregates
- Static Single Assignment
The LLVM Team
The LLVM Compiler Infrastructure
Last modified: $Date: 2006/11/20 07:27:32 $