Mercurial > hg > graal-jvmci-8
diff graal/com.oracle.max.graal.compiler/src/com/sun/c1x/debug/IdealGraphPrinter.java @ 2872:0341b6424579
Project renaming.
author | Thomas Wuerthinger <thomas@wuerthinger.net> |
---|---|
date | Wed, 08 Jun 2011 08:42:25 +0200 |
parents | graal/GraalCompiler/src/com/sun/c1x/debug/IdealGraphPrinter.java@7f14e6b48a9c |
children |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/graal/com.oracle.max.graal.compiler/src/com/sun/c1x/debug/IdealGraphPrinter.java Wed Jun 08 08:42:25 2011 +0200 @@ -0,0 +1,277 @@ +/* + * Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ +package com.sun.c1x.debug; + +import java.io.*; +import java.util.*; +import java.util.Map.*; + +import com.oracle.graal.graph.*; +import com.oracle.max.graal.schedule.*; +import com.sun.c1x.ir.*; + +/** + * Generates a representation of {@link Graph Graphs} that can be visualized and inspected with the <a + * href="http://kenai.com/projects/igv">Ideal Graph Visualizer</a>. + */ +public class IdealGraphPrinter { + + private static class Edge { + final int from; + final int to; + final int fromIndex; + final int toIndex; + + Edge(int from, int fromIndex, int to, int toIndex) { + this.from = from; + this.fromIndex = fromIndex; + this.to = to; + this.toIndex = toIndex; + } + } + + private final HashSet<Class<?>> omittedClasses = new HashSet<Class<?>>(); + private final PrintStream stream; + private final List<Node> noBlockNodes = new LinkedList<Node>(); + + /** + * Creates a new {@link IdealGraphPrinter} that writes to the specified output stream. + */ + public IdealGraphPrinter(OutputStream stream) { + this.stream = new PrintStream(stream); + } + + /** + * Adds a node class that is omitted in the output. + */ + public void addOmittedClass(Class<?> clazz) { + omittedClasses.add(clazz); + } + + /** + * Flushes any buffered output. + */ + public void flush() { + stream.flush(); + } + + /** + * Starts a new graph document. + */ + public void begin() { + stream.println("<graphDocument>"); + } + + /** + * Starts a new group of graphs with the given name, short name and method byte code index (BCI) as properties. + */ + public void beginGroup(String name, String shortName, int bci) { + stream.println("<group>"); + stream.printf(" <properties><p name='name'>%s</p></properties>%n", escape(name)); + stream.printf(" <method name='%s' shortName='%s' bci='%d'/>%n", escape(name), escape(shortName), bci); + } + + /** + * Ends the current group. + */ + public void endGroup() { + stream.println("</group>"); + } + + /** + * Finishes the graph document and flushes the output stream. + */ + public void end() { + stream.println("</graphDocument>"); + flush(); + } + + /** + * Prints an entire {@link Graph} with the specified title, optionally using short names for nodes. + */ + public void print(Graph graph, String title, boolean shortNames) { + stream.printf(" <graph name='%s'>%n", escape(title)); + + Schedule schedule = null; + try { + schedule = new Schedule(graph); + } catch (Throwable t) { + // nothing to do here... + } + + stream.println(" <nodes>"); + List<Edge> edges = printNodes(graph.getNodes(), shortNames, schedule == null ? null : schedule.getNodeToBlock()); + stream.println(" </nodes>"); + + stream.println(" <edges>"); + for (Edge edge : edges) { + printEdge(edge); + } + stream.println(" </edges>"); + + stream.println(" <controlFlow>"); + if (schedule != null) { + for (Block block : schedule.getBlocks()) { + printBlock(graph, block); + } + printNoBlock(); + } + stream.println(" </controlFlow>"); + + stream.println(" </graph>"); + } + + private List<Edge> printNodes(Collection<Node> nodes, boolean shortNames, NodeMap<Block> nodeToBlock) { + ArrayList<Edge> edges = new ArrayList<Edge>(); + + for (Node node : nodes) { + if (node == Node.Null || omittedClasses.contains(node.getClass())) { + continue; + } + + stream.printf(" <node id='%d'><properties>%n", node.id()); + stream.printf(" <p name='idx'>%d</p>%n", node.id()); + + Map<Object, Object> props = node.getDebugProperties(); + if (!props.containsKey("name") || props.get("name").toString().trim().length() == 0) { + String name; + if (shortNames) { + name = node.shortName(); + } else { + name = node.toString(); + } + stream.printf(" <p name='name'>%s</p>%n", escape(name)); + } + if (nodeToBlock != null) { + Block block = nodeToBlock.get(node); + if (block != null) { + stream.printf(" <p name='block'>%d</p>%n", block.blockID()); + } else { + stream.printf(" <p name='block'>noBlock</p>%n"); + noBlockNodes.add(node); + } + } + for (Entry<Object, Object> entry : props.entrySet()) { + String key = entry.getKey().toString(); + String value = entry.getValue().toString(); + stream.printf(" <p name='%s'>%s</p>%n", escape(key), escape(value)); + } + + stream.println(" </properties></node>"); + + // successors + int fromIndex = 0; + for (Node successor : node.successors()) { + if (successor != Node.Null && !omittedClasses.contains(successor.getClass())) { + edges.add(new Edge(node.id(), fromIndex, successor.id(), 0)); + } + fromIndex++; + } + + // inputs + int toIndex = 1; + for (Node input : node.inputs()) { + if (input != Node.Null && !omittedClasses.contains(input.getClass())) { + edges.add(new Edge(input.id(), input.successors().size(), node.id(), toIndex)); + } + toIndex++; + } + } + + return edges; + } + + private void printEdge(Edge edge) { + stream.printf(" <edge from='%d' fromIndex='%d' to='%d' toIndex='%d'/>%n", edge.from, edge.fromIndex, edge.to, edge.toIndex); + } + + private void printBlock(Graph graph, Block block) { + stream.printf(" <block name='%d'>%n", block.blockID()); + stream.printf(" <successors>%n"); + for (Block sux : block.getSuccessors()) { + if (sux.firstNode() instanceof LoopBegin && block.lastNode() instanceof LoopEnd) { + // Skip back edges. + } else { + stream.printf(" <successor name='%d'/>%n", sux.blockID()); + } + } + stream.printf(" </successors>%n"); + stream.printf(" <nodes>%n"); + + ArrayList<Node> nodes = new ArrayList<Node>(block.getInstructions()); + // if this is the first block: add all locals to this block + if (nodes.get(0) == graph.start()) { + for (Node node : graph.getNodes()) { + if (node instanceof Local) { + nodes.add(node); + } + } + } + // add all framestates and phis to their blocks + for (Node node : block.getInstructions()) { + if (node instanceof Instruction && ((Instruction) node).stateAfter() != null) { + nodes.add(((Instruction) node).stateAfter()); + } + if (node instanceof Merge) { + Merge merge = (Merge) node; + if (merge.stateBefore() != null) { + nodes.add(merge.stateBefore()); + } + for (Node usage : merge.usages()) { + if (usage instanceof Phi) { + nodes.add(usage); + } + } + } + } + + for (Node node : nodes) { + if (!omittedClasses.contains(node.getClass())) { + stream.printf(" <node id='%d'/>%n", node.id()); + } + } + stream.printf(" </nodes>%n"); + stream.printf(" </block>%n", block.blockID()); + } + + private void printNoBlock() { + if (!noBlockNodes.isEmpty()) { + stream.printf(" <block name='noBlock'>%n"); + stream.printf(" <nodes>%n"); + for (Node node : noBlockNodes) { + stream.printf(" <node id='%d'/>%n", node.id()); + } + stream.printf(" </nodes>%n"); + stream.printf(" </block>%n"); + } + } + + private String escape(String s) { + s = s.replace("&", "&"); + s = s.replace("<", "<"); + s = s.replace(">", ">"); + s = s.replace("\"", """); + s = s.replace("'", "'"); + return s; + } +}