编译原理课件PPT 第9章.pptVIP

1 2 3 4 6 5 7 8 9 void insert (m){ if m is not in loop { loop=loop ? {m}; push m onto stack }} Main( ) { Stack=empty; Loop={d}; Insert(n); While stack is not empty { pop m, the first element of stack, off stack; for each predecessor p of m do insert(p) } } Chapter 9 Code optimization  Section 3 Loops in flow graphs 4.Pre-Headers Move statements before the header Create a new block, preheader. It has only the header as successor,and all edges which formerly entered the header of L from outside L instead enter the preheader. Chapter 9 Code optimization  Se