Doug Coleman
|
e0d1b14e5c
|
factor: don't need FROM: namespaces => set or namespaces:set anymore
|
2015-08-12 11:25:57 -05:00 |
John Benediktsson
|
9ec74563ba
|
compiler.cfg: use "f [ or ] reduce" instead of "map [ ] any?"
|
2015-07-21 09:54:44 -07:00 |
|
John Benediktsson
|
c65877104e
|
compiler: cleanup usings.
|
2014-12-13 16:10:21 -08:00 |
Björn Lindqvist
|
bfc0ef815b
|
compiler.cfg.dominance: fix for #1227, the dom children needs to be sorted to ensure that the same instruction sequence is generated every time
|
2014-12-11 14:30:47 +01:00 |
|
Björn Lindqvist
|
befbe0bb59
|
compiler.cfg.dominance: changed stack effect compute-dominance ( cfg -- cfg' ) to ( cfg -- )
|
2014-12-11 14:30:47 +01:00 |
|
Björn Lindqvist
|
e5866dfa80
|
compiler.cfg.*: changed stack effect of needs-predecessors from ( cfg -- cfg') to ( cfg -- )
|
2014-12-11 14:30:47 +01:00 |
|
Björn Lindqvist
|
76cb665a8d
|
compiler.cfg.dominance: change needs-dominance effect from ( cfg -- cfg') to ( cfg -- )
|
2014-12-11 14:30:46 +01:00 |
|
Björn Lindqvist
|
054982f24a
|
compiler.cfg.*: docs for compiler.cfg.dominance and compiler.cfg.ssa.construction
|
2014-12-11 14:30:46 +01:00 |
Daniel Ehrenberg
|
7074979745
|
Moving new-sets to sets
|
2010-02-26 16:01:01 -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
|
62fe308776
|
compiler.cfg.ssa.construction: Use TDMSC algorithm to compute Phi placement
|
2009-07-28 11:16:10 -05:00 |
|
Slava Pestov
|
ba696b68b8
|
compiler.cfg.coalescing: more or less complete, now needs debugging
|
2009-07-27 02:20:45 -05:00 |
|
Slava Pestov
|
a32cbdd231
|
compiler.cfg.coalescing: more work done
|
2009-07-27 00:31:21 -05:00 |
|
Slava Pestov
|
2137c9cc79
|
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
|
d864214119
|
compiler.cfg.dominance: add algorithm for computing iterated dominance frontiers
|
2009-07-22 06:07:51 -05:00 |
|
Slava Pestov
|
e7e5bee9a2
|
compiler.cfg.ssa: Cytron's SSA construction algorithm
|
2009-07-21 17:49:30 -05:00 |
|
Slava Pestov
|
3136549f48
|
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
|
1db81da264
|
Refactoring low-level optimizer to support stack analysis pass
|
2009-05-26 19:31:19 -05:00 |
|
Slava Pestov
|
e58fcd485c
|
Working on global optimizations
|
2009-05-19 17:28:13 -05:00 |