Eliminating Redundant Join-Set Computations in Static Single Assignment

The seminal algorithm developed by ron cytron, jeanne ferrante and colleagues in 1989 for the placement of φ-nodes in a control flow graph is still widely used in commercial compilers. placing φ-nodes is necessary when converting a program representation to static single assignment (ssa) form. this paper shows that if a variable x is defined in a set of basic blocks a(x), then the iterated join set of a(x) can be decomposed into the computation of the iterated join set of a disjoint collection of subsets of a(x). we use this result to show that some join set computations are redundant. we measured the number of redundant computations in the open research compiler (orc) in a selection of spec 2000 benchmarks.