comparison graal/com.oracle.max.graal.compiler/src/com/oracle/max/graal/compiler/debug/IdealGraphPrinter.java @ 2945:41318fcb6b56

Added two algorithms for identifying Java-level blocks.
author Thomas Wuerthinger <thomas@wuerthinger.net>
date Thu, 09 Jun 2011 18:59:28 +0200
parents 0e1c823c53d7
children c76db61fbb73
comparison
equal deleted inserted replaced
2944:cc4b538852e3 2945:41318fcb6b56
110 * Prints an entire {@link Graph} with the specified title, optionally using short names for nodes. 110 * Prints an entire {@link Graph} with the specified title, optionally using short names for nodes.
111 */ 111 */
112 public void print(Graph graph, String title, boolean shortNames) { 112 public void print(Graph graph, String title, boolean shortNames) {
113 stream.printf(" <graph name='%s'>%n", escape(title)); 113 stream.printf(" <graph name='%s'>%n", escape(title));
114 noBlockNodes.clear(); 114 noBlockNodes.clear();
115 Schedule schedule = null; 115 IdentifyBlocksPhase schedule = null;
116 try { 116 try {
117 schedule = new Schedule(); 117 schedule = new IdentifyBlocksPhase(true);
118 schedule.apply(graph); 118 schedule.apply(graph);
119 } catch (Throwable t) { 119 } catch (Throwable t) {
120 // nothing to do here... 120 // nothing to do here...
121 } 121 }
122 122