Slava Pestov 78f8d02ed4 compiler.tree.modular-arithmetic: eliminate >bignum calls where possible, convert fixnum-shift to fixnum-shift-fast if shift count is positive, don't run if there are no modular values		2009-08-20 03:47:45 -05:00
..
builder	…
checker	…
cleanup	compiler.tree.propagation: remove method inlining heuristic	2009-08-17 22:29:05 -05:00
combinators	…
comparisons	…
dead-code	…
debugger	compiler.tree.modular-arithmetic: stronger optimization handles > 1 usages case as well as values defined and used in loops. Eliminates 5 out of 8 >fixnum calls in benchmark.yuv-to-rgb	2009-08-15 18:42:41 -05:00
def-use	compiler.tree.modular-arithmetic: stronger optimization handles > 1 usages case as well as values defined and used in loops. Eliminates 5 out of 8 >fixnum calls in benchmark.yuv-to-rgb	2009-08-15 18:42:41 -05:00
escape-analysis	…
finalization	compiler: inline singleton predicates, and optimize predicate engines, reduces terrain demo deployed size by ~20kb	2009-08-17 23:59:24 -05:00
identities	…
late-optimizations	…
modular-arithmetic	compiler.tree.modular-arithmetic: eliminate >bignum calls where possible, convert fixnum-shift to fixnum-shift-fast if shift count is positive, don't run if there are no modular values	2009-08-20 03:47:45 -05:00
normalization	…
optimizer	…
propagation	compiler.tree.propagation: bitand custom inlining was wrong if the second input was a bignum	2009-08-20 03:47:07 -05:00
recursive	…
tuple-unboxing	…
authors.txt	…
summary.txt	…
tree.factor	…