第10章 机器无关优化.pptVIP

Chapter 10 Optimization Code Optimization and Phases Quicksort in C Partition in Three-Address Code Partition Flow Graph Local Common Subexpressions Global Common Subexpressions Copy Propagation Assignments of the form f := g are called copy statements (or copies) The idea behind copy propagation is to use g for f whenever possible after such a statement For example, applied to block B5 of the previous flow graph, we obtain: x := t3 a[t2] := t5 a[t4] := t3 goto B2 Copy propagation often turns the copy statement into dead code Dead-Code Elimination Dead code includes code that can never be reac