author | mcimadamore |
Wed, 09 Apr 2008 13:41:45 +0100 | |
changeset 508 | 118e500e2e50 |
parent 161 | bfe63856332f |
child 517 | ea4702edd512 |
permissions | -rw-r--r-- |
10 | 1 |
/* |
2 |
* Copyright 1999-2006 Sun Microsystems, Inc. All Rights Reserved. |
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
|
4 |
* |
|
5 |
* This code is free software; you can redistribute it and/or modify it |
|
6 |
* under the terms of the GNU General Public License version 2 only, as |
|
7 |
* published by the Free Software Foundation. Sun designates this |
|
8 |
* particular file as subject to the "Classpath" exception as provided |
|
9 |
* by Sun in the LICENSE file that accompanied this code. |
|
10 |
* |
|
11 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
12 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
13 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
14 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
15 |
* accompanied this code). |
|
16 |
* |
|
17 |
* You should have received a copy of the GNU General Public License version |
|
18 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
19 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
20 |
* |
|
21 |
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
|
22 |
* CA 95054 USA or visit www.sun.com if you need additional information or |
|
23 |
* have any questions. |
|
24 |
*/ |
|
25 |
||
26 |
package com.sun.tools.javac.comp; |
|
27 |
||
28 |
import java.util.*; |
|
29 |
||
30 |
import com.sun.tools.javac.code.*; |
|
31 |
import com.sun.tools.javac.jvm.*; |
|
32 |
import com.sun.tools.javac.tree.*; |
|
33 |
import com.sun.tools.javac.util.*; |
|
34 |
import com.sun.tools.javac.util.JCDiagnostic.DiagnosticPosition; |
|
35 |
import com.sun.tools.javac.util.List; |
|
36 |
||
37 |
import com.sun.tools.javac.code.Symbol.*; |
|
38 |
import com.sun.tools.javac.tree.JCTree.*; |
|
39 |
import com.sun.tools.javac.code.Type.*; |
|
40 |
||
41 |
import com.sun.tools.javac.jvm.Target; |
|
42 |
||
43 |
import static com.sun.tools.javac.code.Flags.*; |
|
44 |
import static com.sun.tools.javac.code.Kinds.*; |
|
45 |
import static com.sun.tools.javac.code.TypeTags.*; |
|
46 |
import static com.sun.tools.javac.jvm.ByteCodes.*; |
|
47 |
||
48 |
/** This pass translates away some syntactic sugar: inner classes, |
|
49 |
* class literals, assertions, foreach loops, etc. |
|
50 |
* |
|
51 |
* <p><b>This is NOT part of any API supported by Sun Microsystems. If |
|
52 |
* you write code that depends on this, you do so at your own risk. |
|
53 |
* This code and its internal interfaces are subject to change or |
|
54 |
* deletion without notice.</b> |
|
55 |
*/ |
|
56 |
public class Lower extends TreeTranslator { |
|
57 |
protected static final Context.Key<Lower> lowerKey = |
|
58 |
new Context.Key<Lower>(); |
|
59 |
||
60 |
public static Lower instance(Context context) { |
|
61 |
Lower instance = context.get(lowerKey); |
|
62 |
if (instance == null) |
|
63 |
instance = new Lower(context); |
|
64 |
return instance; |
|
65 |
} |
|
66 |
||
67 |
private Name.Table names; |
|
68 |
private Log log; |
|
69 |
private Symtab syms; |
|
70 |
private Resolve rs; |
|
71 |
private Check chk; |
|
72 |
private Attr attr; |
|
73 |
private TreeMaker make; |
|
74 |
private DiagnosticPosition make_pos; |
|
75 |
private ClassWriter writer; |
|
76 |
private ClassReader reader; |
|
77 |
private ConstFold cfolder; |
|
78 |
private Target target; |
|
79 |
private Source source; |
|
80 |
private boolean allowEnums; |
|
81 |
private final Name dollarAssertionsDisabled; |
|
82 |
private final Name classDollar; |
|
83 |
private Types types; |
|
84 |
private boolean debugLower; |
|
85 |
||
86 |
protected Lower(Context context) { |
|
87 |
context.put(lowerKey, this); |
|
88 |
names = Name.Table.instance(context); |
|
89 |
log = Log.instance(context); |
|
90 |
syms = Symtab.instance(context); |
|
91 |
rs = Resolve.instance(context); |
|
92 |
chk = Check.instance(context); |
|
93 |
attr = Attr.instance(context); |
|
94 |
make = TreeMaker.instance(context); |
|
95 |
writer = ClassWriter.instance(context); |
|
96 |
reader = ClassReader.instance(context); |
|
97 |
cfolder = ConstFold.instance(context); |
|
98 |
target = Target.instance(context); |
|
99 |
source = Source.instance(context); |
|
100 |
allowEnums = source.allowEnums(); |
|
101 |
dollarAssertionsDisabled = names. |
|
102 |
fromString(target.syntheticNameChar() + "assertionsDisabled"); |
|
103 |
classDollar = names. |
|
104 |
fromString("class" + target.syntheticNameChar()); |
|
105 |
||
106 |
types = Types.instance(context); |
|
107 |
Options options = Options.instance(context); |
|
108 |
debugLower = options.get("debuglower") != null; |
|
109 |
} |
|
110 |
||
111 |
/** The currently enclosing class. |
|
112 |
*/ |
|
113 |
ClassSymbol currentClass; |
|
114 |
||
115 |
/** A queue of all translated classes. |
|
116 |
*/ |
|
117 |
ListBuffer<JCTree> translated; |
|
118 |
||
119 |
/** Environment for symbol lookup, set by translateTopLevelClass. |
|
120 |
*/ |
|
121 |
Env<AttrContext> attrEnv; |
|
122 |
||
123 |
/** A hash table mapping syntax trees to their ending source positions. |
|
124 |
*/ |
|
125 |
Map<JCTree, Integer> endPositions; |
|
126 |
||
127 |
/************************************************************************** |
|
128 |
* Global mappings |
|
129 |
*************************************************************************/ |
|
130 |
||
131 |
/** A hash table mapping local classes to their definitions. |
|
132 |
*/ |
|
133 |
Map<ClassSymbol, JCClassDecl> classdefs; |
|
134 |
||
135 |
/** A hash table mapping virtual accessed symbols in outer subclasses |
|
136 |
* to the actually referred symbol in superclasses. |
|
137 |
*/ |
|
138 |
Map<Symbol,Symbol> actualSymbols; |
|
139 |
||
140 |
/** The current method definition. |
|
141 |
*/ |
|
142 |
JCMethodDecl currentMethodDef; |
|
143 |
||
144 |
/** The current method symbol. |
|
145 |
*/ |
|
146 |
MethodSymbol currentMethodSym; |
|
147 |
||
148 |
/** The currently enclosing outermost class definition. |
|
149 |
*/ |
|
150 |
JCClassDecl outermostClassDef; |
|
151 |
||
152 |
/** The currently enclosing outermost member definition. |
|
153 |
*/ |
|
154 |
JCTree outermostMemberDef; |
|
155 |
||
156 |
/** A navigator class for assembling a mapping from local class symbols |
|
157 |
* to class definition trees. |
|
158 |
* There is only one case; all other cases simply traverse down the tree. |
|
159 |
*/ |
|
160 |
class ClassMap extends TreeScanner { |
|
161 |
||
162 |
/** All encountered class defs are entered into classdefs table. |
|
163 |
*/ |
|
164 |
public void visitClassDef(JCClassDecl tree) { |
|
165 |
classdefs.put(tree.sym, tree); |
|
166 |
super.visitClassDef(tree); |
|
167 |
} |
|
168 |
} |
|
169 |
ClassMap classMap = new ClassMap(); |
|
170 |
||
171 |
/** Map a class symbol to its definition. |
|
172 |
* @param c The class symbol of which we want to determine the definition. |
|
173 |
*/ |
|
174 |
JCClassDecl classDef(ClassSymbol c) { |
|
175 |
// First lookup the class in the classdefs table. |
|
176 |
JCClassDecl def = classdefs.get(c); |
|
177 |
if (def == null && outermostMemberDef != null) { |
|
178 |
// If this fails, traverse outermost member definition, entering all |
|
179 |
// local classes into classdefs, and try again. |
|
180 |
classMap.scan(outermostMemberDef); |
|
181 |
def = classdefs.get(c); |
|
182 |
} |
|
183 |
if (def == null) { |
|
184 |
// If this fails, traverse outermost class definition, entering all |
|
185 |
// local classes into classdefs, and try again. |
|
186 |
classMap.scan(outermostClassDef); |
|
187 |
def = classdefs.get(c); |
|
188 |
} |
|
189 |
return def; |
|
190 |
} |
|
191 |
||
192 |
/** A hash table mapping class symbols to lists of free variables. |
|
193 |
* accessed by them. Only free variables of the method immediately containing |
|
194 |
* a class are associated with that class. |
|
195 |
*/ |
|
196 |
Map<ClassSymbol,List<VarSymbol>> freevarCache; |
|
197 |
||
198 |
/** A navigator class for collecting the free variables accessed |
|
199 |
* from a local class. |
|
200 |
* There is only one case; all other cases simply traverse down the tree. |
|
201 |
*/ |
|
202 |
class FreeVarCollector extends TreeScanner { |
|
203 |
||
204 |
/** The owner of the local class. |
|
205 |
*/ |
|
206 |
Symbol owner; |
|
207 |
||
208 |
/** The local class. |
|
209 |
*/ |
|
210 |
ClassSymbol clazz; |
|
211 |
||
212 |
/** The list of owner's variables accessed from within the local class, |
|
213 |
* without any duplicates. |
|
214 |
*/ |
|
215 |
List<VarSymbol> fvs; |
|
216 |
||
217 |
FreeVarCollector(ClassSymbol clazz) { |
|
218 |
this.clazz = clazz; |
|
219 |
this.owner = clazz.owner; |
|
220 |
this.fvs = List.nil(); |
|
221 |
} |
|
222 |
||
223 |
/** Add free variable to fvs list unless it is already there. |
|
224 |
*/ |
|
225 |
private void addFreeVar(VarSymbol v) { |
|
226 |
for (List<VarSymbol> l = fvs; l.nonEmpty(); l = l.tail) |
|
227 |
if (l.head == v) return; |
|
228 |
fvs = fvs.prepend(v); |
|
229 |
} |
|
230 |
||
231 |
/** Add all free variables of class c to fvs list |
|
232 |
* unless they are already there. |
|
233 |
*/ |
|
234 |
private void addFreeVars(ClassSymbol c) { |
|
235 |
List<VarSymbol> fvs = freevarCache.get(c); |
|
236 |
if (fvs != null) { |
|
237 |
for (List<VarSymbol> l = fvs; l.nonEmpty(); l = l.tail) { |
|
238 |
addFreeVar(l.head); |
|
239 |
} |
|
240 |
} |
|
241 |
} |
|
242 |
||
243 |
/** If tree refers to a variable in owner of local class, add it to |
|
244 |
* free variables list. |
|
245 |
*/ |
|
246 |
public void visitIdent(JCIdent tree) { |
|
247 |
result = tree; |
|
248 |
visitSymbol(tree.sym); |
|
249 |
} |
|
250 |
// where |
|
251 |
private void visitSymbol(Symbol _sym) { |
|
252 |
Symbol sym = _sym; |
|
253 |
if (sym.kind == VAR || sym.kind == MTH) { |
|
254 |
while (sym != null && sym.owner != owner) |
|
255 |
sym = proxies.lookup(proxyName(sym.name)).sym; |
|
256 |
if (sym != null && sym.owner == owner) { |
|
257 |
VarSymbol v = (VarSymbol)sym; |
|
258 |
if (v.getConstValue() == null) { |
|
259 |
addFreeVar(v); |
|
260 |
} |
|
261 |
} else { |
|
262 |
if (outerThisStack.head != null && |
|
263 |
outerThisStack.head != _sym) |
|
264 |
visitSymbol(outerThisStack.head); |
|
265 |
} |
|
266 |
} |
|
267 |
} |
|
268 |
||
269 |
/** If tree refers to a class instance creation expression |
|
270 |
* add all free variables of the freshly created class. |
|
271 |
*/ |
|
272 |
public void visitNewClass(JCNewClass tree) { |
|
273 |
ClassSymbol c = (ClassSymbol)tree.constructor.owner; |
|
274 |
addFreeVars(c); |
|
275 |
if (tree.encl == null && |
|
276 |
c.hasOuterInstance() && |
|
277 |
outerThisStack.head != null) |
|
278 |
visitSymbol(outerThisStack.head); |
|
279 |
super.visitNewClass(tree); |
|
280 |
} |
|
281 |
||
282 |
/** If tree refers to a qualified this or super expression |
|
283 |
* for anything but the current class, add the outer this |
|
284 |
* stack as a free variable. |
|
285 |
*/ |
|
286 |
public void visitSelect(JCFieldAccess tree) { |
|
287 |
if ((tree.name == names._this || tree.name == names._super) && |
|
288 |
tree.selected.type.tsym != clazz && |
|
289 |
outerThisStack.head != null) |
|
290 |
visitSymbol(outerThisStack.head); |
|
291 |
super.visitSelect(tree); |
|
292 |
} |
|
293 |
||
294 |
/** If tree refers to a superclass constructor call, |
|
295 |
* add all free variables of the superclass. |
|
296 |
*/ |
|
297 |
public void visitApply(JCMethodInvocation tree) { |
|
298 |
if (TreeInfo.name(tree.meth) == names._super) { |
|
299 |
addFreeVars((ClassSymbol) TreeInfo.symbol(tree.meth).owner); |
|
300 |
Symbol constructor = TreeInfo.symbol(tree.meth); |
|
301 |
ClassSymbol c = (ClassSymbol)constructor.owner; |
|
302 |
if (c.hasOuterInstance() && |
|
303 |
tree.meth.getTag() != JCTree.SELECT && |
|
304 |
outerThisStack.head != null) |
|
305 |
visitSymbol(outerThisStack.head); |
|
306 |
} |
|
307 |
super.visitApply(tree); |
|
308 |
} |
|
309 |
} |
|
310 |
||
311 |
/** Return the variables accessed from within a local class, which |
|
312 |
* are declared in the local class' owner. |
|
313 |
* (in reverse order of first access). |
|
314 |
*/ |
|
315 |
List<VarSymbol> freevars(ClassSymbol c) { |
|
316 |
if ((c.owner.kind & (VAR | MTH)) != 0) { |
|
317 |
List<VarSymbol> fvs = freevarCache.get(c); |
|
318 |
if (fvs == null) { |
|
319 |
FreeVarCollector collector = new FreeVarCollector(c); |
|
320 |
collector.scan(classDef(c)); |
|
321 |
fvs = collector.fvs; |
|
322 |
freevarCache.put(c, fvs); |
|
323 |
} |
|
324 |
return fvs; |
|
325 |
} else { |
|
326 |
return List.nil(); |
|
327 |
} |
|
328 |
} |
|
329 |
||
330 |
Map<TypeSymbol,EnumMapping> enumSwitchMap = new LinkedHashMap<TypeSymbol,EnumMapping>(); |
|
331 |
||
332 |
EnumMapping mapForEnum(DiagnosticPosition pos, TypeSymbol enumClass) { |
|
333 |
EnumMapping map = enumSwitchMap.get(enumClass); |
|
334 |
if (map == null) |
|
335 |
enumSwitchMap.put(enumClass, map = new EnumMapping(pos, enumClass)); |
|
336 |
return map; |
|
337 |
} |
|
338 |
||
339 |
/** This map gives a translation table to be used for enum |
|
340 |
* switches. |
|
341 |
* |
|
342 |
* <p>For each enum that appears as the type of a switch |
|
343 |
* expression, we maintain an EnumMapping to assist in the |
|
344 |
* translation, as exemplified by the following example: |
|
345 |
* |
|
346 |
* <p>we translate |
|
347 |
* <pre> |
|
348 |
* switch(colorExpression) { |
|
349 |
* case red: stmt1; |
|
350 |
* case green: stmt2; |
|
351 |
* } |
|
352 |
* </pre> |
|
353 |
* into |
|
354 |
* <pre> |
|
355 |
* switch(Outer$0.$EnumMap$Color[colorExpression.ordinal()]) { |
|
356 |
* case 1: stmt1; |
|
357 |
* case 2: stmt2 |
|
358 |
* } |
|
359 |
* </pre> |
|
360 |
* with the auxilliary table intialized as follows: |
|
361 |
* <pre> |
|
362 |
* class Outer$0 { |
|
363 |
* synthetic final int[] $EnumMap$Color = new int[Color.values().length]; |
|
364 |
* static { |
|
365 |
* try { $EnumMap$Color[red.ordinal()] = 1; } catch (NoSuchFieldError ex) {} |
|
366 |
* try { $EnumMap$Color[green.ordinal()] = 2; } catch (NoSuchFieldError ex) {} |
|
367 |
* } |
|
368 |
* } |
|
369 |
* </pre> |
|
370 |
* class EnumMapping provides mapping data and support methods for this translation. |
|
371 |
*/ |
|
372 |
class EnumMapping { |
|
373 |
EnumMapping(DiagnosticPosition pos, TypeSymbol forEnum) { |
|
374 |
this.forEnum = forEnum; |
|
375 |
this.values = new LinkedHashMap<VarSymbol,Integer>(); |
|
376 |
this.pos = pos; |
|
377 |
Name varName = names |
|
378 |
.fromString(target.syntheticNameChar() + |
|
379 |
"SwitchMap" + |
|
380 |
target.syntheticNameChar() + |
|
381 |
writer.xClassName(forEnum.type).toString() |
|
382 |
.replace('/', '.') |
|
383 |
.replace('.', target.syntheticNameChar())); |
|
384 |
ClassSymbol outerCacheClass = outerCacheClass(); |
|
385 |
this.mapVar = new VarSymbol(STATIC | SYNTHETIC | FINAL, |
|
386 |
varName, |
|
387 |
new ArrayType(syms.intType, syms.arrayClass), |
|
388 |
outerCacheClass); |
|
389 |
enterSynthetic(pos, mapVar, outerCacheClass.members()); |
|
390 |
} |
|
391 |
||
392 |
DiagnosticPosition pos = null; |
|
393 |
||
394 |
// the next value to use |
|
395 |
int next = 1; // 0 (unused map elements) go to the default label |
|
396 |
||
397 |
// the enum for which this is a map |
|
398 |
final TypeSymbol forEnum; |
|
399 |
||
400 |
// the field containing the map |
|
401 |
final VarSymbol mapVar; |
|
402 |
||
403 |
// the mapped values |
|
404 |
final Map<VarSymbol,Integer> values; |
|
405 |
||
406 |
JCLiteral forConstant(VarSymbol v) { |
|
407 |
Integer result = values.get(v); |
|
408 |
if (result == null) |
|
409 |
values.put(v, result = next++); |
|
410 |
return make.Literal(result); |
|
411 |
} |
|
412 |
||
413 |
// generate the field initializer for the map |
|
414 |
void translate() { |
|
415 |
make.at(pos.getStartPosition()); |
|
416 |
JCClassDecl owner = classDef((ClassSymbol)mapVar.owner); |
|
417 |
||
418 |
// synthetic static final int[] $SwitchMap$Color = new int[Color.values().length]; |
|
419 |
MethodSymbol valuesMethod = lookupMethod(pos, |
|
420 |
names.values, |
|
421 |
forEnum.type, |
|
422 |
List.<Type>nil()); |
|
423 |
JCExpression size = make // Color.values().length |
|
424 |
.Select(make.App(make.QualIdent(valuesMethod)), |
|
425 |
syms.lengthVar); |
|
426 |
JCExpression mapVarInit = make |
|
427 |
.NewArray(make.Type(syms.intType), List.of(size), null) |
|
428 |
.setType(new ArrayType(syms.intType, syms.arrayClass)); |
|
429 |
||
430 |
// try { $SwitchMap$Color[red.ordinal()] = 1; } catch (java.lang.NoSuchFieldError ex) {} |
|
431 |
ListBuffer<JCStatement> stmts = new ListBuffer<JCStatement>(); |
|
432 |
Symbol ordinalMethod = lookupMethod(pos, |
|
433 |
names.ordinal, |
|
434 |
forEnum.type, |
|
435 |
List.<Type>nil()); |
|
436 |
List<JCCatch> catcher = List.<JCCatch>nil() |
|
437 |
.prepend(make.Catch(make.VarDef(new VarSymbol(PARAMETER, names.ex, |
|
438 |
syms.noSuchFieldErrorType, |
|
439 |
syms.noSymbol), |
|
440 |
null), |
|
441 |
make.Block(0, List.<JCStatement>nil()))); |
|
442 |
for (Map.Entry<VarSymbol,Integer> e : values.entrySet()) { |
|
443 |
VarSymbol enumerator = e.getKey(); |
|
444 |
Integer mappedValue = e.getValue(); |
|
445 |
JCExpression assign = make |
|
446 |
.Assign(make.Indexed(mapVar, |
|
447 |
make.App(make.Select(make.QualIdent(enumerator), |
|
448 |
ordinalMethod))), |
|
449 |
make.Literal(mappedValue)) |
|
450 |
.setType(syms.intType); |
|
451 |
JCStatement exec = make.Exec(assign); |
|
452 |
JCStatement _try = make.Try(make.Block(0, List.of(exec)), catcher, null); |
|
453 |
stmts.append(_try); |
|
454 |
} |
|
455 |
||
456 |
owner.defs = owner.defs |
|
457 |
.prepend(make.Block(STATIC, stmts.toList())) |
|
458 |
.prepend(make.VarDef(mapVar, mapVarInit)); |
|
459 |
} |
|
460 |
} |
|
461 |
||
462 |
||
463 |
/************************************************************************** |
|
464 |
* Tree building blocks |
|
465 |
*************************************************************************/ |
|
466 |
||
467 |
/** Equivalent to make.at(pos.getStartPosition()) with side effect of caching |
|
468 |
* pos as make_pos, for use in diagnostics. |
|
469 |
**/ |
|
470 |
TreeMaker make_at(DiagnosticPosition pos) { |
|
471 |
make_pos = pos; |
|
472 |
return make.at(pos); |
|
473 |
} |
|
474 |
||
475 |
/** Make an attributed tree representing a literal. This will be an |
|
476 |
* Ident node in the case of boolean literals, a Literal node in all |
|
477 |
* other cases. |
|
478 |
* @param type The literal's type. |
|
479 |
* @param value The literal's value. |
|
480 |
*/ |
|
481 |
JCExpression makeLit(Type type, Object value) { |
|
482 |
return make.Literal(type.tag, value).setType(type.constType(value)); |
|
483 |
} |
|
484 |
||
485 |
/** Make an attributed tree representing null. |
|
486 |
*/ |
|
487 |
JCExpression makeNull() { |
|
488 |
return makeLit(syms.botType, null); |
|
489 |
} |
|
490 |
||
491 |
/** Make an attributed class instance creation expression. |
|
492 |
* @param ctype The class type. |
|
493 |
* @param args The constructor arguments. |
|
494 |
*/ |
|
495 |
JCNewClass makeNewClass(Type ctype, List<JCExpression> args) { |
|
496 |
JCNewClass tree = make.NewClass(null, |
|
497 |
null, make.QualIdent(ctype.tsym), args, null); |
|
498 |
tree.constructor = rs.resolveConstructor( |
|
499 |
make_pos, attrEnv, ctype, TreeInfo.types(args), null, false, false); |
|
500 |
tree.type = ctype; |
|
501 |
return tree; |
|
502 |
} |
|
503 |
||
504 |
/** Make an attributed unary expression. |
|
505 |
* @param optag The operators tree tag. |
|
506 |
* @param arg The operator's argument. |
|
507 |
*/ |
|
508 |
JCUnary makeUnary(int optag, JCExpression arg) { |
|
509 |
JCUnary tree = make.Unary(optag, arg); |
|
510 |
tree.operator = rs.resolveUnaryOperator( |
|
511 |
make_pos, optag, attrEnv, arg.type); |
|
512 |
tree.type = tree.operator.type.getReturnType(); |
|
513 |
return tree; |
|
514 |
} |
|
515 |
||
516 |
/** Make an attributed binary expression. |
|
517 |
* @param optag The operators tree tag. |
|
518 |
* @param lhs The operator's left argument. |
|
519 |
* @param rhs The operator's right argument. |
|
520 |
*/ |
|
521 |
JCBinary makeBinary(int optag, JCExpression lhs, JCExpression rhs) { |
|
522 |
JCBinary tree = make.Binary(optag, lhs, rhs); |
|
523 |
tree.operator = rs.resolveBinaryOperator( |
|
524 |
make_pos, optag, attrEnv, lhs.type, rhs.type); |
|
525 |
tree.type = tree.operator.type.getReturnType(); |
|
526 |
return tree; |
|
527 |
} |
|
528 |
||
529 |
/** Make an attributed assignop expression. |
|
530 |
* @param optag The operators tree tag. |
|
531 |
* @param lhs The operator's left argument. |
|
532 |
* @param rhs The operator's right argument. |
|
533 |
*/ |
|
534 |
JCAssignOp makeAssignop(int optag, JCTree lhs, JCTree rhs) { |
|
535 |
JCAssignOp tree = make.Assignop(optag, lhs, rhs); |
|
536 |
tree.operator = rs.resolveBinaryOperator( |
|
537 |
make_pos, tree.getTag() - JCTree.ASGOffset, attrEnv, lhs.type, rhs.type); |
|
538 |
tree.type = lhs.type; |
|
539 |
return tree; |
|
540 |
} |
|
541 |
||
542 |
/** Convert tree into string object, unless it has already a |
|
543 |
* reference type.. |
|
544 |
*/ |
|
545 |
JCExpression makeString(JCExpression tree) { |
|
546 |
if (tree.type.tag >= CLASS) { |
|
547 |
return tree; |
|
548 |
} else { |
|
549 |
Symbol valueOfSym = lookupMethod(tree.pos(), |
|
550 |
names.valueOf, |
|
551 |
syms.stringType, |
|
552 |
List.of(tree.type)); |
|
553 |
return make.App(make.QualIdent(valueOfSym), List.of(tree)); |
|
554 |
} |
|
555 |
} |
|
556 |
||
557 |
/** Create an empty anonymous class definition and enter and complete |
|
558 |
* its symbol. Return the class definition's symbol. |
|
559 |
* and create |
|
560 |
* @param flags The class symbol's flags |
|
561 |
* @param owner The class symbol's owner |
|
562 |
*/ |
|
563 |
ClassSymbol makeEmptyClass(long flags, ClassSymbol owner) { |
|
564 |
// Create class symbol. |
|
565 |
ClassSymbol c = reader.defineClass(names.empty, owner); |
|
566 |
c.flatname = chk.localClassName(c); |
|
567 |
c.sourcefile = owner.sourcefile; |
|
568 |
c.completer = null; |
|
569 |
c.members_field = new Scope(c); |
|
570 |
c.flags_field = flags; |
|
571 |
ClassType ctype = (ClassType) c.type; |
|
572 |
ctype.supertype_field = syms.objectType; |
|
573 |
ctype.interfaces_field = List.nil(); |
|
574 |
||
575 |
JCClassDecl odef = classDef(owner); |
|
576 |
||
577 |
// Enter class symbol in owner scope and compiled table. |
|
578 |
enterSynthetic(odef.pos(), c, owner.members()); |
|
579 |
chk.compiled.put(c.flatname, c); |
|
580 |
||
581 |
// Create class definition tree. |
|
582 |
JCClassDecl cdef = make.ClassDef( |
|
583 |
make.Modifiers(flags), names.empty, |
|
584 |
List.<JCTypeParameter>nil(), |
|
585 |
null, List.<JCExpression>nil(), List.<JCTree>nil()); |
|
586 |
cdef.sym = c; |
|
587 |
cdef.type = c.type; |
|
588 |
||
589 |
// Append class definition tree to owner's definitions. |
|
590 |
odef.defs = odef.defs.prepend(cdef); |
|
591 |
||
592 |
return c; |
|
593 |
} |
|
594 |
||
595 |
/************************************************************************** |
|
596 |
* Symbol manipulation utilities |
|
597 |
*************************************************************************/ |
|
598 |
||
599 |
/** Report a conflict between a user symbol and a synthetic symbol. |
|
600 |
*/ |
|
601 |
private void duplicateError(DiagnosticPosition pos, Symbol sym) { |
|
602 |
if (!sym.type.isErroneous()) { |
|
603 |
log.error(pos, "synthetic.name.conflict", sym, sym.location()); |
|
604 |
} |
|
605 |
} |
|
606 |
||
607 |
/** Enter a synthetic symbol in a given scope, but complain if there was already one there. |
|
608 |
* @param pos Position for error reporting. |
|
609 |
* @param sym The symbol. |
|
610 |
* @param s The scope. |
|
611 |
*/ |
|
612 |
private void enterSynthetic(DiagnosticPosition pos, Symbol sym, Scope s) { |
|
613 |
if (sym.name != names.error && sym.name != names.empty) { |
|
614 |
for (Scope.Entry e = s.lookup(sym.name); e.scope == s; e = e.next()) { |
|
615 |
if (sym != e.sym && sym.kind == e.sym.kind) { |
|
616 |
// VM allows methods and variables with differing types |
|
617 |
if ((sym.kind & (MTH|VAR)) != 0 && |
|
618 |
!types.erasure(sym.type).equals(types.erasure(e.sym.type))) |
|
619 |
continue; |
|
620 |
duplicateError(pos, e.sym); |
|
621 |
break; |
|
622 |
} |
|
623 |
} |
|
624 |
} |
|
625 |
s.enter(sym); |
|
626 |
} |
|
627 |
||
628 |
/** Look up a synthetic name in a given scope. |
|
629 |
* @param scope The scope. |
|
630 |
* @param name The name. |
|
631 |
*/ |
|
632 |
private Symbol lookupSynthetic(Name name, Scope s) { |
|
633 |
Symbol sym = s.lookup(name).sym; |
|
634 |
return (sym==null || (sym.flags()&SYNTHETIC)==0) ? null : sym; |
|
635 |
} |
|
636 |
||
637 |
/** Look up a method in a given scope. |
|
638 |
*/ |
|
639 |
private MethodSymbol lookupMethod(DiagnosticPosition pos, Name name, Type qual, List<Type> args) { |
|
640 |
return rs.resolveInternalMethod(pos, attrEnv, qual, name, args, null); |
|
641 |
} |
|
642 |
||
643 |
/** Look up a constructor. |
|
644 |
*/ |
|
645 |
private MethodSymbol lookupConstructor(DiagnosticPosition pos, Type qual, List<Type> args) { |
|
646 |
return rs.resolveInternalConstructor(pos, attrEnv, qual, args, null); |
|
647 |
} |
|
648 |
||
649 |
/** Look up a field. |
|
650 |
*/ |
|
651 |
private VarSymbol lookupField(DiagnosticPosition pos, Type qual, Name name) { |
|
652 |
return rs.resolveInternalField(pos, attrEnv, qual, name); |
|
653 |
} |
|
654 |
||
655 |
/************************************************************************** |
|
656 |
* Access methods |
|
657 |
*************************************************************************/ |
|
658 |
||
659 |
/** Access codes for dereferencing, assignment, |
|
660 |
* and pre/post increment/decrement. |
|
661 |
* Access codes for assignment operations are determined by method accessCode |
|
662 |
* below. |
|
663 |
* |
|
664 |
* All access codes for accesses to the current class are even. |
|
665 |
* If a member of the superclass should be accessed instead (because |
|
666 |
* access was via a qualified super), add one to the corresponding code |
|
667 |
* for the current class, making the number odd. |
|
668 |
* This numbering scheme is used by the backend to decide whether |
|
669 |
* to issue an invokevirtual or invokespecial call. |
|
670 |
* |
|
671 |
* @see Gen.visitSelect(Select tree) |
|
672 |
*/ |
|
673 |
private static final int |
|
674 |
DEREFcode = 0, |
|
675 |
ASSIGNcode = 2, |
|
676 |
PREINCcode = 4, |
|
677 |
PREDECcode = 6, |
|
678 |
POSTINCcode = 8, |
|
679 |
POSTDECcode = 10, |
|
680 |
FIRSTASGOPcode = 12; |
|
681 |
||
682 |
/** Number of access codes |
|
683 |
*/ |
|
684 |
private static final int NCODES = accessCode(ByteCodes.lushrl) + 2; |
|
685 |
||
686 |
/** A mapping from symbols to their access numbers. |
|
687 |
*/ |
|
688 |
private Map<Symbol,Integer> accessNums; |
|
689 |
||
690 |
/** A mapping from symbols to an array of access symbols, indexed by |
|
691 |
* access code. |
|
692 |
*/ |
|
693 |
private Map<Symbol,MethodSymbol[]> accessSyms; |
|
694 |
||
695 |
/** A mapping from (constructor) symbols to access constructor symbols. |
|
696 |
*/ |
|
697 |
private Map<Symbol,MethodSymbol> accessConstrs; |
|
698 |
||
699 |
/** A queue for all accessed symbols. |
|
700 |
*/ |
|
701 |
private ListBuffer<Symbol> accessed; |
|
702 |
||
703 |
/** Map bytecode of binary operation to access code of corresponding |
|
704 |
* assignment operation. This is always an even number. |
|
705 |
*/ |
|
706 |
private static int accessCode(int bytecode) { |
|
707 |
if (ByteCodes.iadd <= bytecode && bytecode <= ByteCodes.lxor) |
|
708 |
return (bytecode - iadd) * 2 + FIRSTASGOPcode; |
|
709 |
else if (bytecode == ByteCodes.string_add) |
|
710 |
return (ByteCodes.lxor + 1 - iadd) * 2 + FIRSTASGOPcode; |
|
711 |
else if (ByteCodes.ishll <= bytecode && bytecode <= ByteCodes.lushrl) |
|
712 |
return (bytecode - ishll + ByteCodes.lxor + 2 - iadd) * 2 + FIRSTASGOPcode; |
|
713 |
else |
|
714 |
return -1; |
|
715 |
} |
|
716 |
||
717 |
/** return access code for identifier, |
|
718 |
* @param tree The tree representing the identifier use. |
|
719 |
* @param enclOp The closest enclosing operation node of tree, |
|
720 |
* null if tree is not a subtree of an operation. |
|
721 |
*/ |
|
722 |
private static int accessCode(JCTree tree, JCTree enclOp) { |
|
723 |
if (enclOp == null) |
|
724 |
return DEREFcode; |
|
725 |
else if (enclOp.getTag() == JCTree.ASSIGN && |
|
726 |
tree == TreeInfo.skipParens(((JCAssign) enclOp).lhs)) |
|
727 |
return ASSIGNcode; |
|
728 |
else if (JCTree.PREINC <= enclOp.getTag() && enclOp.getTag() <= JCTree.POSTDEC && |
|
729 |
tree == TreeInfo.skipParens(((JCUnary) enclOp).arg)) |
|
730 |
return (enclOp.getTag() - JCTree.PREINC) * 2 + PREINCcode; |
|
731 |
else if (JCTree.BITOR_ASG <= enclOp.getTag() && enclOp.getTag() <= JCTree.MOD_ASG && |
|
732 |
tree == TreeInfo.skipParens(((JCAssignOp) enclOp).lhs)) |
|
733 |
return accessCode(((OperatorSymbol) ((JCAssignOp) enclOp).operator).opcode); |
|
734 |
else |
|
735 |
return DEREFcode; |
|
736 |
} |
|
737 |
||
738 |
/** Return binary operator that corresponds to given access code. |
|
739 |
*/ |
|
740 |
private OperatorSymbol binaryAccessOperator(int acode) { |
|
741 |
for (Scope.Entry e = syms.predefClass.members().elems; |
|
742 |
e != null; |
|
743 |
e = e.sibling) { |
|
744 |
if (e.sym instanceof OperatorSymbol) { |
|
745 |
OperatorSymbol op = (OperatorSymbol)e.sym; |
|
746 |
if (accessCode(op.opcode) == acode) return op; |
|
747 |
} |
|
748 |
} |
|
749 |
return null; |
|
750 |
} |
|
751 |
||
752 |
/** Return tree tag for assignment operation corresponding |
|
753 |
* to given binary operator. |
|
754 |
*/ |
|
755 |
private static int treeTag(OperatorSymbol operator) { |
|
756 |
switch (operator.opcode) { |
|
757 |
case ByteCodes.ior: case ByteCodes.lor: |
|
758 |
return JCTree.BITOR_ASG; |
|
759 |
case ByteCodes.ixor: case ByteCodes.lxor: |
|
760 |
return JCTree.BITXOR_ASG; |
|
761 |
case ByteCodes.iand: case ByteCodes.land: |
|
762 |
return JCTree.BITAND_ASG; |
|
763 |
case ByteCodes.ishl: case ByteCodes.lshl: |
|
764 |
case ByteCodes.ishll: case ByteCodes.lshll: |
|
765 |
return JCTree.SL_ASG; |
|
766 |
case ByteCodes.ishr: case ByteCodes.lshr: |
|
767 |
case ByteCodes.ishrl: case ByteCodes.lshrl: |
|
768 |
return JCTree.SR_ASG; |
|
769 |
case ByteCodes.iushr: case ByteCodes.lushr: |
|
770 |
case ByteCodes.iushrl: case ByteCodes.lushrl: |
|
771 |
return JCTree.USR_ASG; |
|
772 |
case ByteCodes.iadd: case ByteCodes.ladd: |
|
773 |
case ByteCodes.fadd: case ByteCodes.dadd: |
|
774 |
case ByteCodes.string_add: |
|
775 |
return JCTree.PLUS_ASG; |
|
776 |
case ByteCodes.isub: case ByteCodes.lsub: |
|
777 |
case ByteCodes.fsub: case ByteCodes.dsub: |
|
778 |
return JCTree.MINUS_ASG; |
|
779 |
case ByteCodes.imul: case ByteCodes.lmul: |
|
780 |
case ByteCodes.fmul: case ByteCodes.dmul: |
|
781 |
return JCTree.MUL_ASG; |
|
782 |
case ByteCodes.idiv: case ByteCodes.ldiv: |
|
783 |
case ByteCodes.fdiv: case ByteCodes.ddiv: |
|
784 |
return JCTree.DIV_ASG; |
|
785 |
case ByteCodes.imod: case ByteCodes.lmod: |
|
786 |
case ByteCodes.fmod: case ByteCodes.dmod: |
|
787 |
return JCTree.MOD_ASG; |
|
788 |
default: |
|
789 |
throw new AssertionError(); |
|
790 |
} |
|
791 |
} |
|
792 |
||
793 |
/** The name of the access method with number `anum' and access code `acode'. |
|
794 |
*/ |
|
795 |
Name accessName(int anum, int acode) { |
|
796 |
return names.fromString( |
|
797 |
"access" + target.syntheticNameChar() + anum + acode / 10 + acode % 10); |
|
798 |
} |
|
799 |
||
800 |
/** Return access symbol for a private or protected symbol from an inner class. |
|
801 |
* @param sym The accessed private symbol. |
|
802 |
* @param tree The accessing tree. |
|
803 |
* @param enclOp The closest enclosing operation node of tree, |
|
804 |
* null if tree is not a subtree of an operation. |
|
805 |
* @param protAccess Is access to a protected symbol in another |
|
806 |
* package? |
|
807 |
* @param refSuper Is access via a (qualified) C.super? |
|
808 |
*/ |
|
809 |
MethodSymbol accessSymbol(Symbol sym, JCTree tree, JCTree enclOp, |
|
810 |
boolean protAccess, boolean refSuper) { |
|
811 |
ClassSymbol accOwner = refSuper && protAccess |
|
812 |
// For access via qualified super (T.super.x), place the |
|
813 |
// access symbol on T. |
|
814 |
? (ClassSymbol)((JCFieldAccess) tree).selected.type.tsym |
|
815 |
// Otherwise pretend that the owner of an accessed |
|
816 |
// protected symbol is the enclosing class of the current |
|
817 |
// class which is a subclass of the symbol's owner. |
|
818 |
: accessClass(sym, protAccess, tree); |
|
819 |
||
820 |
Symbol vsym = sym; |
|
821 |
if (sym.owner != accOwner) { |
|
822 |
vsym = sym.clone(accOwner); |
|
823 |
actualSymbols.put(vsym, sym); |
|
824 |
} |
|
825 |
||
826 |
Integer anum // The access number of the access method. |
|
827 |
= accessNums.get(vsym); |
|
828 |
if (anum == null) { |
|
829 |
anum = accessed.length(); |
|
830 |
accessNums.put(vsym, anum); |
|
831 |
accessSyms.put(vsym, new MethodSymbol[NCODES]); |
|
832 |
accessed.append(vsym); |
|
833 |
// System.out.println("accessing " + vsym + " in " + vsym.location()); |
|
834 |
} |
|
835 |
||
836 |
int acode; // The access code of the access method. |
|
837 |
List<Type> argtypes; // The argument types of the access method. |
|
838 |
Type restype; // The result type of the access method. |
|
839 |
List<Type> thrown; // The thrown execeptions of the access method. |
|
840 |
switch (vsym.kind) { |
|
841 |
case VAR: |
|
842 |
acode = accessCode(tree, enclOp); |
|
843 |
if (acode >= FIRSTASGOPcode) { |
|
844 |
OperatorSymbol operator = binaryAccessOperator(acode); |
|
845 |
if (operator.opcode == string_add) |
|
846 |
argtypes = List.of(syms.objectType); |
|
847 |
else |
|
848 |
argtypes = operator.type.getParameterTypes().tail; |
|
849 |
} else if (acode == ASSIGNcode) |
|
850 |
argtypes = List.of(vsym.erasure(types)); |
|
851 |
else |
|
852 |
argtypes = List.nil(); |
|
853 |
restype = vsym.erasure(types); |
|
854 |
thrown = List.nil(); |
|
855 |
break; |
|
856 |
case MTH: |
|
857 |
acode = DEREFcode; |
|
858 |
argtypes = vsym.erasure(types).getParameterTypes(); |
|
859 |
restype = vsym.erasure(types).getReturnType(); |
|
860 |
thrown = vsym.type.getThrownTypes(); |
|
861 |
break; |
|
862 |
default: |
|
863 |
throw new AssertionError(); |
|
864 |
} |
|
865 |
||
866 |
// For references via qualified super, increment acode by one, |
|
867 |
// making it odd. |
|
868 |
if (protAccess && refSuper) acode++; |
|
869 |
||
870 |
// Instance access methods get instance as first parameter. |
|
871 |
// For protected symbols this needs to be the instance as a member |
|
872 |
// of the type containing the accessed symbol, not the class |
|
873 |
// containing the access method. |
|
874 |
if ((vsym.flags() & STATIC) == 0) { |
|
875 |
argtypes = argtypes.prepend(vsym.owner.erasure(types)); |
|
876 |
} |
|
877 |
MethodSymbol[] accessors = accessSyms.get(vsym); |
|
878 |
MethodSymbol accessor = accessors[acode]; |
|
879 |
if (accessor == null) { |
|
880 |
accessor = new MethodSymbol( |
|
881 |
STATIC | SYNTHETIC, |
|
882 |
accessName(anum.intValue(), acode), |
|
883 |
new MethodType(argtypes, restype, thrown, syms.methodClass), |
|
884 |
accOwner); |
|
885 |
enterSynthetic(tree.pos(), accessor, accOwner.members()); |
|
886 |
accessors[acode] = accessor; |
|
887 |
} |
|
888 |
return accessor; |
|
889 |
} |
|
890 |
||
891 |
/** The qualifier to be used for accessing a symbol in an outer class. |
|
892 |
* This is either C.sym or C.this.sym, depending on whether or not |
|
893 |
* sym is static. |
|
894 |
* @param sym The accessed symbol. |
|
895 |
*/ |
|
896 |
JCExpression accessBase(DiagnosticPosition pos, Symbol sym) { |
|
897 |
return (sym.flags() & STATIC) != 0 |
|
898 |
? access(make.at(pos.getStartPosition()).QualIdent(sym.owner)) |
|
899 |
: makeOwnerThis(pos, sym, true); |
|
900 |
} |
|
901 |
||
902 |
/** Do we need an access method to reference private symbol? |
|
903 |
*/ |
|
904 |
boolean needsPrivateAccess(Symbol sym) { |
|
905 |
if ((sym.flags() & PRIVATE) == 0 || sym.owner == currentClass) { |
|
906 |
return false; |
|
907 |
} else if (sym.name == names.init && (sym.owner.owner.kind & (VAR | MTH)) != 0) { |
|
908 |
// private constructor in local class: relax protection |
|
909 |
sym.flags_field &= ~PRIVATE; |
|
910 |
return false; |
|
911 |
} else { |
|
912 |
return true; |
|
913 |
} |
|
914 |
} |
|
915 |
||
916 |
/** Do we need an access method to reference symbol in other package? |
|
917 |
*/ |
|
918 |
boolean needsProtectedAccess(Symbol sym, JCTree tree) { |
|
919 |
if ((sym.flags() & PROTECTED) == 0 || |
|
920 |
sym.owner.owner == currentClass.owner || // fast special case |
|
921 |
sym.packge() == currentClass.packge()) |
|
922 |
return false; |
|
923 |
if (!currentClass.isSubClass(sym.owner, types)) |
|
924 |
return true; |
|
925 |
if ((sym.flags() & STATIC) != 0 || |
|
926 |
tree.getTag() != JCTree.SELECT || |
|
927 |
TreeInfo.name(((JCFieldAccess) tree).selected) == names._super) |
|
928 |
return false; |
|
929 |
return !((JCFieldAccess) tree).selected.type.tsym.isSubClass(currentClass, types); |
|
930 |
} |
|
931 |
||
932 |
/** The class in which an access method for given symbol goes. |
|
933 |
* @param sym The access symbol |
|
934 |
* @param protAccess Is access to a protected symbol in another |
|
935 |
* package? |
|
936 |
*/ |
|
937 |
ClassSymbol accessClass(Symbol sym, boolean protAccess, JCTree tree) { |
|
938 |
if (protAccess) { |
|
939 |
Symbol qualifier = null; |
|
940 |
ClassSymbol c = currentClass; |
|
941 |
if (tree.getTag() == JCTree.SELECT && (sym.flags() & STATIC) == 0) { |
|
942 |
qualifier = ((JCFieldAccess) tree).selected.type.tsym; |
|
943 |
while (!qualifier.isSubClass(c, types)) { |
|
944 |
c = c.owner.enclClass(); |
|
945 |
} |
|
946 |
return c; |
|
947 |
} else { |
|
948 |
while (!c.isSubClass(sym.owner, types)) { |
|
949 |
c = c.owner.enclClass(); |
|
950 |
} |
|
951 |
} |
|
952 |
return c; |
|
953 |
} else { |
|
954 |
// the symbol is private |
|
955 |
return sym.owner.enclClass(); |
|
956 |
} |
|
957 |
} |
|
958 |
||
959 |
/** Ensure that identifier is accessible, return tree accessing the identifier. |
|
960 |
* @param sym The accessed symbol. |
|
961 |
* @param tree The tree referring to the symbol. |
|
962 |
* @param enclOp The closest enclosing operation node of tree, |
|
963 |
* null if tree is not a subtree of an operation. |
|
964 |
* @param refSuper Is access via a (qualified) C.super? |
|
965 |
*/ |
|
966 |
JCExpression access(Symbol sym, JCExpression tree, JCExpression enclOp, boolean refSuper) { |
|
967 |
// Access a free variable via its proxy, or its proxy's proxy |
|
968 |
while (sym.kind == VAR && sym.owner.kind == MTH && |
|
969 |
sym.owner.enclClass() != currentClass) { |
|
970 |
// A constant is replaced by its constant value. |
|
971 |
Object cv = ((VarSymbol)sym).getConstValue(); |
|
972 |
if (cv != null) { |
|
973 |
make.at(tree.pos); |
|
974 |
return makeLit(sym.type, cv); |
|
975 |
} |
|
976 |
// Otherwise replace the variable by its proxy. |
|
977 |
sym = proxies.lookup(proxyName(sym.name)).sym; |
|
978 |
assert sym != null && (sym.flags_field & FINAL) != 0; |
|
979 |
tree = make.at(tree.pos).Ident(sym); |
|
980 |
} |
|
981 |
JCExpression base = (tree.getTag() == JCTree.SELECT) ? ((JCFieldAccess) tree).selected : null; |
|
982 |
switch (sym.kind) { |
|
983 |
case TYP: |
|
984 |
if (sym.owner.kind != PCK) { |
|
985 |
// Convert type idents to |
|
986 |
// <flat name> or <package name> . <flat name> |
|
987 |
Name flatname = Convert.shortName(sym.flatName()); |
|
988 |
while (base != null && |
|
989 |
TreeInfo.symbol(base) != null && |
|
990 |
TreeInfo.symbol(base).kind != PCK) { |
|
991 |
base = (base.getTag() == JCTree.SELECT) |
|
992 |
? ((JCFieldAccess) base).selected |
|
993 |
: null; |
|
994 |
} |
|
995 |
if (tree.getTag() == JCTree.IDENT) { |
|
996 |
((JCIdent) tree).name = flatname; |
|
997 |
} else if (base == null) { |
|
998 |
tree = make.at(tree.pos).Ident(sym); |
|
999 |
((JCIdent) tree).name = flatname; |
|
1000 |
} else { |
|
1001 |
((JCFieldAccess) tree).selected = base; |
|
1002 |
((JCFieldAccess) tree).name = flatname; |
|
1003 |
} |
|
1004 |
} |
|
1005 |
break; |
|
1006 |
case MTH: case VAR: |
|
1007 |
if (sym.owner.kind == TYP) { |
|
1008 |
||
1009 |
// Access methods are required for |
|
1010 |
// - private members, |
|
1011 |
// - protected members in a superclass of an |
|
1012 |
// enclosing class contained in another package. |
|
1013 |
// - all non-private members accessed via a qualified super. |
|
1014 |
boolean protAccess = refSuper && !needsPrivateAccess(sym) |
|
1015 |
|| needsProtectedAccess(sym, tree); |
|
1016 |
boolean accReq = protAccess || needsPrivateAccess(sym); |
|
1017 |
||
1018 |
// A base has to be supplied for |
|
1019 |
// - simple identifiers accessing variables in outer classes. |
|
1020 |
boolean baseReq = |
|
1021 |
base == null && |
|
1022 |
sym.owner != syms.predefClass && |
|
1023 |
!sym.isMemberOf(currentClass, types); |
|
1024 |
||
1025 |
if (accReq || baseReq) { |
|
1026 |
make.at(tree.pos); |
|
1027 |
||
1028 |
// Constants are replaced by their constant value. |
|
1029 |
if (sym.kind == VAR) { |
|
1030 |
Object cv = ((VarSymbol)sym).getConstValue(); |
|
1031 |
if (cv != null) return makeLit(sym.type, cv); |
|
1032 |
} |
|
1033 |
||
1034 |
// Private variables and methods are replaced by calls |
|
1035 |
// to their access methods. |
|
1036 |
if (accReq) { |
|
1037 |
List<JCExpression> args = List.nil(); |
|
1038 |
if ((sym.flags() & STATIC) == 0) { |
|
1039 |
// Instance access methods get instance |
|
1040 |
// as first parameter. |
|
1041 |
if (base == null) |
|
1042 |
base = makeOwnerThis(tree.pos(), sym, true); |
|
1043 |
args = args.prepend(base); |
|
1044 |
base = null; // so we don't duplicate code |
|
1045 |
} |
|
1046 |
Symbol access = accessSymbol(sym, tree, |
|
1047 |
enclOp, protAccess, |
|
1048 |
refSuper); |
|
1049 |
JCExpression receiver = make.Select( |
|
1050 |
base != null ? base : make.QualIdent(access.owner), |
|
1051 |
access); |
|
1052 |
return make.App(receiver, args); |
|
1053 |
||
1054 |
// Other accesses to members of outer classes get a |
|
1055 |
// qualifier. |
|
1056 |
} else if (baseReq) { |
|
1057 |
return make.at(tree.pos).Select( |
|
1058 |
accessBase(tree.pos(), sym), sym).setType(tree.type); |
|
1059 |
} |
|
1060 |
} |
|
1061 |
} |
|
1062 |
} |
|
1063 |
return tree; |
|
1064 |
} |
|
1065 |
||
1066 |
/** Ensure that identifier is accessible, return tree accessing the identifier. |
|
1067 |
* @param tree The identifier tree. |
|
1068 |
*/ |
|
1069 |
JCExpression access(JCExpression tree) { |
|
1070 |
Symbol sym = TreeInfo.symbol(tree); |
|
1071 |
return sym == null ? tree : access(sym, tree, null, false); |
|
1072 |
} |
|
1073 |
||
1074 |
/** Return access constructor for a private constructor, |
|
1075 |
* or the constructor itself, if no access constructor is needed. |
|
1076 |
* @param pos The position to report diagnostics, if any. |
|
1077 |
* @param constr The private constructor. |
|
1078 |
*/ |
|
1079 |
Symbol accessConstructor(DiagnosticPosition pos, Symbol constr) { |
|
1080 |
if (needsPrivateAccess(constr)) { |
|
1081 |
ClassSymbol accOwner = constr.owner.enclClass(); |
|
1082 |
MethodSymbol aconstr = accessConstrs.get(constr); |
|
1083 |
if (aconstr == null) { |
|
1084 |
List<Type> argtypes = constr.type.getParameterTypes(); |
|
1085 |
if ((accOwner.flags_field & ENUM) != 0) |
|
1086 |
argtypes = argtypes |
|
1087 |
.prepend(syms.intType) |
|
1088 |
.prepend(syms.stringType); |
|
1089 |
aconstr = new MethodSymbol( |
|
1090 |
SYNTHETIC, |
|
1091 |
names.init, |
|
1092 |
new MethodType( |
|
1093 |
argtypes.append( |
|
1094 |
accessConstructorTag().erasure(types)), |
|
1095 |
constr.type.getReturnType(), |
|
1096 |
constr.type.getThrownTypes(), |
|
1097 |
syms.methodClass), |
|
1098 |
accOwner); |
|
1099 |
enterSynthetic(pos, aconstr, accOwner.members()); |
|
1100 |
accessConstrs.put(constr, aconstr); |
|
1101 |
accessed.append(constr); |
|
1102 |
} |
|
1103 |
return aconstr; |
|
1104 |
} else { |
|
1105 |
return constr; |
|
1106 |
} |
|
1107 |
} |
|
1108 |
||
1109 |
/** Return an anonymous class nested in this toplevel class. |
|
1110 |
*/ |
|
1111 |
ClassSymbol accessConstructorTag() { |
|
1112 |
ClassSymbol topClass = currentClass.outermostClass(); |
|
1113 |
Name flatname = names.fromString("" + topClass.getQualifiedName() + |
|
1114 |
target.syntheticNameChar() + |
|
1115 |
"1"); |
|
1116 |
ClassSymbol ctag = chk.compiled.get(flatname); |
|
1117 |
if (ctag == null) |
|
1118 |
ctag = makeEmptyClass(STATIC | SYNTHETIC, topClass); |
|
1119 |
return ctag; |
|
1120 |
} |
|
1121 |
||
1122 |
/** Add all required access methods for a private symbol to enclosing class. |
|
1123 |
* @param sym The symbol. |
|
1124 |
*/ |
|
1125 |
void makeAccessible(Symbol sym) { |
|
1126 |
JCClassDecl cdef = classDef(sym.owner.enclClass()); |
|
1127 |
assert cdef != null : "class def not found: " + sym + " in " + sym.owner; |
|
1128 |
if (sym.name == names.init) { |
|
1129 |
cdef.defs = cdef.defs.prepend( |
|
1130 |
accessConstructorDef(cdef.pos, sym, accessConstrs.get(sym))); |
|
1131 |
} else { |
|
1132 |
MethodSymbol[] accessors = accessSyms.get(sym); |
|
1133 |
for (int i = 0; i < NCODES; i++) { |
|
1134 |
if (accessors[i] != null) |
|
1135 |
cdef.defs = cdef.defs.prepend( |
|
1136 |
accessDef(cdef.pos, sym, accessors[i], i)); |
|
1137 |
} |
|
1138 |
} |
|
1139 |
} |
|
1140 |
||
1141 |
/** Construct definition of an access method. |
|
1142 |
* @param pos The source code position of the definition. |
|
1143 |
* @param vsym The private or protected symbol. |
|
1144 |
* @param accessor The access method for the symbol. |
|
1145 |
* @param acode The access code. |
|
1146 |
*/ |
|
1147 |
JCTree accessDef(int pos, Symbol vsym, MethodSymbol accessor, int acode) { |
|
1148 |
// System.err.println("access " + vsym + " with " + accessor);//DEBUG |
|
1149 |
currentClass = vsym.owner.enclClass(); |
|
1150 |
make.at(pos); |
|
1151 |
JCMethodDecl md = make.MethodDef(accessor, null); |
|
1152 |
||
1153 |
// Find actual symbol |
|
1154 |
Symbol sym = actualSymbols.get(vsym); |
|
1155 |
if (sym == null) sym = vsym; |
|
1156 |
||
1157 |
JCExpression ref; // The tree referencing the private symbol. |
|
1158 |
List<JCExpression> args; // Any additional arguments to be passed along. |
|
1159 |
if ((sym.flags() & STATIC) != 0) { |
|
1160 |
ref = make.Ident(sym); |
|
1161 |
args = make.Idents(md.params); |
|
1162 |
} else { |
|
1163 |
ref = make.Select(make.Ident(md.params.head), sym); |
|
1164 |
args = make.Idents(md.params.tail); |
|
1165 |
} |
|
1166 |
JCStatement stat; // The statement accessing the private symbol. |
|
1167 |
if (sym.kind == VAR) { |
|
1168 |
// Normalize out all odd access codes by taking floor modulo 2: |
|
1169 |
int acode1 = acode - (acode & 1); |
|
1170 |
||
1171 |
JCExpression expr; // The access method's return value. |
|
1172 |
switch (acode1) { |
|
1173 |
case DEREFcode: |
|
1174 |
expr = ref; |
|
1175 |
break; |
|
1176 |
case ASSIGNcode: |
|
1177 |
expr = make.Assign(ref, args.head); |
|
1178 |
break; |
|
1179 |
case PREINCcode: case POSTINCcode: case PREDECcode: case POSTDECcode: |
|
1180 |
expr = makeUnary( |
|
1181 |
((acode1 - PREINCcode) >> 1) + JCTree.PREINC, ref); |
|
1182 |
break; |
|
1183 |
default: |
|
1184 |
expr = make.Assignop( |
|
1185 |
treeTag(binaryAccessOperator(acode1)), ref, args.head); |
|
1186 |
((JCAssignOp) expr).operator = binaryAccessOperator(acode1); |
|
1187 |
} |
|
1188 |
stat = make.Return(expr.setType(sym.type)); |
|
1189 |
} else { |
|
1190 |
stat = make.Call(make.App(ref, args)); |
|
1191 |
} |
|
1192 |
md.body = make.Block(0, List.of(stat)); |
|
1193 |
||
1194 |
// Make sure all parameters, result types and thrown exceptions |
|
1195 |
// are accessible. |
|
1196 |
for (List<JCVariableDecl> l = md.params; l.nonEmpty(); l = l.tail) |
|
1197 |
l.head.vartype = access(l.head.vartype); |
|
1198 |
md.restype = access(md.restype); |
|
1199 |
for (List<JCExpression> l = md.thrown; l.nonEmpty(); l = l.tail) |
|
1200 |
l.head = access(l.head); |
|
1201 |
||
1202 |
return md; |
|
1203 |
} |
|
1204 |
||
1205 |
/** Construct definition of an access constructor. |
|
1206 |
* @param pos The source code position of the definition. |
|
1207 |
* @param constr The private constructor. |
|
1208 |
* @param accessor The access method for the constructor. |
|
1209 |
*/ |
|
1210 |
JCTree accessConstructorDef(int pos, Symbol constr, MethodSymbol accessor) { |
|
1211 |
make.at(pos); |
|
1212 |
JCMethodDecl md = make.MethodDef(accessor, |
|
1213 |
accessor.externalType(types), |
|
1214 |
null); |
|
1215 |
JCIdent callee = make.Ident(names._this); |
|
1216 |
callee.sym = constr; |
|
1217 |
callee.type = constr.type; |
|
1218 |
md.body = |
|
1219 |
make.Block(0, List.<JCStatement>of( |
|
1220 |
make.Call( |
|
1221 |
make.App( |
|
1222 |
callee, |
|
1223 |
make.Idents(md.params.reverse().tail.reverse()))))); |
|
1224 |
return md; |
|
1225 |
} |
|
1226 |
||
1227 |
/************************************************************************** |
|
1228 |
* Free variables proxies and this$n |
|
1229 |
*************************************************************************/ |
|
1230 |
||
1231 |
/** A scope containing all free variable proxies for currently translated |
|
1232 |
* class, as well as its this$n symbol (if needed). |
|
1233 |
* Proxy scopes are nested in the same way classes are. |
|
1234 |
* Inside a constructor, proxies and any this$n symbol are duplicated |
|
1235 |
* in an additional innermost scope, where they represent the constructor |
|
1236 |
* parameters. |
|
1237 |
*/ |
|
1238 |
Scope proxies; |
|
1239 |
||
1240 |
/** A stack containing the this$n field of the currently translated |
|
1241 |
* classes (if needed) in innermost first order. |
|
1242 |
* Inside a constructor, proxies and any this$n symbol are duplicated |
|
1243 |
* in an additional innermost scope, where they represent the constructor |
|
1244 |
* parameters. |
|
1245 |
*/ |
|
1246 |
List<VarSymbol> outerThisStack; |
|
1247 |
||
1248 |
/** The name of a free variable proxy. |
|
1249 |
*/ |
|
1250 |
Name proxyName(Name name) { |
|
1251 |
return names.fromString("val" + target.syntheticNameChar() + name); |
|
1252 |
} |
|
1253 |
||
1254 |
/** Proxy definitions for all free variables in given list, in reverse order. |
|
1255 |
* @param pos The source code position of the definition. |
|
1256 |
* @param freevars The free variables. |
|
1257 |
* @param owner The class in which the definitions go. |
|
1258 |
*/ |
|
1259 |
List<JCVariableDecl> freevarDefs(int pos, List<VarSymbol> freevars, Symbol owner) { |
|
1260 |
long flags = FINAL | SYNTHETIC; |
|
1261 |
if (owner.kind == TYP && |
|
1262 |
target.usePrivateSyntheticFields()) |
|
1263 |
flags |= PRIVATE; |
|
1264 |
List<JCVariableDecl> defs = List.nil(); |
|
1265 |
for (List<VarSymbol> l = freevars; l.nonEmpty(); l = l.tail) { |
|
1266 |
VarSymbol v = l.head; |
|
1267 |
VarSymbol proxy = new VarSymbol( |
|
1268 |
flags, proxyName(v.name), v.erasure(types), owner); |
|
1269 |
proxies.enter(proxy); |
|
1270 |
JCVariableDecl vd = make.at(pos).VarDef(proxy, null); |
|
1271 |
vd.vartype = access(vd.vartype); |
|
1272 |
defs = defs.prepend(vd); |
|
1273 |
} |
|
1274 |
return defs; |
|
1275 |
} |
|
1276 |
||
1277 |
/** The name of a this$n field |
|
1278 |
* @param type The class referenced by the this$n field |
|
1279 |
*/ |
|
1280 |
Name outerThisName(Type type, Symbol owner) { |
|
1281 |
Type t = type.getEnclosingType(); |
|
1282 |
int nestingLevel = 0; |
|
1283 |
while (t.tag == CLASS) { |
|
1284 |
t = t.getEnclosingType(); |
|
1285 |
nestingLevel++; |
|
1286 |
} |
|
1287 |
Name result = names.fromString("this" + target.syntheticNameChar() + nestingLevel); |
|
1288 |
while (owner.kind == TYP && ((ClassSymbol)owner).members().lookup(result).scope != null) |
|
1289 |
result = names.fromString(result.toString() + target.syntheticNameChar()); |
|
1290 |
return result; |
|
1291 |
} |
|
1292 |
||
1293 |
/** Definition for this$n field. |
|
1294 |
* @param pos The source code position of the definition. |
|
1295 |
* @param owner The class in which the definition goes. |
|
1296 |
*/ |
|
1297 |
JCVariableDecl outerThisDef(int pos, Symbol owner) { |
|
1298 |
long flags = FINAL | SYNTHETIC; |
|
1299 |
if (owner.kind == TYP && |
|
1300 |
target.usePrivateSyntheticFields()) |
|
1301 |
flags |= PRIVATE; |
|
1302 |
Type target = types.erasure(owner.enclClass().type.getEnclosingType()); |
|
1303 |
VarSymbol outerThis = new VarSymbol( |
|
1304 |
flags, outerThisName(target, owner), target, owner); |
|
1305 |
outerThisStack = outerThisStack.prepend(outerThis); |
|
1306 |
JCVariableDecl vd = make.at(pos).VarDef(outerThis, null); |
|
1307 |
vd.vartype = access(vd.vartype); |
|
1308 |
return vd; |
|
1309 |
} |
|
1310 |
||
1311 |
/** Return a list of trees that load the free variables in given list, |
|
1312 |
* in reverse order. |
|
1313 |
* @param pos The source code position to be used for the trees. |
|
1314 |
* @param freevars The list of free variables. |
|
1315 |
*/ |
|
1316 |
List<JCExpression> loadFreevars(DiagnosticPosition pos, List<VarSymbol> freevars) { |
|
1317 |
List<JCExpression> args = List.nil(); |
|
1318 |
for (List<VarSymbol> l = freevars; l.nonEmpty(); l = l.tail) |
|
1319 |
args = args.prepend(loadFreevar(pos, l.head)); |
|
1320 |
return args; |
|
1321 |
} |
|
1322 |
//where |
|
1323 |
JCExpression loadFreevar(DiagnosticPosition pos, VarSymbol v) { |
|
1324 |
return access(v, make.at(pos).Ident(v), null, false); |
|
1325 |
} |
|
1326 |
||
1327 |
/** Construct a tree simulating the expression <C.this>. |
|
1328 |
* @param pos The source code position to be used for the tree. |
|
1329 |
* @param c The qualifier class. |
|
1330 |
*/ |
|
1331 |
JCExpression makeThis(DiagnosticPosition pos, TypeSymbol c) { |
|
1332 |
if (currentClass == c) { |
|
1333 |
// in this case, `this' works fine |
|
1334 |
return make.at(pos).This(c.erasure(types)); |
|
1335 |
} else { |
|
1336 |
// need to go via this$n |
|
1337 |
return makeOuterThis(pos, c); |
|
1338 |
} |
|
1339 |
} |
|
1340 |
||
1341 |
/** Construct a tree that represents the outer instance |
|
1342 |
* <C.this>. Never pick the current `this'. |
|
1343 |
* @param pos The source code position to be used for the tree. |
|
1344 |
* @param c The qualifier class. |
|
1345 |
*/ |
|
1346 |
JCExpression makeOuterThis(DiagnosticPosition pos, TypeSymbol c) { |
|
1347 |
List<VarSymbol> ots = outerThisStack; |
|
1348 |
if (ots.isEmpty()) { |
|
1349 |
log.error(pos, "no.encl.instance.of.type.in.scope", c); |
|
1350 |
assert false; |
|
1351 |
return makeNull(); |
|
1352 |
} |
|
1353 |
VarSymbol ot = ots.head; |
|
1354 |
JCExpression tree = access(make.at(pos).Ident(ot)); |
|
1355 |
TypeSymbol otc = ot.type.tsym; |
|
1356 |
while (otc != c) { |
|
1357 |
do { |
|
1358 |
ots = ots.tail; |
|
1359 |
if (ots.isEmpty()) { |
|
1360 |
log.error(pos, |
|
1361 |
"no.encl.instance.of.type.in.scope", |
|
1362 |
c); |
|
1363 |
assert false; // should have been caught in Attr |
|
1364 |
return tree; |
|
1365 |
} |
|
1366 |
ot = ots.head; |
|
1367 |
} while (ot.owner != otc); |
|
1368 |
if (otc.owner.kind != PCK && !otc.hasOuterInstance()) { |
|
1369 |
chk.earlyRefError(pos, c); |
|
1370 |
assert false; // should have been caught in Attr |
|
1371 |
return makeNull(); |
|
1372 |
} |
|
1373 |
tree = access(make.at(pos).Select(tree, ot)); |
|
1374 |
otc = ot.type.tsym; |
|
1375 |
} |
|
1376 |
return tree; |
|
1377 |
} |
|
1378 |
||
1379 |
/** Construct a tree that represents the closest outer instance |
|
1380 |
* <C.this> such that the given symbol is a member of C. |
|
1381 |
* @param pos The source code position to be used for the tree. |
|
1382 |
* @param sym The accessed symbol. |
|
1383 |
* @param preciseMatch should we accept a type that is a subtype of |
|
1384 |
* sym's owner, even if it doesn't contain sym |
|
1385 |
* due to hiding, overriding, or non-inheritance |
|
1386 |
* due to protection? |
|
1387 |
*/ |
|
1388 |
JCExpression makeOwnerThis(DiagnosticPosition pos, Symbol sym, boolean preciseMatch) { |
|
1389 |
Symbol c = sym.owner; |
|
1390 |
if (preciseMatch ? sym.isMemberOf(currentClass, types) |
|
1391 |
: currentClass.isSubClass(sym.owner, types)) { |
|
1392 |
// in this case, `this' works fine |
|
1393 |
return make.at(pos).This(c.erasure(types)); |
|
1394 |
} else { |
|
1395 |
// need to go via this$n |
|
1396 |
return makeOwnerThisN(pos, sym, preciseMatch); |
|
1397 |
} |
|
1398 |
} |
|
1399 |
||
1400 |
/** |
|
1401 |
* Similar to makeOwnerThis but will never pick "this". |
|
1402 |
*/ |
|
1403 |
JCExpression makeOwnerThisN(DiagnosticPosition pos, Symbol sym, boolean preciseMatch) { |
|
1404 |
Symbol c = sym.owner; |
|
1405 |
List<VarSymbol> ots = outerThisStack; |
|
1406 |
if (ots.isEmpty()) { |
|
1407 |
log.error(pos, "no.encl.instance.of.type.in.scope", c); |
|
1408 |
assert false; |
|
1409 |
return makeNull(); |
|
1410 |
} |
|
1411 |
VarSymbol ot = ots.head; |
|
1412 |
JCExpression tree = access(make.at(pos).Ident(ot)); |
|
1413 |
TypeSymbol otc = ot.type.tsym; |
|
1414 |
while (!(preciseMatch ? sym.isMemberOf(otc, types) : otc.isSubClass(sym.owner, types))) { |
|
1415 |
do { |
|
1416 |
ots = ots.tail; |
|
1417 |
if (ots.isEmpty()) { |
|
1418 |
log.error(pos, |
|
1419 |
"no.encl.instance.of.type.in.scope", |
|
1420 |
c); |
|
1421 |
assert false; |
|
1422 |
return tree; |
|
1423 |
} |
|
1424 |
ot = ots.head; |
|
1425 |
} while (ot.owner != otc); |
|
1426 |
tree = access(make.at(pos).Select(tree, ot)); |
|
1427 |
otc = ot.type.tsym; |
|
1428 |
} |
|
1429 |
return tree; |
|
1430 |
} |
|
1431 |
||
1432 |
/** Return tree simulating the assignment <this.name = name>, where |
|
1433 |
* name is the name of a free variable. |
|
1434 |
*/ |
|
1435 |
JCStatement initField(int pos, Name name) { |
|
1436 |
Scope.Entry e = proxies.lookup(name); |
|
1437 |
Symbol rhs = e.sym; |
|
1438 |
assert rhs.owner.kind == MTH; |
|
1439 |
Symbol lhs = e.next().sym; |
|
1440 |
assert rhs.owner.owner == lhs.owner; |
|
1441 |
make.at(pos); |
|
1442 |
return |
|
1443 |
make.Exec( |
|
1444 |
make.Assign( |
|
1445 |
make.Select(make.This(lhs.owner.erasure(types)), lhs), |
|
1446 |
make.Ident(rhs)).setType(lhs.erasure(types))); |
|
1447 |
} |
|
1448 |
||
1449 |
/** Return tree simulating the assignment <this.this$n = this$n>. |
|
1450 |
*/ |
|
1451 |
JCStatement initOuterThis(int pos) { |
|
1452 |
VarSymbol rhs = outerThisStack.head; |
|
1453 |
assert rhs.owner.kind == MTH; |
|
1454 |
VarSymbol lhs = outerThisStack.tail.head; |
|
1455 |
assert rhs.owner.owner == lhs.owner; |
|
1456 |
make.at(pos); |
|
1457 |
return |
|
1458 |
make.Exec( |
|
1459 |
make.Assign( |
|
1460 |
make.Select(make.This(lhs.owner.erasure(types)), lhs), |
|
1461 |
make.Ident(rhs)).setType(lhs.erasure(types))); |
|
1462 |
} |
|
1463 |
||
1464 |
/************************************************************************** |
|
1465 |
* Code for .class |
|
1466 |
*************************************************************************/ |
|
1467 |
||
1468 |
/** Return the symbol of a class to contain a cache of |
|
1469 |
* compiler-generated statics such as class$ and the |
|
1470 |
* $assertionsDisabled flag. We create an anonymous nested class |
|
1471 |
* (unless one already exists) and return its symbol. However, |
|
1472 |
* for backward compatibility in 1.4 and earlier we use the |
|
1473 |
* top-level class itself. |
|
1474 |
*/ |
|
1475 |
private ClassSymbol outerCacheClass() { |
|
1476 |
ClassSymbol clazz = outermostClassDef.sym; |
|
1477 |
if ((clazz.flags() & INTERFACE) == 0 && |
|
1478 |
!target.useInnerCacheClass()) return clazz; |
|
1479 |
Scope s = clazz.members(); |
|
1480 |
for (Scope.Entry e = s.elems; e != null; e = e.sibling) |
|
1481 |
if (e.sym.kind == TYP && |
|
1482 |
e.sym.name == names.empty && |
|
1483 |
(e.sym.flags() & INTERFACE) == 0) return (ClassSymbol) e.sym; |
|
1484 |
return makeEmptyClass(STATIC | SYNTHETIC, clazz); |
|
1485 |
} |
|
1486 |
||
1487 |
/** Return symbol for "class$" method. If there is no method definition |
|
1488 |
* for class$, construct one as follows: |
|
1489 |
* |
|
1490 |
* class class$(String x0) { |
|
1491 |
* try { |
|
1492 |
* return Class.forName(x0); |
|
1493 |
* } catch (ClassNotFoundException x1) { |
|
1494 |
* throw new NoClassDefFoundError(x1.getMessage()); |
|
1495 |
* } |
|
1496 |
* } |
|
1497 |
*/ |
|
1498 |
private MethodSymbol classDollarSym(DiagnosticPosition pos) { |
|
1499 |
ClassSymbol outerCacheClass = outerCacheClass(); |
|
1500 |
MethodSymbol classDollarSym = |
|
1501 |
(MethodSymbol)lookupSynthetic(classDollar, |
|
1502 |
outerCacheClass.members()); |
|
1503 |
if (classDollarSym == null) { |
|
1504 |
classDollarSym = new MethodSymbol( |
|
1505 |
STATIC | SYNTHETIC, |
|
1506 |
classDollar, |
|
1507 |
new MethodType( |
|
1508 |
List.of(syms.stringType), |
|
1509 |
types.erasure(syms.classType), |
|
1510 |
List.<Type>nil(), |
|
1511 |
syms.methodClass), |
|
1512 |
outerCacheClass); |
|
1513 |
enterSynthetic(pos, classDollarSym, outerCacheClass.members()); |
|
1514 |
||
1515 |
JCMethodDecl md = make.MethodDef(classDollarSym, null); |
|
1516 |
try { |
|
1517 |
md.body = classDollarSymBody(pos, md); |
|
1518 |
} catch (CompletionFailure ex) { |
|
1519 |
md.body = make.Block(0, List.<JCStatement>nil()); |
|
1520 |
chk.completionError(pos, ex); |
|
1521 |
} |
|
1522 |
JCClassDecl outerCacheClassDef = classDef(outerCacheClass); |
|
1523 |
outerCacheClassDef.defs = outerCacheClassDef.defs.prepend(md); |
|
1524 |
} |
|
1525 |
return classDollarSym; |
|
1526 |
} |
|
1527 |
||
1528 |
/** Generate code for class$(String name). */ |
|
1529 |
JCBlock classDollarSymBody(DiagnosticPosition pos, JCMethodDecl md) { |
|
1530 |
MethodSymbol classDollarSym = md.sym; |
|
1531 |
ClassSymbol outerCacheClass = (ClassSymbol)classDollarSym.owner; |
|
1532 |
||
1533 |
JCBlock returnResult; |
|
1534 |
||
1535 |
// in 1.4.2 and above, we use |
|
1536 |
// Class.forName(String name, boolean init, ClassLoader loader); |
|
1537 |
// which requires we cache the current loader in cl$ |
|
1538 |
if (target.classLiteralsNoInit()) { |
|
1539 |
// clsym = "private static ClassLoader cl$" |
|
1540 |
VarSymbol clsym = new VarSymbol(STATIC|SYNTHETIC, |
|
1541 |
names.fromString("cl" + target.syntheticNameChar()), |
|
1542 |
syms.classLoaderType, |
|
1543 |
outerCacheClass); |
|
1544 |
enterSynthetic(pos, clsym, outerCacheClass.members()); |
|
1545 |
||
1546 |
// emit "private static ClassLoader cl$;" |
|
1547 |
JCVariableDecl cldef = make.VarDef(clsym, null); |
|
1548 |
JCClassDecl outerCacheClassDef = classDef(outerCacheClass); |
|
1549 |
outerCacheClassDef.defs = outerCacheClassDef.defs.prepend(cldef); |
|
1550 |
||
1551 |
// newcache := "new cache$1[0]" |
|
1552 |
JCNewArray newcache = make. |
|
1553 |
NewArray(make.Type(outerCacheClass.type), |
|
1554 |
List.<JCExpression>of(make.Literal(INT, 0).setType(syms.intType)), |
|
1555 |
null); |
|
1556 |
newcache.type = new ArrayType(types.erasure(outerCacheClass.type), |
|
1557 |
syms.arrayClass); |
|
1558 |
||
1559 |
// forNameSym := java.lang.Class.forName( |
|
1560 |
// String s,boolean init,ClassLoader loader) |
|
1561 |
Symbol forNameSym = lookupMethod(make_pos, names.forName, |
|
1562 |
types.erasure(syms.classType), |
|
1563 |
List.of(syms.stringType, |
|
1564 |
syms.booleanType, |
|
1565 |
syms.classLoaderType)); |
|
1566 |
// clvalue := "(cl$ == null) ? |
|
1567 |
// $newcache.getClass().getComponentType().getClassLoader() : cl$" |
|
1568 |
JCExpression clvalue = |
|
1569 |
make.Conditional( |
|
1570 |
makeBinary(JCTree.EQ, make.Ident(clsym), makeNull()), |
|
1571 |
make.Assign( |
|
1572 |
make.Ident(clsym), |
|
1573 |
makeCall( |
|
1574 |
makeCall(makeCall(newcache, |
|
1575 |
names.getClass, |
|
1576 |
List.<JCExpression>nil()), |
|
1577 |
names.getComponentType, |
|
1578 |
List.<JCExpression>nil()), |
|
1579 |
names.getClassLoader, |
|
1580 |
List.<JCExpression>nil())).setType(syms.classLoaderType), |
|
1581 |
make.Ident(clsym)).setType(syms.classLoaderType); |
|
1582 |
||
1583 |
// returnResult := "{ return Class.forName(param1, false, cl$); }" |
|
1584 |
List<JCExpression> args = List.of(make.Ident(md.params.head.sym), |
|
1585 |
makeLit(syms.booleanType, 0), |
|
1586 |
clvalue); |
|
1587 |
returnResult = make. |
|
1588 |
Block(0, List.<JCStatement>of(make. |
|
1589 |
Call(make. // return |
|
1590 |
App(make. |
|
1591 |
Ident(forNameSym), args)))); |
|
1592 |
} else { |
|
1593 |
// forNameSym := java.lang.Class.forName(String s) |
|
1594 |
Symbol forNameSym = lookupMethod(make_pos, |
|
1595 |
names.forName, |
|
1596 |
types.erasure(syms.classType), |
|
1597 |
List.of(syms.stringType)); |
|
1598 |
// returnResult := "{ return Class.forName(param1); }" |
|
1599 |
returnResult = make. |
|
1600 |
Block(0, List.of(make. |
|
1601 |
Call(make. // return |
|
1602 |
App(make. |
|
1603 |
QualIdent(forNameSym), |
|
1604 |
List.<JCExpression>of(make. |
|
1605 |
Ident(md.params. |
|
1606 |
head.sym)))))); |
|
1607 |
} |
|
1608 |
||
1609 |
// catchParam := ClassNotFoundException e1 |
|
1610 |
VarSymbol catchParam = |
|
1611 |
new VarSymbol(0, make.paramName(1), |
|
1612 |
syms.classNotFoundExceptionType, |
|
1613 |
classDollarSym); |
|
1614 |
||
1615 |
JCStatement rethrow; |
|
1616 |
if (target.hasInitCause()) { |
|
1617 |
// rethrow = "throw new NoClassDefFoundError().initCause(e); |
|
1618 |
JCTree throwExpr = |
|
1619 |
makeCall(makeNewClass(syms.noClassDefFoundErrorType, |
|
1620 |
List.<JCExpression>nil()), |
|
1621 |
names.initCause, |
|
1622 |
List.<JCExpression>of(make.Ident(catchParam))); |
|
1623 |
rethrow = make.Throw(throwExpr); |
|
1624 |
} else { |
|
1625 |
// getMessageSym := ClassNotFoundException.getMessage() |
|
1626 |
Symbol getMessageSym = lookupMethod(make_pos, |
|
1627 |
names.getMessage, |
|
1628 |
syms.classNotFoundExceptionType, |
|
1629 |
List.<Type>nil()); |
|
1630 |
// rethrow = "throw new NoClassDefFoundError(e.getMessage());" |
|
1631 |
rethrow = make. |
|
1632 |
Throw(makeNewClass(syms.noClassDefFoundErrorType, |
|
1633 |
List.<JCExpression>of(make.App(make.Select(make.Ident(catchParam), |
|
1634 |
getMessageSym), |
|
1635 |
List.<JCExpression>nil())))); |
|
1636 |
} |
|
1637 |
||
1638 |
// rethrowStmt := "( $rethrow )" |
|
1639 |
JCBlock rethrowStmt = make.Block(0, List.of(rethrow)); |
|
1640 |
||
1641 |
// catchBlock := "catch ($catchParam) $rethrowStmt" |
|
1642 |
JCCatch catchBlock = make.Catch(make.VarDef(catchParam, null), |
|
1643 |
rethrowStmt); |
|
1644 |
||
1645 |
// tryCatch := "try $returnResult $catchBlock" |
|
1646 |
JCStatement tryCatch = make.Try(returnResult, |
|
1647 |
List.of(catchBlock), null); |
|
1648 |
||
1649 |
return make.Block(0, List.of(tryCatch)); |
|
1650 |
} |
|
1651 |
// where |
|
1652 |
/** Create an attributed tree of the form left.name(). */ |
|
1653 |
private JCMethodInvocation makeCall(JCExpression left, Name name, List<JCExpression> args) { |
|
1654 |
assert left.type != null; |
|
1655 |
Symbol funcsym = lookupMethod(make_pos, name, left.type, |
|
1656 |
TreeInfo.types(args)); |
|
1657 |
return make.App(make.Select(left, funcsym), args); |
|
1658 |
} |
|
1659 |
||
1660 |
/** The Name Of The variable to cache T.class values. |
|
1661 |
* @param sig The signature of type T. |
|
1662 |
*/ |
|
1663 |
private Name cacheName(String sig) { |
|
1664 |
StringBuffer buf = new StringBuffer(); |
|
1665 |
if (sig.startsWith("[")) { |
|
1666 |
buf = buf.append("array"); |
|
1667 |
while (sig.startsWith("[")) { |
|
1668 |
buf = buf.append(target.syntheticNameChar()); |
|
1669 |
sig = sig.substring(1); |
|
1670 |
} |
|
1671 |
if (sig.startsWith("L")) { |
|
1672 |
sig = sig.substring(0, sig.length() - 1); |
|
1673 |
} |
|
1674 |
} else { |
|
1675 |
buf = buf.append("class" + target.syntheticNameChar()); |
|
1676 |
} |
|
1677 |
buf = buf.append(sig.replace('.', target.syntheticNameChar())); |
|
1678 |
return names.fromString(buf.toString()); |
|
1679 |
} |
|
1680 |
||
1681 |
/** The variable symbol that caches T.class values. |
|
1682 |
* If none exists yet, create a definition. |
|
1683 |
* @param sig The signature of type T. |
|
1684 |
* @param pos The position to report diagnostics, if any. |
|
1685 |
*/ |
|
1686 |
private VarSymbol cacheSym(DiagnosticPosition pos, String sig) { |
|
1687 |
ClassSymbol outerCacheClass = outerCacheClass(); |
|
1688 |
Name cname = cacheName(sig); |
|
1689 |
VarSymbol cacheSym = |
|
1690 |
(VarSymbol)lookupSynthetic(cname, outerCacheClass.members()); |
|
1691 |
if (cacheSym == null) { |
|
1692 |
cacheSym = new VarSymbol( |
|
1693 |
STATIC | SYNTHETIC, cname, types.erasure(syms.classType), outerCacheClass); |
|
1694 |
enterSynthetic(pos, cacheSym, outerCacheClass.members()); |
|
1695 |
||
1696 |
JCVariableDecl cacheDef = make.VarDef(cacheSym, null); |
|
1697 |
JCClassDecl outerCacheClassDef = classDef(outerCacheClass); |
|
1698 |
outerCacheClassDef.defs = outerCacheClassDef.defs.prepend(cacheDef); |
|
1699 |
} |
|
1700 |
return cacheSym; |
|
1701 |
} |
|
1702 |
||
1703 |
/** The tree simulating a T.class expression. |
|
1704 |
* @param clazz The tree identifying type T. |
|
1705 |
*/ |
|
1706 |
private JCExpression classOf(JCTree clazz) { |
|
1707 |
return classOfType(clazz.type, clazz.pos()); |
|
1708 |
} |
|
1709 |
||
1710 |
private JCExpression classOfType(Type type, DiagnosticPosition pos) { |
|
1711 |
switch (type.tag) { |
|
1712 |
case BYTE: case SHORT: case CHAR: case INT: case LONG: case FLOAT: |
|
1713 |
case DOUBLE: case BOOLEAN: case VOID: |
|
1714 |
// replace with <BoxedClass>.TYPE |
|
1715 |
ClassSymbol c = types.boxedClass(type); |
|
1716 |
Symbol typeSym = |
|
1717 |
rs.access( |
|
1718 |
rs.findIdentInType(attrEnv, c.type, names.TYPE, VAR), |
|
1719 |
pos, c.type, names.TYPE, true); |
|
1720 |
if (typeSym.kind == VAR) |
|
1721 |
((VarSymbol)typeSym).getConstValue(); // ensure initializer is evaluated |
|
1722 |
return make.QualIdent(typeSym); |
|
1723 |
case CLASS: case ARRAY: |
|
1724 |
if (target.hasClassLiterals()) { |
|
1725 |
VarSymbol sym = new VarSymbol( |
|
1726 |
STATIC | PUBLIC | FINAL, names._class, |
|
1727 |
syms.classType, type.tsym); |
|
1728 |
return make_at(pos).Select(make.Type(type), sym); |
|
1729 |
} |
|
1730 |
// replace with <cache == null ? cache = class$(tsig) : cache> |
|
1731 |
// where |
|
1732 |
// - <tsig> is the type signature of T, |
|
1733 |
// - <cache> is the cache variable for tsig. |
|
1734 |
String sig = |
|
1735 |
writer.xClassName(type).toString().replace('/', '.'); |
|
1736 |
Symbol cs = cacheSym(pos, sig); |
|
1737 |
return make_at(pos).Conditional( |
|
1738 |
makeBinary(JCTree.EQ, make.Ident(cs), makeNull()), |
|
1739 |
make.Assign( |
|
1740 |
make.Ident(cs), |
|
1741 |
make.App( |
|
1742 |
make.Ident(classDollarSym(pos)), |
|
1743 |
List.<JCExpression>of(make.Literal(CLASS, sig) |
|
1744 |
.setType(syms.stringType)))) |
|
1745 |
.setType(types.erasure(syms.classType)), |
|
1746 |
make.Ident(cs)).setType(types.erasure(syms.classType)); |
|
1747 |
default: |
|
1748 |
throw new AssertionError(); |
|
1749 |
} |
|
1750 |
} |
|
1751 |
||
1752 |
/************************************************************************** |
|
1753 |
* Code for enabling/disabling assertions. |
|
1754 |
*************************************************************************/ |
|
1755 |
||
1756 |
// This code is not particularly robust if the user has |
|
1757 |
// previously declared a member named '$assertionsDisabled'. |
|
1758 |
// The same faulty idiom also appears in the translation of |
|
1759 |
// class literals above. We should report an error if a |
|
1760 |
// previous declaration is not synthetic. |
|
1761 |
||
1762 |
private JCExpression assertFlagTest(DiagnosticPosition pos) { |
|
1763 |
// Outermost class may be either true class or an interface. |
|
1764 |
ClassSymbol outermostClass = outermostClassDef.sym; |
|
1765 |
||
1766 |
// note that this is a class, as an interface can't contain a statement. |
|
1767 |
ClassSymbol container = currentClass; |
|
1768 |
||
1769 |
VarSymbol assertDisabledSym = |
|
1770 |
(VarSymbol)lookupSynthetic(dollarAssertionsDisabled, |
|
1771 |
container.members()); |
|
1772 |
if (assertDisabledSym == null) { |
|
1773 |
assertDisabledSym = |
|
1774 |
new VarSymbol(STATIC | FINAL | SYNTHETIC, |
|
1775 |
dollarAssertionsDisabled, |
|
1776 |
syms.booleanType, |
|
1777 |
container); |
|
1778 |
enterSynthetic(pos, assertDisabledSym, container.members()); |
|
1779 |
Symbol desiredAssertionStatusSym = lookupMethod(pos, |
|
1780 |
names.desiredAssertionStatus, |
|
1781 |
types.erasure(syms.classType), |
|
1782 |
List.<Type>nil()); |
|
1783 |
JCClassDecl containerDef = classDef(container); |
|
1784 |
make_at(containerDef.pos()); |
|
1785 |
JCExpression notStatus = makeUnary(JCTree.NOT, make.App(make.Select( |
|
1786 |
classOfType(types.erasure(outermostClass.type), |
|
1787 |
containerDef.pos()), |
|
1788 |
desiredAssertionStatusSym))); |
|
1789 |
JCVariableDecl assertDisabledDef = make.VarDef(assertDisabledSym, |
|
1790 |
notStatus); |
|
1791 |
containerDef.defs = containerDef.defs.prepend(assertDisabledDef); |
|
1792 |
} |
|
1793 |
make_at(pos); |
|
1794 |
return makeUnary(JCTree.NOT, make.Ident(assertDisabledSym)); |
|
1795 |
} |
|
1796 |
||
1797 |
||
1798 |
/************************************************************************** |
|
1799 |
* Building blocks for let expressions |
|
1800 |
*************************************************************************/ |
|
1801 |
||
1802 |
interface TreeBuilder { |
|
1803 |
JCTree build(JCTree arg); |
|
1804 |
} |
|
1805 |
||
1806 |
/** Construct an expression using the builder, with the given rval |
|
1807 |
* expression as an argument to the builder. However, the rval |
|
1808 |
* expression must be computed only once, even if used multiple |
|
1809 |
* times in the result of the builder. We do that by |
|
1810 |
* constructing a "let" expression that saves the rvalue into a |
|
1811 |
* temporary variable and then uses the temporary variable in |
|
1812 |
* place of the expression built by the builder. The complete |
|
1813 |
* resulting expression is of the form |
|
1814 |
* <pre> |
|
1815 |
* (let <b>TYPE</b> <b>TEMP</b> = <b>RVAL</b>; |
|
1816 |
* in (<b>BUILDER</b>(<b>TEMP</b>))) |
|
1817 |
* </pre> |
|
1818 |
* where <code><b>TEMP</b></code> is a newly declared variable |
|
1819 |
* in the let expression. |
|
1820 |
*/ |
|
1821 |
JCTree abstractRval(JCTree rval, Type type, TreeBuilder builder) { |
|
1822 |
rval = TreeInfo.skipParens(rval); |
|
1823 |
switch (rval.getTag()) { |
|
1824 |
case JCTree.LITERAL: |
|
1825 |
return builder.build(rval); |
|
1826 |
case JCTree.IDENT: |
|
1827 |
JCIdent id = (JCIdent) rval; |
|
1828 |
if ((id.sym.flags() & FINAL) != 0 && id.sym.owner.kind == MTH) |
|
1829 |
return builder.build(rval); |
|
1830 |
} |
|
1831 |
VarSymbol var = |
|
1832 |
new VarSymbol(FINAL|SYNTHETIC, |
|
1833 |
Name.fromString(names, |
|
1834 |
target.syntheticNameChar() |
|
1835 |
+ "" + rval.hashCode()), |
|
1836 |
type, |
|
1837 |
currentMethodSym); |
|
161
bfe63856332f
6614974: javac successfully compiles code that throws java.lang.VerifyError when run
mcimadamore
parents:
10
diff
changeset
|
1838 |
rval = convert(rval,type); |
10 | 1839 |
JCVariableDecl def = make.VarDef(var, (JCExpression)rval); // XXX cast |
1840 |
JCTree built = builder.build(make.Ident(var)); |
|
1841 |
JCTree res = make.LetExpr(def, built); |
|
1842 |
res.type = built.type; |
|
1843 |
return res; |
|
1844 |
} |
|
1845 |
||
1846 |
// same as above, with the type of the temporary variable computed |
|
1847 |
JCTree abstractRval(JCTree rval, TreeBuilder builder) { |
|
1848 |
return abstractRval(rval, rval.type, builder); |
|
1849 |
} |
|
1850 |
||
1851 |
// same as above, but for an expression that may be used as either |
|
1852 |
// an rvalue or an lvalue. This requires special handling for |
|
1853 |
// Select expressions, where we place the left-hand-side of the |
|
1854 |
// select in a temporary, and for Indexed expressions, where we |
|
1855 |
// place both the indexed expression and the index value in temps. |
|
1856 |
JCTree abstractLval(JCTree lval, final TreeBuilder builder) { |
|
1857 |
lval = TreeInfo.skipParens(lval); |
|
1858 |
switch (lval.getTag()) { |
|
1859 |
case JCTree.IDENT: |
|
1860 |
return builder.build(lval); |
|
1861 |
case JCTree.SELECT: { |
|
1862 |
final JCFieldAccess s = (JCFieldAccess)lval; |
|
1863 |
JCTree selected = TreeInfo.skipParens(s.selected); |
|
1864 |
Symbol lid = TreeInfo.symbol(s.selected); |
|
1865 |
if (lid != null && lid.kind == TYP) return builder.build(lval); |
|
1866 |
return abstractRval(s.selected, new TreeBuilder() { |
|
1867 |
public JCTree build(final JCTree selected) { |
|
1868 |
return builder.build(make.Select((JCExpression)selected, s.sym)); |
|
1869 |
} |
|
1870 |
}); |
|
1871 |
} |
|
1872 |
case JCTree.INDEXED: { |
|
1873 |
final JCArrayAccess i = (JCArrayAccess)lval; |
|
1874 |
return abstractRval(i.indexed, new TreeBuilder() { |
|
1875 |
public JCTree build(final JCTree indexed) { |
|
1876 |
return abstractRval(i.index, syms.intType, new TreeBuilder() { |
|
1877 |
public JCTree build(final JCTree index) { |
|
1878 |
JCTree newLval = make.Indexed((JCExpression)indexed, |
|
1879 |
(JCExpression)index); |
|
1880 |
newLval.setType(i.type); |
|
1881 |
return builder.build(newLval); |
|
1882 |
} |
|
1883 |
}); |
|
1884 |
} |
|
1885 |
}); |
|
1886 |
} |
|
1887 |
} |
|
1888 |
throw new AssertionError(lval); |
|
1889 |
} |
|
1890 |
||
1891 |
// evaluate and discard the first expression, then evaluate the second. |
|
1892 |
JCTree makeComma(final JCTree expr1, final JCTree expr2) { |
|
1893 |
return abstractRval(expr1, new TreeBuilder() { |
|
1894 |
public JCTree build(final JCTree discarded) { |
|
1895 |
return expr2; |
|
1896 |
} |
|
1897 |
}); |
|
1898 |
} |
|
1899 |
||
1900 |
/************************************************************************** |
|
1901 |
* Translation methods |
|
1902 |
*************************************************************************/ |
|
1903 |
||
1904 |
/** Visitor argument: enclosing operator node. |
|
1905 |
*/ |
|
1906 |
private JCExpression enclOp; |
|
1907 |
||
1908 |
/** Visitor method: Translate a single node. |
|
1909 |
* Attach the source position from the old tree to its replacement tree. |
|
1910 |
*/ |
|
1911 |
public <T extends JCTree> T translate(T tree) { |
|
1912 |
if (tree == null) { |
|
1913 |
return null; |
|
1914 |
} else { |
|
1915 |
make_at(tree.pos()); |
|
1916 |
T result = super.translate(tree); |
|
1917 |
if (endPositions != null && result != tree) { |
|
1918 |
Integer endPos = endPositions.remove(tree); |
|
1919 |
if (endPos != null) endPositions.put(result, endPos); |
|
1920 |
} |
|
1921 |
return result; |
|
1922 |
} |
|
1923 |
} |
|
1924 |
||
1925 |
/** Visitor method: Translate a single node, boxing or unboxing if needed. |
|
1926 |
*/ |
|
1927 |
public <T extends JCTree> T translate(T tree, Type type) { |
|
1928 |
return (tree == null) ? null : boxIfNeeded(translate(tree), type); |
|
1929 |
} |
|
1930 |
||
1931 |
/** Visitor method: Translate tree. |
|
1932 |
*/ |
|
1933 |
public <T extends JCTree> T translate(T tree, JCExpression enclOp) { |
|
1934 |
JCExpression prevEnclOp = this.enclOp; |
|
1935 |
this.enclOp = enclOp; |
|
1936 |
T res = translate(tree); |
|
1937 |
this.enclOp = prevEnclOp; |
|
1938 |
return res; |
|
1939 |
} |
|
1940 |
||
1941 |
/** Visitor method: Translate list of trees. |
|
1942 |
*/ |
|
1943 |
public <T extends JCTree> List<T> translate(List<T> trees, JCExpression enclOp) { |
|
1944 |
JCExpression prevEnclOp = this.enclOp; |
|
1945 |
this.enclOp = enclOp; |
|
1946 |
List<T> res = translate(trees); |
|
1947 |
this.enclOp = prevEnclOp; |
|
1948 |
return res; |
|
1949 |
} |
|
1950 |
||
1951 |
/** Visitor method: Translate list of trees. |
|
1952 |
*/ |
|
1953 |
public <T extends JCTree> List<T> translate(List<T> trees, Type type) { |
|
1954 |
if (trees == null) return null; |
|
1955 |
for (List<T> l = trees; l.nonEmpty(); l = l.tail) |
|
1956 |
l.head = translate(l.head, type); |
|
1957 |
return trees; |
|
1958 |
} |
|
1959 |
||
1960 |
public void visitTopLevel(JCCompilationUnit tree) { |
|
1961 |
if (tree.packageAnnotations.nonEmpty()) { |
|
1962 |
Name name = names.package_info; |
|
1963 |
long flags = Flags.ABSTRACT | Flags.INTERFACE; |
|
1964 |
if (target.isPackageInfoSynthetic()) |
|
1965 |
// package-info is marked SYNTHETIC in JDK 1.6 and later releases |
|
1966 |
flags = flags | Flags.SYNTHETIC; |
|
1967 |
JCClassDecl packageAnnotationsClass |
|
1968 |
= make.ClassDef(make.Modifiers(flags, |
|
1969 |
tree.packageAnnotations), |
|
1970 |
name, List.<JCTypeParameter>nil(), |
|
1971 |
null, List.<JCExpression>nil(), List.<JCTree>nil()); |
|
1972 |
ClassSymbol c = reader.enterClass(name, tree.packge); |
|
1973 |
c.flatname = names.fromString(tree.packge + "." + name); |
|
1974 |
c.sourcefile = tree.sourcefile; |
|
1975 |
c.completer = null; |
|
1976 |
c.members_field = new Scope(c); |
|
1977 |
c.flags_field = flags; |
|
1978 |
c.attributes_field = tree.packge.attributes_field; |
|
1979 |
tree.packge.attributes_field = List.nil(); |
|
1980 |
ClassType ctype = (ClassType) c.type; |
|
1981 |
ctype.supertype_field = syms.objectType; |
|
1982 |
ctype.interfaces_field = List.nil(); |
|
1983 |
packageAnnotationsClass.sym = c; |
|
1984 |
||
1985 |
||
1986 |
translated.append(packageAnnotationsClass); |
|
1987 |
} |
|
1988 |
} |
|
1989 |
||
1990 |
public void visitClassDef(JCClassDecl tree) { |
|
1991 |
ClassSymbol currentClassPrev = currentClass; |
|
1992 |
MethodSymbol currentMethodSymPrev = currentMethodSym; |
|
1993 |
currentClass = tree.sym; |
|
1994 |
currentMethodSym = null; |
|
1995 |
classdefs.put(currentClass, tree); |
|
1996 |
||
1997 |
proxies = proxies.dup(currentClass); |
|
1998 |
List<VarSymbol> prevOuterThisStack = outerThisStack; |
|
1999 |
||
2000 |
// If this is an enum definition |
|
2001 |
if ((tree.mods.flags & ENUM) != 0 && |
|
2002 |
(types.supertype(currentClass.type).tsym.flags() & ENUM) == 0) |
|
2003 |
visitEnumDef(tree); |
|
2004 |
||
2005 |
// If this is a nested class, define a this$n field for |
|
2006 |
// it and add to proxies. |
|
2007 |
JCVariableDecl otdef = null; |
|
2008 |
if (currentClass.hasOuterInstance()) |
|
2009 |
otdef = outerThisDef(tree.pos, currentClass); |
|
2010 |
||
2011 |
// If this is a local class, define proxies for all its free variables. |
|
2012 |
List<JCVariableDecl> fvdefs = freevarDefs( |
|
2013 |
tree.pos, freevars(currentClass), currentClass); |
|
2014 |
||
2015 |
// Recursively translate superclass, interfaces. |
|
2016 |
tree.extending = translate(tree.extending); |
|
2017 |
tree.implementing = translate(tree.implementing); |
|
2018 |
||
2019 |
// Recursively translate members, taking into account that new members |
|
2020 |
// might be created during the translation and prepended to the member |
|
2021 |
// list `tree.defs'. |
|
2022 |
List<JCTree> seen = List.nil(); |
|
2023 |
while (tree.defs != seen) { |
|
2024 |
List<JCTree> unseen = tree.defs; |
|
2025 |
for (List<JCTree> l = unseen; l.nonEmpty() && l != seen; l = l.tail) { |
|
2026 |
JCTree outermostMemberDefPrev = outermostMemberDef; |
|
2027 |
if (outermostMemberDefPrev == null) outermostMemberDef = l.head; |
|
2028 |
l.head = translate(l.head); |
|
2029 |
outermostMemberDef = outermostMemberDefPrev; |
|
2030 |
} |
|
2031 |
seen = unseen; |
|
2032 |
} |
|
2033 |
||
2034 |
// Convert a protected modifier to public, mask static modifier. |
|
2035 |
if ((tree.mods.flags & PROTECTED) != 0) tree.mods.flags |= PUBLIC; |
|
2036 |
tree.mods.flags &= ClassFlags; |
|
2037 |
||
2038 |
// Convert name to flat representation, replacing '.' by '$'. |
|
2039 |
tree.name = Convert.shortName(currentClass.flatName()); |
|
2040 |
||
2041 |
// Add this$n and free variables proxy definitions to class. |
|
2042 |
for (List<JCVariableDecl> l = fvdefs; l.nonEmpty(); l = l.tail) { |
|
2043 |
tree.defs = tree.defs.prepend(l.head); |
|
2044 |
enterSynthetic(tree.pos(), l.head.sym, currentClass.members()); |
|
2045 |
} |
|
2046 |
if (currentClass.hasOuterInstance()) { |
|
2047 |
tree.defs = tree.defs.prepend(otdef); |
|
2048 |
enterSynthetic(tree.pos(), otdef.sym, currentClass.members()); |
|
2049 |
} |
|
2050 |
||
2051 |
proxies = proxies.leave(); |
|
2052 |
outerThisStack = prevOuterThisStack; |
|
2053 |
||
2054 |
// Append translated tree to `translated' queue. |
|
2055 |
translated.append(tree); |
|
2056 |
||
2057 |
currentClass = currentClassPrev; |
|
2058 |
currentMethodSym = currentMethodSymPrev; |
|
2059 |
||
2060 |
// Return empty block {} as a placeholder for an inner class. |
|
2061 |
result = make_at(tree.pos()).Block(0, List.<JCStatement>nil()); |
|
2062 |
} |
|
2063 |
||
2064 |
/** Translate an enum class. */ |
|
2065 |
private void visitEnumDef(JCClassDecl tree) { |
|
2066 |
make_at(tree.pos()); |
|
2067 |
||
2068 |
// add the supertype, if needed |
|
2069 |
if (tree.extending == null) |
|
2070 |
tree.extending = make.Type(types.supertype(tree.type)); |
|
2071 |
||
2072 |
// classOfType adds a cache field to tree.defs unless |
|
2073 |
// target.hasClassLiterals(). |
|
2074 |
JCExpression e_class = classOfType(tree.sym.type, tree.pos()). |
|
2075 |
setType(types.erasure(syms.classType)); |
|
2076 |
||
2077 |
// process each enumeration constant, adding implicit constructor parameters |
|
2078 |
int nextOrdinal = 0; |
|
2079 |
ListBuffer<JCExpression> values = new ListBuffer<JCExpression>(); |
|
2080 |
ListBuffer<JCTree> enumDefs = new ListBuffer<JCTree>(); |
|
2081 |
ListBuffer<JCTree> otherDefs = new ListBuffer<JCTree>(); |
|
2082 |
for (List<JCTree> defs = tree.defs; |
|
2083 |
defs.nonEmpty(); |
|
2084 |
defs=defs.tail) { |
|
2085 |
if (defs.head.getTag() == JCTree.VARDEF && (((JCVariableDecl) defs.head).mods.flags & ENUM) != 0) { |
|
2086 |
JCVariableDecl var = (JCVariableDecl)defs.head; |
|
2087 |
visitEnumConstantDef(var, nextOrdinal++); |
|
2088 |
values.append(make.QualIdent(var.sym)); |
|
2089 |
enumDefs.append(var); |
|
2090 |
} else { |
|
2091 |
otherDefs.append(defs.head); |
|
2092 |
} |
|
2093 |
} |
|
2094 |
||
2095 |
// private static final T[] #VALUES = { a, b, c }; |
|
2096 |
Name valuesName = names.fromString(target.syntheticNameChar() + "VALUES"); |
|
2097 |
while (tree.sym.members().lookup(valuesName).scope != null) // avoid name clash |
|
2098 |
valuesName = names.fromString(valuesName + "" + target.syntheticNameChar()); |
|
2099 |
Type arrayType = new ArrayType(types.erasure(tree.type), syms.arrayClass); |
|
2100 |
VarSymbol valuesVar = new VarSymbol(PRIVATE|FINAL|STATIC|SYNTHETIC, |
|
2101 |
valuesName, |
|
2102 |
arrayType, |
|
2103 |
tree.type.tsym); |
|
2104 |
JCNewArray newArray = make.NewArray(make.Type(types.erasure(tree.type)), |
|
2105 |
List.<JCExpression>nil(), |
|
2106 |
values.toList()); |
|
2107 |
newArray.type = arrayType; |
|
2108 |
enumDefs.append(make.VarDef(valuesVar, newArray)); |
|
2109 |
tree.sym.members().enter(valuesVar); |
|
2110 |
||
2111 |
Symbol valuesSym = lookupMethod(tree.pos(), names.values, |
|
2112 |
tree.type, List.<Type>nil()); |
|
2113 |
JCTypeCast valuesResult = |
|
2114 |
make.TypeCast(valuesSym.type.getReturnType(), |
|
2115 |
make.App(make.Select(make.Ident(valuesVar), |
|
2116 |
syms.arrayCloneMethod))); |
|
2117 |
JCMethodDecl valuesDef = |
|
2118 |
make.MethodDef((MethodSymbol)valuesSym, |
|
2119 |
make.Block(0, List.<JCStatement>nil() |
|
2120 |
.prepend(make.Return(valuesResult)))); |
|
2121 |
enumDefs.append(valuesDef); |
|
2122 |
||
2123 |
/** The template for the following code is: |
|
2124 |
* |
|
2125 |
* public static E valueOf(String name) { |
|
2126 |
* return (E)Enum.valueOf(E.class, name); |
|
2127 |
* } |
|
2128 |
* |
|
2129 |
* where E is tree.sym |
|
2130 |
*/ |
|
2131 |
MethodSymbol valueOfSym = lookupMethod(tree.pos(), |
|
2132 |
names.valueOf, |
|
2133 |
tree.sym.type, |
|
2134 |
List.of(syms.stringType)); |
|
2135 |
assert (valueOfSym.flags() & STATIC) != 0; |
|
2136 |
VarSymbol nameArgSym = valueOfSym.params.head; |
|
2137 |
JCIdent nameVal = make.Ident(nameArgSym); |
|
2138 |
JCStatement enum_ValueOf = |
|
2139 |
make.Return(make.TypeCast(tree.sym.type, |
|
2140 |
makeCall(make.Ident(syms.enumSym), |
|
2141 |
names.valueOf, |
|
2142 |
List.of(e_class, nameVal)))); |
|
2143 |
JCMethodDecl valueOf = make.MethodDef(valueOfSym, |
|
2144 |
make.Block(0, List.of(enum_ValueOf))); |
|
2145 |
nameVal.sym = valueOf.params.head.sym; |
|
2146 |
if (debugLower) |
|
2147 |
System.err.println(tree.sym + ".valueOf = " + valueOf); |
|
2148 |
enumDefs.append(valueOf); |
|
2149 |
||
2150 |
enumDefs.appendList(otherDefs.toList()); |
|
2151 |
tree.defs = enumDefs.toList(); |
|
2152 |
||
2153 |
// Add the necessary members for the EnumCompatibleMode |
|
2154 |
if (target.compilerBootstrap(tree.sym)) { |
|
2155 |
addEnumCompatibleMembers(tree); |
|
2156 |
} |
|
2157 |
} |
|
2158 |
||
2159 |
/** Translate an enumeration constant and its initializer. */ |
|
2160 |
private void visitEnumConstantDef(JCVariableDecl var, int ordinal) { |
|
2161 |
JCNewClass varDef = (JCNewClass)var.init; |
|
2162 |
varDef.args = varDef.args. |
|
2163 |
prepend(makeLit(syms.intType, ordinal)). |
|
2164 |
prepend(makeLit(syms.stringType, var.name.toString())); |
|
2165 |
} |
|
2166 |
||
2167 |
public void visitMethodDef(JCMethodDecl tree) { |
|
2168 |
if (tree.name == names.init && (currentClass.flags_field&ENUM) != 0) { |
|
2169 |
// Add "String $enum$name, int $enum$ordinal" to the beginning of the |
|
2170 |
// argument list for each constructor of an enum. |
|
2171 |
JCVariableDecl nameParam = make_at(tree.pos()). |
|
2172 |
Param(names.fromString(target.syntheticNameChar() + |
|
2173 |
"enum" + target.syntheticNameChar() + "name"), |
|
2174 |
syms.stringType, tree.sym); |
|
2175 |
nameParam.mods.flags |= SYNTHETIC; nameParam.sym.flags_field |= SYNTHETIC; |
|
2176 |
||
2177 |
JCVariableDecl ordParam = make. |
|
2178 |
Param(names.fromString(target.syntheticNameChar() + |
|
2179 |
"enum" + target.syntheticNameChar() + |
|
2180 |
"ordinal"), |
|
2181 |
syms.intType, tree.sym); |
|
2182 |
ordParam.mods.flags |= SYNTHETIC; ordParam.sym.flags_field |= SYNTHETIC; |
|
2183 |
||
2184 |
tree.params = tree.params.prepend(ordParam).prepend(nameParam); |
|
2185 |
||
2186 |
MethodSymbol m = tree.sym; |
|
2187 |
Type olderasure = m.erasure(types); |
|
2188 |
m.erasure_field = new MethodType( |
|
2189 |
olderasure.getParameterTypes().prepend(syms.intType).prepend(syms.stringType), |
|
2190 |
olderasure.getReturnType(), |
|
2191 |
olderasure.getThrownTypes(), |
|
2192 |
syms.methodClass); |
|
2193 |
||
2194 |
if (target.compilerBootstrap(m.owner)) { |
|
2195 |
// Initialize synthetic name field |
|
2196 |
Symbol nameVarSym = lookupSynthetic(names.fromString("$name"), |
|
2197 |
tree.sym.owner.members()); |
|
2198 |
JCIdent nameIdent = make.Ident(nameParam.sym); |
|
2199 |
JCIdent id1 = make.Ident(nameVarSym); |
|
2200 |
JCAssign newAssign = make.Assign(id1, nameIdent); |
|
2201 |
newAssign.type = id1.type; |
|
2202 |
JCExpressionStatement nameAssign = make.Exec(newAssign); |
|
2203 |
nameAssign.type = id1.type; |
|
2204 |
tree.body.stats = tree.body.stats.prepend(nameAssign); |
|
2205 |
||
2206 |
// Initialize synthetic ordinal field |
|
2207 |
Symbol ordinalVarSym = lookupSynthetic(names.fromString("$ordinal"), |
|
2208 |
tree.sym.owner.members()); |
|
2209 |
JCIdent ordIdent = make.Ident(ordParam.sym); |
|
2210 |
id1 = make.Ident(ordinalVarSym); |
|
2211 |
newAssign = make.Assign(id1, ordIdent); |
|
2212 |
newAssign.type = id1.type; |
|
2213 |
JCExpressionStatement ordinalAssign = make.Exec(newAssign); |
|
2214 |
ordinalAssign.type = id1.type; |
|
2215 |
tree.body.stats = tree.body.stats.prepend(ordinalAssign); |
|
2216 |
} |
|
2217 |
} |
|
2218 |
||
2219 |
JCMethodDecl prevMethodDef = currentMethodDef; |
|
2220 |
MethodSymbol prevMethodSym = currentMethodSym; |
|
2221 |
try { |
|
2222 |
currentMethodDef = tree; |
|
2223 |
currentMethodSym = tree.sym; |
|
2224 |
visitMethodDefInternal(tree); |
|
2225 |
} finally { |
|
2226 |
currentMethodDef = prevMethodDef; |
|
2227 |
currentMethodSym = prevMethodSym; |
|
2228 |
} |
|
2229 |
} |
|
2230 |
//where |
|
2231 |
private void visitMethodDefInternal(JCMethodDecl tree) { |
|
2232 |
if (tree.name == names.init && |
|
2233 |
(currentClass.isInner() || |
|
2234 |
(currentClass.owner.kind & (VAR | MTH)) != 0)) { |
|
2235 |
// We are seeing a constructor of an inner class. |
|
2236 |
MethodSymbol m = tree.sym; |
|
2237 |
||
2238 |
// Push a new proxy scope for constructor parameters. |
|
2239 |
// and create definitions for any this$n and proxy parameters. |
|
2240 |
proxies = proxies.dup(m); |
|
2241 |
List<VarSymbol> prevOuterThisStack = outerThisStack; |
|
2242 |
List<VarSymbol> fvs = freevars(currentClass); |
|
2243 |
JCVariableDecl otdef = null; |
|
2244 |
if (currentClass.hasOuterInstance()) |
|
2245 |
otdef = outerThisDef(tree.pos, m); |
|
2246 |
List<JCVariableDecl> fvdefs = freevarDefs(tree.pos, fvs, m); |
|
2247 |
||
2248 |
// Recursively translate result type, parameters and thrown list. |
|
2249 |
tree.restype = translate(tree.restype); |
|
2250 |
tree.params = translateVarDefs(tree.params); |
|
2251 |
tree.thrown = translate(tree.thrown); |
|
2252 |
||
2253 |
// when compiling stubs, don't process body |
|
2254 |
if (tree.body == null) { |
|
2255 |
result = tree; |
|
2256 |
return; |
|
2257 |
} |
|
2258 |
||
2259 |
// Add this$n (if needed) in front of and free variables behind |
|
2260 |
// constructor parameter list. |
|
2261 |
tree.params = tree.params.appendList(fvdefs); |
|
2262 |
if (currentClass.hasOuterInstance()) |
|
2263 |
tree.params = tree.params.prepend(otdef); |
|
2264 |
||
2265 |
// If this is an initial constructor, i.e., it does not start with |
|
2266 |
// this(...), insert initializers for this$n and proxies |
|
2267 |
// before (pre-1.4, after) the call to superclass constructor. |
|
2268 |
JCStatement selfCall = translate(tree.body.stats.head); |
|
2269 |
||
2270 |
List<JCStatement> added = List.nil(); |
|
2271 |
if (fvs.nonEmpty()) { |
|
2272 |
List<Type> addedargtypes = List.nil(); |
|
2273 |
for (List<VarSymbol> l = fvs; l.nonEmpty(); l = l.tail) { |
|
2274 |
if (TreeInfo.isInitialConstructor(tree)) |
|
2275 |
added = added.prepend( |
|
2276 |
initField(tree.body.pos, proxyName(l.head.name))); |
|
2277 |
addedargtypes = addedargtypes.prepend(l.head.erasure(types)); |
|
2278 |
} |
|
2279 |
Type olderasure = m.erasure(types); |
|
2280 |
m.erasure_field = new MethodType( |
|
2281 |
olderasure.getParameterTypes().appendList(addedargtypes), |
|
2282 |
olderasure.getReturnType(), |
|
2283 |
olderasure.getThrownTypes(), |
|
2284 |
syms.methodClass); |
|
2285 |
} |
|
2286 |
if (currentClass.hasOuterInstance() && |
|
2287 |
TreeInfo.isInitialConstructor(tree)) |
|
2288 |
{ |
|
2289 |
added = added.prepend(initOuterThis(tree.body.pos)); |
|
2290 |
} |
|
2291 |
||
2292 |
// pop local variables from proxy stack |
|
2293 |
proxies = proxies.leave(); |
|
2294 |
||
2295 |
// recursively translate following local statements and |
|
2296 |
// combine with this- or super-call |
|
2297 |
List<JCStatement> stats = translate(tree.body.stats.tail); |
|
2298 |
if (target.initializeFieldsBeforeSuper()) |
|
2299 |
tree.body.stats = stats.prepend(selfCall).prependList(added); |
|
2300 |
else |
|
2301 |
tree.body.stats = stats.prependList(added).prepend(selfCall); |
|
2302 |
||
2303 |
outerThisStack = prevOuterThisStack; |
|
2304 |
} else { |
|
2305 |
super.visitMethodDef(tree); |
|
2306 |
} |
|
2307 |
result = tree; |
|
2308 |
} |
|
2309 |
||
2310 |
public void visitTypeCast(JCTypeCast tree) { |
|
2311 |
tree.clazz = translate(tree.clazz); |
|
2312 |
if (tree.type.isPrimitive() != tree.expr.type.isPrimitive()) |
|
2313 |
tree.expr = translate(tree.expr, tree.type); |
|
2314 |
else |
|
2315 |
tree.expr = translate(tree.expr); |
|
2316 |
result = tree; |
|
2317 |
} |
|
2318 |
||
2319 |
public void visitNewClass(JCNewClass tree) { |
|
2320 |
ClassSymbol c = (ClassSymbol)tree.constructor.owner; |
|
2321 |
||
2322 |
// Box arguments, if necessary |
|
2323 |
boolean isEnum = (tree.constructor.owner.flags() & ENUM) != 0; |
|
2324 |
List<Type> argTypes = tree.constructor.type.getParameterTypes(); |
|
2325 |
if (isEnum) argTypes = argTypes.prepend(syms.intType).prepend(syms.stringType); |
|
2326 |
tree.args = boxArgs(argTypes, tree.args, tree.varargsElement); |
|
2327 |
tree.varargsElement = null; |
|
2328 |
||
2329 |
// If created class is local, add free variables after |
|
2330 |
// explicit constructor arguments. |
|
2331 |
if ((c.owner.kind & (VAR | MTH)) != 0) { |
|
2332 |
tree.args = tree.args.appendList(loadFreevars(tree.pos(), freevars(c))); |
|
2333 |
} |
|
2334 |
||
2335 |
// If an access constructor is used, append null as a last argument. |
|
2336 |
Symbol constructor = accessConstructor(tree.pos(), tree.constructor); |
|
2337 |
if (constructor != tree.constructor) { |
|
2338 |
tree.args = tree.args.append(makeNull()); |
|
2339 |
tree.constructor = constructor; |
|
2340 |
} |
|
2341 |
||
2342 |
// If created class has an outer instance, and new is qualified, pass |
|
2343 |
// qualifier as first argument. If new is not qualified, pass the |
|
2344 |
// correct outer instance as first argument. |
|
2345 |
if (c.hasOuterInstance()) { |
|
2346 |
JCExpression thisArg; |
|
2347 |
if (tree.encl != null) { |
|
2348 |
thisArg = attr.makeNullCheck(translate(tree.encl)); |
|
2349 |
thisArg.type = tree.encl.type; |
|
2350 |
} else if ((c.owner.kind & (MTH | VAR)) != 0) { |
|
2351 |
// local class |
|
2352 |
thisArg = makeThis(tree.pos(), c.type.getEnclosingType().tsym); |
|
2353 |
} else { |
|
2354 |
// nested class |
|
2355 |
thisArg = makeOwnerThis(tree.pos(), c, false); |
|
2356 |
} |
|
2357 |
tree.args = tree.args.prepend(thisArg); |
|
2358 |
} |
|
2359 |
tree.encl = null; |
|
2360 |
||
2361 |
// If we have an anonymous class, create its flat version, rather |
|
2362 |
// than the class or interface following new. |
|
2363 |
if (tree.def != null) { |
|
2364 |
translate(tree.def); |
|
2365 |
tree.clazz = access(make_at(tree.clazz.pos()).Ident(tree.def.sym)); |
|
2366 |
tree.def = null; |
|
2367 |
} else { |
|
2368 |
tree.clazz = access(c, tree.clazz, enclOp, false); |
|
2369 |
} |
|
2370 |
result = tree; |
|
2371 |
} |
|
2372 |
||
2373 |
// Simplify conditionals with known constant controlling expressions. |
|
2374 |
// This allows us to avoid generating supporting declarations for |
|
2375 |
// the dead code, which will not be eliminated during code generation. |
|
2376 |
// Note that Flow.isFalse and Flow.isTrue only return true |
|
2377 |
// for constant expressions in the sense of JLS 15.27, which |
|
2378 |
// are guaranteed to have no side-effects. More agressive |
|
2379 |
// constant propagation would require that we take care to |
|
2380 |
// preserve possible side-effects in the condition expression. |
|
2381 |
||
2382 |
/** Visitor method for conditional expressions. |
|
2383 |
*/ |
|
2384 |
public void visitConditional(JCConditional tree) { |
|
2385 |
JCTree cond = tree.cond = translate(tree.cond, syms.booleanType); |
|
2386 |
if (cond.type.isTrue()) { |
|
2387 |
result = convert(translate(tree.truepart, tree.type), tree.type); |
|
2388 |
} else if (cond.type.isFalse()) { |
|
2389 |
result = convert(translate(tree.falsepart, tree.type), tree.type); |
|
2390 |
} else { |
|
2391 |
// Condition is not a compile-time constant. |
|
2392 |
tree.truepart = translate(tree.truepart, tree.type); |
|
2393 |
tree.falsepart = translate(tree.falsepart, tree.type); |
|
2394 |
result = tree; |
|
2395 |
} |
|
2396 |
} |
|
2397 |
//where |
|
2398 |
private JCTree convert(JCTree tree, Type pt) { |
|
2399 |
if (tree.type == pt) return tree; |
|
2400 |
JCTree result = make_at(tree.pos()).TypeCast(make.Type(pt), (JCExpression)tree); |
|
2401 |
result.type = (tree.type.constValue() != null) ? cfolder.coerce(tree.type, pt) |
|
2402 |
: pt; |
|
2403 |
return result; |
|
2404 |
} |
|
2405 |
||
2406 |
/** Visitor method for if statements. |
|
2407 |
*/ |
|
2408 |
public void visitIf(JCIf tree) { |
|
2409 |
JCTree cond = tree.cond = translate(tree.cond, syms.booleanType); |
|
2410 |
if (cond.type.isTrue()) { |
|
2411 |
result = translate(tree.thenpart); |
|
2412 |
} else if (cond.type.isFalse()) { |
|
2413 |
if (tree.elsepart != null) { |
|
2414 |
result = translate(tree.elsepart); |
|
2415 |
} else { |
|
2416 |
result = make.Skip(); |
|
2417 |
} |
|
2418 |
} else { |
|
2419 |
// Condition is not a compile-time constant. |
|
2420 |
tree.thenpart = translate(tree.thenpart); |
|
2421 |
tree.elsepart = translate(tree.elsepart); |
|
2422 |
result = tree; |
|
2423 |
} |
|
2424 |
} |
|
2425 |
||
2426 |
/** Visitor method for assert statements. Translate them away. |
|
2427 |
*/ |
|
2428 |
public void visitAssert(JCAssert tree) { |
|
2429 |
DiagnosticPosition detailPos = (tree.detail == null) ? tree.pos() : tree.detail.pos(); |
|
2430 |
tree.cond = translate(tree.cond, syms.booleanType); |
|
2431 |
if (!tree.cond.type.isTrue()) { |
|
2432 |
JCExpression cond = assertFlagTest(tree.pos()); |
|
2433 |
List<JCExpression> exnArgs = (tree.detail == null) ? |
|
2434 |
List.<JCExpression>nil() : List.of(translate(tree.detail)); |
|
2435 |
if (!tree.cond.type.isFalse()) { |
|
2436 |
cond = makeBinary |
|
2437 |
(JCTree.AND, |
|
2438 |
cond, |
|
2439 |
makeUnary(JCTree.NOT, tree.cond)); |
|
2440 |
} |
|
2441 |
result = |
|
2442 |
make.If(cond, |
|
2443 |
make_at(detailPos). |
|
2444 |
Throw(makeNewClass(syms.assertionErrorType, exnArgs)), |
|
2445 |
null); |
|
2446 |
} else { |
|
2447 |
result = make.Skip(); |
|
2448 |
} |
|
2449 |
} |
|
2450 |
||
2451 |
public void visitApply(JCMethodInvocation tree) { |
|
2452 |
Symbol meth = TreeInfo.symbol(tree.meth); |
|
2453 |
List<Type> argtypes = meth.type.getParameterTypes(); |
|
2454 |
if (allowEnums && |
|
2455 |
meth.name==names.init && |
|
2456 |
meth.owner == syms.enumSym) |
|
2457 |
argtypes = argtypes.tail.tail; |
|
2458 |
tree.args = boxArgs(argtypes, tree.args, tree.varargsElement); |
|
2459 |
tree.varargsElement = null; |
|
2460 |
Name methName = TreeInfo.name(tree.meth); |
|
2461 |
if (meth.name==names.init) { |
|
2462 |
// We are seeing a this(...) or super(...) constructor call. |
|
2463 |
// If an access constructor is used, append null as a last argument. |
|
2464 |
Symbol constructor = accessConstructor(tree.pos(), meth); |
|
2465 |
if (constructor != meth) { |
|
2466 |
tree.args = tree.args.append(makeNull()); |
|
2467 |
TreeInfo.setSymbol(tree.meth, constructor); |
|
2468 |
} |
|
2469 |
||
2470 |
// If we are calling a constructor of a local class, add |
|
2471 |
// free variables after explicit constructor arguments. |
|
2472 |
ClassSymbol c = (ClassSymbol)constructor.owner; |
|
2473 |
if ((c.owner.kind & (VAR | MTH)) != 0) { |
|
2474 |
tree.args = tree.args.appendList(loadFreevars(tree.pos(), freevars(c))); |
|
2475 |
} |
|
2476 |
||
2477 |
// If we are calling a constructor of an enum class, pass |
|
2478 |
// along the name and ordinal arguments |
|
2479 |
if ((c.flags_field&ENUM) != 0 || c.getQualifiedName() == names.java_lang_Enum) { |
|
2480 |
List<JCVariableDecl> params = currentMethodDef.params; |
|
2481 |
if (currentMethodSym.owner.hasOuterInstance()) |
|
2482 |
params = params.tail; // drop this$n |
|
2483 |
tree.args = tree.args |
|
2484 |
.prepend(make_at(tree.pos()).Ident(params.tail.head.sym)) // ordinal |
|
2485 |
.prepend(make.Ident(params.head.sym)); // name |
|
2486 |
} |
|
2487 |
||
2488 |
// If we are calling a constructor of a class with an outer |
|
2489 |
// instance, and the call |
|
2490 |
// is qualified, pass qualifier as first argument in front of |
|
2491 |
// the explicit constructor arguments. If the call |
|
2492 |
// is not qualified, pass the correct outer instance as |
|
2493 |
// first argument. |
|
2494 |
if (c.hasOuterInstance()) { |
|
2495 |
JCExpression thisArg; |
|
2496 |
if (tree.meth.getTag() == JCTree.SELECT) { |
|
2497 |
thisArg = attr. |
|
2498 |
makeNullCheck(translate(((JCFieldAccess) tree.meth).selected)); |
|
2499 |
tree.meth = make.Ident(constructor); |
|
2500 |
((JCIdent) tree.meth).name = methName; |
|
2501 |
} else if ((c.owner.kind & (MTH | VAR)) != 0 || methName == names._this){ |
|
2502 |
// local class or this() call |
|
2503 |
thisArg = makeThis(tree.meth.pos(), c.type.getEnclosingType().tsym); |
|
2504 |
} else { |
|
2505 |
// super() call of nested class |
|
2506 |
thisArg = makeOwnerThis(tree.meth.pos(), c, false); |
|
2507 |
} |
|
2508 |
tree.args = tree.args.prepend(thisArg); |
|
2509 |
} |
|
2510 |
} else { |
|
2511 |
// We are seeing a normal method invocation; translate this as usual. |
|
2512 |
tree.meth = translate(tree.meth); |
|
2513 |
||
2514 |
// If the translated method itself is an Apply tree, we are |
|
2515 |
// seeing an access method invocation. In this case, append |
|
2516 |
// the method arguments to the arguments of the access method. |
|
2517 |
if (tree.meth.getTag() == JCTree.APPLY) { |
|
2518 |
JCMethodInvocation app = (JCMethodInvocation)tree.meth; |
|
2519 |
app.args = tree.args.prependList(app.args); |
|
2520 |
result = app; |
|
2521 |
return; |
|
2522 |
} |
|
2523 |
} |
|
2524 |
result = tree; |
|
2525 |
} |
|
2526 |
||
2527 |
List<JCExpression> boxArgs(List<Type> parameters, List<JCExpression> _args, Type varargsElement) { |
|
2528 |
List<JCExpression> args = _args; |
|
2529 |
if (parameters.isEmpty()) return args; |
|
2530 |
boolean anyChanges = false; |
|
2531 |
ListBuffer<JCExpression> result = new ListBuffer<JCExpression>(); |
|
2532 |
while (parameters.tail.nonEmpty()) { |
|
2533 |
JCExpression arg = translate(args.head, parameters.head); |
|
2534 |
anyChanges |= (arg != args.head); |
|
2535 |
result.append(arg); |
|
2536 |
args = args.tail; |
|
2537 |
parameters = parameters.tail; |
|
2538 |
} |
|
2539 |
Type parameter = parameters.head; |
|
2540 |
if (varargsElement != null) { |
|
2541 |
anyChanges = true; |
|
2542 |
ListBuffer<JCExpression> elems = new ListBuffer<JCExpression>(); |
|
2543 |
while (args.nonEmpty()) { |
|
2544 |
JCExpression arg = translate(args.head, varargsElement); |
|
2545 |
elems.append(arg); |
|
2546 |
args = args.tail; |
|
2547 |
} |
|
2548 |
JCNewArray boxedArgs = make.NewArray(make.Type(varargsElement), |
|
2549 |
List.<JCExpression>nil(), |
|
2550 |
elems.toList()); |
|
2551 |
boxedArgs.type = new ArrayType(varargsElement, syms.arrayClass); |
|
2552 |
result.append(boxedArgs); |
|
2553 |
} else { |
|
2554 |
if (args.length() != 1) throw new AssertionError(args); |
|
2555 |
JCExpression arg = translate(args.head, parameter); |
|
2556 |
anyChanges |= (arg != args.head); |
|
2557 |
result.append(arg); |
|
2558 |
if (!anyChanges) return _args; |
|
2559 |
} |
|
2560 |
return result.toList(); |
|
2561 |
} |
|
2562 |
||
2563 |
/** Expand a boxing or unboxing conversion if needed. */ |
|
2564 |
@SuppressWarnings("unchecked") // XXX unchecked |
|
2565 |
<T extends JCTree> T boxIfNeeded(T tree, Type type) { |
|
2566 |
boolean havePrimitive = tree.type.isPrimitive(); |
|
2567 |
if (havePrimitive == type.isPrimitive()) |
|
2568 |
return tree; |
|
2569 |
if (havePrimitive) { |
|
2570 |
Type unboxedTarget = types.unboxedType(type); |
|
2571 |
if (unboxedTarget.tag != NONE) { |
|
2572 |
if (!types.isSubtype(tree.type, unboxedTarget)) |
|
2573 |
tree.type = unboxedTarget; // e.g. Character c = 89; |
|
2574 |
return (T)boxPrimitive((JCExpression)tree, type); |
|
2575 |
} else { |
|
2576 |
tree = (T)boxPrimitive((JCExpression)tree); |
|
2577 |
} |
|
2578 |
} else { |
|
2579 |
tree = (T)unbox((JCExpression)tree, type); |
|
2580 |
} |
|
2581 |
return tree; |
|
2582 |
} |
|
2583 |
||
2584 |
/** Box up a single primitive expression. */ |
|
2585 |
JCExpression boxPrimitive(JCExpression tree) { |
|
2586 |
return boxPrimitive(tree, types.boxedClass(tree.type).type); |
|
2587 |
} |
|
2588 |
||
2589 |
/** Box up a single primitive expression. */ |
|
2590 |
JCExpression boxPrimitive(JCExpression tree, Type box) { |
|
2591 |
make_at(tree.pos()); |
|
2592 |
if (target.boxWithConstructors()) { |
|
2593 |
Symbol ctor = lookupConstructor(tree.pos(), |
|
2594 |
box, |
|
2595 |
List.<Type>nil() |
|
2596 |
.prepend(tree.type)); |
|
2597 |
return make.Create(ctor, List.of(tree)); |
|
2598 |
} else { |
|
2599 |
Symbol valueOfSym = lookupMethod(tree.pos(), |
|
2600 |
names.valueOf, |
|
2601 |
box, |
|
2602 |
List.<Type>nil() |
|
2603 |
.prepend(tree.type)); |
|
2604 |
return make.App(make.QualIdent(valueOfSym), List.of(tree)); |
|
2605 |
} |
|
2606 |
} |
|
2607 |
||
2608 |
/** Unbox an object to a primitive value. */ |
|
2609 |
JCExpression unbox(JCExpression tree, Type primitive) { |
|
2610 |
Type unboxedType = types.unboxedType(tree.type); |
|
2611 |
// note: the "primitive" parameter is not used. There muse be |
|
2612 |
// a conversion from unboxedType to primitive. |
|
2613 |
make_at(tree.pos()); |
|
2614 |
Symbol valueSym = lookupMethod(tree.pos(), |
|
2615 |
unboxedType.tsym.name.append(names.Value), // x.intValue() |
|
2616 |
tree.type, |
|
2617 |
List.<Type>nil()); |
|
2618 |
return make.App(make.Select(tree, valueSym)); |
|
2619 |
} |
|
2620 |
||
2621 |
/** Visitor method for parenthesized expressions. |
|
2622 |
* If the subexpression has changed, omit the parens. |
|
2623 |
*/ |
|
2624 |
public void visitParens(JCParens tree) { |
|
2625 |
JCTree expr = translate(tree.expr); |
|
2626 |
result = ((expr == tree.expr) ? tree : expr); |
|
2627 |
} |
|
2628 |
||
2629 |
public void visitIndexed(JCArrayAccess tree) { |
|
2630 |
tree.indexed = translate(tree.indexed); |
|
2631 |
tree.index = translate(tree.index, syms.intType); |
|
2632 |
result = tree; |
|
2633 |
} |
|
2634 |
||
2635 |
public void visitAssign(JCAssign tree) { |
|
2636 |
tree.lhs = translate(tree.lhs, tree); |
|
2637 |
tree.rhs = translate(tree.rhs, tree.lhs.type); |
|
2638 |
||
2639 |
// If translated left hand side is an Apply, we are |
|
2640 |
// seeing an access method invocation. In this case, append |
|
2641 |
// right hand side as last argument of the access method. |
|
2642 |
if (tree.lhs.getTag() == JCTree.APPLY) { |
|
2643 |
JCMethodInvocation app = (JCMethodInvocation)tree.lhs; |
|
2644 |
app.args = List.of(tree.rhs).prependList(app.args); |
|
2645 |
result = app; |
|
2646 |
} else { |
|
2647 |
result = tree; |
|
2648 |
} |
|
2649 |
} |
|
2650 |
||
2651 |
public void visitAssignop(final JCAssignOp tree) { |
|
2652 |
if (!tree.lhs.type.isPrimitive() && |
|
2653 |
tree.operator.type.getReturnType().isPrimitive()) { |
|
2654 |
// boxing required; need to rewrite as x = (unbox typeof x)(x op y); |
|
2655 |
// or if x == (typeof x)z then z = (unbox typeof x)((typeof x)z op y) |
|
2656 |
// (but without recomputing x) |
|
2657 |
JCTree arg = (tree.lhs.getTag() == JCTree.TYPECAST) |
|
2658 |
? ((JCTypeCast)tree.lhs).expr |
|
2659 |
: tree.lhs; |
|
2660 |
JCTree newTree = abstractLval(arg, new TreeBuilder() { |
|
2661 |
public JCTree build(final JCTree lhs) { |
|
2662 |
int newTag = tree.getTag() - JCTree.ASGOffset; |
|
2663 |
// Erasure (TransTypes) can change the type of |
|
2664 |
// tree.lhs. However, we can still get the |
|
2665 |
// unerased type of tree.lhs as it is stored |
|
2666 |
// in tree.type in Attr. |
|
2667 |
Symbol newOperator = rs.resolveBinaryOperator(tree.pos(), |
|
2668 |
newTag, |
|
2669 |
attrEnv, |
|
2670 |
tree.type, |
|
2671 |
tree.rhs.type); |
|
2672 |
JCExpression expr = (JCExpression)lhs; |
|
2673 |
if (expr.type != tree.type) |
|
2674 |
expr = make.TypeCast(tree.type, expr); |
|
2675 |
JCBinary opResult = make.Binary(newTag, expr, tree.rhs); |
|
2676 |
opResult.operator = newOperator; |
|
2677 |
opResult.type = newOperator.type.getReturnType(); |
|
2678 |
JCTypeCast newRhs = make.TypeCast(types.unboxedType(tree.type), |
|
2679 |
opResult); |
|
2680 |
return make.Assign((JCExpression)lhs, newRhs).setType(tree.type); |
|
2681 |
} |
|
2682 |
}); |
|
2683 |
result = translate(newTree); |
|
2684 |
return; |
|
2685 |
} |
|
2686 |
tree.lhs = translate(tree.lhs, tree); |
|
2687 |
tree.rhs = translate(tree.rhs, tree.operator.type.getParameterTypes().tail.head); |
|
2688 |
||
2689 |
// If translated left hand side is an Apply, we are |
|
2690 |
// seeing an access method invocation. In this case, append |
|
2691 |
// right hand side as last argument of the access method. |
|
2692 |
if (tree.lhs.getTag() == JCTree.APPLY) { |
|
2693 |
JCMethodInvocation app = (JCMethodInvocation)tree.lhs; |
|
2694 |
// if operation is a += on strings, |
|
2695 |
// make sure to convert argument to string |
|
2696 |
JCExpression rhs = (((OperatorSymbol)tree.operator).opcode == string_add) |
|
2697 |
? makeString(tree.rhs) |
|
2698 |
: tree.rhs; |
|
2699 |
app.args = List.of(rhs).prependList(app.args); |
|
2700 |
result = app; |
|
2701 |
} else { |
|
2702 |
result = tree; |
|
2703 |
} |
|
2704 |
} |
|
2705 |
||
2706 |
/** Lower a tree of the form e++ or e-- where e is an object type */ |
|
2707 |
JCTree lowerBoxedPostop(final JCUnary tree) { |
|
2708 |
// translate to tmp1=lval(e); tmp2=tmp1; tmp1 OP 1; tmp2 |
|
2709 |
// or |
|
2710 |
// translate to tmp1=lval(e); tmp2=tmp1; (typeof tree)tmp1 OP 1; tmp2 |
|
2711 |
// where OP is += or -= |
|
2712 |
final boolean cast = tree.arg.getTag() == JCTree.TYPECAST; |
|
2713 |
final JCExpression arg = cast ? ((JCTypeCast)tree.arg).expr : tree.arg; |
|
2714 |
return abstractLval(arg, new TreeBuilder() { |
|
2715 |
public JCTree build(final JCTree tmp1) { |
|
2716 |
return abstractRval(tmp1, tree.arg.type, new TreeBuilder() { |
|
2717 |
public JCTree build(final JCTree tmp2) { |
|
2718 |
int opcode = (tree.getTag() == JCTree.POSTINC) |
|
2719 |
? JCTree.PLUS_ASG : JCTree.MINUS_ASG; |
|
2720 |
JCTree lhs = cast |
|
2721 |
? make.TypeCast(tree.arg.type, (JCExpression)tmp1) |
|
2722 |
: tmp1; |
|
2723 |
JCTree update = makeAssignop(opcode, |
|
2724 |
lhs, |
|
2725 |
make.Literal(1)); |
|
2726 |
return makeComma(update, tmp2); |
|
2727 |
} |
|
2728 |
}); |
|
2729 |
} |
|
2730 |
}); |
|
2731 |
} |
|
2732 |
||
2733 |
public void visitUnary(JCUnary tree) { |
|
2734 |
boolean isUpdateOperator = |
|
2735 |
JCTree.PREINC <= tree.getTag() && tree.getTag() <= JCTree.POSTDEC; |
|
2736 |
if (isUpdateOperator && !tree.arg.type.isPrimitive()) { |
|
2737 |
switch(tree.getTag()) { |
|
2738 |
case JCTree.PREINC: // ++ e |
|
2739 |
// translate to e += 1 |
|
2740 |
case JCTree.PREDEC: // -- e |
|
2741 |
// translate to e -= 1 |
|
2742 |
{ |
|
2743 |
int opcode = (tree.getTag() == JCTree.PREINC) |
|
2744 |
? JCTree.PLUS_ASG : JCTree.MINUS_ASG; |
|
2745 |
JCAssignOp newTree = makeAssignop(opcode, |
|
2746 |
tree.arg, |
|
2747 |
make.Literal(1)); |
|
2748 |
result = translate(newTree, tree.type); |
|
2749 |
return; |
|
2750 |
} |
|
2751 |
case JCTree.POSTINC: // e ++ |
|
2752 |
case JCTree.POSTDEC: // e -- |
|
2753 |
{ |
|
2754 |
result = translate(lowerBoxedPostop(tree), tree.type); |
|
2755 |
return; |
|
2756 |
} |
|
2757 |
} |
|
2758 |
throw new AssertionError(tree); |
|
2759 |
} |
|
2760 |
||
2761 |
tree.arg = boxIfNeeded(translate(tree.arg, tree), tree.type); |
|
2762 |
||
2763 |
if (tree.getTag() == JCTree.NOT && tree.arg.type.constValue() != null) { |
|
2764 |
tree.type = cfolder.fold1(bool_not, tree.arg.type); |
|
2765 |
} |
|
2766 |
||
2767 |
// If translated left hand side is an Apply, we are |
|
2768 |
// seeing an access method invocation. In this case, return |
|
2769 |
// that access method invokation as result. |
|
2770 |
if (isUpdateOperator && tree.arg.getTag() == JCTree.APPLY) { |
|
2771 |
result = tree.arg; |
|
2772 |
} else { |
|
2773 |
result = tree; |
|
2774 |
} |
|
2775 |
} |
|
2776 |
||
2777 |
public void visitBinary(JCBinary tree) { |
|
2778 |
List<Type> formals = tree.operator.type.getParameterTypes(); |
|
2779 |
JCTree lhs = tree.lhs = translate(tree.lhs, formals.head); |
|
2780 |
switch (tree.getTag()) { |
|
2781 |
case JCTree.OR: |
|
2782 |
if (lhs.type.isTrue()) { |
|
2783 |
result = lhs; |
|
2784 |
return; |
|
2785 |
} |
|
2786 |
if (lhs.type.isFalse()) { |
|
2787 |
result = translate(tree.rhs, formals.tail.head); |
|
2788 |
return; |
|
2789 |
} |
|
2790 |
break; |
|
2791 |
case JCTree.AND: |
|
2792 |
if (lhs.type.isFalse()) { |
|
2793 |
result = lhs; |
|
2794 |
return; |
|
2795 |
} |
|
2796 |
if (lhs.type.isTrue()) { |
|
2797 |
result = translate(tree.rhs, formals.tail.head); |
|
2798 |
return; |
|
2799 |
} |
|
2800 |
break; |
|
2801 |
} |
|
2802 |
tree.rhs = translate(tree.rhs, formals.tail.head); |
|
2803 |
result = tree; |
|
2804 |
} |
|
2805 |
||
2806 |
public void visitIdent(JCIdent tree) { |
|
2807 |
result = access(tree.sym, tree, enclOp, false); |
|
2808 |
} |
|
2809 |
||
2810 |
/** Translate away the foreach loop. */ |
|
2811 |
public void visitForeachLoop(JCEnhancedForLoop tree) { |
|
2812 |
if (types.elemtype(tree.expr.type) == null) |
|
2813 |
visitIterableForeachLoop(tree); |
|
2814 |
else |
|
2815 |
visitArrayForeachLoop(tree); |
|
2816 |
} |
|
2817 |
// where |
|
2818 |
/** |
|
2819 |
* A statment of the form |
|
2820 |
* |
|
2821 |
* <pre> |
|
2822 |
* for ( T v : arrayexpr ) stmt; |
|
2823 |
* </pre> |
|
2824 |
* |
|
2825 |
* (where arrayexpr is of an array type) gets translated to |
|
2826 |
* |
|
2827 |
* <pre> |
|
2828 |
* for ( { arraytype #arr = arrayexpr; |
|
2829 |
* int #len = array.length; |
|
2830 |
* int #i = 0; }; |
|
2831 |
* #i < #len; i$++ ) { |
|
2832 |
* T v = arr$[#i]; |
|
2833 |
* stmt; |
|
2834 |
* } |
|
2835 |
* </pre> |
|
2836 |
* |
|
2837 |
* where #arr, #len, and #i are freshly named synthetic local variables. |
|
2838 |
*/ |
|
2839 |
private void visitArrayForeachLoop(JCEnhancedForLoop tree) { |
|
2840 |
make_at(tree.expr.pos()); |
|
2841 |
VarSymbol arraycache = new VarSymbol(0, |
|
2842 |
names.fromString("arr" + target.syntheticNameChar()), |
|
2843 |
tree.expr.type, |
|
2844 |
currentMethodSym); |
|
2845 |
JCStatement arraycachedef = make.VarDef(arraycache, tree.expr); |
|
2846 |
VarSymbol lencache = new VarSymbol(0, |
|
2847 |
names.fromString("len" + target.syntheticNameChar()), |
|
2848 |
syms.intType, |
|
2849 |
currentMethodSym); |
|
2850 |
JCStatement lencachedef = make. |
|
2851 |
VarDef(lencache, make.Select(make.Ident(arraycache), syms.lengthVar)); |
|
2852 |
VarSymbol index = new VarSymbol(0, |
|
2853 |
names.fromString("i" + target.syntheticNameChar()), |
|
2854 |
syms.intType, |
|
2855 |
currentMethodSym); |
|
2856 |
||
2857 |
JCVariableDecl indexdef = make.VarDef(index, make.Literal(INT, 0)); |
|
2858 |
indexdef.init.type = indexdef.type = syms.intType.constType(0); |
|
2859 |
||
2860 |
List<JCStatement> loopinit = List.of(arraycachedef, lencachedef, indexdef); |
|
2861 |
JCBinary cond = makeBinary(JCTree.LT, make.Ident(index), make.Ident(lencache)); |
|
2862 |
||
2863 |
JCExpressionStatement step = make.Exec(makeUnary(JCTree.PREINC, make.Ident(index))); |
|
2864 |
||
2865 |
Type elemtype = types.elemtype(tree.expr.type); |
|
2866 |
JCStatement loopvarinit = make. |
|
2867 |
VarDef(tree.var.sym, |
|
2868 |
make. |
|
2869 |
Indexed(make.Ident(arraycache), make.Ident(index)). |
|
2870 |
setType(elemtype)); |
|
2871 |
JCBlock body = make. |
|
2872 |
Block(0, List.of(loopvarinit, tree.body)); |
|
2873 |
||
2874 |
result = translate(make. |
|
2875 |
ForLoop(loopinit, |
|
2876 |
cond, |
|
2877 |
List.of(step), |
|
2878 |
body)); |
|
2879 |
patchTargets(body, tree, result); |
|
2880 |
} |
|
2881 |
/** Patch up break and continue targets. */ |
|
2882 |
private void patchTargets(JCTree body, final JCTree src, final JCTree dest) { |
|
2883 |
class Patcher extends TreeScanner { |
|
2884 |
public void visitBreak(JCBreak tree) { |
|
2885 |
if (tree.target == src) |
|
2886 |
tree.target = dest; |
|
2887 |
} |
|
2888 |
public void visitContinue(JCContinue tree) { |
|
2889 |
if (tree.target == src) |
|
2890 |
tree.target = dest; |
|
2891 |
} |
|
2892 |
public void visitClassDef(JCClassDecl tree) {} |
|
2893 |
} |
|
2894 |
new Patcher().scan(body); |
|
2895 |
} |
|
2896 |
/** |
|
2897 |
* A statement of the form |
|
2898 |
* |
|
2899 |
* <pre> |
|
2900 |
* for ( T v : coll ) stmt ; |
|
2901 |
* </pre> |
|
2902 |
* |
|
2903 |
* (where coll implements Iterable<? extends T>) gets translated to |
|
2904 |
* |
|
2905 |
* <pre> |
|
2906 |
* for ( Iterator<? extends T> #i = coll.iterator(); #i.hasNext(); ) { |
|
2907 |
* T v = (T) #i.next(); |
|
2908 |
* stmt; |
|
2909 |
* } |
|
2910 |
* </pre> |
|
2911 |
* |
|
2912 |
* where #i is a freshly named synthetic local variable. |
|
2913 |
*/ |
|
2914 |
private void visitIterableForeachLoop(JCEnhancedForLoop tree) { |
|
2915 |
make_at(tree.expr.pos()); |
|
2916 |
Type iteratorTarget = syms.objectType; |
|
2917 |
Type iterableType = types.asSuper(types.upperBound(tree.expr.type), |
|
2918 |
syms.iterableType.tsym); |
|
2919 |
if (iterableType.getTypeArguments().nonEmpty()) |
|
2920 |
iteratorTarget = types.erasure(iterableType.getTypeArguments().head); |
|
2921 |
Type eType = tree.expr.type; |
|
2922 |
tree.expr.type = types.erasure(eType); |
|
2923 |
if (eType.tag == TYPEVAR && eType.getUpperBound().isCompound()) |
|
2924 |
tree.expr = make.TypeCast(types.erasure(iterableType), tree.expr); |
|
2925 |
Symbol iterator = lookupMethod(tree.expr.pos(), |
|
2926 |
names.iterator, |
|
2927 |
types.erasure(syms.iterableType), |
|
2928 |
List.<Type>nil()); |
|
2929 |
VarSymbol itvar = new VarSymbol(0, names.fromString("i" + target.syntheticNameChar()), |
|
2930 |
types.erasure(iterator.type.getReturnType()), |
|
2931 |
currentMethodSym); |
|
2932 |
JCStatement init = make. |
|
2933 |
VarDef(itvar, |
|
2934 |
make.App(make.Select(tree.expr, iterator))); |
|
2935 |
Symbol hasNext = lookupMethod(tree.expr.pos(), |
|
2936 |
names.hasNext, |
|
2937 |
itvar.type, |
|
2938 |
List.<Type>nil()); |
|
2939 |
JCMethodInvocation cond = make.App(make.Select(make.Ident(itvar), hasNext)); |
|
2940 |
Symbol next = lookupMethod(tree.expr.pos(), |
|
2941 |
names.next, |
|
2942 |
itvar.type, |
|
2943 |
List.<Type>nil()); |
|
2944 |
JCExpression vardefinit = make.App(make.Select(make.Ident(itvar), next)); |
|
2945 |
if (iteratorTarget != syms.objectType) |
|
2946 |
vardefinit = make.TypeCast(iteratorTarget, vardefinit); |
|
2947 |
JCVariableDecl indexDef = make.VarDef(tree.var.sym, vardefinit); |
|
2948 |
JCBlock body = make.Block(0, List.of(indexDef, tree.body)); |
|
2949 |
result = translate(make. |
|
2950 |
ForLoop(List.of(init), |
|
2951 |
cond, |
|
2952 |
List.<JCExpressionStatement>nil(), |
|
2953 |
body)); |
|
2954 |
patchTargets(body, tree, result); |
|
2955 |
} |
|
2956 |
||
2957 |
public void visitVarDef(JCVariableDecl tree) { |
|
2958 |
MethodSymbol oldMethodSym = currentMethodSym; |
|
2959 |
tree.mods = translate(tree.mods); |
|
2960 |
tree.vartype = translate(tree.vartype); |
|
2961 |
if (currentMethodSym == null) { |
|
2962 |
// A class or instance field initializer. |
|
2963 |
currentMethodSym = |
|
2964 |
new MethodSymbol((tree.mods.flags&STATIC) | BLOCK, |
|
2965 |
names.empty, null, |
|
2966 |
currentClass); |
|
2967 |
} |
|
2968 |
if (tree.init != null) tree.init = translate(tree.init, tree.type); |
|
2969 |
result = tree; |
|
2970 |
currentMethodSym = oldMethodSym; |
|
2971 |
} |
|
2972 |
||
2973 |
public void visitBlock(JCBlock tree) { |
|
2974 |
MethodSymbol oldMethodSym = currentMethodSym; |
|
2975 |
if (currentMethodSym == null) { |
|
2976 |
// Block is a static or instance initializer. |
|
2977 |
currentMethodSym = |
|
2978 |
new MethodSymbol(tree.flags | BLOCK, |
|
2979 |
names.empty, null, |
|
2980 |
currentClass); |
|
2981 |
} |
|
2982 |
super.visitBlock(tree); |
|
2983 |
currentMethodSym = oldMethodSym; |
|
2984 |
} |
|
2985 |
||
2986 |
public void visitDoLoop(JCDoWhileLoop tree) { |
|
2987 |
tree.body = translate(tree.body); |
|
2988 |
tree.cond = translate(tree.cond, syms.booleanType); |
|
2989 |
result = tree; |
|
2990 |
} |
|
2991 |
||
2992 |
public void visitWhileLoop(JCWhileLoop tree) { |
|
2993 |
tree.cond = translate(tree.cond, syms.booleanType); |
|
2994 |
tree.body = translate(tree.body); |
|
2995 |
result = tree; |
|
2996 |
} |
|
2997 |
||
2998 |
public void visitForLoop(JCForLoop tree) { |
|
2999 |
tree.init = translate(tree.init); |
|
3000 |
if (tree.cond != null) |
|
3001 |
tree.cond = translate(tree.cond, syms.booleanType); |
|
3002 |
tree.step = translate(tree.step); |
|
3003 |
tree.body = translate(tree.body); |
|
3004 |
result = tree; |
|
3005 |
} |
|
3006 |
||
3007 |
public void visitReturn(JCReturn tree) { |
|
3008 |
if (tree.expr != null) |
|
3009 |
tree.expr = translate(tree.expr, |
|
3010 |
types.erasure(currentMethodDef |
|
3011 |
.restype.type)); |
|
3012 |
result = tree; |
|
3013 |
} |
|
3014 |
||
3015 |
public void visitSwitch(JCSwitch tree) { |
|
3016 |
Type selsuper = types.supertype(tree.selector.type); |
|
3017 |
boolean enumSwitch = selsuper != null && |
|
3018 |
(tree.selector.type.tsym.flags() & ENUM) != 0; |
|
3019 |
Type target = enumSwitch ? tree.selector.type : syms.intType; |
|
3020 |
tree.selector = translate(tree.selector, target); |
|
3021 |
tree.cases = translateCases(tree.cases); |
|
3022 |
if (enumSwitch) { |
|
3023 |
result = visitEnumSwitch(tree); |
|
3024 |
patchTargets(result, tree, result); |
|
3025 |
} else { |
|
3026 |
result = tree; |
|
3027 |
} |
|
3028 |
} |
|
3029 |
||
3030 |
public JCTree visitEnumSwitch(JCSwitch tree) { |
|
3031 |
TypeSymbol enumSym = tree.selector.type.tsym; |
|
3032 |
EnumMapping map = mapForEnum(tree.pos(), enumSym); |
|
3033 |
make_at(tree.pos()); |
|
3034 |
Symbol ordinalMethod = lookupMethod(tree.pos(), |
|
3035 |
names.ordinal, |
|
3036 |
tree.selector.type, |
|
3037 |
List.<Type>nil()); |
|
3038 |
JCArrayAccess selector = make.Indexed(map.mapVar, |
|
3039 |
make.App(make.Select(tree.selector, |
|
3040 |
ordinalMethod))); |
|
3041 |
ListBuffer<JCCase> cases = new ListBuffer<JCCase>(); |
|
3042 |
for (JCCase c : tree.cases) { |
|
3043 |
if (c.pat != null) { |
|
3044 |
VarSymbol label = (VarSymbol)TreeInfo.symbol(c.pat); |
|
3045 |
JCLiteral pat = map.forConstant(label); |
|
3046 |
cases.append(make.Case(pat, c.stats)); |
|
3047 |
} else { |
|
3048 |
cases.append(c); |
|
3049 |
} |
|
3050 |
} |
|
3051 |
return make.Switch(selector, cases.toList()); |
|
3052 |
} |
|
3053 |
||
3054 |
public void visitNewArray(JCNewArray tree) { |
|
3055 |
tree.elemtype = translate(tree.elemtype); |
|
3056 |
for (List<JCExpression> t = tree.dims; t.tail != null; t = t.tail) |
|
3057 |
if (t.head != null) t.head = translate(t.head, syms.intType); |
|
3058 |
tree.elems = translate(tree.elems, types.elemtype(tree.type)); |
|
3059 |
result = tree; |
|
3060 |
} |
|
3061 |
||
3062 |
public void visitSelect(JCFieldAccess tree) { |
|
3063 |
// need to special case-access of the form C.super.x |
|
3064 |
// these will always need an access method. |
|
3065 |
boolean qualifiedSuperAccess = |
|
3066 |
tree.selected.getTag() == JCTree.SELECT && |
|
3067 |
TreeInfo.name(tree.selected) == names._super; |
|
3068 |
tree.selected = translate(tree.selected); |
|
3069 |
if (tree.name == names._class) |
|
3070 |
result = classOf(tree.selected); |
|
3071 |
else if (tree.name == names._this || tree.name == names._super) |
|
3072 |
result = makeThis(tree.pos(), tree.selected.type.tsym); |
|
3073 |
else |
|
3074 |
result = access(tree.sym, tree, enclOp, qualifiedSuperAccess); |
|
3075 |
} |
|
3076 |
||
3077 |
public void visitLetExpr(LetExpr tree) { |
|
3078 |
tree.defs = translateVarDefs(tree.defs); |
|
3079 |
tree.expr = translate(tree.expr, tree.type); |
|
3080 |
result = tree; |
|
3081 |
} |
|
3082 |
||
3083 |
// There ought to be nothing to rewrite here; |
|
3084 |
// we don't generate code. |
|
3085 |
public void visitAnnotation(JCAnnotation tree) { |
|
3086 |
result = tree; |
|
3087 |
} |
|
3088 |
||
3089 |
/************************************************************************** |
|
3090 |
* main method |
|
3091 |
*************************************************************************/ |
|
3092 |
||
3093 |
/** Translate a toplevel class and return a list consisting of |
|
3094 |
* the translated class and translated versions of all inner classes. |
|
3095 |
* @param env The attribution environment current at the class definition. |
|
3096 |
* We need this for resolving some additional symbols. |
|
3097 |
* @param cdef The tree representing the class definition. |
|
3098 |
*/ |
|
3099 |
public List<JCTree> translateTopLevelClass(Env<AttrContext> env, JCTree cdef, TreeMaker make) { |
|
3100 |
ListBuffer<JCTree> translated = null; |
|
3101 |
try { |
|
3102 |
attrEnv = env; |
|
3103 |
this.make = make; |
|
3104 |
endPositions = env.toplevel.endPositions; |
|
3105 |
currentClass = null; |
|
3106 |
currentMethodDef = null; |
|
3107 |
outermostClassDef = (cdef.getTag() == JCTree.CLASSDEF) ? (JCClassDecl)cdef : null; |
|
3108 |
outermostMemberDef = null; |
|
3109 |
this.translated = new ListBuffer<JCTree>(); |
|
3110 |
classdefs = new HashMap<ClassSymbol,JCClassDecl>(); |
|
3111 |
actualSymbols = new HashMap<Symbol,Symbol>(); |
|
3112 |
freevarCache = new HashMap<ClassSymbol,List<VarSymbol>>(); |
|
3113 |
proxies = new Scope(syms.noSymbol); |
|
3114 |
outerThisStack = List.nil(); |
|
3115 |
accessNums = new HashMap<Symbol,Integer>(); |
|
3116 |
accessSyms = new HashMap<Symbol,MethodSymbol[]>(); |
|
3117 |
accessConstrs = new HashMap<Symbol,MethodSymbol>(); |
|
3118 |
accessed = new ListBuffer<Symbol>(); |
|
3119 |
translate(cdef, (JCExpression)null); |
|
3120 |
for (List<Symbol> l = accessed.toList(); l.nonEmpty(); l = l.tail) |
|
3121 |
makeAccessible(l.head); |
|
3122 |
for (EnumMapping map : enumSwitchMap.values()) |
|
3123 |
map.translate(); |
|
3124 |
translated = this.translated; |
|
3125 |
} finally { |
|
3126 |
// note that recursive invocations of this method fail hard |
|
3127 |
attrEnv = null; |
|
3128 |
this.make = null; |
|
3129 |
endPositions = null; |
|
3130 |
currentClass = null; |
|
3131 |
currentMethodDef = null; |
|
3132 |
outermostClassDef = null; |
|
3133 |
outermostMemberDef = null; |
|
3134 |
this.translated = null; |
|
3135 |
classdefs = null; |
|
3136 |
actualSymbols = null; |
|
3137 |
freevarCache = null; |
|
3138 |
proxies = null; |
|
3139 |
outerThisStack = null; |
|
3140 |
accessNums = null; |
|
3141 |
accessSyms = null; |
|
3142 |
accessConstrs = null; |
|
3143 |
accessed = null; |
|
3144 |
enumSwitchMap.clear(); |
|
3145 |
} |
|
3146 |
return translated.toList(); |
|
3147 |
} |
|
3148 |
||
3149 |
////////////////////////////////////////////////////////////// |
|
3150 |
// The following contributed by Borland for bootstrapping purposes |
|
3151 |
////////////////////////////////////////////////////////////// |
|
3152 |
private void addEnumCompatibleMembers(JCClassDecl cdef) { |
|
3153 |
make_at(null); |
|
3154 |
||
3155 |
// Add the special enum fields |
|
3156 |
VarSymbol ordinalFieldSym = addEnumOrdinalField(cdef); |
|
3157 |
VarSymbol nameFieldSym = addEnumNameField(cdef); |
|
3158 |
||
3159 |
// Add the accessor methods for name and ordinal |
|
3160 |
MethodSymbol ordinalMethodSym = addEnumFieldOrdinalMethod(cdef, ordinalFieldSym); |
|
3161 |
MethodSymbol nameMethodSym = addEnumFieldNameMethod(cdef, nameFieldSym); |
|
3162 |
||
3163 |
// Add the toString method |
|
3164 |
addEnumToString(cdef, nameFieldSym); |
|
3165 |
||
3166 |
// Add the compareTo method |
|
3167 |
addEnumCompareTo(cdef, ordinalFieldSym); |
|
3168 |
} |
|
3169 |
||
3170 |
private VarSymbol addEnumOrdinalField(JCClassDecl cdef) { |
|
3171 |
VarSymbol ordinal = new VarSymbol(PRIVATE|FINAL|SYNTHETIC, |
|
3172 |
names.fromString("$ordinal"), |
|
3173 |
syms.intType, |
|
3174 |
cdef.sym); |
|
3175 |
cdef.sym.members().enter(ordinal); |
|
3176 |
cdef.defs = cdef.defs.prepend(make.VarDef(ordinal, null)); |
|
3177 |
return ordinal; |
|
3178 |
} |
|
3179 |
||
3180 |
private VarSymbol addEnumNameField(JCClassDecl cdef) { |
|
3181 |
VarSymbol name = new VarSymbol(PRIVATE|FINAL|SYNTHETIC, |
|
3182 |
names.fromString("$name"), |
|
3183 |
syms.stringType, |
|
3184 |
cdef.sym); |
|
3185 |
cdef.sym.members().enter(name); |
|
3186 |
cdef.defs = cdef.defs.prepend(make.VarDef(name, null)); |
|
3187 |
return name; |
|
3188 |
} |
|
3189 |
||
3190 |
private MethodSymbol addEnumFieldOrdinalMethod(JCClassDecl cdef, VarSymbol ordinalSymbol) { |
|
3191 |
// Add the accessor methods for ordinal |
|
3192 |
Symbol ordinalSym = lookupMethod(cdef.pos(), |
|
3193 |
names.ordinal, |
|
3194 |
cdef.type, |
|
3195 |
List.<Type>nil()); |
|
3196 |
||
3197 |
assert(ordinalSym != null); |
|
3198 |
assert(ordinalSym instanceof MethodSymbol); |
|
3199 |
||
3200 |
JCStatement ret = make.Return(make.Ident(ordinalSymbol)); |
|
3201 |
cdef.defs = cdef.defs.append(make.MethodDef((MethodSymbol)ordinalSym, |
|
3202 |
make.Block(0L, List.of(ret)))); |
|
3203 |
||
3204 |
return (MethodSymbol)ordinalSym; |
|
3205 |
} |
|
3206 |
||
3207 |
private MethodSymbol addEnumFieldNameMethod(JCClassDecl cdef, VarSymbol nameSymbol) { |
|
3208 |
// Add the accessor methods for name |
|
3209 |
Symbol nameSym = lookupMethod(cdef.pos(), |
|
3210 |
names._name, |
|
3211 |
cdef.type, |
|
3212 |
List.<Type>nil()); |
|
3213 |
||
3214 |
assert(nameSym != null); |
|
3215 |
assert(nameSym instanceof MethodSymbol); |
|
3216 |
||
3217 |
JCStatement ret = make.Return(make.Ident(nameSymbol)); |
|
3218 |
||
3219 |
cdef.defs = cdef.defs.append(make.MethodDef((MethodSymbol)nameSym, |
|
3220 |
make.Block(0L, List.of(ret)))); |
|
3221 |
||
3222 |
return (MethodSymbol)nameSym; |
|
3223 |
} |
|
3224 |
||
3225 |
private MethodSymbol addEnumToString(JCClassDecl cdef, |
|
3226 |
VarSymbol nameSymbol) { |
|
3227 |
Symbol toStringSym = lookupMethod(cdef.pos(), |
|
3228 |
names.toString, |
|
3229 |
cdef.type, |
|
3230 |
List.<Type>nil()); |
|
3231 |
||
3232 |
JCTree toStringDecl = null; |
|
3233 |
if (toStringSym != null) |
|
3234 |
toStringDecl = TreeInfo.declarationFor(toStringSym, cdef); |
|
3235 |
||
3236 |
if (toStringDecl != null) |
|
3237 |
return (MethodSymbol)toStringSym; |
|
3238 |
||
3239 |
JCStatement ret = make.Return(make.Ident(nameSymbol)); |
|
3240 |
||
3241 |
JCTree resTypeTree = make.Type(syms.stringType); |
|
3242 |
||
3243 |
MethodType toStringType = new MethodType(List.<Type>nil(), |
|
3244 |
syms.stringType, |
|
3245 |
List.<Type>nil(), |
|
3246 |
cdef.sym); |
|
3247 |
toStringSym = new MethodSymbol(PUBLIC, |
|
3248 |
names.toString, |
|
3249 |
toStringType, |
|
3250 |
cdef.type.tsym); |
|
3251 |
toStringDecl = make.MethodDef((MethodSymbol)toStringSym, |
|
3252 |
make.Block(0L, List.of(ret))); |
|
3253 |
||
3254 |
cdef.defs = cdef.defs.prepend(toStringDecl); |
|
3255 |
cdef.sym.members().enter(toStringSym); |
|
3256 |
||
3257 |
return (MethodSymbol)toStringSym; |
|
3258 |
} |
|
3259 |
||
3260 |
private MethodSymbol addEnumCompareTo(JCClassDecl cdef, VarSymbol ordinalSymbol) { |
|
3261 |
Symbol compareToSym = lookupMethod(cdef.pos(), |
|
3262 |
names.compareTo, |
|
3263 |
cdef.type, |
|
3264 |
List.of(cdef.sym.type)); |
|
3265 |
||
3266 |
assert(compareToSym != null); |
|
3267 |
assert(compareToSym instanceof MethodSymbol); |
|
3268 |
||
3269 |
JCMethodDecl compareToDecl = (JCMethodDecl) TreeInfo.declarationFor(compareToSym, cdef); |
|
3270 |
||
3271 |
ListBuffer<JCStatement> blockStatements = new ListBuffer<JCStatement>(); |
|
3272 |
||
3273 |
JCModifiers mod1 = make.Modifiers(0L); |
|
3274 |
Name oName = Name.fromString(names, "o"); |
|
3275 |
JCVariableDecl par1 = make.Param(oName, cdef.type, compareToSym); |
|
3276 |
||
3277 |
JCIdent paramId1 = make.Ident(names.java_lang_Object); |
|
3278 |
paramId1.type = cdef.type; |
|
3279 |
paramId1.sym = par1.sym; |
|
3280 |
||
3281 |
((MethodSymbol)compareToSym).params = List.of(par1.sym); |
|
3282 |
||
3283 |
JCIdent par1UsageId = make.Ident(par1.sym); |
|
3284 |
JCIdent castTargetIdent = make.Ident(cdef.sym); |
|
3285 |
JCTypeCast cast = make.TypeCast(castTargetIdent, par1UsageId); |
|
3286 |
cast.setType(castTargetIdent.type); |
|
3287 |
||
3288 |
Name otherName = Name.fromString(names, "other"); |
|
3289 |
||
3290 |
VarSymbol otherVarSym = new VarSymbol(mod1.flags, |
|
3291 |
otherName, |
|
3292 |
cdef.type, |
|
3293 |
compareToSym); |
|
3294 |
JCVariableDecl otherVar = make.VarDef(otherVarSym, cast); |
|
3295 |
blockStatements.append(otherVar); |
|
3296 |
||
3297 |
JCIdent id1 = make.Ident(ordinalSymbol); |
|
3298 |
||
3299 |
JCIdent fLocUsageId = make.Ident(otherVarSym); |
|
3300 |
JCExpression sel = make.Select(fLocUsageId, ordinalSymbol); |
|
3301 |
JCBinary bin = makeBinary(JCTree.MINUS, id1, sel); |
|
3302 |
JCReturn ret = make.Return(bin); |
|
3303 |
blockStatements.append(ret); |
|
3304 |
JCMethodDecl compareToMethod = make.MethodDef((MethodSymbol)compareToSym, |
|
3305 |
make.Block(0L, |
|
3306 |
blockStatements.toList())); |
|
3307 |
compareToMethod.params = List.of(par1); |
|
3308 |
cdef.defs = cdef.defs.append(compareToMethod); |
|
3309 |
||
3310 |
return (MethodSymbol)compareToSym; |
|
3311 |
} |
|
3312 |
////////////////////////////////////////////////////////////// |
|
3313 |
// The above contributed by Borland for bootstrapping purposes |
|
3314 |
////////////////////////////////////////////////////////////// |
|
3315 |
} |