10.3 Global Optimizations

Many global optimizations are analogous to local ones, but use data flow analysis to find optimizations between blocks. Even though we include them here, in global optimization, their payoff is greater when they also reduce the computations in a loop.

Redundant (Common) Subexpression Elimination

Global Constant Folding and Propagation

Dead Code Elimination

Conditional Pruning

Conditional Reordering

Assignment Elimination Due to Equality

GOTO Chasing

Array Temporary Elimination

Send questions and comments to: Karen Lemone