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
|
/* Processing rules for constraints.
Copyright (C) 2013-2017 Free Software Foundation, Inc.
Contributed by Andrew Sutton (andrew.n.sutton@gmail.com)
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
GCC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "timevar.h"
#include "hash-set.h"
#include "machmode.h"
#include "vec.h"
#include "double-int.h"
#include "input.h"
#include "alias.h"
#include "symtab.h"
#include "wide-int.h"
#include "inchash.h"
#include "tree.h"
#include "stringpool.h"
#include "attribs.h"
#include "intl.h"
#include "flags.h"
#include "cp-tree.h"
#include "c-family/c-common.h"
#include "c-family/c-objc.h"
#include "cp-objcp-common.h"
#include "tree-inline.h"
#include "decl.h"
#include "toplev.h"
#include "type-utils.h"
/*---------------------------------------------------------------------------
Operations on constraints
---------------------------------------------------------------------------*/
/* Returns true if C is a constraint tree code. Note that ERROR_MARK
is a valid constraint. */
static inline bool
constraint_p (tree_code c)
{
return ((PRED_CONSTR <= c && c <= DISJ_CONSTR)
|| c == EXPR_PACK_EXPANSION
|| c == ERROR_MARK);
}
/* Returns true if T is a constraint. Note that error_mark_node
is a valid constraint. */
bool
constraint_p (tree t)
{
return constraint_p (TREE_CODE (t));
}
/* Returns the conjunction of two constraints A and B. Note that
conjoining a non-null constraint with NULL_TREE is an identity
operation. That is, for non-null A,
conjoin_constraints(a, NULL_TREE) == a
and
conjoin_constraints (NULL_TREE, a) == a
If both A and B are NULL_TREE, the result is also NULL_TREE. */
tree
conjoin_constraints (tree a, tree b)
{
gcc_assert (a ? constraint_p (a) : true);
gcc_assert (b ? constraint_p (b) : true);
if (a)
return b ? build_nt (CONJ_CONSTR, a, b) : a;
else if (b)
return b;
else
return NULL_TREE;
}
/* Transform the vector of expressions in the T into a conjunction
of requirements. T must be a TREE_VEC. */
tree
conjoin_constraints (tree t)
{
gcc_assert (TREE_CODE (t) == TREE_VEC);
tree r = NULL_TREE;
for (int i = 0; i < TREE_VEC_LENGTH (t); ++i)
r = conjoin_constraints (r, TREE_VEC_ELT (t, i));
return r;
}
/* Returns true if T is a call expression to a function
concept. */
bool
function_concept_check_p (tree t)
{
gcc_assert (TREE_CODE (t) == CALL_EXPR);
tree fn = CALL_EXPR_FN (t);
if (fn != NULL_TREE
&& TREE_CODE (fn) == TEMPLATE_ID_EXPR)
{
tree f1 = OVL_FIRST (TREE_OPERAND (fn, 0));
if (TREE_CODE (f1) == TEMPLATE_DECL
&& DECL_DECLARED_CONCEPT_P (DECL_TEMPLATE_RESULT (f1)))
return true;
}
return false;
}
/* Returns true if any of the arguments in the template
argument list is a wildcard or wildcard pack. */
bool
contains_wildcard_p (tree args)
{
for (int i = 0; i < TREE_VEC_LENGTH (args); ++i)
{
tree arg = TREE_VEC_ELT (args, i);
if (TREE_CODE (arg) == WILDCARD_DECL)
return true;
}
return false;
}
/* Build a new call expression, but don't actually generate a
new function call. We just want the tree, not the semantics. */
inline tree
build_call_check (tree id)
{
++processing_template_decl;
vec<tree, va_gc> *fargs = make_tree_vector();
tree call = finish_call_expr (id, &fargs, false, false, tf_none);
release_tree_vector (fargs);
--processing_template_decl;
return call;
}
/* Build an expression that will check a variable concept. If any
argument contains a wildcard, don't try to finish the variable
template because we can't substitute into a non-existent
declaration. */
tree
build_variable_check (tree id)
{
gcc_assert (TREE_CODE (id) == TEMPLATE_ID_EXPR);
if (contains_wildcard_p (TREE_OPERAND (id, 1)))
return id;
++processing_template_decl;
tree var = finish_template_variable (id);
--processing_template_decl;
return var;
}
/*---------------------------------------------------------------------------
Resolution of qualified concept names
---------------------------------------------------------------------------*/
/* This facility is used to resolve constraint checks from
requirement expressions. A constraint check is a call to
a function template declared with the keyword 'concept'.
The result of resolution is a pair (a TREE_LIST) whose value
is the matched declaration, and whose purpose contains the
coerced template arguments that can be substituted into the
call. */
// Given an overload set OVL, try to find a unique definition that can be
// instantiated by the template arguments ARGS.
//
// This function is not called for arbitrary call expressions. In particular,
// the call expression must be written with explicit template arguments
// and no function arguments. For example:
//
// f<T, U>()
//
// If a single match is found, this returns a TREE_LIST whose VALUE
// is the constraint function (not the template), and its PURPOSE is
// the complete set of arguments substituted into the parameter list.
static tree
resolve_constraint_check (tree ovl, tree args)
{
int nerrs = 0;
tree cands = NULL_TREE;
for (lkp_iterator iter (ovl); iter; ++iter)
{
// Get the next template overload.
tree tmpl = *iter;
if (TREE_CODE (tmpl) != TEMPLATE_DECL)
continue;
// Don't try to deduce checks for non-concepts. We often
// end up trying to resolve constraints in functional casts
// as part of a postfix-expression. We can save time and
// headaches by not instantiating those declarations.
//
// NOTE: This masks a potential error, caused by instantiating
// non-deduced contexts using placeholder arguments.
tree fn = DECL_TEMPLATE_RESULT (tmpl);
if (DECL_ARGUMENTS (fn))
continue;
if (!DECL_DECLARED_CONCEPT_P (fn))
continue;
// Remember the candidate if we can deduce a substitution.
++processing_template_decl;
tree parms = TREE_VALUE (DECL_TEMPLATE_PARMS (tmpl));
if (tree subst = coerce_template_parms (parms, args, tmpl))
{
if (subst == error_mark_node)
++nerrs;
else
cands = tree_cons (subst, fn, cands);
}
--processing_template_decl;
}
if (!cands)
/* We either had no candidates or failed deductions. */
return nerrs ? error_mark_node : NULL_TREE;
else if (TREE_CHAIN (cands))
/* There are multiple candidates. */
return error_mark_node;
return cands;
}
// Determine if the the call expression CALL is a constraint check, and
// return the concept declaration and arguments being checked. If CALL
// does not denote a constraint check, return NULL.
tree
resolve_constraint_check (tree call)
{
gcc_assert (TREE_CODE (call) == CALL_EXPR);
// A constraint check must be only a template-id expression. If
// it's a call to a base-link, its function(s) should be a
// template-id expression. If this is not a template-id, then it
// cannot be a concept-check.
tree target = CALL_EXPR_FN (call);
if (BASELINK_P (target))
target = BASELINK_FUNCTIONS (target);
if (TREE_CODE (target) != TEMPLATE_ID_EXPR)
return NULL_TREE;
// Get the overload set and template arguments and try to
// resolve the target.
tree ovl = TREE_OPERAND (target, 0);
/* This is a function call of a variable concept... ill-formed. */
if (TREE_CODE (ovl) == TEMPLATE_DECL)
{
error_at (location_of (call),
"function call of variable concept %qE", call);
return error_mark_node;
}
tree args = TREE_OPERAND (target, 1);
return resolve_constraint_check (ovl, args);
}
/* Returns a pair containing the checked variable concept
and its associated prototype parameter. The result
is a TREE_LIST whose TREE_VALUE is the variable concept
and whose TREE_PURPOSE is the prototype parameter. */
tree
resolve_variable_concept_check (tree id)
{
tree tmpl = TREE_OPERAND (id, 0);
tree args = TREE_OPERAND (id, 1);
if (!variable_concept_p (tmpl))
return NULL_TREE;
/* Make sure that we have the right parameters before
assuming that it works. Note that failing to deduce
will result in diagnostics. */
tree parms = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl));
++processing_template_decl;
tree result = coerce_template_parms (parms, args, tmpl);
--processing_template_decl;
if (result != error_mark_node)
{
tree decl = DECL_TEMPLATE_RESULT (tmpl);
return build_tree_list (result, decl);
}
else
return error_mark_node;
}
/* Given a call expression or template-id expression to
a concept EXPR possibly including a wildcard, deduce
the concept being checked and the prototype parameter.
Returns true if the constraint and prototype can be
deduced and false otherwise. Note that the CHECK and
PROTO arguments are set to NULL_TREE if this returns
false. */
bool
deduce_constrained_parameter (tree expr, tree& check, tree& proto)
{
tree info = NULL_TREE;
if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
info = resolve_variable_concept_check (expr);
else if (TREE_CODE (expr) == CALL_EXPR)
info = resolve_constraint_check (expr);
else
gcc_unreachable ();
if (info && info != error_mark_node)
{
check = TREE_VALUE (info);
tree arg = TREE_VEC_ELT (TREE_PURPOSE (info), 0);
if (ARGUMENT_PACK_P (arg))
arg = TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg), 0);
proto = TREE_TYPE (arg);
return true;
}
check = proto = NULL_TREE;
return false;
}
// Given a call expression or template-id expression to a concept, EXPR,
// deduce the concept being checked and return the template arguments.
// Returns NULL_TREE if deduction fails.
static tree
deduce_concept_introduction (tree expr)
{
tree info = NULL_TREE;
if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
info = resolve_variable_concept_check (expr);
else if (TREE_CODE (expr) == CALL_EXPR)
info = resolve_constraint_check (expr);
else
gcc_unreachable ();
if (info && info != error_mark_node)
return TREE_PURPOSE (info);
return NULL_TREE;
}
namespace {
/*---------------------------------------------------------------------------
Constraint implication learning
---------------------------------------------------------------------------*/
/* The implication context determines how we memoize concept checks.
Given two checks C1 and C2, the direction of implication depends
on whether we are learning implications of a conjunction or disjunction.
For example:
template<typename T> concept bool C = ...;
template<typenaem T> concept bool D = C<T> && true;
From this, we can learn that D<T> implies C<T>. We cannot learn,
without further testing, that C<T> does not imply D<T>. If, for
example, C<T> were defined as true, then these constraints would
be logically equivalent.
In rare cases, we may start with a logical equivalence. For example:
template<typename T> concept bool C = ...;
template<typename T> concept bool D = C<T>;
Here, we learn that C<T> implies D<T> and vice versa. */
enum implication_context
{
conjunction_cxt, /* C1 implies C2. */
disjunction_cxt, /* C2 implies C1. */
equivalence_cxt /* C1 implies C2, C2 implies C1. */
};
void learn_implications(tree, tree, implication_context);
void
learn_implication (tree parent, tree child, implication_context cxt)
{
switch (cxt)
{
case conjunction_cxt:
save_subsumption_result (parent, child, true);
break;
case disjunction_cxt:
save_subsumption_result (child, parent, true);
break;
case equivalence_cxt:
save_subsumption_result (parent, child, true);
save_subsumption_result (child, parent, true);
break;
}
}
void
learn_logical_operation (tree parent, tree constr, implication_context cxt)
{
learn_implications (parent, TREE_OPERAND (constr, 0), cxt);
learn_implications (parent, TREE_OPERAND (constr, 1), cxt);
}
void
learn_implications (tree parent, tree constr, implication_context cxt)
{
switch (TREE_CODE (constr))
{
case CHECK_CONSTR:
return learn_implication (parent, constr, cxt);
case CONJ_CONSTR:
if (cxt == disjunction_cxt)
return;
return learn_logical_operation (parent, constr, cxt);
case DISJ_CONSTR:
if (cxt == conjunction_cxt)
return;
return learn_logical_operation (parent, constr, cxt);
default:
break;
}
}
/* Quickly scan the top-level constraints of CONSTR to learn and
cache logical relations between concepts. The search does not
include conjunctions of disjunctions or vice versa. */
void
learn_implications (tree tmpl, tree args, tree constr)
{
/* Don't memoize relations between non-dependent arguemnts. It's not
helpful. */
if (!uses_template_parms (args))
return;
/* Build a check constraint for the purpose of caching. */
tree parent = build_nt (CHECK_CONSTR, tmpl, args);
/* Start learning based on the kind of the top-level contraint. */
if (TREE_CODE (constr) == CONJ_CONSTR)
return learn_logical_operation (parent, constr, conjunction_cxt);
else if (TREE_CODE (constr) == DISJ_CONSTR)
return learn_logical_operation (parent, constr, disjunction_cxt);
else if (TREE_CODE (constr) == CHECK_CONSTR)
/* This is the rare concept alias case. */
return learn_implication (parent, constr, equivalence_cxt);
}
/*---------------------------------------------------------------------------
Expansion of concept definitions
---------------------------------------------------------------------------*/
/* Returns the expression of a function concept. */
tree
get_returned_expression (tree fn)
{
/* Extract the body of the function minus the return expression. */
tree body = DECL_SAVED_TREE (fn);
if (!body)
return error_mark_node;
if (TREE_CODE (body) == BIND_EXPR)
body = BIND_EXPR_BODY (body);
if (TREE_CODE (body) != RETURN_EXPR)
return error_mark_node;
return TREE_OPERAND (body, 0);
}
/* Returns the initializer of a variable concept. */
tree
get_variable_initializer (tree var)
{
tree init = DECL_INITIAL (var);
if (!init)
return error_mark_node;
return init;
}
/* Returns the definition of a variable or function concept. */
tree
get_concept_definition (tree decl)
{
if (VAR_P (decl))
return get_variable_initializer (decl);
else if (TREE_CODE (decl) == FUNCTION_DECL)
return get_returned_expression (decl);
gcc_unreachable ();
}
int expansion_level = 0;
struct expanding_concept_sentinel
{
expanding_concept_sentinel ()
{
++expansion_level;
}
~expanding_concept_sentinel()
{
--expansion_level;
}
};
} /* namespace */
/* Returns true when a concept is being expanded. */
bool
expanding_concept()
{
return expansion_level > 0;
}
/* Expand a concept declaration (not a template) and its arguments to
a constraint defined by the concept's initializer or definition. */
tree
expand_concept (tree decl, tree args)
{
expanding_concept_sentinel sentinel;
if (TREE_CODE (decl) == TEMPLATE_DECL)
decl = DECL_TEMPLATE_RESULT (decl);
tree tmpl = DECL_TI_TEMPLATE (decl);
/* Check for a previous specialization. */
if (tree spec = get_concept_expansion (tmpl, args))
return spec;
/* Substitute the arguments to form a new definition expression. */
tree def = get_concept_definition (decl);
++processing_template_decl;
tree result = tsubst_expr (def, args, tf_none, NULL_TREE, true);
--processing_template_decl;
if (result == error_mark_node)
return error_mark_node;
/* And lastly, normalize it, check for implications, and save
the specialization for later. */
tree norm = normalize_expression (result);
learn_implications (tmpl, args, norm);
return save_concept_expansion (tmpl, args, norm);
}
/*---------------------------------------------------------------------------
Stepwise normalization of expressions
This set of functions will transform an expression into a constraint
in a sequence of steps. Normalization does not not look into concept
definitions.
---------------------------------------------------------------------------*/
/* Transform a logical-or or logical-and expression into either
a conjunction or disjunction. */
tree
normalize_logical_operation (tree t, tree_code c)
{
tree t0 = normalize_expression (TREE_OPERAND (t, 0));
tree t1 = normalize_expression (TREE_OPERAND (t, 1));
return build_nt (c, t0, t1);
}
/* A simple requirement T introduces an expression constraint
for its expression. */
inline tree
normalize_simple_requirement (tree t)
{
return build_nt (EXPR_CONSTR, TREE_OPERAND (t, 0));
}
/* A type requirement T introduce a type constraint for its type. */
inline tree
normalize_type_requirement (tree t)
{
return build_nt (TYPE_CONSTR, TREE_OPERAND (t, 0));
}
/* A compound requirement T introduces a conjunction of constraints
depending on its form. The conjunction always includes an
expression constraint for the expression of the requirement.
If a trailing return type was specified, the conjunction includes
either an implicit conversion constraint or an argument deduction
constraint. If the noexcept specifier is present, the conjunction
includes an exception constraint. */
tree
normalize_compound_requirement (tree t)
{
tree expr = TREE_OPERAND (t, 0);
tree constr = build_nt (EXPR_CONSTR, TREE_OPERAND (t, 0));
/* If a type is given, append an implicit conversion or
argument deduction constraint. */
if (tree type = TREE_OPERAND (t, 1))
{
tree type_constr;
/* TODO: We should be extracting a list of auto nodes
from type_uses_auto, not a single node */
if (tree placeholder = type_uses_auto (type))
type_constr = build_nt (DEDUCT_CONSTR, expr, type, placeholder);
else
type_constr = build_nt (ICONV_CONSTR, expr, type);
constr = conjoin_constraints (constr, type_constr);
}
/* If noexcept is present, append an exception constraint. */
if (COMPOUND_REQ_NOEXCEPT_P (t))
{
tree except = build_nt (EXCEPT_CONSTR, expr);
constr = conjoin_constraints (constr, except);
}
return constr;
}
/* A nested requirement T introduces a conjunction of constraints
corresponding to its constraint-expression.
If the result of transforming T is error_mark_node, the resulting
constraint is a predicate constraint whose operand is also
error_mark_node. This preserves the constraint structure, but
will guarantee that the constraint is never satisfied. */
inline tree
normalize_nested_requirement (tree t)
{
return normalize_expression (TREE_OPERAND (t, 0));
}
/* Transform a requirement T into one or more constraints. */
tree
normalize_requirement (tree t)
{
switch (TREE_CODE (t))
{
case SIMPLE_REQ:
return normalize_simple_requirement (t);
case TYPE_REQ:
return normalize_type_requirement (t);
case COMPOUND_REQ:
return normalize_compound_requirement (t);
case NESTED_REQ:
return normalize_nested_requirement (t);
default:
gcc_unreachable ();
}
return error_mark_node;
}
/* Transform a sequence of requirements into a conjunction of
constraints. */
tree
normalize_requirements (tree t)
{
tree result = NULL_TREE;
for (; t; t = TREE_CHAIN (t))
{
tree constr = normalize_requirement (TREE_VALUE (t));
result = conjoin_constraints (result, constr);
}
return result;
}
/* The normal form of a requires-expression is a parameterized
constraint having the same parameters and a conjunction of
constraints representing the normal form of requirements. */
tree
normalize_requires_expression (tree t)
{
tree operand = normalize_requirements (TREE_OPERAND (t, 1));
if (tree parms = TREE_OPERAND (t, 0))
return build_nt (PARM_CONSTR, parms, operand);
else
return operand;
}
/* For a template-id referring to a variable concept, returns
a check constraint. Otherwise, returns a predicate constraint. */
tree
normalize_template_id_expression (tree t)
{
if (tree info = resolve_variable_concept_check (t))
{
if (info == error_mark_node)
{
/* We get this when the template arguments don't match
the variable concept. */
error ("invalid reference to concept %qE", t);
return error_mark_node;
}
tree decl = TREE_VALUE (info);
tree args = TREE_PURPOSE (info);
return build_nt (CHECK_CONSTR, decl, args);
}
/* Check that we didn't refer to a function concept like a variable. */
tree fn = OVL_FIRST (TREE_OPERAND (t, 0));
if (TREE_CODE (fn) == TEMPLATE_DECL
&& DECL_DECLARED_CONCEPT_P (DECL_TEMPLATE_RESULT (fn)))
{
error_at (location_of (t),
"invalid reference to function concept %qD", fn);
return error_mark_node;
}
return build_nt (PRED_CONSTR, t);
}
/* For a call expression to a function concept, returns a check
constraint. Otherwise, returns a predicate constraint. */
tree
normalize_call_expression (tree t)
{
/* Try to resolve this function call as a concept. If not, then
it can be returned as a predicate constraint. */
tree check = resolve_constraint_check (t);
if (!check)
return build_nt (PRED_CONSTR, t);
if (check == error_mark_node)
{
/* TODO: Improve diagnostics. We could report why the reference
is invalid. */
error ("invalid reference to concept %qE", t);
return error_mark_node;
}
tree fn = TREE_VALUE (check);
tree args = TREE_PURPOSE (check);
return build_nt (CHECK_CONSTR, fn, args);
}
/* If T is a call to an overloaded && or || operator, diagnose that
as a non-SFINAEable error. Returns true if an error is emitted.
TODO: It would be better to diagnose this at the point of definition,
if possible. Perhaps we should immediately do a first-pass normalization
of a concept definition to catch obvious non-dependent errors like
this. */
bool
check_for_logical_overloads (tree t)
{
if (TREE_CODE (t) != CALL_EXPR)
return false;
tree fn = CALL_EXPR_FN (t);
/* For member calls, try extracting the function from the
component ref. */
if (TREE_CODE (fn) == COMPONENT_REF)
{
fn = TREE_OPERAND (fn, 1);
if (TREE_CODE (fn) == BASELINK)
fn = BASELINK_FUNCTIONS (fn);
}
if (TREE_CODE (fn) != FUNCTION_DECL)
return false;
if (DECL_OVERLOADED_OPERATOR_P (fn))
{
location_t loc = EXPR_LOC_OR_LOC (t, input_location);
error_at (loc, "constraint %qE, uses overloaded operator", t);
return true;
}
return false;
}
/* The normal form of an atom depends on the expression. The normal
form of a function call to a function concept is a check constraint
for that concept. The normal form of a reference to a variable
concept is a check constraint for that concept. Otherwise, the
constraint is a predicate constraint. */
tree
normalize_atom (tree t)
{
/* We can get constraints pushed down through pack expansions, so
just return them. */
if (constraint_p (t))
return t;
tree type = TREE_TYPE (t);
if (!type || type_unknown_p (t) || TREE_CODE (type) == TEMPLATE_TYPE_PARM)
;
else if (!dependent_type_p (type))
{
if (check_for_logical_overloads (t))
return error_mark_node;
type = cv_unqualified (type);
if (!same_type_p (type, boolean_type_node))
{
error ("predicate constraint %q+E does not have type %<bool%>", t);
return error_mark_node;
}
}
if (TREE_CODE (t) == TEMPLATE_ID_EXPR)
return normalize_template_id_expression (t);
if (TREE_CODE (t) == CALL_EXPR)
return normalize_call_expression (t);
return build_nt (PRED_CONSTR, t);
}
/* Push down the pack expansion EXP into the leaves of the constraint PAT. */
tree
push_down_pack_expansion (tree exp, tree pat)
{
switch (TREE_CODE (pat))
{
case CONJ_CONSTR:
case DISJ_CONSTR:
{
pat = copy_node (pat);
TREE_OPERAND (pat, 0)
= push_down_pack_expansion (exp, TREE_OPERAND (pat, 0));
TREE_OPERAND (pat, 1)
= push_down_pack_expansion (exp, TREE_OPERAND (pat, 1));
return pat;
}
default:
{
exp = copy_node (exp);
SET_PACK_EXPANSION_PATTERN (exp, pat);
return exp;
}
}
}
/* Transform a pack expansion into a constraint. First we transform the
pattern of the pack expansion, then we push the pack expansion down into the
leaves of the constraint so that partial ordering will work. */
tree
normalize_pack_expansion (tree t)
{
tree pat = normalize_expression (PACK_EXPANSION_PATTERN (t));
return push_down_pack_expansion (t, pat);
}
/* Transform an expression into a constraint. */
tree
normalize_any_expression (tree t)
{
switch (TREE_CODE (t))
{
case TRUTH_ANDIF_EXPR:
return normalize_logical_operation (t, CONJ_CONSTR);
case TRUTH_ORIF_EXPR:
return normalize_logical_operation (t, DISJ_CONSTR);
case REQUIRES_EXPR:
return normalize_requires_expression (t);
case BIND_EXPR:
return normalize_expression (BIND_EXPR_BODY (t));
case EXPR_PACK_EXPANSION:
return normalize_pack_expansion (t);
default:
/* All other constraints are atomic. */
return normalize_atom (t);
}
}
/* Transform a statement into an expression. */
tree
normalize_any_statement (tree t)
{
switch (TREE_CODE (t))
{
case RETURN_EXPR:
return normalize_expression (TREE_OPERAND (t, 0));
default:
gcc_unreachable ();
}
return error_mark_node;
}
/* Reduction rules for the declaration T. */
tree
normalize_any_declaration (tree t)
{
switch (TREE_CODE (t))
{
case VAR_DECL:
return normalize_atom (t);
default:
gcc_unreachable ();
}
return error_mark_node;
}
/* Returns the normal form of a constraint expression. */
tree
normalize_expression (tree t)
{
if (!t)
return NULL_TREE;
if (t == error_mark_node)
return error_mark_node;
switch (TREE_CODE_CLASS (TREE_CODE (t)))
{
case tcc_unary:
case tcc_binary:
case tcc_expression:
case tcc_vl_exp:
return normalize_any_expression (t);
case tcc_statement:
return normalize_any_statement (t);
case tcc_declaration:
return normalize_any_declaration (t);
case tcc_exceptional:
case tcc_constant:
case tcc_reference:
case tcc_comparison:
/* These are all atomic predicate constraints. */
return normalize_atom (t);
default:
/* Unhandled node kind. */
gcc_unreachable ();
}
return error_mark_node;
}
/*---------------------------------------------------------------------------
Constraint normalization
---------------------------------------------------------------------------*/
tree normalize_constraint (tree);
/* The normal form of the disjunction T0 /\ T1 is the conjunction
of the normal form of T0 and the normal form of T1. */
inline tree
normalize_conjunction (tree t)
{
tree t0 = normalize_constraint (TREE_OPERAND (t, 0));
tree t1 = normalize_constraint (TREE_OPERAND (t, 1));
return build_nt (CONJ_CONSTR, t0, t1);
}
/* The normal form of the disjunction T0 \/ T1 is the disjunction
of the normal form of T0 and the normal form of T1. */
inline tree
normalize_disjunction (tree t)
{
tree t0 = normalize_constraint (TREE_OPERAND (t, 0));
tree t1 = normalize_constraint (TREE_OPERAND (t, 1));
return build_nt (DISJ_CONSTR, t0, t1);
}
/* A predicate constraint is normalized in two stages. First all
references specializations of concepts are replaced by their
substituted definitions. Then, the resulting expression is
transformed into a constraint by transforming && expressions
into conjunctions and || into disjunctions. */
tree
normalize_predicate_constraint (tree t)
{
++processing_template_decl;
tree expr = PRED_CONSTR_EXPR (t);
tree constr = normalize_expression (expr);
--processing_template_decl;
return constr;
}
/* The normal form of a parameterized constraint is the normal
form of its operand. */
tree
normalize_parameterized_constraint (tree t)
{
tree parms = PARM_CONSTR_PARMS (t);
tree operand = normalize_constraint (PARM_CONSTR_OPERAND (t));
return build_nt (PARM_CONSTR, parms, operand);
}
/* Normalize the constraint T by reducing it so that it is
comprised of only conjunctions and disjunctions of atomic
constraints. */
tree
normalize_constraint (tree t)
{
if (!t)
return NULL_TREE;
if (t == error_mark_node)
return t;
switch (TREE_CODE (t))
{
case CONJ_CONSTR:
return normalize_conjunction (t);
case DISJ_CONSTR:
return normalize_disjunction (t);
case PRED_CONSTR:
return normalize_predicate_constraint (t);
case PARM_CONSTR:
return normalize_parameterized_constraint (t);
case EXPR_CONSTR:
case TYPE_CONSTR:
case ICONV_CONSTR:
case DEDUCT_CONSTR:
case EXCEPT_CONSTR:
/* These constraints are defined to be atomic. */
return t;
default:
/* CONSTR was not a constraint. */
gcc_unreachable();
}
return error_mark_node;
}
// -------------------------------------------------------------------------- //
// Constraint Semantic Processing
//
// The following functions are called by the parser and substitution rules
// to create and evaluate constraint-related nodes.
// The constraints associated with the current template parameters.
tree
current_template_constraints (void)
{
if (!current_template_parms)
return NULL_TREE;
tree tmpl_constr = TEMPLATE_PARM_CONSTRAINTS (current_template_parms);
return build_constraints (tmpl_constr, NULL_TREE);
}
// If the recently parsed TYPE declares or defines a template or template
// specialization, get its corresponding constraints from the current
// template parameters and bind them to TYPE's declaration.
tree
associate_classtype_constraints (tree type)
{
if (!type || type == error_mark_node || TREE_CODE (type) != RECORD_TYPE)
return type;
// An explicit class template specialization has no template
// parameters.
if (!current_template_parms)
return type;
if (CLASSTYPE_IS_TEMPLATE (type) || CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
{
tree decl = TYPE_STUB_DECL (type);
tree ci = current_template_constraints ();
// An implicitly instantiated member template declaration already
// has associated constraints. If it is defined outside of its
// class, then we need match these constraints against those of
// original declaration.
if (tree orig_ci = get_constraints (decl))
{
if (!equivalent_constraints (ci, orig_ci))
{
// FIXME: Improve diagnostics.
error ("%qT does not match any declaration", type);
return error_mark_node;
}
return type;
}
set_constraints (decl, ci);
}
return type;
}
namespace {
// Create an empty constraint info block.
inline tree_constraint_info*
build_constraint_info ()
{
return (tree_constraint_info *)make_node (CONSTRAINT_INFO);
}
} // namespace
/* Build a constraint-info object that contains the associated constraints
of a declaration. This also includes the declaration's template
requirements (TREQS) and any trailing requirements for a function
declarator (DREQS). Note that both TREQS and DREQS must be constraints.
If the declaration has neither template nor declaration requirements
this returns NULL_TREE, indicating an unconstrained declaration. */
tree
build_constraints (tree tmpl_reqs, tree decl_reqs)
{
gcc_assert (tmpl_reqs ? constraint_p (tmpl_reqs) : true);
gcc_assert (decl_reqs ? constraint_p (decl_reqs) : true);
if (!tmpl_reqs && !decl_reqs)
return NULL_TREE;
tree_constraint_info* ci = build_constraint_info ();
ci->template_reqs = tmpl_reqs;
ci->declarator_reqs = decl_reqs;
ci->associated_constr = conjoin_constraints (tmpl_reqs, decl_reqs);
return (tree)ci;
}
namespace {
/* Construct a sequence of template arguments by prepending
ARG to REST. Either ARG or REST may be null. */
tree
build_concept_check_arguments (tree arg, tree rest)
{
gcc_assert (rest ? TREE_CODE (rest) == TREE_VEC : true);
tree args;
if (arg)
{
int n = rest ? TREE_VEC_LENGTH (rest) : 0;
args = make_tree_vec (n + 1);
TREE_VEC_ELT (args, 0) = arg;
if (rest)
for (int i = 0; i < n; ++i)
TREE_VEC_ELT (args, i + 1) = TREE_VEC_ELT (rest, i);
int def = rest ? GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (rest) : 0;
SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args, def + 1);
}
else
{
gcc_assert (rest != NULL_TREE);
args = rest;
}
return args;
}
} // namespace
/* Construct an expression that checks the concept given by
TARGET. The TARGET must be:
- an OVERLOAD referring to one or more function concepts
- a BASELINK referring to an overload set of the above, or
- a TEMPLTATE_DECL referring to a variable concept.
ARG and REST are the explicit template arguments for the
eventual concept check. */
tree
build_concept_check (tree target, tree arg, tree rest)
{
tree args = build_concept_check_arguments (arg, rest);
if (variable_template_p (target))
return build_variable_check (lookup_template_variable (target, args));
else
return build_call_check (lookup_template_function (target, args));
}
/* Returns a TYPE_DECL that contains sufficient information to
build a template parameter of the same kind as PROTO and
constrained by the concept declaration CNC. Note that PROTO
is the first template parameter of CNC.
If specified, ARGS provides additional arguments to the
constraint check. */
tree
build_constrained_parameter (tree cnc, tree proto, tree args)
{
tree name = DECL_NAME (cnc);
tree type = TREE_TYPE (proto);
tree decl = build_decl (input_location, TYPE_DECL, name, type);
CONSTRAINED_PARM_PROTOTYPE (decl) = proto;
CONSTRAINED_PARM_CONCEPT (decl) = cnc;
CONSTRAINED_PARM_EXTRA_ARGS (decl) = args;
return decl;
}
/* Create a constraint expression for the given DECL that
evaluates the requirements specified by CONSTR, a TYPE_DECL
that contains all the information necessary to build the
requirements (see finish_concept_name for the layout of
that TYPE_DECL).
Note that the constraints are neither reduced nor decomposed.
That is done only after the requires clause has been parsed
(or not).
This will always return a CHECK_CONSTR. */
tree
finish_shorthand_constraint (tree decl, tree constr)
{
/* No requirements means no constraints. */
if (!constr)
return NULL_TREE;
tree proto = CONSTRAINED_PARM_PROTOTYPE (constr);
tree con = CONSTRAINED_PARM_CONCEPT (constr);
tree args = CONSTRAINED_PARM_EXTRA_ARGS (constr);
/* If the parameter declaration is variadic, but the concept
is not then we need to apply the concept to every element
in the pack. */
bool is_proto_pack = template_parameter_pack_p (proto);
bool is_decl_pack = template_parameter_pack_p (decl);
bool apply_to_all_p = is_decl_pack && !is_proto_pack;
/* Get the argument and overload used for the requirement
and adjust it if we're going to expand later. */
tree arg = template_parm_to_arg (build_tree_list (NULL_TREE, decl));
if (apply_to_all_p)
arg = PACK_EXPANSION_PATTERN (TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg), 0));
/* Build the concept check. If it the constraint needs to be
applied to all elements of the parameter pack, then make
the constraint an expansion. */
tree tmpl = DECL_TI_TEMPLATE (con);
tree check = VAR_P (con) ? tmpl : ovl_make (tmpl);
check = build_concept_check (check, arg, args);
/* Make the check a pack expansion if needed.
FIXME: We should be making a fold expression. */
if (apply_to_all_p)
{
check = make_pack_expansion (check);
TREE_TYPE (check) = boolean_type_node;
}
return normalize_expression (check);
}
/* Returns a conjunction of shorthand requirements for the template
parameter list PARMS. Note that the requirements are stored in
the TYPE of each tree node. */
tree
get_shorthand_constraints (tree parms)
{
tree result = NULL_TREE;
parms = INNERMOST_TEMPLATE_PARMS (parms);
for (int i = 0; i < TREE_VEC_LENGTH (parms); ++i)
{
tree parm = TREE_VEC_ELT (parms, i);
tree constr = TEMPLATE_PARM_CONSTRAINTS (parm);
result = conjoin_constraints (result, constr);
}
return result;
}
// Returns and chains a new parameter for PARAMETER_LIST which will conform
// to the prototype given by SRC_PARM. The new parameter will have its
// identifier and location set according to IDENT and PARM_LOC respectively.
static tree
process_introduction_parm (tree parameter_list, tree src_parm)
{
// If we have a pack, we should have a single pack argument which is the
// placeholder we want to look at.
bool is_parameter_pack = ARGUMENT_PACK_P (src_parm);
if (is_parameter_pack)
src_parm = TREE_VEC_ELT (ARGUMENT_PACK_ARGS (src_parm), 0);
// At this point we should have a wildcard, but we want to
// grab the associated decl from it. Also grab the stored
// identifier and location that should be chained to it in
// a PARM_DECL.
gcc_assert (TREE_CODE (src_parm) == WILDCARD_DECL);
tree ident = DECL_NAME (src_parm);
location_t parm_loc = DECL_SOURCE_LOCATION (src_parm);
// If we expect a pack and the deduced template is not a pack, or if the
// template is using a pack and we didn't declare a pack, throw an error.
if (is_parameter_pack != WILDCARD_PACK_P (src_parm))
{
error_at (parm_loc, "cannot match pack for introduced parameter");
tree err_parm = build_tree_list (error_mark_node, error_mark_node);
return chainon (parameter_list, err_parm);
}
src_parm = TREE_TYPE (src_parm);
tree parm;
bool is_non_type;
if (TREE_CODE (src_parm) == TYPE_DECL)
{
is_non_type = false;
parm = finish_template_type_parm (class_type_node, ident);
}
else if (TREE_CODE (src_parm) == TEMPLATE_DECL)
{
is_non_type = false;
begin_template_parm_list ();
current_template_parms = DECL_TEMPLATE_PARMS (src_parm);
end_template_parm_list ();
parm = finish_template_template_parm (class_type_node, ident);
}
else
{
is_non_type = true;
// Since we don't have a declarator, so we can copy the source
// parameter and change the name and eventually the location.
parm = copy_decl (src_parm);
DECL_NAME (parm) = ident;
}
// Wrap in a TREE_LIST for process_template_parm. Introductions do not
// retain the defaults from the source template.
parm = build_tree_list (NULL_TREE, parm);
return process_template_parm (parameter_list, parm_loc, parm,
is_non_type, is_parameter_pack);
}
/* Associates a constraint check to the current template based
on the introduction parameters. INTRO_LIST must be a TREE_VEC
of WILDCARD_DECLs containing a chained PARM_DECL which
contains the identifier as well as the source location.
TMPL_DECL is the decl for the concept being used. If we
take a concept, C, this will form a check in the form of
C<INTRO_LIST> filling in any extra arguments needed by the
defaults deduced.
Returns NULL_TREE if no concept could be matched and
error_mark_node if an error occurred when matching. */
tree
finish_template_introduction (tree tmpl_decl, tree intro_list)
{
/* Deduce the concept check. */
tree expr = build_concept_check (tmpl_decl, NULL_TREE, intro_list);
if (expr == error_mark_node)
return NULL_TREE;
tree parms = deduce_concept_introduction (expr);
if (!parms)
return NULL_TREE;
/* Build template parameter scope for introduction. */
tree parm_list = NULL_TREE;
begin_template_parm_list ();
int nargs = MIN (TREE_VEC_LENGTH (parms), TREE_VEC_LENGTH (intro_list));
for (int n = 0; n < nargs; ++n)
parm_list = process_introduction_parm (parm_list, TREE_VEC_ELT (parms, n));
parm_list = end_template_parm_list (parm_list);
for (int i = 0; i < TREE_VEC_LENGTH (parm_list); ++i)
if (TREE_VALUE (TREE_VEC_ELT (parm_list, i)) == error_mark_node)
{
end_template_decl ();
return error_mark_node;
}
/* Build a concept check for our constraint. */
tree check_args = make_tree_vec (TREE_VEC_LENGTH (parms));
int n = 0;
for (; n < TREE_VEC_LENGTH (parm_list); ++n)
{
tree parm = TREE_VEC_ELT (parm_list, n);
TREE_VEC_ELT (check_args, n) = template_parm_to_arg (parm);
}
SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (check_args, n);
/* If the template expects more parameters we should be able
to use the defaults from our deduced concept. */
for (; n < TREE_VEC_LENGTH (parms); ++n)
TREE_VEC_ELT (check_args, n) = TREE_VEC_ELT (parms, n);
/* Associate the constraint. */
tree check = build_concept_check (tmpl_decl, NULL_TREE, check_args);
tree constr = normalize_expression (check);
TEMPLATE_PARMS_CONSTRAINTS (current_template_parms) = constr;
return parm_list;
}
/* Given the predicate constraint T from a constrained-type-specifier, extract
its TMPL and ARGS. FIXME why do we need two different forms of
constrained-type-specifier? */
void
placeholder_extract_concept_and_args (tree t, tree &tmpl, tree &args)
{
if (TREE_CODE (t) == TYPE_DECL)
{
/* A constrained parameter. Build a constraint check
based on the prototype parameter and then extract the
arguments from that. */
tree proto = CONSTRAINED_PARM_PROTOTYPE (t);
tree check = finish_shorthand_constraint (proto, t);
placeholder_extract_concept_and_args (check, tmpl, args);
return;
}
if (TREE_CODE (t) == CHECK_CONSTR)
{
tree decl = CHECK_CONSTR_CONCEPT (t);
tmpl = DECL_TI_TEMPLATE (decl);
args = CHECK_CONSTR_ARGS (t);
return;
}
gcc_unreachable ();
}
/* Returns true iff the placeholders C1 and C2 are equivalent. C1
and C2 can be either CHECK_CONSTR or TEMPLATE_TYPE_PARM. */
bool
equivalent_placeholder_constraints (tree c1, tree c2)
{
if (c1 && TREE_CODE (c1) == TEMPLATE_TYPE_PARM)
/* A constrained auto. */
c1 = PLACEHOLDER_TYPE_CONSTRAINTS (c1);
if (c2 && TREE_CODE (c2) == TEMPLATE_TYPE_PARM)
c2 = PLACEHOLDER_TYPE_CONSTRAINTS (c2);
if (c1 == c2)
return true;
if (!c1 || !c2)
return false;
if (c1 == error_mark_node || c2 == error_mark_node)
/* We get here during satisfaction; when a deduction constraint
fails, substitution can produce an error_mark_node for the
placeholder constraints. */
return false;
tree t1, t2, a1, a2;
placeholder_extract_concept_and_args (c1, t1, a1);
placeholder_extract_concept_and_args (c2, t2, a2);
if (t1 != t2)
return false;
int len1 = TREE_VEC_LENGTH (a1);
int len2 = TREE_VEC_LENGTH (a2);
if (len1 != len2)
return false;
/* Skip the first argument so we don't infinitely recurse.
Also, they may differ in template parameter index. */
for (int i = 1; i < len1; ++i)
{
tree t1 = TREE_VEC_ELT (a1, i);
tree t2 = TREE_VEC_ELT (a2, i);
if (!template_args_equal (t1, t2))
return false;
}
return true;
}
/* Return a hash value for the placeholder PRED_CONSTR C. */
hashval_t
hash_placeholder_constraint (tree c)
{
tree t, a;
placeholder_extract_concept_and_args (c, t, a);
/* Like hash_tmpl_and_args, but skip the first argument. */
hashval_t val = iterative_hash_object (DECL_UID (t), 0);
for (int i = TREE_VEC_LENGTH (a)-1; i > 0; --i)
val = iterative_hash_template_arg (TREE_VEC_ELT (a, i), val);
return val;
}
/*---------------------------------------------------------------------------
Constraint substitution
---------------------------------------------------------------------------*/
/* The following functions implement substitution rules for constraints.
Substitution without checking constraints happens only in the
instantiation of class templates. For example:
template<C1 T> struct S {
void f(T) requires C2<T>;
void g(T) requires T::value;
};
S<int> s; // error instantiating S<int>::g(T)
When we instantiate S, we substitute into its member declarations,
including their constraints. However, those constraints are not
checked. Substituting int into C2<T> yields C2<int>, and substituting
into T::value yields a substitution failure, making the program
ill-formed.
Note that we only ever substitute into the associated constraints
of a declaration. That is, substitution is defined only for predicate
constraints and conjunctions. */
/* Substitute into the predicate constraints. Returns error_mark_node
if the substitution into the expression fails. */
tree
tsubst_predicate_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
tree expr = PRED_CONSTR_EXPR (t);
++processing_template_decl;
tree result = tsubst_expr (expr, args, complain, in_decl, false);
--processing_template_decl;
return build_nt (PRED_CONSTR, result);
}
/* Substitute into a check constraint. */
tree
tsubst_check_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
tree decl = CHECK_CONSTR_CONCEPT (t);
tree tmpl = DECL_TI_TEMPLATE (decl);
tree targs = CHECK_CONSTR_ARGS (t);
/* Substitute through by building an template-id expression
and then substituting into that. */
tree expr = build_nt (TEMPLATE_ID_EXPR, tmpl, targs);
++processing_template_decl;
tree result = tsubst_expr (expr, args, complain, in_decl, false);
--processing_template_decl;
if (result == error_mark_node)
return error_mark_node;
/* Extract the results and rebuild the check constraint. */
decl = DECL_TEMPLATE_RESULT (TREE_OPERAND (result, 0));
args = TREE_OPERAND (result, 1);
return build_nt (CHECK_CONSTR, decl, args);
}
/* Substitute into the conjunction of constraints. Returns
error_mark_node if substitution into either operand fails. */
tree
tsubst_logical_operator (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
tree t0 = TREE_OPERAND (t, 0);
tree r0 = tsubst_constraint (t0, args, complain, in_decl);
if (r0 == error_mark_node)
return error_mark_node;
tree t1 = TREE_OPERAND (t, 1);
tree r1 = tsubst_constraint (t1, args, complain, in_decl);
if (r1 == error_mark_node)
return error_mark_node;
return build_nt (TREE_CODE (t), r0, r1);
}
namespace {
/* Substitute ARGS into the expression constraint T. */
tree
tsubst_expr_constr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
{
cp_unevaluated guard;
tree expr = EXPR_CONSTR_EXPR (t);
tree ret = tsubst_expr (expr, args, complain, in_decl, false);
if (ret == error_mark_node)
return error_mark_node;
return build_nt (EXPR_CONSTR, ret);
}
/* Substitute ARGS into the type constraint T. */
tree
tsubst_type_constr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
{
tree type = TYPE_CONSTR_TYPE (t);
tree ret = tsubst (type, args, complain, in_decl);
if (ret == error_mark_node)
return error_mark_node;
return build_nt (TYPE_CONSTR, ret);
}
/* Substitute ARGS into the implicit conversion constraint T. */
tree
tsubst_implicit_conversion_constr (tree t, tree args, tsubst_flags_t complain,
tree in_decl)
{
cp_unevaluated guard;
tree expr = ICONV_CONSTR_EXPR (t);
tree type = ICONV_CONSTR_TYPE (t);
tree new_expr = tsubst_expr (expr, args, complain, in_decl, false);
if (new_expr == error_mark_node)
return error_mark_node;
tree new_type = tsubst (type, args, complain, in_decl);
if (new_type == error_mark_node)
return error_mark_node;
return build_nt (ICONV_CONSTR, new_expr, new_type);
}
/* Substitute ARGS into the argument deduction constraint T. */
tree
tsubst_argument_deduction_constr (tree t, tree args, tsubst_flags_t complain,
tree in_decl)
{
cp_unevaluated guard;
tree expr = DEDUCT_CONSTR_EXPR (t);
tree pattern = DEDUCT_CONSTR_PATTERN (t);
tree autos = DEDUCT_CONSTR_PLACEHOLDER(t);
tree new_expr = tsubst_expr (expr, args, complain, in_decl, false);
if (new_expr == error_mark_node)
return error_mark_node;
/* It seems like substituting through the pattern will not affect the
placeholders. We should (?) be able to reuse the existing list
without any problems. If not, then we probably want to create a
new list of placeholders and then instantiate the pattern using
those. */
tree new_pattern = tsubst (pattern, args, complain, in_decl);
if (new_pattern == error_mark_node)
return error_mark_node;
return build_nt (DEDUCT_CONSTR, new_expr, new_pattern, autos);
}
/* Substitute ARGS into the exception constraint T. */
tree
tsubst_exception_constr (tree t, tree args, tsubst_flags_t complain,
tree in_decl)
{
cp_unevaluated guard;
tree expr = EXCEPT_CONSTR_EXPR (t);
tree ret = tsubst_expr (expr, args, complain, in_decl, false);
if (ret == error_mark_node)
return error_mark_node;
return build_nt (EXCEPT_CONSTR, ret);
}
/* A subroutine of tsubst_constraint_variables. Register local
specializations for each of parameter in PARMS and its
corresponding substituted constraint variable in VARS.
Returns VARS. */
tree
declare_constraint_vars (tree parms, tree vars)
{
tree s = vars;
for (tree t = parms; t; t = DECL_CHAIN (t))
{
if (DECL_PACK_P (t))
{
tree pack = extract_fnparm_pack (t, &s);
register_local_specialization (pack, t);
}
else
{
register_local_specialization (s, t);
s = DECL_CHAIN (s);
}
}
return vars;
}
/* A subroutine of tsubst_parameterized_constraint. Substitute ARGS
into the parameter list T, producing a sequence of constraint
variables, declared in the current scope.
Note that the caller must establish a local specialization stack
prior to calling this function since this substitution will
declare the substituted parameters. */
tree
tsubst_constraint_variables (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
/* Clear cp_unevaluated_operand across tsubst so that we get a proper chain
of PARM_DECLs. */
int saved_unevaluated_operand = cp_unevaluated_operand;
cp_unevaluated_operand = 0;
tree vars = tsubst (t, args, complain, in_decl);
cp_unevaluated_operand = saved_unevaluated_operand;
if (vars == error_mark_node)
return error_mark_node;
return declare_constraint_vars (t, vars);
}
/* Substitute ARGS into the parameterized constraint T. */
tree
tsubst_parameterized_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
local_specialization_stack stack;
tree vars = tsubst_constraint_variables (PARM_CONSTR_PARMS (t),
args, complain, in_decl);
if (vars == error_mark_node)
return error_mark_node;
tree expr = tsubst_constraint (PARM_CONSTR_OPERAND (t), args,
complain, in_decl);
if (expr == error_mark_node)
return error_mark_node;
return build_nt (PARM_CONSTR, vars, expr);
}
/* Substitute ARGS into the simple requirement T. Note that
substitution may result in an ill-formed expression without
causing the program to be ill-formed. In such cases, the
requirement wraps an error_mark_node. */
inline tree
tsubst_simple_requirement (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
++processing_template_decl;
tree expr = tsubst_expr (TREE_OPERAND (t, 0), args, complain, in_decl, false);
--processing_template_decl;
return finish_simple_requirement (expr);
}
/* Substitute ARGS into the type requirement T. Note that
substitution may result in an ill-formed type without
causing the program to be ill-formed. In such cases, the
requirement wraps an error_mark_node. */
inline tree
tsubst_type_requirement (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
++processing_template_decl;
tree type = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
--processing_template_decl;
return finish_type_requirement (type);
}
/* Substitute args into the compound requirement T. If substituting
into either the expression or the type fails, the corresponding
operands in the resulting node will be error_mark_node. This
preserves a requirement for the purpose of partial ordering, but
it will never be satisfied. */
tree
tsubst_compound_requirement (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
++processing_template_decl;
tree expr = tsubst_expr (TREE_OPERAND (t, 0), args, complain, in_decl, false);
tree type = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
--processing_template_decl;
bool noexcept_p = COMPOUND_REQ_NOEXCEPT_P (t);
return finish_compound_requirement (expr, type, noexcept_p);
}
/* Substitute ARGS into the nested requirement T. */
tree
tsubst_nested_requirement (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
++processing_template_decl;
tree expr = tsubst_expr (TREE_OPERAND (t, 0), args, complain, in_decl, false);
--processing_template_decl;
return finish_nested_requirement (expr);
}
/* Substitute ARGS into the requirement T. */
inline tree
tsubst_requirement (tree t, tree args, tsubst_flags_t complain, tree in_decl)
{
switch (TREE_CODE (t))
{
case SIMPLE_REQ:
return tsubst_simple_requirement (t, args, complain, in_decl);
case TYPE_REQ:
return tsubst_type_requirement (t, args, complain, in_decl);
case COMPOUND_REQ:
return tsubst_compound_requirement (t, args, complain, in_decl);
case NESTED_REQ:
return tsubst_nested_requirement (t, args, complain, in_decl);
default:
gcc_unreachable ();
}
return error_mark_node;
}
/* Substitute ARGS into the list of requirements T. Note that
substitution failures here result in ill-formed programs. */
tree
tsubst_requirement_body (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
tree r = NULL_TREE;
while (t)
{
tree e = tsubst_requirement (TREE_VALUE (t), args, complain, in_decl);
if (e == error_mark_node)
return error_mark_node;
r = tree_cons (NULL_TREE, e, r);
t = TREE_CHAIN (t);
}
/* Ensure that the order of constraints is the same as the original. */
return nreverse (r);
}
} /* namespace */
/* Substitute ARGS into the requires expression T. Note that this
results in the re-declaration of local parameters when
substituting through the parameter list. If either substitution
fails, the program is ill-formed. */
tree
tsubst_requires_expr (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
local_specialization_stack stack;
tree parms = TREE_OPERAND (t, 0);
if (parms)
{
parms = tsubst_constraint_variables (parms, args, complain, in_decl);
if (parms == error_mark_node)
return error_mark_node;
}
tree reqs = TREE_OPERAND (t, 1);
reqs = tsubst_requirement_body (reqs, args, complain, in_decl);
if (reqs == error_mark_node)
return error_mark_node;
return finish_requires_expr (parms, reqs);
}
/* Substitute ARGS into the constraint information CI, producing a new
constraint record. */
tree
tsubst_constraint_info (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
if (!t || t == error_mark_node || !check_constraint_info (t))
return NULL_TREE;
tree tmpl_constr = NULL_TREE;
if (tree r = CI_TEMPLATE_REQS (t))
tmpl_constr = tsubst_constraint (r, args, complain, in_decl);
tree decl_constr = NULL_TREE;
if (tree r = CI_DECLARATOR_REQS (t))
decl_constr = tsubst_constraint (r, args, complain, in_decl);
return build_constraints (tmpl_constr, decl_constr);
}
/* Substitute ARGS into the constraint T. */
tree
tsubst_constraint (tree t, tree args, tsubst_flags_t complain, tree in_decl)
{
if (t == NULL_TREE)
return t;
switch (TREE_CODE (t))
{
case PRED_CONSTR:
return tsubst_predicate_constraint (t, args, complain, in_decl);
case CHECK_CONSTR:
return tsubst_check_constraint (t, args, complain, in_decl);
case CONJ_CONSTR:
case DISJ_CONSTR:
return tsubst_logical_operator (t, args, complain, in_decl);
case PARM_CONSTR:
return tsubst_parameterized_constraint (t, args, complain, in_decl);
case EXPR_CONSTR:
return tsubst_expr_constr (t, args, complain, in_decl);
case TYPE_CONSTR:
return tsubst_type_constr (t, args, complain, in_decl);
case ICONV_CONSTR:
return tsubst_implicit_conversion_constr (t, args, complain, in_decl);
case DEDUCT_CONSTR:
return tsubst_argument_deduction_constr (t, args, complain, in_decl);
case EXCEPT_CONSTR:
return tsubst_exception_constr (t, args, complain, in_decl);
default:
gcc_unreachable ();
}
return error_mark_node;
}
/*---------------------------------------------------------------------------
Constraint satisfaction
---------------------------------------------------------------------------*/
/* The following functions determine if a constraint, when
substituting template arguments, is satisfied. For convenience,
satisfaction reduces a constraint to either true or false (and
nothing else). */
namespace {
tree satisfy_constraint_1 (tree, tree, tsubst_flags_t, tree);
/* Check the constraint pack expansion. */
tree
satisfy_pack_expansion (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
/* Get the vector of satisfaction results.
gen_elem_of_pack_expansion_instantiation will check that each element of
the expansion is satisfied. */
tree exprs = tsubst_pack_expansion (t, args, complain, in_decl);
if (exprs == error_mark_node)
return boolean_false_node;
/* TODO: It might be better to normalize each expanded term
and evaluate them separately. That would provide better
opportunities for diagnostics. */
for (int i = 0; i < TREE_VEC_LENGTH (exprs); ++i)
if (TREE_VEC_ELT (exprs, i) != boolean_true_node)
return boolean_false_node;
return boolean_true_node;
}
/* A predicate constraint is satisfied if its expression evaluates
to true. If substitution into that node fails, the constraint
is not satisfied ([temp.constr.pred]).
Note that a predicate constraint is a constraint expression
of type bool. If neither of those are true, the program is
ill-formed; they are not SFINAE'able errors. */
tree
satisfy_predicate_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
tree expr = TREE_OPERAND (t, 0);
/* We should never have a naked pack expansion in a predicate constraint. */
gcc_assert (TREE_CODE (expr) != EXPR_PACK_EXPANSION);
/* If substitution into the expression fails, the constraint
is not satisfied. */
expr = tsubst_expr (expr, args, complain, in_decl, false);
if (expr == error_mark_node)
return boolean_false_node;
/* A predicate constraint shall have type bool. In some
cases, substitution gives us const-qualified bool, which
is also acceptable. */
tree type = cv_unqualified (TREE_TYPE (expr));
if (!same_type_p (type, boolean_type_node))
{
error_at (EXPR_LOC_OR_LOC (expr, input_location),
"constraint %qE does not have type %qT",
expr, boolean_type_node);
return boolean_false_node;
}
return cxx_constant_value (expr);
}
/* A concept check constraint like C<CARGS> is satisfied if substituting ARGS
into CARGS succeeds and C is satisfied for the resulting arguments. */
tree
satisfy_check_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
tree decl = CHECK_CONSTR_CONCEPT (t);
tree tmpl = DECL_TI_TEMPLATE (decl);
tree cargs = CHECK_CONSTR_ARGS (t);
/* Instantiate the concept check arguments. */
tree targs = tsubst (cargs, args, tf_none, NULL_TREE);
if (targs == error_mark_node)
return boolean_false_node;
/* Search for a previous value. */
if (tree prev = lookup_concept_satisfaction (tmpl, targs))
return prev;
/* Expand the concept; failure here implies non-satisfaction. */
tree def = expand_concept (decl, targs);
if (def == error_mark_node)
return memoize_concept_satisfaction (tmpl, args, boolean_false_node);
/* Recursively satisfy the constraint. */
tree result = satisfy_constraint_1 (def, targs, complain, in_decl);
return memoize_concept_satisfaction (tmpl, targs, result);
}
/* Check an expression constraint. The constraint is satisfied if
substitution succeeds ([temp.constr.expr]).
Note that the expression is unevaluated. */
tree
satisfy_expression_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
cp_unevaluated guard;
deferring_access_check_sentinel deferring;
tree expr = EXPR_CONSTR_EXPR (t);
tree check = tsubst_expr (expr, args, complain, in_decl, false);
if (check == error_mark_node)
return boolean_false_node;
if (!perform_deferred_access_checks (tf_none))
return boolean_false_node;
return boolean_true_node;
}
/* Check a type constraint. The constraint is satisfied if
substitution succeeds. */
inline tree
satisfy_type_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
deferring_access_check_sentinel deferring;
tree type = TYPE_CONSTR_TYPE (t);
gcc_assert (TYPE_P (type) || type == error_mark_node);
tree check = tsubst (type, args, complain, in_decl);
if (error_operand_p (check))
return boolean_false_node;
if (!perform_deferred_access_checks (complain))
return boolean_false_node;
return boolean_true_node;
}
/* Check an implicit conversion constraint. */
tree
satisfy_implicit_conversion_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
/* Don't tsubst as if we're processing a template. If we try
to we can end up generating template-like expressions
(e.g., modop-exprs) that aren't properly typed. */
tree expr =
tsubst_expr (ICONV_CONSTR_EXPR (t), args, complain, in_decl, false);
if (expr == error_mark_node)
return boolean_false_node;
/* Get the transformed target type. */
tree type = tsubst (ICONV_CONSTR_TYPE (t), args, complain, in_decl);
if (type == error_mark_node)
return boolean_false_node;
/* Attempt the conversion as a direct initialization
of the form TYPE <unspecified> = EXPR. */
tree conv =
perform_direct_initialization_if_possible (type, expr, false, complain);
if (conv == NULL_TREE || conv == error_mark_node)
return boolean_false_node;
else
return boolean_true_node;
}
/* Check an argument deduction constraint. */
tree
satisfy_argument_deduction_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
/* Substitute through the expression. */
tree expr = DEDUCT_CONSTR_EXPR (t);
tree init = tsubst_expr (expr, args, complain, in_decl, false);
if (expr == error_mark_node)
return boolean_false_node;
/* Perform auto or decltype(auto) deduction to get the result. */
tree pattern = DEDUCT_CONSTR_PATTERN (t);
tree placeholder = DEDUCT_CONSTR_PLACEHOLDER (t);
tree constr = PLACEHOLDER_TYPE_CONSTRAINTS (placeholder);
tree type_canonical = TYPE_CANONICAL (placeholder);
PLACEHOLDER_TYPE_CONSTRAINTS (placeholder)
= tsubst_constraint (constr, args, complain|tf_partial, in_decl);
TYPE_CANONICAL (placeholder) = NULL_TREE;
tree type = do_auto_deduction (pattern, init, placeholder,
complain, adc_requirement);
PLACEHOLDER_TYPE_CONSTRAINTS (placeholder) = constr;
TYPE_CANONICAL (placeholder) = type_canonical;
if (type == error_mark_node)
return boolean_false_node;
return boolean_true_node;
}
/* Check an exception constraint. An exception constraint for an
expression e is satisfied when noexcept(e) is true. */
tree
satisfy_exception_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
tree expr = EXCEPT_CONSTR_EXPR (t);
tree check = tsubst_expr (expr, args, complain, in_decl, false);
if (check == error_mark_node)
return boolean_false_node;
if (expr_noexcept_p (check, complain))
return boolean_true_node;
else
return boolean_false_node;
}
/* Check a parameterized constraint. */
tree
satisfy_parameterized_constraint (tree t, tree args,
tsubst_flags_t complain, tree in_decl)
{
local_specialization_stack stack;
tree parms = PARM_CONSTR_PARMS (t);
tree vars = tsubst_constraint_variables (parms, args, complain, in_decl);
if (vars == error_mark_node)
return boolean_false_node;
tree constr = PARM_CONSTR_OPERAND (t);
return satisfy_constraint_1 (constr, args, complain, in_decl);
}
/* Check that the conjunction of constraints is satisfied. Note
that if left operand is not satisfied, the right operand
is not checked.
FIXME: Check that this wouldn't result in a user-defined
operator. Note that this error is partially diagnosed in
satisfy_predicate_constraint. It would be nice to diagnose
the overload, but I don't think it's strictly necessary. */
tree
satisfy_conjunction (tree t, tree args, tsubst_flags_t complain, tree in_decl)
{
tree t0 = satisfy_constraint_1 (TREE_OPERAND (t, 0), args, complain, in_decl);
if (t0 == boolean_false_node)
return boolean_false_node;
return satisfy_constraint_1 (TREE_OPERAND (t, 1), args, complain, in_decl);
}
/* Check that the disjunction of constraints is satisfied. Note
that if the left operand is satisfied, the right operand is not
checked. */
tree
satisfy_disjunction (tree t, tree args, tsubst_flags_t complain, tree in_decl)
{
tree t0 = satisfy_constraint_1 (TREE_OPERAND (t, 0), args, complain, in_decl);
if (t0 == boolean_true_node)
return boolean_true_node;
return satisfy_constraint_1 (TREE_OPERAND (t, 1), args, complain, in_decl);
}
/* Dispatch to an appropriate satisfaction routine depending on the
tree code of T. */
tree
satisfy_constraint_1 (tree t, tree args, tsubst_flags_t complain, tree in_decl)
{
gcc_assert (!processing_template_decl);
if (!t)
return boolean_false_node;
if (t == error_mark_node)
return boolean_false_node;
switch (TREE_CODE (t))
{
case PRED_CONSTR:
return satisfy_predicate_constraint (t, args, complain, in_decl);
case CHECK_CONSTR:
return satisfy_check_constraint (t, args, complain, in_decl);
case EXPR_CONSTR:
return satisfy_expression_constraint (t, args, complain, in_decl);
case TYPE_CONSTR:
return satisfy_type_constraint (t, args, complain, in_decl);
case ICONV_CONSTR:
return satisfy_implicit_conversion_constraint (t, args, complain, in_decl);
case DEDUCT_CONSTR:
return satisfy_argument_deduction_constraint (t, args, complain, in_decl);
case EXCEPT_CONSTR:
return satisfy_exception_constraint (t, args, complain, in_decl);
case PARM_CONSTR:
return satisfy_parameterized_constraint (t, args, complain, in_decl);
case CONJ_CONSTR:
return satisfy_conjunction (t, args, complain, in_decl);
case DISJ_CONSTR:
return satisfy_disjunction (t, args, complain, in_decl);
case EXPR_PACK_EXPANSION:
return satisfy_pack_expansion (t, args, complain, in_decl);
default:
gcc_unreachable ();
}
return boolean_false_node;
}
/* Check that the constraint is satisfied, according to the rules
for that constraint. Note that each satisfy_* function returns
true or false, depending on whether it is satisfied or not. */
tree
satisfy_constraint (tree t, tree args)
{
auto_timevar time (TV_CONSTRAINT_SAT);
/* Turn off template processing. Constraint satisfaction only applies
to non-dependent terms, so we want to ensure full checking here. */
processing_template_decl_sentinel proc (true);
/* Avoid early exit in tsubst and tsubst_copy from null args; since earlier
substitution was done with processing_template_decl forced on, there will
be expressions that still need semantic processing, possibly buried in
decltype or a template argument. */
if (args == NULL_TREE)
args = make_tree_vec (1);
return satisfy_constraint_1 (t, args, tf_none, NULL_TREE);
}
/* Check the associated constraints in CI against the given
ARGS, returning true when the constraints are satisfied
and false otherwise. */
tree
satisfy_associated_constraints (tree ci, tree args)
{
/* If there are no constraints then this is trivially satisfied. */
if (!ci)
return boolean_true_node;
/* If any arguments depend on template parameters, we can't
check constraints. */
if (args && uses_template_parms (args))
return boolean_true_node;
/* Check if we've seen a previous result. */
if (tree prev = lookup_constraint_satisfaction (ci, args))
return prev;
/* Actually test for satisfaction. */
tree result = satisfy_constraint (CI_ASSOCIATED_CONSTRAINTS (ci), args);
return memoize_constraint_satisfaction (ci, args, result);
}
} /* namespace */
/* Evaluate the given constraint, returning boolean_true_node
if the constraint is satisfied and boolean_false_node
otherwise. */
tree
evaluate_constraints (tree constr, tree args)
{
gcc_assert (constraint_p (constr));
return satisfy_constraint (constr, args);
}
/* Evaluate the function concept FN by substituting its own args
into its definition and evaluating that as the result. Returns
boolean_true_node if the constraints are satisfied and
boolean_false_node otherwise. */
tree
evaluate_function_concept (tree fn, tree args)
{
tree constr = build_nt (CHECK_CONSTR, fn, args);
return satisfy_constraint (constr, args);
}
/* Evaluate the variable concept VAR by substituting its own args into
its initializer and checking the resulting constraint. Returns
boolean_true_node if the constraints are satisfied and
boolean_false_node otherwise. */
tree
evaluate_variable_concept (tree var, tree args)
{
tree constr = build_nt (CHECK_CONSTR, var, args);
return satisfy_constraint (constr, args);
}
/* Evaluate the given expression as if it were a predicate
constraint. Returns boolean_true_node if the constraint
is satisfied and boolean_false_node otherwise. */
tree
evaluate_constraint_expression (tree expr, tree args)
{
tree constr = normalize_expression (expr);
return satisfy_constraint (constr, args);
}
/* Returns true if the DECL's constraints are satisfied.
This is used in cases where a declaration is formed but
before it is used (e.g., overload resolution). */
bool
constraints_satisfied_p (tree decl)
{
/* Get the constraints to check for satisfaction. This depends
on whether we're looking at a template specialization or not. */
tree ci;
tree args = NULL_TREE;
if (tree ti = DECL_TEMPLATE_INFO (decl))
{
tree tmpl = TI_TEMPLATE (ti);
ci = get_constraints (tmpl);
int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
args = get_innermost_template_args (TI_ARGS (ti), depth);
}
else
{
ci = get_constraints (decl);
}
tree eval = satisfy_associated_constraints (ci, args);
return eval == boolean_true_node;
}
/* Returns true if the constraints are satisfied by ARGS.
Here, T can be either a constraint or a constrained
declaration. */
bool
constraints_satisfied_p (tree t, tree args)
{
tree eval;
if (constraint_p (t))
eval = evaluate_constraints (t, args);
else
eval = satisfy_associated_constraints (get_constraints (t), args);
return eval == boolean_true_node;
}
namespace
{
/* Normalize EXPR and determine if the resulting constraint is
satisfied by ARGS. Returns true if and only if the constraint
is satisfied. This is used extensively by diagnostics to
determine causes for failure. */
inline bool
constraint_expression_satisfied_p (tree expr, tree args)
{
return evaluate_constraint_expression (expr, args) == boolean_true_node;
}
} /* namespace */
/*---------------------------------------------------------------------------
Semantic analysis of requires-expressions
---------------------------------------------------------------------------*/
/* Finish a requires expression for the given PARMS (possibly
null) and the non-empty sequence of requirements. */
tree
finish_requires_expr (tree parms, tree reqs)
{
/* Modify the declared parameters by removing their context
so they don't refer to the enclosing scope and explicitly
indicating that they are constraint variables. */
for (tree parm = parms; parm; parm = DECL_CHAIN (parm))
{
DECL_CONTEXT (parm) = NULL_TREE;
CONSTRAINT_VAR_P (parm) = true;
}
/* Build the node. */
tree r = build_min (REQUIRES_EXPR, boolean_type_node, parms, reqs);
TREE_SIDE_EFFECTS (r) = false;
TREE_CONSTANT (r) = true;
return r;
}
/* Construct a requirement for the validity of EXPR. */
tree
finish_simple_requirement (tree expr)
{
return build_nt (SIMPLE_REQ, expr);
}
/* Construct a requirement for the validity of TYPE. */
tree
finish_type_requirement (tree type)
{
return build_nt (TYPE_REQ, type);
}
/* Construct a requirement for the validity of EXPR, along with
its properties. if TYPE is non-null, then it specifies either
an implicit conversion or argument deduction constraint,
depending on whether any placeholders occur in the type name.
NOEXCEPT_P is true iff the noexcept keyword was specified. */
tree
finish_compound_requirement (tree expr, tree type, bool noexcept_p)
{
tree req = build_nt (COMPOUND_REQ, expr, type);
COMPOUND_REQ_NOEXCEPT_P (req) = noexcept_p;
return req;
}
/* Finish a nested requirement. */
tree
finish_nested_requirement (tree expr)
{
return build_nt (NESTED_REQ, expr);
}
// Check that FN satisfies the structural requirements of a
// function concept definition.
tree
check_function_concept (tree fn)
{
// Check that the function is comprised of only a single
// return statement.
tree body = DECL_SAVED_TREE (fn);
if (TREE_CODE (body) == BIND_EXPR)
body = BIND_EXPR_BODY (body);
// Sometimes a function call results in the creation of clean up
// points. Allow these to be preserved in the body of the
// constraint, as we might actually need them for some constexpr
// evaluations.
if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
body = TREE_OPERAND (body, 0);
/* Check that the definition is written correctly. */
if (TREE_CODE (body) != RETURN_EXPR)
{
location_t loc = DECL_SOURCE_LOCATION (fn);
if (TREE_CODE (body) == STATEMENT_LIST && !STATEMENT_LIST_HEAD (body))
{
if (seen_error ())
/* The definition was probably erroneous, not empty. */;
else
error_at (loc, "definition of concept %qD is empty", fn);
}
else
error_at (loc, "definition of concept %qD has multiple statements", fn);
}
return NULL_TREE;
}
// Check that a constrained friend declaration function declaration,
// FN, is admissible. This is the case only when the declaration depends
// on template parameters and does not declare a specialization.
void
check_constrained_friend (tree fn, tree reqs)
{
if (fn == error_mark_node)
return;
gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
// If there are not constraints, this cannot be an error.
if (!reqs)
return;
// Constrained friend functions that don't depend on template
// arguments are effectively meaningless.
if (!uses_template_parms (TREE_TYPE (fn)))
{
error_at (location_of (fn),
"constrained friend does not depend on template parameters");
return;
}
}
/*---------------------------------------------------------------------------
Equivalence of constraints
---------------------------------------------------------------------------*/
/* Returns true when A and B are equivalent constraints. */
bool
equivalent_constraints (tree a, tree b)
{
gcc_assert (!a || TREE_CODE (a) == CONSTRAINT_INFO);
gcc_assert (!b || TREE_CODE (b) == CONSTRAINT_INFO);
return cp_tree_equal (a, b);
}
/* Returns true if the template declarations A and B have equivalent
constraints. This is the case when A's constraints subsume B's and
when B's also constrain A's. */
bool
equivalently_constrained (tree d1, tree d2)
{
gcc_assert (TREE_CODE (d1) == TREE_CODE (d2));
return equivalent_constraints (get_constraints (d1), get_constraints (d2));
}
/*---------------------------------------------------------------------------
Partial ordering of constraints
---------------------------------------------------------------------------*/
/* Returns true when the the constraints in A subsume those in B. */
bool
subsumes_constraints (tree a, tree b)
{
gcc_assert (!a || TREE_CODE (a) == CONSTRAINT_INFO);
gcc_assert (!b || TREE_CODE (b) == CONSTRAINT_INFO);
return subsumes (a, b);
}
/* Returns true when the the constraints in A subsume those in B, but
the constraints in B do not subsume the constraints in A. */
bool
strictly_subsumes (tree a, tree b)
{
return subsumes (a, b) && !subsumes (b, a);
}
/* Determines which of the declarations, A or B, is more constrained.
That is, which declaration's constraints subsume but are not subsumed
by the other's?
Returns 1 if A is more constrained than B, -1 if B is more constrained
than A, and 0 otherwise. */
int
more_constrained (tree d1, tree d2)
{
tree c1 = get_constraints (d1);
tree c2 = get_constraints (d2);
int winner = 0;
if (subsumes_constraints (c1, c2))
++winner;
if (subsumes_constraints (c2, c1))
--winner;
return winner;
}
/* Returns true if D1 is at least as constrained as D2. That is, the
associated constraints of D1 subsume those of D2, or both declarations
are unconstrained. */
bool
at_least_as_constrained (tree d1, tree d2)
{
tree c1 = get_constraints (d1);
tree c2 = get_constraints (d2);
return subsumes_constraints (c1, c2);
}
/*---------------------------------------------------------------------------
Constraint diagnostics
FIXME: Normalize expressions into constraints before evaluating them.
This should be the general pattern for all such diagnostics.
---------------------------------------------------------------------------*/
/* The number of detailed constraint failures. */
int constraint_errors = 0;
/* Do not generate errors after diagnosing this number of constraint
failures.
FIXME: This is a really arbitrary number. Provide better control of
constraint diagnostics with a command line option. */
int constraint_thresh = 20;
/* Returns true if we should elide the diagnostic for a constraint failure.
This is the case when the number of errors has exceeded the pre-configured
threshold. */
inline bool
elide_constraint_failure_p ()
{
bool ret = constraint_thresh <= constraint_errors;
++constraint_errors;
return ret;
}
/* Returns the number of undiagnosed errors. */
inline int
undiagnosed_constraint_failures ()
{
return constraint_errors - constraint_thresh;
}
/* The diagnosis of constraints performs a combination of normalization
and satisfaction testing. We recursively walk through the conjunction or
disjunction of associated constraints, testing each sub-constraint in
turn. */
namespace {
void diagnose_constraint (location_t, tree, tree, tree);
/* Emit a specific diagnostics for a failed trait. */
void
diagnose_trait_expression (location_t loc, tree, tree cur, tree args)
{
if (constraint_expression_satisfied_p (cur, args))
return;
if (elide_constraint_failure_p())
return;
tree expr = PRED_CONSTR_EXPR (cur);
++processing_template_decl;
expr = tsubst_expr (expr, args, tf_none, NULL_TREE, false);
--processing_template_decl;
tree t1 = TRAIT_EXPR_TYPE1 (expr);
tree t2 = TRAIT_EXPR_TYPE2 (expr);
switch (TRAIT_EXPR_KIND (expr))
{
case CPTK_HAS_NOTHROW_ASSIGN:
inform (loc, " %qT is not nothrow copy assignable", t1);
break;
case CPTK_HAS_NOTHROW_CONSTRUCTOR:
inform (loc, " %qT is not nothrow default constructible", t1);
break;
case CPTK_HAS_NOTHROW_COPY:
inform (loc, " %qT is not nothrow copy constructible", t1);
break;
case CPTK_HAS_TRIVIAL_ASSIGN:
inform (loc, " %qT is not trivially copy assignable", t1);
break;
case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
inform (loc, " %qT is not trivially default constructible", t1);
break;
case CPTK_HAS_TRIVIAL_COPY:
inform (loc, " %qT is not trivially copy constructible", t1);
break;
case CPTK_HAS_TRIVIAL_DESTRUCTOR:
inform (loc, " %qT is not trivially destructible", t1);
break;
case CPTK_HAS_VIRTUAL_DESTRUCTOR:
inform (loc, " %qT does not have a virtual destructor", t1);
break;
case CPTK_IS_ABSTRACT:
inform (loc, " %qT is not an abstract class", t1);
break;
case CPTK_IS_BASE_OF:
inform (loc, " %qT is not a base of %qT", t1, t2);
break;
case CPTK_IS_CLASS:
inform (loc, " %qT is not a class", t1);
break;
case CPTK_IS_EMPTY:
inform (loc, " %qT is not an empty class", t1);
break;
case CPTK_IS_ENUM:
inform (loc, " %qT is not an enum", t1);
break;
case CPTK_IS_FINAL:
inform (loc, " %qT is not a final class", t1);
break;
case CPTK_IS_LITERAL_TYPE:
inform (loc, " %qT is not a literal type", t1);
break;
case CPTK_IS_POD:
inform (loc, " %qT is not a POD type", t1);
break;
case CPTK_IS_POLYMORPHIC:
inform (loc, " %qT is not a polymorphic type", t1);
break;
case CPTK_IS_SAME_AS:
inform (loc, " %qT is not the same as %qT", t1, t2);
break;
case CPTK_IS_STD_LAYOUT:
inform (loc, " %qT is not an standard layout type", t1);
break;
case CPTK_IS_TRIVIAL:
inform (loc, " %qT is not a trivial type", t1);
break;
case CPTK_IS_UNION:
inform (loc, " %qT is not a union", t1);
break;
default:
gcc_unreachable ();
}
}
/* Diagnose the expression of a predicate constraint. */
void
diagnose_other_expression (location_t loc, tree, tree cur, tree args)
{
if (constraint_expression_satisfied_p (cur, args))
return;
if (elide_constraint_failure_p())
return;
inform (loc, "%qE evaluated to false", cur);
}
/* Do our best to infer meaning from predicates. */
inline void
diagnose_predicate_constraint (location_t loc, tree orig, tree cur, tree args)
{
if (TREE_CODE (PRED_CONSTR_EXPR (cur)) == TRAIT_EXPR)
diagnose_trait_expression (loc, orig, cur, args);
else
diagnose_other_expression (loc, orig, cur, args);
}
/* Diagnose a failed pack expansion, possibly containing constraints. */
void
diagnose_pack_expansion (location_t loc, tree, tree cur, tree args)
{
if (constraint_expression_satisfied_p (cur, args))
return;
if (elide_constraint_failure_p())
return;
/* Make sure that we don't have naked packs that we don't expect. */
if (!same_type_p (TREE_TYPE (cur), boolean_type_node))
{
inform (loc, "invalid pack expansion in constraint %qE", cur);
return;
}
inform (loc, "in the expansion of %qE", cur);
/* Get the vector of expanded arguments. Note that n must not
be 0 since this constraint is not satisfied. */
++processing_template_decl;
tree exprs = tsubst_pack_expansion (cur, args, tf_none, NULL_TREE);
--processing_template_decl;
if (exprs == error_mark_node)
{
/* TODO: This error message could be better. */
inform (loc, " substitution failure occurred during expansion");
return;
}
/* Check each expanded constraint separately. */
int n = TREE_VEC_LENGTH (exprs);
for (int i = 0; i < n; ++i)
{
tree expr = TREE_VEC_ELT (exprs, i);
if (!constraint_expression_satisfied_p (expr, args))
inform (loc, " %qE was not satisfied", expr);
}
}
/* Diagnose a potentially unsatisfied concept check constraint DECL<CARGS>.
Parameters are as for diagnose_constraint. */
void
diagnose_check_constraint (location_t loc, tree orig, tree cur, tree args)
{
if (constraints_satisfied_p (cur, args))
return;
tree decl = CHECK_CONSTR_CONCEPT (cur);
tree cargs = CHECK_CONSTR_ARGS (cur);
tree tmpl = DECL_TI_TEMPLATE (decl);
tree check = build_nt (CHECK_CONSTR, decl, cargs);
/* Instantiate the concept check arguments. */
tree targs = tsubst (cargs, args, tf_none, NULL_TREE);
if (targs == error_mark_node)
{
if (elide_constraint_failure_p ())
return;
inform (loc, "invalid use of the concept %qE", check);
tsubst (cargs, args, tf_warning_or_error, NULL_TREE);
return;
}
tree sub = build_tree_list (tmpl, targs);
/* Update to the expanded definitions. */
cur = expand_concept (decl, targs);
if (cur == error_mark_node)
{
if (elide_constraint_failure_p ())
return;
inform (loc, "in the expansion of concept %<%E %S%>", check, sub);
cur = get_concept_definition (decl);
tsubst_expr (cur, targs, tf_warning_or_error, NULL_TREE, false);
return;
}
orig = get_concept_definition (CHECK_CONSTR_CONCEPT (orig));
orig = normalize_expression (orig);
location_t dloc = DECL_SOURCE_LOCATION (decl);
inform (dloc, "within %qS", sub);
diagnose_constraint (dloc, orig, cur, targs);
}
/* Diagnose a potentially unsatisfied conjunction or disjunction. Parameters
are as for diagnose_constraint. */
void
diagnose_logical_constraint (location_t loc, tree orig, tree cur, tree args)
{
tree t0 = TREE_OPERAND (cur, 0);
tree t1 = TREE_OPERAND (cur, 1);
if (!constraints_satisfied_p (t0, args))
diagnose_constraint (loc, TREE_OPERAND (orig, 0), t0, args);
else if (TREE_CODE (orig) == TRUTH_ORIF_EXPR)
return;
if (!constraints_satisfied_p (t1, args))
diagnose_constraint (loc, TREE_OPERAND (orig, 1), t1, args);
}
/* Diagnose a potential expression constraint failure. */
void
diagnose_expression_constraint (location_t loc, tree orig, tree cur, tree args)
{
if (constraints_satisfied_p (cur, args))
return;
if (elide_constraint_failure_p())
return;
tree expr = EXPR_CONSTR_EXPR (orig);
inform (loc, "the required expression %qE would be ill-formed", expr);
// TODO: We should have a flag that controls this substitution.
// I'm finding it very useful for resolving concept check errors.
// inform (input_location, "==== BEGIN DUMP ====");
// tsubst_expr (EXPR_CONSTR_EXPR (orig), args, tf_warning_or_error, NULL_TREE, false);
// inform (input_location, "==== END DUMP ====");
}
/* Diagnose a potentially failed type constraint. */
void
diagnose_type_constraint (location_t loc, tree orig, tree cur, tree args)
{
if (constraints_satisfied_p (cur, args))
return;
if (elide_constraint_failure_p())
return;
tree type = TYPE_CONSTR_TYPE (orig);
inform (loc, "the required type %qT would be ill-formed", type);
}
/* Diagnose a potentially unsatisfied conversion constraint. */
void
diagnose_implicit_conversion_constraint (location_t loc, tree orig, tree cur,
tree args)
{
if (constraints_satisfied_p (cur, args))
return;
/* The expression and type will previously have been substituted into,
and therefore may already be an error. Also, we will have already
diagnosed substitution failures into an expression since this must be
part of a compound requirement. */
tree expr = ICONV_CONSTR_EXPR (cur);
if (error_operand_p (expr))
return;
/* Don't elide a previously diagnosed failure. */
if (elide_constraint_failure_p())
return;
tree type = ICONV_CONSTR_TYPE (cur);
if (error_operand_p (type))
{
inform (loc, "substitution into type %qT failed",
ICONV_CONSTR_TYPE (orig));
return;
}
inform(loc, "%qE is not implicitly convertible to %qT", expr, type);
}
/* Diagnose an argument deduction constraint. */
void
diagnose_argument_deduction_constraint (location_t loc, tree orig, tree cur,
tree args)
{
if (constraints_satisfied_p (cur, args))
return;
/* The expression and type will previously have been substituted into,
and therefore may already be an error. Also, we will have already
diagnosed substution failures into an expression since this must be
part of a compound requirement. */
tree expr = DEDUCT_CONSTR_EXPR (cur);
if (error_operand_p (expr))
return;
/* Don't elide a previously diagnosed failure. */
if (elide_constraint_failure_p ())
return;
tree pattern = DEDUCT_CONSTR_PATTERN (cur);
if (error_operand_p (pattern))
{
inform (loc, "substitution into type %qT failed",
DEDUCT_CONSTR_PATTERN (orig));
return;
}
inform (loc, "unable to deduce placeholder type %qT from %qE",
pattern, expr);
}
/* Diagnose an exception constraint. */
void
diagnose_exception_constraint (location_t loc, tree orig, tree cur, tree args)
{
if (constraints_satisfied_p (cur, args))
return;
if (elide_constraint_failure_p ())
return;
/* Rebuild a noexcept expression. */
tree expr = EXCEPT_CONSTR_EXPR (cur);
if (error_operand_p (expr))
return;
inform (loc, "%qE evaluated to false", EXCEPT_CONSTR_EXPR (orig));
}
/* Diagnose a potentially unsatisfied parameterized constraint. */
void
diagnose_parameterized_constraint (location_t loc, tree orig, tree cur,
tree args)
{
if (constraints_satisfied_p (cur, args))
return;
local_specialization_stack stack;
tree parms = PARM_CONSTR_PARMS (cur);
tree vars = tsubst_constraint_variables (parms, args, tf_warning_or_error,
NULL_TREE);
if (vars == error_mark_node)
{
if (elide_constraint_failure_p ())
return;
/* TODO: Check which variable failed and use orig to diagnose
that substitution error. */
inform (loc, "failed to instantiate constraint variables");
return;
}
/* TODO: It would be better write these in a list. */
while (vars)
{
inform (loc, " with %q#D", vars);
vars = TREE_CHAIN (vars);
}
orig = PARM_CONSTR_OPERAND (orig);
cur = PARM_CONSTR_OPERAND (cur);
return diagnose_constraint (loc, orig, cur, args);
}
/* Diagnose the constraint CUR for the given ARGS. This is only ever invoked
on the associated constraints, so we can only have conjunctions of
predicate constraints. The ORIGinal (dependent) constructs follow
the current constraints to enable better diagnostics. Note that ORIG
and CUR must be the same kinds of node, except when CUR is an error. */
void
diagnose_constraint (location_t loc, tree orig, tree cur, tree args)
{
switch (TREE_CODE (cur))
{
case EXPR_CONSTR:
diagnose_expression_constraint (loc, orig, cur, args);
break;
case TYPE_CONSTR:
diagnose_type_constraint (loc, orig, cur, args);
break;
case ICONV_CONSTR:
diagnose_implicit_conversion_constraint (loc, orig, cur, args);
break;
case DEDUCT_CONSTR:
diagnose_argument_deduction_constraint (loc, orig, cur, args);
break;
case EXCEPT_CONSTR:
diagnose_exception_constraint (loc, orig, cur, args);
break;
case CONJ_CONSTR:
case DISJ_CONSTR:
diagnose_logical_constraint (loc, orig, cur, args);
break;
case PRED_CONSTR:
diagnose_predicate_constraint (loc, orig, cur, args);
break;
case PARM_CONSTR:
diagnose_parameterized_constraint (loc, orig, cur, args);
break;
case CHECK_CONSTR:
diagnose_check_constraint (loc, orig, cur, args);
break;
case EXPR_PACK_EXPANSION:
diagnose_pack_expansion (loc, orig, cur, args);
break;
case ERROR_MARK:
/* TODO: Can we improve the diagnostic with the original? */
inform (input_location, "ill-formed constraint");
break;
default:
gcc_unreachable ();
break;
}
}
/* Diagnose the reason(s) why ARGS do not satisfy the constraints
of declaration DECL. */
void
diagnose_declaration_constraints (location_t loc, tree decl, tree args)
{
inform (loc, " constraints not satisfied");
/* Constraints are attached to the template. */
if (tree ti = DECL_TEMPLATE_INFO (decl))
{
decl = TI_TEMPLATE (ti);
if (!args)
args = TI_ARGS (ti);
}
/* Recursively diagnose the associated constraints. */
tree ci = get_constraints (decl);
tree t = CI_ASSOCIATED_CONSTRAINTS (ci);
diagnose_constraint (loc, t, t, args);
}
} // namespace
/* Emit diagnostics detailing the failure ARGS to satisfy the
constraints of T. Here, T can be either a constraint
or a declaration. */
void
diagnose_constraints (location_t loc, tree t, tree args)
{
constraint_errors = 0;
if (constraint_p (t))
diagnose_constraint (loc, t, t, args);
else if (DECL_P (t))
diagnose_declaration_constraints (loc, t, args);
else
gcc_unreachable ();
/* Note the number of elided failures. */
int n = undiagnosed_constraint_failures ();
if (n > 0)
inform (loc, "... and %d more constraint errors not shown", n);
}
|