Sat, 24 Jan 2009 11:07:32 -0800
6797463: 6557199 breaks the jax-ws workspace
Reviewed-by: jjg
duke@1 | 1 | /* |
xdono@54 | 2 | * Copyright 1999-2008 Sun Microsystems, Inc. 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 |
duke@1 | 7 | * published by the Free Software Foundation. Sun designates this |
duke@1 | 8 | * particular file as subject to the "Classpath" exception as provided |
duke@1 | 9 | * by Sun 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 | * |
duke@1 | 21 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@1 | 22 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@1 | 23 | * have any questions. |
duke@1 | 24 | */ |
duke@1 | 25 | |
duke@1 | 26 | package com.sun.tools.javac.comp; |
duke@1 | 27 | |
duke@1 | 28 | import java.util.*; |
duke@1 | 29 | |
duke@1 | 30 | import com.sun.tools.javac.code.*; |
duke@1 | 31 | import com.sun.tools.javac.code.Symbol.*; |
duke@1 | 32 | import com.sun.tools.javac.tree.*; |
duke@1 | 33 | import com.sun.tools.javac.tree.JCTree.*; |
duke@1 | 34 | import com.sun.tools.javac.util.*; |
duke@1 | 35 | import com.sun.tools.javac.util.JCDiagnostic.DiagnosticPosition; |
duke@1 | 36 | import com.sun.tools.javac.util.List; |
duke@1 | 37 | |
duke@1 | 38 | import static com.sun.tools.javac.code.Flags.*; |
duke@1 | 39 | import static com.sun.tools.javac.code.Kinds.*; |
duke@1 | 40 | import static com.sun.tools.javac.code.TypeTags.*; |
duke@1 | 41 | |
duke@1 | 42 | /** This pass translates Generic Java to conventional Java. |
duke@1 | 43 | * |
duke@1 | 44 | * <p><b>This is NOT part of any API supported by Sun Microsystems. If |
duke@1 | 45 | * you write code that depends on this, you do so at your own risk. |
duke@1 | 46 | * This code and its internal interfaces are subject to change or |
duke@1 | 47 | * deletion without notice.</b> |
duke@1 | 48 | */ |
duke@1 | 49 | public class TransTypes extends TreeTranslator { |
duke@1 | 50 | /** The context key for the TransTypes phase. */ |
duke@1 | 51 | protected static final Context.Key<TransTypes> transTypesKey = |
duke@1 | 52 | new Context.Key<TransTypes>(); |
duke@1 | 53 | |
duke@1 | 54 | /** Get the instance for this context. */ |
duke@1 | 55 | public static TransTypes instance(Context context) { |
duke@1 | 56 | TransTypes instance = context.get(transTypesKey); |
duke@1 | 57 | if (instance == null) |
duke@1 | 58 | instance = new TransTypes(context); |
duke@1 | 59 | return instance; |
duke@1 | 60 | } |
duke@1 | 61 | |
jjg@113 | 62 | private Names names; |
duke@1 | 63 | private Log log; |
duke@1 | 64 | private Symtab syms; |
duke@1 | 65 | private TreeMaker make; |
duke@1 | 66 | private Enter enter; |
duke@1 | 67 | private boolean allowEnums; |
duke@1 | 68 | private Types types; |
duke@1 | 69 | private final Resolve resolve; |
duke@1 | 70 | |
duke@1 | 71 | /** |
duke@1 | 72 | * Flag to indicate whether or not to generate bridge methods. |
duke@1 | 73 | * For pre-Tiger source there is no need for bridge methods, so it |
duke@1 | 74 | * can be skipped to get better performance for -source 1.4 etc. |
duke@1 | 75 | */ |
duke@1 | 76 | private final boolean addBridges; |
duke@1 | 77 | |
duke@1 | 78 | protected TransTypes(Context context) { |
duke@1 | 79 | context.put(transTypesKey, this); |
jjg@113 | 80 | names = Names.instance(context); |
duke@1 | 81 | log = Log.instance(context); |
duke@1 | 82 | syms = Symtab.instance(context); |
duke@1 | 83 | enter = Enter.instance(context); |
duke@1 | 84 | overridden = new HashMap<MethodSymbol,MethodSymbol>(); |
duke@1 | 85 | Source source = Source.instance(context); |
duke@1 | 86 | allowEnums = source.allowEnums(); |
duke@1 | 87 | addBridges = source.addBridges(); |
duke@1 | 88 | types = Types.instance(context); |
duke@1 | 89 | make = TreeMaker.instance(context); |
duke@1 | 90 | resolve = Resolve.instance(context); |
duke@1 | 91 | } |
duke@1 | 92 | |
duke@1 | 93 | /** A hashtable mapping bridge methods to the methods they override after |
duke@1 | 94 | * type erasure. |
duke@1 | 95 | */ |
duke@1 | 96 | Map<MethodSymbol,MethodSymbol> overridden; |
duke@1 | 97 | |
duke@1 | 98 | /** Construct an attributed tree for a cast of expression to target type, |
duke@1 | 99 | * unless it already has precisely that type. |
duke@1 | 100 | * @param tree The expression tree. |
duke@1 | 101 | * @param target The target type. |
duke@1 | 102 | */ |
duke@1 | 103 | JCExpression cast(JCExpression tree, Type target) { |
duke@1 | 104 | int oldpos = make.pos; |
duke@1 | 105 | make.at(tree.pos); |
duke@1 | 106 | if (!types.isSameType(tree.type, target)) { |
duke@1 | 107 | if (!resolve.isAccessible(env, target.tsym)) |
duke@1 | 108 | resolve.logAccessError(env, tree, target); |
duke@1 | 109 | tree = make.TypeCast(make.Type(target), tree).setType(target); |
duke@1 | 110 | } |
duke@1 | 111 | make.pos = oldpos; |
duke@1 | 112 | return tree; |
duke@1 | 113 | } |
duke@1 | 114 | |
duke@1 | 115 | /** Construct an attributed tree to coerce an expression to some erased |
duke@1 | 116 | * target type, unless the expression is already assignable to that type. |
duke@1 | 117 | * If target type is a constant type, use its base type instead. |
duke@1 | 118 | * @param tree The expression tree. |
duke@1 | 119 | * @param target The target type. |
duke@1 | 120 | */ |
duke@1 | 121 | JCExpression coerce(JCExpression tree, Type target) { |
duke@1 | 122 | Type btarget = target.baseType(); |
duke@1 | 123 | if (tree.type.isPrimitive() == target.isPrimitive()) { |
duke@1 | 124 | return types.isAssignable(tree.type, btarget, Warner.noWarnings) |
duke@1 | 125 | ? tree |
duke@1 | 126 | : cast(tree, btarget); |
duke@1 | 127 | } |
duke@1 | 128 | return tree; |
duke@1 | 129 | } |
duke@1 | 130 | |
duke@1 | 131 | /** Given an erased reference type, assume this type as the tree's type. |
duke@1 | 132 | * Then, coerce to some given target type unless target type is null. |
duke@1 | 133 | * This operation is used in situations like the following: |
duke@1 | 134 | * |
duke@1 | 135 | * class Cell<A> { A value; } |
duke@1 | 136 | * ... |
duke@1 | 137 | * Cell<Integer> cell; |
duke@1 | 138 | * Integer x = cell.value; |
duke@1 | 139 | * |
duke@1 | 140 | * Since the erasure of Cell.value is Object, but the type |
duke@1 | 141 | * of cell.value in the assignment is Integer, we need to |
duke@1 | 142 | * adjust the original type of cell.value to Object, and insert |
duke@1 | 143 | * a cast to Integer. That is, the last assignment becomes: |
duke@1 | 144 | * |
duke@1 | 145 | * Integer x = (Integer)cell.value; |
duke@1 | 146 | * |
duke@1 | 147 | * @param tree The expression tree whose type might need adjustment. |
duke@1 | 148 | * @param erasedType The expression's type after erasure. |
duke@1 | 149 | * @param target The target type, which is usually the erasure of the |
duke@1 | 150 | * expression's original type. |
duke@1 | 151 | */ |
duke@1 | 152 | JCExpression retype(JCExpression tree, Type erasedType, Type target) { |
duke@1 | 153 | // System.err.println("retype " + tree + " to " + erasedType);//DEBUG |
duke@1 | 154 | if (erasedType.tag > lastBaseTag) { |
duke@1 | 155 | if (target != null && target.isPrimitive()) |
duke@1 | 156 | target = erasure(tree.type); |
duke@1 | 157 | tree.type = erasedType; |
duke@1 | 158 | if (target != null) return coerce(tree, target); |
duke@1 | 159 | } |
duke@1 | 160 | return tree; |
duke@1 | 161 | } |
duke@1 | 162 | |
duke@1 | 163 | /** Translate method argument list, casting each argument |
duke@1 | 164 | * to its corresponding type in a list of target types. |
duke@1 | 165 | * @param _args The method argument list. |
duke@1 | 166 | * @param parameters The list of target types. |
duke@1 | 167 | * @param varargsElement The erasure of the varargs element type, |
duke@1 | 168 | * or null if translating a non-varargs invocation |
duke@1 | 169 | */ |
duke@1 | 170 | <T extends JCTree> List<T> translateArgs(List<T> _args, |
duke@1 | 171 | List<Type> parameters, |
duke@1 | 172 | Type varargsElement) { |
duke@1 | 173 | if (parameters.isEmpty()) return _args; |
duke@1 | 174 | List<T> args = _args; |
duke@1 | 175 | while (parameters.tail.nonEmpty()) { |
duke@1 | 176 | args.head = translate(args.head, parameters.head); |
duke@1 | 177 | args = args.tail; |
duke@1 | 178 | parameters = parameters.tail; |
duke@1 | 179 | } |
duke@1 | 180 | Type parameter = parameters.head; |
duke@1 | 181 | assert varargsElement != null || args.length() == 1; |
duke@1 | 182 | if (varargsElement != null) { |
duke@1 | 183 | while (args.nonEmpty()) { |
duke@1 | 184 | args.head = translate(args.head, varargsElement); |
duke@1 | 185 | args = args.tail; |
duke@1 | 186 | } |
duke@1 | 187 | } else { |
duke@1 | 188 | args.head = translate(args.head, parameter); |
duke@1 | 189 | } |
duke@1 | 190 | return _args; |
duke@1 | 191 | } |
duke@1 | 192 | |
duke@1 | 193 | /** Add a bridge definition and enter corresponding method symbol in |
duke@1 | 194 | * local scope of origin. |
duke@1 | 195 | * |
duke@1 | 196 | * @param pos The source code position to be used for the definition. |
duke@1 | 197 | * @param meth The method for which a bridge needs to be added |
duke@1 | 198 | * @param impl That method's implementation (possibly the method itself) |
duke@1 | 199 | * @param origin The class to which the bridge will be added |
duke@1 | 200 | * @param hypothetical |
duke@1 | 201 | * True if the bridge method is not strictly necessary in the |
duke@1 | 202 | * binary, but is represented in the symbol table to detect |
duke@1 | 203 | * erasure clashes. |
duke@1 | 204 | * @param bridges The list buffer to which the bridge will be added |
duke@1 | 205 | */ |
duke@1 | 206 | void addBridge(DiagnosticPosition pos, |
duke@1 | 207 | MethodSymbol meth, |
duke@1 | 208 | MethodSymbol impl, |
duke@1 | 209 | ClassSymbol origin, |
duke@1 | 210 | boolean hypothetical, |
duke@1 | 211 | ListBuffer<JCTree> bridges) { |
duke@1 | 212 | make.at(pos); |
duke@1 | 213 | Type origType = types.memberType(origin.type, meth); |
duke@1 | 214 | Type origErasure = erasure(origType); |
duke@1 | 215 | |
duke@1 | 216 | // Create a bridge method symbol and a bridge definition without a body. |
duke@1 | 217 | Type bridgeType = meth.erasure(types); |
duke@1 | 218 | long flags = impl.flags() & AccessFlags | SYNTHETIC | BRIDGE; |
duke@1 | 219 | if (hypothetical) flags |= HYPOTHETICAL; |
duke@1 | 220 | MethodSymbol bridge = new MethodSymbol(flags, |
duke@1 | 221 | meth.name, |
duke@1 | 222 | bridgeType, |
duke@1 | 223 | origin); |
duke@1 | 224 | if (!hypothetical) { |
duke@1 | 225 | JCMethodDecl md = make.MethodDef(bridge, null); |
duke@1 | 226 | |
duke@1 | 227 | // The bridge calls this.impl(..), if we have an implementation |
duke@1 | 228 | // in the current class, super.impl(...) otherwise. |
duke@1 | 229 | JCExpression receiver = (impl.owner == origin) |
duke@1 | 230 | ? make.This(origin.erasure(types)) |
duke@1 | 231 | : make.Super(types.supertype(origin.type).tsym.erasure(types), origin); |
duke@1 | 232 | |
duke@1 | 233 | // The type returned from the original method. |
duke@1 | 234 | Type calltype = erasure(impl.type.getReturnType()); |
duke@1 | 235 | |
duke@1 | 236 | // Construct a call of this.impl(params), or super.impl(params), |
duke@1 | 237 | // casting params and possibly results as needed. |
duke@1 | 238 | JCExpression call = |
duke@1 | 239 | make.Apply( |
duke@1 | 240 | null, |
duke@1 | 241 | make.Select(receiver, impl).setType(calltype), |
duke@1 | 242 | translateArgs(make.Idents(md.params), origErasure.getParameterTypes(), null)) |
duke@1 | 243 | .setType(calltype); |
duke@1 | 244 | JCStatement stat = (origErasure.getReturnType().tag == VOID) |
duke@1 | 245 | ? make.Exec(call) |
duke@1 | 246 | : make.Return(coerce(call, bridgeType.getReturnType())); |
duke@1 | 247 | md.body = make.Block(0, List.of(stat)); |
duke@1 | 248 | |
duke@1 | 249 | // Add bridge to `bridges' buffer |
duke@1 | 250 | bridges.append(md); |
duke@1 | 251 | } |
duke@1 | 252 | |
duke@1 | 253 | // Add bridge to scope of enclosing class and `overridden' table. |
duke@1 | 254 | origin.members().enter(bridge); |
duke@1 | 255 | overridden.put(bridge, meth); |
duke@1 | 256 | } |
duke@1 | 257 | |
duke@1 | 258 | /** Add bridge if given symbol is a non-private, non-static member |
duke@1 | 259 | * of the given class, which is either defined in the class or non-final |
duke@1 | 260 | * inherited, and one of the two following conditions holds: |
duke@1 | 261 | * 1. The method's type changes in the given class, as compared to the |
duke@1 | 262 | * class where the symbol was defined, (in this case |
duke@1 | 263 | * we have extended a parameterized class with non-trivial parameters). |
duke@1 | 264 | * 2. The method has an implementation with a different erased return type. |
duke@1 | 265 | * (in this case we have used co-variant returns). |
duke@1 | 266 | * If a bridge already exists in some other class, no new bridge is added. |
duke@1 | 267 | * Instead, it is checked that the bridge symbol overrides the method symbol. |
duke@1 | 268 | * (Spec ???). |
duke@1 | 269 | * todo: what about bridges for privates??? |
duke@1 | 270 | * |
duke@1 | 271 | * @param pos The source code position to be used for the definition. |
duke@1 | 272 | * @param sym The symbol for which a bridge might have to be added. |
duke@1 | 273 | * @param origin The class in which the bridge would go. |
duke@1 | 274 | * @param bridges The list buffer to which the bridge would be added. |
duke@1 | 275 | */ |
duke@1 | 276 | void addBridgeIfNeeded(DiagnosticPosition pos, |
duke@1 | 277 | Symbol sym, |
duke@1 | 278 | ClassSymbol origin, |
duke@1 | 279 | ListBuffer<JCTree> bridges) { |
duke@1 | 280 | if (sym.kind == MTH && |
duke@1 | 281 | sym.name != names.init && |
duke@1 | 282 | (sym.flags() & (PRIVATE | SYNTHETIC | STATIC)) == 0 && |
duke@1 | 283 | sym.isMemberOf(origin, types)) |
duke@1 | 284 | { |
duke@1 | 285 | MethodSymbol meth = (MethodSymbol)sym; |
duke@1 | 286 | MethodSymbol bridge = meth.binaryImplementation(origin, types); |
duke@1 | 287 | MethodSymbol impl = meth.implementation(origin, types, true); |
duke@1 | 288 | if (bridge == null || |
duke@1 | 289 | bridge == meth || |
duke@1 | 290 | (impl != null && !bridge.owner.isSubClass(impl.owner, types))) { |
duke@1 | 291 | // No bridge was added yet. |
duke@1 | 292 | if (impl != null && isBridgeNeeded(meth, impl, origin.type)) { |
duke@1 | 293 | addBridge(pos, meth, impl, origin, bridge==impl, bridges); |
duke@1 | 294 | } else if (impl == meth |
duke@1 | 295 | && impl.owner != origin |
duke@1 | 296 | && (impl.flags() & FINAL) == 0 |
duke@1 | 297 | && (meth.flags() & (ABSTRACT|PUBLIC)) == PUBLIC |
duke@1 | 298 | && (origin.flags() & PUBLIC) > (impl.owner.flags() & PUBLIC)) { |
duke@1 | 299 | // this is to work around a horrible but permanent |
duke@1 | 300 | // reflection design error. |
duke@1 | 301 | addBridge(pos, meth, impl, origin, false, bridges); |
duke@1 | 302 | } |
duke@1 | 303 | } else if ((bridge.flags() & SYNTHETIC) != 0) { |
duke@1 | 304 | MethodSymbol other = overridden.get(bridge); |
duke@1 | 305 | if (other != null && other != meth) { |
duke@1 | 306 | if (impl == null || !impl.overrides(other, origin, types, true)) { |
duke@1 | 307 | // Bridge for other symbol pair was added |
duke@1 | 308 | log.error(pos, "name.clash.same.erasure.no.override", |
duke@1 | 309 | other, other.location(origin.type, types), |
duke@1 | 310 | meth, meth.location(origin.type, types)); |
duke@1 | 311 | } |
duke@1 | 312 | } |
duke@1 | 313 | } else if (!bridge.overrides(meth, origin, types, true)) { |
duke@1 | 314 | // Accidental binary override without source override. |
duke@1 | 315 | if (bridge.owner == origin || |
duke@1 | 316 | types.asSuper(bridge.owner.type, meth.owner) == null) |
duke@1 | 317 | // Don't diagnose the problem if it would already |
duke@1 | 318 | // have been reported in the superclass |
duke@1 | 319 | log.error(pos, "name.clash.same.erasure.no.override", |
duke@1 | 320 | bridge, bridge.location(origin.type, types), |
duke@1 | 321 | meth, meth.location(origin.type, types)); |
duke@1 | 322 | } |
duke@1 | 323 | } |
duke@1 | 324 | } |
duke@1 | 325 | // where |
duke@1 | 326 | /** |
duke@1 | 327 | * @param method The symbol for which a bridge might have to be added |
duke@1 | 328 | * @param impl The implementation of method |
duke@1 | 329 | * @param dest The type in which the bridge would go |
duke@1 | 330 | */ |
duke@1 | 331 | private boolean isBridgeNeeded(MethodSymbol method, |
duke@1 | 332 | MethodSymbol impl, |
duke@1 | 333 | Type dest) { |
duke@1 | 334 | if (impl != method) { |
duke@1 | 335 | // If either method or impl have different erasures as |
duke@1 | 336 | // members of dest, a bridge is needed. |
duke@1 | 337 | Type method_erasure = method.erasure(types); |
duke@1 | 338 | if (!isSameMemberWhenErased(dest, method, method_erasure)) |
duke@1 | 339 | return true; |
duke@1 | 340 | Type impl_erasure = impl.erasure(types); |
duke@1 | 341 | if (!isSameMemberWhenErased(dest, impl, impl_erasure)) |
duke@1 | 342 | return true; |
duke@1 | 343 | |
duke@1 | 344 | // If the erasure of the return type is different, a |
duke@1 | 345 | // bridge is needed. |
duke@1 | 346 | return !types.isSameType(impl_erasure.getReturnType(), |
duke@1 | 347 | method_erasure.getReturnType()); |
duke@1 | 348 | } else { |
duke@1 | 349 | // method and impl are the same... |
duke@1 | 350 | if ((method.flags() & ABSTRACT) != 0) { |
duke@1 | 351 | // ...and abstract so a bridge is not needed. |
duke@1 | 352 | // Concrete subclasses will bridge as needed. |
duke@1 | 353 | return false; |
duke@1 | 354 | } |
duke@1 | 355 | |
duke@1 | 356 | // The erasure of the return type is always the same |
duke@1 | 357 | // for the same symbol. Reducing the three tests in |
duke@1 | 358 | // the other branch to just one: |
duke@1 | 359 | return !isSameMemberWhenErased(dest, method, method.erasure(types)); |
duke@1 | 360 | } |
duke@1 | 361 | } |
duke@1 | 362 | /** |
duke@1 | 363 | * Lookup the method as a member of the type. Compare the |
duke@1 | 364 | * erasures. |
duke@1 | 365 | * @param type the class where to look for the method |
duke@1 | 366 | * @param method the method to look for in class |
duke@1 | 367 | * @param erasure the erasure of method |
duke@1 | 368 | */ |
duke@1 | 369 | private boolean isSameMemberWhenErased(Type type, |
duke@1 | 370 | MethodSymbol method, |
duke@1 | 371 | Type erasure) { |
duke@1 | 372 | return types.isSameType(erasure(types.memberType(type, method)), |
duke@1 | 373 | erasure); |
duke@1 | 374 | } |
duke@1 | 375 | |
duke@1 | 376 | void addBridges(DiagnosticPosition pos, |
duke@1 | 377 | TypeSymbol i, |
duke@1 | 378 | ClassSymbol origin, |
duke@1 | 379 | ListBuffer<JCTree> bridges) { |
duke@1 | 380 | for (Scope.Entry e = i.members().elems; e != null; e = e.sibling) |
duke@1 | 381 | addBridgeIfNeeded(pos, e.sym, origin, bridges); |
duke@1 | 382 | for (List<Type> l = types.interfaces(i.type); l.nonEmpty(); l = l.tail) |
duke@1 | 383 | addBridges(pos, l.head.tsym, origin, bridges); |
duke@1 | 384 | } |
duke@1 | 385 | |
duke@1 | 386 | /** Add all necessary bridges to some class appending them to list buffer. |
duke@1 | 387 | * @param pos The source code position to be used for the bridges. |
duke@1 | 388 | * @param origin The class in which the bridges go. |
duke@1 | 389 | * @param bridges The list buffer to which the bridges are added. |
duke@1 | 390 | */ |
duke@1 | 391 | void addBridges(DiagnosticPosition pos, ClassSymbol origin, ListBuffer<JCTree> bridges) { |
duke@1 | 392 | Type st = types.supertype(origin.type); |
duke@1 | 393 | while (st.tag == CLASS) { |
duke@1 | 394 | // if (isSpecialization(st)) |
duke@1 | 395 | addBridges(pos, st.tsym, origin, bridges); |
duke@1 | 396 | st = types.supertype(st); |
duke@1 | 397 | } |
duke@1 | 398 | for (List<Type> l = types.interfaces(origin.type); l.nonEmpty(); l = l.tail) |
duke@1 | 399 | // if (isSpecialization(l.head)) |
duke@1 | 400 | addBridges(pos, l.head.tsym, origin, bridges); |
duke@1 | 401 | } |
duke@1 | 402 | |
duke@1 | 403 | /* ************************************************************************ |
duke@1 | 404 | * Visitor methods |
duke@1 | 405 | *************************************************************************/ |
duke@1 | 406 | |
duke@1 | 407 | /** Visitor argument: proto-type. |
duke@1 | 408 | */ |
duke@1 | 409 | private Type pt; |
duke@1 | 410 | |
duke@1 | 411 | /** Visitor method: perform a type translation on tree. |
duke@1 | 412 | */ |
duke@1 | 413 | public <T extends JCTree> T translate(T tree, Type pt) { |
duke@1 | 414 | Type prevPt = this.pt; |
duke@1 | 415 | try { |
duke@1 | 416 | this.pt = pt; |
duke@1 | 417 | return translate(tree); |
duke@1 | 418 | } finally { |
duke@1 | 419 | this.pt = prevPt; |
duke@1 | 420 | } |
duke@1 | 421 | } |
duke@1 | 422 | |
duke@1 | 423 | /** Visitor method: perform a type translation on list of trees. |
duke@1 | 424 | */ |
duke@1 | 425 | public <T extends JCTree> List<T> translate(List<T> trees, Type pt) { |
duke@1 | 426 | Type prevPt = this.pt; |
duke@1 | 427 | List<T> res; |
duke@1 | 428 | try { |
duke@1 | 429 | this.pt = pt; |
duke@1 | 430 | res = translate(trees); |
duke@1 | 431 | } finally { |
duke@1 | 432 | this.pt = prevPt; |
duke@1 | 433 | } |
duke@1 | 434 | return res; |
duke@1 | 435 | } |
duke@1 | 436 | |
duke@1 | 437 | public void visitClassDef(JCClassDecl tree) { |
duke@1 | 438 | translateClass(tree.sym); |
duke@1 | 439 | result = tree; |
duke@1 | 440 | } |
duke@1 | 441 | |
duke@1 | 442 | JCMethodDecl currentMethod = null; |
duke@1 | 443 | public void visitMethodDef(JCMethodDecl tree) { |
duke@1 | 444 | JCMethodDecl previousMethod = currentMethod; |
duke@1 | 445 | try { |
duke@1 | 446 | currentMethod = tree; |
duke@1 | 447 | tree.restype = translate(tree.restype, null); |
duke@1 | 448 | tree.typarams = List.nil(); |
duke@1 | 449 | tree.params = translateVarDefs(tree.params); |
duke@1 | 450 | tree.thrown = translate(tree.thrown, null); |
duke@1 | 451 | tree.body = translate(tree.body, tree.sym.erasure(types).getReturnType()); |
duke@1 | 452 | tree.type = erasure(tree.type); |
duke@1 | 453 | result = tree; |
duke@1 | 454 | } finally { |
duke@1 | 455 | currentMethod = previousMethod; |
duke@1 | 456 | } |
duke@1 | 457 | |
duke@1 | 458 | // Check that we do not introduce a name clash by erasing types. |
duke@1 | 459 | for (Scope.Entry e = tree.sym.owner.members().lookup(tree.name); |
duke@1 | 460 | e.sym != null; |
duke@1 | 461 | e = e.next()) { |
duke@1 | 462 | if (e.sym != tree.sym && |
duke@1 | 463 | types.isSameType(erasure(e.sym.type), tree.type)) { |
duke@1 | 464 | log.error(tree.pos(), |
duke@1 | 465 | "name.clash.same.erasure", tree.sym, |
duke@1 | 466 | e.sym); |
duke@1 | 467 | return; |
duke@1 | 468 | } |
duke@1 | 469 | } |
duke@1 | 470 | } |
duke@1 | 471 | |
duke@1 | 472 | public void visitVarDef(JCVariableDecl tree) { |
duke@1 | 473 | tree.vartype = translate(tree.vartype, null); |
duke@1 | 474 | tree.init = translate(tree.init, tree.sym.erasure(types)); |
duke@1 | 475 | tree.type = erasure(tree.type); |
duke@1 | 476 | result = tree; |
duke@1 | 477 | } |
duke@1 | 478 | |
duke@1 | 479 | public void visitDoLoop(JCDoWhileLoop tree) { |
duke@1 | 480 | tree.body = translate(tree.body); |
duke@1 | 481 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 482 | result = tree; |
duke@1 | 483 | } |
duke@1 | 484 | |
duke@1 | 485 | public void visitWhileLoop(JCWhileLoop tree) { |
duke@1 | 486 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 487 | tree.body = translate(tree.body); |
duke@1 | 488 | result = tree; |
duke@1 | 489 | } |
duke@1 | 490 | |
duke@1 | 491 | public void visitForLoop(JCForLoop tree) { |
duke@1 | 492 | tree.init = translate(tree.init, null); |
duke@1 | 493 | if (tree.cond != null) |
duke@1 | 494 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 495 | tree.step = translate(tree.step, null); |
duke@1 | 496 | tree.body = translate(tree.body); |
duke@1 | 497 | result = tree; |
duke@1 | 498 | } |
duke@1 | 499 | |
duke@1 | 500 | public void visitForeachLoop(JCEnhancedForLoop tree) { |
duke@1 | 501 | tree.var = translate(tree.var, null); |
duke@1 | 502 | Type iterableType = tree.expr.type; |
duke@1 | 503 | tree.expr = translate(tree.expr, erasure(tree.expr.type)); |
duke@1 | 504 | if (types.elemtype(tree.expr.type) == null) |
duke@1 | 505 | tree.expr.type = iterableType; // preserve type for Lower |
duke@1 | 506 | tree.body = translate(tree.body); |
duke@1 | 507 | result = tree; |
duke@1 | 508 | } |
duke@1 | 509 | |
duke@1 | 510 | public void visitSwitch(JCSwitch tree) { |
duke@1 | 511 | Type selsuper = types.supertype(tree.selector.type); |
duke@1 | 512 | boolean enumSwitch = selsuper != null && |
duke@1 | 513 | selsuper.tsym == syms.enumSym; |
duke@1 | 514 | Type target = enumSwitch ? erasure(tree.selector.type) : syms.intType; |
duke@1 | 515 | tree.selector = translate(tree.selector, target); |
duke@1 | 516 | tree.cases = translateCases(tree.cases); |
duke@1 | 517 | result = tree; |
duke@1 | 518 | } |
duke@1 | 519 | |
duke@1 | 520 | public void visitCase(JCCase tree) { |
duke@1 | 521 | tree.pat = translate(tree.pat, null); |
duke@1 | 522 | tree.stats = translate(tree.stats); |
duke@1 | 523 | result = tree; |
duke@1 | 524 | } |
duke@1 | 525 | |
duke@1 | 526 | public void visitSynchronized(JCSynchronized tree) { |
duke@1 | 527 | tree.lock = translate(tree.lock, erasure(tree.lock.type)); |
duke@1 | 528 | tree.body = translate(tree.body); |
duke@1 | 529 | result = tree; |
duke@1 | 530 | } |
duke@1 | 531 | |
duke@1 | 532 | public void visitConditional(JCConditional tree) { |
duke@1 | 533 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 534 | tree.truepart = translate(tree.truepart, erasure(tree.type)); |
duke@1 | 535 | tree.falsepart = translate(tree.falsepart, erasure(tree.type)); |
duke@1 | 536 | tree.type = erasure(tree.type); |
mcimadamore@120 | 537 | result = retype(tree, tree.type, pt); |
duke@1 | 538 | } |
duke@1 | 539 | |
duke@1 | 540 | public void visitIf(JCIf tree) { |
duke@1 | 541 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 542 | tree.thenpart = translate(tree.thenpart); |
duke@1 | 543 | tree.elsepart = translate(tree.elsepart); |
duke@1 | 544 | result = tree; |
duke@1 | 545 | } |
duke@1 | 546 | |
duke@1 | 547 | public void visitExec(JCExpressionStatement tree) { |
duke@1 | 548 | tree.expr = translate(tree.expr, null); |
duke@1 | 549 | result = tree; |
duke@1 | 550 | } |
duke@1 | 551 | |
duke@1 | 552 | public void visitReturn(JCReturn tree) { |
duke@1 | 553 | tree.expr = translate(tree.expr, currentMethod.sym.erasure(types).getReturnType()); |
duke@1 | 554 | result = tree; |
duke@1 | 555 | } |
duke@1 | 556 | |
duke@1 | 557 | public void visitThrow(JCThrow tree) { |
duke@1 | 558 | tree.expr = translate(tree.expr, erasure(tree.expr.type)); |
duke@1 | 559 | result = tree; |
duke@1 | 560 | } |
duke@1 | 561 | |
duke@1 | 562 | public void visitAssert(JCAssert tree) { |
duke@1 | 563 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 564 | if (tree.detail != null) |
duke@1 | 565 | tree.detail = translate(tree.detail, erasure(tree.detail.type)); |
duke@1 | 566 | result = tree; |
duke@1 | 567 | } |
duke@1 | 568 | |
duke@1 | 569 | public void visitApply(JCMethodInvocation tree) { |
duke@1 | 570 | tree.meth = translate(tree.meth, null); |
duke@1 | 571 | Symbol meth = TreeInfo.symbol(tree.meth); |
duke@1 | 572 | Type mt = meth.erasure(types); |
duke@1 | 573 | List<Type> argtypes = mt.getParameterTypes(); |
duke@1 | 574 | if (allowEnums && |
duke@1 | 575 | meth.name==names.init && |
duke@1 | 576 | meth.owner == syms.enumSym) |
duke@1 | 577 | argtypes = argtypes.tail.tail; |
duke@1 | 578 | if (tree.varargsElement != null) |
duke@1 | 579 | tree.varargsElement = types.erasure(tree.varargsElement); |
duke@1 | 580 | else |
duke@1 | 581 | assert tree.args.length() == argtypes.length(); |
duke@1 | 582 | tree.args = translateArgs(tree.args, argtypes, tree.varargsElement); |
duke@1 | 583 | |
duke@1 | 584 | // Insert casts of method invocation results as needed. |
duke@1 | 585 | result = retype(tree, mt.getReturnType(), pt); |
duke@1 | 586 | } |
duke@1 | 587 | |
duke@1 | 588 | public void visitNewClass(JCNewClass tree) { |
duke@1 | 589 | if (tree.encl != null) |
duke@1 | 590 | tree.encl = translate(tree.encl, erasure(tree.encl.type)); |
duke@1 | 591 | tree.clazz = translate(tree.clazz, null); |
duke@1 | 592 | if (tree.varargsElement != null) |
duke@1 | 593 | tree.varargsElement = types.erasure(tree.varargsElement); |
duke@1 | 594 | tree.args = translateArgs( |
duke@1 | 595 | tree.args, tree.constructor.erasure(types).getParameterTypes(), tree.varargsElement); |
duke@1 | 596 | tree.def = translate(tree.def, null); |
duke@1 | 597 | tree.type = erasure(tree.type); |
duke@1 | 598 | result = tree; |
duke@1 | 599 | } |
duke@1 | 600 | |
duke@1 | 601 | public void visitNewArray(JCNewArray tree) { |
duke@1 | 602 | tree.elemtype = translate(tree.elemtype, null); |
duke@1 | 603 | translate(tree.dims, syms.intType); |
duke@1 | 604 | tree.elems = translate(tree.elems, |
duke@1 | 605 | (tree.type == null) ? null |
duke@1 | 606 | : erasure(types.elemtype(tree.type))); |
duke@1 | 607 | tree.type = erasure(tree.type); |
duke@1 | 608 | |
duke@1 | 609 | result = tree; |
duke@1 | 610 | } |
duke@1 | 611 | |
duke@1 | 612 | public void visitParens(JCParens tree) { |
duke@1 | 613 | tree.expr = translate(tree.expr, pt); |
duke@1 | 614 | tree.type = erasure(tree.type); |
duke@1 | 615 | result = tree; |
duke@1 | 616 | } |
duke@1 | 617 | |
duke@1 | 618 | public void visitAssign(JCAssign tree) { |
duke@1 | 619 | tree.lhs = translate(tree.lhs, null); |
duke@1 | 620 | tree.rhs = translate(tree.rhs, erasure(tree.lhs.type)); |
duke@1 | 621 | tree.type = erasure(tree.type); |
duke@1 | 622 | result = tree; |
duke@1 | 623 | } |
duke@1 | 624 | |
duke@1 | 625 | public void visitAssignop(JCAssignOp tree) { |
mcimadamore@133 | 626 | tree.lhs = translate(tree.lhs, tree.operator.type.getParameterTypes().head); |
mcimadamore@133 | 627 | tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head); |
duke@1 | 628 | tree.type = erasure(tree.type); |
duke@1 | 629 | result = tree; |
duke@1 | 630 | } |
duke@1 | 631 | |
duke@1 | 632 | public void visitUnary(JCUnary tree) { |
duke@1 | 633 | tree.arg = translate(tree.arg, tree.operator.type.getParameterTypes().head); |
duke@1 | 634 | result = tree; |
duke@1 | 635 | } |
duke@1 | 636 | |
duke@1 | 637 | public void visitBinary(JCBinary tree) { |
duke@1 | 638 | tree.lhs = translate(tree.lhs, tree.operator.type.getParameterTypes().head); |
duke@1 | 639 | tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head); |
duke@1 | 640 | result = tree; |
duke@1 | 641 | } |
duke@1 | 642 | |
duke@1 | 643 | public void visitTypeCast(JCTypeCast tree) { |
duke@1 | 644 | tree.clazz = translate(tree.clazz, null); |
duke@1 | 645 | tree.type = erasure(tree.type); |
duke@1 | 646 | tree.expr = translate(tree.expr, tree.type); |
duke@1 | 647 | result = tree; |
duke@1 | 648 | } |
duke@1 | 649 | |
duke@1 | 650 | public void visitTypeTest(JCInstanceOf tree) { |
duke@1 | 651 | tree.expr = translate(tree.expr, null); |
duke@1 | 652 | tree.clazz = translate(tree.clazz, null); |
duke@1 | 653 | result = tree; |
duke@1 | 654 | } |
duke@1 | 655 | |
duke@1 | 656 | public void visitIndexed(JCArrayAccess tree) { |
duke@1 | 657 | tree.indexed = translate(tree.indexed, erasure(tree.indexed.type)); |
duke@1 | 658 | tree.index = translate(tree.index, syms.intType); |
duke@1 | 659 | |
duke@1 | 660 | // Insert casts of indexed expressions as needed. |
duke@1 | 661 | result = retype(tree, types.elemtype(tree.indexed.type), pt); |
duke@1 | 662 | } |
duke@1 | 663 | |
duke@1 | 664 | // There ought to be nothing to rewrite here; |
duke@1 | 665 | // we don't generate code. |
duke@1 | 666 | public void visitAnnotation(JCAnnotation tree) { |
duke@1 | 667 | result = tree; |
duke@1 | 668 | } |
duke@1 | 669 | |
duke@1 | 670 | public void visitIdent(JCIdent tree) { |
duke@1 | 671 | Type et = tree.sym.erasure(types); |
duke@1 | 672 | |
duke@1 | 673 | // Map type variables to their bounds. |
duke@1 | 674 | if (tree.sym.kind == TYP && tree.sym.type.tag == TYPEVAR) { |
duke@1 | 675 | result = make.at(tree.pos).Type(et); |
duke@1 | 676 | } else |
duke@1 | 677 | // Map constants expressions to themselves. |
duke@1 | 678 | if (tree.type.constValue() != null) { |
duke@1 | 679 | result = tree; |
duke@1 | 680 | } |
duke@1 | 681 | // Insert casts of variable uses as needed. |
duke@1 | 682 | else if (tree.sym.kind == VAR) { |
duke@1 | 683 | result = retype(tree, et, pt); |
duke@1 | 684 | } |
duke@1 | 685 | else { |
duke@1 | 686 | tree.type = erasure(tree.type); |
duke@1 | 687 | result = tree; |
duke@1 | 688 | } |
duke@1 | 689 | } |
duke@1 | 690 | |
duke@1 | 691 | public void visitSelect(JCFieldAccess tree) { |
duke@1 | 692 | Type t = tree.selected.type; |
mcimadamore@23 | 693 | while (t.tag == TYPEVAR) |
mcimadamore@23 | 694 | t = t.getUpperBound(); |
mcimadamore@23 | 695 | if (t.isCompound()) { |
duke@1 | 696 | if ((tree.sym.flags() & IPROXY) != 0) { |
duke@1 | 697 | tree.sym = ((MethodSymbol)tree.sym). |
duke@1 | 698 | implemented((TypeSymbol)tree.sym.owner, types); |
duke@1 | 699 | } |
duke@1 | 700 | tree.selected = cast( |
mcimadamore@23 | 701 | translate(tree.selected, erasure(tree.selected.type)), |
duke@1 | 702 | erasure(tree.sym.owner.type)); |
duke@1 | 703 | } else |
duke@1 | 704 | tree.selected = translate(tree.selected, erasure(t)); |
duke@1 | 705 | |
duke@1 | 706 | // Map constants expressions to themselves. |
duke@1 | 707 | if (tree.type.constValue() != null) { |
duke@1 | 708 | result = tree; |
duke@1 | 709 | } |
duke@1 | 710 | // Insert casts of variable uses as needed. |
duke@1 | 711 | else if (tree.sym.kind == VAR) { |
duke@1 | 712 | result = retype(tree, tree.sym.erasure(types), pt); |
duke@1 | 713 | } |
duke@1 | 714 | else { |
duke@1 | 715 | tree.type = erasure(tree.type); |
duke@1 | 716 | result = tree; |
duke@1 | 717 | } |
duke@1 | 718 | } |
duke@1 | 719 | |
duke@1 | 720 | public void visitTypeArray(JCArrayTypeTree tree) { |
duke@1 | 721 | tree.elemtype = translate(tree.elemtype, null); |
duke@1 | 722 | tree.type = erasure(tree.type); |
duke@1 | 723 | result = tree; |
duke@1 | 724 | } |
duke@1 | 725 | |
duke@1 | 726 | /** Visitor method for parameterized types. |
duke@1 | 727 | */ |
duke@1 | 728 | public void visitTypeApply(JCTypeApply tree) { |
duke@1 | 729 | // Delete all type parameters. |
duke@1 | 730 | result = translate(tree.clazz, null); |
duke@1 | 731 | } |
duke@1 | 732 | |
duke@1 | 733 | /************************************************************************** |
duke@1 | 734 | * utility methods |
duke@1 | 735 | *************************************************************************/ |
duke@1 | 736 | |
duke@1 | 737 | private Type erasure(Type t) { |
duke@1 | 738 | return types.erasure(t); |
duke@1 | 739 | } |
duke@1 | 740 | |
duke@1 | 741 | /************************************************************************** |
duke@1 | 742 | * main method |
duke@1 | 743 | *************************************************************************/ |
duke@1 | 744 | |
duke@1 | 745 | private Env<AttrContext> env; |
duke@1 | 746 | |
duke@1 | 747 | void translateClass(ClassSymbol c) { |
duke@1 | 748 | Type st = types.supertype(c.type); |
duke@1 | 749 | |
duke@1 | 750 | // process superclass before derived |
duke@1 | 751 | if (st.tag == CLASS) |
duke@1 | 752 | translateClass((ClassSymbol)st.tsym); |
duke@1 | 753 | |
duke@1 | 754 | Env<AttrContext> myEnv = enter.typeEnvs.remove(c); |
duke@1 | 755 | if (myEnv == null) |
duke@1 | 756 | return; |
duke@1 | 757 | Env<AttrContext> oldEnv = env; |
duke@1 | 758 | try { |
duke@1 | 759 | env = myEnv; |
duke@1 | 760 | // class has not been translated yet |
duke@1 | 761 | |
duke@1 | 762 | TreeMaker savedMake = make; |
duke@1 | 763 | Type savedPt = pt; |
duke@1 | 764 | make = make.forToplevel(env.toplevel); |
duke@1 | 765 | pt = null; |
duke@1 | 766 | try { |
duke@1 | 767 | JCClassDecl tree = (JCClassDecl) env.tree; |
duke@1 | 768 | tree.typarams = List.nil(); |
duke@1 | 769 | super.visitClassDef(tree); |
duke@1 | 770 | make.at(tree.pos); |
duke@1 | 771 | if (addBridges) { |
duke@1 | 772 | ListBuffer<JCTree> bridges = new ListBuffer<JCTree>(); |
duke@1 | 773 | if ((tree.sym.flags() & INTERFACE) == 0) |
duke@1 | 774 | addBridges(tree.pos(), tree.sym, bridges); |
duke@1 | 775 | tree.defs = bridges.toList().prependList(tree.defs); |
duke@1 | 776 | } |
duke@1 | 777 | tree.type = erasure(tree.type); |
duke@1 | 778 | } finally { |
duke@1 | 779 | make = savedMake; |
duke@1 | 780 | pt = savedPt; |
duke@1 | 781 | } |
duke@1 | 782 | } finally { |
duke@1 | 783 | env = oldEnv; |
duke@1 | 784 | } |
duke@1 | 785 | } |
duke@1 | 786 | |
duke@1 | 787 | /** Translate a toplevel class definition. |
duke@1 | 788 | * @param cdef The definition to be translated. |
duke@1 | 789 | */ |
duke@1 | 790 | public JCTree translateTopLevelClass(JCTree cdef, TreeMaker make) { |
duke@1 | 791 | // note that this method does NOT support recursion. |
duke@1 | 792 | this.make = make; |
duke@1 | 793 | pt = null; |
duke@1 | 794 | return translate(cdef, null); |
duke@1 | 795 | } |
duke@1 | 796 | } |