duke@1: /* duke@1: * Copyright 2001-2006 Sun Microsystems, Inc. All Rights Reserved. duke@1: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@1: * duke@1: * This code is free software; you can redistribute it and/or modify it duke@1: * under the terms of the GNU General Public License version 2 only, as duke@1: * published by the Free Software Foundation. Sun designates this duke@1: * particular file as subject to the "Classpath" exception as provided duke@1: * by Sun in the LICENSE file that accompanied this code. duke@1: * duke@1: * This code is distributed in the hope that it will be useful, but WITHOUT duke@1: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@1: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@1: * version 2 for more details (a copy is included in the LICENSE file that duke@1: * accompanied this code). duke@1: * duke@1: * You should have received a copy of the GNU General Public License version duke@1: * 2 along with this work; if not, write to the Free Software Foundation, duke@1: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@1: * duke@1: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@1: * CA 95054 USA or visit www.sun.com if you need additional information or duke@1: * have any questions. duke@1: */ duke@1: duke@1: package com.sun.tools.javac.tree; duke@1: duke@1: import com.sun.tools.javac.util.*; duke@1: import com.sun.tools.javac.tree.JCTree.*; duke@1: duke@1: /** A subclass of Tree.Visitor, this class defines duke@1: * a general tree scanner pattern. Translation proceeds recursively in duke@1: * left-to-right order down a tree. There is one visitor method in this class duke@1: * for every possible kind of tree node. To obtain a specific duke@1: * scanner, it suffices to override those visitor methods which duke@1: * do some interesting work. The scanner class itself takes care of all duke@1: * navigational aspects. duke@1: * duke@1: *

This is NOT part of any API supported by Sun Microsystems. If duke@1: * you write code that depends on this, you do so at your own risk. duke@1: * This code and its internal interfaces are subject to change or duke@1: * deletion without notice. duke@1: */ duke@1: public class TreeScanner extends Visitor { duke@1: duke@1: /** Visitor method: Scan a single node. duke@1: */ duke@1: public void scan(JCTree tree) { duke@1: if(tree!=null) tree.accept(this); duke@1: } duke@1: duke@1: /** Visitor method: scan a list of nodes. duke@1: */ duke@1: public void scan(List trees) { duke@1: if (trees != null) duke@1: for (List l = trees; l.nonEmpty(); l = l.tail) duke@1: scan(l.head); duke@1: } duke@1: duke@1: duke@1: /* *************************************************************************** duke@1: * Visitor methods duke@1: ****************************************************************************/ duke@1: duke@1: public void visitTopLevel(JCCompilationUnit tree) { duke@1: scan(tree.packageAnnotations); duke@1: scan(tree.pid); duke@1: scan(tree.defs); duke@1: } duke@1: duke@1: public void visitImport(JCImport tree) { duke@1: scan(tree.qualid); duke@1: } duke@1: duke@1: public void visitClassDef(JCClassDecl tree) { duke@1: scan(tree.mods); duke@1: scan(tree.typarams); duke@1: scan(tree.extending); duke@1: scan(tree.implementing); duke@1: scan(tree.defs); duke@1: } duke@1: duke@1: public void visitMethodDef(JCMethodDecl tree) { duke@1: scan(tree.mods); duke@1: scan(tree.restype); duke@1: scan(tree.typarams); duke@1: scan(tree.params); jjg@308: scan(tree.receiverAnnotations); duke@1: scan(tree.thrown); jjg@181: scan(tree.defaultValue); duke@1: scan(tree.body); duke@1: } duke@1: duke@1: public void visitVarDef(JCVariableDecl tree) { duke@1: scan(tree.mods); duke@1: scan(tree.vartype); duke@1: scan(tree.init); duke@1: } duke@1: duke@1: public void visitSkip(JCSkip tree) { duke@1: } duke@1: duke@1: public void visitBlock(JCBlock tree) { duke@1: scan(tree.stats); duke@1: } duke@1: duke@1: public void visitDoLoop(JCDoWhileLoop tree) { duke@1: scan(tree.body); duke@1: scan(tree.cond); duke@1: } duke@1: duke@1: public void visitWhileLoop(JCWhileLoop tree) { duke@1: scan(tree.cond); duke@1: scan(tree.body); duke@1: } duke@1: duke@1: public void visitForLoop(JCForLoop tree) { duke@1: scan(tree.init); duke@1: scan(tree.cond); duke@1: scan(tree.step); duke@1: scan(tree.body); duke@1: } duke@1: duke@1: public void visitForeachLoop(JCEnhancedForLoop tree) { duke@1: scan(tree.var); duke@1: scan(tree.expr); duke@1: scan(tree.body); duke@1: } duke@1: duke@1: public void visitLabelled(JCLabeledStatement tree) { duke@1: scan(tree.body); duke@1: } duke@1: duke@1: public void visitSwitch(JCSwitch tree) { duke@1: scan(tree.selector); duke@1: scan(tree.cases); duke@1: } duke@1: duke@1: public void visitCase(JCCase tree) { duke@1: scan(tree.pat); duke@1: scan(tree.stats); duke@1: } duke@1: duke@1: public void visitSynchronized(JCSynchronized tree) { duke@1: scan(tree.lock); duke@1: scan(tree.body); duke@1: } duke@1: duke@1: public void visitTry(JCTry tree) { duke@1: scan(tree.body); duke@1: scan(tree.catchers); duke@1: scan(tree.finalizer); duke@1: } duke@1: duke@1: public void visitCatch(JCCatch tree) { duke@1: scan(tree.param); duke@1: scan(tree.body); duke@1: } duke@1: duke@1: public void visitConditional(JCConditional tree) { duke@1: scan(tree.cond); duke@1: scan(tree.truepart); duke@1: scan(tree.falsepart); duke@1: } duke@1: duke@1: public void visitIf(JCIf tree) { duke@1: scan(tree.cond); duke@1: scan(tree.thenpart); duke@1: scan(tree.elsepart); duke@1: } duke@1: duke@1: public void visitExec(JCExpressionStatement tree) { duke@1: scan(tree.expr); duke@1: } duke@1: duke@1: public void visitBreak(JCBreak tree) { duke@1: } duke@1: duke@1: public void visitContinue(JCContinue tree) { duke@1: } duke@1: duke@1: public void visitReturn(JCReturn tree) { duke@1: scan(tree.expr); duke@1: } duke@1: duke@1: public void visitThrow(JCThrow tree) { duke@1: scan(tree.expr); duke@1: } duke@1: duke@1: public void visitAssert(JCAssert tree) { duke@1: scan(tree.cond); duke@1: scan(tree.detail); duke@1: } duke@1: duke@1: public void visitApply(JCMethodInvocation tree) { jjg@489: scan(tree.typeargs); duke@1: scan(tree.meth); duke@1: scan(tree.args); duke@1: } duke@1: duke@1: public void visitNewClass(JCNewClass tree) { duke@1: scan(tree.encl); duke@1: scan(tree.clazz); jjg@489: scan(tree.typeargs); duke@1: scan(tree.args); duke@1: scan(tree.def); duke@1: } duke@1: duke@1: public void visitNewArray(JCNewArray tree) { jjg@308: scan(tree.annotations); duke@1: scan(tree.elemtype); duke@1: scan(tree.dims); jjg@308: for (List annos : tree.dimAnnotations) jjg@308: scan(annos); duke@1: scan(tree.elems); duke@1: } duke@1: duke@1: public void visitParens(JCParens tree) { duke@1: scan(tree.expr); duke@1: } duke@1: duke@1: public void visitAssign(JCAssign tree) { duke@1: scan(tree.lhs); duke@1: scan(tree.rhs); duke@1: } duke@1: duke@1: public void visitAssignop(JCAssignOp tree) { duke@1: scan(tree.lhs); duke@1: scan(tree.rhs); duke@1: } duke@1: duke@1: public void visitUnary(JCUnary tree) { duke@1: scan(tree.arg); duke@1: } duke@1: duke@1: public void visitBinary(JCBinary tree) { duke@1: scan(tree.lhs); duke@1: scan(tree.rhs); duke@1: } duke@1: duke@1: public void visitTypeCast(JCTypeCast tree) { duke@1: scan(tree.clazz); duke@1: scan(tree.expr); duke@1: } duke@1: duke@1: public void visitTypeTest(JCInstanceOf tree) { duke@1: scan(tree.expr); duke@1: scan(tree.clazz); duke@1: } duke@1: duke@1: public void visitIndexed(JCArrayAccess tree) { duke@1: scan(tree.indexed); duke@1: scan(tree.index); duke@1: } duke@1: duke@1: public void visitSelect(JCFieldAccess tree) { duke@1: scan(tree.selected); duke@1: } duke@1: duke@1: public void visitIdent(JCIdent tree) { duke@1: } duke@1: duke@1: public void visitLiteral(JCLiteral tree) { duke@1: } duke@1: duke@1: public void visitTypeIdent(JCPrimitiveTypeTree tree) { duke@1: } duke@1: duke@1: public void visitTypeArray(JCArrayTypeTree tree) { duke@1: scan(tree.elemtype); duke@1: } duke@1: duke@1: public void visitTypeApply(JCTypeApply tree) { duke@1: scan(tree.clazz); duke@1: scan(tree.arguments); duke@1: } duke@1: duke@1: public void visitTypeParameter(JCTypeParameter tree) { jjg@308: scan(tree.annotations); duke@1: scan(tree.bounds); duke@1: } duke@1: duke@1: @Override duke@1: public void visitWildcard(JCWildcard tree) { duke@1: scan(tree.kind); duke@1: if (tree.inner != null) duke@1: scan(tree.inner); duke@1: } duke@1: duke@1: @Override duke@1: public void visitTypeBoundKind(TypeBoundKind that) { duke@1: } duke@1: duke@1: public void visitModifiers(JCModifiers tree) { duke@1: scan(tree.annotations); duke@1: } duke@1: duke@1: public void visitAnnotation(JCAnnotation tree) { duke@1: scan(tree.annotationType); duke@1: scan(tree.args); duke@1: } duke@1: jjg@308: public void visitAnnotatedType(JCAnnotatedType tree) { jjg@308: scan(tree.annotations); jjg@308: scan(tree.underlyingType); jjg@308: } jjg@308: duke@1: public void visitErroneous(JCErroneous tree) { duke@1: } duke@1: duke@1: public void visitLetExpr(LetExpr tree) { duke@1: scan(tree.defs); duke@1: scan(tree.expr); duke@1: } duke@1: duke@1: public void visitTree(JCTree tree) { duke@1: assert false; duke@1: } duke@1: }