| Compute the SSA form of the control flow graph and build FUD chains.
The SSA algorithm is from:
R. Cytron, J. Ferrante J, B. K. Rosen, M. N. Wegman, and F. K. Zadeck,
"Efficiently Computing Static Single Assignment Form and the Control
Dependence Graph", TOPLAS, 13(4): 451-490, October 1991.
I made modifications to the algorithm to compute FUD chains and to run the
algorithm separately for each variable similar to the SSAPRE algorithm.
Making a separate pass for each variable allows variables to be added
incrementally.
|