search for: strongphieliminination

...ion inserts a copy from r3 to a temp register r99 based on the algorithm in [2]. Block 3 then becomes Block 3 r3 = phi(r1, r4) r99 = r3 r4 = ... r3 = r4 if (...) goto Block 3 else (...) goto Block 4 The Insert-copy algorithm in [2] would normally rename r3 in Block 4 to r99. But StrongPhiEliminination decides unify 'r5', 'r2' and 'r3' instead of inserting copies for 'r5=phi(r2, r3)' in Block 4, therefore the 'waiting' set for Block 4 is empty. 'r3' is not renamed to 'r99' in StrongPhiElimination. Then StrongPhiElimination proceeds to the r...