 |
- ... binaries2.1
- BugScan is an example of a company that
has implemented "buffer iteration" detection but hasn't talked publically about it.
http://www.logiclibrary.com
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...
loops3.1
- A good article about loop optimization and compiler
optimization is
http://www.cs.princeton.edu/courses/archive/spring03/cs320/notes/loops.pdf
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...
loop3.2
- Irreducible loops are defined as "loops with multiple
entry [points]"
(http://portal.acm.org/citation.cfm?id=236114.236115)
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ... loop3.3
- Reducible loops are defined as "loops with
one entry [point]"
(http://portal.acm.org/citation.cfm?id=236114.236115)
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ... loops3.4
- A natural loop "Has a
single entry point. The header dominates all nodes in the loop."
(http://www-2.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15745-s03/public/lectures/L7_handouts.pdf
all loops are not natural loops
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ... loop3.5
- It is important
to note that it is next that it is next to impossible to reproduce #_#>F:fig2) without
using nested for loops and goto's statements. For this reason it is rare that
the reader will see an example of this in a binary. However, it is possible therefore the author
thought it important to mention.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
|
