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
|
package dotty.tools.dotc
package core
import Periods._, Contexts._, Symbols._, References._, Names._
import Types._, Flags._, Decorators._
import Scopes.Scope
import collection.mutable
import collection.immutable.BitSet
trait Denotations { self: Context =>
/** A set for hash consing superclass bitsets */
private val uniqueBits = new util.HashSet[BitSet]("superbits", 1024)
}
object Denotations {
abstract class Denotation {
/** The validity interval of this symbol */
var valid: Interval = Nowhere
/** The next instance of this symbol in the same run */
private[core] var nextInRun: Denotation = this
/**
* The version of this symbol that was valid in the first phase
* of this run
*/
def initial: Denotation = {
var sym = nextInRun
while (sym.valid > this.valid) sym = sym.nextInRun
sym
}
def owner: Symbol = ???
def name: Name = ???
def flags: FlagSet = ???
def setFlag(flag: FlagSet): Unit = ???
def tpe: Type = ???
def info: Type = ???
/* Validity and instance handling:
*
* Symbols have an interval of validity, defined
* by their `valid` fields.
*
* There may be several symbols with different validity
* representing the same underlying symbol at different phases.
* These are called a "flock". Flock members are generated by
* @see SymRef.trackSym. Flock members are connected in a ring
* with their `nextInFlock` fields.
*
* There are the following invariants converning flock members
*
* 1) validity intervals must be non-overlapping
* 2) the union of all validity intervals must be a contiguous
* interval starting in FirstPhaseId.
*/
/** is this symbol a type? */
def isType: Boolean = false
/** is this symbol a class? */
def isClass: Boolean = false
/** is this symbol a method? */
def isMethod: Boolean = false
/** is this symbol the result of an erroneous definition? */
def isError: Boolean = false
def withType(tp: Type): Denotation = ???
}
object NameFilter {
final val WordSizeLog = 6
final val DefinedNamesWords = 16
final val DefinedNamesSize = DefinedNamesWords << WordSizeLog
final val DefinedNamesMask = DefinedNamesSize - 1
type FingerPrint = Array[Long]
def includeName(bits: FingerPrint, name: Name): Unit = {
val hash = name.start & DefinedNamesMask
bits(hash >> 6) |= (1 << hash)
}
def includeFingerPrint(bits1: FingerPrint, bits2: FingerPrint): Unit =
for (i <- 0 until DefinedNamesWords) bits1(i) |= bits2(i)
def containsName(bits: FingerPrint, name: Name): Boolean = {
val hash = name.start & DefinedNamesMask
(bits(hash >> 6) & (1 << hash)) != 0
}
def newNameFilter: FingerPrint = new Array[Long](DefinedNamesWords)
}
class ClassDenotation(val parents: List[Type], val decls: Scope, val clazz: ClassSymbol) extends Denotation {
import NameFilter._
import util.LRU8Cache
def typeParams: List[TypeSymbol] = ???
private var memberCacheVar: LRU8Cache[Name, RefSet] = null
private def memberCache: LRU8Cache[Name, RefSet] = {
if (memberCacheVar == null) memberCacheVar = new LRU8Cache
memberCacheVar
}
private var thisTypeCache: ThisType = null
def thisType(implicit ctx: Context): Type = {
if (thisTypeCache == null)
thisTypeCache = ThisType(clazz)
thisTypeCache
}
private var typeConstructorCache: Type = null
def typeConstructor(implicit ctx: Context): Type = {
if (typeConstructorCache == null)
typeConstructorCache = NamedType(thisType, clazz.name)
typeConstructorCache
}
private var typeTemplateCache: Type = null
def typeTemplate(implicit ctx: Context): Type = {
if (typeTemplateCache == null)
AppliedType.make(typeConstructor, typeParams map (_.typeConstructor))
typeTemplateCache
}
private var baseClassesVar: List[ClassSymbol] = null
private var superClassBitsVar: BitSet = null
private def computeSuperClassBits(implicit ctx: Context): Unit = {
val seen = new mutable.BitSet
val locked = new mutable.BitSet
def addBaseClasses(bcs: List[ClassSymbol], to: List[ClassSymbol])
: List[ClassSymbol] = bcs match {
case bc :: bcs1 =>
val id = bc.superId
if (seen contains id) to
else if (locked contains id) throw new CyclicReference(clazz)
else {
locked += id
val bcs1added = addBaseClasses(bcs1, to)
seen += id
if (bcs1added eq bcs1) bcs else bc :: bcs1added
}
case _ =>
to
}
def addParentBaseClasses(ps: List[Type], to: List[ClassSymbol]): List[ClassSymbol] = ps match {
case p :: ps1 =>
addBaseClasses(p.baseClasses, addParentBaseClasses(ps1, to))
case _ =>
to
}
baseClassesVar = clazz :: addParentBaseClasses(parents, Nil)
superClassBitsVar = ctx.root.uniqueBits.findEntryOrUpdate(seen.toImmutable)
}
def superClassBits(implicit ctx: Context): BitSet = {
if (superClassBitsVar == null) computeSuperClassBits
superClassBitsVar
}
def baseClasses(implicit ctx: Context): List[ClassSymbol] = {
if (baseClassesVar == null) computeSuperClassBits
baseClassesVar
}
/** Is this class a subclass of `clazz`? */
final def isSubClass(clazz: ClassSymbol)(implicit ctx: Context): Boolean = {
superClassBits contains clazz.superId
}
private var definedFingerPrintCache: FingerPrint = null
private def computeDefinedFingerPrint(implicit ctx: Context): FingerPrint = {
var bits = newNameFilter
var e = decls.lastEntry
while (e != null) {
includeName(bits, clazz.name)
e = e.prev
}
var ps = parents
while (ps.nonEmpty) {
val parent = ps.head.typeSymbol
parent.deref match {
case classd: ClassDenotation =>
includeFingerPrint(bits, classd.definedFingerPrint)
parent.deref setFlag Frozen
case _ =>
}
ps = ps.tail
}
definedFingerPrintCache = bits
bits
}
/** Enter a symbol in current scope.
* Note: We require that this does not happen after the first time
* someone does a findMember on a subclass.
*/
def enter(sym: Symbol)(implicit ctx: Context) = {
require((clazz.flags & Frozen) == Flags.Empty)
decls enter sym
if (definedFingerPrintCache != null)
includeName(definedFingerPrintCache, sym.name)
if (memberCacheVar != null)
memberCache invalidate sym.name
}
/** Delete symbol from current scope.
* Note: We require that this does not happen after the first time
* someone does a findMember on a subclass.
*/
def delete(sym: Symbol)(implicit ctx: Context) = {
require((clazz.flags & Frozen) == Flags.Empty)
decls unlink sym
if (definedFingerPrintCache != null)
computeDefinedFingerPrint
if (memberCacheVar != null)
memberCache invalidate sym.name
}
def definedFingerPrint(implicit ctx: Context): FingerPrint = {
val fp = definedFingerPrintCache
if (fp != null) fp else computeDefinedFingerPrint
}
final def memberRefsNamed(name: Name)(implicit ctx: Context): RefSet = {
var refs: RefSet = memberCache lookup name
if (refs == null) {
if (containsName(definedFingerPrint, name)) {
val ownRefs = decls.refsNamed(name)
refs = ownRefs
var ps = parents
while (ps.nonEmpty) {
val parentSym = ps.head.typeSymbol
parentSym.deref match {
case parentd: ClassDenotation =>
refs = refs union
parentd.memberRefsNamed(name)
.filterExcluded(Flags.Private)
.asSeenFrom(thisType, parentSym)
.filterDisjoint(ownRefs)
case _ =>
}
}
} else {
refs = NoRef
}
memberCache enter (name, refs)
}
refs
}
private var baseTypeCache: java.util.HashMap[UniqueType, Type] = null
final def baseTypeOf(tp: Type)(implicit ctx: Context): Type = {
def computeBaseTypeOf(tp: Type): Type = tp match {
case AppliedType(tycon, args) =>
baseTypeOf(tycon).subst(tycon.typeParams, args)
case tp: TypeProxy =>
baseTypeOf(tp.underlying)
case AndType(tp1, tp2) =>
baseTypeOf(tp1) & baseTypeOf(tp2)
case OrType(tp1, tp2) =>
baseTypeOf(tp1) | baseTypeOf(tp2)
case tp @ ClassInfo(pre, classd) =>
def reduce(bt: Type, ps: List[Type]): Type = ps match {
case p :: ps1 => reduce(bt & baseTypeOf(p), ps1)
case _ => bt
}
if (classd.clazz == clazz) tp.typeTemplate
else reduce(NoType, classd.parents).substThis(classd.clazz, tp.prefix)
}
if (clazz.isStatic && clazz.typeParams.isEmpty) clazz.typeConstructor
else tp match {
case tp: UniqueType =>
if (baseTypeCache == null)
baseTypeCache = new java.util.HashMap[UniqueType, Type]
var basetp = baseTypeCache get tp
if (basetp == null) {
baseTypeCache.put(tp, NoType)
basetp = computeBaseTypeOf(tp)
baseTypeCache.put(tp, basetp)
} else if (basetp == NoType) {
throw new CyclicReference(clazz)
}
basetp
case _ =>
computeBaseTypeOf(tp)
}
}
private var memberNamesCache: Map[NameFilter, Set[Name]] = Map()
def memberNames(keepOnly: NameFilter)(implicit ctx: Context): Set[Name] =
memberNamesCache get keepOnly match {
case Some(names) =>
names
case _ =>
val inheritedNames = (parents flatMap (_.memberNames(thisType, keepOnly))).toSet
val ownNames = decls.iterator map (_.name)
val candidates = inheritedNames ++ ownNames
val names = candidates filter (keepOnly(thisType, _))
memberNamesCache += (keepOnly -> names)
names
}
}
object NoDenotation extends Denotation {
override def owner: Symbol = throw new AssertionError("NoDenotation.owner")
override def name: Name = BootNameTable.newTermName("<none>")
override def flags = Flags.Empty
override def tpe: Type = NoType
override def info: Type = NoType
}
}
|