Mercurial > hg > truffle

comparison graal/com.oracle.max.graal.compiler/src/com/oracle/max/graal/compiler/graph/IR.java @ 2948:c76db61fbb73

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge.
author Thomas Wuerthinger <thomas@wuerthinger.net>
date Fri, 10 Jun 2011 21:52:19 +0200
parents 41318fcb6b56 c7783b6773ea
children 445233cd91df 49a8b14e9d24 42681ed31c4d
comparison
equal deleted inserted replaced
2947:e86e83c5adbc 2948:c76db61fbb73
68 * Builds the graph, optimizes it, and computes the linear scan block order. 68 * Builds the graph, optimizes it, and computes the linear scan block order.
69 */ 69 */
70 public void build() { 70 public void build() {
71 new GraphBuilderPhase(compilation, compilation.method, false, false).apply(compilation.graph); 71 new GraphBuilderPhase(compilation, compilation.method, false, false).apply(compilation.graph);
72 printGraph("After GraphBuilding", compilation.graph); 72 printGraph("After GraphBuilding", compilation.graph);
73 new DuplicationPhase().apply(compilation.graph); 73 //new DuplicationPhase().apply(compilation.graph);
74 new DeadCodeEliminationPhase().apply(compilation.graph); 74 new DeadCodeEliminationPhase().apply(compilation.graph);
75 printGraph("After DeadCodeElimination", compilation.graph); 75 printGraph("After DeadCodeElimination", compilation.graph);
76 76
77 if (GraalOptions.Inline) { 77 if (GraalOptions.Inline) {
78 new InliningPhase(compilation, this, GraalOptions.TraceInlining).apply(compilation.graph); 78 new InliningPhase(compilation, this, GraalOptions.TraceInlining).apply(compilation.graph);
85 85
86 Graph graph = compilation.graph; 86 Graph graph = compilation.graph;
87 87
88 if (GraalOptions.OptCanonicalizer) { 88 if (GraalOptions.OptCanonicalizer) {
89 new CanonicalizerPhase().apply(graph); 89 new CanonicalizerPhase().apply(graph);
90 new DeadCodeEliminationPhase().apply(compilation.graph);
90 printGraph("After Canonicalization", graph); 91 printGraph("After Canonicalization", graph);
91 new DeadCodeEliminationPhase().apply(compilation.graph);
92 } 92 }
93 93
94 new LoweringPhase().apply(graph); 94 new LoweringPhase().apply(graph);
95 95
96 new SplitCriticalEdgesPhase().apply(graph); 96 new SplitCriticalEdgesPhase().apply(graph);