duke@1: /* xdono@54: * Copyright 1999-2008 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.comp; duke@1: duke@1: import java.util.*; duke@1: duke@1: import com.sun.tools.javac.code.*; duke@1: import com.sun.tools.javac.code.Symbol.*; duke@1: import com.sun.tools.javac.tree.*; duke@1: import com.sun.tools.javac.tree.JCTree.*; duke@1: import com.sun.tools.javac.util.*; duke@1: import com.sun.tools.javac.util.JCDiagnostic.DiagnosticPosition; duke@1: import com.sun.tools.javac.util.List; duke@1: duke@1: import static com.sun.tools.javac.code.Flags.*; duke@1: import static com.sun.tools.javac.code.Kinds.*; duke@1: import static com.sun.tools.javac.code.TypeTags.*; duke@1: duke@1: /** This pass translates Generic Java to conventional Java. 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 TransTypes extends TreeTranslator { duke@1: /** The context key for the TransTypes phase. */ duke@1: protected static final Context.Key transTypesKey = duke@1: new Context.Key(); duke@1: duke@1: /** Get the instance for this context. */ duke@1: public static TransTypes instance(Context context) { duke@1: TransTypes instance = context.get(transTypesKey); duke@1: if (instance == null) duke@1: instance = new TransTypes(context); duke@1: return instance; duke@1: } duke@1: jjg@113: private Names names; duke@1: private Log log; duke@1: private Symtab syms; duke@1: private TreeMaker make; duke@1: private Enter enter; duke@1: private boolean allowEnums; duke@1: private Types types; duke@1: private final Resolve resolve; duke@1: duke@1: /** duke@1: * Flag to indicate whether or not to generate bridge methods. duke@1: * For pre-Tiger source there is no need for bridge methods, so it duke@1: * can be skipped to get better performance for -source 1.4 etc. duke@1: */ duke@1: private final boolean addBridges; duke@1: duke@1: protected TransTypes(Context context) { duke@1: context.put(transTypesKey, this); jjg@113: names = Names.instance(context); duke@1: log = Log.instance(context); duke@1: syms = Symtab.instance(context); duke@1: enter = Enter.instance(context); duke@1: overridden = new HashMap(); duke@1: Source source = Source.instance(context); duke@1: allowEnums = source.allowEnums(); duke@1: addBridges = source.addBridges(); duke@1: types = Types.instance(context); duke@1: make = TreeMaker.instance(context); duke@1: resolve = Resolve.instance(context); duke@1: } duke@1: duke@1: /** A hashtable mapping bridge methods to the methods they override after duke@1: * type erasure. duke@1: */ duke@1: Map overridden; duke@1: duke@1: /** Construct an attributed tree for a cast of expression to target type, duke@1: * unless it already has precisely that type. duke@1: * @param tree The expression tree. duke@1: * @param target The target type. duke@1: */ duke@1: JCExpression cast(JCExpression tree, Type target) { duke@1: int oldpos = make.pos; duke@1: make.at(tree.pos); duke@1: if (!types.isSameType(tree.type, target)) { duke@1: if (!resolve.isAccessible(env, target.tsym)) duke@1: resolve.logAccessError(env, tree, target); duke@1: tree = make.TypeCast(make.Type(target), tree).setType(target); duke@1: } duke@1: make.pos = oldpos; duke@1: return tree; duke@1: } duke@1: duke@1: /** Construct an attributed tree to coerce an expression to some erased duke@1: * target type, unless the expression is already assignable to that type. duke@1: * If target type is a constant type, use its base type instead. duke@1: * @param tree The expression tree. duke@1: * @param target The target type. duke@1: */ duke@1: JCExpression coerce(JCExpression tree, Type target) { duke@1: Type btarget = target.baseType(); duke@1: if (tree.type.isPrimitive() == target.isPrimitive()) { duke@1: return types.isAssignable(tree.type, btarget, Warner.noWarnings) duke@1: ? tree duke@1: : cast(tree, btarget); duke@1: } duke@1: return tree; duke@1: } duke@1: duke@1: /** Given an erased reference type, assume this type as the tree's type. duke@1: * Then, coerce to some given target type unless target type is null. duke@1: * This operation is used in situations like the following: duke@1: * duke@1: * class Cell { A value; } duke@1: * ... duke@1: * Cell cell; duke@1: * Integer x = cell.value; duke@1: * duke@1: * Since the erasure of Cell.value is Object, but the type duke@1: * of cell.value in the assignment is Integer, we need to duke@1: * adjust the original type of cell.value to Object, and insert duke@1: * a cast to Integer. That is, the last assignment becomes: duke@1: * duke@1: * Integer x = (Integer)cell.value; duke@1: * duke@1: * @param tree The expression tree whose type might need adjustment. duke@1: * @param erasedType The expression's type after erasure. duke@1: * @param target The target type, which is usually the erasure of the duke@1: * expression's original type. duke@1: */ duke@1: JCExpression retype(JCExpression tree, Type erasedType, Type target) { duke@1: // System.err.println("retype " + tree + " to " + erasedType);//DEBUG duke@1: if (erasedType.tag > lastBaseTag) { duke@1: if (target != null && target.isPrimitive()) duke@1: target = erasure(tree.type); duke@1: tree.type = erasedType; duke@1: if (target != null) return coerce(tree, target); duke@1: } duke@1: return tree; duke@1: } duke@1: duke@1: /** Translate method argument list, casting each argument duke@1: * to its corresponding type in a list of target types. duke@1: * @param _args The method argument list. duke@1: * @param parameters The list of target types. duke@1: * @param varargsElement The erasure of the varargs element type, duke@1: * or null if translating a non-varargs invocation duke@1: */ duke@1: List translateArgs(List _args, duke@1: List parameters, duke@1: Type varargsElement) { duke@1: if (parameters.isEmpty()) return _args; duke@1: List args = _args; duke@1: while (parameters.tail.nonEmpty()) { duke@1: args.head = translate(args.head, parameters.head); duke@1: args = args.tail; duke@1: parameters = parameters.tail; duke@1: } duke@1: Type parameter = parameters.head; duke@1: assert varargsElement != null || args.length() == 1; duke@1: if (varargsElement != null) { duke@1: while (args.nonEmpty()) { duke@1: args.head = translate(args.head, varargsElement); duke@1: args = args.tail; duke@1: } duke@1: } else { duke@1: args.head = translate(args.head, parameter); duke@1: } duke@1: return _args; duke@1: } duke@1: duke@1: /** Add a bridge definition and enter corresponding method symbol in duke@1: * local scope of origin. duke@1: * duke@1: * @param pos The source code position to be used for the definition. duke@1: * @param meth The method for which a bridge needs to be added duke@1: * @param impl That method's implementation (possibly the method itself) duke@1: * @param origin The class to which the bridge will be added duke@1: * @param hypothetical duke@1: * True if the bridge method is not strictly necessary in the duke@1: * binary, but is represented in the symbol table to detect duke@1: * erasure clashes. duke@1: * @param bridges The list buffer to which the bridge will be added duke@1: */ duke@1: void addBridge(DiagnosticPosition pos, duke@1: MethodSymbol meth, duke@1: MethodSymbol impl, duke@1: ClassSymbol origin, duke@1: boolean hypothetical, duke@1: ListBuffer bridges) { duke@1: make.at(pos); duke@1: Type origType = types.memberType(origin.type, meth); duke@1: Type origErasure = erasure(origType); duke@1: duke@1: // Create a bridge method symbol and a bridge definition without a body. duke@1: Type bridgeType = meth.erasure(types); duke@1: long flags = impl.flags() & AccessFlags | SYNTHETIC | BRIDGE; duke@1: if (hypothetical) flags |= HYPOTHETICAL; duke@1: MethodSymbol bridge = new MethodSymbol(flags, duke@1: meth.name, duke@1: bridgeType, duke@1: origin); duke@1: if (!hypothetical) { duke@1: JCMethodDecl md = make.MethodDef(bridge, null); duke@1: duke@1: // The bridge calls this.impl(..), if we have an implementation duke@1: // in the current class, super.impl(...) otherwise. duke@1: JCExpression receiver = (impl.owner == origin) duke@1: ? make.This(origin.erasure(types)) duke@1: : make.Super(types.supertype(origin.type).tsym.erasure(types), origin); duke@1: duke@1: // The type returned from the original method. duke@1: Type calltype = erasure(impl.type.getReturnType()); duke@1: duke@1: // Construct a call of this.impl(params), or super.impl(params), duke@1: // casting params and possibly results as needed. duke@1: JCExpression call = duke@1: make.Apply( duke@1: null, duke@1: make.Select(receiver, impl).setType(calltype), duke@1: translateArgs(make.Idents(md.params), origErasure.getParameterTypes(), null)) duke@1: .setType(calltype); duke@1: JCStatement stat = (origErasure.getReturnType().tag == VOID) duke@1: ? make.Exec(call) duke@1: : make.Return(coerce(call, bridgeType.getReturnType())); duke@1: md.body = make.Block(0, List.of(stat)); duke@1: duke@1: // Add bridge to `bridges' buffer duke@1: bridges.append(md); duke@1: } duke@1: duke@1: // Add bridge to scope of enclosing class and `overridden' table. duke@1: origin.members().enter(bridge); duke@1: overridden.put(bridge, meth); duke@1: } duke@1: duke@1: /** Add bridge if given symbol is a non-private, non-static member duke@1: * of the given class, which is either defined in the class or non-final duke@1: * inherited, and one of the two following conditions holds: duke@1: * 1. The method's type changes in the given class, as compared to the duke@1: * class where the symbol was defined, (in this case duke@1: * we have extended a parameterized class with non-trivial parameters). duke@1: * 2. The method has an implementation with a different erased return type. duke@1: * (in this case we have used co-variant returns). duke@1: * If a bridge already exists in some other class, no new bridge is added. duke@1: * Instead, it is checked that the bridge symbol overrides the method symbol. duke@1: * (Spec ???). duke@1: * todo: what about bridges for privates??? duke@1: * duke@1: * @param pos The source code position to be used for the definition. duke@1: * @param sym The symbol for which a bridge might have to be added. duke@1: * @param origin The class in which the bridge would go. duke@1: * @param bridges The list buffer to which the bridge would be added. duke@1: */ duke@1: void addBridgeIfNeeded(DiagnosticPosition pos, duke@1: Symbol sym, duke@1: ClassSymbol origin, duke@1: ListBuffer bridges) { duke@1: if (sym.kind == MTH && duke@1: sym.name != names.init && duke@1: (sym.flags() & (PRIVATE | SYNTHETIC | STATIC)) == 0 && duke@1: sym.isMemberOf(origin, types)) duke@1: { duke@1: MethodSymbol meth = (MethodSymbol)sym; duke@1: MethodSymbol bridge = meth.binaryImplementation(origin, types); duke@1: MethodSymbol impl = meth.implementation(origin, types, true); duke@1: if (bridge == null || duke@1: bridge == meth || duke@1: (impl != null && !bridge.owner.isSubClass(impl.owner, types))) { duke@1: // No bridge was added yet. duke@1: if (impl != null && isBridgeNeeded(meth, impl, origin.type)) { duke@1: addBridge(pos, meth, impl, origin, bridge==impl, bridges); duke@1: } else if (impl == meth duke@1: && impl.owner != origin duke@1: && (impl.flags() & FINAL) == 0 duke@1: && (meth.flags() & (ABSTRACT|PUBLIC)) == PUBLIC duke@1: && (origin.flags() & PUBLIC) > (impl.owner.flags() & PUBLIC)) { duke@1: // this is to work around a horrible but permanent duke@1: // reflection design error. duke@1: addBridge(pos, meth, impl, origin, false, bridges); duke@1: } duke@1: } else if ((bridge.flags() & SYNTHETIC) != 0) { duke@1: MethodSymbol other = overridden.get(bridge); duke@1: if (other != null && other != meth) { duke@1: if (impl == null || !impl.overrides(other, origin, types, true)) { duke@1: // Bridge for other symbol pair was added duke@1: log.error(pos, "name.clash.same.erasure.no.override", duke@1: other, other.location(origin.type, types), duke@1: meth, meth.location(origin.type, types)); duke@1: } duke@1: } duke@1: } else if (!bridge.overrides(meth, origin, types, true)) { duke@1: // Accidental binary override without source override. duke@1: if (bridge.owner == origin || duke@1: types.asSuper(bridge.owner.type, meth.owner) == null) duke@1: // Don't diagnose the problem if it would already duke@1: // have been reported in the superclass duke@1: log.error(pos, "name.clash.same.erasure.no.override", duke@1: bridge, bridge.location(origin.type, types), duke@1: meth, meth.location(origin.type, types)); duke@1: } duke@1: } duke@1: } duke@1: // where duke@1: /** duke@1: * @param method The symbol for which a bridge might have to be added duke@1: * @param impl The implementation of method duke@1: * @param dest The type in which the bridge would go duke@1: */ duke@1: private boolean isBridgeNeeded(MethodSymbol method, duke@1: MethodSymbol impl, duke@1: Type dest) { duke@1: if (impl != method) { duke@1: // If either method or impl have different erasures as duke@1: // members of dest, a bridge is needed. duke@1: Type method_erasure = method.erasure(types); duke@1: if (!isSameMemberWhenErased(dest, method, method_erasure)) duke@1: return true; duke@1: Type impl_erasure = impl.erasure(types); duke@1: if (!isSameMemberWhenErased(dest, impl, impl_erasure)) duke@1: return true; duke@1: duke@1: // If the erasure of the return type is different, a duke@1: // bridge is needed. duke@1: return !types.isSameType(impl_erasure.getReturnType(), duke@1: method_erasure.getReturnType()); duke@1: } else { duke@1: // method and impl are the same... duke@1: if ((method.flags() & ABSTRACT) != 0) { duke@1: // ...and abstract so a bridge is not needed. duke@1: // Concrete subclasses will bridge as needed. duke@1: return false; duke@1: } duke@1: duke@1: // The erasure of the return type is always the same duke@1: // for the same symbol. Reducing the three tests in duke@1: // the other branch to just one: duke@1: return !isSameMemberWhenErased(dest, method, method.erasure(types)); duke@1: } duke@1: } duke@1: /** duke@1: * Lookup the method as a member of the type. Compare the duke@1: * erasures. duke@1: * @param type the class where to look for the method duke@1: * @param method the method to look for in class duke@1: * @param erasure the erasure of method duke@1: */ duke@1: private boolean isSameMemberWhenErased(Type type, duke@1: MethodSymbol method, duke@1: Type erasure) { duke@1: return types.isSameType(erasure(types.memberType(type, method)), duke@1: erasure); duke@1: } duke@1: duke@1: void addBridges(DiagnosticPosition pos, duke@1: TypeSymbol i, duke@1: ClassSymbol origin, duke@1: ListBuffer bridges) { duke@1: for (Scope.Entry e = i.members().elems; e != null; e = e.sibling) duke@1: addBridgeIfNeeded(pos, e.sym, origin, bridges); duke@1: for (List l = types.interfaces(i.type); l.nonEmpty(); l = l.tail) duke@1: addBridges(pos, l.head.tsym, origin, bridges); duke@1: } duke@1: duke@1: /** Add all necessary bridges to some class appending them to list buffer. duke@1: * @param pos The source code position to be used for the bridges. duke@1: * @param origin The class in which the bridges go. duke@1: * @param bridges The list buffer to which the bridges are added. duke@1: */ duke@1: void addBridges(DiagnosticPosition pos, ClassSymbol origin, ListBuffer bridges) { duke@1: Type st = types.supertype(origin.type); duke@1: while (st.tag == CLASS) { duke@1: // if (isSpecialization(st)) duke@1: addBridges(pos, st.tsym, origin, bridges); duke@1: st = types.supertype(st); duke@1: } duke@1: for (List l = types.interfaces(origin.type); l.nonEmpty(); l = l.tail) duke@1: // if (isSpecialization(l.head)) duke@1: addBridges(pos, l.head.tsym, origin, bridges); duke@1: } duke@1: duke@1: /* ************************************************************************ duke@1: * Visitor methods duke@1: *************************************************************************/ duke@1: duke@1: /** Visitor argument: proto-type. duke@1: */ duke@1: private Type pt; duke@1: duke@1: /** Visitor method: perform a type translation on tree. duke@1: */ duke@1: public T translate(T tree, Type pt) { duke@1: Type prevPt = this.pt; duke@1: try { duke@1: this.pt = pt; duke@1: return translate(tree); duke@1: } finally { duke@1: this.pt = prevPt; duke@1: } duke@1: } duke@1: duke@1: /** Visitor method: perform a type translation on list of trees. duke@1: */ duke@1: public List translate(List trees, Type pt) { duke@1: Type prevPt = this.pt; duke@1: List res; duke@1: try { duke@1: this.pt = pt; duke@1: res = translate(trees); duke@1: } finally { duke@1: this.pt = prevPt; duke@1: } duke@1: return res; duke@1: } duke@1: duke@1: public void visitClassDef(JCClassDecl tree) { duke@1: translateClass(tree.sym); duke@1: result = tree; duke@1: } duke@1: duke@1: JCMethodDecl currentMethod = null; duke@1: public void visitMethodDef(JCMethodDecl tree) { duke@1: JCMethodDecl previousMethod = currentMethod; duke@1: try { duke@1: currentMethod = tree; duke@1: tree.restype = translate(tree.restype, null); duke@1: tree.typarams = List.nil(); duke@1: tree.params = translateVarDefs(tree.params); duke@1: tree.thrown = translate(tree.thrown, null); duke@1: tree.body = translate(tree.body, tree.sym.erasure(types).getReturnType()); duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } finally { duke@1: currentMethod = previousMethod; duke@1: } duke@1: duke@1: // Check that we do not introduce a name clash by erasing types. duke@1: for (Scope.Entry e = tree.sym.owner.members().lookup(tree.name); duke@1: e.sym != null; duke@1: e = e.next()) { duke@1: if (e.sym != tree.sym && duke@1: types.isSameType(erasure(e.sym.type), tree.type)) { duke@1: log.error(tree.pos(), duke@1: "name.clash.same.erasure", tree.sym, duke@1: e.sym); duke@1: return; duke@1: } duke@1: } duke@1: } duke@1: duke@1: public void visitVarDef(JCVariableDecl tree) { duke@1: tree.vartype = translate(tree.vartype, null); duke@1: tree.init = translate(tree.init, tree.sym.erasure(types)); duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitDoLoop(JCDoWhileLoop tree) { duke@1: tree.body = translate(tree.body); duke@1: tree.cond = translate(tree.cond, syms.booleanType); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitWhileLoop(JCWhileLoop tree) { duke@1: tree.cond = translate(tree.cond, syms.booleanType); duke@1: tree.body = translate(tree.body); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitForLoop(JCForLoop tree) { duke@1: tree.init = translate(tree.init, null); duke@1: if (tree.cond != null) duke@1: tree.cond = translate(tree.cond, syms.booleanType); duke@1: tree.step = translate(tree.step, null); duke@1: tree.body = translate(tree.body); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitForeachLoop(JCEnhancedForLoop tree) { duke@1: tree.var = translate(tree.var, null); duke@1: Type iterableType = tree.expr.type; duke@1: tree.expr = translate(tree.expr, erasure(tree.expr.type)); duke@1: if (types.elemtype(tree.expr.type) == null) duke@1: tree.expr.type = iterableType; // preserve type for Lower duke@1: tree.body = translate(tree.body); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitSwitch(JCSwitch tree) { duke@1: Type selsuper = types.supertype(tree.selector.type); duke@1: boolean enumSwitch = selsuper != null && duke@1: selsuper.tsym == syms.enumSym; duke@1: Type target = enumSwitch ? erasure(tree.selector.type) : syms.intType; duke@1: tree.selector = translate(tree.selector, target); duke@1: tree.cases = translateCases(tree.cases); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitCase(JCCase tree) { duke@1: tree.pat = translate(tree.pat, null); duke@1: tree.stats = translate(tree.stats); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitSynchronized(JCSynchronized tree) { duke@1: tree.lock = translate(tree.lock, erasure(tree.lock.type)); duke@1: tree.body = translate(tree.body); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitConditional(JCConditional tree) { duke@1: tree.cond = translate(tree.cond, syms.booleanType); duke@1: tree.truepart = translate(tree.truepart, erasure(tree.type)); duke@1: tree.falsepart = translate(tree.falsepart, erasure(tree.type)); duke@1: tree.type = erasure(tree.type); mcimadamore@120: result = retype(tree, tree.type, pt); duke@1: } duke@1: duke@1: public void visitIf(JCIf tree) { duke@1: tree.cond = translate(tree.cond, syms.booleanType); duke@1: tree.thenpart = translate(tree.thenpart); duke@1: tree.elsepart = translate(tree.elsepart); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitExec(JCExpressionStatement tree) { duke@1: tree.expr = translate(tree.expr, null); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitReturn(JCReturn tree) { duke@1: tree.expr = translate(tree.expr, currentMethod.sym.erasure(types).getReturnType()); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitThrow(JCThrow tree) { duke@1: tree.expr = translate(tree.expr, erasure(tree.expr.type)); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitAssert(JCAssert tree) { duke@1: tree.cond = translate(tree.cond, syms.booleanType); duke@1: if (tree.detail != null) duke@1: tree.detail = translate(tree.detail, erasure(tree.detail.type)); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitApply(JCMethodInvocation tree) { duke@1: tree.meth = translate(tree.meth, null); duke@1: Symbol meth = TreeInfo.symbol(tree.meth); duke@1: Type mt = meth.erasure(types); duke@1: List argtypes = mt.getParameterTypes(); duke@1: if (allowEnums && duke@1: meth.name==names.init && duke@1: meth.owner == syms.enumSym) duke@1: argtypes = argtypes.tail.tail; duke@1: if (tree.varargsElement != null) duke@1: tree.varargsElement = types.erasure(tree.varargsElement); duke@1: else duke@1: assert tree.args.length() == argtypes.length(); duke@1: tree.args = translateArgs(tree.args, argtypes, tree.varargsElement); duke@1: duke@1: // Insert casts of method invocation results as needed. duke@1: result = retype(tree, mt.getReturnType(), pt); duke@1: } duke@1: duke@1: public void visitNewClass(JCNewClass tree) { duke@1: if (tree.encl != null) duke@1: tree.encl = translate(tree.encl, erasure(tree.encl.type)); duke@1: tree.clazz = translate(tree.clazz, null); duke@1: if (tree.varargsElement != null) duke@1: tree.varargsElement = types.erasure(tree.varargsElement); duke@1: tree.args = translateArgs( duke@1: tree.args, tree.constructor.erasure(types).getParameterTypes(), tree.varargsElement); duke@1: tree.def = translate(tree.def, null); duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitNewArray(JCNewArray tree) { duke@1: tree.elemtype = translate(tree.elemtype, null); duke@1: translate(tree.dims, syms.intType); duke@1: tree.elems = translate(tree.elems, duke@1: (tree.type == null) ? null duke@1: : erasure(types.elemtype(tree.type))); duke@1: tree.type = erasure(tree.type); duke@1: duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitParens(JCParens tree) { duke@1: tree.expr = translate(tree.expr, pt); duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitAssign(JCAssign tree) { duke@1: tree.lhs = translate(tree.lhs, null); duke@1: tree.rhs = translate(tree.rhs, erasure(tree.lhs.type)); duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitAssignop(JCAssignOp tree) { mcimadamore@133: tree.lhs = translate(tree.lhs, tree.operator.type.getParameterTypes().head); mcimadamore@133: tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head); duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitUnary(JCUnary tree) { duke@1: tree.arg = translate(tree.arg, tree.operator.type.getParameterTypes().head); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitBinary(JCBinary tree) { duke@1: tree.lhs = translate(tree.lhs, tree.operator.type.getParameterTypes().head); duke@1: tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitTypeCast(JCTypeCast tree) { duke@1: tree.clazz = translate(tree.clazz, null); duke@1: tree.type = erasure(tree.type); duke@1: tree.expr = translate(tree.expr, tree.type); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitTypeTest(JCInstanceOf tree) { duke@1: tree.expr = translate(tree.expr, null); duke@1: tree.clazz = translate(tree.clazz, null); duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitIndexed(JCArrayAccess tree) { duke@1: tree.indexed = translate(tree.indexed, erasure(tree.indexed.type)); duke@1: tree.index = translate(tree.index, syms.intType); duke@1: duke@1: // Insert casts of indexed expressions as needed. duke@1: result = retype(tree, types.elemtype(tree.indexed.type), pt); duke@1: } duke@1: duke@1: // There ought to be nothing to rewrite here; duke@1: // we don't generate code. duke@1: public void visitAnnotation(JCAnnotation tree) { duke@1: result = tree; duke@1: } duke@1: duke@1: public void visitIdent(JCIdent tree) { duke@1: Type et = tree.sym.erasure(types); duke@1: duke@1: // Map type variables to their bounds. duke@1: if (tree.sym.kind == TYP && tree.sym.type.tag == TYPEVAR) { duke@1: result = make.at(tree.pos).Type(et); duke@1: } else duke@1: // Map constants expressions to themselves. duke@1: if (tree.type.constValue() != null) { duke@1: result = tree; duke@1: } duke@1: // Insert casts of variable uses as needed. duke@1: else if (tree.sym.kind == VAR) { duke@1: result = retype(tree, et, pt); duke@1: } duke@1: else { duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } duke@1: } duke@1: duke@1: public void visitSelect(JCFieldAccess tree) { duke@1: Type t = tree.selected.type; mcimadamore@23: while (t.tag == TYPEVAR) mcimadamore@23: t = t.getUpperBound(); mcimadamore@23: if (t.isCompound()) { duke@1: if ((tree.sym.flags() & IPROXY) != 0) { duke@1: tree.sym = ((MethodSymbol)tree.sym). duke@1: implemented((TypeSymbol)tree.sym.owner, types); duke@1: } duke@1: tree.selected = cast( mcimadamore@23: translate(tree.selected, erasure(tree.selected.type)), duke@1: erasure(tree.sym.owner.type)); duke@1: } else duke@1: tree.selected = translate(tree.selected, erasure(t)); duke@1: duke@1: // Map constants expressions to themselves. duke@1: if (tree.type.constValue() != null) { duke@1: result = tree; duke@1: } duke@1: // Insert casts of variable uses as needed. duke@1: else if (tree.sym.kind == VAR) { duke@1: result = retype(tree, tree.sym.erasure(types), pt); duke@1: } duke@1: else { duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } duke@1: } duke@1: duke@1: public void visitTypeArray(JCArrayTypeTree tree) { duke@1: tree.elemtype = translate(tree.elemtype, null); duke@1: tree.type = erasure(tree.type); duke@1: result = tree; duke@1: } duke@1: duke@1: /** Visitor method for parameterized types. duke@1: */ duke@1: public void visitTypeApply(JCTypeApply tree) { duke@1: // Delete all type parameters. duke@1: result = translate(tree.clazz, null); duke@1: } duke@1: duke@1: /************************************************************************** duke@1: * utility methods duke@1: *************************************************************************/ duke@1: duke@1: private Type erasure(Type t) { duke@1: return types.erasure(t); duke@1: } duke@1: duke@1: /************************************************************************** duke@1: * main method duke@1: *************************************************************************/ duke@1: duke@1: private Env env; duke@1: duke@1: void translateClass(ClassSymbol c) { duke@1: Type st = types.supertype(c.type); duke@1: duke@1: // process superclass before derived duke@1: if (st.tag == CLASS) duke@1: translateClass((ClassSymbol)st.tsym); duke@1: duke@1: Env myEnv = enter.typeEnvs.remove(c); duke@1: if (myEnv == null) duke@1: return; duke@1: Env oldEnv = env; duke@1: try { duke@1: env = myEnv; duke@1: // class has not been translated yet duke@1: duke@1: TreeMaker savedMake = make; duke@1: Type savedPt = pt; duke@1: make = make.forToplevel(env.toplevel); duke@1: pt = null; duke@1: try { duke@1: JCClassDecl tree = (JCClassDecl) env.tree; duke@1: tree.typarams = List.nil(); duke@1: super.visitClassDef(tree); duke@1: make.at(tree.pos); duke@1: if (addBridges) { duke@1: ListBuffer bridges = new ListBuffer(); duke@1: if ((tree.sym.flags() & INTERFACE) == 0) duke@1: addBridges(tree.pos(), tree.sym, bridges); duke@1: tree.defs = bridges.toList().prependList(tree.defs); duke@1: } duke@1: tree.type = erasure(tree.type); duke@1: } finally { duke@1: make = savedMake; duke@1: pt = savedPt; duke@1: } duke@1: } finally { duke@1: env = oldEnv; duke@1: } duke@1: } duke@1: duke@1: /** Translate a toplevel class definition. duke@1: * @param cdef The definition to be translated. duke@1: */ duke@1: public JCTree translateTopLevelClass(JCTree cdef, TreeMaker make) { duke@1: // note that this method does NOT support recursion. duke@1: this.make = make; duke@1: pt = null; duke@1: return translate(cdef, null); duke@1: } duke@1: }