Daniel Ehrenberg
|
0f0571e48a
|
Moving new-sets to sets
|
2010-02-26 16:01:01 -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
|
31caa7af2f
|
compiler.cfg.ssa.construction: Use TDMSC algorithm to compute Phi placement
|
2009-07-28 11:16:10 -05:00 |
|
Slava Pestov
|
83d40198a4
|
compiler.cfg.coalescing: more or less complete, now needs debugging
|
2009-07-27 02:20:45 -05:00 |
|
Slava Pestov
|
d7f12feb64
|
compiler.cfg.coalescing: more work done
|
2009-07-27 00:31:21 -05:00 |
|
Slava Pestov
|
6f37596113
|
compiler.cfg.dominance: add pre order and max pre order numbers; use them to implement dominates? check
|
2009-07-26 21:10:05 -05:00 |
Slava Pestov
|
898ac710fa
|
compiler.cfg.dominance: add algorithm for computing iterated dominance frontiers
|
2009-07-22 06:07:51 -05:00 |
|
Slava Pestov
|
9b3c593332
|
compiler.cfg.ssa: Cytron's SSA construction algorithm
|
2009-07-21 17:49:30 -05:00 |
|
Slava Pestov
|
907e752319
|
compiler.cfg.dominance: fix idom computation, compute dominator tree, compute dominance frontiers, add some tests
|
2009-07-21 03:02:45 -05:00 |
|
Slava Pestov
|
25805f9bfe
|
Refactoring low-level optimizer to support stack analysis pass
|
2009-05-26 19:31:19 -05:00 |
|
Slava Pestov
|
873bb49849
|
Working on global optimizations
|
2009-05-19 17:28:13 -05:00 |