Peephole Optimization


Statement-by-statement code generation often produce redundant
instructions that can be optimize to save time and space requirement
of target program.
Examines a short sequence of target instructions in a window
(peephole) and replaces the instructions by a faster and/or shorter
sequence whenever possible.
Applied to intermediate code or target code
Typical optimizations:

Redundant instruction elimination
Flow-of-control optimizations
Algebraic simplifications
Use of machine idioms

0 comments:

Post a Comment

 
page