Global code motion/global value numbering
Cliff Click · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1995
We believe that optimizing compilers should treat the machine-independent optimizations (e.g., conditional constant propagation, global value numbering) and code motion issues separately.’ Removing the code motion requirements from the machine-independent optimization allows stronger optimizations using simpler algorithms. Preserving a legal schedule is one of the prime sources of complexity in algorithms like PRE [18, 13] or global congruence finding [2, 20].
Cited by 109 works. doi:10.1145/207110.207154
Authors
References
- Compilers: Principles, Techniques, and Tools
- Computer methods for mathematical computations
- The program dependence graph and its use in optimization
- Register allocation & spilling via graph coloring
- Programming languages and their compilers: Preliminary notes
- Register allocation & spilling via graph coloring
- A fast algorithm for finding dominators in a flowgraph
- Constant propagation with conditional branches
- An efficient method of computing static single assignment form
- Global optimization by suppression of partial redundancies