Andy Wingo 153ca1d239 peval: more strict accounting ... * module/language/tree-il/optimize.scm (transfer!, make-nested-counter): (make-recursive-counter, peval): Limit the algorithm's time to be strictly O(N) by transferring effort and size counters of recursive inlining attempts from containing counters. * test-suite/tests/tree-il.test ("partial evaluation"): Update expectations for the ((lambda (x) (x x)) (lambda (x) (x x))) case, as the new accounting policy will cause the entire inlining attempt to abort.		2011-09-27 00:21:16 +02:00
..
analyze.scm	Use (ice-9 match) instead of `record-case' where it improves readability.	2011-09-06 00:18:36 +02:00
compile-glil.scm	fix invalid transformation of (values x) -> x, (+ x) -> x, etc	2011-06-17 19:42:55 +02:00
fix-letrec.scm	fix-letrec tweaks	2011-03-09 22:38:11 +01:00
inline.scm	Add a partial evaluator for use in the compiler.	2011-09-09 00:05:34 +02:00
optimize.scm	peval: more strict accounting	2011-09-27 00:21:16 +02:00
primitives.scm	prevent propagation for memory-dependent operations like `car'	2011-09-23 18:02:05 +02:00
spec.scm	remove `version' field from <language>	2010-05-02 11:19:13 +02:00