Author: Carl Friedrich Bolz <cfb...@gmx.de> Branch: extradoc Changeset: r3709:2a5daf1aadc6 Date: 2011-06-16 17:28 +0200 http://bitbucket.org/pypy/extradoc/changeset/2a5daf1aadc6/
Log: clarify and stress things diff --git a/talk/iwtc11/paper.tex b/talk/iwtc11/paper.tex --- a/talk/iwtc11/paper.tex +++ b/talk/iwtc11/paper.tex @@ -246,14 +246,15 @@ the peeled-off iteration. Thus the addition is only executed in the first iteration, while the result is reused in all further iterations. -This scheme is quite powerful. It allows simple linear optimization passes to +This scheme is quite powerful and generalizes to other optimizations than just +common subexpression elimination. It allows simple linear optimization passes to perform loop-aware optimizations, such as loop-invariant code motion without changing them at all. All that is needed is to peel off one iteration, then apply simple one-pass optimizations and make sure that the necessary extra arguments are inserted into the label of the loop itself and the jumps -afterwards. The peeling off of one iteration gives the optimization enough -context to remove operations from the peeled loop, because the optimization -detects that the operation was performed in the preamble already. +afterwards. Giving the optimizations two iterations together +gives the optimization enough context to remove operations from the peeled loop, +because it detects that the operation was performed in the preamble already. % section Motivation (end) _______________________________________________ pypy-commit mailing list pypy-commit@python.org http://mail.python.org/mailman/listinfo/pypy-commit
