Overview of Global Optimization

A globally optimizing compiler will perform the following operations:

  1. Perform interval analysis and compute the derived graphs.

  2. Order nodes using an ordering algorithm to find dominators.

  3. Find basic available and busy information for blocks.

  4. Solve boolean equations to get available and busy information for each block.

  5. Replace common subexpressions by corresponding compiler variables.

  6. Assign registers using graph coloring.

The information provided by data flow analysis provides a special-purpose proof that the optimized program is correct (produces the same answers).

Contents    Page-10    Prev    Next    Page+10    Index