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
|
package scala.reflect.internal
package util
import scala.collection.{ mutable, immutable }
trait TraceSymbolActivity {
val global: SymbolTable
import global._
if (traceSymbolActivity && !global.inReflexiveMirror)
scala.sys addShutdownHook showAllSymbols()
private type Set[T] = scala.collection.immutable.Set[T]
private val Set = scala.collection.immutable.Set
val allSymbols = mutable.Map[Int, Symbol]()
val allChildren = mutable.Map[Int, List[Int]]() withDefaultValue Nil
val prevOwners = mutable.Map[Int, List[(Int, Phase)]]() withDefaultValue Nil
val symsCaused = mutable.Map[Int, Int]() withDefaultValue 0
val allTrees = mutable.Set[Tree]()
def recordSymbolsInTree(tree: Tree) {
allTrees += tree
}
def recordNewSymbol(sym: Symbol) {
if (sym.id > 1) {
allSymbols(sym.id) = sym
allChildren(sym.owner.id) ::= sym.id
}
}
def recordNewSymbolOwner(sym: Symbol, newOwner: Symbol) {
val sid = sym.id
val oid = sym.owner.id
val nid = newOwner.id
prevOwners(sid) ::= (oid -> phase)
allChildren(oid) = allChildren(oid) filterNot (_ == sid)
allChildren(nid) ::= sid
}
/** TODO.
*/
private def reachableDirectlyFromSymbol(sym: Symbol): List[Symbol] = (
List(sym.owner, sym.alias, sym.thisSym)
++ sym.children
++ sym.info.parents.map(_.typeSymbol)
++ sym.typeParams
++ sym.paramss.flatten
)
private def reachable[T](inputs: Traversable[T], mkSymbol: T => Symbol): Set[Symbol] = {
def loop(seen: Set[Symbol], remaining: List[Symbol]): Set[Symbol] = {
remaining match {
case Nil => seen
case head :: rest =>
if ((head eq null) || (head eq NoSymbol) || seen(head)) loop(seen, rest)
else loop(seen + head, rest ++ reachableDirectlyFromSymbol(head).filterNot(seen))
}
}
loop(immutable.Set(), inputs.toList map mkSymbol filterNot (_ eq null) distinct)
}
private def treeList(t: Tree) = {
val buf = mutable.ListBuffer[Tree]()
t foreach (buf += _)
buf.toList
}
private def reachableFromSymbol(root: Symbol): Set[Symbol] =
reachable[Symbol](List(root, root.info.typeSymbol), x => x)
private def reachableFromTree(tree: Tree): Set[Symbol] =
reachable[Tree](treeList(tree), _.symbol)
private def signature(id: Int) = runBeforeErasure(allSymbols(id).defString)
private def dashes(s: Any): String = ("" + s) map (_ => '-')
private def show(s1: Any, ss: Any*) {
println("%-12s".format(s1) +: ss mkString " ")
}
private def showHeader(s1: Any, ss: Any*) {
show(s1, ss: _*)
show(dashes(s1), ss map dashes: _*)
}
private def showSym(sym: Symbol) {
def prefix = (" " * (sym.ownerChain.length - 1)) + sym.id
try println("%s#%s %s".format(prefix, sym.accurateKindString, sym.name.decode))
catch {
case x => println(prefix + " failed: " + x)
}
allChildren(sym.id).sorted foreach showIdAndRemove
}
private def showIdAndRemove(id: Int) {
allSymbols remove id foreach showSym
}
private def symbolStr(id: Int): String = {
if (id == 1) "NoSymbol" else {
val sym = allSymbols(id)
sym.accurateKindString + " " + sym.name.decode
}
}
private def ownerStr(id: Int): String = {
val sym = allSymbols(id)
sym.name.decode + "#" + sym.id
}
private def freq[T, U](xs: collection.Traversable[T])(fn: T => U): List[(U, Int)] = {
val ys = xs groupBy fn mapValues (_.size)
ys.toList sortBy (-_._2)
}
private def showMapFreq[T](xs: collection.Map[T, Traversable[_]])(showFn: T => String) {
xs.mapValues(_.size).toList.sortBy(-_._2) take 100 foreach { case (k, size) =>
show(size, showFn(k))
}
println("\n")
}
private def showFreq[T, U](xs: Traversable[T])(groupFn: T => U, showFn: U => String = (x: U) => "" + x) = {
showMapFreq(xs.toList groupBy groupFn)(showFn)
}
private lazy val findErasurePhase: Phase = {
var ph = phase
while (ph != NoPhase && ph.name != "erasure") {
ph = ph.prev
}
ph
}
private def runBeforeErasure[T](body: => T): T = atPhase(findErasurePhase)(body)
def showAllSymbols() {
if (!traceSymbolActivity) return
allSymbols(1) = NoSymbol
println("" + allSymbols.size + " symbols created.")
println("")
showHeader("descendants", "symbol")
showFreq(allSymbols.values flatMap (_.ownerChain drop 1))(_.id, symbolStr)
showHeader("children", "symbol")
showMapFreq(allChildren)(symbolStr)
if (prevOwners.nonEmpty) {
showHeader("prev owners", "symbol")
showMapFreq(prevOwners) { k =>
val owners = (((allSymbols(k).owner.id, NoPhase)) :: prevOwners(k)) map {
case (oid, NoPhase) => "-> owned by " + ownerStr(oid)
case (oid, ph) => "-> owned by %s (until %s)".format(ownerStr(oid), ph)
}
signature(k) :: owners mkString "\n "
}
}
val nameFreq = allSymbols.values.toList groupBy (_.name)
showHeader("frequency", "%-15s".format("name"), "owners")
showMapFreq(nameFreq) { name =>
"%-15s %s".format(name.decode, {
val owners = freq(nameFreq(name))(_.owner)
"%4s owners (%s)".format(
owners.size,
owners.take(3).map({ case (k, v) => v + "/" + k }).mkString(", ") + ", ..."
)
})
}
allSymbols.keys.toList.sorted foreach showIdAndRemove
}
}
|
