Mercurial > hg > graal-compiler
view graal/com.oracle.truffle.sl/src/com/oracle/truffle/sl/nodes/instrument/SLASTPrinter.java @ 16914:826c172a048f
SL: fixed merge problem.
author | Christian Humer <christian.humer@gmail.com> |
---|---|
date | Sat, 23 Aug 2014 19:31:36 +0200 |
parents | 618d92152d3c |
children | e3c95cbbb50c |
line wrap: on
line source
/* * Copyright (c) 2012, 2014, 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.oracle.truffle.sl.nodes.instrument; import java.io.*; import java.util.*; import com.oracle.truffle.api.instrument.*; import com.oracle.truffle.api.nodes.*; import com.oracle.truffle.api.nodes.NodeUtil.NodeClass; import com.oracle.truffle.api.nodes.NodeUtil.NodeField; import com.oracle.truffle.api.nodes.NodeUtil.NodeFieldKind; import com.oracle.truffle.api.source.*; /** * SLASTPrinter is used to print for SL's internal Truffle AST. This is used by * {@link SLDefaultVisualizer} to provide a means of displaying the internal Truffle AST */ public final class SLASTPrinter implements ASTPrinter { public SLASTPrinter() { } public void printTree(PrintWriter p, Node node, int maxDepth, Node markNode) { printTree(p, node, maxDepth, markNode, 1); p.println(); p.flush(); } public String printTreeToString(Node node, int maxDepth, Node markNode) { StringWriter out = new StringWriter(); printTree(new PrintWriter(out), node, maxDepth, markNode); return out.toString(); } public String printTreeToString(Node node, int maxDepth) { return printTreeToString(node, maxDepth, null); } private static void printTree(PrintWriter p, Node node, int maxDepth, Node markNode, int level) { if (node == null) { p.print("null"); return; } p.print(nodeName(node)); String sep = ""; p.print("("); final SourceSection src = node.getSourceSection(); if (src != null) { if (!(src instanceof NullSourceSection)) { p.print(src.getSource().getName() + ":" + src.getStartLine()); } else if (src instanceof NullSourceSection) { final NullSourceSection nullSection = (NullSourceSection) src; p.print(nullSection.getShortDescription()); } } if (node instanceof SyntaxTagged) { final SyntaxTagged taggedNode = (SyntaxTagged) node; p.print("["); String prefix = ""; for (SyntaxTag tag : taggedNode.getSyntaxTags()) { p.print(prefix); prefix = ","; p.print(tag.toString()); } p.print("]"); } ArrayList<NodeField> childFields = new ArrayList<>(); for (NodeField field : NodeClass.get(node.getClass()).getFields()) { if (field.getKind() == NodeFieldKind.CHILD || field.getKind() == NodeFieldKind.CHILDREN) { childFields.add(field); } else if (field.getKind() == NodeFieldKind.DATA) { // p.print(sep); // sep = ", "; // // final String fieldName = field.getName(); // switch (fieldName) { // // } // p.print(fieldName); // p.print(" = "); // p.print(field.loadValue(node)); } } p.print(")"); if (level <= maxDepth) { if (childFields.size() != 0) { p.print(" {"); for (NodeField field : childFields) { Object value = field.loadValue(node); if (value == null) { printNewLine(p, level); p.print(field.getName()); p.print(" = null "); } else if (field.getKind() == NodeFieldKind.CHILD) { final Node valueNode = (Node) value; printNewLine(p, level, valueNode == markNode); p.print(field.getName()); p.print(" = "); printTree(p, valueNode, maxDepth, markNode, level + 1); } else if (field.getKind() == NodeFieldKind.CHILDREN) { printNewLine(p, level); p.print(field.getName()); Node[] children = (Node[]) value; p.print(" = ["); sep = ""; for (Node child : children) { p.print(sep); sep = ", "; printTree(p, child, maxDepth, markNode, level + 1); } p.print("]"); } else { printNewLine(p, level); p.print(field.getName()); } } printNewLine(p, level - 1); p.print("}"); } } } private static void printNewLine(PrintWriter p, int level, boolean mark) { p.println(); for (int i = 0; i < level; i++) { if (mark && i == 0) { p.print(" -->"); } else { p.print(" "); } } } private static void printNewLine(PrintWriter p, int level) { printNewLine(p, level, false); } private static String nodeName(Node node) { return node.getClass().getSimpleName(); } }