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
|
/* ____ ____ ____ ____ ______ *\
** / __// __ \/ __// __ \/ ____/ SOcos COmpiles Scala **
** __\_ \/ /_/ / /__/ /_/ /\_ \ (c) 2002, LAMP/EPFL **
** /_____/\____/\___/\____/____/ **
\* */
// $Id$
package scalac.typechecker;
import scalac.Global;
import scalac.ApplicationError;
import scalac.*;
import scalac.util.*;
import scalac.ast.*;
import scalac.symtab.*;
public class Infer implements Modifiers, Kinds {
Global global;
Definitions definitions;
TreeGen gen;
TreeFactory make;
Substituter substituter;
public Infer(Global global, TreeGen gen, TreeFactory make) {
this.global = global;
this.definitions = global.definitions;
this.gen = gen;
this.make = make;
this.substituter = new Substituter(global, gen);
}
public Infer(Transformer trans) {
this(trans.global, trans.gen, trans.make);
}
// Error messages -------------------------------------------------------------
String applyErrorMsg(String msg1, Tree fn,
String msg2, Type[] argtypes, Type pt) {
return msg1 + toString(fn.symbol(), fn.type) + msg2 +
ArrayApply.toString(argtypes, "(", ",", ")") +
(pt == Type.AnyType ? "" : " with expected result type " + pt);
}
String typeErrorMsg(String msg, Type found, Type req) {
return msg +
";\n found : " + found.toLongString() +
"\n required: " + req;
}
String overloadResolveErrorMsg(Symbol sym1, Type tpe1, Symbol sym2, Type tpe2) {
return "ambiguous reference to overloaded definition,\n" +
"both " + sym1 + ": " + tpe1 + "\n" +
"and " + sym2 + ": " + tpe2 + " match.";
}
/** Give a string representation of symbol `sym' with type `tp'
* for error diagnostics. `sym' may be null.
*/
static String toString(Symbol sym, Type tp) {
return
(tp instanceof Type.OverloadedType ? "overloaded " : "") +
(sym == null ? "expression" : sym) + " of type " + tp;
}
// Helper definitions ---------------------------------------------------------
/** Is type `tp' a polymorphic method type?
*/
private boolean isPolymorphic(Type tp) {
return tp.typeParams().length > 0;
}
/** Is type `tp' a parameterized method type?
*/
boolean isParameterized(Type tp) {
switch (tp) {
case MethodType(_, _): return true;
default: return isPolymorphic(tp);
}
}
// Tree Substitution -------------------------------------------------------------
static class Substituter extends Transformer {
Symbol[] tparams;
Type[] targs;
TreeGen gen;
Type.SubstTypeMap typeSubstituter;
public Substituter(Global global, TreeGen gen) {
super(global);
this.gen = gen;
}
public Tree apply(Tree tree, Symbol[] tparams, Type[] targs) {
this.tparams = tparams;
this.targs = targs;
this.typeSubstituter = new Type.SubstTypeMap(tparams, targs) {
public boolean matches(Symbol sym1, Symbol sym2) {
return
sym1.name == sym2.name && sym1.owner() == sym2.owner();
}
};
return transform(tree);
}
Type.Map elimInferredPolyMap = new Type.Map() {
public Type apply(Type t) {
switch (t) {
case PolyType(Symbol[] tparams1, Type restp):
if (tparams1.length == tparams.length &&
tparams1[0] == tparams[0]) {
for (int i = 1; i < tparams.length; i++)
assert tparams1[i] == tparams[i];
return apply(restp);
}
}
return map(t);
}
};
public Tree transform(Tree tree) {
// System.out.println("[" + ArrayApply.toString(targs,"",",","") + "/" + ArrayApply.toString(tparams,"",",","") + "]" + tree + "@" + tree.symbol());//DEBUG
if (tree.type != null) {
tree.type = typeSubstituter.apply(
elimInferredPolyMap.apply(tree.type));
}
switch (tree) {
case Ident(Name name):
if (name.isTypeName()) {
Symbol sym = tree.symbol();
for (int i = 0; i < tparams.length; i++) {
if (typeSubstituter.matches(tparams[i], sym)) {
return gen.mkType(tree.pos, targs[i]);
}
}
}
return tree;
/*
case TypeTerm():
Symbol sym = tree.type.symbol();
for (int i = 0; i < tparams.length; i++) {
if (tparams[i].name == sym.name &&
tparams[i].owner() == sym.owner()) {
return gen.mkType(tree.pos, targs[i]);
}
}
return tree;
*/
default:
return super.transform(tree);
}
}
}
// Type parameter inference -----------------------------------------------------
private static class NoInstance extends RuntimeException {
NoInstance(String msg) {
super(msg);
}
}
/** map every TypeVar to its constraint.inst field.
* throw a NoInstance exception if a NoType or AnyType is encountered.
*/
private static Type.Map instantiateMap = new Type.Map() {
public Type apply(Type t) {
return instantiate(t);
}
};
private static Type instantiate(Type tp) throws NoInstance {
switch (tp) {
case AnyType:
case NoType:
throw new NoInstance("undetermined type");
case TypeVar(Type origin, Type.Constraint constr):
if (constr.inst != Type.NoType) return instantiate(constr.inst);
else throw new NoInstance("no unique instantiation of type variable " +
origin + " could be found");
default:
return instantiateMap.map(tp);
}
}
/** Map type variable to its instance, or, if `covariant' is true,
* to its upper bound;
*/
private Type instantiateUpper(Type tp, boolean covariant) {
switch (tp) {
case TypeVar(Type origin, Type.Constraint constr):
try {
if (constr.inst != Type.NoType) {
return instantiate(constr.inst);
} else if (covariant && constr.hibounds != Type.List.EMPTY) {
maximizeVar(tp);
return instantiate(constr.inst);
}
} catch (NoInstance ex) {
}
return Type.AnyType;
default:
throw new ApplicationError();
}
}
/** The formal parameter types corresponding to `params'.
* If `params' is a repeated parameter, a list of `length' copies
* of its type is returned.
*/
public Type[] formalTypes(Symbol[] params, int length) {
Type[] result;
if (params.length == 1 && (params[0].flags & REPEATED) != 0) {
Type[] formals = new Type[length];
Type ft = params[0].type().typeArgs()[0];
// params[0] has type Seq[T], we need T here
for (int i = 0; i < length; i++) formals[i] = ft;
return formals;
} else {
return Symbol.type(params);
}
}
/** Is type fully defined, i.e. no embedded anytypes or typevars in it?
*/
public boolean isFullyDefined(Type tp) {
try {
instantiate(tp);
return true;
} catch (NoInstance ex) {
return false;
}
}
/** Do type arguments `targs' conform to formal parameters `tparams'?
*/
private boolean isWithinBounds(Symbol[] tparams, Type[] targs) {
for (int i = 0; i < targs.length; i++) {
if (!targs[i].isSubType(tparams[i].info().subst(tparams, targs)) ||
!tparams[i].loBound().subst(tparams, targs).isSubType(targs[i]))
return false;
}
return true;
}
/** throw a type error if arguments not within bounds.
*/
void checkBounds(Symbol[] tparams, Type[] targs, String prefix) {
if (!isWithinBounds(tparams, targs)) {
throw new Type.Error(
prefix + "type arguments " +
ArrayApply.toString(targs, "[", ",", "]") + " do not conform to " +
tparams[0].owner() + "'s type parameter bounds " +
ArrayApply.toString(Symbol.defString(tparams), "[", ",", "]"));
}
}
/** Instantiate variable to glb of its high bounds.
*/
private void maximizeVar(Type tp) {
switch (tp) {
case TypeVar(Type origin, Type.Constraint constr):
if (constr.inst == Type.NoType)
constr.inst = Type.glb(constr.hibounds.toArray());
break;
default:
throw new ApplicationError();
}
}
/** Instantiate variable to lub of its low bounds.
*/
private void minimizeVar(Type tp) {
switch (tp) {
case TypeVar(Type origin, Type.Constraint constr):
if (constr.inst == Type.NoType)
constr.inst = Type.lub(constr.lobounds.toArray());
break;
default:
throw new ApplicationError();
}
}
private void solveUpper(Symbol[] tparams, Type[] tvars, int i)
throws NoInstance {
if (tvars[i] != Type.NoType) {
switch (tvars[i]) {
case TypeVar(Type origin, Type.Constraint constr):
if (constr.inst != Type.NoType) {
constr.inst = tvars[i] = instantiate(constr.inst);
} else {
Type tvar = tvars[i];
tvars[i] = Type.NoType;
Type bound = tparams[i].info();
boolean cyclic = false;
for (int j = 0; j < tvars.length; j++) {
if (bound.contains(tparams[j]) ||
tparams[j].loBound().isSameAs(tparams[i].type())) {
cyclic |= tvars[j] == Type.NoType;
solveUpper(tparams, tvars, j);
}
}
if (!cyclic) {
constr.hibounds = new Type.List(
bound.subst(tparams, tvars), constr.hibounds);
for (int j = 0; j < tvars.length; j++) {
if (tparams[j].loBound().isSameAs(tparams[i].type())) {
constr.hibounds = new Type.List(
tparams[j].type().subst(tparams, tvars),
constr.hibounds);
}
}
}
maximizeVar(tvar);
tvars[i] = ((Type.TypeVar) tvar).constr.inst;
}
}
}
}
private void solveLower(Symbol[] tparams, Type[] tvars, int i)
throws NoInstance {
if (tvars[i] != Type.NoType) {
switch (tvars[i]) {
case TypeVar(Type origin, Type.Constraint constr):
if (constr.inst != Type.NoType) {
constr.inst = tvars[i] = instantiate(constr.inst);
} else {
Type tvar = tvars[i];
tvars[i] = Type.NoType;
Type bound = tparams[i].loBound();
if (bound != Global.instance.definitions.ALL_TYPE) {
boolean cyclic = false;
for (int j = 0; j < tvars.length; j++) {
if (bound.contains(tparams[j]) ||
tparams[j].info().isSameAs(tparams[i].type())) {
cyclic |= tvars[j] == Type.NoType;
solveLower(tparams, tvars, j);
}
}
assert !cyclic;
if (!cyclic) {
constr.lobounds = new Type.List(
bound.subst(tparams, tvars), constr.lobounds);
for (int j = 0; j < tvars.length; j++) {
if (tparams[j].info().isSameAs(tparams[i].type())) {
constr.lobounds = new Type.List(
tparams[j].type().subst(tparams, tvars),
constr.lobounds);
}
}
}
}
minimizeVar(tvar);
tvars[i] = ((Type.TypeVar) tvar).constr.inst;
//System.out.println("solve lower " + tparams[i] + "=" + tvars[i]);//DEBUG
}
}
}
}
private Type[] freshVars(Symbol[] tparams) {
Type[] tvars = new Type[tparams.length];
for (int i = 0; i < tvars.length; i++) {
tvars[i] = Type.TypeVar(tparams[i].type(), new Type.Constraint());
}
return tvars;
}
private Type.Map freshInstanceMap = new Type.Map() {
public Type apply(Type t) {
switch (t) {
case PolyType(Symbol[] tparams, Type restp):
Type restp1 = apply(restp);
Symbol[] tparams1 = Symbol.EMPTY_ARRAY;
Symbol[] newparams1 = Symbol.EMPTY_ARRAY;
switch (restp1) {
case PolyType(_, _):
// If there is a nested polytype, we need to
// substitute also its new type parameters for its old ones
// here. Reason: The outer polytype may refer to type
// variables of the inner one.
tparams1 = restp.typeParams();
newparams1 = restp1.typeParams();
}
Symbol[] newparams = new Symbol[tparams.length];
for (int i = 0; i < tparams.length; i++)
newparams[i] = tparams[i].cloneSymbol();
for (int i = 0; i < tparams.length; i++) {
newparams[i].setInfo(
newparams[i].info()
.subst(tparams, newparams)
.subst(tparams1, newparams1));
newparams[i].setLoBound(
newparams[i].loBound()
.subst(tparams, newparams)
.subst(tparams1, newparams1));
}
return Type.PolyType(
newparams, restp1.subst(tparams, newparams));
case OverloadedType(_, _):
return map(t);
default:
return t;
}
}
};
public Type freshInstance(Type tp) {
return freshInstanceMap.apply(tp);
}
/** Automatically perform the following conversions on expression types:
* A method type becomes the corresponding function type.
* A nullary method type becomes its result type.
*/
private Type normalize(Type tp) {
switch (tp) {
case MethodType(Symbol[] params, Type restype):
return global.definitions.functionType(
Symbol.type(params), normalize(restype));
case PolyType(Symbol[] tparams, Type restype):
if (tparams.length == 0) return normalize(restype);
}
return tp;
}
/** Is normalized type `tp' a subtype of prototype `pt'?
*/
boolean isCompatible(Type tp, Type pt) {
return normalize(tp).isSubType(pt);
}
/** Type arguments mapped to `scala.All' are taken to be uninstantiated.
* Map all those type arguments to their corresponding type parameters
* and return all these type parameters as result.
*/
private Symbol[] normalizeArgs(Type[] targs, Symbol[] tparams) {
Type.List uninstantiated = Type.List.EMPTY;
for (int i = 0; i < targs.length; i++) {
if (targs[i] == Global.instance.definitions.ALL_TYPE) {
targs[i] = tparams[i].type();
uninstantiated = Type.List.append(uninstantiated, targs[i]);
}
}
return Type.symbol(uninstantiated.toArray());
}
/** Return inferred type arguments of polymorphic expression, given
* its type parameters and result type and a prototype `pt'.
* If no minimal type variables exist that make the
* instantiated type a subtype of `pt', return `null'.
*/
private Type[] exprTypeArgs(Symbol[] tparams, Type restype, Type pt) {
Type[] tvars = freshVars(tparams);
Type insttype = restype.subst(tparams, tvars);
if (isCompatible(insttype, pt)) {
try {
for (int i = 0; i < tvars.length; i++) {
solveLower(tparams, tvars, i);
}
return tvars;
} catch (NoInstance ex) {
}
}
return null;
}
/** Return inferred proto-type arguments of function, given
* its type and value parameters and result type, and a
* prototype `pt' for the function result.
* Type arguments need to be either determined precisely by
* the prototype, or they are maximized, if they occur only covariantly
* in the value parameter list.
* If instantiation of a type parameter fails,
* take Type.AnyType for the proto-type argument.
*/
public Type[] protoTypeArgs(Symbol[] tparams, Type restype, Type pt,
Symbol[] params) {
Type[] tvars = freshVars(tparams);
Type insttype = restype.subst(tparams, tvars);
Type[] targs = new Type[tvars.length];
for (int i = 0; i < tvars.length; i++) targs[i] = Type.AnyType;
if (isCompatible(insttype, pt)) {
try {
for (int i = 0; i < tvars.length; i++) {
targs[i] = instantiateUpper(
tvars[i], isVariant(tparams[i], params, 1));
}
return targs;
} catch (NoInstance ex) {
}
}
return targs;
}
/** Does given `tparam' occur with variance `v' in symbols?
*/
private boolean isVariant(Symbol tparam, Symbol[] syms, int v) {
for (int i = 0; i < syms.length; i++) {
if (!isVariant(tparam, syms[i], v)) return false;
}
return true;
}
/** Does given `tparam' occur with variance `v' in symbol?
*/
private boolean isVariant(Symbol tparam, Symbol sym, int v) {
switch (sym.kind) {
case ERROR:
return true;
case VAL:
return isVariant(tparam, sym.info(), v);
case TYPE:
return isVariant(tparam, sym.info(), v) &&
isVariant(tparam, sym.loBound(), -v);
case ALIAS:
return !sym.info().contains(tparam);
default:
return false;
}
}
/** Does given `tparam' occur with variance `v' in types?
*/
private boolean isVariant(Symbol tparam, Type[] tps, int v) {
for (int i = 0; i < tps.length; i++) {
if (!isVariant(tparam, tps[i], v)) return false;
}
return true;
}
/** Does given `tparam' occur with variance `v' in argument types `tps'
* which correspond to formal type parameters `tparams'?
*/
private boolean isVariantArgs(Symbol tvar, Type[] tps, Symbol[] tparams,
int v) {
for (int i = 0; i < tps.length; i++) {
if ((tparams[i].flags & COVARIANT) != 0) {
if (!isVariant(tvar, tps[i], v)) return false;
} else if ((tparams[i].flags & CONTRAVARIANT) != 0) {
if (!isVariant(tvar, tps[i], -v)) return false;
} else {
if (tps[i].contains(tvar)) return false;
}
}
return true;
}
/** Does given `tparam' occur with variance `v' in type?
*/
private boolean isVariant(Symbol tparam, Type tp, int v) {
switch (tp) {
case ErrorType:
case AnyType:
case NoType:
case ThisType(Symbol sym):
return true;
case TypeRef(Type pre, Symbol sym, Type[] args):
return isVariant(tparam, pre, v) &&
isVariantArgs(tparam, args, sym.typeParams(), v);
case SingleType(Type pre, Symbol sym):
return !pre.contains(tparam);
case CompoundType(Type[] parts, Scope members):
return isVariant(tparam, parts, v) &&
isVariant(tparam, members.elements(), v);
default:
throw new ApplicationError();
}
}
/** Return inferred type arguments, given type parameters, formal parameters,
* argument types, result type and expected result type.
* If this is not possible, throw a `NoInstance' exception, or, if
* `needToSucceed' is false alternatively return `null'.
* Undetermined type arguments are represented by `definitions.ALL_TYPE'.
* No check that inferred parameters conform to their bounds is made here.
*/
private Type[] methTypeArgs(Symbol[] tparams,
Symbol[] params, Type[] argtypes,
Type restp, Type pt,
boolean needToSucceed) throws NoInstance {
//System.out.println("methTypeArgs, tparams = " + ArrayApply.toString(tparams) + ", params = " + ArrayApply.toString(params) + ", type(params) = " + ArrayApply.toString(Symbol.type(params)) + ", argtypes = " + ArrayApply.toString(argtypes));//DEBUG
Type[] tvars = freshVars(tparams);
Type[] formals = formalTypes(params, argtypes.length);
if (formals.length != argtypes.length) {
if (needToSucceed)
throw new NoInstance("parameter lists differ in length");
return null;
}
// check first whether type variables can be fully defined from
// expected result type.
if (!isCompatible(restp.subst(tparams, tvars), pt)) {
if (needToSucceed)
throw new NoInstance("result type " + restp +
" is incompatible with expected type " + pt);
return null;
}
for (int i = 0; i < tvars.length; i++) {
Type.TypeVar tvar = (Type.TypeVar) tvars[i];
if (!isFullyDefined(tvar)) tvar.constr.inst = Type.NoType;
}
// Then define remaining type variables from argument types.
for (int i = 0; i < argtypes.length; i++) {
if (!isCompatible(argtypes[i].widen().subst(tparams, tvars),
formals[i].subst(tparams, tvars))) {
if (needToSucceed) {
if (global.explaintypes) {
Type.explainSwitch = true;
argtypes[i].widen().subst(tparams, tvars).isSubType(
formals[i].subst(tparams, tvars));
Type.explainSwitch = false;
}
throw new NoInstance(
typeErrorMsg(
"argument expression's type is not compatible with formal parameter type",
argtypes[i].widen().subst(tparams, tvars),
formals[i].subst(tparams, tvars)));
}
return null;
}
}
for (int i = 0; i < tvars.length; i++) {
solveLower(tparams, tvars, i);
}
//System.out.println(" = " + ArrayApply.toString(tvars));//DEBUG
return tvars;
}
/** Create and attribute type application node. Pass arguments for that
* `tparams' prefix which is owned by the tree's symbol. If there are remaining
* type parameters, substitute corresponding type arguments for them in the
* tree. Such remaining type parameters always come from an inferred PolyType.
*/
public Tree mkTypeApply(Tree tree, Symbol[] tparams, Type restype, Type[] targs) {
Tree tree1 = tree;
Symbol sym = tree.symbol();
int i = 0;
while (i < tparams.length && tparams[i].owner() == sym)
i++;
if (i < tparams.length) {
//new Printer().print(tree1);//DEBUG
//System.out.println(ArrayApply.toString(targs) + "/" + i + "/" + ArrayApply.toString(tparams));//DEBUG
Symbol[] tparams1 = new Symbol[tparams.length - i];
System.arraycopy(tparams, i, tparams1, 0, tparams1.length);
Type[] targs1 = new Type[tparams.length - i];
System.arraycopy(targs, i, targs1, 0, targs1.length);
tree1 = substituter.apply(tree1, tparams1, targs1);
}
if (0 < i) {
Tree[] argtrees = new Tree[i];
for (int j = 0; j < i; j++)
argtrees[j] = gen.mkType(tree.pos, targs[j]);
tree1 = make.TypeApply(tree.pos, tree1, argtrees);
}
//System.out.println(Sourcefile.files[Position.file(tree1.pos)] + ": ");
return tree1.setType(restype.subst(tparams, targs));
}
/** Return the instantiated and normalized type of polymorphic expression
* with type `[tparams]restype', given two prototypes `pt1', and `pt2'.
* `pt1' is the strict first attempt prototype where type parameters
* are left unchanged. `pt2' is the fall-back prototype where type parameters
* are replaced by `AnyType's. We try to instantiate first to `pt1' and then,
* if this fails, to `pt2'. If both attempts fail, a Type.Error is thrown.
*/
Type argumentTypeInstance(Symbol[] tparams, Type restype, Type pt1, Type pt2)
throws Type.Error {
switch (restype) {
case PolyType(Symbol[] tparams1, Type restype1):
Symbol[] tparams2 = new Symbol[tparams.length + tparams1.length];
System.arraycopy(tparams, 0, tparams2, 0, tparams.length);
System.arraycopy(tparams1, 0, tparams2, tparams.length, tparams1.length);
return argumentTypeInstance(tparams2, restype1, pt1, pt2);
default:
if (tparams.length != 0) {
Type[] targs = exprTypeArgs(tparams, restype, pt1);
if (targs == null)
targs = exprTypeArgs(tparams, restype, pt2);
if (targs == null)
throw new Type.Error(
typeErrorMsg(
"polymorphic argument cannot be instantiated to formal parameter type",
Type.PolyType(tparams, restype), pt2));
checkBounds(tparams, targs, "inferred ");
return restype.subst(tparams, targs);
} else {
return normalize(restype);
}
}
}
/** Instantiate expression `tree' of polymorphic type [tparams]restype,
* using prototype `pt'.
*/
public Tree exprInstance(Tree tree, Symbol[] tparams, Type restype, Type pt)
throws Type.Error {
switch (restype) {
case PolyType(Symbol[] tparams1, Type restype1):
Symbol[] tparams2 = new Symbol[tparams.length + tparams1.length];
System.arraycopy(tparams, 0, tparams2, 0, tparams.length);
System.arraycopy(tparams1, 0, tparams2, tparams.length, tparams1.length);
return exprInstance(tree, tparams2, restype1, pt);
}
Type[] targs = exprTypeArgs(tparams, restype, pt);
if (targs == null)
throw new Type.Error(
"polymorphic expression of type " + tree.type +
" cannot be instantiated from expected type " + pt);
checkBounds(tparams, targs, "inferred ");
return mkTypeApply(tree, tparams, restype, targs);
}
/** Instantiate method `tree' of polymorphic type [tparams]restype,
* so that resulting method type can be applied to arguments with
* types `argtypes' and its result type is compatible with `pt'.
*/
public Tree methodInstance(Tree tree,
Symbol[] tparams, Type restype,
Type[] argtypes, Type pt)
throws Type.Error {
switch (restype) {
case PolyType(Symbol[] tparams1, Type restype1):
Symbol[] tparams2 = new Symbol[tparams.length + tparams1.length];
System.arraycopy(tparams, 0, tparams2, 0, tparams.length);
System.arraycopy(tparams1, 0, tparams2, tparams.length, tparams1.length);
return methodInstance(tree, tparams2, restype1, argtypes, pt);
case MethodType(Symbol[] params, Type restpe):
Type[] targs;
try {
targs = methTypeArgs(tparams, params, argtypes, restpe, pt, true);
} catch (NoInstance ex) {
throw new Type.Error(
applyErrorMsg(
"no type parameters for ", tree,
" exist so that it can be applied to arguments ",
Type.widen(argtypes), Type.AnyType) +
"\n --- because ---\n" + ex.getMessage());
}
Symbol[] uninstantiated = normalizeArgs(targs, tparams);
checkBounds(tparams, targs, "inferred ");
Type restype1 = (uninstantiated.length == 0)
? restype
: Type.MethodType(
params, Type.PolyType(uninstantiated, restpe));
return mkTypeApply(tree, tparams, restype1, targs);
default:
return tree;
}
}
/** Instantiate constructor `tree' of polymorphic type [tparams]restype',
* so that its the result type of `restype' matches prototype `pt'.
* If constructor is polymorphic, maximize all type variables under this
* condition.
*/
public void constructorInstance(Tree tree,
Symbol[] tparams, Type restype, Type pt)
throws Type.Error {
switch (restype) {
case PolyType(Symbol[] tparams1, Type restype1):
Symbol[] tparams2 = new Symbol[tparams.length + tparams1.length];
System.arraycopy(tparams, 0, tparams2, 0, tparams.length);
System.arraycopy(tparams1, 0, tparams2, tparams.length, tparams1.length);
constructorInstance(tree, tparams2, restype1, pt);
return;
}
Type[] tvars = freshVars(tparams);
Type restype1 = restype.subst(tparams, tvars);
Type ctpe1 = restype1.resultType();
if (ctpe1.isSubType(pt)) {
try {
for (int i = 0; i < tvars.length; i++) {
solveUpper(tparams, tvars, i);
}
checkBounds(tparams, tvars, "inferred ");
tree.setType(restype.subst(tparams, tvars));
//System.out.println("inferred constructor type: " + tree.type);//DEBUG
} catch (NoInstance ex) {
throw new Type.Error(
"constructor of type " + ctpe1 +
" can be instantiated in more than one way to expected type " +
pt +
"\n --- because ---\n" + ex.getMessage());
}
} else {
throw new Type.Error(
typeErrorMsg(
"constructor cannot be instantiated to expected type",
ctpe1, pt));
}
}
// Overload Resolution -------------------------------------------------------------
/** Is function type `ftpe' applicable to `argtypes' and
* does its result conform to `pt'?
*/
boolean isApplicable(Type ftpe, Type[] argtypes, Type pt) {
switch (ftpe) {
case MethodType(Symbol[] params, Type restpe):
Type[] formals = formalTypes(params, argtypes.length);
return
isCompatible(restpe, pt) &&
formals.length == argtypes.length &&
Type.isSubType(argtypes, formals);
case PolyType(Symbol[] tparams, MethodType(Symbol[] params, Type restpe)):
try {
Type[] targs = methTypeArgs(
tparams, params, argtypes, restpe, pt, false);
if (targs != null) {
Symbol[] uninstantiated = normalizeArgs(targs, tparams);
return
isWithinBounds(tparams, targs) &&
exprTypeArgs(uninstantiated, restpe.subst(tparams, targs), pt)
!= null;
}
} catch (NoInstance ex) {
}
}
return false;
}
/** Does function type `ftpe1' specialize function type `ftpe2'
* when both are alternatives in an overloaded function?
*/
boolean specializes(Type ftpe1, Type ftpe2) {
switch (ftpe1) {
case MethodType(Symbol[] params, _):
return isApplicable(ftpe2, Symbol.type(params), Type.AnyType);
case PolyType(_, MethodType(Symbol[] params, _)):
return isApplicable(ftpe2, Symbol.type(params), Type.AnyType);
default:
return false;
}
}
/** Assign `tree' the type of the alternative which matches
* prototype `pt', if it exists.
* If several alternatives match `pt', take unique parameterless one.
* Throw a Type.Error if several such alternatives exist.
* If no alternative matches, leave `tree' unchanged.
*/
public void exprAlternative(Tree tree, Symbol[] alts,
Type[] alttypes, Type pt)
throws Type.Error {
// first, catch the case of a missing parameter
// list for an overloaded constructor.
if (alts.length > 0) {
int i = 0;
while (i < alts.length &&
alts[i].isConstructor() &&
alttypes[i] instanceof Type.MethodType)
i++;
if (i == alts.length)
throw new Type.Error("missing arguments for " + alts[0]);
}
// then catch the case of a single alternative.
if (alts.length == 1) {
tree.setSymbol(alts[0]).setType(alttypes[0]);
return;
}
// finally, do the normal case.
int best = -1;
for (int i = 0; i < alttypes.length; i++) {
if (isCompatible(alttypes[i], pt) &&
(best < 0 || improves(alttypes[i], alttypes[best]))) {
best = i;
}
}
if (best >= 0) {
for (int i = 0; i < alttypes.length; i++) {
if (isCompatible(alttypes[i], pt) &&
best != i && !improves(alttypes[best], alttypes[i])) {
throw new Type.Error(overloadResolveErrorMsg(
alts[best], alttypes[best], alts[i], alttypes[i]));
}
}
tree.setSymbol(alts[best]).setType(alttypes[best]);
}
}
//where
private boolean improves(Type tp1, Type tp2) {
return !isParameterized(tp1) && isParameterized(tp2);
}
/** Assign `tree' the type of an alternative
* which is applicable to `argtypes', and whose result type is
* a subtype of `pt' if it exists.
* If several applicable alternatives exist, take the
* most specialized one, or throw an error if no
* most specialized applicable alternative exists.
* If no alternative matches, leave `tree' unchanged.
*/
public void methodAlternative(Tree tree, Symbol[] alts, Type[] alttypes,
Type[] argtypes, Type pt)
throws Type.Error {
if (alts.length == 1) {
tree.setSymbol(alts[0]).setType(alttypes[0]);
return;
}
int best = -1;
for (int i = 0; i < alttypes.length; i++) {
if (isApplicable(alttypes[i], argtypes, pt) &&
(best < 0 || specializes(alttypes[i], alttypes[best]))) best = i;
}
if (best >= 0) {
for (int i = 0; i < alttypes.length; i++) {
if (i != best &&
isApplicable(alttypes[i], argtypes, pt) &&
!(specializes(alttypes[best], alttypes[i]) &&
!specializes(alttypes[i], alttypes[best]))) {
throw new Type.Error(overloadResolveErrorMsg(
alts[best], alttypes[best], alts[i], alttypes[i]));
}
}
tree.setSymbol(alts[best]).setType(alttypes[best]);
}
}
/** Assign `tree' the type of unique polymorphic alternative with `nparams'
* as the number of type parameters, if it exists.
* Throw error if several such polymorphic alternatives exist.
* If no alternative matches, leave `tree' unchanged.
*/
public void polyAlternative(Tree tree,
Symbol[] alts, Type[] alttypes, int nparams)
throws Type.Error {
if (alts.length == 1) {
tree.setSymbol(alts[0]).setType(alttypes[0]);
return;
}
int i = 0;
while (i < alttypes.length &&
!(alts[i].isValue() &&
alttypes[i].typeParams().length == nparams)) {
i++;
}
if (i < alttypes.length) {
for (int j = i + 1; j < alttypes.length; j++) {
if (alts[j].isValue() &&
alttypes[j].typeParams().length == nparams)
throw new Type.Error(overloadResolveErrorMsg(
alts[i], alttypes[i], alts[j], alttypes[j]));
}
tree.setSymbol(alts[i]).setType(alttypes[i]);
}
}
}
|