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

Fri, 26 Feb 2010 15:30:35 -0800

author
jjg
date
Fri, 26 Feb 2010 15:30:35 -0800
changeset 511
7b69c7083a97
parent 477
f23b985beb78
child 554
9d9f26857129
permissions
-rw-r--r--

6930032: fix findbugs errors in com.sun.tools.javac.comp
Reviewed-by: darcy

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@113 64 private Names names;
duke@1 65 private Log log;
duke@1 66 private Symtab syms;
duke@1 67 private TreeMaker make;
duke@1 68 private Enter enter;
duke@1 69 private boolean allowEnums;
duke@1 70 private Types types;
duke@1 71 private final Resolve resolve;
jjg@477 72 private final TypeAnnotations typeAnnotations;
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
duke@1 81 protected TransTypes(Context context) {
duke@1 82 context.put(transTypesKey, this);
jjg@113 83 names = Names.instance(context);
duke@1 84 log = Log.instance(context);
duke@1 85 syms = Symtab.instance(context);
duke@1 86 enter = Enter.instance(context);
duke@1 87 overridden = new HashMap<MethodSymbol,MethodSymbol>();
duke@1 88 Source source = Source.instance(context);
duke@1 89 allowEnums = source.allowEnums();
duke@1 90 addBridges = source.addBridges();
duke@1 91 types = Types.instance(context);
duke@1 92 make = TreeMaker.instance(context);
duke@1 93 resolve = Resolve.instance(context);
jjg@477 94 typeAnnotations = TypeAnnotations.instance(context);
duke@1 95 }
duke@1 96
duke@1 97 /** A hashtable mapping bridge methods to the methods they override after
duke@1 98 * type erasure.
duke@1 99 */
duke@1 100 Map<MethodSymbol,MethodSymbol> overridden;
duke@1 101
duke@1 102 /** Construct an attributed tree for a cast of expression to target type,
duke@1 103 * unless it already has precisely that type.
duke@1 104 * @param tree The expression tree.
duke@1 105 * @param target The target type.
duke@1 106 */
duke@1 107 JCExpression cast(JCExpression tree, Type target) {
duke@1 108 int oldpos = make.pos;
duke@1 109 make.at(tree.pos);
duke@1 110 if (!types.isSameType(tree.type, target)) {
duke@1 111 if (!resolve.isAccessible(env, target.tsym))
duke@1 112 resolve.logAccessError(env, tree, target);
duke@1 113 tree = make.TypeCast(make.Type(target), tree).setType(target);
duke@1 114 }
duke@1 115 make.pos = oldpos;
duke@1 116 return tree;
duke@1 117 }
duke@1 118
duke@1 119 /** Construct an attributed tree to coerce an expression to some erased
duke@1 120 * target type, unless the expression is already assignable to that type.
duke@1 121 * If target type is a constant type, use its base type instead.
duke@1 122 * @param tree The expression tree.
duke@1 123 * @param target The target type.
duke@1 124 */
duke@1 125 JCExpression coerce(JCExpression tree, Type target) {
duke@1 126 Type btarget = target.baseType();
duke@1 127 if (tree.type.isPrimitive() == target.isPrimitive()) {
duke@1 128 return types.isAssignable(tree.type, btarget, Warner.noWarnings)
duke@1 129 ? tree
duke@1 130 : cast(tree, btarget);
duke@1 131 }
duke@1 132 return tree;
duke@1 133 }
duke@1 134
duke@1 135 /** Given an erased reference type, assume this type as the tree's type.
duke@1 136 * Then, coerce to some given target type unless target type is null.
duke@1 137 * This operation is used in situations like the following:
duke@1 138 *
duke@1 139 * class Cell<A> { A value; }
duke@1 140 * ...
duke@1 141 * Cell<Integer> cell;
duke@1 142 * Integer x = cell.value;
duke@1 143 *
duke@1 144 * Since the erasure of Cell.value is Object, but the type
duke@1 145 * of cell.value in the assignment is Integer, we need to
duke@1 146 * adjust the original type of cell.value to Object, and insert
duke@1 147 * a cast to Integer. That is, the last assignment becomes:
duke@1 148 *
duke@1 149 * Integer x = (Integer)cell.value;
duke@1 150 *
duke@1 151 * @param tree The expression tree whose type might need adjustment.
duke@1 152 * @param erasedType The expression's type after erasure.
duke@1 153 * @param target The target type, which is usually the erasure of the
duke@1 154 * expression's original type.
duke@1 155 */
duke@1 156 JCExpression retype(JCExpression tree, Type erasedType, Type target) {
duke@1 157 // System.err.println("retype " + tree + " to " + erasedType);//DEBUG
duke@1 158 if (erasedType.tag > lastBaseTag) {
duke@1 159 if (target != null && target.isPrimitive())
duke@1 160 target = erasure(tree.type);
duke@1 161 tree.type = erasedType;
duke@1 162 if (target != null) return coerce(tree, target);
duke@1 163 }
duke@1 164 return tree;
duke@1 165 }
duke@1 166
duke@1 167 /** Translate method argument list, casting each argument
duke@1 168 * to its corresponding type in a list of target types.
duke@1 169 * @param _args The method argument list.
duke@1 170 * @param parameters The list of target types.
duke@1 171 * @param varargsElement The erasure of the varargs element type,
duke@1 172 * or null if translating a non-varargs invocation
duke@1 173 */
duke@1 174 <T extends JCTree> List<T> translateArgs(List<T> _args,
duke@1 175 List<Type> parameters,
duke@1 176 Type varargsElement) {
duke@1 177 if (parameters.isEmpty()) return _args;
duke@1 178 List<T> args = _args;
duke@1 179 while (parameters.tail.nonEmpty()) {
duke@1 180 args.head = translate(args.head, parameters.head);
duke@1 181 args = args.tail;
duke@1 182 parameters = parameters.tail;
duke@1 183 }
duke@1 184 Type parameter = parameters.head;
duke@1 185 assert varargsElement != null || args.length() == 1;
duke@1 186 if (varargsElement != null) {
duke@1 187 while (args.nonEmpty()) {
duke@1 188 args.head = translate(args.head, varargsElement);
duke@1 189 args = args.tail;
duke@1 190 }
duke@1 191 } else {
duke@1 192 args.head = translate(args.head, parameter);
duke@1 193 }
duke@1 194 return _args;
duke@1 195 }
duke@1 196
duke@1 197 /** Add a bridge definition and enter corresponding method symbol in
duke@1 198 * local scope of origin.
duke@1 199 *
duke@1 200 * @param pos The source code position to be used for the definition.
duke@1 201 * @param meth The method for which a bridge needs to be added
duke@1 202 * @param impl That method's implementation (possibly the method itself)
duke@1 203 * @param origin The class to which the bridge will be added
duke@1 204 * @param hypothetical
duke@1 205 * True if the bridge method is not strictly necessary in the
duke@1 206 * binary, but is represented in the symbol table to detect
duke@1 207 * erasure clashes.
duke@1 208 * @param bridges The list buffer to which the bridge will be added
duke@1 209 */
duke@1 210 void addBridge(DiagnosticPosition pos,
duke@1 211 MethodSymbol meth,
duke@1 212 MethodSymbol impl,
duke@1 213 ClassSymbol origin,
duke@1 214 boolean hypothetical,
duke@1 215 ListBuffer<JCTree> bridges) {
duke@1 216 make.at(pos);
duke@1 217 Type origType = types.memberType(origin.type, meth);
duke@1 218 Type origErasure = erasure(origType);
duke@1 219
duke@1 220 // Create a bridge method symbol and a bridge definition without a body.
duke@1 221 Type bridgeType = meth.erasure(types);
duke@1 222 long flags = impl.flags() & AccessFlags | SYNTHETIC | BRIDGE;
duke@1 223 if (hypothetical) flags |= HYPOTHETICAL;
duke@1 224 MethodSymbol bridge = new MethodSymbol(flags,
duke@1 225 meth.name,
duke@1 226 bridgeType,
duke@1 227 origin);
duke@1 228 if (!hypothetical) {
duke@1 229 JCMethodDecl md = make.MethodDef(bridge, null);
duke@1 230
duke@1 231 // The bridge calls this.impl(..), if we have an implementation
duke@1 232 // in the current class, super.impl(...) otherwise.
duke@1 233 JCExpression receiver = (impl.owner == origin)
duke@1 234 ? make.This(origin.erasure(types))
duke@1 235 : make.Super(types.supertype(origin.type).tsym.erasure(types), origin);
duke@1 236
duke@1 237 // The type returned from the original method.
duke@1 238 Type calltype = erasure(impl.type.getReturnType());
duke@1 239
duke@1 240 // Construct a call of this.impl(params), or super.impl(params),
duke@1 241 // casting params and possibly results as needed.
duke@1 242 JCExpression call =
duke@1 243 make.Apply(
duke@1 244 null,
duke@1 245 make.Select(receiver, impl).setType(calltype),
duke@1 246 translateArgs(make.Idents(md.params), origErasure.getParameterTypes(), null))
duke@1 247 .setType(calltype);
duke@1 248 JCStatement stat = (origErasure.getReturnType().tag == VOID)
duke@1 249 ? make.Exec(call)
duke@1 250 : make.Return(coerce(call, bridgeType.getReturnType()));
duke@1 251 md.body = make.Block(0, List.of(stat));
duke@1 252
duke@1 253 // Add bridge to `bridges' buffer
duke@1 254 bridges.append(md);
duke@1 255 }
duke@1 256
duke@1 257 // Add bridge to scope of enclosing class and `overridden' table.
duke@1 258 origin.members().enter(bridge);
duke@1 259 overridden.put(bridge, meth);
duke@1 260 }
duke@1 261
duke@1 262 /** Add bridge if given symbol is a non-private, non-static member
duke@1 263 * of the given class, which is either defined in the class or non-final
duke@1 264 * inherited, and one of the two following conditions holds:
duke@1 265 * 1. The method's type changes in the given class, as compared to the
duke@1 266 * class where the symbol was defined, (in this case
duke@1 267 * we have extended a parameterized class with non-trivial parameters).
duke@1 268 * 2. The method has an implementation with a different erased return type.
duke@1 269 * (in this case we have used co-variant returns).
duke@1 270 * If a bridge already exists in some other class, no new bridge is added.
duke@1 271 * Instead, it is checked that the bridge symbol overrides the method symbol.
duke@1 272 * (Spec ???).
duke@1 273 * todo: what about bridges for privates???
duke@1 274 *
duke@1 275 * @param pos The source code position to be used for the definition.
duke@1 276 * @param sym The symbol for which a bridge might have to be added.
duke@1 277 * @param origin The class in which the bridge would go.
duke@1 278 * @param bridges The list buffer to which the bridge would be added.
duke@1 279 */
duke@1 280 void addBridgeIfNeeded(DiagnosticPosition pos,
duke@1 281 Symbol sym,
duke@1 282 ClassSymbol origin,
duke@1 283 ListBuffer<JCTree> bridges) {
duke@1 284 if (sym.kind == MTH &&
duke@1 285 sym.name != names.init &&
duke@1 286 (sym.flags() & (PRIVATE | SYNTHETIC | STATIC)) == 0 &&
duke@1 287 sym.isMemberOf(origin, types))
duke@1 288 {
duke@1 289 MethodSymbol meth = (MethodSymbol)sym;
duke@1 290 MethodSymbol bridge = meth.binaryImplementation(origin, types);
duke@1 291 MethodSymbol impl = meth.implementation(origin, types, true);
duke@1 292 if (bridge == null ||
duke@1 293 bridge == meth ||
duke@1 294 (impl != null && !bridge.owner.isSubClass(impl.owner, types))) {
duke@1 295 // No bridge was added yet.
duke@1 296 if (impl != null && isBridgeNeeded(meth, impl, origin.type)) {
duke@1 297 addBridge(pos, meth, impl, origin, bridge==impl, bridges);
duke@1 298 } else if (impl == meth
duke@1 299 && impl.owner != origin
duke@1 300 && (impl.flags() & FINAL) == 0
duke@1 301 && (meth.flags() & (ABSTRACT|PUBLIC)) == PUBLIC
duke@1 302 && (origin.flags() & PUBLIC) > (impl.owner.flags() & PUBLIC)) {
duke@1 303 // this is to work around a horrible but permanent
duke@1 304 // reflection design error.
duke@1 305 addBridge(pos, meth, impl, origin, false, bridges);
duke@1 306 }
duke@1 307 } else if ((bridge.flags() & SYNTHETIC) != 0) {
duke@1 308 MethodSymbol other = overridden.get(bridge);
duke@1 309 if (other != null && other != meth) {
duke@1 310 if (impl == null || !impl.overrides(other, origin, types, true)) {
duke@1 311 // Bridge for other symbol pair was added
duke@1 312 log.error(pos, "name.clash.same.erasure.no.override",
duke@1 313 other, other.location(origin.type, types),
duke@1 314 meth, meth.location(origin.type, types));
duke@1 315 }
duke@1 316 }
duke@1 317 } else if (!bridge.overrides(meth, origin, types, true)) {
duke@1 318 // Accidental binary override without source override.
duke@1 319 if (bridge.owner == origin ||
duke@1 320 types.asSuper(bridge.owner.type, meth.owner) == null)
duke@1 321 // Don't diagnose the problem if it would already
duke@1 322 // have been reported in the superclass
duke@1 323 log.error(pos, "name.clash.same.erasure.no.override",
duke@1 324 bridge, bridge.location(origin.type, types),
duke@1 325 meth, meth.location(origin.type, types));
duke@1 326 }
duke@1 327 }
duke@1 328 }
duke@1 329 // where
duke@1 330 /**
duke@1 331 * @param method The symbol for which a bridge might have to be added
duke@1 332 * @param impl The implementation of method
duke@1 333 * @param dest The type in which the bridge would go
duke@1 334 */
duke@1 335 private boolean isBridgeNeeded(MethodSymbol method,
duke@1 336 MethodSymbol impl,
duke@1 337 Type dest) {
duke@1 338 if (impl != method) {
duke@1 339 // If either method or impl have different erasures as
duke@1 340 // members of dest, a bridge is needed.
duke@1 341 Type method_erasure = method.erasure(types);
duke@1 342 if (!isSameMemberWhenErased(dest, method, method_erasure))
duke@1 343 return true;
duke@1 344 Type impl_erasure = impl.erasure(types);
duke@1 345 if (!isSameMemberWhenErased(dest, impl, impl_erasure))
duke@1 346 return true;
duke@1 347
duke@1 348 // If the erasure of the return type is different, a
duke@1 349 // bridge is needed.
duke@1 350 return !types.isSameType(impl_erasure.getReturnType(),
duke@1 351 method_erasure.getReturnType());
duke@1 352 } else {
duke@1 353 // method and impl are the same...
duke@1 354 if ((method.flags() & ABSTRACT) != 0) {
duke@1 355 // ...and abstract so a bridge is not needed.
duke@1 356 // Concrete subclasses will bridge as needed.
duke@1 357 return false;
duke@1 358 }
duke@1 359
duke@1 360 // The erasure of the return type is always the same
duke@1 361 // for the same symbol. Reducing the three tests in
duke@1 362 // the other branch to just one:
duke@1 363 return !isSameMemberWhenErased(dest, method, method.erasure(types));
duke@1 364 }
duke@1 365 }
duke@1 366 /**
duke@1 367 * Lookup the method as a member of the type. Compare the
duke@1 368 * erasures.
duke@1 369 * @param type the class where to look for the method
duke@1 370 * @param method the method to look for in class
duke@1 371 * @param erasure the erasure of method
duke@1 372 */
duke@1 373 private boolean isSameMemberWhenErased(Type type,
duke@1 374 MethodSymbol method,
duke@1 375 Type erasure) {
duke@1 376 return types.isSameType(erasure(types.memberType(type, method)),
duke@1 377 erasure);
duke@1 378 }
duke@1 379
duke@1 380 void addBridges(DiagnosticPosition pos,
duke@1 381 TypeSymbol i,
duke@1 382 ClassSymbol origin,
duke@1 383 ListBuffer<JCTree> bridges) {
duke@1 384 for (Scope.Entry e = i.members().elems; e != null; e = e.sibling)
duke@1 385 addBridgeIfNeeded(pos, e.sym, origin, bridges);
duke@1 386 for (List<Type> l = types.interfaces(i.type); l.nonEmpty(); l = l.tail)
duke@1 387 addBridges(pos, l.head.tsym, origin, bridges);
duke@1 388 }
duke@1 389
duke@1 390 /** Add all necessary bridges to some class appending them to list buffer.
duke@1 391 * @param pos The source code position to be used for the bridges.
duke@1 392 * @param origin The class in which the bridges go.
duke@1 393 * @param bridges The list buffer to which the bridges are added.
duke@1 394 */
duke@1 395 void addBridges(DiagnosticPosition pos, ClassSymbol origin, ListBuffer<JCTree> bridges) {
duke@1 396 Type st = types.supertype(origin.type);
duke@1 397 while (st.tag == CLASS) {
duke@1 398 // if (isSpecialization(st))
duke@1 399 addBridges(pos, st.tsym, origin, bridges);
duke@1 400 st = types.supertype(st);
duke@1 401 }
duke@1 402 for (List<Type> l = types.interfaces(origin.type); l.nonEmpty(); l = l.tail)
duke@1 403 // if (isSpecialization(l.head))
duke@1 404 addBridges(pos, l.head.tsym, origin, bridges);
duke@1 405 }
duke@1 406
duke@1 407 /* ************************************************************************
duke@1 408 * Visitor methods
duke@1 409 *************************************************************************/
duke@1 410
duke@1 411 /** Visitor argument: proto-type.
duke@1 412 */
duke@1 413 private Type pt;
duke@1 414
duke@1 415 /** Visitor method: perform a type translation on tree.
duke@1 416 */
duke@1 417 public <T extends JCTree> T translate(T tree, Type pt) {
duke@1 418 Type prevPt = this.pt;
duke@1 419 try {
duke@1 420 this.pt = pt;
duke@1 421 return translate(tree);
duke@1 422 } finally {
duke@1 423 this.pt = prevPt;
duke@1 424 }
duke@1 425 }
duke@1 426
duke@1 427 /** Visitor method: perform a type translation on list of trees.
duke@1 428 */
duke@1 429 public <T extends JCTree> List<T> translate(List<T> trees, Type pt) {
duke@1 430 Type prevPt = this.pt;
duke@1 431 List<T> res;
duke@1 432 try {
duke@1 433 this.pt = pt;
duke@1 434 res = translate(trees);
duke@1 435 } finally {
duke@1 436 this.pt = prevPt;
duke@1 437 }
duke@1 438 return res;
duke@1 439 }
duke@1 440
duke@1 441 public void visitClassDef(JCClassDecl tree) {
jjg@477 442 typeAnnotations.taFillAndLift(tree, true);
duke@1 443 translateClass(tree.sym);
duke@1 444 result = tree;
duke@1 445 }
duke@1 446
duke@1 447 JCMethodDecl currentMethod = null;
duke@1 448 public void visitMethodDef(JCMethodDecl tree) {
jjg@308 449 tree.sym.typeAnnotations = tree.sym.typeAnnotations;
duke@1 450 JCMethodDecl previousMethod = currentMethod;
duke@1 451 try {
duke@1 452 currentMethod = tree;
duke@1 453 tree.restype = translate(tree.restype, null);
duke@1 454 tree.typarams = List.nil();
duke@1 455 tree.params = translateVarDefs(tree.params);
duke@1 456 tree.thrown = translate(tree.thrown, null);
duke@1 457 tree.body = translate(tree.body, tree.sym.erasure(types).getReturnType());
duke@1 458 tree.type = erasure(tree.type);
duke@1 459 result = tree;
duke@1 460 } finally {
duke@1 461 currentMethod = previousMethod;
duke@1 462 }
duke@1 463
duke@1 464 // Check that we do not introduce a name clash by erasing types.
duke@1 465 for (Scope.Entry e = tree.sym.owner.members().lookup(tree.name);
duke@1 466 e.sym != null;
duke@1 467 e = e.next()) {
duke@1 468 if (e.sym != tree.sym &&
duke@1 469 types.isSameType(erasure(e.sym.type), tree.type)) {
duke@1 470 log.error(tree.pos(),
duke@1 471 "name.clash.same.erasure", tree.sym,
duke@1 472 e.sym);
duke@1 473 return;
duke@1 474 }
duke@1 475 }
duke@1 476 }
duke@1 477
duke@1 478 public void visitVarDef(JCVariableDecl tree) {
duke@1 479 tree.vartype = translate(tree.vartype, null);
duke@1 480 tree.init = translate(tree.init, tree.sym.erasure(types));
duke@1 481 tree.type = erasure(tree.type);
duke@1 482 result = tree;
duke@1 483 }
duke@1 484
duke@1 485 public void visitDoLoop(JCDoWhileLoop tree) {
duke@1 486 tree.body = translate(tree.body);
duke@1 487 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 488 result = tree;
duke@1 489 }
duke@1 490
duke@1 491 public void visitWhileLoop(JCWhileLoop tree) {
duke@1 492 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 493 tree.body = translate(tree.body);
duke@1 494 result = tree;
duke@1 495 }
duke@1 496
duke@1 497 public void visitForLoop(JCForLoop tree) {
duke@1 498 tree.init = translate(tree.init, null);
duke@1 499 if (tree.cond != null)
duke@1 500 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 501 tree.step = translate(tree.step, null);
duke@1 502 tree.body = translate(tree.body);
duke@1 503 result = tree;
duke@1 504 }
duke@1 505
duke@1 506 public void visitForeachLoop(JCEnhancedForLoop tree) {
duke@1 507 tree.var = translate(tree.var, null);
duke@1 508 Type iterableType = tree.expr.type;
duke@1 509 tree.expr = translate(tree.expr, erasure(tree.expr.type));
duke@1 510 if (types.elemtype(tree.expr.type) == null)
duke@1 511 tree.expr.type = iterableType; // preserve type for Lower
duke@1 512 tree.body = translate(tree.body);
duke@1 513 result = tree;
duke@1 514 }
duke@1 515
duke@1 516 public void visitSwitch(JCSwitch tree) {
duke@1 517 Type selsuper = types.supertype(tree.selector.type);
duke@1 518 boolean enumSwitch = selsuper != null &&
duke@1 519 selsuper.tsym == syms.enumSym;
duke@1 520 Type target = enumSwitch ? erasure(tree.selector.type) : syms.intType;
duke@1 521 tree.selector = translate(tree.selector, target);
duke@1 522 tree.cases = translateCases(tree.cases);
duke@1 523 result = tree;
duke@1 524 }
duke@1 525
duke@1 526 public void visitCase(JCCase tree) {
duke@1 527 tree.pat = translate(tree.pat, null);
duke@1 528 tree.stats = translate(tree.stats);
duke@1 529 result = tree;
duke@1 530 }
duke@1 531
duke@1 532 public void visitSynchronized(JCSynchronized tree) {
duke@1 533 tree.lock = translate(tree.lock, erasure(tree.lock.type));
duke@1 534 tree.body = translate(tree.body);
duke@1 535 result = tree;
duke@1 536 }
duke@1 537
duke@1 538 public void visitConditional(JCConditional tree) {
duke@1 539 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 540 tree.truepart = translate(tree.truepart, erasure(tree.type));
duke@1 541 tree.falsepart = translate(tree.falsepart, erasure(tree.type));
duke@1 542 tree.type = erasure(tree.type);
mcimadamore@120 543 result = retype(tree, tree.type, pt);
duke@1 544 }
duke@1 545
duke@1 546 public void visitIf(JCIf tree) {
duke@1 547 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 548 tree.thenpart = translate(tree.thenpart);
duke@1 549 tree.elsepart = translate(tree.elsepart);
duke@1 550 result = tree;
duke@1 551 }
duke@1 552
duke@1 553 public void visitExec(JCExpressionStatement tree) {
duke@1 554 tree.expr = translate(tree.expr, null);
duke@1 555 result = tree;
duke@1 556 }
duke@1 557
duke@1 558 public void visitReturn(JCReturn tree) {
duke@1 559 tree.expr = translate(tree.expr, currentMethod.sym.erasure(types).getReturnType());
duke@1 560 result = tree;
duke@1 561 }
duke@1 562
duke@1 563 public void visitThrow(JCThrow tree) {
duke@1 564 tree.expr = translate(tree.expr, erasure(tree.expr.type));
duke@1 565 result = tree;
duke@1 566 }
duke@1 567
duke@1 568 public void visitAssert(JCAssert tree) {
duke@1 569 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 570 if (tree.detail != null)
duke@1 571 tree.detail = translate(tree.detail, erasure(tree.detail.type));
duke@1 572 result = tree;
duke@1 573 }
duke@1 574
duke@1 575 public void visitApply(JCMethodInvocation tree) {
duke@1 576 tree.meth = translate(tree.meth, null);
duke@1 577 Symbol meth = TreeInfo.symbol(tree.meth);
duke@1 578 Type mt = meth.erasure(types);
duke@1 579 List<Type> argtypes = mt.getParameterTypes();
duke@1 580 if (allowEnums &&
duke@1 581 meth.name==names.init &&
duke@1 582 meth.owner == syms.enumSym)
duke@1 583 argtypes = argtypes.tail.tail;
duke@1 584 if (tree.varargsElement != null)
duke@1 585 tree.varargsElement = types.erasure(tree.varargsElement);
duke@1 586 else
duke@1 587 assert tree.args.length() == argtypes.length();
duke@1 588 tree.args = translateArgs(tree.args, argtypes, tree.varargsElement);
duke@1 589
duke@1 590 // Insert casts of method invocation results as needed.
duke@1 591 result = retype(tree, mt.getReturnType(), pt);
duke@1 592 }
duke@1 593
duke@1 594 public void visitNewClass(JCNewClass tree) {
duke@1 595 if (tree.encl != null)
duke@1 596 tree.encl = translate(tree.encl, erasure(tree.encl.type));
duke@1 597 tree.clazz = translate(tree.clazz, null);
duke@1 598 if (tree.varargsElement != null)
duke@1 599 tree.varargsElement = types.erasure(tree.varargsElement);
duke@1 600 tree.args = translateArgs(
duke@1 601 tree.args, tree.constructor.erasure(types).getParameterTypes(), tree.varargsElement);
duke@1 602 tree.def = translate(tree.def, null);
duke@1 603 tree.type = erasure(tree.type);
duke@1 604 result = tree;
duke@1 605 }
duke@1 606
duke@1 607 public void visitNewArray(JCNewArray tree) {
duke@1 608 tree.elemtype = translate(tree.elemtype, null);
duke@1 609 translate(tree.dims, syms.intType);
jjg@511 610 if (tree.type != null) {
jjg@511 611 tree.elems = translate(tree.elems, erasure(types.elemtype(tree.type)));
jjg@511 612 tree.type = erasure(tree.type);
jjg@511 613 } else {
jjg@511 614 tree.elems = translate(tree.elems, null);
jjg@511 615 }
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 }
duke@1 804 }

mercurial