[pypy-svn] r60597 - pypy/extradoc/talk/ecoop2009
cfbolz at codespeak.net
cfbolz at codespeak.net
Fri Dec 19 16:11:34 CET 2008
Author: cfbolz
Date: Fri Dec 19 16:11:33 2008
New Revision: 60597
Modified:
pypy/extradoc/talk/ecoop2009/jitgen.tex
pypy/extradoc/talk/ecoop2009/main.bbl
pypy/extradoc/talk/ecoop2009/rainbow.tex
Log:
kill a now-unnecessary section
Modified: pypy/extradoc/talk/ecoop2009/jitgen.tex
==============================================================================
--- pypy/extradoc/talk/ecoop2009/jitgen.tex (original)
+++ pypy/extradoc/talk/ecoop2009/jitgen.tex Fri Dec 19 16:11:33 2008
@@ -149,33 +149,9 @@
XXX write something about the problems of classical PE?
-\subsection{Partial Evaluation in PyPy}
-
-
-PyPy contains a framework for generating just-in-time compilers using
-off-line partial evaluation. As such, there are three distinct phases:
-
-\begin{itemize}
-\item \emph{Translation time:} during the normal translation of an RPython
-program, say the TLC interpreter, we perform binding-time analysis on the
-interpreter. This produces a generating extension, which is linked with the
-rest of the program. \cfbolz{XXX not quite right}
-
-\item \emph{Compile time:} during the execution of the program, when a new
-bytecode is about to be interpreted, the generating extension is invoked
-instead. As the generating extension is a compiler, all the computations it
-performs are called compile-time computations. Its sole effect is to produce
-residual code.
-
-\item \emph{Run time:} the normal execution of the program (which includes the
-time spent running the residual code created by the generating extension).
-\end{itemize}
-
-Translation time is a purely off-line phase; compile time and run time are
-actually highly interleaved during the execution of the program.
-
-\subsection{Binding Time Analysis}
+\subsection{Binding Time Analysis in PyPy}
+XXX need better transition text from last section
At translation time, PyPy performs binding-time analysis of the source
RPython program after it has been turned to low-level graphs, i.e. at
the level at which operations manipulate pointer-and-structure-like
Modified: pypy/extradoc/talk/ecoop2009/main.bbl
==============================================================================
--- pypy/extradoc/talk/ecoop2009/main.bbl (original)
+++ pypy/extradoc/talk/ecoop2009/main.bbl Fri Dec 19 16:11:33 2008
@@ -11,7 +11,8 @@
\bibitem{BolzEtAl08}
C.~F. Bolz, A.~Kuhn, A.~Lienhard, N.~D. Matsakis, O.~Nierstrasz, L.~Renggli,
A.~Rigo, and T.~Verwaest.
-\newblock Back to the future in one week - implementing a smalltalk vm in pypy.
+\newblock Back to the future in one week - implementing a smalltalk vm in
+ {P}y{P}y.
\newblock In {\em Self-Sustaining Systems, First Workshop, S3 2008, Potsdam,
Revised Selected Papers}, volume 5146 of {\em Lecture Notes in Computer
Science}, pages 123--139, 2008.
@@ -21,6 +22,13 @@
\newblock Partial evaluation of computation process, revisited.
\newblock {\em Higher Order Symbol. Comput.}, 12(4):377--380, 1999.
+\bibitem{hoelzle_optimizing_1991}
+Urs H{\"o}lzle, Craig Chambers, and David Ungar.
+\newblock Optimizing dynamically-typed object-oriented languages with
+ polymorphic inline caches.
+\newblock In {\em Proceedings of the European Conference on Object-Oriented
+ Programming}, pages 21--38. Springer-Verlag, 1991.
+
\bibitem{RigoPedroni06}
A.~Rigo and S.~Pedroni.
\newblock Py{P}y's approach to virtual machine construction.
Modified: pypy/extradoc/talk/ecoop2009/rainbow.tex
==============================================================================
--- pypy/extradoc/talk/ecoop2009/rainbow.tex (original)
+++ pypy/extradoc/talk/ecoop2009/rainbow.tex Fri Dec 19 16:11:33 2008
@@ -23,6 +23,7 @@
TODO
\section{Promotion}
+\label{sec:promotion}
In the sequel, we describe in more details one of the main new
techniques introduced in our approach, which we call \emph{promotion}. In
@@ -164,13 +165,9 @@
Virtual structures still avoid the run-time allocation of most
short-lived objects, even in non-trivial situations. The following
-example shows a typical case. XXX use TLC example
-
-
-The PyPy Python interpreter
-implements application-level integers as boxes – instances of a
-\texttt{W\_IntObject} class with a single \texttt{intval} field. Here is the
-addition of two integers:
+example shows a typical case. The TLC interpreter implements application-level
+integers as boxes – instances of an \texttt{IntObject} class with a single
+field.
XXX needs to use TLC examples
\begin{verbatim}
More information about the Pypy-commit
mailing list