The LLVM Lexicon

NOTE: This document is a work in progress!

Table Of Contents

- A - | |||||||
---|---|---|---|---|---|---|---|

ADCE | |||||||

- B - | |||||||

BURS | |||||||

- C - | |||||||

CSE | |||||||

- D - | |||||||

DSA | DSE | ||||||

- I - | |||||||

IPA | IPO | ||||||

- L - | |||||||

LCSSA | LICM | Load-VN | |||||

- P - | |||||||

PRE | |||||||

- R - | |||||||

Reassociation | |||||||

- S - | |||||||

SCC | SCCP | SRoA | SSA |

Definitions

**ADCE**- Aggressive Dead Code Elimination

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

**PRE**- Partial Redundancy Elimination

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

The LLVM Team

The LLVM Compiler Infrastructure

Last modified: $Date: 2006/11/20 07:27:32 $