duke@1: /*
jjg@815: * Copyright (c) 1999, 2011, Oracle and/or its affiliates. All rights reserved.
duke@1: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1: *
duke@1: * This code is free software; you can redistribute it and/or modify it
duke@1: * under the terms of the GNU General Public License version 2 only, as
ohair@554: * published by the Free Software Foundation. Oracle designates this
duke@1: * particular file as subject to the "Classpath" exception as provided
ohair@554: * by Oracle in the LICENSE file that accompanied this code.
duke@1: *
duke@1: * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1: * version 2 for more details (a copy is included in the LICENSE file that
duke@1: * accompanied this code).
duke@1: *
duke@1: * You should have received a copy of the GNU General Public License version
duke@1: * 2 along with this work; if not, write to the Free Software Foundation,
duke@1: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1: *
ohair@554: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
ohair@554: * or visit www.oracle.com if you need additional information or have any
ohair@554: * questions.
duke@1: */
duke@1:
duke@1: package com.sun.tools.javac.comp;
duke@1:
duke@1: import java.util.*;
duke@1:
duke@1: import com.sun.tools.javac.code.*;
duke@1: import com.sun.tools.javac.jvm.*;
jjg@657: import com.sun.tools.javac.main.RecognizedOptions.PkgInfo;
duke@1: import com.sun.tools.javac.tree.*;
duke@1: import com.sun.tools.javac.util.*;
duke@1: import com.sun.tools.javac.util.JCDiagnostic.DiagnosticPosition;
duke@1: import com.sun.tools.javac.util.List;
duke@1:
duke@1: import com.sun.tools.javac.code.Symbol.*;
duke@1: import com.sun.tools.javac.tree.JCTree.*;
duke@1: import com.sun.tools.javac.code.Type.*;
duke@1:
duke@1: import com.sun.tools.javac.jvm.Target;
duke@1:
duke@1: import static com.sun.tools.javac.code.Flags.*;
duke@1: import static com.sun.tools.javac.code.Kinds.*;
duke@1: import static com.sun.tools.javac.code.TypeTags.*;
duke@1: import static com.sun.tools.javac.jvm.ByteCodes.*;
duke@1:
duke@1: /** This pass translates away some syntactic sugar: inner classes,
duke@1: * class literals, assertions, foreach loops, etc.
duke@1: *
jjg@581: *
This is NOT part of any supported API.
jjg@581: * If you write code that depends on this, you do so at your own risk.
duke@1: * This code and its internal interfaces are subject to change or
duke@1: * deletion without notice.
duke@1: */
duke@1: public class Lower extends TreeTranslator {
duke@1: protected static final Context.Key lowerKey =
duke@1: new Context.Key();
duke@1:
duke@1: public static Lower instance(Context context) {
duke@1: Lower instance = context.get(lowerKey);
duke@1: if (instance == null)
duke@1: instance = new Lower(context);
duke@1: return instance;
duke@1: }
duke@1:
jjg@113: private Names names;
duke@1: private Log log;
duke@1: private Symtab syms;
mcimadamore@688: private Scope.ScopeCounter scopeCounter;
duke@1: private Resolve rs;
duke@1: private Check chk;
duke@1: private Attr attr;
duke@1: private TreeMaker make;
duke@1: private DiagnosticPosition make_pos;
duke@1: private ClassWriter writer;
duke@1: private ClassReader reader;
duke@1: private ConstFold cfolder;
duke@1: private Target target;
duke@1: private Source source;
duke@1: private boolean allowEnums;
duke@1: private final Name dollarAssertionsDisabled;
duke@1: private final Name classDollar;
duke@1: private Types types;
duke@1: private boolean debugLower;
jjg@657: private PkgInfo pkginfoOpt;
duke@1:
duke@1: protected Lower(Context context) {
duke@1: context.put(lowerKey, this);
jjg@113: names = Names.instance(context);
duke@1: log = Log.instance(context);
duke@1: syms = Symtab.instance(context);
mcimadamore@688: scopeCounter = Scope.ScopeCounter.instance(context);
duke@1: rs = Resolve.instance(context);
duke@1: chk = Check.instance(context);
duke@1: attr = Attr.instance(context);
duke@1: make = TreeMaker.instance(context);
duke@1: writer = ClassWriter.instance(context);
duke@1: reader = ClassReader.instance(context);
duke@1: cfolder = ConstFold.instance(context);
duke@1: target = Target.instance(context);
duke@1: source = Source.instance(context);
duke@1: allowEnums = source.allowEnums();
duke@1: dollarAssertionsDisabled = names.
duke@1: fromString(target.syntheticNameChar() + "assertionsDisabled");
duke@1: classDollar = names.
duke@1: fromString("class" + target.syntheticNameChar());
duke@1:
duke@1: types = Types.instance(context);
duke@1: Options options = Options.instance(context);
jjg@700: debugLower = options.isSet("debuglower");
jjg@657: pkginfoOpt = PkgInfo.get(options);
duke@1: }
duke@1:
duke@1: /** The currently enclosing class.
duke@1: */
duke@1: ClassSymbol currentClass;
duke@1:
duke@1: /** A queue of all translated classes.
duke@1: */
duke@1: ListBuffer translated;
duke@1:
duke@1: /** Environment for symbol lookup, set by translateTopLevelClass.
duke@1: */
duke@1: Env attrEnv;
duke@1:
duke@1: /** A hash table mapping syntax trees to their ending source positions.
duke@1: */
duke@1: Map endPositions;
duke@1:
duke@1: /**************************************************************************
duke@1: * Global mappings
duke@1: *************************************************************************/
duke@1:
duke@1: /** A hash table mapping local classes to their definitions.
duke@1: */
duke@1: Map classdefs;
duke@1:
duke@1: /** A hash table mapping virtual accessed symbols in outer subclasses
duke@1: * to the actually referred symbol in superclasses.
duke@1: */
duke@1: Map actualSymbols;
duke@1:
duke@1: /** The current method definition.
duke@1: */
duke@1: JCMethodDecl currentMethodDef;
duke@1:
duke@1: /** The current method symbol.
duke@1: */
duke@1: MethodSymbol currentMethodSym;
duke@1:
duke@1: /** The currently enclosing outermost class definition.
duke@1: */
duke@1: JCClassDecl outermostClassDef;
duke@1:
duke@1: /** The currently enclosing outermost member definition.
duke@1: */
duke@1: JCTree outermostMemberDef;
duke@1:
duke@1: /** A navigator class for assembling a mapping from local class symbols
duke@1: * to class definition trees.
duke@1: * There is only one case; all other cases simply traverse down the tree.
duke@1: */
duke@1: class ClassMap extends TreeScanner {
duke@1:
duke@1: /** All encountered class defs are entered into classdefs table.
duke@1: */
duke@1: public void visitClassDef(JCClassDecl tree) {
duke@1: classdefs.put(tree.sym, tree);
duke@1: super.visitClassDef(tree);
duke@1: }
duke@1: }
duke@1: ClassMap classMap = new ClassMap();
duke@1:
duke@1: /** Map a class symbol to its definition.
duke@1: * @param c The class symbol of which we want to determine the definition.
duke@1: */
duke@1: JCClassDecl classDef(ClassSymbol c) {
duke@1: // First lookup the class in the classdefs table.
duke@1: JCClassDecl def = classdefs.get(c);
duke@1: if (def == null && outermostMemberDef != null) {
duke@1: // If this fails, traverse outermost member definition, entering all
duke@1: // local classes into classdefs, and try again.
duke@1: classMap.scan(outermostMemberDef);
duke@1: def = classdefs.get(c);
duke@1: }
duke@1: if (def == null) {
duke@1: // If this fails, traverse outermost class definition, entering all
duke@1: // local classes into classdefs, and try again.
duke@1: classMap.scan(outermostClassDef);
duke@1: def = classdefs.get(c);
duke@1: }
duke@1: return def;
duke@1: }
duke@1:
duke@1: /** A hash table mapping class symbols to lists of free variables.
duke@1: * accessed by them. Only free variables of the method immediately containing
duke@1: * a class are associated with that class.
duke@1: */
duke@1: Map> freevarCache;
duke@1:
duke@1: /** A navigator class for collecting the free variables accessed
duke@1: * from a local class.
duke@1: * There is only one case; all other cases simply traverse down the tree.
duke@1: */
duke@1: class FreeVarCollector extends TreeScanner {
duke@1:
duke@1: /** The owner of the local class.
duke@1: */
duke@1: Symbol owner;
duke@1:
duke@1: /** The local class.
duke@1: */
duke@1: ClassSymbol clazz;
duke@1:
duke@1: /** The list of owner's variables accessed from within the local class,
duke@1: * without any duplicates.
duke@1: */
duke@1: List fvs;
duke@1:
duke@1: FreeVarCollector(ClassSymbol clazz) {
duke@1: this.clazz = clazz;
duke@1: this.owner = clazz.owner;
duke@1: this.fvs = List.nil();
duke@1: }
duke@1:
duke@1: /** Add free variable to fvs list unless it is already there.
duke@1: */
duke@1: private void addFreeVar(VarSymbol v) {
duke@1: for (List l = fvs; l.nonEmpty(); l = l.tail)
duke@1: if (l.head == v) return;
duke@1: fvs = fvs.prepend(v);
duke@1: }
duke@1:
duke@1: /** Add all free variables of class c to fvs list
duke@1: * unless they are already there.
duke@1: */
duke@1: private void addFreeVars(ClassSymbol c) {
duke@1: List fvs = freevarCache.get(c);
duke@1: if (fvs != null) {
duke@1: for (List l = fvs; l.nonEmpty(); l = l.tail) {
duke@1: addFreeVar(l.head);
duke@1: }
duke@1: }
duke@1: }
duke@1:
duke@1: /** If tree refers to a variable in owner of local class, add it to
duke@1: * free variables list.
duke@1: */
duke@1: public void visitIdent(JCIdent tree) {
duke@1: result = tree;
duke@1: visitSymbol(tree.sym);
duke@1: }
duke@1: // where
duke@1: private void visitSymbol(Symbol _sym) {
duke@1: Symbol sym = _sym;
duke@1: if (sym.kind == VAR || sym.kind == MTH) {
duke@1: while (sym != null && sym.owner != owner)
duke@1: sym = proxies.lookup(proxyName(sym.name)).sym;
duke@1: if (sym != null && sym.owner == owner) {
duke@1: VarSymbol v = (VarSymbol)sym;
duke@1: if (v.getConstValue() == null) {
duke@1: addFreeVar(v);
duke@1: }
duke@1: } else {
duke@1: if (outerThisStack.head != null &&
duke@1: outerThisStack.head != _sym)
duke@1: visitSymbol(outerThisStack.head);
duke@1: }
duke@1: }
duke@1: }
duke@1:
duke@1: /** If tree refers to a class instance creation expression
duke@1: * add all free variables of the freshly created class.
duke@1: */
duke@1: public void visitNewClass(JCNewClass tree) {
duke@1: ClassSymbol c = (ClassSymbol)tree.constructor.owner;
duke@1: addFreeVars(c);
duke@1: if (tree.encl == null &&
duke@1: c.hasOuterInstance() &&
duke@1: outerThisStack.head != null)
duke@1: visitSymbol(outerThisStack.head);
duke@1: super.visitNewClass(tree);
duke@1: }
duke@1:
duke@1: /** If tree refers to a qualified this or super expression
duke@1: * for anything but the current class, add the outer this
duke@1: * stack as a free variable.
duke@1: */
duke@1: public void visitSelect(JCFieldAccess tree) {
duke@1: if ((tree.name == names._this || tree.name == names._super) &&
duke@1: tree.selected.type.tsym != clazz &&
duke@1: outerThisStack.head != null)
duke@1: visitSymbol(outerThisStack.head);
duke@1: super.visitSelect(tree);
duke@1: }
duke@1:
duke@1: /** If tree refers to a superclass constructor call,
duke@1: * add all free variables of the superclass.
duke@1: */
duke@1: public void visitApply(JCMethodInvocation tree) {
duke@1: if (TreeInfo.name(tree.meth) == names._super) {
duke@1: addFreeVars((ClassSymbol) TreeInfo.symbol(tree.meth).owner);
duke@1: Symbol constructor = TreeInfo.symbol(tree.meth);
duke@1: ClassSymbol c = (ClassSymbol)constructor.owner;
duke@1: if (c.hasOuterInstance() &&
duke@1: tree.meth.getTag() != JCTree.SELECT &&
duke@1: outerThisStack.head != null)
duke@1: visitSymbol(outerThisStack.head);
duke@1: }
duke@1: super.visitApply(tree);
duke@1: }
duke@1: }
duke@1:
duke@1: /** Return the variables accessed from within a local class, which
duke@1: * are declared in the local class' owner.
duke@1: * (in reverse order of first access).
duke@1: */
duke@1: List freevars(ClassSymbol c) {
duke@1: if ((c.owner.kind & (VAR | MTH)) != 0) {
duke@1: List fvs = freevarCache.get(c);
duke@1: if (fvs == null) {
duke@1: FreeVarCollector collector = new FreeVarCollector(c);
duke@1: collector.scan(classDef(c));
duke@1: fvs = collector.fvs;
duke@1: freevarCache.put(c, fvs);
duke@1: }
duke@1: return fvs;
duke@1: } else {
duke@1: return List.nil();
duke@1: }
duke@1: }
duke@1:
duke@1: Map enumSwitchMap = new LinkedHashMap();
duke@1:
duke@1: EnumMapping mapForEnum(DiagnosticPosition pos, TypeSymbol enumClass) {
duke@1: EnumMapping map = enumSwitchMap.get(enumClass);
duke@1: if (map == null)
duke@1: enumSwitchMap.put(enumClass, map = new EnumMapping(pos, enumClass));
duke@1: return map;
duke@1: }
duke@1:
duke@1: /** This map gives a translation table to be used for enum
duke@1: * switches.
duke@1: *
duke@1: * For each enum that appears as the type of a switch
duke@1: * expression, we maintain an EnumMapping to assist in the
duke@1: * translation, as exemplified by the following example:
duke@1: *
duke@1: *
we translate
duke@1: *
duke@1: * switch(colorExpression) {
duke@1: * case red: stmt1;
duke@1: * case green: stmt2;
duke@1: * }
duke@1: *
duke@1: * into
duke@1: *
duke@1: * switch(Outer$0.$EnumMap$Color[colorExpression.ordinal()]) {
duke@1: * case 1: stmt1;
duke@1: * case 2: stmt2
duke@1: * }
duke@1: *
darcy@430: * with the auxiliary table initialized as follows:
duke@1: *
duke@1: * class Outer$0 {
duke@1: * synthetic final int[] $EnumMap$Color = new int[Color.values().length];
duke@1: * static {
duke@1: * try { $EnumMap$Color[red.ordinal()] = 1; } catch (NoSuchFieldError ex) {}
duke@1: * try { $EnumMap$Color[green.ordinal()] = 2; } catch (NoSuchFieldError ex) {}
duke@1: * }
duke@1: * }
duke@1: *
duke@1: * class EnumMapping provides mapping data and support methods for this translation.
duke@1: */
duke@1: class EnumMapping {
duke@1: EnumMapping(DiagnosticPosition pos, TypeSymbol forEnum) {
duke@1: this.forEnum = forEnum;
duke@1: this.values = new LinkedHashMap();
duke@1: this.pos = pos;
duke@1: Name varName = names
duke@1: .fromString(target.syntheticNameChar() +
duke@1: "SwitchMap" +
duke@1: target.syntheticNameChar() +
duke@1: writer.xClassName(forEnum.type).toString()
duke@1: .replace('/', '.')
duke@1: .replace('.', target.syntheticNameChar()));
duke@1: ClassSymbol outerCacheClass = outerCacheClass();
duke@1: this.mapVar = new VarSymbol(STATIC | SYNTHETIC | FINAL,
duke@1: varName,
duke@1: new ArrayType(syms.intType, syms.arrayClass),
duke@1: outerCacheClass);
duke@1: enterSynthetic(pos, mapVar, outerCacheClass.members());
duke@1: }
duke@1:
duke@1: DiagnosticPosition pos = null;
duke@1:
duke@1: // the next value to use
duke@1: int next = 1; // 0 (unused map elements) go to the default label
duke@1:
duke@1: // the enum for which this is a map
duke@1: final TypeSymbol forEnum;
duke@1:
duke@1: // the field containing the map
duke@1: final VarSymbol mapVar;
duke@1:
duke@1: // the mapped values
duke@1: final Map values;
duke@1:
duke@1: JCLiteral forConstant(VarSymbol v) {
duke@1: Integer result = values.get(v);
duke@1: if (result == null)
duke@1: values.put(v, result = next++);
duke@1: return make.Literal(result);
duke@1: }
duke@1:
duke@1: // generate the field initializer for the map
duke@1: void translate() {
duke@1: make.at(pos.getStartPosition());
duke@1: JCClassDecl owner = classDef((ClassSymbol)mapVar.owner);
duke@1:
duke@1: // synthetic static final int[] $SwitchMap$Color = new int[Color.values().length];
duke@1: MethodSymbol valuesMethod = lookupMethod(pos,
duke@1: names.values,
duke@1: forEnum.type,
duke@1: List.nil());
duke@1: JCExpression size = make // Color.values().length
duke@1: .Select(make.App(make.QualIdent(valuesMethod)),
duke@1: syms.lengthVar);
duke@1: JCExpression mapVarInit = make
duke@1: .NewArray(make.Type(syms.intType), List.of(size), null)
duke@1: .setType(new ArrayType(syms.intType, syms.arrayClass));
duke@1:
duke@1: // try { $SwitchMap$Color[red.ordinal()] = 1; } catch (java.lang.NoSuchFieldError ex) {}
duke@1: ListBuffer stmts = new ListBuffer();
duke@1: Symbol ordinalMethod = lookupMethod(pos,
duke@1: names.ordinal,
duke@1: forEnum.type,
duke@1: List.nil());
duke@1: List catcher = List.nil()
duke@1: .prepend(make.Catch(make.VarDef(new VarSymbol(PARAMETER, names.ex,
duke@1: syms.noSuchFieldErrorType,
duke@1: syms.noSymbol),
duke@1: null),
duke@1: make.Block(0, List.nil())));
duke@1: for (Map.Entry e : values.entrySet()) {
duke@1: VarSymbol enumerator = e.getKey();
duke@1: Integer mappedValue = e.getValue();
duke@1: JCExpression assign = make
duke@1: .Assign(make.Indexed(mapVar,
duke@1: make.App(make.Select(make.QualIdent(enumerator),
duke@1: ordinalMethod))),
duke@1: make.Literal(mappedValue))
duke@1: .setType(syms.intType);
duke@1: JCStatement exec = make.Exec(assign);
duke@1: JCStatement _try = make.Try(make.Block(0, List.of(exec)), catcher, null);
duke@1: stmts.append(_try);
duke@1: }
duke@1:
duke@1: owner.defs = owner.defs
duke@1: .prepend(make.Block(STATIC, stmts.toList()))
duke@1: .prepend(make.VarDef(mapVar, mapVarInit));
duke@1: }
duke@1: }
duke@1:
duke@1:
duke@1: /**************************************************************************
duke@1: * Tree building blocks
duke@1: *************************************************************************/
duke@1:
duke@1: /** Equivalent to make.at(pos.getStartPosition()) with side effect of caching
duke@1: * pos as make_pos, for use in diagnostics.
duke@1: **/
duke@1: TreeMaker make_at(DiagnosticPosition pos) {
duke@1: make_pos = pos;
duke@1: return make.at(pos);
duke@1: }
duke@1:
duke@1: /** Make an attributed tree representing a literal. This will be an
duke@1: * Ident node in the case of boolean literals, a Literal node in all
duke@1: * other cases.
duke@1: * @param type The literal's type.
duke@1: * @param value The literal's value.
duke@1: */
duke@1: JCExpression makeLit(Type type, Object value) {
duke@1: return make.Literal(type.tag, value).setType(type.constType(value));
duke@1: }
duke@1:
duke@1: /** Make an attributed tree representing null.
duke@1: */
duke@1: JCExpression makeNull() {
duke@1: return makeLit(syms.botType, null);
duke@1: }
duke@1:
duke@1: /** Make an attributed class instance creation expression.
duke@1: * @param ctype The class type.
duke@1: * @param args The constructor arguments.
duke@1: */
duke@1: JCNewClass makeNewClass(Type ctype, List args) {
duke@1: JCNewClass tree = make.NewClass(null,
duke@1: null, make.QualIdent(ctype.tsym), args, null);
duke@1: tree.constructor = rs.resolveConstructor(
duke@1: make_pos, attrEnv, ctype, TreeInfo.types(args), null, false, false);
duke@1: tree.type = ctype;
duke@1: return tree;
duke@1: }
duke@1:
duke@1: /** Make an attributed unary expression.
duke@1: * @param optag The operators tree tag.
duke@1: * @param arg The operator's argument.
duke@1: */
duke@1: JCUnary makeUnary(int optag, JCExpression arg) {
duke@1: JCUnary tree = make.Unary(optag, arg);
duke@1: tree.operator = rs.resolveUnaryOperator(
duke@1: make_pos, optag, attrEnv, arg.type);
duke@1: tree.type = tree.operator.type.getReturnType();
duke@1: return tree;
duke@1: }
duke@1:
duke@1: /** Make an attributed binary expression.
duke@1: * @param optag The operators tree tag.
duke@1: * @param lhs The operator's left argument.
duke@1: * @param rhs The operator's right argument.
duke@1: */
duke@1: JCBinary makeBinary(int optag, JCExpression lhs, JCExpression rhs) {
duke@1: JCBinary tree = make.Binary(optag, lhs, rhs);
duke@1: tree.operator = rs.resolveBinaryOperator(
duke@1: make_pos, optag, attrEnv, lhs.type, rhs.type);
duke@1: tree.type = tree.operator.type.getReturnType();
duke@1: return tree;
duke@1: }
duke@1:
duke@1: /** Make an attributed assignop expression.
duke@1: * @param optag The operators tree tag.
duke@1: * @param lhs The operator's left argument.
duke@1: * @param rhs The operator's right argument.
duke@1: */
duke@1: JCAssignOp makeAssignop(int optag, JCTree lhs, JCTree rhs) {
duke@1: JCAssignOp tree = make.Assignop(optag, lhs, rhs);
duke@1: tree.operator = rs.resolveBinaryOperator(
duke@1: make_pos, tree.getTag() - JCTree.ASGOffset, attrEnv, lhs.type, rhs.type);
duke@1: tree.type = lhs.type;
duke@1: return tree;
duke@1: }
duke@1:
duke@1: /** Convert tree into string object, unless it has already a
duke@1: * reference type..
duke@1: */
duke@1: JCExpression makeString(JCExpression tree) {
duke@1: if (tree.type.tag >= CLASS) {
duke@1: return tree;
duke@1: } else {
duke@1: Symbol valueOfSym = lookupMethod(tree.pos(),
duke@1: names.valueOf,
duke@1: syms.stringType,
duke@1: List.of(tree.type));
duke@1: return make.App(make.QualIdent(valueOfSym), List.of(tree));
duke@1: }
duke@1: }
duke@1:
duke@1: /** Create an empty anonymous class definition and enter and complete
duke@1: * its symbol. Return the class definition's symbol.
duke@1: * and create
duke@1: * @param flags The class symbol's flags
duke@1: * @param owner The class symbol's owner
duke@1: */
duke@1: ClassSymbol makeEmptyClass(long flags, ClassSymbol owner) {
duke@1: // Create class symbol.
duke@1: ClassSymbol c = reader.defineClass(names.empty, owner);
duke@1: c.flatname = chk.localClassName(c);
duke@1: c.sourcefile = owner.sourcefile;
duke@1: c.completer = null;
mcimadamore@688: c.members_field = new Scope.ClassScope(c, scopeCounter);
duke@1: c.flags_field = flags;
duke@1: ClassType ctype = (ClassType) c.type;
duke@1: ctype.supertype_field = syms.objectType;
duke@1: ctype.interfaces_field = List.nil();
duke@1:
duke@1: JCClassDecl odef = classDef(owner);
duke@1:
duke@1: // Enter class symbol in owner scope and compiled table.
duke@1: enterSynthetic(odef.pos(), c, owner.members());
duke@1: chk.compiled.put(c.flatname, c);
duke@1:
duke@1: // Create class definition tree.
duke@1: JCClassDecl cdef = make.ClassDef(
duke@1: make.Modifiers(flags), names.empty,
duke@1: List.nil(),
duke@1: null, List.nil(), List.nil());
duke@1: cdef.sym = c;
duke@1: cdef.type = c.type;
duke@1:
duke@1: // Append class definition tree to owner's definitions.
duke@1: odef.defs = odef.defs.prepend(cdef);
duke@1:
duke@1: return c;
duke@1: }
duke@1:
duke@1: /**************************************************************************
duke@1: * Symbol manipulation utilities
duke@1: *************************************************************************/
duke@1:
duke@1: /** Enter a synthetic symbol in a given scope, but complain if there was already one there.
duke@1: * @param pos Position for error reporting.
duke@1: * @param sym The symbol.
duke@1: * @param s The scope.
duke@1: */
duke@1: private void enterSynthetic(DiagnosticPosition pos, Symbol sym, Scope s) {
mcimadamore@359: s.enter(sym);
mcimadamore@359: }
mcimadamore@359:
darcy@609: /** Create a fresh synthetic name within a given scope - the unique name is
darcy@609: * obtained by appending '$' chars at the end of the name until no match
darcy@609: * is found.
darcy@609: *
darcy@609: * @param name base name
darcy@609: * @param s scope in which the name has to be unique
darcy@609: * @return fresh synthetic name
darcy@609: */
darcy@609: private Name makeSyntheticName(Name name, Scope s) {
darcy@609: do {
darcy@609: name = name.append(
darcy@609: target.syntheticNameChar(),
darcy@609: names.empty);
darcy@609: } while (lookupSynthetic(name, s) != null);
darcy@609: return name;
darcy@609: }
darcy@609:
mcimadamore@359: /** Check whether synthetic symbols generated during lowering conflict
mcimadamore@359: * with user-defined symbols.
mcimadamore@359: *
mcimadamore@359: * @param translatedTrees lowered class trees
mcimadamore@359: */
mcimadamore@359: void checkConflicts(List translatedTrees) {
mcimadamore@359: for (JCTree t : translatedTrees) {
mcimadamore@359: t.accept(conflictsChecker);
mcimadamore@359: }
mcimadamore@359: }
mcimadamore@359:
mcimadamore@359: JCTree.Visitor conflictsChecker = new TreeScanner() {
mcimadamore@359:
mcimadamore@359: TypeSymbol currentClass;
mcimadamore@359:
mcimadamore@359: @Override
mcimadamore@359: public void visitMethodDef(JCMethodDecl that) {
mcimadamore@359: chk.checkConflicts(that.pos(), that.sym, currentClass);
mcimadamore@359: super.visitMethodDef(that);
mcimadamore@359: }
mcimadamore@359:
mcimadamore@359: @Override
mcimadamore@359: public void visitVarDef(JCVariableDecl that) {
mcimadamore@359: if (that.sym.owner.kind == TYP) {
mcimadamore@359: chk.checkConflicts(that.pos(), that.sym, currentClass);
mcimadamore@359: }
mcimadamore@359: super.visitVarDef(that);
mcimadamore@359: }
mcimadamore@359:
mcimadamore@359: @Override
mcimadamore@359: public void visitClassDef(JCClassDecl that) {
mcimadamore@359: TypeSymbol prevCurrentClass = currentClass;
mcimadamore@359: currentClass = that.sym;
mcimadamore@359: try {
mcimadamore@359: super.visitClassDef(that);
mcimadamore@359: }
mcimadamore@359: finally {
mcimadamore@359: currentClass = prevCurrentClass;
duke@1: }
duke@1: }
mcimadamore@359: };
duke@1:
duke@1: /** Look up a synthetic name in a given scope.
duke@1: * @param scope The scope.
duke@1: * @param name The name.
duke@1: */
duke@1: private Symbol lookupSynthetic(Name name, Scope s) {
duke@1: Symbol sym = s.lookup(name).sym;
duke@1: return (sym==null || (sym.flags()&SYNTHETIC)==0) ? null : sym;
duke@1: }
duke@1:
duke@1: /** Look up a method in a given scope.
duke@1: */
duke@1: private MethodSymbol lookupMethod(DiagnosticPosition pos, Name name, Type qual, List args) {
duke@1: return rs.resolveInternalMethod(pos, attrEnv, qual, name, args, null);
duke@1: }
duke@1:
duke@1: /** Look up a constructor.
duke@1: */
duke@1: private MethodSymbol lookupConstructor(DiagnosticPosition pos, Type qual, List args) {
duke@1: return rs.resolveInternalConstructor(pos, attrEnv, qual, args, null);
duke@1: }
duke@1:
duke@1: /** Look up a field.
duke@1: */
duke@1: private VarSymbol lookupField(DiagnosticPosition pos, Type qual, Name name) {
duke@1: return rs.resolveInternalField(pos, attrEnv, qual, name);
duke@1: }
duke@1:
jjg@595: /** Anon inner classes are used as access constructor tags.
jjg@595: * accessConstructorTag will use an existing anon class if one is available,
jjg@595: * and synthethise a class (with makeEmptyClass) if one is not available.
jjg@595: * However, there is a small possibility that an existing class will not
jjg@595: * be generated as expected if it is inside a conditional with a constant
jjg@595: * expression. If that is found to be the case, create an empty class here.
jjg@595: */
jjg@595: private void checkAccessConstructorTags() {
jjg@595: for (List l = accessConstrTags; l.nonEmpty(); l = l.tail) {
jjg@595: ClassSymbol c = l.head;
jjg@595: if (isTranslatedClassAvailable(c))
jjg@595: continue;
jjg@595: // Create class definition tree.
jjg@595: JCClassDecl cdef = make.ClassDef(
jjg@595: make.Modifiers(STATIC | SYNTHETIC), names.empty,
jjg@595: List.nil(),
jjg@595: null, List.nil(), List.nil());
jjg@595: cdef.sym = c;
jjg@595: cdef.type = c.type;
jjg@595: // add it to the list of classes to be generated
jjg@595: translated.append(cdef);
jjg@595: }
jjg@595: }
jjg@595: // where
jjg@595: private boolean isTranslatedClassAvailable(ClassSymbol c) {
jjg@595: for (JCTree tree: translated) {
jjg@595: if (tree.getTag() == JCTree.CLASSDEF
jjg@595: && ((JCClassDecl) tree).sym == c) {
jjg@595: return true;
jjg@595: }
jjg@595: }
jjg@595: return false;
jjg@595: }
jjg@595:
duke@1: /**************************************************************************
duke@1: * Access methods
duke@1: *************************************************************************/
duke@1:
duke@1: /** Access codes for dereferencing, assignment,
duke@1: * and pre/post increment/decrement.
duke@1: * Access codes for assignment operations are determined by method accessCode
duke@1: * below.
duke@1: *
duke@1: * All access codes for accesses to the current class are even.
duke@1: * If a member of the superclass should be accessed instead (because
duke@1: * access was via a qualified super), add one to the corresponding code
duke@1: * for the current class, making the number odd.
duke@1: * This numbering scheme is used by the backend to decide whether
duke@1: * to issue an invokevirtual or invokespecial call.
duke@1: *
duke@1: * @see Gen.visitSelect(Select tree)
duke@1: */
duke@1: private static final int
duke@1: DEREFcode = 0,
duke@1: ASSIGNcode = 2,
duke@1: PREINCcode = 4,
duke@1: PREDECcode = 6,
duke@1: POSTINCcode = 8,
duke@1: POSTDECcode = 10,
duke@1: FIRSTASGOPcode = 12;
duke@1:
duke@1: /** Number of access codes
duke@1: */
duke@1: private static final int NCODES = accessCode(ByteCodes.lushrl) + 2;
duke@1:
duke@1: /** A mapping from symbols to their access numbers.
duke@1: */
duke@1: private Map accessNums;
duke@1:
duke@1: /** A mapping from symbols to an array of access symbols, indexed by
duke@1: * access code.
duke@1: */
duke@1: private Map accessSyms;
duke@1:
duke@1: /** A mapping from (constructor) symbols to access constructor symbols.
duke@1: */
duke@1: private Map accessConstrs;
duke@1:
jjg@595: /** A list of all class symbols used for access constructor tags.
jjg@595: */
jjg@595: private List accessConstrTags;
jjg@595:
duke@1: /** A queue for all accessed symbols.
duke@1: */
duke@1: private ListBuffer accessed;
duke@1:
duke@1: /** Map bytecode of binary operation to access code of corresponding
duke@1: * assignment operation. This is always an even number.
duke@1: */
duke@1: private static int accessCode(int bytecode) {
duke@1: if (ByteCodes.iadd <= bytecode && bytecode <= ByteCodes.lxor)
duke@1: return (bytecode - iadd) * 2 + FIRSTASGOPcode;
duke@1: else if (bytecode == ByteCodes.string_add)
duke@1: return (ByteCodes.lxor + 1 - iadd) * 2 + FIRSTASGOPcode;
duke@1: else if (ByteCodes.ishll <= bytecode && bytecode <= ByteCodes.lushrl)
duke@1: return (bytecode - ishll + ByteCodes.lxor + 2 - iadd) * 2 + FIRSTASGOPcode;
duke@1: else
duke@1: return -1;
duke@1: }
duke@1:
duke@1: /** return access code for identifier,
duke@1: * @param tree The tree representing the identifier use.
duke@1: * @param enclOp The closest enclosing operation node of tree,
duke@1: * null if tree is not a subtree of an operation.
duke@1: */
duke@1: private static int accessCode(JCTree tree, JCTree enclOp) {
duke@1: if (enclOp == null)
duke@1: return DEREFcode;
duke@1: else if (enclOp.getTag() == JCTree.ASSIGN &&
duke@1: tree == TreeInfo.skipParens(((JCAssign) enclOp).lhs))
duke@1: return ASSIGNcode;
duke@1: else if (JCTree.PREINC <= enclOp.getTag() && enclOp.getTag() <= JCTree.POSTDEC &&
duke@1: tree == TreeInfo.skipParens(((JCUnary) enclOp).arg))
duke@1: return (enclOp.getTag() - JCTree.PREINC) * 2 + PREINCcode;
duke@1: else if (JCTree.BITOR_ASG <= enclOp.getTag() && enclOp.getTag() <= JCTree.MOD_ASG &&
duke@1: tree == TreeInfo.skipParens(((JCAssignOp) enclOp).lhs))
duke@1: return accessCode(((OperatorSymbol) ((JCAssignOp) enclOp).operator).opcode);
duke@1: else
duke@1: return DEREFcode;
duke@1: }
duke@1:
duke@1: /** Return binary operator that corresponds to given access code.
duke@1: */
duke@1: private OperatorSymbol binaryAccessOperator(int acode) {
duke@1: for (Scope.Entry e = syms.predefClass.members().elems;
duke@1: e != null;
duke@1: e = e.sibling) {
duke@1: if (e.sym instanceof OperatorSymbol) {
duke@1: OperatorSymbol op = (OperatorSymbol)e.sym;
duke@1: if (accessCode(op.opcode) == acode) return op;
duke@1: }
duke@1: }
duke@1: return null;
duke@1: }
duke@1:
duke@1: /** Return tree tag for assignment operation corresponding
duke@1: * to given binary operator.
duke@1: */
duke@1: private static int treeTag(OperatorSymbol operator) {
duke@1: switch (operator.opcode) {
duke@1: case ByteCodes.ior: case ByteCodes.lor:
duke@1: return JCTree.BITOR_ASG;
duke@1: case ByteCodes.ixor: case ByteCodes.lxor:
duke@1: return JCTree.BITXOR_ASG;
duke@1: case ByteCodes.iand: case ByteCodes.land:
duke@1: return JCTree.BITAND_ASG;
duke@1: case ByteCodes.ishl: case ByteCodes.lshl:
duke@1: case ByteCodes.ishll: case ByteCodes.lshll:
duke@1: return JCTree.SL_ASG;
duke@1: case ByteCodes.ishr: case ByteCodes.lshr:
duke@1: case ByteCodes.ishrl: case ByteCodes.lshrl:
duke@1: return JCTree.SR_ASG;
duke@1: case ByteCodes.iushr: case ByteCodes.lushr:
duke@1: case ByteCodes.iushrl: case ByteCodes.lushrl:
duke@1: return JCTree.USR_ASG;
duke@1: case ByteCodes.iadd: case ByteCodes.ladd:
duke@1: case ByteCodes.fadd: case ByteCodes.dadd:
duke@1: case ByteCodes.string_add:
duke@1: return JCTree.PLUS_ASG;
duke@1: case ByteCodes.isub: case ByteCodes.lsub:
duke@1: case ByteCodes.fsub: case ByteCodes.dsub:
duke@1: return JCTree.MINUS_ASG;
duke@1: case ByteCodes.imul: case ByteCodes.lmul:
duke@1: case ByteCodes.fmul: case ByteCodes.dmul:
duke@1: return JCTree.MUL_ASG;
duke@1: case ByteCodes.idiv: case ByteCodes.ldiv:
duke@1: case ByteCodes.fdiv: case ByteCodes.ddiv:
duke@1: return JCTree.DIV_ASG;
duke@1: case ByteCodes.imod: case ByteCodes.lmod:
duke@1: case ByteCodes.fmod: case ByteCodes.dmod:
duke@1: return JCTree.MOD_ASG;
duke@1: default:
duke@1: throw new AssertionError();
duke@1: }
duke@1: }
duke@1:
duke@1: /** The name of the access method with number `anum' and access code `acode'.
duke@1: */
duke@1: Name accessName(int anum, int acode) {
duke@1: return names.fromString(
duke@1: "access" + target.syntheticNameChar() + anum + acode / 10 + acode % 10);
duke@1: }
duke@1:
duke@1: /** Return access symbol for a private or protected symbol from an inner class.
duke@1: * @param sym The accessed private symbol.
duke@1: * @param tree The accessing tree.
duke@1: * @param enclOp The closest enclosing operation node of tree,
duke@1: * null if tree is not a subtree of an operation.
duke@1: * @param protAccess Is access to a protected symbol in another
duke@1: * package?
duke@1: * @param refSuper Is access via a (qualified) C.super?
duke@1: */
duke@1: MethodSymbol accessSymbol(Symbol sym, JCTree tree, JCTree enclOp,
duke@1: boolean protAccess, boolean refSuper) {
duke@1: ClassSymbol accOwner = refSuper && protAccess
duke@1: // For access via qualified super (T.super.x), place the
duke@1: // access symbol on T.
duke@1: ? (ClassSymbol)((JCFieldAccess) tree).selected.type.tsym
duke@1: // Otherwise pretend that the owner of an accessed
duke@1: // protected symbol is the enclosing class of the current
duke@1: // class which is a subclass of the symbol's owner.
duke@1: : accessClass(sym, protAccess, tree);
duke@1:
duke@1: Symbol vsym = sym;
duke@1: if (sym.owner != accOwner) {
duke@1: vsym = sym.clone(accOwner);
duke@1: actualSymbols.put(vsym, sym);
duke@1: }
duke@1:
duke@1: Integer anum // The access number of the access method.
duke@1: = accessNums.get(vsym);
duke@1: if (anum == null) {
duke@1: anum = accessed.length();
duke@1: accessNums.put(vsym, anum);
duke@1: accessSyms.put(vsym, new MethodSymbol[NCODES]);
duke@1: accessed.append(vsym);
duke@1: // System.out.println("accessing " + vsym + " in " + vsym.location());
duke@1: }
duke@1:
duke@1: int acode; // The access code of the access method.
duke@1: List argtypes; // The argument types of the access method.
duke@1: Type restype; // The result type of the access method.
darcy@430: List thrown; // The thrown exceptions of the access method.
duke@1: switch (vsym.kind) {
duke@1: case VAR:
duke@1: acode = accessCode(tree, enclOp);
duke@1: if (acode >= FIRSTASGOPcode) {
duke@1: OperatorSymbol operator = binaryAccessOperator(acode);
duke@1: if (operator.opcode == string_add)
duke@1: argtypes = List.of(syms.objectType);
duke@1: else
duke@1: argtypes = operator.type.getParameterTypes().tail;
duke@1: } else if (acode == ASSIGNcode)
duke@1: argtypes = List.of(vsym.erasure(types));
duke@1: else
duke@1: argtypes = List.nil();
duke@1: restype = vsym.erasure(types);
duke@1: thrown = List.nil();
duke@1: break;
duke@1: case MTH:
duke@1: acode = DEREFcode;
duke@1: argtypes = vsym.erasure(types).getParameterTypes();
duke@1: restype = vsym.erasure(types).getReturnType();
duke@1: thrown = vsym.type.getThrownTypes();
duke@1: break;
duke@1: default:
duke@1: throw new AssertionError();
duke@1: }
duke@1:
duke@1: // For references via qualified super, increment acode by one,
duke@1: // making it odd.
duke@1: if (protAccess && refSuper) acode++;
duke@1:
duke@1: // Instance access methods get instance as first parameter.
duke@1: // For protected symbols this needs to be the instance as a member
duke@1: // of the type containing the accessed symbol, not the class
duke@1: // containing the access method.
duke@1: if ((vsym.flags() & STATIC) == 0) {
duke@1: argtypes = argtypes.prepend(vsym.owner.erasure(types));
duke@1: }
duke@1: MethodSymbol[] accessors = accessSyms.get(vsym);
duke@1: MethodSymbol accessor = accessors[acode];
duke@1: if (accessor == null) {
duke@1: accessor = new MethodSymbol(
duke@1: STATIC | SYNTHETIC,
duke@1: accessName(anum.intValue(), acode),
duke@1: new MethodType(argtypes, restype, thrown, syms.methodClass),
duke@1: accOwner);
duke@1: enterSynthetic(tree.pos(), accessor, accOwner.members());
duke@1: accessors[acode] = accessor;
duke@1: }
duke@1: return accessor;
duke@1: }
duke@1:
duke@1: /** The qualifier to be used for accessing a symbol in an outer class.
duke@1: * This is either C.sym or C.this.sym, depending on whether or not
duke@1: * sym is static.
duke@1: * @param sym The accessed symbol.
duke@1: */
duke@1: JCExpression accessBase(DiagnosticPosition pos, Symbol sym) {
duke@1: return (sym.flags() & STATIC) != 0
duke@1: ? access(make.at(pos.getStartPosition()).QualIdent(sym.owner))
duke@1: : makeOwnerThis(pos, sym, true);
duke@1: }
duke@1:
duke@1: /** Do we need an access method to reference private symbol?
duke@1: */
duke@1: boolean needsPrivateAccess(Symbol sym) {
duke@1: if ((sym.flags() & PRIVATE) == 0 || sym.owner == currentClass) {
duke@1: return false;
duke@1: } else if (sym.name == names.init && (sym.owner.owner.kind & (VAR | MTH)) != 0) {
duke@1: // private constructor in local class: relax protection
duke@1: sym.flags_field &= ~PRIVATE;
duke@1: return false;
duke@1: } else {
duke@1: return true;
duke@1: }
duke@1: }
duke@1:
duke@1: /** Do we need an access method to reference symbol in other package?
duke@1: */
duke@1: boolean needsProtectedAccess(Symbol sym, JCTree tree) {
duke@1: if ((sym.flags() & PROTECTED) == 0 ||
duke@1: sym.owner.owner == currentClass.owner || // fast special case
duke@1: sym.packge() == currentClass.packge())
duke@1: return false;
duke@1: if (!currentClass.isSubClass(sym.owner, types))
duke@1: return true;
duke@1: if ((sym.flags() & STATIC) != 0 ||
duke@1: tree.getTag() != JCTree.SELECT ||
duke@1: TreeInfo.name(((JCFieldAccess) tree).selected) == names._super)
duke@1: return false;
duke@1: return !((JCFieldAccess) tree).selected.type.tsym.isSubClass(currentClass, types);
duke@1: }
duke@1:
duke@1: /** The class in which an access method for given symbol goes.
duke@1: * @param sym The access symbol
duke@1: * @param protAccess Is access to a protected symbol in another
duke@1: * package?
duke@1: */
duke@1: ClassSymbol accessClass(Symbol sym, boolean protAccess, JCTree tree) {
duke@1: if (protAccess) {
duke@1: Symbol qualifier = null;
duke@1: ClassSymbol c = currentClass;
duke@1: if (tree.getTag() == JCTree.SELECT && (sym.flags() & STATIC) == 0) {
duke@1: qualifier = ((JCFieldAccess) tree).selected.type.tsym;
duke@1: while (!qualifier.isSubClass(c, types)) {
duke@1: c = c.owner.enclClass();
duke@1: }
duke@1: return c;
duke@1: } else {
duke@1: while (!c.isSubClass(sym.owner, types)) {
duke@1: c = c.owner.enclClass();
duke@1: }
duke@1: }
duke@1: return c;
duke@1: } else {
duke@1: // the symbol is private
duke@1: return sym.owner.enclClass();
duke@1: }
duke@1: }
duke@1:
duke@1: /** Ensure that identifier is accessible, return tree accessing the identifier.
duke@1: * @param sym The accessed symbol.
duke@1: * @param tree The tree referring to the symbol.
duke@1: * @param enclOp The closest enclosing operation node of tree,
duke@1: * null if tree is not a subtree of an operation.
duke@1: * @param refSuper Is access via a (qualified) C.super?
duke@1: */
duke@1: JCExpression access(Symbol sym, JCExpression tree, JCExpression enclOp, boolean refSuper) {
duke@1: // Access a free variable via its proxy, or its proxy's proxy
duke@1: while (sym.kind == VAR && sym.owner.kind == MTH &&
duke@1: sym.owner.enclClass() != currentClass) {
duke@1: // A constant is replaced by its constant value.
duke@1: Object cv = ((VarSymbol)sym).getConstValue();
duke@1: if (cv != null) {
duke@1: make.at(tree.pos);
duke@1: return makeLit(sym.type, cv);
duke@1: }
duke@1: // Otherwise replace the variable by its proxy.
duke@1: sym = proxies.lookup(proxyName(sym.name)).sym;
jjg@816: Assert.check(sym != null && (sym.flags_field & FINAL) != 0);
duke@1: tree = make.at(tree.pos).Ident(sym);
duke@1: }
duke@1: JCExpression base = (tree.getTag() == JCTree.SELECT) ? ((JCFieldAccess) tree).selected : null;
duke@1: switch (sym.kind) {
duke@1: case TYP:
duke@1: if (sym.owner.kind != PCK) {
duke@1: // Convert type idents to
duke@1: // or .
duke@1: Name flatname = Convert.shortName(sym.flatName());
duke@1: while (base != null &&
duke@1: TreeInfo.symbol(base) != null &&
duke@1: TreeInfo.symbol(base).kind != PCK) {
duke@1: base = (base.getTag() == JCTree.SELECT)
duke@1: ? ((JCFieldAccess) base).selected
duke@1: : null;
duke@1: }
duke@1: if (tree.getTag() == JCTree.IDENT) {
duke@1: ((JCIdent) tree).name = flatname;
duke@1: } else if (base == null) {
duke@1: tree = make.at(tree.pos).Ident(sym);
duke@1: ((JCIdent) tree).name = flatname;
duke@1: } else {
duke@1: ((JCFieldAccess) tree).selected = base;
duke@1: ((JCFieldAccess) tree).name = flatname;
duke@1: }
duke@1: }
duke@1: break;
duke@1: case MTH: case VAR:
duke@1: if (sym.owner.kind == TYP) {
duke@1:
duke@1: // Access methods are required for
duke@1: // - private members,
duke@1: // - protected members in a superclass of an
duke@1: // enclosing class contained in another package.
duke@1: // - all non-private members accessed via a qualified super.
duke@1: boolean protAccess = refSuper && !needsPrivateAccess(sym)
duke@1: || needsProtectedAccess(sym, tree);
duke@1: boolean accReq = protAccess || needsPrivateAccess(sym);
duke@1:
duke@1: // A base has to be supplied for
duke@1: // - simple identifiers accessing variables in outer classes.
duke@1: boolean baseReq =
duke@1: base == null &&
duke@1: sym.owner != syms.predefClass &&
duke@1: !sym.isMemberOf(currentClass, types);
duke@1:
duke@1: if (accReq || baseReq) {
duke@1: make.at(tree.pos);
duke@1:
duke@1: // Constants are replaced by their constant value.
duke@1: if (sym.kind == VAR) {
duke@1: Object cv = ((VarSymbol)sym).getConstValue();
duke@1: if (cv != null) return makeLit(sym.type, cv);
duke@1: }
duke@1:
duke@1: // Private variables and methods are replaced by calls
duke@1: // to their access methods.
duke@1: if (accReq) {
duke@1: List args = List.nil();
duke@1: if ((sym.flags() & STATIC) == 0) {
duke@1: // Instance access methods get instance
duke@1: // as first parameter.
duke@1: if (base == null)
duke@1: base = makeOwnerThis(tree.pos(), sym, true);
duke@1: args = args.prepend(base);
duke@1: base = null; // so we don't duplicate code
duke@1: }
duke@1: Symbol access = accessSymbol(sym, tree,
duke@1: enclOp, protAccess,
duke@1: refSuper);
duke@1: JCExpression receiver = make.Select(
duke@1: base != null ? base : make.QualIdent(access.owner),
duke@1: access);
duke@1: return make.App(receiver, args);
duke@1:
duke@1: // Other accesses to members of outer classes get a
duke@1: // qualifier.
duke@1: } else if (baseReq) {
duke@1: return make.at(tree.pos).Select(
duke@1: accessBase(tree.pos(), sym), sym).setType(tree.type);
duke@1: }
duke@1: }
duke@1: }
duke@1: }
duke@1: return tree;
duke@1: }
duke@1:
duke@1: /** Ensure that identifier is accessible, return tree accessing the identifier.
duke@1: * @param tree The identifier tree.
duke@1: */
duke@1: JCExpression access(JCExpression tree) {
duke@1: Symbol sym = TreeInfo.symbol(tree);
duke@1: return sym == null ? tree : access(sym, tree, null, false);
duke@1: }
duke@1:
duke@1: /** Return access constructor for a private constructor,
duke@1: * or the constructor itself, if no access constructor is needed.
duke@1: * @param pos The position to report diagnostics, if any.
duke@1: * @param constr The private constructor.
duke@1: */
duke@1: Symbol accessConstructor(DiagnosticPosition pos, Symbol constr) {
duke@1: if (needsPrivateAccess(constr)) {
duke@1: ClassSymbol accOwner = constr.owner.enclClass();
duke@1: MethodSymbol aconstr = accessConstrs.get(constr);
duke@1: if (aconstr == null) {
duke@1: List argtypes = constr.type.getParameterTypes();
duke@1: if ((accOwner.flags_field & ENUM) != 0)
duke@1: argtypes = argtypes
duke@1: .prepend(syms.intType)
duke@1: .prepend(syms.stringType);
duke@1: aconstr = new MethodSymbol(
duke@1: SYNTHETIC,
duke@1: names.init,
duke@1: new MethodType(
duke@1: argtypes.append(
duke@1: accessConstructorTag().erasure(types)),
duke@1: constr.type.getReturnType(),
duke@1: constr.type.getThrownTypes(),
duke@1: syms.methodClass),
duke@1: accOwner);
duke@1: enterSynthetic(pos, aconstr, accOwner.members());
duke@1: accessConstrs.put(constr, aconstr);
duke@1: accessed.append(constr);
duke@1: }
duke@1: return aconstr;
duke@1: } else {
duke@1: return constr;
duke@1: }
duke@1: }
duke@1:
duke@1: /** Return an anonymous class nested in this toplevel class.
duke@1: */
duke@1: ClassSymbol accessConstructorTag() {
duke@1: ClassSymbol topClass = currentClass.outermostClass();
duke@1: Name flatname = names.fromString("" + topClass.getQualifiedName() +
duke@1: target.syntheticNameChar() +
duke@1: "1");
duke@1: ClassSymbol ctag = chk.compiled.get(flatname);
duke@1: if (ctag == null)
duke@1: ctag = makeEmptyClass(STATIC | SYNTHETIC, topClass);
jjg@595: // keep a record of all tags, to verify that all are generated as required
jjg@595: accessConstrTags = accessConstrTags.prepend(ctag);
duke@1: return ctag;
duke@1: }
duke@1:
duke@1: /** Add all required access methods for a private symbol to enclosing class.
duke@1: * @param sym The symbol.
duke@1: */
duke@1: void makeAccessible(Symbol sym) {
duke@1: JCClassDecl cdef = classDef(sym.owner.enclClass());
jjg@816: if (cdef == null) Assert.error("class def not found: " + sym + " in " + sym.owner);
duke@1: if (sym.name == names.init) {
duke@1: cdef.defs = cdef.defs.prepend(
duke@1: accessConstructorDef(cdef.pos, sym, accessConstrs.get(sym)));
duke@1: } else {
duke@1: MethodSymbol[] accessors = accessSyms.get(sym);
duke@1: for (int i = 0; i < NCODES; i++) {
duke@1: if (accessors[i] != null)
duke@1: cdef.defs = cdef.defs.prepend(
duke@1: accessDef(cdef.pos, sym, accessors[i], i));
duke@1: }
duke@1: }
duke@1: }
duke@1:
duke@1: /** Construct definition of an access method.
duke@1: * @param pos The source code position of the definition.
duke@1: * @param vsym The private or protected symbol.
duke@1: * @param accessor The access method for the symbol.
duke@1: * @param acode The access code.
duke@1: */
duke@1: JCTree accessDef(int pos, Symbol vsym, MethodSymbol accessor, int acode) {
duke@1: // System.err.println("access " + vsym + " with " + accessor);//DEBUG
duke@1: currentClass = vsym.owner.enclClass();
duke@1: make.at(pos);
duke@1: JCMethodDecl md = make.MethodDef(accessor, null);
duke@1:
duke@1: // Find actual symbol
duke@1: Symbol sym = actualSymbols.get(vsym);
duke@1: if (sym == null) sym = vsym;
duke@1:
duke@1: JCExpression ref; // The tree referencing the private symbol.
duke@1: List args; // Any additional arguments to be passed along.
duke@1: if ((sym.flags() & STATIC) != 0) {
duke@1: ref = make.Ident(sym);
duke@1: args = make.Idents(md.params);
duke@1: } else {
duke@1: ref = make.Select(make.Ident(md.params.head), sym);
duke@1: args = make.Idents(md.params.tail);
duke@1: }
duke@1: JCStatement stat; // The statement accessing the private symbol.
duke@1: if (sym.kind == VAR) {
duke@1: // Normalize out all odd access codes by taking floor modulo 2:
duke@1: int acode1 = acode - (acode & 1);
duke@1:
duke@1: JCExpression expr; // The access method's return value.
duke@1: switch (acode1) {
duke@1: case DEREFcode:
duke@1: expr = ref;
duke@1: break;
duke@1: case ASSIGNcode:
duke@1: expr = make.Assign(ref, args.head);
duke@1: break;
duke@1: case PREINCcode: case POSTINCcode: case PREDECcode: case POSTDECcode:
duke@1: expr = makeUnary(
duke@1: ((acode1 - PREINCcode) >> 1) + JCTree.PREINC, ref);
duke@1: break;
duke@1: default:
duke@1: expr = make.Assignop(
duke@1: treeTag(binaryAccessOperator(acode1)), ref, args.head);
duke@1: ((JCAssignOp) expr).operator = binaryAccessOperator(acode1);
duke@1: }
duke@1: stat = make.Return(expr.setType(sym.type));
duke@1: } else {
duke@1: stat = make.Call(make.App(ref, args));
duke@1: }
duke@1: md.body = make.Block(0, List.of(stat));
duke@1:
duke@1: // Make sure all parameters, result types and thrown exceptions
duke@1: // are accessible.
duke@1: for (List l = md.params; l.nonEmpty(); l = l.tail)
duke@1: l.head.vartype = access(l.head.vartype);
duke@1: md.restype = access(md.restype);
duke@1: for (List l = md.thrown; l.nonEmpty(); l = l.tail)
duke@1: l.head = access(l.head);
duke@1:
duke@1: return md;
duke@1: }
duke@1:
duke@1: /** Construct definition of an access constructor.
duke@1: * @param pos The source code position of the definition.
duke@1: * @param constr The private constructor.
duke@1: * @param accessor The access method for the constructor.
duke@1: */
duke@1: JCTree accessConstructorDef(int pos, Symbol constr, MethodSymbol accessor) {
duke@1: make.at(pos);
duke@1: JCMethodDecl md = make.MethodDef(accessor,
duke@1: accessor.externalType(types),
duke@1: null);
duke@1: JCIdent callee = make.Ident(names._this);
duke@1: callee.sym = constr;
duke@1: callee.type = constr.type;
duke@1: md.body =
duke@1: make.Block(0, List.of(
duke@1: make.Call(
duke@1: make.App(
duke@1: callee,
duke@1: make.Idents(md.params.reverse().tail.reverse())))));
duke@1: return md;
duke@1: }
duke@1:
duke@1: /**************************************************************************
duke@1: * Free variables proxies and this$n
duke@1: *************************************************************************/
duke@1:
duke@1: /** A scope containing all free variable proxies for currently translated
duke@1: * class, as well as its this$n symbol (if needed).
duke@1: * Proxy scopes are nested in the same way classes are.
duke@1: * Inside a constructor, proxies and any this$n symbol are duplicated
duke@1: * in an additional innermost scope, where they represent the constructor
duke@1: * parameters.
duke@1: */
duke@1: Scope proxies;
duke@1:
darcy@609: /** A scope containing all unnamed resource variables/saved
darcy@609: * exception variables for translated TWR blocks
darcy@609: */
darcy@609: Scope twrVars;
darcy@609:
duke@1: /** A stack containing the this$n field of the currently translated
duke@1: * classes (if needed) in innermost first order.
duke@1: * Inside a constructor, proxies and any this$n symbol are duplicated
duke@1: * in an additional innermost scope, where they represent the constructor
duke@1: * parameters.
duke@1: */
duke@1: List outerThisStack;
duke@1:
duke@1: /** The name of a free variable proxy.
duke@1: */
duke@1: Name proxyName(Name name) {
duke@1: return names.fromString("val" + target.syntheticNameChar() + name);
duke@1: }
duke@1:
duke@1: /** Proxy definitions for all free variables in given list, in reverse order.
duke@1: * @param pos The source code position of the definition.
duke@1: * @param freevars The free variables.
duke@1: * @param owner The class in which the definitions go.
duke@1: */
duke@1: List freevarDefs(int pos, List freevars, Symbol owner) {
duke@1: long flags = FINAL | SYNTHETIC;
duke@1: if (owner.kind == TYP &&
duke@1: target.usePrivateSyntheticFields())
duke@1: flags |= PRIVATE;
duke@1: List defs = List.nil();
duke@1: for (List l = freevars; l.nonEmpty(); l = l.tail) {
duke@1: VarSymbol v = l.head;
duke@1: VarSymbol proxy = new VarSymbol(
duke@1: flags, proxyName(v.name), v.erasure(types), owner);
duke@1: proxies.enter(proxy);
duke@1: JCVariableDecl vd = make.at(pos).VarDef(proxy, null);
duke@1: vd.vartype = access(vd.vartype);
duke@1: defs = defs.prepend(vd);
duke@1: }
duke@1: return defs;
duke@1: }
duke@1:
duke@1: /** The name of a this$n field
duke@1: * @param type The class referenced by the this$n field
duke@1: */
duke@1: Name outerThisName(Type type, Symbol owner) {
duke@1: Type t = type.getEnclosingType();
duke@1: int nestingLevel = 0;
duke@1: while (t.tag == CLASS) {
duke@1: t = t.getEnclosingType();
duke@1: nestingLevel++;
duke@1: }
duke@1: Name result = names.fromString("this" + target.syntheticNameChar() + nestingLevel);
duke@1: while (owner.kind == TYP && ((ClassSymbol)owner).members().lookup(result).scope != null)
duke@1: result = names.fromString(result.toString() + target.syntheticNameChar());
duke@1: return result;
duke@1: }
duke@1:
duke@1: /** Definition for this$n field.
duke@1: * @param pos The source code position of the definition.
duke@1: * @param owner The class in which the definition goes.
duke@1: */
duke@1: JCVariableDecl outerThisDef(int pos, Symbol owner) {
duke@1: long flags = FINAL | SYNTHETIC;
duke@1: if (owner.kind == TYP &&
duke@1: target.usePrivateSyntheticFields())
duke@1: flags |= PRIVATE;
duke@1: Type target = types.erasure(owner.enclClass().type.getEnclosingType());
duke@1: VarSymbol outerThis = new VarSymbol(
duke@1: flags, outerThisName(target, owner), target, owner);
duke@1: outerThisStack = outerThisStack.prepend(outerThis);
duke@1: JCVariableDecl vd = make.at(pos).VarDef(outerThis, null);
duke@1: vd.vartype = access(vd.vartype);
duke@1: return vd;
duke@1: }
duke@1:
duke@1: /** Return a list of trees that load the free variables in given list,
duke@1: * in reverse order.
duke@1: * @param pos The source code position to be used for the trees.
duke@1: * @param freevars The list of free variables.
duke@1: */
duke@1: List loadFreevars(DiagnosticPosition pos, List freevars) {
duke@1: List args = List.nil();
duke@1: for (List l = freevars; l.nonEmpty(); l = l.tail)
duke@1: args = args.prepend(loadFreevar(pos, l.head));
duke@1: return args;
duke@1: }
duke@1: //where
duke@1: JCExpression loadFreevar(DiagnosticPosition pos, VarSymbol v) {
duke@1: return access(v, make.at(pos).Ident(v), null, false);
duke@1: }
duke@1:
duke@1: /** Construct a tree simulating the expression .
duke@1: * @param pos The source code position to be used for the tree.
duke@1: * @param c The qualifier class.
duke@1: */
duke@1: JCExpression makeThis(DiagnosticPosition pos, TypeSymbol c) {
duke@1: if (currentClass == c) {
duke@1: // in this case, `this' works fine
duke@1: return make.at(pos).This(c.erasure(types));
duke@1: } else {
duke@1: // need to go via this$n
duke@1: return makeOuterThis(pos, c);
duke@1: }
duke@1: }
duke@1:
darcy@609: /** Optionally replace a try statement with an automatic resource
darcy@609: * management (ARM) block.
darcy@609: * @param tree The try statement to inspect.
darcy@609: * @return An ARM block, or the original try block if there are no
darcy@609: * resources to manage.
darcy@609: */
darcy@609: JCTree makeArmTry(JCTry tree) {
darcy@609: make_at(tree.pos());
darcy@609: twrVars = twrVars.dup();
darcy@609: JCBlock armBlock = makeArmBlock(tree.resources, tree.body, 0);
darcy@609: if (tree.catchers.isEmpty() && tree.finalizer == null)
darcy@609: result = translate(armBlock);
darcy@609: else
darcy@609: result = translate(make.Try(armBlock, tree.catchers, tree.finalizer));
darcy@609: twrVars = twrVars.leave();
darcy@609: return result;
darcy@609: }
darcy@609:
darcy@609: private JCBlock makeArmBlock(List resources, JCBlock block, int depth) {
darcy@609: if (resources.isEmpty())
darcy@609: return block;
darcy@609:
darcy@609: // Add resource declaration or expression to block statements
darcy@609: ListBuffer stats = new ListBuffer();
darcy@609: JCTree resource = resources.head;
darcy@609: JCExpression expr = null;
darcy@609: if (resource instanceof JCVariableDecl) {
darcy@609: JCVariableDecl var = (JCVariableDecl) resource;
darcy@609: expr = make.Ident(var.sym).setType(resource.type);
darcy@609: stats.add(var);
darcy@609: } else {
jjg@816: Assert.check(resource instanceof JCExpression);
darcy@609: VarSymbol syntheticTwrVar =
darcy@609: new VarSymbol(SYNTHETIC | FINAL,
darcy@609: makeSyntheticName(names.fromString("twrVar" +
darcy@609: depth), twrVars),
darcy@609: (resource.type.tag == TypeTags.BOT) ?
darcy@609: syms.autoCloseableType : resource.type,
darcy@609: currentMethodSym);
darcy@609: twrVars.enter(syntheticTwrVar);
darcy@609: JCVariableDecl syntheticTwrVarDecl =
darcy@609: make.VarDef(syntheticTwrVar, (JCExpression)resource);
darcy@609: expr = (JCExpression)make.Ident(syntheticTwrVar);
darcy@609: stats.add(syntheticTwrVarDecl);
darcy@609: }
darcy@609:
darcy@609: // Add primaryException declaration
darcy@609: VarSymbol primaryException =
darcy@609: new VarSymbol(SYNTHETIC,
darcy@609: makeSyntheticName(names.fromString("primaryException" +
darcy@609: depth), twrVars),
darcy@609: syms.throwableType,
darcy@609: currentMethodSym);
darcy@609: twrVars.enter(primaryException);
darcy@609: JCVariableDecl primaryExceptionTreeDecl = make.VarDef(primaryException, makeNull());
darcy@609: stats.add(primaryExceptionTreeDecl);
darcy@609:
darcy@609: // Create catch clause that saves exception and then rethrows it
darcy@609: VarSymbol param =
darcy@609: new VarSymbol(FINAL|SYNTHETIC,
darcy@609: names.fromString("t" +
darcy@609: target.syntheticNameChar()),
darcy@609: syms.throwableType,
darcy@609: currentMethodSym);
darcy@609: JCVariableDecl paramTree = make.VarDef(param, null);
darcy@609: JCStatement assign = make.Assignment(primaryException, make.Ident(param));
darcy@609: JCStatement rethrowStat = make.Throw(make.Ident(param));
darcy@609: JCBlock catchBlock = make.Block(0L, List.of(assign, rethrowStat));
darcy@609: JCCatch catchClause = make.Catch(paramTree, catchBlock);
darcy@609:
darcy@609: int oldPos = make.pos;
darcy@609: make.at(TreeInfo.endPos(block));
darcy@609: JCBlock finallyClause = makeArmFinallyClause(primaryException, expr);
darcy@609: make.at(oldPos);
darcy@609: JCTry outerTry = make.Try(makeArmBlock(resources.tail, block, depth + 1),
darcy@609: List.of(catchClause),
darcy@609: finallyClause);
darcy@609: stats.add(outerTry);
darcy@609: return make.Block(0L, stats.toList());
darcy@609: }
darcy@609:
darcy@609: private JCBlock makeArmFinallyClause(Symbol primaryException, JCExpression resource) {
darcy@745: // primaryException.addSuppressed(catchException);
darcy@609: VarSymbol catchException =
darcy@609: new VarSymbol(0, make.paramName(2),
darcy@609: syms.throwableType,
darcy@609: currentMethodSym);
darcy@609: JCStatement addSuppressionStatement =
darcy@609: make.Exec(makeCall(make.Ident(primaryException),
darcy@745: names.addSuppressed,
darcy@609: List.of(make.Ident(catchException))));
darcy@609:
darcy@745: // try { resource.close(); } catch (e) { primaryException.addSuppressed(e); }
darcy@609: JCBlock tryBlock =
darcy@609: make.Block(0L, List.of(makeResourceCloseInvocation(resource)));
darcy@609: JCVariableDecl catchExceptionDecl = make.VarDef(catchException, null);
darcy@609: JCBlock catchBlock = make.Block(0L, List.of(addSuppressionStatement));
darcy@609: List catchClauses = List.of(make.Catch(catchExceptionDecl, catchBlock));
darcy@609: JCTry tryTree = make.Try(tryBlock, catchClauses, null);
darcy@609:
darcy@609: // if (resource != null) resourceClose;
darcy@609: JCExpression nullCheck = makeBinary(JCTree.NE,
darcy@609: make.Ident(primaryException),
darcy@609: makeNull());
darcy@609: JCIf closeIfStatement = make.If(nullCheck,
darcy@609: tryTree,
darcy@609: makeResourceCloseInvocation(resource));
darcy@609: return make.Block(0L, List.of(closeIfStatement));
darcy@609: }
darcy@609:
darcy@609: private JCStatement makeResourceCloseInvocation(JCExpression resource) {
darcy@609: // create resource.close() method invocation
darcy@609: JCExpression resourceClose = makeCall(resource, names.close, List.nil());
darcy@609: return make.Exec(resourceClose);
darcy@609: }
darcy@609:
duke@1: /** Construct a tree that represents the outer instance
duke@1: * . Never pick the current `this'.
duke@1: * @param pos The source code position to be used for the tree.
duke@1: * @param c The qualifier class.
duke@1: */
duke@1: JCExpression makeOuterThis(DiagnosticPosition pos, TypeSymbol c) {
duke@1: List ots = outerThisStack;
duke@1: if (ots.isEmpty()) {
duke@1: log.error(pos, "no.encl.instance.of.type.in.scope", c);
jjg@816: Assert.error();
duke@1: return makeNull();
duke@1: }
duke@1: VarSymbol ot = ots.head;
duke@1: JCExpression tree = access(make.at(pos).Ident(ot));
duke@1: TypeSymbol otc = ot.type.tsym;
duke@1: while (otc != c) {
duke@1: do {
duke@1: ots = ots.tail;
duke@1: if (ots.isEmpty()) {
duke@1: log.error(pos,
duke@1: "no.encl.instance.of.type.in.scope",
duke@1: c);
jjg@816: Assert.error(); // should have been caught in Attr
duke@1: return tree;
duke@1: }
duke@1: ot = ots.head;
duke@1: } while (ot.owner != otc);
duke@1: if (otc.owner.kind != PCK && !otc.hasOuterInstance()) {
duke@1: chk.earlyRefError(pos, c);
jjg@816: Assert.error(); // should have been caught in Attr
duke@1: return makeNull();
duke@1: }
duke@1: tree = access(make.at(pos).Select(tree, ot));
duke@1: otc = ot.type.tsym;
duke@1: }
duke@1: return tree;
duke@1: }
duke@1:
duke@1: /** Construct a tree that represents the closest outer instance
duke@1: * such that the given symbol is a member of C.
duke@1: * @param pos The source code position to be used for the tree.
duke@1: * @param sym The accessed symbol.
duke@1: * @param preciseMatch should we accept a type that is a subtype of
duke@1: * sym's owner, even if it doesn't contain sym
duke@1: * due to hiding, overriding, or non-inheritance
duke@1: * due to protection?
duke@1: */
duke@1: JCExpression makeOwnerThis(DiagnosticPosition pos, Symbol sym, boolean preciseMatch) {
duke@1: Symbol c = sym.owner;
duke@1: if (preciseMatch ? sym.isMemberOf(currentClass, types)
duke@1: : currentClass.isSubClass(sym.owner, types)) {
duke@1: // in this case, `this' works fine
duke@1: return make.at(pos).This(c.erasure(types));
duke@1: } else {
duke@1: // need to go via this$n
duke@1: return makeOwnerThisN(pos, sym, preciseMatch);
duke@1: }
duke@1: }
duke@1:
duke@1: /**
duke@1: * Similar to makeOwnerThis but will never pick "this".
duke@1: */
duke@1: JCExpression makeOwnerThisN(DiagnosticPosition pos, Symbol sym, boolean preciseMatch) {
duke@1: Symbol c = sym.owner;
duke@1: List ots = outerThisStack;
duke@1: if (ots.isEmpty()) {
duke@1: log.error(pos, "no.encl.instance.of.type.in.scope", c);
jjg@816: Assert.error();
duke@1: return makeNull();
duke@1: }
duke@1: VarSymbol ot = ots.head;
duke@1: JCExpression tree = access(make.at(pos).Ident(ot));
duke@1: TypeSymbol otc = ot.type.tsym;
duke@1: while (!(preciseMatch ? sym.isMemberOf(otc, types) : otc.isSubClass(sym.owner, types))) {
duke@1: do {
duke@1: ots = ots.tail;
duke@1: if (ots.isEmpty()) {
duke@1: log.error(pos,
duke@1: "no.encl.instance.of.type.in.scope",
duke@1: c);
jjg@816: Assert.error();
duke@1: return tree;
duke@1: }
duke@1: ot = ots.head;
duke@1: } while (ot.owner != otc);
duke@1: tree = access(make.at(pos).Select(tree, ot));
duke@1: otc = ot.type.tsym;
duke@1: }
duke@1: return tree;
duke@1: }
duke@1:
duke@1: /** Return tree simulating the assignment , where
duke@1: * name is the name of a free variable.
duke@1: */
duke@1: JCStatement initField(int pos, Name name) {
duke@1: Scope.Entry e = proxies.lookup(name);
duke@1: Symbol rhs = e.sym;
jjg@816: Assert.check(rhs.owner.kind == MTH);
duke@1: Symbol lhs = e.next().sym;
jjg@816: Assert.check(rhs.owner.owner == lhs.owner);
duke@1: make.at(pos);
duke@1: return
duke@1: make.Exec(
duke@1: make.Assign(
duke@1: make.Select(make.This(lhs.owner.erasure(types)), lhs),
duke@1: make.Ident(rhs)).setType(lhs.erasure(types)));
duke@1: }
duke@1:
duke@1: /** Return tree simulating the assignment .
duke@1: */
duke@1: JCStatement initOuterThis(int pos) {
duke@1: VarSymbol rhs = outerThisStack.head;
jjg@816: Assert.check(rhs.owner.kind == MTH);
duke@1: VarSymbol lhs = outerThisStack.tail.head;
jjg@816: Assert.check(rhs.owner.owner == lhs.owner);
duke@1: make.at(pos);
duke@1: return
duke@1: make.Exec(
duke@1: make.Assign(
duke@1: make.Select(make.This(lhs.owner.erasure(types)), lhs),
duke@1: make.Ident(rhs)).setType(lhs.erasure(types)));
duke@1: }
duke@1:
duke@1: /**************************************************************************
duke@1: * Code for .class
duke@1: *************************************************************************/
duke@1:
duke@1: /** Return the symbol of a class to contain a cache of
duke@1: * compiler-generated statics such as class$ and the
duke@1: * $assertionsDisabled flag. We create an anonymous nested class
duke@1: * (unless one already exists) and return its symbol. However,
duke@1: * for backward compatibility in 1.4 and earlier we use the
duke@1: * top-level class itself.
duke@1: */
duke@1: private ClassSymbol outerCacheClass() {
duke@1: ClassSymbol clazz = outermostClassDef.sym;
duke@1: if ((clazz.flags() & INTERFACE) == 0 &&
duke@1: !target.useInnerCacheClass()) return clazz;
duke@1: Scope s = clazz.members();
duke@1: for (Scope.Entry e = s.elems; e != null; e = e.sibling)
duke@1: if (e.sym.kind == TYP &&
duke@1: e.sym.name == names.empty &&
duke@1: (e.sym.flags() & INTERFACE) == 0) return (ClassSymbol) e.sym;
duke@1: return makeEmptyClass(STATIC | SYNTHETIC, clazz);
duke@1: }
duke@1:
duke@1: /** Return symbol for "class$" method. If there is no method definition
duke@1: * for class$, construct one as follows:
duke@1: *
duke@1: * class class$(String x0) {
duke@1: * try {
duke@1: * return Class.forName(x0);
duke@1: * } catch (ClassNotFoundException x1) {
duke@1: * throw new NoClassDefFoundError(x1.getMessage());
duke@1: * }
duke@1: * }
duke@1: */
duke@1: private MethodSymbol classDollarSym(DiagnosticPosition pos) {
duke@1: ClassSymbol outerCacheClass = outerCacheClass();
duke@1: MethodSymbol classDollarSym =
duke@1: (MethodSymbol)lookupSynthetic(classDollar,
duke@1: outerCacheClass.members());
duke@1: if (classDollarSym == null) {
duke@1: classDollarSym = new MethodSymbol(
duke@1: STATIC | SYNTHETIC,
duke@1: classDollar,
duke@1: new MethodType(
duke@1: List.of(syms.stringType),
duke@1: types.erasure(syms.classType),
duke@1: List.nil(),
duke@1: syms.methodClass),
duke@1: outerCacheClass);
duke@1: enterSynthetic(pos, classDollarSym, outerCacheClass.members());
duke@1:
duke@1: JCMethodDecl md = make.MethodDef(classDollarSym, null);
duke@1: try {
duke@1: md.body = classDollarSymBody(pos, md);
duke@1: } catch (CompletionFailure ex) {
duke@1: md.body = make.Block(0, List.nil());
duke@1: chk.completionError(pos, ex);
duke@1: }
duke@1: JCClassDecl outerCacheClassDef = classDef(outerCacheClass);
duke@1: outerCacheClassDef.defs = outerCacheClassDef.defs.prepend(md);
duke@1: }
duke@1: return classDollarSym;
duke@1: }
duke@1:
duke@1: /** Generate code for class$(String name). */
duke@1: JCBlock classDollarSymBody(DiagnosticPosition pos, JCMethodDecl md) {
duke@1: MethodSymbol classDollarSym = md.sym;
duke@1: ClassSymbol outerCacheClass = (ClassSymbol)classDollarSym.owner;
duke@1:
duke@1: JCBlock returnResult;
duke@1:
duke@1: // in 1.4.2 and above, we use
duke@1: // Class.forName(String name, boolean init, ClassLoader loader);
duke@1: // which requires we cache the current loader in cl$
duke@1: if (target.classLiteralsNoInit()) {
duke@1: // clsym = "private static ClassLoader cl$"
duke@1: VarSymbol clsym = new VarSymbol(STATIC|SYNTHETIC,
duke@1: names.fromString("cl" + target.syntheticNameChar()),
duke@1: syms.classLoaderType,
duke@1: outerCacheClass);
duke@1: enterSynthetic(pos, clsym, outerCacheClass.members());
duke@1:
duke@1: // emit "private static ClassLoader cl$;"
duke@1: JCVariableDecl cldef = make.VarDef(clsym, null);
duke@1: JCClassDecl outerCacheClassDef = classDef(outerCacheClass);
duke@1: outerCacheClassDef.defs = outerCacheClassDef.defs.prepend(cldef);
duke@1:
duke@1: // newcache := "new cache$1[0]"
duke@1: JCNewArray newcache = make.
duke@1: NewArray(make.Type(outerCacheClass.type),
duke@1: List.of(make.Literal(INT, 0).setType(syms.intType)),
duke@1: null);
duke@1: newcache.type = new ArrayType(types.erasure(outerCacheClass.type),
duke@1: syms.arrayClass);
duke@1:
duke@1: // forNameSym := java.lang.Class.forName(
duke@1: // String s,boolean init,ClassLoader loader)
duke@1: Symbol forNameSym = lookupMethod(make_pos, names.forName,
duke@1: types.erasure(syms.classType),
duke@1: List.of(syms.stringType,
duke@1: syms.booleanType,
duke@1: syms.classLoaderType));
duke@1: // clvalue := "(cl$ == null) ?
duke@1: // $newcache.getClass().getComponentType().getClassLoader() : cl$"
duke@1: JCExpression clvalue =
duke@1: make.Conditional(
duke@1: makeBinary(JCTree.EQ, make.Ident(clsym), makeNull()),
duke@1: make.Assign(
duke@1: make.Ident(clsym),
duke@1: makeCall(
duke@1: makeCall(makeCall(newcache,
duke@1: names.getClass,
duke@1: List.nil()),
duke@1: names.getComponentType,
duke@1: List.nil()),
duke@1: names.getClassLoader,
duke@1: List.nil())).setType(syms.classLoaderType),
duke@1: make.Ident(clsym)).setType(syms.classLoaderType);
duke@1:
duke@1: // returnResult := "{ return Class.forName(param1, false, cl$); }"
duke@1: List args = List.of(make.Ident(md.params.head.sym),
duke@1: makeLit(syms.booleanType, 0),
duke@1: clvalue);
duke@1: returnResult = make.
duke@1: Block(0, List.of(make.
duke@1: Call(make. // return
duke@1: App(make.
duke@1: Ident(forNameSym), args))));
duke@1: } else {
duke@1: // forNameSym := java.lang.Class.forName(String s)
duke@1: Symbol forNameSym = lookupMethod(make_pos,
duke@1: names.forName,
duke@1: types.erasure(syms.classType),
duke@1: List.of(syms.stringType));
duke@1: // returnResult := "{ return Class.forName(param1); }"
duke@1: returnResult = make.
duke@1: Block(0, List.of(make.
duke@1: Call(make. // return
duke@1: App(make.
duke@1: QualIdent(forNameSym),
duke@1: List.of(make.
duke@1: Ident(md.params.
duke@1: head.sym))))));
duke@1: }
duke@1:
duke@1: // catchParam := ClassNotFoundException e1
duke@1: VarSymbol catchParam =
duke@1: new VarSymbol(0, make.paramName(1),
duke@1: syms.classNotFoundExceptionType,
duke@1: classDollarSym);
duke@1:
duke@1: JCStatement rethrow;
duke@1: if (target.hasInitCause()) {
duke@1: // rethrow = "throw new NoClassDefFoundError().initCause(e);
duke@1: JCTree throwExpr =
duke@1: makeCall(makeNewClass(syms.noClassDefFoundErrorType,
duke@1: List.nil()),
duke@1: names.initCause,
duke@1: List.of(make.Ident(catchParam)));
duke@1: rethrow = make.Throw(throwExpr);
duke@1: } else {
duke@1: // getMessageSym := ClassNotFoundException.getMessage()
duke@1: Symbol getMessageSym = lookupMethod(make_pos,
duke@1: names.getMessage,
duke@1: syms.classNotFoundExceptionType,
duke@1: List.nil());
duke@1: // rethrow = "throw new NoClassDefFoundError(e.getMessage());"
duke@1: rethrow = make.
duke@1: Throw(makeNewClass(syms.noClassDefFoundErrorType,
duke@1: List.of(make.App(make.Select(make.Ident(catchParam),
duke@1: getMessageSym),
duke@1: List.nil()))));
duke@1: }
duke@1:
duke@1: // rethrowStmt := "( $rethrow )"
duke@1: JCBlock rethrowStmt = make.Block(0, List.of(rethrow));
duke@1:
duke@1: // catchBlock := "catch ($catchParam) $rethrowStmt"
duke@1: JCCatch catchBlock = make.Catch(make.VarDef(catchParam, null),
duke@1: rethrowStmt);
duke@1:
duke@1: // tryCatch := "try $returnResult $catchBlock"
duke@1: JCStatement tryCatch = make.Try(returnResult,
duke@1: List.of(catchBlock), null);
duke@1:
duke@1: return make.Block(0, List.of(tryCatch));
duke@1: }
duke@1: // where
duke@1: /** Create an attributed tree of the form left.name(). */
duke@1: private JCMethodInvocation makeCall(JCExpression left, Name name, List args) {
jjg@816: Assert.checkNonNull(left.type);
duke@1: Symbol funcsym = lookupMethod(make_pos, name, left.type,
duke@1: TreeInfo.types(args));
duke@1: return make.App(make.Select(left, funcsym), args);
duke@1: }
duke@1:
duke@1: /** The Name Of The variable to cache T.class values.
duke@1: * @param sig The signature of type T.
duke@1: */
duke@1: private Name cacheName(String sig) {
duke@1: StringBuffer buf = new StringBuffer();
duke@1: if (sig.startsWith("[")) {
duke@1: buf = buf.append("array");
duke@1: while (sig.startsWith("[")) {
duke@1: buf = buf.append(target.syntheticNameChar());
duke@1: sig = sig.substring(1);
duke@1: }
duke@1: if (sig.startsWith("L")) {
duke@1: sig = sig.substring(0, sig.length() - 1);
duke@1: }
duke@1: } else {
duke@1: buf = buf.append("class" + target.syntheticNameChar());
duke@1: }
duke@1: buf = buf.append(sig.replace('.', target.syntheticNameChar()));
duke@1: return names.fromString(buf.toString());
duke@1: }
duke@1:
duke@1: /** The variable symbol that caches T.class values.
duke@1: * If none exists yet, create a definition.
duke@1: * @param sig The signature of type T.
duke@1: * @param pos The position to report diagnostics, if any.
duke@1: */
duke@1: private VarSymbol cacheSym(DiagnosticPosition pos, String sig) {
duke@1: ClassSymbol outerCacheClass = outerCacheClass();
duke@1: Name cname = cacheName(sig);
duke@1: VarSymbol cacheSym =
duke@1: (VarSymbol)lookupSynthetic(cname, outerCacheClass.members());
duke@1: if (cacheSym == null) {
duke@1: cacheSym = new VarSymbol(
duke@1: STATIC | SYNTHETIC, cname, types.erasure(syms.classType), outerCacheClass);
duke@1: enterSynthetic(pos, cacheSym, outerCacheClass.members());
duke@1:
duke@1: JCVariableDecl cacheDef = make.VarDef(cacheSym, null);
duke@1: JCClassDecl outerCacheClassDef = classDef(outerCacheClass);
duke@1: outerCacheClassDef.defs = outerCacheClassDef.defs.prepend(cacheDef);
duke@1: }
duke@1: return cacheSym;
duke@1: }
duke@1:
duke@1: /** The tree simulating a T.class expression.
duke@1: * @param clazz The tree identifying type T.
duke@1: */
duke@1: private JCExpression classOf(JCTree clazz) {
duke@1: return classOfType(clazz.type, clazz.pos());
duke@1: }
duke@1:
duke@1: private JCExpression classOfType(Type type, DiagnosticPosition pos) {
duke@1: switch (type.tag) {
duke@1: case BYTE: case SHORT: case CHAR: case INT: case LONG: case FLOAT:
duke@1: case DOUBLE: case BOOLEAN: case VOID:
duke@1: // replace with .TYPE
duke@1: ClassSymbol c = types.boxedClass(type);
duke@1: Symbol typeSym =
duke@1: rs.access(
duke@1: rs.findIdentInType(attrEnv, c.type, names.TYPE, VAR),
duke@1: pos, c.type, names.TYPE, true);
duke@1: if (typeSym.kind == VAR)
duke@1: ((VarSymbol)typeSym).getConstValue(); // ensure initializer is evaluated
duke@1: return make.QualIdent(typeSym);
duke@1: case CLASS: case ARRAY:
duke@1: if (target.hasClassLiterals()) {
duke@1: VarSymbol sym = new VarSymbol(
duke@1: STATIC | PUBLIC | FINAL, names._class,
duke@1: syms.classType, type.tsym);
duke@1: return make_at(pos).Select(make.Type(type), sym);
duke@1: }
duke@1: // replace with
duke@1: // where
duke@1: // - is the type signature of T,
duke@1: // - is the cache variable for tsig.
duke@1: String sig =
duke@1: writer.xClassName(type).toString().replace('/', '.');
duke@1: Symbol cs = cacheSym(pos, sig);
duke@1: return make_at(pos).Conditional(
duke@1: makeBinary(JCTree.EQ, make.Ident(cs), makeNull()),
duke@1: make.Assign(
duke@1: make.Ident(cs),
duke@1: make.App(
duke@1: make.Ident(classDollarSym(pos)),
duke@1: List.of(make.Literal(CLASS, sig)
duke@1: .setType(syms.stringType))))
duke@1: .setType(types.erasure(syms.classType)),
duke@1: make.Ident(cs)).setType(types.erasure(syms.classType));
duke@1: default:
duke@1: throw new AssertionError();
duke@1: }
duke@1: }
duke@1:
duke@1: /**************************************************************************
duke@1: * Code for enabling/disabling assertions.
duke@1: *************************************************************************/
duke@1:
duke@1: // This code is not particularly robust if the user has
duke@1: // previously declared a member named '$assertionsDisabled'.
duke@1: // The same faulty idiom also appears in the translation of
duke@1: // class literals above. We should report an error if a
duke@1: // previous declaration is not synthetic.
duke@1:
duke@1: private JCExpression assertFlagTest(DiagnosticPosition pos) {
duke@1: // Outermost class may be either true class or an interface.
duke@1: ClassSymbol outermostClass = outermostClassDef.sym;
duke@1:
duke@1: // note that this is a class, as an interface can't contain a statement.
duke@1: ClassSymbol container = currentClass;
duke@1:
duke@1: VarSymbol assertDisabledSym =
duke@1: (VarSymbol)lookupSynthetic(dollarAssertionsDisabled,
duke@1: container.members());
duke@1: if (assertDisabledSym == null) {
duke@1: assertDisabledSym =
duke@1: new VarSymbol(STATIC | FINAL | SYNTHETIC,
duke@1: dollarAssertionsDisabled,
duke@1: syms.booleanType,
duke@1: container);
duke@1: enterSynthetic(pos, assertDisabledSym, container.members());
duke@1: Symbol desiredAssertionStatusSym = lookupMethod(pos,
duke@1: names.desiredAssertionStatus,
duke@1: types.erasure(syms.classType),
duke@1: List.nil());
duke@1: JCClassDecl containerDef = classDef(container);
duke@1: make_at(containerDef.pos());
duke@1: JCExpression notStatus = makeUnary(JCTree.NOT, make.App(make.Select(
duke@1: classOfType(types.erasure(outermostClass.type),
duke@1: containerDef.pos()),
duke@1: desiredAssertionStatusSym)));
duke@1: JCVariableDecl assertDisabledDef = make.VarDef(assertDisabledSym,
duke@1: notStatus);
duke@1: containerDef.defs = containerDef.defs.prepend(assertDisabledDef);
duke@1: }
duke@1: make_at(pos);
duke@1: return makeUnary(JCTree.NOT, make.Ident(assertDisabledSym));
duke@1: }
duke@1:
duke@1:
duke@1: /**************************************************************************
duke@1: * Building blocks for let expressions
duke@1: *************************************************************************/
duke@1:
duke@1: interface TreeBuilder {
duke@1: JCTree build(JCTree arg);
duke@1: }
duke@1:
duke@1: /** Construct an expression using the builder, with the given rval
duke@1: * expression as an argument to the builder. However, the rval
duke@1: * expression must be computed only once, even if used multiple
duke@1: * times in the result of the builder. We do that by
duke@1: * constructing a "let" expression that saves the rvalue into a
duke@1: * temporary variable and then uses the temporary variable in
duke@1: * place of the expression built by the builder. The complete
duke@1: * resulting expression is of the form
duke@1: *
duke@1: * (let TYPE TEMP = RVAL;
duke@1: * in (BUILDER(TEMP)))
duke@1: *
duke@1: * where TEMP
is a newly declared variable
duke@1: * in the let expression.
duke@1: */
duke@1: JCTree abstractRval(JCTree rval, Type type, TreeBuilder builder) {
duke@1: rval = TreeInfo.skipParens(rval);
duke@1: switch (rval.getTag()) {
duke@1: case JCTree.LITERAL:
duke@1: return builder.build(rval);
duke@1: case JCTree.IDENT:
duke@1: JCIdent id = (JCIdent) rval;
duke@1: if ((id.sym.flags() & FINAL) != 0 && id.sym.owner.kind == MTH)
duke@1: return builder.build(rval);
duke@1: }
duke@1: VarSymbol var =
duke@1: new VarSymbol(FINAL|SYNTHETIC,
jjg@113: names.fromString(
duke@1: target.syntheticNameChar()
duke@1: + "" + rval.hashCode()),
duke@1: type,
duke@1: currentMethodSym);
mcimadamore@4: rval = convert(rval,type);
duke@1: JCVariableDecl def = make.VarDef(var, (JCExpression)rval); // XXX cast
duke@1: JCTree built = builder.build(make.Ident(var));
duke@1: JCTree res = make.LetExpr(def, built);
duke@1: res.type = built.type;
duke@1: return res;
duke@1: }
duke@1:
duke@1: // same as above, with the type of the temporary variable computed
duke@1: JCTree abstractRval(JCTree rval, TreeBuilder builder) {
duke@1: return abstractRval(rval, rval.type, builder);
duke@1: }
duke@1:
duke@1: // same as above, but for an expression that may be used as either
duke@1: // an rvalue or an lvalue. This requires special handling for
duke@1: // Select expressions, where we place the left-hand-side of the
duke@1: // select in a temporary, and for Indexed expressions, where we
duke@1: // place both the indexed expression and the index value in temps.
duke@1: JCTree abstractLval(JCTree lval, final TreeBuilder builder) {
duke@1: lval = TreeInfo.skipParens(lval);
duke@1: switch (lval.getTag()) {
duke@1: case JCTree.IDENT:
duke@1: return builder.build(lval);
duke@1: case JCTree.SELECT: {
duke@1: final JCFieldAccess s = (JCFieldAccess)lval;
duke@1: JCTree selected = TreeInfo.skipParens(s.selected);
duke@1: Symbol lid = TreeInfo.symbol(s.selected);
duke@1: if (lid != null && lid.kind == TYP) return builder.build(lval);
duke@1: return abstractRval(s.selected, new TreeBuilder() {
duke@1: public JCTree build(final JCTree selected) {
duke@1: return builder.build(make.Select((JCExpression)selected, s.sym));
duke@1: }
duke@1: });
duke@1: }
duke@1: case JCTree.INDEXED: {
duke@1: final JCArrayAccess i = (JCArrayAccess)lval;
duke@1: return abstractRval(i.indexed, new TreeBuilder() {
duke@1: public JCTree build(final JCTree indexed) {
duke@1: return abstractRval(i.index, syms.intType, new TreeBuilder() {
duke@1: public JCTree build(final JCTree index) {
duke@1: JCTree newLval = make.Indexed((JCExpression)indexed,
duke@1: (JCExpression)index);
duke@1: newLval.setType(i.type);
duke@1: return builder.build(newLval);
duke@1: }
duke@1: });
duke@1: }
duke@1: });
duke@1: }
mcimadamore@133: case JCTree.TYPECAST: {
mcimadamore@133: return abstractLval(((JCTypeCast)lval).expr, builder);
mcimadamore@133: }
duke@1: }
duke@1: throw new AssertionError(lval);
duke@1: }
duke@1:
duke@1: // evaluate and discard the first expression, then evaluate the second.
duke@1: JCTree makeComma(final JCTree expr1, final JCTree expr2) {
duke@1: return abstractRval(expr1, new TreeBuilder() {
duke@1: public JCTree build(final JCTree discarded) {
duke@1: return expr2;
duke@1: }
duke@1: });
duke@1: }
duke@1:
duke@1: /**************************************************************************
duke@1: * Translation methods
duke@1: *************************************************************************/
duke@1:
duke@1: /** Visitor argument: enclosing operator node.
duke@1: */
duke@1: private JCExpression enclOp;
duke@1:
duke@1: /** Visitor method: Translate a single node.
duke@1: * Attach the source position from the old tree to its replacement tree.
duke@1: */
duke@1: public T translate(T tree) {
duke@1: if (tree == null) {
duke@1: return null;
duke@1: } else {
duke@1: make_at(tree.pos());
duke@1: T result = super.translate(tree);
duke@1: if (endPositions != null && result != tree) {
duke@1: Integer endPos = endPositions.remove(tree);
duke@1: if (endPos != null) endPositions.put(result, endPos);
duke@1: }
duke@1: return result;
duke@1: }
duke@1: }
duke@1:
duke@1: /** Visitor method: Translate a single node, boxing or unboxing if needed.
duke@1: */
duke@1: public T translate(T tree, Type type) {
duke@1: return (tree == null) ? null : boxIfNeeded(translate(tree), type);
duke@1: }
duke@1:
duke@1: /** Visitor method: Translate tree.
duke@1: */
duke@1: public T translate(T tree, JCExpression enclOp) {
duke@1: JCExpression prevEnclOp = this.enclOp;
duke@1: this.enclOp = enclOp;
duke@1: T res = translate(tree);
duke@1: this.enclOp = prevEnclOp;
duke@1: return res;
duke@1: }
duke@1:
duke@1: /** Visitor method: Translate list of trees.
duke@1: */
duke@1: public List translate(List trees, JCExpression enclOp) {
duke@1: JCExpression prevEnclOp = this.enclOp;
duke@1: this.enclOp = enclOp;
duke@1: List res = translate(trees);
duke@1: this.enclOp = prevEnclOp;
duke@1: return res;
duke@1: }
duke@1:
duke@1: /** Visitor method: Translate list of trees.
duke@1: */
duke@1: public List translate(List trees, Type type) {
duke@1: if (trees == null) return null;
duke@1: for (List l = trees; l.nonEmpty(); l = l.tail)
duke@1: l.head = translate(l.head, type);
duke@1: return trees;
duke@1: }
duke@1:
duke@1: public void visitTopLevel(JCCompilationUnit tree) {
jjg@657: if (needPackageInfoClass(tree)) {
duke@1: Name name = names.package_info;
duke@1: long flags = Flags.ABSTRACT | Flags.INTERFACE;
duke@1: if (target.isPackageInfoSynthetic())
duke@1: // package-info is marked SYNTHETIC in JDK 1.6 and later releases
duke@1: flags = flags | Flags.SYNTHETIC;
duke@1: JCClassDecl packageAnnotationsClass
duke@1: = make.ClassDef(make.Modifiers(flags,
duke@1: tree.packageAnnotations),
duke@1: name, List.nil(),
duke@1: null, List.nil(), List.nil());
jjg@483: ClassSymbol c = tree.packge.package_info;
jjg@483: c.flags_field |= flags;
duke@1: c.attributes_field = tree.packge.attributes_field;
duke@1: ClassType ctype = (ClassType) c.type;
duke@1: ctype.supertype_field = syms.objectType;
duke@1: ctype.interfaces_field = List.nil();
duke@1: packageAnnotationsClass.sym = c;
duke@1:
duke@1: translated.append(packageAnnotationsClass);
duke@1: }
duke@1: }
jjg@657: // where
jjg@657: private boolean needPackageInfoClass(JCCompilationUnit tree) {
jjg@657: switch (pkginfoOpt) {
jjg@657: case ALWAYS:
jjg@657: return true;
jjg@657: case LEGACY:
jjg@657: return tree.packageAnnotations.nonEmpty();
jjg@657: case NONEMPTY:
jjg@657: for (Attribute.Compound a: tree.packge.attributes_field) {
jjg@657: Attribute.RetentionPolicy p = types.getRetention(a);
jjg@657: if (p != Attribute.RetentionPolicy.SOURCE)
jjg@657: return true;
jjg@657: }
jjg@657: return false;
jjg@657: }
jjg@657: throw new AssertionError();
jjg@657: }
duke@1:
duke@1: public void visitClassDef(JCClassDecl tree) {
duke@1: ClassSymbol currentClassPrev = currentClass;
duke@1: MethodSymbol currentMethodSymPrev = currentMethodSym;
duke@1: currentClass = tree.sym;
duke@1: currentMethodSym = null;
duke@1: classdefs.put(currentClass, tree);
duke@1:
duke@1: proxies = proxies.dup(currentClass);
duke@1: List prevOuterThisStack = outerThisStack;
duke@1:
duke@1: // If this is an enum definition
duke@1: if ((tree.mods.flags & ENUM) != 0 &&
duke@1: (types.supertype(currentClass.type).tsym.flags() & ENUM) == 0)
duke@1: visitEnumDef(tree);
duke@1:
duke@1: // If this is a nested class, define a this$n field for
duke@1: // it and add to proxies.
duke@1: JCVariableDecl otdef = null;
duke@1: if (currentClass.hasOuterInstance())
duke@1: otdef = outerThisDef(tree.pos, currentClass);
duke@1:
duke@1: // If this is a local class, define proxies for all its free variables.
duke@1: List fvdefs = freevarDefs(
duke@1: tree.pos, freevars(currentClass), currentClass);
duke@1:
duke@1: // Recursively translate superclass, interfaces.
duke@1: tree.extending = translate(tree.extending);
duke@1: tree.implementing = translate(tree.implementing);
duke@1:
duke@1: // Recursively translate members, taking into account that new members
duke@1: // might be created during the translation and prepended to the member
duke@1: // list `tree.defs'.
duke@1: List seen = List.nil();
duke@1: while (tree.defs != seen) {
duke@1: List unseen = tree.defs;
duke@1: for (List l = unseen; l.nonEmpty() && l != seen; l = l.tail) {
duke@1: JCTree outermostMemberDefPrev = outermostMemberDef;
duke@1: if (outermostMemberDefPrev == null) outermostMemberDef = l.head;
duke@1: l.head = translate(l.head);
duke@1: outermostMemberDef = outermostMemberDefPrev;
duke@1: }
duke@1: seen = unseen;
duke@1: }
duke@1:
duke@1: // Convert a protected modifier to public, mask static modifier.
duke@1: if ((tree.mods.flags & PROTECTED) != 0) tree.mods.flags |= PUBLIC;
duke@1: tree.mods.flags &= ClassFlags;
duke@1:
duke@1: // Convert name to flat representation, replacing '.' by '$'.
duke@1: tree.name = Convert.shortName(currentClass.flatName());
duke@1:
duke@1: // Add this$n and free variables proxy definitions to class.
duke@1: for (List l = fvdefs; l.nonEmpty(); l = l.tail) {
duke@1: tree.defs = tree.defs.prepend(l.head);
duke@1: enterSynthetic(tree.pos(), l.head.sym, currentClass.members());
duke@1: }
duke@1: if (currentClass.hasOuterInstance()) {
duke@1: tree.defs = tree.defs.prepend(otdef);
duke@1: enterSynthetic(tree.pos(), otdef.sym, currentClass.members());
duke@1: }
duke@1:
duke@1: proxies = proxies.leave();
duke@1: outerThisStack = prevOuterThisStack;
duke@1:
duke@1: // Append translated tree to `translated' queue.
duke@1: translated.append(tree);
duke@1:
duke@1: currentClass = currentClassPrev;
duke@1: currentMethodSym = currentMethodSymPrev;
duke@1:
duke@1: // Return empty block {} as a placeholder for an inner class.
duke@1: result = make_at(tree.pos()).Block(0, List.nil());
duke@1: }
duke@1:
duke@1: /** Translate an enum class. */
duke@1: private void visitEnumDef(JCClassDecl tree) {
duke@1: make_at(tree.pos());
duke@1:
duke@1: // add the supertype, if needed
duke@1: if (tree.extending == null)
duke@1: tree.extending = make.Type(types.supertype(tree.type));
duke@1:
duke@1: // classOfType adds a cache field to tree.defs unless
duke@1: // target.hasClassLiterals().
duke@1: JCExpression e_class = classOfType(tree.sym.type, tree.pos()).
duke@1: setType(types.erasure(syms.classType));
duke@1:
duke@1: // process each enumeration constant, adding implicit constructor parameters
duke@1: int nextOrdinal = 0;
duke@1: ListBuffer values = new ListBuffer();
duke@1: ListBuffer enumDefs = new ListBuffer();
duke@1: ListBuffer otherDefs = new ListBuffer();
duke@1: for (List defs = tree.defs;
duke@1: defs.nonEmpty();
duke@1: defs=defs.tail) {
duke@1: if (defs.head.getTag() == JCTree.VARDEF && (((JCVariableDecl) defs.head).mods.flags & ENUM) != 0) {
duke@1: JCVariableDecl var = (JCVariableDecl)defs.head;
duke@1: visitEnumConstantDef(var, nextOrdinal++);
duke@1: values.append(make.QualIdent(var.sym));
duke@1: enumDefs.append(var);
duke@1: } else {
duke@1: otherDefs.append(defs.head);
duke@1: }
duke@1: }
duke@1:
duke@1: // private static final T[] #VALUES = { a, b, c };
duke@1: Name valuesName = names.fromString(target.syntheticNameChar() + "VALUES");
duke@1: while (tree.sym.members().lookup(valuesName).scope != null) // avoid name clash
duke@1: valuesName = names.fromString(valuesName + "" + target.syntheticNameChar());
duke@1: Type arrayType = new ArrayType(types.erasure(tree.type), syms.arrayClass);
duke@1: VarSymbol valuesVar = new VarSymbol(PRIVATE|FINAL|STATIC|SYNTHETIC,
duke@1: valuesName,
duke@1: arrayType,
duke@1: tree.type.tsym);
duke@1: JCNewArray newArray = make.NewArray(make.Type(types.erasure(tree.type)),
duke@1: List.nil(),
duke@1: values.toList());
duke@1: newArray.type = arrayType;
duke@1: enumDefs.append(make.VarDef(valuesVar, newArray));
duke@1: tree.sym.members().enter(valuesVar);
duke@1:
duke@1: Symbol valuesSym = lookupMethod(tree.pos(), names.values,
duke@1: tree.type, List.nil());
jjg@86: List valuesBody;
jjg@86: if (useClone()) {
jjg@86: // return (T[]) $VALUES.clone();
jjg@86: JCTypeCast valuesResult =
jjg@86: make.TypeCast(valuesSym.type.getReturnType(),
jjg@86: make.App(make.Select(make.Ident(valuesVar),
jjg@86: syms.arrayCloneMethod)));
jjg@86: valuesBody = List.of(make.Return(valuesResult));
jjg@86: } else {
jjg@86: // template: T[] $result = new T[$values.length];
jjg@86: Name resultName = names.fromString(target.syntheticNameChar() + "result");
jjg@86: while (tree.sym.members().lookup(resultName).scope != null) // avoid name clash
jjg@86: resultName = names.fromString(resultName + "" + target.syntheticNameChar());
jjg@86: VarSymbol resultVar = new VarSymbol(FINAL|SYNTHETIC,
jjg@86: resultName,
jjg@86: arrayType,
jjg@86: valuesSym);
jjg@86: JCNewArray resultArray = make.NewArray(make.Type(types.erasure(tree.type)),
jjg@86: List.of(make.Select(make.Ident(valuesVar), syms.lengthVar)),
jjg@86: null);
jjg@86: resultArray.type = arrayType;
jjg@86: JCVariableDecl decl = make.VarDef(resultVar, resultArray);
jjg@86:
jjg@86: // template: System.arraycopy($VALUES, 0, $result, 0, $VALUES.length);
jjg@86: if (systemArraycopyMethod == null) {
jjg@86: systemArraycopyMethod =
jjg@86: new MethodSymbol(PUBLIC | STATIC,
jjg@86: names.fromString("arraycopy"),
jjg@86: new MethodType(List.of(syms.objectType,
jjg@86: syms.intType,
jjg@86: syms.objectType,
jjg@86: syms.intType,
jjg@86: syms.intType),
jjg@86: syms.voidType,
jjg@86: List.nil(),
jjg@86: syms.methodClass),
jjg@86: syms.systemType.tsym);
jjg@86: }
jjg@86: JCStatement copy =
jjg@86: make.Exec(make.App(make.Select(make.Ident(syms.systemType.tsym),
jjg@86: systemArraycopyMethod),
jjg@86: List.of(make.Ident(valuesVar), make.Literal(0),
jjg@86: make.Ident(resultVar), make.Literal(0),
jjg@86: make.Select(make.Ident(valuesVar), syms.lengthVar))));
jjg@86:
jjg@86: // template: return $result;
jjg@86: JCStatement ret = make.Return(make.Ident(resultVar));
jjg@86: valuesBody = List.of(decl, copy, ret);
jjg@86: }
jjg@86:
duke@1: JCMethodDecl valuesDef =
jjg@86: make.MethodDef((MethodSymbol)valuesSym, make.Block(0, valuesBody));
jjg@86:
duke@1: enumDefs.append(valuesDef);
duke@1:
jjg@86: if (debugLower)
jjg@86: System.err.println(tree.sym + ".valuesDef = " + valuesDef);
jjg@86:
duke@1: /** The template for the following code is:
duke@1: *
duke@1: * public static E valueOf(String name) {
duke@1: * return (E)Enum.valueOf(E.class, name);
duke@1: * }
duke@1: *
duke@1: * where E is tree.sym
duke@1: */
duke@1: MethodSymbol valueOfSym = lookupMethod(tree.pos(),
duke@1: names.valueOf,
duke@1: tree.sym.type,
duke@1: List.of(syms.stringType));
jjg@816: Assert.check((valueOfSym.flags() & STATIC) != 0);
duke@1: VarSymbol nameArgSym = valueOfSym.params.head;
duke@1: JCIdent nameVal = make.Ident(nameArgSym);
duke@1: JCStatement enum_ValueOf =
duke@1: make.Return(make.TypeCast(tree.sym.type,
duke@1: makeCall(make.Ident(syms.enumSym),
duke@1: names.valueOf,
duke@1: List.of(e_class, nameVal))));
duke@1: JCMethodDecl valueOf = make.MethodDef(valueOfSym,
duke@1: make.Block(0, List.of(enum_ValueOf)));
duke@1: nameVal.sym = valueOf.params.head.sym;
duke@1: if (debugLower)
duke@1: System.err.println(tree.sym + ".valueOf = " + valueOf);
duke@1: enumDefs.append(valueOf);
duke@1:
duke@1: enumDefs.appendList(otherDefs.toList());
duke@1: tree.defs = enumDefs.toList();
duke@1:
duke@1: // Add the necessary members for the EnumCompatibleMode
duke@1: if (target.compilerBootstrap(tree.sym)) {
duke@1: addEnumCompatibleMembers(tree);
duke@1: }
duke@1: }
jjg@86: // where
jjg@86: private MethodSymbol systemArraycopyMethod;
jjg@86: private boolean useClone() {
jjg@86: try {
jjg@86: Scope.Entry e = syms.objectType.tsym.members().lookup(names.clone);
jjg@86: return (e.sym != null);
jjg@86: }
jjg@86: catch (CompletionFailure e) {
jjg@86: return false;
jjg@86: }
jjg@86: }
duke@1:
duke@1: /** Translate an enumeration constant and its initializer. */
duke@1: private void visitEnumConstantDef(JCVariableDecl var, int ordinal) {
duke@1: JCNewClass varDef = (JCNewClass)var.init;
duke@1: varDef.args = varDef.args.
duke@1: prepend(makeLit(syms.intType, ordinal)).
duke@1: prepend(makeLit(syms.stringType, var.name.toString()));
duke@1: }
duke@1:
duke@1: public void visitMethodDef(JCMethodDecl tree) {
duke@1: if (tree.name == names.init && (currentClass.flags_field&ENUM) != 0) {
duke@1: // Add "String $enum$name, int $enum$ordinal" to the beginning of the
duke@1: // argument list for each constructor of an enum.
duke@1: JCVariableDecl nameParam = make_at(tree.pos()).
duke@1: Param(names.fromString(target.syntheticNameChar() +
duke@1: "enum" + target.syntheticNameChar() + "name"),
duke@1: syms.stringType, tree.sym);
duke@1: nameParam.mods.flags |= SYNTHETIC; nameParam.sym.flags_field |= SYNTHETIC;
duke@1:
duke@1: JCVariableDecl ordParam = make.
duke@1: Param(names.fromString(target.syntheticNameChar() +
duke@1: "enum" + target.syntheticNameChar() +
duke@1: "ordinal"),
duke@1: syms.intType, tree.sym);
duke@1: ordParam.mods.flags |= SYNTHETIC; ordParam.sym.flags_field |= SYNTHETIC;
duke@1:
duke@1: tree.params = tree.params.prepend(ordParam).prepend(nameParam);
duke@1:
duke@1: MethodSymbol m = tree.sym;
duke@1: Type olderasure = m.erasure(types);
duke@1: m.erasure_field = new MethodType(
duke@1: olderasure.getParameterTypes().prepend(syms.intType).prepend(syms.stringType),
duke@1: olderasure.getReturnType(),
duke@1: olderasure.getThrownTypes(),
duke@1: syms.methodClass);
duke@1:
duke@1: if (target.compilerBootstrap(m.owner)) {
duke@1: // Initialize synthetic name field
duke@1: Symbol nameVarSym = lookupSynthetic(names.fromString("$name"),
duke@1: tree.sym.owner.members());
duke@1: JCIdent nameIdent = make.Ident(nameParam.sym);
duke@1: JCIdent id1 = make.Ident(nameVarSym);
duke@1: JCAssign newAssign = make.Assign(id1, nameIdent);
duke@1: newAssign.type = id1.type;
duke@1: JCExpressionStatement nameAssign = make.Exec(newAssign);
duke@1: nameAssign.type = id1.type;
duke@1: tree.body.stats = tree.body.stats.prepend(nameAssign);
duke@1:
duke@1: // Initialize synthetic ordinal field
duke@1: Symbol ordinalVarSym = lookupSynthetic(names.fromString("$ordinal"),
duke@1: tree.sym.owner.members());
duke@1: JCIdent ordIdent = make.Ident(ordParam.sym);
duke@1: id1 = make.Ident(ordinalVarSym);
duke@1: newAssign = make.Assign(id1, ordIdent);
duke@1: newAssign.type = id1.type;
duke@1: JCExpressionStatement ordinalAssign = make.Exec(newAssign);
duke@1: ordinalAssign.type = id1.type;
duke@1: tree.body.stats = tree.body.stats.prepend(ordinalAssign);
duke@1: }
duke@1: }
duke@1:
duke@1: JCMethodDecl prevMethodDef = currentMethodDef;
duke@1: MethodSymbol prevMethodSym = currentMethodSym;
duke@1: try {
duke@1: currentMethodDef = tree;
duke@1: currentMethodSym = tree.sym;
duke@1: visitMethodDefInternal(tree);
duke@1: } finally {
duke@1: currentMethodDef = prevMethodDef;
duke@1: currentMethodSym = prevMethodSym;
duke@1: }
duke@1: }
duke@1: //where
duke@1: private void visitMethodDefInternal(JCMethodDecl tree) {
duke@1: if (tree.name == names.init &&
duke@1: (currentClass.isInner() ||
duke@1: (currentClass.owner.kind & (VAR | MTH)) != 0)) {
duke@1: // We are seeing a constructor of an inner class.
duke@1: MethodSymbol m = tree.sym;
duke@1:
duke@1: // Push a new proxy scope for constructor parameters.
duke@1: // and create definitions for any this$n and proxy parameters.
duke@1: proxies = proxies.dup(m);
duke@1: List prevOuterThisStack = outerThisStack;
duke@1: List fvs = freevars(currentClass);
duke@1: JCVariableDecl otdef = null;
duke@1: if (currentClass.hasOuterInstance())
duke@1: otdef = outerThisDef(tree.pos, m);
duke@1: List fvdefs = freevarDefs(tree.pos, fvs, m);
duke@1:
duke@1: // Recursively translate result type, parameters and thrown list.
duke@1: tree.restype = translate(tree.restype);
duke@1: tree.params = translateVarDefs(tree.params);
duke@1: tree.thrown = translate(tree.thrown);
duke@1:
duke@1: // when compiling stubs, don't process body
duke@1: if (tree.body == null) {
duke@1: result = tree;
duke@1: return;
duke@1: }
duke@1:
duke@1: // Add this$n (if needed) in front of and free variables behind
duke@1: // constructor parameter list.
duke@1: tree.params = tree.params.appendList(fvdefs);
duke@1: if (currentClass.hasOuterInstance())
duke@1: tree.params = tree.params.prepend(otdef);
duke@1:
duke@1: // If this is an initial constructor, i.e., it does not start with
duke@1: // this(...), insert initializers for this$n and proxies
duke@1: // before (pre-1.4, after) the call to superclass constructor.
duke@1: JCStatement selfCall = translate(tree.body.stats.head);
duke@1:
duke@1: List added = List.nil();
duke@1: if (fvs.nonEmpty()) {
duke@1: List addedargtypes = List.nil();
duke@1: for (List l = fvs; l.nonEmpty(); l = l.tail) {
duke@1: if (TreeInfo.isInitialConstructor(tree))
duke@1: added = added.prepend(
duke@1: initField(tree.body.pos, proxyName(l.head.name)));
duke@1: addedargtypes = addedargtypes.prepend(l.head.erasure(types));
duke@1: }
duke@1: Type olderasure = m.erasure(types);
duke@1: m.erasure_field = new MethodType(
duke@1: olderasure.getParameterTypes().appendList(addedargtypes),
duke@1: olderasure.getReturnType(),
duke@1: olderasure.getThrownTypes(),
duke@1: syms.methodClass);
duke@1: }
duke@1: if (currentClass.hasOuterInstance() &&
duke@1: TreeInfo.isInitialConstructor(tree))
duke@1: {
duke@1: added = added.prepend(initOuterThis(tree.body.pos));
duke@1: }
duke@1:
duke@1: // pop local variables from proxy stack
duke@1: proxies = proxies.leave();
duke@1:
duke@1: // recursively translate following local statements and
duke@1: // combine with this- or super-call
duke@1: List stats = translate(tree.body.stats.tail);
duke@1: if (target.initializeFieldsBeforeSuper())
duke@1: tree.body.stats = stats.prepend(selfCall).prependList(added);
duke@1: else
duke@1: tree.body.stats = stats.prependList(added).prepend(selfCall);
duke@1:
duke@1: outerThisStack = prevOuterThisStack;
duke@1: } else {
duke@1: super.visitMethodDef(tree);
duke@1: }
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitTypeCast(JCTypeCast tree) {
duke@1: tree.clazz = translate(tree.clazz);
duke@1: if (tree.type.isPrimitive() != tree.expr.type.isPrimitive())
duke@1: tree.expr = translate(tree.expr, tree.type);
duke@1: else
duke@1: tree.expr = translate(tree.expr);
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitNewClass(JCNewClass tree) {
duke@1: ClassSymbol c = (ClassSymbol)tree.constructor.owner;
duke@1:
duke@1: // Box arguments, if necessary
duke@1: boolean isEnum = (tree.constructor.owner.flags() & ENUM) != 0;
duke@1: List argTypes = tree.constructor.type.getParameterTypes();
duke@1: if (isEnum) argTypes = argTypes.prepend(syms.intType).prepend(syms.stringType);
duke@1: tree.args = boxArgs(argTypes, tree.args, tree.varargsElement);
duke@1: tree.varargsElement = null;
duke@1:
duke@1: // If created class is local, add free variables after
duke@1: // explicit constructor arguments.
duke@1: if ((c.owner.kind & (VAR | MTH)) != 0) {
duke@1: tree.args = tree.args.appendList(loadFreevars(tree.pos(), freevars(c)));
duke@1: }
duke@1:
duke@1: // If an access constructor is used, append null as a last argument.
duke@1: Symbol constructor = accessConstructor(tree.pos(), tree.constructor);
duke@1: if (constructor != tree.constructor) {
duke@1: tree.args = tree.args.append(makeNull());
duke@1: tree.constructor = constructor;
duke@1: }
duke@1:
duke@1: // If created class has an outer instance, and new is qualified, pass
duke@1: // qualifier as first argument. If new is not qualified, pass the
duke@1: // correct outer instance as first argument.
duke@1: if (c.hasOuterInstance()) {
duke@1: JCExpression thisArg;
duke@1: if (tree.encl != null) {
duke@1: thisArg = attr.makeNullCheck(translate(tree.encl));
duke@1: thisArg.type = tree.encl.type;
duke@1: } else if ((c.owner.kind & (MTH | VAR)) != 0) {
duke@1: // local class
duke@1: thisArg = makeThis(tree.pos(), c.type.getEnclosingType().tsym);
duke@1: } else {
duke@1: // nested class
duke@1: thisArg = makeOwnerThis(tree.pos(), c, false);
duke@1: }
duke@1: tree.args = tree.args.prepend(thisArg);
duke@1: }
duke@1: tree.encl = null;
duke@1:
duke@1: // If we have an anonymous class, create its flat version, rather
duke@1: // than the class or interface following new.
duke@1: if (tree.def != null) {
duke@1: translate(tree.def);
duke@1: tree.clazz = access(make_at(tree.clazz.pos()).Ident(tree.def.sym));
duke@1: tree.def = null;
duke@1: } else {
duke@1: tree.clazz = access(c, tree.clazz, enclOp, false);
duke@1: }
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: // Simplify conditionals with known constant controlling expressions.
duke@1: // This allows us to avoid generating supporting declarations for
duke@1: // the dead code, which will not be eliminated during code generation.
duke@1: // Note that Flow.isFalse and Flow.isTrue only return true
duke@1: // for constant expressions in the sense of JLS 15.27, which
darcy@430: // are guaranteed to have no side-effects. More aggressive
duke@1: // constant propagation would require that we take care to
duke@1: // preserve possible side-effects in the condition expression.
duke@1:
duke@1: /** Visitor method for conditional expressions.
duke@1: */
duke@1: public void visitConditional(JCConditional tree) {
duke@1: JCTree cond = tree.cond = translate(tree.cond, syms.booleanType);
duke@1: if (cond.type.isTrue()) {
duke@1: result = convert(translate(tree.truepart, tree.type), tree.type);
duke@1: } else if (cond.type.isFalse()) {
duke@1: result = convert(translate(tree.falsepart, tree.type), tree.type);
duke@1: } else {
duke@1: // Condition is not a compile-time constant.
duke@1: tree.truepart = translate(tree.truepart, tree.type);
duke@1: tree.falsepart = translate(tree.falsepart, tree.type);
duke@1: result = tree;
duke@1: }
duke@1: }
duke@1: //where
duke@1: private JCTree convert(JCTree tree, Type pt) {
sundar@691: if (tree.type == pt || tree.type.tag == TypeTags.BOT)
sundar@691: return tree;
duke@1: JCTree result = make_at(tree.pos()).TypeCast(make.Type(pt), (JCExpression)tree);
duke@1: result.type = (tree.type.constValue() != null) ? cfolder.coerce(tree.type, pt)
duke@1: : pt;
duke@1: return result;
duke@1: }
duke@1:
duke@1: /** Visitor method for if statements.
duke@1: */
duke@1: public void visitIf(JCIf tree) {
duke@1: JCTree cond = tree.cond = translate(tree.cond, syms.booleanType);
duke@1: if (cond.type.isTrue()) {
duke@1: result = translate(tree.thenpart);
duke@1: } else if (cond.type.isFalse()) {
duke@1: if (tree.elsepart != null) {
duke@1: result = translate(tree.elsepart);
duke@1: } else {
duke@1: result = make.Skip();
duke@1: }
duke@1: } else {
duke@1: // Condition is not a compile-time constant.
duke@1: tree.thenpart = translate(tree.thenpart);
duke@1: tree.elsepart = translate(tree.elsepart);
duke@1: result = tree;
duke@1: }
duke@1: }
duke@1:
duke@1: /** Visitor method for assert statements. Translate them away.
duke@1: */
duke@1: public void visitAssert(JCAssert tree) {
duke@1: DiagnosticPosition detailPos = (tree.detail == null) ? tree.pos() : tree.detail.pos();
duke@1: tree.cond = translate(tree.cond, syms.booleanType);
duke@1: if (!tree.cond.type.isTrue()) {
duke@1: JCExpression cond = assertFlagTest(tree.pos());
duke@1: List exnArgs = (tree.detail == null) ?
duke@1: List.nil() : List.of(translate(tree.detail));
duke@1: if (!tree.cond.type.isFalse()) {
duke@1: cond = makeBinary
duke@1: (JCTree.AND,
duke@1: cond,
duke@1: makeUnary(JCTree.NOT, tree.cond));
duke@1: }
duke@1: result =
duke@1: make.If(cond,
duke@1: make_at(detailPos).
duke@1: Throw(makeNewClass(syms.assertionErrorType, exnArgs)),
duke@1: null);
duke@1: } else {
duke@1: result = make.Skip();
duke@1: }
duke@1: }
duke@1:
duke@1: public void visitApply(JCMethodInvocation tree) {
duke@1: Symbol meth = TreeInfo.symbol(tree.meth);
duke@1: List argtypes = meth.type.getParameterTypes();
duke@1: if (allowEnums &&
duke@1: meth.name==names.init &&
duke@1: meth.owner == syms.enumSym)
duke@1: argtypes = argtypes.tail.tail;
duke@1: tree.args = boxArgs(argtypes, tree.args, tree.varargsElement);
duke@1: tree.varargsElement = null;
duke@1: Name methName = TreeInfo.name(tree.meth);
duke@1: if (meth.name==names.init) {
duke@1: // We are seeing a this(...) or super(...) constructor call.
duke@1: // If an access constructor is used, append null as a last argument.
duke@1: Symbol constructor = accessConstructor(tree.pos(), meth);
duke@1: if (constructor != meth) {
duke@1: tree.args = tree.args.append(makeNull());
duke@1: TreeInfo.setSymbol(tree.meth, constructor);
duke@1: }
duke@1:
duke@1: // If we are calling a constructor of a local class, add
duke@1: // free variables after explicit constructor arguments.
duke@1: ClassSymbol c = (ClassSymbol)constructor.owner;
duke@1: if ((c.owner.kind & (VAR | MTH)) != 0) {
duke@1: tree.args = tree.args.appendList(loadFreevars(tree.pos(), freevars(c)));
duke@1: }
duke@1:
duke@1: // If we are calling a constructor of an enum class, pass
duke@1: // along the name and ordinal arguments
duke@1: if ((c.flags_field&ENUM) != 0 || c.getQualifiedName() == names.java_lang_Enum) {
duke@1: List params = currentMethodDef.params;
duke@1: if (currentMethodSym.owner.hasOuterInstance())
duke@1: params = params.tail; // drop this$n
duke@1: tree.args = tree.args
duke@1: .prepend(make_at(tree.pos()).Ident(params.tail.head.sym)) // ordinal
duke@1: .prepend(make.Ident(params.head.sym)); // name
duke@1: }
duke@1:
duke@1: // If we are calling a constructor of a class with an outer
duke@1: // instance, and the call
duke@1: // is qualified, pass qualifier as first argument in front of
duke@1: // the explicit constructor arguments. If the call
duke@1: // is not qualified, pass the correct outer instance as
duke@1: // first argument.
duke@1: if (c.hasOuterInstance()) {
duke@1: JCExpression thisArg;
duke@1: if (tree.meth.getTag() == JCTree.SELECT) {
duke@1: thisArg = attr.
duke@1: makeNullCheck(translate(((JCFieldAccess) tree.meth).selected));
duke@1: tree.meth = make.Ident(constructor);
duke@1: ((JCIdent) tree.meth).name = methName;
duke@1: } else if ((c.owner.kind & (MTH | VAR)) != 0 || methName == names._this){
duke@1: // local class or this() call
duke@1: thisArg = makeThis(tree.meth.pos(), c.type.getEnclosingType().tsym);
duke@1: } else {
duke@1: // super() call of nested class
duke@1: thisArg = makeOwnerThis(tree.meth.pos(), c, false);
duke@1: }
duke@1: tree.args = tree.args.prepend(thisArg);
duke@1: }
duke@1: } else {
duke@1: // We are seeing a normal method invocation; translate this as usual.
duke@1: tree.meth = translate(tree.meth);
duke@1:
duke@1: // If the translated method itself is an Apply tree, we are
duke@1: // seeing an access method invocation. In this case, append
duke@1: // the method arguments to the arguments of the access method.
duke@1: if (tree.meth.getTag() == JCTree.APPLY) {
duke@1: JCMethodInvocation app = (JCMethodInvocation)tree.meth;
duke@1: app.args = tree.args.prependList(app.args);
duke@1: result = app;
duke@1: return;
duke@1: }
duke@1: }
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: List boxArgs(List parameters, List _args, Type varargsElement) {
duke@1: List args = _args;
duke@1: if (parameters.isEmpty()) return args;
duke@1: boolean anyChanges = false;
duke@1: ListBuffer result = new ListBuffer();
duke@1: while (parameters.tail.nonEmpty()) {
duke@1: JCExpression arg = translate(args.head, parameters.head);
duke@1: anyChanges |= (arg != args.head);
duke@1: result.append(arg);
duke@1: args = args.tail;
duke@1: parameters = parameters.tail;
duke@1: }
duke@1: Type parameter = parameters.head;
duke@1: if (varargsElement != null) {
duke@1: anyChanges = true;
duke@1: ListBuffer elems = new ListBuffer();
duke@1: while (args.nonEmpty()) {
duke@1: JCExpression arg = translate(args.head, varargsElement);
duke@1: elems.append(arg);
duke@1: args = args.tail;
duke@1: }
duke@1: JCNewArray boxedArgs = make.NewArray(make.Type(varargsElement),
duke@1: List.nil(),
duke@1: elems.toList());
duke@1: boxedArgs.type = new ArrayType(varargsElement, syms.arrayClass);
duke@1: result.append(boxedArgs);
duke@1: } else {
duke@1: if (args.length() != 1) throw new AssertionError(args);
duke@1: JCExpression arg = translate(args.head, parameter);
duke@1: anyChanges |= (arg != args.head);
duke@1: result.append(arg);
duke@1: if (!anyChanges) return _args;
duke@1: }
duke@1: return result.toList();
duke@1: }
duke@1:
duke@1: /** Expand a boxing or unboxing conversion if needed. */
duke@1: @SuppressWarnings("unchecked") // XXX unchecked
duke@1: T boxIfNeeded(T tree, Type type) {
duke@1: boolean havePrimitive = tree.type.isPrimitive();
duke@1: if (havePrimitive == type.isPrimitive())
duke@1: return tree;
duke@1: if (havePrimitive) {
duke@1: Type unboxedTarget = types.unboxedType(type);
duke@1: if (unboxedTarget.tag != NONE) {
mcimadamore@253: if (!types.isSubtype(tree.type, unboxedTarget)) //e.g. Character c = 89;
mcimadamore@253: tree.type = unboxedTarget.constType(tree.type.constValue());
duke@1: return (T)boxPrimitive((JCExpression)tree, type);
duke@1: } else {
duke@1: tree = (T)boxPrimitive((JCExpression)tree);
duke@1: }
duke@1: } else {
duke@1: tree = (T)unbox((JCExpression)tree, type);
duke@1: }
duke@1: return tree;
duke@1: }
duke@1:
duke@1: /** Box up a single primitive expression. */
duke@1: JCExpression boxPrimitive(JCExpression tree) {
duke@1: return boxPrimitive(tree, types.boxedClass(tree.type).type);
duke@1: }
duke@1:
duke@1: /** Box up a single primitive expression. */
duke@1: JCExpression boxPrimitive(JCExpression tree, Type box) {
duke@1: make_at(tree.pos());
duke@1: if (target.boxWithConstructors()) {
duke@1: Symbol ctor = lookupConstructor(tree.pos(),
duke@1: box,
duke@1: List.nil()
duke@1: .prepend(tree.type));
duke@1: return make.Create(ctor, List.of(tree));
duke@1: } else {
duke@1: Symbol valueOfSym = lookupMethod(tree.pos(),
duke@1: names.valueOf,
duke@1: box,
duke@1: List.nil()
duke@1: .prepend(tree.type));
duke@1: return make.App(make.QualIdent(valueOfSym), List.of(tree));
duke@1: }
duke@1: }
duke@1:
duke@1: /** Unbox an object to a primitive value. */
duke@1: JCExpression unbox(JCExpression tree, Type primitive) {
duke@1: Type unboxedType = types.unboxedType(tree.type);
jrose@665: if (unboxedType.tag == NONE) {
jrose@665: unboxedType = primitive;
jrose@665: if (!unboxedType.isPrimitive())
jrose@665: throw new AssertionError(unboxedType);
jrose@665: make_at(tree.pos());
jrose@665: tree = make.TypeCast(types.boxedClass(unboxedType).type, tree);
jrose@665: } else {
jrose@665: // There must be a conversion from unboxedType to primitive.
jrose@665: if (!types.isSubtype(unboxedType, primitive))
jrose@665: throw new AssertionError(tree);
jrose@665: }
duke@1: make_at(tree.pos());
duke@1: Symbol valueSym = lookupMethod(tree.pos(),
duke@1: unboxedType.tsym.name.append(names.Value), // x.intValue()
duke@1: tree.type,
duke@1: List.nil());
duke@1: return make.App(make.Select(tree, valueSym));
duke@1: }
duke@1:
duke@1: /** Visitor method for parenthesized expressions.
duke@1: * If the subexpression has changed, omit the parens.
duke@1: */
duke@1: public void visitParens(JCParens tree) {
duke@1: JCTree expr = translate(tree.expr);
duke@1: result = ((expr == tree.expr) ? tree : expr);
duke@1: }
duke@1:
duke@1: public void visitIndexed(JCArrayAccess tree) {
duke@1: tree.indexed = translate(tree.indexed);
duke@1: tree.index = translate(tree.index, syms.intType);
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitAssign(JCAssign tree) {
duke@1: tree.lhs = translate(tree.lhs, tree);
duke@1: tree.rhs = translate(tree.rhs, tree.lhs.type);
duke@1:
duke@1: // If translated left hand side is an Apply, we are
duke@1: // seeing an access method invocation. In this case, append
duke@1: // right hand side as last argument of the access method.
duke@1: if (tree.lhs.getTag() == JCTree.APPLY) {
duke@1: JCMethodInvocation app = (JCMethodInvocation)tree.lhs;
duke@1: app.args = List.of(tree.rhs).prependList(app.args);
duke@1: result = app;
duke@1: } else {
duke@1: result = tree;
duke@1: }
duke@1: }
duke@1:
duke@1: public void visitAssignop(final JCAssignOp tree) {
duke@1: if (!tree.lhs.type.isPrimitive() &&
duke@1: tree.operator.type.getReturnType().isPrimitive()) {
duke@1: // boxing required; need to rewrite as x = (unbox typeof x)(x op y);
duke@1: // or if x == (typeof x)z then z = (unbox typeof x)((typeof x)z op y)
duke@1: // (but without recomputing x)
mcimadamore@133: JCTree newTree = abstractLval(tree.lhs, new TreeBuilder() {
duke@1: public JCTree build(final JCTree lhs) {
duke@1: int newTag = tree.getTag() - JCTree.ASGOffset;
duke@1: // Erasure (TransTypes) can change the type of
duke@1: // tree.lhs. However, we can still get the
duke@1: // unerased type of tree.lhs as it is stored
duke@1: // in tree.type in Attr.
duke@1: Symbol newOperator = rs.resolveBinaryOperator(tree.pos(),
duke@1: newTag,
duke@1: attrEnv,
duke@1: tree.type,
duke@1: tree.rhs.type);
duke@1: JCExpression expr = (JCExpression)lhs;
duke@1: if (expr.type != tree.type)
duke@1: expr = make.TypeCast(tree.type, expr);
duke@1: JCBinary opResult = make.Binary(newTag, expr, tree.rhs);
duke@1: opResult.operator = newOperator;
duke@1: opResult.type = newOperator.type.getReturnType();
duke@1: JCTypeCast newRhs = make.TypeCast(types.unboxedType(tree.type),
duke@1: opResult);
duke@1: return make.Assign((JCExpression)lhs, newRhs).setType(tree.type);
duke@1: }
duke@1: });
duke@1: result = translate(newTree);
duke@1: return;
duke@1: }
duke@1: tree.lhs = translate(tree.lhs, tree);
duke@1: tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head);
duke@1:
duke@1: // If translated left hand side is an Apply, we are
duke@1: // seeing an access method invocation. In this case, append
duke@1: // right hand side as last argument of the access method.
duke@1: if (tree.lhs.getTag() == JCTree.APPLY) {
duke@1: JCMethodInvocation app = (JCMethodInvocation)tree.lhs;
duke@1: // if operation is a += on strings,
duke@1: // make sure to convert argument to string
duke@1: JCExpression rhs = (((OperatorSymbol)tree.operator).opcode == string_add)
duke@1: ? makeString(tree.rhs)
duke@1: : tree.rhs;
duke@1: app.args = List.of(rhs).prependList(app.args);
duke@1: result = app;
duke@1: } else {
duke@1: result = tree;
duke@1: }
duke@1: }
duke@1:
duke@1: /** Lower a tree of the form e++ or e-- where e is an object type */
duke@1: JCTree lowerBoxedPostop(final JCUnary tree) {
duke@1: // translate to tmp1=lval(e); tmp2=tmp1; tmp1 OP 1; tmp2
duke@1: // or
duke@1: // translate to tmp1=lval(e); tmp2=tmp1; (typeof tree)tmp1 OP 1; tmp2
duke@1: // where OP is += or -=
mcimadamore@133: final boolean cast = TreeInfo.skipParens(tree.arg).getTag() == JCTree.TYPECAST;
mcimadamore@133: return abstractLval(tree.arg, new TreeBuilder() {
duke@1: public JCTree build(final JCTree tmp1) {
duke@1: return abstractRval(tmp1, tree.arg.type, new TreeBuilder() {
duke@1: public JCTree build(final JCTree tmp2) {
duke@1: int opcode = (tree.getTag() == JCTree.POSTINC)
duke@1: ? JCTree.PLUS_ASG : JCTree.MINUS_ASG;
duke@1: JCTree lhs = cast
duke@1: ? make.TypeCast(tree.arg.type, (JCExpression)tmp1)
duke@1: : tmp1;
duke@1: JCTree update = makeAssignop(opcode,
duke@1: lhs,
duke@1: make.Literal(1));
duke@1: return makeComma(update, tmp2);
duke@1: }
duke@1: });
duke@1: }
duke@1: });
duke@1: }
duke@1:
duke@1: public void visitUnary(JCUnary tree) {
duke@1: boolean isUpdateOperator =
duke@1: JCTree.PREINC <= tree.getTag() && tree.getTag() <= JCTree.POSTDEC;
duke@1: if (isUpdateOperator && !tree.arg.type.isPrimitive()) {
duke@1: switch(tree.getTag()) {
duke@1: case JCTree.PREINC: // ++ e
duke@1: // translate to e += 1
duke@1: case JCTree.PREDEC: // -- e
duke@1: // translate to e -= 1
duke@1: {
duke@1: int opcode = (tree.getTag() == JCTree.PREINC)
duke@1: ? JCTree.PLUS_ASG : JCTree.MINUS_ASG;
duke@1: JCAssignOp newTree = makeAssignop(opcode,
duke@1: tree.arg,
duke@1: make.Literal(1));
duke@1: result = translate(newTree, tree.type);
duke@1: return;
duke@1: }
duke@1: case JCTree.POSTINC: // e ++
duke@1: case JCTree.POSTDEC: // e --
duke@1: {
duke@1: result = translate(lowerBoxedPostop(tree), tree.type);
duke@1: return;
duke@1: }
duke@1: }
duke@1: throw new AssertionError(tree);
duke@1: }
duke@1:
duke@1: tree.arg = boxIfNeeded(translate(tree.arg, tree), tree.type);
duke@1:
duke@1: if (tree.getTag() == JCTree.NOT && tree.arg.type.constValue() != null) {
duke@1: tree.type = cfolder.fold1(bool_not, tree.arg.type);
duke@1: }
duke@1:
duke@1: // If translated left hand side is an Apply, we are
duke@1: // seeing an access method invocation. In this case, return
darcy@430: // that access method invocation as result.
duke@1: if (isUpdateOperator && tree.arg.getTag() == JCTree.APPLY) {
duke@1: result = tree.arg;
duke@1: } else {
duke@1: result = tree;
duke@1: }
duke@1: }
duke@1:
duke@1: public void visitBinary(JCBinary tree) {
duke@1: List formals = tree.operator.type.getParameterTypes();
duke@1: JCTree lhs = tree.lhs = translate(tree.lhs, formals.head);
duke@1: switch (tree.getTag()) {
duke@1: case JCTree.OR:
duke@1: if (lhs.type.isTrue()) {
duke@1: result = lhs;
duke@1: return;
duke@1: }
duke@1: if (lhs.type.isFalse()) {
duke@1: result = translate(tree.rhs, formals.tail.head);
duke@1: return;
duke@1: }
duke@1: break;
duke@1: case JCTree.AND:
duke@1: if (lhs.type.isFalse()) {
duke@1: result = lhs;
duke@1: return;
duke@1: }
duke@1: if (lhs.type.isTrue()) {
duke@1: result = translate(tree.rhs, formals.tail.head);
duke@1: return;
duke@1: }
duke@1: break;
duke@1: }
duke@1: tree.rhs = translate(tree.rhs, formals.tail.head);
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitIdent(JCIdent tree) {
duke@1: result = access(tree.sym, tree, enclOp, false);
duke@1: }
duke@1:
duke@1: /** Translate away the foreach loop. */
duke@1: public void visitForeachLoop(JCEnhancedForLoop tree) {
duke@1: if (types.elemtype(tree.expr.type) == null)
duke@1: visitIterableForeachLoop(tree);
duke@1: else
duke@1: visitArrayForeachLoop(tree);
duke@1: }
duke@1: // where
duke@1: /**
darcy@430: * A statement of the form
duke@1: *
duke@1: *
duke@1: * for ( T v : arrayexpr ) stmt;
duke@1: *
duke@1: *
duke@1: * (where arrayexpr is of an array type) gets translated to
duke@1: *
duke@1: *
duke@1: * for ( { arraytype #arr = arrayexpr;
duke@1: * int #len = array.length;
duke@1: * int #i = 0; };
duke@1: * #i < #len; i$++ ) {
duke@1: * T v = arr$[#i];
duke@1: * stmt;
duke@1: * }
duke@1: *
duke@1: *
duke@1: * where #arr, #len, and #i are freshly named synthetic local variables.
duke@1: */
duke@1: private void visitArrayForeachLoop(JCEnhancedForLoop tree) {
duke@1: make_at(tree.expr.pos());
duke@1: VarSymbol arraycache = new VarSymbol(0,
duke@1: names.fromString("arr" + target.syntheticNameChar()),
duke@1: tree.expr.type,
duke@1: currentMethodSym);
duke@1: JCStatement arraycachedef = make.VarDef(arraycache, tree.expr);
duke@1: VarSymbol lencache = new VarSymbol(0,
duke@1: names.fromString("len" + target.syntheticNameChar()),
duke@1: syms.intType,
duke@1: currentMethodSym);
duke@1: JCStatement lencachedef = make.
duke@1: VarDef(lencache, make.Select(make.Ident(arraycache), syms.lengthVar));
duke@1: VarSymbol index = new VarSymbol(0,
duke@1: names.fromString("i" + target.syntheticNameChar()),
duke@1: syms.intType,
duke@1: currentMethodSym);
duke@1:
duke@1: JCVariableDecl indexdef = make.VarDef(index, make.Literal(INT, 0));
duke@1: indexdef.init.type = indexdef.type = syms.intType.constType(0);
duke@1:
duke@1: List loopinit = List.of(arraycachedef, lencachedef, indexdef);
duke@1: JCBinary cond = makeBinary(JCTree.LT, make.Ident(index), make.Ident(lencache));
duke@1:
duke@1: JCExpressionStatement step = make.Exec(makeUnary(JCTree.PREINC, make.Ident(index)));
duke@1:
duke@1: Type elemtype = types.elemtype(tree.expr.type);
mcimadamore@33: JCExpression loopvarinit = make.Indexed(make.Ident(arraycache),
mcimadamore@33: make.Ident(index)).setType(elemtype);
mcimadamore@33: JCVariableDecl loopvardef = (JCVariableDecl)make.VarDef(tree.var.mods,
mcimadamore@33: tree.var.name,
mcimadamore@33: tree.var.vartype,
mcimadamore@33: loopvarinit).setType(tree.var.type);
mcimadamore@33: loopvardef.sym = tree.var.sym;
duke@1: JCBlock body = make.
mcimadamore@33: Block(0, List.of(loopvardef, tree.body));
duke@1:
duke@1: result = translate(make.
duke@1: ForLoop(loopinit,
duke@1: cond,
duke@1: List.of(step),
duke@1: body));
duke@1: patchTargets(body, tree, result);
duke@1: }
duke@1: /** Patch up break and continue targets. */
duke@1: private void patchTargets(JCTree body, final JCTree src, final JCTree dest) {
duke@1: class Patcher extends TreeScanner {
duke@1: public void visitBreak(JCBreak tree) {
duke@1: if (tree.target == src)
duke@1: tree.target = dest;
duke@1: }
duke@1: public void visitContinue(JCContinue tree) {
duke@1: if (tree.target == src)
duke@1: tree.target = dest;
duke@1: }
duke@1: public void visitClassDef(JCClassDecl tree) {}
duke@1: }
duke@1: new Patcher().scan(body);
duke@1: }
duke@1: /**
duke@1: * A statement of the form
duke@1: *
duke@1: *
duke@1: * for ( T v : coll ) stmt ;
duke@1: *
duke@1: *
duke@1: * (where coll implements Iterable extends T>) gets translated to
duke@1: *
duke@1: *
duke@1: * for ( Iterator extends T> #i = coll.iterator(); #i.hasNext(); ) {
duke@1: * T v = (T) #i.next();
duke@1: * stmt;
duke@1: * }
duke@1: *
duke@1: *
duke@1: * where #i is a freshly named synthetic local variable.
duke@1: */
duke@1: private void visitIterableForeachLoop(JCEnhancedForLoop tree) {
duke@1: make_at(tree.expr.pos());
duke@1: Type iteratorTarget = syms.objectType;
duke@1: Type iterableType = types.asSuper(types.upperBound(tree.expr.type),
duke@1: syms.iterableType.tsym);
duke@1: if (iterableType.getTypeArguments().nonEmpty())
duke@1: iteratorTarget = types.erasure(iterableType.getTypeArguments().head);
duke@1: Type eType = tree.expr.type;
duke@1: tree.expr.type = types.erasure(eType);
duke@1: if (eType.tag == TYPEVAR && eType.getUpperBound().isCompound())
duke@1: tree.expr = make.TypeCast(types.erasure(iterableType), tree.expr);
duke@1: Symbol iterator = lookupMethod(tree.expr.pos(),
duke@1: names.iterator,
duke@1: types.erasure(syms.iterableType),
duke@1: List.nil());
duke@1: VarSymbol itvar = new VarSymbol(0, names.fromString("i" + target.syntheticNameChar()),
duke@1: types.erasure(iterator.type.getReturnType()),
duke@1: currentMethodSym);
duke@1: JCStatement init = make.
duke@1: VarDef(itvar,
duke@1: make.App(make.Select(tree.expr, iterator)));
duke@1: Symbol hasNext = lookupMethod(tree.expr.pos(),
duke@1: names.hasNext,
duke@1: itvar.type,
duke@1: List.nil());
duke@1: JCMethodInvocation cond = make.App(make.Select(make.Ident(itvar), hasNext));
duke@1: Symbol next = lookupMethod(tree.expr.pos(),
duke@1: names.next,
duke@1: itvar.type,
duke@1: List.nil());
duke@1: JCExpression vardefinit = make.App(make.Select(make.Ident(itvar), next));
mcimadamore@81: if (tree.var.type.isPrimitive())
mcimadamore@81: vardefinit = make.TypeCast(types.upperBound(iteratorTarget), vardefinit);
mcimadamore@81: else
mcimadamore@81: vardefinit = make.TypeCast(tree.var.type, vardefinit);
mcimadamore@33: JCVariableDecl indexDef = (JCVariableDecl)make.VarDef(tree.var.mods,
mcimadamore@33: tree.var.name,
mcimadamore@33: tree.var.vartype,
mcimadamore@33: vardefinit).setType(tree.var.type);
mcimadamore@33: indexDef.sym = tree.var.sym;
duke@1: JCBlock body = make.Block(0, List.of(indexDef, tree.body));
mcimadamore@237: body.endpos = TreeInfo.endPos(tree.body);
duke@1: result = translate(make.
duke@1: ForLoop(List.of(init),
duke@1: cond,
duke@1: List.nil(),
duke@1: body));
duke@1: patchTargets(body, tree, result);
duke@1: }
duke@1:
duke@1: public void visitVarDef(JCVariableDecl tree) {
duke@1: MethodSymbol oldMethodSym = currentMethodSym;
duke@1: tree.mods = translate(tree.mods);
duke@1: tree.vartype = translate(tree.vartype);
duke@1: if (currentMethodSym == null) {
duke@1: // A class or instance field initializer.
duke@1: currentMethodSym =
duke@1: new MethodSymbol((tree.mods.flags&STATIC) | BLOCK,
duke@1: names.empty, null,
duke@1: currentClass);
duke@1: }
duke@1: if (tree.init != null) tree.init = translate(tree.init, tree.type);
duke@1: result = tree;
duke@1: currentMethodSym = oldMethodSym;
duke@1: }
duke@1:
duke@1: public void visitBlock(JCBlock tree) {
duke@1: MethodSymbol oldMethodSym = currentMethodSym;
duke@1: if (currentMethodSym == null) {
duke@1: // Block is a static or instance initializer.
duke@1: currentMethodSym =
duke@1: new MethodSymbol(tree.flags | BLOCK,
duke@1: names.empty, null,
duke@1: currentClass);
duke@1: }
duke@1: super.visitBlock(tree);
duke@1: currentMethodSym = oldMethodSym;
duke@1: }
duke@1:
duke@1: public void visitDoLoop(JCDoWhileLoop tree) {
duke@1: tree.body = translate(tree.body);
duke@1: tree.cond = translate(tree.cond, syms.booleanType);
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitWhileLoop(JCWhileLoop tree) {
duke@1: tree.cond = translate(tree.cond, syms.booleanType);
duke@1: tree.body = translate(tree.body);
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitForLoop(JCForLoop tree) {
duke@1: tree.init = translate(tree.init);
duke@1: if (tree.cond != null)
duke@1: tree.cond = translate(tree.cond, syms.booleanType);
duke@1: tree.step = translate(tree.step);
duke@1: tree.body = translate(tree.body);
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitReturn(JCReturn tree) {
duke@1: if (tree.expr != null)
duke@1: tree.expr = translate(tree.expr,
duke@1: types.erasure(currentMethodDef
duke@1: .restype.type));
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitSwitch(JCSwitch tree) {
duke@1: Type selsuper = types.supertype(tree.selector.type);
duke@1: boolean enumSwitch = selsuper != null &&
duke@1: (tree.selector.type.tsym.flags() & ENUM) != 0;
darcy@430: boolean stringSwitch = selsuper != null &&
darcy@430: types.isSameType(tree.selector.type, syms.stringType);
darcy@430: Type target = enumSwitch ? tree.selector.type :
darcy@430: (stringSwitch? syms.stringType : syms.intType);
duke@1: tree.selector = translate(tree.selector, target);
duke@1: tree.cases = translateCases(tree.cases);
duke@1: if (enumSwitch) {
duke@1: result = visitEnumSwitch(tree);
darcy@430: } else if (stringSwitch) {
darcy@430: result = visitStringSwitch(tree);
duke@1: } else {
duke@1: result = tree;
duke@1: }
duke@1: }
duke@1:
duke@1: public JCTree visitEnumSwitch(JCSwitch tree) {
duke@1: TypeSymbol enumSym = tree.selector.type.tsym;
duke@1: EnumMapping map = mapForEnum(tree.pos(), enumSym);
duke@1: make_at(tree.pos());
duke@1: Symbol ordinalMethod = lookupMethod(tree.pos(),
duke@1: names.ordinal,
duke@1: tree.selector.type,
duke@1: List.nil());
duke@1: JCArrayAccess selector = make.Indexed(map.mapVar,
duke@1: make.App(make.Select(tree.selector,
duke@1: ordinalMethod)));
duke@1: ListBuffer cases = new ListBuffer();
duke@1: for (JCCase c : tree.cases) {
duke@1: if (c.pat != null) {
duke@1: VarSymbol label = (VarSymbol)TreeInfo.symbol(c.pat);
duke@1: JCLiteral pat = map.forConstant(label);
duke@1: cases.append(make.Case(pat, c.stats));
duke@1: } else {
duke@1: cases.append(c);
duke@1: }
duke@1: }
darcy@443: JCSwitch enumSwitch = make.Switch(selector, cases.toList());
darcy@443: patchTargets(enumSwitch, tree, enumSwitch);
darcy@443: return enumSwitch;
duke@1: }
duke@1:
darcy@430: public JCTree visitStringSwitch(JCSwitch tree) {
darcy@430: List caseList = tree.getCases();
darcy@430: int alternatives = caseList.size();
darcy@430:
darcy@430: if (alternatives == 0) { // Strange but legal possibility
darcy@430: return make.at(tree.pos()).Exec(attr.makeNullCheck(tree.getExpression()));
darcy@430: } else {
darcy@430: /*
darcy@430: * The general approach used is to translate a single
darcy@430: * string switch statement into a series of two chained
darcy@430: * switch statements: the first a synthesized statement
darcy@430: * switching on the argument string's hash value and
darcy@430: * computing a string's position in the list of original
darcy@430: * case labels, if any, followed by a second switch on the
darcy@430: * computed integer value. The second switch has the same
darcy@430: * code structure as the original string switch statement
darcy@430: * except that the string case labels are replaced with
darcy@430: * positional integer constants starting at 0.
darcy@430: *
darcy@430: * The first switch statement can be thought of as an
darcy@430: * inlined map from strings to their position in the case
darcy@430: * label list. An alternate implementation would use an
darcy@430: * actual Map for this purpose, as done for enum switches.
darcy@430: *
darcy@430: * With some additional effort, it would be possible to
darcy@430: * use a single switch statement on the hash code of the
darcy@430: * argument, but care would need to be taken to preserve
darcy@430: * the proper control flow in the presence of hash
darcy@430: * collisions and other complications, such as
darcy@430: * fallthroughs. Switch statements with one or two
darcy@430: * alternatives could also be specially translated into
darcy@430: * if-then statements to omit the computation of the hash
darcy@430: * code.
darcy@430: *
darcy@430: * The generated code assumes that the hashing algorithm
darcy@430: * of String is the same in the compilation environment as
darcy@430: * in the environment the code will run in. The string
darcy@430: * hashing algorithm in the SE JDK has been unchanged
darcy@443: * since at least JDK 1.2. Since the algorithm has been
darcy@443: * specified since that release as well, it is very
darcy@443: * unlikely to be changed in the future.
darcy@443: *
darcy@443: * Different hashing algorithms, such as the length of the
darcy@443: * strings or a perfect hashing algorithm over the
darcy@443: * particular set of case labels, could potentially be
darcy@443: * used instead of String.hashCode.
darcy@430: */
darcy@430:
darcy@430: ListBuffer stmtList = new ListBuffer();
darcy@430:
darcy@430: // Map from String case labels to their original position in
darcy@430: // the list of case labels.
darcy@430: Map caseLabelToPosition =
darcy@430: new LinkedHashMap(alternatives + 1, 1.0f);
darcy@430:
darcy@430: // Map of hash codes to the string case labels having that hashCode.
darcy@430: Map> hashToString =
darcy@430: new LinkedHashMap>(alternatives + 1, 1.0f);
darcy@430:
darcy@430: int casePosition = 0;
darcy@430: for(JCCase oneCase : caseList) {
darcy@430: JCExpression expression = oneCase.getExpression();
darcy@430:
darcy@430: if (expression != null) { // expression for a "default" case is null
darcy@430: String labelExpr = (String) expression.type.constValue();
darcy@430: Integer mapping = caseLabelToPosition.put(labelExpr, casePosition);
jjg@816: Assert.checkNull(mapping);
darcy@430: int hashCode = labelExpr.hashCode();
darcy@430:
darcy@430: Set stringSet = hashToString.get(hashCode);
darcy@430: if (stringSet == null) {
darcy@430: stringSet = new LinkedHashSet(1, 1.0f);
darcy@430: stringSet.add(labelExpr);
darcy@430: hashToString.put(hashCode, stringSet);
darcy@430: } else {
darcy@430: boolean added = stringSet.add(labelExpr);
jjg@816: Assert.check(added);
darcy@430: }
darcy@430: }
darcy@430: casePosition++;
darcy@430: }
darcy@430:
darcy@430: // Synthesize a switch statement that has the effect of
darcy@430: // mapping from a string to the integer position of that
darcy@430: // string in the list of case labels. This is done by
darcy@430: // switching on the hashCode of the string followed by an
darcy@430: // if-then-else chain comparing the input for equality
darcy@430: // with all the case labels having that hash value.
darcy@430:
darcy@430: /*
darcy@430: * s$ = top of stack;
darcy@430: * tmp$ = -1;
darcy@430: * switch($s.hashCode()) {
darcy@430: * case caseLabel.hashCode:
darcy@430: * if (s$.equals("caseLabel_1")
darcy@430: * tmp$ = caseLabelToPosition("caseLabel_1");
darcy@430: * else if (s$.equals("caseLabel_2"))
darcy@430: * tmp$ = caseLabelToPosition("caseLabel_2");
darcy@430: * ...
darcy@430: * break;
darcy@430: * ...
darcy@430: * }
darcy@430: */
darcy@430:
darcy@430: VarSymbol dollar_s = new VarSymbol(FINAL|SYNTHETIC,
darcy@430: names.fromString("s" + tree.pos + target.syntheticNameChar()),
darcy@430: syms.stringType,
darcy@430: currentMethodSym);
darcy@430: stmtList.append(make.at(tree.pos()).VarDef(dollar_s, tree.getExpression()).setType(dollar_s.type));
darcy@430:
darcy@430: VarSymbol dollar_tmp = new VarSymbol(SYNTHETIC,
darcy@430: names.fromString("tmp" + tree.pos + target.syntheticNameChar()),
darcy@430: syms.intType,
darcy@430: currentMethodSym);
darcy@430: JCVariableDecl dollar_tmp_def =
darcy@430: (JCVariableDecl)make.VarDef(dollar_tmp, make.Literal(INT, -1)).setType(dollar_tmp.type);
darcy@430: dollar_tmp_def.init.type = dollar_tmp.type = syms.intType;
darcy@430: stmtList.append(dollar_tmp_def);
darcy@430: ListBuffer caseBuffer = ListBuffer.lb();
darcy@430: // hashCode will trigger nullcheck on original switch expression
darcy@430: JCMethodInvocation hashCodeCall = makeCall(make.Ident(dollar_s),
darcy@430: names.hashCode,
darcy@430: List.nil()).setType(syms.intType);
darcy@430: JCSwitch switch1 = make.Switch(hashCodeCall,
darcy@430: caseBuffer.toList());
darcy@430: for(Map.Entry> entry : hashToString.entrySet()) {
darcy@430: int hashCode = entry.getKey();
darcy@430: Set stringsWithHashCode = entry.getValue();
jjg@816: Assert.check(stringsWithHashCode.size() >= 1);
darcy@430:
darcy@430: JCStatement elsepart = null;
darcy@430: for(String caseLabel : stringsWithHashCode ) {
darcy@430: JCMethodInvocation stringEqualsCall = makeCall(make.Ident(dollar_s),
darcy@430: names.equals,
darcy@430: List.of(make.Literal(caseLabel)));
darcy@430: elsepart = make.If(stringEqualsCall,
darcy@430: make.Exec(make.Assign(make.Ident(dollar_tmp),
darcy@430: make.Literal(caseLabelToPosition.get(caseLabel))).
darcy@430: setType(dollar_tmp.type)),
darcy@430: elsepart);
darcy@430: }
darcy@430:
darcy@430: ListBuffer lb = ListBuffer.lb();
darcy@430: JCBreak breakStmt = make.Break(null);
darcy@430: breakStmt.target = switch1;
darcy@430: lb.append(elsepart).append(breakStmt);
darcy@430:
darcy@430: caseBuffer.append(make.Case(make.Literal(hashCode), lb.toList()));
darcy@430: }
darcy@430:
darcy@430: switch1.cases = caseBuffer.toList();
darcy@430: stmtList.append(switch1);
darcy@430:
darcy@430: // Make isomorphic switch tree replacing string labels
darcy@430: // with corresponding integer ones from the label to
darcy@430: // position map.
darcy@430:
darcy@430: ListBuffer lb = ListBuffer.lb();
darcy@430: JCSwitch switch2 = make.Switch(make.Ident(dollar_tmp), lb.toList());
darcy@430: for(JCCase oneCase : caseList ) {
darcy@430: // Rewire up old unlabeled break statements to the
darcy@430: // replacement switch being created.
darcy@430: patchTargets(oneCase, tree, switch2);
darcy@430:
darcy@430: boolean isDefault = (oneCase.getExpression() == null);
darcy@430: JCExpression caseExpr;
darcy@430: if (isDefault)
darcy@430: caseExpr = null;
darcy@430: else {
darcy@430: caseExpr = make.Literal(caseLabelToPosition.get((String)oneCase.
darcy@430: getExpression().
darcy@430: type.constValue()));
darcy@430: }
darcy@430:
darcy@430: lb.append(make.Case(caseExpr,
darcy@430: oneCase.getStatements()));
darcy@430: }
darcy@430:
darcy@430: switch2.cases = lb.toList();
darcy@430: stmtList.append(switch2);
darcy@430:
darcy@430: return make.Block(0L, stmtList.toList());
darcy@430: }
darcy@430: }
darcy@430:
duke@1: public void visitNewArray(JCNewArray tree) {
duke@1: tree.elemtype = translate(tree.elemtype);
duke@1: for (List t = tree.dims; t.tail != null; t = t.tail)
duke@1: if (t.head != null) t.head = translate(t.head, syms.intType);
duke@1: tree.elems = translate(tree.elems, types.elemtype(tree.type));
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: public void visitSelect(JCFieldAccess tree) {
duke@1: // need to special case-access of the form C.super.x
duke@1: // these will always need an access method.
duke@1: boolean qualifiedSuperAccess =
duke@1: tree.selected.getTag() == JCTree.SELECT &&
duke@1: TreeInfo.name(tree.selected) == names._super;
duke@1: tree.selected = translate(tree.selected);
duke@1: if (tree.name == names._class)
duke@1: result = classOf(tree.selected);
duke@1: else if (tree.name == names._this || tree.name == names._super)
duke@1: result = makeThis(tree.pos(), tree.selected.type.tsym);
duke@1: else
duke@1: result = access(tree.sym, tree, enclOp, qualifiedSuperAccess);
duke@1: }
duke@1:
duke@1: public void visitLetExpr(LetExpr tree) {
duke@1: tree.defs = translateVarDefs(tree.defs);
duke@1: tree.expr = translate(tree.expr, tree.type);
duke@1: result = tree;
duke@1: }
duke@1:
duke@1: // There ought to be nothing to rewrite here;
duke@1: // we don't generate code.
duke@1: public void visitAnnotation(JCAnnotation tree) {
duke@1: result = tree;
duke@1: }
duke@1:
darcy@609: @Override
darcy@609: public void visitTry(JCTry tree) {
darcy@609: if (tree.resources.isEmpty()) {
darcy@609: super.visitTry(tree);
darcy@609: } else {
darcy@609: result = makeArmTry(tree);
darcy@609: }
darcy@609: }
darcy@609:
duke@1: /**************************************************************************
duke@1: * main method
duke@1: *************************************************************************/
duke@1:
duke@1: /** Translate a toplevel class and return a list consisting of
duke@1: * the translated class and translated versions of all inner classes.
duke@1: * @param env The attribution environment current at the class definition.
duke@1: * We need this for resolving some additional symbols.
duke@1: * @param cdef The tree representing the class definition.
duke@1: */
duke@1: public List translateTopLevelClass(Env env, JCTree cdef, TreeMaker make) {
duke@1: ListBuffer translated = null;
duke@1: try {
duke@1: attrEnv = env;
duke@1: this.make = make;
duke@1: endPositions = env.toplevel.endPositions;
duke@1: currentClass = null;
duke@1: currentMethodDef = null;
duke@1: outermostClassDef = (cdef.getTag() == JCTree.CLASSDEF) ? (JCClassDecl)cdef : null;
duke@1: outermostMemberDef = null;
duke@1: this.translated = new ListBuffer();
duke@1: classdefs = new HashMap();
duke@1: actualSymbols = new HashMap();
duke@1: freevarCache = new HashMap>();
duke@1: proxies = new Scope(syms.noSymbol);
darcy@609: twrVars = new Scope(syms.noSymbol);
duke@1: outerThisStack = List.nil();
duke@1: accessNums = new HashMap();
duke@1: accessSyms = new HashMap();
duke@1: accessConstrs = new HashMap();
jjg@595: accessConstrTags = List.nil();
duke@1: accessed = new ListBuffer();
duke@1: translate(cdef, (JCExpression)null);
duke@1: for (List l = accessed.toList(); l.nonEmpty(); l = l.tail)
duke@1: makeAccessible(l.head);
duke@1: for (EnumMapping map : enumSwitchMap.values())
duke@1: map.translate();
mcimadamore@359: checkConflicts(this.translated.toList());
jjg@595: checkAccessConstructorTags();
duke@1: translated = this.translated;
duke@1: } finally {
duke@1: // note that recursive invocations of this method fail hard
duke@1: attrEnv = null;
duke@1: this.make = null;
duke@1: endPositions = null;
duke@1: currentClass = null;
duke@1: currentMethodDef = null;
duke@1: outermostClassDef = null;
duke@1: outermostMemberDef = null;
duke@1: this.translated = null;
duke@1: classdefs = null;
duke@1: actualSymbols = null;
duke@1: freevarCache = null;
duke@1: proxies = null;
duke@1: outerThisStack = null;
duke@1: accessNums = null;
duke@1: accessSyms = null;
duke@1: accessConstrs = null;
jjg@595: accessConstrTags = null;
duke@1: accessed = null;
duke@1: enumSwitchMap.clear();
duke@1: }
duke@1: return translated.toList();
duke@1: }
duke@1:
duke@1: //////////////////////////////////////////////////////////////
duke@1: // The following contributed by Borland for bootstrapping purposes
duke@1: //////////////////////////////////////////////////////////////
duke@1: private void addEnumCompatibleMembers(JCClassDecl cdef) {
duke@1: make_at(null);
duke@1:
duke@1: // Add the special enum fields
duke@1: VarSymbol ordinalFieldSym = addEnumOrdinalField(cdef);
duke@1: VarSymbol nameFieldSym = addEnumNameField(cdef);
duke@1:
duke@1: // Add the accessor methods for name and ordinal
duke@1: MethodSymbol ordinalMethodSym = addEnumFieldOrdinalMethod(cdef, ordinalFieldSym);
duke@1: MethodSymbol nameMethodSym = addEnumFieldNameMethod(cdef, nameFieldSym);
duke@1:
duke@1: // Add the toString method
duke@1: addEnumToString(cdef, nameFieldSym);
duke@1:
duke@1: // Add the compareTo method
duke@1: addEnumCompareTo(cdef, ordinalFieldSym);
duke@1: }
duke@1:
duke@1: private VarSymbol addEnumOrdinalField(JCClassDecl cdef) {
duke@1: VarSymbol ordinal = new VarSymbol(PRIVATE|FINAL|SYNTHETIC,
duke@1: names.fromString("$ordinal"),
duke@1: syms.intType,
duke@1: cdef.sym);
duke@1: cdef.sym.members().enter(ordinal);
duke@1: cdef.defs = cdef.defs.prepend(make.VarDef(ordinal, null));
duke@1: return ordinal;
duke@1: }
duke@1:
duke@1: private VarSymbol addEnumNameField(JCClassDecl cdef) {
duke@1: VarSymbol name = new VarSymbol(PRIVATE|FINAL|SYNTHETIC,
duke@1: names.fromString("$name"),
duke@1: syms.stringType,
duke@1: cdef.sym);
duke@1: cdef.sym.members().enter(name);
duke@1: cdef.defs = cdef.defs.prepend(make.VarDef(name, null));
duke@1: return name;
duke@1: }
duke@1:
duke@1: private MethodSymbol addEnumFieldOrdinalMethod(JCClassDecl cdef, VarSymbol ordinalSymbol) {
duke@1: // Add the accessor methods for ordinal
duke@1: Symbol ordinalSym = lookupMethod(cdef.pos(),
duke@1: names.ordinal,
duke@1: cdef.type,
duke@1: List.nil());
duke@1:
jjg@816: Assert.check(ordinalSym instanceof MethodSymbol);
duke@1:
duke@1: JCStatement ret = make.Return(make.Ident(ordinalSymbol));
duke@1: cdef.defs = cdef.defs.append(make.MethodDef((MethodSymbol)ordinalSym,
duke@1: make.Block(0L, List.of(ret))));
duke@1:
duke@1: return (MethodSymbol)ordinalSym;
duke@1: }
duke@1:
duke@1: private MethodSymbol addEnumFieldNameMethod(JCClassDecl cdef, VarSymbol nameSymbol) {
duke@1: // Add the accessor methods for name
duke@1: Symbol nameSym = lookupMethod(cdef.pos(),
duke@1: names._name,
duke@1: cdef.type,
duke@1: List.nil());
duke@1:
jjg@816: Assert.check(nameSym instanceof MethodSymbol);
duke@1:
duke@1: JCStatement ret = make.Return(make.Ident(nameSymbol));
duke@1:
duke@1: cdef.defs = cdef.defs.append(make.MethodDef((MethodSymbol)nameSym,
duke@1: make.Block(0L, List.of(ret))));
duke@1:
duke@1: return (MethodSymbol)nameSym;
duke@1: }
duke@1:
duke@1: private MethodSymbol addEnumToString(JCClassDecl cdef,
duke@1: VarSymbol nameSymbol) {
duke@1: Symbol toStringSym = lookupMethod(cdef.pos(),
duke@1: names.toString,
duke@1: cdef.type,
duke@1: List.nil());
duke@1:
duke@1: JCTree toStringDecl = null;
duke@1: if (toStringSym != null)
duke@1: toStringDecl = TreeInfo.declarationFor(toStringSym, cdef);
duke@1:
duke@1: if (toStringDecl != null)
duke@1: return (MethodSymbol)toStringSym;
duke@1:
duke@1: JCStatement ret = make.Return(make.Ident(nameSymbol));
duke@1:
duke@1: JCTree resTypeTree = make.Type(syms.stringType);
duke@1:
duke@1: MethodType toStringType = new MethodType(List.nil(),
duke@1: syms.stringType,
duke@1: List.nil(),
duke@1: cdef.sym);
duke@1: toStringSym = new MethodSymbol(PUBLIC,
duke@1: names.toString,
duke@1: toStringType,
duke@1: cdef.type.tsym);
duke@1: toStringDecl = make.MethodDef((MethodSymbol)toStringSym,
duke@1: make.Block(0L, List.of(ret)));
duke@1:
duke@1: cdef.defs = cdef.defs.prepend(toStringDecl);
duke@1: cdef.sym.members().enter(toStringSym);
duke@1:
duke@1: return (MethodSymbol)toStringSym;
duke@1: }
duke@1:
duke@1: private MethodSymbol addEnumCompareTo(JCClassDecl cdef, VarSymbol ordinalSymbol) {
duke@1: Symbol compareToSym = lookupMethod(cdef.pos(),
duke@1: names.compareTo,
duke@1: cdef.type,
duke@1: List.of(cdef.sym.type));
duke@1:
jjg@816: Assert.check(compareToSym instanceof MethodSymbol);
duke@1:
duke@1: JCMethodDecl compareToDecl = (JCMethodDecl) TreeInfo.declarationFor(compareToSym, cdef);
duke@1:
duke@1: ListBuffer blockStatements = new ListBuffer();
duke@1:
duke@1: JCModifiers mod1 = make.Modifiers(0L);
jjg@113: Name oName = names.fromString("o");
duke@1: JCVariableDecl par1 = make.Param(oName, cdef.type, compareToSym);
duke@1:
duke@1: JCIdent paramId1 = make.Ident(names.java_lang_Object);
duke@1: paramId1.type = cdef.type;
duke@1: paramId1.sym = par1.sym;
duke@1:
duke@1: ((MethodSymbol)compareToSym).params = List.of(par1.sym);
duke@1:
duke@1: JCIdent par1UsageId = make.Ident(par1.sym);
duke@1: JCIdent castTargetIdent = make.Ident(cdef.sym);
duke@1: JCTypeCast cast = make.TypeCast(castTargetIdent, par1UsageId);
duke@1: cast.setType(castTargetIdent.type);
duke@1:
jjg@113: Name otherName = names.fromString("other");
duke@1:
duke@1: VarSymbol otherVarSym = new VarSymbol(mod1.flags,
duke@1: otherName,
duke@1: cdef.type,
duke@1: compareToSym);
duke@1: JCVariableDecl otherVar = make.VarDef(otherVarSym, cast);
duke@1: blockStatements.append(otherVar);
duke@1:
duke@1: JCIdent id1 = make.Ident(ordinalSymbol);
duke@1:
duke@1: JCIdent fLocUsageId = make.Ident(otherVarSym);
duke@1: JCExpression sel = make.Select(fLocUsageId, ordinalSymbol);
duke@1: JCBinary bin = makeBinary(JCTree.MINUS, id1, sel);
duke@1: JCReturn ret = make.Return(bin);
duke@1: blockStatements.append(ret);
duke@1: JCMethodDecl compareToMethod = make.MethodDef((MethodSymbol)compareToSym,
duke@1: make.Block(0L,
duke@1: blockStatements.toList()));
duke@1: compareToMethod.params = List.of(par1);
duke@1: cdef.defs = cdef.defs.append(compareToMethod);
duke@1:
duke@1: return (MethodSymbol)compareToSym;
duke@1: }
duke@1: //////////////////////////////////////////////////////////////
duke@1: // The above contributed by Borland for bootstrapping purposes
duke@1: //////////////////////////////////////////////////////////////
duke@1: }