44092bf78d
compiler.tree.propagation.*: better to use 2array than the "cuter" /\ word
2015-09-22 08:51:05 +02:00
330c7ba156
factor: Removing SLOT: nth/at/global in favor of using change: at for tuple slots named ``at`` and change-at for hashtables.
...
Redo many FROM: and QUALIFIED: and using lists.
2015-08-12 08:49:02 -05:00
c65877104e
compiler: cleanup usings.
2014-12-13 16:10:21 -08:00
9d3a654443
namespaces: removing make-assoc in favor of explicit get's.
2014-04-24 09:16:14 -07:00
8c19602ae9
assocs: Add of and ?of. Change all the things at once! Fixes #701 .
2013-03-23 14:59:07 -07:00
42f4dc36b2
namespaces: Rename ``bind`` to ``with-variables``. Update a few places that called ``global [ ] with-variables`` to use ``with-global``.
2012-07-19 00:02:47 -07:00
bd4e920995
compiler.tree.propagation: fix scalability issue with constraints
2010-04-14 17:19:26 -07:00
0612bc6177
Factor source files should not be executable
2009-11-21 17:50:43 -06:00
7377c96a21
compiler.tree.propagation.branches: fix recent constraints change
2009-11-13 07:16:41 -06:00
720c412431
compiler.tree.propagation: fix bug in constraints that caused retain stack overflow
2009-11-13 03:22:57 -06:00
7afea4c0ea
compiler.tree.propagation: implementing missing case in branch constraints
2009-11-12 17:24:11 -06:00
366c341c5f
compiler.tree.propagation.branches: fix live-branches computation for #dispatch nodes
2009-10-10 00:23:50 -05:00
7cfc63af51
compiler.tree.propagation.branches: M: #phi propagate-around was unnecessary
2009-09-22 17:56:50 -05:00
6e936bdb05
Fixing failing unit tests in compiler.tree.propagation due to constraints
2009-09-22 16:01:14 -05:00
6b25e99470
Add summary for heaps more vocabs
2009-02-16 21:05:13 -06:00
3c408342ef
renaming: contain? -> any?, deep-contains? -> deep-any?, pad-left -> pad-head, pad-right -> pad-tail, trim-left -> trim-head, trim-right -> trim-tail
2009-01-29 22:19:07 -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
5f4b247072
Propagation pass now uses a stack of hashtables for predicated constraints instead of cloning a hashtable. New strategy for recursive propagation; now converges with fewer iterations. ~15 sec bootstrap time improvement
2008-11-11 08:49:00 -06:00
cf80dd122a
Updating code for make and fry changes
2008-09-10 22:11:40 -05:00
8c46a3d56f
Only annotate certain nodes ith value info
2008-08-24 14:02:33 -05:00
aa9341e579
Enforce that usages of >r/r> must be balanced within a quotation
2008-08-18 20:49:03 -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
Björn Lindqvist
Doug Coleman
John Benediktsson
Slava Pestov
Daniel Ehrenberg