Mercurial > hg > graal-compiler

comparison graal/com.oracle.truffle.sl/src/com/oracle/truffle/sl/tools/GraphPrinter.java @ 7292:213c1297a814

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Simple Language: A simple dynamic programming language to demonstrate Truffle features
author Christian Wimmer <christian.wimmer@oracle.com>
date Fri, 21 Dec 2012 10:45:37 -0800
parents
children
comparison
equal deleted inserted replaced
7291:a748e4d44694 7292:213c1297a814
1 /*
2 * Copyright (c) 2012, 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 */
23 package com.oracle.truffle.sl.tools;
24
25 import com.oracle.truffle.api.nodes.*;
26
27 public class GraphPrinter {
28
29 public static void print(Node root) {
30 print(root, 0);
31 }
32
33 private static void print(Node node, int level) {
34 for (int i = 0; i < level; i++) {
35 System.out.print(" ");
36 }
37 System.out.println(node == null ? "empty" : node.getClass().getSimpleName());
38 if (node != null) {
39 for (Node child : node.getChildren()) {
40 print(child, level + 1);
41 }
42 }
43 }
44 }