资工系网媒所NEWS试验室-RSWiki.ppt

/15 資工系網媒所 NEWS實驗室 國立台灣大學 資訊工程學系 /15 薛智文 cwhsueh@.tw .tw/~cwhsueh/ 98 Spring Optimization (textbook ch# 9) * /15 * Introduction For some compiler, the intermediate code is a pseudo code of a virtual machine. Interpreter of the virtual machine is invoked to execute the intermediate code. No machine-dependent code generation is needed. Usually with great overhead. Example: Pascal: P-code for the virtual P machine. JAVA: Byte code for the virtual JAVA machine. Optimization. Machine-dependent issues. Machine-independent issues. * /15 * Machine-dependent Issues (1/2) Input and output formats: The formats of the intermediate code and the target program. Memory management: Alignment, indirect addressing, paging, segment, . . . Those you learned from your assembly language class. Instruction cost: Special machine instructions to speed up execution. Example: Increment by 1. Multiplying or dividing by 2. Bit-wise manipulation. Operators applied on a continuous block of memory space. Pick a fastest instruction combination for a certain target machine. * /15 * Machine-dependent Issues (2/2) Register allocation: in-between machine dependent and independent issues. C language allows the user to management a pool of registers. Some language leaves the task to compiler. Idea: save mostly used intermediate result in a register. However, finding an optimal solution for using a limited set of registers is NP-hard. Example: Heuristic solutions: similar to the ones used for the swapping problem. t := a + b load R0, a load R1, b add R0, R1 store R0, T load R0, a add R0, b store R0, T * /15 * Machine-independent Issues Dependence graphs. Basic blocks and flow graphs. Structure-preserving transformations. Algebraic transformations. Peephole optimization. * /15 * Dependence Graphs Issues: In an expression, assume its dependence graph is given. We can evaluate this expression using any topological ordering. There are many legal topological orderings. Pick one to increase