[pypy-svn] r37091 - pypy/dist/pypy/translator/backendopt

[pedronis at codespeak.net]

Author: pedronis
Date: Sun Jan 21 15:32:30 2007
New Revision: 37091

Modified:
   pypy/dist/pypy/translator/backendopt/inline.py
Log:
with very large graphs (as produced by timeshifting) computing the  measure_median_execution_cost
becomes both pointless and very expensive.



Modified: pypy/dist/pypy/translator/backendopt/inline.py
==============================================================================
--- pypy/dist/pypy/translator/backendopt/inline.py	(original)
+++ pypy/dist/pypy/translator/backendopt/inline.py	Sun Jan 21 15:32:30 2007
@@ -575,8 +575,11 @@
 
 def inlining_heuristic(graph):
     # XXX ponderation factors?
+    count = static_instruction_count(graph)
+    if count >= 200:
+        return count
     return (0.9999 * measure_median_execution_cost(graph) +
-            static_instruction_count(graph))
+            count)
 
 
 def inlinable_static_callers(graphs):