Pee Pole Optimization in compiler and its features are as follow:
-> No Redundant load and store.
-> No scenario like MovR0,A | MovA,R0
-> No unreachable code.
-> No jump over the jump.
-> Algebraic simplification
x=x*1 avoid
x=x+0 avoid
->Auto increment and decrement
-> No Redundant load and store.
-> No scenario like MovR0,A | MovA,R0
-> No unreachable code.
-> No jump over the jump.
-> Algebraic simplification
x=x*1 avoid
x=x+0 avoid
->Auto increment and decrement
Post a Comment