John Benediktsson
|
b8097f9221
|
compiler: cleaner use of sets.
|
2013-03-10 17:21:27 -07:00 |
|
John Benediktsson
|
ac95c024f3
|
compiler.cfg.loop-detection: more use of hash-sets.
|
2013-03-10 10:06:48 -07:00 |
|
John Benediktsson
|
262a46a3f4
|
compiler.cfg.loop-detection: more use of hash-sets.
|
2013-03-08 12:38:50 -08:00 |
|
John Benediktsson
|
bf35114fec
|
compiler: use hash-sets to track visited sets.
|
2013-03-08 11:04:47 -08:00 |
Slava Pestov
|
456743a6ce
|
compiler.cfg.representations: add more peephole optimizations to reduce fixnum tagging and untagging overhead
|
2010-05-03 17:34:11 -04:00 |
Daniel Ehrenberg
|
7074979745
|
Moving new-sets to sets
|
2010-02-26 16:01:01 -05:00 |
|
Daniel Ehrenberg
|
8197d9356b
|
Write barriers are hoisted out of loops when their target is slot-available
|
2009-08-13 20:26:44 -05:00 |
|
Slava Pestov
|
d0c393aa60
|
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
|
e21ca289c3
|
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 |