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

Tue, 28 Dec 2010 15:54:52 -0800

author
ohair
date
Tue, 28 Dec 2010 15:54:52 -0800
changeset 798
4868a36f6fd8
parent 724
7755f47542a0
child 815
d17f37522154
permissions
-rw-r--r--

6962318: Update copyright year
Reviewed-by: xdono

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

mercurial