Slava Pestov 2de6ab9e21 compiler.cfg.linear-scan: fix tests for hash order		2009-09-27 23:35:56 -05:00
..
allocation	compiler.cfg.linear-scan: tweak it so that register allocation does not depend on hashing order	2009-09-27 23:29:48 -05:00
assignment	compiler.cfg.linear-scan: fix partial sync point logic in case where dst == src, and clean up spilling code	2009-09-27 19:28:20 -05:00
debugger	compiler.cfg.linear-scan now supports partial sync-points where all registers are spilled; taking advantage of this, there are new trigonometric intrinsics which yield a 2x performance boost on benchmark.struct-arrays and a 25% boost on benchmark.partial-sums	2009-08-30 04:52:01 -05:00
live-intervals	compiler.cfg.linear-scan.live-intervals: dead-value-error is never thrown anymore	2009-08-30 05:15:18 -05:00
numbering	compiler.cfg.linearization.order: basic blocks were being inserted twice if some blocks had repeated successors, causing problems for register allocation	2009-09-22 03:19:23 -05:00
resolve	compiler.cfg.linear-scan: fix partial sync point logic in case where dst == src, and clean up spilling code	2009-09-27 19:28:20 -05:00
linear-scan-tests.factor	compiler.cfg.linear-scan: fix tests for hash order	2009-09-27 23:35:56 -05:00
linear-scan.factor	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
summary.txt	Add summary for heaps more vocabs	2009-02-16 21:05:13 -06:00