factor/basis/compiler/tree
Slava Pestov a56d480aa6 Various optimizations leading to a 10% speedup on compiling empty EBNF parser:
- open-code getenv primitive
- inline tuple predicates in finalization
- faster partial dispatch
- faster built-in type predicates
- faster tuple predicates
- faster lo-tag dispatch
- compile V{ } clone and H{ } clone more efficiently
- add fixnum fast-path to =; avoid indirect branch if two fixnums not eq
- faster >alist on hashtables
2008-12-06 09:16:29 -06:00
..
builder Local DCE 2008-12-04 06:02:49 -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 Removing more >r/r> usages 2008-12-03 08:46:16 -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 Removing more >r/r> usages 2008-12-03 08:46:16 -06:00
debugger optimized. now accepts method-specs 2008-12-03 10:44:21 -06:00
def-use dlists no longer have a length slot; tweak dlist code so that types infer better 2008-11-16 05:53:25 -06:00
escape-analysis Stack checker cleanup and optimization 2008-11-13 00:07:45 -06:00
finalization Various optimizations leading to a 10% speedup on compiling empty EBNF parser: 2008-12-06 09:16:29 -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 Removing more >r/r> usages 2008-12-03 08:46:16 -06:00
optimizer New modular arithmetic optimization pass 2008-09-12 18:08:38 -05:00
propagation Various optimizations leading to a 10% speedup on compiling empty EBNF parser: 2008-12-06 09:16:29 -06:00
recursive dlists no longer have a length slot; tweak dlist code so that types infer better 2008-11-16 05:53:25 -06: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