1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
|
package scala.reflect
package internal
import scala.collection.mutable.WeakHashMap
trait Importers { self: SymbolTable =>
// [Eugene] possible to make this less cast-heavy?
def mkImporter(from0: api.Universe): Importer { val from: from0.type } = (
if (self eq from0) {
new Importer {
val from = from0
val reverse = this.asInstanceOf[from.Importer{ val from: self.type }]
def importSymbol(sym: from.Symbol) = sym.asInstanceOf[self.Symbol]
def importType(tpe: from.Type) = tpe.asInstanceOf[self.Type]
def importTree(tree: from.Tree) = tree.asInstanceOf[self.Tree]
}
} else {
// todo. fix this loophole
assert(from0.isInstanceOf[SymbolTable], "`from` should be an instance of scala.reflect.internal.SymbolTable")
new StandardImporter { val from = from0.asInstanceOf[SymbolTable] }
}
).asInstanceOf[Importer { val from: from0.type }]
abstract class StandardImporter extends Importer {
val from: SymbolTable
lazy val symMap: WeakHashMap[from.Symbol, Symbol] = new WeakHashMap
lazy val tpeMap: WeakHashMap[from.Type, Type] = new WeakHashMap
// fixups and maps prevent stackoverflows in importer
var pendingSyms = 0
var pendingTpes = 0
lazy val fixups = collection.mutable.MutableList[Function0[Unit]]()
def addFixup(fixup: => Unit): Unit = fixups += (() => fixup)
def tryFixup(): Unit = {
if (pendingSyms == 0 && pendingTpes == 0) {
val fixups = this.fixups.toList
this.fixups.clear()
fixups foreach { _() }
}
}
object reverse extends from.StandardImporter {
val from: self.type = self
for ((fromsym, mysym) <- StandardImporter.this.symMap) symMap += ((mysym, fromsym))
for ((fromtpe, mytpe) <- StandardImporter.this.tpeMap) tpeMap += ((mytpe, fromtpe))
}
// todo. careful import of positions
def importPosition(pos: from.Position): Position =
pos.asInstanceOf[Position]
def importSymbol(sym0: from.Symbol): Symbol = {
def doImport(sym: from.Symbol): Symbol = {
if (symMap.contains(sym))
return symMap(sym)
val myowner = importSymbol(sym.owner)
val mypos = importPosition(sym.pos)
val myname = importName(sym.name).toTermName
val myflags = sym.flags
def linkReferenced(mysym: TermSymbol, x: from.TermSymbol, op: from.Symbol => Symbol): Symbol = {
symMap(x) = mysym
mysym.referenced = op(x.referenced)
mysym
}
val mysym = sym match {
case x: from.MethodSymbol =>
linkReferenced(myowner.newMethod(myname, mypos, myflags), x, importSymbol)
case x: from.ModuleSymbol =>
linkReferenced(myowner.newModuleSymbol(myname, mypos, myflags), x, importSymbol)
case x: from.FreeTerm =>
newFreeTerm(importName(x.name).toTermName, importType(x.info), x.value, x.origin, myflags)
case x: from.FreeType =>
newFreeType(importName(x.name).toTypeName, importType(x.info), x.value, x.origin, myflags)
case x: from.TermSymbol =>
linkReferenced(myowner.newValue(myname, mypos, myflags), x, importSymbol)
case x: from.TypeSkolem =>
val origin = x.unpackLocation match {
case null => null
case y: from.Tree => importTree(y)
case y: from.Symbol => importSymbol(y)
}
myowner.newTypeSkolemSymbol(myname.toTypeName, origin, mypos, myflags)
case x: from.ModuleClassSymbol =>
val mysym = myowner.newModuleClass(myname.toTypeName, mypos, myflags)
symMap(x) = mysym
mysym.sourceModule = importSymbol(x.sourceModule)
mysym
case x: from.ClassSymbol =>
val mysym = myowner.newClassSymbol(myname.toTypeName, mypos, myflags)
symMap(x) = mysym
if (sym.thisSym != sym) {
mysym.typeOfThis = importType(sym.typeOfThis)
mysym.thisSym setName importName(sym.thisSym.name)
}
mysym
case x: from.TypeSymbol =>
myowner.newTypeSymbol(myname.toTypeName, mypos, myflags)
}
symMap(sym) = mysym
mysym setFlag Flags.LOCKED
mysym setInfo {
val mytypeParams = sym.typeParams map importSymbol
new LazyPolyType(mytypeParams) {
override def complete(s: Symbol) {
val result = sym.info match {
case from.PolyType(_, res) => res
case result => result
}
s setInfo GenPolyType(mytypeParams, importType(result))
s setAnnotations (sym.annotations map importAnnotationInfo)
}
}
}
mysym resetFlag Flags.LOCKED
} // end doImport
def importOrRelink: Symbol = {
val sym = sym0 // makes sym visible in the debugger
if (sym == null)
null
else if (sym == from.NoSymbol)
NoSymbol
else if (sym.isRoot)
definitions.RootClass
else {
val name = sym.name
val owner = sym.owner
var scope = if (owner.isClass && !owner.isRefinementClass) owner.info else from.NoType
var existing = scope.decl(name)
if (sym.isModuleClass)
existing = existing.moduleClass
if (!existing.exists) scope = from.NoType
val myname = importName(name)
val myowner = importSymbol(owner)
val myscope = if (scope != from.NoType && !(myowner hasFlag Flags.LOCKED)) myowner.info else NoType
var myexisting = if (myscope != NoType) myowner.info.decl(myname) else NoSymbol // cannot load myexisting in general case, because it creates cycles for methods
if (sym.isModuleClass)
myexisting = importSymbol(sym.sourceModule).moduleClass
if (!sym.isOverloaded && myexisting.isOverloaded) {
myexisting =
if (sym.isMethod) {
val localCopy = doImport(sym)
myexisting filter (_.tpe matches localCopy.tpe)
} else {
myexisting filter (!_.isMethod)
}
assert(!myexisting.isOverloaded,
"import failure: cannot determine unique overloaded method alternative from\n "+
(myexisting.alternatives map (_.defString) mkString "\n")+"\n that matches "+sym+":"+sym.tpe)
}
val mysym = {
if (sym.isOverloaded) {
myowner.newOverloaded(myowner.thisType, sym.alternatives map importSymbol)
} else if (sym.isTypeParameter && sym.paramPos >= 0 && !(myowner hasFlag Flags.LOCKED)) {
assert(myowner.typeParams.length > sym.paramPos,
"import failure: cannot determine parameter "+sym+" (#"+sym.paramPos+") in "+
myowner+typeParamsString(myowner.rawInfo)+"\n original symbol was: "+
sym.owner+from.typeParamsString(sym.owner.info))
myowner.typeParams(sym.paramPos)
} else {
if (myexisting != NoSymbol) {
myexisting
} else {
val mysym = doImport(sym)
if (myscope != NoType) {
assert(myowner.info.decls.lookup(myname) == NoSymbol, myname+" "+myowner.info.decl(myname)+" "+myexisting)
myowner.info.decls enter mysym
}
mysym
}
}
}
mysym
}
} // end importOrRelink
val sym = sym0
if (symMap contains sym) {
symMap(sym)
} else {
pendingSyms += 1
try {
symMap getOrElseUpdate (sym, importOrRelink)
} finally {
pendingSyms -= 1
tryFixup()
}
}
}
def importType(tpe: from.Type): Type = {
def doImport(tpe: from.Type): Type = tpe match {
case from.TypeRef(pre, sym, args) =>
TypeRef(importType(pre), importSymbol(sym), args map importType)
case from.ThisType(clazz) =>
ThisType(importSymbol(clazz))
case from.SingleType(pre, sym) =>
SingleType(importType(pre), importSymbol(sym))
case from.MethodType(params, restpe) =>
MethodType(params map importSymbol, importType(restpe))
case from.PolyType(tparams, restpe) =>
PolyType(tparams map importSymbol, importType(restpe))
case from.NullaryMethodType(restpe) =>
NullaryMethodType(importType(restpe))
case from.ConstantType(constant @ from.Constant(_)) =>
ConstantType(importConstant(constant))
case from.SuperType(thistpe, supertpe) =>
SuperType(importType(thistpe), importType(supertpe))
case from.TypeBounds(lo, hi) =>
TypeBounds(importType(lo), importType(hi))
case from.BoundedWildcardType(bounds) =>
BoundedWildcardType(importTypeBounds(bounds))
case from.ClassInfoType(parents, decls, clazz) =>
val myclazz = importSymbol(clazz)
val myscope = if (myclazz.isPackageClass) newPackageScope(myclazz) else newScope
val myclazzTpe = ClassInfoType(parents map importType, myscope, myclazz)
myclazz setInfo GenPolyType(myclazz.typeParams, myclazzTpe) // needed so that newly created symbols find their scope
decls foreach importSymbol // will enter itself into myclazz
myclazzTpe
case from.RefinedType(parents, decls) =>
RefinedType(parents map importType, importScope(decls), importSymbol(tpe.typeSymbol))
case from.ExistentialType(tparams, restpe) =>
newExistentialType(tparams map importSymbol, importType(restpe))
case from.OverloadedType(pre, alts) =>
OverloadedType(importType(pre), alts map importSymbol)
case from.AntiPolyType(pre, targs) =>
AntiPolyType(importType(pre), targs map importType)
case x: from.TypeVar =>
TypeVar(importType(x.origin), importTypeConstraint(x.constr0), x.typeArgs map importType, x.params map importSymbol)
case from.NotNullType(tpe) =>
NotNullType(importType(tpe))
case from.AnnotatedType(annots, tpe, selfsym) =>
AnnotatedType(annots map importAnnotationInfo, importType(tpe), importSymbol(selfsym))
case from.ErrorType =>
ErrorType
case from.WildcardType =>
WildcardType
case from.NoType =>
NoType
case from.NoPrefix =>
NoPrefix
case null =>
null
} // end doImport
def importOrRelink: Type =
doImport(tpe)
if (tpeMap contains tpe) {
tpeMap(tpe)
} else {
pendingTpes += 1
try {
tpeMap getOrElseUpdate (tpe, importOrRelink)
} finally {
pendingTpes -= 1
tryFixup()
}
}
}
def importTypeBounds(bounds: from.TypeBounds) = importType(bounds).asInstanceOf[TypeBounds]
def importAnnotationInfo(ann: from.AnnotationInfo): AnnotationInfo = {
val atp1 = importType(ann.atp)
val args1 = ann.args map importTree
val assocs1 = ann.assocs map { case (name, arg) => (importName(name), importAnnotArg(arg)) }
val original1 = importTree(ann.original)
AnnotationInfo(atp1, args1, assocs1) setOriginal original1
}
def importAnnotArg(arg: from.ClassfileAnnotArg): ClassfileAnnotArg = arg match {
case from.LiteralAnnotArg(constant @ from.Constant(_)) =>
LiteralAnnotArg(importConstant(constant))
case from.ArrayAnnotArg(args) =>
ArrayAnnotArg(args map importAnnotArg)
case from.ScalaSigBytes(bytes) =>
ScalaSigBytes(bytes)
case from.NestedAnnotArg(annInfo) =>
NestedAnnotArg(importAnnotationInfo(annInfo))
}
def importTypeConstraint(constr: from.TypeConstraint): TypeConstraint = {
val result = new TypeConstraint(constr.loBounds map importType, constr.hiBounds map importType)
result.inst = importType(constr.inst)
result
}
// !!! todo: override to cater for PackageScopes
def importScope(decls: from.Scope): Scope =
newScopeWith(decls.toList map importSymbol: _*)
def importName(name: from.Name): Name =
if (name.isTypeName) newTypeName(name.toString) else newTermName(name.toString)
def importTypeName(name: from.TypeName): TypeName = importName(name).toTypeName
def importTermName(name: from.TermName): TermName = importName(name).toTermName
def importModifiers(mods: from.Modifiers): Modifiers =
new Modifiers(mods.flags, importName(mods.privateWithin), mods.annotations map importTree)
def importImportSelector(sel: from.ImportSelector): ImportSelector =
new ImportSelector(importName(sel.name), sel.namePos, if (sel.rename != null) importName(sel.rename) else null, sel.renamePos)
def importTree(tree: from.Tree): Tree = {
val mytree = tree match {
case from.ClassDef(mods, name, tparams, impl) =>
new ClassDef(importModifiers(mods), importName(name).toTypeName, tparams map importTypeDef, importTemplate(impl))
case from.PackageDef(pid, stats) =>
new PackageDef(importRefTree(pid), stats map importTree)
case from.ModuleDef(mods, name, impl) =>
new ModuleDef(importModifiers(mods), importName(name).toTermName, importTemplate(impl))
case from.emptyValDef =>
emptyValDef
case from.ValDef(mods, name, tpt, rhs) =>
new ValDef(importModifiers(mods), importName(name).toTermName, importTree(tpt), importTree(rhs))
case from.DefDef(mods, name, tparams, vparamss, tpt, rhs) =>
new DefDef(importModifiers(mods), importName(name).toTermName, tparams map importTypeDef, vparamss map (_ map importValDef), importTree(tpt), importTree(rhs))
case from.TypeDef(mods, name, tparams, rhs) =>
new TypeDef(importModifiers(mods), importName(name).toTypeName, tparams map importTypeDef, importTree(rhs))
case from.LabelDef(name, params, rhs) =>
new LabelDef(importName(name).toTermName, params map importIdent, importTree(rhs))
case from.Import(expr, selectors) =>
new Import(importTree(expr), selectors map importImportSelector)
case from.Template(parents, self, body) =>
new Template(parents map importTree, importValDef(self), body map importTree)
case from.Block(stats, expr) =>
new Block(stats map importTree, importTree(expr))
case from.CaseDef(pat, guard, body) =>
new CaseDef(importTree(pat), importTree(guard), importTree(body))
case from.Alternative(trees) =>
new Alternative(trees map importTree)
case from.Star(elem) =>
new Star(importTree(elem))
case from.Bind(name, body) =>
new Bind(importName(name), importTree(body))
case from.UnApply(fun, args) =>
new UnApply(importTree(fun), args map importTree)
case from.ArrayValue(elemtpt ,elems) =>
new ArrayValue(importTree(elemtpt), elems map importTree)
case from.Function(vparams, body) =>
new Function(vparams map importValDef, importTree(body))
case from.Assign(lhs, rhs) =>
new Assign(importTree(lhs), importTree(rhs))
case from.AssignOrNamedArg(lhs, rhs) =>
new AssignOrNamedArg(importTree(lhs), importTree(rhs))
case from.If(cond, thenp, elsep) =>
new If(importTree(cond), importTree(thenp), importTree(elsep))
case from.Match(selector, cases) =>
new Match(importTree(selector), cases map importCaseDef)
case from.Return(expr) =>
new Return(importTree(expr))
case from.Try(block, catches, finalizer) =>
new Try(importTree(block), catches map importCaseDef, importTree(finalizer))
case from.Throw(expr) =>
new Throw(importTree(expr))
case from.New(tpt) =>
new New(importTree(tpt))
case from.Typed(expr, tpt) =>
new Typed(importTree(expr), importTree(tpt))
case from.TypeApply(fun, args) =>
new TypeApply(importTree(fun), args map importTree)
case from.Apply(fun, args) => tree match {
case _: from.ApplyToImplicitArgs =>
new ApplyToImplicitArgs(importTree(fun), args map importTree)
case _: from.ApplyImplicitView =>
new ApplyImplicitView(importTree(fun), args map importTree)
case _: from.ApplyConstructor =>
new ApplyConstructor(importTree(fun), args map importTree)
case _ =>
new Apply(importTree(fun), args map importTree)
}
case from.ApplyDynamic(qual, args) =>
new ApplyDynamic(importTree(qual), args map importTree)
case from.Super(qual, mix) =>
new Super(importTree(qual), importTypeName(mix))
case from.This(qual) =>
new This(importName(qual).toTypeName)
case from.Select(qual, name) =>
new Select(importTree(qual), importName(name))
case from.Ident(name) => tree match {
case _: from.BackQuotedIdent =>
new BackQuotedIdent(importName(name))
case _ =>
new Ident(importName(name))
}
case from.ReferenceToBoxed(ident) =>
new ReferenceToBoxed(importTree(ident) match { case ident: Ident => ident })
case from.Literal(constant @ from.Constant(_)) =>
new Literal(importConstant(constant))
case from.TypeTree() =>
new TypeTree()
case from.Annotated(annot, arg) =>
new Annotated(importTree(annot), importTree(arg))
case from.SingletonTypeTree(ref) =>
new SingletonTypeTree(importTree(ref))
case from.SelectFromTypeTree(qual, name) =>
new SelectFromTypeTree(importTree(qual), importName(name).toTypeName)
case from.CompoundTypeTree(templ) =>
new CompoundTypeTree(importTemplate(templ))
case from.AppliedTypeTree(tpt, args) =>
new AppliedTypeTree(importTree(tpt), args map importTree)
case from.TypeBoundsTree(lo, hi) =>
new TypeBoundsTree(importTree(lo), importTree(hi))
case from.ExistentialTypeTree(tpt, whereClauses) =>
new ExistentialTypeTree(importTree(tpt), whereClauses map importTree)
case from.EmptyTree =>
EmptyTree
case null =>
null
}
addFixup({
if (mytree != null) {
val mysym = if (tree hasSymbol) importSymbol(tree.symbol) else NoSymbol
val mytpe = importType(tree.tpe)
mytree match {
case mytt: TypeTree =>
val tt = tree.asInstanceOf[from.TypeTree]
if (mytree hasSymbol) mytt.symbol = mysym
if (tt.wasEmpty) mytt.defineType(mytpe) else mytt.setType(mytpe)
if (tt.original != null) mytt.setOriginal(importTree(tt.original))
case _ =>
if (mytree hasSymbol) mytree.symbol = importSymbol(tree.symbol)
mytree.tpe = importType(tree.tpe)
}
}
})
tryFixup()
mytree
}
def importValDef(tree: from.ValDef): ValDef = importTree(tree).asInstanceOf[ValDef]
def importTypeDef(tree: from.TypeDef): TypeDef = importTree(tree).asInstanceOf[TypeDef]
def importTemplate(tree: from.Template): Template = importTree(tree).asInstanceOf[Template]
def importRefTree(tree: from.RefTree): RefTree = importTree(tree).asInstanceOf[RefTree]
def importIdent(tree: from.Ident): Ident = importTree(tree).asInstanceOf[Ident]
def importCaseDef(tree: from.CaseDef): CaseDef = importTree(tree).asInstanceOf[CaseDef]
def importConstant(constant: from.Constant): Constant = new Constant(constant.tag match {
case ClazzTag => importType(constant.value.asInstanceOf[from.Type])
case EnumTag => importSymbol(constant.value.asInstanceOf[from.Symbol])
case _ => constant.value
})
}
}
|