460d19f56c
compiler.tree: fewer namespace lookups.
2013-03-21 19:36:07 -07:00
b8097f9221
compiler: cleaner use of sets.
2013-03-10 17:21:27 -07:00
bf35114fec
compiler: use hash-sets to track visited sets.
2013-03-08 11:04:47 -08:00
51c033a1f6
Fix all failures in the linux64 build email
2011-10-24 19:33:09 -07:00
434605c0b5
Changing some uses of prune to use members
2010-02-27 13:14:03 -05:00
7074979745
Moving new-sets to sets
2010-02-26 16:01:01 -05:00
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
8a9c15ab0b
compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration
2009-08-09 16:29:21 -05:00
fb6df472a2
Cleaning up USING: lists for new strict semantics
2009-05-14 16:54:16 -05:00
05f3f9dcb9
Fixing unit tests for stack effect inference changes
2009-04-20 21:15:19 -05:00
6b25e99470
Add summary for heaps more vocabs
2009-02-16 21:05:13 -06:00
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
7fc13ef03c
dlists no longer have a length slot; tweak dlist code so that types infer better
2008-11-16 05:53:25 -06:00
26f309d2ae
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
c19f2257f4
Fix permission bits
2008-10-02 08:34:49 -05:00
10c68ebb21
New modular arithmetic optimization pass
2008-09-12 18:08:38 -05:00
40da49bef5
Perform loop detection before normalization, clean up normalization pass, more aggressive recursive return value propagation. Fixes regression on nsieve benchmark
2008-09-12 05:17:27 -05:00
40e926609a
Fixing unit tests
2008-08-22 22:07:59 -05:00
aa9341e579
Enforce that usages of >r/r> must be balanced within a quotation
2008-08-18 20:49:03 -05:00
e1987d4af9
Debugging new optimizer
2008-08-14 23:35:19 -05:00
a61e13f7be
More aggressive DCE
2008-08-13 23:52:49 -05:00
f2a5a30c6f
New front-end and high-level optimizer lands
2008-08-12 03:22:45 -05:00
John Benediktsson
Doug Coleman
Daniel Ehrenberg
Slava Pestov