lyon.fr

Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several opti-mizations and is mandatory during the code-generation phase. Two drawbacks of conventional liveness analy-ses are that their computations are fairly expensive and their results are easily invalidated by program transfor-mations. We present a method to check liveness of variables that overcomes both obstacles. The major advantage of the proposed method is that the analysis result sur-vives all program transformations except for changes in the control-flow graph. For common program sizes our technique is faster and consumes less memory than conventional data-flow approaches. Thereby, we heav-ily make use of SSA-form properties, which allow us to completely circumvent data-flow equation solving. We evaluate the competitiveness of our approach in an industrial strength compiler. Our measurements use the integer part of the SPEC2000 benchmarks and in-vestigate the liveness analysis used by the SSA destruc-tion pass. We compare the net time spent in liveness computations of our implementation against the one provided by that compiler. The results show that in the vast majority of cases our algorithm, while providing the same quality of information, needs less time: an av-erage speed-up of 16%