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
|
/* NSC -- new Scala compiler
* Copyright 2005-2006 LAMP/EPFL
* @author Martin Odersky
*/
// $Id$
package scala.tools.nsc.ast
import symtab.Flags._
import util.{Set, HashSet}
/** This class ...
*
* @author Martin Odersky
* @version 1.0
*/
abstract class TreeInfo {
val global: Global
import global._
def isTerm(tree: Tree): boolean = tree.isTerm
def isType(tree: Tree): boolean = tree.isType
def isOwnerDefinition(tree: Tree): boolean = tree match {
case PackageDef(_, _)
| ClassDef(_, _, _, _, _)
| ModuleDef(_, _, _)
| DefDef(_, _, _, _, _, _)
| Import(_, _) => true
case _ => false
}
def isDefinition(tree: Tree): boolean = tree.isDef
def isDeclaration(tree: Tree): boolean = tree match {
case DefDef(_, _, _, _, _, EmptyTree)
| ValDef(_, _, _, EmptyTree)
| AbsTypeDef(_, _, _, _)
| AliasTypeDef(_, _, _, _) => true
case _ => false
}
/** Is tree legal as a member definition of an interface?
*/
def isInterfaceMember(tree: Tree): boolean = tree match {
case EmptyTree => true
case Import(_, _) => true
case AbsTypeDef(_, _, _, _) => true
case AliasTypeDef(_, _, _, _) => true
case DefDef(mods, _, _, _, _, __) => mods.hasFlag(DEFERRED)
case ValDef(mods, _, _, _) => mods.hasFlag(DEFERRED)
case DocDef(_, definition) => isInterfaceMember(definition)
case _ => false
}
/** Is tree a pure (i.e. non-side-effecting) definition?
*/
def isPureDef(tree: Tree): boolean = tree match {
case EmptyTree
| ClassDef(_, _, _, _, _)
| AbsTypeDef(_, _, _, _)
| AliasTypeDef(_, _, _, _)
| Import(_, _)
| DefDef(_, _, _, _, _, _) =>
true
case ValDef(mods, _, _, rhs) =>
!mods.hasFlag(MUTABLE) && isPureExpr(rhs)
case DocDef(_, definition) =>
isPureDef(definition)
case _ =>
false
}
/** Is tree a stable and pure expression?
*/
def isPureExpr(tree: Tree): boolean = tree match {
case EmptyTree
| This(_)
| Super(_, _)
| Literal(_) =>
true
case Ident(_) =>
tree.symbol.isStable
case Select(qual, _) =>
tree.symbol.isStable && isPureExpr(qual)
case TypeApply(fn, _) =>
isPureExpr(fn)
case Apply(fn, List()) =>
isPureExpr(fn)
case Typed(expr, _) =>
isPureExpr(expr)
case Block(stats, expr) =>
(stats forall isPureDef) && isPureExpr(expr)
case _ =>
false
}
def mayBeVarGetter(sym: Symbol) = sym.info match {
case PolyType(List(), _) => sym.owner.isClass && !sym.isStable
case _: ImplicitMethodType => sym.owner.isClass && !sym.isStable
case _ => false
}
def isVariableOrGetter(tree: Tree) = tree match {
case Ident(_) =>
tree.symbol.isVariable
case Select(qual, _) =>
tree.symbol.isVariable ||
(mayBeVarGetter(tree.symbol) &&
tree.symbol.owner.info.decl(nme.getterToSetter(tree.symbol.name)) != NoSymbol)
case Apply(Select(qual, nme.apply), _) =>
qual.tpe.decl(nme.update) != NoSymbol
case _ =>
false
}
/** Is tree a self constructor call?
*/
def isSelfConstrCall(tree: Tree): boolean = tree match {
case Ident(nme.CONSTRUCTOR) =>
true
case TypeApply(constr, _) =>
isSelfConstrCall(constr)
case Apply(constr, _) =>
isSelfConstrCall(constr)
case _ =>
false
}
def isSuperConstrCall(tree: Tree): boolean = tree match {
case Select(Super(_, _), nme.CONSTRUCTOR) =>
true
case TypeApply(constr, _) =>
isSuperConstrCall(constr)
case Apply(constr, _) =>
isSuperConstrCall(constr)
case _ =>
false
}
/** Is tree a variable pattern */
def isVarPattern(pat: Tree): boolean = pat match {
case Ident(name) => isVariableName(name) && !pat.isInstanceOf[BackQuotedIdent]
case _ => false
}
/** The first constructor definitions in `stats' */
def firstConstructor(stats: List[Tree]): Tree = stats match {
case List() => EmptyTree
case (constr @ DefDef(_, nme.CONSTRUCTOR, _, _, _, _)) :: _ => constr
case _ :: stats1 => firstConstructor(stats1)
}
/*
/** The super call that calls mixin `mix' in stats */
def superCall(stats: List[Tree], mix: Name): Tree = stats match {
case scall @ Apply(Select(Super(_, mix1), name), List()) :: _
if ((name == nme.CONSTRUCTOR || name == nme.MIXIN_CONSTRUCTOR) && mix1 == mix) =>
scall
case _ :: stats1 =>
superCall(stats1, name)
case _ =>
assert(false, "no supercall to " + mix + " in " + stats)
}
*/
/** Is name a left-associative operator? */
def isLeftAssoc(operator: Name): boolean =
operator.length > 0 && operator(operator.length - 1) != ':';
private val reserved = new HashSet[Name]
reserved addEntry nme.false_
reserved addEntry nme.true_
reserved addEntry nme.null_
reserved addEntry newTypeName("byte")
reserved addEntry newTypeName("char")
reserved addEntry newTypeName("short")
reserved addEntry newTypeName("int")
reserved addEntry newTypeName("long")
reserved addEntry newTypeName("float")
reserved addEntry newTypeName("double")
reserved addEntry newTypeName("boolean")
reserved addEntry newTypeName("unit")
/** Is name a variable name? */
def isVariableName(name: Name): boolean = {
val first = name(0)
(('a' <= first && first <= 'z') || first == '_') && !(reserved contains name)
}
/** Is tree a this node which belongs to `enclClass'? */
def isSelf(tree: Tree, enclClass: Symbol): boolean = tree match {
case This(_) => tree.symbol == enclClass
case _ => false
}
/** can this type be a type pattern */
def mayBeTypePat(tree: Tree): boolean = tree match {
case CompoundTypeTree(Template(tps, List())) => tps exists mayBeTypePat
case Annotated(_, tp) => mayBeTypePat(tp)
case AppliedTypeTree(constr, args) => mayBeTypePat(constr) || args.exists(.isInstanceOf[Bind])
case SelectFromTypeTree(tp, _) => mayBeTypePat(tp)
case _ => false
}
/** Is this pattern node a catch-all (wildcard or variable) pattern? */
def isDefaultCase(cdef: CaseDef) = cdef match {
case CaseDef(Ident(nme.WILDCARD), EmptyTree, _) => true
case CaseDef(Bind(_, Ident(nme.WILDCARD)), EmptyTree, _) => true
case _ => false
}
/** Is this pattern node a catch-all or type-test pattern? */
def isCatchCase(cdef: CaseDef) = cdef match {
case CaseDef(Typed(Ident(nme.WILDCARD), tpt), EmptyTree, _) => isSimple(tpt.tpe)
case CaseDef(Bind(_, Typed(Ident(nme.WILDCARD), tpt)), EmptyTree, _) => isSimple(tpt.tpe)
case _ => isDefaultCase(cdef)
}
private def isSimple(tp: Type): boolean = true
/* If we have run-time types, and these are used for pattern matching,
we should replace this by something like:
tp match {
case TypeRef(pre, sym, args) =>
args.isEmpty && (sym.owner.isPackageClass || isSimple(pre))
case NoPrefix =>
true
case _ =>
false
}
*/
/** Is this pattern node a sequence-valued pattern? */
def isSequenceValued(tree: Tree): boolean = tree match {
case Bind(_, body) => isSequenceValued(body)
case Sequence(_) => true
case ArrayValue(_, _) => true
case Star(_) => true
case Alternative(ts) => ts exists isSequenceValued
case _ => false
}
/** is this pattern of the form S(...) where S is a subclass of Seq
* and S is not a case class? The pattern might be wrapped in binds or alternatives.
*/
def isSequencePattern(tree: Tree): boolean = tree match {
case Apply(fn, _) =>
(fn.symbol ne null) &&
!fn.symbol.hasFlag(CASE) &&
fn.symbol.isNonBottomSubClass(definitions.SeqClass)
case Bind(name, body) =>
isSequencePattern(body)
case Alternative(ts) =>
ts forall isSequencePattern
case _ =>
false
}
/** The method part of an application node
*/
def methPart(tree: Tree): Tree = tree match {
case Apply(fn, _) => methPart(fn)
case TypeApply(fn, _) => methPart(fn)
case AppliedTypeTree(fn, _) => methPart(fn)
case _ => tree
}
/** Top-level definition sequence contains a leading import of Predef or scala.Predef
*/
def containsLeadingPredefImport(defs: List[Tree]): boolean = defs match {
case List(PackageDef(_, defs1)) =>
containsLeadingPredefImport(defs1)
case Import(Ident(nme.Predef), _) :: _ =>
true
case Import(Select(Ident(nme.scala_), nme.Predef), _) :: _ =>
true
case Import(_, _) :: defs1 =>
containsLeadingPredefImport(defs1)
case _ =>
false
}
}
|