steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
factor/basis/compiler/tree
History
Slava Pestov 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
..
builder Stack checker cleanup and optimization 2008-11-13 00:07:45 -06:00
checker 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
cleanup Tweak grouping code for better method inlining 2008-11-11 12:11:13 -06:00
combinators CFG IR is now pure SSA 2008-10-20 01:56:28 -05:00
comparisons New front-end and high-level optimizer lands 2008-08-12 03:22:45 -05:00
dead-code 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
debugger Fix nodes>quot 2008-11-11 19:51:12 -06:00
def-use 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
escape-analysis Stack checker cleanup and optimization 2008-11-13 00:07:45 -06:00
finalization 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
identities 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
late-optimizations New modular arithmetic optimization pass 2008-09-12 18:08:38 -05:00
modular-arithmetic Cleanup 2008-11-03 00:03:22 -06:00
normalization 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
optimizer New modular arithmetic optimization pass 2008-09-12 18:08:38 -05:00
propagation Remove duplicated logic 2008-11-11 09:10:33 -06:00
recursive Fix loop detection bug 2008-10-02 01:17:45 -05:00
tuple-unboxing 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
authors.txt New front-end and high-level optimizer lands 2008-08-12 03:22:45 -05:00
summary.txt New front-end and high-level optimizer lands 2008-08-12 03:22:45 -05:00
tree.factor 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