e0d1b14e5c
factor: don't need FROM: namespaces => set or namespaces:set anymore
2015-08-12 11:25:57 -05:00
06560b24a6
compiler.tree.escape-analysis.allocations: stub doc file from comments
2015-07-28 17:58:27 -07:00
c65877104e
compiler: cleanup usings.
2014-12-13 16:10:21 -08:00
460d19f56c
compiler.tree: fewer namespace lookups.
2013-03-21 19:36:07 -07:00
7da4a74588
compiler: fewer namespace lookups.
2013-03-21 19:11:20 -07:00
499778d808
compiler.tree.escape-analysis.allocations: simplify stack effect.
2011-09-17 08:14:13 -07:00
7074979745
Moving new-sets to sets
2010-02-26 16:01:01 -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
6b25e99470
Add summary for heaps more vocabs
2009-02-16 21:05:13 -06:00
5bae69426d
Stack checker cleanup and optimization
...
- stack-checker.state vocabulary split up into stack-checker.{state,values,recursive-state}
- code that modifies and searches recursive state factored out into stack-checker.recursive-state
- recursive state is now a set of three binary hash trees instead of an alist, and no longer contains unnecessary data
- binary hash trees are in stack-checker.recursive-state.tree: unbalanced, persistent
- ~8 second speedup on bootstrap, ~20 second speedup in "peg.javascript" require
2008-11-13 00:07:45 -06:00
6717d3743e
Fix escape analysis bug; speedup on fib4 benchmark
2008-08-31 09:03:03 -05:00
4f82ebdc23
DCE work in progress
2008-08-13 14:17:04 -05:00
f2a5a30c6f
New front-end and high-level optimizer lands
2008-08-12 03:22:45 -05:00
Doug Coleman
Björn Lindqvist
John Benediktsson
Daniel Ehrenberg
Slava Pestov