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
..
branches	Trying to make PEGs compile faster by reducing the number of low level IR nodes: merge functionality of #>r and #r> into #shuffle, and generate 1 node instead of 3 for calls to get-local	2008-11-11 18:46:31 -06:00
liveness	More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser	2008-12-06 11:17:19 -06:00
recursive	Found a place to use the locals in literals feature	2008-09-13 04:43:29 -05:00
simple	Trying to make PEGs compile faster by reducing the number of low level IR nodes: merge functionality of #>r and #r> into #shuffle, and generate 1 node instead of 3 for calls to get-local	2008-11-11 18:46:31 -06:00
dead-code-tests.factor	Removing more >r/r> usages	2008-12-03 08:46:16 -06:00
dead-code.factor	More DCE work	2008-08-13 18:56:50 -05:00