src/share/classes/com/sun/tools/javac/comp/TransTypes.java

Tue, 11 Aug 2009 01:13:42 +0100

author
mcimadamore
date
Tue, 11 Aug 2009 01:13:42 +0100
changeset 360
62fb6cafa93b
parent 344
6d0add6ad778
child 477
f23b985beb78
permissions
-rw-r--r--

6869075: regression: javac crashes when compiling compound string assignment with generics
Summary: javac should not add syntehtic cast to the LHS of an assignment expression
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
jjg@308 30 import javax.lang.model.element.ElementKind;
jjg@308 31
duke@1 32 import com.sun.tools.javac.code.*;
duke@1 33 import com.sun.tools.javac.code.Symbol.*;
duke@1 34 import com.sun.tools.javac.tree.*;
duke@1 35 import com.sun.tools.javac.tree.JCTree.*;
duke@1 36 import com.sun.tools.javac.util.*;
duke@1 37 import com.sun.tools.javac.util.JCDiagnostic.DiagnosticPosition;
duke@1 38 import com.sun.tools.javac.util.List;
duke@1 39
duke@1 40 import static com.sun.tools.javac.code.Flags.*;
duke@1 41 import static com.sun.tools.javac.code.Kinds.*;
duke@1 42 import static com.sun.tools.javac.code.TypeTags.*;
duke@1 43
duke@1 44 /** This pass translates Generic Java to conventional Java.
duke@1 45 *
duke@1 46 * <p><b>This is NOT part of any API supported by Sun Microsystems. If
duke@1 47 * you write code that depends on this, you do so at your own risk.
duke@1 48 * This code and its internal interfaces are subject to change or
duke@1 49 * deletion without notice.</b>
duke@1 50 */
duke@1 51 public class TransTypes extends TreeTranslator {
duke@1 52 /** The context key for the TransTypes phase. */
duke@1 53 protected static final Context.Key<TransTypes> transTypesKey =
duke@1 54 new Context.Key<TransTypes>();
duke@1 55
duke@1 56 /** Get the instance for this context. */
duke@1 57 public static TransTypes instance(Context context) {
duke@1 58 TransTypes instance = context.get(transTypesKey);
duke@1 59 if (instance == null)
duke@1 60 instance = new TransTypes(context);
duke@1 61 return instance;
duke@1 62 }
duke@1 63
jjg@308 64 private boolean debugJSR308;
jjg@308 65
jjg@113 66 private Names names;
duke@1 67 private Log log;
duke@1 68 private Symtab syms;
duke@1 69 private TreeMaker make;
duke@1 70 private Enter enter;
duke@1 71 private boolean allowEnums;
duke@1 72 private Types types;
duke@1 73 private final Resolve resolve;
duke@1 74
duke@1 75 /**
duke@1 76 * Flag to indicate whether or not to generate bridge methods.
duke@1 77 * For pre-Tiger source there is no need for bridge methods, so it
duke@1 78 * can be skipped to get better performance for -source 1.4 etc.
duke@1 79 */
duke@1 80 private final boolean addBridges;
duke@1 81
duke@1 82 protected TransTypes(Context context) {
duke@1 83 context.put(transTypesKey, this);
jjg@113 84 names = Names.instance(context);
duke@1 85 log = Log.instance(context);
duke@1 86 syms = Symtab.instance(context);
duke@1 87 enter = Enter.instance(context);
duke@1 88 overridden = new HashMap<MethodSymbol,MethodSymbol>();
duke@1 89 Source source = Source.instance(context);
duke@1 90 allowEnums = source.allowEnums();
duke@1 91 addBridges = source.addBridges();
duke@1 92 types = Types.instance(context);
duke@1 93 make = TreeMaker.instance(context);
duke@1 94 resolve = Resolve.instance(context);
jjg@308 95 debugJSR308 = Options.instance(context).get("TA:trans") != null;
duke@1 96 }
duke@1 97
duke@1 98 /** A hashtable mapping bridge methods to the methods they override after
duke@1 99 * type erasure.
duke@1 100 */
duke@1 101 Map<MethodSymbol,MethodSymbol> overridden;
duke@1 102
duke@1 103 /** Construct an attributed tree for a cast of expression to target type,
duke@1 104 * unless it already has precisely that type.
duke@1 105 * @param tree The expression tree.
duke@1 106 * @param target The target type.
duke@1 107 */
duke@1 108 JCExpression cast(JCExpression tree, Type target) {
duke@1 109 int oldpos = make.pos;
duke@1 110 make.at(tree.pos);
duke@1 111 if (!types.isSameType(tree.type, target)) {
duke@1 112 if (!resolve.isAccessible(env, target.tsym))
duke@1 113 resolve.logAccessError(env, tree, target);
duke@1 114 tree = make.TypeCast(make.Type(target), tree).setType(target);
duke@1 115 }
duke@1 116 make.pos = oldpos;
duke@1 117 return tree;
duke@1 118 }
duke@1 119
duke@1 120 /** Construct an attributed tree to coerce an expression to some erased
duke@1 121 * target type, unless the expression is already assignable to that type.
duke@1 122 * If target type is a constant type, use its base type instead.
duke@1 123 * @param tree The expression tree.
duke@1 124 * @param target The target type.
duke@1 125 */
duke@1 126 JCExpression coerce(JCExpression tree, Type target) {
duke@1 127 Type btarget = target.baseType();
duke@1 128 if (tree.type.isPrimitive() == target.isPrimitive()) {
duke@1 129 return types.isAssignable(tree.type, btarget, Warner.noWarnings)
duke@1 130 ? tree
duke@1 131 : cast(tree, btarget);
duke@1 132 }
duke@1 133 return tree;
duke@1 134 }
duke@1 135
duke@1 136 /** Given an erased reference type, assume this type as the tree's type.
duke@1 137 * Then, coerce to some given target type unless target type is null.
duke@1 138 * This operation is used in situations like the following:
duke@1 139 *
duke@1 140 * class Cell<A> { A value; }
duke@1 141 * ...
duke@1 142 * Cell<Integer> cell;
duke@1 143 * Integer x = cell.value;
duke@1 144 *
duke@1 145 * Since the erasure of Cell.value is Object, but the type
duke@1 146 * of cell.value in the assignment is Integer, we need to
duke@1 147 * adjust the original type of cell.value to Object, and insert
duke@1 148 * a cast to Integer. That is, the last assignment becomes:
duke@1 149 *
duke@1 150 * Integer x = (Integer)cell.value;
duke@1 151 *
duke@1 152 * @param tree The expression tree whose type might need adjustment.
duke@1 153 * @param erasedType The expression's type after erasure.
duke@1 154 * @param target The target type, which is usually the erasure of the
duke@1 155 * expression's original type.
duke@1 156 */
duke@1 157 JCExpression retype(JCExpression tree, Type erasedType, Type target) {
duke@1 158 // System.err.println("retype " + tree + " to " + erasedType);//DEBUG
duke@1 159 if (erasedType.tag > lastBaseTag) {
duke@1 160 if (target != null && target.isPrimitive())
duke@1 161 target = erasure(tree.type);
duke@1 162 tree.type = erasedType;
duke@1 163 if (target != null) return coerce(tree, target);
duke@1 164 }
duke@1 165 return tree;
duke@1 166 }
duke@1 167
duke@1 168 /** Translate method argument list, casting each argument
duke@1 169 * to its corresponding type in a list of target types.
duke@1 170 * @param _args The method argument list.
duke@1 171 * @param parameters The list of target types.
duke@1 172 * @param varargsElement The erasure of the varargs element type,
duke@1 173 * or null if translating a non-varargs invocation
duke@1 174 */
duke@1 175 <T extends JCTree> List<T> translateArgs(List<T> _args,
duke@1 176 List<Type> parameters,
duke@1 177 Type varargsElement) {
duke@1 178 if (parameters.isEmpty()) return _args;
duke@1 179 List<T> args = _args;
duke@1 180 while (parameters.tail.nonEmpty()) {
duke@1 181 args.head = translate(args.head, parameters.head);
duke@1 182 args = args.tail;
duke@1 183 parameters = parameters.tail;
duke@1 184 }
duke@1 185 Type parameter = parameters.head;
duke@1 186 assert varargsElement != null || args.length() == 1;
duke@1 187 if (varargsElement != null) {
duke@1 188 while (args.nonEmpty()) {
duke@1 189 args.head = translate(args.head, varargsElement);
duke@1 190 args = args.tail;
duke@1 191 }
duke@1 192 } else {
duke@1 193 args.head = translate(args.head, parameter);
duke@1 194 }
duke@1 195 return _args;
duke@1 196 }
duke@1 197
duke@1 198 /** Add a bridge definition and enter corresponding method symbol in
duke@1 199 * local scope of origin.
duke@1 200 *
duke@1 201 * @param pos The source code position to be used for the definition.
duke@1 202 * @param meth The method for which a bridge needs to be added
duke@1 203 * @param impl That method's implementation (possibly the method itself)
duke@1 204 * @param origin The class to which the bridge will be added
duke@1 205 * @param hypothetical
duke@1 206 * True if the bridge method is not strictly necessary in the
duke@1 207 * binary, but is represented in the symbol table to detect
duke@1 208 * erasure clashes.
duke@1 209 * @param bridges The list buffer to which the bridge will be added
duke@1 210 */
duke@1 211 void addBridge(DiagnosticPosition pos,
duke@1 212 MethodSymbol meth,
duke@1 213 MethodSymbol impl,
duke@1 214 ClassSymbol origin,
duke@1 215 boolean hypothetical,
duke@1 216 ListBuffer<JCTree> bridges) {
duke@1 217 make.at(pos);
duke@1 218 Type origType = types.memberType(origin.type, meth);
duke@1 219 Type origErasure = erasure(origType);
duke@1 220
duke@1 221 // Create a bridge method symbol and a bridge definition without a body.
duke@1 222 Type bridgeType = meth.erasure(types);
duke@1 223 long flags = impl.flags() & AccessFlags | SYNTHETIC | BRIDGE;
duke@1 224 if (hypothetical) flags |= HYPOTHETICAL;
duke@1 225 MethodSymbol bridge = new MethodSymbol(flags,
duke@1 226 meth.name,
duke@1 227 bridgeType,
duke@1 228 origin);
duke@1 229 if (!hypothetical) {
duke@1 230 JCMethodDecl md = make.MethodDef(bridge, null);
duke@1 231
duke@1 232 // The bridge calls this.impl(..), if we have an implementation
duke@1 233 // in the current class, super.impl(...) otherwise.
duke@1 234 JCExpression receiver = (impl.owner == origin)
duke@1 235 ? make.This(origin.erasure(types))
duke@1 236 : make.Super(types.supertype(origin.type).tsym.erasure(types), origin);
duke@1 237
duke@1 238 // The type returned from the original method.
duke@1 239 Type calltype = erasure(impl.type.getReturnType());
duke@1 240
duke@1 241 // Construct a call of this.impl(params), or super.impl(params),
duke@1 242 // casting params and possibly results as needed.
duke@1 243 JCExpression call =
duke@1 244 make.Apply(
duke@1 245 null,
duke@1 246 make.Select(receiver, impl).setType(calltype),
duke@1 247 translateArgs(make.Idents(md.params), origErasure.getParameterTypes(), null))
duke@1 248 .setType(calltype);
duke@1 249 JCStatement stat = (origErasure.getReturnType().tag == VOID)
duke@1 250 ? make.Exec(call)
duke@1 251 : make.Return(coerce(call, bridgeType.getReturnType()));
duke@1 252 md.body = make.Block(0, List.of(stat));
duke@1 253
duke@1 254 // Add bridge to `bridges' buffer
duke@1 255 bridges.append(md);
duke@1 256 }
duke@1 257
duke@1 258 // Add bridge to scope of enclosing class and `overridden' table.
duke@1 259 origin.members().enter(bridge);
duke@1 260 overridden.put(bridge, meth);
duke@1 261 }
duke@1 262
duke@1 263 /** Add bridge if given symbol is a non-private, non-static member
duke@1 264 * of the given class, which is either defined in the class or non-final
duke@1 265 * inherited, and one of the two following conditions holds:
duke@1 266 * 1. The method's type changes in the given class, as compared to the
duke@1 267 * class where the symbol was defined, (in this case
duke@1 268 * we have extended a parameterized class with non-trivial parameters).
duke@1 269 * 2. The method has an implementation with a different erased return type.
duke@1 270 * (in this case we have used co-variant returns).
duke@1 271 * If a bridge already exists in some other class, no new bridge is added.
duke@1 272 * Instead, it is checked that the bridge symbol overrides the method symbol.
duke@1 273 * (Spec ???).
duke@1 274 * todo: what about bridges for privates???
duke@1 275 *
duke@1 276 * @param pos The source code position to be used for the definition.
duke@1 277 * @param sym The symbol for which a bridge might have to be added.
duke@1 278 * @param origin The class in which the bridge would go.
duke@1 279 * @param bridges The list buffer to which the bridge would be added.
duke@1 280 */
duke@1 281 void addBridgeIfNeeded(DiagnosticPosition pos,
duke@1 282 Symbol sym,
duke@1 283 ClassSymbol origin,
duke@1 284 ListBuffer<JCTree> bridges) {
duke@1 285 if (sym.kind == MTH &&
duke@1 286 sym.name != names.init &&
duke@1 287 (sym.flags() & (PRIVATE | SYNTHETIC | STATIC)) == 0 &&
duke@1 288 sym.isMemberOf(origin, types))
duke@1 289 {
duke@1 290 MethodSymbol meth = (MethodSymbol)sym;
duke@1 291 MethodSymbol bridge = meth.binaryImplementation(origin, types);
duke@1 292 MethodSymbol impl = meth.implementation(origin, types, true);
duke@1 293 if (bridge == null ||
duke@1 294 bridge == meth ||
duke@1 295 (impl != null && !bridge.owner.isSubClass(impl.owner, types))) {
duke@1 296 // No bridge was added yet.
duke@1 297 if (impl != null && isBridgeNeeded(meth, impl, origin.type)) {
duke@1 298 addBridge(pos, meth, impl, origin, bridge==impl, bridges);
duke@1 299 } else if (impl == meth
duke@1 300 && impl.owner != origin
duke@1 301 && (impl.flags() & FINAL) == 0
duke@1 302 && (meth.flags() & (ABSTRACT|PUBLIC)) == PUBLIC
duke@1 303 && (origin.flags() & PUBLIC) > (impl.owner.flags() & PUBLIC)) {
duke@1 304 // this is to work around a horrible but permanent
duke@1 305 // reflection design error.
duke@1 306 addBridge(pos, meth, impl, origin, false, bridges);
duke@1 307 }
duke@1 308 } else if ((bridge.flags() & SYNTHETIC) != 0) {
duke@1 309 MethodSymbol other = overridden.get(bridge);
duke@1 310 if (other != null && other != meth) {
duke@1 311 if (impl == null || !impl.overrides(other, origin, types, true)) {
duke@1 312 // Bridge for other symbol pair was added
duke@1 313 log.error(pos, "name.clash.same.erasure.no.override",
duke@1 314 other, other.location(origin.type, types),
duke@1 315 meth, meth.location(origin.type, types));
duke@1 316 }
duke@1 317 }
duke@1 318 } else if (!bridge.overrides(meth, origin, types, true)) {
duke@1 319 // Accidental binary override without source override.
duke@1 320 if (bridge.owner == origin ||
duke@1 321 types.asSuper(bridge.owner.type, meth.owner) == null)
duke@1 322 // Don't diagnose the problem if it would already
duke@1 323 // have been reported in the superclass
duke@1 324 log.error(pos, "name.clash.same.erasure.no.override",
duke@1 325 bridge, bridge.location(origin.type, types),
duke@1 326 meth, meth.location(origin.type, types));
duke@1 327 }
duke@1 328 }
duke@1 329 }
duke@1 330 // where
duke@1 331 /**
duke@1 332 * @param method The symbol for which a bridge might have to be added
duke@1 333 * @param impl The implementation of method
duke@1 334 * @param dest The type in which the bridge would go
duke@1 335 */
duke@1 336 private boolean isBridgeNeeded(MethodSymbol method,
duke@1 337 MethodSymbol impl,
duke@1 338 Type dest) {
duke@1 339 if (impl != method) {
duke@1 340 // If either method or impl have different erasures as
duke@1 341 // members of dest, a bridge is needed.
duke@1 342 Type method_erasure = method.erasure(types);
duke@1 343 if (!isSameMemberWhenErased(dest, method, method_erasure))
duke@1 344 return true;
duke@1 345 Type impl_erasure = impl.erasure(types);
duke@1 346 if (!isSameMemberWhenErased(dest, impl, impl_erasure))
duke@1 347 return true;
duke@1 348
duke@1 349 // If the erasure of the return type is different, a
duke@1 350 // bridge is needed.
duke@1 351 return !types.isSameType(impl_erasure.getReturnType(),
duke@1 352 method_erasure.getReturnType());
duke@1 353 } else {
duke@1 354 // method and impl are the same...
duke@1 355 if ((method.flags() & ABSTRACT) != 0) {
duke@1 356 // ...and abstract so a bridge is not needed.
duke@1 357 // Concrete subclasses will bridge as needed.
duke@1 358 return false;
duke@1 359 }
duke@1 360
duke@1 361 // The erasure of the return type is always the same
duke@1 362 // for the same symbol. Reducing the three tests in
duke@1 363 // the other branch to just one:
duke@1 364 return !isSameMemberWhenErased(dest, method, method.erasure(types));
duke@1 365 }
duke@1 366 }
duke@1 367 /**
duke@1 368 * Lookup the method as a member of the type. Compare the
duke@1 369 * erasures.
duke@1 370 * @param type the class where to look for the method
duke@1 371 * @param method the method to look for in class
duke@1 372 * @param erasure the erasure of method
duke@1 373 */
duke@1 374 private boolean isSameMemberWhenErased(Type type,
duke@1 375 MethodSymbol method,
duke@1 376 Type erasure) {
duke@1 377 return types.isSameType(erasure(types.memberType(type, method)),
duke@1 378 erasure);
duke@1 379 }
duke@1 380
duke@1 381 void addBridges(DiagnosticPosition pos,
duke@1 382 TypeSymbol i,
duke@1 383 ClassSymbol origin,
duke@1 384 ListBuffer<JCTree> bridges) {
duke@1 385 for (Scope.Entry e = i.members().elems; e != null; e = e.sibling)
duke@1 386 addBridgeIfNeeded(pos, e.sym, origin, bridges);
duke@1 387 for (List<Type> l = types.interfaces(i.type); l.nonEmpty(); l = l.tail)
duke@1 388 addBridges(pos, l.head.tsym, origin, bridges);
duke@1 389 }
duke@1 390
duke@1 391 /** Add all necessary bridges to some class appending them to list buffer.
duke@1 392 * @param pos The source code position to be used for the bridges.
duke@1 393 * @param origin The class in which the bridges go.
duke@1 394 * @param bridges The list buffer to which the bridges are added.
duke@1 395 */
duke@1 396 void addBridges(DiagnosticPosition pos, ClassSymbol origin, ListBuffer<JCTree> bridges) {
duke@1 397 Type st = types.supertype(origin.type);
duke@1 398 while (st.tag == CLASS) {
duke@1 399 // if (isSpecialization(st))
duke@1 400 addBridges(pos, st.tsym, origin, bridges);
duke@1 401 st = types.supertype(st);
duke@1 402 }
duke@1 403 for (List<Type> l = types.interfaces(origin.type); l.nonEmpty(); l = l.tail)
duke@1 404 // if (isSpecialization(l.head))
duke@1 405 addBridges(pos, l.head.tsym, origin, bridges);
duke@1 406 }
duke@1 407
duke@1 408 /* ************************************************************************
duke@1 409 * Visitor methods
duke@1 410 *************************************************************************/
duke@1 411
duke@1 412 /** Visitor argument: proto-type.
duke@1 413 */
duke@1 414 private Type pt;
duke@1 415
duke@1 416 /** Visitor method: perform a type translation on tree.
duke@1 417 */
duke@1 418 public <T extends JCTree> T translate(T tree, Type pt) {
duke@1 419 Type prevPt = this.pt;
duke@1 420 try {
duke@1 421 this.pt = pt;
duke@1 422 return translate(tree);
duke@1 423 } finally {
duke@1 424 this.pt = prevPt;
duke@1 425 }
duke@1 426 }
duke@1 427
duke@1 428 /** Visitor method: perform a type translation on list of trees.
duke@1 429 */
duke@1 430 public <T extends JCTree> List<T> translate(List<T> trees, Type pt) {
duke@1 431 Type prevPt = this.pt;
duke@1 432 List<T> res;
duke@1 433 try {
duke@1 434 this.pt = pt;
duke@1 435 res = translate(trees);
duke@1 436 } finally {
duke@1 437 this.pt = prevPt;
duke@1 438 }
duke@1 439 return res;
duke@1 440 }
duke@1 441
duke@1 442 public void visitClassDef(JCClassDecl tree) {
jjg@308 443 new TypeAnnotationPositions().scan(tree);
jjg@308 444 new TypeAnnotationLift().scan(tree);
duke@1 445 translateClass(tree.sym);
duke@1 446 result = tree;
duke@1 447 }
duke@1 448
duke@1 449 JCMethodDecl currentMethod = null;
duke@1 450 public void visitMethodDef(JCMethodDecl tree) {
jjg@308 451 tree.sym.typeAnnotations = tree.sym.typeAnnotations;
duke@1 452 JCMethodDecl previousMethod = currentMethod;
duke@1 453 try {
duke@1 454 currentMethod = tree;
duke@1 455 tree.restype = translate(tree.restype, null);
duke@1 456 tree.typarams = List.nil();
duke@1 457 tree.params = translateVarDefs(tree.params);
duke@1 458 tree.thrown = translate(tree.thrown, null);
duke@1 459 tree.body = translate(tree.body, tree.sym.erasure(types).getReturnType());
duke@1 460 tree.type = erasure(tree.type);
duke@1 461 result = tree;
duke@1 462 } finally {
duke@1 463 currentMethod = previousMethod;
duke@1 464 }
duke@1 465
duke@1 466 // Check that we do not introduce a name clash by erasing types.
duke@1 467 for (Scope.Entry e = tree.sym.owner.members().lookup(tree.name);
duke@1 468 e.sym != null;
duke@1 469 e = e.next()) {
duke@1 470 if (e.sym != tree.sym &&
duke@1 471 types.isSameType(erasure(e.sym.type), tree.type)) {
duke@1 472 log.error(tree.pos(),
duke@1 473 "name.clash.same.erasure", tree.sym,
duke@1 474 e.sym);
duke@1 475 return;
duke@1 476 }
duke@1 477 }
duke@1 478 }
duke@1 479
duke@1 480 public void visitVarDef(JCVariableDecl tree) {
duke@1 481 tree.vartype = translate(tree.vartype, null);
duke@1 482 tree.init = translate(tree.init, tree.sym.erasure(types));
duke@1 483 tree.type = erasure(tree.type);
duke@1 484 result = tree;
duke@1 485 }
duke@1 486
duke@1 487 public void visitDoLoop(JCDoWhileLoop tree) {
duke@1 488 tree.body = translate(tree.body);
duke@1 489 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 490 result = tree;
duke@1 491 }
duke@1 492
duke@1 493 public void visitWhileLoop(JCWhileLoop tree) {
duke@1 494 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 495 tree.body = translate(tree.body);
duke@1 496 result = tree;
duke@1 497 }
duke@1 498
duke@1 499 public void visitForLoop(JCForLoop tree) {
duke@1 500 tree.init = translate(tree.init, null);
duke@1 501 if (tree.cond != null)
duke@1 502 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 503 tree.step = translate(tree.step, null);
duke@1 504 tree.body = translate(tree.body);
duke@1 505 result = tree;
duke@1 506 }
duke@1 507
duke@1 508 public void visitForeachLoop(JCEnhancedForLoop tree) {
duke@1 509 tree.var = translate(tree.var, null);
duke@1 510 Type iterableType = tree.expr.type;
duke@1 511 tree.expr = translate(tree.expr, erasure(tree.expr.type));
duke@1 512 if (types.elemtype(tree.expr.type) == null)
duke@1 513 tree.expr.type = iterableType; // preserve type for Lower
duke@1 514 tree.body = translate(tree.body);
duke@1 515 result = tree;
duke@1 516 }
duke@1 517
duke@1 518 public void visitSwitch(JCSwitch tree) {
duke@1 519 Type selsuper = types.supertype(tree.selector.type);
duke@1 520 boolean enumSwitch = selsuper != null &&
duke@1 521 selsuper.tsym == syms.enumSym;
duke@1 522 Type target = enumSwitch ? erasure(tree.selector.type) : syms.intType;
duke@1 523 tree.selector = translate(tree.selector, target);
duke@1 524 tree.cases = translateCases(tree.cases);
duke@1 525 result = tree;
duke@1 526 }
duke@1 527
duke@1 528 public void visitCase(JCCase tree) {
duke@1 529 tree.pat = translate(tree.pat, null);
duke@1 530 tree.stats = translate(tree.stats);
duke@1 531 result = tree;
duke@1 532 }
duke@1 533
duke@1 534 public void visitSynchronized(JCSynchronized tree) {
duke@1 535 tree.lock = translate(tree.lock, erasure(tree.lock.type));
duke@1 536 tree.body = translate(tree.body);
duke@1 537 result = tree;
duke@1 538 }
duke@1 539
duke@1 540 public void visitConditional(JCConditional tree) {
duke@1 541 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 542 tree.truepart = translate(tree.truepart, erasure(tree.type));
duke@1 543 tree.falsepart = translate(tree.falsepart, erasure(tree.type));
duke@1 544 tree.type = erasure(tree.type);
mcimadamore@120 545 result = retype(tree, tree.type, pt);
duke@1 546 }
duke@1 547
duke@1 548 public void visitIf(JCIf tree) {
duke@1 549 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 550 tree.thenpart = translate(tree.thenpart);
duke@1 551 tree.elsepart = translate(tree.elsepart);
duke@1 552 result = tree;
duke@1 553 }
duke@1 554
duke@1 555 public void visitExec(JCExpressionStatement tree) {
duke@1 556 tree.expr = translate(tree.expr, null);
duke@1 557 result = tree;
duke@1 558 }
duke@1 559
duke@1 560 public void visitReturn(JCReturn tree) {
duke@1 561 tree.expr = translate(tree.expr, currentMethod.sym.erasure(types).getReturnType());
duke@1 562 result = tree;
duke@1 563 }
duke@1 564
duke@1 565 public void visitThrow(JCThrow tree) {
duke@1 566 tree.expr = translate(tree.expr, erasure(tree.expr.type));
duke@1 567 result = tree;
duke@1 568 }
duke@1 569
duke@1 570 public void visitAssert(JCAssert tree) {
duke@1 571 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 572 if (tree.detail != null)
duke@1 573 tree.detail = translate(tree.detail, erasure(tree.detail.type));
duke@1 574 result = tree;
duke@1 575 }
duke@1 576
duke@1 577 public void visitApply(JCMethodInvocation tree) {
duke@1 578 tree.meth = translate(tree.meth, null);
duke@1 579 Symbol meth = TreeInfo.symbol(tree.meth);
duke@1 580 Type mt = meth.erasure(types);
duke@1 581 List<Type> argtypes = mt.getParameterTypes();
duke@1 582 if (allowEnums &&
duke@1 583 meth.name==names.init &&
duke@1 584 meth.owner == syms.enumSym)
duke@1 585 argtypes = argtypes.tail.tail;
duke@1 586 if (tree.varargsElement != null)
duke@1 587 tree.varargsElement = types.erasure(tree.varargsElement);
duke@1 588 else
duke@1 589 assert tree.args.length() == argtypes.length();
duke@1 590 tree.args = translateArgs(tree.args, argtypes, tree.varargsElement);
duke@1 591
duke@1 592 // Insert casts of method invocation results as needed.
duke@1 593 result = retype(tree, mt.getReturnType(), pt);
duke@1 594 }
duke@1 595
duke@1 596 public void visitNewClass(JCNewClass tree) {
duke@1 597 if (tree.encl != null)
duke@1 598 tree.encl = translate(tree.encl, erasure(tree.encl.type));
duke@1 599 tree.clazz = translate(tree.clazz, null);
duke@1 600 if (tree.varargsElement != null)
duke@1 601 tree.varargsElement = types.erasure(tree.varargsElement);
duke@1 602 tree.args = translateArgs(
duke@1 603 tree.args, tree.constructor.erasure(types).getParameterTypes(), tree.varargsElement);
duke@1 604 tree.def = translate(tree.def, null);
duke@1 605 tree.type = erasure(tree.type);
duke@1 606 result = tree;
duke@1 607 }
duke@1 608
duke@1 609 public void visitNewArray(JCNewArray tree) {
duke@1 610 tree.elemtype = translate(tree.elemtype, null);
duke@1 611 translate(tree.dims, syms.intType);
duke@1 612 tree.elems = translate(tree.elems,
duke@1 613 (tree.type == null) ? null
duke@1 614 : erasure(types.elemtype(tree.type)));
duke@1 615 tree.type = erasure(tree.type);
duke@1 616
duke@1 617 result = tree;
duke@1 618 }
duke@1 619
duke@1 620 public void visitParens(JCParens tree) {
duke@1 621 tree.expr = translate(tree.expr, pt);
duke@1 622 tree.type = erasure(tree.type);
duke@1 623 result = tree;
duke@1 624 }
duke@1 625
duke@1 626 public void visitAssign(JCAssign tree) {
duke@1 627 tree.lhs = translate(tree.lhs, null);
duke@1 628 tree.rhs = translate(tree.rhs, erasure(tree.lhs.type));
duke@1 629 tree.type = erasure(tree.type);
duke@1 630 result = tree;
duke@1 631 }
duke@1 632
duke@1 633 public void visitAssignop(JCAssignOp tree) {
mcimadamore@360 634 tree.lhs = translate(tree.lhs, null);
mcimadamore@133 635 tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head);
duke@1 636 tree.type = erasure(tree.type);
duke@1 637 result = tree;
duke@1 638 }
duke@1 639
duke@1 640 public void visitUnary(JCUnary tree) {
duke@1 641 tree.arg = translate(tree.arg, tree.operator.type.getParameterTypes().head);
duke@1 642 result = tree;
duke@1 643 }
duke@1 644
duke@1 645 public void visitBinary(JCBinary tree) {
duke@1 646 tree.lhs = translate(tree.lhs, tree.operator.type.getParameterTypes().head);
duke@1 647 tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head);
duke@1 648 result = tree;
duke@1 649 }
duke@1 650
duke@1 651 public void visitTypeCast(JCTypeCast tree) {
duke@1 652 tree.clazz = translate(tree.clazz, null);
duke@1 653 tree.type = erasure(tree.type);
duke@1 654 tree.expr = translate(tree.expr, tree.type);
duke@1 655 result = tree;
duke@1 656 }
duke@1 657
duke@1 658 public void visitTypeTest(JCInstanceOf tree) {
duke@1 659 tree.expr = translate(tree.expr, null);
duke@1 660 tree.clazz = translate(tree.clazz, null);
duke@1 661 result = tree;
duke@1 662 }
duke@1 663
duke@1 664 public void visitIndexed(JCArrayAccess tree) {
duke@1 665 tree.indexed = translate(tree.indexed, erasure(tree.indexed.type));
duke@1 666 tree.index = translate(tree.index, syms.intType);
duke@1 667
duke@1 668 // Insert casts of indexed expressions as needed.
duke@1 669 result = retype(tree, types.elemtype(tree.indexed.type), pt);
duke@1 670 }
duke@1 671
duke@1 672 // There ought to be nothing to rewrite here;
duke@1 673 // we don't generate code.
duke@1 674 public void visitAnnotation(JCAnnotation tree) {
duke@1 675 result = tree;
duke@1 676 }
duke@1 677
duke@1 678 public void visitIdent(JCIdent tree) {
duke@1 679 Type et = tree.sym.erasure(types);
duke@1 680
duke@1 681 // Map type variables to their bounds.
duke@1 682 if (tree.sym.kind == TYP && tree.sym.type.tag == TYPEVAR) {
duke@1 683 result = make.at(tree.pos).Type(et);
duke@1 684 } else
duke@1 685 // Map constants expressions to themselves.
duke@1 686 if (tree.type.constValue() != null) {
duke@1 687 result = tree;
duke@1 688 }
duke@1 689 // Insert casts of variable uses as needed.
duke@1 690 else if (tree.sym.kind == VAR) {
duke@1 691 result = retype(tree, et, pt);
duke@1 692 }
duke@1 693 else {
duke@1 694 tree.type = erasure(tree.type);
duke@1 695 result = tree;
duke@1 696 }
duke@1 697 }
duke@1 698
duke@1 699 public void visitSelect(JCFieldAccess tree) {
duke@1 700 Type t = tree.selected.type;
mcimadamore@23 701 while (t.tag == TYPEVAR)
mcimadamore@23 702 t = t.getUpperBound();
mcimadamore@23 703 if (t.isCompound()) {
duke@1 704 if ((tree.sym.flags() & IPROXY) != 0) {
duke@1 705 tree.sym = ((MethodSymbol)tree.sym).
duke@1 706 implemented((TypeSymbol)tree.sym.owner, types);
duke@1 707 }
duke@1 708 tree.selected = cast(
mcimadamore@23 709 translate(tree.selected, erasure(tree.selected.type)),
duke@1 710 erasure(tree.sym.owner.type));
duke@1 711 } else
duke@1 712 tree.selected = translate(tree.selected, erasure(t));
duke@1 713
duke@1 714 // Map constants expressions to themselves.
duke@1 715 if (tree.type.constValue() != null) {
duke@1 716 result = tree;
duke@1 717 }
duke@1 718 // Insert casts of variable uses as needed.
duke@1 719 else if (tree.sym.kind == VAR) {
duke@1 720 result = retype(tree, tree.sym.erasure(types), pt);
duke@1 721 }
duke@1 722 else {
duke@1 723 tree.type = erasure(tree.type);
duke@1 724 result = tree;
duke@1 725 }
duke@1 726 }
duke@1 727
duke@1 728 public void visitTypeArray(JCArrayTypeTree tree) {
duke@1 729 tree.elemtype = translate(tree.elemtype, null);
duke@1 730 tree.type = erasure(tree.type);
duke@1 731 result = tree;
duke@1 732 }
duke@1 733
duke@1 734 /** Visitor method for parameterized types.
duke@1 735 */
duke@1 736 public void visitTypeApply(JCTypeApply tree) {
jjg@308 737 JCTree clazz = translate(tree.clazz, null);
jjg@308 738 result = clazz;
duke@1 739 }
duke@1 740
duke@1 741 /**************************************************************************
duke@1 742 * utility methods
duke@1 743 *************************************************************************/
duke@1 744
duke@1 745 private Type erasure(Type t) {
duke@1 746 return types.erasure(t);
duke@1 747 }
duke@1 748
duke@1 749 /**************************************************************************
duke@1 750 * main method
duke@1 751 *************************************************************************/
duke@1 752
duke@1 753 private Env<AttrContext> env;
duke@1 754
duke@1 755 void translateClass(ClassSymbol c) {
duke@1 756 Type st = types.supertype(c.type);
duke@1 757
duke@1 758 // process superclass before derived
duke@1 759 if (st.tag == CLASS)
duke@1 760 translateClass((ClassSymbol)st.tsym);
duke@1 761
duke@1 762 Env<AttrContext> myEnv = enter.typeEnvs.remove(c);
duke@1 763 if (myEnv == null)
duke@1 764 return;
duke@1 765 Env<AttrContext> oldEnv = env;
duke@1 766 try {
duke@1 767 env = myEnv;
duke@1 768 // class has not been translated yet
duke@1 769
duke@1 770 TreeMaker savedMake = make;
duke@1 771 Type savedPt = pt;
duke@1 772 make = make.forToplevel(env.toplevel);
duke@1 773 pt = null;
duke@1 774 try {
duke@1 775 JCClassDecl tree = (JCClassDecl) env.tree;
duke@1 776 tree.typarams = List.nil();
duke@1 777 super.visitClassDef(tree);
duke@1 778 make.at(tree.pos);
duke@1 779 if (addBridges) {
duke@1 780 ListBuffer<JCTree> bridges = new ListBuffer<JCTree>();
duke@1 781 if ((tree.sym.flags() & INTERFACE) == 0)
duke@1 782 addBridges(tree.pos(), tree.sym, bridges);
duke@1 783 tree.defs = bridges.toList().prependList(tree.defs);
duke@1 784 }
duke@1 785 tree.type = erasure(tree.type);
duke@1 786 } finally {
duke@1 787 make = savedMake;
duke@1 788 pt = savedPt;
duke@1 789 }
duke@1 790 } finally {
duke@1 791 env = oldEnv;
duke@1 792 }
duke@1 793 }
duke@1 794
duke@1 795 /** Translate a toplevel class definition.
duke@1 796 * @param cdef The definition to be translated.
duke@1 797 */
duke@1 798 public JCTree translateTopLevelClass(JCTree cdef, TreeMaker make) {
duke@1 799 // note that this method does NOT support recursion.
duke@1 800 this.make = make;
duke@1 801 pt = null;
duke@1 802 return translate(cdef, null);
duke@1 803 }
jjg@308 804
jjg@308 805 private class TypeAnnotationPositions extends TreeScanner {
jjg@308 806
jjg@308 807 private ListBuffer<JCTree> frames = ListBuffer.lb();
jjg@308 808 private void push(JCTree t) { frames = frames.prepend(t); }
jjg@308 809 private JCTree pop() { return frames.next(); }
jjg@308 810 private JCTree peek() { return frames.first(); }
jjg@308 811 private JCTree peek2() { return frames.toList().tail.head; }
jjg@308 812
jjg@308 813 @Override
jjg@308 814 public void scan(JCTree tree) {
jjg@308 815 push(tree);
jjg@308 816 super.scan(tree);
jjg@308 817 pop();
jjg@308 818 }
jjg@308 819
mcimadamore@344 820 private boolean inClass = false;
mcimadamore@344 821
mcimadamore@344 822 @Override
mcimadamore@344 823 public void visitClassDef(JCClassDecl tree) {
mcimadamore@344 824 if (!inClass) {
mcimadamore@344 825 // Do not recurse into nested and inner classes since
mcimadamore@344 826 // TransTypes.visitClassDef makes an invocation for each class
mcimadamore@344 827 // separately.
mcimadamore@344 828 inClass = true;
mcimadamore@344 829 try {
mcimadamore@344 830 super.visitClassDef(tree);
mcimadamore@344 831 } finally {
mcimadamore@344 832 inClass = false;
mcimadamore@344 833 }
mcimadamore@344 834 }
mcimadamore@344 835 }
mcimadamore@344 836
jjg@308 837 private TypeAnnotationPosition resolveFrame(JCTree tree, JCTree frame,
jjg@308 838 List<JCTree> path, TypeAnnotationPosition p) {
jjg@308 839 switch (frame.getKind()) {
jjg@308 840 case TYPE_CAST:
jjg@308 841 p.type = TargetType.TYPECAST;
jjg@308 842 p.pos = frame.pos;
jjg@308 843 return p;
jjg@308 844
jjg@308 845 case INSTANCE_OF:
jjg@308 846 p.type = TargetType.INSTANCEOF;
jjg@308 847 p.pos = frame.pos;
jjg@308 848 return p;
jjg@308 849
jjg@308 850 case NEW_CLASS:
jjg@308 851 p.type = TargetType.NEW;
jjg@308 852 p.pos = frame.pos;
jjg@308 853 return p;
jjg@308 854
jjg@308 855 case NEW_ARRAY:
jjg@308 856 p.type = TargetType.NEW;
jjg@308 857 p.pos = frame.pos;
jjg@308 858 return p;
jjg@308 859
jjg@308 860 case CLASS:
jjg@308 861 p.pos = frame.pos;
jjg@308 862 if (((JCClassDecl)frame).extending == tree) {
jjg@308 863 p.type = TargetType.CLASS_EXTENDS;
jjg@308 864 p.type_index = -1;
jjg@308 865 } else if (((JCClassDecl)frame).implementing.contains(tree)) {
jjg@308 866 p.type = TargetType.CLASS_EXTENDS;
jjg@308 867 p.type_index = ((JCClassDecl)frame).implementing.indexOf(tree);
jjg@308 868 } else if (((JCClassDecl)frame).typarams.contains(tree)) {
jjg@308 869 p.type = TargetType.CLASS_TYPE_PARAMETER;
jjg@308 870 p.parameter_index = ((JCClassDecl)frame).typarams.indexOf(tree);
jjg@308 871 } else
jjg@308 872 throw new AssertionError();
jjg@308 873 return p;
jjg@308 874
jjg@308 875 case METHOD: {
jjg@308 876 JCMethodDecl frameMethod = (JCMethodDecl)frame;
jjg@308 877 p.pos = frame.pos;
jjg@308 878 if (frameMethod.receiverAnnotations.contains(tree))
jjg@308 879 p.type = TargetType.METHOD_RECEIVER;
jjg@308 880 else if (frameMethod.thrown.contains(tree)) {
jjg@308 881 p.type = TargetType.THROWS;
jjg@308 882 p.type_index = frameMethod.thrown.indexOf(tree);
jjg@308 883 } else if (((JCMethodDecl)frame).restype == tree) {
jjg@308 884 p.type = TargetType.METHOD_RETURN_GENERIC_OR_ARRAY;
jjg@308 885 } else if (frameMethod.typarams.contains(tree)) {
jjg@308 886 p.type = TargetType.METHOD_TYPE_PARAMETER;
jjg@308 887 p.parameter_index = frameMethod.typarams.indexOf(tree);
jjg@308 888 } else
jjg@308 889 throw new AssertionError();
jjg@308 890 return p;
jjg@308 891 }
jjg@308 892 case MEMBER_SELECT: {
jjg@308 893 JCFieldAccess fieldFrame = (JCFieldAccess)frame;
jjg@308 894 if (fieldFrame.name == names._class) {
jjg@308 895 p.type = TargetType.CLASS_LITERAL;
jjg@308 896 if (fieldFrame.selected instanceof JCAnnotatedType) {
jjg@308 897 p.pos = TreeInfo.typeIn(fieldFrame).pos;
jjg@308 898 } else if (fieldFrame.selected instanceof JCArrayTypeTree) {
jjg@308 899 p.pos = fieldFrame.selected.pos;
jjg@308 900 }
jjg@308 901 } else
jjg@308 902 throw new AssertionError();
jjg@308 903 return p;
jjg@308 904 }
jjg@308 905 case PARAMETERIZED_TYPE: {
jjg@308 906 TypeAnnotationPosition nextP;
jjg@308 907 if (((JCTypeApply)frame).clazz == tree)
jjg@308 908 nextP = p; // generic: RAW; noop
jjg@308 909 else if (((JCTypeApply)frame).arguments.contains(tree))
jjg@308 910 p.location = p.location.prepend(
jjg@308 911 ((JCTypeApply)frame).arguments.indexOf(tree));
jjg@308 912 else
jjg@308 913 throw new AssertionError();
jjg@308 914
jjg@308 915 List<JCTree> newPath = path.tail;
jjg@308 916 return resolveFrame(newPath.head, newPath.tail.head, newPath, p);
jjg@308 917 }
jjg@308 918
jjg@308 919 case ARRAY_TYPE: {
jjg@308 920 p.location = p.location.prepend(0);
jjg@308 921 List<JCTree> newPath = path.tail;
jjg@308 922 return resolveFrame(newPath.head, newPath.tail.head, newPath, p);
jjg@308 923 }
jjg@308 924
jjg@308 925 case TYPE_PARAMETER:
jjg@308 926 if (path.tail.tail.head.getTag() == JCTree.CLASSDEF) {
jjg@308 927 JCClassDecl clazz = (JCClassDecl)path.tail.tail.head;
jjg@308 928 p.type = TargetType.CLASS_TYPE_PARAMETER_BOUND;
jjg@308 929 p.parameter_index = clazz.typarams.indexOf(path.tail.head);
jjg@308 930 p.bound_index = ((JCTypeParameter)frame).bounds.indexOf(tree);
jjg@308 931 } else if (path.tail.tail.head.getTag() == JCTree.METHODDEF) {
jjg@308 932 JCMethodDecl method = (JCMethodDecl)path.tail.tail.head;
jjg@308 933 p.type = TargetType.METHOD_TYPE_PARAMETER_BOUND;
jjg@308 934 p.parameter_index = method.typarams.indexOf(path.tail.head);
jjg@308 935 p.bound_index = ((JCTypeParameter)frame).bounds.indexOf(tree);
jjg@308 936 } else
jjg@308 937 throw new AssertionError();
jjg@308 938 p.pos = frame.pos;
jjg@308 939 return p;
jjg@308 940
jjg@308 941 case VARIABLE:
jjg@308 942 VarSymbol v = ((JCVariableDecl)frame).sym;
jjg@308 943 p.pos = frame.pos;
jjg@308 944 switch (v.getKind()) {
jjg@308 945 case LOCAL_VARIABLE:
jjg@308 946 p.type = TargetType.LOCAL_VARIABLE; break;
jjg@308 947 case FIELD:
jjg@308 948 p.type = TargetType.FIELD_GENERIC_OR_ARRAY; break;
jjg@308 949 case PARAMETER:
jjg@308 950 p.type = TargetType.METHOD_PARAMETER_GENERIC_OR_ARRAY;
jjg@308 951 p.parameter_index = methodParamIndex(path, frame);
jjg@308 952 break;
jjg@308 953 default: throw new AssertionError();
jjg@308 954 }
jjg@308 955 return p;
jjg@308 956
jjg@308 957 case ANNOTATED_TYPE: {
jjg@308 958 List<JCTree> newPath = path.tail;
jjg@308 959 return resolveFrame(newPath.head, newPath.tail.head,
jjg@308 960 newPath, p);
jjg@308 961 }
jjg@308 962
jjg@308 963 case METHOD_INVOCATION: {
jjg@308 964 JCMethodInvocation invocation = (JCMethodInvocation)frame;
jjg@308 965 if (!invocation.typeargs.contains(tree))
jjg@308 966 throw new AssertionError("{" + tree + "} is not an argument in the invocation: " + invocation);
jjg@308 967 p.type = TargetType.METHOD_TYPE_ARGUMENT;
jjg@308 968 p.pos = invocation.pos;
jjg@308 969 p.type_index = invocation.typeargs.indexOf(tree);
jjg@308 970 return p;
jjg@308 971 }
jjg@308 972
jjg@308 973 case EXTENDS_WILDCARD:
jjg@308 974 case SUPER_WILDCARD: {
jjg@308 975 p.type = TargetType.WILDCARD_BOUND;
jjg@308 976 List<JCTree> newPath = path.tail;
jjg@308 977
jjg@308 978 TypeAnnotationPosition wildcard =
jjg@308 979 resolveFrame(newPath.head, newPath.tail.head, newPath,
jjg@308 980 new TypeAnnotationPosition());
jjg@308 981 if (!wildcard.location.isEmpty())
jjg@308 982 wildcard.type = wildcard.type.getGenericComplement();
jjg@308 983 p.wildcard_position = wildcard;
jjg@308 984 p.pos = frame.pos;
jjg@308 985 return p;
jjg@308 986 }
jjg@308 987 }
jjg@308 988 return p;
jjg@308 989 }
jjg@308 990
jjg@308 991 @Override
jjg@308 992 public void visitApply(JCMethodInvocation tree) {
jjg@308 993 scan(tree.meth);
jjg@308 994 scan(tree.typeargs);
jjg@308 995 scan(tree.args);
jjg@308 996 }
jjg@308 997
jjg@308 998 private void setTypeAnnotationPos(List<JCTypeAnnotation> annotations, TypeAnnotationPosition position) {
jjg@308 999 for (JCTypeAnnotation anno : annotations) {
jjg@308 1000 anno.annotation_position = position;
jjg@308 1001 anno.attribute_field.position = position;
jjg@308 1002 }
jjg@308 1003 }
jjg@308 1004
jjg@308 1005 @Override
jjg@308 1006 public void visitNewArray(JCNewArray tree) {
jjg@308 1007 findPosition(tree, tree, tree.annotations);
jjg@308 1008 int dimAnnosCount = tree.dimAnnotations.size();
jjg@308 1009
jjg@308 1010 // handle annotations associated with dimentions
jjg@308 1011 for (int i = 0; i < dimAnnosCount; ++i) {
jjg@308 1012 TypeAnnotationPosition p = new TypeAnnotationPosition();
jjg@308 1013 p.type = TargetType.NEW_GENERIC_OR_ARRAY;
jjg@308 1014 p.pos = tree.pos;
jjg@308 1015 p.location = p.location.append(i);
jjg@308 1016 setTypeAnnotationPos(tree.dimAnnotations.get(i), p);
jjg@308 1017 }
jjg@308 1018
jjg@308 1019 // handle "free" annotations
jjg@308 1020 int i = dimAnnosCount == 0 ? 0 : dimAnnosCount - 1;
jjg@308 1021 JCExpression elemType = tree.elemtype;
jjg@308 1022 while (elemType != null) {
jjg@308 1023 if (elemType.getTag() == JCTree.ANNOTATED_TYPE) {
jjg@308 1024 JCAnnotatedType at = (JCAnnotatedType)elemType;
jjg@308 1025 TypeAnnotationPosition p = new TypeAnnotationPosition();
jjg@308 1026 p.type = TargetType.NEW_GENERIC_OR_ARRAY;
jjg@308 1027 p.pos = tree.pos;
jjg@308 1028 p.location = p.location.append(i);
jjg@308 1029 setTypeAnnotationPos(at.annotations, p);
jjg@308 1030 elemType = at.underlyingType;
jjg@308 1031 } else if (elemType.getTag() == JCTree.TYPEARRAY) {
jjg@308 1032 ++i;
jjg@308 1033 elemType = ((JCArrayTypeTree)elemType).elemtype;
jjg@308 1034 } else
jjg@308 1035 break;
jjg@308 1036 }
jjg@308 1037
jjg@308 1038 // find annotations locations of initializer elements
jjg@308 1039 scan(tree.elems);
jjg@308 1040 }
jjg@308 1041
jjg@308 1042 @Override
jjg@308 1043 public void visitAnnotatedType(JCAnnotatedType tree) {
jjg@308 1044 findPosition(tree, peek2(), tree.annotations);
jjg@308 1045 super.visitAnnotatedType(tree);
jjg@308 1046 }
jjg@308 1047
jjg@308 1048 @Override
jjg@308 1049 public void visitMethodDef(JCMethodDecl tree) {
jjg@308 1050 TypeAnnotationPosition p = new TypeAnnotationPosition();
jjg@308 1051 p.type = TargetType.METHOD_RECEIVER;
jjg@308 1052 setTypeAnnotationPos(tree.receiverAnnotations, p);
jjg@308 1053 super.visitMethodDef(tree);
jjg@308 1054 }
jjg@308 1055 @Override
jjg@308 1056 public void visitTypeParameter(JCTypeParameter tree) {
jjg@308 1057 findPosition(tree, peek2(), tree.annotations);
jjg@308 1058 super.visitTypeParameter(tree);
jjg@308 1059 }
jjg@308 1060
jjg@308 1061 void findPosition(JCTree tree, JCTree frame, List<JCTypeAnnotation> annotations) {
jjg@308 1062 if (!annotations.isEmpty()) {
jjg@308 1063 TypeAnnotationPosition p =
jjg@308 1064 resolveFrame(tree, frame, frames.toList(),
jjg@308 1065 new TypeAnnotationPosition());
jjg@308 1066 if (!p.location.isEmpty())
jjg@308 1067 p.type = p.type.getGenericComplement();
jjg@308 1068 setTypeAnnotationPos(annotations, p);
jjg@308 1069 if (debugJSR308) {
jjg@308 1070 System.out.println("trans: " + tree);
jjg@308 1071 System.out.println(" target: " + p);
jjg@308 1072 }
jjg@308 1073 }
jjg@308 1074 }
jjg@308 1075
jjg@308 1076 private int methodParamIndex(List<JCTree> path, JCTree param) {
jjg@308 1077 List<JCTree> curr = path;
jjg@308 1078 if (curr.head != param)
jjg@308 1079 curr = path.tail;
jjg@308 1080 JCMethodDecl method = (JCMethodDecl)curr.tail.head;
jjg@308 1081 return method.params.indexOf(param);
jjg@308 1082 }
jjg@308 1083 }
jjg@308 1084
jjg@308 1085 private class TypeAnnotationLift extends TreeScanner {
jjg@308 1086 List<Attribute.TypeCompound> recordedTypeAnnotations = List.nil();
jjg@308 1087
jjg@308 1088 boolean isInner = false;
jjg@308 1089 @Override
jjg@308 1090 public void visitClassDef(JCClassDecl tree) {
jjg@308 1091 if (isInner) {
jjg@308 1092 // tree is an inner class tree. stop now.
jjg@308 1093 // TransTypes.visitClassDef makes an invocation for each class
jjg@308 1094 // seperately.
jjg@308 1095 return;
jjg@308 1096 }
jjg@308 1097 isInner = true;
jjg@308 1098 List<Attribute.TypeCompound> prevTAs = recordedTypeAnnotations;
jjg@308 1099 recordedTypeAnnotations = List.nil();
jjg@308 1100 try {
jjg@308 1101 super.visitClassDef(tree);
jjg@308 1102 } finally {
jjg@308 1103 tree.sym.typeAnnotations = tree.sym.typeAnnotations.appendList(recordedTypeAnnotations);
jjg@308 1104 recordedTypeAnnotations = prevTAs;
jjg@308 1105 }
jjg@308 1106 }
jjg@308 1107
jjg@308 1108 @Override
jjg@308 1109 public void visitMethodDef(JCMethodDecl tree) {
jjg@308 1110 List<Attribute.TypeCompound> prevTAs = recordedTypeAnnotations;
jjg@308 1111 recordedTypeAnnotations = List.nil();
jjg@308 1112 try {
jjg@308 1113 super.visitMethodDef(tree);
jjg@308 1114 } finally {
jjg@308 1115 tree.sym.typeAnnotations = tree.sym.typeAnnotations.appendList(recordedTypeAnnotations);
jjg@308 1116 recordedTypeAnnotations = prevTAs;
jjg@308 1117 }
jjg@308 1118 }
jjg@308 1119
jjg@308 1120 @Override
jjg@308 1121 public void visitVarDef(JCVariableDecl tree) {
jjg@308 1122 List<Attribute.TypeCompound> prevTAs = recordedTypeAnnotations;
jjg@308 1123 recordedTypeAnnotations = List.nil();
jjg@308 1124 ElementKind kind = tree.sym.getKind();
jjg@308 1125 if (kind == ElementKind.LOCAL_VARIABLE && tree.mods.annotations.nonEmpty()) {
jjg@308 1126 // need to lift the annotations
jjg@308 1127 TypeAnnotationPosition position = new TypeAnnotationPosition();
jjg@308 1128 position.pos = tree.pos;
jjg@308 1129 position.type = TargetType.LOCAL_VARIABLE;
jjg@308 1130 for (Attribute.Compound attribute : tree.sym.attributes_field) {
jjg@308 1131 Attribute.TypeCompound tc =
jjg@308 1132 new Attribute.TypeCompound(attribute.type, attribute.values, position);
jjg@308 1133 recordedTypeAnnotations = recordedTypeAnnotations.append(tc);
jjg@308 1134 }
jjg@308 1135 }
jjg@308 1136 try {
jjg@308 1137 super.visitVarDef(tree);
jjg@308 1138 } finally {
jjg@308 1139 if (kind.isField() || kind == ElementKind.LOCAL_VARIABLE)
jjg@308 1140 tree.sym.typeAnnotations = tree.sym.typeAnnotations.appendList(recordedTypeAnnotations);
jjg@308 1141 recordedTypeAnnotations = kind.isField() ? prevTAs : prevTAs.appendList(recordedTypeAnnotations);
jjg@308 1142 }
jjg@308 1143 }
jjg@308 1144
jjg@308 1145 @Override
jjg@308 1146 public void visitApply(JCMethodInvocation tree) {
jjg@308 1147 scan(tree.meth);
jjg@308 1148 scan(tree.typeargs);
jjg@308 1149 scan(tree.args);
jjg@308 1150 }
jjg@308 1151
jjg@308 1152 public void visitAnnotation(JCAnnotation tree) {
jjg@308 1153 if (tree instanceof JCTypeAnnotation)
jjg@308 1154 recordedTypeAnnotations = recordedTypeAnnotations.append(((JCTypeAnnotation)tree).attribute_field);
jjg@308 1155 super.visitAnnotation(tree);
jjg@308 1156 }
jjg@308 1157 }
jjg@308 1158
duke@1 1159 }

mercurial