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
|
/* NSC -- new Scala compiler
* Copyright 2005-2009 LAMP/EPFL
* @author Martin Odersky
*/
// $Id$
package scala.tools.nsc.backend.icode.analysis
import scala.collection.{mutable, immutable}
/** A data-flow analysis on types, that works on <code>ICode</code>.
*
* @author Iulian Dragos
*/
abstract class TypeFlowAnalysis {
val global: Global
import global._
/** The lattice of ICode types.
*/
object typeLattice extends CompleteLattice {
type Elem = icodes.TypeKind
val Object = icodes.REFERENCE(global.definitions.ObjectClass)
val All = icodes.REFERENCE(global.definitions.NothingClass)
def top = Object
def bottom = All
def lub2(a: Elem, b: Elem) =
if (a eq bottom) b
else if (b eq bottom) a
else icodes.lub(a, b)
}
/** The lattice of type stacks. It is a straight forward extension of
* the type lattice (lub is pairwise lub of the list elements).
*/
object typeStackLattice extends CompleteLattice {
import icodes._
type Elem = TypeStack
override val top = new TypeStack
override val bottom = new TypeStack
val exceptionHandlerStack: TypeStack = new TypeStack(List(REFERENCE(definitions.AnyRefClass)))
def lub2(s1: TypeStack, s2: TypeStack) = {
if (s1 eq bottom) s2
else if (s2 eq bottom) s1
else if (s1 eq exceptionHandlerStack) s1
else if (s2 eq exceptionHandlerStack) s2
else {
// if (s1.length != s2.length)
// throw new CheckerError("Incompatible stacks: " + s1 + " and " + s2);
new TypeStack(List.map2(s1.types, s2.types) (icodes.lub))
}
}
}
/** A map which returns the bottom type for unfound elements */
class VarBinding extends mutable.HashMap[icodes.Local, icodes.TypeKind] {
override def get(l: icodes.Local) = super.get(l) match {
case Some(t) => Some(t)
case None => Some(typeLattice.bottom)
}
def this(o: VarBinding) = {
this()
this ++= o
}
}
/** The type flow lattice contains a binding from local variable
* names to types and a type stack.
*/
object typeFlowLattice extends CompleteLattice {
import icodes._
type Elem = IState[VarBinding, icodes.TypeStack]
override val top = new Elem(new VarBinding, typeStackLattice.top)
override val bottom = new Elem(new VarBinding, typeStackLattice.bottom)
def lub2(a: Elem, b: Elem) = {
val IState(env1, s1) = a
val IState(env2, s2) = b
val resultingLocals = new VarBinding
for (binding1 <- env1.iterator) {
val tp2 = env2(binding1._1)
resultingLocals += ((binding1._1, typeLattice.lub2(binding1._2, tp2)))
}
for (binding2 <- env2.iterator if resultingLocals(binding2._1) eq typeLattice.bottom) {
val tp1 = env1(binding2._1)
resultingLocals += ((binding2._1, typeLattice.lub2(binding2._2, tp1)))
}
IState(resultingLocals, typeStackLattice.lub2(a.stack, b.stack))
}
}
val timer = new Timer
class MethodTFA extends DataFlowAnalysis[typeFlowLattice.type] {
import icodes._
import icodes.opcodes._
type P = BasicBlock
val lattice = typeFlowLattice
val STRING = icodes.REFERENCE(TypeFlowAnalysis.this.global.definitions.StringClass)
var method: IMethod = _
/** Initialize the in/out maps for the analysis of the given method. */
def init(m: icodes.IMethod) {
this.method = m
init {
worklist += m.code.startBlock
worklist ++= (m.exh map (_.startBlock))
m.code.blocks.foreach { b =>
in(b) = typeFlowLattice.bottom
out(b) = typeFlowLattice.bottom
}
m.exh foreach { e =>
in(e.startBlock) = lattice.IState(in(e.startBlock).vars, typeStackLattice.exceptionHandlerStack)
}
}
}
/** reinitialize the analysis, keeping around solutions from a previous run. */
def reinit(m: icodes.IMethod) {
if ((this.method eq null) || (this.method.symbol != m.symbol))
init(m)
else reinit {
for (b <- m.code.blocks; if !in.isDefinedAt(b)) {
for (p <- b.predecessors) {
if (out.isDefinedAt(p)) {
in(b) = out(p)
worklist += p
}
/* else
in(b) = typeFlowLattice.bottom
*/ }
out(b) = typeFlowLattice.bottom
}
for (exh <- m.exh; if !in.isDefinedAt(exh.startBlock)) {
worklist += exh.startBlock
in(exh.startBlock) = lattice.IState(in(exh.startBlock).vars, typeStackLattice.exceptionHandlerStack)
}
}
}
def this(m: icodes.IMethod) {
this()
init(m)
}
def run = {
timer.start
forwardAnalysis(blockTransfer)
timer.stop
if (settings.debug.value) {
linearizer.linearize(method).foreach(b => if (b != method.code.startBlock)
assert(visited.contains(b),
"Block " + b + " in " + this.method + " has input equal to bottom -- not visited? .." + visited));
}
//println("iterations: " + iterations + " for " + method.code.blocks.size)
}
def blockTransfer(b: BasicBlock, in: lattice.Elem): lattice.Elem = {
b.foldLeft(in)(interpret)
}
/** The flow function of a given basic block. */
var flowFun: immutable.Map[BasicBlock, TransferFunction] = new immutable.HashMap
/** Fill flowFun with a transfer function per basic block. */
/* private def buildFlowFunctions(blocks: List[BasicBlock]) {
def transfer(b: BasicBlock): TransferFunction = {
var gens: List[Gen] = Nil
var consumed: Int = 0
val stack = new SimulatedStack
for (instr <- b) instr match {
case THIS(clasz) =>
stack push toTypeKind(clasz.tpe)
case CONSTANT(const) =>
stack push toTypeKind(const.tpe)
case LOAD_ARRAY_ITEM(kind) =>
stack.pop2
stack.push(kind)
case LOAD_LOCAL(local) =>
val t = bindings(local)
stack push (if (t == typeLattice.bottom) local.kind else t)
case LOAD_FIELD(field, isStatic) =>
if (!isStatic)
stack.pop
stack push toTypeKind(field.tpe)
case LOAD_MODULE(module) =>
stack push toTypeKind(module.tpe)
case STORE_ARRAY_ITEM(kind) =>
stack.pop3
case STORE_LOCAL(local) =>
val t = stack.pop
bindings += (local -> t)
case STORE_THIS(_) =>
stack.pop
case STORE_FIELD(field, isStatic) =>
if (isStatic)
stack.pop
else
stack.pop2
case CALL_PRIMITIVE(primitive) =>
primitive match {
case Negation(kind) =>
stack.pop; stack.push(kind)
case Test(_, kind, zero) =>
stack.pop
if (!zero) stack.pop
stack push BOOL;
case Comparison(_, _) =>
stack.pop2
stack push INT
case Arithmetic(op, kind) =>
stack.pop
if (op != NOT)
stack.pop
val k = kind match {
case BYTE | SHORT | CHAR => INT
case _ => kind
}
stack push k
case Logical(op, kind) =>
stack.pop2
stack push kind
case Shift(op, kind) =>
stack.pop2
stack push kind
case Conversion(src, dst) =>
stack.pop
stack push dst
case ArrayLength(kind) =>
stack.pop
stack push INT
case StartConcat =>
stack.push(ConcatClass)
case EndConcat =>
stack.pop
stack.push(STRING)
case StringConcat(el) =>
stack.pop2
stack push ConcatClass
}
case CALL_METHOD(method, style) => style match {
case Dynamic =>
stack.pop(1 + method.info.paramTypes.length)
stack.push(toTypeKind(method.info.resultType))
case Static(onInstance) =>
if (onInstance) {
stack.pop(1 + method.info.paramTypes.length)
if (!method.isConstructor)
stack.push(toTypeKind(method.info.resultType));
} else {
stack.pop(method.info.paramTypes.length)
stack.push(toTypeKind(method.info.resultType))
}
case SuperCall(mix) =>
stack.pop(1 + method.info.paramTypes.length)
stack.push(toTypeKind(method.info.resultType))
}
case BOX(kind) =>
stack.pop
stack.push(BOXED(kind))
case UNBOX(kind) =>
stack.pop
stack.push(kind)
case NEW(kind) =>
stack.push(kind)
case CREATE_ARRAY(elem, dims) =>
stack.pop(dims)
stack.push(ARRAY(elem))
case IS_INSTANCE(tpe) =>
stack.pop
stack.push(BOOL)
case CHECK_CAST(tpe) =>
stack.pop
stack.push(tpe)
case SWITCH(tags, labels) =>
stack.pop
case JUMP(whereto) =>
()
case CJUMP(success, failure, cond, kind) =>
stack.pop2
case CZJUMP(success, failure, cond, kind) =>
stack.pop
case RETURN(kind) =>
if (kind != UNIT)
stack.pop;
case THROW() =>
stack.pop
case DROP(kind) =>
stack.pop
case DUP(kind) =>
stack.push(stack.head)
case MONITOR_ENTER() =>
stack.pop
case MONITOR_EXIT() =>
stack.pop
case SCOPE_ENTER(_) | SCOPE_EXIT(_) =>
()
case LOAD_EXCEPTION() =>
stack.pop(stack.length)
stack.push(typeLattice.Object)
case _ =>
dump
abort("Unknown instruction: " + i)
}
new TransferFunction(consumed, gens)
}
for (b <- blocks) {
flowFun = flowFun + (b -> transfer(b))
}
}
*/
/** Abstract interpretation for one instruction. */
def interpret(in: typeFlowLattice.Elem, i: Instruction): typeFlowLattice.Elem = {
val out = lattice.IState(new VarBinding(in.vars), new TypeStack(in.stack))
val bindings = out.vars
val stack = out.stack
// if (settings.debug.value) {
// Console.println("Stack: " + stack);
// Console.println(i);
// }
i match {
case THIS(clasz) =>
stack push toTypeKind(clasz.tpe)
case CONSTANT(const) =>
stack push toTypeKind(const.tpe)
case LOAD_ARRAY_ITEM(kind) =>
stack.pop2 match {
case (idxKind, ARRAY(elem)) =>
assert(idxKind == INT || idxKind == CHAR || idxKind == SHORT || idxKind == BYTE)
stack.push(elem)
case (_, _) =>
stack.push(kind)
}
case LOAD_LOCAL(local) =>
val t = bindings(local)
stack push (if (t == typeLattice.bottom) local.kind else t)
case LOAD_FIELD(field, isStatic) =>
if (!isStatic)
stack.pop
stack push toTypeKind(field.tpe)
case LOAD_MODULE(module) =>
stack push toTypeKind(module.tpe)
case STORE_ARRAY_ITEM(kind) =>
stack.pop3
case STORE_LOCAL(local) =>
val t = stack.pop
bindings += (local -> t)
case STORE_THIS(_) =>
stack.pop
case STORE_FIELD(field, isStatic) =>
if (isStatic)
stack.pop
else
stack.pop2
case CALL_PRIMITIVE(primitive) =>
primitive match {
case Negation(kind) =>
stack.pop; stack.push(kind)
case Test(_, kind, zero) =>
stack.pop
if (!zero) stack.pop
stack push BOOL;
case Comparison(_, _) =>
stack.pop2
stack push INT
case Arithmetic(op, kind) =>
stack.pop
if (op != NOT)
stack.pop
val k = kind match {
case BYTE | SHORT | CHAR => INT
case _ => kind
}
stack push k
case Logical(op, kind) =>
stack.pop2
stack push kind
case Shift(op, kind) =>
stack.pop2
stack push kind
case Conversion(src, dst) =>
stack.pop
stack push dst
case ArrayLength(kind) =>
stack.pop
stack push INT
case StartConcat =>
stack.push(ConcatClass)
case EndConcat =>
stack.pop
stack.push(STRING)
case StringConcat(el) =>
stack.pop2
stack push ConcatClass
}
case CALL_METHOD(method, style) => style match {
case Dynamic | InvokeDynamic =>
stack.pop(1 + method.info.paramTypes.length)
stack.push(toTypeKind(method.info.resultType))
case Static(onInstance) =>
if (onInstance) {
stack.pop(1 + method.info.paramTypes.length)
if (!method.isConstructor)
stack.push(toTypeKind(method.info.resultType));
} else {
stack.pop(method.info.paramTypes.length)
stack.push(toTypeKind(method.info.resultType))
}
case SuperCall(mix) =>
stack.pop(1 + method.info.paramTypes.length)
stack.push(toTypeKind(method.info.resultType))
}
case BOX(kind) =>
stack.pop
stack.push(BOXED(kind))
case UNBOX(kind) =>
stack.pop
stack.push(kind)
case NEW(kind) =>
stack.push(kind)
case CREATE_ARRAY(elem, dims) =>
stack.pop(dims)
stack.push(ARRAY(elem))
case IS_INSTANCE(tpe) =>
stack.pop
stack.push(BOOL)
case CHECK_CAST(tpe) =>
stack.pop
stack.push(tpe)
case SWITCH(tags, labels) =>
stack.pop
case JUMP(whereto) =>
()
case CJUMP(success, failure, cond, kind) =>
stack.pop2
case CZJUMP(success, failure, cond, kind) =>
stack.pop
case RETURN(kind) =>
if (kind != UNIT)
stack.pop;
case THROW() =>
stack.pop
case DROP(kind) =>
stack.pop
case DUP(kind) =>
stack.push(stack.head)
case MONITOR_ENTER() =>
stack.pop
case MONITOR_EXIT() =>
stack.pop
case SCOPE_ENTER(_) | SCOPE_EXIT(_) =>
()
case LOAD_EXCEPTION() =>
stack.pop(stack.length)
stack.push(typeLattice.Object)
case _ =>
dump
abort("Unknown instruction: " + i)
}
out
} // interpret
class SimulatedStack {
private var types: List[InferredType] = Nil
private var depth = 0
/** Remove and return the topmost element on the stack. If the
* stack is empty, return a reference to a negative index on the
* stack, meaning it refers to elements pushed by a predecessor block.
*/
def pop: InferredType = types match {
case head :: rest =>
types = rest
head
case _ =>
depth -= 1
TypeOfStackPos(depth)
}
def pop2: (InferredType, InferredType) = {
(pop, pop)
}
def push(t: InferredType) {
depth += 1
types = types ::: List(t)
}
def push(k: TypeKind) { push(Const(k)) }
}
abstract class InferredType {
/** Return the type kind pointed by this inferred type. */
def getKind(in: lattice.Elem): icodes.TypeKind = this match {
case Const(k) =>
k
case TypeOfVar(l: icodes.Local) =>
if (in.vars.isDefinedAt(l)) in.vars(l) else l.kind
case TypeOfStackPos(n: Int) =>
assert(in.stack.length >= n)
in.stack(n)
}
}
/** A type that does not depend on input to the transfer function. */
case class Const(t: icodes.TypeKind) extends InferredType
/** The type of a given local variable. */
case class TypeOfVar(l: icodes.Local) extends InferredType
/** The type found at a stack position. */
case class TypeOfStackPos(n: Int) extends InferredType
abstract class Gen
case class Bind(l: icodes.Local, t: InferredType) extends Gen
case class Push(t: InferredType) extends Gen
/** A flow transfer function of a basic block. */
class TransferFunction(consumed: Int, gens: List[Gen]) extends (lattice.Elem => lattice.Elem) {
def apply(in: lattice.Elem): lattice.Elem = {
val out = lattice.IState(new VarBinding(in.vars), new TypeStack(in.stack))
val bindings = out.vars
val stack = out.stack
out.stack.pop(consumed)
for (g <- gens) g match {
case Bind(l, t) =>
out.vars += (l -> t.getKind(in))
case Push(t) =>
stack.push(t.getKind(in))
}
out
}
}
}
class Timer {
var millis = 0L
private var lastStart = 0L
def reset {
millis = 0L
}
def start {
lastStart = System.currentTimeMillis
}
/** Stop the timer and return the number of milliseconds since the last
* call to start. The 'millis' field is increased by the elapsed time.
*/
def stop: Long = {
val elapsed = System.currentTimeMillis - lastStart
millis += elapsed
elapsed
}
}
}
|