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
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
|
/* NSC -- new Scala compiler
* Copyright 2005-2007 LAMP/EPFL
* @author Burak Emir
*/
// $Id$
package scala.tools.nsc.matching
import scala.tools.nsc.util.Position
import collection.mutable.ListBuffer
/** Translation of Match Expressions
*
* `p': pattern
* `bx': body index
*
* internal representation is (temp:List[Symbol], row:List[Row])
*
* tmp1 tmp_n
* Row( p_11 ... p_1n g_1 b_1 ) + subst
*
* Row( p_m1 ... p_mn g_m b_m ) + subst
*
* @author Burak Emir
*/
trait ParallelMatching {
self: transform.ExplicitOuter with PatternMatchers with PatternNodes with CodeFactory =>
import global._
import typer.typed
import symtab.Flags
/** here, we distinguish which rewrite rule to apply
* @pre column does not contain alternatives (ensured by initRep)
*/
def MixtureRule(scrutinee:Symbol, column:List[Tree], rest:Rep)(implicit rep:RepFactory): RuleApplication = {
def isSimpleSwitch: Boolean = {
(isSameType(scrutinee.tpe.widen, definitions.IntClass.tpe)||
isSameType(scrutinee.tpe.widen, definitions.CharClass.tpe)) && {
var xs = column; while(!xs.isEmpty) { // forall
val h = xs.head
if(strip2(h).isInstanceOf[Literal] || isDefaultPattern(h)) { xs = xs.tail } else return false
}
return true
}}
// an unapply for which we don't need a type test
def isUnapplyHead(): Boolean = column.head match {
case __UnApply(_,argtpe,_) => scrutinee.tpe <:< argtpe
case _ => false
}
// true if pattern type is direct subtype of scrutinee (can't use just <:< cause have to take variance into account)
def directSubtype(ptpe:Type) =
(ptpe.parents.exists { x => ((x.typeSymbol eq scrutinee.tpe.typeSymbol) && (x <:< scrutinee.tpe))});
// true if each pattern type is case and direct subtype of scrutinee
def isFlatCases(col:List[Tree]): Boolean = (col eq Nil) || {
strip2(col.head) match {
case a @ Apply(fn,_) =>
isCaseClass(a.tpe) && directSubtype( a.tpe ) && isFlatCases(col.tail)
case t @ Typed(_,tpt) =>
isCaseClass(tpt.tpe) && directSubtype( t.tpe ) && isFlatCases(col.tail)
case Ident(nme.WILDCARD) =>
isFlatCases(col.tail) // treat col.tail specially?
case i @ Ident(n) => // n ne nme.WILDCARD
assert(false)
( (i.symbol.flags & Flags.CASE) != 0) && directSubtype( i.tpe ) && isFlatCases(col.tail)
case s @ Select(_,_) => // i.e. scala.Nil
assert(false)
( (s.symbol.flags & Flags.CASE) != 0) && directSubtype( s.tpe ) && isFlatCases(col.tail)
case p =>
//Console.println(p.getClass)
false
}
}
if(isEqualsPattern(column.head.tpe)) { DBG("\n%%% MixEquals");
return new MixEquals(scrutinee, column, rest)
}
// the next condition is never true, @see isImplemented/CantHandleSeq
if(column.head.isInstanceOf[ArrayValue]) {
val av = column.head.asInstanceOf[ArrayValue]
if(!isRightIgnoring(av)) { DBG("\n%%% MixSequence"); return new MixSequence(scrutinee, column, rest) }
else { DBG("\n%%% MixSequenceStar"); return new MixSequenceStar(scrutinee, column, rest) }
}
if(isSimpleSwitch) { //DBG("\n%%% MixLiterals")
return new MixLiterals(scrutinee, column, rest)
}
if(settings_casetags && (column.length > 1) && isFlatCases(column)) {
//DBG("flat cases!"+column+"\n"+scrutinee.tpe.typeSymbol.children+"\n"+scrutinee.tpe.member(nme.tag))
DBG("\n%%% MixCases")
return new MixCases(scrutinee, column, rest)
// if(scrutinee.tpe./*?type?*/symbol.hasFlag(symtab.Flags.SEALED)) new MixCasesSealed(scrutinee, column, rest)
// else new MixCases(scrutinee, column, rest)
}
//Console.println("isUnapplyHead = "+isUnapplyHead())
if(isUnapplyHead()) { DBG("\n%%% MixUnapply")
return new MixUnapply(scrutinee, column, rest)
}
DBG("\n%%% MixTypes")
return new MixTypes(scrutinee, column, rest) // todo: handle type tests in unapply
} /* def MixtureRule(scrutinee:Symbol, column:List[Tree], rest:Rep): RuleApplication */
// ---------------------------------- data
sealed abstract class RuleApplication(rep:RepFactory) {
def scrutinee:Symbol
// used in MixEquals and MixSequence
final protected def repWithoutHead(col:List[Tree],rest:Rep)(implicit theOwner:Symbol): Rep = {
var fcol = col.tail
var frow = rest.row.tail
val nfailrow = new ListBuffer[Row]
while(fcol ne Nil) {
val p = fcol.head
frow.head match {
case Row(pats,binds,g,bx) => nfailrow += Row(p::pats,binds,g,bx)
}
fcol = fcol.tail
frow = frow.tail
}
rep.make(scrutinee::rest.temp, nfailrow.toList)
}
/** translate outcome of the rule application into code (possible involving recursive application of rewriting) */
def tree(implicit theOwner: Symbol, failTree: Tree): Tree
}
case class ErrorRule(implicit rep:RepFactory) extends RuleApplication(rep) {
def scrutinee:Symbol = throw new RuntimeException("this never happens")
final def tree(implicit theOwner: Symbol, failTree: Tree) = failTree
}
/** {case ... if guard => bx} else {guardedRest} */
case class VariableRule(subst:Binding, guard: Tree, guardedRest:Rep, bx: Int)(implicit rep:RepFactory) extends RuleApplication(rep) {
def scrutinee:Symbol = throw new RuntimeException("this never happens")
final def tree(implicit theOwner: Symbol, failTree: Tree): Tree = {
val body = typed { rep.requestBody(bx, subst) }
if(guard eq EmptyTree)
return body
val vdefs = targetParams(subst)
val typedElse = repToTree(guardedRest)
val typedIf = typed{If(guard.duplicate, body, typedElse)}
typer.typed { squeezedBlock(vdefs, typedIf) }
} /* def tree(implicit theOwner: Symbol, failTree: Tree) */
}
abstract class CaseRuleApplication(rep:RepFactory) extends RuleApplication(rep) {
def column: List[Tree]
def rest:Rep
// e.g. (1,1) (1,3) (42,2) for column {case ..1.. => ;; case ..42..=> ;; case ..1.. => }
protected var defaults: List[Int] = Nil
var defaultV: collection.immutable.Set[Symbol] = emptySymbolSet
var theDefaultRows: List[Row] = null
def getDefaultRows: List[Row] = {
if(theDefaultRows ne null)
return theDefaultRows
var res:List[Row] = Nil
var ds = defaults; while(ds ne Nil) {
res = grabRow(ds.head) :: res
ds = ds.tail
}
theDefaultRows = res
res
}
// sorted e.g. case _ => 7,5,1
protected def insertDefault(tag: Int,vs:Set[Symbol]) {
defaultV = defaultV ++ vs
defaults = insertSorted(tag, defaults)
}
protected def haveDefault: Boolean = !defaults.isEmpty
var tagIndexPairs: TagIndexPair = null
protected def grabTemps: List[Symbol] = rest.temp
protected def grabRow(index:Int): Row = rest.row(index) match {
case r @ Row(pats, s, g, bx) => if(defaultV.isEmpty) r else {
val vs = strip1(column(index)) // get vars
val nbindings = s.add(vs.elements,scrutinee)
Row(pats, nbindings, g, bx)
}
}
/** inserts row indices using in to list of tagindexpairs*/
protected def tagIndicesToReps(implicit theOwner: Symbol) = {
val defaultRows = getDefaultRows
var trs:List[(Int,Rep)] = Nil
var old = tagIndexPairs
while(tagIndexPairs ne null) { // collect all with same tag
val tag = tagIndexPairs.tag
var tagRows = this.grabRow(tagIndexPairs.index)::Nil
tagIndexPairs = tagIndexPairs.next
while((tagIndexPairs ne null) && tagIndexPairs.tag == tag) {
tagRows = this.grabRow(tagIndexPairs.index)::tagRows
tagIndexPairs = tagIndexPairs.next
}
trs = (tag, rep.make(this.grabTemps, tagRows ::: defaultRows)) :: trs
}
tagIndexPairs = old
trs
}
protected def defaultsToRep(implicit theOwner: Symbol) = rep.make(rest.temp, getDefaultRows)
protected def insertTagIndexPair(tag: Int, index: Int) { tagIndexPairs = TagIndexPair.insert(tagIndexPairs, tag, index) }
/** returns
* @return list of continuations,
* @return variables bound to default continuation,
* @return optionally, a default continuation,
**/
def getTransition(implicit theOwner: Symbol): (List[(Int,Rep)],Set[Symbol],Option[Rep]) =
(tagIndicesToReps, defaultV, {if(haveDefault) Some(defaultsToRep) else None})
} /* CaseRuleApplication */
/**
* mixture rule for flat case class (using tags)
*
* this rule gets translated to a switch of _.$tag()
**/
class MixCases(val scrutinee:Symbol, val column:List[Tree], val rest:Rep)(implicit rep:RepFactory) extends CaseRuleApplication(rep) {
/** insert row indices using in to list of tagindexpairs */
{
var xs = column; var i = 0; while(xs ne Nil) { // forall
val p = strip2(xs.head)
if(isDefaultPattern(p))
insertDefault(i,strip1(xs.head))
else
insertTagIndexPair( getCaseTag(p.tpe), i)
i += 1
xs = xs.tail
}
}
override def grabTemps = scrutinee::rest.temp
override def grabRow(index:Int) = rest.row(tagIndexPairs.index) match {
case Row(pats, s, g, bx) =>
val nbindings = s.add(strip1(column(index)).elements, scrutinee)
Row(column(tagIndexPairs.index)::pats, nbindings, g, bx)
}
final def tree(implicit theOwner: Symbol, failTree: Tree): Tree = {
val (branches, defaultV, default) = getTransition // tag body pairs
//DBG("[[mix cases transition: branches \n"+(branches.mkString("","\n","")+"\ndefaults:"+defaultV+" "+default+"]]"))
var ndefault = if(default.isEmpty) failTree else repToTree(default.get)
var cases = branches map {
case (tag, r) =>
CaseDef(Literal(tag),
EmptyTree,
{
val pat = this.column(this.tagIndexPairs.find(tag));
val ptpe = pat.tpe
if(this.scrutinee.tpe.typeSymbol.hasFlag(symtab.Flags.SEALED) && strip2(pat).isInstanceOf[Apply]) {
//cast
val vtmp = newVar(pat.pos, ptpe)
squeezedBlock(
List(typedValDef(vtmp, gen.mkAsInstanceOf(mkIdent(this.scrutinee), ptpe))),
repToTree(rep.make(vtmp :: r.temp.tail, r.row))
)
} else repToTree(r)
}
)}
renamingBind(defaultV, this.scrutinee, ndefault) // each v in defaultV gets bound to scrutinee
// make first case a default case.
if(this.scrutinee.tpe.typeSymbol.hasFlag(symtab.Flags.SEALED) && defaultV.isEmpty) {
ndefault = cases.head.body
cases = cases.tail
}
cases.length match {
case 0 => ndefault
case 1 => val CaseDef(lit,_,body) = cases.head
If(Equals(Select(mkIdent(this.scrutinee),nme.tag),lit), body, ndefault)
case _ => val defCase = CaseDef(mk_(definitions.IntClass.tpe), EmptyTree, ndefault)
Match(Select(mkIdent(this.scrutinee),nme.tag), cases ::: defCase :: Nil)
}
} /* def tree(implicit theOwner: Symbol, failTree: Tree) */
} /* MixCases */
/**
* mixture rule for flat case class (using tags)
*
* this rule gets translated to a switch of _.$tag()
class MixCasesSealed(scrut:Symbol, col:List[Tree], res:Rep) extends MixCases(scrut, col, res) {
override def grabTemps = rest.temp
override def grabRow(index:Int) = rest.row(tagIndexPairs.index)
}
**/
/**
* mixture rule for literals
*
* this rule gets translated to a switch. all defaults/same literals are collected
**/
class MixLiterals(val scrutinee:Symbol, val column:List[Tree], val rest:Rep)(implicit rep:RepFactory) extends CaseRuleApplication(rep) {
private var defaultIndexSet: Set64 = if(column.length < 64) new Set64 else null
override def insertDefault(tag: Int, vs: Set[Symbol]): Unit =
if(defaultIndexSet eq null) super.insertDefault(tag,vs)
else {
defaultIndexSet |= tag
defaultV = defaultV ++ vs
}
protected override def haveDefault: Boolean =
if(defaultIndexSet eq null) super.haveDefault else (defaultIndexSet.underlying != 0)
override def getDefaultRows: List[Row] = {
if(theDefaultRows ne null)
return theDefaultRows
if(defaultIndexSet eq null)
super.getDefaultRows
else {
var ix = 63
var res:List[Row] = Nil
while((ix >= 0) && !defaultIndexSet.contains(ix)) { ix = ix - 1 }
while(ix >= 0) {
res = grabRow(ix) :: res
ix = ix - 1
while((ix >= 0) && !defaultIndexSet.contains(ix)) { ix = ix - 1 }
}
theDefaultRows = res
res
}
}
var varMap: List[(Int,List[Symbol])] = Nil
private def sanity(pos:Position, tag: Int, pvars:List[Symbol]) {
varMap = (tag,pvars)::varMap
//if(!pvars.isEmpty) cunit.error(pos, "nonsensical variable binding")
}
/* // eager
private def bindVars(Tag:Int, body:Tree): Tree = {
def myBindVars(rest:List[(Int,List[Symbol])], vd: List[Tree]): Tree = rest match {
case Nil => if(vd eq Nil) body else Block(vd,body)
case (Tag,vs)::xs => myBindVars(xs, (vs.map { v => typedValDef(v,mkIdent(scrutinee)) }):::vd)
case (_, vs)::xs => myBindVars(xs, vd)
}
myBindVars(varMap, Nil)
}
*/
//lazy
private def bindVars(Tag:Int, orig: Binding): Binding = {
def myBindVars(rest:List[(Int,List[Symbol])], bnd: Binding): Binding = rest match {
case Nil => bnd
case (Tag,vs)::xs => myBindVars(xs, bnd.add(vs.elements, scrutinee))
case (_, vs)::xs => myBindVars(xs, bnd)
}
myBindVars(varMap, orig)
}
/*block*/{
var xs = column
var i = 0;
while(xs ne Nil) { // forall
strip(xs.head) match {
case (pvars, p @ Literal(Constant(c:Int))) => sanity(p.pos, c , definedVars(xs.head)); insertTagIndexPair(c,i)
case (pvars, p @ Literal(Constant(c:Char))) => sanity(p.pos, c.toInt, definedVars(xs.head)); insertTagIndexPair(c.toInt,i)
case (pvars, p ) if isDefaultPattern(p) => insertDefault(i,pvars)
}
i += 1
xs = xs.tail
}
}/*end block*/
final def tree(implicit theOwner: Symbol, failTree: Tree): Tree = {
val (branches, defaultV, defaultRepOpt) = this.getTransition // tag body pairs
//DBG("[[mix literal transition: branches \n"+(branches.mkString("","\n",""))+"\ndefaults:"+defaultV+"\n"+defaultRepOpt+"\n]]")
val cases = branches map {
case (tag, r) =>
CaseDef(Literal(tag), EmptyTree, repToTree(rep.make(r.temp, r.row map { case Row(pat,bnd,g,bx) => Row(pat,bindVars(tag,bnd),g,bx) })))
}
var ndefault = if(defaultRepOpt.isEmpty) failTree else repToTree(defaultRepOpt.get)
renamingBind(defaultV, this.scrutinee, ndefault) // each v in defaultV gets bound to scrutinee
if(cases.length == 1) {
val CaseDef(lit,_,body) = cases.head
If(Equals(mkIdent(this.scrutinee),lit), body, ndefault)
} else {
val defCase = CaseDef(mk_(definitions.IntClass.tpe), EmptyTree, ndefault)
return if(isSameType(this.scrutinee.tpe.widen, definitions.CharClass.tpe))
Match(Select(mkIdent(this.scrutinee), nme.toInt), cases ::: defCase :: Nil)
else
Match(mkIdent(this.scrutinee), cases ::: defCase :: Nil)
}
} /* def tree(implicit theOwner: Symbol, failTree: Tree) */
} /* MixLiterals */
/**
* mixture rule for unapply pattern
*/
class MixUnapply(val scrutinee:Symbol, val column:List[Tree], val rest:Rep)(implicit rep:RepFactory) extends RuleApplication(rep) {
def newVarCapture(pos:Position,tpe:Type)(implicit theOwner:Symbol) = {
val v = newVar(pos,tpe)
if(scrutinee.hasFlag(symtab.Flags.TRANS_FLAG))
v.setFlag(symtab.Flags.TRANS_FLAG) // propagate "unchecked"
v
}
private def bindToScrutinee(x:Symbol) = typedValDef(x,mkIdent(scrutinee))
val (vs,unapp) = strip(column.head)
//DBG("\n\n?? vs = "+vs)
//DBG("?? unapp = "+unapp)
/** returns (unapply-call, success-rep, optional fail-rep*/
final def getTransition(implicit theOwner: Symbol): (Tree, List[Tree], Rep, Option[Rep]) = {
unapp match {
case ua @ UnApply(app @ Apply(fn, appargs), args) =>
val ures = newVarCapture(ua.pos, app.tpe)
val n = args.length
val uacall = typedValDef(ures, Apply(fn, mkIdent(scrutinee) :: appargs.tail))
//Console.println("uacall:"+uacall)
val nrowsOther = column.tail.zip(rest.row.tail) flatMap { case (pat, Row(ps, subst, g, bx)) => strip2(pat) match {
case UnApply(app @ Apply(fn1,_),args) if fn.symbol==fn1.symbol => Nil
case _ => List(Row(pat::ps, subst, g, bx))
}}
val nrepFail = if(nrowsOther.isEmpty) None else Some(rep.make(scrutinee::rest.temp, nrowsOther))
//Console.println("active = "+column.head+" / nrepFail = "+nrepFail)
n match {
case 0 => //special case for unapply(), app.tpe is boolean
val ntemps = scrutinee :: rest.temp
val nrows = column.zip(rest.row) map { case (pat, Row(ps, subst, g, bx)) => strip2(pat) match {
case UnApply(Apply(fn1,_),args) if (fn.symbol == fn1.symbol) =>
val nsubst = subst.add(strip1(pat).elements, scrutinee)
Row(EmptyTree::ps, nsubst /*subst*/ , g, bx)
case _ =>
Row( pat ::ps, subst, g, bx)
}}
(uacall, Nil, rep.make(ntemps, nrows), nrepFail)
case 1 => //special case for unapply(p), app.tpe is Option[T]
val vtpe = app.tpe.typeArgs(0)
val vsym = newVarCapture(ua.pos, vtpe)
val ntemps = vsym :: scrutinee :: rest.temp
val nrows = column.zip(rest.row) map { case (pat, Row(ps, subst, g, bx)) => strip2(pat) match {
case UnApply(Apply(fn1,_),args) if (fn.symbol == fn1.symbol) =>
val nsubst = subst.add(strip1(pat).elements, scrutinee)
Row(args(0) :: EmptyTree :: ps, nsubst /*subst*/ , g, bx)
case _ =>
Row(EmptyTree :: pat :: ps, subst, g, bx)
}}
val vdef = typedValDef(vsym, Select(mkIdent(ures), nme.get))
(uacall, List(vdef), rep.make(ntemps, nrows), nrepFail)
case _ => // app.tpe is Option[? <: ProductN[T1,...,Tn]]
val uresGet = newVarCapture(ua.pos, app.tpe.typeArgs(0))
val vdefs = new ListBuffer[Tree]
vdefs += typedValDef(uresGet, Select(mkIdent(ures), nme.get))
var ts = definitions.getProductArgs(uresGet.tpe).get
var i = 1;
//Console.println("typeargs"+ts)
val vsyms = new ListBuffer[Symbol]
while(ts ne Nil) {
val vtpe = ts.head
val vchild = newVarCapture(ua.pos, vtpe)
val accSym = definitions.productProj(uresGet, i)
val rhs = typed(Apply(Select(mkIdent(uresGet), accSym), List())) // nsc !
vdefs += typedValDef(vchild, rhs)
vsyms += vchild
ts = ts.tail
i += 1
}
val ntemps = vsyms.toList ::: scrutinee :: rest.temp
val dummies = getDummies(i - 1)
val nrows = column.zip(rest.row) map { case (pat,Row(ps, subst, g, bx)) => strip2(pat) match {
case UnApply(Apply(fn1,_),args) if (fn.symbol == fn1.symbol) =>
val nsubst = subst.add(strip1(pat).elements, scrutinee)
Row( args::: EmptyTree ::ps, nsubst /*subst*/ , g, bx)
case _ =>
Row(dummies::: pat ::ps, subst, g, bx)
}}
(uacall, vdefs.toList, rep.make(ntemps, nrows), nrepFail)
}}
} /* def getTransition(...) */
final def tree(implicit theOwner: Symbol, failTree: Tree) = {
val (uacall/*:ValDef*/ , vdefs,srep,frep) = this.getTransition // uacall is a Valdef
DBG("getTransition"+(uacall,vdefs,srep,frep))
val succ = repToTree(srep)
val fail = if(frep.isEmpty) failTree else repToTree(frep.get)
val cond =
if(uacall.symbol.tpe.typeSymbol eq definitions.BooleanClass)
typed{ mkIdent(uacall.symbol) }
else
emptynessCheck(uacall.symbol)
typed { squeezedBlock(List(rep.handleOuter(uacall)), If(cond,squeezedBlock(vdefs,succ),fail)) }
} /* def tree(implicit theOwner: Symbol, failTree: Tree) */
} /* MixUnapply */
/** handle sequence pattern and ArrayValue (but not star patterns)
*/
sealed class MixSequence(val scrutinee:Symbol, val column:List[Tree], val rest:Rep)(implicit rep:RepFactory) extends RuleApplication(rep) {
private val sequenceType = scrutinee.tpe.widen.baseType(definitions.SeqClass)
private val elementType = getElemType_Sequence(scrutinee.tpe)
final def removeStar(xs:List[Tree]):List[Tree] =
xs.take(xs.length-1) ::: makeBind(strip1(xs.last).toList, mk_(sequenceType)) :: Nil
protected def getSubPatterns(len:Int, x:Tree):Option[List[Tree]] = x match {
case av @ ArrayValue(_,xs) if (!isRightIgnoring(av) && xs.length == len) => Some(xs ::: List(EmptyTree))
case av @ ArrayValue(_,xs) if ( isRightIgnoring(av) && xs.length == len+1) => Some(removeStar(xs)) // (*)
case EmptyTree | Ident(nme.WILDCARD) => Some(getDummies(len+1))
case _ => None
}
protected def makeSuccRep(vs:List[Symbol], tail:Symbol, nrows:List[Row])(implicit theOwner: Symbol) =
rep.make( vs ::: tail :: rest.temp, nrows.toList)
/** returns true if x is more general than y */
protected def subsumes(x:Tree, y:Tree): Boolean = (x,y) match {
case (av @ ArrayValue(_,xs), bv @ ArrayValue(_,ys)) =>
isRightIgnoring(av) && !isRightIgnoring(bv) && xs.length == ys.length+1 // (*)
case _ =>
false
}
// context (to be used in IF), success and failure Rep
def getTransition(implicit theOwner: Symbol): (Tree => Tree => Tree, Rep, Rep) = {
assert(isSubType(scrutinee.tpe, column.head.tpe), "problem "+scrutinee.tpe+" not <: "+column.head.tpe)
val treeAsSeq =
if(!isSubType(scrutinee.tpe, column.head.tpe))
typed(gen.mkAsInstanceOf(mkIdent(scrutinee), column.head.tpe, true))
else
mkIdent(scrutinee)
column.head match {
case av @ ArrayValue(_, xs) =>
var childpats = new ListBuffer[Tree]
var bindings = new ListBuffer[Tree]
var vs = new ListBuffer[Symbol]
var ix = 0
//build new temps on which we will match subpatterns
// if is right ignoring, don't want last one
var ys = if(isRightIgnoring(av)) xs.take(xs.length-1) else xs; while(ys ne Nil) {
val p = strip2(ys.head)
childpats += p
val temp = newVar(p.pos, elementType)
//DBG("new temp:"+temp+":"+temp.tpe)
//DBG("seqelem:"+seqElement(treeAsSeq.duplicate, ix))
vs += temp
bindings += typedValDef(temp, seqElement(treeAsSeq.duplicate, ix))
ix += 1
ys = ys.tail
}
val tail = newVar(scrutinee.pos, sequenceType)
bindings += typedValDef(tail, {if(ix-1>0) seqDrop(treeAsSeq.duplicate, ix) else mkIdent(scrutinee)})
val nrows = new ListBuffer[Row]
val frows = new ListBuffer[Row]
//val childpatList = childpats.toList
var cs = column; var rw = rest.row; while (cs ne Nil) {
(getSubPatterns(ix, cs.head),rw.head) match {
case (Some(ps), Row(pats,subst,g,b)) =>
nrows += Row( ps ::: pats, subst, g, b)
if(isDefaultPattern(cs.head) || subsumes(cs.head, av))
frows += Row( cs.head :: pats, subst, g, b)
case ( None , Row(pats,subst,g,b) ) =>
frows += Row( cs.head :: pats, subst, g, b)
}
cs = cs.tail
rw = rw.tail
}
val succRep = makeSuccRep(vs.toList, tail, nrows.toList)
val failRep = rep.make( scrutinee :: rest.temp, frows.toList)
/*
if(isRightIgnoring(av)) { // contains a _* at the end
val minlen = xs.length-1;
//typedValDef(casted, treeAsSeq.duplicate) :: bindings
val tempTail = newVar(xs.last.pos, xs.last.tpe)
bindings += typedValDef(tempTail, seqDrop(treeAsSeq.duplicate, minlen))
val cond = seqLongerThan(treeAsSeq.duplicate, column.head.tpe, minlen)
return ({thenp:Tree => {elsep:Tree =>
If(cond, squeezedBlock(bindings.toList, thenp), elsep)
}}, succRep, failRep)
}
*/
// fixed length
val cond = getCond(treeAsSeq, xs.length)
return ({thenp:Tree => {elsep:Tree => squeezedBlock(bindings.toList,If(cond, thenp, elsep))}}, succRep, failRep)
}
}
// lengthArg is exact length
protected def getCond(tree:Tree, lengthArg:Int) = seqHasLength(tree.duplicate, column.head.tpe, lengthArg)
final def tree(implicit theOwner: Symbol, failTree: Tree) = {
val (cx,srep,frep) = this.getTransition
//DBG("MSSf:"+srep.toString)
//DBG("MSSs:"+frep.toString)
val succ = repToTree(srep)
val fail = repToTree(frep)
cx(succ)(fail)
}
}
/** handle sequence pattern and ArrayValue (but not star patterns)
*/
final class MixSequenceStar(scrutinee:Symbol, column:List[Tree], rest:Rep)(implicit rep:RepFactory) extends MixSequence(scrutinee,column,rest) {
// in principle, we could optimize more, but variable binding gets complicated (@todo use finite state methods instead)
override def getSubPatterns(minlen:Int, x:Tree) = x match {
case av @ ArrayValue(_,xs) if (!isRightIgnoring(av) && xs.length == minlen) => // Seq(p1,...,pN)
Some(xs ::: gen.mkAttributedRef(definitions.NilModule) :: EmptyTree :: Nil)
case av @ ArrayValue(_,xs) if ( isRightIgnoring(av) && xs.length-1 == minlen) => // Seq(p1,...,pN,_*)
Some( removeStar(xs) ::: EmptyTree :: Nil)
case av @ ArrayValue(_,xs) if ( isRightIgnoring(av) && xs.length-1 < minlen) => // Seq(p1..,pJ,_*) J < N
Some( getDummies(minlen + 1) ::: x :: Nil)
case EmptyTree | Ident(nme.WILDCARD) =>
Some( getDummies(minlen + 1 + 1))
case _ =>
None
}
override protected def makeSuccRep(vs:List[Symbol], tail:Symbol, nrows:List[Row])(implicit theOwner: Symbol) =
rep.make( vs ::: tail :: scrutinee :: rest.temp, nrows)
// lengthArg is minimal length
override protected def getCond(tree:Tree, lengthArg:Int) = seqLongerThan(tree.duplicate, column.head.tpe, lengthArg - 1)
}
// @todo: equals test for same constant
class MixEquals(val scrutinee:Symbol, val column:List[Tree], val rest:Rep)(implicit rep:RepFactory) extends RuleApplication(rep) {
/** condition (to be used in IF), success and failure Rep */
final def getTransition(implicit theOwner: Symbol): (Tree, Rep, Symbol, Rep) = {
val nmatrix = rest
val vlue = (column.head.tpe: @unchecked) match {
case TypeRef(_,_,List(SingleType(pre,sym))) =>
gen.mkAttributedRef(pre,sym)
}
assert(vlue.tpe ne null)
val vs = strip1(column.head)
val nsuccFst = rest.row.head match { case Row(pats,bnd,g,b) => Row(EmptyTree::pats, bnd.add(vs.elements, scrutinee),g,b) }
//val nsuccRow = nsuccFst :: (column.tail.zip(rest.row.tail) map { case (p, Row(pats,bnd,g,b)) => Row(p::pats,bnd,g,b) })
val fLabel = theOwner.newLabel(scrutinee.pos, cunit.fresh.newName("failCont%")) // warning, untyped
val sx = rep.shortCut(fLabel) // register shortcut
val nsuccRow = nsuccFst :: Row(getDummies( 1 /*scrutinee*/ + rest.temp.length), NoBinding, EmptyTree, sx) :: Nil
// todo: optimize if no guard, and no further tests
val nsucc = rep.make(scrutinee :: rest.temp, nsuccRow)
val nfail = repWithoutHead(column,rest)
return (typed{ Equals(mkIdent(scrutinee) setType scrutinee.tpe, vlue) }, nsucc, fLabel, nfail)
}
final def tree(implicit theOwner: Symbol, failTree: Tree) = {
val (cond, srep, fLabel, frep) = this.getTransition
//Console.println("MixEquals::tree -- cond "+cond)
val cond2 = typed { rep.handleOuter(cond) }
//DBG("MixEquals, srep = "+srep)
//DBG("MixEquals, frep = "+frep)
val fail = typed { repToTree(frep) }
fLabel setInfo (new MethodType(Nil, fail.tpe))
val succ = repToTree(srep)
try {
typed{ If(cond2, succ, LabelDef(fLabel, Nil, fail)) }
} catch {
case e =>
Console.println("failed to type-check If")
Console.println("cond2: "+cond2)
throw e
}
} /* def tree(implicit theOwner: Symbol, failTree: Tree) */
} /* MixEquals */
/**
* mixture rule for type tests
**/
class MixTypes(val scrutinee:Symbol, val column:List[Tree], val rest:Rep)(implicit rep:RepFactory) extends RuleApplication(rep) {
var casted: Symbol = null
var moreSpecific: List[Tree] = Nil
var subsumed: List[(Int,List[Tree])] = Nil // row index and subpatterns
var remaining: List[(Int,Tree)] = Nil // row index and pattern
val isExhaustive = !scrutinee.tpe.typeSymbol.hasFlag(symtab.Flags.SEALED) || {
//DEBUG("check exha for column "+column)
val tpes = column.map {x => /*Console.println("--x:"+x+":"+x.tpe); */ x.tpe.typeSymbol}
scrutinee.tpe.typeSymbol.children.forall { sym => tpes.contains(sym) }
}
private val headPatternType = strip2(column.head) match {
case p @ (_:Ident | _:Select) =>
singleType(p.symbol.tpe.prefix, p.symbol) //should be singleton object
//case p@Apply(_,_) if !p.tpe./*?type?*/symbol.hasFlag(symtab.Flags.CASE) => ConstantType(new NamedConstant(p))
case __UnApply(_,argtpe,_) => argtpe
case _ => column.head.tpe
}
private val isCaseHead = isCaseClass(headPatternType)
private val dummies = if(!isCaseHead) Nil else getDummies(headPatternType.typeSymbol.caseFieldAccessors.length)
//DBG("headPatternType "+headPatternType)
//DBG("isCaseHead = "+isCaseHead)
//DBG("dummies = "+dummies)
private def subpatterns(pat:Tree): List[Tree] = {
//Console.print("subpatterns("+pat+")=")
//val x =
pat match {
case Bind(_,p) =>
subpatterns(p)
case app @ Apply(fn, pats) if isCaseClass(app.tpe) && (fn.symbol eq null)=>
if(isCaseHead) pats else dummies
case Apply(fn,xs) => assert((xs.isEmpty) && (fn.symbol ne null), "strange Apply"); dummies // named constant
case _: UnApply =>
dummies
case pat =>
//Console.println("[class="+pat.getClass()+"]")
dummies
}
//Console.println(x)
//x
}
/** returns true if pattern tests an object */
final def objectPattern(pat:Tree): Boolean = try {
(pat.symbol ne null) &&
(pat.symbol != NoSymbol) &&
pat.symbol.tpe.prefix.isStable &&
headPatternType =:= singleType(pat.symbol.tpe.prefix, pat.symbol)
} catch {
case e =>
Console.println("object pattern test throws "+e.getMessage())
//if(settings_debug)
// System.exit(-1);
throw e
}
//Console.println("scrutinee == "+scrutinee+":"+scrutinee.tpe)
//Console.println("column.head == "+column.head);
/*init block*/ {
var sr = (moreSpecific,subsumed,remaining)
var j = 0; var pats = column; while(pats ne Nil) {
val (ms,ss,rs) = sr // more specific, more general(subsuming current), remaining patterns
val pat = pats.head
val strippedPattern = strip2(pat)
val patternType = strippedPattern.tpe
//Console.println("pat = "+pat+" (class "+pat.getClass+")of type "+pat.tpe)
//Console.println("current pat is wild? = "+isDefaultPattern(pat))
//Console.println("current pat.symbol = "+pat.symbol+", pat.tpe "+pat.tpe)
//Console.println("headPatternType = "+headPatternType)
//Console.println("(current)pat.tpe <:< headPatternType = "+(pat.tpe <:< headPatternType))
//Console.println("headPatternType <:< (current)pat.tpe = "+(headPatternType <:< pat.tpe))
//Console.println("(current)pat.tpe =:= headPatternType = "+(pat.tpe <:< headPatternType))
sr = strippedPattern match {
// case _: Bind => // cannot happen, using strip2
// case a:Alternative => // cannot happen, alternatives should be preprocessed away
case Literal(Constant(null)) if !(headPatternType =:= patternType) => //special case for constant null pattern
//Console.println("[1")
(ms,ss,(j,pat)::rs);
case _ if objectPattern(pat) =>
//Console.println("[2")
(EmptyTree::ms, (j,dummies)::ss, rs); // matching an object
case Typed(p, _) if (strip2(p).isInstanceOf[UnApply] && (patternType /*is never <equals>*/ <:< headPatternType)) =>
//Console.println("unapply arg is same or *more* specific")
(p::ms, (j, dummies)::ss, rs);
case q @ Typed(pp,_) if (patternType_wrtEquals(patternType) <:< headPatternType) =>
//Console.println("current pattern [Typed] is same or *more* specific")
({if(pat.tpe =:= headPatternType /*never true for <equals>*/) pp/*EmptyTree*/ else q}::ms, (j, dummies)::ss, rs);
case z:UnApply =>
//Console.println("current pattern tests something else")
(ms,ss,(j,pat)::rs)
case qq if (patternType_wrtEquals(patternType) <:< headPatternType) && !isDefaultPattern(pat) =>
//Console.println("current pattern [ ... ] is same or *more* specific")
({if(pat.tpe =:= headPatternType /*never true for <equals>*/) EmptyTree else pat}::ms, (j,subpatterns(pat))::ss, rs);
case _ if (headPatternType <:< patternType /*never true for <equals>*/) || isDefaultPattern(pat) =>
//Console.println("current pattern is *more general*")
(EmptyTree::ms, (j, dummies)::ss, (j,pat)::rs); // subsuming (matched *and* remaining pattern)
case _ =>
//Console.println("current pattern tests something else")
(ms,ss,(j,pat)::rs)
}
j += 1
pats = pats.tail
}
this.moreSpecific = sr._1.reverse
this.subsumed = sr._2.reverse
this.remaining = sr._3.reverse
sr = null
} /* init block */
override def toString = {
"MixTypes("+scrutinee+":"+scrutinee.tpe+") {\n moreSpecific:"+moreSpecific+"\n subsumed:"+subsumed+"\n remaining"+remaining+"\n}"
}
/** returns casted symbol, success matrix and optionally fail matrix for type test on the top of this column */
final def getTransition(implicit theOwner: Symbol): (Symbol, Rep, Option[Rep]) = {
//DBG("*** getTransition! of "+this.toString)
// the following works for type tests... what fudge is necessary for value comparisons?
// type test
casted = if(scrutinee.tpe =:= headPatternType) scrutinee else newVar(scrutinee.pos, headPatternType)
if(scrutinee.hasFlag(symtab.Flags.TRANS_FLAG))
casted.setFlag(symtab.Flags.TRANS_FLAG)
// succeeding => transition to translate(subsumed) (taking into account more specific)
val nmatrix = {
var ntemps = if(isCaseHead /*for annontated type, isCaseHead == false but isClass(casted.tpe) == true*/) casted.caseFieldAccessors map {
meth =>
val ctemp = newVar(scrutinee.pos, casted.tpe.memberType(meth).resultType)
if(scrutinee.hasFlag(symtab.Flags.TRANS_FLAG))
ctemp.setFlag(symtab.Flags.TRANS_FLAG)
ctemp
} else Nil // (***)
var subtests = subsumed
if(moreSpecific.exists { x => x != EmptyTree }) {
ntemps = casted::ntemps // (***)
subtests = moreSpecific.zip(subsumed) map {
case (mspat, (j,pats)) => (j,mspat::pats)
}
}
ntemps = ntemps ::: rest.temp
val ntriples = subtests map {
case (j,pats) =>
val (vs,thePat) = strip(column(j))
val Row(opats, osubst, og, bx) = rest.row(j)
val nsubst = osubst.add(vs.elements, casted)
Row(pats ::: opats, nsubst, og, bx)
}
//DBG("ntemps = "+ntemps.mkString("[["," , ","]]"))
//DBG("ntriples = "+ntriples.mkString("[[\n","\n, ","\n]]"))
rep.make(ntemps, ntriples) /*setParent this*/
}
// fails => transition to translate(remaining)
val nmatrixFail: Option[Rep] = {
val ntemps = scrutinee :: rest.temp
val ntriples = remaining map {
case (j, pat) => val r = rest.row(j); Row(pat :: r.pat, r.subst, r.guard, r.bx)
}
if(ntriples.isEmpty) None else Some(rep.make(ntemps, ntriples))
}
//DBG("nmatrixFail = \n\n"+nmatrixFail)
(casted, nmatrix, nmatrixFail)
} /* getTransition(implicit theOwner: Symbol): (Symbol, Rep, Option[Rep]) */
final def tree(implicit theOwner: Symbol, failTree: Tree) = {
val (casted,srep,frep) = this.getTransition
val condUntyped = condition(casted.tpe, this.scrutinee)
var cond = rep.handleOuter(typed { condUntyped }) // <- throws exceptions in some situations?
if(needsOuterTest(casted.tpe, this.scrutinee.tpe, theOwner)) // @todo merge into def condition
cond = addOuterCondition(cond, casted.tpe, mkIdent(this.scrutinee), rep.handleOuter)
val succ = repToTree(srep)
val fail = if(frep.isEmpty) failTree else repToTree(frep.get)
// dig out case field accessors that were buried in (***)
//Console.println("casted:"+casted+": "+casted.tpe)
val cfa = if(isCaseHead) casted.caseFieldAccessors else Nil
//Console.println("cfa's:"+cfa.toString)
val caseTemps = (if(!srep.temp.isEmpty && srep.temp.head == casted) srep.temp.tail else srep.temp).zip(cfa)
//Console.println("case temps"+caseTemps.toString)
try{
var vdefs = caseTemps map {
case (tmp,accessorMethod) =>
//Console.println("tmp: "+tmp+":"+tmp.tpe)
//Console.println("accessorMethod: "+accessorMethod+":"+accessorMethod.tpe)
val untypedAccess = Apply(Select(mkIdent(casted), accessorMethod),List())
val typedAccess = typed { untypedAccess }
//Console.println("ParallelMatching-- MixTypes "+typedAccess)
typedValDef(tmp, typedAccess)
}
if(casted ne this.scrutinee) {
vdefs = ValDef(casted, gen.mkAsInstanceOf(mkIdent(this.scrutinee), casted.tpe)) :: vdefs
}
typed { If(cond, squeezedBlock(vdefs,succ), fail) }
} catch {
case e =>
throw new FatalError("EXCEPTION:"+e.getMessage())
}
} /* def tree(implicit theOwner: Symbol, failTree: Tree) */
} /* class MixTypes */
/** converts given rep to a tree - performs recursive call to translation in the process to get sub reps
*/
final def repToTree(r: Rep)(implicit theOwner: Symbol, failTree: Tree, rep: RepFactory): Tree = {
r.applyRule.tree
/*r.applyRule match {
case r : ErrorRule => Console.println("R1"); r.tree
case vr: VariableRule => Console.println("R2"); vr.tree
case mc: MixCases => Console.println("R3"); mc.tree
case ml: MixLiterals => Console.println("R4"); ml.tree
case me: MixEquals => Console.println("R5"); me.tree
case mm: MixTypes => Console.println("R6"); mm.tree
case mu: MixUnapply => Console.println("R7"); mu.tree
}*/
}
/** subst: the bindings so far */
case class Row(pat:List[Tree], subst:Binding, guard:Tree, bx:Int)
object Rep {
type RepType = Product2[List[Symbol], List[Row]]
final def unapply(x:Rep)(implicit rep:RepFactory):Option[RepType] =
if(x.isInstanceOf[rep.RepImpl]) Some(x.asInstanceOf[RepType]) else None
}
class RepFactory(val handleOuter: Tree => Tree) {
case class RepImpl(val temp:List[Symbol], val row:List[Row]) extends Rep with Rep.RepType {
(row.find { case Row(pats, _, _, _) => temp.length != pats.length }) match {
case Some(row) => assert(false, "temp == "+temp+" row.pats == "+row.pat);
case _ =>
}
def _1 = temp
def _2 = row
}
var vss: List[SymList] = _
var labels: Array[Symbol] = new Array[Symbol](4)
var targets: List[Tree] = _
var reached64: Set64 = _
var reached: List[Int] = Nil
var shortCuts: List[Symbol] = Nil;
final def make(temp:List[Symbol], row:List[Row], targets: List[Tree], vss:List[SymList])(implicit theOwner: Symbol): Rep = {
// ensured that labels(i) eq null for all i, cleanup() has to be called after translation
this.targets = targets
if(targets.length > labels.length)
this.labels = new Array[Symbol](targets.length)
this.vss = vss
this.reached64 = if(targets.length < 64) new Set64 else null
//Console.println("targets: "+targets)
//Console.println("vss: "+vss)
//Console.print("labels: "); {for(s<-labels) Console.print({if(s ne null) {s} else "_"}+",")}
return make(temp, row)
}
final def shortCut(theLabel:Symbol): Int = {
//Console.println("adds shortcut:"+theLabel)
this.shortCuts = shortCuts:::theLabel::Nil;
return -shortCuts.length
}
final def cleanup(tree: Tree)(implicit theOwner: Symbol): Tree = {
object lxtt extends Transformer {
override def transform(tree:Tree): Tree = tree match {
case blck @ Block(vdefs, ld @ LabelDef(name,params,body)) =>
val bx = labelIndex(ld.symbol)
if((bx >= 0) && !isReachedTwice(bx)) {
//Console.println("removing labeldef! ")
//Console.println("ld.symbol = "+ld.symbol)
//Console.println("bx = "+bx)
//Console.println("rtwice? "+isReachedTwice(bx))
//Console.println("reached = "+reached)
squeezedBlock(vdefs,body)
}
else
blck
//case If(Literal(Constant(true)), thenp, elsep) =>
// Console.println("1 short IF affecting "+elsep); thenp
//case If(Literal(Constant(false)), thenp, elsep) =>
// Console.println("2 short IF affecting "+thenp); elsep
case If(cond, Literal(Constant(true)), Literal(Constant(false))) =>
super.transform(cond)
case If(cond1, If(cond2, thenp, elsep1), elsep2) if (elsep1 equalsStructure elsep2) =>
//Console.println("3 short IF affecting "+elsep2);
super.transform(If(And(cond1,cond2), thenp, elsep1))
case If(cond1, If(cond2, thenp, Apply(jmp,List())), ld:LabelDef) if (jmp.symbol eq ld.symbol) =>
//Console.println("4 short IF affecting "+ld)
super.transform(If(And(cond1,cond2), thenp, ld))
case t => super.transform(t)
}
}
val res = lxtt.transform(tree)
cleanup()
res
}
final def cleanup() {
var i = targets.length;
while (i>0) { i-=1; labels(i) = null; };
reached = Nil
shortCuts = Nil
}
final def isReached(bx:Int) = { /*Console.println("isReached("+bx+")"); */labels(bx) ne null }
final def markReachedTwice(bx:Int) = if(reached64 ne null) { reached64 |= bx } else { reached = insertSorted(bx, reached) }
/** @pre bx < 0 || labelIndex(bx) != -1 */
final def isReachedTwice(bx:Int) = (bx < 0) || (if(reached64 ne null) { reached64 contains bx } else { findSorted(bx,reached) })
/* @returns bx such that labels(bx) eq label, -1 if no such bx exists */
final def labelIndex(label:Symbol): Int = {
var bx = 0; while((bx < labels.length) && (labels(bx) ne label)) { bx += 1 }
if(bx >= targets.length) bx = -1
return bx
}
/** first time bx is requested, a LabelDef is returned. next time, a jump.
* the function takes care of binding
*/
final def requestBody(bx:Int, subst:Binding)(implicit theOwner: Symbol): Tree = {
if(bx < 0) {// is shortcut
//Console.println("requestBody ("+bx+") gets shortcut "+(shortCuts.length-bx)+ " all:"+shortCuts);
val jlabel = shortCuts(-bx-1)
//Console.println("is "+jlabel);
val jump = Apply(mkIdent(jlabel), Nil)
//Console.println(jump)
//val jumpT = typed{ jump }
//Console.println(jumpT)
return jump
}
//DBG("requestbody("+bx+", "+subst+") isReached(bx)?"+isReached(bx)+" labels:");
//{for(s<-labels) Console.print({if(s ne null) {s} else "_"}+",")}
//DBG("vss(bx) = "+vss(bx))
if(!isReached(bx)) { // first time this bx is requested
val argts = new ListBuffer[Type] // types of
var vrev: List[Symbol] = Nil
var vdefs:List[Tree] = Nil
val it = vss(bx).elements; while(it.hasNext) {
val v = it.next
//DBG("v = "+v)
val substv = subst(v)
if(substv ne null) {// might be bound elsewhere ( see `x @ unapply' )
vrev = v :: vrev
argts += v.tpe
vdefs = typedValDef(v, substv)::vdefs
}
}
val body = targets(bx)
// bug: typer is not able to digest a body of type Nothing being assigned result type Unit
val tpe = if(body.tpe.typeSymbol eq definitions.AllClass) body.tpe else resultType
val label = theOwner.newLabel(body.pos, "body%"+bx).setInfo(new MethodType(argts.toList, tpe))
labels(bx) = label
if(body.isInstanceOf[Throw] || body.isInstanceOf[Literal]) {
return squeezedBlock(vdefs.reverse, body.duplicate setType tpe)
}
//Console.println("- !isReached returning LabelDef "+label)
//Console.println("- ! and vdefs "+vdefs)
return squeezedBlock(vdefs, LabelDef(label, vrev.reverse, body setType tpe))
}
//Console.println("- isReached before, jump to "+labels(bx))
// jump
markReachedTwice(bx) // if some bx is not reached twice, its LabelDef
val args = new ListBuffer[Ident] // is replaces with body itself
var vs = vss(bx).elements; while(vs.hasNext) {
val substv = subst(vs.next)
assert(substv ne null) // if sharing takes place, then 'binding elsewhere' is not allowed
args += substv
}
val label = labels(bx)
label.tpe match {
case MethodType(fmls,_) =>
if (fmls.length != args.length) { // sanity check
cunit.error(targets(bx).pos, "consistency problem in target generation ! I have args "+args+" and need to jump to a label with fmls "+fmls)
throw FatalError("consistency problem")
}
for((f,a) <- fmls.zip(args.toList)) {
if(!(a.tpe <:< f)) {
cunit.error(targets(bx).pos, "consistency problem ! "+a.tpe+" "+f)
throw FatalError("consistency problem")
}
}
}
val body = targets(bx)
if(body.isInstanceOf[Throw] || body.isInstanceOf[Literal]) {
val vdefs = new ListBuffer[Tree]
val it = vss(bx).elements; while(it.hasNext) {
val v = it.next
val substv = subst(v)
if(substv ne null) {// might be bound elsewhere ( see `x @ unapply' )
vdefs += typedValDef(v, substv)
}
}
return squeezedBlock(vdefs.toList, body.duplicate setType resultType)
}
return Apply(mkIdent(label),args.toList)
}
/** the injection here handles alternatives and unapply type tests */
final def make(temp:List[Symbol], row1:List[Row])(implicit theOwner: Symbol): Rep = {
//if(temp.isEmpty && row1.length > 1) return apply(Nil, row1.head::Nil) // small standalone optimization, we won't need other rows (check guard?)
var unchanged: Boolean = true
val row = row1 flatMap {
xx =>
def isAlternative(p: Tree): Boolean = p match {
case Bind(_,p) => isAlternative(p)
case Alternative(ps) => true
case _ => false
}
def getAlternativeBranches(p:Tree): List[Tree] = {
def get_BIND(pctx:Tree => Tree, p:Tree):List[Tree] = p match {
case b @ Bind(n,p) => get_BIND({ x:Tree => pctx(copy.Bind(b, n, x) setType x.tpe) }, p)
case Alternative(ps) => ps map pctx
}
get_BIND({x=>x}, p)
}
val Row(opatso, subst, g, bx) = xx
var opats = opatso
var pats:List[Tree] = Nil
var indexOfAlternative = -1
var j = 0; while(opats ne Nil) {
var opat = opats.head // original pattern
//DBG("opat = "+opat)
val (vars,strippedPat) = strip(opat)
val vs = vars.toList
(strippedPat: @unchecked) match {
case p @ Alternative(ps) =>
if(indexOfAlternative == -1) {
unchanged = false
indexOfAlternative = j
}
pats = opat :: pats
case typat @ Typed(p,tpt) if strip2(p).isInstanceOf[UnApply]=>
pats = (if (temp(j).tpe <:< tpt.tpe) p else typat)::pats // what about the null-check?
case Ident(nme.WILDCARD) | EmptyTree | _:Literal | _:Typed =>
pats = opat :: pats
case o @ Ident(n) => // n != nme.WILDCARD
val tpe =
if (!o.symbol.isValue) {
singleType(o.tpe.prefix, o.symbol)
} else {
//DBG("o.tpe "+o.symbol.tpe)
//DBG("o.tpe "+o.symbol.tpe.isStable)
//DBG("p.prefix "+o.symbol.tpe.prefix)
singleType(NoPrefix, o.symbol) // equals-check
// call the above `stpe'. Then we could also return
// `typeRef(definitions.ScalaPackageClass.tpe, definitions.EqualsPatternClass, List(stpe))'
// and force an equality check. However, exhaustivity checking would not work anymore.
// so first, extend exhaustivity check to equalspattern
}
val p = Ident(nme.WILDCARD) setType tpe
val q = Typed(p, TypeTree(tpe)) setType tpe
pats = (makeBind( vs, q) setType tpe) :: pats
case o @ Select(stor,_) =>
val stpe =
if (!o.symbol.isValue) {
singleType(o.tpe.prefix, o.symbol)
} else {
//DBG("stor.tpe "+stor.tpe)
//DBG("stor.symbol "+stor.symbol)
//DBG("stor.symbol.tpe "+stor.symbol.tpe)
singleType(NoPrefix, o.symbol) // equals-check
}
val p = Ident(nme.WILDCARD) setType stpe
val q = makeBind(vs,Typed(p, TypeTree(stpe)) setType stpe) setType stpe
pats = q::pats
case UnApply(Apply(TypeApply(sel @ Select(stor, nme.unapplySeq),List(tptArg)),_),ArrayValue(_,xs)::Nil) if(stor.symbol eq definitions.ListModule) =>
//@pre: is not right-ignoring (no star pattern)
// no exhaustivity check, please
temp(j).setFlag(symtab.Flags.TRANS_FLAG)
val listType = typeRef(mkThisType(definitions.ScalaPackage), definitions.ListClass, List(tptArg.tpe))
val nmlzdPat = normalizedListPattern(xs, tptArg.tpe)
pats = makeBind(vs, nmlzdPat) :: pats
//case ua @ __UnApply(_,argtpe,_) =>
//val ua = prepat
// val npat = (if (temp(j).tpe <:< argtpe) ua else Typed(ua,TypeTree(argtpe)).setType(argtpe))
// pats = (makeBind(vs, npat) setType argtpe)::pats
case ua @ UnApply(Apply(fn, _), _) =>
fn.tpe match {
case MethodType(List(argtpe,_*),_) =>
val npat = (if (temp(j).tpe <:< argtpe) ua else Typed(ua,TypeTree(argtpe)).setType(argtpe))
pats = (makeBind(vs, npat) setType argtpe)::pats
}
// something too tricky is going on if the outer types don't match
case o @ Apply(fn, List()) if !isCaseClass(o.tpe) =>
//DBG("o.tpe "+o.tpe)
//DBG("fn is ")
//Console.println("o.symbol is a module? "+o.symbol+" "+o.symbol.isModule)
//Console.println("o.tpe.termSymbol is a module? "+o.tpe.termSymbol+" "+o.tpe.termSymbol.isModule)
val stpe: Type = fn match {
case _ if (o.symbol.isModule) =>
//DBG("o.symbol is module! "+o.symbol)
//DBG(nodeToString(fn))
singleType(o.tpe.prefix, o.symbol)
case _ if (o.tpe.termSymbol.isModule) =>
//Console.println("o.tpe.termSymbol is a module! "+sym)
singleType(o.tpe.prefix, o.symbol)
case Select(path,sym) =>
//DBG("path "+path);
//DBG("sym "+sym);
path.tpe match {
case ThisType(sym) =>
singleType(path.tpe, o.symbol)
case _ => // e.g. `case Some(p._2)' in scala.collection.jcl.Map
singleType(singleType(path.tpe.prefix, path.symbol) , o.symbol) // old
}
case o @ Ident(_) => // lazy val
//DBG("sym "+o.symbol)
//DBG("sym.isValue "+o.symbol.isValue)
//singleType(NoPrefix, o.symbol) // before
if (!o.symbol.isValue) {
singleType(o.tpe.prefix, o.symbol)
} else {
singleType(NoPrefix, o.symbol) // equals-check
}
}
//Console.println("encoding in singleType:"+stpe)
val ttst = typeRef(NoPrefix, definitions.EqualsPatternClass, List(stpe))
//Console.println("here's the result: "+ttst)
val p = Ident(nme.WILDCARD) setType ttst
val q = makeBind(vs,Typed(p, TypeTree(stpe)) setType ttst)
pats = q::pats
case Apply_Value(pre, sym) =>
val tpe = typeRef(NoPrefix, definitions.EqualsPatternClass, singleType(pre, sym)::Nil)
val q = makeBind(vs,Typed(EmptyTree, TypeTree(tpe)) setType tpe)
pats = q :: pats
case Apply_CaseClass_NoArgs(tpe) => // no-args case class pattern
val q = makeBind(vs, Typed(EmptyTree, TypeTree(tpe)) setType tpe)
pats = q :: pats
case Apply_CaseClass_WithArgs() => // case class pattern with args
pats = opat :: pats
case ArrayValue(_,xs) =>
//assert(false) // inactive, @see PatternMatchers::isImplemented
pats = opat :: pats
}
//DBG("!!added "+pats.head+":"+pats.head.tpe)
opats = opats.tail
j += 1
}
pats = pats.reverse
//i = pats findIndexOf isAlternative
if (indexOfAlternative == -1)
List(Row(pats, subst, g, bx))
else {
val prefix = pats.take( indexOfAlternative )
val alts = getAlternativeBranches(pats( indexOfAlternative ))
val suffix = pats.drop(indexOfAlternative + 1)
alts map { p => Row(prefix ::: p :: suffix, subst, g, bx) }
}
}
if (unchanged) {
val ri = RepImpl(temp,row).init
//Console.println("Rep.apply / ri = "+ri)
ri
} else {
//Console.println("Rep.apply / recursive ")
this.make(temp,row) // recursive call
}
}
}
abstract class Rep {
val temp:List[Symbol]
val row:List[Row] // (List[Tree], List[(Symbol,Symbol)], Tree, Tree)
var sealedCols = List[Int]()
var sealedComb = List[Set[Symbol]]()
//Console.println(" the matrix "+this.toString)
final def init: this.type = {
temp.zipWithIndex.foreach {
case (sym,i) =>
//Console.println("sym! "+sym+" mutable? "+sym.hasFlag(symtab.Flags.MUTABLE)+" captured? "+sym.hasFlag(symtab.Flags.CAPTURED))
if (sym.hasFlag(symtab.Flags.MUTABLE) && // indicates that have not yet checked exhaustivity
!sym.hasFlag(symtab.Flags.TRANS_FLAG) && // indicates @unchecked
sym.tpe.typeSymbol.hasFlag(symtab.Flags.SEALED)) {
sym.resetFlag(symtab.Flags.MUTABLE)
sealedCols = i::sealedCols
// this should enumerate all cases... however, also the superclass is taken if it is not abstract
def candidates(tpesym: Symbol): SymSet =
if(!tpesym.hasFlag(symtab.Flags.SEALED)) emptySymbolSet else
tpesym.children.flatMap { x =>
val z = candidates(x)
if(x.hasFlag(symtab.Flags.ABSTRACT)) z else z + x
}
val cases = candidates(sym.tpe.typeSymbol)
sealedComb = cases::sealedComb
}
}
// computes cartesian product, keeps indices available
def combine(colcom: List[(Int,Set[Symbol])]): List[List[(Int,Symbol)]] = colcom match {
case Nil => Nil
case (i,syms)::Nil => syms.toList.map { sym => List((i,sym)) }
case (i,syms)::cs => for (s <- syms.toList; rest <- combine(cs)) yield (i,s) :: rest
}
if(!sealedCols.isEmpty) {
//Console.println("cols"+sealedCols)
//DEBUG("comb")
//for (com <- sealedComb) //DEBUG(com.toString)
val allcomb = combine(sealedCols zip sealedComb)
//Console.println("all comb!" + allcomb)
/** returns true if pattern vector pats covers a type symbols "combination"
* @param pats pattern vector
* @param comb pairs of (column index, type symbol)
*/
def covers(pats: List[Tree], comb:List[(Int,Symbol)]) =
comb forall {
case (i,sym) =>
val p = strip2(pats(i));
//Console.println("covers? "+p+" "+sym);
val res =
isDefaultPattern(p) || p.isInstanceOf[UnApply] || p.isInstanceOf[ArrayValue] || {
val ptpe = patternType_wrtEquals(p.tpe)
val symtpe = if(sym.hasFlag(symtab.Flags.MODULE)) {
singleType(sym.tpe.prefix, sym.linkedModuleOfClass) // e.g. None, Nil
} else sym.tpe
//Console.print("covers: sym="+sym+" symtpe="+symtpe+" p="+p+", p.tpe="+p.tpe+" ?")
(ptpe.typeSymbol == sym) || (symtpe <:< ptpe) ||
/* outer, see scala.util.parsing.combinator.lexical.Scanner */
(ptpe.prefix.memberType(sym) <:< ptpe)
}
//Console.println(res)
res
}
val coversAll = allcomb forall { combination => row exists { r => covers(r.pat, combination)}}
//Console.println("all combinations covered? "+coversAll)
if(!coversAll) {
val sb = new StringBuilder()
sb.append("match is not exhaustive!\n")
for (open <- allcomb if !(row exists { r => covers(r.pat, open)})) {
sb.append("missing combination ")
val NPAD = 15
def pad(s:String) = { 1.until(NPAD - s.length).foreach { x => sb.append(" ") }; sb.append(s) }
List.range(0, temp.length) foreach {
i => open.find { case (j,sym) => j==i } match {
case None => pad("*")
case Some((_,sym)) => pad(sym.name.toString)
}
}
sb.append('\n')
}
cunit.warning(temp.head.pos, sb.toString)
}
}
//if(settings_debug) Console.println("init done, rep = "+this.toString)
return this
} /* def init */
/* internal representation is (temp:List[Symbol], row:List[Row])
*
* tmp1 tmp_m
*/
final def applyRule(implicit theOwner: Symbol, rep: RepFactory): RuleApplication = row match {
case Nil =>
ErrorRule
case Row(pats, subst, g, bx)::xs =>
var px = 0; var rpats = pats; var bnd = subst; var temps = temp; while((bnd ne null) && (rpats ne Nil)) {
val (vs,p) = strip(rpats.head);
if(!isDefaultPattern(p)) { /*break*/ bnd = null; } else {
bnd = bnd.add(vs.elements,temps.head)
rpats = rpats.tail
temps = temps.tail
px += 1 // pattern index
}
}
/* Row( _ ... _ g_1 b_1 ) :: rows it's all default patterns
*/
if(bnd ne null) { // all default patterns
val rest = if(g eq EmptyTree) null else rep.make(temp, xs)
return VariableRule (bnd, g, rest, bx)
}
/* Row( _ ... _ p_1i ... p_1n g_m b_m ) :: rows
*/
// cut out column px that contains the non-default pattern
// assert(px == pats findIndexOf {x => !isDefaultPattern(x)})
val column = rpats.head :: (row.tail map { case Row(pats,_,_,_) => pats(px) })
// assert(column == row map { case Row(pats,_,_,_) => pats(px) })
val restTemp = temp.take(px) ::: temp.drop(px+1)
val restRows = row map { case Row(pats, subst, g, bx) => Row(pats.take(px) ::: pats.drop(px+1), subst, g, bx) }
return MixtureRule(temps.head, column, rep.make(restTemp,restRows))
} /* applyRule */
// a fancy toString method for debugging
override final def toString = {
val sb = new StringBuilder
val NPAD = 15
def pad(s:String) = { 1.until(NPAD - s.length).foreach { x => sb.append(" ") }; sb.append(s) }
for (tmp <- temp) pad(tmp.name.toString)
sb.append('\n')
for ((r,i) <- row.zipWithIndex) {
for (c <- r.pat ::: List(r.subst, r.guard, r.bx)) {
pad(c.toString)
}
sb.append('\n')
}
sb.toString
} /* def toString */
} /* class Rep */
/** creates initial clause matrix
*/
final def initRep(selector: Tree, cases: List[Tree], checkExhaustive: Boolean, rep:RepFactory)(implicit theOwner: Symbol) = {
val root = newVar(selector.pos, selector.tpe)
// communicate whether exhaustiveness-checking is enabled via some flag
if (!checkExhaustive)
root.setFlag(symtab.Flags.TRANS_FLAG)
var bx = 0;
val targets = new ListBuffer[Tree]
val vss = new ListBuffer[SymList]
val row = new ListBuffer[Row]
var cs = cases; while (cs ne Nil) cs.head match { // stash away pvars and bodies for later
case CaseDef(pat,g,b) =>
//Console.println("pat::"+pat)
//Console.println("dv ::"+definedVars(pat))
vss += definedVars(pat)
targets += b
row += Row(List(pat), NoBinding, g, bx)
bx += 1
cs = cs.tail
}
//Console.println("leaving initRep")
/*val res = */rep.make(List(root), row.toList, targets.toList, vss.toList)
//Console.println("left initRep")
//res
}
// ---------------------------------- helper functions that generate symbols, trees for type tests, pattern tests
final def newVar(pos: Position, name: Name, tpe: Type)(implicit theOwner: Symbol): Symbol = {
if(tpe eq null) assert(tpe ne null, "newVar("+name+", null)")
val sym = theOwner.newVariable(pos, name) // careful: pos has special meaning
sym setInfo tpe
sym
}
final def newVar(pos: Position, tpe: Type)(implicit theOwner: Symbol): Symbol =
newVar(pos, cunit.fresh.newName("temp"), tpe) setFlag symtab.Flags.SYNTHETIC
/** returns the condition in "if(cond) k1 else k2"
*/
final def condition(tpe: Type, scrut: Symbol): Tree = {
val res = condition1(tpe, scrut)
//DBG("condition, tpe = "+tpe+", scrut.tpe = "+scrut.tpe+", res = "+res)
res
}
final def condition1(tpe: Type, scrut: Symbol): Tree = {
assert(scrut ne NoSymbol)
condition(tpe, mkIdent(scrut))
}
final def condition(tpe: Type, scrutineeTree: Tree): Tree = {
assert(tpe ne NoType)
assert(scrutineeTree.tpe ne NoType)
//Console.println("tpe = "+tpe+" prefix="+tpe.prefix)
//Console.println("singletontype?"+tpe.isInstanceOf[SingletonType])
//Console.println("constanttype? "+tpe.isInstanceOf[ConstantType])
if (tpe.isInstanceOf[SingletonType] && !tpe.isInstanceOf[ConstantType]) {
if (tpe.termSymbol.isModule) {// object
if (scrutineeTree.tpe <:< definitions.AnyRefClass.tpe)
Eq(gen.mkAttributedRef(tpe.termSymbol), scrutineeTree) // object
else
Equals(gen.mkAttributedRef(tpe.termSymbol), scrutineeTree) // object
} else {
//Console.print("111 ??")
//Console.println("tpe.prefix "+tpe.prefix)
//Console.println("tpe stable "+tpe.isStable)
//Console.println("tpe prefix stable "+tpe.prefix.isStable)
//val x = Equals(Apply(gen.mkAttributedRef(tpe./*?term?*/symbol), List()), scrutineeTree)
val x =
if(tpe.prefix ne NoPrefix) gen.mkIsInstanceOf(scrutineeTree, tpe)
else Equals(gen.mkAttributedRef(tpe.termSymbol), scrutineeTree)
//Console.println(" = "+x)
typed { x }
}
} else if (tpe.isInstanceOf[ConstantType]) {
val value = tpe.asInstanceOf[ConstantType].value
//if(false && value.isInstanceOf[NamedConstant])
// Equals(Ident(scrut), value.asInstanceOf[NamedConstant].tree) // constant
//assert(scrut.tpe <:< definitions.AnyRefClass.tpe, "stupid, should be caught by type checker "+value)
//else
if (value == Constant(null) && scrutineeTree.tpe <:< definitions.AnyRefClass.tpe)
Eq(scrutineeTree, Literal(value)) // constant
else
Equals(scrutineeTree, Literal(value)) // constant
} else if (scrutineeTree.tpe <:< tpe && tpe <:< definitions.AnyRefClass.tpe) {
//if(scrutineeTree.symbol.hasFlag(symtab.Flags.SYNTHETIC)) Literal(Constant(true)) else
NotNull(scrutineeTree)
} else
//Console.println(tpe.prefix.symbol.isTerm)
//Console.println(tpe./*?type?*/symbol)
//Console.println(tpe./*?type?*/symbol.linkedModuleOfClass)
gen.mkIsInstanceOf(scrutineeTree, tpe)
}
/** adds a test comparing the dynamic outer to the static outer */
final def addOuterCondition(cond:Tree, tpe2test: Type, scrutinee: Tree, handleOuter: Tree=>Tree) = {
val TypeRef(prefix,_,_) = tpe2test
//Console.println("addOuterCondition: "+prefix)
assert(prefix ne NoPrefix)
var theRef = prefix match {
case ThisType(clazz) => gen.mkAttributedThis(clazz)
case _ => gen.mkAttributedRef(prefix.prefix, prefix.termSymbol)
}
// needs explicitouter treatment
theRef = handleOuter(theRef)
val outerAcc = outerAccessor(tpe2test.typeSymbol)
if (outerAcc == NoSymbol) {
if (settings_debug) cunit.warning(scrutinee.pos, "no outer acc for "+tpe2test.typeSymbol)
cond
} else
And(cond,
Eq(Apply(Select(
gen.mkAsInstanceOf(scrutinee, tpe2test, true), outerAcc),List()), theRef))
}
}
|