Wed, 29 Jun 2011 20:11:13 +0200 |
Lukas Stadler |
small inlining simplification
|
Wed, 29 Jun 2011 19:53:00 +0200 |
Lukas Stadler |
merge
|
Wed, 29 Jun 2011 19:52:51 +0200 |
Lukas Stadler |
fix for unresolved exception bug, exactType and declaredType logic for inlining, more on escape analysis
|
Wed, 29 Jun 2011 18:53:09 +0200 |
Peter Hofer |
IdealGraphVisualizer: Consider two nodes to be equal when node.vertex is null for both of them in nodeProcessingDownComparator and nodeProcessingUpComparator. This should fix transitivity issues when sorting.
|
Wed, 29 Jun 2011 18:27:14 +0200 |
Peter Hofer |
IdealGraphVisualizer: Rename predecessors to "Nodes Above" and successors to "Nodes Below" and actions "Expand Predecessors" and "Expand Successors" to "Expand Above" and "Expand Below" to avoid ambiguity with the Graal concept of successors and predecessors
|
Wed, 29 Jun 2011 17:33:35 +0200 |
Peter Hofer |
IdealGraphVisualizer: Enhance text view so it can display arbitrary properties from the active graph's group. For diff graphs, it shows the textual difference between the property strings using the NetBeans Diff module.
|
Wed, 29 Jun 2011 13:26:25 +0200 |
Peter Hofer |
IdealGraphVisualizer: remove files from C1XVisualizer text editor component that were erroneously checked in again
|
Wed, 29 Jun 2011 12:22:46 +0200 |
Peter Hofer |
IdealGraphVisualizer: add another filter that hides slots with no connections
|
Tue, 28 Jun 2011 19:54:51 +0200 |
Lukas Stadler |
fixes to escape analysis: propagation of VirtualObject
|
Tue, 28 Jun 2011 19:22:42 +0200 |
Lukas Stadler |
merge
|
Tue, 28 Jun 2011 19:14:28 +0200 |
Lukas Stadler |
more escape analysis work: debug info
|
Mon, 27 Jun 2011 17:15:12 +0200 |
Lukas Stadler |
merge
|
Mon, 27 Jun 2011 17:13:33 +0200 |
Lukas Stadler |
more escape analysis changes
|
Wed, 22 Jun 2011 11:56:15 +0200 |
Lukas Stadler |
merge
|
Wed, 22 Jun 2011 11:55:42 +0200 |
Lukas Stadler |
InliningPhase can take a hint on what to inline, initial work on EscapeAnalysisPhase
|
Tue, 28 Jun 2011 17:17:51 +0200 |
Gilles Duboscq |
Fix for dead Phis in loop nodes detection
|
Tue, 28 Jun 2011 17:08:45 +0200 |
Gilles Duboscq |
Added -G:+PlotOnError option to print graph to IGV even without -G:+Plot on error condition (verification failure or AssertionError/RuntimeException in a Phase)
|
Tue, 28 Jun 2011 16:45:48 +0200 |
Gilles Duboscq |
Merge
|
Tue, 28 Jun 2011 16:13:32 +0200 |
Gilles Duboscq |
Fix multiple bugs in loop peeling
|
Tue, 28 Jun 2011 10:10:47 +0200 |
Gilles Duboscq |
Loop peeling work
|
Tue, 28 Jun 2011 14:17:06 +0200 |
Thomas Wuerthinger |
Sync with maxine changes.
|
Tue, 28 Jun 2011 13:53:28 +0200 |
Thomas Wuerthinger |
Updated hgignore.
|
Tue, 28 Jun 2011 13:52:36 +0200 |
Thomas Wuerthinger |
Added read elimination phase.
|
Tue, 28 Jun 2011 12:20:31 +0200 |
Thomas Wuerthinger |
insert loop memory merging
|
Mon, 27 Jun 2011 17:38:43 +0200 |
Thomas Wuerthinger |
Removed locationToRead array.
|
Mon, 27 Jun 2011 13:29:53 +0200 |
Thomas Wuerthinger |
Towards new memory dependence graph.
|
Fri, 24 Jun 2011 15:39:54 +0200 |
Thomas Wuerthinger |
Added memory dependencies.
|
Fri, 24 Jun 2011 15:01:20 +0200 |
Thomas Wuerthinger |
Node class clean up.
|
Fri, 24 Jun 2011 14:59:27 +0200 |
Thomas Wuerthinger |
More clean up in the IR.
|
Fri, 24 Jun 2011 14:46:26 +0200 |
Thomas Wuerthinger |
Simplifications on ReadNode WriteNode.
|
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
|
Tue, 21 Jun 2011 11:13:52 +0200 |
Lukas Stadler |
runtime profiles exceptions at the call site
|
Tue, 21 Jun 2011 11:44:33 +0200 |
Gilles Duboscq |
LoopEnd is not a Merge anymore
|
Tue, 21 Jun 2011 10:35:27 +0200 |
Gilles Duboscq |
Fix bug in FrameState handling for LoopBegin, BitMap -> GraalBitMap in some assertions in graalCodeInstaller
|