编译原理(第2版)优化和生成review精选.pptVIP

Code optimization Optimization is the process of transforming a piece of code to make it more efficient (either in terms of time or space) without changing its output or side-effects. The only difference visible to the code’s user should be that it runs faster and/or consumes less memory. Code optimization Optimization is the field where most compiler research is done today. High-quality optimization is more of an art than a science. Many optimization problems are NP-complete and thus most optimization algorithms rely on heuristics and approximations. It may be possible to come up with a case where a particular algorithm fails to produce better code or perhaps even makes it worse. However, the algorithms tend to do rather well overall. When and in what representation to optimize There are a variety of tactics for attacking optimization. Some techniques are applied to the intermediate code, Others are applied as part of final code generation—choosing which instructions to emit, how to allocate registers … And still other optimizations may occur after final code generation, attempting to re-work the assembly code itself into something more efficient. Optimization can be very complex and time-consuming; it often involves multiple sub-phases, some of which are applied more than once. Most compilers allow optimization to be turned off to speed up compilation (gcc even has specific flags to turn on and off individual optimizations). Code optimization Local optimizations Optimizations performed exclusively within a basic block are called “local optimizations”. Code motion Code motion (also called code hoisting) unifies sequences of code common to one or more basic blocks to reduce code size and potentially avoid expensive re-evaluation. The most common form of code motion is loop-invariant code motion that moves statements that evaluate to the same value every iteration of the loop to somewhere outside the loop. Global optimizations Local optimiza