factor/basis/compiler/tree
Slava Pestov 60a1378a0a Faster dynamic variable lookup: 6% speedup in benchmark.fib5
- If type of first input of equal? is known but not second, rewrite it as swap equal? and try to inline again
- Fix hints on methods to work better
- Put hints for word and fixnum keys on at* and set-at on hashtables
2008-12-17 14:57:24 -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 More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
combinators More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
comparisons New front-end and high-level optimizer lands 2008-08-12 03:22:45 -05:00
dead-code Eliminate some usages of locals in compiler.tree.dead-code 2008-12-09 01:04:15 -06:00
debugger Add inc-at word to core, and update some usages of at+ to use it instead 2008-12-09 16:54:48 -06:00
def-use More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
escape-analysis More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -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 More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
optimizer More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
propagation Faster dynamic variable lookup: 6% speedup in benchmark.fib5 2008-12-17 14:57:24 -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 More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -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