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
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
|
package dotty.tools.dotc
package core
import Positions._, Types._, Contexts._, Constants._, Names._, Flags._
import SymDenotations._, Symbols._, StdNames._, Annotations._
object TypedTrees {
object tpd {
type Modifiers = Trees.Modifiers[Type]
type Tree = Trees.Tree[Type]
type TypTree = Trees.TypTree[Type]
type TermTree = Trees.TermTree[Type]
type PatternTree = Trees.PatternTree[Type]
type SymTree = Trees.SymTree[Type]
type ProxyTree = Trees.ProxyTree[Type]
type NameTree = Trees.NameTree[Type]
type RefTree = Trees.RefTree[Type]
type DefTree = Trees.DefTree[Type]
type TreeCopier = Trees.TreeCopier[Type]
type TreeAccumulator[T] = Trees.TreeAccumulator[T, Type]
type TreeTransformer[C] = Trees.TreeTransformer[Type, C]
type Ident = Trees.Ident[Type]
type Select = Trees.Select[Type]
type This = Trees.This[Type]
type Super = Trees.Super[Type]
type Apply = Trees.Apply[Type]
type TypeApply = Trees.TypeApply[Type]
type Literal = Trees.Literal[Type]
type New = Trees.New[Type]
type Pair = Trees.Pair[Type]
type Typed = Trees.Typed[Type]
type NamedArg = Trees.NamedArg[Type]
type Assign = Trees.Assign[Type]
type Block = Trees.Block[Type]
type If = Trees.If[Type]
type Match = Trees.Match[Type]
type CaseDef = Trees.CaseDef[Type]
type Return = Trees.Return[Type]
type Try = Trees.Try[Type]
type Throw = Trees.Throw[Type]
type SeqLiteral = Trees.SeqLiteral[Type]
type TypeTree = Trees.TypeTree[Type]
type SingletonTypeTree = Trees.SingletonTypeTree[Type]
type SelectFromTypeTree = Trees.SelectFromTypeTree[Type]
type AndTypeTree = Trees.AndTypeTree[Type]
type OrTypeTree = Trees.OrTypeTree[Type]
type RefineTypeTree = Trees.RefineTypeTree[Type]
type AppliedTypeTree = Trees.AppliedTypeTree[Type]
type TypeBoundsTree = Trees.TypeBoundsTree[Type]
type Bind = Trees.Bind[Type]
type Alternative = Trees.Alternative[Type]
type UnApply = Trees.UnApply[Type]
type ValDef = Trees.ValDef[Type]
type DefDef = Trees.DefDef[Type]
type TypeDef = Trees.TypeDef[Type]
type Template = Trees.Template[Type]
type ClassDef = Trees.ClassDef[Type]
type Import = Trees.Import[Type]
type PackageDef = Trees.PackageDef[Type]
type Annotated = Trees.Annotated[Type]
type EmptyTree = Trees.EmptyTree[Type]
type Shared = Trees.Shared[Type]
private implicit def pos(implicit ctx: Context): Position = ctx.position
def defPos(sym: Symbol)(implicit ctx: Context) = ctx.position union sym.coord.toPosition
def Modifiers(sym: Symbol)(implicit ctx: Context): Modifiers = Trees.Modifiers[Type](
sym.flags & ModifierFlags,
if (sym.privateWithin.exists) sym.privateWithin.asType.name else tpnme.EMPTY,
sym.annotations map (_.tree))
def Ident(tp: NamedType)(implicit ctx: Context): Ident =
Trees.Ident(tp.name).withType(tp).checked
def Select(pre: Tree, tp: NamedType)(implicit ctx: Context): Select =
Trees.Select(pre, tp.name).withType(tp).checked
def This(cls: ClassSymbol)(implicit ctx: Context): This =
Trees.This(cls.name).withType(cls.thisType).checked
def Super(qual: Tree, mix: TypeName)(implicit ctx: Context): Super = {
val owntype =
if (mix.isEmpty) ctx.glb(qual.tpe.parents)
else {
val mixParents = qual.tpe.parents filter (_.name == mix)
check(mixParents.length == 1)
mixParents.head
}
Trees.Super(qual, mix).withType(SuperType(qual.tpe, owntype)).checked
}
def Apply(fn: Tree, args: List[Tree])(implicit ctx: Context): Apply = {
val owntype = fn.tpe.widen match {
case fntpe @ MethodType(pnames, ptypes) =>
check(sameLength(ptypes, args))
fntpe.instantiate(args map (_.tpe))
case _ =>
check(false)
ErrorType
}
Trees.Apply(fn, args).withType(owntype).checked
}
def TypeApply(fn: Tree, args: List[Tree])(implicit ctx: Context): TypeApply = {
val owntype = fn.tpe.widen match {
case fntpe @ PolyType(pnames) =>
check(sameLength(pnames, args))
fntpe.instantiate(args map (_.tpe))
case _ =>
check(false)
ErrorType
}
Trees.TypeApply(fn, args).withType(owntype).checked
}
def Literal(const: Constant)(implicit ctx: Context): Literal =
Trees.Literal(const).withType(const.tpe).checked
def New(tp: Type)(implicit ctx: Context): New =
Trees.New(TypeTree(tp)).withType(tp).checked
def Pair(left: Tree, right: Tree)(implicit ctx: Context): Pair =
Trees.Pair(left, right).withType(defn.PairType.appliedTo(left.tpe, right.tpe)).checked
def Typed(expr: Tree, tpt: Tree)(implicit ctx: Context): Typed =
Trees.Typed(expr, tpt).withType(tpt.tpe).checked
def NamedArg(name: TermName, arg: Tree)(implicit ctx: Context) =
Trees.NamedArg(name, arg).withType(arg.tpe).checked
def Assign(lhs: Tree, rhs: Tree)(implicit ctx: Context): Assign =
Trees.Assign(lhs, rhs).withType(defn.UnitType).checked
def Block(stats: List[Tree], expr: Tree)(implicit ctx: Context): Block = {
lazy val locals = localSyms(stats).toSet
val blk = Trees.Block(stats, expr)
def widen(tp: Type): Type = tp match {
case tp: TermRef if locals contains tp.symbol =>
widen(tp.info)
case _ => tp
}
blk.withType(widen(expr.tpe))
}
def If(cond: Tree, thenp: Tree, elsep: Tree)(implicit ctx: Context): If =
Trees.If(cond, thenp, elsep).withType(thenp.tpe | elsep.tpe).checked
def Match(selector: Tree, cases: List[CaseDef])(implicit ctx: Context): Match =
Trees.Match(selector, cases).withType(ctx.lub(cases map (_.body.tpe))).checked
def CaseDef(pat: Tree, guard: Tree, body: Tree)(implicit ctx: Context): CaseDef =
Trees.CaseDef(pat, guard, body).withType(body.tpe).checked
def Return(expr: Tree, from: Ident)(implicit ctx: Context): Return =
Trees.Return(expr, from).withType(defn.NothingType).checked
def Try(block: Tree, catches: List[CaseDef], finalizer: Tree)(implicit ctx: Context): Try =
Trees.Try(block, catches, finalizer).withType(ctx.lub(block.tpe :: catches.map(_.tpe))).checked
def Throw(expr: Tree)(implicit ctx: Context): Throw =
Trees.Throw(expr).withType(defn.NothingType).checked
def SeqLiteral(elemtpt: Tree, elems: List[Tree])(implicit ctx: Context): SeqLiteral =
Trees.SeqLiteral(elemtpt, elems).withType(defn.RepeatedParamType.appliedTo(elemtpt.tpe)).checked
def SeqLiteral(elems: List[Tree])(implicit ctx: Context): SeqLiteral =
SeqLiteral(TypeTree(ctx.lub(elems map (_.tpe))), elems)
def TypeTree(tp: Type, original: Tree = EmptyTree)(implicit ctx: Context): TypeTree =
Trees.TypeTree(original).withType(tp).checked
def SingletonTypeTree(ref: Tree)(implicit ctx: Context): SingletonTypeTree =
Trees.SingletonTypeTree(ref).withType(ref.tpe).checked
def SelectFromTypeTree(qualifier: Tree, tp: NamedType)(implicit ctx: Context): SelectFromTypeTree =
Trees.SelectFromTypeTree(qualifier, tp.name).withType(tp).checked
def AndTypeTree(left: Tree, right: Tree)(implicit ctx: Context): AndTypeTree =
Trees.AndTypeTree(left, right).withType(left.tpe & right.tpe).checked
def OrTypeTree(left: Tree, right: Tree)(implicit ctx: Context): OrTypeTree =
Trees.OrTypeTree(left, right).withType(left.tpe | right.tpe).checked
def RefineTypeTree(tpt: Tree, refinements: List[DefTree])(implicit ctx: Context): RefineTypeTree = {
def refineType(tp: Type, refinement: Symbol): Type =
RefinedType(tp, refinement.name, refinement.info)
Trees.RefineTypeTree(tpt, refinements)
.withType((tpt.tpe /: (refinements map (_.symbol)))(refineType)).checked
}
def refineType(tp: Type, refinement: Symbol)(implicit ctx: Context): Type =
RefinedType(tp, refinement.name, refinement.info)
def AppliedTypeTree(tpt: Tree, args: List[Tree])(implicit ctx: Context): AppliedTypeTree =
Trees.AppliedTypeTree(tpt, args).withType(tpt.tpe.appliedTo(args map (_.tpe))).checked
def TypeBoundsTree(lo: Tree, hi: Tree)(implicit ctx: Context): TypeBoundsTree =
Trees.TypeBoundsTree(lo, hi).withType(TypeBounds(lo.tpe, hi.tpe)).checked
def Bind(sym: TermSymbol, body: Tree)(implicit ctx: Context): Bind =
Trees.Bind(sym.name, body)(defPos(sym)).withType(refType(sym)).checked
def Alternative(trees: List[Tree])(implicit ctx: Context): Alternative =
Trees.Alternative(trees).withType(ctx.lub(trees map (_.tpe))).checked
def UnApply(fun: Tree, args: List[Tree])(implicit ctx: Context): UnApply = {
val owntype = fun.tpe.widen match {
case MethodType(_, paramType :: Nil) => paramType
case _ => check(false); ErrorType
}
Trees.UnApply(fun, args).withType(owntype).checked
}
def ValDef(sym: TermSymbol, rhs: Tree = EmptyTree)(implicit ctx: Context): ValDef =
Trees.ValDef(Modifiers(sym), sym.name, TypeTree(sym.info), rhs)(defPos(sym))
.withType(refType(sym)).checked
def DefDef(sym: TermSymbol, rhs: Tree = EmptyTree)(implicit ctx: Context): DefDef = {
val (tparams, mtp) = sym.info match {
case tp: PolyType =>
val tparams = ctx.newTypeParams(sym, tp.paramNames, EmptyFlags, tp.instantiateBounds)
(tparams, tp.instantiate(tparams map (_.typeConstructor)))
case tp => (Nil, tp)
}
def valueParamss(tp: Type): (List[List[TermSymbol]], Type) = tp match {
case tp @ MethodType(paramNames, paramTypes) =>
def valueParam(name: TermName, info: Type): TermSymbol =
ctx.newSymbol(sym, name, TermParam, info)
val params = (paramNames, paramTypes).zipped.map(valueParam)
val (paramss, rtp) = valueParamss(tp.instantiate(params map (_.typeConstructor)))
(params :: paramss, rtp)
case tp => (Nil, tp)
}
val (vparamss, rtp) = valueParamss(mtp)
Trees.DefDef(
Modifiers(sym), sym.name, tparams map TypeDef,
vparamss map (_ map (ValDef(_))), TypeTree(rtp), rhs)(defPos(sym))
.withType(refType(sym)).checked
}
def TypeDef(sym: TypeSymbol)(implicit ctx: Context): TypeDef =
Trees.TypeDef(Modifiers(sym), sym.name, TypeTree(sym.info))(defPos(sym))
.withType(refType(sym)).checked
def ClassDef(cls: ClassSymbol, typeParams: List[TypeSymbol], body: List[Tree])(implicit ctx: Context): ClassDef = {
val parents = cls.info.parents map (TypeTree(_))
val selfType =
if (cls.classInfo.optSelfType.exists) ValDef(ctx.newSelfSym(cls))
else EmptyValDef
def isOwnTypeParamAccessor(stat: Tree) =
(stat.symbol is TypeParam) && stat.symbol.owner == cls
val (tparamAccessors, rest) = body partition isOwnTypeParamAccessor
val tparams =
(typeParams map TypeDef) ++
(tparamAccessors collect {
case td: TypeDef if !(typeParams contains td.symbol) => td
})
val findLocalDummy = new FindLocalDummyAccumulator(cls)
val localDummy = ((NoSymbol: Symbol) /: body)(findLocalDummy)
.orElse(ctx.newLocalDummy(cls))
val impl = Trees.Template(parents, selfType, rest)
.withType(refType(localDummy)).checked
Trees.ClassDef(Modifiers(cls), cls.name, tparams, impl)(defPos(cls))
.withType(refType(cls)).checked
}
def Import(expr: Tree, selectors: List[Trees.UntypedTree])(implicit ctx: Context): Import =
Trees.Import(expr, selectors).withType(refType(ctx.newImportSymbol(Shared(expr)))).checked
def PackageDef(pid: RefTree, stats: List[Tree])(implicit ctx: Context): PackageDef =
Trees.PackageDef(pid, stats).withType(refType(pid.symbol)).checked
def Annotated(annot: Tree, arg: Tree)(implicit ctx: Context): Annotated =
Trees.Annotated(annot, arg).withType(AnnotatedType(Annotation(annot), arg.tpe)).checked
val EmptyTree: Tree = Trees.EmptyTree[Type]
val EmptyValDef: ValDef = Trees.EmptyValDef[Type]
def Shared(tree: Tree): Shared =
Trees.Shared(tree).withType(tree.tpe)
def refType(sym: Symbol)(implicit ctx: Context) = NamedType(sym.owner.thisType, sym)
// ------ Creating typed equivalents of trees that exist only in untyped form -------
/** A tree representing the same reference as the given type */
def ref(tp: NamedType)(implicit ctx: Context): tpd.NameTree =
if (tp.symbol.isStatic) Ident(tp)
else tp.prefix match {
case pre: TermRef => Select(ref(pre), tp)
case pre => SelectFromTypeTree(TypeTree(pre), tp)
} // no checks necessary
/** new C(args) */
def New(tp: Type, args: List[Tree])(implicit ctx: Context): Apply =
Apply(
Select(
New(tp),
TermRef(tp.normalizedPrefix, tp.typeSymbol.primaryConstructor.asTerm)),
args)
/** An object def
*
* object obs extends parents { decls }
*
* gets expanded to
*
* <module> lazy val obj = {
* class obj$ extends parents { this: obj.type => decls }
* new obj$
* }
*
* What's interesting here is that the block is well typed
* (because class obj$ is hoistable), but the type of the `obj` val is
* not expressible. What needs to happen in general when
* inferring the type of a val from its RHS, is: if the type contains
* a class that has the val itself as owner, then that class
* is remapped to have the val's owner as owner. Remapping could be
* done by cloning the class with the new owner and substituting
* everywhere in the tree. We know that remapping is safe
* because the only way a local class can appear in the RHS of a val is
* by being hoisted outside of a block, and the necessary checks are
* done at this point already.
*
* On the other hand, for method result type inference, if the type of
* the RHS of a method contains a class owned by the method, this would be
* an error.
*/
def ModuleDef(sym: TermSymbol, body: List[Tree])(implicit ctx: Context): ValDef = {
val modcls = sym.moduleClass.asClass
val clsdef = ClassDef(modcls, Nil, body)
val rhs = Block(List(clsdef), New(modcls.typeConstructor))
ValDef(sym, rhs)
}
/** A function def
*
* vparams => expr
*
* gets expanded to
*
* { def $anonfun(vparams) = expr; $anonfun: pt }
*
* where pt is the target type of the expression (FunctionN) unless
* otherwise specified.
*/
def Function(meth: TermSymbol, body: Tree, target: Type = NoType)(implicit ctx: Context): Block = {
val funtpe =
if (target.exists) target
else meth.info match {
case mt @ MethodType(_, formals) =>
assert(!mt.isDependent)
defn.FunctionType(formals, mt.resultType)
}
Block(
DefDef(meth, body) :: Nil,
Typed(Ident(TermRef(NoPrefix, meth)), TypeTree(funtpe)))
}
private class FindLocalDummyAccumulator(cls: ClassSymbol)(implicit ctx: Context) extends TreeAccumulator[Symbol] {
def apply(sym: Symbol, tree: Tree) =
if (sym.exists) sym
else if (tree.isDef) {
val owner = tree.symbol.owner
if (owner.isLocalDummy && owner.owner == cls) owner
else if (owner == cls) foldOver(sym, tree)
else sym
} else foldOver(sym, tree)
}
}
import Trees._
def check(p: Boolean)(implicit ctx: Context): Unit = assert(p)
def checkTypeArg(arg: tpd.Tree, bounds: TypeBounds)(implicit ctx: Context): Unit = {
check(arg.isValueType)
check(bounds contains arg.tpe)
}
def checkType(tree: tpd.Tree)(implicit ctx: Context): Unit = tree match {
case Ident(name) =>
case Select(qualifier, name) =>
check(qualifier.isValue)
check(qualifier.tpe =:= tree.tpe.normalizedPrefix)
val denot = qualifier.tpe.member(name)
check(denot.exists)
check(denot.hasAltWith(_.symbol == tree.symbol))
case This(cls) =>
case Super(qual, mixin) =>
check(qual.isValue)
val cls = qual.tpe.typeSymbol
check(cls.isClass)
case Apply(fn, args) =>
def checkArg(arg: tpd.Tree, name: Name, formal: Type): Unit = {
arg match {
case NamedArg(argName, _) =>
check(argName == name)
case SeqLiteral(_, _) =>
check(defn.RepeatedParamClasses contains formal.typeSymbol)
case _ =>
check(arg.isValue)
}
check(arg.tpe <:< formal)
}
val MethodType(paramNames, paramTypes) = fn.tpe.widen // checked already at construction
(args, paramNames, paramTypes).zipped foreach checkArg
case TypeApply(fn, args) =>
val pt @ PolyType(_) = fn.tpe.widen // checked already at construction
(args, pt.instantiateBounds(args map (_.tpe))).zipped foreach checkTypeArg
case Literal(const: Constant) =>
case New(tpt) =>
check(tpt.isValueType)
val cls = tpt.tpe.typeSymbol
check(cls.isClass)
check(!(cls is AbstractOrTrait))
case Pair(left, right) =>
check(left.isValue)
check(right.isValue)
case Typed(expr, tpt) =>
check(tpt.isValueType)
expr.tpe.widen match {
case tp: MethodType =>
val cls = tpt.tpe.typeSymbol
check(cls.isClass)
check((cls is Trait) ||
cls.primaryConstructor.info.paramTypess.flatten.isEmpty)
val absMembers = tpt.tpe.abstractTermMembers
check(absMembers.size == 1)
check(tp <:< absMembers.head.info)
case _ =>
check(expr.isValueOrPattern)
check(expr.tpe <:< tpt.tpe)
}
case NamedArg(name, arg) =>
case Assign(lhs, rhs) =>
check(lhs.isValue); check(rhs.isValue)
lhs.tpe match {
case ltpe: TermRef =>
check(ltpe.symbol is Mutable)
case _ =>
check(false)
}
check(rhs.tpe <:< lhs.tpe.widen)
case Block(stats, expr) =>
var hoisted: Set[Symbol] = Set()
lazy val locals = localSyms(stats).toSet
check(expr.isValue)
def isNonLocal(sym: Symbol): Boolean =
!(locals contains sym) || isHoistableClass(sym)
def isHoistableClass(sym: Symbol) =
sym.isClass && {
(hoisted contains sym) || {
hoisted += sym
noLeaksInClass(sym.asClass)
}
}
def noLeaksIn(tp: Type): Boolean = tp forall {
case tp: NamedType => isNonLocal(tp.symbol)
case _ => true
}
def noLeaksInClass(sym: ClassSymbol): Boolean =
(sym.classInfo.parents forall noLeaksIn) &&
(sym.classInfo.decls.toList forall (t => noLeaksIn(t.info)))
check(noLeaksIn(tree.tpe))
case If(cond, thenp, elsep) =>
check(cond.isValue); check(thenp.isValue); check(elsep.isValue)
check(cond.tpe <:< defn.BooleanType)
case Match(selector, cases) =>
check(selector.isValue)
// are any checks that relate selector and patterns desirable?
case CaseDef(pat, guard, body) =>
check(pat.isValueOrPattern); check(guard.isValue); check(body.isValue)
check(guard.tpe <:< defn.BooleanType)
case Return(expr, from) =>
check(expr.isValue); check(from.isTerm)
check(from.tpe.termSymbol.isSourceMethod)
case Try(block, catches, finalizer) =>
for (ctch <- catches)
check(ctch.pat.tpe <:< defn.ThrowableType)
case Throw(expr) =>
check(expr.isValue)
check(expr.tpe <:< defn.ThrowableType)
case SeqLiteral(elemtpt, elems) =>
check(elemtpt.isValueType);
for (elem <- elems) {
check(elem.isValue)
check(elem.tpe <:< elemtpt.tpe)
}
case TypeTree(original) =>
if (!original.isEmpty) {
check(original.isValueType)
check(original.tpe == tree.tpe)
}
case SingletonTypeTree(ref) =>
check(ref.isValue)
check(ref.symbol.isStable)
case SelectFromTypeTree(qualifier, name) =>
check(qualifier.isValueType)
check(qualifier.tpe =:= tree.tpe.normalizedPrefix)
val denot = qualifier.tpe.member(name)
check(denot.exists)
check(denot.symbol == tree.symbol)
case AndTypeTree(left, right) =>
check(left.isValueType); check(right.isValueType)
case OrTypeTree(left, right) =>
check(left.isValueType); check(right.isValueType)
case RefineTypeTree(tpt, refinements) =>
check(tpt.isValueType)
def checkRefinements(forbidden: Set[Symbol], rs: List[tpd.DefTree]): Unit = rs match {
case r :: rs1 =>
val rsym = r.symbol
check(rsym.isTerm || rsym.isAbstractOrAliasType)
if (rsym.isAbstractType) check(tpt.tpe.member(rsym.name).exists)
check(rsym.info forall {
case nt: NamedType => !(forbidden contains nt.symbol)
case _ => true
})
checkRefinements(forbidden - rsym, rs1)
case nil =>
}
checkRefinements(localSyms(refinements).toSet, refinements)
case AppliedTypeTree(tpt, args) =>
check(tpt.isValueType)
val tparams = tpt.tpe.typeParams
check(sameLength(tparams, args))
(args, tparams map (_.info.bounds)).zipped foreach checkTypeArg
case TypeBoundsTree(lo, hi) =>
check(lo.isValueType); check(hi.isValueType)
check(lo.tpe <:< hi.tpe)
case Bind(sym, body) =>
check(body.isValueOrPattern)
check(!(tree.symbol is Method))
body match {
case Ident(nme.WILDCARD) =>
case _ => check(body.tpe.widen =:= tree.symbol.info)
}
case Alternative(alts) =>
for (alt <- alts) check(alt.isValueOrPattern)
case UnApply(fun, args) =>
check(fun.isTerm)
for (arg <- args) check(arg.isValueOrPattern)
val funtpe @ MethodType(_, _) = fun.tpe.widen
fun.symbol.name match { // check arg arity
case nme.unapplySeq =>
// args need to be wrapped in (...: _*)
check(args.length == 1)
check(args.head.tpe.typeSymbol == defn.RepeatedParamClass)
case nme.unapply =>
val rtp = funtpe.resultType
if (rtp == defn.BooleanType)
check(args.isEmpty)
else {
val (tycon, resArgs) = rtp.splitArgs
check(tycon == defn.OptionType)
check(resArgs.length == 1)
val normArgs = {
val (tp1, args1) = resArgs.head.splitArgs
if (defn.TupleClasses contains tp1.typeSymbol) args1
else args.head :: Nil
}
check(sameLength(normArgs, args))
}
}
case ValDef(mods, name, tpt, rhs) =>
check(!(tree.symbol is Method))
if (!rhs.isEmpty) {
check(rhs.isValue)
check(rhs.tpe <:< tpt.tpe)
}
case DefDef(mods, name, tparams, vparamss, tpt, rhs) =>
check(tree.symbol is Method)
if (!rhs.isEmpty) {
check(rhs.isValue)
check(rhs.tpe <:< tpt.tpe)
}
case TypeDef(mods, name, tpt) =>
check(tpt.tpe.isInstanceOf[TypeBounds])
case Template(parents, selfType, body) =>
case ClassDef(mods, name, tparams, impl) =>
case Import(expr, selectors) =>
check(expr.isValue)
check(expr.tpe.termSymbol.isStable)
case PackageDef(pid, stats) =>
check(pid.isTerm)
check(pid.symbol.isPackage)
case Annotated(annot, arg) =>
check(annot.isInstantiation)
check(annot.symbol.owner.isSubClass(defn.AnnotationClass))
check(arg.isValueType || arg.isValue)
case tpd.EmptyTree =>
case Shared(shared) =>
check(shared.isType || shared.isTerm)
}
implicit class TreeOps[ThisTree <: tpd.Tree](val tree: ThisTree) extends AnyVal {
def isValue(implicit ctx: Context): Boolean =
tree.isTerm && tree.tpe.widen.isValueType
def isValueOrPattern(implicit ctx: Context) =
tree.isValue || tree.isPattern
def isValueType: Boolean =
tree.isType && tree.tpe.isValueType
def isInstantiation: Boolean = tree match {
case Apply(Select(New(_), nme.CONSTRUCTOR), _) => true
case _ => false
}
def checked(implicit ctx: Context): ThisTree = {
if (ctx.settings.YcheckTypedTrees.value) checkType(tree)
tree
}
def shallowFold[T](z: T)(op: (T, tpd.Tree) => T) =
new ShallowFolder(op).apply(z, tree)
def deepFold[T](z: T)(op: (T, tpd.Tree) => T) =
new DeepFolder(op).apply(z, tree)
def subst(from: List[Symbol], to: List[Symbol])(implicit ctx: Context): ThisTree =
new TreeMapper(typeMap = new ctx.SubstSymMap(from, to)).apply(tree)
def changeOwner(from: Symbol, to: Symbol)(implicit ctx: Context): ThisTree =
new TreeMapper(ownerMap = (sym => if (sym == from) to else sym)).apply(tree)
}
class TreeMapper(typeMap: TypeMap = IdentityTypeMap, ownerMap: Symbol => Symbol = identity)(implicit ctx: Context) extends TreeTransformer[Type, Unit] {
override def transform(tree: tpd.Tree, c: Unit): tpd.Tree = {
val tree1 = tree.withType(typeMap(tree.tpe))
val tree2 = tree1 match {
case bind: tpd.Bind =>
val sym = bind.symbol
val newOwner = ownerMap(sym.owner)
val newInfo = typeMap(sym.info)
if ((newOwner ne sym.owner) || (newInfo ne sym.info))
bind.withType(tpd.refType(sym.copy(owner = newOwner, info = newInfo)))
else
tree1
case _ =>
tree1
}
super.transform(tree2, c)
}
override def transform(trees: List[tpd.Tree], c: Unit) = {
val locals = localSyms(trees)
val mapped = ctx.mapSymbols(locals, typeMap, ownerMap)
if (locals eq mapped)
super.transform(trees, c)
else
new TreeMapper(
typeMap andThen ((tp: Type) => tp.substSym(locals, mapped)),
ownerMap andThen (locals zip mapped).toMap).transform(trees, c)
}
def apply[ThisTree <: tpd.Tree](tree: ThisTree): ThisTree = transform(tree, ()).asInstanceOf[ThisTree]
def apply(annot: Annotation): Annotation = {
val tree1 = apply(annot.tree)
if (tree1 eq annot.tree) annot else ConcreteAnnotation(tree1)
}
}
// ensure that constructors are fully applied?
// ensure that normal methods are fully applied?
def localSyms(stats: List[tpd.Tree])(implicit ctx: Context): List[Symbol] =
for (stat <- stats if (stat.isDef)) yield stat.symbol
}
|