Strength reduction via SSAPRE

Abstract

We present techniques that allow strength reduction to be performed concurrently with partial redundancy elimination in the SSAPRE framework. By sharing the characteristics inherent to SSAPRE, the resulting strength reduction algorithm exhibits many interesting attributes. We compare various aspects of the new strength reduction algorithm with previous strength reduction algorithms. We also outline and discuss our implementation of the closely related linear function test replacement optimization under the same framework. Keywords. Code motion, data flow analysis, dead code elimination, induction variables, linear function test replacement, partial redundancy elimination, program optimization, program analysis, program transformation, static single assignment, strength reduction.