Author: Carl Friedrich Bolz <cfb...@gmx.de>
Branch: extradoc
Changeset: r3713:c6e63120e677
Date: 2011-06-16 18:33 +0200
http://bitbucket.org/pypy/extradoc/changeset/c6e63120e677/
Log: make clear that we don't claim novelty
diff --git a/talk/iwtc11/paper.tex b/talk/iwtc11/paper.tex
--- a/talk/iwtc11/paper.tex
+++ b/talk/iwtc11/paper.tex
@@ -155,11 +155,15 @@
as a more global view of a trace needs to be considered when optimizing.
In this paper we want to address this problem by proposing a simple scheme that
-makes it possible to turn simple optimizations using one forward pass into
+makes it possible to turn optimizations using one forward pass into
optimizations that can do loop invariant code motion and similar loop-aware
improvements. Using this scheme one does not need to change the underlying
optimization much to get these advantages.
+The resulting optimizations one gets using this scheme are in no way novel,
most
+of them are well-known loop optimizations. However, the way to implement them
is
+a lot simpler than directly implementing loop-aware optimizations.
+
XXX "bridge" is not a standard term
XXX loop peeling does a lot more than loop-invariant code motion
@@ -427,7 +431,7 @@
XXX find reference of prior work on this
Loop peeling is achieved by appending an copy of the traced iteration at
-the end of itselfe. See Figure~\ref{fig:overview} for an illustration.
+the end of itself. See Figure~\ref{fig:overview} for an illustration.
The first part (called \emph{preamble}) finishes with the jump the the second
part
(called the \emph{peeled loop}). The second part end with the jump to itself.
This way
the preamble will be executed only once while the peeled loop will
_______________________________________________
pypy-commit mailing list
pypy-commit@python.org
http://mail.python.org/mailman/listinfo/pypy-commit
