src/share/classes/com/sun/tools/javac/tree/Pretty.java

Wed, 23 Jan 2013 13:27:24 -0800

author
jjg
date
Wed, 23 Jan 2013 13:27:24 -0800
changeset 1521
71f35e4b93a5
parent 1510
7873d37f5b37
child 1755
ddb4a2bfcd82
permissions
-rw-r--r--

8006775: JSR 308: Compiler changes in JDK8
Reviewed-by: jjg
Contributed-by: mernst@cs.washington.edu, wmdietl@cs.washington.edu, mpapi@csail.mit.edu, mahmood@notnoop.com

duke@1 1 /*
jjg@1486 2 * Copyright (c) 1999, 2013, Oracle and/or its affiliates. All rights reserved.
duke@1 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1 4 *
duke@1 5 * This code is free software; you can redistribute it and/or modify it
duke@1 6 * under the terms of the GNU General Public License version 2 only, as
ohair@554 7 * published by the Free Software Foundation. Oracle designates this
duke@1 8 * particular file as subject to the "Classpath" exception as provided
ohair@554 9 * by Oracle in the LICENSE file that accompanied this code.
duke@1 10 *
duke@1 11 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1 14 * version 2 for more details (a copy is included in the LICENSE file that
duke@1 15 * accompanied this code).
duke@1 16 *
duke@1 17 * You should have received a copy of the GNU General Public License version
duke@1 18 * 2 along with this work; if not, write to the Free Software Foundation,
duke@1 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1 20 *
ohair@554 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
ohair@554 22 * or visit www.oracle.com if you need additional information or have any
ohair@554 23 * questions.
duke@1 24 */
duke@1 25
duke@1 26 package com.sun.tools.javac.tree;
duke@1 27
duke@1 28 import java.io.*;
duke@1 29
mcimadamore@1143 30 import com.sun.source.tree.MemberReferenceTree.ReferenceMode;
jjg@1280 31 import com.sun.tools.javac.code.*;
jjg@1280 32 import com.sun.tools.javac.tree.JCTree.*;
duke@1 33 import com.sun.tools.javac.util.*;
duke@1 34 import com.sun.tools.javac.util.List;
duke@1 35 import static com.sun.tools.javac.code.Flags.*;
jjg@1127 36 import static com.sun.tools.javac.code.Flags.ANNOTATION;
jjg@1127 37 import static com.sun.tools.javac.tree.JCTree.Tag.*;
duke@1 38
duke@1 39 /** Prints out a tree as an indented Java source program.
duke@1 40 *
jjg@581 41 * <p><b>This is NOT part of any supported API.
jjg@581 42 * If you write code that depends on this, you do so at your own risk.
duke@1 43 * This code and its internal interfaces are subject to change or
duke@1 44 * deletion without notice.</b>
duke@1 45 */
duke@1 46 public class Pretty extends JCTree.Visitor {
duke@1 47
duke@1 48 public Pretty(Writer out, boolean sourceOutput) {
duke@1 49 this.out = out;
duke@1 50 this.sourceOutput = sourceOutput;
duke@1 51 }
duke@1 52
duke@1 53 /** Set when we are producing source output. If we're not
duke@1 54 * producing source output, we can sometimes give more detail in
duke@1 55 * the output even though that detail would not be valid java
jjg@439 56 * source.
duke@1 57 */
duke@1 58 private final boolean sourceOutput;
duke@1 59
duke@1 60 /** The output stream on which trees are printed.
duke@1 61 */
duke@1 62 Writer out;
duke@1 63
duke@1 64 /** Indentation width (can be reassigned from outside).
duke@1 65 */
duke@1 66 public int width = 4;
duke@1 67
duke@1 68 /** The current left margin.
duke@1 69 */
duke@1 70 int lmargin = 0;
duke@1 71
duke@1 72 /** The enclosing class name.
duke@1 73 */
duke@1 74 Name enclClassName;
duke@1 75
jjg@1280 76 /** A table mapping trees to their documentation comments
duke@1 77 * (can be null)
duke@1 78 */
jjg@1280 79 DocCommentTable docComments = null;
duke@1 80
mcimadamore@1347 81 /**
mcimadamore@1347 82 * A string sequence to be used when Pretty output should be constrained
mcimadamore@1347 83 * to fit into a given size
mcimadamore@1347 84 */
mcimadamore@1347 85 private final static String trimSequence = "[...]";
mcimadamore@1347 86
mcimadamore@1348 87 /**
mcimadamore@1348 88 * Max number of chars to be generated when output should fit into a single line
mcimadamore@1348 89 */
mcimadamore@1348 90 private final static int PREFERRED_LENGTH = 20;
mcimadamore@1348 91
duke@1 92 /** Align code to be indented to left margin.
duke@1 93 */
duke@1 94 void align() throws IOException {
duke@1 95 for (int i = 0; i < lmargin; i++) out.write(" ");
duke@1 96 }
duke@1 97
duke@1 98 /** Increase left margin by indentation width.
duke@1 99 */
duke@1 100 void indent() {
duke@1 101 lmargin = lmargin + width;
duke@1 102 }
duke@1 103
duke@1 104 /** Decrease left margin by indentation width.
duke@1 105 */
duke@1 106 void undent() {
duke@1 107 lmargin = lmargin - width;
duke@1 108 }
duke@1 109
duke@1 110 /** Enter a new precedence level. Emit a `(' if new precedence level
duke@1 111 * is less than precedence level so far.
duke@1 112 * @param contextPrec The precedence level in force so far.
duke@1 113 * @param ownPrec The new precedence level.
duke@1 114 */
duke@1 115 void open(int contextPrec, int ownPrec) throws IOException {
duke@1 116 if (ownPrec < contextPrec) out.write("(");
duke@1 117 }
duke@1 118
duke@1 119 /** Leave precedence level. Emit a `(' if inner precedence level
duke@1 120 * is less than precedence level we revert to.
duke@1 121 * @param contextPrec The precedence level we revert to.
duke@1 122 * @param ownPrec The inner precedence level.
duke@1 123 */
duke@1 124 void close(int contextPrec, int ownPrec) throws IOException {
duke@1 125 if (ownPrec < contextPrec) out.write(")");
duke@1 126 }
duke@1 127
duke@1 128 /** Print string, replacing all non-ascii character with unicode escapes.
duke@1 129 */
duke@1 130 public void print(Object s) throws IOException {
duke@1 131 out.write(Convert.escapeUnicode(s.toString()));
duke@1 132 }
duke@1 133
duke@1 134 /** Print new line.
duke@1 135 */
duke@1 136 public void println() throws IOException {
duke@1 137 out.write(lineSep);
duke@1 138 }
duke@1 139
mcimadamore@1348 140 public static String toSimpleString(JCTree tree) {
mcimadamore@1348 141 return toSimpleString(tree, PREFERRED_LENGTH);
mcimadamore@1348 142 }
mcimadamore@1348 143
mcimadamore@1347 144 public static String toSimpleString(JCTree tree, int maxLength) {
mcimadamore@1347 145 StringWriter s = new StringWriter();
mcimadamore@1347 146 try {
mcimadamore@1347 147 new Pretty(s, false).printExpr(tree);
mcimadamore@1347 148 }
mcimadamore@1347 149 catch (IOException e) {
mcimadamore@1347 150 // should never happen, because StringWriter is defined
mcimadamore@1347 151 // never to throw any IOExceptions
mcimadamore@1347 152 throw new AssertionError(e);
mcimadamore@1347 153 }
mcimadamore@1347 154 //we need to (i) replace all line terminators with a space and (ii) remove
mcimadamore@1347 155 //occurrences of 'missing' in the Pretty output (generated when types are missing)
jjg@1486 156 String res = s.toString().trim().replaceAll("\\s+", " ").replaceAll("/\\*missing\\*/", "");
mcimadamore@1347 157 if (res.length() < maxLength) {
mcimadamore@1347 158 return res;
mcimadamore@1347 159 } else {
jjg@1486 160 int head = (maxLength - trimSequence.length()) * 2 / 3;
jjg@1486 161 int tail = maxLength - trimSequence.length() - head;
jjg@1486 162 return res.substring(0, head) + trimSequence + res.substring(res.length() - tail);
mcimadamore@1347 163 }
mcimadamore@1347 164 }
mcimadamore@1347 165
duke@1 166 String lineSep = System.getProperty("line.separator");
duke@1 167
duke@1 168 /**************************************************************************
duke@1 169 * Traversal methods
duke@1 170 *************************************************************************/
duke@1 171
duke@1 172 /** Exception to propogate IOException through visitXXX methods */
duke@1 173 private static class UncheckedIOException extends Error {
duke@1 174 static final long serialVersionUID = -4032692679158424751L;
duke@1 175 UncheckedIOException(IOException e) {
duke@1 176 super(e.getMessage(), e);
duke@1 177 }
duke@1 178 }
duke@1 179
duke@1 180 /** Visitor argument: the current precedence level.
duke@1 181 */
duke@1 182 int prec;
duke@1 183
duke@1 184 /** Visitor method: print expression tree.
duke@1 185 * @param prec The current precedence level.
duke@1 186 */
duke@1 187 public void printExpr(JCTree tree, int prec) throws IOException {
duke@1 188 int prevPrec = this.prec;
duke@1 189 try {
duke@1 190 this.prec = prec;
duke@1 191 if (tree == null) print("/*missing*/");
duke@1 192 else {
duke@1 193 tree.accept(this);
duke@1 194 }
duke@1 195 } catch (UncheckedIOException ex) {
duke@1 196 IOException e = new IOException(ex.getMessage());
duke@1 197 e.initCause(ex);
duke@1 198 throw e;
duke@1 199 } finally {
duke@1 200 this.prec = prevPrec;
duke@1 201 }
duke@1 202 }
duke@1 203
duke@1 204 /** Derived visitor method: print expression tree at minimum precedence level
duke@1 205 * for expression.
duke@1 206 */
duke@1 207 public void printExpr(JCTree tree) throws IOException {
duke@1 208 printExpr(tree, TreeInfo.noPrec);
duke@1 209 }
duke@1 210
duke@1 211 /** Derived visitor method: print statement tree.
duke@1 212 */
duke@1 213 public void printStat(JCTree tree) throws IOException {
duke@1 214 printExpr(tree, TreeInfo.notExpression);
duke@1 215 }
duke@1 216
duke@1 217 /** Derived visitor method: print list of expression trees, separated by given string.
duke@1 218 * @param sep the separator string
duke@1 219 */
duke@1 220 public <T extends JCTree> void printExprs(List<T> trees, String sep) throws IOException {
duke@1 221 if (trees.nonEmpty()) {
duke@1 222 printExpr(trees.head);
duke@1 223 for (List<T> l = trees.tail; l.nonEmpty(); l = l.tail) {
duke@1 224 print(sep);
duke@1 225 printExpr(l.head);
duke@1 226 }
duke@1 227 }
duke@1 228 }
duke@1 229
duke@1 230 /** Derived visitor method: print list of expression trees, separated by commas.
duke@1 231 */
duke@1 232 public <T extends JCTree> void printExprs(List<T> trees) throws IOException {
duke@1 233 printExprs(trees, ", ");
duke@1 234 }
duke@1 235
duke@1 236 /** Derived visitor method: print list of statements, each on a separate line.
duke@1 237 */
duke@1 238 public void printStats(List<? extends JCTree> trees) throws IOException {
duke@1 239 for (List<? extends JCTree> l = trees; l.nonEmpty(); l = l.tail) {
duke@1 240 align();
duke@1 241 printStat(l.head);
duke@1 242 println();
duke@1 243 }
duke@1 244 }
duke@1 245
duke@1 246 /** Print a set of modifiers.
duke@1 247 */
duke@1 248 public void printFlags(long flags) throws IOException {
duke@1 249 if ((flags & SYNTHETIC) != 0) print("/*synthetic*/ ");
duke@1 250 print(TreeInfo.flagNames(flags));
mcimadamore@1366 251 if ((flags & ExtendedStandardFlags) != 0) print(" ");
duke@1 252 if ((flags & ANNOTATION) != 0) print("@");
duke@1 253 }
duke@1 254
duke@1 255 public void printAnnotations(List<JCAnnotation> trees) throws IOException {
duke@1 256 for (List<JCAnnotation> l = trees; l.nonEmpty(); l = l.tail) {
duke@1 257 printStat(l.head);
duke@1 258 println();
duke@1 259 align();
duke@1 260 }
duke@1 261 }
duke@1 262
jjg@1521 263 public void printTypeAnnotations(List<JCAnnotation> trees) throws IOException {
jjg@1521 264 if (trees.nonEmpty())
jjg@1521 265 print(" ");
jjg@1521 266 for (List<JCAnnotation> l = trees; l.nonEmpty(); l = l.tail) {
jjg@1521 267 printExpr(l.head);
jjg@1521 268 print(" ");
jjg@1521 269 }
jjg@1521 270 }
jjg@1521 271
duke@1 272 /** Print documentation comment, if it exists
duke@1 273 * @param tree The tree for which a documentation comment should be printed.
duke@1 274 */
duke@1 275 public void printDocComment(JCTree tree) throws IOException {
duke@1 276 if (docComments != null) {
jjg@1280 277 String dc = docComments.getCommentText(tree);
duke@1 278 if (dc != null) {
duke@1 279 print("/**"); println();
duke@1 280 int pos = 0;
duke@1 281 int endpos = lineEndPos(dc, pos);
duke@1 282 while (pos < dc.length()) {
duke@1 283 align();
duke@1 284 print(" *");
duke@1 285 if (pos < dc.length() && dc.charAt(pos) > ' ') print(" ");
duke@1 286 print(dc.substring(pos, endpos)); println();
duke@1 287 pos = endpos + 1;
duke@1 288 endpos = lineEndPos(dc, pos);
duke@1 289 }
duke@1 290 align(); print(" */"); println();
duke@1 291 align();
duke@1 292 }
duke@1 293 }
duke@1 294 }
duke@1 295 //where
duke@1 296 static int lineEndPos(String s, int start) {
duke@1 297 int pos = s.indexOf('\n', start);
duke@1 298 if (pos < 0) pos = s.length();
duke@1 299 return pos;
duke@1 300 }
duke@1 301
jjg@1326 302 /** If type parameter list is non-empty, print it enclosed in
jjg@1326 303 * {@literal "<...>"} brackets.
duke@1 304 */
duke@1 305 public void printTypeParameters(List<JCTypeParameter> trees) throws IOException {
duke@1 306 if (trees.nonEmpty()) {
duke@1 307 print("<");
duke@1 308 printExprs(trees);
duke@1 309 print(">");
duke@1 310 }
duke@1 311 }
duke@1 312
duke@1 313 /** Print a block.
duke@1 314 */
duke@1 315 public void printBlock(List<? extends JCTree> stats) throws IOException {
duke@1 316 print("{");
duke@1 317 println();
duke@1 318 indent();
duke@1 319 printStats(stats);
duke@1 320 undent();
duke@1 321 align();
duke@1 322 print("}");
duke@1 323 }
duke@1 324
duke@1 325 /** Print a block.
duke@1 326 */
duke@1 327 public void printEnumBody(List<JCTree> stats) throws IOException {
duke@1 328 print("{");
duke@1 329 println();
duke@1 330 indent();
duke@1 331 boolean first = true;
duke@1 332 for (List<JCTree> l = stats; l.nonEmpty(); l = l.tail) {
duke@1 333 if (isEnumerator(l.head)) {
duke@1 334 if (!first) {
duke@1 335 print(",");
duke@1 336 println();
duke@1 337 }
duke@1 338 align();
duke@1 339 printStat(l.head);
duke@1 340 first = false;
duke@1 341 }
duke@1 342 }
duke@1 343 print(";");
duke@1 344 println();
duke@1 345 for (List<JCTree> l = stats; l.nonEmpty(); l = l.tail) {
duke@1 346 if (!isEnumerator(l.head)) {
duke@1 347 align();
duke@1 348 printStat(l.head);
duke@1 349 println();
duke@1 350 }
duke@1 351 }
duke@1 352 undent();
duke@1 353 align();
duke@1 354 print("}");
duke@1 355 }
duke@1 356
duke@1 357 /** Is the given tree an enumerator definition? */
duke@1 358 boolean isEnumerator(JCTree t) {
jjg@1127 359 return t.hasTag(VARDEF) && (((JCVariableDecl) t).mods.flags & ENUM) != 0;
duke@1 360 }
duke@1 361
duke@1 362 /** Print unit consisting of package clause and import statements in toplevel,
duke@1 363 * followed by class definition. if class definition == null,
duke@1 364 * print all definitions in toplevel.
duke@1 365 * @param tree The toplevel tree
duke@1 366 * @param cdef The class definition, which is assumed to be part of the
duke@1 367 * toplevel tree.
duke@1 368 */
duke@1 369 public void printUnit(JCCompilationUnit tree, JCClassDecl cdef) throws IOException {
duke@1 370 docComments = tree.docComments;
duke@1 371 printDocComment(tree);
duke@1 372 if (tree.pid != null) {
duke@1 373 print("package ");
duke@1 374 printExpr(tree.pid);
duke@1 375 print(";");
duke@1 376 println();
duke@1 377 }
duke@1 378 boolean firstImport = true;
duke@1 379 for (List<JCTree> l = tree.defs;
jjg@1127 380 l.nonEmpty() && (cdef == null || l.head.hasTag(IMPORT));
duke@1 381 l = l.tail) {
jjg@1127 382 if (l.head.hasTag(IMPORT)) {
duke@1 383 JCImport imp = (JCImport)l.head;
duke@1 384 Name name = TreeInfo.name(imp.qualid);
jjg@113 385 if (name == name.table.names.asterisk ||
duke@1 386 cdef == null ||
duke@1 387 isUsed(TreeInfo.symbol(imp.qualid), cdef)) {
duke@1 388 if (firstImport) {
duke@1 389 firstImport = false;
duke@1 390 println();
duke@1 391 }
duke@1 392 printStat(imp);
duke@1 393 }
duke@1 394 } else {
duke@1 395 printStat(l.head);
duke@1 396 }
duke@1 397 }
duke@1 398 if (cdef != null) {
duke@1 399 printStat(cdef);
duke@1 400 println();
duke@1 401 }
duke@1 402 }
duke@1 403 // where
duke@1 404 boolean isUsed(final Symbol t, JCTree cdef) {
duke@1 405 class UsedVisitor extends TreeScanner {
duke@1 406 public void scan(JCTree tree) {
duke@1 407 if (tree!=null && !result) tree.accept(this);
duke@1 408 }
duke@1 409 boolean result = false;
duke@1 410 public void visitIdent(JCIdent tree) {
duke@1 411 if (tree.sym == t) result = true;
duke@1 412 }
duke@1 413 }
duke@1 414 UsedVisitor v = new UsedVisitor();
duke@1 415 v.scan(cdef);
duke@1 416 return v.result;
duke@1 417 }
duke@1 418
duke@1 419 /**************************************************************************
duke@1 420 * Visitor methods
duke@1 421 *************************************************************************/
duke@1 422
duke@1 423 public void visitTopLevel(JCCompilationUnit tree) {
duke@1 424 try {
duke@1 425 printUnit(tree, null);
duke@1 426 } catch (IOException e) {
duke@1 427 throw new UncheckedIOException(e);
duke@1 428 }
duke@1 429 }
duke@1 430
duke@1 431 public void visitImport(JCImport tree) {
duke@1 432 try {
duke@1 433 print("import ");
duke@1 434 if (tree.staticImport) print("static ");
duke@1 435 printExpr(tree.qualid);
duke@1 436 print(";");
duke@1 437 println();
duke@1 438 } catch (IOException e) {
duke@1 439 throw new UncheckedIOException(e);
duke@1 440 }
duke@1 441 }
duke@1 442
duke@1 443 public void visitClassDef(JCClassDecl tree) {
duke@1 444 try {
duke@1 445 println(); align();
duke@1 446 printDocComment(tree);
duke@1 447 printAnnotations(tree.mods.annotations);
duke@1 448 printFlags(tree.mods.flags & ~INTERFACE);
duke@1 449 Name enclClassNamePrev = enclClassName;
duke@1 450 enclClassName = tree.name;
duke@1 451 if ((tree.mods.flags & INTERFACE) != 0) {
duke@1 452 print("interface " + tree.name);
duke@1 453 printTypeParameters(tree.typarams);
duke@1 454 if (tree.implementing.nonEmpty()) {
duke@1 455 print(" extends ");
duke@1 456 printExprs(tree.implementing);
duke@1 457 }
duke@1 458 } else {
duke@1 459 if ((tree.mods.flags & ENUM) != 0)
duke@1 460 print("enum " + tree.name);
duke@1 461 else
duke@1 462 print("class " + tree.name);
duke@1 463 printTypeParameters(tree.typarams);
duke@1 464 if (tree.extending != null) {
duke@1 465 print(" extends ");
duke@1 466 printExpr(tree.extending);
duke@1 467 }
duke@1 468 if (tree.implementing.nonEmpty()) {
duke@1 469 print(" implements ");
duke@1 470 printExprs(tree.implementing);
duke@1 471 }
duke@1 472 }
duke@1 473 print(" ");
duke@1 474 if ((tree.mods.flags & ENUM) != 0) {
duke@1 475 printEnumBody(tree.defs);
duke@1 476 } else {
duke@1 477 printBlock(tree.defs);
duke@1 478 }
duke@1 479 enclClassName = enclClassNamePrev;
duke@1 480 } catch (IOException e) {
duke@1 481 throw new UncheckedIOException(e);
duke@1 482 }
duke@1 483 }
duke@1 484
duke@1 485 public void visitMethodDef(JCMethodDecl tree) {
duke@1 486 try {
duke@1 487 // when producing source output, omit anonymous constructors
jjg@113 488 if (tree.name == tree.name.table.names.init &&
duke@1 489 enclClassName == null &&
duke@1 490 sourceOutput) return;
duke@1 491 println(); align();
duke@1 492 printDocComment(tree);
duke@1 493 printExpr(tree.mods);
duke@1 494 printTypeParameters(tree.typarams);
jjg@113 495 if (tree.name == tree.name.table.names.init) {
duke@1 496 print(enclClassName != null ? enclClassName : tree.name);
duke@1 497 } else {
duke@1 498 printExpr(tree.restype);
duke@1 499 print(" " + tree.name);
duke@1 500 }
duke@1 501 print("(");
jjg@1521 502 if (tree.recvparam!=null) {
jjg@1521 503 printExpr(tree.recvparam);
jjg@1521 504 if (tree.params.size() > 0) {
jjg@1521 505 print(", ");
jjg@1521 506 }
jjg@1521 507 }
duke@1 508 printExprs(tree.params);
duke@1 509 print(")");
duke@1 510 if (tree.thrown.nonEmpty()) {
duke@1 511 print(" throws ");
duke@1 512 printExprs(tree.thrown);
duke@1 513 }
jjg@461 514 if (tree.defaultValue != null) {
jjg@461 515 print(" default ");
jjg@461 516 printExpr(tree.defaultValue);
jjg@461 517 }
duke@1 518 if (tree.body != null) {
duke@1 519 print(" ");
duke@1 520 printStat(tree.body);
duke@1 521 } else {
duke@1 522 print(";");
duke@1 523 }
duke@1 524 } catch (IOException e) {
duke@1 525 throw new UncheckedIOException(e);
duke@1 526 }
duke@1 527 }
duke@1 528
duke@1 529 public void visitVarDef(JCVariableDecl tree) {
duke@1 530 try {
jjg@1280 531 if (docComments != null && docComments.hasComment(tree)) {
duke@1 532 println(); align();
duke@1 533 }
duke@1 534 printDocComment(tree);
duke@1 535 if ((tree.mods.flags & ENUM) != 0) {
duke@1 536 print("/*public static final*/ ");
duke@1 537 print(tree.name);
duke@1 538 if (tree.init != null) {
jjg@1127 539 if (sourceOutput && tree.init.hasTag(NEWCLASS)) {
jjg@439 540 print(" /*enum*/ ");
jjg@439 541 JCNewClass init = (JCNewClass) tree.init;
jjg@439 542 if (init.args != null && init.args.nonEmpty()) {
jjg@439 543 print("(");
jjg@439 544 print(init.args);
jjg@439 545 print(")");
jjg@439 546 }
jjg@439 547 if (init.def != null && init.def.defs != null) {
jjg@439 548 print(" ");
jjg@439 549 printBlock(init.def.defs);
jjg@439 550 }
jjg@439 551 return;
jjg@439 552 }
duke@1 553 print(" /* = ");
duke@1 554 printExpr(tree.init);
duke@1 555 print(" */");
duke@1 556 }
duke@1 557 } else {
duke@1 558 printExpr(tree.mods);
duke@1 559 if ((tree.mods.flags & VARARGS) != 0) {
jjg@1521 560 JCTree vartype = tree.vartype;
jjg@1521 561 List<JCAnnotation> tas = null;
jjg@1521 562 if (vartype instanceof JCAnnotatedType) {
jjg@1521 563 tas = ((JCAnnotatedType)vartype).annotations;
jjg@1521 564 vartype = ((JCAnnotatedType)vartype).underlyingType;
jjg@1521 565 }
jjg@1521 566 printExpr(((JCArrayTypeTree) vartype).elemtype);
jjg@1521 567 if (tas != null)
jjg@1521 568 printTypeAnnotations(tas);
duke@1 569 print("... " + tree.name);
duke@1 570 } else {
duke@1 571 printExpr(tree.vartype);
duke@1 572 print(" " + tree.name);
duke@1 573 }
duke@1 574 if (tree.init != null) {
duke@1 575 print(" = ");
duke@1 576 printExpr(tree.init);
duke@1 577 }
duke@1 578 if (prec == TreeInfo.notExpression) print(";");
duke@1 579 }
duke@1 580 } catch (IOException e) {
duke@1 581 throw new UncheckedIOException(e);
duke@1 582 }
duke@1 583 }
duke@1 584
duke@1 585 public void visitSkip(JCSkip tree) {
duke@1 586 try {
duke@1 587 print(";");
duke@1 588 } catch (IOException e) {
duke@1 589 throw new UncheckedIOException(e);
duke@1 590 }
duke@1 591 }
duke@1 592
duke@1 593 public void visitBlock(JCBlock tree) {
duke@1 594 try {
duke@1 595 printFlags(tree.flags);
duke@1 596 printBlock(tree.stats);
duke@1 597 } catch (IOException e) {
duke@1 598 throw new UncheckedIOException(e);
duke@1 599 }
duke@1 600 }
duke@1 601
duke@1 602 public void visitDoLoop(JCDoWhileLoop tree) {
duke@1 603 try {
duke@1 604 print("do ");
duke@1 605 printStat(tree.body);
duke@1 606 align();
duke@1 607 print(" while ");
jjg@1127 608 if (tree.cond.hasTag(PARENS)) {
duke@1 609 printExpr(tree.cond);
duke@1 610 } else {
duke@1 611 print("(");
duke@1 612 printExpr(tree.cond);
duke@1 613 print(")");
duke@1 614 }
duke@1 615 print(";");
duke@1 616 } catch (IOException e) {
duke@1 617 throw new UncheckedIOException(e);
duke@1 618 }
duke@1 619 }
duke@1 620
duke@1 621 public void visitWhileLoop(JCWhileLoop tree) {
duke@1 622 try {
duke@1 623 print("while ");
jjg@1127 624 if (tree.cond.hasTag(PARENS)) {
duke@1 625 printExpr(tree.cond);
duke@1 626 } else {
duke@1 627 print("(");
duke@1 628 printExpr(tree.cond);
duke@1 629 print(")");
duke@1 630 }
duke@1 631 print(" ");
duke@1 632 printStat(tree.body);
duke@1 633 } catch (IOException e) {
duke@1 634 throw new UncheckedIOException(e);
duke@1 635 }
duke@1 636 }
duke@1 637
duke@1 638 public void visitForLoop(JCForLoop tree) {
duke@1 639 try {
duke@1 640 print("for (");
duke@1 641 if (tree.init.nonEmpty()) {
jjg@1127 642 if (tree.init.head.hasTag(VARDEF)) {
duke@1 643 printExpr(tree.init.head);
duke@1 644 for (List<JCStatement> l = tree.init.tail; l.nonEmpty(); l = l.tail) {
duke@1 645 JCVariableDecl vdef = (JCVariableDecl)l.head;
duke@1 646 print(", " + vdef.name + " = ");
duke@1 647 printExpr(vdef.init);
duke@1 648 }
duke@1 649 } else {
duke@1 650 printExprs(tree.init);
duke@1 651 }
duke@1 652 }
duke@1 653 print("; ");
duke@1 654 if (tree.cond != null) printExpr(tree.cond);
duke@1 655 print("; ");
duke@1 656 printExprs(tree.step);
duke@1 657 print(") ");
duke@1 658 printStat(tree.body);
duke@1 659 } catch (IOException e) {
duke@1 660 throw new UncheckedIOException(e);
duke@1 661 }
duke@1 662 }
duke@1 663
duke@1 664 public void visitForeachLoop(JCEnhancedForLoop tree) {
duke@1 665 try {
duke@1 666 print("for (");
duke@1 667 printExpr(tree.var);
duke@1 668 print(" : ");
duke@1 669 printExpr(tree.expr);
duke@1 670 print(") ");
duke@1 671 printStat(tree.body);
duke@1 672 } catch (IOException e) {
duke@1 673 throw new UncheckedIOException(e);
duke@1 674 }
duke@1 675 }
duke@1 676
duke@1 677 public void visitLabelled(JCLabeledStatement tree) {
duke@1 678 try {
duke@1 679 print(tree.label + ": ");
duke@1 680 printStat(tree.body);
duke@1 681 } catch (IOException e) {
duke@1 682 throw new UncheckedIOException(e);
duke@1 683 }
duke@1 684 }
duke@1 685
duke@1 686 public void visitSwitch(JCSwitch tree) {
duke@1 687 try {
duke@1 688 print("switch ");
jjg@1127 689 if (tree.selector.hasTag(PARENS)) {
duke@1 690 printExpr(tree.selector);
duke@1 691 } else {
duke@1 692 print("(");
duke@1 693 printExpr(tree.selector);
duke@1 694 print(")");
duke@1 695 }
duke@1 696 print(" {");
duke@1 697 println();
duke@1 698 printStats(tree.cases);
duke@1 699 align();
duke@1 700 print("}");
duke@1 701 } catch (IOException e) {
duke@1 702 throw new UncheckedIOException(e);
duke@1 703 }
duke@1 704 }
duke@1 705
duke@1 706 public void visitCase(JCCase tree) {
duke@1 707 try {
duke@1 708 if (tree.pat == null) {
duke@1 709 print("default");
duke@1 710 } else {
duke@1 711 print("case ");
duke@1 712 printExpr(tree.pat);
duke@1 713 }
duke@1 714 print(": ");
duke@1 715 println();
duke@1 716 indent();
duke@1 717 printStats(tree.stats);
duke@1 718 undent();
duke@1 719 align();
duke@1 720 } catch (IOException e) {
duke@1 721 throw new UncheckedIOException(e);
duke@1 722 }
duke@1 723 }
duke@1 724
duke@1 725 public void visitSynchronized(JCSynchronized tree) {
duke@1 726 try {
duke@1 727 print("synchronized ");
jjg@1127 728 if (tree.lock.hasTag(PARENS)) {
duke@1 729 printExpr(tree.lock);
duke@1 730 } else {
duke@1 731 print("(");
duke@1 732 printExpr(tree.lock);
duke@1 733 print(")");
duke@1 734 }
duke@1 735 print(" ");
duke@1 736 printStat(tree.body);
duke@1 737 } catch (IOException e) {
duke@1 738 throw new UncheckedIOException(e);
duke@1 739 }
duke@1 740 }
duke@1 741
duke@1 742 public void visitTry(JCTry tree) {
duke@1 743 try {
duke@1 744 print("try ");
darcy@609 745 if (tree.resources.nonEmpty()) {
darcy@609 746 print("(");
darcy@609 747 boolean first = true;
darcy@609 748 for (JCTree var : tree.resources) {
darcy@609 749 if (!first) {
darcy@609 750 println();
darcy@609 751 indent();
darcy@609 752 }
darcy@609 753 printStat(var);
darcy@609 754 first = false;
darcy@609 755 }
darcy@609 756 print(") ");
darcy@609 757 }
duke@1 758 printStat(tree.body);
duke@1 759 for (List<JCCatch> l = tree.catchers; l.nonEmpty(); l = l.tail) {
duke@1 760 printStat(l.head);
duke@1 761 }
duke@1 762 if (tree.finalizer != null) {
duke@1 763 print(" finally ");
duke@1 764 printStat(tree.finalizer);
duke@1 765 }
duke@1 766 } catch (IOException e) {
duke@1 767 throw new UncheckedIOException(e);
duke@1 768 }
duke@1 769 }
duke@1 770
duke@1 771 public void visitCatch(JCCatch tree) {
duke@1 772 try {
duke@1 773 print(" catch (");
duke@1 774 printExpr(tree.param);
duke@1 775 print(") ");
duke@1 776 printStat(tree.body);
duke@1 777 } catch (IOException e) {
duke@1 778 throw new UncheckedIOException(e);
duke@1 779 }
duke@1 780 }
duke@1 781
duke@1 782 public void visitConditional(JCConditional tree) {
duke@1 783 try {
duke@1 784 open(prec, TreeInfo.condPrec);
duke@1 785 printExpr(tree.cond, TreeInfo.condPrec);
duke@1 786 print(" ? ");
duke@1 787 printExpr(tree.truepart, TreeInfo.condPrec);
duke@1 788 print(" : ");
duke@1 789 printExpr(tree.falsepart, TreeInfo.condPrec);
duke@1 790 close(prec, TreeInfo.condPrec);
duke@1 791 } catch (IOException e) {
duke@1 792 throw new UncheckedIOException(e);
duke@1 793 }
duke@1 794 }
duke@1 795
duke@1 796 public void visitIf(JCIf tree) {
duke@1 797 try {
duke@1 798 print("if ");
jjg@1127 799 if (tree.cond.hasTag(PARENS)) {
duke@1 800 printExpr(tree.cond);
duke@1 801 } else {
duke@1 802 print("(");
duke@1 803 printExpr(tree.cond);
duke@1 804 print(")");
duke@1 805 }
duke@1 806 print(" ");
duke@1 807 printStat(tree.thenpart);
duke@1 808 if (tree.elsepart != null) {
duke@1 809 print(" else ");
duke@1 810 printStat(tree.elsepart);
duke@1 811 }
duke@1 812 } catch (IOException e) {
duke@1 813 throw new UncheckedIOException(e);
duke@1 814 }
duke@1 815 }
duke@1 816
duke@1 817 public void visitExec(JCExpressionStatement tree) {
duke@1 818 try {
duke@1 819 printExpr(tree.expr);
duke@1 820 if (prec == TreeInfo.notExpression) print(";");
duke@1 821 } catch (IOException e) {
duke@1 822 throw new UncheckedIOException(e);
duke@1 823 }
duke@1 824 }
duke@1 825
duke@1 826 public void visitBreak(JCBreak tree) {
duke@1 827 try {
duke@1 828 print("break");
duke@1 829 if (tree.label != null) print(" " + tree.label);
duke@1 830 print(";");
duke@1 831 } catch (IOException e) {
duke@1 832 throw new UncheckedIOException(e);
duke@1 833 }
duke@1 834 }
duke@1 835
duke@1 836 public void visitContinue(JCContinue tree) {
duke@1 837 try {
duke@1 838 print("continue");
duke@1 839 if (tree.label != null) print(" " + tree.label);
duke@1 840 print(";");
duke@1 841 } catch (IOException e) {
duke@1 842 throw new UncheckedIOException(e);
duke@1 843 }
duke@1 844 }
duke@1 845
duke@1 846 public void visitReturn(JCReturn tree) {
duke@1 847 try {
duke@1 848 print("return");
duke@1 849 if (tree.expr != null) {
duke@1 850 print(" ");
duke@1 851 printExpr(tree.expr);
duke@1 852 }
duke@1 853 print(";");
duke@1 854 } catch (IOException e) {
duke@1 855 throw new UncheckedIOException(e);
duke@1 856 }
duke@1 857 }
duke@1 858
duke@1 859 public void visitThrow(JCThrow tree) {
duke@1 860 try {
duke@1 861 print("throw ");
duke@1 862 printExpr(tree.expr);
duke@1 863 print(";");
duke@1 864 } catch (IOException e) {
duke@1 865 throw new UncheckedIOException(e);
duke@1 866 }
duke@1 867 }
duke@1 868
duke@1 869 public void visitAssert(JCAssert tree) {
duke@1 870 try {
duke@1 871 print("assert ");
duke@1 872 printExpr(tree.cond);
duke@1 873 if (tree.detail != null) {
duke@1 874 print(" : ");
duke@1 875 printExpr(tree.detail);
duke@1 876 }
duke@1 877 print(";");
duke@1 878 } catch (IOException e) {
duke@1 879 throw new UncheckedIOException(e);
duke@1 880 }
duke@1 881 }
duke@1 882
duke@1 883 public void visitApply(JCMethodInvocation tree) {
duke@1 884 try {
duke@1 885 if (!tree.typeargs.isEmpty()) {
jjg@1127 886 if (tree.meth.hasTag(SELECT)) {
duke@1 887 JCFieldAccess left = (JCFieldAccess)tree.meth;
duke@1 888 printExpr(left.selected);
duke@1 889 print(".<");
duke@1 890 printExprs(tree.typeargs);
duke@1 891 print(">" + left.name);
duke@1 892 } else {
duke@1 893 print("<");
duke@1 894 printExprs(tree.typeargs);
duke@1 895 print(">");
duke@1 896 printExpr(tree.meth);
duke@1 897 }
duke@1 898 } else {
duke@1 899 printExpr(tree.meth);
duke@1 900 }
duke@1 901 print("(");
duke@1 902 printExprs(tree.args);
duke@1 903 print(")");
duke@1 904 } catch (IOException e) {
duke@1 905 throw new UncheckedIOException(e);
duke@1 906 }
duke@1 907 }
duke@1 908
duke@1 909 public void visitNewClass(JCNewClass tree) {
duke@1 910 try {
duke@1 911 if (tree.encl != null) {
duke@1 912 printExpr(tree.encl);
duke@1 913 print(".");
duke@1 914 }
duke@1 915 print("new ");
duke@1 916 if (!tree.typeargs.isEmpty()) {
duke@1 917 print("<");
duke@1 918 printExprs(tree.typeargs);
duke@1 919 print(">");
duke@1 920 }
duke@1 921 printExpr(tree.clazz);
duke@1 922 print("(");
duke@1 923 printExprs(tree.args);
duke@1 924 print(")");
duke@1 925 if (tree.def != null) {
duke@1 926 Name enclClassNamePrev = enclClassName;
duke@1 927 enclClassName =
duke@1 928 tree.def.name != null ? tree.def.name :
jjg@113 929 tree.type != null && tree.type.tsym.name != tree.type.tsym.name.table.names.empty
jjg@113 930 ? tree.type.tsym.name : null;
duke@1 931 if ((tree.def.mods.flags & Flags.ENUM) != 0) print("/*enum*/");
duke@1 932 printBlock(tree.def.defs);
duke@1 933 enclClassName = enclClassNamePrev;
duke@1 934 }
duke@1 935 } catch (IOException e) {
duke@1 936 throw new UncheckedIOException(e);
duke@1 937 }
duke@1 938 }
duke@1 939
duke@1 940 public void visitNewArray(JCNewArray tree) {
duke@1 941 try {
duke@1 942 if (tree.elemtype != null) {
duke@1 943 print("new ");
jjg@1521 944 printTypeAnnotations(tree.annotations);
duke@1 945 JCTree elem = tree.elemtype;
jjg@1521 946 printBaseElementType(elem);
jjg@1521 947 boolean isElemAnnoType = elem instanceof JCAnnotatedType;
jjg@1521 948 int i = 0;
jjg@1521 949 List<List<JCAnnotation>> da = tree.dimAnnotations;
duke@1 950 for (List<JCExpression> l = tree.dims; l.nonEmpty(); l = l.tail) {
jjg@1521 951 if (da.size() > i) {
jjg@1521 952 printTypeAnnotations(da.get(i));
jjg@1521 953 }
duke@1 954 print("[");
jjg@1521 955 i++;
duke@1 956 printExpr(l.head);
duke@1 957 print("]");
duke@1 958 }
jjg@1521 959 if (tree.elems != null) {
jjg@1521 960 if (isElemAnnoType) {
jjg@1521 961 printTypeAnnotations(((JCAnnotatedType)tree.elemtype).annotations);
jjg@1521 962 }
jjg@1521 963 print("[]");
jjg@1521 964 }
jjg@1521 965 if (isElemAnnoType)
jjg@1521 966 elem = ((JCAnnotatedType)elem).underlyingType;
duke@1 967 if (elem instanceof JCArrayTypeTree)
duke@1 968 printBrackets((JCArrayTypeTree) elem);
duke@1 969 }
duke@1 970 if (tree.elems != null) {
jjg@815 971 if (tree.elemtype != null) print("[]");
duke@1 972 print("{");
duke@1 973 printExprs(tree.elems);
duke@1 974 print("}");
duke@1 975 }
duke@1 976 } catch (IOException e) {
duke@1 977 throw new UncheckedIOException(e);
duke@1 978 }
duke@1 979 }
duke@1 980
mcimadamore@1142 981 public void visitLambda(JCLambda tree) {
mcimadamore@1142 982 try {
mcimadamore@1142 983 print("(");
mcimadamore@1510 984 if (tree.paramKind == JCLambda.ParameterKind.EXPLICIT) {
mcimadamore@1348 985 printExprs(tree.params);
mcimadamore@1348 986 } else {
mcimadamore@1348 987 String sep = "";
mcimadamore@1348 988 for (JCVariableDecl param : tree.params) {
mcimadamore@1348 989 print(sep);
mcimadamore@1348 990 print(param.name);
mcimadamore@1348 991 sep = ",";
mcimadamore@1348 992 }
mcimadamore@1348 993 }
mcimadamore@1142 994 print(")->");
mcimadamore@1142 995 printExpr(tree.body);
mcimadamore@1142 996 } catch (IOException e) {
mcimadamore@1142 997 throw new UncheckedIOException(e);
mcimadamore@1142 998 }
mcimadamore@1142 999 }
mcimadamore@1142 1000
duke@1 1001 public void visitParens(JCParens tree) {
duke@1 1002 try {
duke@1 1003 print("(");
duke@1 1004 printExpr(tree.expr);
duke@1 1005 print(")");
duke@1 1006 } catch (IOException e) {
duke@1 1007 throw new UncheckedIOException(e);
duke@1 1008 }
duke@1 1009 }
duke@1 1010
duke@1 1011 public void visitAssign(JCAssign tree) {
duke@1 1012 try {
duke@1 1013 open(prec, TreeInfo.assignPrec);
duke@1 1014 printExpr(tree.lhs, TreeInfo.assignPrec + 1);
duke@1 1015 print(" = ");
duke@1 1016 printExpr(tree.rhs, TreeInfo.assignPrec);
duke@1 1017 close(prec, TreeInfo.assignPrec);
duke@1 1018 } catch (IOException e) {
duke@1 1019 throw new UncheckedIOException(e);
duke@1 1020 }
duke@1 1021 }
duke@1 1022
jjg@1127 1023 public String operatorName(JCTree.Tag tag) {
duke@1 1024 switch(tag) {
jjg@1127 1025 case POS: return "+";
jjg@1127 1026 case NEG: return "-";
jjg@1127 1027 case NOT: return "!";
jjg@1127 1028 case COMPL: return "~";
jjg@1127 1029 case PREINC: return "++";
jjg@1127 1030 case PREDEC: return "--";
jjg@1127 1031 case POSTINC: return "++";
jjg@1127 1032 case POSTDEC: return "--";
jjg@1127 1033 case NULLCHK: return "<*nullchk*>";
jjg@1127 1034 case OR: return "||";
jjg@1127 1035 case AND: return "&&";
jjg@1127 1036 case EQ: return "==";
jjg@1127 1037 case NE: return "!=";
jjg@1127 1038 case LT: return "<";
jjg@1127 1039 case GT: return ">";
jjg@1127 1040 case LE: return "<=";
jjg@1127 1041 case GE: return ">=";
jjg@1127 1042 case BITOR: return "|";
jjg@1127 1043 case BITXOR: return "^";
jjg@1127 1044 case BITAND: return "&";
jjg@1127 1045 case SL: return "<<";
jjg@1127 1046 case SR: return ">>";
jjg@1127 1047 case USR: return ">>>";
jjg@1127 1048 case PLUS: return "+";
jjg@1127 1049 case MINUS: return "-";
jjg@1127 1050 case MUL: return "*";
jjg@1127 1051 case DIV: return "/";
jjg@1127 1052 case MOD: return "%";
duke@1 1053 default: throw new Error();
duke@1 1054 }
duke@1 1055 }
duke@1 1056
duke@1 1057 public void visitAssignop(JCAssignOp tree) {
duke@1 1058 try {
duke@1 1059 open(prec, TreeInfo.assignopPrec);
duke@1 1060 printExpr(tree.lhs, TreeInfo.assignopPrec + 1);
jjg@1127 1061 print(" " + operatorName(tree.getTag().noAssignOp()) + "= ");
duke@1 1062 printExpr(tree.rhs, TreeInfo.assignopPrec);
duke@1 1063 close(prec, TreeInfo.assignopPrec);
duke@1 1064 } catch (IOException e) {
duke@1 1065 throw new UncheckedIOException(e);
duke@1 1066 }
duke@1 1067 }
duke@1 1068
duke@1 1069 public void visitUnary(JCUnary tree) {
duke@1 1070 try {
duke@1 1071 int ownprec = TreeInfo.opPrec(tree.getTag());
duke@1 1072 String opname = operatorName(tree.getTag());
duke@1 1073 open(prec, ownprec);
jjg@1127 1074 if (!tree.getTag().isPostUnaryOp()) {
duke@1 1075 print(opname);
duke@1 1076 printExpr(tree.arg, ownprec);
duke@1 1077 } else {
duke@1 1078 printExpr(tree.arg, ownprec);
duke@1 1079 print(opname);
duke@1 1080 }
duke@1 1081 close(prec, ownprec);
duke@1 1082 } catch (IOException e) {
duke@1 1083 throw new UncheckedIOException(e);
duke@1 1084 }
duke@1 1085 }
duke@1 1086
duke@1 1087 public void visitBinary(JCBinary tree) {
duke@1 1088 try {
duke@1 1089 int ownprec = TreeInfo.opPrec(tree.getTag());
duke@1 1090 String opname = operatorName(tree.getTag());
duke@1 1091 open(prec, ownprec);
duke@1 1092 printExpr(tree.lhs, ownprec);
duke@1 1093 print(" " + opname + " ");
duke@1 1094 printExpr(tree.rhs, ownprec + 1);
duke@1 1095 close(prec, ownprec);
duke@1 1096 } catch (IOException e) {
duke@1 1097 throw new UncheckedIOException(e);
duke@1 1098 }
duke@1 1099 }
duke@1 1100
duke@1 1101 public void visitTypeCast(JCTypeCast tree) {
duke@1 1102 try {
duke@1 1103 open(prec, TreeInfo.prefixPrec);
duke@1 1104 print("(");
duke@1 1105 printExpr(tree.clazz);
duke@1 1106 print(")");
duke@1 1107 printExpr(tree.expr, TreeInfo.prefixPrec);
duke@1 1108 close(prec, TreeInfo.prefixPrec);
duke@1 1109 } catch (IOException e) {
duke@1 1110 throw new UncheckedIOException(e);
duke@1 1111 }
duke@1 1112 }
duke@1 1113
duke@1 1114 public void visitTypeTest(JCInstanceOf tree) {
duke@1 1115 try {
duke@1 1116 open(prec, TreeInfo.ordPrec);
duke@1 1117 printExpr(tree.expr, TreeInfo.ordPrec);
duke@1 1118 print(" instanceof ");
duke@1 1119 printExpr(tree.clazz, TreeInfo.ordPrec + 1);
duke@1 1120 close(prec, TreeInfo.ordPrec);
duke@1 1121 } catch (IOException e) {
duke@1 1122 throw new UncheckedIOException(e);
duke@1 1123 }
duke@1 1124 }
duke@1 1125
duke@1 1126 public void visitIndexed(JCArrayAccess tree) {
duke@1 1127 try {
duke@1 1128 printExpr(tree.indexed, TreeInfo.postfixPrec);
duke@1 1129 print("[");
duke@1 1130 printExpr(tree.index);
duke@1 1131 print("]");
duke@1 1132 } catch (IOException e) {
duke@1 1133 throw new UncheckedIOException(e);
duke@1 1134 }
duke@1 1135 }
duke@1 1136
duke@1 1137 public void visitSelect(JCFieldAccess tree) {
duke@1 1138 try {
duke@1 1139 printExpr(tree.selected, TreeInfo.postfixPrec);
duke@1 1140 print("." + tree.name);
duke@1 1141 } catch (IOException e) {
duke@1 1142 throw new UncheckedIOException(e);
duke@1 1143 }
duke@1 1144 }
duke@1 1145
mcimadamore@1143 1146 public void visitReference(JCMemberReference tree) {
mcimadamore@1143 1147 try {
mcimadamore@1143 1148 printExpr(tree.expr);
mcimadamore@1415 1149 print("::");
mcimadamore@1143 1150 if (tree.typeargs != null) {
mcimadamore@1143 1151 print("<");
mcimadamore@1143 1152 printExprs(tree.typeargs);
mcimadamore@1143 1153 print(">");
mcimadamore@1143 1154 }
mcimadamore@1143 1155 print(tree.getMode() == ReferenceMode.INVOKE ? tree.name : "new");
mcimadamore@1143 1156 } catch (IOException e) {
mcimadamore@1143 1157 throw new UncheckedIOException(e);
mcimadamore@1143 1158 }
mcimadamore@1143 1159 }
mcimadamore@1143 1160
duke@1 1161 public void visitIdent(JCIdent tree) {
duke@1 1162 try {
duke@1 1163 print(tree.name);
duke@1 1164 } catch (IOException e) {
duke@1 1165 throw new UncheckedIOException(e);
duke@1 1166 }
duke@1 1167 }
duke@1 1168
duke@1 1169 public void visitLiteral(JCLiteral tree) {
duke@1 1170 try {
duke@1 1171 switch (tree.typetag) {
jjg@1374 1172 case INT:
duke@1 1173 print(tree.value.toString());
duke@1 1174 break;
jjg@1374 1175 case LONG:
duke@1 1176 print(tree.value + "L");
duke@1 1177 break;
jjg@1374 1178 case FLOAT:
duke@1 1179 print(tree.value + "F");
duke@1 1180 break;
jjg@1374 1181 case DOUBLE:
duke@1 1182 print(tree.value.toString());
duke@1 1183 break;
jjg@1374 1184 case CHAR:
duke@1 1185 print("\'" +
duke@1 1186 Convert.quote(
duke@1 1187 String.valueOf((char)((Number)tree.value).intValue())) +
duke@1 1188 "\'");
duke@1 1189 break;
jjg@1374 1190 case BOOLEAN:
duke@1 1191 print(((Number)tree.value).intValue() == 1 ? "true" : "false");
duke@1 1192 break;
jjg@1374 1193 case BOT:
duke@1 1194 print("null");
duke@1 1195 break;
duke@1 1196 default:
duke@1 1197 print("\"" + Convert.quote(tree.value.toString()) + "\"");
duke@1 1198 break;
duke@1 1199 }
duke@1 1200 } catch (IOException e) {
duke@1 1201 throw new UncheckedIOException(e);
duke@1 1202 }
duke@1 1203 }
duke@1 1204
duke@1 1205 public void visitTypeIdent(JCPrimitiveTypeTree tree) {
duke@1 1206 try {
duke@1 1207 switch(tree.typetag) {
jjg@1374 1208 case BYTE:
duke@1 1209 print("byte");
duke@1 1210 break;
jjg@1374 1211 case CHAR:
duke@1 1212 print("char");
duke@1 1213 break;
jjg@1374 1214 case SHORT:
duke@1 1215 print("short");
duke@1 1216 break;
jjg@1374 1217 case INT:
duke@1 1218 print("int");
duke@1 1219 break;
jjg@1374 1220 case LONG:
duke@1 1221 print("long");
duke@1 1222 break;
jjg@1374 1223 case FLOAT:
duke@1 1224 print("float");
duke@1 1225 break;
jjg@1374 1226 case DOUBLE:
duke@1 1227 print("double");
duke@1 1228 break;
jjg@1374 1229 case BOOLEAN:
duke@1 1230 print("boolean");
duke@1 1231 break;
jjg@1374 1232 case VOID:
duke@1 1233 print("void");
duke@1 1234 break;
duke@1 1235 default:
duke@1 1236 print("error");
duke@1 1237 break;
duke@1 1238 }
duke@1 1239 } catch (IOException e) {
duke@1 1240 throw new UncheckedIOException(e);
duke@1 1241 }
duke@1 1242 }
duke@1 1243
duke@1 1244 public void visitTypeArray(JCArrayTypeTree tree) {
duke@1 1245 try {
duke@1 1246 printBaseElementType(tree);
duke@1 1247 printBrackets(tree);
duke@1 1248 } catch (IOException e) {
duke@1 1249 throw new UncheckedIOException(e);
duke@1 1250 }
duke@1 1251 }
duke@1 1252
duke@1 1253 // Prints the inner element type of a nested array
jjg@308 1254 private void printBaseElementType(JCTree tree) throws IOException {
jjg@470 1255 printExpr(TreeInfo.innermostType(tree));
duke@1 1256 }
duke@1 1257
duke@1 1258 // prints the brackets of a nested array in reverse order
duke@1 1259 private void printBrackets(JCArrayTypeTree tree) throws IOException {
duke@1 1260 JCTree elem;
duke@1 1261 while (true) {
duke@1 1262 elem = tree.elemtype;
jjg@1521 1263 if (elem.hasTag(ANNOTATED_TYPE)) {
jjg@1521 1264 JCAnnotatedType atype = (JCAnnotatedType) elem;
jjg@1521 1265 elem = atype.underlyingType;
jjg@1521 1266 if (!elem.hasTag(TYPEARRAY)) break;
jjg@1521 1267 printTypeAnnotations(atype.annotations);
jjg@1521 1268 }
duke@1 1269 print("[]");
jjg@1127 1270 if (!elem.hasTag(TYPEARRAY)) break;
duke@1 1271 tree = (JCArrayTypeTree) elem;
duke@1 1272 }
duke@1 1273 }
duke@1 1274
duke@1 1275 public void visitTypeApply(JCTypeApply tree) {
duke@1 1276 try {
duke@1 1277 printExpr(tree.clazz);
duke@1 1278 print("<");
duke@1 1279 printExprs(tree.arguments);
duke@1 1280 print(">");
duke@1 1281 } catch (IOException e) {
duke@1 1282 throw new UncheckedIOException(e);
duke@1 1283 }
duke@1 1284 }
duke@1 1285
darcy@969 1286 public void visitTypeUnion(JCTypeUnion tree) {
mcimadamore@550 1287 try {
jjg@724 1288 printExprs(tree.alternatives, " | ");
mcimadamore@550 1289 } catch (IOException e) {
mcimadamore@550 1290 throw new UncheckedIOException(e);
mcimadamore@550 1291 }
mcimadamore@550 1292 }
mcimadamore@550 1293
mcimadamore@1436 1294 public void visitTypeIntersection(JCTypeIntersection tree) {
mcimadamore@1436 1295 try {
mcimadamore@1436 1296 printExprs(tree.bounds, " & ");
mcimadamore@1436 1297 } catch (IOException e) {
mcimadamore@1436 1298 throw new UncheckedIOException(e);
mcimadamore@1436 1299 }
mcimadamore@1436 1300 }
mcimadamore@1436 1301
duke@1 1302 public void visitTypeParameter(JCTypeParameter tree) {
duke@1 1303 try {
duke@1 1304 print(tree.name);
duke@1 1305 if (tree.bounds.nonEmpty()) {
duke@1 1306 print(" extends ");
duke@1 1307 printExprs(tree.bounds, " & ");
duke@1 1308 }
duke@1 1309 } catch (IOException e) {
duke@1 1310 throw new UncheckedIOException(e);
duke@1 1311 }
duke@1 1312 }
duke@1 1313
duke@1 1314 @Override
duke@1 1315 public void visitWildcard(JCWildcard tree) {
duke@1 1316 try {
duke@1 1317 print(tree.kind);
duke@1 1318 if (tree.kind.kind != BoundKind.UNBOUND)
duke@1 1319 printExpr(tree.inner);
duke@1 1320 } catch (IOException e) {
duke@1 1321 throw new UncheckedIOException(e);
duke@1 1322 }
duke@1 1323 }
duke@1 1324
duke@1 1325 @Override
duke@1 1326 public void visitTypeBoundKind(TypeBoundKind tree) {
duke@1 1327 try {
duke@1 1328 print(String.valueOf(tree.kind));
duke@1 1329 } catch (IOException e) {
duke@1 1330 throw new UncheckedIOException(e);
duke@1 1331 }
duke@1 1332 }
duke@1 1333
duke@1 1334 public void visitErroneous(JCErroneous tree) {
duke@1 1335 try {
duke@1 1336 print("(ERROR)");
duke@1 1337 } catch (IOException e) {
duke@1 1338 throw new UncheckedIOException(e);
duke@1 1339 }
duke@1 1340 }
duke@1 1341
duke@1 1342 public void visitLetExpr(LetExpr tree) {
duke@1 1343 try {
duke@1 1344 print("(let " + tree.defs + " in " + tree.expr + ")");
duke@1 1345 } catch (IOException e) {
duke@1 1346 throw new UncheckedIOException(e);
duke@1 1347 }
duke@1 1348 }
duke@1 1349
duke@1 1350 public void visitModifiers(JCModifiers mods) {
duke@1 1351 try {
duke@1 1352 printAnnotations(mods.annotations);
duke@1 1353 printFlags(mods.flags);
duke@1 1354 } catch (IOException e) {
duke@1 1355 throw new UncheckedIOException(e);
duke@1 1356 }
duke@1 1357 }
duke@1 1358
duke@1 1359 public void visitAnnotation(JCAnnotation tree) {
duke@1 1360 try {
duke@1 1361 print("@");
duke@1 1362 printExpr(tree.annotationType);
duke@1 1363 print("(");
duke@1 1364 printExprs(tree.args);
duke@1 1365 print(")");
duke@1 1366 } catch (IOException e) {
duke@1 1367 throw new UncheckedIOException(e);
duke@1 1368 }
duke@1 1369 }
duke@1 1370
jjg@1521 1371 public void visitAnnotatedType(JCAnnotatedType tree) {
jjg@1521 1372 try {
jjg@1521 1373 if (tree.underlyingType.getKind() == JCTree.Kind.MEMBER_SELECT) {
jjg@1521 1374 JCFieldAccess access = (JCFieldAccess) tree.underlyingType;
jjg@1521 1375 printExpr(access.selected, TreeInfo.postfixPrec);
jjg@1521 1376 print(".");
jjg@1521 1377 printTypeAnnotations(tree.annotations);
jjg@1521 1378 print(access.name);
jjg@1521 1379 } else if (tree.underlyingType.getKind() == JCTree.Kind.ARRAY_TYPE) {
jjg@1521 1380 JCArrayTypeTree array = (JCArrayTypeTree) tree.underlyingType;
jjg@1521 1381 printBaseElementType(tree);
jjg@1521 1382 printTypeAnnotations(tree.annotations);
jjg@1521 1383 print("[]");
jjg@1521 1384 JCExpression elem = array.elemtype;
jjg@1521 1385 if (elem.hasTag(TYPEARRAY)) {
jjg@1521 1386 printBrackets((JCArrayTypeTree) elem);
jjg@1521 1387 }
jjg@1521 1388 } else {
jjg@1521 1389 printTypeAnnotations(tree.annotations);
jjg@1521 1390 printExpr(tree.underlyingType);
jjg@1521 1391 }
jjg@1521 1392 } catch (IOException e) {
jjg@1521 1393 throw new UncheckedIOException(e);
jjg@1521 1394 }
jjg@1521 1395 }
jjg@1521 1396
duke@1 1397 public void visitTree(JCTree tree) {
duke@1 1398 try {
duke@1 1399 print("(UNKNOWN: " + tree + ")");
duke@1 1400 println();
duke@1 1401 } catch (IOException e) {
duke@1 1402 throw new UncheckedIOException(e);
duke@1 1403 }
duke@1 1404 }
jjg@308 1405
duke@1 1406 }

mercurial