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

Tue, 04 Jun 2013 14:17:50 -0700

author
jjg
date
Tue, 04 Jun 2013 14:17:50 -0700
changeset 1802
8fb68f73d4b1
parent 1792
ec871c3e8337
child 1824
455be95bd1b5
permissions
-rw-r--r--

8004643: Reduce javac space overhead introduced with compiler support for repeating annotations
Reviewed-by: mcimadamore, jfranck

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);
jjg@1802 265 bridge.setAttributes(impl);
vromero@1792 266
duke@1 267 if (!hypothetical) {
duke@1 268 JCMethodDecl md = make.MethodDef(bridge, null);
duke@1 269
duke@1 270 // The bridge calls this.impl(..), if we have an implementation
duke@1 271 // in the current class, super.impl(...) otherwise.
duke@1 272 JCExpression receiver = (impl.owner == origin)
duke@1 273 ? make.This(origin.erasure(types))
duke@1 274 : make.Super(types.supertype(origin.type).tsym.erasure(types), origin);
duke@1 275
duke@1 276 // The type returned from the original method.
duke@1 277 Type calltype = erasure(impl.type.getReturnType());
duke@1 278
duke@1 279 // Construct a call of this.impl(params), or super.impl(params),
duke@1 280 // casting params and possibly results as needed.
duke@1 281 JCExpression call =
duke@1 282 make.Apply(
duke@1 283 null,
duke@1 284 make.Select(receiver, impl).setType(calltype),
duke@1 285 translateArgs(make.Idents(md.params), origErasure.getParameterTypes(), null))
duke@1 286 .setType(calltype);
jjg@1374 287 JCStatement stat = (origErasure.getReturnType().hasTag(VOID))
duke@1 288 ? make.Exec(call)
duke@1 289 : make.Return(coerce(call, bridgeType.getReturnType()));
duke@1 290 md.body = make.Block(0, List.of(stat));
duke@1 291
duke@1 292 // Add bridge to `bridges' buffer
duke@1 293 bridges.append(md);
duke@1 294 }
duke@1 295
duke@1 296 // Add bridge to scope of enclosing class and `overridden' table.
duke@1 297 origin.members().enter(bridge);
duke@1 298 overridden.put(bridge, meth);
duke@1 299 }
duke@1 300
vromero@1792 301 private List<VarSymbol> createBridgeParams(MethodSymbol impl, MethodSymbol bridge,
vromero@1792 302 Type bridgeType) {
vromero@1792 303 List<VarSymbol> bridgeParams = null;
vromero@1792 304 if (impl.params != null) {
vromero@1792 305 bridgeParams = List.nil();
vromero@1792 306 List<VarSymbol> implParams = impl.params;
vromero@1792 307 Type.MethodType mType = (Type.MethodType)bridgeType;
vromero@1792 308 List<Type> argTypes = mType.argtypes;
vromero@1792 309 while (implParams.nonEmpty() && argTypes.nonEmpty()) {
vromero@1792 310 VarSymbol param = new VarSymbol(implParams.head.flags() | SYNTHETIC,
vromero@1792 311 implParams.head.name, argTypes.head, bridge);
jjg@1802 312 param.setAttributes(implParams.head);
vromero@1792 313 bridgeParams = bridgeParams.append(param);
vromero@1792 314 implParams = implParams.tail;
vromero@1792 315 argTypes = argTypes.tail;
vromero@1792 316 }
vromero@1792 317 }
vromero@1792 318 return bridgeParams;
vromero@1792 319 }
vromero@1792 320
duke@1 321 /** Add bridge if given symbol is a non-private, non-static member
duke@1 322 * of the given class, which is either defined in the class or non-final
duke@1 323 * inherited, and one of the two following conditions holds:
duke@1 324 * 1. The method's type changes in the given class, as compared to the
duke@1 325 * class where the symbol was defined, (in this case
duke@1 326 * we have extended a parameterized class with non-trivial parameters).
duke@1 327 * 2. The method has an implementation with a different erased return type.
duke@1 328 * (in this case we have used co-variant returns).
duke@1 329 * If a bridge already exists in some other class, no new bridge is added.
duke@1 330 * Instead, it is checked that the bridge symbol overrides the method symbol.
duke@1 331 * (Spec ???).
duke@1 332 * todo: what about bridges for privates???
duke@1 333 *
duke@1 334 * @param pos The source code position to be used for the definition.
duke@1 335 * @param sym The symbol for which a bridge might have to be added.
duke@1 336 * @param origin The class in which the bridge would go.
duke@1 337 * @param bridges The list buffer to which the bridge would be added.
duke@1 338 */
duke@1 339 void addBridgeIfNeeded(DiagnosticPosition pos,
duke@1 340 Symbol sym,
duke@1 341 ClassSymbol origin,
duke@1 342 ListBuffer<JCTree> bridges) {
duke@1 343 if (sym.kind == MTH &&
duke@1 344 sym.name != names.init &&
mcimadamore@673 345 (sym.flags() & (PRIVATE | STATIC)) == 0 &&
mcimadamore@673 346 (sym.flags() & (SYNTHETIC | OVERRIDE_BRIDGE)) != SYNTHETIC &&
duke@1 347 sym.isMemberOf(origin, types))
duke@1 348 {
duke@1 349 MethodSymbol meth = (MethodSymbol)sym;
duke@1 350 MethodSymbol bridge = meth.binaryImplementation(origin, types);
mcimadamore@673 351 MethodSymbol impl = meth.implementation(origin, types, true, overrideBridgeFilter);
duke@1 352 if (bridge == null ||
duke@1 353 bridge == meth ||
duke@1 354 (impl != null && !bridge.owner.isSubClass(impl.owner, types))) {
duke@1 355 // No bridge was added yet.
duke@1 356 if (impl != null && isBridgeNeeded(meth, impl, origin.type)) {
duke@1 357 addBridge(pos, meth, impl, origin, bridge==impl, bridges);
duke@1 358 } else if (impl == meth
duke@1 359 && impl.owner != origin
duke@1 360 && (impl.flags() & FINAL) == 0
duke@1 361 && (meth.flags() & (ABSTRACT|PUBLIC)) == PUBLIC
duke@1 362 && (origin.flags() & PUBLIC) > (impl.owner.flags() & PUBLIC)) {
duke@1 363 // this is to work around a horrible but permanent
duke@1 364 // reflection design error.
duke@1 365 addBridge(pos, meth, impl, origin, false, bridges);
duke@1 366 }
mcimadamore@673 367 } else if ((bridge.flags() & (SYNTHETIC | OVERRIDE_BRIDGE)) == SYNTHETIC) {
duke@1 368 MethodSymbol other = overridden.get(bridge);
duke@1 369 if (other != null && other != meth) {
duke@1 370 if (impl == null || !impl.overrides(other, origin, types, true)) {
duke@1 371 // Bridge for other symbol pair was added
duke@1 372 log.error(pos, "name.clash.same.erasure.no.override",
duke@1 373 other, other.location(origin.type, types),
duke@1 374 meth, meth.location(origin.type, types));
duke@1 375 }
duke@1 376 }
duke@1 377 } else if (!bridge.overrides(meth, origin, types, true)) {
duke@1 378 // Accidental binary override without source override.
duke@1 379 if (bridge.owner == origin ||
duke@1 380 types.asSuper(bridge.owner.type, meth.owner) == null)
duke@1 381 // Don't diagnose the problem if it would already
duke@1 382 // have been reported in the superclass
duke@1 383 log.error(pos, "name.clash.same.erasure.no.override",
duke@1 384 bridge, bridge.location(origin.type, types),
duke@1 385 meth, meth.location(origin.type, types));
duke@1 386 }
duke@1 387 }
duke@1 388 }
duke@1 389 // where
mcimadamore@673 390 Filter<Symbol> overrideBridgeFilter = new Filter<Symbol>() {
mcimadamore@673 391 public boolean accepts(Symbol s) {
mcimadamore@673 392 return (s.flags() & (SYNTHETIC | OVERRIDE_BRIDGE)) != SYNTHETIC;
mcimadamore@673 393 }
mcimadamore@673 394 };
duke@1 395 /**
duke@1 396 * @param method The symbol for which a bridge might have to be added
duke@1 397 * @param impl The implementation of method
duke@1 398 * @param dest The type in which the bridge would go
duke@1 399 */
duke@1 400 private boolean isBridgeNeeded(MethodSymbol method,
duke@1 401 MethodSymbol impl,
duke@1 402 Type dest) {
duke@1 403 if (impl != method) {
duke@1 404 // If either method or impl have different erasures as
duke@1 405 // members of dest, a bridge is needed.
duke@1 406 Type method_erasure = method.erasure(types);
duke@1 407 if (!isSameMemberWhenErased(dest, method, method_erasure))
duke@1 408 return true;
duke@1 409 Type impl_erasure = impl.erasure(types);
duke@1 410 if (!isSameMemberWhenErased(dest, impl, impl_erasure))
duke@1 411 return true;
duke@1 412
duke@1 413 // If the erasure of the return type is different, a
duke@1 414 // bridge is needed.
duke@1 415 return !types.isSameType(impl_erasure.getReturnType(),
duke@1 416 method_erasure.getReturnType());
duke@1 417 } else {
duke@1 418 // method and impl are the same...
duke@1 419 if ((method.flags() & ABSTRACT) != 0) {
duke@1 420 // ...and abstract so a bridge is not needed.
duke@1 421 // Concrete subclasses will bridge as needed.
duke@1 422 return false;
duke@1 423 }
duke@1 424
duke@1 425 // The erasure of the return type is always the same
duke@1 426 // for the same symbol. Reducing the three tests in
duke@1 427 // the other branch to just one:
duke@1 428 return !isSameMemberWhenErased(dest, method, method.erasure(types));
duke@1 429 }
duke@1 430 }
duke@1 431 /**
duke@1 432 * Lookup the method as a member of the type. Compare the
duke@1 433 * erasures.
duke@1 434 * @param type the class where to look for the method
duke@1 435 * @param method the method to look for in class
duke@1 436 * @param erasure the erasure of method
duke@1 437 */
duke@1 438 private boolean isSameMemberWhenErased(Type type,
duke@1 439 MethodSymbol method,
duke@1 440 Type erasure) {
duke@1 441 return types.isSameType(erasure(types.memberType(type, method)),
duke@1 442 erasure);
duke@1 443 }
duke@1 444
duke@1 445 void addBridges(DiagnosticPosition pos,
duke@1 446 TypeSymbol i,
duke@1 447 ClassSymbol origin,
duke@1 448 ListBuffer<JCTree> bridges) {
duke@1 449 for (Scope.Entry e = i.members().elems; e != null; e = e.sibling)
duke@1 450 addBridgeIfNeeded(pos, e.sym, origin, bridges);
duke@1 451 for (List<Type> l = types.interfaces(i.type); l.nonEmpty(); l = l.tail)
duke@1 452 addBridges(pos, l.head.tsym, origin, bridges);
duke@1 453 }
duke@1 454
duke@1 455 /** Add all necessary bridges to some class appending them to list buffer.
duke@1 456 * @param pos The source code position to be used for the bridges.
duke@1 457 * @param origin The class in which the bridges go.
duke@1 458 * @param bridges The list buffer to which the bridges are added.
duke@1 459 */
duke@1 460 void addBridges(DiagnosticPosition pos, ClassSymbol origin, ListBuffer<JCTree> bridges) {
duke@1 461 Type st = types.supertype(origin.type);
jjg@1374 462 while (st.hasTag(CLASS)) {
duke@1 463 // if (isSpecialization(st))
duke@1 464 addBridges(pos, st.tsym, origin, bridges);
duke@1 465 st = types.supertype(st);
duke@1 466 }
duke@1 467 for (List<Type> l = types.interfaces(origin.type); l.nonEmpty(); l = l.tail)
duke@1 468 // if (isSpecialization(l.head))
duke@1 469 addBridges(pos, l.head.tsym, origin, bridges);
duke@1 470 }
duke@1 471
duke@1 472 /* ************************************************************************
duke@1 473 * Visitor methods
duke@1 474 *************************************************************************/
duke@1 475
duke@1 476 /** Visitor argument: proto-type.
duke@1 477 */
duke@1 478 private Type pt;
duke@1 479
duke@1 480 /** Visitor method: perform a type translation on tree.
duke@1 481 */
duke@1 482 public <T extends JCTree> T translate(T tree, Type pt) {
duke@1 483 Type prevPt = this.pt;
duke@1 484 try {
duke@1 485 this.pt = pt;
duke@1 486 return translate(tree);
duke@1 487 } finally {
duke@1 488 this.pt = prevPt;
duke@1 489 }
duke@1 490 }
duke@1 491
duke@1 492 /** Visitor method: perform a type translation on list of trees.
duke@1 493 */
duke@1 494 public <T extends JCTree> List<T> translate(List<T> trees, Type pt) {
duke@1 495 Type prevPt = this.pt;
duke@1 496 List<T> res;
duke@1 497 try {
duke@1 498 this.pt = pt;
duke@1 499 res = translate(trees);
duke@1 500 } finally {
duke@1 501 this.pt = prevPt;
duke@1 502 }
duke@1 503 return res;
duke@1 504 }
duke@1 505
duke@1 506 public void visitClassDef(JCClassDecl tree) {
duke@1 507 translateClass(tree.sym);
duke@1 508 result = tree;
duke@1 509 }
duke@1 510
rfield@1380 511 JCTree currentMethod = null;
duke@1 512 public void visitMethodDef(JCMethodDecl tree) {
rfield@1380 513 JCTree previousMethod = currentMethod;
duke@1 514 try {
duke@1 515 currentMethod = tree;
duke@1 516 tree.restype = translate(tree.restype, null);
duke@1 517 tree.typarams = List.nil();
duke@1 518 tree.params = translateVarDefs(tree.params);
jjg@1521 519 tree.recvparam = translate(tree.recvparam, null);
duke@1 520 tree.thrown = translate(tree.thrown, null);
duke@1 521 tree.body = translate(tree.body, tree.sym.erasure(types).getReturnType());
duke@1 522 tree.type = erasure(tree.type);
duke@1 523 result = tree;
duke@1 524 } finally {
duke@1 525 currentMethod = previousMethod;
duke@1 526 }
duke@1 527
duke@1 528 // Check that we do not introduce a name clash by erasing types.
duke@1 529 for (Scope.Entry e = tree.sym.owner.members().lookup(tree.name);
duke@1 530 e.sym != null;
duke@1 531 e = e.next()) {
duke@1 532 if (e.sym != tree.sym &&
duke@1 533 types.isSameType(erasure(e.sym.type), tree.type)) {
duke@1 534 log.error(tree.pos(),
duke@1 535 "name.clash.same.erasure", tree.sym,
duke@1 536 e.sym);
duke@1 537 return;
duke@1 538 }
duke@1 539 }
duke@1 540 }
duke@1 541
duke@1 542 public void visitVarDef(JCVariableDecl tree) {
duke@1 543 tree.vartype = translate(tree.vartype, null);
duke@1 544 tree.init = translate(tree.init, tree.sym.erasure(types));
duke@1 545 tree.type = erasure(tree.type);
duke@1 546 result = tree;
duke@1 547 }
duke@1 548
duke@1 549 public void visitDoLoop(JCDoWhileLoop tree) {
duke@1 550 tree.body = translate(tree.body);
duke@1 551 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 552 result = tree;
duke@1 553 }
duke@1 554
duke@1 555 public void visitWhileLoop(JCWhileLoop tree) {
duke@1 556 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 557 tree.body = translate(tree.body);
duke@1 558 result = tree;
duke@1 559 }
duke@1 560
duke@1 561 public void visitForLoop(JCForLoop tree) {
duke@1 562 tree.init = translate(tree.init, null);
duke@1 563 if (tree.cond != null)
duke@1 564 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 565 tree.step = translate(tree.step, null);
duke@1 566 tree.body = translate(tree.body);
duke@1 567 result = tree;
duke@1 568 }
duke@1 569
duke@1 570 public void visitForeachLoop(JCEnhancedForLoop tree) {
duke@1 571 tree.var = translate(tree.var, null);
duke@1 572 Type iterableType = tree.expr.type;
duke@1 573 tree.expr = translate(tree.expr, erasure(tree.expr.type));
duke@1 574 if (types.elemtype(tree.expr.type) == null)
duke@1 575 tree.expr.type = iterableType; // preserve type for Lower
duke@1 576 tree.body = translate(tree.body);
duke@1 577 result = tree;
duke@1 578 }
duke@1 579
rfield@1380 580 public void visitLambda(JCLambda tree) {
rfield@1380 581 JCTree prevMethod = currentMethod;
rfield@1380 582 try {
rfield@1380 583 currentMethod = null;
rfield@1380 584 tree.params = translate(tree.params);
rfield@1380 585 tree.body = translate(tree.body, null);
rfield@1380 586 tree.type = erasure(tree.type);
rfield@1380 587 result = tree;
rfield@1380 588 }
rfield@1380 589 finally {
rfield@1380 590 currentMethod = prevMethod;
rfield@1380 591 }
rfield@1380 592 }
rfield@1380 593
duke@1 594 public void visitSwitch(JCSwitch tree) {
duke@1 595 Type selsuper = types.supertype(tree.selector.type);
duke@1 596 boolean enumSwitch = selsuper != null &&
duke@1 597 selsuper.tsym == syms.enumSym;
duke@1 598 Type target = enumSwitch ? erasure(tree.selector.type) : syms.intType;
duke@1 599 tree.selector = translate(tree.selector, target);
duke@1 600 tree.cases = translateCases(tree.cases);
duke@1 601 result = tree;
duke@1 602 }
duke@1 603
duke@1 604 public void visitCase(JCCase tree) {
duke@1 605 tree.pat = translate(tree.pat, null);
duke@1 606 tree.stats = translate(tree.stats);
duke@1 607 result = tree;
duke@1 608 }
duke@1 609
duke@1 610 public void visitSynchronized(JCSynchronized tree) {
duke@1 611 tree.lock = translate(tree.lock, erasure(tree.lock.type));
duke@1 612 tree.body = translate(tree.body);
duke@1 613 result = tree;
duke@1 614 }
duke@1 615
darcy@609 616 public void visitTry(JCTry tree) {
darcy@609 617 tree.resources = translate(tree.resources, syms.autoCloseableType);
darcy@609 618 tree.body = translate(tree.body);
darcy@609 619 tree.catchers = translateCatchers(tree.catchers);
darcy@609 620 tree.finalizer = translate(tree.finalizer);
darcy@609 621 result = tree;
darcy@609 622 }
darcy@609 623
duke@1 624 public void visitConditional(JCConditional tree) {
duke@1 625 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 626 tree.truepart = translate(tree.truepart, erasure(tree.type));
duke@1 627 tree.falsepart = translate(tree.falsepart, erasure(tree.type));
duke@1 628 tree.type = erasure(tree.type);
mcimadamore@120 629 result = retype(tree, tree.type, pt);
duke@1 630 }
duke@1 631
duke@1 632 public void visitIf(JCIf tree) {
duke@1 633 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 634 tree.thenpart = translate(tree.thenpart);
duke@1 635 tree.elsepart = translate(tree.elsepart);
duke@1 636 result = tree;
duke@1 637 }
duke@1 638
duke@1 639 public void visitExec(JCExpressionStatement tree) {
duke@1 640 tree.expr = translate(tree.expr, null);
duke@1 641 result = tree;
duke@1 642 }
duke@1 643
duke@1 644 public void visitReturn(JCReturn tree) {
rfield@1380 645 tree.expr = translate(tree.expr, currentMethod != null ? types.erasure(currentMethod.type).getReturnType() : null);
duke@1 646 result = tree;
duke@1 647 }
duke@1 648
duke@1 649 public void visitThrow(JCThrow tree) {
duke@1 650 tree.expr = translate(tree.expr, erasure(tree.expr.type));
duke@1 651 result = tree;
duke@1 652 }
duke@1 653
duke@1 654 public void visitAssert(JCAssert tree) {
duke@1 655 tree.cond = translate(tree.cond, syms.booleanType);
duke@1 656 if (tree.detail != null)
duke@1 657 tree.detail = translate(tree.detail, erasure(tree.detail.type));
duke@1 658 result = tree;
duke@1 659 }
duke@1 660
duke@1 661 public void visitApply(JCMethodInvocation tree) {
duke@1 662 tree.meth = translate(tree.meth, null);
duke@1 663 Symbol meth = TreeInfo.symbol(tree.meth);
duke@1 664 Type mt = meth.erasure(types);
duke@1 665 List<Type> argtypes = mt.getParameterTypes();
duke@1 666 if (allowEnums &&
duke@1 667 meth.name==names.init &&
duke@1 668 meth.owner == syms.enumSym)
duke@1 669 argtypes = argtypes.tail.tail;
duke@1 670 if (tree.varargsElement != null)
duke@1 671 tree.varargsElement = types.erasure(tree.varargsElement);
duke@1 672 else
jjg@816 673 Assert.check(tree.args.length() == argtypes.length());
duke@1 674 tree.args = translateArgs(tree.args, argtypes, tree.varargsElement);
duke@1 675
rfield@1380 676 tree.type = types.erasure(tree.type);
duke@1 677 // Insert casts of method invocation results as needed.
duke@1 678 result = retype(tree, mt.getReturnType(), pt);
duke@1 679 }
duke@1 680
duke@1 681 public void visitNewClass(JCNewClass tree) {
duke@1 682 if (tree.encl != null)
duke@1 683 tree.encl = translate(tree.encl, erasure(tree.encl.type));
duke@1 684 tree.clazz = translate(tree.clazz, null);
duke@1 685 if (tree.varargsElement != null)
duke@1 686 tree.varargsElement = types.erasure(tree.varargsElement);
duke@1 687 tree.args = translateArgs(
duke@1 688 tree.args, tree.constructor.erasure(types).getParameterTypes(), tree.varargsElement);
duke@1 689 tree.def = translate(tree.def, null);
rfield@1380 690 if (tree.constructorType != null)
rfield@1380 691 tree.constructorType = erasure(tree.constructorType);
duke@1 692 tree.type = erasure(tree.type);
duke@1 693 result = tree;
duke@1 694 }
duke@1 695
duke@1 696 public void visitNewArray(JCNewArray tree) {
duke@1 697 tree.elemtype = translate(tree.elemtype, null);
duke@1 698 translate(tree.dims, syms.intType);
jjg@511 699 if (tree.type != null) {
jjg@511 700 tree.elems = translate(tree.elems, erasure(types.elemtype(tree.type)));
jjg@511 701 tree.type = erasure(tree.type);
jjg@511 702 } else {
jjg@511 703 tree.elems = translate(tree.elems, null);
jjg@511 704 }
duke@1 705
duke@1 706 result = tree;
duke@1 707 }
duke@1 708
duke@1 709 public void visitParens(JCParens tree) {
duke@1 710 tree.expr = translate(tree.expr, pt);
duke@1 711 tree.type = erasure(tree.type);
duke@1 712 result = tree;
duke@1 713 }
duke@1 714
duke@1 715 public void visitAssign(JCAssign tree) {
duke@1 716 tree.lhs = translate(tree.lhs, null);
duke@1 717 tree.rhs = translate(tree.rhs, erasure(tree.lhs.type));
vromero@1785 718 tree.type = erasure(tree.lhs.type);
vromero@1785 719 result = retype(tree, tree.type, pt);
duke@1 720 }
duke@1 721
duke@1 722 public void visitAssignop(JCAssignOp tree) {
mcimadamore@360 723 tree.lhs = translate(tree.lhs, null);
mcimadamore@133 724 tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head);
duke@1 725 tree.type = erasure(tree.type);
duke@1 726 result = tree;
duke@1 727 }
duke@1 728
duke@1 729 public void visitUnary(JCUnary tree) {
duke@1 730 tree.arg = translate(tree.arg, tree.operator.type.getParameterTypes().head);
duke@1 731 result = tree;
duke@1 732 }
duke@1 733
duke@1 734 public void visitBinary(JCBinary tree) {
duke@1 735 tree.lhs = translate(tree.lhs, tree.operator.type.getParameterTypes().head);
duke@1 736 tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head);
duke@1 737 result = tree;
duke@1 738 }
duke@1 739
duke@1 740 public void visitTypeCast(JCTypeCast tree) {
duke@1 741 tree.clazz = translate(tree.clazz, null);
mcimadamore@1696 742 Type originalTarget = tree.type;
duke@1 743 tree.type = erasure(tree.type);
duke@1 744 tree.expr = translate(tree.expr, tree.type);
mcimadamore@1696 745 if (originalTarget.isCompound()) {
mcimadamore@1696 746 Type.IntersectionClassType ict = (Type.IntersectionClassType)originalTarget;
mcimadamore@1696 747 for (Type c : ict.getExplicitComponents()) {
mcimadamore@1696 748 Type ec = erasure(c);
mcimadamore@1696 749 if (!types.isSameType(ec, tree.type)) {
mcimadamore@1696 750 tree.expr = coerce(tree.expr, ec);
mcimadamore@1696 751 }
mcimadamore@1696 752 }
mcimadamore@1696 753 }
duke@1 754 result = tree;
duke@1 755 }
duke@1 756
duke@1 757 public void visitTypeTest(JCInstanceOf tree) {
duke@1 758 tree.expr = translate(tree.expr, null);
duke@1 759 tree.clazz = translate(tree.clazz, null);
duke@1 760 result = tree;
duke@1 761 }
duke@1 762
duke@1 763 public void visitIndexed(JCArrayAccess tree) {
duke@1 764 tree.indexed = translate(tree.indexed, erasure(tree.indexed.type));
duke@1 765 tree.index = translate(tree.index, syms.intType);
duke@1 766
duke@1 767 // Insert casts of indexed expressions as needed.
duke@1 768 result = retype(tree, types.elemtype(tree.indexed.type), pt);
duke@1 769 }
duke@1 770
duke@1 771 // There ought to be nothing to rewrite here;
duke@1 772 // we don't generate code.
duke@1 773 public void visitAnnotation(JCAnnotation tree) {
duke@1 774 result = tree;
duke@1 775 }
duke@1 776
duke@1 777 public void visitIdent(JCIdent tree) {
duke@1 778 Type et = tree.sym.erasure(types);
duke@1 779
duke@1 780 // Map type variables to their bounds.
jjg@1374 781 if (tree.sym.kind == TYP && tree.sym.type.hasTag(TYPEVAR)) {
duke@1 782 result = make.at(tree.pos).Type(et);
duke@1 783 } else
duke@1 784 // Map constants expressions to themselves.
duke@1 785 if (tree.type.constValue() != null) {
duke@1 786 result = tree;
duke@1 787 }
duke@1 788 // Insert casts of variable uses as needed.
duke@1 789 else if (tree.sym.kind == VAR) {
duke@1 790 result = retype(tree, et, pt);
duke@1 791 }
duke@1 792 else {
duke@1 793 tree.type = erasure(tree.type);
duke@1 794 result = tree;
duke@1 795 }
duke@1 796 }
duke@1 797
duke@1 798 public void visitSelect(JCFieldAccess tree) {
duke@1 799 Type t = tree.selected.type;
jjg@1374 800 while (t.hasTag(TYPEVAR))
mcimadamore@23 801 t = t.getUpperBound();
mcimadamore@23 802 if (t.isCompound()) {
duke@1 803 if ((tree.sym.flags() & IPROXY) != 0) {
duke@1 804 tree.sym = ((MethodSymbol)tree.sym).
duke@1 805 implemented((TypeSymbol)tree.sym.owner, types);
duke@1 806 }
mcimadamore@769 807 tree.selected = coerce(
mcimadamore@23 808 translate(tree.selected, erasure(tree.selected.type)),
duke@1 809 erasure(tree.sym.owner.type));
duke@1 810 } else
duke@1 811 tree.selected = translate(tree.selected, erasure(t));
duke@1 812
duke@1 813 // Map constants expressions to themselves.
duke@1 814 if (tree.type.constValue() != null) {
duke@1 815 result = tree;
duke@1 816 }
duke@1 817 // Insert casts of variable uses as needed.
duke@1 818 else if (tree.sym.kind == VAR) {
duke@1 819 result = retype(tree, tree.sym.erasure(types), pt);
duke@1 820 }
duke@1 821 else {
duke@1 822 tree.type = erasure(tree.type);
duke@1 823 result = tree;
duke@1 824 }
duke@1 825 }
duke@1 826
rfield@1380 827 public void visitReference(JCMemberReference tree) {
rfield@1380 828 tree.expr = translate(tree.expr, null);
rfield@1380 829 tree.type = erasure(tree.type);
rfield@1380 830 result = tree;
rfield@1380 831 }
rfield@1380 832
duke@1 833 public void visitTypeArray(JCArrayTypeTree tree) {
duke@1 834 tree.elemtype = translate(tree.elemtype, null);
duke@1 835 tree.type = erasure(tree.type);
duke@1 836 result = tree;
duke@1 837 }
duke@1 838
duke@1 839 /** Visitor method for parameterized types.
duke@1 840 */
duke@1 841 public void visitTypeApply(JCTypeApply tree) {
jjg@308 842 JCTree clazz = translate(tree.clazz, null);
jjg@308 843 result = clazz;
duke@1 844 }
duke@1 845
mcimadamore@1436 846 public void visitTypeIntersection(JCTypeIntersection tree) {
mcimadamore@1436 847 tree.bounds = translate(tree.bounds, null);
mcimadamore@1436 848 tree.type = erasure(tree.type);
mcimadamore@1436 849 result = tree;
mcimadamore@1436 850 }
mcimadamore@1436 851
duke@1 852 /**************************************************************************
duke@1 853 * utility methods
duke@1 854 *************************************************************************/
duke@1 855
duke@1 856 private Type erasure(Type t) {
duke@1 857 return types.erasure(t);
duke@1 858 }
duke@1 859
mcimadamore@673 860 private boolean boundsRestricted(ClassSymbol c) {
mcimadamore@673 861 Type st = types.supertype(c.type);
mcimadamore@673 862 if (st.isParameterized()) {
mcimadamore@673 863 List<Type> actuals = st.allparams();
mcimadamore@673 864 List<Type> formals = st.tsym.type.allparams();
mcimadamore@673 865 while (!actuals.isEmpty() && !formals.isEmpty()) {
mcimadamore@673 866 Type actual = actuals.head;
mcimadamore@673 867 Type formal = formals.head;
mcimadamore@673 868
mcimadamore@673 869 if (!types.isSameType(types.erasure(actual),
mcimadamore@673 870 types.erasure(formal)))
mcimadamore@673 871 return true;
mcimadamore@673 872
mcimadamore@673 873 actuals = actuals.tail;
mcimadamore@673 874 formals = formals.tail;
mcimadamore@673 875 }
mcimadamore@673 876 }
mcimadamore@673 877 return false;
mcimadamore@673 878 }
mcimadamore@673 879
mcimadamore@673 880 private List<JCTree> addOverrideBridgesIfNeeded(DiagnosticPosition pos,
mcimadamore@673 881 final ClassSymbol c) {
mcimadamore@673 882 ListBuffer<JCTree> buf = ListBuffer.lb();
mcimadamore@673 883 if (c.isInterface() || !boundsRestricted(c))
mcimadamore@673 884 return buf.toList();
mcimadamore@673 885 Type t = types.supertype(c.type);
mcimadamore@673 886 Scope s = t.tsym.members();
mcimadamore@673 887 if (s.elems != null) {
mcimadamore@673 888 for (Symbol sym : s.getElements(new NeedsOverridBridgeFilter(c))) {
mcimadamore@673 889
mcimadamore@673 890 MethodSymbol m = (MethodSymbol)sym;
mcimadamore@673 891 MethodSymbol member = (MethodSymbol)m.asMemberOf(c.type, types);
mcimadamore@673 892 MethodSymbol impl = m.implementation(c, types, false);
mcimadamore@673 893
mcimadamore@673 894 if ((impl == null || impl.owner != c) &&
mcimadamore@673 895 !types.isSameType(member.erasure(types), m.erasure(types))) {
mcimadamore@673 896 addOverrideBridges(pos, m, member, c, buf);
mcimadamore@673 897 }
mcimadamore@673 898 }
mcimadamore@673 899 }
mcimadamore@673 900 return buf.toList();
mcimadamore@673 901 }
mcimadamore@673 902 // where
mcimadamore@673 903 class NeedsOverridBridgeFilter implements Filter<Symbol> {
mcimadamore@673 904
mcimadamore@673 905 ClassSymbol c;
mcimadamore@673 906
mcimadamore@673 907 NeedsOverridBridgeFilter(ClassSymbol c) {
mcimadamore@673 908 this.c = c;
mcimadamore@673 909 }
mcimadamore@673 910 public boolean accepts(Symbol s) {
mcimadamore@673 911 return s.kind == MTH &&
mcimadamore@673 912 !s.isConstructor() &&
mcimadamore@673 913 s.isInheritedIn(c, types) &&
mcimadamore@673 914 (s.flags() & FINAL) == 0 &&
mcimadamore@673 915 (s.flags() & (SYNTHETIC | OVERRIDE_BRIDGE)) != SYNTHETIC;
mcimadamore@673 916 }
mcimadamore@673 917 }
mcimadamore@673 918
mcimadamore@673 919 private void addOverrideBridges(DiagnosticPosition pos,
mcimadamore@673 920 MethodSymbol impl,
mcimadamore@673 921 MethodSymbol member,
mcimadamore@673 922 ClassSymbol c,
mcimadamore@673 923 ListBuffer<JCTree> bridges) {
mcimadamore@673 924 Type implErasure = impl.erasure(types);
mcimadamore@673 925 long flags = (impl.flags() & AccessFlags) | SYNTHETIC | BRIDGE | OVERRIDE_BRIDGE;
mcimadamore@673 926 member = new MethodSymbol(flags, member.name, member.type, c);
mcimadamore@673 927 JCMethodDecl md = make.MethodDef(member, null);
mcimadamore@673 928 JCExpression receiver = make.Super(types.supertype(c.type).tsym.erasure(types), c);
mcimadamore@673 929 Type calltype = erasure(impl.type.getReturnType());
mcimadamore@673 930 JCExpression call =
mcimadamore@673 931 make.Apply(null,
mcimadamore@673 932 make.Select(receiver, impl).setType(calltype),
mcimadamore@673 933 translateArgs(make.Idents(md.params),
mcimadamore@673 934 implErasure.getParameterTypes(), null))
mcimadamore@673 935 .setType(calltype);
jjg@1374 936 JCStatement stat = (member.getReturnType().hasTag(VOID))
mcimadamore@673 937 ? make.Exec(call)
mcimadamore@673 938 : make.Return(coerce(call, member.erasure(types).getReturnType()));
mcimadamore@673 939 md.body = make.Block(0, List.of(stat));
mcimadamore@673 940 c.members().enter(member);
mcimadamore@673 941 bridges.append(md);
mcimadamore@673 942 }
mcimadamore@673 943
duke@1 944 /**************************************************************************
duke@1 945 * main method
duke@1 946 *************************************************************************/
duke@1 947
duke@1 948 private Env<AttrContext> env;
duke@1 949
vromero@1690 950 private static final String statePreviousToFlowAssertMsg =
vromero@1690 951 "The current compile state [%s] of class %s is previous to FLOW";
vromero@1690 952
duke@1 953 void translateClass(ClassSymbol c) {
duke@1 954 Type st = types.supertype(c.type);
duke@1 955 // process superclass before derived
vromero@1690 956 if (st.hasTag(CLASS)) {
duke@1 957 translateClass((ClassSymbol)st.tsym);
vromero@1690 958 }
duke@1 959
duke@1 960 Env<AttrContext> myEnv = enter.typeEnvs.remove(c);
vromero@1690 961 if (myEnv == null) {
duke@1 962 return;
vromero@1690 963 }
vromero@1690 964
vromero@1690 965 /* The two assertions below are set for early detection of any attempt
vromero@1690 966 * to translate a class that:
vromero@1690 967 *
vromero@1690 968 * 1) has no compile state being it the most outer class.
vromero@1690 969 * We accept this condition for inner classes.
vromero@1690 970 *
vromero@1690 971 * 2) has a compile state which is previous to Flow state.
vromero@1690 972 */
vromero@1690 973 boolean envHasCompState = compileStates.get(myEnv) != null;
vromero@1690 974 if (!envHasCompState && c.outermostClass() == c) {
vromero@1690 975 Assert.error("No info for outermost class: " + myEnv.enclClass.sym);
vromero@1690 976 }
vromero@1690 977
vromero@1690 978 if (envHasCompState &&
vromero@1690 979 CompileState.FLOW.isAfter(compileStates.get(myEnv))) {
vromero@1690 980 Assert.error(String.format(statePreviousToFlowAssertMsg,
vromero@1690 981 compileStates.get(myEnv), myEnv.enclClass.sym));
vromero@1690 982 }
vromero@1690 983
duke@1 984 Env<AttrContext> oldEnv = env;
duke@1 985 try {
duke@1 986 env = myEnv;
duke@1 987 // class has not been translated yet
duke@1 988
duke@1 989 TreeMaker savedMake = make;
duke@1 990 Type savedPt = pt;
duke@1 991 make = make.forToplevel(env.toplevel);
duke@1 992 pt = null;
duke@1 993 try {
duke@1 994 JCClassDecl tree = (JCClassDecl) env.tree;
duke@1 995 tree.typarams = List.nil();
duke@1 996 super.visitClassDef(tree);
duke@1 997 make.at(tree.pos);
duke@1 998 if (addBridges) {
duke@1 999 ListBuffer<JCTree> bridges = new ListBuffer<JCTree>();
mcimadamore@730 1000 if (false) //see CR: 6996415
mcimadamore@730 1001 bridges.appendList(addOverrideBridgesIfNeeded(tree, c));
duke@1 1002 if ((tree.sym.flags() & INTERFACE) == 0)
duke@1 1003 addBridges(tree.pos(), tree.sym, bridges);
duke@1 1004 tree.defs = bridges.toList().prependList(tree.defs);
duke@1 1005 }
duke@1 1006 tree.type = erasure(tree.type);
duke@1 1007 } finally {
duke@1 1008 make = savedMake;
duke@1 1009 pt = savedPt;
duke@1 1010 }
duke@1 1011 } finally {
duke@1 1012 env = oldEnv;
duke@1 1013 }
duke@1 1014 }
duke@1 1015
duke@1 1016 /** Translate a toplevel class definition.
duke@1 1017 * @param cdef The definition to be translated.
duke@1 1018 */
duke@1 1019 public JCTree translateTopLevelClass(JCTree cdef, TreeMaker make) {
duke@1 1020 // note that this method does NOT support recursion.
duke@1 1021 this.make = make;
duke@1 1022 pt = null;
duke@1 1023 return translate(cdef, null);
duke@1 1024 }
duke@1 1025 }

mercurial