| Fri, 24 Jun 2011 14:35:07 +0200 |
Thomas Wuerthinger |
Towards splitting the lowering and the memory graph creation phases.
|
| Fri, 24 Jun 2011 14:21:12 +0200 |
Thomas Wuerthinger |
Restructure memory lowering code.
|
| Thu, 23 Jun 2011 16:40:53 +0200 |
Thomas Wuerthinger |
Updated GRAAL_README. Add new short-cut flag for graph output "-G:Plot".
|
| Wed, 22 Jun 2011 22:27:02 +0200 |
Thomas Wuerthinger |
Merge.
|
| Wed, 22 Jun 2011 22:26:45 +0200 |
Thomas Wuerthinger |
Now successfully lowering field stores.
|
| Wed, 22 Jun 2011 21:51:57 +0200 |
Thomas Wuerthinger |
Create new FieldWriteBarrier. Enable possibility to lower node directly to LIR.
|
| Wed, 22 Jun 2011 21:51:26 +0200 |
Thomas Wuerthinger |
Make sure that the compiler is initialized at startup (and not on the first compiled method).
|
| Wed, 22 Jun 2011 18:42:21 +0200 |
Peter Hofer |
IdealGraphVisualizer: different coloring for usages and predecessors (and hence inputs and successors)
|
| Tue, 21 Jun 2011 17:14:24 +0200 |
Gilles Duboscq |
Merge
|
| Tue, 21 Jun 2011 16:58:34 +0200 |
Gilles Duboscq |
Compute Loop information, keep Placeholder on loop exits, added some utility functions for data/cfg traversal
|
| Tue, 21 Jun 2011 14:32:12 +0200 |
Lukas Stadler |
Graph.getNodes() is Iterable<Node>, doesn't return null nodes and doesn't throw ConcurrentModificationException
|
| Tue, 21 Jun 2011 12:15:38 +0200 |
Lukas Stadler |
disable UseExceptionProbability by default (not stable yet)
|
| Tue, 21 Jun 2011 12:01:38 +0200 |
Lukas Stadler |
merge
|
| Tue, 21 Jun 2011 12:01:28 +0200 |
Lukas Stadler |
fixes on exception profiling
|
| Tue, 21 Jun 2011 11:16:21 +0200 |
Lukas Stadler |
merge
|
