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

Wed, 06 Apr 2011 19:30:57 -0700

author
darcy
date
Wed, 06 Apr 2011 19:30:57 -0700
changeset 969
8cc5b440fdde
parent 816
7c537f4298fb
child 1142
c896d95e7469
permissions
-rw-r--r--

7033809: Rename "disjunctive" to "union" in javax.lang.model
Reviewed-by: mcimadamore, jjg

duke@1 1 /*
jjg@815 2 * Copyright (c) 2001, 2011, 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 com.sun.tools.javac.util.*;
duke@1 29 import com.sun.tools.javac.tree.JCTree.*;
duke@1 30
duke@1 31 /** A subclass of Tree.Visitor, this class defines
duke@1 32 * a general tree scanner pattern. Translation proceeds recursively in
duke@1 33 * left-to-right order down a tree. There is one visitor method in this class
duke@1 34 * for every possible kind of tree node. To obtain a specific
duke@1 35 * scanner, it suffices to override those visitor methods which
duke@1 36 * do some interesting work. The scanner class itself takes care of all
duke@1 37 * navigational aspects.
duke@1 38 *
jjg@581 39 * <p><b>This is NOT part of any supported API.
jjg@581 40 * If you write code that depends on this, you do so at your own risk.
duke@1 41 * This code and its internal interfaces are subject to change or
duke@1 42 * deletion without notice.</b>
duke@1 43 */
duke@1 44 public class TreeScanner extends Visitor {
duke@1 45
duke@1 46 /** Visitor method: Scan a single node.
duke@1 47 */
duke@1 48 public void scan(JCTree tree) {
duke@1 49 if(tree!=null) tree.accept(this);
duke@1 50 }
duke@1 51
duke@1 52 /** Visitor method: scan a list of nodes.
duke@1 53 */
duke@1 54 public void scan(List<? extends JCTree> trees) {
duke@1 55 if (trees != null)
duke@1 56 for (List<? extends JCTree> l = trees; l.nonEmpty(); l = l.tail)
duke@1 57 scan(l.head);
duke@1 58 }
duke@1 59
duke@1 60
duke@1 61 /* ***************************************************************************
duke@1 62 * Visitor methods
duke@1 63 ****************************************************************************/
duke@1 64
duke@1 65 public void visitTopLevel(JCCompilationUnit tree) {
duke@1 66 scan(tree.packageAnnotations);
duke@1 67 scan(tree.pid);
duke@1 68 scan(tree.defs);
duke@1 69 }
duke@1 70
duke@1 71 public void visitImport(JCImport tree) {
duke@1 72 scan(tree.qualid);
duke@1 73 }
duke@1 74
duke@1 75 public void visitClassDef(JCClassDecl tree) {
duke@1 76 scan(tree.mods);
duke@1 77 scan(tree.typarams);
duke@1 78 scan(tree.extending);
duke@1 79 scan(tree.implementing);
duke@1 80 scan(tree.defs);
duke@1 81 }
duke@1 82
duke@1 83 public void visitMethodDef(JCMethodDecl tree) {
duke@1 84 scan(tree.mods);
duke@1 85 scan(tree.restype);
duke@1 86 scan(tree.typarams);
duke@1 87 scan(tree.params);
duke@1 88 scan(tree.thrown);
jjg@181 89 scan(tree.defaultValue);
duke@1 90 scan(tree.body);
duke@1 91 }
duke@1 92
duke@1 93 public void visitVarDef(JCVariableDecl tree) {
duke@1 94 scan(tree.mods);
duke@1 95 scan(tree.vartype);
duke@1 96 scan(tree.init);
duke@1 97 }
duke@1 98
duke@1 99 public void visitSkip(JCSkip tree) {
duke@1 100 }
duke@1 101
duke@1 102 public void visitBlock(JCBlock tree) {
duke@1 103 scan(tree.stats);
duke@1 104 }
duke@1 105
duke@1 106 public void visitDoLoop(JCDoWhileLoop tree) {
duke@1 107 scan(tree.body);
duke@1 108 scan(tree.cond);
duke@1 109 }
duke@1 110
duke@1 111 public void visitWhileLoop(JCWhileLoop tree) {
duke@1 112 scan(tree.cond);
duke@1 113 scan(tree.body);
duke@1 114 }
duke@1 115
duke@1 116 public void visitForLoop(JCForLoop tree) {
duke@1 117 scan(tree.init);
duke@1 118 scan(tree.cond);
duke@1 119 scan(tree.step);
duke@1 120 scan(tree.body);
duke@1 121 }
duke@1 122
duke@1 123 public void visitForeachLoop(JCEnhancedForLoop tree) {
duke@1 124 scan(tree.var);
duke@1 125 scan(tree.expr);
duke@1 126 scan(tree.body);
duke@1 127 }
duke@1 128
duke@1 129 public void visitLabelled(JCLabeledStatement tree) {
duke@1 130 scan(tree.body);
duke@1 131 }
duke@1 132
duke@1 133 public void visitSwitch(JCSwitch tree) {
duke@1 134 scan(tree.selector);
duke@1 135 scan(tree.cases);
duke@1 136 }
duke@1 137
duke@1 138 public void visitCase(JCCase tree) {
duke@1 139 scan(tree.pat);
duke@1 140 scan(tree.stats);
duke@1 141 }
duke@1 142
duke@1 143 public void visitSynchronized(JCSynchronized tree) {
duke@1 144 scan(tree.lock);
duke@1 145 scan(tree.body);
duke@1 146 }
duke@1 147
duke@1 148 public void visitTry(JCTry tree) {
darcy@609 149 scan(tree.resources);
duke@1 150 scan(tree.body);
duke@1 151 scan(tree.catchers);
duke@1 152 scan(tree.finalizer);
duke@1 153 }
duke@1 154
duke@1 155 public void visitCatch(JCCatch tree) {
duke@1 156 scan(tree.param);
duke@1 157 scan(tree.body);
duke@1 158 }
duke@1 159
duke@1 160 public void visitConditional(JCConditional tree) {
duke@1 161 scan(tree.cond);
duke@1 162 scan(tree.truepart);
duke@1 163 scan(tree.falsepart);
duke@1 164 }
duke@1 165
duke@1 166 public void visitIf(JCIf tree) {
duke@1 167 scan(tree.cond);
duke@1 168 scan(tree.thenpart);
duke@1 169 scan(tree.elsepart);
duke@1 170 }
duke@1 171
duke@1 172 public void visitExec(JCExpressionStatement tree) {
duke@1 173 scan(tree.expr);
duke@1 174 }
duke@1 175
duke@1 176 public void visitBreak(JCBreak tree) {
duke@1 177 }
duke@1 178
duke@1 179 public void visitContinue(JCContinue tree) {
duke@1 180 }
duke@1 181
duke@1 182 public void visitReturn(JCReturn tree) {
duke@1 183 scan(tree.expr);
duke@1 184 }
duke@1 185
duke@1 186 public void visitThrow(JCThrow tree) {
duke@1 187 scan(tree.expr);
duke@1 188 }
duke@1 189
duke@1 190 public void visitAssert(JCAssert tree) {
duke@1 191 scan(tree.cond);
duke@1 192 scan(tree.detail);
duke@1 193 }
duke@1 194
duke@1 195 public void visitApply(JCMethodInvocation tree) {
jjg@489 196 scan(tree.typeargs);
duke@1 197 scan(tree.meth);
duke@1 198 scan(tree.args);
duke@1 199 }
duke@1 200
duke@1 201 public void visitNewClass(JCNewClass tree) {
duke@1 202 scan(tree.encl);
duke@1 203 scan(tree.clazz);
jjg@489 204 scan(tree.typeargs);
duke@1 205 scan(tree.args);
duke@1 206 scan(tree.def);
duke@1 207 }
duke@1 208
duke@1 209 public void visitNewArray(JCNewArray tree) {
duke@1 210 scan(tree.elemtype);
duke@1 211 scan(tree.dims);
duke@1 212 scan(tree.elems);
duke@1 213 }
duke@1 214
duke@1 215 public void visitParens(JCParens tree) {
duke@1 216 scan(tree.expr);
duke@1 217 }
duke@1 218
duke@1 219 public void visitAssign(JCAssign tree) {
duke@1 220 scan(tree.lhs);
duke@1 221 scan(tree.rhs);
duke@1 222 }
duke@1 223
duke@1 224 public void visitAssignop(JCAssignOp tree) {
duke@1 225 scan(tree.lhs);
duke@1 226 scan(tree.rhs);
duke@1 227 }
duke@1 228
duke@1 229 public void visitUnary(JCUnary tree) {
duke@1 230 scan(tree.arg);
duke@1 231 }
duke@1 232
duke@1 233 public void visitBinary(JCBinary tree) {
duke@1 234 scan(tree.lhs);
duke@1 235 scan(tree.rhs);
duke@1 236 }
duke@1 237
duke@1 238 public void visitTypeCast(JCTypeCast tree) {
duke@1 239 scan(tree.clazz);
duke@1 240 scan(tree.expr);
duke@1 241 }
duke@1 242
duke@1 243 public void visitTypeTest(JCInstanceOf tree) {
duke@1 244 scan(tree.expr);
duke@1 245 scan(tree.clazz);
duke@1 246 }
duke@1 247
duke@1 248 public void visitIndexed(JCArrayAccess tree) {
duke@1 249 scan(tree.indexed);
duke@1 250 scan(tree.index);
duke@1 251 }
duke@1 252
duke@1 253 public void visitSelect(JCFieldAccess tree) {
duke@1 254 scan(tree.selected);
duke@1 255 }
duke@1 256
duke@1 257 public void visitIdent(JCIdent tree) {
duke@1 258 }
duke@1 259
duke@1 260 public void visitLiteral(JCLiteral tree) {
duke@1 261 }
duke@1 262
duke@1 263 public void visitTypeIdent(JCPrimitiveTypeTree tree) {
duke@1 264 }
duke@1 265
duke@1 266 public void visitTypeArray(JCArrayTypeTree tree) {
duke@1 267 scan(tree.elemtype);
duke@1 268 }
duke@1 269
duke@1 270 public void visitTypeApply(JCTypeApply tree) {
duke@1 271 scan(tree.clazz);
duke@1 272 scan(tree.arguments);
duke@1 273 }
duke@1 274
darcy@969 275 public void visitTypeUnion(JCTypeUnion tree) {
jjg@724 276 scan(tree.alternatives);
mcimadamore@550 277 }
mcimadamore@550 278
duke@1 279 public void visitTypeParameter(JCTypeParameter tree) {
duke@1 280 scan(tree.bounds);
duke@1 281 }
duke@1 282
duke@1 283 @Override
duke@1 284 public void visitWildcard(JCWildcard tree) {
duke@1 285 scan(tree.kind);
duke@1 286 if (tree.inner != null)
duke@1 287 scan(tree.inner);
duke@1 288 }
duke@1 289
duke@1 290 @Override
duke@1 291 public void visitTypeBoundKind(TypeBoundKind that) {
duke@1 292 }
duke@1 293
duke@1 294 public void visitModifiers(JCModifiers tree) {
duke@1 295 scan(tree.annotations);
duke@1 296 }
duke@1 297
duke@1 298 public void visitAnnotation(JCAnnotation tree) {
duke@1 299 scan(tree.annotationType);
duke@1 300 scan(tree.args);
duke@1 301 }
duke@1 302
duke@1 303 public void visitErroneous(JCErroneous tree) {
duke@1 304 }
duke@1 305
duke@1 306 public void visitLetExpr(LetExpr tree) {
duke@1 307 scan(tree.defs);
duke@1 308 scan(tree.expr);
duke@1 309 }
duke@1 310
duke@1 311 public void visitTree(JCTree tree) {
jjg@816 312 Assert.error();
duke@1 313 }
duke@1 314 }

mercurial