Sparse Conditional Constant Propagation

Eliminates unused edges from the Scribble CFG
Performs constant folding
Replaces constant value expressions with constant value
Evaluate expressions with global variables

The Sprse Conditional Constant optimization is based on algorithm by Mark N. Wegman and F. Kennith Zadeck. The optimization eliminates never used sub-graphs of the Scribble CFG. For example, in the following code the programmer uses the DOTHING parameter to select which parts of the program will be utilized:

      PARAMETER DOTHING = .FALSE.
      ...
      IF (DOTHING) THEN
      ...
      END IF

M.N. Wegman, F.K. Zadeck, "Constant Propagation with Conditional Branches", ACM Transactions on Programming Languages and Systems, Vol. 13, No. 2, April 1991, Pages 181-210.

Return to Scale home page.
(Last changed: March 21, 2007.)