Optimal and Heuristic Global Code Motion for Minimal Spilling [chapter]

Gergö Barany, Andreas Krall
2013 Lecture Notes in Computer Science  
The interaction of register allocation and instruction scheduling is a well-studied problem: Certain ways of arranging instructions within basic blocks reduce overlaps of live ranges, leading to the insertion of less costly spill code. However, there is little previous research on the extension of this problem to global code motion, i .e., the motion of instructions between blocks. We present an algorithm that models global code motion as an optimization problem with the goal of minimizing
more » ... aps between live ranges in order to minimize spill code. Our approach analyzes the program to identify the live range overlaps for all possible placements of instructions in basic blocks and all orderings of instructions within blocks. Using this information, we formulate an optimization problem to determine code motions and partial local schedules that minimize the overall cost of live range overlaps. We evaluate solutions of this optimization problem using integer linear programming, where feasible, and a simple greedy heuristic. We conclude that global code motion with the sole goal of avoiding spills rarely leads to performance improvements because code is placed too conservatively. On the other hand, purely local optimal instruction scheduling for minimal spilling is eective at improving performance when compared to a heuristic scheduler for minimal register use. AUse−AUseBlock, BUse−BUseBlock], record_blame(A, B, blame(placement(Placement))). Fig. 3. Overlap analysis for virtual registers A and B
doi:10.1007/978-3-642-37051-9_2 fatcat:e7shltqv2fc2lgv3dnvyt6p6ui