factor/basis/compiler/tree/escape-analysis
Slava Pestov 145b635eb6 More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser
- new map-flat combinator replaces usages of 'map flatten' in compiler
- compiler.tree.def-use.simplified uses an explicit accumulator instead of flatten
- compiler.tree.tuple-unboxing uses an explicit accumulator instead of flatten
- fix inlining regression from last time: custom inlining results would sometimes be discarded
- compiler.tree's 3each and 3map combinators rewritten to not use flip
- rewrite math.partial-dispatch without locals (purely stylistic, no performance increase)
- hand-optimize flip for common arrays-of-arrays case
- don't run escape analysis and tuple unboxing if there are no allocations in the IR
2008-12-06 11:17:19 -06:00
..
allocations Stack checker cleanup and optimization 2008-11-13 00:07:45 -06:00
branches More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
check More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
nodes New front-end and high-level optimizer lands 2008-08-12 03:22:45 -05:00
recursive Updating code for make and fry changes 2008-09-10 22:11:40 -05:00
simple Update for compiler.intrinsics removal 2008-10-20 20:40:36 -05:00
escape-analysis-tests.factor Update unit test 2008-11-11 08:50:30 -06:00
escape-analysis.factor Fix conflict 2008-08-27 05:52:38 -05:00