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
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
8165
8166
8167
8168
8169
8170
8171
8172
8173
8174
8175
8176
8177
8178
8179
8180
8181
8182
8183
8184
8185
8186
8187
8188
8189
8190
8191
8192
8193
8194
8195
8196
8197
8198
8199
8200
8201
8202
8203
8204
8205
8206
8207
8208
8209
8210
8211
8212
8213
8214
8215
8216
8217
8218
8219
8220
8221
8222
8223
8224
8225
8226
8227
8228
8229
8230
8231
8232
8233
8234
8235
8236
8237
8238
8239
8240
8241
8242
8243
8244
8245
8246
8247
8248
8249
8250
8251
8252
8253
8254
8255
8256
8257
8258
8259
8260
8261
8262
8263
8264
8265
8266
8267
8268
8269
8270
8271
8272
8273
8274
8275
8276
8277
8278
8279
8280
8281
8282
8283
8284
8285
8286
8287
8288
8289
8290
8291
8292
8293
8294
8295
8296
8297
8298
8299
8300
8301
8302
8303
8304
8305
8306
8307
8308
8309
8310
8311
8312
8313
8314
8315
8316
8317
8318
8319
8320
8321
8322
8323
8324
8325
8326
8327
8328
8329
8330
8331
8332
8333
8334
8335
8336
8337
8338
8339
8340
8341
8342
8343
8344
8345
8346
8347
8348
8349
8350
8351
8352
8353
8354
8355
8356
8357
8358
8359
8360
8361
8362
8363
8364
8365
8366
8367
8368
8369
8370
8371
8372
8373
8374
8375
8376
8377
8378
8379
8380
8381
8382
8383
8384
8385
8386
8387
8388
8389
8390
8391
8392
8393
8394
8395
8396
8397
8398
8399
8400
8401
8402
8403
8404
8405
8406
8407
8408
8409
8410
8411
8412
8413
8414
8415
8416
8417
8418
8419
8420
8421
8422
8423
8424
8425
8426
8427
8428
8429
8430
8431
8432
8433
8434
8435
|
/**
* Defines `TemplateDeclaration`, `TemplateInstance` and a few utilities
*
* This modules holds the two main template types:
* `TemplateDeclaration`, which is the user-provided declaration of a template,
* and `TemplateInstance`, which is an instance of a `TemplateDeclaration`
* with specific arguments.
*
* Template_Parameter:
* Additionally, the classes for template parameters are defined in this module.
* The base class, `TemplateParameter`, is inherited by:
* - `TemplateTypeParameter`
* - `TemplateThisParameter`
* - `TemplateValueParameter`
* - `TemplateAliasParameter`
* - `TemplateTupleParameter`
*
* Templates_semantic:
* The start of the template instantiation process looks like this:
* - A `TypeInstance` or `TypeIdentifier` is encountered.
* `TypeInstance` have a bang (e.g. `Foo!(arg)`) while `TypeIdentifier` don't.
* - A `TemplateInstance` is instantiated
* - Semantic is run on the `TemplateInstance` (see `dmd.dsymbolsem`)
* - The `TemplateInstance` search for its `TemplateDeclaration`,
* runs semantic on the template arguments and deduce the best match
* among the possible overloads.
* - The `TemplateInstance` search for existing instances with the same
* arguments, and uses it if found.
* - Otherwise, the rest of semantic is run on the `TemplateInstance`.
*
* Copyright: Copyright (C) 1999-2022 by The D Language Foundation, All Rights Reserved
* Authors: $(LINK2 https://www.digitalmars.com, Walter Bright)
* License: $(LINK2 https://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
* Source: $(LINK2 https://github.com/dlang/dmd/blob/master/src/dmd/dtemplate.d, _dtemplate.d)
* Documentation: https://dlang.org/phobos/dmd_dtemplate.html
* Coverage: https://codecov.io/gh/dlang/dmd/src/master/src/dmd/dtemplate.d
*/
module dmd.dtemplate;
import core.stdc.stdio;
import core.stdc.string;
import dmd.aggregate;
import dmd.aliasthis;
import dmd.arraytypes;
import dmd.astenums;
import dmd.ast_node;
import dmd.dcast;
import dmd.dclass;
import dmd.declaration;
import dmd.dmangle;
import dmd.dmodule;
import dmd.dscope;
import dmd.dsymbol;
import dmd.dsymbolsem;
import dmd.errors;
import dmd.expression;
import dmd.expressionsem;
import dmd.func;
import dmd.globals;
import dmd.hdrgen;
import dmd.id;
import dmd.identifier;
import dmd.impcnvtab;
import dmd.init;
import dmd.initsem;
import dmd.mtype;
import dmd.opover;
import dmd.root.array;
import dmd.common.outbuffer;
import dmd.root.rootobject;
import dmd.semantic2;
import dmd.semantic3;
import dmd.tokens;
import dmd.typesem;
import dmd.visitor;
import dmd.templateparamsem;
//debug = FindExistingInstance; // print debug stats of findExistingInstance
private enum LOG = false;
enum IDX_NOTFOUND = 0x12345678;
pure nothrow @nogc
{
/********************************************
* These functions substitute for dynamic_cast. dynamic_cast does not work
* on earlier versions of gcc.
*/
extern (C++) inout(Expression) isExpression(inout RootObject o)
{
//return dynamic_cast<Expression *>(o);
if (!o || o.dyncast() != DYNCAST.expression)
return null;
return cast(inout(Expression))o;
}
extern (C++) inout(Dsymbol) isDsymbol(inout RootObject o)
{
//return dynamic_cast<Dsymbol *>(o);
if (!o || o.dyncast() != DYNCAST.dsymbol)
return null;
return cast(inout(Dsymbol))o;
}
extern (C++) inout(Type) isType(inout RootObject o)
{
//return dynamic_cast<Type *>(o);
if (!o || o.dyncast() != DYNCAST.type)
return null;
return cast(inout(Type))o;
}
extern (C++) inout(Tuple) isTuple(inout RootObject o)
{
//return dynamic_cast<Tuple *>(o);
if (!o || o.dyncast() != DYNCAST.tuple)
return null;
return cast(inout(Tuple))o;
}
extern (C++) inout(Parameter) isParameter(inout RootObject o)
{
//return dynamic_cast<Parameter *>(o);
if (!o || o.dyncast() != DYNCAST.parameter)
return null;
return cast(inout(Parameter))o;
}
extern (C++) inout(TemplateParameter) isTemplateParameter(inout RootObject o)
{
if (!o || o.dyncast() != DYNCAST.templateparameter)
return null;
return cast(inout(TemplateParameter))o;
}
/**************************************
* Is this Object an error?
*/
extern (C++) bool isError(const RootObject o)
{
if (const t = isType(o))
return (t.ty == Terror);
if (const e = isExpression(o))
return (e.op == EXP.error || !e.type || e.type.ty == Terror);
if (const v = isTuple(o))
return arrayObjectIsError(&v.objects);
const s = isDsymbol(o);
assert(s);
if (s.errors)
return true;
return s.parent ? isError(s.parent) : false;
}
/**************************************
* Are any of the Objects an error?
*/
bool arrayObjectIsError(const Objects* args)
{
foreach (const o; *args)
{
if (isError(o))
return true;
}
return false;
}
/***********************
* Try to get arg as a type.
*/
inout(Type) getType(inout RootObject o)
{
inout t = isType(o);
if (!t)
{
if (inout e = isExpression(o))
return e.type;
}
return t;
}
}
Dsymbol getDsymbol(RootObject oarg)
{
//printf("getDsymbol()\n");
//printf("e %p s %p t %p v %p\n", isExpression(oarg), isDsymbol(oarg), isType(oarg), isTuple(oarg));
if (auto ea = isExpression(oarg))
{
// Try to convert Expression to symbol
if (auto ve = ea.isVarExp())
return ve.var;
else if (auto fe = ea.isFuncExp())
return fe.td ? fe.td : fe.fd;
else if (auto te = ea.isTemplateExp())
return te.td;
else if (auto te = ea.isScopeExp())
return te.sds;
else
return null;
}
else
{
// Try to convert Type to symbol
if (auto ta = isType(oarg))
return ta.toDsymbol(null);
else
return isDsymbol(oarg); // if already a symbol
}
}
private Expression getValue(ref Dsymbol s)
{
if (s)
{
if (VarDeclaration v = s.isVarDeclaration())
{
if (v.storage_class & STC.manifest)
return v.getConstInitializer();
}
}
return null;
}
/***********************
* Try to get value from manifest constant
*/
private Expression getValue(Expression e)
{
if (!e)
return null;
if (auto ve = e.isVarExp())
{
if (auto v = ve.var.isVarDeclaration())
{
if (v.storage_class & STC.manifest)
{
e = v.getConstInitializer();
}
}
}
return e;
}
private Expression getExpression(RootObject o)
{
auto s = isDsymbol(o);
return s ? .getValue(s) : .getValue(isExpression(o));
}
/******************************
* If o1 matches o2, return true.
* Else, return false.
*/
private bool match(RootObject o1, RootObject o2)
{
enum log = false;
static if (log)
{
printf("match() o1 = %p %s (%d), o2 = %p %s (%d)\n",
o1, o1.toChars(), o1.dyncast(), o2, o2.toChars(), o2.dyncast());
}
/* A proper implementation of the various equals() overrides
* should make it possible to just do o1.equals(o2), but
* we'll do that another day.
*/
/* Manifest constants should be compared by their values,
* at least in template arguments.
*/
if (auto t1 = isType(o1))
{
auto t2 = isType(o2);
if (!t2)
goto Lnomatch;
static if (log)
{
printf("\tt1 = %s\n", t1.toChars());
printf("\tt2 = %s\n", t2.toChars());
}
if (!t1.equals(t2))
goto Lnomatch;
goto Lmatch;
}
if (auto e1 = getExpression(o1))
{
auto e2 = getExpression(o2);
if (!e2)
goto Lnomatch;
static if (log)
{
printf("\te1 = %s '%s' %s\n", e1.type ? e1.type.toChars() : "null", EXPtoString(e1.op).ptr, e1.toChars());
printf("\te2 = %s '%s' %s\n", e2.type ? e2.type.toChars() : "null", EXPtoString(e2.op).ptr, e2.toChars());
}
// two expressions can be equal although they do not have the same
// type; that happens when they have the same value. So check type
// as well as expression equality to ensure templates are properly
// matched.
if (!(e1.type && e2.type && e1.type.equals(e2.type)) || !e1.equals(e2))
goto Lnomatch;
goto Lmatch;
}
if (auto s1 = isDsymbol(o1))
{
auto s2 = isDsymbol(o2);
if (!s2)
goto Lnomatch;
static if (log)
{
printf("\ts1 = %s \n", s1.kind(), s1.toChars());
printf("\ts2 = %s \n", s2.kind(), s2.toChars());
}
if (!s1.equals(s2))
goto Lnomatch;
if (s1.parent != s2.parent && !s1.isFuncDeclaration() && !s2.isFuncDeclaration())
goto Lnomatch;
goto Lmatch;
}
if (auto u1 = isTuple(o1))
{
auto u2 = isTuple(o2);
if (!u2)
goto Lnomatch;
static if (log)
{
printf("\tu1 = %s\n", u1.toChars());
printf("\tu2 = %s\n", u2.toChars());
}
if (!arrayObjectMatch(&u1.objects, &u2.objects))
goto Lnomatch;
goto Lmatch;
}
Lmatch:
static if (log)
printf("\t. match\n");
return true;
Lnomatch:
static if (log)
printf("\t. nomatch\n");
return false;
}
/************************************
* Match an array of them.
*/
private bool arrayObjectMatch(Objects* oa1, Objects* oa2)
{
if (oa1 == oa2)
return true;
if (oa1.dim != oa2.dim)
return false;
immutable oa1dim = oa1.dim;
auto oa1d = (*oa1)[].ptr;
auto oa2d = (*oa2)[].ptr;
foreach (j; 0 .. oa1dim)
{
RootObject o1 = oa1d[j];
RootObject o2 = oa2d[j];
if (!match(o1, o2))
{
return false;
}
}
return true;
}
/************************************
* Return hash of Objects.
*/
private size_t arrayObjectHash(Objects* oa1)
{
import dmd.root.hash : mixHash;
size_t hash = 0;
foreach (o1; *oa1)
{
/* Must follow the logic of match()
*/
if (auto t1 = isType(o1))
hash = mixHash(hash, cast(size_t)t1.deco);
else if (auto e1 = getExpression(o1))
hash = mixHash(hash, expressionHash(e1));
else if (auto s1 = isDsymbol(o1))
{
auto fa1 = s1.isFuncAliasDeclaration();
if (fa1)
s1 = fa1.toAliasFunc();
hash = mixHash(hash, mixHash(cast(size_t)cast(void*)s1.getIdent(), cast(size_t)cast(void*)s1.parent));
}
else if (auto u1 = isTuple(o1))
hash = mixHash(hash, arrayObjectHash(&u1.objects));
}
return hash;
}
/************************************
* Computes hash of expression.
* Handles all Expression classes and MUST match their equals method,
* i.e. e1.equals(e2) implies expressionHash(e1) == expressionHash(e2).
*/
private size_t expressionHash(Expression e)
{
import dmd.root.ctfloat : CTFloat;
import dmd.root.hash : calcHash, mixHash;
switch (e.op)
{
case EXP.int64:
return cast(size_t) e.isIntegerExp().getInteger();
case EXP.float64:
return CTFloat.hash(e.isRealExp().value);
case EXP.complex80:
auto ce = e.isComplexExp();
return mixHash(CTFloat.hash(ce.toReal), CTFloat.hash(ce.toImaginary));
case EXP.identifier:
return cast(size_t)cast(void*) e.isIdentifierExp().ident;
case EXP.null_:
return cast(size_t)cast(void*) e.isNullExp().type;
case EXP.string_:
return calcHash(e.isStringExp.peekData());
case EXP.tuple:
{
auto te = e.isTupleExp();
size_t hash = 0;
hash += te.e0 ? expressionHash(te.e0) : 0;
foreach (elem; *te.exps)
hash = mixHash(hash, expressionHash(elem));
return hash;
}
case EXP.arrayLiteral:
{
auto ae = e.isArrayLiteralExp();
size_t hash;
foreach (i; 0 .. ae.elements.dim)
hash = mixHash(hash, expressionHash(ae[i]));
return hash;
}
case EXP.assocArrayLiteral:
{
auto ae = e.isAssocArrayLiteralExp();
size_t hash;
foreach (i; 0 .. ae.keys.dim)
// reduction needs associative op as keys are unsorted (use XOR)
hash ^= mixHash(expressionHash((*ae.keys)[i]), expressionHash((*ae.values)[i]));
return hash;
}
case EXP.structLiteral:
{
auto se = e.isStructLiteralExp();
size_t hash;
foreach (elem; *se.elements)
hash = mixHash(hash, elem ? expressionHash(elem) : 0);
return hash;
}
case EXP.variable:
return cast(size_t)cast(void*) e.isVarExp().var;
case EXP.function_:
return cast(size_t)cast(void*) e.isFuncExp().fd;
default:
// no custom equals for this expression
assert((&e.equals).funcptr is &RootObject.equals);
// equals based on identity
return cast(size_t)cast(void*) e;
}
}
RootObject objectSyntaxCopy(RootObject o)
{
if (!o)
return null;
if (Type t = isType(o))
return t.syntaxCopy();
if (Expression e = isExpression(o))
return e.syntaxCopy();
return o;
}
extern (C++) final class Tuple : RootObject
{
Objects objects;
extern (D) this() {}
/**
Params:
numObjects = The initial number of objects.
*/
extern (D) this(size_t numObjects)
{
objects.setDim(numObjects);
}
// kludge for template.isType()
override DYNCAST dyncast() const
{
return DYNCAST.tuple;
}
override const(char)* toChars() const
{
return objects.toChars();
}
}
struct TemplatePrevious
{
TemplatePrevious* prev;
Scope* sc;
Objects* dedargs;
}
/***********************************************************
* [mixin] template Identifier (parameters) [Constraint]
* https://dlang.org/spec/template.html
* https://dlang.org/spec/template-mixin.html
*/
extern (C++) final class TemplateDeclaration : ScopeDsymbol
{
import dmd.root.array : Array;
TemplateParameters* parameters; // array of TemplateParameter's
TemplateParameters* origParameters; // originals for Ddoc
Expression constraint;
// Hash table to look up TemplateInstance's of this TemplateDeclaration
TemplateInstance[TemplateInstanceBox] instances;
TemplateDeclaration overnext; // next overloaded TemplateDeclaration
TemplateDeclaration overroot; // first in overnext list
FuncDeclaration funcroot; // first function in unified overload list
Dsymbol onemember; // if !=null then one member of this template
bool literal; // this template declaration is a literal
bool ismixin; // this is a mixin template declaration
bool isstatic; // this is static template declaration
bool isTrivialAliasSeq; /// matches pattern `template AliasSeq(T...) { alias AliasSeq = T; }`
bool isTrivialAlias; /// matches pattern `template Alias(T) { alias Alias = qualifiers(T); }`
bool deprecated_; /// this template declaration is deprecated
Visibility visibility;
int inuse; /// for recursive expansion detection
// threaded list of previous instantiation attempts on stack
TemplatePrevious* previous;
private Expression lastConstraint; /// the constraint after the last failed evaluation
private Array!Expression lastConstraintNegs; /// its negative parts
private Objects* lastConstraintTiargs; /// template instance arguments for `lastConstraint`
extern (D) this(const ref Loc loc, Identifier ident, TemplateParameters* parameters, Expression constraint, Dsymbols* decldefs, bool ismixin = false, bool literal = false)
{
super(loc, ident);
static if (LOG)
{
printf("TemplateDeclaration(this = %p, id = '%s')\n", this, ident.toChars());
}
version (none)
{
if (parameters)
for (int i = 0; i < parameters.dim; i++)
{
TemplateParameter tp = (*parameters)[i];
//printf("\tparameter[%d] = %p\n", i, tp);
TemplateTypeParameter ttp = tp.isTemplateTypeParameter();
if (ttp)
{
printf("\tparameter[%d] = %s : %s\n", i, tp.ident.toChars(), ttp.specType ? ttp.specType.toChars() : "");
}
}
}
this.parameters = parameters;
this.origParameters = parameters;
this.constraint = constraint;
this.members = decldefs;
this.literal = literal;
this.ismixin = ismixin;
this.isstatic = true;
this.visibility = Visibility(Visibility.Kind.undefined);
// Compute in advance for Ddoc's use
// https://issues.dlang.org/show_bug.cgi?id=11153: ident could be NULL if parsing fails.
if (!members || !ident)
return;
Dsymbol s;
if (!Dsymbol.oneMembers(members, &s, ident) || !s)
return;
onemember = s;
s.parent = this;
/* Set isTrivialAliasSeq if this fits the pattern:
* template AliasSeq(T...) { alias AliasSeq = T; }
* or set isTrivialAlias if this fits the pattern:
* template Alias(T) { alias Alias = qualifiers(T); }
*/
if (!(parameters && parameters.length == 1))
return;
auto ad = s.isAliasDeclaration();
if (!ad || !ad.type)
return;
auto ti = ad.type.isTypeIdentifier();
if (!ti || ti.idents.length != 0)
return;
if (auto ttp = (*parameters)[0].isTemplateTupleParameter())
{
if (ti.ident is ttp.ident &&
ti.mod == 0)
{
//printf("found isTrivialAliasSeq %s %s\n", s.toChars(), ad.type.toChars());
isTrivialAliasSeq = true;
}
}
else if (auto ttp = (*parameters)[0].isTemplateTypeParameter())
{
if (ti.ident is ttp.ident)
{
//printf("found isTrivialAlias %s %s\n", s.toChars(), ad.type.toChars());
isTrivialAlias = true;
}
}
}
override TemplateDeclaration syntaxCopy(Dsymbol)
{
//printf("TemplateDeclaration.syntaxCopy()\n");
TemplateParameters* p = null;
if (parameters)
{
p = new TemplateParameters(parameters.dim);
foreach (i, ref param; *p)
param = (*parameters)[i].syntaxCopy();
}
return new TemplateDeclaration(loc, ident, p, constraint ? constraint.syntaxCopy() : null, Dsymbol.arraySyntaxCopy(members), ismixin, literal);
}
/**********************************
* Overload existing TemplateDeclaration 'this' with the new one 's'.
* Return true if successful; i.e. no conflict.
*/
override bool overloadInsert(Dsymbol s)
{
static if (LOG)
{
printf("TemplateDeclaration.overloadInsert('%s')\n", s.toChars());
}
FuncDeclaration fd = s.isFuncDeclaration();
if (fd)
{
if (funcroot)
return funcroot.overloadInsert(fd);
funcroot = fd;
return funcroot.overloadInsert(this);
}
// https://issues.dlang.org/show_bug.cgi?id=15795
// if candidate is an alias and its sema is not run then
// insertion can fail because the thing it alias is not known
if (AliasDeclaration ad = s.isAliasDeclaration())
{
if (s._scope)
aliasSemantic(ad, s._scope);
if (ad.aliassym && ad.aliassym is this)
return false;
}
TemplateDeclaration td = s.toAlias().isTemplateDeclaration();
if (!td)
return false;
TemplateDeclaration pthis = this;
TemplateDeclaration* ptd;
for (ptd = &pthis; *ptd; ptd = &(*ptd).overnext)
{
}
td.overroot = this;
*ptd = td;
static if (LOG)
{
printf("\ttrue: no conflict\n");
}
return true;
}
override bool hasStaticCtorOrDtor()
{
return false; // don't scan uninstantiated templates
}
override const(char)* kind() const
{
return (onemember && onemember.isAggregateDeclaration()) ? onemember.kind() : "template";
}
override const(char)* toChars() const
{
return toCharsMaybeConstraints(true);
}
/****************************
* Similar to `toChars`, but does not print the template constraints
*/
const(char)* toCharsNoConstraints() const
{
return toCharsMaybeConstraints(false);
}
const(char)* toCharsMaybeConstraints(bool includeConstraints) const
{
if (literal)
return Dsymbol.toChars();
OutBuffer buf;
HdrGenState hgs;
buf.writestring(ident.toString());
buf.writeByte('(');
foreach (i, const tp; *parameters)
{
if (i)
buf.writestring(", ");
.toCBuffer(tp, &buf, &hgs);
}
buf.writeByte(')');
if (onemember)
{
const FuncDeclaration fd = onemember.isFuncDeclaration();
if (fd && fd.type)
{
TypeFunction tf = cast(TypeFunction)fd.type;
buf.writestring(parametersTypeToChars(tf.parameterList));
}
}
if (includeConstraints &&
constraint)
{
buf.writestring(" if (");
.toCBuffer(constraint, &buf, &hgs);
buf.writeByte(')');
}
return buf.extractChars();
}
override Visibility visible() pure nothrow @nogc @safe
{
return visibility;
}
/****************************
* Check to see if constraint is satisfied.
*/
extern (D) bool evaluateConstraint(TemplateInstance ti, Scope* sc, Scope* paramscope, Objects* dedargs, FuncDeclaration fd)
{
/* Detect recursive attempts to instantiate this template declaration,
* https://issues.dlang.org/show_bug.cgi?id=4072
* void foo(T)(T x) if (is(typeof(foo(x)))) { }
* static assert(!is(typeof(foo(7))));
* Recursive attempts are regarded as a constraint failure.
*/
/* There's a chicken-and-egg problem here. We don't know yet if this template
* instantiation will be a local one (enclosing is set), and we won't know until
* after selecting the correct template. Thus, function we're nesting inside
* is not on the sc scope chain, and this can cause errors in FuncDeclaration.getLevel().
* Workaround the problem by setting a flag to relax the checking on frame errors.
*/
for (TemplatePrevious* p = previous; p; p = p.prev)
{
if (!arrayObjectMatch(p.dedargs, dedargs))
continue;
//printf("recursive, no match p.sc=%p %p %s\n", p.sc, this, this.toChars());
/* It must be a subscope of p.sc, other scope chains are not recursive
* instantiations.
* the chain of enclosing scopes is broken by paramscope (its enclosing
* scope is _scope, but paramscope.callsc is the instantiating scope). So
* it's good enough to check the chain of callsc
*/
for (Scope* scx = paramscope.callsc; scx; scx = scx.callsc)
{
// The first scx might be identical for nested eponymeous templates, e.g.
// template foo() { void foo()() {...} }
if (scx == p.sc && scx !is paramscope.callsc)
return false;
}
/* BUG: should also check for ref param differences
*/
}
TemplatePrevious pr;
pr.prev = previous;
pr.sc = paramscope.callsc;
pr.dedargs = dedargs;
previous = ≺ // add this to threaded list
Scope* scx = paramscope.push(ti);
scx.parent = ti;
scx.tinst = null;
scx.minst = null;
// Set SCOPE.constraint before declaring function parameters for the static condition
// (previously, this was immediately before calling evalStaticCondition), so the
// semantic pass knows not to issue deprecation warnings for these throw-away decls.
// https://issues.dlang.org/show_bug.cgi?id=21831
scx.flags |= SCOPE.constraint;
assert(!ti.symtab);
if (fd)
{
/* Declare all the function parameters as variables and add them to the scope
* Making parameters is similar to FuncDeclaration.semantic3
*/
auto tf = fd.type.isTypeFunction();
scx.parent = fd;
Parameters* fparameters = tf.parameterList.parameters;
const nfparams = tf.parameterList.length;
foreach (i, fparam; tf.parameterList)
{
fparam.storageClass &= (STC.IOR | STC.lazy_ | STC.final_ | STC.TYPECTOR | STC.nodtor);
fparam.storageClass |= STC.parameter;
if (tf.parameterList.varargs == VarArg.typesafe && i + 1 == nfparams)
{
fparam.storageClass |= STC.variadic;
/* Don't need to set STC.scope_ because this will only
* be evaluated at compile time
*/
}
}
foreach (fparam; *fparameters)
{
if (!fparam.ident)
continue;
// don't add it, if it has no name
auto v = new VarDeclaration(loc, fparam.type, fparam.ident, null);
fparam.storageClass |= STC.parameter;
v.storage_class = fparam.storageClass;
v.dsymbolSemantic(scx);
if (!ti.symtab)
ti.symtab = new DsymbolTable();
if (!scx.insert(v))
error("parameter `%s.%s` is already defined", toChars(), v.toChars());
else
v.parent = fd;
}
if (isstatic)
fd.storage_class |= STC.static_;
fd.declareThis(scx);
}
lastConstraint = constraint.syntaxCopy();
lastConstraintTiargs = ti.tiargs;
lastConstraintNegs.setDim(0);
import dmd.staticcond;
assert(ti.inst is null);
ti.inst = ti; // temporary instantiation to enable genIdent()
bool errors;
const bool result = evalStaticCondition(scx, constraint, lastConstraint, errors, &lastConstraintNegs);
if (result || errors)
{
lastConstraint = null;
lastConstraintTiargs = null;
lastConstraintNegs.setDim(0);
}
ti.inst = null;
ti.symtab = null;
scx = scx.pop();
previous = pr.prev; // unlink from threaded list
if (errors)
return false;
return result;
}
/****************************
* Destructively get the error message from the last constraint evaluation
* Params:
* tip = tip to show after printing all overloads
*/
const(char)* getConstraintEvalError(ref const(char)* tip)
{
import dmd.staticcond;
// there will be a full tree view in verbose mode, and more compact list in the usual
const full = global.params.verbose;
uint count;
const msg = visualizeStaticCondition(constraint, lastConstraint, lastConstraintNegs[], full, count);
scope (exit)
{
lastConstraint = null;
lastConstraintTiargs = null;
lastConstraintNegs.setDim(0);
}
if (!msg)
return null;
OutBuffer buf;
assert(parameters && lastConstraintTiargs);
if (parameters.length > 0)
{
formatParamsWithTiargs(*lastConstraintTiargs, buf);
buf.writenl();
}
if (!full)
{
// choosing singular/plural
const s = (count == 1) ?
" must satisfy the following constraint:" :
" must satisfy one of the following constraints:";
buf.writestring(s);
buf.writenl();
// the constraints
buf.writeByte('`');
buf.writestring(msg);
buf.writeByte('`');
}
else
{
buf.writestring(" whose parameters have the following constraints:");
buf.writenl();
const sep = " `~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~`";
buf.writestring(sep);
buf.writenl();
// the constraints
buf.writeByte('`');
buf.writestring(msg);
buf.writeByte('`');
buf.writestring(sep);
tip = "not satisfied constraints are marked with `>`";
}
return buf.extractChars();
}
private void formatParamsWithTiargs(ref Objects tiargs, ref OutBuffer buf)
{
buf.writestring(" with `");
// write usual arguments line-by-line
// skips trailing default ones - they are not present in `tiargs`
const bool variadic = isVariadic() !is null;
const end = cast(int)parameters.length - (variadic ? 1 : 0);
uint i;
for (; i < tiargs.length && i < end; i++)
{
if (i > 0)
{
buf.writeByte(',');
buf.writenl();
buf.writestring(" ");
}
write(buf, (*parameters)[i]);
buf.writestring(" = ");
write(buf, tiargs[i]);
}
// write remaining variadic arguments on the last line
if (variadic)
{
if (i > 0)
{
buf.writeByte(',');
buf.writenl();
buf.writestring(" ");
}
write(buf, (*parameters)[end]);
buf.writestring(" = ");
buf.writeByte('(');
if (cast(int)tiargs.length - end > 0)
{
write(buf, tiargs[end]);
foreach (j; parameters.length .. tiargs.length)
{
buf.writestring(", ");
write(buf, tiargs[j]);
}
}
buf.writeByte(')');
}
buf.writeByte('`');
}
/******************************
* Create a scope for the parameters of the TemplateInstance
* `ti` in the parent scope sc from the ScopeDsymbol paramsym.
*
* If paramsym is null a new ScopeDsymbol is used in place of
* paramsym.
* Params:
* ti = the TemplateInstance whose parameters to generate the scope for.
* sc = the parent scope of ti
* Returns:
* a scope for the parameters of ti
*/
Scope* scopeForTemplateParameters(TemplateInstance ti, Scope* sc)
{
ScopeDsymbol paramsym = new ScopeDsymbol();
paramsym.parent = _scope.parent;
Scope* paramscope = _scope.push(paramsym);
paramscope.tinst = ti;
paramscope.minst = sc.minst;
paramscope.callsc = sc;
paramscope.stc = 0;
return paramscope;
}
/***************************************
* Given that ti is an instance of this TemplateDeclaration,
* deduce the types of the parameters to this, and store
* those deduced types in dedtypes[].
* Input:
* flag 1: don't do semantic() because of dummy types
* 2: don't change types in matchArg()
* Output:
* dedtypes deduced arguments
* Return match level.
*/
extern (D) MATCH matchWithInstance(Scope* sc, TemplateInstance ti, Objects* dedtypes, Expressions* fargs, int flag)
{
enum LOGM = 0;
static if (LOGM)
{
printf("\n+TemplateDeclaration.matchWithInstance(this = %s, ti = %s, flag = %d)\n", toChars(), ti.toChars(), flag);
}
version (none)
{
printf("dedtypes.dim = %d, parameters.dim = %d\n", dedtypes.dim, parameters.dim);
if (ti.tiargs.dim)
printf("ti.tiargs.dim = %d, [0] = %p\n", ti.tiargs.dim, (*ti.tiargs)[0]);
}
MATCH nomatch()
{
static if (LOGM)
{
printf(" no match\n");
}
return MATCH.nomatch;
}
MATCH m;
size_t dedtypes_dim = dedtypes.dim;
dedtypes.zero();
if (errors)
return MATCH.nomatch;
size_t parameters_dim = parameters.dim;
int variadic = isVariadic() !is null;
// If more arguments than parameters, no match
if (ti.tiargs.dim > parameters_dim && !variadic)
{
static if (LOGM)
{
printf(" no match: more arguments than parameters\n");
}
return MATCH.nomatch;
}
assert(dedtypes_dim == parameters_dim);
assert(dedtypes_dim >= ti.tiargs.dim || variadic);
assert(_scope);
// Set up scope for template parameters
Scope* paramscope = scopeForTemplateParameters(ti,sc);
// Attempt type deduction
m = MATCH.exact;
for (size_t i = 0; i < dedtypes_dim; i++)
{
MATCH m2;
TemplateParameter tp = (*parameters)[i];
Declaration sparam;
//printf("\targument [%d]\n", i);
static if (LOGM)
{
//printf("\targument [%d] is %s\n", i, oarg ? oarg.toChars() : "null");
TemplateTypeParameter ttp = tp.isTemplateTypeParameter();
if (ttp)
printf("\tparameter[%d] is %s : %s\n", i, tp.ident.toChars(), ttp.specType ? ttp.specType.toChars() : "");
}
inuse++;
m2 = tp.matchArg(ti.loc, paramscope, ti.tiargs, i, parameters, dedtypes, &sparam);
inuse--;
//printf("\tm2 = %d\n", m2);
if (m2 == MATCH.nomatch)
{
version (none)
{
printf("\tmatchArg() for parameter %i failed\n", i);
}
return nomatch();
}
if (m2 < m)
m = m2;
if (!flag)
sparam.dsymbolSemantic(paramscope);
if (!paramscope.insert(sparam)) // TODO: This check can make more early
{
// in TemplateDeclaration.semantic, and
// then we don't need to make sparam if flags == 0
return nomatch();
}
}
if (!flag)
{
/* Any parameter left without a type gets the type of
* its corresponding arg
*/
foreach (i, ref dedtype; *dedtypes)
{
if (!dedtype)
{
assert(i < ti.tiargs.dim);
dedtype = cast(Type)(*ti.tiargs)[i];
}
}
}
if (m > MATCH.nomatch && constraint && !flag)
{
if (ti.hasNestedArgs(ti.tiargs, this.isstatic)) // TODO: should gag error
ti.parent = ti.enclosing;
else
ti.parent = this.parent;
// Similar to doHeaderInstantiation
FuncDeclaration fd = onemember ? onemember.isFuncDeclaration() : null;
if (fd)
{
TypeFunction tf = fd.type.isTypeFunction().syntaxCopy();
fd = new FuncDeclaration(fd.loc, fd.endloc, fd.ident, fd.storage_class, tf);
fd.parent = ti;
fd.flags |= FUNCFLAG.inferRetType;
// Shouldn't run semantic on default arguments and return type.
foreach (ref param; *tf.parameterList.parameters)
param.defaultArg = null;
tf.next = null;
tf.incomplete = true;
// Resolve parameter types and 'auto ref's.
tf.fargs = fargs;
uint olderrors = global.startGagging();
fd.type = tf.typeSemantic(loc, paramscope);
global.endGagging(olderrors);
if (fd.type.ty != Tfunction)
return nomatch();
fd.originalType = fd.type; // for mangling
}
// TODO: dedtypes => ti.tiargs ?
if (!evaluateConstraint(ti, sc, paramscope, dedtypes, fd))
return nomatch();
}
static if (LOGM)
{
// Print out the results
printf("--------------------------\n");
printf("template %s\n", toChars());
printf("instance %s\n", ti.toChars());
if (m > MATCH.nomatch)
{
for (size_t i = 0; i < dedtypes_dim; i++)
{
TemplateParameter tp = (*parameters)[i];
RootObject oarg;
printf(" [%d]", i);
if (i < ti.tiargs.dim)
oarg = (*ti.tiargs)[i];
else
oarg = null;
tp.print(oarg, (*dedtypes)[i]);
}
}
else
return nomatch();
}
static if (LOGM)
{
printf(" match = %d\n", m);
}
paramscope.pop();
static if (LOGM)
{
printf("-TemplateDeclaration.matchWithInstance(this = %p, ti = %p) = %d\n", this, ti, m);
}
return m;
}
/********************************************
* Determine partial specialization order of 'this' vs td2.
* Returns:
* match this is at least as specialized as td2
* 0 td2 is more specialized than this
*/
MATCH leastAsSpecialized(Scope* sc, TemplateDeclaration td2, Expressions* fargs)
{
enum LOG_LEASTAS = 0;
static if (LOG_LEASTAS)
{
printf("%s.leastAsSpecialized(%s)\n", toChars(), td2.toChars());
}
/* This works by taking the template parameters to this template
* declaration and feeding them to td2 as if it were a template
* instance.
* If it works, then this template is at least as specialized
* as td2.
*/
// Set type arguments to dummy template instance to be types
// generated from the parameters to this template declaration
auto tiargs = new Objects();
tiargs.reserve(parameters.dim);
foreach (tp; *parameters)
{
if (tp.dependent)
break;
RootObject p = tp.dummyArg();
if (!p) //TemplateTupleParameter
break;
tiargs.push(p);
}
scope TemplateInstance ti = new TemplateInstance(Loc.initial, ident, tiargs); // create dummy template instance
// Temporary Array to hold deduced types
Objects dedtypes = Objects(td2.parameters.dim);
// Attempt a type deduction
MATCH m = td2.matchWithInstance(sc, ti, &dedtypes, fargs, 1);
if (m > MATCH.nomatch)
{
/* A non-variadic template is more specialized than a
* variadic one.
*/
TemplateTupleParameter tp = isVariadic();
if (tp && !tp.dependent && !td2.isVariadic())
goto L1;
static if (LOG_LEASTAS)
{
printf(" matches %d, so is least as specialized\n", m);
}
return m;
}
L1:
static if (LOG_LEASTAS)
{
printf(" doesn't match, so is not as specialized\n");
}
return MATCH.nomatch;
}
/*************************************************
* Match function arguments against a specific template function.
* Input:
* ti
* sc instantiation scope
* fd
* tthis 'this' argument if !NULL
* fargs arguments to function
* Output:
* fd Partially instantiated function declaration
* ti.tdtypes Expression/Type deduced template arguments
* Returns:
* match pair of initial and inferred template arguments
*/
extern (D) MATCHpair deduceFunctionTemplateMatch(TemplateInstance ti, Scope* sc, ref FuncDeclaration fd, Type tthis, Expressions* fargs)
{
size_t nfparams;
size_t nfargs;
size_t ntargs; // array size of tiargs
size_t fptupindex = IDX_NOTFOUND;
MATCH match = MATCH.exact;
MATCH matchTiargs = MATCH.exact;
ParameterList fparameters; // function parameter list
VarArg fvarargs; // function varargs
uint wildmatch = 0;
size_t inferStart = 0;
Loc instLoc = ti.loc;
Objects* tiargs = ti.tiargs;
auto dedargs = new Objects();
Objects* dedtypes = &ti.tdtypes; // for T:T*, the dedargs is the T*, dedtypes is the T
version (none)
{
printf("\nTemplateDeclaration.deduceFunctionTemplateMatch() %s\n", toChars());
for (size_t i = 0; i < (fargs ? fargs.dim : 0); i++)
{
Expression e = (*fargs)[i];
printf("\tfarg[%d] is %s, type is %s\n", i, e.toChars(), e.type.toChars());
}
printf("fd = %s\n", fd.toChars());
printf("fd.type = %s\n", fd.type.toChars());
if (tthis)
printf("tthis = %s\n", tthis.toChars());
}
assert(_scope);
dedargs.setDim(parameters.dim);
dedargs.zero();
dedtypes.setDim(parameters.dim);
dedtypes.zero();
if (errors || fd.errors)
return MATCHpair(MATCH.nomatch, MATCH.nomatch);
// Set up scope for parameters
Scope* paramscope = scopeForTemplateParameters(ti,sc);
MATCHpair nomatch()
{
paramscope.pop();
//printf("\tnomatch\n");
return MATCHpair(MATCH.nomatch, MATCH.nomatch);
}
MATCHpair matcherror()
{
// todo: for the future improvement
paramscope.pop();
//printf("\terror\n");
return MATCHpair(MATCH.nomatch, MATCH.nomatch);
}
// Mark the parameter scope as deprecated if the templated
// function is deprecated (since paramscope.enclosing is the
// calling scope already)
paramscope.stc |= fd.storage_class & STC.deprecated_;
TemplateTupleParameter tp = isVariadic();
Tuple declaredTuple = null;
version (none)
{
for (size_t i = 0; i < dedargs.dim; i++)
{
printf("\tdedarg[%d] = ", i);
RootObject oarg = (*dedargs)[i];
if (oarg)
printf("%s", oarg.toChars());
printf("\n");
}
}
ntargs = 0;
if (tiargs)
{
// Set initial template arguments
ntargs = tiargs.dim;
size_t n = parameters.dim;
if (tp)
n--;
if (ntargs > n)
{
if (!tp)
return nomatch();
/* The extra initial template arguments
* now form the tuple argument.
*/
auto t = new Tuple(ntargs - n);
assert(parameters.dim);
(*dedargs)[parameters.dim - 1] = t;
for (size_t i = 0; i < t.objects.dim; i++)
{
t.objects[i] = (*tiargs)[n + i];
}
declareParameter(paramscope, tp, t);
declaredTuple = t;
}
else
n = ntargs;
memcpy(dedargs.tdata(), tiargs.tdata(), n * (*dedargs.tdata()).sizeof);
for (size_t i = 0; i < n; i++)
{
assert(i < parameters.dim);
Declaration sparam = null;
MATCH m = (*parameters)[i].matchArg(instLoc, paramscope, dedargs, i, parameters, dedtypes, &sparam);
//printf("\tdeduceType m = %d\n", m);
if (m == MATCH.nomatch)
return nomatch();
if (m < matchTiargs)
matchTiargs = m;
sparam.dsymbolSemantic(paramscope);
if (!paramscope.insert(sparam))
return nomatch();
}
if (n < parameters.dim && !declaredTuple)
{
inferStart = n;
}
else
inferStart = parameters.dim;
//printf("tiargs matchTiargs = %d\n", matchTiargs);
}
version (none)
{
for (size_t i = 0; i < dedargs.dim; i++)
{
printf("\tdedarg[%d] = ", i);
RootObject oarg = (*dedargs)[i];
if (oarg)
printf("%s", oarg.toChars());
printf("\n");
}
}
fparameters = fd.getParameterList();
nfparams = fparameters.length; // number of function parameters
nfargs = fargs ? fargs.dim : 0; // number of function arguments
/* Check for match of function arguments with variadic template
* parameter, such as:
*
* void foo(T, A...)(T t, A a);
* void main() { foo(1,2,3); }
*/
if (tp) // if variadic
{
// TemplateTupleParameter always makes most lesser matching.
matchTiargs = MATCH.convert;
if (nfparams == 0 && nfargs != 0) // if no function parameters
{
if (!declaredTuple)
{
auto t = new Tuple();
//printf("t = %p\n", t);
(*dedargs)[parameters.dim - 1] = t;
declareParameter(paramscope, tp, t);
declaredTuple = t;
}
}
else
{
/* Figure out which of the function parameters matches
* the tuple template parameter. Do this by matching
* type identifiers.
* Set the index of this function parameter to fptupindex.
*/
for (fptupindex = 0; fptupindex < nfparams; fptupindex++)
{
auto fparam = (*fparameters.parameters)[fptupindex]; // fparameters[fptupindex] ?
if (fparam.type.ty != Tident)
continue;
TypeIdentifier tid = cast(TypeIdentifier)fparam.type;
if (!tp.ident.equals(tid.ident) || tid.idents.dim)
continue;
if (fparameters.varargs != VarArg.none) // variadic function doesn't
return nomatch(); // go with variadic template
goto L1;
}
fptupindex = IDX_NOTFOUND;
L1:
}
}
if (toParent().isModule() || (_scope.stc & STC.static_))
tthis = null;
if (tthis)
{
bool hasttp = false;
// Match 'tthis' to any TemplateThisParameter's
foreach (param; *parameters)
{
if (auto ttp = param.isTemplateThisParameter())
{
hasttp = true;
Type t = new TypeIdentifier(Loc.initial, ttp.ident);
MATCH m = deduceType(tthis, paramscope, t, parameters, dedtypes);
if (m == MATCH.nomatch)
return nomatch();
if (m < match)
match = m; // pick worst match
}
}
// Match attributes of tthis against attributes of fd
if (fd.type && !fd.isCtorDeclaration())
{
StorageClass stc = _scope.stc | fd.storage_class2;
// Propagate parent storage class, https://issues.dlang.org/show_bug.cgi?id=5504
Dsymbol p = parent;
while (p.isTemplateDeclaration() || p.isTemplateInstance())
p = p.parent;
AggregateDeclaration ad = p.isAggregateDeclaration();
if (ad)
stc |= ad.storage_class;
ubyte mod = fd.type.mod;
if (stc & STC.immutable_)
mod = MODFlags.immutable_;
else
{
if (stc & (STC.shared_ | STC.synchronized_))
mod |= MODFlags.shared_;
if (stc & STC.const_)
mod |= MODFlags.const_;
if (stc & STC.wild)
mod |= MODFlags.wild;
}
ubyte thismod = tthis.mod;
if (hasttp)
mod = MODmerge(thismod, mod);
MATCH m = MODmethodConv(thismod, mod);
if (m == MATCH.nomatch)
return nomatch();
if (m < match)
match = m;
}
}
// Loop through the function parameters
{
//printf("%s\n\tnfargs = %d, nfparams = %d, tuple_dim = %d\n", toChars(), nfargs, nfparams, declaredTuple ? declaredTuple.objects.dim : 0);
//printf("\ttp = %p, fptupindex = %d, found = %d, declaredTuple = %s\n", tp, fptupindex, fptupindex != IDX_NOTFOUND, declaredTuple ? declaredTuple.toChars() : NULL);
size_t argi = 0;
size_t nfargs2 = nfargs; // nfargs + supplied defaultArgs
for (size_t parami = 0; parami < nfparams; parami++)
{
Parameter fparam = fparameters[parami];
// Apply function parameter storage classes to parameter types
Type prmtype = fparam.type.addStorageClass(fparam.storageClass);
Expression farg;
/* See function parameters which wound up
* as part of a template tuple parameter.
*/
if (fptupindex != IDX_NOTFOUND && parami == fptupindex)
{
assert(prmtype.ty == Tident);
TypeIdentifier tid = cast(TypeIdentifier)prmtype;
if (!declaredTuple)
{
/* The types of the function arguments
* now form the tuple argument.
*/
declaredTuple = new Tuple();
(*dedargs)[parameters.dim - 1] = declaredTuple;
/* Count function parameters with no defaults following a tuple parameter.
* void foo(U, T...)(int y, T, U, double, int bar = 0) {} // rem == 2 (U, double)
*/
size_t rem = 0;
for (size_t j = parami + 1; j < nfparams; j++)
{
Parameter p = fparameters[j];
if (p.defaultArg)
{
break;
}
if (!reliesOnTemplateParameters(p.type, (*parameters)[inferStart .. parameters.dim]))
{
Type pt = p.type.syntaxCopy().typeSemantic(fd.loc, paramscope);
rem += pt.ty == Ttuple ? (cast(TypeTuple)pt).arguments.dim : 1;
}
else
{
++rem;
}
}
if (nfargs2 - argi < rem)
return nomatch();
declaredTuple.objects.setDim(nfargs2 - argi - rem);
for (size_t i = 0; i < declaredTuple.objects.dim; i++)
{
farg = (*fargs)[argi + i];
// Check invalid arguments to detect errors early.
if (farg.op == EXP.error || farg.type.ty == Terror)
return nomatch();
if (!fparam.isLazy() && farg.type.ty == Tvoid)
return nomatch();
Type tt;
MATCH m;
if (ubyte wm = deduceWildHelper(farg.type, &tt, tid))
{
wildmatch |= wm;
m = MATCH.constant;
}
else
{
m = deduceTypeHelper(farg.type, &tt, tid);
}
if (m == MATCH.nomatch)
return nomatch();
if (m < match)
match = m;
/* Remove top const for dynamic array types and pointer types
*/
if ((tt.ty == Tarray || tt.ty == Tpointer) && !tt.isMutable() && (!(fparam.storageClass & STC.ref_) || (fparam.storageClass & STC.auto_) && !farg.isLvalue()))
{
tt = tt.mutableOf();
}
declaredTuple.objects[i] = tt;
}
declareParameter(paramscope, tp, declaredTuple);
}
else
{
// https://issues.dlang.org/show_bug.cgi?id=6810
// If declared tuple is not a type tuple,
// it cannot be function parameter types.
for (size_t i = 0; i < declaredTuple.objects.dim; i++)
{
if (!isType(declaredTuple.objects[i]))
return nomatch();
}
}
assert(declaredTuple);
argi += declaredTuple.objects.dim;
continue;
}
// If parameter type doesn't depend on inferred template parameters,
// semantic it to get actual type.
if (!reliesOnTemplateParameters(prmtype, (*parameters)[inferStart .. parameters.dim]))
{
// should copy prmtype to avoid affecting semantic result
prmtype = prmtype.syntaxCopy().typeSemantic(fd.loc, paramscope);
if (prmtype.ty == Ttuple)
{
TypeTuple tt = cast(TypeTuple)prmtype;
size_t tt_dim = tt.arguments.dim;
for (size_t j = 0; j < tt_dim; j++, ++argi)
{
Parameter p = (*tt.arguments)[j];
if (j == tt_dim - 1 && fparameters.varargs == VarArg.typesafe &&
parami + 1 == nfparams && argi < nfargs)
{
prmtype = p.type;
goto Lvarargs;
}
if (argi >= nfargs)
{
if (p.defaultArg)
continue;
// https://issues.dlang.org/show_bug.cgi?id=19888
if (fparam.defaultArg)
break;
return nomatch();
}
farg = (*fargs)[argi];
if (!farg.implicitConvTo(p.type))
return nomatch();
}
continue;
}
}
if (argi >= nfargs) // if not enough arguments
{
if (!fparam.defaultArg)
goto Lvarargs;
/* https://issues.dlang.org/show_bug.cgi?id=2803
* Before the starting of type deduction from the function
* default arguments, set the already deduced parameters into paramscope.
* It's necessary to avoid breaking existing acceptable code. Cases:
*
* 1. Already deduced template parameters can appear in fparam.defaultArg:
* auto foo(A, B)(A a, B b = A.stringof);
* foo(1);
* // at fparam == 'B b = A.string', A is equivalent with the deduced type 'int'
*
* 2. If prmtype depends on default-specified template parameter, the
* default type should be preferred.
* auto foo(N = size_t, R)(R r, N start = 0)
* foo([1,2,3]);
* // at fparam `N start = 0`, N should be 'size_t' before
* // the deduction result from fparam.defaultArg.
*/
if (argi == nfargs)
{
foreach (ref dedtype; *dedtypes)
{
Type at = isType(dedtype);
if (at && at.ty == Tnone)
{
TypeDeduced xt = cast(TypeDeduced)at;
dedtype = xt.tded; // 'unbox'
}
}
for (size_t i = ntargs; i < dedargs.dim; i++)
{
TemplateParameter tparam = (*parameters)[i];
RootObject oarg = (*dedargs)[i];
RootObject oded = (*dedtypes)[i];
if (oarg)
continue;
if (oded)
{
if (tparam.specialization() || !tparam.isTemplateTypeParameter())
{
/* The specialization can work as long as afterwards
* the oded == oarg
*/
(*dedargs)[i] = oded;
MATCH m2 = tparam.matchArg(instLoc, paramscope, dedargs, i, parameters, dedtypes, null);
//printf("m2 = %d\n", m2);
if (m2 == MATCH.nomatch)
return nomatch();
if (m2 < matchTiargs)
matchTiargs = m2; // pick worst match
if (!(*dedtypes)[i].equals(oded))
error("specialization not allowed for deduced parameter `%s`", tparam.ident.toChars());
}
else
{
if (MATCH.convert < matchTiargs)
matchTiargs = MATCH.convert;
}
(*dedargs)[i] = declareParameter(paramscope, tparam, oded);
}
else
{
inuse++;
oded = tparam.defaultArg(instLoc, paramscope);
inuse--;
if (oded)
(*dedargs)[i] = declareParameter(paramscope, tparam, oded);
}
}
}
nfargs2 = argi + 1;
/* If prmtype does not depend on any template parameters:
*
* auto foo(T)(T v, double x = 0);
* foo("str");
* // at fparam == 'double x = 0'
*
* or, if all template parameters in the prmtype are already deduced:
*
* auto foo(R)(R range, ElementType!R sum = 0);
* foo([1,2,3]);
* // at fparam == 'ElementType!R sum = 0'
*
* Deducing prmtype from fparam.defaultArg is not necessary.
*/
if (prmtype.deco || prmtype.syntaxCopy().trySemantic(loc, paramscope))
{
++argi;
continue;
}
// Deduce prmtype from the defaultArg.
farg = fparam.defaultArg.syntaxCopy();
farg = farg.expressionSemantic(paramscope);
farg = resolveProperties(paramscope, farg);
}
else
{
farg = (*fargs)[argi];
}
{
// Check invalid arguments to detect errors early.
if (farg.op == EXP.error || farg.type.ty == Terror)
return nomatch();
Type att = null;
Lretry:
version (none)
{
printf("\tfarg.type = %s\n", farg.type.toChars());
printf("\tfparam.type = %s\n", prmtype.toChars());
}
Type argtype = farg.type;
if (!fparam.isLazy() && argtype.ty == Tvoid && farg.op != EXP.function_)
return nomatch();
// https://issues.dlang.org/show_bug.cgi?id=12876
// Optimize argument to allow CT-known length matching
farg = farg.optimize(WANTvalue, fparam.isReference());
//printf("farg = %s %s\n", farg.type.toChars(), farg.toChars());
RootObject oarg = farg;
if ((fparam.storageClass & STC.ref_) && (!(fparam.storageClass & STC.auto_) || farg.isLvalue()))
{
/* Allow expressions that have CT-known boundaries and type [] to match with [dim]
*/
Type taai;
if (argtype.ty == Tarray && (prmtype.ty == Tsarray || prmtype.ty == Taarray && (taai = (cast(TypeAArray)prmtype).index).ty == Tident && (cast(TypeIdentifier)taai).idents.dim == 0))
{
if (farg.op == EXP.string_)
{
StringExp se = cast(StringExp)farg;
argtype = se.type.nextOf().sarrayOf(se.len);
}
else if (farg.op == EXP.arrayLiteral)
{
ArrayLiteralExp ae = cast(ArrayLiteralExp)farg;
argtype = ae.type.nextOf().sarrayOf(ae.elements.dim);
}
else if (farg.op == EXP.slice)
{
SliceExp se = cast(SliceExp)farg;
if (Type tsa = toStaticArrayType(se))
argtype = tsa;
}
}
oarg = argtype;
}
else if ((fparam.storageClass & STC.out_) == 0 && (argtype.ty == Tarray || argtype.ty == Tpointer) && templateParameterLookup(prmtype, parameters) != IDX_NOTFOUND && (cast(TypeIdentifier)prmtype).idents.dim == 0)
{
/* The farg passing to the prmtype always make a copy. Therefore,
* we can shrink the set of the deduced type arguments for prmtype
* by adjusting top-qualifier of the argtype.
*
* prmtype argtype ta
* T <- const(E)[] const(E)[]
* T <- const(E[]) const(E)[]
* qualifier(T) <- const(E)[] const(E[])
* qualifier(T) <- const(E[]) const(E[])
*/
Type ta = argtype.castMod(prmtype.mod ? argtype.nextOf().mod : 0);
if (ta != argtype)
{
Expression ea = farg.copy();
ea.type = ta;
oarg = ea;
}
}
if (fparameters.varargs == VarArg.typesafe && parami + 1 == nfparams && argi + 1 < nfargs)
goto Lvarargs;
uint wm = 0;
MATCH m = deduceType(oarg, paramscope, prmtype, parameters, dedtypes, &wm, inferStart);
//printf("\tL%d deduceType m = %d, wm = x%x, wildmatch = x%x\n", __LINE__, m, wm, wildmatch);
wildmatch |= wm;
/* If no match, see if the argument can be matched by using
* implicit conversions.
*/
if (m == MATCH.nomatch && prmtype.deco)
m = farg.implicitConvTo(prmtype);
if (m == MATCH.nomatch)
{
AggregateDeclaration ad = isAggregate(farg.type);
if (ad && ad.aliasthis && !isRecursiveAliasThis(att, argtype))
{
// https://issues.dlang.org/show_bug.cgi?id=12537
// The isRecursiveAliasThis() call above
/* If a semantic error occurs while doing alias this,
* eg purity(https://issues.dlang.org/show_bug.cgi?id=7295),
* just regard it as not a match.
*
* We also save/restore sc.func.flags to avoid messing up
* attribute inference in the evaluation.
*/
const oldflags = sc.func ? sc.func.flags : 0;
auto e = resolveAliasThis(sc, farg, true);
if (sc.func)
sc.func.flags = oldflags;
if (e)
{
farg = e;
goto Lretry;
}
}
}
if (m > MATCH.nomatch && (fparam.storageClass & (STC.ref_ | STC.auto_)) == STC.ref_)
{
if (!farg.isLvalue())
{
if ((farg.op == EXP.string_ || farg.op == EXP.slice) && (prmtype.ty == Tsarray || prmtype.ty == Taarray))
{
// Allow conversion from T[lwr .. upr] to ref T[upr-lwr]
}
else if (global.params.rvalueRefParam == FeatureState.enabled)
{
// Allow implicit conversion to ref
}
else
return nomatch();
}
}
if (m > MATCH.nomatch && (fparam.storageClass & STC.out_))
{
if (!farg.isLvalue())
return nomatch();
if (!farg.type.isMutable()) // https://issues.dlang.org/show_bug.cgi?id=11916
return nomatch();
}
if (m == MATCH.nomatch && fparam.isLazy() && prmtype.ty == Tvoid && farg.type.ty != Tvoid)
m = MATCH.convert;
if (m != MATCH.nomatch)
{
if (m < match)
match = m; // pick worst match
argi++;
continue;
}
}
Lvarargs:
/* The following code for variadic arguments closely
* matches TypeFunction.callMatch()
*/
if (!(fparameters.varargs == VarArg.typesafe && parami + 1 == nfparams))
return nomatch();
/* Check for match with function parameter T...
*/
Type tb = prmtype.toBasetype();
switch (tb.ty)
{
// 6764 fix - TypeAArray may be TypeSArray have not yet run semantic().
case Tsarray:
case Taarray:
{
// Perhaps we can do better with this, see TypeFunction.callMatch()
if (tb.ty == Tsarray)
{
TypeSArray tsa = cast(TypeSArray)tb;
dinteger_t sz = tsa.dim.toInteger();
if (sz != nfargs - argi)
return nomatch();
}
else if (tb.ty == Taarray)
{
TypeAArray taa = cast(TypeAArray)tb;
Expression dim = new IntegerExp(instLoc, nfargs - argi, Type.tsize_t);
size_t i = templateParameterLookup(taa.index, parameters);
if (i == IDX_NOTFOUND)
{
Expression e;
Type t;
Dsymbol s;
Scope *sco;
uint errors = global.startGagging();
/* ref: https://issues.dlang.org/show_bug.cgi?id=11118
* The parameter isn't part of the template
* ones, let's try to find it in the
* instantiation scope 'sc' and the one
* belonging to the template itself. */
sco = sc;
taa.index.resolve(instLoc, sco, e, t, s);
if (!e)
{
sco = paramscope;
taa.index.resolve(instLoc, sco, e, t, s);
}
global.endGagging(errors);
if (!e)
return nomatch();
e = e.ctfeInterpret();
e = e.implicitCastTo(sco, Type.tsize_t);
e = e.optimize(WANTvalue);
if (!dim.equals(e))
return nomatch();
}
else
{
// This code matches code in TypeInstance.deduceType()
TemplateParameter tprm = (*parameters)[i];
TemplateValueParameter tvp = tprm.isTemplateValueParameter();
if (!tvp)
return nomatch();
Expression e = cast(Expression)(*dedtypes)[i];
if (e)
{
if (!dim.equals(e))
return nomatch();
}
else
{
Type vt = tvp.valType.typeSemantic(Loc.initial, sc);
MATCH m = dim.implicitConvTo(vt);
if (m == MATCH.nomatch)
return nomatch();
(*dedtypes)[i] = dim;
}
}
}
goto case Tarray;
}
case Tarray:
{
TypeArray ta = cast(TypeArray)tb;
Type tret = fparam.isLazyArray();
for (; argi < nfargs; argi++)
{
Expression arg = (*fargs)[argi];
assert(arg);
MATCH m;
/* If lazy array of delegates,
* convert arg(s) to delegate(s)
*/
if (tret)
{
if (ta.next.equals(arg.type))
{
m = MATCH.exact;
}
else
{
m = arg.implicitConvTo(tret);
if (m == MATCH.nomatch)
{
if (tret.toBasetype().ty == Tvoid)
m = MATCH.convert;
}
}
}
else
{
uint wm = 0;
m = deduceType(arg, paramscope, ta.next, parameters, dedtypes, &wm, inferStart);
wildmatch |= wm;
}
if (m == MATCH.nomatch)
return nomatch();
if (m < match)
match = m;
}
goto Lmatch;
}
case Tclass:
case Tident:
goto Lmatch;
default:
return nomatch();
}
assert(0);
}
//printf(". argi = %d, nfargs = %d, nfargs2 = %d\n", argi, nfargs, nfargs2);
if (argi != nfargs2 && fparameters.varargs == VarArg.none)
return nomatch();
}
Lmatch:
foreach (ref dedtype; *dedtypes)
{
Type at = isType(dedtype);
if (at)
{
if (at.ty == Tnone)
{
TypeDeduced xt = cast(TypeDeduced)at;
at = xt.tded; // 'unbox'
}
dedtype = at.merge2();
}
}
for (size_t i = ntargs; i < dedargs.dim; i++)
{
TemplateParameter tparam = (*parameters)[i];
//printf("tparam[%d] = %s\n", i, tparam.ident.toChars());
/* For T:T*, the dedargs is the T*, dedtypes is the T
* But for function templates, we really need them to match
*/
RootObject oarg = (*dedargs)[i];
RootObject oded = (*dedtypes)[i];
//printf("1dedargs[%d] = %p, dedtypes[%d] = %p\n", i, oarg, i, oded);
//if (oarg) printf("oarg: %s\n", oarg.toChars());
//if (oded) printf("oded: %s\n", oded.toChars());
if (oarg)
continue;
if (oded)
{
if (tparam.specialization() || !tparam.isTemplateTypeParameter())
{
/* The specialization can work as long as afterwards
* the oded == oarg
*/
(*dedargs)[i] = oded;
MATCH m2 = tparam.matchArg(instLoc, paramscope, dedargs, i, parameters, dedtypes, null);
//printf("m2 = %d\n", m2);
if (m2 == MATCH.nomatch)
return nomatch();
if (m2 < matchTiargs)
matchTiargs = m2; // pick worst match
if (!(*dedtypes)[i].equals(oded))
error("specialization not allowed for deduced parameter `%s`", tparam.ident.toChars());
}
else
{
// Discussion: https://issues.dlang.org/show_bug.cgi?id=16484
if (MATCH.convert < matchTiargs)
matchTiargs = MATCH.convert;
}
}
else
{
inuse++;
oded = tparam.defaultArg(instLoc, paramscope);
inuse--;
if (!oded)
{
// if tuple parameter and
// tuple parameter was not in function parameter list and
// we're one or more arguments short (i.e. no tuple argument)
if (tparam == tp &&
fptupindex == IDX_NOTFOUND &&
ntargs <= dedargs.dim - 1)
{
// make tuple argument an empty tuple
oded = new Tuple();
}
else
return nomatch();
}
if (isError(oded))
return matcherror();
ntargs++;
/* At the template parameter T, the picked default template argument
* X!int should be matched to T in order to deduce dependent
* template parameter A.
* auto foo(T : X!A = X!int, A...)() { ... }
* foo(); // T <-- X!int, A <-- (int)
*/
if (tparam.specialization())
{
(*dedargs)[i] = oded;
MATCH m2 = tparam.matchArg(instLoc, paramscope, dedargs, i, parameters, dedtypes, null);
//printf("m2 = %d\n", m2);
if (m2 == MATCH.nomatch)
return nomatch();
if (m2 < matchTiargs)
matchTiargs = m2; // pick worst match
if (!(*dedtypes)[i].equals(oded))
error("specialization not allowed for deduced parameter `%s`", tparam.ident.toChars());
}
}
oded = declareParameter(paramscope, tparam, oded);
(*dedargs)[i] = oded;
}
/* https://issues.dlang.org/show_bug.cgi?id=7469
* As same as the code for 7469 in findBestMatch,
* expand a Tuple in dedargs to normalize template arguments.
*/
if (auto d = dedargs.dim)
{
if (auto va = isTuple((*dedargs)[d - 1]))
{
dedargs.setDim(d - 1);
dedargs.insert(d - 1, &va.objects);
}
}
ti.tiargs = dedargs; // update to the normalized template arguments.
// Partially instantiate function for constraint and fd.leastAsSpecialized()
{
assert(paramscope.scopesym);
Scope* sc2 = _scope;
sc2 = sc2.push(paramscope.scopesym);
sc2 = sc2.push(ti);
sc2.parent = ti;
sc2.tinst = ti;
sc2.minst = sc.minst;
sc2.stc |= fd.storage_class & STC.deprecated_;
fd = doHeaderInstantiation(ti, sc2, fd, tthis, fargs);
sc2 = sc2.pop();
sc2 = sc2.pop();
if (!fd)
return nomatch();
}
if (constraint)
{
if (!evaluateConstraint(ti, sc, paramscope, dedargs, fd))
return nomatch();
}
version (none)
{
for (size_t i = 0; i < dedargs.dim; i++)
{
RootObject o = (*dedargs)[i];
printf("\tdedargs[%d] = %d, %s\n", i, o.dyncast(), o.toChars());
}
}
paramscope.pop();
//printf("\tmatch %d\n", match);
return MATCHpair(matchTiargs, match);
}
/**************************************************
* Declare template parameter tp with value o, and install it in the scope sc.
*/
RootObject declareParameter(Scope* sc, TemplateParameter tp, RootObject o)
{
//printf("TemplateDeclaration.declareParameter('%s', o = %p)\n", tp.ident.toChars(), o);
Type ta = isType(o);
Expression ea = isExpression(o);
Dsymbol sa = isDsymbol(o);
Tuple va = isTuple(o);
Declaration d;
VarDeclaration v = null;
if (ea && ea.op == EXP.type)
ta = ea.type;
else if (ea && ea.op == EXP.scope_)
sa = (cast(ScopeExp)ea).sds;
else if (ea && (ea.op == EXP.this_ || ea.op == EXP.super_))
sa = (cast(ThisExp)ea).var;
else if (ea && ea.op == EXP.function_)
{
if ((cast(FuncExp)ea).td)
sa = (cast(FuncExp)ea).td;
else
sa = (cast(FuncExp)ea).fd;
}
if (ta)
{
//printf("type %s\n", ta.toChars());
auto ad = new AliasDeclaration(Loc.initial, tp.ident, ta);
ad.storage_class |= STC.templateparameter;
d = ad;
}
else if (sa)
{
//printf("Alias %s %s;\n", sa.ident.toChars(), tp.ident.toChars());
auto ad = new AliasDeclaration(Loc.initial, tp.ident, sa);
ad.storage_class |= STC.templateparameter;
d = ad;
}
else if (ea)
{
// tdtypes.data[i] always matches ea here
Initializer _init = new ExpInitializer(loc, ea);
TemplateValueParameter tvp = tp.isTemplateValueParameter();
Type t = tvp ? tvp.valType : null;
v = new VarDeclaration(loc, t, tp.ident, _init);
v.storage_class = STC.manifest | STC.templateparameter;
d = v;
}
else if (va)
{
//printf("\ttuple\n");
d = new TupleDeclaration(loc, tp.ident, &va.objects);
}
else
{
assert(0);
}
d.storage_class |= STC.templateparameter;
if (ta)
{
Type t = ta;
// consistent with Type.checkDeprecated()
while (t.ty != Tenum)
{
if (!t.nextOf())
break;
t = (cast(TypeNext)t).next;
}
if (Dsymbol s = t.toDsymbol(sc))
{
if (s.isDeprecated())
d.storage_class |= STC.deprecated_;
}
}
else if (sa)
{
if (sa.isDeprecated())
d.storage_class |= STC.deprecated_;
}
if (!sc.insert(d))
error("declaration `%s` is already defined", tp.ident.toChars());
d.dsymbolSemantic(sc);
/* So the caller's o gets updated with the result of semantic() being run on o
*/
if (v)
o = v._init.initializerToExpression();
return o;
}
/*************************************************
* Limited function template instantiation for using fd.leastAsSpecialized()
*/
extern (D) FuncDeclaration doHeaderInstantiation(TemplateInstance ti, Scope* sc2, FuncDeclaration fd, Type tthis, Expressions* fargs)
{
assert(fd);
version (none)
{
printf("doHeaderInstantiation this = %s\n", toChars());
}
// function body and contracts are not need
if (fd.isCtorDeclaration())
fd = new CtorDeclaration(fd.loc, fd.endloc, fd.storage_class, fd.type.syntaxCopy());
else
fd = new FuncDeclaration(fd.loc, fd.endloc, fd.ident, fd.storage_class, fd.type.syntaxCopy());
fd.parent = ti;
assert(fd.type.ty == Tfunction);
auto tf = fd.type.isTypeFunction();
tf.fargs = fargs;
if (tthis)
{
// Match 'tthis' to any TemplateThisParameter's
bool hasttp = false;
foreach (tp; *parameters)
{
TemplateThisParameter ttp = tp.isTemplateThisParameter();
if (ttp)
hasttp = true;
}
if (hasttp)
{
tf = cast(TypeFunction)tf.addSTC(ModToStc(tthis.mod));
assert(!tf.deco);
}
}
Scope* scx = sc2.push();
// Shouldn't run semantic on default arguments and return type.
foreach (ref params; *tf.parameterList.parameters)
params.defaultArg = null;
tf.incomplete = true;
if (fd.isCtorDeclaration())
{
// For constructors, emitting return type is necessary for
// isReturnIsolated() in functionResolve.
tf.isctor = true;
Dsymbol parent = toParentDecl();
Type tret;
AggregateDeclaration ad = parent.isAggregateDeclaration();
if (!ad || parent.isUnionDeclaration())
{
tret = Type.tvoid;
}
else
{
tret = ad.handleType();
assert(tret);
tret = tret.addStorageClass(fd.storage_class | scx.stc);
tret = tret.addMod(tf.mod);
}
tf.next = tret;
if (ad && ad.isStructDeclaration())
tf.isref = 1;
//printf("tf = %s\n", tf.toChars());
}
else
tf.next = null;
fd.type = tf;
fd.type = fd.type.addSTC(scx.stc);
fd.type = fd.type.typeSemantic(fd.loc, scx);
scx = scx.pop();
if (fd.type.ty != Tfunction)
return null;
fd.originalType = fd.type; // for mangling
//printf("\t[%s] fd.type = %s, mod = %x, ", loc.toChars(), fd.type.toChars(), fd.type.mod);
//printf("fd.needThis() = %d\n", fd.needThis());
return fd;
}
debug (FindExistingInstance)
{
__gshared uint nFound, nNotFound, nAdded, nRemoved;
shared static ~this()
{
printf("debug (FindExistingInstance) nFound %u, nNotFound: %u, nAdded: %u, nRemoved: %u\n",
nFound, nNotFound, nAdded, nRemoved);
}
}
/****************************************************
* Given a new instance tithis of this TemplateDeclaration,
* see if there already exists an instance.
* If so, return that existing instance.
*/
extern (D) TemplateInstance findExistingInstance(TemplateInstance tithis, Expressions* fargs)
{
//printf("findExistingInstance() %s\n", tithis.toChars());
tithis.fargs = fargs;
auto tibox = TemplateInstanceBox(tithis);
auto p = tibox in instances;
debug (FindExistingInstance) ++(p ? nFound : nNotFound);
//if (p) printf("\tfound %p\n", *p); else printf("\tnot found\n");
return p ? *p : null;
}
/********************************************
* Add instance ti to TemplateDeclaration's table of instances.
* Return a handle we can use to later remove it if it fails instantiation.
*/
extern (D) TemplateInstance addInstance(TemplateInstance ti)
{
//printf("addInstance() %p %s\n", instances, ti.toChars());
auto tibox = TemplateInstanceBox(ti);
instances[tibox] = ti;
debug (FindExistingInstance) ++nAdded;
return ti;
}
/*******************************************
* Remove TemplateInstance from table of instances.
* Input:
* handle returned by addInstance()
*/
extern (D) void removeInstance(TemplateInstance ti)
{
//printf("removeInstance() %s\n", ti.toChars());
auto tibox = TemplateInstanceBox(ti);
debug (FindExistingInstance) ++nRemoved;
instances.remove(tibox);
}
override inout(TemplateDeclaration) isTemplateDeclaration() inout
{
return this;
}
/**
* Check if the last template parameter is a tuple one,
* and returns it if so, else returns `null`.
*
* Returns:
* The last template parameter if it's a `TemplateTupleParameter`
*/
TemplateTupleParameter isVariadic()
{
size_t dim = parameters.dim;
if (dim == 0)
return null;
return (*parameters)[dim - 1].isTemplateTupleParameter();
}
extern(C++) override bool isDeprecated() const
{
return this.deprecated_;
}
/***********************************
* We can overload templates.
*/
override bool isOverloadable() const
{
return true;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
extern (C++) final class TypeDeduced : Type
{
Type tded;
Expressions argexps; // corresponding expressions
Types tparams; // tparams[i].mod
extern (D) this(Type tt, Expression e, Type tparam)
{
super(Tnone);
tded = tt;
argexps.push(e);
tparams.push(tparam);
}
void update(Expression e, Type tparam)
{
argexps.push(e);
tparams.push(tparam);
}
void update(Type tt, Expression e, Type tparam)
{
tded = tt;
argexps.push(e);
tparams.push(tparam);
}
MATCH matchAll(Type tt)
{
MATCH match = MATCH.exact;
foreach (j, e; argexps)
{
assert(e);
if (e == emptyArrayElement)
continue;
Type t = tt.addMod(tparams[j].mod).substWildTo(MODFlags.const_);
MATCH m = e.implicitConvTo(t);
if (match > m)
match = m;
if (match == MATCH.nomatch)
break;
}
return match;
}
}
/*************************************************
* Given function arguments, figure out which template function
* to expand, and return matching result.
* Params:
* m = matching result
* dstart = the root of overloaded function templates
* loc = instantiation location
* sc = instantiation scope
* tiargs = initial list of template arguments
* tthis = if !NULL, the 'this' pointer argument
* fargs = arguments to function
* pMessage = address to store error message, or null
*/
void functionResolve(ref MatchAccumulator m, Dsymbol dstart, Loc loc, Scope* sc, Objects* tiargs,
Type tthis, Expressions* fargs, const(char)** pMessage = null)
{
Expression[] fargs_ = fargs.peekSlice();
version (none)
{
printf("functionResolve() dstart = %s\n", dstart.toChars());
printf(" tiargs:\n");
if (tiargs)
{
for (size_t i = 0; i < tiargs.dim; i++)
{
RootObject arg = (*tiargs)[i];
printf("\t%s\n", arg.toChars());
}
}
printf(" fargs:\n");
for (size_t i = 0; i < (fargs ? fargs.dim : 0); i++)
{
Expression arg = (*fargs)[i];
printf("\t%s %s\n", arg.type.toChars(), arg.toChars());
//printf("\tty = %d\n", arg.type.ty);
}
//printf("stc = %llx\n", dstart._scope.stc);
//printf("match:t/f = %d/%d\n", ta_last, m.last);
}
// results
int property = 0; // 0: uninitialized
// 1: seen @property
// 2: not @property
size_t ov_index = 0;
TemplateDeclaration td_best;
TemplateInstance ti_best;
MATCH ta_last = m.last != MATCH.nomatch ? MATCH.exact : MATCH.nomatch;
Type tthis_best;
int applyFunction(FuncDeclaration fd)
{
// skip duplicates
if (fd == m.lastf)
return 0;
// explicitly specified tiargs never match to non template function
if (tiargs && tiargs.dim > 0)
return 0;
// constructors need a valid scope in order to detect semantic errors
if (!fd.isCtorDeclaration &&
fd.semanticRun < PASS.semanticdone)
{
Ungag ungag = fd.ungagSpeculative();
fd.dsymbolSemantic(null);
}
if (fd.semanticRun < PASS.semanticdone)
{
.error(loc, "forward reference to template `%s`", fd.toChars());
return 1;
}
//printf("fd = %s %s, fargs = %s\n", fd.toChars(), fd.type.toChars(), fargs.toChars());
auto tf = cast(TypeFunction)fd.type;
int prop = tf.isproperty ? 1 : 2;
if (property == 0)
property = prop;
else if (property != prop)
error(fd.loc, "cannot overload both property and non-property functions");
/* For constructors, qualifier check will be opposite direction.
* Qualified constructor always makes qualified object, then will be checked
* that it is implicitly convertible to tthis.
*/
Type tthis_fd = fd.needThis() ? tthis : null;
bool isCtorCall = tthis_fd && fd.isCtorDeclaration();
if (isCtorCall)
{
//printf("%s tf.mod = x%x tthis_fd.mod = x%x %d\n", tf.toChars(),
// tf.mod, tthis_fd.mod, fd.isReturnIsolated());
if (MODimplicitConv(tf.mod, tthis_fd.mod) ||
tf.isWild() && tf.isShared() == tthis_fd.isShared() ||
fd.isReturnIsolated())
{
/* && tf.isShared() == tthis_fd.isShared()*/
// Uniquely constructed object can ignore shared qualifier.
// TODO: Is this appropriate?
tthis_fd = null;
}
else
return 0; // MATCH.nomatch
}
/* Fix Issue 17970:
If a struct is declared as shared the dtor is automatically
considered to be shared, but when the struct is instantiated
the instance is no longer considered to be shared when the
function call matching is done. The fix makes it so that if a
struct declaration is shared, when the destructor is called,
the instantiated struct is also considered shared.
*/
if (auto dt = fd.isDtorDeclaration())
{
auto dtmod = dt.type.toTypeFunction();
auto shared_dtor = dtmod.mod & MODFlags.shared_;
auto shared_this = tthis_fd !is null ?
tthis_fd.mod & MODFlags.shared_ : 0;
if (shared_dtor && !shared_this)
tthis_fd = dtmod;
else if (shared_this && !shared_dtor && tthis_fd !is null)
tf.mod = tthis_fd.mod;
}
MATCH mfa = tf.callMatch(tthis_fd, fargs_, 0, pMessage, sc);
//printf("test1: mfa = %d\n", mfa);
if (mfa == MATCH.nomatch)
return 0;
if (mfa > m.last) goto LfIsBetter;
if (mfa < m.last) goto LlastIsBetter;
/* See if one of the matches overrides the other.
*/
assert(m.lastf);
if (m.lastf.overrides(fd)) goto LlastIsBetter;
if (fd.overrides(m.lastf)) goto LfIsBetter;
/* Try to disambiguate using template-style partial ordering rules.
* In essence, if f() and g() are ambiguous, if f() can call g(),
* but g() cannot call f(), then pick f().
* This is because f() is "more specialized."
*/
{
MATCH c1 = fd.leastAsSpecialized(m.lastf);
MATCH c2 = m.lastf.leastAsSpecialized(fd);
//printf("c1 = %d, c2 = %d\n", c1, c2);
if (c1 > c2) goto LfIsBetter;
if (c1 < c2) goto LlastIsBetter;
}
/* The 'overrides' check above does covariant checking only
* for virtual member functions. It should do it for all functions,
* but in order to not risk breaking code we put it after
* the 'leastAsSpecialized' check.
* In the future try moving it before.
* I.e. a not-the-same-but-covariant match is preferred,
* as it is more restrictive.
*/
if (!m.lastf.type.equals(fd.type))
{
//printf("cov: %d %d\n", m.lastf.type.covariant(fd.type), fd.type.covariant(m.lastf.type));
const lastCovariant = m.lastf.type.covariant(fd.type);
const firstCovariant = fd.type.covariant(m.lastf.type);
if (lastCovariant == Covariant.yes || lastCovariant == Covariant.no)
{
if (firstCovariant != Covariant.yes && firstCovariant != Covariant.no)
{
goto LlastIsBetter;
}
}
else if (firstCovariant == Covariant.yes || firstCovariant == Covariant.no)
{
goto LfIsBetter;
}
}
/* If the two functions are the same function, like:
* int foo(int);
* int foo(int x) { ... }
* then pick the one with the body.
*
* If none has a body then don't care because the same
* real function would be linked to the decl (e.g from object file)
*/
if (tf.equals(m.lastf.type) &&
fd.storage_class == m.lastf.storage_class &&
fd.parent == m.lastf.parent &&
fd.visibility == m.lastf.visibility &&
fd._linkage == m.lastf._linkage)
{
if (fd.fbody && !m.lastf.fbody)
goto LfIsBetter;
if (!fd.fbody)
goto LlastIsBetter;
}
// https://issues.dlang.org/show_bug.cgi?id=14450
// Prefer exact qualified constructor for the creating object type
if (isCtorCall && tf.mod != m.lastf.type.mod)
{
if (tthis.mod == tf.mod) goto LfIsBetter;
if (tthis.mod == m.lastf.type.mod) goto LlastIsBetter;
}
m.nextf = fd;
m.count++;
return 0;
LlastIsBetter:
return 0;
LfIsBetter:
td_best = null;
ti_best = null;
ta_last = MATCH.exact;
m.last = mfa;
m.lastf = fd;
tthis_best = tthis_fd;
ov_index = 0;
m.count = 1;
return 0;
}
int applyTemplate(TemplateDeclaration td)
{
//printf("applyTemplate()\n");
if (td.inuse)
{
td.error(loc, "recursive template expansion");
return 1;
}
if (td == td_best) // skip duplicates
return 0;
if (!sc)
sc = td._scope; // workaround for Type.aliasthisOf
if (td.semanticRun == PASS.initial && td._scope)
{
// Try to fix forward reference. Ungag errors while doing so.
Ungag ungag = td.ungagSpeculative();
td.dsymbolSemantic(td._scope);
}
if (td.semanticRun == PASS.initial)
{
.error(loc, "forward reference to template `%s`", td.toChars());
Lerror:
m.lastf = null;
m.count = 0;
m.last = MATCH.nomatch;
return 1;
}
//printf("td = %s\n", td.toChars());
auto f = td.onemember ? td.onemember.isFuncDeclaration() : null;
if (!f)
{
if (!tiargs)
tiargs = new Objects();
auto ti = new TemplateInstance(loc, td, tiargs);
Objects dedtypes = Objects(td.parameters.dim);
assert(td.semanticRun != PASS.initial);
MATCH mta = td.matchWithInstance(sc, ti, &dedtypes, fargs, 0);
//printf("matchWithInstance = %d\n", mta);
if (mta == MATCH.nomatch || mta < ta_last) // no match or less match
return 0;
ti.templateInstanceSemantic(sc, fargs);
if (!ti.inst) // if template failed to expand
return 0;
Dsymbol s = ti.inst.toAlias();
FuncDeclaration fd;
if (auto tdx = s.isTemplateDeclaration())
{
Objects dedtypesX; // empty tiargs
// https://issues.dlang.org/show_bug.cgi?id=11553
// Check for recursive instantiation of tdx.
for (TemplatePrevious* p = tdx.previous; p; p = p.prev)
{
if (arrayObjectMatch(p.dedargs, &dedtypesX))
{
//printf("recursive, no match p.sc=%p %p %s\n", p.sc, this, this.toChars());
/* It must be a subscope of p.sc, other scope chains are not recursive
* instantiations.
*/
for (Scope* scx = sc; scx; scx = scx.enclosing)
{
if (scx == p.sc)
{
error(loc, "recursive template expansion while looking for `%s.%s`", ti.toChars(), tdx.toChars());
goto Lerror;
}
}
}
/* BUG: should also check for ref param differences
*/
}
TemplatePrevious pr;
pr.prev = tdx.previous;
pr.sc = sc;
pr.dedargs = &dedtypesX;
tdx.previous = ≺ // add this to threaded list
fd = resolveFuncCall(loc, sc, s, null, tthis, fargs, FuncResolveFlag.quiet);
tdx.previous = pr.prev; // unlink from threaded list
}
else if (s.isFuncDeclaration())
{
fd = resolveFuncCall(loc, sc, s, null, tthis, fargs, FuncResolveFlag.quiet);
}
else
goto Lerror;
if (!fd)
return 0;
if (fd.type.ty != Tfunction)
{
m.lastf = fd; // to propagate "error match"
m.count = 1;
m.last = MATCH.nomatch;
return 1;
}
Type tthis_fd = fd.needThis() && !fd.isCtorDeclaration() ? tthis : null;
auto tf = cast(TypeFunction)fd.type;
MATCH mfa = tf.callMatch(tthis_fd, fargs_, 0, null, sc);
if (mfa < m.last)
return 0;
if (mta < ta_last) goto Ltd_best2;
if (mta > ta_last) goto Ltd2;
if (mfa < m.last) goto Ltd_best2;
if (mfa > m.last) goto Ltd2;
// td_best and td are ambiguous
//printf("Lambig2\n");
m.nextf = fd;
m.count++;
return 0;
Ltd_best2:
return 0;
Ltd2:
// td is the new best match
assert(td._scope);
td_best = td;
ti_best = null;
property = 0; // (backward compatibility)
ta_last = mta;
m.last = mfa;
m.lastf = fd;
tthis_best = tthis_fd;
ov_index = 0;
m.nextf = null;
m.count = 1;
return 0;
}
//printf("td = %s\n", td.toChars());
for (size_t ovi = 0; f; f = f.overnext0, ovi++)
{
if (f.type.ty != Tfunction || f.errors)
goto Lerror;
/* This is a 'dummy' instance to evaluate constraint properly.
*/
auto ti = new TemplateInstance(loc, td, tiargs);
ti.parent = td.parent; // Maybe calculating valid 'enclosing' is unnecessary.
auto fd = f;
MATCHpair x = td.deduceFunctionTemplateMatch(ti, sc, fd, tthis, fargs);
MATCH mta = x.mta;
MATCH mfa = x.mfa;
//printf("match:t/f = %d/%d\n", mta, mfa);
if (!fd || mfa == MATCH.nomatch)
continue;
Type tthis_fd = fd.needThis() ? tthis : null;
bool isCtorCall = tthis_fd && fd.isCtorDeclaration();
if (isCtorCall)
{
// Constructor call requires additional check.
auto tf = cast(TypeFunction)fd.type;
assert(tf.next);
if (MODimplicitConv(tf.mod, tthis_fd.mod) ||
tf.isWild() && tf.isShared() == tthis_fd.isShared() ||
fd.isReturnIsolated())
{
tthis_fd = null;
}
else
continue; // MATCH.nomatch
}
if (mta < ta_last) goto Ltd_best;
if (mta > ta_last) goto Ltd;
if (mfa < m.last) goto Ltd_best;
if (mfa > m.last) goto Ltd;
if (td_best)
{
// Disambiguate by picking the most specialized TemplateDeclaration
MATCH c1 = td.leastAsSpecialized(sc, td_best, fargs);
MATCH c2 = td_best.leastAsSpecialized(sc, td, fargs);
//printf("1: c1 = %d, c2 = %d\n", c1, c2);
if (c1 > c2) goto Ltd;
if (c1 < c2) goto Ltd_best;
}
assert(fd && m.lastf);
{
// Disambiguate by tf.callMatch
auto tf1 = fd.type.isTypeFunction();
auto tf2 = m.lastf.type.isTypeFunction();
MATCH c1 = tf1.callMatch(tthis_fd, fargs_, 0, null, sc);
MATCH c2 = tf2.callMatch(tthis_best, fargs_, 0, null, sc);
//printf("2: c1 = %d, c2 = %d\n", c1, c2);
if (c1 > c2) goto Ltd;
if (c1 < c2) goto Ltd_best;
}
{
// Disambiguate by picking the most specialized FunctionDeclaration
MATCH c1 = fd.leastAsSpecialized(m.lastf);
MATCH c2 = m.lastf.leastAsSpecialized(fd);
//printf("3: c1 = %d, c2 = %d\n", c1, c2);
if (c1 > c2) goto Ltd;
if (c1 < c2) goto Ltd_best;
}
// https://issues.dlang.org/show_bug.cgi?id=14450
// Prefer exact qualified constructor for the creating object type
if (isCtorCall && fd.type.mod != m.lastf.type.mod)
{
if (tthis.mod == fd.type.mod) goto Ltd;
if (tthis.mod == m.lastf.type.mod) goto Ltd_best;
}
m.nextf = fd;
m.count++;
continue;
Ltd_best: // td_best is the best match so far
//printf("Ltd_best\n");
continue;
Ltd: // td is the new best match
//printf("Ltd\n");
assert(td._scope);
td_best = td;
ti_best = ti;
property = 0; // (backward compatibility)
ta_last = mta;
m.last = mfa;
m.lastf = fd;
tthis_best = tthis_fd;
ov_index = ovi;
m.nextf = null;
m.count = 1;
continue;
}
return 0;
}
auto td = dstart.isTemplateDeclaration();
if (td && td.funcroot)
dstart = td.funcroot;
overloadApply(dstart, (Dsymbol s)
{
if (s.errors)
return 0;
if (auto fd = s.isFuncDeclaration())
return applyFunction(fd);
if (auto td = s.isTemplateDeclaration())
return applyTemplate(td);
return 0;
}, sc);
//printf("td_best = %p, m.lastf = %p\n", td_best, m.lastf);
if (td_best && ti_best && m.count == 1)
{
// Matches to template function
assert(td_best.onemember && td_best.onemember.isFuncDeclaration());
/* The best match is td_best with arguments tdargs.
* Now instantiate the template.
*/
assert(td_best._scope);
if (!sc)
sc = td_best._scope; // workaround for Type.aliasthisOf
auto ti = new TemplateInstance(loc, td_best, ti_best.tiargs);
ti.templateInstanceSemantic(sc, fargs);
m.lastf = ti.toAlias().isFuncDeclaration();
if (!m.lastf)
goto Lnomatch;
if (ti.errors)
{
Lerror:
m.count = 1;
assert(m.lastf);
m.last = MATCH.nomatch;
return;
}
// look forward instantiated overload function
// Dsymbol.oneMembers is alredy called in TemplateInstance.semantic.
// it has filled overnext0d
while (ov_index--)
{
m.lastf = m.lastf.overnext0;
assert(m.lastf);
}
tthis_best = m.lastf.needThis() && !m.lastf.isCtorDeclaration() ? tthis : null;
if (m.lastf.type.ty == Terror)
goto Lerror;
auto tf = m.lastf.type.isTypeFunction();
if (!tf.callMatch(tthis_best, fargs_, 0, null, sc))
goto Lnomatch;
/* As https://issues.dlang.org/show_bug.cgi?id=3682 shows,
* a template instance can be matched while instantiating
* that same template. Thus, the function type can be incomplete. Complete it.
*
* https://issues.dlang.org/show_bug.cgi?id=9208
* For auto function, completion should be deferred to the end of
* its semantic3. Should not complete it in here.
*/
if (tf.next && !m.lastf.inferRetType)
{
m.lastf.type = tf.typeSemantic(loc, sc);
}
}
else if (m.lastf)
{
// Matches to non template function,
// or found matches were ambiguous.
assert(m.count >= 1);
}
else
{
Lnomatch:
m.count = 0;
m.lastf = null;
m.last = MATCH.nomatch;
}
}
/* ======================== Type ============================================ */
/****
* Given an identifier, figure out which TemplateParameter it is.
* Return IDX_NOTFOUND if not found.
*/
private size_t templateIdentifierLookup(Identifier id, TemplateParameters* parameters)
{
for (size_t i = 0; i < parameters.dim; i++)
{
TemplateParameter tp = (*parameters)[i];
if (tp.ident.equals(id))
return i;
}
return IDX_NOTFOUND;
}
private size_t templateParameterLookup(Type tparam, TemplateParameters* parameters)
{
if (tparam.ty == Tident)
{
TypeIdentifier tident = cast(TypeIdentifier)tparam;
//printf("\ttident = '%s'\n", tident.toChars());
return templateIdentifierLookup(tident.ident, parameters);
}
return IDX_NOTFOUND;
}
private ubyte deduceWildHelper(Type t, Type* at, Type tparam)
{
if ((tparam.mod & MODFlags.wild) == 0)
return 0;
*at = null;
auto X(T, U)(T U, U T)
{
return (U << 4) | T;
}
switch (X(tparam.mod, t.mod))
{
case X(MODFlags.wild, 0):
case X(MODFlags.wild, MODFlags.const_):
case X(MODFlags.wild, MODFlags.shared_):
case X(MODFlags.wild, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.wild, MODFlags.immutable_):
case X(MODFlags.wildconst, 0):
case X(MODFlags.wildconst, MODFlags.const_):
case X(MODFlags.wildconst, MODFlags.shared_):
case X(MODFlags.wildconst, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.wildconst, MODFlags.immutable_):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.shared_):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.immutable_):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.shared_):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.immutable_):
{
ubyte wm = (t.mod & ~MODFlags.shared_);
if (wm == 0)
wm = MODFlags.mutable;
ubyte m = (t.mod & (MODFlags.const_ | MODFlags.immutable_)) | (tparam.mod & t.mod & MODFlags.shared_);
*at = t.unqualify(m);
return wm;
}
case X(MODFlags.wild, MODFlags.wild):
case X(MODFlags.wild, MODFlags.wildconst):
case X(MODFlags.wild, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.wild, MODFlags.shared_ | MODFlags.wildconst):
case X(MODFlags.wildconst, MODFlags.wild):
case X(MODFlags.wildconst, MODFlags.wildconst):
case X(MODFlags.wildconst, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.wildconst, MODFlags.shared_ | MODFlags.wildconst):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.shared_ | MODFlags.wildconst):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.shared_ | MODFlags.wildconst):
{
*at = t.unqualify(tparam.mod & t.mod);
return MODFlags.wild;
}
default:
return 0;
}
}
/**
* Returns the common type of the 2 types.
*/
private Type rawTypeMerge(Type t1, Type t2)
{
if (t1.equals(t2))
return t1;
if (t1.equivalent(t2))
return t1.castMod(MODmerge(t1.mod, t2.mod));
auto t1b = t1.toBasetype();
auto t2b = t2.toBasetype();
if (t1b.equals(t2b))
return t1b;
if (t1b.equivalent(t2b))
return t1b.castMod(MODmerge(t1b.mod, t2b.mod));
auto ty = implicitConvCommonTy(t1b.ty, t2b.ty);
if (ty != Terror)
return Type.basic[ty];
return null;
}
private MATCH deduceTypeHelper(Type t, Type* at, Type tparam)
{
// 9*9 == 81 cases
auto X(T, U)(T U, U T)
{
return (U << 4) | T;
}
switch (X(tparam.mod, t.mod))
{
case X(0, 0):
case X(0, MODFlags.const_):
case X(0, MODFlags.wild):
case X(0, MODFlags.wildconst):
case X(0, MODFlags.shared_):
case X(0, MODFlags.shared_ | MODFlags.const_):
case X(0, MODFlags.shared_ | MODFlags.wild):
case X(0, MODFlags.shared_ | MODFlags.wildconst):
case X(0, MODFlags.immutable_):
// foo(U) T => T
// foo(U) const(T) => const(T)
// foo(U) inout(T) => inout(T)
// foo(U) inout(const(T)) => inout(const(T))
// foo(U) shared(T) => shared(T)
// foo(U) shared(const(T)) => shared(const(T))
// foo(U) shared(inout(T)) => shared(inout(T))
// foo(U) shared(inout(const(T))) => shared(inout(const(T)))
// foo(U) immutable(T) => immutable(T)
{
*at = t;
return MATCH.exact;
}
case X(MODFlags.const_, MODFlags.const_):
case X(MODFlags.wild, MODFlags.wild):
case X(MODFlags.wildconst, MODFlags.wildconst):
case X(MODFlags.shared_, MODFlags.shared_):
case X(MODFlags.shared_ | MODFlags.const_, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.shared_ | MODFlags.wildconst):
case X(MODFlags.immutable_, MODFlags.immutable_):
// foo(const(U)) const(T) => T
// foo(inout(U)) inout(T) => T
// foo(inout(const(U))) inout(const(T)) => T
// foo(shared(U)) shared(T) => T
// foo(shared(const(U))) shared(const(T)) => T
// foo(shared(inout(U))) shared(inout(T)) => T
// foo(shared(inout(const(U)))) shared(inout(const(T))) => T
// foo(immutable(U)) immutable(T) => T
{
*at = t.mutableOf().unSharedOf();
return MATCH.exact;
}
case X(MODFlags.const_, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.wild, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.wildconst, MODFlags.shared_ | MODFlags.wildconst):
// foo(const(U)) shared(const(T)) => shared(T)
// foo(inout(U)) shared(inout(T)) => shared(T)
// foo(inout(const(U))) shared(inout(const(T))) => shared(T)
{
*at = t.mutableOf();
return MATCH.exact;
}
case X(MODFlags.const_, 0):
case X(MODFlags.const_, MODFlags.wild):
case X(MODFlags.const_, MODFlags.wildconst):
case X(MODFlags.const_, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.const_, MODFlags.shared_ | MODFlags.wildconst):
case X(MODFlags.const_, MODFlags.immutable_):
case X(MODFlags.shared_ | MODFlags.const_, MODFlags.immutable_):
// foo(const(U)) T => T
// foo(const(U)) inout(T) => T
// foo(const(U)) inout(const(T)) => T
// foo(const(U)) shared(inout(T)) => shared(T)
// foo(const(U)) shared(inout(const(T))) => shared(T)
// foo(const(U)) immutable(T) => T
// foo(shared(const(U))) immutable(T) => T
{
*at = t.mutableOf();
return MATCH.constant;
}
case X(MODFlags.const_, MODFlags.shared_):
// foo(const(U)) shared(T) => shared(T)
{
*at = t;
return MATCH.constant;
}
case X(MODFlags.shared_, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.shared_, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.shared_, MODFlags.shared_ | MODFlags.wildconst):
// foo(shared(U)) shared(const(T)) => const(T)
// foo(shared(U)) shared(inout(T)) => inout(T)
// foo(shared(U)) shared(inout(const(T))) => inout(const(T))
{
*at = t.unSharedOf();
return MATCH.exact;
}
case X(MODFlags.shared_ | MODFlags.const_, MODFlags.shared_):
// foo(shared(const(U))) shared(T) => T
{
*at = t.unSharedOf();
return MATCH.constant;
}
case X(MODFlags.wildconst, MODFlags.immutable_):
case X(MODFlags.shared_ | MODFlags.const_, MODFlags.shared_ | MODFlags.wildconst):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.immutable_):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.shared_ | MODFlags.wild):
// foo(inout(const(U))) immutable(T) => T
// foo(shared(const(U))) shared(inout(const(T))) => T
// foo(shared(inout(const(U)))) immutable(T) => T
// foo(shared(inout(const(U)))) shared(inout(T)) => T
{
*at = t.unSharedOf().mutableOf();
return MATCH.constant;
}
case X(MODFlags.shared_ | MODFlags.const_, MODFlags.shared_ | MODFlags.wild):
// foo(shared(const(U))) shared(inout(T)) => T
{
*at = t.unSharedOf().mutableOf();
return MATCH.constant;
}
case X(MODFlags.wild, 0):
case X(MODFlags.wild, MODFlags.const_):
case X(MODFlags.wild, MODFlags.wildconst):
case X(MODFlags.wild, MODFlags.immutable_):
case X(MODFlags.wild, MODFlags.shared_):
case X(MODFlags.wild, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.wild, MODFlags.shared_ | MODFlags.wildconst):
case X(MODFlags.wildconst, 0):
case X(MODFlags.wildconst, MODFlags.const_):
case X(MODFlags.wildconst, MODFlags.wild):
case X(MODFlags.wildconst, MODFlags.shared_):
case X(MODFlags.wildconst, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.wildconst, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.shared_, 0):
case X(MODFlags.shared_, MODFlags.const_):
case X(MODFlags.shared_, MODFlags.wild):
case X(MODFlags.shared_, MODFlags.wildconst):
case X(MODFlags.shared_, MODFlags.immutable_):
case X(MODFlags.shared_ | MODFlags.const_, 0):
case X(MODFlags.shared_ | MODFlags.const_, MODFlags.const_):
case X(MODFlags.shared_ | MODFlags.const_, MODFlags.wild):
case X(MODFlags.shared_ | MODFlags.const_, MODFlags.wildconst):
case X(MODFlags.shared_ | MODFlags.wild, 0):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.const_):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.wild):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.wildconst):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.immutable_):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.shared_):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.shared_ | MODFlags.wild, MODFlags.shared_ | MODFlags.wildconst):
case X(MODFlags.shared_ | MODFlags.wildconst, 0):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.const_):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.wild):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.wildconst):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.shared_):
case X(MODFlags.shared_ | MODFlags.wildconst, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.immutable_, 0):
case X(MODFlags.immutable_, MODFlags.const_):
case X(MODFlags.immutable_, MODFlags.wild):
case X(MODFlags.immutable_, MODFlags.wildconst):
case X(MODFlags.immutable_, MODFlags.shared_):
case X(MODFlags.immutable_, MODFlags.shared_ | MODFlags.const_):
case X(MODFlags.immutable_, MODFlags.shared_ | MODFlags.wild):
case X(MODFlags.immutable_, MODFlags.shared_ | MODFlags.wildconst):
// foo(inout(U)) T => nomatch
// foo(inout(U)) const(T) => nomatch
// foo(inout(U)) inout(const(T)) => nomatch
// foo(inout(U)) immutable(T) => nomatch
// foo(inout(U)) shared(T) => nomatch
// foo(inout(U)) shared(const(T)) => nomatch
// foo(inout(U)) shared(inout(const(T))) => nomatch
// foo(inout(const(U))) T => nomatch
// foo(inout(const(U))) const(T) => nomatch
// foo(inout(const(U))) inout(T) => nomatch
// foo(inout(const(U))) shared(T) => nomatch
// foo(inout(const(U))) shared(const(T)) => nomatch
// foo(inout(const(U))) shared(inout(T)) => nomatch
// foo(shared(U)) T => nomatch
// foo(shared(U)) const(T) => nomatch
// foo(shared(U)) inout(T) => nomatch
// foo(shared(U)) inout(const(T)) => nomatch
// foo(shared(U)) immutable(T) => nomatch
// foo(shared(const(U))) T => nomatch
// foo(shared(const(U))) const(T) => nomatch
// foo(shared(const(U))) inout(T) => nomatch
// foo(shared(const(U))) inout(const(T)) => nomatch
// foo(shared(inout(U))) T => nomatch
// foo(shared(inout(U))) const(T) => nomatch
// foo(shared(inout(U))) inout(T) => nomatch
// foo(shared(inout(U))) inout(const(T)) => nomatch
// foo(shared(inout(U))) immutable(T) => nomatch
// foo(shared(inout(U))) shared(T) => nomatch
// foo(shared(inout(U))) shared(const(T)) => nomatch
// foo(shared(inout(U))) shared(inout(const(T))) => nomatch
// foo(shared(inout(const(U)))) T => nomatch
// foo(shared(inout(const(U)))) const(T) => nomatch
// foo(shared(inout(const(U)))) inout(T) => nomatch
// foo(shared(inout(const(U)))) inout(const(T)) => nomatch
// foo(shared(inout(const(U)))) shared(T) => nomatch
// foo(shared(inout(const(U)))) shared(const(T)) => nomatch
// foo(immutable(U)) T => nomatch
// foo(immutable(U)) const(T) => nomatch
// foo(immutable(U)) inout(T) => nomatch
// foo(immutable(U)) inout(const(T)) => nomatch
// foo(immutable(U)) shared(T) => nomatch
// foo(immutable(U)) shared(const(T)) => nomatch
// foo(immutable(U)) shared(inout(T)) => nomatch
// foo(immutable(U)) shared(inout(const(T))) => nomatch
return MATCH.nomatch;
default:
assert(0);
}
}
__gshared Expression emptyArrayElement = null;
/* These form the heart of template argument deduction.
* Given 'this' being the type argument to the template instance,
* it is matched against the template declaration parameter specialization
* 'tparam' to determine the type to be used for the parameter.
* Example:
* template Foo(T:T*) // template declaration
* Foo!(int*) // template instantiation
* Input:
* this = int*
* tparam = T*
* parameters = [ T:T* ] // Array of TemplateParameter's
* Output:
* dedtypes = [ int ] // Array of Expression/Type's
*/
MATCH deduceType(RootObject o, Scope* sc, Type tparam, TemplateParameters* parameters, Objects* dedtypes, uint* wm = null, size_t inferStart = 0, bool ignoreAliasThis = false)
{
extern (C++) final class DeduceType : Visitor
{
alias visit = Visitor.visit;
public:
Scope* sc;
Type tparam;
TemplateParameters* parameters;
Objects* dedtypes;
uint* wm;
size_t inferStart;
bool ignoreAliasThis;
MATCH result;
extern (D) this(Scope* sc, Type tparam, TemplateParameters* parameters, Objects* dedtypes, uint* wm, size_t inferStart, bool ignoreAliasThis)
{
this.sc = sc;
this.tparam = tparam;
this.parameters = parameters;
this.dedtypes = dedtypes;
this.wm = wm;
this.inferStart = inferStart;
this.ignoreAliasThis = ignoreAliasThis;
result = MATCH.nomatch;
}
override void visit(Type t)
{
if (!tparam)
goto Lnomatch;
if (t == tparam)
goto Lexact;
if (tparam.ty == Tident)
{
// Determine which parameter tparam is
size_t i = templateParameterLookup(tparam, parameters);
if (i == IDX_NOTFOUND)
{
if (!sc)
goto Lnomatch;
/* Need a loc to go with the semantic routine.
*/
Loc loc;
if (parameters.dim)
{
TemplateParameter tp = (*parameters)[0];
loc = tp.loc;
}
/* BUG: what if tparam is a template instance, that
* has as an argument another Tident?
*/
tparam = tparam.typeSemantic(loc, sc);
assert(tparam.ty != Tident);
result = deduceType(t, sc, tparam, parameters, dedtypes, wm);
return;
}
TemplateParameter tp = (*parameters)[i];
TypeIdentifier tident = cast(TypeIdentifier)tparam;
if (tident.idents.dim > 0)
{
//printf("matching %s to %s\n", tparam.toChars(), t.toChars());
Dsymbol s = t.toDsymbol(sc);
for (size_t j = tident.idents.dim; j-- > 0;)
{
RootObject id = tident.idents[j];
if (id.dyncast() == DYNCAST.identifier)
{
if (!s || !s.parent)
goto Lnomatch;
Dsymbol s2 = s.parent.search(Loc.initial, cast(Identifier)id);
if (!s2)
goto Lnomatch;
s2 = s2.toAlias();
//printf("[%d] s = %s %s, s2 = %s %s\n", j, s.kind(), s.toChars(), s2.kind(), s2.toChars());
if (s != s2)
{
if (Type tx = s2.getType())
{
if (s != tx.toDsymbol(sc))
goto Lnomatch;
}
else
goto Lnomatch;
}
s = s.parent;
}
else
goto Lnomatch;
}
//printf("[e] s = %s\n", s?s.toChars():"(null)");
if (tp.isTemplateTypeParameter())
{
Type tt = s.getType();
if (!tt)
goto Lnomatch;
Type at = cast(Type)(*dedtypes)[i];
if (at && at.ty == Tnone)
at = (cast(TypeDeduced)at).tded;
if (!at || tt.equals(at))
{
(*dedtypes)[i] = tt;
goto Lexact;
}
}
if (tp.isTemplateAliasParameter())
{
Dsymbol s2 = cast(Dsymbol)(*dedtypes)[i];
if (!s2 || s == s2)
{
(*dedtypes)[i] = s;
goto Lexact;
}
}
goto Lnomatch;
}
// Found the corresponding parameter tp
if (!tp.isTemplateTypeParameter())
goto Lnomatch;
Type at = cast(Type)(*dedtypes)[i];
Type tt;
if (ubyte wx = wm ? deduceWildHelper(t, &tt, tparam) : 0)
{
// type vs (none)
if (!at)
{
(*dedtypes)[i] = tt;
*wm |= wx;
result = MATCH.constant;
return;
}
// type vs expressions
if (at.ty == Tnone)
{
TypeDeduced xt = cast(TypeDeduced)at;
result = xt.matchAll(tt);
if (result > MATCH.nomatch)
{
(*dedtypes)[i] = tt;
if (result > MATCH.constant)
result = MATCH.constant; // limit level for inout matches
}
return;
}
// type vs type
if (tt.equals(at))
{
(*dedtypes)[i] = tt; // Prefer current type match
goto Lconst;
}
if (tt.implicitConvTo(at.constOf()))
{
(*dedtypes)[i] = at.constOf().mutableOf();
*wm |= MODFlags.const_;
goto Lconst;
}
if (at.implicitConvTo(tt.constOf()))
{
(*dedtypes)[i] = tt.constOf().mutableOf();
*wm |= MODFlags.const_;
goto Lconst;
}
goto Lnomatch;
}
else if (MATCH m = deduceTypeHelper(t, &tt, tparam))
{
// type vs (none)
if (!at)
{
(*dedtypes)[i] = tt;
result = m;
return;
}
// type vs expressions
if (at.ty == Tnone)
{
TypeDeduced xt = cast(TypeDeduced)at;
result = xt.matchAll(tt);
if (result > MATCH.nomatch)
{
(*dedtypes)[i] = tt;
}
return;
}
// type vs type
if (tt.equals(at))
{
goto Lexact;
}
if (tt.ty == Tclass && at.ty == Tclass)
{
result = tt.implicitConvTo(at);
return;
}
if (tt.ty == Tsarray && at.ty == Tarray && tt.nextOf().implicitConvTo(at.nextOf()) >= MATCH.constant)
{
goto Lexact;
}
}
goto Lnomatch;
}
if (tparam.ty == Ttypeof)
{
/* Need a loc to go with the semantic routine.
*/
Loc loc;
if (parameters.dim)
{
TemplateParameter tp = (*parameters)[0];
loc = tp.loc;
}
tparam = tparam.typeSemantic(loc, sc);
}
if (t.ty != tparam.ty)
{
if (Dsymbol sym = t.toDsymbol(sc))
{
if (sym.isforwardRef() && !tparam.deco)
goto Lnomatch;
}
MATCH m = t.implicitConvTo(tparam);
if (m == MATCH.nomatch && !ignoreAliasThis)
{
if (t.ty == Tclass)
{
TypeClass tc = cast(TypeClass)t;
if (tc.sym.aliasthis && !(tc.att & AliasThisRec.tracingDT))
{
if (auto ato = t.aliasthisOf())
{
tc.att = cast(AliasThisRec)(tc.att | AliasThisRec.tracingDT);
m = deduceType(ato, sc, tparam, parameters, dedtypes, wm);
tc.att = cast(AliasThisRec)(tc.att & ~AliasThisRec.tracingDT);
}
}
}
else if (t.ty == Tstruct)
{
TypeStruct ts = cast(TypeStruct)t;
if (ts.sym.aliasthis && !(ts.att & AliasThisRec.tracingDT))
{
if (auto ato = t.aliasthisOf())
{
ts.att = cast(AliasThisRec)(ts.att | AliasThisRec.tracingDT);
m = deduceType(ato, sc, tparam, parameters, dedtypes, wm);
ts.att = cast(AliasThisRec)(ts.att & ~AliasThisRec.tracingDT);
}
}
}
}
result = m;
return;
}
if (t.nextOf())
{
if (tparam.deco && !tparam.hasWild())
{
result = t.implicitConvTo(tparam);
return;
}
Type tpn = tparam.nextOf();
if (wm && t.ty == Taarray && tparam.isWild())
{
// https://issues.dlang.org/show_bug.cgi?id=12403
// In IFTI, stop inout matching on transitive part of AA types.
tpn = tpn.substWildTo(MODFlags.mutable);
}
result = deduceType(t.nextOf(), sc, tpn, parameters, dedtypes, wm);
return;
}
Lexact:
result = MATCH.exact;
return;
Lnomatch:
result = MATCH.nomatch;
return;
Lconst:
result = MATCH.constant;
}
override void visit(TypeVector t)
{
if (tparam.ty == Tvector)
{
TypeVector tp = cast(TypeVector)tparam;
result = deduceType(t.basetype, sc, tp.basetype, parameters, dedtypes, wm);
return;
}
visit(cast(Type)t);
}
override void visit(TypeDArray t)
{
visit(cast(Type)t);
}
override void visit(TypeSArray t)
{
// Extra check that array dimensions must match
if (tparam)
{
if (tparam.ty == Tarray)
{
MATCH m = deduceType(t.next, sc, tparam.nextOf(), parameters, dedtypes, wm);
result = (m >= MATCH.constant) ? MATCH.convert : MATCH.nomatch;
return;
}
TemplateParameter tp = null;
Expression edim = null;
size_t i;
if (tparam.ty == Tsarray)
{
TypeSArray tsa = cast(TypeSArray)tparam;
if (tsa.dim.op == EXP.variable && (cast(VarExp)tsa.dim).var.storage_class & STC.templateparameter)
{
Identifier id = (cast(VarExp)tsa.dim).var.ident;
i = templateIdentifierLookup(id, parameters);
assert(i != IDX_NOTFOUND);
tp = (*parameters)[i];
}
else
edim = tsa.dim;
}
else if (tparam.ty == Taarray)
{
TypeAArray taa = cast(TypeAArray)tparam;
i = templateParameterLookup(taa.index, parameters);
if (i != IDX_NOTFOUND)
tp = (*parameters)[i];
else
{
Expression e;
Type tx;
Dsymbol s;
taa.index.resolve(Loc.initial, sc, e, tx, s);
edim = s ? getValue(s) : getValue(e);
}
}
if (tp && tp.matchArg(sc, t.dim, i, parameters, dedtypes, null) || edim && edim.toInteger() == t.dim.toInteger())
{
result = deduceType(t.next, sc, tparam.nextOf(), parameters, dedtypes, wm);
return;
}
}
visit(cast(Type)t);
}
override void visit(TypeAArray t)
{
// Extra check that index type must match
if (tparam && tparam.ty == Taarray)
{
TypeAArray tp = cast(TypeAArray)tparam;
if (!deduceType(t.index, sc, tp.index, parameters, dedtypes))
{
result = MATCH.nomatch;
return;
}
}
visit(cast(Type)t);
}
override void visit(TypeFunction t)
{
// Extra check that function characteristics must match
if (!tparam)
return visit(cast(Type)t);
if (auto tp = tparam.isTypeFunction())
{
if (t.parameterList.varargs != tp.parameterList.varargs || t.linkage != tp.linkage)
{
result = MATCH.nomatch;
return;
}
foreach (fparam; *tp.parameterList.parameters)
{
// https://issues.dlang.org/show_bug.cgi?id=2579
// Apply function parameter storage classes to parameter types
fparam.type = fparam.type.addStorageClass(fparam.storageClass);
fparam.storageClass &= ~(STC.TYPECTOR | STC.in_);
// https://issues.dlang.org/show_bug.cgi?id=15243
// Resolve parameter type if it's not related with template parameters
if (!reliesOnTemplateParameters(fparam.type, (*parameters)[inferStart .. parameters.dim]))
{
auto tx = fparam.type.typeSemantic(Loc.initial, sc);
if (tx.ty == Terror)
{
result = MATCH.nomatch;
return;
}
fparam.type = tx;
}
}
size_t nfargs = t.parameterList.length;
size_t nfparams = tp.parameterList.length;
/* See if tuple match
*/
if (nfparams > 0 && nfargs >= nfparams - 1)
{
/* See if 'A' of the template parameter matches 'A'
* of the type of the last function parameter.
*/
Parameter fparam = tp.parameterList[nfparams - 1];
assert(fparam);
assert(fparam.type);
if (fparam.type.ty != Tident)
goto L1;
TypeIdentifier tid = cast(TypeIdentifier)fparam.type;
if (tid.idents.dim)
goto L1;
/* Look through parameters to find tuple matching tid.ident
*/
size_t tupi = 0;
for (; 1; tupi++)
{
if (tupi == parameters.dim)
goto L1;
TemplateParameter tx = (*parameters)[tupi];
TemplateTupleParameter tup = tx.isTemplateTupleParameter();
if (tup && tup.ident.equals(tid.ident))
break;
}
/* The types of the function arguments [nfparams - 1 .. nfargs]
* now form the tuple argument.
*/
size_t tuple_dim = nfargs - (nfparams - 1);
/* See if existing tuple, and whether it matches or not
*/
RootObject o = (*dedtypes)[tupi];
if (o)
{
// Existing deduced argument must be a tuple, and must match
Tuple tup = isTuple(o);
if (!tup || tup.objects.dim != tuple_dim)
{
result = MATCH.nomatch;
return;
}
for (size_t i = 0; i < tuple_dim; i++)
{
Parameter arg = t.parameterList[nfparams - 1 + i];
if (!arg.type.equals(tup.objects[i]))
{
result = MATCH.nomatch;
return;
}
}
}
else
{
// Create new tuple
auto tup = new Tuple(tuple_dim);
for (size_t i = 0; i < tuple_dim; i++)
{
Parameter arg = t.parameterList[nfparams - 1 + i];
tup.objects[i] = arg.type;
}
(*dedtypes)[tupi] = tup;
}
nfparams--; // don't consider the last parameter for type deduction
goto L2;
}
L1:
if (nfargs != nfparams)
{
result = MATCH.nomatch;
return;
}
L2:
assert(nfparams <= tp.parameterList.length);
foreach (i, ap; tp.parameterList)
{
if (i == nfparams)
break;
Parameter a = t.parameterList[i];
if (!a.isCovariant(t.isref, ap) ||
!deduceType(a.type, sc, ap.type, parameters, dedtypes))
{
result = MATCH.nomatch;
return;
}
}
}
visit(cast(Type)t);
}
override void visit(TypeIdentifier t)
{
// Extra check
if (tparam && tparam.ty == Tident)
{
TypeIdentifier tp = cast(TypeIdentifier)tparam;
for (size_t i = 0; i < t.idents.dim; i++)
{
RootObject id1 = t.idents[i];
RootObject id2 = tp.idents[i];
if (!id1.equals(id2))
{
result = MATCH.nomatch;
return;
}
}
}
visit(cast(Type)t);
}
override void visit(TypeInstance t)
{
// Extra check
if (tparam && tparam.ty == Tinstance && t.tempinst.tempdecl)
{
TemplateDeclaration tempdecl = t.tempinst.tempdecl.isTemplateDeclaration();
assert(tempdecl);
TypeInstance tp = cast(TypeInstance)tparam;
//printf("tempinst.tempdecl = %p\n", tempdecl);
//printf("tp.tempinst.tempdecl = %p\n", tp.tempinst.tempdecl);
if (!tp.tempinst.tempdecl)
{
//printf("tp.tempinst.name = '%s'\n", tp.tempinst.name.toChars());
/* Handle case of:
* template Foo(T : sa!(T), alias sa)
*/
size_t i = templateIdentifierLookup(tp.tempinst.name, parameters);
if (i == IDX_NOTFOUND)
{
/* Didn't find it as a parameter identifier. Try looking
* it up and seeing if is an alias.
* https://issues.dlang.org/show_bug.cgi?id=1454
*/
auto tid = new TypeIdentifier(tp.loc, tp.tempinst.name);
Type tx;
Expression e;
Dsymbol s;
tid.resolve(tp.loc, sc, e, tx, s);
if (tx)
{
s = tx.toDsymbol(sc);
if (TemplateInstance ti = s ? s.parent.isTemplateInstance() : null)
{
// https://issues.dlang.org/show_bug.cgi?id=14290
// Try to match with ti.tempecl,
// only when ti is an enclosing instance.
Dsymbol p = sc.parent;
while (p && p != ti)
p = p.parent;
if (p)
s = ti.tempdecl;
}
}
if (s)
{
s = s.toAlias();
TemplateDeclaration td = s.isTemplateDeclaration();
if (td)
{
if (td.overroot)
td = td.overroot;
for (; td; td = td.overnext)
{
if (td == tempdecl)
goto L2;
}
}
}
goto Lnomatch;
}
TemplateParameter tpx = (*parameters)[i];
if (!tpx.matchArg(sc, tempdecl, i, parameters, dedtypes, null))
goto Lnomatch;
}
else if (tempdecl != tp.tempinst.tempdecl)
goto Lnomatch;
L2:
for (size_t i = 0; 1; i++)
{
//printf("\ttest: tempinst.tiargs[%d]\n", i);
RootObject o1 = null;
if (i < t.tempinst.tiargs.dim)
o1 = (*t.tempinst.tiargs)[i];
else if (i < t.tempinst.tdtypes.dim && i < tp.tempinst.tiargs.dim)
{
// Pick up default arg
o1 = t.tempinst.tdtypes[i];
}
else if (i >= tp.tempinst.tiargs.dim)
break;
if (i >= tp.tempinst.tiargs.dim)
{
size_t dim = tempdecl.parameters.dim - (tempdecl.isVariadic() ? 1 : 0);
while (i < dim && ((*tempdecl.parameters)[i].dependent || (*tempdecl.parameters)[i].hasDefaultArg()))
{
i++;
}
if (i >= dim)
break; // match if all remained parameters are dependent
goto Lnomatch;
}
RootObject o2 = (*tp.tempinst.tiargs)[i];
Type t2 = isType(o2);
size_t j = (t2 && t2.ty == Tident && i == tp.tempinst.tiargs.dim - 1)
? templateParameterLookup(t2, parameters) : IDX_NOTFOUND;
if (j != IDX_NOTFOUND && j == parameters.dim - 1 &&
(*parameters)[j].isTemplateTupleParameter())
{
/* Given:
* struct A(B...) {}
* alias A!(int, float) X;
* static if (is(X Y == A!(Z), Z...)) {}
* deduce that Z is a tuple(int, float)
*/
/* Create tuple from remaining args
*/
size_t vtdim = (tempdecl.isVariadic() ? t.tempinst.tiargs.dim : t.tempinst.tdtypes.dim) - i;
auto vt = new Tuple(vtdim);
for (size_t k = 0; k < vtdim; k++)
{
RootObject o;
if (k < t.tempinst.tiargs.dim)
o = (*t.tempinst.tiargs)[i + k];
else // Pick up default arg
o = t.tempinst.tdtypes[i + k];
vt.objects[k] = o;
}
Tuple v = cast(Tuple)(*dedtypes)[j];
if (v)
{
if (!match(v, vt))
goto Lnomatch;
}
else
(*dedtypes)[j] = vt;
break;
}
else if (!o1)
break;
Type t1 = isType(o1);
Dsymbol s1 = isDsymbol(o1);
Dsymbol s2 = isDsymbol(o2);
Expression e1 = s1 ? getValue(s1) : getValue(isExpression(o1));
Expression e2 = isExpression(o2);
version (none)
{
Tuple v1 = isTuple(o1);
Tuple v2 = isTuple(o2);
if (t1)
printf("t1 = %s\n", t1.toChars());
if (t2)
printf("t2 = %s\n", t2.toChars());
if (e1)
printf("e1 = %s\n", e1.toChars());
if (e2)
printf("e2 = %s\n", e2.toChars());
if (s1)
printf("s1 = %s\n", s1.toChars());
if (s2)
printf("s2 = %s\n", s2.toChars());
if (v1)
printf("v1 = %s\n", v1.toChars());
if (v2)
printf("v2 = %s\n", v2.toChars());
}
if (t1 && t2)
{
if (!deduceType(t1, sc, t2, parameters, dedtypes))
goto Lnomatch;
}
else if (e1 && e2)
{
Le:
e1 = e1.ctfeInterpret();
/* If it is one of the template parameters for this template,
* we should not attempt to interpret it. It already has a value.
*/
if (e2.op == EXP.variable && ((cast(VarExp)e2).var.storage_class & STC.templateparameter))
{
/*
* (T:Number!(e2), int e2)
*/
j = templateIdentifierLookup((cast(VarExp)e2).var.ident, parameters);
if (j != IDX_NOTFOUND)
goto L1;
// The template parameter was not from this template
// (it may be from a parent template, for example)
}
e2 = e2.expressionSemantic(sc); // https://issues.dlang.org/show_bug.cgi?id=13417
e2 = e2.ctfeInterpret();
//printf("e1 = %s, type = %s %d\n", e1.toChars(), e1.type.toChars(), e1.type.ty);
//printf("e2 = %s, type = %s %d\n", e2.toChars(), e2.type.toChars(), e2.type.ty);
if (!e1.equals(e2))
{
if (!e2.implicitConvTo(e1.type))
goto Lnomatch;
e2 = e2.implicitCastTo(sc, e1.type);
e2 = e2.ctfeInterpret();
if (!e1.equals(e2))
goto Lnomatch;
}
}
else if (e1 && t2 && t2.ty == Tident)
{
j = templateParameterLookup(t2, parameters);
L1:
if (j == IDX_NOTFOUND)
{
t2.resolve((cast(TypeIdentifier)t2).loc, sc, e2, t2, s2);
if (e2)
goto Le;
goto Lnomatch;
}
if (!(*parameters)[j].matchArg(sc, e1, j, parameters, dedtypes, null))
goto Lnomatch;
}
else if (s1 && s2)
{
Ls:
if (!s1.equals(s2))
goto Lnomatch;
}
else if (s1 && t2 && t2.ty == Tident)
{
j = templateParameterLookup(t2, parameters);
if (j == IDX_NOTFOUND)
{
t2.resolve((cast(TypeIdentifier)t2).loc, sc, e2, t2, s2);
if (s2)
goto Ls;
goto Lnomatch;
}
if (!(*parameters)[j].matchArg(sc, s1, j, parameters, dedtypes, null))
goto Lnomatch;
}
else
goto Lnomatch;
}
}
visit(cast(Type)t);
return;
Lnomatch:
//printf("no match\n");
result = MATCH.nomatch;
}
override void visit(TypeStruct t)
{
/* If this struct is a template struct, and we're matching
* it against a template instance, convert the struct type
* to a template instance, too, and try again.
*/
TemplateInstance ti = t.sym.parent.isTemplateInstance();
if (tparam && tparam.ty == Tinstance)
{
if (ti && ti.toAlias() == t.sym)
{
auto tx = new TypeInstance(Loc.initial, ti);
auto m = deduceType(tx, sc, tparam, parameters, dedtypes, wm);
// if we have a no match we still need to check alias this
if (m != MATCH.nomatch)
{
result = m;
return;
}
}
/* Match things like:
* S!(T).foo
*/
TypeInstance tpi = cast(TypeInstance)tparam;
if (tpi.idents.dim)
{
RootObject id = tpi.idents[tpi.idents.dim - 1];
if (id.dyncast() == DYNCAST.identifier && t.sym.ident.equals(cast(Identifier)id))
{
Type tparent = t.sym.parent.getType();
if (tparent)
{
/* Slice off the .foo in S!(T).foo
*/
tpi.idents.dim--;
result = deduceType(tparent, sc, tpi, parameters, dedtypes, wm);
tpi.idents.dim++;
return;
}
}
}
}
// Extra check
if (tparam && tparam.ty == Tstruct)
{
TypeStruct tp = cast(TypeStruct)tparam;
//printf("\t%d\n", cast(MATCH) t.implicitConvTo(tp));
if (wm && t.deduceWild(tparam, false))
{
result = MATCH.constant;
return;
}
result = t.implicitConvTo(tp);
return;
}
visit(cast(Type)t);
}
override void visit(TypeEnum t)
{
// Extra check
if (tparam && tparam.ty == Tenum)
{
TypeEnum tp = cast(TypeEnum)tparam;
if (t.sym == tp.sym)
visit(cast(Type)t);
else
result = MATCH.nomatch;
return;
}
Type tb = t.toBasetype();
if (tb.ty == tparam.ty || tb.ty == Tsarray && tparam.ty == Taarray)
{
result = deduceType(tb, sc, tparam, parameters, dedtypes, wm);
if (result == MATCH.exact)
result = MATCH.convert;
return;
}
visit(cast(Type)t);
}
/* Helper for TypeClass.deduceType().
* Classes can match with implicit conversion to a base class or interface.
* This is complicated, because there may be more than one base class which
* matches. In such cases, one or more parameters remain ambiguous.
* For example,
*
* interface I(X, Y) {}
* class C : I(uint, double), I(char, double) {}
* C x;
* foo(T, U)( I!(T, U) x)
*
* deduces that U is double, but T remains ambiguous (could be char or uint).
*
* Given a baseclass b, and initial deduced types 'dedtypes', this function
* tries to match tparam with b, and also tries all base interfaces of b.
* If a match occurs, numBaseClassMatches is incremented, and the new deduced
* types are ANDed with the current 'best' estimate for dedtypes.
*/
static void deduceBaseClassParameters(ref BaseClass b, Scope* sc, Type tparam, TemplateParameters* parameters, Objects* dedtypes, Objects* best, ref int numBaseClassMatches)
{
TemplateInstance parti = b.sym ? b.sym.parent.isTemplateInstance() : null;
if (parti)
{
// Make a temporary copy of dedtypes so we don't destroy it
auto tmpdedtypes = new Objects(dedtypes.dim);
memcpy(tmpdedtypes.tdata(), dedtypes.tdata(), dedtypes.dim * (void*).sizeof);
auto t = new TypeInstance(Loc.initial, parti);
MATCH m = deduceType(t, sc, tparam, parameters, tmpdedtypes);
if (m > MATCH.nomatch)
{
// If this is the first ever match, it becomes our best estimate
if (numBaseClassMatches == 0)
memcpy(best.tdata(), tmpdedtypes.tdata(), tmpdedtypes.dim * (void*).sizeof);
else
for (size_t k = 0; k < tmpdedtypes.dim; ++k)
{
// If we've found more than one possible type for a parameter,
// mark it as unknown.
if ((*tmpdedtypes)[k] != (*best)[k])
(*best)[k] = (*dedtypes)[k];
}
++numBaseClassMatches;
}
}
// Now recursively test the inherited interfaces
foreach (ref bi; b.baseInterfaces)
{
deduceBaseClassParameters(bi, sc, tparam, parameters, dedtypes, best, numBaseClassMatches);
}
}
override void visit(TypeClass t)
{
//printf("TypeClass.deduceType(this = %s)\n", t.toChars());
/* If this class is a template class, and we're matching
* it against a template instance, convert the class type
* to a template instance, too, and try again.
*/
TemplateInstance ti = t.sym.parent.isTemplateInstance();
if (tparam && tparam.ty == Tinstance)
{
if (ti && ti.toAlias() == t.sym)
{
auto tx = new TypeInstance(Loc.initial, ti);
MATCH m = deduceType(tx, sc, tparam, parameters, dedtypes, wm);
// Even if the match fails, there is still a chance it could match
// a base class.
if (m != MATCH.nomatch)
{
result = m;
return;
}
}
/* Match things like:
* S!(T).foo
*/
TypeInstance tpi = cast(TypeInstance)tparam;
if (tpi.idents.dim)
{
RootObject id = tpi.idents[tpi.idents.dim - 1];
if (id.dyncast() == DYNCAST.identifier && t.sym.ident.equals(cast(Identifier)id))
{
Type tparent = t.sym.parent.getType();
if (tparent)
{
/* Slice off the .foo in S!(T).foo
*/
tpi.idents.dim--;
result = deduceType(tparent, sc, tpi, parameters, dedtypes, wm);
tpi.idents.dim++;
return;
}
}
}
// If it matches exactly or via implicit conversion, we're done
visit(cast(Type)t);
if (result != MATCH.nomatch)
return;
/* There is still a chance to match via implicit conversion to
* a base class or interface. Because there could be more than one such
* match, we need to check them all.
*/
int numBaseClassMatches = 0; // Have we found an interface match?
// Our best guess at dedtypes
auto best = new Objects(dedtypes.dim);
ClassDeclaration s = t.sym;
while (s && s.baseclasses.dim > 0)
{
// Test the base class
deduceBaseClassParameters(*(*s.baseclasses)[0], sc, tparam, parameters, dedtypes, best, numBaseClassMatches);
// Test the interfaces inherited by the base class
foreach (b; s.interfaces)
{
deduceBaseClassParameters(*b, sc, tparam, parameters, dedtypes, best, numBaseClassMatches);
}
s = (*s.baseclasses)[0].sym;
}
if (numBaseClassMatches == 0)
{
result = MATCH.nomatch;
return;
}
// If we got at least one match, copy the known types into dedtypes
memcpy(dedtypes.tdata(), best.tdata(), best.dim * (void*).sizeof);
result = MATCH.convert;
return;
}
// Extra check
if (tparam && tparam.ty == Tclass)
{
TypeClass tp = cast(TypeClass)tparam;
//printf("\t%d\n", cast(MATCH) t.implicitConvTo(tp));
if (wm && t.deduceWild(tparam, false))
{
result = MATCH.constant;
return;
}
result = t.implicitConvTo(tp);
return;
}
visit(cast(Type)t);
}
override void visit(Expression e)
{
//printf("Expression.deduceType(e = %s)\n", e.toChars());
size_t i = templateParameterLookup(tparam, parameters);
if (i == IDX_NOTFOUND || (cast(TypeIdentifier)tparam).idents.dim > 0)
{
if (e == emptyArrayElement && tparam.ty == Tarray)
{
Type tn = (cast(TypeNext)tparam).next;
result = deduceType(emptyArrayElement, sc, tn, parameters, dedtypes, wm);
return;
}
e.type.accept(this);
return;
}
TemplateTypeParameter tp = (*parameters)[i].isTemplateTypeParameter();
if (!tp)
return; // nomatch
if (e == emptyArrayElement)
{
if ((*dedtypes)[i])
{
result = MATCH.exact;
return;
}
if (tp.defaultType)
{
tp.defaultType.accept(this);
return;
}
}
/* Returns `true` if `t` is a reference type, or an array of reference types
*/
bool isTopRef(Type t)
{
auto tb = t.baseElemOf();
return tb.ty == Tclass ||
tb.ty == Taarray ||
tb.ty == Tstruct && tb.hasPointers();
}
Type at = cast(Type)(*dedtypes)[i];
Type tt;
if (ubyte wx = deduceWildHelper(e.type, &tt, tparam))
{
*wm |= wx;
result = MATCH.constant;
}
else if (MATCH m = deduceTypeHelper(e.type, &tt, tparam))
{
result = m;
}
else if (!isTopRef(e.type))
{
/* https://issues.dlang.org/show_bug.cgi?id=15653
* In IFTI, recognize top-qualifier conversions
* through the value copy, e.g.
* int --> immutable(int)
* immutable(string[]) --> immutable(string)[]
*/
tt = e.type.mutableOf();
result = MATCH.convert;
}
else
return; // nomatch
// expression vs (none)
if (!at)
{
(*dedtypes)[i] = new TypeDeduced(tt, e, tparam);
return;
}
TypeDeduced xt = null;
if (at.ty == Tnone)
{
xt = cast(TypeDeduced)at;
at = xt.tded;
}
// From previous matched expressions to current deduced type
MATCH match1 = xt ? xt.matchAll(tt) : MATCH.nomatch;
// From current expressions to previous deduced type
Type pt = at.addMod(tparam.mod);
if (*wm)
pt = pt.substWildTo(*wm);
MATCH match2 = e.implicitConvTo(pt);
if (match1 > MATCH.nomatch && match2 > MATCH.nomatch)
{
if (at.implicitConvTo(tt) == MATCH.nomatch)
match1 = MATCH.nomatch; // Prefer at
else if (tt.implicitConvTo(at) == MATCH.nomatch)
match2 = MATCH.nomatch; // Prefer tt
else if (tt.isTypeBasic() && tt.ty == at.ty && tt.mod != at.mod)
{
if (!tt.isMutable() && !at.isMutable())
tt = tt.mutableOf().addMod(MODmerge(tt.mod, at.mod));
else if (tt.isMutable())
{
if (at.mod == 0) // Prefer unshared
match1 = MATCH.nomatch;
else
match2 = MATCH.nomatch;
}
else if (at.isMutable())
{
if (tt.mod == 0) // Prefer unshared
match2 = MATCH.nomatch;
else
match1 = MATCH.nomatch;
}
//printf("tt = %s, at = %s\n", tt.toChars(), at.toChars());
}
else
{
match1 = MATCH.nomatch;
match2 = MATCH.nomatch;
}
}
if (match1 > MATCH.nomatch)
{
// Prefer current match: tt
if (xt)
xt.update(tt, e, tparam);
else
(*dedtypes)[i] = tt;
result = match1;
return;
}
if (match2 > MATCH.nomatch)
{
// Prefer previous match: (*dedtypes)[i]
if (xt)
xt.update(e, tparam);
result = match2;
return;
}
/* Deduce common type
*/
if (Type t = rawTypeMerge(at, tt))
{
if (xt)
xt.update(t, e, tparam);
else
(*dedtypes)[i] = t;
pt = tt.addMod(tparam.mod);
if (*wm)
pt = pt.substWildTo(*wm);
result = e.implicitConvTo(pt);
return;
}
result = MATCH.nomatch;
}
MATCH deduceEmptyArrayElement()
{
if (!emptyArrayElement)
{
emptyArrayElement = new IdentifierExp(Loc.initial, Id.p); // dummy
emptyArrayElement.type = Type.tvoid;
}
assert(tparam.ty == Tarray);
Type tn = (cast(TypeNext)tparam).next;
return deduceType(emptyArrayElement, sc, tn, parameters, dedtypes, wm);
}
override void visit(NullExp e)
{
if (tparam.ty == Tarray && e.type.ty == Tnull)
{
// tparam:T[] <- e:null (void[])
result = deduceEmptyArrayElement();
return;
}
visit(cast(Expression)e);
}
override void visit(StringExp e)
{
Type taai;
if (e.type.ty == Tarray && (tparam.ty == Tsarray || tparam.ty == Taarray && (taai = (cast(TypeAArray)tparam).index).ty == Tident && (cast(TypeIdentifier)taai).idents.dim == 0))
{
// Consider compile-time known boundaries
e.type.nextOf().sarrayOf(e.len).accept(this);
return;
}
visit(cast(Expression)e);
}
override void visit(ArrayLiteralExp e)
{
// https://issues.dlang.org/show_bug.cgi?id=20092
if (e.elements && e.elements.dim && e.type.toBasetype().nextOf().ty == Tvoid)
{
result = deduceEmptyArrayElement();
return;
}
if ((!e.elements || !e.elements.dim) && e.type.toBasetype().nextOf().ty == Tvoid && tparam.ty == Tarray)
{
// tparam:T[] <- e:[] (void[])
result = deduceEmptyArrayElement();
return;
}
if (tparam.ty == Tarray && e.elements && e.elements.dim)
{
Type tn = (cast(TypeDArray)tparam).next;
result = MATCH.exact;
if (e.basis)
{
MATCH m = deduceType(e.basis, sc, tn, parameters, dedtypes, wm);
if (m < result)
result = m;
}
foreach (el; *e.elements)
{
if (result == MATCH.nomatch)
break;
if (!el)
continue;
MATCH m = deduceType(el, sc, tn, parameters, dedtypes, wm);
if (m < result)
result = m;
}
return;
}
Type taai;
if (e.type.ty == Tarray && (tparam.ty == Tsarray || tparam.ty == Taarray && (taai = (cast(TypeAArray)tparam).index).ty == Tident && (cast(TypeIdentifier)taai).idents.dim == 0))
{
// Consider compile-time known boundaries
e.type.nextOf().sarrayOf(e.elements.dim).accept(this);
return;
}
visit(cast(Expression)e);
}
override void visit(AssocArrayLiteralExp e)
{
if (tparam.ty == Taarray && e.keys && e.keys.dim)
{
TypeAArray taa = cast(TypeAArray)tparam;
result = MATCH.exact;
foreach (i, key; *e.keys)
{
MATCH m1 = deduceType(key, sc, taa.index, parameters, dedtypes, wm);
if (m1 < result)
result = m1;
if (result == MATCH.nomatch)
break;
MATCH m2 = deduceType((*e.values)[i], sc, taa.next, parameters, dedtypes, wm);
if (m2 < result)
result = m2;
if (result == MATCH.nomatch)
break;
}
return;
}
visit(cast(Expression)e);
}
override void visit(FuncExp e)
{
//printf("e.type = %s, tparam = %s\n", e.type.toChars(), tparam.toChars());
if (e.td)
{
Type to = tparam;
if (!to.nextOf())
return;
auto tof = to.nextOf().isTypeFunction();
if (!tof)
return;
// Parameter types inference from 'tof'
assert(e.td._scope);
TypeFunction tf = cast(TypeFunction)e.fd.type;
//printf("\ttof = %s\n", tof.toChars());
//printf("\ttf = %s\n", tf.toChars());
const dim = tf.parameterList.length;
if (tof.parameterList.length != dim || tof.parameterList.varargs != tf.parameterList.varargs)
return;
auto tiargs = new Objects();
tiargs.reserve(e.td.parameters.dim);
foreach (tp; *e.td.parameters)
{
size_t u = 0;
foreach (i, p; tf.parameterList)
{
if (p.type.ty == Tident && (cast(TypeIdentifier)p.type).ident == tp.ident)
break;
++u;
}
assert(u < dim);
Parameter pto = tof.parameterList[u];
if (!pto)
break;
Type t = pto.type.syntaxCopy(); // https://issues.dlang.org/show_bug.cgi?id=11774
if (reliesOnTemplateParameters(t, (*parameters)[inferStart .. parameters.dim]))
return;
t = t.typeSemantic(e.loc, sc);
if (t.ty == Terror)
return;
tiargs.push(t);
}
// Set target of return type inference
if (!tf.next && tof.next)
e.fd.treq = tparam;
auto ti = new TemplateInstance(e.loc, e.td, tiargs);
Expression ex = (new ScopeExp(e.loc, ti)).expressionSemantic(e.td._scope);
// Reset inference target for the later re-semantic
e.fd.treq = null;
if (ex.op == EXP.error)
return;
if (ex.op != EXP.function_)
return;
visit(ex.type);
return;
}
Type t = e.type;
if (t.ty == Tdelegate && tparam.ty == Tpointer)
return;
// Allow conversion from implicit function pointer to delegate
if (e.tok == TOK.reserved && t.ty == Tpointer && tparam.ty == Tdelegate)
{
TypeFunction tf = cast(TypeFunction)t.nextOf();
t = (new TypeDelegate(tf)).merge();
}
//printf("tparam = %s <= e.type = %s, t = %s\n", tparam.toChars(), e.type.toChars(), t.toChars());
visit(t);
}
override void visit(SliceExp e)
{
Type taai;
if (e.type.ty == Tarray && (tparam.ty == Tsarray || tparam.ty == Taarray && (taai = (cast(TypeAArray)tparam).index).ty == Tident && (cast(TypeIdentifier)taai).idents.dim == 0))
{
// Consider compile-time known boundaries
if (Type tsa = toStaticArrayType(e))
{
tsa.accept(this);
if (result > MATCH.convert)
result = MATCH.convert; // match with implicit conversion at most
return;
}
}
visit(cast(Expression)e);
}
override void visit(CommaExp e)
{
e.e2.accept(this);
}
}
scope DeduceType v = new DeduceType(sc, tparam, parameters, dedtypes, wm, inferStart, ignoreAliasThis);
if (Type t = isType(o))
t.accept(v);
else if (Expression e = isExpression(o))
{
assert(wm);
e.accept(v);
}
else
assert(0);
return v.result;
}
/***********************************************************
* Check whether the type t representation relies on one or more the template parameters.
* Params:
* t = Tested type, if null, returns false.
* tparams = Template parameters.
* iStart = Start index of tparams to limit the tested parameters. If it's
* nonzero, tparams[0..iStart] will be excluded from the test target.
*/
bool reliesOnTident(Type t, TemplateParameters* tparams, size_t iStart = 0)
{
return reliesOnTemplateParameters(t, (*tparams)[0 .. tparams.dim]);
}
/***********************************************************
* Check whether the type t representation relies on one or more the template parameters.
* Params:
* t = Tested type, if null, returns false.
* tparams = Template parameters.
*/
private bool reliesOnTemplateParameters(Type t, TemplateParameter[] tparams)
{
bool visitVector(TypeVector t)
{
return t.basetype.reliesOnTemplateParameters(tparams);
}
bool visitAArray(TypeAArray t)
{
return t.next.reliesOnTemplateParameters(tparams) ||
t.index.reliesOnTemplateParameters(tparams);
}
bool visitFunction(TypeFunction t)
{
foreach (i, fparam; t.parameterList)
{
if (fparam.type.reliesOnTemplateParameters(tparams))
return true;
}
return t.next.reliesOnTemplateParameters(tparams);
}
bool visitIdentifier(TypeIdentifier t)
{
foreach (tp; tparams)
{
if (tp.ident.equals(t.ident))
return true;
}
return false;
}
bool visitInstance(TypeInstance t)
{
foreach (tp; tparams)
{
if (t.tempinst.name == tp.ident)
return true;
}
if (t.tempinst.tiargs)
foreach (arg; *t.tempinst.tiargs)
{
if (Type ta = isType(arg))
{
if (ta.reliesOnTemplateParameters(tparams))
return true;
}
}
return false;
}
bool visitTypeof(TypeTypeof t)
{
//printf("TypeTypeof.reliesOnTemplateParameters('%s')\n", t.toChars());
return t.exp.reliesOnTemplateParameters(tparams);
}
bool visitTuple(TypeTuple t)
{
if (t.arguments)
foreach (arg; *t.arguments)
{
if (arg.type.reliesOnTemplateParameters(tparams))
return true;
}
return false;
}
if (!t)
return false;
Type tb = t.toBasetype();
switch (tb.ty)
{
case Tvector: return visitVector(tb.isTypeVector());
case Taarray: return visitAArray(tb.isTypeAArray());
case Tfunction: return visitFunction(tb.isTypeFunction());
case Tident: return visitIdentifier(tb.isTypeIdentifier());
case Tinstance: return visitInstance(tb.isTypeInstance());
case Ttypeof: return visitTypeof(tb.isTypeTypeof());
case Ttuple: return visitTuple(tb.isTypeTuple());
case Tenum: return false;
default: return tb.nextOf().reliesOnTemplateParameters(tparams);
}
}
/***********************************************************
* Check whether the expression representation relies on one or more the template parameters.
* Params:
* e = expression to test
* tparams = Template parameters.
* Returns:
* true if it does
*/
private bool reliesOnTemplateParameters(Expression e, TemplateParameter[] tparams)
{
extern (C++) final class ReliesOnTemplateParameters : Visitor
{
alias visit = Visitor.visit;
public:
TemplateParameter[] tparams;
bool result;
extern (D) this(TemplateParameter[] tparams)
{
this.tparams = tparams;
}
override void visit(Expression e)
{
//printf("Expression.reliesOnTemplateParameters('%s')\n", e.toChars());
}
override void visit(IdentifierExp e)
{
//printf("IdentifierExp.reliesOnTemplateParameters('%s')\n", e.toChars());
foreach (tp; tparams)
{
if (e.ident == tp.ident)
{
result = true;
return;
}
}
}
override void visit(TupleExp e)
{
//printf("TupleExp.reliesOnTemplateParameters('%s')\n", e.toChars());
if (e.exps)
{
foreach (ea; *e.exps)
{
ea.accept(this);
if (result)
return;
}
}
}
override void visit(ArrayLiteralExp e)
{
//printf("ArrayLiteralExp.reliesOnTemplateParameters('%s')\n", e.toChars());
if (e.elements)
{
foreach (el; *e.elements)
{
el.accept(this);
if (result)
return;
}
}
}
override void visit(AssocArrayLiteralExp e)
{
//printf("AssocArrayLiteralExp.reliesOnTemplateParameters('%s')\n", e.toChars());
foreach (ek; *e.keys)
{
ek.accept(this);
if (result)
return;
}
foreach (ev; *e.values)
{
ev.accept(this);
if (result)
return;
}
}
override void visit(StructLiteralExp e)
{
//printf("StructLiteralExp.reliesOnTemplateParameters('%s')\n", e.toChars());
if (e.elements)
{
foreach (ea; *e.elements)
{
ea.accept(this);
if (result)
return;
}
}
}
override void visit(TypeExp e)
{
//printf("TypeExp.reliesOnTemplateParameters('%s')\n", e.toChars());
result = e.type.reliesOnTemplateParameters(tparams);
}
override void visit(NewExp e)
{
//printf("NewExp.reliesOnTemplateParameters('%s')\n", e.toChars());
if (e.thisexp)
e.thisexp.accept(this);
result = e.newtype.reliesOnTemplateParameters(tparams);
if (!result && e.arguments)
{
foreach (ea; *e.arguments)
{
ea.accept(this);
if (result)
return;
}
}
}
override void visit(NewAnonClassExp e)
{
//printf("NewAnonClassExp.reliesOnTemplateParameters('%s')\n", e.toChars());
result = true;
}
override void visit(FuncExp e)
{
//printf("FuncExp.reliesOnTemplateParameters('%s')\n", e.toChars());
result = true;
}
override void visit(TypeidExp e)
{
//printf("TypeidExp.reliesOnTemplateParameters('%s')\n", e.toChars());
if (auto ea = isExpression(e.obj))
ea.accept(this);
else if (auto ta = isType(e.obj))
result = ta.reliesOnTemplateParameters(tparams);
}
override void visit(TraitsExp e)
{
//printf("TraitsExp.reliesOnTemplateParameters('%s')\n", e.toChars());
if (e.args)
{
foreach (oa; *e.args)
{
if (auto ea = isExpression(oa))
ea.accept(this);
else if (auto ta = isType(oa))
result = ta.reliesOnTemplateParameters(tparams);
if (result)
return;
}
}
}
override void visit(IsExp e)
{
//printf("IsExp.reliesOnTemplateParameters('%s')\n", e.toChars());
result = e.targ.reliesOnTemplateParameters(tparams);
}
override void visit(UnaExp e)
{
//printf("UnaExp.reliesOnTemplateParameters('%s')\n", e.toChars());
e.e1.accept(this);
}
override void visit(DotTemplateInstanceExp e)
{
//printf("DotTemplateInstanceExp.reliesOnTemplateParameters('%s')\n", e.toChars());
visit(cast(UnaExp)e);
if (!result && e.ti.tiargs)
{
foreach (oa; *e.ti.tiargs)
{
if (auto ea = isExpression(oa))
ea.accept(this);
else if (auto ta = isType(oa))
result = ta.reliesOnTemplateParameters(tparams);
if (result)
return;
}
}
}
override void visit(CallExp e)
{
//printf("CallExp.reliesOnTemplateParameters('%s')\n", e.toChars());
visit(cast(UnaExp)e);
if (!result && e.arguments)
{
foreach (ea; *e.arguments)
{
ea.accept(this);
if (result)
return;
}
}
}
override void visit(CastExp e)
{
//printf("CallExp.reliesOnTemplateParameters('%s')\n", e.toChars());
visit(cast(UnaExp)e);
// e.to can be null for cast() with no type
if (!result && e.to)
result = e.to.reliesOnTemplateParameters(tparams);
}
override void visit(SliceExp e)
{
//printf("SliceExp.reliesOnTemplateParameters('%s')\n", e.toChars());
visit(cast(UnaExp)e);
if (!result && e.lwr)
e.lwr.accept(this);
if (!result && e.upr)
e.upr.accept(this);
}
override void visit(IntervalExp e)
{
//printf("IntervalExp.reliesOnTemplateParameters('%s')\n", e.toChars());
e.lwr.accept(this);
if (!result)
e.upr.accept(this);
}
override void visit(ArrayExp e)
{
//printf("ArrayExp.reliesOnTemplateParameters('%s')\n", e.toChars());
visit(cast(UnaExp)e);
if (!result && e.arguments)
{
foreach (ea; *e.arguments)
ea.accept(this);
}
}
override void visit(BinExp e)
{
//printf("BinExp.reliesOnTemplateParameters('%s')\n", e.toChars());
e.e1.accept(this);
if (!result)
e.e2.accept(this);
}
override void visit(CondExp e)
{
//printf("BinExp.reliesOnTemplateParameters('%s')\n", e.toChars());
e.econd.accept(this);
if (!result)
visit(cast(BinExp)e);
}
}
scope ReliesOnTemplateParameters v = new ReliesOnTemplateParameters(tparams);
e.accept(v);
return v.result;
}
/***********************************************************
* https://dlang.org/spec/template.html#TemplateParameter
*/
extern (C++) class TemplateParameter : ASTNode
{
Loc loc;
Identifier ident;
/* True if this is a part of precedent parameter specialization pattern.
*
* template A(T : X!TL, alias X, TL...) {}
* // X and TL are dependent template parameter
*
* A dependent template parameter should return MATCH.exact in matchArg()
* to respect the match level of the corresponding precedent parameter.
*/
bool dependent;
/* ======================== TemplateParameter =============================== */
extern (D) this(const ref Loc loc, Identifier ident)
{
this.loc = loc;
this.ident = ident;
}
TemplateTypeParameter isTemplateTypeParameter()
{
return null;
}
TemplateValueParameter isTemplateValueParameter()
{
return null;
}
TemplateAliasParameter isTemplateAliasParameter()
{
return null;
}
TemplateThisParameter isTemplateThisParameter()
{
return null;
}
TemplateTupleParameter isTemplateTupleParameter()
{
return null;
}
abstract TemplateParameter syntaxCopy();
abstract bool declareParameter(Scope* sc);
abstract void print(RootObject oarg, RootObject oded);
abstract RootObject specialization();
abstract RootObject defaultArg(const ref Loc instLoc, Scope* sc);
abstract bool hasDefaultArg();
override const(char)* toChars() const
{
return this.ident.toChars();
}
override DYNCAST dyncast() const
{
return DYNCAST.templateparameter;
}
/* Create dummy argument based on parameter.
*/
abstract RootObject dummyArg();
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
* https://dlang.org/spec/template.html#TemplateTypeParameter
* Syntax:
* ident : specType = defaultType
*/
extern (C++) class TemplateTypeParameter : TemplateParameter
{
Type specType; // if !=null, this is the type specialization
Type defaultType;
extern (D) __gshared Type tdummy = null;
extern (D) this(const ref Loc loc, Identifier ident, Type specType, Type defaultType)
{
super(loc, ident);
this.specType = specType;
this.defaultType = defaultType;
}
override final TemplateTypeParameter isTemplateTypeParameter()
{
return this;
}
override TemplateTypeParameter syntaxCopy()
{
return new TemplateTypeParameter(loc, ident, specType ? specType.syntaxCopy() : null, defaultType ? defaultType.syntaxCopy() : null);
}
override final bool declareParameter(Scope* sc)
{
//printf("TemplateTypeParameter.declareParameter('%s')\n", ident.toChars());
auto ti = new TypeIdentifier(loc, ident);
Declaration ad = new AliasDeclaration(loc, ident, ti);
return sc.insert(ad) !is null;
}
override final void print(RootObject oarg, RootObject oded)
{
printf(" %s\n", ident.toChars());
Type t = isType(oarg);
Type ta = isType(oded);
assert(ta);
if (specType)
printf("\tSpecialization: %s\n", specType.toChars());
if (defaultType)
printf("\tDefault: %s\n", defaultType.toChars());
printf("\tParameter: %s\n", t ? t.toChars() : "NULL");
printf("\tDeduced Type: %s\n", ta.toChars());
}
override final RootObject specialization()
{
return specType;
}
override final RootObject defaultArg(const ref Loc instLoc, Scope* sc)
{
Type t = defaultType;
if (t)
{
t = t.syntaxCopy();
t = t.typeSemantic(loc, sc); // use the parameter loc
}
return t;
}
override final bool hasDefaultArg()
{
return defaultType !is null;
}
override final RootObject dummyArg()
{
Type t = specType;
if (!t)
{
// Use this for alias-parameter's too (?)
if (!tdummy)
tdummy = new TypeIdentifier(loc, ident);
t = tdummy;
}
return t;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
* https://dlang.org/spec/template.html#TemplateThisParameter
* Syntax:
* this ident : specType = defaultType
*/
extern (C++) final class TemplateThisParameter : TemplateTypeParameter
{
extern (D) this(const ref Loc loc, Identifier ident, Type specType, Type defaultType)
{
super(loc, ident, specType, defaultType);
}
override TemplateThisParameter isTemplateThisParameter()
{
return this;
}
override TemplateThisParameter syntaxCopy()
{
return new TemplateThisParameter(loc, ident, specType ? specType.syntaxCopy() : null, defaultType ? defaultType.syntaxCopy() : null);
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
* https://dlang.org/spec/template.html#TemplateValueParameter
* Syntax:
* valType ident : specValue = defaultValue
*/
extern (C++) final class TemplateValueParameter : TemplateParameter
{
Type valType;
Expression specValue;
Expression defaultValue;
extern (D) __gshared Expression[void*] edummies;
extern (D) this(const ref Loc loc, Identifier ident, Type valType,
Expression specValue, Expression defaultValue)
{
super(loc, ident);
this.valType = valType;
this.specValue = specValue;
this.defaultValue = defaultValue;
}
override TemplateValueParameter isTemplateValueParameter()
{
return this;
}
override TemplateValueParameter syntaxCopy()
{
return new TemplateValueParameter(loc, ident,
valType.syntaxCopy(),
specValue ? specValue.syntaxCopy() : null,
defaultValue ? defaultValue.syntaxCopy() : null);
}
override bool declareParameter(Scope* sc)
{
/*
Do type semantic earlier.
This means for certain erroneous value parameters
their "type" can be known earlier and thus a better
error message given.
For example:
`template test(x* x) {}`
now yields "undefined identifier" rather than the opaque
"variable `x` is used as a type".
*/
if (valType)
valType = valType.typeSemantic(loc, sc);
auto v = new VarDeclaration(loc, valType, ident, null);
v.storage_class = STC.templateparameter;
return sc.insert(v) !is null;
}
override void print(RootObject oarg, RootObject oded)
{
printf(" %s\n", ident.toChars());
Expression ea = isExpression(oded);
if (specValue)
printf("\tSpecialization: %s\n", specValue.toChars());
printf("\tParameter Value: %s\n", ea ? ea.toChars() : "NULL");
}
override RootObject specialization()
{
return specValue;
}
override RootObject defaultArg(const ref Loc instLoc, Scope* sc)
{
Expression e = defaultValue;
if (e)
{
e = e.syntaxCopy();
uint olderrs = global.errors;
if ((e = e.expressionSemantic(sc)) is null)
return null;
if ((e = resolveProperties(sc, e)) is null)
return null;
e = e.resolveLoc(instLoc, sc); // use the instantiated loc
e = e.optimize(WANTvalue);
if (global.errors != olderrs)
e = ErrorExp.get();
}
return e;
}
override bool hasDefaultArg()
{
return defaultValue !is null;
}
override RootObject dummyArg()
{
Expression e = specValue;
if (!e)
{
// Create a dummy value
auto pe = cast(void*)valType in edummies;
if (!pe)
{
e = valType.defaultInit(Loc.initial);
edummies[cast(void*)valType] = e;
}
else
e = *pe;
}
return e;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
* https://dlang.org/spec/template.html#TemplateAliasParameter
* Syntax:
* specType ident : specAlias = defaultAlias
*/
extern (C++) final class TemplateAliasParameter : TemplateParameter
{
Type specType;
RootObject specAlias;
RootObject defaultAlias;
extern (D) __gshared Dsymbol sdummy = null;
extern (D) this(const ref Loc loc, Identifier ident, Type specType, RootObject specAlias, RootObject defaultAlias)
{
super(loc, ident);
this.specType = specType;
this.specAlias = specAlias;
this.defaultAlias = defaultAlias;
}
override TemplateAliasParameter isTemplateAliasParameter()
{
return this;
}
override TemplateAliasParameter syntaxCopy()
{
return new TemplateAliasParameter(loc, ident, specType ? specType.syntaxCopy() : null, objectSyntaxCopy(specAlias), objectSyntaxCopy(defaultAlias));
}
override bool declareParameter(Scope* sc)
{
auto ti = new TypeIdentifier(loc, ident);
Declaration ad = new AliasDeclaration(loc, ident, ti);
return sc.insert(ad) !is null;
}
override void print(RootObject oarg, RootObject oded)
{
printf(" %s\n", ident.toChars());
Dsymbol sa = isDsymbol(oded);
assert(sa);
printf("\tParameter alias: %s\n", sa.toChars());
}
override RootObject specialization()
{
return specAlias;
}
override RootObject defaultArg(const ref Loc instLoc, Scope* sc)
{
RootObject da = defaultAlias;
Type ta = isType(defaultAlias);
if (ta)
{
if (ta.ty == Tinstance)
{
// If the default arg is a template, instantiate for each type
da = ta.syntaxCopy();
}
}
RootObject o = aliasParameterSemantic(loc, sc, da, null); // use the parameter loc
return o;
}
override bool hasDefaultArg()
{
return defaultAlias !is null;
}
override RootObject dummyArg()
{
RootObject s = specAlias;
if (!s)
{
if (!sdummy)
sdummy = new Dsymbol();
s = sdummy;
}
return s;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
* https://dlang.org/spec/template.html#TemplateSequenceParameter
* Syntax:
* ident ...
*/
extern (C++) final class TemplateTupleParameter : TemplateParameter
{
extern (D) this(const ref Loc loc, Identifier ident)
{
super(loc, ident);
}
override TemplateTupleParameter isTemplateTupleParameter()
{
return this;
}
override TemplateTupleParameter syntaxCopy()
{
return new TemplateTupleParameter(loc, ident);
}
override bool declareParameter(Scope* sc)
{
auto ti = new TypeIdentifier(loc, ident);
Declaration ad = new AliasDeclaration(loc, ident, ti);
return sc.insert(ad) !is null;
}
override void print(RootObject oarg, RootObject oded)
{
printf(" %s... [", ident.toChars());
Tuple v = isTuple(oded);
assert(v);
//printf("|%d| ", v.objects.dim);
foreach (i, o; v.objects)
{
if (i)
printf(", ");
Dsymbol sa = isDsymbol(o);
if (sa)
printf("alias: %s", sa.toChars());
Type ta = isType(o);
if (ta)
printf("type: %s", ta.toChars());
Expression ea = isExpression(o);
if (ea)
printf("exp: %s", ea.toChars());
assert(!isTuple(o)); // no nested Tuple arguments
}
printf("]\n");
}
override RootObject specialization()
{
return null;
}
override RootObject defaultArg(const ref Loc instLoc, Scope* sc)
{
return null;
}
override bool hasDefaultArg()
{
return false;
}
override RootObject dummyArg()
{
return null;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
* https://dlang.org/spec/template.html#explicit_tmp_instantiation
* Given:
* foo!(args) =>
* name = foo
* tiargs = args
*/
extern (C++) class TemplateInstance : ScopeDsymbol
{
Identifier name;
// Array of Types/Expressions of template
// instance arguments [int*, char, 10*10]
Objects* tiargs;
// Array of Types/Expressions corresponding
// to TemplateDeclaration.parameters
// [int, char, 100]
Objects tdtypes;
// Modules imported by this template instance
Modules importedModules;
Dsymbol tempdecl; // referenced by foo.bar.abc
Dsymbol enclosing; // if referencing local symbols, this is the context
Dsymbol aliasdecl; // !=null if instance is an alias for its sole member
TemplateInstance inst; // refer to existing instance
ScopeDsymbol argsym; // argument symbol table
size_t hash; // cached result of toHash()
Expressions* fargs; // for function template, these are the function arguments
TemplateInstances* deferred;
Module memberOf; // if !null, then this TemplateInstance appears in memberOf.members[]
// Used to determine the instance needs code generation.
// Note that these are inaccurate until semantic analysis phase completed.
TemplateInstance tinst; // enclosing template instance
TemplateInstance tnext; // non-first instantiated instances
Module minst; // the top module that instantiated this instance
private ushort _nest; // for recursive pretty printing detection, 3 MSBs reserved for flags (below)
ubyte inuse; // for recursive expansion detection
private enum Flag : uint
{
semantictiargsdone = 1u << (_nest.sizeof * 8 - 1), // MSB of _nest
havetempdecl = semantictiargsdone >> 1,
gagged = semantictiargsdone >> 2,
available = gagged - 1 // always last flag minus one, 1s for all available bits
}
extern(D) final @safe @property pure nothrow @nogc
{
ushort nest() const { return _nest & Flag.available; }
void nestUp() { assert(nest() < Flag.available); ++_nest; }
void nestDown() { assert(nest() > 0); --_nest; }
/// has semanticTiargs() been done?
bool semantictiargsdone() const { return (_nest & Flag.semantictiargsdone) != 0; }
void semantictiargsdone(bool x)
{
if (x) _nest |= Flag.semantictiargsdone;
else _nest &= ~Flag.semantictiargsdone;
}
/// if used second constructor
bool havetempdecl() const { return (_nest & Flag.havetempdecl) != 0; }
void havetempdecl(bool x)
{
if (x) _nest |= Flag.havetempdecl;
else _nest &= ~Flag.havetempdecl;
}
/// if the instantiation is done with error gagging
bool gagged() const { return (_nest & Flag.gagged) != 0; }
void gagged(bool x)
{
if (x) _nest |= Flag.gagged;
else _nest &= ~Flag.gagged;
}
}
extern (D) this(const ref Loc loc, Identifier ident, Objects* tiargs)
{
super(loc, null);
static if (LOG)
{
printf("TemplateInstance(this = %p, ident = '%s')\n", this, ident ? ident.toChars() : "null");
}
this.name = ident;
this.tiargs = tiargs;
}
/*****************
* This constructor is only called when we figured out which function
* template to instantiate.
*/
extern (D) this(const ref Loc loc, TemplateDeclaration td, Objects* tiargs)
{
super(loc, null);
static if (LOG)
{
printf("TemplateInstance(this = %p, tempdecl = '%s')\n", this, td.toChars());
}
this.name = td.ident;
this.tiargs = tiargs;
this.tempdecl = td;
this.semantictiargsdone = true;
this.havetempdecl = true;
assert(tempdecl._scope);
}
extern (D) static Objects* arraySyntaxCopy(Objects* objs)
{
Objects* a = null;
if (objs)
{
a = new Objects(objs.dim);
foreach (i, o; *objs)
(*a)[i] = objectSyntaxCopy(o);
}
return a;
}
override TemplateInstance syntaxCopy(Dsymbol s)
{
TemplateInstance ti = s ? cast(TemplateInstance)s : new TemplateInstance(loc, name, null);
ti.tiargs = arraySyntaxCopy(tiargs);
TemplateDeclaration td;
if (inst && tempdecl && (td = tempdecl.isTemplateDeclaration()) !is null)
td.ScopeDsymbol.syntaxCopy(ti);
else
ScopeDsymbol.syntaxCopy(ti);
return ti;
}
// resolve real symbol
override final Dsymbol toAlias()
{
static if (LOG)
{
printf("TemplateInstance.toAlias()\n");
}
if (!inst)
{
// Maybe we can resolve it
if (_scope)
{
dsymbolSemantic(this, _scope);
}
if (!inst)
{
error("cannot resolve forward reference");
errors = true;
return this;
}
}
if (inst != this)
return inst.toAlias();
if (aliasdecl)
{
return aliasdecl.toAlias();
}
return inst;
}
override const(char)* kind() const
{
return "template instance";
}
override bool oneMember(Dsymbol* ps, Identifier ident)
{
*ps = null;
return true;
}
override const(char)* toChars() const
{
OutBuffer buf;
toCBufferInstance(this, &buf);
return buf.extractChars();
}
override final const(char)* toPrettyCharsHelper()
{
OutBuffer buf;
toCBufferInstance(this, &buf, true);
return buf.extractChars();
}
/**************************************
* Given an error instantiating the TemplateInstance,
* give the nested TemplateInstance instantiations that got
* us here. Those are a list threaded into the nested scopes.
*/
extern(D) final void printInstantiationTrace(Classification cl = Classification.error)
{
if (global.gag)
return;
// Print full trace for verbose mode, otherwise only short traces
const(uint) max_shown = !global.params.verbose ? 6 : uint.max;
const(char)* format = "instantiated from here: `%s`";
// This returns a function pointer
scope printFn = () {
final switch (cl)
{
case Classification.error:
return &errorSupplemental;
case Classification.warning:
return &warningSupplemental;
case Classification.deprecation:
return &deprecationSupplemental;
case Classification.gagged, Classification.tip:
assert(0);
}
}();
// determine instantiation depth and number of recursive instantiations
int n_instantiations = 1;
int n_totalrecursions = 0;
for (TemplateInstance cur = this; cur; cur = cur.tinst)
{
++n_instantiations;
// Set error here as we don't want it to depend on the number of
// entries that are being printed.
if (cl == Classification.error ||
(cl == Classification.warning && global.params.warnings == DiagnosticReporting.error) ||
(cl == Classification.deprecation && global.params.useDeprecated == DiagnosticReporting.error))
cur.errors = true;
// If two instantiations use the same declaration, they are recursive.
// (this works even if they are instantiated from different places in the
// same template).
// In principle, we could also check for multiple-template recursion, but it's
// probably not worthwhile.
if (cur.tinst && cur.tempdecl && cur.tinst.tempdecl && cur.tempdecl.loc.equals(cur.tinst.tempdecl.loc))
++n_totalrecursions;
}
if (n_instantiations <= max_shown)
{
for (TemplateInstance cur = this; cur; cur = cur.tinst)
printFn(cur.loc, format, cur.toChars());
}
else if (n_instantiations - n_totalrecursions <= max_shown)
{
// By collapsing recursive instantiations into a single line,
// we can stay under the limit.
int recursionDepth = 0;
for (TemplateInstance cur = this; cur; cur = cur.tinst)
{
if (cur.tinst && cur.tempdecl && cur.tinst.tempdecl && cur.tempdecl.loc.equals(cur.tinst.tempdecl.loc))
{
++recursionDepth;
}
else
{
if (recursionDepth)
printFn(cur.loc, "%d recursive instantiations from here: `%s`", recursionDepth + 2, cur.toChars());
else
printFn(cur.loc, format, cur.toChars());
recursionDepth = 0;
}
}
}
else
{
// Even after collapsing the recursions, the depth is too deep.
// Just display the first few and last few instantiations.
uint i = 0;
for (TemplateInstance cur = this; cur; cur = cur.tinst)
{
if (i == max_shown / 2)
printFn(cur.loc, "... (%d instantiations, -v to show) ...", n_instantiations - max_shown);
if (i < max_shown / 2 || i >= n_instantiations - max_shown + max_shown / 2)
printFn(cur.loc, format, cur.toChars());
++i;
}
}
}
/*************************************
* Lazily generate identifier for template instance.
* This is because 75% of the ident's are never needed.
*/
override final Identifier getIdent()
{
if (!ident && inst && !errors)
ident = genIdent(tiargs); // need an identifier for name mangling purposes.
return ident;
}
/*************************************
* Compare proposed template instantiation with existing template instantiation.
* Note that this is not commutative because of the auto ref check.
* Params:
* ti = existing template instantiation
* Returns:
* true for match
*/
final bool equalsx(TemplateInstance ti)
{
//printf("this = %p, ti = %p\n", this, ti);
assert(tdtypes.dim == ti.tdtypes.dim);
// Nesting must match
if (enclosing != ti.enclosing)
{
//printf("test2 enclosing %s ti.enclosing %s\n", enclosing ? enclosing.toChars() : "", ti.enclosing ? ti.enclosing.toChars() : "");
goto Lnotequals;
}
//printf("parent = %s, ti.parent = %s\n", parent.toPrettyChars(), ti.parent.toPrettyChars());
if (!arrayObjectMatch(&tdtypes, &ti.tdtypes))
goto Lnotequals;
/* Template functions may have different instantiations based on
* "auto ref" parameters.
*/
if (auto fd = ti.toAlias().isFuncDeclaration())
{
if (!fd.errors)
{
auto fparameters = fd.getParameterList();
size_t nfparams = fparameters.length; // Num function parameters
for (size_t j = 0; j < nfparams; j++)
{
Parameter fparam = fparameters[j];
if (fparam.storageClass & STC.autoref) // if "auto ref"
{
Expression farg = fargs && j < fargs.dim ? (*fargs)[j] : fparam.defaultArg;
if (!farg)
goto Lnotequals;
if (farg.isLvalue())
{
if (!(fparam.storageClass & STC.ref_))
goto Lnotequals; // auto ref's don't match
}
else
{
if (fparam.storageClass & STC.ref_)
goto Lnotequals; // auto ref's don't match
}
}
}
}
}
return true;
Lnotequals:
return false;
}
final size_t toHash()
{
if (!hash)
{
hash = cast(size_t)cast(void*)enclosing;
hash += arrayObjectHash(&tdtypes);
hash += hash == 0;
}
return hash;
}
/**
Returns: true if the instances' innards are discardable.
The idea of this function is to see if the template instantiation
can be 100% replaced with its eponymous member. All other members
can be discarded, even in the compiler to free memory (for example,
the template could be expanded in a region allocator, deemed trivial,
the end result copied back out independently and the entire region freed),
and can be elided entirely from the binary.
The current implementation affects code that generally looks like:
---
template foo(args...) {
some_basic_type_or_string helper() { .... }
enum foo = helper();
}
---
since it was the easiest starting point of implementation but it can and
should be expanded more later.
*/
final bool isDiscardable()
{
if (aliasdecl is null)
return false;
auto v = aliasdecl.isVarDeclaration();
if (v is null)
return false;
if (!(v.storage_class & STC.manifest))
return false;
// Currently only doing basic types here because it is the easiest proof-of-concept
// implementation with minimal risk of side effects, but it could likely be
// expanded to any type that already exists outside this particular instance.
if (!(v.type.equals(Type.tstring) || (v.type.isTypeBasic() !is null)))
return false;
// Static ctors and dtors, even in an eponymous enum template, are still run,
// so if any of them are in here, we'd better not assume it is trivial lest
// we break useful code
foreach(member; *members)
{
if(member.hasStaticCtorOrDtor())
return false;
if(member.isStaticDtorDeclaration())
return false;
if(member.isStaticCtorDeclaration())
return false;
}
// but if it passes through this gauntlet... it should be fine. D code will
// see only the eponymous member, outside stuff can never access it, even through
// reflection; the outside world ought to be none the wiser. Even dmd should be
// able to simply free the memory of everything except the final result.
return true;
}
/***********************************************
* Returns true if this is not instantiated in non-root module, and
* is a part of non-speculative instantiatiation.
*
* Note: minst does not stabilize until semantic analysis is completed,
* so don't call this function during semantic analysis to return precise result.
*/
final bool needsCodegen()
{
// minst is finalized after the 1st invocation.
// tnext and tinst are only needed for the 1st invocation and
// cleared for further invocations.
TemplateInstance tnext = this.tnext;
TemplateInstance tinst = this.tinst;
this.tnext = null;
this.tinst = null;
if (errors || (inst && inst.isDiscardable()))
{
minst = null; // mark as speculative
return false;
}
if (global.params.allInst)
{
// Do codegen if there is an instantiation from a root module, to maximize link-ability.
// Do codegen if `this` is instantiated from a root module.
if (minst && minst.isRoot())
return true;
// Do codegen if the ancestor needs it.
if (tinst && tinst.needsCodegen())
{
minst = tinst.minst; // cache result
assert(minst);
assert(minst.isRoot());
return true;
}
// Do codegen if a sibling needs it.
if (tnext)
{
if (tnext.needsCodegen())
{
minst = tnext.minst; // cache result
assert(minst);
assert(minst.isRoot());
return true;
}
else if (!minst && tnext.minst)
{
minst = tnext.minst; // cache result from non-speculative sibling
return false;
}
}
// Elide codegen because there's no instantiation from any root modules.
return false;
}
else
{
// Prefer instantiations from non-root modules, to minimize object code size.
/* If a TemplateInstance is ever instantiated from a non-root module,
* we do not have to generate code for it,
* because it will be generated when the non-root module is compiled.
*
* But, if the non-root 'minst' imports any root modules, it might still need codegen.
*
* The problem is if A imports B, and B imports A, and both A
* and B instantiate the same template, does the compilation of A
* or the compilation of B do the actual instantiation?
*
* See https://issues.dlang.org/show_bug.cgi?id=2500.
*
* => Elide codegen if there is at least one instantiation from a non-root module
* which doesn't import any root modules.
*/
// If the ancestor isn't speculative,
// 1. do codegen if the ancestor needs it
// 2. elide codegen if the ancestor doesn't need it (non-root instantiation of ancestor incl. subtree)
if (tinst)
{
const needsCodegen = tinst.needsCodegen(); // sets tinst.minst
if (tinst.minst) // not speculative
{
minst = tinst.minst; // cache result
return needsCodegen;
}
}
// Elide codegen if `this` doesn't need it.
if (minst && !minst.isRoot() && !minst.rootImports())
return false;
// Elide codegen if a (non-speculative) sibling doesn't need it.
if (tnext)
{
const needsCodegen = tnext.needsCodegen(); // sets tnext.minst
if (tnext.minst) // not speculative
{
if (!needsCodegen)
{
minst = tnext.minst; // cache result
assert(!minst.isRoot() && !minst.rootImports());
return false;
}
else if (!minst)
{
minst = tnext.minst; // cache result from non-speculative sibling
return true;
}
}
}
// Unless `this` is still speculative (=> all further siblings speculative too),
// do codegen because we found no guaranteed-codegen'd non-root instantiation.
return minst !is null;
}
}
/**********************************************
* Find template declaration corresponding to template instance.
*
* Returns:
* false if finding fails.
* Note:
* This function is reentrant against error occurrence. If returns false,
* any members of this object won't be modified, and repetition call will
* reproduce same error.
*/
extern (D) final bool findTempDecl(Scope* sc, WithScopeSymbol* pwithsym)
{
if (pwithsym)
*pwithsym = null;
if (havetempdecl)
return true;
//printf("TemplateInstance.findTempDecl() %s\n", toChars());
if (!tempdecl)
{
/* Given:
* foo!( ... )
* figure out which TemplateDeclaration foo refers to.
*/
Identifier id = name;
Dsymbol scopesym;
Dsymbol s = sc.search(loc, id, &scopesym);
if (!s)
{
s = sc.search_correct(id);
if (s)
error("template `%s` is not defined, did you mean %s?", id.toChars(), s.toChars());
else
error("template `%s` is not defined", id.toChars());
return false;
}
static if (LOG)
{
printf("It's an instance of '%s' kind '%s'\n", s.toChars(), s.kind());
if (s.parent)
printf("s.parent = '%s'\n", s.parent.toChars());
}
if (pwithsym)
*pwithsym = scopesym.isWithScopeSymbol();
/* We might have found an alias within a template when
* we really want the template.
*/
TemplateInstance ti;
if (s.parent && (ti = s.parent.isTemplateInstance()) !is null)
{
if (ti.tempdecl && ti.tempdecl.ident == id)
{
/* This is so that one can refer to the enclosing
* template, even if it has the same name as a member
* of the template, if it has a !(arguments)
*/
TemplateDeclaration td = ti.tempdecl.isTemplateDeclaration();
assert(td);
if (td.overroot) // if not start of overloaded list of TemplateDeclaration's
td = td.overroot; // then get the start
s = td;
}
}
// The template might originate from a selective import which implies that
// s is a lowered AliasDeclaration of the actual TemplateDeclaration.
// This is the last place where we see the deprecated alias because it is
// stripped below, so check if the selective import was deprecated.
// See https://issues.dlang.org/show_bug.cgi?id=20840.
if (s.isAliasDeclaration())
s.checkDeprecated(this.loc, sc);
if (!updateTempDecl(sc, s))
{
return false;
}
}
assert(tempdecl);
// Look for forward references
auto tovers = tempdecl.isOverloadSet();
foreach (size_t oi; 0 .. tovers ? tovers.a.dim : 1)
{
Dsymbol dstart = tovers ? tovers.a[oi] : tempdecl;
int r = overloadApply(dstart, (Dsymbol s)
{
auto td = s.isTemplateDeclaration();
if (!td)
return 0;
if (td.semanticRun == PASS.initial)
{
if (td._scope)
{
// Try to fix forward reference. Ungag errors while doing so.
Ungag ungag = td.ungagSpeculative();
td.dsymbolSemantic(td._scope);
}
if (td.semanticRun == PASS.initial)
{
error("`%s` forward references template declaration `%s`",
toChars(), td.toChars());
return 1;
}
}
return 0;
});
if (r)
return false;
}
return true;
}
/**********************************************
* Confirm s is a valid template, then store it.
* Input:
* sc
* s candidate symbol of template. It may be:
* TemplateDeclaration
* FuncDeclaration with findTemplateDeclRoot() != NULL
* OverloadSet which contains candidates
* Returns:
* true if updating succeeds.
*/
extern (D) final bool updateTempDecl(Scope* sc, Dsymbol s)
{
if (!s)
return tempdecl !is null;
Identifier id = name;
s = s.toAlias();
/* If an OverloadSet, look for a unique member that is a template declaration
*/
if (OverloadSet os = s.isOverloadSet())
{
s = null;
foreach (s2; os.a)
{
if (FuncDeclaration f = s2.isFuncDeclaration())
s2 = f.findTemplateDeclRoot();
else
s2 = s2.isTemplateDeclaration();
if (s2)
{
if (s)
{
tempdecl = os;
return true;
}
s = s2;
}
}
if (!s)
{
error("template `%s` is not defined", id.toChars());
return false;
}
}
if (OverDeclaration od = s.isOverDeclaration())
{
tempdecl = od; // TODO: more strict check
return true;
}
/* It should be a TemplateDeclaration, not some other symbol
*/
if (FuncDeclaration f = s.isFuncDeclaration())
tempdecl = f.findTemplateDeclRoot();
else
tempdecl = s.isTemplateDeclaration();
// We're done
if (tempdecl)
return true;
// Error already issued, just return `false`
if (!s.parent && global.errors)
return false;
if (!s.parent && s.getType())
{
Dsymbol s2 = s.getType().toDsymbol(sc);
if (!s2)
{
.error(loc, "`%s` is not a valid template instance, because `%s` is not a template declaration but a type (`%s == %s`)", toChars(), id.toChars(), id.toChars(), s.getType.kind());
return false;
}
// because s can be the alias created for a TemplateParameter
const AliasDeclaration ad = s.isAliasDeclaration();
version (none)
{
if (ad && ad.isAliasedTemplateParameter())
printf("`%s` is an alias created from a template parameter\n", s.toChars());
}
if (!ad || !ad.isAliasedTemplateParameter())
s = s2;
}
TemplateInstance ti = s.parent ? s.parent.isTemplateInstance() : null;
if (ti && (ti.name == s.ident || ti.toAlias().ident == s.ident) && ti.tempdecl)
{
/* This is so that one can refer to the enclosing
* template, even if it has the same name as a member
* of the template, if it has a !(arguments)
*/
TemplateDeclaration td = ti.tempdecl.isTemplateDeclaration();
assert(td);
if (td.overroot) // if not start of overloaded list of TemplateDeclaration's
td = td.overroot; // then get the start
tempdecl = td;
return true;
}
else
{
error("`%s` is not a template declaration, it is a %s", id.toChars(), s.kind());
return false;
}
}
/**********************************
* Run semantic of tiargs as arguments of template.
* Input:
* loc
* sc
* tiargs array of template arguments
* flags 1: replace const variables with their initializers
* 2: don't devolve Parameter to Type
* atd tuple being optimized. If found, it's not expanded here
* but in AliasAssign semantic.
* Returns:
* false if one or more arguments have errors.
*/
extern (D) static bool semanticTiargs(const ref Loc loc, Scope* sc, Objects* tiargs, int flags, TupleDeclaration atd = null)
{
// Run semantic on each argument, place results in tiargs[]
//printf("+TemplateInstance.semanticTiargs()\n");
if (!tiargs)
return true;
bool err = false;
for (size_t j = 0; j < tiargs.dim; j++)
{
RootObject o = (*tiargs)[j];
Type ta = isType(o);
Expression ea = isExpression(o);
Dsymbol sa = isDsymbol(o);
//printf("1: (*tiargs)[%d] = %p, s=%p, v=%p, ea=%p, ta=%p\n", j, o, isDsymbol(o), isTuple(o), ea, ta);
if (ta)
{
//printf("type %s\n", ta.toChars());
// It might really be an Expression or an Alias
ta.resolve(loc, sc, ea, ta, sa, (flags & 1) != 0);
if (ea)
goto Lexpr;
if (sa)
goto Ldsym;
if (ta is null)
{
assert(global.errors);
ta = Type.terror;
}
Ltype:
if (ta.ty == Ttuple)
{
// Expand tuple
TypeTuple tt = cast(TypeTuple)ta;
size_t dim = tt.arguments.dim;
tiargs.remove(j);
if (dim)
{
tiargs.reserve(dim);
foreach (i, arg; *tt.arguments)
{
if (flags & 2 && (arg.storageClass & STC.parameter))
tiargs.insert(j + i, arg);
else
tiargs.insert(j + i, arg.type);
}
}
j--;
continue;
}
if (ta.ty == Terror)
{
err = true;
continue;
}
(*tiargs)[j] = ta.merge2();
}
else if (ea)
{
Lexpr:
//printf("+[%d] ea = %s %s\n", j, EXPtoString(ea.op).ptr, ea.toChars());
if (flags & 1) // only used by __traits
{
ea = ea.expressionSemantic(sc);
// must not interpret the args, excepting template parameters
if (ea.op != EXP.variable || ((cast(VarExp)ea).var.storage_class & STC.templateparameter))
{
ea = ea.optimize(WANTvalue);
}
}
else
{
sc = sc.startCTFE();
ea = ea.expressionSemantic(sc);
sc = sc.endCTFE();
if (ea.op == EXP.variable)
{
/* If the parameter is a function that is not called
* explicitly, i.e. `foo!func` as opposed to `foo!func()`,
* then it is a dsymbol, not the return value of `func()`
*/
Declaration vd = (cast(VarExp)ea).var;
if (auto fd = vd.isFuncDeclaration())
{
sa = fd;
goto Ldsym;
}
/* Otherwise skip substituting a const var with
* its initializer. The problem is the initializer won't
* match with an 'alias' parameter. Instead, do the
* const substitution in TemplateValueParameter.matchArg().
*/
}
else if (definitelyValueParameter(ea))
{
if (ea.checkValue()) // check void expression
ea = ErrorExp.get();
uint olderrs = global.errors;
ea = ea.ctfeInterpret();
if (global.errors != olderrs)
ea = ErrorExp.get();
}
}
//printf("-[%d] ea = %s %s\n", j, EXPtoString(ea.op).ptr, ea.toChars());
if (ea.op == EXP.tuple)
{
// Expand tuple
TupleExp te = cast(TupleExp)ea;
size_t dim = te.exps.dim;
tiargs.remove(j);
if (dim)
{
tiargs.reserve(dim);
foreach (i, exp; *te.exps)
tiargs.insert(j + i, exp);
}
j--;
continue;
}
if (ea.op == EXP.error)
{
err = true;
continue;
}
(*tiargs)[j] = ea;
if (ea.op == EXP.type)
{
ta = ea.type;
goto Ltype;
}
if (ea.op == EXP.scope_)
{
sa = (cast(ScopeExp)ea).sds;
goto Ldsym;
}
if (ea.op == EXP.function_)
{
FuncExp fe = cast(FuncExp)ea;
/* A function literal, that is passed to template and
* already semanticed as function pointer, never requires
* outer frame. So convert it to global function is valid.
*/
if (fe.fd.tok == TOK.reserved && fe.type.ty == Tpointer)
{
// change to non-nested
fe.fd.tok = TOK.function_;
fe.fd.vthis = null;
}
else if (fe.td)
{
/* If template argument is a template lambda,
* get template declaration itself. */
//sa = fe.td;
//goto Ldsym;
}
}
if (ea.op == EXP.dotVariable && !(flags & 1))
{
// translate expression to dsymbol.
sa = (cast(DotVarExp)ea).var;
goto Ldsym;
}
if (ea.op == EXP.template_)
{
sa = (cast(TemplateExp)ea).td;
goto Ldsym;
}
if (ea.op == EXP.dotTemplateDeclaration && !(flags & 1))
{
// translate expression to dsymbol.
sa = (cast(DotTemplateExp)ea).td;
goto Ldsym;
}
if (ea.op == EXP.dot)
{
if (auto se = (cast(DotExp)ea).e2.isScopeExp())
{
sa = se.sds;
goto Ldsym;
}
}
}
else if (sa)
{
Ldsym:
//printf("dsym %s %s\n", sa.kind(), sa.toChars());
if (sa.errors)
{
err = true;
continue;
}
TupleDeclaration d = sa.toAlias().isTupleDeclaration();
if (d)
{
if (d is atd)
{
(*tiargs)[j] = d;
continue;
}
// Expand tuple
tiargs.remove(j);
tiargs.insert(j, d.objects);
j--;
continue;
}
if (FuncAliasDeclaration fa = sa.isFuncAliasDeclaration())
{
FuncDeclaration f = fa.toAliasFunc();
if (!fa.hasOverloads && f.isUnique())
{
// Strip FuncAlias only when the aliased function
// does not have any overloads.
sa = f;
}
}
(*tiargs)[j] = sa;
TemplateDeclaration td = sa.isTemplateDeclaration();
if (td && td.semanticRun == PASS.initial && td.literal)
{
td.dsymbolSemantic(sc);
}
FuncDeclaration fd = sa.isFuncDeclaration();
if (fd)
fd.functionSemantic();
}
else if (isParameter(o))
{
}
else
{
assert(0);
}
//printf("1: (*tiargs)[%d] = %p\n", j, (*tiargs)[j]);
}
version (none)
{
printf("-TemplateInstance.semanticTiargs()\n");
for (size_t j = 0; j < tiargs.dim; j++)
{
RootObject o = (*tiargs)[j];
Type ta = isType(o);
Expression ea = isExpression(o);
Dsymbol sa = isDsymbol(o);
Tuple va = isTuple(o);
printf("\ttiargs[%d] = ta %p, ea %p, sa %p, va %p\n", j, ta, ea, sa, va);
}
}
return !err;
}
/**********************************
* Run semantic on the elements of tiargs.
* Input:
* sc
* Returns:
* false if one or more arguments have errors.
* Note:
* This function is reentrant against error occurrence. If returns false,
* all elements of tiargs won't be modified.
*/
extern (D) final bool semanticTiargs(Scope* sc)
{
//printf("+TemplateInstance.semanticTiargs() %s\n", toChars());
if (semantictiargsdone)
return true;
if (semanticTiargs(loc, sc, tiargs, 0))
{
// cache the result iff semantic analysis succeeded entirely
semantictiargsdone = 1;
return true;
}
return false;
}
/**********************************
* Find the TemplateDeclaration that matches this TemplateInstance best.
*
* Params:
* sc = the scope this TemplateInstance resides in
* fargs = function arguments in case of a template function, null otherwise
*
* Returns:
* `true` if a match was found, `false` otherwise
*/
extern (D) final bool findBestMatch(Scope* sc, Expressions* fargs)
{
if (havetempdecl)
{
TemplateDeclaration tempdecl = this.tempdecl.isTemplateDeclaration();
assert(tempdecl);
assert(tempdecl._scope);
// Deduce tdtypes
tdtypes.setDim(tempdecl.parameters.dim);
if (!tempdecl.matchWithInstance(sc, this, &tdtypes, fargs, 2))
{
error("incompatible arguments for template instantiation");
return false;
}
// TODO: Normalizing tiargs for https://issues.dlang.org/show_bug.cgi?id=7469 is necessary?
return true;
}
static if (LOG)
{
printf("TemplateInstance.findBestMatch()\n");
}
uint errs = global.errors;
TemplateDeclaration td_last = null;
Objects dedtypes;
/* Since there can be multiple TemplateDeclaration's with the same
* name, look for the best match.
*/
auto tovers = tempdecl.isOverloadSet();
foreach (size_t oi; 0 .. tovers ? tovers.a.dim : 1)
{
TemplateDeclaration td_best;
TemplateDeclaration td_ambig;
MATCH m_best = MATCH.nomatch;
Dsymbol dstart = tovers ? tovers.a[oi] : tempdecl;
overloadApply(dstart, (Dsymbol s)
{
auto td = s.isTemplateDeclaration();
if (!td)
return 0;
if (td.inuse)
{
td.error(loc, "recursive template expansion");
return 1;
}
if (td == td_best) // skip duplicates
return 0;
//printf("td = %s\n", td.toPrettyChars());
// If more arguments than parameters,
// then this is no match.
if (td.parameters.dim < tiargs.dim)
{
if (!td.isVariadic())
return 0;
}
dedtypes.setDim(td.parameters.dim);
dedtypes.zero();
assert(td.semanticRun != PASS.initial);
MATCH m = td.matchWithInstance(sc, this, &dedtypes, fargs, 0);
//printf("matchWithInstance = %d\n", m);
if (m == MATCH.nomatch) // no match at all
return 0;
if (m < m_best) goto Ltd_best;
if (m > m_best) goto Ltd;
// Disambiguate by picking the most specialized TemplateDeclaration
{
MATCH c1 = td.leastAsSpecialized(sc, td_best, fargs);
MATCH c2 = td_best.leastAsSpecialized(sc, td, fargs);
//printf("c1 = %d, c2 = %d\n", c1, c2);
if (c1 > c2) goto Ltd;
if (c1 < c2) goto Ltd_best;
}
td_ambig = td;
return 0;
Ltd_best:
// td_best is the best match so far
td_ambig = null;
return 0;
Ltd:
// td is the new best match
td_ambig = null;
td_best = td;
m_best = m;
tdtypes.setDim(dedtypes.dim);
memcpy(tdtypes.tdata(), dedtypes.tdata(), tdtypes.dim * (void*).sizeof);
return 0;
});
if (td_ambig)
{
.error(loc, "%s `%s.%s` matches more than one template declaration:\n%s: `%s`\nand\n%s: `%s`",
td_best.kind(), td_best.parent.toPrettyChars(), td_best.ident.toChars(),
td_best.loc.toChars(), td_best.toChars(),
td_ambig.loc.toChars(), td_ambig.toChars());
return false;
}
if (td_best)
{
if (!td_last)
td_last = td_best;
else if (td_last != td_best)
{
ScopeDsymbol.multiplyDefined(loc, td_last, td_best);
return false;
}
}
}
if (td_last)
{
/* https://issues.dlang.org/show_bug.cgi?id=7469
* Normalize tiargs by using corresponding deduced
* template value parameters and tuples for the correct mangling.
*
* By doing this before hasNestedArgs, CTFEable local variable will be
* accepted as a value parameter. For example:
*
* void foo() {
* struct S(int n) {} // non-global template
* const int num = 1; // CTFEable local variable
* S!num s; // S!1 is instantiated, not S!num
* }
*/
size_t dim = td_last.parameters.dim - (td_last.isVariadic() ? 1 : 0);
for (size_t i = 0; i < dim; i++)
{
if (tiargs.dim <= i)
tiargs.push(tdtypes[i]);
assert(i < tiargs.dim);
auto tvp = (*td_last.parameters)[i].isTemplateValueParameter();
if (!tvp)
continue;
assert(tdtypes[i]);
// tdtypes[i] is already normalized to the required type in matchArg
(*tiargs)[i] = tdtypes[i];
}
if (td_last.isVariadic() && tiargs.dim == dim && tdtypes[dim])
{
Tuple va = isTuple(tdtypes[dim]);
assert(va);
tiargs.pushSlice(va.objects[]);
}
}
else if (errors && inst)
{
// instantiation was failed with error reporting
assert(global.errors);
return false;
}
else
{
auto tdecl = tempdecl.isTemplateDeclaration();
if (errs != global.errors)
errorSupplemental(loc, "while looking for match for `%s`", toChars());
else if (tdecl && !tdecl.overnext)
{
// Only one template, so we can give better error message
const(char)* msg = "does not match template declaration";
const(char)* tip;
const tmsg = tdecl.toCharsNoConstraints();
const cmsg = tdecl.getConstraintEvalError(tip);
if (cmsg)
{
error("%s `%s`\n%s", msg, tmsg, cmsg);
if (tip)
.tip(tip);
}
else
{
error("%s `%s`", msg, tmsg);
if (tdecl.parameters.dim == tiargs.dim)
{
// https://issues.dlang.org/show_bug.cgi?id=7352
// print additional information, e.g. `foo` is not a type
foreach (i, param; *tdecl.parameters)
{
MATCH match = param.matchArg(loc, sc, tiargs, i, tdecl.parameters, &dedtypes, null);
auto arg = (*tiargs)[i];
auto sym = arg.isDsymbol;
auto exp = arg.isExpression;
if (exp)
exp = exp.optimize(WANTvalue);
if (match == MATCH.nomatch &&
((sym && sym.isFuncDeclaration) ||
(exp && exp.isVarExp)))
{
if (param.isTemplateTypeParameter)
errorSupplemental(loc, "`%s` is not a type", arg.toChars);
else if (auto tvp = param.isTemplateValueParameter)
errorSupplemental(loc, "`%s` is not of a value of type `%s`",
arg.toChars, tvp.valType.toChars);
}
}
}
}
}
else
.error(loc, "%s `%s.%s` does not match any template declaration", tempdecl.kind(), tempdecl.parent.toPrettyChars(), tempdecl.ident.toChars());
return false;
}
/* The best match is td_last
*/
tempdecl = td_last;
static if (LOG)
{
printf("\tIt's a match with template declaration '%s'\n", tempdecl.toChars());
}
return (errs == global.errors);
}
/*****************************************************
* Determine if template instance is really a template function,
* and that template function needs to infer types from the function
* arguments.
*
* Like findBestMatch, iterate possible template candidates,
* but just looks only the necessity of type inference.
*/
extern (D) final bool needsTypeInference(Scope* sc, int flag = 0)
{
//printf("TemplateInstance.needsTypeInference() %s\n", toChars());
if (semanticRun != PASS.initial)
return false;
uint olderrs = global.errors;
Objects dedtypes;
size_t count = 0;
auto tovers = tempdecl.isOverloadSet();
foreach (size_t oi; 0 .. tovers ? tovers.a.dim : 1)
{
Dsymbol dstart = tovers ? tovers.a[oi] : tempdecl;
int r = overloadApply(dstart, (Dsymbol s)
{
auto td = s.isTemplateDeclaration();
if (!td)
return 0;
if (td.inuse)
{
td.error(loc, "recursive template expansion");
return 1;
}
/* If any of the overloaded template declarations need inference,
* then return true
*/
if (!td.onemember)
return 0;
if (auto td2 = td.onemember.isTemplateDeclaration())
{
if (!td2.onemember || !td2.onemember.isFuncDeclaration())
return 0;
if (tiargs.dim >= td.parameters.dim - (td.isVariadic() ? 1 : 0))
return 0;
return 1;
}
auto fd = td.onemember.isFuncDeclaration();
if (!fd || fd.type.ty != Tfunction)
return 0;
foreach (tp; *td.parameters)
{
if (tp.isTemplateThisParameter())
return 1;
}
/* Determine if the instance arguments, tiargs, are all that is necessary
* to instantiate the template.
*/
//printf("tp = %p, td.parameters.dim = %d, tiargs.dim = %d\n", tp, td.parameters.dim, tiargs.dim);
auto tf = cast(TypeFunction)fd.type;
if (tf.parameterList.length)
{
auto tp = td.isVariadic();
if (tp && td.parameters.dim > 1)
return 1;
if (!tp && tiargs.dim < td.parameters.dim)
{
// Can remain tiargs be filled by default arguments?
foreach (size_t i; tiargs.dim .. td.parameters.dim)
{
if (!(*td.parameters)[i].hasDefaultArg())
return 1;
}
}
foreach (i, fparam; tf.parameterList)
{
// 'auto ref' needs inference.
if (fparam.storageClass & STC.auto_)
return 1;
}
}
if (!flag)
{
/* Calculate the need for overload resolution.
* When only one template can match with tiargs, inference is not necessary.
*/
dedtypes.setDim(td.parameters.dim);
dedtypes.zero();
if (td.semanticRun == PASS.initial)
{
if (td._scope)
{
// Try to fix forward reference. Ungag errors while doing so.
Ungag ungag = td.ungagSpeculative();
td.dsymbolSemantic(td._scope);
}
if (td.semanticRun == PASS.initial)
{
error("`%s` forward references template declaration `%s`", toChars(), td.toChars());
return 1;
}
}
MATCH m = td.matchWithInstance(sc, this, &dedtypes, null, 0);
if (m == MATCH.nomatch)
return 0;
}
/* If there is more than one function template which matches, we may
* need type inference (see https://issues.dlang.org/show_bug.cgi?id=4430)
*/
return ++count > 1 ? 1 : 0;
});
if (r)
return true;
}
if (olderrs != global.errors)
{
if (!global.gag)
{
errorSupplemental(loc, "while looking for match for `%s`", toChars());
semanticRun = PASS.semanticdone;
inst = this;
}
errors = true;
}
//printf("false\n");
return false;
}
/*****************************************
* Determines if a TemplateInstance will need a nested
* generation of the TemplateDeclaration.
* Sets enclosing property if so, and returns != 0;
*/
extern (D) final bool hasNestedArgs(Objects* args, bool isstatic)
{
int nested = 0;
//printf("TemplateInstance.hasNestedArgs('%s')\n", tempdecl.ident.toChars());
// arguments from parent instances are also accessible
if (!enclosing)
{
if (TemplateInstance ti = tempdecl.toParent().isTemplateInstance())
enclosing = ti.enclosing;
}
/* A nested instance happens when an argument references a local
* symbol that is on the stack.
*/
foreach (o; *args)
{
Expression ea = isExpression(o);
Dsymbol sa = isDsymbol(o);
Tuple va = isTuple(o);
if (ea)
{
if (ea.op == EXP.variable)
{
sa = (cast(VarExp)ea).var;
goto Lsa;
}
if (ea.op == EXP.this_)
{
sa = (cast(ThisExp)ea).var;
goto Lsa;
}
if (ea.op == EXP.function_)
{
if ((cast(FuncExp)ea).td)
sa = (cast(FuncExp)ea).td;
else
sa = (cast(FuncExp)ea).fd;
goto Lsa;
}
// Emulate Expression.toMangleBuffer call that had exist in TemplateInstance.genIdent.
if (ea.op != EXP.int64 && ea.op != EXP.float64 && ea.op != EXP.complex80 && ea.op != EXP.null_ && ea.op != EXP.string_ && ea.op != EXP.arrayLiteral && ea.op != EXP.assocArrayLiteral && ea.op != EXP.structLiteral)
{
ea.error("expression `%s` is not a valid template value argument", ea.toChars());
errors = true;
}
}
else if (sa)
{
Lsa:
sa = sa.toAlias();
TemplateDeclaration td = sa.isTemplateDeclaration();
if (td)
{
TemplateInstance ti = sa.toParent().isTemplateInstance();
if (ti && ti.enclosing)
sa = ti;
}
TemplateInstance ti = sa.isTemplateInstance();
Declaration d = sa.isDeclaration();
if ((td && td.literal) || (ti && ti.enclosing) || (d && !d.isDataseg() && !(d.storage_class & STC.manifest) && (!d.isFuncDeclaration() || d.isFuncDeclaration().isNested()) && !isTemplateMixin()))
{
Dsymbol dparent = sa.toParent2();
if (!dparent || dparent.isModule)
goto L1;
else if (!enclosing)
enclosing = dparent;
else if (enclosing != dparent)
{
/* Select the more deeply nested of the two.
* Error if one is not nested inside the other.
*/
for (Dsymbol p = enclosing; p; p = p.parent)
{
if (p == dparent)
goto L1; // enclosing is most nested
}
for (Dsymbol p = dparent; p; p = p.parent)
{
if (p == enclosing)
{
enclosing = dparent;
goto L1; // dparent is most nested
}
}
//https://issues.dlang.org/show_bug.cgi?id=17870
if (dparent.isClassDeclaration() && enclosing.isClassDeclaration())
{
auto pc = dparent.isClassDeclaration();
auto ec = enclosing.isClassDeclaration();
if (pc.isBaseOf(ec, null))
goto L1;
else if (ec.isBaseOf(pc, null))
{
enclosing = dparent;
goto L1;
}
}
error("`%s` is nested in both `%s` and `%s`", toChars(), enclosing.toChars(), dparent.toChars());
errors = true;
}
L1:
//printf("\tnested inside %s as it references %s\n", enclosing.toChars(), sa.toChars());
nested |= 1;
}
}
else if (va)
{
nested |= cast(int)hasNestedArgs(&va.objects, isstatic);
}
}
//printf("-TemplateInstance.hasNestedArgs('%s') = %d\n", tempdecl.ident.toChars(), nested);
return nested != 0;
}
/*****************************************
* Append 'this' to the specific module members[]
*/
extern (D) final Dsymbols* appendToModuleMember()
{
Module mi = minst; // instantiated . inserted module
//printf("%s.appendToModuleMember() enclosing = %s mi = %s\n",
// toPrettyChars(),
// enclosing ? enclosing.toPrettyChars() : null,
// mi ? mi.toPrettyChars() : null);
if (global.params.allInst || !mi || mi.isRoot())
{
/* If the instantiated module is speculative or root, insert to the
* member of a root module. Then:
* - semantic3 pass will get called on the instance members.
* - codegen pass will get a selection chance to do/skip it (needsCodegen()).
*/
static Dsymbol getStrictEnclosing(TemplateInstance ti)
{
do
{
if (ti.enclosing)
return ti.enclosing;
ti = ti.tempdecl.isInstantiated();
} while (ti);
return null;
}
Dsymbol enc = getStrictEnclosing(this);
// insert target is made stable by using the module
// where tempdecl is declared.
mi = (enc ? enc : tempdecl).getModule();
if (!mi.isRoot())
{
if (mi.importedFrom)
{
mi = mi.importedFrom;
assert(mi.isRoot());
}
else
{
// This can happen when using the frontend as a library.
// Append it to the non-root module.
}
}
}
else
{
/* If the instantiated module is non-root, insert to the member of the
* non-root module. Then:
* - semantic3 pass won't be called on the instance.
* - codegen pass won't reach to the instance.
* Unless it is re-appended to a root module later (with changed minst).
*/
}
//printf("\t-. mi = %s\n", mi.toPrettyChars());
assert(!memberOf || (!memberOf.isRoot() && mi.isRoot()), "can only re-append from non-root to root module");
Dsymbols* a = mi.members;
a.push(this);
memberOf = mi;
if (mi.semanticRun >= PASS.semantic2done && mi.isRoot())
Module.addDeferredSemantic2(this);
if (mi.semanticRun >= PASS.semantic3done && mi.isRoot())
Module.addDeferredSemantic3(this);
return a;
}
/****************************************************
* Declare parameters of template instance, initialize them with the
* template instance arguments.
*/
extern (D) final void declareParameters(Scope* sc)
{
TemplateDeclaration tempdecl = this.tempdecl.isTemplateDeclaration();
assert(tempdecl);
//printf("TemplateInstance.declareParameters()\n");
foreach (i, o; tdtypes) // initializer for tp
{
TemplateParameter tp = (*tempdecl.parameters)[i];
//printf("\ttdtypes[%d] = %p\n", i, o);
tempdecl.declareParameter(sc, tp, o);
}
}
/****************************************
* This instance needs an identifier for name mangling purposes.
* Create one by taking the template declaration name and adding
* the type signature for it.
*/
extern (D) final Identifier genIdent(Objects* args)
{
//printf("TemplateInstance.genIdent('%s')\n", tempdecl.ident.toChars());
assert(args is tiargs);
OutBuffer buf;
mangleToBuffer(this, &buf);
//printf("\tgenIdent = %s\n", buf.peekChars());
return Identifier.idPool(buf[]);
}
extern (D) final void expandMembers(Scope* sc2)
{
members.foreachDsymbol( (s) { s.setScope (sc2); } );
members.foreachDsymbol( (s) { s.importAll(sc2); } );
void symbolDg(Dsymbol s)
{
//printf("\t semantic on '%s' %p kind %s in '%s'\n", s.toChars(), s, s.kind(), this.toChars());
//printf("test: enclosing = %d, sc2.parent = %s\n", enclosing, sc2.parent.toChars());
//if (enclosing)
// s.parent = sc.parent;
//printf("test3: enclosing = %d, s.parent = %s\n", enclosing, s.parent.toChars());
s.dsymbolSemantic(sc2);
//printf("test4: enclosing = %d, s.parent = %s\n", enclosing, s.parent.toChars());
Module.runDeferredSemantic();
}
members.foreachDsymbol(&symbolDg);
}
extern (D) final void tryExpandMembers(Scope* sc2)
{
__gshared int nest;
// extracted to a function to allow windows SEH to work without destructors in the same function
//printf("%d\n", nest);
if (++nest > global.recursionLimit)
{
global.gag = 0; // ensure error message gets printed
error("recursive expansion exceeded allowed nesting limit");
fatal();
}
expandMembers(sc2);
nest--;
}
extern (D) final void trySemantic3(Scope* sc2)
{
// extracted to a function to allow windows SEH to work without destructors in the same function
__gshared int nest;
//printf("%d\n", nest);
if (++nest > global.recursionLimit)
{
global.gag = 0; // ensure error message gets printed
error("recursive expansion exceeded allowed nesting limit");
fatal();
}
semantic3(this, sc2);
--nest;
}
override final inout(TemplateInstance) isTemplateInstance() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/**************************************
* IsExpression can evaluate the specified type speculatively, and even if
* it instantiates any symbols, they are normally unnecessary for the
* final executable.
* However, if those symbols leak to the actual code, compiler should remark
* them as non-speculative to generate their code and link to the final executable.
*/
void unSpeculative(Scope* sc, RootObject o)
{
if (!o)
return;
if (Tuple tup = isTuple(o))
{
foreach (obj; tup.objects)
{
unSpeculative(sc, obj);
}
return;
}
Dsymbol s = getDsymbol(o);
if (!s)
return;
if (Declaration d = s.isDeclaration())
{
if (VarDeclaration vd = d.isVarDeclaration())
o = vd.type;
else if (AliasDeclaration ad = d.isAliasDeclaration())
{
o = ad.getType();
if (!o)
o = ad.toAlias();
}
else
o = d.toAlias();
s = getDsymbol(o);
if (!s)
return;
}
if (TemplateInstance ti = s.isTemplateInstance())
{
// If the instance is already non-speculative,
// or it is leaked to the speculative scope.
if (ti.minst !is null || sc.minst is null)
return;
// Remark as non-speculative instance.
ti.minst = sc.minst;
if (!ti.tinst)
ti.tinst = sc.tinst;
unSpeculative(sc, ti.tempdecl);
}
if (TemplateInstance ti = s.isInstantiated())
unSpeculative(sc, ti);
}
/**********************************
* Return true if e could be valid only as a template value parameter.
* Return false if it might be an alias or tuple.
* (Note that even in this case, it could still turn out to be a value).
*/
bool definitelyValueParameter(Expression e)
{
// None of these can be value parameters
if (e.op == EXP.tuple || e.op == EXP.scope_ ||
e.op == EXP.type || e.op == EXP.dotType ||
e.op == EXP.template_ || e.op == EXP.dotTemplateDeclaration ||
e.op == EXP.function_ || e.op == EXP.error ||
e.op == EXP.this_ || e.op == EXP.super_ ||
e.op == EXP.dot)
return false;
if (e.op != EXP.dotVariable)
return true;
/* Template instantiations involving a DotVar expression are difficult.
* In most cases, they should be treated as a value parameter, and interpreted.
* But they might also just be a fully qualified name, which should be treated
* as an alias.
*/
// x.y.f cannot be a value
FuncDeclaration f = (cast(DotVarExp)e).var.isFuncDeclaration();
if (f)
return false;
while (e.op == EXP.dotVariable)
{
e = (cast(DotVarExp)e).e1;
}
// this.x.y and super.x.y couldn't possibly be valid values.
if (e.op == EXP.this_ || e.op == EXP.super_)
return false;
// e.type.x could be an alias
if (e.op == EXP.dotType)
return false;
// var.x.y is the only other possible form of alias
if (e.op != EXP.variable)
return true;
VarDeclaration v = (cast(VarExp)e).var.isVarDeclaration();
// func.x.y is not an alias
if (!v)
return true;
// https://issues.dlang.org/show_bug.cgi?id=16685
// var.x.y where var is a constant available at compile time
if (v.storage_class & STC.manifest)
return true;
// TODO: Should we force CTFE if it is a global constant?
return false;
}
/***********************************************************
* https://dlang.org/spec/template-mixin.html
* Syntax:
* mixin MixinTemplateName [TemplateArguments] [Identifier];
*/
extern (C++) final class TemplateMixin : TemplateInstance
{
TypeQualified tqual;
extern (D) this(const ref Loc loc, Identifier ident, TypeQualified tqual, Objects* tiargs)
{
super(loc,
tqual.idents.dim ? cast(Identifier)tqual.idents[tqual.idents.dim - 1] : (cast(TypeIdentifier)tqual).ident,
tiargs ? tiargs : new Objects());
//printf("TemplateMixin(ident = '%s')\n", ident ? ident.toChars() : "");
this.ident = ident;
this.tqual = tqual;
}
override TemplateInstance syntaxCopy(Dsymbol s)
{
auto tm = new TemplateMixin(loc, ident, tqual.syntaxCopy(), tiargs);
return TemplateInstance.syntaxCopy(tm);
}
override const(char)* kind() const
{
return "mixin";
}
override bool oneMember(Dsymbol* ps, Identifier ident)
{
return Dsymbol.oneMember(ps, ident);
}
override bool hasPointers()
{
//printf("TemplateMixin.hasPointers() %s\n", toChars());
return members.foreachDsymbol( (s) { return s.hasPointers(); } ) != 0;
}
override void setFieldOffset(AggregateDeclaration ad, ref FieldState fieldState, bool isunion)
{
//printf("TemplateMixin.setFieldOffset() %s\n", toChars());
if (_scope) // if fwd reference
dsymbolSemantic(this, null); // try to resolve it
members.foreachDsymbol( (s) { s.setFieldOffset(ad, fieldState, isunion); } );
}
override const(char)* toChars() const
{
OutBuffer buf;
toCBufferInstance(this, &buf);
return buf.extractChars();
}
extern (D) bool findTempDecl(Scope* sc)
{
// Follow qualifications to find the TemplateDeclaration
if (!tempdecl)
{
Expression e;
Type t;
Dsymbol s;
tqual.resolve(loc, sc, e, t, s);
if (!s)
{
error("is not defined");
return false;
}
s = s.toAlias();
tempdecl = s.isTemplateDeclaration();
OverloadSet os = s.isOverloadSet();
/* If an OverloadSet, look for a unique member that is a template declaration
*/
if (os)
{
Dsymbol ds = null;
foreach (i, sym; os.a)
{
Dsymbol s2 = sym.isTemplateDeclaration();
if (s2)
{
if (ds)
{
tempdecl = os;
break;
}
ds = s2;
}
}
}
if (!tempdecl)
{
error("- `%s` is a %s, not a template", s.toChars(), s.kind());
return false;
}
}
assert(tempdecl);
// Look for forward references
auto tovers = tempdecl.isOverloadSet();
foreach (size_t oi; 0 .. tovers ? tovers.a.dim : 1)
{
Dsymbol dstart = tovers ? tovers.a[oi] : tempdecl;
int r = overloadApply(dstart, (Dsymbol s)
{
auto td = s.isTemplateDeclaration();
if (!td)
return 0;
if (td.semanticRun == PASS.initial)
{
if (td._scope)
td.dsymbolSemantic(td._scope);
else
{
semanticRun = PASS.initial;
return 1;
}
}
return 0;
});
if (r)
return false;
}
return true;
}
override inout(TemplateMixin) isTemplateMixin() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/************************************
* This struct is needed for TemplateInstance to be the key in an associative array.
* Fixing https://issues.dlang.org/show_bug.cgi?id=15812 and
* https://issues.dlang.org/show_bug.cgi?id=15813 would make it unnecessary.
*/
struct TemplateInstanceBox
{
TemplateInstance ti;
this(TemplateInstance ti)
{
this.ti = ti;
this.ti.toHash();
assert(this.ti.hash);
}
size_t toHash() const @trusted pure nothrow
{
assert(ti.hash);
return ti.hash;
}
bool opEquals(ref const TemplateInstanceBox s) @trusted const
{
bool res = void;
if (ti.inst && s.ti.inst)
{
/* This clause is only used when an instance with errors
* is replaced with a correct instance.
*/
res = ti is s.ti;
}
else
{
/* Used when a proposed instance is used to see if there's
* an existing instance.
*/
static if (__VERSION__ < 2099) // https://issues.dlang.org/show_bug.cgi?id=22717
res = (cast()s.ti).equalsx(cast()ti);
else
res = (cast()ti).equalsx(cast()s.ti);
}
debug (FindExistingInstance) ++(res ? nHits : nCollisions);
return res;
}
debug (FindExistingInstance)
{
__gshared uint nHits, nCollisions;
shared static ~this()
{
printf("debug (FindExistingInstance) TemplateInstanceBox.equals hits: %u collisions: %u\n",
nHits, nCollisions);
}
}
}
/*******************************************
* Match to a particular TemplateParameter.
* Input:
* instLoc location that the template is instantiated.
* tiargs[] actual arguments to template instance
* i i'th argument
* parameters[] template parameters
* dedtypes[] deduced arguments to template instance
* *psparam set to symbol declared and initialized to dedtypes[i]
*/
MATCH matchArg(TemplateParameter tp, Loc instLoc, Scope* sc, Objects* tiargs, size_t i, TemplateParameters* parameters, Objects* dedtypes, Declaration* psparam)
{
MATCH matchArgNoMatch()
{
if (psparam)
*psparam = null;
return MATCH.nomatch;
}
MATCH matchArgParameter()
{
RootObject oarg;
if (i < tiargs.dim)
oarg = (*tiargs)[i];
else
{
// Get default argument instead
oarg = tp.defaultArg(instLoc, sc);
if (!oarg)
{
assert(i < dedtypes.dim);
// It might have already been deduced
oarg = (*dedtypes)[i];
if (!oarg)
return matchArgNoMatch();
}
}
return tp.matchArg(sc, oarg, i, parameters, dedtypes, psparam);
}
MATCH matchArgTuple(TemplateTupleParameter ttp)
{
/* The rest of the actual arguments (tiargs[]) form the match
* for the variadic parameter.
*/
assert(i + 1 == dedtypes.dim); // must be the last one
Tuple ovar;
if (Tuple u = isTuple((*dedtypes)[i]))
{
// It has already been deduced
ovar = u;
}
else if (i + 1 == tiargs.dim && isTuple((*tiargs)[i]))
ovar = isTuple((*tiargs)[i]);
else
{
ovar = new Tuple();
//printf("ovar = %p\n", ovar);
if (i < tiargs.dim)
{
//printf("i = %d, tiargs.dim = %d\n", i, tiargs.dim);
ovar.objects.setDim(tiargs.dim - i);
foreach (j, ref obj; ovar.objects)
obj = (*tiargs)[i + j];
}
}
return ttp.matchArg(sc, ovar, i, parameters, dedtypes, psparam);
}
if (auto ttp = tp.isTemplateTupleParameter())
return matchArgTuple(ttp);
else
return matchArgParameter();
}
MATCH matchArg(TemplateParameter tp, Scope* sc, RootObject oarg, size_t i, TemplateParameters* parameters, Objects* dedtypes, Declaration* psparam)
{
MATCH matchArgNoMatch()
{
//printf("\tm = %d\n", MATCH.nomatch);
if (psparam)
*psparam = null;
return MATCH.nomatch;
}
MATCH matchArgType(TemplateTypeParameter ttp)
{
//printf("TemplateTypeParameter.matchArg('%s')\n", ttp.ident.toChars());
MATCH m = MATCH.exact;
Type ta = isType(oarg);
if (!ta)
{
//printf("%s %p %p %p\n", oarg.toChars(), isExpression(oarg), isDsymbol(oarg), isTuple(oarg));
return matchArgNoMatch();
}
//printf("ta is %s\n", ta.toChars());
if (ttp.specType)
{
if (!ta || ta == TemplateTypeParameter.tdummy)
return matchArgNoMatch();
//printf("\tcalling deduceType(): ta is %s, specType is %s\n", ta.toChars(), ttp.specType.toChars());
MATCH m2 = deduceType(ta, sc, ttp.specType, parameters, dedtypes);
if (m2 == MATCH.nomatch)
{
//printf("\tfailed deduceType\n");
return matchArgNoMatch();
}
if (m2 < m)
m = m2;
if ((*dedtypes)[i])
{
Type t = cast(Type)(*dedtypes)[i];
if (ttp.dependent && !t.equals(ta)) // https://issues.dlang.org/show_bug.cgi?id=14357
return matchArgNoMatch();
/* This is a self-dependent parameter. For example:
* template X(T : T*) {}
* template X(T : S!T, alias S) {}
*/
//printf("t = %s ta = %s\n", t.toChars(), ta.toChars());
ta = t;
}
}
else
{
if ((*dedtypes)[i])
{
// Must match already deduced type
Type t = cast(Type)(*dedtypes)[i];
if (!t.equals(ta))
{
//printf("t = %s ta = %s\n", t.toChars(), ta.toChars());
return matchArgNoMatch();
}
}
else
{
// So that matches with specializations are better
m = MATCH.convert;
}
}
(*dedtypes)[i] = ta;
if (psparam)
*psparam = new AliasDeclaration(ttp.loc, ttp.ident, ta);
//printf("\tm = %d\n", m);
return ttp.dependent ? MATCH.exact : m;
}
MATCH matchArgValue(TemplateValueParameter tvp)
{
//printf("TemplateValueParameter.matchArg('%s')\n", tvp.ident.toChars());
MATCH m = MATCH.exact;
Expression ei = isExpression(oarg);
Type vt;
if (!ei && oarg)
{
Dsymbol si = isDsymbol(oarg);
FuncDeclaration f = si ? si.isFuncDeclaration() : null;
if (!f || !f.fbody || f.needThis())
return matchArgNoMatch();
ei = new VarExp(tvp.loc, f);
ei = ei.expressionSemantic(sc);
/* If a function is really property-like, and then
* it's CTFEable, ei will be a literal expression.
*/
uint olderrors = global.startGagging();
ei = resolveProperties(sc, ei);
ei = ei.ctfeInterpret();
if (global.endGagging(olderrors) || ei.op == EXP.error)
return matchArgNoMatch();
/* https://issues.dlang.org/show_bug.cgi?id=14520
* A property-like function can match to both
* TemplateAlias and ValueParameter. But for template overloads,
* it should always prefer alias parameter to be consistent
* template match result.
*
* template X(alias f) { enum X = 1; }
* template X(int val) { enum X = 2; }
* int f1() { return 0; } // CTFEable
* int f2(); // body-less function is not CTFEable
* enum x1 = X!f1; // should be 1
* enum x2 = X!f2; // should be 1
*
* e.g. The x1 value must be same even if the f1 definition will be moved
* into di while stripping body code.
*/
m = MATCH.convert;
}
if (ei && ei.op == EXP.variable)
{
// Resolve const variables that we had skipped earlier
ei = ei.ctfeInterpret();
}
//printf("\tvalType: %s, ty = %d\n", tvp.valType.toChars(), tvp.valType.ty);
vt = tvp.valType.typeSemantic(tvp.loc, sc);
//printf("ei: %s, ei.type: %s\n", ei.toChars(), ei.type.toChars());
//printf("vt = %s\n", vt.toChars());
if (ei.type)
{
MATCH m2 = ei.implicitConvTo(vt);
//printf("m: %d\n", m);
if (m2 < m)
m = m2;
if (m == MATCH.nomatch)
return matchArgNoMatch();
ei = ei.implicitCastTo(sc, vt);
ei = ei.ctfeInterpret();
}
if (tvp.specValue)
{
if (ei is null || (cast(void*)ei.type in TemplateValueParameter.edummies &&
TemplateValueParameter.edummies[cast(void*)ei.type] == ei))
return matchArgNoMatch();
Expression e = tvp.specValue;
sc = sc.startCTFE();
e = e.expressionSemantic(sc);
e = resolveProperties(sc, e);
sc = sc.endCTFE();
e = e.implicitCastTo(sc, vt);
e = e.ctfeInterpret();
ei = ei.syntaxCopy();
sc = sc.startCTFE();
ei = ei.expressionSemantic(sc);
sc = sc.endCTFE();
ei = ei.implicitCastTo(sc, vt);
ei = ei.ctfeInterpret();
//printf("\tei: %s, %s\n", ei.toChars(), ei.type.toChars());
//printf("\te : %s, %s\n", e.toChars(), e.type.toChars());
if (!ei.equals(e))
return matchArgNoMatch();
}
else
{
if ((*dedtypes)[i])
{
// Must match already deduced value
Expression e = cast(Expression)(*dedtypes)[i];
if (!ei || !ei.equals(e))
return matchArgNoMatch();
}
}
(*dedtypes)[i] = ei;
if (psparam)
{
Initializer _init = new ExpInitializer(tvp.loc, ei);
Declaration sparam = new VarDeclaration(tvp.loc, vt, tvp.ident, _init);
sparam.storage_class = STC.manifest;
*psparam = sparam;
}
return tvp.dependent ? MATCH.exact : m;
}
MATCH matchArgAlias(TemplateAliasParameter tap)
{
//printf("TemplateAliasParameter.matchArg('%s')\n", tap.ident.toChars());
MATCH m = MATCH.exact;
Type ta = isType(oarg);
RootObject sa = ta && !ta.deco ? null : getDsymbol(oarg);
Expression ea = isExpression(oarg);
if (ea && (ea.op == EXP.this_ || ea.op == EXP.super_))
sa = (cast(ThisExp)ea).var;
else if (ea && ea.op == EXP.scope_)
sa = (cast(ScopeExp)ea).sds;
if (sa)
{
if ((cast(Dsymbol)sa).isAggregateDeclaration())
m = MATCH.convert;
/* specType means the alias must be a declaration with a type
* that matches specType.
*/
if (tap.specType)
{
Declaration d = (cast(Dsymbol)sa).isDeclaration();
if (!d)
return matchArgNoMatch();
if (!d.type.equals(tap.specType))
return matchArgNoMatch();
}
}
else
{
sa = oarg;
if (ea)
{
if (tap.specType)
{
if (!ea.type.equals(tap.specType))
return matchArgNoMatch();
}
}
else if (ta && ta.ty == Tinstance && !tap.specAlias)
{
/* Specialized parameter should be preferred
* match to the template type parameter.
* template X(alias a) {} // a == this
* template X(alias a : B!A, alias B, A...) {} // B!A => ta
*/
}
else if (sa && sa == TemplateTypeParameter.tdummy)
{
/* https://issues.dlang.org/show_bug.cgi?id=2025
* Aggregate Types should preferentially
* match to the template type parameter.
* template X(alias a) {} // a == this
* template X(T) {} // T => sa
*/
}
else if (ta && ta.ty != Tident)
{
/* Match any type that's not a TypeIdentifier to alias parameters,
* but prefer type parameter.
* template X(alias a) { } // a == ta
*
* TypeIdentifiers are excluded because they might be not yet resolved aliases.
*/
m = MATCH.convert;
}
else
return matchArgNoMatch();
}
if (tap.specAlias)
{
if (sa == TemplateAliasParameter.sdummy)
return matchArgNoMatch();
// check specialization if template arg is a symbol
Dsymbol sx = isDsymbol(sa);
if (sa != tap.specAlias && sx)
{
Type talias = isType(tap.specAlias);
if (!talias)
return matchArgNoMatch();
TemplateInstance ti = sx.isTemplateInstance();
if (!ti && sx.parent)
{
ti = sx.parent.isTemplateInstance();
if (ti && ti.name != sx.ident)
return matchArgNoMatch();
}
if (!ti)
return matchArgNoMatch();
Type t = new TypeInstance(Loc.initial, ti);
MATCH m2 = deduceType(t, sc, talias, parameters, dedtypes);
if (m2 == MATCH.nomatch)
return matchArgNoMatch();
}
// check specialization if template arg is a type
else if (ta)
{
if (Type tspec = isType(tap.specAlias))
{
MATCH m2 = ta.implicitConvTo(tspec);
if (m2 == MATCH.nomatch)
return matchArgNoMatch();
}
else
{
error(tap.loc, "template parameter specialization for a type must be a type and not `%s`",
tap.specAlias.toChars());
return matchArgNoMatch();
}
}
}
else if ((*dedtypes)[i])
{
// Must match already deduced symbol
RootObject si = (*dedtypes)[i];
if (!sa || si != sa)
return matchArgNoMatch();
}
(*dedtypes)[i] = sa;
if (psparam)
{
if (Dsymbol s = isDsymbol(sa))
{
*psparam = new AliasDeclaration(tap.loc, tap.ident, s);
}
else if (Type t = isType(sa))
{
*psparam = new AliasDeclaration(tap.loc, tap.ident, t);
}
else
{
assert(ea);
// Declare manifest constant
Initializer _init = new ExpInitializer(tap.loc, ea);
auto v = new VarDeclaration(tap.loc, null, tap.ident, _init);
v.storage_class = STC.manifest;
v.dsymbolSemantic(sc);
*psparam = v;
}
}
return tap.dependent ? MATCH.exact : m;
}
MATCH matchArgTuple(TemplateTupleParameter ttp)
{
//printf("TemplateTupleParameter.matchArg('%s')\n", ttp.ident.toChars());
Tuple ovar = isTuple(oarg);
if (!ovar)
return MATCH.nomatch;
if ((*dedtypes)[i])
{
Tuple tup = isTuple((*dedtypes)[i]);
if (!tup)
return MATCH.nomatch;
if (!match(tup, ovar))
return MATCH.nomatch;
}
(*dedtypes)[i] = ovar;
if (psparam)
*psparam = new TupleDeclaration(ttp.loc, ttp.ident, &ovar.objects);
return ttp.dependent ? MATCH.exact : MATCH.convert;
}
if (auto ttp = tp.isTemplateTypeParameter())
return matchArgType(ttp);
else if (auto tvp = tp.isTemplateValueParameter())
return matchArgValue(tvp);
else if (auto tap = tp.isTemplateAliasParameter())
return matchArgAlias(tap);
else if (auto ttp = tp.isTemplateTupleParameter())
return matchArgTuple(ttp);
else
assert(0);
}
/***********************************************
* Collect and print statistics on template instantiations.
*/
struct TemplateStats
{
__gshared TemplateStats[const void*] stats;
uint numInstantiations; // number of instantiations of the template
uint uniqueInstantiations; // number of unique instantiations of the template
TemplateInstances* allInstances;
/*******************************
* Add this instance
*/
static void incInstance(const TemplateDeclaration td,
const TemplateInstance ti)
{
void log(ref TemplateStats ts)
{
if (ts.allInstances is null)
ts.allInstances = new TemplateInstances();
if (global.params.vtemplatesListInstances)
ts.allInstances.push(cast() ti);
}
// message(ti.loc, "incInstance %p %p", td, ti);
if (!global.params.vtemplates)
return;
if (!td)
return;
assert(ti);
if (auto ts = cast(const void*) td in stats)
{
log(*ts);
++ts.numInstantiations;
}
else
{
stats[cast(const void*) td] = TemplateStats(1, 0);
log(stats[cast(const void*) td]);
}
}
/*******************************
* Add this unique instance
*/
static void incUnique(const TemplateDeclaration td,
const TemplateInstance ti)
{
// message(ti.loc, "incUnique %p %p", td, ti);
if (!global.params.vtemplates)
return;
if (!td)
return;
assert(ti);
if (auto ts = cast(const void*) td in stats)
++ts.uniqueInstantiations;
else
stats[cast(const void*) td] = TemplateStats(0, 1);
}
}
extern (C++) void printTemplateStats()
{
static struct TemplateDeclarationStats
{
TemplateDeclaration td;
TemplateStats ts;
static int compare(scope const TemplateDeclarationStats* a,
scope const TemplateDeclarationStats* b) @safe nothrow @nogc pure
{
auto diff = b.ts.uniqueInstantiations - a.ts.uniqueInstantiations;
if (diff)
return diff;
else
return b.ts.numInstantiations - a.ts.numInstantiations;
}
}
if (!global.params.vtemplates)
return;
Array!(TemplateDeclarationStats) sortedStats;
sortedStats.reserve(TemplateStats.stats.length);
foreach (td_, ref ts; TemplateStats.stats)
{
sortedStats.push(TemplateDeclarationStats(cast(TemplateDeclaration) td_, ts));
}
sortedStats.sort!(TemplateDeclarationStats.compare);
foreach (const ref ss; sortedStats[])
{
if (global.params.vtemplatesListInstances &&
ss.ts.allInstances)
{
message(ss.td.loc,
"vtemplate: %u (%u distinct) instantiation(s) of template `%s` found, they are:",
ss.ts.numInstantiations,
ss.ts.uniqueInstantiations,
ss.td.toCharsNoConstraints());
foreach (const ti; (*ss.ts.allInstances)[])
{
if (ti.tinst) // if has enclosing instance
message(ti.loc, "vtemplate: implicit instance `%s`", ti.toChars());
else
message(ti.loc, "vtemplate: explicit instance `%s`", ti.toChars());
}
}
else
{
message(ss.td.loc,
"vtemplate: %u (%u distinct) instantiation(s) of template `%s` found",
ss.ts.numInstantiations,
ss.ts.uniqueInstantiations,
ss.td.toCharsNoConstraints());
}
}
}
/// Pair of MATCHes
private struct MATCHpair
{
MATCH mta; /// match template parameters by initial template arguments
MATCH mfa; /// match template parameters by inferred template arguments
debug this(MATCH mta, MATCH mfa)
{
assert(MATCH.min <= mta && mta <= MATCH.max);
assert(MATCH.min <= mfa && mfa <= MATCH.max);
this.mta = mta;
this.mfa = mfa;
}
}
private void write(ref OutBuffer buf, RootObject obj)
{
if (obj)
{
buf.writestring(obj.toChars());
}
}
|