Scribd
Upload
499 views14 pages

Peephole Optimization in Compilers

Peephole Optimization Techniques in Compiler Design Peephole optimization is a machine-dependent optimization technique performed on small segments of generated machine code. [1] It works by recognizing instruction sequences that can be replaced by shorter or faster sequences using techniques like constant folding, strength reduction, null sequence deletion, and algebraic laws. [2] The goal is to improve performance, reduce memory usage, and decrease code size. [3] Examples of replacement rules include using special case instructions, address modes, and strength reduction to replace slow operations with faster equivalents.

Uploaded by

Abu Shadat Shaikat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
499 views14 pages

Peephole Optimization in Compilers

Peephole Optimization Techniques in Compiler Design Peephole optimization is a machine-dependent optimization technique performed on small segments of generated machine code. [1] It works by recognizing instruction sequences that can be replaced by shorter or faster sequences using techniques like constant folding, strength reduction, null sequence deletion, and algebraic laws. [2] The goal is to improve performance, reduce memory usage, and decrease code size. [3] Examples of replacement rules include using special case instructions, address modes, and strength reduction to replace slow operations with faster equivalents.

Uploaded by

Abu Shadat Shaikat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Peephole Optimization Techniques

In Compiler Design

Anul Chaudhary
131CC00304
Contents

What is an Optimization

Types of Optimization Techniques

What is an Peephole Optimization

Replacement Rules

Example

Conclusion

References
2
What is Optimization?

Optimization is the process of transforming a


piece of code to make more efficient(either in
terms of time or space) without changing its
output or side-effects. The only difference
visible to the code’s user should be that it runs
faster and/or consumes less memory. It is really
a misnomer that the name implies you are
finding an “optimal” solution— in truth,
optimization aims to improve, not perfect, the
result.
Types of Optimization

Optimization can be categorized broadly into two types :


1. Machine Independent
2. Machine dependent
Machine-independent Optimization

The compiler takes in the intermediate code and transforms a


part of the code that does not involve any CPU registers
and/or absolute memory locations. For example
do {
item = 10;
value = value + item ;
} while(value<100);
This code involves repeated assignment of the identifier item,
which if we put this way:
Item = 10;
do
{
value = value + item ;
} while(value<100);
It should not only save the CPU cycles, but can be used
on any processor.
Machine-dependent Optimization

Machine-dependent optimization is done after the target


code has been generated and when the code is
transformed according to the target machine architecture.
It involves CPU registers and may have absolute memory
references rather than relative references. Machine-
dependent optimizers put efforts to take maximum
advantage of memory hierarchy.
Peephole Optimization
Peephole Optimization is a kind of optimization performed
over a very small set of instructions in a segment of
generated code. The set is called a "peephole" or a
"window". It works by recognizing sets of instructions that
can be replaced by shorter or faster sets of instructions.

Goals:
- improve performance
- reduce memory footprint
- reduce code size
Replacement Rules
Common techniques applied in peephole optimization:-
 Constant folding – Evaluate constant sub-expressions in
advance.
 Strength reduction– Replace slow operations with faster
equivalents.
 Null sequences – Delete useless operations.
 Combine operations – Replace several operations with one
equivalent.
 Algebraic laws – Use algebraic laws to simplify or reorder
instructions.
 Special case instructions – Use instructions designed for
special operand cases.
 Address mode operations – Use address modes to simplify
code.
Examples
“Advanced Compiler Techniques” Fall 2011
References
 https://en.wikipedia.org/wiki/Peephole_optimization
 http://www.iosrjournals.org/iosr-jce/papers/Vol9-
Issue4/N0948086.pdf?id=255
 https://class.coursera.org/compilers/lecture/76
Thank You

You might also like