Author: Maciej Fijalkowski <[email protected]>
Branch: extradoc
Changeset: r3676:c2db221500eb
Date: 2011-06-14 19:50 +0200
http://bitbucket.org/pypy/extradoc/changeset/c2db221500eb/
Log: spellchecker
diff --git a/talk/iwtc11/paper.tex b/talk/iwtc11/paper.tex
--- a/talk/iwtc11/paper.tex
+++ b/talk/iwtc11/paper.tex
@@ -301,7 +301,7 @@
Loop peeling is achieved by appending a copy of the traced iteration at
the end of the loop. The copy is inlined to make the two parts form a
-consitant two iteration trace.
+consistent two iteration trace.
The first part (called preamble) finishes with the jump the the second part
(called peeled loop). The second part ends up with the jump to itself. This way
the preamble will be executed only once while the peeled loop will
@@ -360,7 +360,7 @@
jump operation. The jump operation contains a vector of jump variables,
$J=\left(J_1, J_2, \cdots, J_{|J|}\right)$, that are passed as the input
variables of the target loop. After
loop peeling there will be a second copy of this trace with input
-variables equal to the jump arguments of the pereamble, $J$, and jump
+variables equal to the jump arguments of the preamble, $J$, and jump
arguments $K$. Looking back at our example we have
\begin{equation}
%\left\{
@@ -450,7 +450,7 @@
\subsection{Heap Caching}
-XXX gcc calles this store-sinking and I'm sure there are some
+XXX gcc calls this store-sinking and I'm sure there are some
references in the literature (none at hand though). This is a ``typical''
compiler optimization.
@@ -527,7 +527,7 @@
jump($l_1$, $p_{0}$, $p_{9}$, $i_3$, $i_8$)
\end{lstlisting}
-\subsection{Pure operation reusage}
+\subsection{Pure operation reuse}
If a pure operation appears more than once in the trace with same input
arguments, it only needs be executed the first time and then the result
can be reused for all other appearances. When that is combined with loop
@@ -754,7 +754,7 @@
connecting the peeled of iteration (the preamble) with the loop body. This
approach
turns standard optimizations such as redundant guard removal, heap
-caching, pure operation reusage and allocation removals into loop
+caching, pure operation reuse and allocation removals into loop
invariant code motion optimizations.
XXX: is ``loop body'' or ``peeled loop'' the preferable term?
_______________________________________________
pypy-commit mailing list
[email protected]
http://mail.python.org/mailman/listinfo/pypy-commit
