6 Commits (72fdb8c5fb0c6a1aa7d1c4fa8a9314dbddefbbf0)

Author	SHA1	Message	Date
Doug Coleman	51c033a1f6	Fix all failures in the linux64 build email	2011-10-24 19:33:09 -07:00
Daniel Ehrenberg	7074979745	Moving new-sets to sets	2010-02-26 16:01:01 -05:00
Slava Pestov	5297be3e19	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
Slava Pestov	6b25e99470	Add summary for heaps more vocabs	2009-02-16 21:05:13 -06:00
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
Slava Pestov	10c68ebb21	New modular arithmetic optimization pass	2008-09-12 18:08:38 -05:00