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
|
package dotty.tools.dotc
package transform
import TreeTransforms._
import core.DenotTransformers._
import core.Denotations._
import core.SymDenotations._
import core.Contexts._
import core.Symbols._
import core.Types._
import core.Flags.Method
import core.Constants._
import core.StdNames._
import core.Decorators._
import core.transform.Erasure.isUnboundedGeneric
import typer._
import typer.ErrorReporting._
import reporting.ThrowingReporter
import ast.Trees._
import ast.{tpd, untpd}
import java.lang.AssertionError
/** This transform eliminates patterns. Right now it's a dummy.
* Awaiting the real pattern matcher.
*/
class TreeChecker {
import ast.tpd._
def check(ctx: Context) = {
println(s"checking ${ctx.compilationUnit} after phase ${ctx.phase.prev}")
val checkingCtx = ctx.fresh
.setTyperState(ctx.typerState.withReporter(new ThrowingReporter(ctx.typerState.reporter)))
Checker.typedExpr(ctx.compilationUnit.tpdTree)(checkingCtx)
}
object Checker extends ReTyper {
override def typed(tree: untpd.Tree, pt: Type)(implicit ctx: Context) = try {
tree match {
case _: untpd.UnApply =>
// can't recheck patterns
tree.asInstanceOf[tpd.Tree]
case _: untpd.TypedSplice | _: untpd.Thicket | _: EmptyValDef[_] =>
super.typed(tree)
case _ if tree.isType =>
promote(tree)
case _ =>
val tree1 = super.typed(tree, pt)
def sameType(tp1: Type, tp2: Type) =
(tp1 eq tp2) || // accept NoType / NoType
(tp1 =:= tp2)
def divergenceMsg =
s"""Types differ
|Original type : ${tree.typeOpt.show}
|After checking: ${tree1.tpe.show}
|Original tree : ${tree.show}
|After checking: ${tree1.show}
""".stripMargin
assert(sameType(tree1.tpe, tree.typeOpt), divergenceMsg)
tree1
}
} catch {
case ex: Throwable =>
println(i"exception while checking $tree of class ${tree.getClass} # ${tree.uniqueId}")
throw ex
}
override def typedIdent(tree: untpd.Ident, pt: Type)(implicit ctx: Context): Tree = {
assert(tree.isTerm || ctx.phase.prev.id <= ctx.typerPhase.id, tree.show + " at " + ctx.phase)
super.typedIdent(tree, pt)
}
override def typedSelect(tree: untpd.Select, pt: Type)(implicit ctx: Context): Tree = {
assert(tree.isTerm || ctx.phase.prev.id <= ctx.typerPhase.id, tree.show + " at " + ctx.phase)
super.typedSelect(tree, pt)
}
/** Check that all defined symbols have legal owners.
* An owner is legal if it is either the same as the context's owner
* or there's an owner chain of valdefs starting at the context's owner and
* reaching up to the symbol's owner. The reason for this relaxed matching
* is that we should be able to pull out an expression as an initializer
* of a helper value without having to do a change owner traversal of the expression.
*/
override def index(trees: List[untpd.Tree])(implicit ctx: Context): Context = {
def ownerMatches(symOwner: Symbol, ctxOwner: Symbol): Boolean =
symOwner == ctxOwner ||
ctxOwner.isTerm && !(ctxOwner is Method | Lazy | Mutable) &&
ownerMatches(symOwner, ctxOwner.owner)
for (tree <- trees if tree.isDef)
assert(ownerMatches(tree.symbol.owner, ctx.owner),
i"bad owner; $tree has owner ${tree.symbol.owner}, expected was ${ctx.owner}")
super.index(trees)
}
}
}
object TreeChecker extends TreeChecker
|
