John Benediktsson
|
bb673c72d0
|
compiler: use hash-sets to track visited sets.
|
2013-03-08 11:04:47 -08:00 |
Slava Pestov
|
9b130730b6
|
compiler.cfg.representations: add more peephole optimizations to reduce fixnum tagging and untagging overhead
|
2010-05-03 17:34:11 -04:00 |
Daniel Ehrenberg
|
0f0571e48a
|
Moving new-sets to sets
|
2010-02-26 16:01:01 -05:00 |
|
Daniel Ehrenberg
|
54389b5e5c
|
Write barriers are hoisted out of loops when their target is slot-available
|
2009-08-13 20:26:44 -05:00 |
|
Slava Pestov
|
88d15dfbea
|
compiler.cfg: new system to track when results of analyses need to be recomputed (reverse post order, linear order, predecessors, dominance, loops). Passes can now call needs-predecessors, needs-dominance, needs-loops at the beginning, and cfg-changed, predecessors-changd at the end. Linearization order now takes loop nesting into account, and linear scan now uses linearization order instead of RPO.
|
2009-08-08 20:02:56 -05:00 |
|
Slava Pestov
|
4921b819e0
|
compiler.cfg.representations: new pass to make global unboxing decisions, relies on new compiler.cfg.loop-detection pass for loop nesting information
|
2009-08-08 00:24:46 -05:00 |