[pypy-svn] r74299 - pypy/extradoc/planning

[cfbolz at codespeak.net]

Author: cfbolz
Date: Fri Apr 30 20:33:28 2010
New Revision: 74299

Modified:
   pypy/extradoc/planning/jit.txt
Log:
(arigo, cfbolz): some things we came up with in the pub


Modified: pypy/extradoc/planning/jit.txt
==============================================================================
--- pypy/extradoc/planning/jit.txt	(original)
+++ pypy/extradoc/planning/jit.txt	Fri Apr 30 20:33:28 2010
@@ -1,14 +1,27 @@
+NEW TASKS
+---------
+
+- look at assembler-assembler calls again: if the inner function is traced
+  after the outer one, the call is slow. other cases could be faster too,
+  probably.
+
+- have benchmarks for jit compile time and jit memory usage
+
+- trace into functions even if they have a loop. only if the loop is actually
+  hit, a residual portal call is produced
+
+- generators are not really fast – maybe add a JUMP_ABSOLUTE_GENERATOR that
+  does not call can_enter_jit after an iteration in which there was a yield.
+  obviously.
+
+
 TASKS
 -----
 
-- sort out a benchmark infrastructure. graphs!
-
 - think about code memory management
 
 - forcing virtualizables should only force fields affected, not everything
 
-- compress resume data (?)
-
 - think out looking into functions or not, based on arguments,
   for example contains__Tuple should be unrolled if tuple is of constant
   length. HARD, blocked by the fact that we don't know constants soon enough