Mon, 03 Jun 2013 17:09:26 -0700
8006615: [doclint] move remaining messages into resource bundle
Reviewed-by: mcimadamore, vromero
duke@1 | 1 | /* |
jjg@1521 | 2 | * Copyright (c) 1999, 2013, 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.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.*; |
jjg@1374 | 40 | import static com.sun.tools.javac.code.TypeTag.CLASS; |
jjg@1374 | 41 | import static com.sun.tools.javac.code.TypeTag.TYPEVAR; |
jjg@1374 | 42 | import static com.sun.tools.javac.code.TypeTag.VOID; |
vromero@1690 | 43 | import static com.sun.tools.javac.comp.CompileStates.CompileState; |
duke@1 | 44 | |
duke@1 | 45 | /** This pass translates Generic Java to conventional Java. |
duke@1 | 46 | * |
jjg@581 | 47 | * <p><b>This is NOT part of any supported API. |
jjg@581 | 48 | * If you write code that depends on this, you do so at your own risk. |
duke@1 | 49 | * This code and its internal interfaces are subject to change or |
duke@1 | 50 | * deletion without notice.</b> |
duke@1 | 51 | */ |
duke@1 | 52 | public class TransTypes extends TreeTranslator { |
duke@1 | 53 | /** The context key for the TransTypes phase. */ |
duke@1 | 54 | protected static final Context.Key<TransTypes> transTypesKey = |
duke@1 | 55 | new Context.Key<TransTypes>(); |
duke@1 | 56 | |
duke@1 | 57 | /** Get the instance for this context. */ |
duke@1 | 58 | public static TransTypes instance(Context context) { |
duke@1 | 59 | TransTypes instance = context.get(transTypesKey); |
duke@1 | 60 | if (instance == null) |
duke@1 | 61 | instance = new TransTypes(context); |
duke@1 | 62 | return instance; |
duke@1 | 63 | } |
duke@1 | 64 | |
jjg@113 | 65 | private Names names; |
duke@1 | 66 | private Log log; |
duke@1 | 67 | private Symtab syms; |
duke@1 | 68 | private TreeMaker make; |
duke@1 | 69 | private Enter enter; |
duke@1 | 70 | private boolean allowEnums; |
duke@1 | 71 | private Types types; |
duke@1 | 72 | private final Resolve resolve; |
duke@1 | 73 | |
duke@1 | 74 | /** |
duke@1 | 75 | * Flag to indicate whether or not to generate bridge methods. |
duke@1 | 76 | * For pre-Tiger source there is no need for bridge methods, so it |
duke@1 | 77 | * can be skipped to get better performance for -source 1.4 etc. |
duke@1 | 78 | */ |
duke@1 | 79 | private final boolean addBridges; |
duke@1 | 80 | |
vromero@1690 | 81 | private final CompileStates compileStates; |
vromero@1690 | 82 | |
duke@1 | 83 | protected TransTypes(Context context) { |
duke@1 | 84 | context.put(transTypesKey, this); |
vromero@1690 | 85 | compileStates = CompileStates.instance(context); |
jjg@113 | 86 | names = Names.instance(context); |
duke@1 | 87 | log = Log.instance(context); |
duke@1 | 88 | syms = Symtab.instance(context); |
duke@1 | 89 | enter = Enter.instance(context); |
duke@1 | 90 | overridden = new HashMap<MethodSymbol,MethodSymbol>(); |
duke@1 | 91 | Source source = Source.instance(context); |
duke@1 | 92 | allowEnums = source.allowEnums(); |
duke@1 | 93 | addBridges = source.addBridges(); |
duke@1 | 94 | types = Types.instance(context); |
duke@1 | 95 | make = TreeMaker.instance(context); |
duke@1 | 96 | resolve = Resolve.instance(context); |
duke@1 | 97 | } |
duke@1 | 98 | |
duke@1 | 99 | /** A hashtable mapping bridge methods to the methods they override after |
duke@1 | 100 | * type erasure. |
duke@1 | 101 | */ |
duke@1 | 102 | Map<MethodSymbol,MethodSymbol> overridden; |
duke@1 | 103 | |
duke@1 | 104 | /** Construct an attributed tree for a cast of expression to target type, |
duke@1 | 105 | * unless it already has precisely that type. |
duke@1 | 106 | * @param tree The expression tree. |
duke@1 | 107 | * @param target The target type. |
duke@1 | 108 | */ |
duke@1 | 109 | JCExpression cast(JCExpression tree, Type target) { |
duke@1 | 110 | int oldpos = make.pos; |
duke@1 | 111 | make.at(tree.pos); |
duke@1 | 112 | if (!types.isSameType(tree.type, target)) { |
duke@1 | 113 | if (!resolve.isAccessible(env, target.tsym)) |
mcimadamore@1221 | 114 | resolve.logAccessErrorInternal(env, tree, target); |
duke@1 | 115 | tree = make.TypeCast(make.Type(target), tree).setType(target); |
duke@1 | 116 | } |
duke@1 | 117 | make.pos = oldpos; |
duke@1 | 118 | return tree; |
duke@1 | 119 | } |
duke@1 | 120 | |
duke@1 | 121 | /** Construct an attributed tree to coerce an expression to some erased |
duke@1 | 122 | * target type, unless the expression is already assignable to that type. |
duke@1 | 123 | * If target type is a constant type, use its base type instead. |
duke@1 | 124 | * @param tree The expression tree. |
duke@1 | 125 | * @param target The target type. |
duke@1 | 126 | */ |
rfield@1380 | 127 | public JCExpression coerce(Env<AttrContext> env, JCExpression tree, Type target) { |
rfield@1380 | 128 | Env<AttrContext> prevEnv = this.env; |
rfield@1380 | 129 | try { |
rfield@1380 | 130 | this.env = env; |
rfield@1380 | 131 | return coerce(tree, target); |
rfield@1380 | 132 | } |
rfield@1380 | 133 | finally { |
rfield@1380 | 134 | this.env = prevEnv; |
rfield@1380 | 135 | } |
rfield@1380 | 136 | } |
duke@1 | 137 | JCExpression coerce(JCExpression tree, Type target) { |
duke@1 | 138 | Type btarget = target.baseType(); |
duke@1 | 139 | if (tree.type.isPrimitive() == target.isPrimitive()) { |
mcimadamore@1415 | 140 | return types.isAssignable(tree.type, btarget, types.noWarnings) |
duke@1 | 141 | ? tree |
duke@1 | 142 | : cast(tree, btarget); |
duke@1 | 143 | } |
duke@1 | 144 | return tree; |
duke@1 | 145 | } |
duke@1 | 146 | |
duke@1 | 147 | /** Given an erased reference type, assume this type as the tree's type. |
duke@1 | 148 | * Then, coerce to some given target type unless target type is null. |
duke@1 | 149 | * This operation is used in situations like the following: |
duke@1 | 150 | * |
jjg@1358 | 151 | * <pre>{@code |
duke@1 | 152 | * class Cell<A> { A value; } |
duke@1 | 153 | * ... |
duke@1 | 154 | * Cell<Integer> cell; |
duke@1 | 155 | * Integer x = cell.value; |
jjg@1358 | 156 | * }</pre> |
duke@1 | 157 | * |
duke@1 | 158 | * Since the erasure of Cell.value is Object, but the type |
duke@1 | 159 | * of cell.value in the assignment is Integer, we need to |
duke@1 | 160 | * adjust the original type of cell.value to Object, and insert |
duke@1 | 161 | * a cast to Integer. That is, the last assignment becomes: |
duke@1 | 162 | * |
jjg@1358 | 163 | * <pre>{@code |
duke@1 | 164 | * Integer x = (Integer)cell.value; |
jjg@1358 | 165 | * }</pre> |
duke@1 | 166 | * |
duke@1 | 167 | * @param tree The expression tree whose type might need adjustment. |
duke@1 | 168 | * @param erasedType The expression's type after erasure. |
duke@1 | 169 | * @param target The target type, which is usually the erasure of the |
duke@1 | 170 | * expression's original type. |
duke@1 | 171 | */ |
duke@1 | 172 | JCExpression retype(JCExpression tree, Type erasedType, Type target) { |
duke@1 | 173 | // System.err.println("retype " + tree + " to " + erasedType);//DEBUG |
jjg@1374 | 174 | if (!erasedType.isPrimitive()) { |
vromero@1785 | 175 | if (target != null && target.isPrimitive()) { |
duke@1 | 176 | target = erasure(tree.type); |
vromero@1785 | 177 | } |
duke@1 | 178 | tree.type = erasedType; |
vromero@1785 | 179 | if (target != null) { |
vromero@1785 | 180 | return coerce(tree, target); |
vromero@1785 | 181 | } |
duke@1 | 182 | } |
duke@1 | 183 | return tree; |
duke@1 | 184 | } |
duke@1 | 185 | |
duke@1 | 186 | /** Translate method argument list, casting each argument |
duke@1 | 187 | * to its corresponding type in a list of target types. |
duke@1 | 188 | * @param _args The method argument list. |
duke@1 | 189 | * @param parameters The list of target types. |
duke@1 | 190 | * @param varargsElement The erasure of the varargs element type, |
duke@1 | 191 | * or null if translating a non-varargs invocation |
duke@1 | 192 | */ |
duke@1 | 193 | <T extends JCTree> List<T> translateArgs(List<T> _args, |
duke@1 | 194 | List<Type> parameters, |
duke@1 | 195 | Type varargsElement) { |
duke@1 | 196 | if (parameters.isEmpty()) return _args; |
duke@1 | 197 | List<T> args = _args; |
duke@1 | 198 | while (parameters.tail.nonEmpty()) { |
duke@1 | 199 | args.head = translate(args.head, parameters.head); |
duke@1 | 200 | args = args.tail; |
duke@1 | 201 | parameters = parameters.tail; |
duke@1 | 202 | } |
duke@1 | 203 | Type parameter = parameters.head; |
jjg@816 | 204 | Assert.check(varargsElement != null || args.length() == 1); |
duke@1 | 205 | if (varargsElement != null) { |
duke@1 | 206 | while (args.nonEmpty()) { |
duke@1 | 207 | args.head = translate(args.head, varargsElement); |
duke@1 | 208 | args = args.tail; |
duke@1 | 209 | } |
duke@1 | 210 | } else { |
duke@1 | 211 | args.head = translate(args.head, parameter); |
duke@1 | 212 | } |
duke@1 | 213 | return _args; |
duke@1 | 214 | } |
duke@1 | 215 | |
rfield@1380 | 216 | public <T extends JCTree> List<T> translateArgs(List<T> _args, |
rfield@1380 | 217 | List<Type> parameters, |
rfield@1380 | 218 | Type varargsElement, |
rfield@1380 | 219 | Env<AttrContext> localEnv) { |
rfield@1380 | 220 | Env<AttrContext> prevEnv = env; |
rfield@1380 | 221 | try { |
rfield@1380 | 222 | env = localEnv; |
rfield@1380 | 223 | return translateArgs(_args, parameters, varargsElement); |
rfield@1380 | 224 | } |
rfield@1380 | 225 | finally { |
rfield@1380 | 226 | env = prevEnv; |
rfield@1380 | 227 | } |
rfield@1380 | 228 | } |
rfield@1380 | 229 | |
duke@1 | 230 | /** Add a bridge definition and enter corresponding method symbol in |
duke@1 | 231 | * local scope of origin. |
duke@1 | 232 | * |
duke@1 | 233 | * @param pos The source code position to be used for the definition. |
duke@1 | 234 | * @param meth The method for which a bridge needs to be added |
duke@1 | 235 | * @param impl That method's implementation (possibly the method itself) |
duke@1 | 236 | * @param origin The class to which the bridge will be added |
duke@1 | 237 | * @param hypothetical |
duke@1 | 238 | * True if the bridge method is not strictly necessary in the |
duke@1 | 239 | * binary, but is represented in the symbol table to detect |
duke@1 | 240 | * erasure clashes. |
duke@1 | 241 | * @param bridges The list buffer to which the bridge will be added |
duke@1 | 242 | */ |
duke@1 | 243 | void addBridge(DiagnosticPosition pos, |
duke@1 | 244 | MethodSymbol meth, |
duke@1 | 245 | MethodSymbol impl, |
duke@1 | 246 | ClassSymbol origin, |
duke@1 | 247 | boolean hypothetical, |
duke@1 | 248 | ListBuffer<JCTree> bridges) { |
duke@1 | 249 | make.at(pos); |
duke@1 | 250 | Type origType = types.memberType(origin.type, meth); |
duke@1 | 251 | Type origErasure = erasure(origType); |
duke@1 | 252 | |
duke@1 | 253 | // Create a bridge method symbol and a bridge definition without a body. |
duke@1 | 254 | Type bridgeType = meth.erasure(types); |
duke@1 | 255 | long flags = impl.flags() & AccessFlags | SYNTHETIC | BRIDGE; |
duke@1 | 256 | if (hypothetical) flags |= HYPOTHETICAL; |
duke@1 | 257 | MethodSymbol bridge = new MethodSymbol(flags, |
duke@1 | 258 | meth.name, |
duke@1 | 259 | bridgeType, |
duke@1 | 260 | origin); |
vromero@1792 | 261 | /* once JDK-6996415 is solved it should be checked if this approach can |
vromero@1792 | 262 | * be applied to method addOverrideBridgesIfNeeded |
vromero@1792 | 263 | */ |
vromero@1792 | 264 | bridge.params = createBridgeParams(impl, bridge, bridgeType); |
vromero@1792 | 265 | if (impl.annotations != null) { |
vromero@1792 | 266 | bridge.annotations.setAttributes(impl.annotations); |
vromero@1792 | 267 | } |
vromero@1792 | 268 | |
duke@1 | 269 | if (!hypothetical) { |
duke@1 | 270 | JCMethodDecl md = make.MethodDef(bridge, null); |
duke@1 | 271 | |
duke@1 | 272 | // The bridge calls this.impl(..), if we have an implementation |
duke@1 | 273 | // in the current class, super.impl(...) otherwise. |
duke@1 | 274 | JCExpression receiver = (impl.owner == origin) |
duke@1 | 275 | ? make.This(origin.erasure(types)) |
duke@1 | 276 | : make.Super(types.supertype(origin.type).tsym.erasure(types), origin); |
duke@1 | 277 | |
duke@1 | 278 | // The type returned from the original method. |
duke@1 | 279 | Type calltype = erasure(impl.type.getReturnType()); |
duke@1 | 280 | |
duke@1 | 281 | // Construct a call of this.impl(params), or super.impl(params), |
duke@1 | 282 | // casting params and possibly results as needed. |
duke@1 | 283 | JCExpression call = |
duke@1 | 284 | make.Apply( |
duke@1 | 285 | null, |
duke@1 | 286 | make.Select(receiver, impl).setType(calltype), |
duke@1 | 287 | translateArgs(make.Idents(md.params), origErasure.getParameterTypes(), null)) |
duke@1 | 288 | .setType(calltype); |
jjg@1374 | 289 | JCStatement stat = (origErasure.getReturnType().hasTag(VOID)) |
duke@1 | 290 | ? make.Exec(call) |
duke@1 | 291 | : make.Return(coerce(call, bridgeType.getReturnType())); |
duke@1 | 292 | md.body = make.Block(0, List.of(stat)); |
duke@1 | 293 | |
duke@1 | 294 | // Add bridge to `bridges' buffer |
duke@1 | 295 | bridges.append(md); |
duke@1 | 296 | } |
duke@1 | 297 | |
duke@1 | 298 | // Add bridge to scope of enclosing class and `overridden' table. |
duke@1 | 299 | origin.members().enter(bridge); |
duke@1 | 300 | overridden.put(bridge, meth); |
duke@1 | 301 | } |
duke@1 | 302 | |
vromero@1792 | 303 | private List<VarSymbol> createBridgeParams(MethodSymbol impl, MethodSymbol bridge, |
vromero@1792 | 304 | Type bridgeType) { |
vromero@1792 | 305 | List<VarSymbol> bridgeParams = null; |
vromero@1792 | 306 | if (impl.params != null) { |
vromero@1792 | 307 | bridgeParams = List.nil(); |
vromero@1792 | 308 | List<VarSymbol> implParams = impl.params; |
vromero@1792 | 309 | Type.MethodType mType = (Type.MethodType)bridgeType; |
vromero@1792 | 310 | List<Type> argTypes = mType.argtypes; |
vromero@1792 | 311 | while (implParams.nonEmpty() && argTypes.nonEmpty()) { |
vromero@1792 | 312 | VarSymbol param = new VarSymbol(implParams.head.flags() | SYNTHETIC, |
vromero@1792 | 313 | implParams.head.name, argTypes.head, bridge); |
vromero@1792 | 314 | if (implParams.head.annotations != null) { |
vromero@1792 | 315 | param.annotations.setAttributes(implParams.head.annotations); |
vromero@1792 | 316 | } |
vromero@1792 | 317 | bridgeParams = bridgeParams.append(param); |
vromero@1792 | 318 | implParams = implParams.tail; |
vromero@1792 | 319 | argTypes = argTypes.tail; |
vromero@1792 | 320 | } |
vromero@1792 | 321 | } |
vromero@1792 | 322 | return bridgeParams; |
vromero@1792 | 323 | } |
vromero@1792 | 324 | |
duke@1 | 325 | /** Add bridge if given symbol is a non-private, non-static member |
duke@1 | 326 | * of the given class, which is either defined in the class or non-final |
duke@1 | 327 | * inherited, and one of the two following conditions holds: |
duke@1 | 328 | * 1. The method's type changes in the given class, as compared to the |
duke@1 | 329 | * class where the symbol was defined, (in this case |
duke@1 | 330 | * we have extended a parameterized class with non-trivial parameters). |
duke@1 | 331 | * 2. The method has an implementation with a different erased return type. |
duke@1 | 332 | * (in this case we have used co-variant returns). |
duke@1 | 333 | * If a bridge already exists in some other class, no new bridge is added. |
duke@1 | 334 | * Instead, it is checked that the bridge symbol overrides the method symbol. |
duke@1 | 335 | * (Spec ???). |
duke@1 | 336 | * todo: what about bridges for privates??? |
duke@1 | 337 | * |
duke@1 | 338 | * @param pos The source code position to be used for the definition. |
duke@1 | 339 | * @param sym The symbol for which a bridge might have to be added. |
duke@1 | 340 | * @param origin The class in which the bridge would go. |
duke@1 | 341 | * @param bridges The list buffer to which the bridge would be added. |
duke@1 | 342 | */ |
duke@1 | 343 | void addBridgeIfNeeded(DiagnosticPosition pos, |
duke@1 | 344 | Symbol sym, |
duke@1 | 345 | ClassSymbol origin, |
duke@1 | 346 | ListBuffer<JCTree> bridges) { |
duke@1 | 347 | if (sym.kind == MTH && |
duke@1 | 348 | sym.name != names.init && |
mcimadamore@673 | 349 | (sym.flags() & (PRIVATE | STATIC)) == 0 && |
mcimadamore@673 | 350 | (sym.flags() & (SYNTHETIC | OVERRIDE_BRIDGE)) != SYNTHETIC && |
duke@1 | 351 | sym.isMemberOf(origin, types)) |
duke@1 | 352 | { |
duke@1 | 353 | MethodSymbol meth = (MethodSymbol)sym; |
duke@1 | 354 | MethodSymbol bridge = meth.binaryImplementation(origin, types); |
mcimadamore@673 | 355 | MethodSymbol impl = meth.implementation(origin, types, true, overrideBridgeFilter); |
duke@1 | 356 | if (bridge == null || |
duke@1 | 357 | bridge == meth || |
duke@1 | 358 | (impl != null && !bridge.owner.isSubClass(impl.owner, types))) { |
duke@1 | 359 | // No bridge was added yet. |
duke@1 | 360 | if (impl != null && isBridgeNeeded(meth, impl, origin.type)) { |
duke@1 | 361 | addBridge(pos, meth, impl, origin, bridge==impl, bridges); |
duke@1 | 362 | } else if (impl == meth |
duke@1 | 363 | && impl.owner != origin |
duke@1 | 364 | && (impl.flags() & FINAL) == 0 |
duke@1 | 365 | && (meth.flags() & (ABSTRACT|PUBLIC)) == PUBLIC |
duke@1 | 366 | && (origin.flags() & PUBLIC) > (impl.owner.flags() & PUBLIC)) { |
duke@1 | 367 | // this is to work around a horrible but permanent |
duke@1 | 368 | // reflection design error. |
duke@1 | 369 | addBridge(pos, meth, impl, origin, false, bridges); |
duke@1 | 370 | } |
mcimadamore@673 | 371 | } else if ((bridge.flags() & (SYNTHETIC | OVERRIDE_BRIDGE)) == SYNTHETIC) { |
duke@1 | 372 | MethodSymbol other = overridden.get(bridge); |
duke@1 | 373 | if (other != null && other != meth) { |
duke@1 | 374 | if (impl == null || !impl.overrides(other, origin, types, true)) { |
duke@1 | 375 | // Bridge for other symbol pair was added |
duke@1 | 376 | log.error(pos, "name.clash.same.erasure.no.override", |
duke@1 | 377 | other, other.location(origin.type, types), |
duke@1 | 378 | meth, meth.location(origin.type, types)); |
duke@1 | 379 | } |
duke@1 | 380 | } |
duke@1 | 381 | } else if (!bridge.overrides(meth, origin, types, true)) { |
duke@1 | 382 | // Accidental binary override without source override. |
duke@1 | 383 | if (bridge.owner == origin || |
duke@1 | 384 | types.asSuper(bridge.owner.type, meth.owner) == null) |
duke@1 | 385 | // Don't diagnose the problem if it would already |
duke@1 | 386 | // have been reported in the superclass |
duke@1 | 387 | log.error(pos, "name.clash.same.erasure.no.override", |
duke@1 | 388 | bridge, bridge.location(origin.type, types), |
duke@1 | 389 | meth, meth.location(origin.type, types)); |
duke@1 | 390 | } |
duke@1 | 391 | } |
duke@1 | 392 | } |
duke@1 | 393 | // where |
mcimadamore@673 | 394 | Filter<Symbol> overrideBridgeFilter = new Filter<Symbol>() { |
mcimadamore@673 | 395 | public boolean accepts(Symbol s) { |
mcimadamore@673 | 396 | return (s.flags() & (SYNTHETIC | OVERRIDE_BRIDGE)) != SYNTHETIC; |
mcimadamore@673 | 397 | } |
mcimadamore@673 | 398 | }; |
duke@1 | 399 | /** |
duke@1 | 400 | * @param method The symbol for which a bridge might have to be added |
duke@1 | 401 | * @param impl The implementation of method |
duke@1 | 402 | * @param dest The type in which the bridge would go |
duke@1 | 403 | */ |
duke@1 | 404 | private boolean isBridgeNeeded(MethodSymbol method, |
duke@1 | 405 | MethodSymbol impl, |
duke@1 | 406 | Type dest) { |
duke@1 | 407 | if (impl != method) { |
duke@1 | 408 | // If either method or impl have different erasures as |
duke@1 | 409 | // members of dest, a bridge is needed. |
duke@1 | 410 | Type method_erasure = method.erasure(types); |
duke@1 | 411 | if (!isSameMemberWhenErased(dest, method, method_erasure)) |
duke@1 | 412 | return true; |
duke@1 | 413 | Type impl_erasure = impl.erasure(types); |
duke@1 | 414 | if (!isSameMemberWhenErased(dest, impl, impl_erasure)) |
duke@1 | 415 | return true; |
duke@1 | 416 | |
duke@1 | 417 | // If the erasure of the return type is different, a |
duke@1 | 418 | // bridge is needed. |
duke@1 | 419 | return !types.isSameType(impl_erasure.getReturnType(), |
duke@1 | 420 | method_erasure.getReturnType()); |
duke@1 | 421 | } else { |
duke@1 | 422 | // method and impl are the same... |
duke@1 | 423 | if ((method.flags() & ABSTRACT) != 0) { |
duke@1 | 424 | // ...and abstract so a bridge is not needed. |
duke@1 | 425 | // Concrete subclasses will bridge as needed. |
duke@1 | 426 | return false; |
duke@1 | 427 | } |
duke@1 | 428 | |
duke@1 | 429 | // The erasure of the return type is always the same |
duke@1 | 430 | // for the same symbol. Reducing the three tests in |
duke@1 | 431 | // the other branch to just one: |
duke@1 | 432 | return !isSameMemberWhenErased(dest, method, method.erasure(types)); |
duke@1 | 433 | } |
duke@1 | 434 | } |
duke@1 | 435 | /** |
duke@1 | 436 | * Lookup the method as a member of the type. Compare the |
duke@1 | 437 | * erasures. |
duke@1 | 438 | * @param type the class where to look for the method |
duke@1 | 439 | * @param method the method to look for in class |
duke@1 | 440 | * @param erasure the erasure of method |
duke@1 | 441 | */ |
duke@1 | 442 | private boolean isSameMemberWhenErased(Type type, |
duke@1 | 443 | MethodSymbol method, |
duke@1 | 444 | Type erasure) { |
duke@1 | 445 | return types.isSameType(erasure(types.memberType(type, method)), |
duke@1 | 446 | erasure); |
duke@1 | 447 | } |
duke@1 | 448 | |
duke@1 | 449 | void addBridges(DiagnosticPosition pos, |
duke@1 | 450 | TypeSymbol i, |
duke@1 | 451 | ClassSymbol origin, |
duke@1 | 452 | ListBuffer<JCTree> bridges) { |
duke@1 | 453 | for (Scope.Entry e = i.members().elems; e != null; e = e.sibling) |
duke@1 | 454 | addBridgeIfNeeded(pos, e.sym, origin, bridges); |
duke@1 | 455 | for (List<Type> l = types.interfaces(i.type); l.nonEmpty(); l = l.tail) |
duke@1 | 456 | addBridges(pos, l.head.tsym, origin, bridges); |
duke@1 | 457 | } |
duke@1 | 458 | |
duke@1 | 459 | /** Add all necessary bridges to some class appending them to list buffer. |
duke@1 | 460 | * @param pos The source code position to be used for the bridges. |
duke@1 | 461 | * @param origin The class in which the bridges go. |
duke@1 | 462 | * @param bridges The list buffer to which the bridges are added. |
duke@1 | 463 | */ |
duke@1 | 464 | void addBridges(DiagnosticPosition pos, ClassSymbol origin, ListBuffer<JCTree> bridges) { |
duke@1 | 465 | Type st = types.supertype(origin.type); |
jjg@1374 | 466 | while (st.hasTag(CLASS)) { |
duke@1 | 467 | // if (isSpecialization(st)) |
duke@1 | 468 | addBridges(pos, st.tsym, origin, bridges); |
duke@1 | 469 | st = types.supertype(st); |
duke@1 | 470 | } |
duke@1 | 471 | for (List<Type> l = types.interfaces(origin.type); l.nonEmpty(); l = l.tail) |
duke@1 | 472 | // if (isSpecialization(l.head)) |
duke@1 | 473 | addBridges(pos, l.head.tsym, origin, bridges); |
duke@1 | 474 | } |
duke@1 | 475 | |
duke@1 | 476 | /* ************************************************************************ |
duke@1 | 477 | * Visitor methods |
duke@1 | 478 | *************************************************************************/ |
duke@1 | 479 | |
duke@1 | 480 | /** Visitor argument: proto-type. |
duke@1 | 481 | */ |
duke@1 | 482 | private Type pt; |
duke@1 | 483 | |
duke@1 | 484 | /** Visitor method: perform a type translation on tree. |
duke@1 | 485 | */ |
duke@1 | 486 | public <T extends JCTree> T translate(T tree, Type pt) { |
duke@1 | 487 | Type prevPt = this.pt; |
duke@1 | 488 | try { |
duke@1 | 489 | this.pt = pt; |
duke@1 | 490 | return translate(tree); |
duke@1 | 491 | } finally { |
duke@1 | 492 | this.pt = prevPt; |
duke@1 | 493 | } |
duke@1 | 494 | } |
duke@1 | 495 | |
duke@1 | 496 | /** Visitor method: perform a type translation on list of trees. |
duke@1 | 497 | */ |
duke@1 | 498 | public <T extends JCTree> List<T> translate(List<T> trees, Type pt) { |
duke@1 | 499 | Type prevPt = this.pt; |
duke@1 | 500 | List<T> res; |
duke@1 | 501 | try { |
duke@1 | 502 | this.pt = pt; |
duke@1 | 503 | res = translate(trees); |
duke@1 | 504 | } finally { |
duke@1 | 505 | this.pt = prevPt; |
duke@1 | 506 | } |
duke@1 | 507 | return res; |
duke@1 | 508 | } |
duke@1 | 509 | |
duke@1 | 510 | public void visitClassDef(JCClassDecl tree) { |
duke@1 | 511 | translateClass(tree.sym); |
duke@1 | 512 | result = tree; |
duke@1 | 513 | } |
duke@1 | 514 | |
rfield@1380 | 515 | JCTree currentMethod = null; |
duke@1 | 516 | public void visitMethodDef(JCMethodDecl tree) { |
rfield@1380 | 517 | JCTree previousMethod = currentMethod; |
duke@1 | 518 | try { |
duke@1 | 519 | currentMethod = tree; |
duke@1 | 520 | tree.restype = translate(tree.restype, null); |
duke@1 | 521 | tree.typarams = List.nil(); |
duke@1 | 522 | tree.params = translateVarDefs(tree.params); |
jjg@1521 | 523 | tree.recvparam = translate(tree.recvparam, null); |
duke@1 | 524 | tree.thrown = translate(tree.thrown, null); |
duke@1 | 525 | tree.body = translate(tree.body, tree.sym.erasure(types).getReturnType()); |
duke@1 | 526 | tree.type = erasure(tree.type); |
duke@1 | 527 | result = tree; |
duke@1 | 528 | } finally { |
duke@1 | 529 | currentMethod = previousMethod; |
duke@1 | 530 | } |
duke@1 | 531 | |
duke@1 | 532 | // Check that we do not introduce a name clash by erasing types. |
duke@1 | 533 | for (Scope.Entry e = tree.sym.owner.members().lookup(tree.name); |
duke@1 | 534 | e.sym != null; |
duke@1 | 535 | e = e.next()) { |
duke@1 | 536 | if (e.sym != tree.sym && |
duke@1 | 537 | types.isSameType(erasure(e.sym.type), tree.type)) { |
duke@1 | 538 | log.error(tree.pos(), |
duke@1 | 539 | "name.clash.same.erasure", tree.sym, |
duke@1 | 540 | e.sym); |
duke@1 | 541 | return; |
duke@1 | 542 | } |
duke@1 | 543 | } |
duke@1 | 544 | } |
duke@1 | 545 | |
duke@1 | 546 | public void visitVarDef(JCVariableDecl tree) { |
duke@1 | 547 | tree.vartype = translate(tree.vartype, null); |
duke@1 | 548 | tree.init = translate(tree.init, tree.sym.erasure(types)); |
duke@1 | 549 | tree.type = erasure(tree.type); |
duke@1 | 550 | result = tree; |
duke@1 | 551 | } |
duke@1 | 552 | |
duke@1 | 553 | public void visitDoLoop(JCDoWhileLoop tree) { |
duke@1 | 554 | tree.body = translate(tree.body); |
duke@1 | 555 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 556 | result = tree; |
duke@1 | 557 | } |
duke@1 | 558 | |
duke@1 | 559 | public void visitWhileLoop(JCWhileLoop tree) { |
duke@1 | 560 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 561 | tree.body = translate(tree.body); |
duke@1 | 562 | result = tree; |
duke@1 | 563 | } |
duke@1 | 564 | |
duke@1 | 565 | public void visitForLoop(JCForLoop tree) { |
duke@1 | 566 | tree.init = translate(tree.init, null); |
duke@1 | 567 | if (tree.cond != null) |
duke@1 | 568 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 569 | tree.step = translate(tree.step, null); |
duke@1 | 570 | tree.body = translate(tree.body); |
duke@1 | 571 | result = tree; |
duke@1 | 572 | } |
duke@1 | 573 | |
duke@1 | 574 | public void visitForeachLoop(JCEnhancedForLoop tree) { |
duke@1 | 575 | tree.var = translate(tree.var, null); |
duke@1 | 576 | Type iterableType = tree.expr.type; |
duke@1 | 577 | tree.expr = translate(tree.expr, erasure(tree.expr.type)); |
duke@1 | 578 | if (types.elemtype(tree.expr.type) == null) |
duke@1 | 579 | tree.expr.type = iterableType; // preserve type for Lower |
duke@1 | 580 | tree.body = translate(tree.body); |
duke@1 | 581 | result = tree; |
duke@1 | 582 | } |
duke@1 | 583 | |
rfield@1380 | 584 | public void visitLambda(JCLambda tree) { |
rfield@1380 | 585 | JCTree prevMethod = currentMethod; |
rfield@1380 | 586 | try { |
rfield@1380 | 587 | currentMethod = null; |
rfield@1380 | 588 | tree.params = translate(tree.params); |
rfield@1380 | 589 | tree.body = translate(tree.body, null); |
rfield@1380 | 590 | tree.type = erasure(tree.type); |
rfield@1380 | 591 | result = tree; |
rfield@1380 | 592 | } |
rfield@1380 | 593 | finally { |
rfield@1380 | 594 | currentMethod = prevMethod; |
rfield@1380 | 595 | } |
rfield@1380 | 596 | } |
rfield@1380 | 597 | |
duke@1 | 598 | public void visitSwitch(JCSwitch tree) { |
duke@1 | 599 | Type selsuper = types.supertype(tree.selector.type); |
duke@1 | 600 | boolean enumSwitch = selsuper != null && |
duke@1 | 601 | selsuper.tsym == syms.enumSym; |
duke@1 | 602 | Type target = enumSwitch ? erasure(tree.selector.type) : syms.intType; |
duke@1 | 603 | tree.selector = translate(tree.selector, target); |
duke@1 | 604 | tree.cases = translateCases(tree.cases); |
duke@1 | 605 | result = tree; |
duke@1 | 606 | } |
duke@1 | 607 | |
duke@1 | 608 | public void visitCase(JCCase tree) { |
duke@1 | 609 | tree.pat = translate(tree.pat, null); |
duke@1 | 610 | tree.stats = translate(tree.stats); |
duke@1 | 611 | result = tree; |
duke@1 | 612 | } |
duke@1 | 613 | |
duke@1 | 614 | public void visitSynchronized(JCSynchronized tree) { |
duke@1 | 615 | tree.lock = translate(tree.lock, erasure(tree.lock.type)); |
duke@1 | 616 | tree.body = translate(tree.body); |
duke@1 | 617 | result = tree; |
duke@1 | 618 | } |
duke@1 | 619 | |
darcy@609 | 620 | public void visitTry(JCTry tree) { |
darcy@609 | 621 | tree.resources = translate(tree.resources, syms.autoCloseableType); |
darcy@609 | 622 | tree.body = translate(tree.body); |
darcy@609 | 623 | tree.catchers = translateCatchers(tree.catchers); |
darcy@609 | 624 | tree.finalizer = translate(tree.finalizer); |
darcy@609 | 625 | result = tree; |
darcy@609 | 626 | } |
darcy@609 | 627 | |
duke@1 | 628 | public void visitConditional(JCConditional tree) { |
duke@1 | 629 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 630 | tree.truepart = translate(tree.truepart, erasure(tree.type)); |
duke@1 | 631 | tree.falsepart = translate(tree.falsepart, erasure(tree.type)); |
duke@1 | 632 | tree.type = erasure(tree.type); |
mcimadamore@120 | 633 | result = retype(tree, tree.type, pt); |
duke@1 | 634 | } |
duke@1 | 635 | |
duke@1 | 636 | public void visitIf(JCIf tree) { |
duke@1 | 637 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 638 | tree.thenpart = translate(tree.thenpart); |
duke@1 | 639 | tree.elsepart = translate(tree.elsepart); |
duke@1 | 640 | result = tree; |
duke@1 | 641 | } |
duke@1 | 642 | |
duke@1 | 643 | public void visitExec(JCExpressionStatement tree) { |
duke@1 | 644 | tree.expr = translate(tree.expr, null); |
duke@1 | 645 | result = tree; |
duke@1 | 646 | } |
duke@1 | 647 | |
duke@1 | 648 | public void visitReturn(JCReturn tree) { |
rfield@1380 | 649 | tree.expr = translate(tree.expr, currentMethod != null ? types.erasure(currentMethod.type).getReturnType() : null); |
duke@1 | 650 | result = tree; |
duke@1 | 651 | } |
duke@1 | 652 | |
duke@1 | 653 | public void visitThrow(JCThrow tree) { |
duke@1 | 654 | tree.expr = translate(tree.expr, erasure(tree.expr.type)); |
duke@1 | 655 | result = tree; |
duke@1 | 656 | } |
duke@1 | 657 | |
duke@1 | 658 | public void visitAssert(JCAssert tree) { |
duke@1 | 659 | tree.cond = translate(tree.cond, syms.booleanType); |
duke@1 | 660 | if (tree.detail != null) |
duke@1 | 661 | tree.detail = translate(tree.detail, erasure(tree.detail.type)); |
duke@1 | 662 | result = tree; |
duke@1 | 663 | } |
duke@1 | 664 | |
duke@1 | 665 | public void visitApply(JCMethodInvocation tree) { |
duke@1 | 666 | tree.meth = translate(tree.meth, null); |
duke@1 | 667 | Symbol meth = TreeInfo.symbol(tree.meth); |
duke@1 | 668 | Type mt = meth.erasure(types); |
duke@1 | 669 | List<Type> argtypes = mt.getParameterTypes(); |
duke@1 | 670 | if (allowEnums && |
duke@1 | 671 | meth.name==names.init && |
duke@1 | 672 | meth.owner == syms.enumSym) |
duke@1 | 673 | argtypes = argtypes.tail.tail; |
duke@1 | 674 | if (tree.varargsElement != null) |
duke@1 | 675 | tree.varargsElement = types.erasure(tree.varargsElement); |
duke@1 | 676 | else |
jjg@816 | 677 | Assert.check(tree.args.length() == argtypes.length()); |
duke@1 | 678 | tree.args = translateArgs(tree.args, argtypes, tree.varargsElement); |
duke@1 | 679 | |
rfield@1380 | 680 | tree.type = types.erasure(tree.type); |
duke@1 | 681 | // Insert casts of method invocation results as needed. |
duke@1 | 682 | result = retype(tree, mt.getReturnType(), pt); |
duke@1 | 683 | } |
duke@1 | 684 | |
duke@1 | 685 | public void visitNewClass(JCNewClass tree) { |
duke@1 | 686 | if (tree.encl != null) |
duke@1 | 687 | tree.encl = translate(tree.encl, erasure(tree.encl.type)); |
duke@1 | 688 | tree.clazz = translate(tree.clazz, null); |
duke@1 | 689 | if (tree.varargsElement != null) |
duke@1 | 690 | tree.varargsElement = types.erasure(tree.varargsElement); |
duke@1 | 691 | tree.args = translateArgs( |
duke@1 | 692 | tree.args, tree.constructor.erasure(types).getParameterTypes(), tree.varargsElement); |
duke@1 | 693 | tree.def = translate(tree.def, null); |
rfield@1380 | 694 | if (tree.constructorType != null) |
rfield@1380 | 695 | tree.constructorType = erasure(tree.constructorType); |
duke@1 | 696 | tree.type = erasure(tree.type); |
duke@1 | 697 | result = tree; |
duke@1 | 698 | } |
duke@1 | 699 | |
duke@1 | 700 | public void visitNewArray(JCNewArray tree) { |
duke@1 | 701 | tree.elemtype = translate(tree.elemtype, null); |
duke@1 | 702 | translate(tree.dims, syms.intType); |
jjg@511 | 703 | if (tree.type != null) { |
jjg@511 | 704 | tree.elems = translate(tree.elems, erasure(types.elemtype(tree.type))); |
jjg@511 | 705 | tree.type = erasure(tree.type); |
jjg@511 | 706 | } else { |
jjg@511 | 707 | tree.elems = translate(tree.elems, null); |
jjg@511 | 708 | } |
duke@1 | 709 | |
duke@1 | 710 | result = tree; |
duke@1 | 711 | } |
duke@1 | 712 | |
duke@1 | 713 | public void visitParens(JCParens tree) { |
duke@1 | 714 | tree.expr = translate(tree.expr, pt); |
duke@1 | 715 | tree.type = erasure(tree.type); |
duke@1 | 716 | result = tree; |
duke@1 | 717 | } |
duke@1 | 718 | |
duke@1 | 719 | public void visitAssign(JCAssign tree) { |
duke@1 | 720 | tree.lhs = translate(tree.lhs, null); |
duke@1 | 721 | tree.rhs = translate(tree.rhs, erasure(tree.lhs.type)); |
vromero@1785 | 722 | tree.type = erasure(tree.lhs.type); |
vromero@1785 | 723 | result = retype(tree, tree.type, pt); |
duke@1 | 724 | } |
duke@1 | 725 | |
duke@1 | 726 | public void visitAssignop(JCAssignOp tree) { |
mcimadamore@360 | 727 | tree.lhs = translate(tree.lhs, null); |
mcimadamore@133 | 728 | tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head); |
duke@1 | 729 | tree.type = erasure(tree.type); |
duke@1 | 730 | result = tree; |
duke@1 | 731 | } |
duke@1 | 732 | |
duke@1 | 733 | public void visitUnary(JCUnary tree) { |
duke@1 | 734 | tree.arg = translate(tree.arg, tree.operator.type.getParameterTypes().head); |
duke@1 | 735 | result = tree; |
duke@1 | 736 | } |
duke@1 | 737 | |
duke@1 | 738 | public void visitBinary(JCBinary tree) { |
duke@1 | 739 | tree.lhs = translate(tree.lhs, tree.operator.type.getParameterTypes().head); |
duke@1 | 740 | tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head); |
duke@1 | 741 | result = tree; |
duke@1 | 742 | } |
duke@1 | 743 | |
duke@1 | 744 | public void visitTypeCast(JCTypeCast tree) { |
duke@1 | 745 | tree.clazz = translate(tree.clazz, null); |
mcimadamore@1696 | 746 | Type originalTarget = tree.type; |
duke@1 | 747 | tree.type = erasure(tree.type); |
duke@1 | 748 | tree.expr = translate(tree.expr, tree.type); |
mcimadamore@1696 | 749 | if (originalTarget.isCompound()) { |
mcimadamore@1696 | 750 | Type.IntersectionClassType ict = (Type.IntersectionClassType)originalTarget; |
mcimadamore@1696 | 751 | for (Type c : ict.getExplicitComponents()) { |
mcimadamore@1696 | 752 | Type ec = erasure(c); |
mcimadamore@1696 | 753 | if (!types.isSameType(ec, tree.type)) { |
mcimadamore@1696 | 754 | tree.expr = coerce(tree.expr, ec); |
mcimadamore@1696 | 755 | } |
mcimadamore@1696 | 756 | } |
mcimadamore@1696 | 757 | } |
duke@1 | 758 | result = tree; |
duke@1 | 759 | } |
duke@1 | 760 | |
duke@1 | 761 | public void visitTypeTest(JCInstanceOf tree) { |
duke@1 | 762 | tree.expr = translate(tree.expr, null); |
duke@1 | 763 | tree.clazz = translate(tree.clazz, null); |
duke@1 | 764 | result = tree; |
duke@1 | 765 | } |
duke@1 | 766 | |
duke@1 | 767 | public void visitIndexed(JCArrayAccess tree) { |
duke@1 | 768 | tree.indexed = translate(tree.indexed, erasure(tree.indexed.type)); |
duke@1 | 769 | tree.index = translate(tree.index, syms.intType); |
duke@1 | 770 | |
duke@1 | 771 | // Insert casts of indexed expressions as needed. |
duke@1 | 772 | result = retype(tree, types.elemtype(tree.indexed.type), pt); |
duke@1 | 773 | } |
duke@1 | 774 | |
duke@1 | 775 | // There ought to be nothing to rewrite here; |
duke@1 | 776 | // we don't generate code. |
duke@1 | 777 | public void visitAnnotation(JCAnnotation tree) { |
duke@1 | 778 | result = tree; |
duke@1 | 779 | } |
duke@1 | 780 | |
duke@1 | 781 | public void visitIdent(JCIdent tree) { |
duke@1 | 782 | Type et = tree.sym.erasure(types); |
duke@1 | 783 | |
duke@1 | 784 | // Map type variables to their bounds. |
jjg@1374 | 785 | if (tree.sym.kind == TYP && tree.sym.type.hasTag(TYPEVAR)) { |
duke@1 | 786 | result = make.at(tree.pos).Type(et); |
duke@1 | 787 | } else |
duke@1 | 788 | // Map constants expressions to themselves. |
duke@1 | 789 | if (tree.type.constValue() != null) { |
duke@1 | 790 | result = tree; |
duke@1 | 791 | } |
duke@1 | 792 | // Insert casts of variable uses as needed. |
duke@1 | 793 | else if (tree.sym.kind == VAR) { |
duke@1 | 794 | result = retype(tree, et, pt); |
duke@1 | 795 | } |
duke@1 | 796 | else { |
duke@1 | 797 | tree.type = erasure(tree.type); |
duke@1 | 798 | result = tree; |
duke@1 | 799 | } |
duke@1 | 800 | } |
duke@1 | 801 | |
duke@1 | 802 | public void visitSelect(JCFieldAccess tree) { |
duke@1 | 803 | Type t = tree.selected.type; |
jjg@1374 | 804 | while (t.hasTag(TYPEVAR)) |
mcimadamore@23 | 805 | t = t.getUpperBound(); |
mcimadamore@23 | 806 | if (t.isCompound()) { |
duke@1 | 807 | if ((tree.sym.flags() & IPROXY) != 0) { |
duke@1 | 808 | tree.sym = ((MethodSymbol)tree.sym). |
duke@1 | 809 | implemented((TypeSymbol)tree.sym.owner, types); |
duke@1 | 810 | } |
mcimadamore@769 | 811 | tree.selected = coerce( |
mcimadamore@23 | 812 | translate(tree.selected, erasure(tree.selected.type)), |
duke@1 | 813 | erasure(tree.sym.owner.type)); |
duke@1 | 814 | } else |
duke@1 | 815 | tree.selected = translate(tree.selected, erasure(t)); |
duke@1 | 816 | |
duke@1 | 817 | // Map constants expressions to themselves. |
duke@1 | 818 | if (tree.type.constValue() != null) { |
duke@1 | 819 | result = tree; |
duke@1 | 820 | } |
duke@1 | 821 | // Insert casts of variable uses as needed. |
duke@1 | 822 | else if (tree.sym.kind == VAR) { |
duke@1 | 823 | result = retype(tree, tree.sym.erasure(types), pt); |
duke@1 | 824 | } |
duke@1 | 825 | else { |
duke@1 | 826 | tree.type = erasure(tree.type); |
duke@1 | 827 | result = tree; |
duke@1 | 828 | } |
duke@1 | 829 | } |
duke@1 | 830 | |
rfield@1380 | 831 | public void visitReference(JCMemberReference tree) { |
rfield@1380 | 832 | tree.expr = translate(tree.expr, null); |
rfield@1380 | 833 | tree.type = erasure(tree.type); |
rfield@1380 | 834 | result = tree; |
rfield@1380 | 835 | } |
rfield@1380 | 836 | |
duke@1 | 837 | public void visitTypeArray(JCArrayTypeTree tree) { |
duke@1 | 838 | tree.elemtype = translate(tree.elemtype, null); |
duke@1 | 839 | tree.type = erasure(tree.type); |
duke@1 | 840 | result = tree; |
duke@1 | 841 | } |
duke@1 | 842 | |
duke@1 | 843 | /** Visitor method for parameterized types. |
duke@1 | 844 | */ |
duke@1 | 845 | public void visitTypeApply(JCTypeApply tree) { |
jjg@308 | 846 | JCTree clazz = translate(tree.clazz, null); |
jjg@308 | 847 | result = clazz; |
duke@1 | 848 | } |
duke@1 | 849 | |
mcimadamore@1436 | 850 | public void visitTypeIntersection(JCTypeIntersection tree) { |
mcimadamore@1436 | 851 | tree.bounds = translate(tree.bounds, null); |
mcimadamore@1436 | 852 | tree.type = erasure(tree.type); |
mcimadamore@1436 | 853 | result = tree; |
mcimadamore@1436 | 854 | } |
mcimadamore@1436 | 855 | |
duke@1 | 856 | /************************************************************************** |
duke@1 | 857 | * utility methods |
duke@1 | 858 | *************************************************************************/ |
duke@1 | 859 | |
duke@1 | 860 | private Type erasure(Type t) { |
duke@1 | 861 | return types.erasure(t); |
duke@1 | 862 | } |
duke@1 | 863 | |
mcimadamore@673 | 864 | private boolean boundsRestricted(ClassSymbol c) { |
mcimadamore@673 | 865 | Type st = types.supertype(c.type); |
mcimadamore@673 | 866 | if (st.isParameterized()) { |
mcimadamore@673 | 867 | List<Type> actuals = st.allparams(); |
mcimadamore@673 | 868 | List<Type> formals = st.tsym.type.allparams(); |
mcimadamore@673 | 869 | while (!actuals.isEmpty() && !formals.isEmpty()) { |
mcimadamore@673 | 870 | Type actual = actuals.head; |
mcimadamore@673 | 871 | Type formal = formals.head; |
mcimadamore@673 | 872 | |
mcimadamore@673 | 873 | if (!types.isSameType(types.erasure(actual), |
mcimadamore@673 | 874 | types.erasure(formal))) |
mcimadamore@673 | 875 | return true; |
mcimadamore@673 | 876 | |
mcimadamore@673 | 877 | actuals = actuals.tail; |
mcimadamore@673 | 878 | formals = formals.tail; |
mcimadamore@673 | 879 | } |
mcimadamore@673 | 880 | } |
mcimadamore@673 | 881 | return false; |
mcimadamore@673 | 882 | } |
mcimadamore@673 | 883 | |
mcimadamore@673 | 884 | private List<JCTree> addOverrideBridgesIfNeeded(DiagnosticPosition pos, |
mcimadamore@673 | 885 | final ClassSymbol c) { |
mcimadamore@673 | 886 | ListBuffer<JCTree> buf = ListBuffer.lb(); |
mcimadamore@673 | 887 | if (c.isInterface() || !boundsRestricted(c)) |
mcimadamore@673 | 888 | return buf.toList(); |
mcimadamore@673 | 889 | Type t = types.supertype(c.type); |
mcimadamore@673 | 890 | Scope s = t.tsym.members(); |
mcimadamore@673 | 891 | if (s.elems != null) { |
mcimadamore@673 | 892 | for (Symbol sym : s.getElements(new NeedsOverridBridgeFilter(c))) { |
mcimadamore@673 | 893 | |
mcimadamore@673 | 894 | MethodSymbol m = (MethodSymbol)sym; |
mcimadamore@673 | 895 | MethodSymbol member = (MethodSymbol)m.asMemberOf(c.type, types); |
mcimadamore@673 | 896 | MethodSymbol impl = m.implementation(c, types, false); |
mcimadamore@673 | 897 | |
mcimadamore@673 | 898 | if ((impl == null || impl.owner != c) && |
mcimadamore@673 | 899 | !types.isSameType(member.erasure(types), m.erasure(types))) { |
mcimadamore@673 | 900 | addOverrideBridges(pos, m, member, c, buf); |
mcimadamore@673 | 901 | } |
mcimadamore@673 | 902 | } |
mcimadamore@673 | 903 | } |
mcimadamore@673 | 904 | return buf.toList(); |
mcimadamore@673 | 905 | } |
mcimadamore@673 | 906 | // where |
mcimadamore@673 | 907 | class NeedsOverridBridgeFilter implements Filter<Symbol> { |
mcimadamore@673 | 908 | |
mcimadamore@673 | 909 | ClassSymbol c; |
mcimadamore@673 | 910 | |
mcimadamore@673 | 911 | NeedsOverridBridgeFilter(ClassSymbol c) { |
mcimadamore@673 | 912 | this.c = c; |
mcimadamore@673 | 913 | } |
mcimadamore@673 | 914 | public boolean accepts(Symbol s) { |
mcimadamore@673 | 915 | return s.kind == MTH && |
mcimadamore@673 | 916 | !s.isConstructor() && |
mcimadamore@673 | 917 | s.isInheritedIn(c, types) && |
mcimadamore@673 | 918 | (s.flags() & FINAL) == 0 && |
mcimadamore@673 | 919 | (s.flags() & (SYNTHETIC | OVERRIDE_BRIDGE)) != SYNTHETIC; |
mcimadamore@673 | 920 | } |
mcimadamore@673 | 921 | } |
mcimadamore@673 | 922 | |
mcimadamore@673 | 923 | private void addOverrideBridges(DiagnosticPosition pos, |
mcimadamore@673 | 924 | MethodSymbol impl, |
mcimadamore@673 | 925 | MethodSymbol member, |
mcimadamore@673 | 926 | ClassSymbol c, |
mcimadamore@673 | 927 | ListBuffer<JCTree> bridges) { |
mcimadamore@673 | 928 | Type implErasure = impl.erasure(types); |
mcimadamore@673 | 929 | long flags = (impl.flags() & AccessFlags) | SYNTHETIC | BRIDGE | OVERRIDE_BRIDGE; |
mcimadamore@673 | 930 | member = new MethodSymbol(flags, member.name, member.type, c); |
mcimadamore@673 | 931 | JCMethodDecl md = make.MethodDef(member, null); |
mcimadamore@673 | 932 | JCExpression receiver = make.Super(types.supertype(c.type).tsym.erasure(types), c); |
mcimadamore@673 | 933 | Type calltype = erasure(impl.type.getReturnType()); |
mcimadamore@673 | 934 | JCExpression call = |
mcimadamore@673 | 935 | make.Apply(null, |
mcimadamore@673 | 936 | make.Select(receiver, impl).setType(calltype), |
mcimadamore@673 | 937 | translateArgs(make.Idents(md.params), |
mcimadamore@673 | 938 | implErasure.getParameterTypes(), null)) |
mcimadamore@673 | 939 | .setType(calltype); |
jjg@1374 | 940 | JCStatement stat = (member.getReturnType().hasTag(VOID)) |
mcimadamore@673 | 941 | ? make.Exec(call) |
mcimadamore@673 | 942 | : make.Return(coerce(call, member.erasure(types).getReturnType())); |
mcimadamore@673 | 943 | md.body = make.Block(0, List.of(stat)); |
mcimadamore@673 | 944 | c.members().enter(member); |
mcimadamore@673 | 945 | bridges.append(md); |
mcimadamore@673 | 946 | } |
mcimadamore@673 | 947 | |
duke@1 | 948 | /************************************************************************** |
duke@1 | 949 | * main method |
duke@1 | 950 | *************************************************************************/ |
duke@1 | 951 | |
duke@1 | 952 | private Env<AttrContext> env; |
duke@1 | 953 | |
vromero@1690 | 954 | private static final String statePreviousToFlowAssertMsg = |
vromero@1690 | 955 | "The current compile state [%s] of class %s is previous to FLOW"; |
vromero@1690 | 956 | |
duke@1 | 957 | void translateClass(ClassSymbol c) { |
duke@1 | 958 | Type st = types.supertype(c.type); |
duke@1 | 959 | // process superclass before derived |
vromero@1690 | 960 | if (st.hasTag(CLASS)) { |
duke@1 | 961 | translateClass((ClassSymbol)st.tsym); |
vromero@1690 | 962 | } |
duke@1 | 963 | |
duke@1 | 964 | Env<AttrContext> myEnv = enter.typeEnvs.remove(c); |
vromero@1690 | 965 | if (myEnv == null) { |
duke@1 | 966 | return; |
vromero@1690 | 967 | } |
vromero@1690 | 968 | |
vromero@1690 | 969 | /* The two assertions below are set for early detection of any attempt |
vromero@1690 | 970 | * to translate a class that: |
vromero@1690 | 971 | * |
vromero@1690 | 972 | * 1) has no compile state being it the most outer class. |
vromero@1690 | 973 | * We accept this condition for inner classes. |
vromero@1690 | 974 | * |
vromero@1690 | 975 | * 2) has a compile state which is previous to Flow state. |
vromero@1690 | 976 | */ |
vromero@1690 | 977 | boolean envHasCompState = compileStates.get(myEnv) != null; |
vromero@1690 | 978 | if (!envHasCompState && c.outermostClass() == c) { |
vromero@1690 | 979 | Assert.error("No info for outermost class: " + myEnv.enclClass.sym); |
vromero@1690 | 980 | } |
vromero@1690 | 981 | |
vromero@1690 | 982 | if (envHasCompState && |
vromero@1690 | 983 | CompileState.FLOW.isAfter(compileStates.get(myEnv))) { |
vromero@1690 | 984 | Assert.error(String.format(statePreviousToFlowAssertMsg, |
vromero@1690 | 985 | compileStates.get(myEnv), myEnv.enclClass.sym)); |
vromero@1690 | 986 | } |
vromero@1690 | 987 | |
duke@1 | 988 | Env<AttrContext> oldEnv = env; |
duke@1 | 989 | try { |
duke@1 | 990 | env = myEnv; |
duke@1 | 991 | // class has not been translated yet |
duke@1 | 992 | |
duke@1 | 993 | TreeMaker savedMake = make; |
duke@1 | 994 | Type savedPt = pt; |
duke@1 | 995 | make = make.forToplevel(env.toplevel); |
duke@1 | 996 | pt = null; |
duke@1 | 997 | try { |
duke@1 | 998 | JCClassDecl tree = (JCClassDecl) env.tree; |
duke@1 | 999 | tree.typarams = List.nil(); |
duke@1 | 1000 | super.visitClassDef(tree); |
duke@1 | 1001 | make.at(tree.pos); |
duke@1 | 1002 | if (addBridges) { |
duke@1 | 1003 | ListBuffer<JCTree> bridges = new ListBuffer<JCTree>(); |
mcimadamore@730 | 1004 | if (false) //see CR: 6996415 |
mcimadamore@730 | 1005 | bridges.appendList(addOverrideBridgesIfNeeded(tree, c)); |
duke@1 | 1006 | if ((tree.sym.flags() & INTERFACE) == 0) |
duke@1 | 1007 | addBridges(tree.pos(), tree.sym, bridges); |
duke@1 | 1008 | tree.defs = bridges.toList().prependList(tree.defs); |
duke@1 | 1009 | } |
duke@1 | 1010 | tree.type = erasure(tree.type); |
duke@1 | 1011 | } finally { |
duke@1 | 1012 | make = savedMake; |
duke@1 | 1013 | pt = savedPt; |
duke@1 | 1014 | } |
duke@1 | 1015 | } finally { |
duke@1 | 1016 | env = oldEnv; |
duke@1 | 1017 | } |
duke@1 | 1018 | } |
duke@1 | 1019 | |
duke@1 | 1020 | /** Translate a toplevel class definition. |
duke@1 | 1021 | * @param cdef The definition to be translated. |
duke@1 | 1022 | */ |
duke@1 | 1023 | public JCTree translateTopLevelClass(JCTree cdef, TreeMaker make) { |
duke@1 | 1024 | // note that this method does NOT support recursion. |
duke@1 | 1025 | this.make = make; |
duke@1 | 1026 | pt = null; |
duke@1 | 1027 | return translate(cdef, null); |
duke@1 | 1028 | } |
duke@1 | 1029 | } |