Mercurial > hg > graal-jvmci-8
view graal/GraalCompiler/src/com/sun/c1x/debug/IdealGraphPrinter.java @ 2787:9253df721472
Allow to return a map of "debug properties" in Node and subclasses and show these properties in the IdealGraphVisualizer. Also, fix inputCount() and successorCount() for Local.
author | Peter Hofer <peter.hofer@jku.at> |
---|---|
date | Wed, 25 May 2011 17:48:56 +0200 |
parents | 39a9d62e4c60 |
children | d3fc4fe063bf |
line wrap: on
line source
/* * 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.Entry; import com.oracle.graal.graph.*; /** * 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; /** * 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)); stream.println(" <nodes>"); List<Edge> edges = printNodes(graph.getNodes(), shortNames); stream.println(" </nodes>"); stream.println(" <edges>"); for (Edge edge : edges) { printEdge(edge); } stream.println(" </edges>"); stream.println(" </graph>"); } private List<Edge> printNodes(Collection<Node> nodes, boolean shortNames) { ArrayList<Edge> edges = new ArrayList<Edge>(); for (Node node : nodes) { if (node == Node.Null || omittedClasses.contains(node)) { 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")) { String name; if (shortNames) { name = node.shortName(); } else { name = node.toString(); } stream.printf(" <p name='name'>%s</p>%n", escape(name)); } 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 String escape(String s) { s = s.replace("&", "&"); s = s.replace("<", "<"); s = s.replace(">", ">"); s = s.replace("\"", """); s = s.replace("'", "'"); return s; } }