1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
8165
8166
8167
8168
8169
8170
8171
8172
8173
8174
8175
8176
8177
8178
8179
8180
8181
8182
8183
8184
8185
8186
8187
8188
8189
8190
8191
8192
8193
8194
8195
8196
8197
8198
8199
8200
8201
8202
8203
8204
8205
8206
8207
8208
8209
8210
8211
8212
8213
8214
8215
8216
8217
8218
8219
8220
8221
8222
8223
8224
8225
8226
8227
8228
8229
8230
8231
8232
8233
8234
8235
8236
8237
8238
8239
8240
8241
8242
8243
8244
8245
8246
8247
8248
8249
8250
8251
8252
8253
8254
8255
8256
8257
8258
8259
8260
8261
8262
8263
8264
8265
8266
8267
8268
8269
8270
8271
8272
8273
8274
8275
8276
8277
8278
8279
8280
8281
8282
8283
8284
8285
8286
8287
8288
8289
8290
8291
8292
8293
8294
8295
8296
8297
8298
8299
8300
8301
8302
8303
8304
8305
8306
8307
8308
8309
8310
8311
8312
8313
8314
8315
8316
8317
8318
8319
8320
8321
8322
8323
8324
8325
8326
8327
8328
8329
8330
8331
8332
8333
8334
8335
8336
8337
8338
8339
8340
8341
8342
8343
8344
8345
8346
8347
8348
8349
8350
8351
8352
8353
8354
8355
8356
8357
8358
8359
8360
8361
8362
8363
8364
8365
8366
8367
8368
8369
8370
8371
8372
8373
8374
8375
8376
8377
8378
8379
8380
8381
8382
8383
8384
8385
8386
8387
8388
8389
8390
8391
8392
8393
8394
8395
8396
8397
8398
8399
8400
8401
8402
8403
8404
8405
8406
8407
8408
8409
8410
8411
8412
8413
8414
8415
8416
8417
8418
8419
8420
8421
8422
8423
8424
8425
8426
8427
8428
8429
8430
8431
8432
8433
8434
8435
8436
8437
8438
8439
8440
8441
8442
8443
8444
8445
8446
8447
8448
8449
8450
8451
8452
8453
8454
8455
8456
8457
8458
8459
8460
8461
8462
8463
8464
8465
8466
8467
8468
8469
8470
8471
8472
8473
8474
8475
8476
8477
8478
8479
8480
8481
8482
8483
8484
8485
8486
8487
8488
8489
8490
8491
8492
8493
8494
8495
8496
8497
8498
8499
8500
8501
8502
8503
8504
8505
8506
8507
8508
8509
8510
8511
8512
8513
8514
8515
8516
8517
8518
8519
8520
8521
8522
8523
8524
8525
8526
8527
8528
8529
8530
8531
8532
8533
8534
8535
8536
8537
8538
8539
8540
8541
8542
8543
8544
8545
8546
8547
8548
8549
8550
8551
8552
8553
8554
8555
8556
8557
8558
8559
8560
8561
8562
8563
8564
8565
8566
8567
8568
8569
8570
8571
8572
8573
8574
8575
8576
8577
8578
8579
8580
8581
8582
8583
8584
8585
8586
8587
8588
8589
8590
8591
8592
8593
8594
8595
8596
8597
8598
8599
8600
8601
8602
8603
8604
8605
8606
8607
8608
8609
8610
8611
8612
8613
8614
8615
8616
8617
8618
8619
8620
8621
8622
8623
8624
8625
8626
8627
8628
8629
8630
8631
8632
8633
8634
8635
8636
8637
8638
8639
8640
8641
8642
8643
8644
8645
8646
8647
8648
8649
8650
8651
8652
8653
8654
8655
8656
8657
8658
8659
8660
8661
8662
8663
8664
8665
8666
8667
8668
8669
8670
8671
8672
8673
8674
8675
8676
8677
8678
8679
8680
8681
8682
8683
8684
8685
8686
8687
8688
8689
8690
8691
8692
8693
8694
8695
8696
8697
8698
8699
8700
8701
8702
8703
8704
8705
8706
8707
8708
8709
8710
8711
8712
8713
8714
8715
8716
8717
8718
8719
8720
8721
8722
8723
8724
8725
8726
8727
8728
8729
8730
8731
8732
8733
8734
8735
8736
8737
8738
8739
8740
8741
8742
8743
8744
8745
8746
8747
8748
8749
8750
8751
8752
8753
8754
8755
8756
8757
8758
8759
8760
8761
8762
8763
8764
8765
8766
8767
8768
8769
8770
8771
8772
8773
8774
8775
8776
8777
8778
8779
8780
8781
8782
8783
8784
8785
8786
8787
8788
8789
8790
8791
8792
8793
8794
8795
8796
8797
8798
8799
8800
8801
8802
8803
8804
8805
8806
8807
8808
8809
8810
8811
8812
8813
8814
8815
8816
8817
8818
8819
8820
8821
8822
8823
8824
8825
8826
8827
8828
8829
8830
8831
8832
8833
8834
8835
8836
8837
8838
8839
8840
8841
8842
8843
8844
8845
8846
8847
8848
8849
8850
8851
8852
8853
8854
8855
8856
8857
8858
8859
8860
8861
8862
8863
8864
8865
8866
8867
8868
8869
8870
8871
8872
8873
8874
8875
8876
8877
8878
8879
8880
8881
8882
8883
8884
8885
8886
8887
8888
8889
8890
8891
8892
8893
8894
8895
8896
8897
8898
8899
8900
8901
8902
8903
8904
8905
8906
8907
8908
8909
8910
8911
8912
8913
8914
8915
8916
8917
8918
8919
8920
8921
8922
8923
8924
8925
8926
8927
8928
8929
8930
8931
8932
8933
8934
8935
8936
8937
8938
8939
8940
8941
8942
8943
8944
8945
8946
8947
8948
8949
8950
8951
8952
8953
8954
8955
8956
8957
8958
8959
8960
8961
8962
8963
8964
8965
8966
8967
8968
8969
8970
8971
8972
8973
8974
8975
8976
8977
8978
8979
8980
8981
8982
8983
8984
8985
8986
8987
8988
8989
8990
8991
8992
8993
8994
8995
8996
8997
8998
8999
9000
9001
9002
9003
9004
9005
9006
9007
9008
9009
9010
9011
9012
9013
9014
9015
9016
9017
9018
9019
9020
9021
9022
9023
9024
9025
9026
9027
9028
9029
9030
9031
9032
9033
9034
9035
9036
9037
9038
9039
9040
9041
9042
9043
9044
9045
9046
9047
9048
9049
9050
9051
9052
9053
9054
9055
9056
9057
9058
9059
9060
9061
9062
9063
9064
9065
9066
9067
9068
9069
9070
9071
9072
9073
9074
9075
9076
9077
9078
9079
9080
9081
9082
9083
9084
9085
9086
9087
9088
9089
9090
9091
9092
9093
9094
9095
9096
9097
9098
9099
9100
9101
9102
9103
9104
9105
9106
9107
9108
9109
9110
9111
9112
9113
9114
9115
9116
9117
9118
9119
9120
9121
9122
9123
9124
9125
9126
9127
9128
9129
9130
9131
9132
9133
9134
9135
9136
9137
9138
9139
9140
9141
9142
9143
9144
9145
9146
9147
9148
9149
9150
9151
9152
9153
9154
9155
9156
9157
9158
9159
9160
9161
9162
9163
9164
9165
9166
9167
9168
9169
9170
9171
9172
9173
9174
9175
9176
9177
9178
9179
9180
9181
9182
9183
9184
9185
9186
9187
9188
9189
9190
9191
9192
9193
9194
9195
9196
9197
9198
9199
9200
9201
9202
9203
9204
9205
9206
9207
9208
9209
9210
9211
9212
9213
9214
9215
9216
9217
9218
9219
9220
9221
9222
9223
9224
9225
9226
9227
9228
9229
9230
9231
9232
9233
9234
9235
9236
9237
9238
9239
9240
9241
9242
9243
9244
9245
9246
9247
9248
9249
9250
9251
9252
9253
9254
9255
9256
9257
9258
9259
9260
9261
9262
9263
9264
9265
9266
9267
9268
9269
9270
9271
9272
9273
9274
9275
9276
9277
9278
9279
9280
9281
9282
9283
9284
9285
9286
9287
9288
9289
9290
9291
9292
9293
9294
9295
9296
9297
9298
9299
9300
9301
9302
9303
9304
9305
9306
9307
9308
9309
9310
9311
9312
9313
9314
9315
9316
9317
9318
9319
9320
9321
9322
9323
9324
9325
9326
9327
9328
9329
9330
9331
9332
9333
9334
9335
9336
9337
9338
9339
9340
9341
9342
9343
9344
9345
9346
9347
9348
9349
9350
9351
9352
9353
9354
9355
9356
9357
9358
9359
9360
9361
9362
9363
9364
9365
9366
9367
9368
9369
9370
9371
9372
9373
9374
9375
9376
9377
9378
9379
9380
9381
9382
9383
9384
9385
9386
9387
9388
9389
9390
9391
9392
9393
9394
9395
9396
9397
9398
9399
9400
9401
9402
9403
9404
9405
9406
9407
9408
9409
9410
9411
9412
9413
9414
9415
9416
9417
9418
9419
9420
9421
9422
9423
9424
9425
9426
9427
9428
9429
9430
9431
9432
9433
9434
9435
9436
9437
9438
9439
9440
9441
9442
9443
9444
9445
9446
9447
9448
9449
9450
9451
9452
9453
9454
9455
9456
9457
9458
9459
9460
9461
9462
9463
9464
9465
9466
9467
9468
9469
9470
9471
9472
9473
9474
9475
9476
9477
9478
9479
9480
9481
9482
9483
9484
9485
9486
9487
9488
9489
9490
9491
9492
9493
9494
9495
9496
9497
9498
9499
9500
9501
9502
9503
9504
9505
9506
9507
9508
9509
9510
9511
9512
9513
9514
9515
9516
9517
9518
9519
9520
9521
9522
9523
9524
9525
9526
9527
9528
9529
9530
9531
9532
9533
9534
9535
9536
9537
9538
9539
9540
9541
9542
9543
9544
9545
9546
9547
9548
9549
9550
9551
9552
9553
9554
9555
9556
9557
9558
9559
9560
9561
9562
9563
9564
9565
9566
9567
9568
9569
9570
9571
9572
9573
9574
9575
9576
9577
9578
9579
9580
9581
9582
9583
9584
9585
9586
9587
9588
9589
9590
9591
9592
9593
9594
9595
9596
9597
9598
9599
9600
9601
9602
9603
9604
9605
9606
9607
9608
9609
9610
9611
9612
9613
9614
9615
9616
9617
9618
9619
9620
9621
9622
9623
9624
9625
9626
9627
9628
9629
9630
9631
9632
9633
9634
9635
9636
9637
9638
9639
9640
9641
9642
9643
9644
9645
9646
9647
9648
9649
9650
9651
9652
9653
9654
9655
9656
9657
9658
9659
9660
9661
9662
9663
9664
9665
9666
9667
9668
9669
9670
9671
9672
9673
9674
9675
9676
9677
9678
9679
9680
9681
9682
9683
9684
9685
9686
9687
9688
9689
9690
9691
9692
9693
9694
9695
9696
9697
9698
9699
9700
9701
9702
9703
9704
9705
9706
9707
9708
9709
9710
9711
9712
9713
9714
9715
9716
9717
9718
9719
9720
9721
9722
9723
9724
9725
9726
9727
9728
9729
9730
9731
9732
9733
9734
9735
9736
9737
9738
9739
9740
9741
9742
9743
9744
9745
9746
9747
9748
9749
9750
9751
9752
9753
9754
9755
9756
9757
9758
9759
9760
9761
9762
9763
9764
9765
9766
9767
9768
9769
9770
9771
9772
9773
9774
9775
9776
9777
9778
9779
9780
9781
9782
9783
9784
9785
9786
9787
9788
9789
9790
9791
9792
9793
9794
9795
9796
9797
9798
9799
9800
9801
9802
9803
9804
9805
9806
9807
9808
9809
9810
9811
9812
9813
9814
9815
9816
9817
9818
9819
9820
9821
9822
9823
9824
9825
9826
9827
9828
9829
9830
9831
9832
9833
9834
9835
9836
9837
9838
9839
9840
9841
9842
9843
9844
9845
9846
9847
9848
9849
9850
9851
9852
9853
9854
9855
9856
9857
9858
9859
9860
9861
9862
9863
9864
9865
9866
9867
9868
9869
9870
9871
9872
9873
9874
9875
9876
9877
9878
9879
9880
9881
9882
9883
9884
9885
9886
9887
9888
9889
9890
9891
9892
9893
9894
9895
9896
9897
9898
9899
9900
9901
9902
9903
9904
9905
9906
9907
9908
9909
9910
9911
9912
9913
9914
9915
9916
9917
9918
9919
9920
9921
9922
9923
9924
9925
9926
9927
9928
9929
9930
9931
9932
9933
9934
9935
9936
9937
9938
9939
9940
9941
9942
9943
9944
9945
9946
9947
9948
9949
9950
9951
9952
9953
9954
9955
9956
9957
9958
9959
9960
9961
9962
9963
9964
9965
9966
9967
9968
9969
9970
9971
9972
9973
9974
9975
9976
9977
9978
9979
9980
9981
9982
9983
9984
9985
9986
9987
9988
9989
9990
9991
9992
9993
9994
9995
9996
9997
9998
9999
10000
10001
10002
10003
10004
10005
10006
10007
10008
10009
10010
10011
10012
10013
10014
10015
10016
10017
10018
10019
10020
10021
10022
10023
10024
10025
10026
10027
10028
10029
10030
10031
10032
10033
10034
10035
10036
10037
10038
10039
10040
10041
10042
10043
10044
10045
10046
10047
10048
10049
10050
10051
10052
10053
10054
10055
10056
10057
10058
10059
10060
10061
10062
10063
10064
10065
10066
10067
10068
10069
10070
10071
10072
10073
10074
10075
10076
10077
10078
10079
10080
10081
10082
10083
10084
10085
10086
10087
10088
10089
10090
10091
10092
10093
10094
10095
10096
10097
10098
10099
10100
10101
10102
10103
10104
10105
10106
10107
10108
10109
10110
10111
10112
10113
10114
10115
10116
10117
10118
10119
10120
10121
10122
10123
10124
10125
10126
10127
10128
10129
10130
10131
10132
10133
10134
10135
10136
10137
10138
10139
10140
10141
10142
10143
10144
10145
10146
10147
10148
10149
10150
10151
10152
10153
10154
10155
10156
10157
10158
10159
10160
10161
10162
10163
10164
10165
10166
10167
10168
10169
10170
10171
10172
10173
10174
10175
10176
10177
10178
10179
10180
10181
10182
10183
10184
10185
10186
10187
10188
10189
10190
10191
10192
10193
10194
10195
10196
10197
10198
10199
10200
10201
10202
10203
10204
10205
10206
10207
10208
10209
10210
10211
10212
10213
10214
10215
10216
10217
10218
10219
10220
10221
10222
10223
10224
10225
10226
10227
10228
10229
10230
10231
10232
10233
10234
10235
10236
10237
10238
10239
10240
10241
10242
10243
10244
10245
10246
10247
10248
10249
10250
10251
10252
10253
10254
10255
10256
10257
10258
10259
10260
10261
10262
10263
10264
10265
10266
10267
10268
10269
10270
10271
10272
10273
10274
10275
10276
10277
10278
10279
10280
10281
10282
10283
10284
10285
10286
10287
10288
10289
10290
10291
10292
10293
10294
10295
10296
10297
10298
10299
10300
10301
10302
10303
10304
10305
10306
10307
10308
10309
10310
10311
10312
10313
10314
10315
10316
10317
10318
10319
10320
10321
10322
10323
10324
10325
10326
10327
10328
10329
10330
10331
10332
10333
10334
10335
10336
10337
10338
10339
10340
10341
10342
10343
10344
10345
10346
10347
10348
10349
10350
10351
10352
10353
10354
10355
10356
10357
10358
10359
10360
10361
10362
10363
10364
10365
10366
10367
10368
10369
10370
10371
10372
10373
10374
10375
10376
10377
10378
10379
10380
10381
10382
10383
10384
10385
10386
10387
10388
10389
10390
10391
10392
10393
10394
10395
10396
10397
10398
10399
10400
10401
10402
10403
10404
10405
10406
10407
10408
10409
10410
10411
10412
10413
10414
10415
10416
10417
10418
10419
10420
10421
10422
10423
10424
10425
10426
10427
10428
10429
10430
10431
10432
10433
10434
10435
10436
10437
10438
10439
10440
10441
10442
10443
10444
10445
10446
10447
10448
10449
10450
10451
10452
10453
10454
10455
10456
10457
10458
10459
10460
10461
10462
10463
10464
10465
10466
10467
10468
10469
10470
10471
10472
10473
10474
10475
10476
10477
10478
10479
10480
10481
10482
10483
10484
10485
10486
10487
10488
10489
10490
10491
10492
10493
10494
10495
10496
10497
10498
10499
10500
10501
10502
10503
10504
10505
10506
10507
10508
10509
10510
10511
10512
10513
10514
10515
10516
10517
10518
10519
10520
10521
10522
10523
10524
10525
10526
10527
10528
10529
10530
10531
10532
10533
10534
10535
10536
10537
10538
10539
10540
10541
10542
10543
10544
10545
10546
10547
10548
10549
10550
10551
10552
10553
10554
10555
10556
10557
10558
10559
10560
10561
10562
10563
10564
10565
10566
10567
10568
10569
10570
10571
10572
10573
10574
10575
10576
10577
10578
10579
10580
10581
10582
10583
10584
10585
10586
10587
10588
10589
10590
10591
10592
10593
10594
10595
10596
10597
10598
10599
10600
10601
10602
10603
10604
10605
10606
10607
10608
10609
10610
10611
10612
10613
10614
10615
10616
10617
10618
10619
10620
10621
10622
10623
10624
10625
10626
10627
10628
10629
10630
10631
10632
10633
10634
10635
10636
10637
10638
10639
10640
10641
10642
10643
10644
10645
10646
10647
10648
10649
10650
10651
10652
10653
10654
10655
10656
10657
10658
10659
10660
10661
10662
10663
10664
10665
10666
10667
10668
10669
10670
10671
10672
10673
10674
10675
10676
10677
10678
10679
10680
10681
10682
10683
10684
10685
10686
10687
10688
10689
10690
10691
10692
10693
10694
10695
10696
10697
10698
10699
10700
10701
10702
10703
10704
10705
10706
10707
10708
10709
10710
10711
10712
10713
10714
10715
10716
10717
10718
10719
10720
10721
10722
10723
10724
10725
10726
10727
10728
10729
10730
10731
10732
10733
10734
10735
10736
10737
10738
10739
10740
10741
10742
10743
10744
10745
10746
10747
10748
10749
10750
10751
10752
10753
10754
10755
10756
10757
10758
10759
10760
10761
10762
10763
10764
10765
10766
10767
10768
10769
10770
10771
10772
10773
10774
10775
10776
10777
10778
10779
10780
10781
10782
10783
10784
10785
10786
10787
10788
10789
10790
10791
10792
10793
10794
10795
10796
10797
10798
10799
10800
10801
10802
10803
10804
10805
10806
10807
10808
10809
10810
10811
10812
10813
10814
10815
10816
10817
10818
10819
10820
10821
10822
10823
10824
10825
10826
10827
10828
10829
10830
10831
10832
10833
10834
10835
10836
10837
10838
10839
10840
10841
10842
10843
10844
10845
10846
10847
10848
10849
10850
10851
10852
10853
10854
10855
10856
10857
10858
10859
10860
10861
10862
10863
10864
10865
10866
10867
10868
10869
10870
10871
10872
10873
10874
10875
10876
10877
10878
10879
10880
10881
10882
10883
10884
10885
10886
10887
10888
10889
10890
10891
10892
10893
10894
10895
10896
10897
10898
10899
10900
10901
10902
10903
10904
10905
10906
10907
10908
10909
10910
10911
10912
10913
10914
10915
10916
10917
10918
10919
10920
10921
10922
10923
10924
10925
10926
10927
10928
10929
10930
10931
10932
10933
10934
10935
10936
10937
10938
10939
10940
10941
10942
10943
10944
10945
10946
10947
10948
10949
10950
10951
10952
10953
10954
10955
10956
10957
10958
10959
10960
10961
10962
10963
10964
10965
10966
10967
10968
10969
10970
10971
10972
10973
10974
10975
10976
10977
10978
10979
10980
10981
10982
10983
10984
10985
10986
10987
10988
10989
10990
10991
10992
10993
10994
10995
10996
10997
10998
10999
11000
11001
11002
11003
11004
11005
11006
11007
11008
11009
11010
11011
11012
11013
11014
11015
11016
11017
11018
11019
11020
11021
11022
11023
11024
11025
11026
11027
11028
11029
11030
11031
11032
11033
11034
11035
11036
11037
11038
11039
11040
11041
11042
11043
11044
11045
11046
11047
11048
11049
11050
11051
11052
11053
11054
11055
11056
11057
11058
11059
11060
11061
11062
11063
11064
11065
11066
11067
11068
11069
11070
11071
11072
11073
11074
11075
11076
11077
11078
11079
11080
11081
11082
11083
11084
11085
11086
11087
11088
11089
11090
11091
11092
11093
11094
11095
11096
11097
11098
11099
11100
11101
11102
11103
11104
11105
11106
11107
11108
11109
11110
11111
11112
11113
11114
11115
11116
11117
11118
11119
11120
11121
11122
11123
11124
11125
11126
11127
11128
11129
11130
11131
11132
11133
11134
11135
11136
11137
11138
11139
11140
11141
11142
11143
11144
11145
11146
11147
11148
11149
11150
11151
11152
11153
11154
11155
11156
11157
11158
11159
11160
11161
11162
11163
11164
11165
11166
11167
11168
11169
11170
11171
11172
11173
11174
11175
11176
11177
11178
11179
11180
11181
11182
11183
11184
11185
11186
11187
11188
11189
11190
11191
11192
11193
11194
11195
11196
11197
11198
11199
11200
11201
11202
11203
11204
11205
11206
11207
11208
11209
11210
11211
11212
11213
11214
11215
11216
11217
11218
11219
11220
11221
11222
11223
11224
11225
11226
11227
11228
11229
11230
11231
11232
11233
11234
11235
11236
11237
11238
11239
11240
11241
11242
11243
11244
11245
11246
11247
11248
11249
11250
11251
11252
11253
11254
11255
11256
11257
11258
11259
11260
11261
11262
11263
11264
11265
11266
11267
11268
11269
11270
11271
11272
11273
11274
11275
11276
11277
11278
11279
11280
11281
11282
11283
11284
11285
11286
11287
11288
11289
11290
11291
11292
11293
11294
11295
11296
11297
11298
11299
11300
11301
11302
11303
11304
11305
11306
11307
11308
11309
11310
11311
11312
11313
11314
11315
11316
11317
11318
11319
11320
11321
11322
11323
11324
11325
11326
11327
11328
11329
11330
11331
11332
11333
11334
11335
11336
11337
11338
11339
11340
11341
11342
11343
11344
11345
11346
11347
11348
11349
11350
11351
11352
11353
11354
11355
11356
11357
11358
11359
11360
11361
11362
11363
11364
11365
11366
11367
11368
11369
11370
11371
11372
11373
11374
11375
11376
11377
11378
11379
11380
11381
11382
11383
11384
11385
11386
11387
11388
11389
11390
11391
11392
11393
11394
11395
11396
11397
11398
11399
11400
11401
11402
11403
11404
11405
11406
11407
11408
11409
11410
11411
11412
11413
11414
11415
11416
11417
11418
11419
11420
11421
11422
11423
11424
11425
11426
11427
11428
11429
11430
11431
11432
11433
11434
11435
11436
11437
11438
11439
11440
11441
11442
11443
11444
11445
11446
11447
11448
11449
11450
11451
11452
11453
11454
11455
11456
11457
11458
11459
11460
11461
11462
11463
11464
11465
11466
11467
11468
11469
11470
11471
11472
11473
11474
11475
11476
11477
11478
11479
11480
11481
11482
11483
11484
11485
11486
11487
11488
11489
11490
11491
11492
11493
11494
11495
11496
11497
11498
11499
11500
11501
11502
11503
11504
11505
11506
11507
11508
11509
11510
11511
11512
11513
11514
11515
11516
11517
11518
11519
11520
11521
11522
11523
11524
11525
11526
11527
11528
11529
11530
11531
11532
11533
11534
11535
11536
11537
11538
11539
11540
11541
11542
11543
11544
11545
11546
11547
11548
11549
11550
11551
11552
11553
11554
11555
11556
11557
11558
11559
11560
11561
11562
11563
11564
11565
11566
11567
11568
11569
11570
11571
11572
11573
11574
11575
11576
11577
11578
11579
11580
11581
11582
11583
11584
11585
11586
11587
11588
11589
11590
11591
11592
11593
11594
11595
11596
11597
11598
11599
11600
11601
11602
11603
11604
11605
11606
11607
11608
11609
11610
11611
11612
11613
11614
11615
11616
11617
11618
11619
11620
11621
11622
11623
11624
11625
11626
11627
11628
11629
11630
11631
11632
11633
11634
11635
11636
11637
11638
11639
11640
11641
11642
11643
11644
11645
11646
11647
11648
11649
11650
11651
11652
11653
11654
11655
11656
11657
11658
11659
11660
11661
11662
11663
11664
11665
11666
11667
11668
11669
11670
11671
11672
11673
11674
11675
11676
11677
11678
11679
11680
11681
11682
11683
11684
11685
11686
11687
11688
11689
11690
11691
11692
11693
11694
11695
11696
11697
11698
11699
11700
11701
11702
11703
11704
11705
11706
11707
11708
11709
11710
11711
11712
11713
11714
11715
11716
11717
11718
11719
11720
11721
11722
11723
11724
11725
11726
11727
11728
11729
11730
11731
11732
11733
11734
11735
11736
11737
11738
11739
11740
11741
11742
11743
11744
11745
11746
11747
11748
11749
11750
11751
11752
11753
11754
11755
11756
11757
11758
11759
11760
11761
11762
11763
11764
11765
11766
11767
11768
11769
11770
11771
11772
11773
11774
11775
11776
11777
11778
11779
11780
11781
11782
11783
11784
11785
11786
11787
11788
11789
11790
11791
11792
11793
11794
11795
11796
11797
11798
11799
11800
11801
11802
11803
11804
11805
11806
11807
11808
11809
11810
11811
11812
11813
11814
11815
11816
11817
11818
11819
11820
11821
11822
11823
11824
11825
11826
11827
11828
11829
11830
11831
11832
11833
11834
11835
11836
11837
11838
11839
11840
11841
11842
11843
11844
11845
11846
11847
11848
11849
11850
11851
11852
11853
11854
11855
11856
11857
11858
11859
11860
11861
11862
11863
11864
11865
11866
11867
11868
11869
11870
11871
11872
11873
11874
11875
11876
11877
11878
11879
11880
11881
11882
11883
11884
11885
11886
11887
11888
11889
11890
11891
11892
11893
11894
11895
11896
11897
11898
11899
11900
11901
11902
11903
11904
11905
11906
11907
11908
11909
11910
11911
11912
11913
11914
11915
11916
11917
11918
11919
11920
11921
11922
11923
11924
11925
11926
11927
11928
11929
11930
11931
11932
11933
11934
11935
11936
11937
11938
11939
11940
11941
11942
11943
11944
11945
11946
11947
11948
11949
11950
11951
11952
11953
11954
11955
11956
11957
11958
11959
11960
11961
11962
11963
11964
11965
11966
11967
11968
11969
11970
11971
11972
11973
11974
11975
11976
11977
11978
11979
11980
11981
11982
11983
11984
11985
11986
11987
11988
11989
11990
11991
11992
11993
11994
11995
11996
11997
11998
11999
12000
12001
12002
12003
12004
12005
12006
12007
12008
12009
12010
12011
12012
12013
12014
12015
12016
12017
12018
12019
12020
12021
12022
12023
12024
12025
12026
12027
12028
12029
12030
12031
12032
12033
12034
12035
12036
12037
12038
12039
12040
12041
12042
12043
12044
12045
12046
12047
12048
12049
12050
12051
12052
12053
12054
12055
12056
12057
12058
12059
12060
12061
12062
12063
12064
12065
12066
12067
12068
12069
12070
12071
12072
12073
12074
12075
12076
12077
12078
12079
12080
12081
12082
12083
12084
12085
12086
12087
12088
12089
12090
12091
12092
12093
12094
12095
12096
12097
12098
12099
12100
12101
12102
12103
12104
12105
12106
12107
12108
12109
12110
12111
12112
12113
12114
12115
12116
12117
12118
12119
12120
12121
12122
12123
12124
12125
12126
12127
12128
12129
12130
12131
12132
12133
12134
12135
12136
12137
12138
12139
12140
12141
12142
12143
12144
12145
12146
12147
12148
12149
12150
12151
12152
12153
12154
12155
12156
12157
12158
12159
12160
12161
12162
12163
12164
12165
12166
12167
12168
12169
12170
12171
12172
12173
12174
12175
12176
12177
12178
12179
12180
12181
12182
12183
12184
12185
12186
12187
12188
12189
12190
12191
12192
12193
12194
12195
12196
12197
12198
12199
12200
12201
12202
12203
12204
12205
12206
12207
12208
12209
12210
12211
12212
12213
12214
12215
12216
12217
12218
12219
12220
12221
12222
12223
12224
12225
12226
12227
12228
12229
12230
12231
12232
12233
12234
12235
12236
12237
12238
12239
12240
12241
12242
12243
12244
12245
12246
12247
12248
12249
12250
12251
12252
12253
12254
12255
12256
12257
12258
12259
12260
12261
12262
12263
12264
12265
12266
12267
12268
12269
12270
12271
12272
12273
12274
12275
12276
12277
12278
12279
12280
12281
12282
12283
12284
12285
12286
12287
12288
12289
12290
12291
12292
12293
12294
12295
12296
12297
12298
12299
12300
12301
12302
12303
12304
12305
12306
12307
12308
12309
12310
12311
12312
12313
12314
12315
12316
12317
12318
12319
12320
12321
12322
12323
12324
12325
12326
12327
12328
12329
12330
12331
12332
12333
12334
12335
12336
12337
12338
12339
12340
12341
12342
12343
12344
12345
12346
12347
12348
12349
12350
12351
12352
12353
12354
12355
12356
12357
12358
12359
12360
12361
12362
12363
12364
12365
12366
12367
12368
12369
12370
12371
12372
12373
12374
12375
12376
12377
12378
12379
12380
12381
12382
12383
12384
12385
12386
12387
12388
12389
12390
12391
12392
12393
12394
12395
12396
12397
12398
12399
12400
12401
12402
12403
12404
12405
12406
12407
12408
12409
12410
12411
12412
12413
12414
12415
12416
12417
12418
12419
12420
12421
12422
12423
12424
12425
12426
12427
12428
12429
12430
12431
12432
12433
12434
12435
12436
12437
12438
12439
12440
12441
12442
12443
12444
12445
12446
12447
12448
12449
12450
12451
12452
12453
12454
12455
12456
12457
12458
12459
12460
12461
12462
12463
12464
12465
12466
12467
12468
12469
12470
12471
12472
12473
12474
12475
12476
12477
12478
12479
12480
12481
12482
12483
12484
12485
12486
12487
12488
12489
12490
12491
12492
12493
12494
12495
12496
12497
12498
12499
12500
12501
12502
12503
12504
12505
12506
12507
12508
12509
12510
12511
12512
12513
12514
12515
12516
12517
12518
12519
12520
12521
12522
12523
12524
12525
12526
12527
12528
12529
12530
12531
12532
12533
12534
12535
12536
12537
12538
12539
12540
12541
12542
12543
12544
12545
12546
12547
12548
12549
12550
12551
12552
12553
12554
12555
12556
12557
12558
12559
12560
12561
12562
12563
12564
12565
12566
12567
12568
12569
12570
12571
12572
12573
12574
12575
12576
12577
12578
12579
12580
12581
12582
12583
12584
12585
12586
12587
12588
12589
12590
12591
12592
12593
12594
12595
12596
12597
12598
12599
12600
12601
12602
12603
12604
12605
12606
12607
12608
12609
12610
12611
12612
12613
12614
12615
12616
12617
12618
12619
12620
12621
12622
12623
12624
12625
12626
12627
12628
12629
12630
12631
12632
12633
12634
12635
12636
12637
12638
12639
12640
12641
12642
12643
12644
12645
12646
12647
12648
12649
12650
12651
12652
12653
12654
12655
12656
12657
12658
12659
12660
12661
12662
12663
12664
12665
12666
12667
12668
12669
12670
12671
12672
12673
12674
12675
12676
12677
12678
12679
12680
12681
12682
12683
12684
12685
12686
12687
12688
12689
12690
12691
12692
12693
12694
12695
12696
12697
12698
12699
12700
12701
12702
12703
12704
12705
12706
12707
12708
12709
12710
12711
12712
12713
12714
12715
12716
12717
12718
12719
12720
12721
12722
12723
12724
12725
12726
12727
12728
12729
12730
12731
12732
12733
12734
12735
12736
12737
12738
12739
12740
12741
12742
12743
12744
12745
12746
12747
12748
12749
12750
12751
12752
12753
12754
12755
12756
12757
12758
12759
12760
12761
12762
12763
12764
12765
12766
12767
12768
12769
12770
12771
12772
12773
12774
12775
12776
12777
12778
12779
12780
12781
12782
12783
12784
12785
12786
12787
12788
12789
12790
12791
12792
12793
12794
12795
12796
12797
12798
12799
12800
12801
12802
12803
12804
12805
12806
12807
12808
12809
12810
12811
12812
12813
12814
12815
12816
12817
12818
12819
12820
12821
12822
12823
12824
12825
12826
12827
12828
12829
12830
12831
12832
12833
12834
12835
12836
12837
12838
12839
12840
12841
12842
12843
12844
12845
12846
12847
12848
12849
12850
12851
12852
12853
12854
12855
12856
12857
12858
12859
12860
12861
12862
12863
12864
12865
12866
12867
12868
12869
12870
12871
12872
12873
12874
12875
12876
12877
12878
12879
12880
12881
12882
12883
12884
12885
12886
12887
12888
12889
12890
12891
12892
12893
12894
12895
12896
12897
12898
12899
12900
12901
12902
12903
12904
12905
12906
12907
12908
12909
12910
12911
12912
12913
12914
12915
12916
12917
12918
12919
12920
12921
12922
12923
12924
12925
12926
12927
12928
12929
12930
12931
12932
12933
12934
12935
12936
12937
12938
12939
12940
12941
12942
12943
12944
12945
12946
12947
12948
12949
12950
12951
12952
12953
12954
12955
12956
12957
12958
12959
12960
12961
12962
12963
12964
12965
12966
12967
12968
12969
12970
12971
12972
12973
12974
12975
12976
12977
12978
12979
12980
12981
12982
12983
12984
12985
12986
12987
12988
12989
12990
12991
12992
12993
12994
12995
12996
12997
12998
12999
13000
13001
13002
13003
13004
13005
13006
13007
13008
13009
13010
13011
13012
13013
13014
13015
13016
13017
13018
13019
13020
13021
13022
13023
13024
13025
13026
13027
13028
13029
13030
13031
13032
13033
13034
13035
13036
13037
13038
13039
13040
13041
13042
13043
13044
13045
13046
13047
13048
13049
13050
13051
13052
13053
13054
13055
13056
13057
13058
13059
13060
13061
13062
13063
13064
13065
13066
13067
13068
13069
13070
13071
13072
13073
13074
13075
13076
13077
13078
13079
13080
13081
13082
13083
13084
13085
13086
13087
13088
13089
13090
13091
13092
13093
13094
13095
13096
13097
13098
13099
13100
13101
13102
13103
13104
13105
13106
13107
13108
13109
13110
13111
13112
13113
13114
13115
13116
13117
13118
13119
13120
13121
13122
13123
13124
13125
13126
13127
13128
13129
13130
13131
13132
13133
13134
13135
13136
13137
13138
13139
13140
13141
13142
13143
13144
13145
13146
13147
13148
13149
13150
13151
13152
13153
13154
13155
13156
13157
13158
13159
13160
13161
13162
13163
13164
13165
13166
13167
13168
13169
13170
13171
13172
13173
13174
13175
13176
13177
13178
13179
13180
13181
13182
13183
13184
13185
13186
13187
13188
13189
13190
13191
13192
13193
13194
13195
13196
13197
13198
13199
13200
13201
13202
13203
13204
13205
13206
13207
13208
13209
13210
13211
13212
13213
13214
13215
13216
13217
13218
13219
13220
13221
13222
13223
13224
13225
13226
13227
13228
13229
13230
13231
13232
13233
13234
13235
13236
13237
13238
13239
13240
13241
13242
13243
13244
13245
13246
13247
13248
13249
13250
13251
13252
13253
13254
13255
13256
13257
13258
13259
13260
13261
13262
13263
13264
13265
13266
13267
13268
13269
13270
13271
13272
13273
13274
13275
13276
13277
13278
13279
13280
13281
13282
13283
13284
13285
13286
13287
13288
13289
13290
13291
13292
13293
13294
13295
13296
13297
13298
13299
13300
13301
13302
13303
13304
13305
13306
13307
13308
13309
13310
13311
13312
13313
13314
13315
13316
13317
13318
13319
13320
13321
13322
13323
13324
13325
13326
13327
13328
13329
13330
13331
13332
13333
13334
13335
13336
13337
13338
13339
13340
13341
13342
13343
13344
13345
13346
13347
13348
13349
13350
13351
13352
13353
13354
13355
13356
13357
13358
13359
13360
13361
13362
13363
13364
13365
13366
13367
13368
13369
13370
13371
13372
13373
13374
13375
13376
13377
13378
13379
13380
13381
13382
13383
13384
13385
13386
13387
13388
13389
13390
13391
13392
13393
13394
13395
13396
13397
13398
13399
13400
13401
13402
13403
13404
13405
13406
13407
13408
13409
13410
13411
13412
13413
13414
13415
13416
13417
13418
13419
13420
13421
13422
13423
13424
13425
13426
13427
13428
13429
13430
13431
13432
13433
13434
13435
13436
13437
13438
13439
13440
13441
13442
13443
13444
13445
13446
13447
13448
13449
13450
13451
13452
13453
13454
13455
13456
13457
13458
13459
13460
13461
13462
13463
13464
13465
13466
13467
13468
13469
13470
13471
13472
13473
13474
13475
13476
13477
13478
13479
13480
13481
13482
13483
13484
13485
13486
13487
13488
13489
13490
13491
13492
13493
13494
13495
13496
13497
13498
13499
13500
13501
13502
13503
13504
13505
13506
13507
13508
13509
13510
13511
13512
13513
13514
13515
13516
13517
13518
13519
13520
13521
13522
13523
13524
13525
13526
13527
13528
13529
13530
13531
13532
13533
13534
13535
13536
13537
13538
13539
13540
13541
13542
13543
13544
13545
13546
13547
13548
13549
13550
13551
13552
13553
13554
13555
13556
13557
13558
13559
13560
13561
13562
13563
13564
13565
13566
13567
13568
13569
13570
13571
13572
13573
13574
13575
13576
13577
13578
13579
13580
13581
13582
13583
13584
13585
13586
13587
13588
13589
13590
13591
13592
13593
13594
13595
13596
13597
13598
13599
13600
13601
13602
13603
13604
13605
13606
13607
13608
13609
13610
13611
13612
13613
13614
13615
13616
13617
13618
13619
13620
13621
13622
13623
13624
13625
13626
13627
13628
13629
13630
13631
13632
13633
13634
13635
13636
13637
13638
13639
13640
13641
13642
13643
13644
13645
13646
13647
13648
13649
13650
13651
13652
13653
13654
13655
13656
13657
13658
13659
13660
13661
13662
13663
13664
13665
13666
13667
13668
13669
13670
13671
13672
13673
13674
13675
13676
13677
13678
13679
13680
13681
13682
13683
13684
13685
13686
13687
13688
13689
13690
13691
13692
13693
13694
13695
13696
13697
13698
13699
13700
13701
13702
13703
13704
13705
13706
13707
13708
13709
13710
13711
13712
13713
13714
13715
13716
13717
13718
13719
13720
13721
13722
13723
13724
13725
13726
13727
13728
13729
13730
13731
13732
13733
13734
13735
13736
13737
13738
13739
13740
13741
13742
13743
13744
13745
13746
13747
13748
13749
13750
13751
13752
13753
13754
13755
13756
13757
13758
13759
13760
13761
13762
13763
13764
13765
13766
13767
13768
13769
13770
13771
13772
13773
13774
13775
13776
13777
13778
13779
13780
13781
13782
13783
13784
13785
13786
13787
13788
13789
13790
13791
13792
13793
13794
13795
13796
13797
13798
13799
13800
13801
13802
13803
13804
13805
13806
13807
13808
13809
13810
13811
13812
13813
13814
13815
13816
13817
13818
13819
13820
13821
13822
13823
13824
13825
13826
13827
13828
13829
13830
13831
13832
13833
13834
13835
13836
13837
13838
13839
13840
13841
13842
13843
13844
13845
13846
13847
13848
13849
13850
13851
13852
13853
13854
13855
13856
13857
13858
13859
13860
13861
13862
13863
13864
13865
13866
13867
13868
13869
13870
13871
13872
13873
13874
13875
13876
13877
13878
13879
13880
13881
13882
13883
13884
13885
13886
13887
13888
13889
13890
13891
13892
13893
13894
13895
13896
13897
13898
13899
13900
13901
13902
13903
13904
13905
13906
13907
13908
13909
13910
13911
13912
13913
13914
13915
13916
13917
13918
13919
13920
13921
13922
13923
13924
13925
13926
13927
13928
13929
13930
13931
13932
13933
13934
13935
13936
13937
13938
13939
13940
13941
13942
13943
13944
13945
13946
13947
13948
13949
13950
13951
13952
13953
13954
13955
13956
13957
13958
13959
13960
13961
13962
13963
13964
13965
13966
13967
13968
13969
13970
13971
13972
13973
13974
13975
13976
13977
13978
13979
13980
13981
13982
13983
13984
13985
13986
13987
13988
13989
13990
13991
13992
13993
13994
13995
13996
13997
13998
13999
14000
14001
14002
14003
14004
14005
14006
14007
14008
14009
14010
14011
14012
14013
14014
14015
14016
14017
14018
14019
14020
14021
14022
14023
14024
14025
14026
14027
14028
14029
14030
14031
14032
14033
14034
14035
14036
14037
14038
14039
14040
14041
14042
14043
14044
14045
14046
14047
14048
14049
14050
14051
14052
14053
14054
14055
14056
14057
14058
14059
14060
14061
14062
14063
14064
14065
14066
14067
14068
14069
14070
14071
14072
14073
14074
14075
14076
14077
14078
14079
14080
14081
14082
14083
14084
14085
14086
14087
14088
14089
14090
14091
14092
14093
14094
14095
14096
14097
14098
14099
14100
14101
14102
14103
14104
14105
14106
14107
14108
14109
14110
14111
14112
14113
14114
14115
14116
14117
14118
14119
14120
14121
14122
14123
14124
14125
14126
14127
14128
14129
14130
14131
14132
14133
14134
14135
14136
14137
14138
14139
14140
14141
14142
14143
14144
14145
14146
14147
14148
14149
14150
14151
14152
14153
14154
14155
14156
14157
14158
14159
14160
14161
14162
14163
14164
14165
14166
14167
14168
14169
14170
14171
14172
14173
14174
14175
14176
14177
14178
14179
14180
14181
14182
14183
14184
14185
14186
14187
14188
14189
14190
14191
14192
14193
14194
14195
14196
14197
14198
14199
14200
14201
14202
14203
14204
14205
14206
14207
14208
14209
14210
14211
14212
14213
14214
14215
14216
14217
14218
14219
14220
14221
14222
14223
14224
14225
14226
14227
14228
14229
14230
14231
14232
14233
14234
14235
14236
14237
14238
14239
14240
14241
14242
14243
14244
14245
14246
14247
14248
14249
14250
14251
14252
14253
14254
14255
14256
14257
14258
14259
14260
14261
14262
14263
14264
14265
14266
14267
14268
14269
14270
14271
14272
14273
14274
14275
14276
14277
14278
14279
14280
14281
14282
14283
14284
14285
14286
14287
14288
14289
14290
14291
14292
14293
14294
14295
14296
14297
14298
14299
14300
14301
14302
14303
14304
14305
14306
14307
14308
14309
14310
14311
14312
14313
14314
14315
14316
14317
14318
14319
14320
14321
14322
14323
14324
14325
14326
14327
14328
14329
14330
14331
14332
14333
14334
14335
14336
14337
14338
14339
14340
14341
14342
14343
14344
14345
14346
14347
14348
14349
14350
14351
14352
14353
14354
14355
14356
14357
14358
14359
14360
14361
14362
14363
14364
14365
14366
14367
14368
14369
14370
14371
14372
14373
14374
14375
14376
14377
14378
14379
14380
14381
14382
14383
14384
14385
14386
14387
14388
14389
14390
14391
14392
14393
14394
14395
14396
14397
14398
14399
14400
14401
14402
14403
14404
14405
14406
14407
14408
14409
14410
14411
14412
14413
14414
14415
14416
14417
14418
14419
14420
14421
14422
14423
14424
14425
14426
14427
14428
14429
14430
14431
14432
14433
14434
14435
14436
14437
14438
14439
14440
14441
14442
14443
14444
14445
14446
14447
14448
14449
14450
14451
14452
14453
14454
14455
14456
14457
14458
14459
14460
14461
14462
14463
14464
14465
14466
14467
14468
14469
14470
14471
14472
14473
14474
14475
14476
14477
14478
14479
14480
14481
14482
14483
14484
14485
14486
14487
14488
14489
14490
14491
14492
14493
14494
14495
14496
14497
14498
14499
14500
14501
14502
14503
14504
14505
14506
14507
14508
14509
14510
14511
14512
14513
14514
14515
14516
14517
14518
14519
14520
14521
14522
14523
14524
14525
14526
14527
14528
14529
14530
14531
14532
14533
14534
14535
14536
14537
14538
14539
14540
14541
14542
14543
14544
14545
14546
14547
14548
14549
14550
14551
14552
14553
14554
14555
14556
14557
14558
14559
14560
14561
14562
14563
14564
14565
14566
14567
14568
14569
14570
14571
14572
14573
14574
14575
14576
14577
14578
14579
14580
14581
14582
14583
14584
14585
14586
14587
14588
14589
14590
14591
14592
14593
14594
14595
14596
14597
14598
14599
14600
14601
14602
14603
14604
14605
14606
14607
14608
14609
14610
14611
14612
14613
14614
14615
14616
14617
14618
14619
14620
14621
14622
14623
14624
14625
14626
14627
14628
14629
14630
14631
14632
14633
14634
14635
14636
14637
14638
14639
14640
14641
14642
14643
14644
14645
14646
14647
14648
14649
14650
14651
14652
14653
14654
14655
14656
14657
14658
14659
14660
14661
14662
14663
14664
14665
14666
14667
14668
14669
14670
14671
14672
14673
14674
14675
14676
14677
14678
14679
14680
14681
14682
14683
14684
14685
14686
14687
14688
14689
14690
14691
14692
14693
14694
14695
14696
14697
14698
14699
14700
14701
14702
14703
14704
14705
14706
14707
14708
14709
14710
14711
14712
14713
14714
14715
14716
14717
14718
14719
14720
14721
14722
14723
14724
14725
14726
14727
14728
14729
14730
14731
14732
14733
14734
14735
14736
14737
14738
14739
14740
14741
14742
14743
14744
14745
14746
14747
14748
14749
14750
14751
14752
14753
14754
14755
14756
14757
14758
14759
14760
14761
14762
14763
14764
14765
14766
14767
14768
14769
14770
14771
14772
14773
14774
14775
14776
14777
14778
14779
14780
14781
14782
14783
14784
14785
14786
14787
14788
14789
14790
14791
14792
14793
14794
14795
14796
14797
14798
14799
14800
14801
14802
14803
14804
14805
14806
14807
14808
14809
14810
14811
14812
14813
14814
14815
14816
14817
14818
14819
14820
14821
14822
14823
14824
14825
14826
14827
14828
14829
14830
14831
14832
14833
14834
14835
14836
14837
14838
14839
14840
14841
14842
14843
14844
14845
14846
14847
14848
14849
14850
14851
14852
14853
14854
14855
14856
14857
14858
14859
14860
14861
14862
14863
14864
14865
14866
14867
14868
14869
14870
14871
14872
14873
14874
14875
14876
14877
14878
14879
14880
14881
14882
14883
14884
14885
14886
14887
14888
14889
14890
14891
14892
14893
14894
14895
14896
14897
14898
14899
14900
14901
14902
14903
14904
14905
14906
14907
14908
14909
14910
14911
14912
14913
14914
14915
14916
14917
14918
14919
14920
14921
14922
14923
14924
14925
14926
14927
14928
14929
14930
14931
14932
14933
14934
14935
14936
14937
14938
14939
14940
14941
14942
14943
14944
14945
14946
14947
14948
14949
14950
14951
14952
14953
14954
14955
14956
14957
14958
14959
14960
14961
14962
14963
14964
14965
14966
14967
14968
14969
14970
14971
14972
14973
14974
14975
14976
14977
14978
14979
14980
14981
14982
14983
14984
14985
14986
14987
14988
14989
14990
14991
14992
14993
14994
14995
14996
14997
14998
14999
15000
15001
15002
15003
15004
15005
15006
15007
15008
15009
15010
15011
15012
15013
15014
15015
15016
15017
15018
15019
15020
15021
15022
15023
15024
15025
15026
15027
15028
15029
15030
15031
15032
15033
15034
15035
15036
15037
15038
15039
15040
15041
15042
15043
15044
15045
15046
15047
15048
15049
15050
15051
15052
15053
15054
15055
15056
15057
15058
15059
15060
15061
15062
15063
15064
15065
15066
15067
15068
15069
15070
15071
15072
15073
15074
15075
15076
15077
15078
15079
15080
15081
15082
15083
15084
15085
15086
15087
15088
15089
15090
15091
15092
15093
15094
15095
15096
15097
15098
15099
15100
15101
15102
15103
15104
15105
15106
15107
15108
15109
15110
15111
15112
15113
15114
15115
15116
15117
15118
15119
15120
15121
15122
15123
15124
15125
15126
15127
15128
15129
15130
15131
15132
15133
15134
15135
15136
15137
15138
15139
15140
15141
15142
15143
15144
15145
15146
15147
15148
15149
15150
15151
15152
15153
15154
15155
15156
15157
15158
15159
15160
15161
15162
15163
15164
15165
15166
15167
15168
15169
15170
15171
15172
15173
15174
15175
15176
15177
15178
15179
15180
15181
15182
15183
15184
15185
15186
15187
15188
15189
15190
15191
15192
15193
15194
15195
15196
15197
15198
15199
15200
15201
15202
15203
15204
15205
15206
15207
15208
15209
15210
15211
15212
15213
15214
15215
15216
15217
15218
15219
15220
15221
15222
15223
15224
15225
15226
15227
15228
15229
15230
15231
15232
15233
15234
15235
15236
15237
15238
15239
15240
15241
15242
15243
15244
15245
15246
15247
15248
15249
15250
15251
15252
15253
15254
15255
15256
15257
15258
15259
15260
15261
15262
15263
15264
15265
15266
15267
15268
15269
15270
15271
15272
15273
15274
15275
15276
15277
15278
15279
15280
15281
15282
15283
15284
15285
15286
15287
15288
15289
15290
15291
15292
15293
15294
15295
15296
15297
15298
15299
15300
15301
15302
15303
15304
15305
15306
15307
15308
15309
15310
15311
15312
15313
15314
15315
15316
15317
15318
15319
15320
15321
15322
15323
15324
15325
15326
15327
15328
15329
15330
15331
15332
15333
15334
15335
15336
15337
15338
15339
15340
15341
15342
15343
15344
15345
15346
15347
15348
15349
15350
15351
15352
15353
15354
15355
15356
15357
15358
15359
15360
15361
15362
15363
15364
15365
15366
15367
15368
15369
15370
15371
15372
15373
15374
15375
15376
15377
15378
15379
15380
15381
15382
15383
15384
15385
15386
15387
15388
15389
15390
15391
15392
15393
15394
15395
15396
15397
15398
15399
15400
15401
15402
15403
15404
15405
15406
15407
15408
15409
15410
15411
15412
15413
15414
15415
15416
15417
15418
15419
15420
15421
15422
15423
15424
15425
15426
15427
15428
15429
15430
15431
15432
15433
15434
15435
15436
15437
15438
15439
15440
15441
15442
15443
15444
15445
15446
15447
15448
15449
15450
15451
15452
15453
15454
15455
15456
15457
15458
15459
15460
15461
15462
15463
15464
15465
15466
15467
15468
15469
15470
15471
15472
15473
15474
15475
15476
15477
15478
15479
15480
15481
15482
15483
15484
15485
15486
15487
15488
15489
15490
15491
15492
15493
15494
15495
15496
15497
15498
15499
15500
15501
15502
15503
15504
15505
15506
15507
15508
15509
15510
15511
15512
15513
15514
15515
15516
15517
15518
15519
15520
15521
15522
15523
15524
15525
15526
15527
15528
15529
15530
15531
15532
15533
15534
15535
15536
15537
15538
15539
15540
15541
15542
15543
15544
15545
15546
15547
15548
15549
15550
15551
15552
15553
15554
15555
15556
15557
15558
15559
15560
15561
15562
15563
15564
15565
15566
15567
15568
15569
15570
15571
15572
15573
15574
15575
15576
15577
15578
15579
15580
15581
15582
15583
15584
15585
15586
15587
15588
15589
15590
15591
15592
15593
15594
15595
15596
15597
15598
15599
15600
15601
15602
15603
15604
15605
15606
15607
15608
15609
15610
15611
15612
15613
15614
15615
15616
15617
15618
15619
15620
15621
15622
15623
15624
15625
15626
15627
15628
15629
15630
15631
15632
15633
15634
15635
15636
15637
15638
15639
15640
15641
15642
15643
15644
15645
15646
15647
15648
15649
15650
15651
15652
15653
15654
15655
15656
15657
15658
15659
15660
15661
15662
15663
15664
15665
15666
15667
15668
15669
15670
15671
15672
15673
15674
15675
15676
15677
15678
15679
15680
15681
15682
15683
15684
15685
15686
15687
15688
15689
15690
15691
15692
15693
15694
15695
15696
15697
15698
15699
15700
15701
15702
15703
15704
15705
15706
15707
15708
15709
15710
15711
15712
15713
15714
15715
15716
15717
15718
15719
15720
15721
15722
15723
15724
15725
15726
15727
15728
15729
15730
15731
15732
15733
15734
15735
15736
15737
15738
15739
15740
15741
15742
15743
15744
15745
15746
15747
15748
15749
15750
15751
15752
15753
15754
15755
15756
15757
15758
15759
15760
15761
15762
15763
15764
15765
15766
15767
15768
15769
15770
15771
15772
15773
15774
15775
15776
15777
15778
15779
15780
15781
15782
15783
15784
15785
15786
15787
15788
15789
15790
15791
15792
15793
15794
15795
15796
15797
15798
15799
15800
15801
15802
15803
15804
15805
15806
15807
15808
15809
15810
15811
15812
15813
15814
15815
15816
15817
15818
15819
15820
15821
15822
15823
15824
15825
15826
15827
15828
15829
15830
15831
15832
15833
15834
15835
15836
15837
15838
15839
15840
15841
15842
15843
15844
15845
15846
15847
15848
15849
15850
15851
15852
15853
15854
15855
15856
15857
15858
15859
15860
15861
15862
15863
15864
15865
15866
15867
15868
15869
15870
15871
15872
15873
15874
15875
15876
15877
15878
15879
15880
15881
15882
15883
15884
15885
15886
15887
15888
15889
15890
15891
15892
15893
15894
15895
15896
15897
15898
15899
15900
15901
15902
15903
15904
15905
15906
15907
15908
15909
15910
15911
15912
15913
15914
15915
15916
15917
15918
15919
15920
15921
15922
15923
15924
15925
15926
15927
15928
15929
15930
15931
15932
15933
15934
15935
15936
15937
15938
15939
15940
15941
15942
15943
15944
15945
15946
15947
15948
15949
15950
15951
15952
15953
15954
15955
15956
15957
15958
15959
15960
15961
15962
15963
15964
15965
15966
15967
15968
15969
15970
15971
15972
15973
15974
15975
15976
15977
15978
15979
15980
15981
15982
15983
15984
15985
15986
15987
15988
15989
15990
15991
15992
15993
15994
15995
15996
15997
15998
15999
16000
16001
16002
16003
16004
16005
16006
16007
16008
16009
16010
16011
16012
16013
16014
16015
16016
16017
16018
16019
16020
16021
16022
16023
16024
16025
16026
16027
16028
16029
16030
16031
16032
16033
16034
16035
16036
16037
16038
16039
16040
16041
16042
16043
16044
16045
16046
16047
16048
16049
16050
16051
16052
16053
16054
16055
16056
16057
16058
16059
16060
16061
16062
16063
16064
16065
16066
16067
16068
16069
16070
16071
16072
16073
16074
16075
16076
16077
16078
16079
16080
16081
16082
16083
16084
16085
16086
16087
16088
16089
16090
16091
16092
16093
16094
16095
16096
16097
16098
16099
16100
16101
16102
16103
16104
16105
16106
16107
16108
16109
16110
16111
16112
16113
16114
16115
16116
16117
16118
16119
16120
16121
16122
16123
16124
16125
16126
16127
16128
16129
16130
16131
16132
16133
16134
16135
16136
16137
16138
16139
16140
16141
16142
16143
16144
16145
16146
16147
16148
16149
16150
16151
16152
16153
16154
16155
16156
16157
16158
16159
16160
16161
16162
16163
16164
16165
16166
16167
16168
16169
16170
16171
16172
16173
16174
16175
16176
16177
16178
16179
16180
16181
16182
16183
16184
16185
16186
16187
16188
16189
16190
16191
16192
16193
16194
16195
16196
16197
16198
16199
16200
16201
16202
16203
16204
16205
16206
16207
16208
16209
16210
16211
16212
16213
16214
16215
16216
16217
16218
16219
16220
16221
16222
16223
16224
16225
16226
16227
16228
16229
16230
16231
16232
16233
16234
16235
16236
16237
16238
16239
16240
16241
16242
16243
16244
16245
16246
16247
16248
16249
16250
16251
16252
16253
16254
16255
16256
16257
16258
16259
16260
16261
16262
16263
16264
16265
16266
16267
16268
16269
16270
16271
16272
16273
16274
16275
16276
16277
16278
16279
16280
16281
16282
16283
16284
16285
16286
16287
16288
16289
16290
16291
16292
16293
16294
16295
16296
16297
16298
16299
16300
16301
16302
16303
16304
16305
16306
16307
16308
16309
16310
16311
16312
16313
16314
16315
16316
16317
16318
16319
16320
16321
16322
16323
16324
16325
16326
16327
16328
16329
16330
16331
16332
16333
16334
16335
16336
16337
16338
16339
16340
16341
16342
16343
16344
16345
16346
16347
16348
16349
16350
16351
16352
16353
16354
16355
16356
16357
16358
16359
16360
16361
16362
16363
16364
16365
16366
16367
16368
16369
16370
16371
16372
16373
16374
16375
16376
16377
16378
16379
16380
16381
16382
16383
16384
16385
16386
16387
16388
16389
16390
16391
16392
16393
16394
16395
16396
16397
16398
16399
16400
16401
16402
16403
16404
16405
16406
16407
16408
16409
16410
16411
16412
16413
16414
16415
16416
16417
16418
16419
16420
16421
16422
16423
16424
16425
16426
16427
16428
16429
16430
16431
16432
16433
16434
16435
16436
16437
16438
16439
16440
16441
16442
16443
16444
16445
16446
16447
16448
16449
16450
16451
16452
16453
16454
16455
16456
16457
16458
16459
16460
16461
16462
16463
16464
16465
16466
16467
16468
16469
16470
16471
16472
16473
16474
16475
16476
16477
16478
16479
16480
16481
16482
16483
16484
16485
16486
16487
16488
16489
16490
16491
16492
16493
16494
16495
16496
16497
16498
16499
16500
16501
16502
16503
16504
16505
16506
16507
16508
16509
16510
16511
16512
16513
16514
16515
16516
16517
16518
16519
16520
16521
16522
16523
16524
16525
16526
16527
16528
16529
16530
16531
16532
16533
16534
16535
16536
16537
16538
16539
16540
16541
16542
16543
16544
16545
16546
16547
16548
16549
16550
16551
16552
16553
16554
16555
16556
16557
16558
16559
16560
16561
16562
16563
16564
16565
16566
16567
16568
16569
16570
16571
16572
16573
16574
16575
16576
16577
16578
16579
16580
16581
16582
16583
16584
16585
16586
16587
16588
16589
16590
16591
16592
16593
16594
16595
16596
16597
16598
16599
16600
16601
16602
16603
16604
16605
16606
16607
16608
16609
16610
16611
16612
16613
16614
16615
16616
16617
16618
16619
16620
16621
16622
16623
16624
16625
16626
16627
16628
16629
16630
16631
16632
16633
16634
16635
16636
16637
16638
16639
16640
16641
16642
16643
16644
16645
16646
16647
16648
16649
16650
16651
16652
16653
16654
16655
16656
16657
16658
16659
16660
16661
16662
16663
16664
16665
16666
16667
16668
16669
16670
16671
16672
16673
16674
16675
16676
16677
16678
16679
16680
16681
16682
16683
16684
16685
16686
16687
16688
16689
16690
16691
16692
16693
16694
16695
16696
16697
16698
16699
16700
16701
16702
16703
16704
16705
16706
16707
16708
16709
16710
16711
16712
16713
16714
16715
16716
16717
16718
16719
16720
16721
16722
16723
16724
16725
16726
16727
16728
16729
16730
16731
16732
16733
16734
16735
16736
16737
16738
16739
16740
16741
16742
16743
16744
16745
16746
16747
16748
16749
16750
16751
16752
16753
16754
16755
16756
16757
16758
16759
16760
16761
16762
16763
16764
16765
16766
16767
16768
16769
16770
16771
16772
16773
16774
16775
16776
16777
16778
16779
16780
16781
16782
16783
16784
16785
16786
16787
16788
16789
16790
16791
16792
16793
16794
16795
16796
16797
16798
16799
16800
16801
16802
16803
16804
16805
16806
16807
16808
16809
16810
16811
16812
16813
16814
16815
16816
16817
16818
16819
16820
16821
16822
16823
16824
16825
16826
16827
16828
16829
16830
16831
16832
16833
16834
16835
16836
16837
16838
16839
16840
16841
16842
16843
16844
16845
16846
16847
16848
16849
16850
16851
16852
16853
16854
16855
16856
16857
16858
16859
16860
16861
16862
16863
16864
16865
16866
16867
16868
16869
16870
16871
16872
16873
16874
16875
16876
16877
16878
16879
16880
16881
16882
16883
16884
16885
16886
16887
16888
16889
16890
16891
16892
16893
16894
16895
16896
16897
16898
16899
16900
16901
16902
16903
16904
16905
16906
16907
16908
16909
16910
16911
16912
16913
16914
16915
16916
16917
16918
16919
16920
16921
16922
16923
16924
16925
16926
16927
16928
16929
16930
16931
16932
16933
16934
16935
16936
16937
16938
16939
16940
16941
16942
16943
16944
16945
16946
16947
16948
16949
16950
16951
16952
16953
16954
16955
16956
16957
16958
16959
16960
16961
16962
16963
16964
16965
16966
16967
16968
16969
16970
16971
16972
16973
16974
16975
16976
16977
16978
16979
16980
16981
16982
16983
16984
16985
16986
16987
16988
16989
16990
16991
16992
16993
16994
16995
16996
16997
16998
16999
17000
17001
17002
17003
17004
17005
17006
17007
17008
17009
17010
17011
17012
17013
17014
17015
17016
17017
17018
17019
17020
17021
17022
17023
17024
17025
17026
17027
17028
17029
17030
17031
17032
17033
17034
17035
17036
17037
17038
17039
17040
17041
17042
17043
17044
17045
17046
17047
17048
17049
17050
17051
17052
17053
17054
17055
17056
17057
17058
17059
17060
17061
17062
17063
17064
17065
17066
17067
17068
17069
17070
17071
17072
17073
17074
17075
17076
17077
17078
17079
17080
17081
17082
17083
17084
17085
17086
17087
17088
17089
17090
17091
17092
17093
17094
17095
17096
17097
17098
17099
17100
17101
17102
17103
17104
17105
17106
17107
17108
17109
17110
17111
17112
17113
17114
17115
17116
17117
17118
17119
17120
17121
17122
17123
17124
17125
17126
17127
17128
17129
17130
17131
17132
17133
17134
17135
17136
17137
17138
17139
17140
17141
17142
17143
17144
17145
17146
17147
17148
17149
17150
17151
17152
17153
17154
17155
17156
17157
17158
17159
17160
17161
17162
17163
17164
17165
17166
17167
17168
17169
17170
17171
17172
17173
17174
17175
17176
17177
17178
17179
17180
17181
17182
17183
17184
17185
17186
17187
17188
17189
17190
17191
17192
17193
17194
17195
17196
17197
17198
17199
17200
17201
17202
17203
17204
17205
17206
17207
17208
17209
17210
17211
17212
17213
17214
17215
17216
17217
17218
17219
17220
17221
17222
17223
17224
17225
17226
17227
17228
17229
17230
17231
17232
17233
17234
17235
17236
17237
17238
17239
17240
17241
17242
17243
17244
17245
17246
17247
17248
17249
17250
17251
17252
17253
17254
17255
17256
17257
17258
17259
17260
17261
17262
17263
17264
17265
17266
17267
17268
17269
17270
17271
17272
17273
17274
17275
17276
17277
17278
17279
17280
17281
17282
17283
17284
17285
17286
17287
17288
17289
17290
17291
17292
17293
17294
17295
17296
17297
17298
17299
17300
17301
17302
17303
17304
17305
17306
17307
17308
17309
17310
17311
17312
17313
17314
17315
17316
17317
17318
17319
17320
17321
17322
17323
17324
17325
17326
17327
17328
17329
17330
17331
17332
17333
17334
17335
17336
17337
17338
17339
17340
17341
17342
17343
17344
17345
17346
17347
17348
17349
17350
17351
17352
17353
17354
17355
17356
17357
17358
17359
17360
17361
17362
17363
17364
17365
17366
17367
17368
17369
17370
17371
17372
17373
17374
17375
17376
17377
17378
17379
17380
17381
17382
17383
17384
17385
17386
17387
17388
17389
17390
17391
17392
17393
17394
17395
17396
17397
17398
17399
17400
17401
17402
17403
17404
17405
17406
17407
17408
17409
17410
17411
17412
17413
17414
17415
17416
17417
17418
17419
17420
17421
17422
17423
17424
17425
17426
17427
17428
17429
17430
17431
17432
17433
17434
17435
17436
17437
17438
17439
17440
17441
17442
17443
17444
17445
17446
17447
17448
17449
17450
17451
17452
17453
17454
17455
17456
17457
17458
17459
17460
17461
17462
17463
17464
17465
17466
17467
17468
17469
17470
17471
17472
17473
17474
17475
17476
17477
17478
17479
17480
17481
17482
17483
17484
17485
17486
17487
17488
17489
17490
17491
17492
17493
17494
17495
17496
17497
17498
17499
17500
17501
17502
17503
17504
17505
17506
17507
17508
17509
17510
17511
17512
17513
17514
17515
17516
17517
17518
17519
17520
17521
17522
17523
17524
17525
17526
17527
17528
17529
17530
17531
17532
17533
17534
17535
17536
17537
17538
17539
17540
17541
17542
17543
17544
17545
17546
17547
17548
17549
17550
17551
17552
17553
17554
17555
17556
17557
17558
17559
17560
17561
17562
17563
17564
17565
17566
17567
17568
17569
17570
17571
17572
17573
17574
17575
17576
17577
17578
17579
17580
17581
17582
17583
17584
17585
17586
17587
17588
17589
17590
17591
17592
17593
17594
17595
17596
17597
17598
17599
17600
17601
17602
17603
17604
17605
17606
17607
17608
17609
17610
17611
17612
17613
17614
17615
17616
17617
17618
17619
17620
17621
17622
17623
17624
17625
17626
17627
17628
17629
17630
17631
17632
17633
17634
17635
17636
17637
17638
17639
17640
17641
17642
17643
17644
17645
17646
17647
17648
17649
17650
17651
17652
17653
17654
17655
17656
17657
17658
17659
17660
17661
17662
17663
17664
17665
17666
17667
17668
17669
17670
17671
17672
17673
17674
17675
17676
17677
17678
17679
17680
17681
17682
17683
17684
17685
17686
17687
17688
17689
17690
17691
17692
17693
17694
17695
17696
17697
17698
17699
17700
17701
17702
17703
17704
17705
17706
17707
17708
17709
17710
17711
17712
17713
17714
17715
17716
17717
17718
17719
17720
17721
17722
17723
17724
17725
17726
17727
17728
17729
17730
17731
17732
17733
17734
17735
17736
17737
17738
17739
17740
17741
17742
17743
17744
17745
17746
17747
17748
17749
17750
17751
17752
17753
17754
17755
17756
17757
17758
17759
17760
17761
17762
17763
17764
17765
17766
17767
17768
17769
17770
17771
17772
17773
17774
17775
17776
17777
17778
17779
17780
17781
17782
17783
17784
17785
17786
17787
17788
17789
17790
17791
17792
17793
17794
17795
17796
17797
17798
17799
17800
17801
17802
17803
17804
17805
17806
17807
17808
17809
17810
17811
17812
17813
17814
17815
17816
17817
17818
17819
17820
17821
17822
17823
17824
17825
17826
17827
17828
17829
17830
17831
17832
17833
17834
17835
17836
17837
17838
17839
17840
17841
17842
17843
17844
17845
17846
17847
17848
17849
17850
17851
17852
17853
17854
17855
17856
17857
17858
17859
17860
17861
17862
17863
17864
17865
17866
17867
17868
17869
17870
17871
17872
17873
17874
17875
17876
17877
17878
17879
17880
17881
17882
17883
17884
17885
17886
17887
17888
17889
17890
17891
17892
17893
17894
17895
17896
17897
17898
17899
17900
17901
17902
17903
17904
17905
17906
17907
17908
17909
17910
17911
17912
17913
17914
17915
17916
17917
17918
17919
17920
17921
17922
17923
17924
17925
17926
17927
17928
17929
17930
17931
17932
17933
17934
17935
17936
17937
17938
17939
17940
17941
17942
17943
17944
17945
17946
17947
17948
17949
17950
17951
17952
17953
17954
17955
17956
17957
17958
17959
17960
17961
17962
17963
17964
17965
17966
17967
17968
17969
17970
17971
17972
17973
17974
17975
17976
17977
17978
17979
17980
17981
17982
17983
17984
17985
17986
17987
17988
17989
17990
17991
17992
17993
17994
17995
17996
17997
17998
17999
18000
18001
18002
18003
18004
18005
18006
18007
18008
18009
18010
18011
18012
18013
18014
18015
18016
18017
18018
18019
18020
18021
18022
18023
18024
18025
18026
18027
18028
18029
18030
18031
18032
18033
18034
18035
18036
18037
18038
18039
18040
18041
18042
18043
18044
18045
18046
18047
18048
18049
18050
18051
18052
18053
18054
18055
18056
18057
18058
18059
18060
18061
18062
18063
18064
18065
18066
18067
18068
18069
18070
18071
18072
18073
18074
18075
18076
18077
18078
18079
18080
18081
18082
18083
18084
18085
18086
18087
18088
18089
18090
18091
18092
18093
18094
18095
18096
18097
18098
18099
18100
18101
18102
18103
18104
18105
18106
18107
18108
18109
18110
18111
18112
18113
18114
18115
18116
18117
18118
18119
18120
18121
18122
18123
18124
18125
18126
18127
18128
18129
18130
18131
18132
18133
18134
18135
18136
18137
18138
18139
18140
18141
18142
18143
18144
18145
18146
18147
18148
18149
18150
18151
18152
18153
18154
18155
18156
18157
18158
18159
18160
18161
18162
18163
18164
18165
18166
18167
18168
18169
18170
18171
18172
18173
18174
18175
18176
18177
18178
18179
18180
18181
18182
18183
18184
18185
18186
18187
18188
18189
18190
18191
18192
18193
18194
18195
18196
18197
18198
18199
18200
18201
18202
18203
18204
18205
18206
18207
18208
18209
18210
18211
18212
18213
18214
18215
18216
18217
18218
18219
18220
18221
18222
18223
18224
18225
18226
18227
18228
18229
18230
18231
18232
18233
18234
18235
18236
18237
18238
18239
18240
18241
18242
18243
18244
18245
18246
18247
18248
18249
18250
18251
18252
18253
18254
18255
18256
18257
18258
18259
18260
18261
18262
18263
18264
18265
18266
18267
18268
18269
18270
18271
18272
18273
18274
18275
18276
18277
18278
18279
18280
18281
18282
18283
18284
18285
18286
18287
18288
18289
18290
18291
18292
18293
18294
18295
18296
18297
18298
18299
18300
18301
18302
18303
18304
18305
18306
18307
18308
18309
18310
18311
18312
18313
18314
18315
18316
18317
18318
18319
18320
18321
18322
18323
18324
18325
18326
18327
18328
18329
18330
18331
18332
18333
18334
18335
18336
18337
18338
18339
18340
18341
18342
18343
18344
18345
18346
18347
18348
18349
18350
18351
18352
18353
18354
18355
18356
18357
18358
18359
18360
18361
18362
18363
18364
18365
18366
18367
18368
18369
18370
18371
18372
18373
18374
18375
18376
18377
18378
18379
18380
18381
18382
18383
18384
18385
18386
18387
18388
18389
18390
18391
18392
18393
18394
18395
18396
18397
18398
18399
18400
18401
18402
18403
18404
18405
18406
18407
18408
18409
18410
18411
18412
18413
18414
18415
18416
18417
18418
18419
18420
18421
18422
18423
18424
18425
18426
18427
18428
18429
18430
18431
18432
18433
18434
18435
18436
18437
18438
18439
18440
18441
18442
18443
18444
18445
18446
18447
18448
18449
18450
18451
18452
18453
18454
18455
18456
18457
18458
18459
18460
18461
18462
18463
18464
18465
18466
18467
18468
18469
18470
18471
18472
18473
18474
18475
18476
18477
18478
18479
18480
18481
18482
18483
18484
18485
18486
18487
18488
18489
18490
18491
18492
18493
18494
18495
18496
18497
18498
18499
18500
18501
18502
18503
18504
18505
18506
18507
18508
18509
18510
18511
18512
18513
18514
18515
18516
18517
18518
18519
18520
18521
18522
18523
18524
18525
18526
18527
18528
18529
18530
18531
18532
18533
18534
18535
18536
18537
18538
18539
18540
18541
18542
18543
18544
18545
18546
18547
18548
18549
18550
18551
18552
18553
18554
18555
18556
18557
18558
18559
18560
18561
18562
18563
18564
18565
18566
18567
18568
18569
18570
18571
18572
18573
18574
18575
18576
18577
18578
18579
18580
18581
18582
18583
18584
18585
18586
18587
18588
18589
18590
18591
18592
18593
18594
18595
18596
18597
18598
18599
18600
18601
18602
18603
18604
18605
18606
18607
18608
18609
18610
18611
18612
18613
18614
18615
18616
18617
18618
18619
18620
18621
18622
18623
18624
18625
18626
18627
18628
18629
18630
18631
18632
18633
18634
18635
18636
18637
18638
18639
18640
18641
18642
18643
18644
18645
18646
18647
18648
18649
18650
18651
18652
18653
18654
18655
18656
18657
18658
18659
18660
18661
18662
18663
18664
18665
18666
18667
18668
18669
18670
18671
18672
18673
18674
18675
18676
18677
18678
18679
18680
18681
18682
18683
18684
18685
18686
18687
18688
18689
18690
18691
18692
18693
18694
18695
18696
18697
18698
18699
18700
18701
18702
18703
18704
18705
18706
18707
18708
18709
18710
18711
18712
18713
18714
18715
18716
18717
18718
18719
18720
18721
18722
18723
18724
18725
18726
18727
18728
18729
18730
18731
18732
18733
18734
18735
18736
18737
18738
18739
18740
18741
18742
18743
18744
18745
18746
18747
18748
18749
18750
18751
18752
18753
18754
18755
18756
18757
18758
18759
18760
18761
18762
18763
18764
18765
18766
18767
18768
18769
18770
18771
18772
18773
18774
18775
18776
18777
18778
18779
18780
18781
18782
18783
18784
18785
18786
18787
18788
18789
18790
18791
18792
18793
18794
18795
18796
18797
18798
18799
18800
18801
18802
18803
18804
18805
18806
18807
18808
18809
18810
18811
18812
18813
18814
18815
18816
18817
18818
18819
18820
18821
18822
18823
18824
18825
18826
18827
18828
18829
18830
18831
18832
18833
18834
18835
18836
18837
18838
18839
18840
18841
18842
18843
18844
18845
18846
18847
18848
18849
18850
18851
18852
18853
18854
18855
18856
18857
18858
18859
18860
18861
18862
18863
18864
18865
18866
18867
18868
18869
18870
18871
18872
18873
18874
18875
18876
18877
18878
18879
18880
18881
18882
18883
18884
18885
18886
18887
18888
18889
18890
18891
18892
18893
18894
18895
18896
18897
18898
18899
18900
18901
18902
18903
18904
18905
18906
18907
18908
18909
18910
18911
18912
18913
18914
18915
18916
18917
18918
18919
18920
18921
18922
18923
18924
18925
18926
18927
18928
18929
18930
18931
18932
18933
18934
18935
18936
18937
18938
18939
18940
18941
18942
18943
18944
18945
18946
18947
18948
18949
18950
18951
18952
18953
18954
18955
18956
18957
18958
18959
18960
18961
18962
18963
18964
18965
18966
18967
18968
18969
18970
18971
18972
18973
18974
18975
18976
18977
18978
18979
18980
18981
18982
18983
18984
18985
18986
18987
18988
18989
18990
18991
18992
18993
18994
18995
18996
18997
18998
18999
19000
19001
19002
19003
19004
19005
19006
19007
19008
19009
19010
19011
19012
19013
19014
19015
19016
19017
19018
19019
19020
19021
19022
19023
19024
19025
19026
19027
19028
19029
19030
19031
19032
19033
19034
19035
19036
19037
19038
19039
19040
19041
19042
19043
19044
19045
19046
19047
19048
19049
19050
19051
19052
19053
19054
19055
19056
19057
19058
19059
19060
19061
19062
19063
19064
19065
19066
19067
19068
19069
19070
19071
19072
19073
19074
19075
19076
19077
19078
19079
19080
19081
19082
19083
19084
19085
19086
19087
19088
19089
19090
19091
19092
19093
19094
19095
19096
19097
19098
19099
19100
19101
19102
19103
19104
19105
19106
19107
19108
19109
19110
19111
19112
19113
19114
19115
19116
19117
19118
19119
19120
19121
19122
19123
19124
19125
19126
19127
19128
19129
19130
19131
19132
19133
19134
19135
19136
19137
19138
19139
19140
19141
19142
19143
19144
19145
19146
19147
19148
19149
19150
19151
19152
19153
19154
19155
19156
19157
19158
19159
19160
19161
19162
19163
19164
19165
19166
19167
19168
19169
19170
19171
19172
19173
19174
19175
19176
19177
19178
19179
19180
19181
19182
19183
19184
19185
19186
19187
19188
19189
19190
19191
19192
19193
19194
19195
19196
19197
19198
19199
19200
19201
19202
19203
19204
19205
19206
19207
19208
19209
19210
19211
19212
19213
19214
19215
19216
19217
19218
19219
19220
19221
19222
19223
19224
19225
19226
19227
19228
19229
19230
19231
19232
19233
19234
19235
19236
19237
19238
19239
19240
19241
19242
19243
19244
19245
19246
19247
19248
19249
19250
19251
19252
19253
19254
19255
19256
19257
19258
19259
19260
19261
19262
19263
19264
19265
19266
19267
19268
19269
19270
19271
19272
19273
19274
19275
19276
19277
19278
19279
19280
19281
19282
19283
19284
19285
19286
19287
19288
19289
19290
19291
19292
19293
19294
19295
19296
19297
19298
19299
19300
19301
19302
19303
19304
19305
19306
19307
19308
19309
19310
19311
19312
19313
19314
19315
19316
19317
19318
19319
19320
19321
19322
19323
19324
19325
19326
19327
19328
19329
19330
19331
19332
19333
19334
19335
19336
19337
19338
19339
19340
19341
19342
19343
19344
19345
19346
19347
19348
19349
19350
19351
19352
19353
19354
19355
19356
19357
19358
19359
19360
19361
19362
19363
19364
19365
19366
19367
19368
19369
19370
19371
19372
19373
19374
19375
19376
19377
19378
19379
19380
19381
19382
19383
19384
19385
19386
19387
19388
19389
19390
19391
19392
19393
19394
19395
19396
19397
19398
19399
19400
19401
19402
19403
19404
19405
19406
19407
19408
19409
19410
19411
19412
19413
19414
19415
19416
19417
19418
19419
19420
19421
19422
19423
19424
19425
19426
19427
19428
19429
19430
19431
19432
19433
19434
19435
19436
19437
19438
19439
19440
19441
19442
19443
19444
19445
19446
19447
19448
19449
19450
19451
19452
19453
19454
19455
19456
19457
19458
19459
19460
19461
19462
19463
19464
19465
19466
19467
19468
19469
19470
19471
19472
19473
19474
19475
19476
19477
19478
19479
19480
19481
19482
19483
19484
19485
19486
19487
19488
19489
19490
19491
19492
19493
19494
19495
19496
19497
19498
19499
19500
19501
19502
19503
19504
19505
19506
19507
19508
19509
19510
19511
19512
19513
19514
19515
19516
19517
19518
19519
19520
19521
19522
19523
19524
19525
19526
19527
19528
19529
19530
19531
19532
19533
19534
19535
19536
19537
19538
19539
19540
19541
19542
19543
19544
19545
19546
19547
19548
19549
19550
19551
19552
19553
19554
19555
19556
19557
19558
19559
19560
19561
19562
19563
19564
19565
19566
19567
19568
19569
19570
19571
19572
19573
19574
19575
19576
19577
19578
19579
19580
19581
19582
19583
19584
19585
19586
19587
19588
19589
19590
19591
19592
19593
19594
19595
19596
19597
19598
19599
19600
19601
19602
19603
19604
19605
19606
19607
19608
19609
19610
19611
19612
19613
19614
19615
19616
19617
19618
19619
19620
19621
19622
19623
19624
19625
19626
19627
19628
19629
19630
19631
19632
19633
19634
19635
19636
19637
19638
19639
19640
19641
19642
19643
19644
19645
19646
19647
19648
19649
19650
19651
19652
19653
19654
19655
19656
19657
19658
19659
19660
19661
19662
19663
19664
19665
19666
19667
19668
19669
19670
19671
19672
19673
19674
19675
19676
19677
19678
19679
19680
19681
19682
19683
19684
19685
19686
19687
19688
19689
19690
19691
19692
19693
19694
19695
19696
19697
19698
19699
19700
19701
19702
19703
19704
19705
19706
19707
19708
19709
19710
19711
19712
19713
19714
19715
19716
19717
19718
19719
19720
19721
19722
19723
19724
19725
19726
19727
19728
19729
19730
19731
19732
19733
19734
19735
19736
19737
19738
19739
19740
19741
19742
19743
19744
19745
19746
19747
19748
19749
19750
19751
19752
19753
19754
19755
19756
19757
19758
19759
19760
19761
19762
19763
19764
19765
19766
19767
19768
19769
19770
19771
19772
19773
19774
19775
19776
19777
19778
19779
19780
19781
19782
19783
19784
19785
19786
19787
19788
19789
19790
19791
19792
19793
19794
19795
19796
19797
19798
19799
19800
19801
19802
19803
19804
19805
19806
19807
19808
19809
19810
19811
19812
19813
19814
19815
19816
19817
19818
19819
19820
19821
19822
19823
19824
19825
19826
19827
19828
19829
19830
19831
19832
19833
19834
19835
19836
19837
19838
19839
19840
19841
19842
19843
19844
19845
19846
19847
19848
19849
19850
19851
19852
19853
19854
19855
19856
19857
19858
19859
19860
19861
19862
19863
19864
19865
19866
19867
19868
19869
19870
19871
19872
19873
19874
19875
19876
19877
19878
19879
19880
19881
19882
19883
19884
19885
19886
19887
19888
19889
19890
19891
19892
19893
19894
19895
19896
19897
19898
19899
19900
19901
19902
19903
19904
19905
19906
19907
19908
19909
19910
19911
19912
19913
19914
19915
19916
19917
19918
19919
19920
19921
19922
19923
19924
19925
19926
19927
19928
19929
19930
19931
19932
19933
19934
19935
19936
19937
19938
19939
19940
19941
19942
19943
19944
19945
19946
19947
19948
19949
19950
19951
19952
19953
19954
19955
19956
19957
19958
19959
19960
19961
19962
19963
19964
19965
19966
19967
19968
19969
19970
19971
19972
19973
19974
19975
19976
19977
19978
19979
19980
19981
19982
19983
19984
19985
19986
19987
19988
19989
19990
19991
19992
19993
19994
19995
19996
19997
19998
19999
20000
20001
20002
20003
20004
20005
20006
20007
20008
20009
20010
20011
20012
20013
20014
20015
20016
20017
20018
20019
20020
20021
20022
20023
20024
20025
20026
20027
20028
20029
20030
20031
20032
20033
20034
20035
20036
20037
20038
20039
20040
20041
20042
20043
20044
20045
20046
20047
20048
20049
20050
20051
20052
20053
20054
20055
20056
20057
20058
20059
20060
20061
20062
20063
20064
20065
20066
20067
20068
20069
20070
20071
20072
20073
20074
20075
20076
20077
20078
20079
20080
20081
20082
20083
20084
20085
20086
20087
20088
20089
20090
20091
20092
20093
20094
20095
20096
20097
20098
20099
20100
20101
20102
20103
20104
20105
20106
20107
20108
20109
20110
20111
20112
20113
20114
20115
20116
20117
20118
20119
20120
20121
20122
20123
20124
20125
20126
20127
20128
20129
20130
20131
20132
20133
20134
20135
20136
20137
20138
20139
20140
20141
20142
20143
20144
20145
20146
20147
20148
20149
20150
20151
20152
20153
20154
20155
20156
20157
20158
20159
20160
20161
20162
20163
20164
20165
20166
20167
20168
20169
20170
20171
20172
20173
20174
20175
20176
20177
20178
20179
20180
20181
20182
20183
20184
20185
20186
20187
20188
20189
20190
20191
20192
20193
20194
20195
20196
20197
20198
20199
20200
20201
20202
20203
20204
20205
20206
20207
20208
20209
20210
20211
20212
20213
20214
20215
20216
20217
20218
20219
20220
20221
20222
20223
20224
20225
20226
20227
20228
20229
20230
20231
20232
20233
20234
20235
20236
20237
20238
20239
20240
20241
20242
20243
20244
20245
20246
20247
20248
20249
20250
20251
20252
20253
20254
20255
20256
20257
20258
20259
20260
20261
20262
20263
20264
20265
20266
20267
20268
20269
20270
20271
20272
20273
20274
20275
20276
20277
20278
20279
20280
20281
20282
20283
20284
20285
20286
20287
20288
20289
20290
20291
20292
20293
20294
20295
20296
20297
20298
20299
20300
20301
20302
20303
20304
20305
20306
20307
20308
20309
20310
20311
20312
20313
20314
20315
20316
20317
20318
20319
20320
20321
20322
20323
20324
20325
20326
20327
20328
20329
20330
20331
20332
20333
20334
20335
20336
20337
20338
20339
20340
20341
20342
20343
20344
20345
20346
20347
20348
20349
20350
20351
20352
20353
20354
20355
20356
20357
20358
20359
20360
20361
20362
20363
20364
20365
20366
20367
20368
20369
20370
20371
20372
20373
20374
20375
20376
20377
20378
20379
20380
20381
20382
20383
20384
20385
20386
20387
20388
20389
20390
20391
20392
20393
20394
20395
20396
20397
20398
20399
20400
20401
20402
20403
20404
20405
20406
20407
20408
20409
20410
20411
20412
20413
20414
20415
20416
20417
20418
20419
20420
20421
20422
20423
20424
20425
20426
20427
|
/* C++ modules. Experimental!
Copyright (C) 2017-2022 Free Software Foundation, Inc.
Written by Nathan Sidwell <nathan@acm.org> while at FaceBook
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/>. */
/* Comments in this file have a non-negligible chance of being wrong
or at least inaccurate. Due to (a) my misunderstanding, (b)
ambiguities that I have interpretted differently to original intent
(c) changes in the specification, (d) my poor wording, (e) source
changes. */
/* (Incomplete) Design Notes
A hash table contains all module names. Imported modules are
present in a modules array, which by construction places an
import's dependencies before the import itself. The single
exception is the current TU, which always occupies slot zero (even
when it is not a module).
Imported decls occupy an entity_ary, an array of binding_slots, indexed
by importing module and index within that module. A flat index is
used, as each module reserves a contiguous range of indices.
Initially each slot indicates the CMI section containing the
streamed decl. When the decl is imported it will point to the decl
itself.
Additionally each imported decl is mapped in the entity_map via its
DECL_UID to the flat index in the entity_ary. Thus we can locate
the index for any imported decl by using this map and then
de-flattening the index via a binary seach of the module vector.
Cross-module references are by (remapped) module number and
module-local index.
Each importable DECL contains several flags. The simple set are
DECL_MODULE_EXPORT_P, DECL_MODULE_PURVIEW_P, DECL_MODULE_ATTACH_P
and DECL_MODULE_IMPORT_P. The first indicates whether it is
exported, the second whether it is in module or header-unit
purview. The third indicates it is attached to the named module in
whose purview it resides and the fourth indicates whether it was an
import into this TU or not. DECL_MODULE_ATTACH_P will be false for
all decls in a header-unit, and for those in a named module inside
a linkage declaration.
The more detailed flags are DECL_MODULE_PARTITION_P,
DECL_MODULE_ENTITY_P. The first is set in a primary interface unit
on decls that were read from module partitions (these will have
DECL_MODULE_IMPORT_P set too). Such decls will be streamed out to
the primary's CMI. DECL_MODULE_ENTITY_P is set when an entity is
imported, even if it matched a non-imported entity. Such a decl
will not have DECL_MODULE_IMPORT_P set, even though it has an entry
in the entity map and array.
Header units are module-like.
For namespace-scope lookup, the decls for a particular module are
held located in a sparse array hanging off the binding of the name.
This is partitioned into two: a few fixed slots at the start
followed by the sparse slots afterwards. By construction we only
need to append new slots to the end -- there is never a need to
insert in the middle. The fixed slots are MODULE_SLOT_CURRENT for
the current TU (regardless of whether it is a module or not),
MODULE_SLOT_GLOBAL and MODULE_SLOT_PARTITION. These latter two
slots are used for merging entities across the global module and
module partitions respectively. MODULE_SLOT_PARTITION is only
present in a module. Neither of those two slots is searched during
name lookup -- they are internal use only. This vector is created
lazily once we require it, if there is only a declaration from the
current TU, a regular binding is present. It is converted on
demand.
OPTIMIZATION: Outside of the current TU, we only need ADL to work.
We could optimize regular lookup for the current TU by glomming all
the visible decls on its slot. Perhaps wait until design is a
little more settled though.
There is only one instance of each extern-linkage namespace. It
appears in every module slot that makes it visible. It also
appears in MODULE_SLOT_GLOBAL. (It is an ODR violation if they
collide with some other global module entity.) We also have an
optimization that shares the slot for adjacent modules that declare
the same such namespace.
A module interface compilation produces a Compiled Module Interface
(CMI). The format used is Encapsulated Lazy Records Of Numbered
Declarations, which is essentially ELF's section encapsulation. (As
all good nerds are aware, Elrond is half Elf.) Some sections are
named, and contain information about the module as a whole (indices
etc), and other sections are referenced by number. Although I
don't defend against actively hostile CMIs, there is some
checksumming involved to verify data integrity. When dumping out
an interface, we generate a graph of all the
independently-redeclarable DECLS that are needed, and the decls
they reference. From that we determine the strongly connected
components (SCC) within this TU. Each SCC is dumped to a separate
numbered section of the CMI. We generate a binding table section,
mapping each namespace&name to a defining section. This allows
lazy loading.
Lazy loading employs mmap to map a read-only image of the CMI.
It thus only occupies address space and is paged in on demand,
backed by the CMI file itself. If mmap is unavailable, regular
FILEIO is used. Also, there's a bespoke ELF reader/writer here,
which implements just the section table and sections (including
string sections) of a 32-bit ELF in host byte-order. You can of
course inspect it with readelf. I figured 32-bit is sufficient,
for a single module. I detect running out of section numbers, but
do not implement the ELF overflow mechanism. At least you'll get
an error if that happens.
We do not separate declarations and definitions. My guess is that
if you refer to the declaration, you'll also need the definition
(template body, inline function, class definition etc). But this
does mean we can get larger SCCs than if we separated them. It is
unclear whether this is a win or not.
Notice that we embed section indices into the contents of other
sections. Thus random manipulation of the CMI file by ELF tools
may well break it. The kosher way would probably be to introduce
indirection via section symbols, but that would require defining a
relocation type.
Notice that lazy loading of one module's decls can cause lazy
loading of other decls in the same or another module. Clearly we
want to avoid loops. In a correct program there can be no loops in
the module dependency graph, and the above-mentioned SCC algorithm
places all intra-module circular dependencies in the same SCC. It
also orders the SCCs wrt each other, so dependent SCCs come first.
As we load dependent modules first, we know there can be no
reference to a higher-numbered module, and because we write out
dependent SCCs first, likewise for SCCs within the module. This
allows us to immediately detect broken references. When loading,
we must ensure the rest of the compiler doesn't cause some
unconnected load to occur (for instance, instantiate a template).
Classes used:
dumper - logger
data - buffer
bytes - data streamer
bytes_in : bytes - scalar reader
bytes_out : bytes - scalar writer
elf - ELROND format
elf_in : elf - ELROND reader
elf_out : elf - ELROND writer
trees_in : bytes_in - tree reader
trees_out : bytes_out - tree writer
depset - dependency set
depset::hash - hash table of depsets
depset::tarjan - SCC determinator
uidset<T> - set T's related to a UID
uidset<T>::hash hash table of uidset<T>
loc_spans - location map data
module_state - module object
slurping - data needed during loading
macro_import - imported macro data
macro_export - exported macro data
The ELROND objects use mmap, for both reading and writing. If mmap
is unavailable, fileno IO is used to read and write blocks of data.
The mapper object uses fileno IO to communicate with the server or
program. */
/* In expermental (trunk) sources, MODULE_VERSION is a #define passed
in from the Makefile. It records the modification date of the
source directory -- that's the only way to stay sane. In release
sources, we (plan to) use the compiler's major.minor versioning.
While the format might not change between at minor versions, it
seems simplest to tie the two together. There's no concept of
inter-version compatibility. */
#define IS_EXPERIMENTAL(V) ((V) >= (1U << 20))
#define MODULE_MAJOR(V) ((V) / 10000)
#define MODULE_MINOR(V) ((V) % 10000)
#define EXPERIMENT(A,B) (IS_EXPERIMENTAL (MODULE_VERSION) ? (A) : (B))
#ifndef MODULE_VERSION
#include "bversion.h"
#define MODULE_VERSION (BUILDING_GCC_MAJOR * 10000U + BUILDING_GCC_MINOR)
#elif !IS_EXPERIMENTAL (MODULE_VERSION)
#error "This is not the version I was looking for."
#endif
#define _DEFAULT_SOURCE 1 /* To get TZ field of struct tm, if available. */
#include "config.h"
#define INCLUDE_MEMORY
#define INCLUDE_STRING
#define INCLUDE_VECTOR
#include "system.h"
#include "coretypes.h"
#include "cp-tree.h"
#include "timevar.h"
#include "stringpool.h"
#include "dumpfile.h"
#include "bitmap.h"
#include "cgraph.h"
#include "tree-iterator.h"
#include "cpplib.h"
#include "mkdeps.h"
#include "incpath.h"
#include "libiberty.h"
#include "stor-layout.h"
#include "version.h"
#include "tree-diagnostic.h"
#include "toplev.h"
#include "opts.h"
#include "attribs.h"
#include "intl.h"
#include "langhooks.h"
/* This TU doesn't need or want to see the networking. */
#define CODY_NETWORKING 0
#include "mapper-client.h"
#if 0 // 1 for testing no mmap
#define MAPPED_READING 0
#define MAPPED_WRITING 0
#else
#if HAVE_MMAP_FILE && _POSIX_MAPPED_FILES > 0
/* mmap, munmap. */
#define MAPPED_READING 1
#if HAVE_SYSCONF && defined (_SC_PAGE_SIZE)
/* msync, sysconf (_SC_PAGE_SIZE), ftruncate */
/* posix_fallocate used if available. */
#define MAPPED_WRITING 1
#else
#define MAPPED_WRITING 0
#endif
#else
#define MAPPED_READING 0
#define MAPPED_WRITING 0
#endif
#endif
/* Some open(2) flag differences, what a colourful world it is! */
#if defined (O_CLOEXEC)
// OK
#elif defined (_O_NOINHERIT)
/* Windows' _O_NOINHERIT matches O_CLOEXEC flag */
#define O_CLOEXEC _O_NOINHERIT
#else
#define O_CLOEXEC 0
#endif
#if defined (O_BINARY)
// Ok?
#elif defined (_O_BINARY)
/* Windows' open(2) call defaults to text! */
#define O_BINARY _O_BINARY
#else
#define O_BINARY 0
#endif
static inline cpp_hashnode *cpp_node (tree id)
{
return CPP_HASHNODE (GCC_IDENT_TO_HT_IDENT (id));
}
static inline tree identifier (const cpp_hashnode *node)
{
/* HT_NODE() expands to node->ident that HT_IDENT_TO_GCC_IDENT()
then subtracts a nonzero constant, deriving a pointer to
a different member than ident. That's strictly undefined
and detected by -Warray-bounds. Suppress it. See PR 101372. */
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Warray-bounds"
return HT_IDENT_TO_GCC_IDENT (HT_NODE (const_cast<cpp_hashnode *> (node)));
#pragma GCC diagnostic pop
}
/* Id for dumping module information. */
int module_dump_id;
/* We have a special module owner. */
#define MODULE_UNKNOWN (~0U) /* Not yet known. */
/* Prefix for section names. */
#define MOD_SNAME_PFX ".gnu.c++"
/* Format a version for user consumption. */
typedef char verstr_t[32];
static void
version2string (unsigned version, verstr_t &out)
{
unsigned major = MODULE_MAJOR (version);
unsigned minor = MODULE_MINOR (version);
if (IS_EXPERIMENTAL (version))
sprintf (out, "%04u/%02u/%02u-%02u:%02u%s",
2000 + major / 10000, (major / 100) % 100, (major % 100),
minor / 100, minor % 100,
EXPERIMENT ("", " (experimental)"));
else
sprintf (out, "%u.%u", major, minor);
}
/* Include files to note translation for. */
static vec<const char *, va_heap, vl_embed> *note_includes;
/* Modules to note CMI pathames. */
static vec<const char *, va_heap, vl_embed> *note_cmis;
/* Traits to hash an arbitrary pointer. Entries are not deletable,
and removal is a noop (removal needed upon destruction). */
template <typename T>
struct nodel_ptr_hash : pointer_hash<T>, typed_noop_remove <T *> {
/* Nothing is deletable. Everything is insertable. */
static bool is_deleted (T *) { return false; }
static void mark_deleted (T *) { gcc_unreachable (); }
};
/* Map from pointer to signed integer. */
typedef simple_hashmap_traits<nodel_ptr_hash<void>, int> ptr_int_traits;
typedef hash_map<void *,signed,ptr_int_traits> ptr_int_hash_map;
/********************************************************************/
/* Basic streaming & ELF. Serialization is usually via mmap. For
writing we slide a buffer over the output file, syncing it
approproiately. For reading we simply map the whole file (as a
file-backed read-only map -- it's just address space, leaving the
OS pager to deal with getting the data to us). Some buffers need
to be more conventional malloc'd contents. */
/* Variable length buffer. */
class data {
public:
class allocator {
public:
/* Tools tend to moan if the dtor's not virtual. */
virtual ~allocator () {}
public:
void grow (data &obj, unsigned needed, bool exact);
void shrink (data &obj);
public:
virtual char *grow (char *ptr, unsigned needed);
virtual void shrink (char *ptr);
};
public:
char *buffer; /* Buffer being transferred. */
/* Although size_t would be the usual size, we know we never get
more than 4GB of buffer -- because that's the limit of the
encapsulation format. And if you need bigger imports, you're
doing it wrong. */
unsigned size; /* Allocated size of buffer. */
unsigned pos; /* Position in buffer. */
public:
data ()
:buffer (NULL), size (0), pos (0)
{
}
~data ()
{
/* Make sure the derived and/or using class know what they're
doing. */
gcc_checking_assert (!buffer);
}
protected:
char *use (unsigned count)
{
if (size < pos + count)
return NULL;
char *res = &buffer[pos];
pos += count;
return res;
}
public:
void unuse (unsigned count)
{
pos -= count;
}
public:
static allocator simple_memory;
};
/* The simple data allocator. */
data::allocator data::simple_memory;
/* Grow buffer to at least size NEEDED. */
void
data::allocator::grow (data &obj, unsigned needed, bool exact)
{
gcc_checking_assert (needed ? needed > obj.size : !obj.size);
if (!needed)
/* Pick a default size. */
needed = EXPERIMENT (100, 1000);
if (!exact)
needed *= 2;
obj.buffer = grow (obj.buffer, needed);
if (obj.buffer)
obj.size = needed;
else
obj.pos = obj.size = 0;
}
/* Free a buffer. */
void
data::allocator::shrink (data &obj)
{
shrink (obj.buffer);
obj.buffer = NULL;
obj.size = 0;
}
char *
data::allocator::grow (char *ptr, unsigned needed)
{
return XRESIZEVAR (char, ptr, needed);
}
void
data::allocator::shrink (char *ptr)
{
XDELETEVEC (ptr);
}
/* Byte streamer base. Buffer with read/write position and smarts
for single bits. */
class bytes : public data {
public:
typedef data parent;
protected:
uint32_t bit_val; /* Bit buffer. */
unsigned bit_pos; /* Next bit in bit buffer. */
public:
bytes ()
:parent (), bit_val (0), bit_pos (0)
{}
~bytes ()
{
}
protected:
unsigned calc_crc (unsigned) const;
protected:
/* Finish bit packet. Rewind the bytes not used. */
unsigned bit_flush ()
{
gcc_assert (bit_pos);
unsigned bytes = (bit_pos + 7) / 8;
unuse (4 - bytes);
bit_pos = 0;
bit_val = 0;
return bytes;
}
};
/* Calculate the crc32 of the buffer. Note the CRC is stored in the
first 4 bytes, so don't include them. */
unsigned
bytes::calc_crc (unsigned l) const
{
unsigned crc = 0;
for (size_t ix = 4; ix < l; ix++)
crc = crc32_byte (crc, buffer[ix]);
return crc;
}
class elf_in;
/* Byte stream reader. */
class bytes_in : public bytes {
typedef bytes parent;
protected:
bool overrun; /* Sticky read-too-much flag. */
public:
bytes_in ()
: parent (), overrun (false)
{
}
~bytes_in ()
{
}
public:
/* Begin reading a named section. */
bool begin (location_t loc, elf_in *src, const char *name);
/* Begin reading a numbered section with optional name. */
bool begin (location_t loc, elf_in *src, unsigned, const char * = NULL);
/* Complete reading a buffer. Propagate errors and return true on
success. */
bool end (elf_in *src);
/* Return true if there is unread data. */
bool more_p () const
{
return pos != size;
}
public:
/* Start reading at OFFSET. */
void random_access (unsigned offset)
{
if (offset > size)
set_overrun ();
pos = offset;
bit_pos = bit_val = 0;
}
public:
void align (unsigned boundary)
{
if (unsigned pad = pos & (boundary - 1))
read (boundary - pad);
}
public:
const char *read (unsigned count)
{
char *ptr = use (count);
if (!ptr)
set_overrun ();
return ptr;
}
public:
bool check_crc () const;
/* We store the CRC in the first 4 bytes, using host endianness. */
unsigned get_crc () const
{
return *(const unsigned *)&buffer[0];
}
public:
/* Manipulate the overrun flag. */
bool get_overrun () const
{
return overrun;
}
void set_overrun ()
{
overrun = true;
}
public:
unsigned u32 (); /* Read uncompressed integer. */
public:
bool b (); /* Read a bool. */
void bflush (); /* Completed a block of bools. */
private:
void bfill (); /* Get the next block of bools. */
public:
int c (); /* Read a char. */
int i (); /* Read a signed int. */
unsigned u (); /* Read an unsigned int. */
size_t z (); /* Read a size_t. */
HOST_WIDE_INT wi (); /* Read a HOST_WIDE_INT. */
unsigned HOST_WIDE_INT wu (); /* Read an unsigned HOST_WIDE_INT. */
const char *str (size_t * = NULL); /* Read a string. */
const void *buf (size_t); /* Read a fixed-length buffer. */
cpp_hashnode *cpp_node (); /* Read a cpp node. */
};
/* Verify the buffer's CRC is correct. */
bool
bytes_in::check_crc () const
{
if (size < 4)
return false;
unsigned c_crc = calc_crc (size);
if (c_crc != get_crc ())
return false;
return true;
}
class elf_out;
/* Byte stream writer. */
class bytes_out : public bytes {
typedef bytes parent;
public:
allocator *memory; /* Obtainer of memory. */
public:
bytes_out (allocator *memory)
: parent (), memory (memory)
{
}
~bytes_out ()
{
}
public:
bool streaming_p () const
{
return memory != NULL;
}
public:
void set_crc (unsigned *crc_ptr);
public:
/* Begin writing, maybe reserve space for CRC. */
void begin (bool need_crc = true);
/* Finish writing. Spill to section by number. */
unsigned end (elf_out *, unsigned, unsigned *crc_ptr = NULL);
public:
void align (unsigned boundary)
{
if (unsigned pad = pos & (boundary - 1))
write (boundary - pad);
}
public:
char *write (unsigned count, bool exact = false)
{
if (size < pos + count)
memory->grow (*this, pos + count, exact);
return use (count);
}
public:
void u32 (unsigned); /* Write uncompressed integer. */
public:
void b (bool); /* Write bool. */
void bflush (); /* Finish block of bools. */
public:
void c (unsigned char); /* Write unsigned char. */
void i (int); /* Write signed int. */
void u (unsigned); /* Write unsigned int. */
void z (size_t s); /* Write size_t. */
void wi (HOST_WIDE_INT); /* Write HOST_WIDE_INT. */
void wu (unsigned HOST_WIDE_INT); /* Write unsigned HOST_WIDE_INT. */
void str (const char *ptr)
{
str (ptr, strlen (ptr));
}
void cpp_node (const cpp_hashnode *node)
{
str ((const char *)NODE_NAME (node), NODE_LEN (node));
}
void str (const char *, size_t); /* Write string of known length. */
void buf (const void *, size_t); /* Write fixed length buffer. */
void *buf (size_t); /* Create a writable buffer */
public:
/* Format a NUL-terminated raw string. */
void printf (const char *, ...) ATTRIBUTE_PRINTF_2;
void print_time (const char *, const tm *, const char *);
public:
/* Dump instrumentation. */
static void instrument ();
protected:
/* Instrumentation. */
static unsigned spans[4];
static unsigned lengths[4];
static int is_set;
};
/* Instrumentation. */
unsigned bytes_out::spans[4];
unsigned bytes_out::lengths[4];
int bytes_out::is_set = -1;
/* If CRC_PTR non-null, set the CRC of the buffer. Mix the CRC into
that pointed to by CRC_PTR. */
void
bytes_out::set_crc (unsigned *crc_ptr)
{
if (crc_ptr)
{
gcc_checking_assert (pos >= 4);
unsigned crc = calc_crc (pos);
unsigned accum = *crc_ptr;
/* Only mix the existing *CRC_PTR if it is non-zero. */
accum = accum ? crc32_unsigned (accum, crc) : crc;
*crc_ptr = accum;
/* Buffer will be sufficiently aligned. */
*(unsigned *)buffer = crc;
}
}
/* Finish a set of bools. */
void
bytes_out::bflush ()
{
if (bit_pos)
{
u32 (bit_val);
lengths[2] += bit_flush ();
}
spans[2]++;
is_set = -1;
}
void
bytes_in::bflush ()
{
if (bit_pos)
bit_flush ();
}
/* When reading, we don't know how many bools we'll read in. So read
4 bytes-worth, and then rewind when flushing if we didn't need them
all. You can't have a block of bools closer than 4 bytes to the
end of the buffer. */
void
bytes_in::bfill ()
{
bit_val = u32 ();
}
/* Bools are packed into bytes. You cannot mix bools and non-bools.
You must call bflush before emitting another type. So batch your
bools.
It may be worth optimizing for most bools being zero. Some kind of
run-length encoding? */
void
bytes_out::b (bool x)
{
if (is_set != x)
{
is_set = x;
spans[x]++;
}
lengths[x]++;
bit_val |= unsigned (x) << bit_pos++;
if (bit_pos == 32)
{
u32 (bit_val);
lengths[2] += bit_flush ();
}
}
bool
bytes_in::b ()
{
if (!bit_pos)
bfill ();
bool v = (bit_val >> bit_pos++) & 1;
if (bit_pos == 32)
bit_flush ();
return v;
}
/* Exactly 4 bytes. Used internally for bool packing and a few other
places. We can't simply use uint32_t because (a) alignment and
(b) we need little-endian for the bool streaming rewinding to make
sense. */
void
bytes_out::u32 (unsigned val)
{
if (char *ptr = write (4))
{
ptr[0] = val;
ptr[1] = val >> 8;
ptr[2] = val >> 16;
ptr[3] = val >> 24;
}
}
unsigned
bytes_in::u32 ()
{
unsigned val = 0;
if (const char *ptr = read (4))
{
val |= (unsigned char)ptr[0];
val |= (unsigned char)ptr[1] << 8;
val |= (unsigned char)ptr[2] << 16;
val |= (unsigned char)ptr[3] << 24;
}
return val;
}
/* Chars are unsigned and written as single bytes. */
void
bytes_out::c (unsigned char v)
{
if (char *ptr = write (1))
*ptr = v;
}
int
bytes_in::c ()
{
int v = 0;
if (const char *ptr = read (1))
v = (unsigned char)ptr[0];
return v;
}
/* Ints 7-bit as a byte. Otherwise a 3bit count of following bytes in
big-endian form. 4 bits are in the first byte. */
void
bytes_out::i (int v)
{
if (char *ptr = write (1))
{
if (v <= 0x3f && v >= -0x40)
*ptr = v & 0x7f;
else
{
unsigned bytes = 0;
int probe;
if (v >= 0)
for (probe = v >> 8; probe > 0x7; probe >>= 8)
bytes++;
else
for (probe = v >> 8; probe < -0x8; probe >>= 8)
bytes++;
*ptr = 0x80 | bytes << 4 | (probe & 0xf);
if ((ptr = write (++bytes)))
for (; bytes--; v >>= 8)
ptr[bytes] = v & 0xff;
}
}
}
int
bytes_in::i ()
{
int v = 0;
if (const char *ptr = read (1))
{
v = *ptr & 0xff;
if (v & 0x80)
{
unsigned bytes = (v >> 4) & 0x7;
v &= 0xf;
if (v & 0x8)
v |= -1 ^ 0x7;
/* unsigned necessary due to left shifts of -ve values. */
unsigned uv = unsigned (v);
if ((ptr = read (++bytes)))
while (bytes--)
uv = (uv << 8) | (*ptr++ & 0xff);
v = int (uv);
}
else if (v & 0x40)
v |= -1 ^ 0x3f;
}
return v;
}
void
bytes_out::u (unsigned v)
{
if (char *ptr = write (1))
{
if (v <= 0x7f)
*ptr = v;
else
{
unsigned bytes = 0;
unsigned probe;
for (probe = v >> 8; probe > 0xf; probe >>= 8)
bytes++;
*ptr = 0x80 | bytes << 4 | probe;
if ((ptr = write (++bytes)))
for (; bytes--; v >>= 8)
ptr[bytes] = v & 0xff;
}
}
}
unsigned
bytes_in::u ()
{
unsigned v = 0;
if (const char *ptr = read (1))
{
v = *ptr & 0xff;
if (v & 0x80)
{
unsigned bytes = (v >> 4) & 0x7;
v &= 0xf;
if ((ptr = read (++bytes)))
while (bytes--)
v = (v << 8) | (*ptr++ & 0xff);
}
}
return v;
}
void
bytes_out::wi (HOST_WIDE_INT v)
{
if (char *ptr = write (1))
{
if (v <= 0x3f && v >= -0x40)
*ptr = v & 0x7f;
else
{
unsigned bytes = 0;
HOST_WIDE_INT probe;
if (v >= 0)
for (probe = v >> 8; probe > 0x7; probe >>= 8)
bytes++;
else
for (probe = v >> 8; probe < -0x8; probe >>= 8)
bytes++;
*ptr = 0x80 | bytes << 4 | (probe & 0xf);
if ((ptr = write (++bytes)))
for (; bytes--; v >>= 8)
ptr[bytes] = v & 0xff;
}
}
}
HOST_WIDE_INT
bytes_in::wi ()
{
HOST_WIDE_INT v = 0;
if (const char *ptr = read (1))
{
v = *ptr & 0xff;
if (v & 0x80)
{
unsigned bytes = (v >> 4) & 0x7;
v &= 0xf;
if (v & 0x8)
v |= -1 ^ 0x7;
/* unsigned necessary due to left shifts of -ve values. */
unsigned HOST_WIDE_INT uv = (unsigned HOST_WIDE_INT) v;
if ((ptr = read (++bytes)))
while (bytes--)
uv = (uv << 8) | (*ptr++ & 0xff);
v = (HOST_WIDE_INT) uv;
}
else if (v & 0x40)
v |= -1 ^ 0x3f;
}
return v;
}
/* unsigned wide ints are just written as signed wide ints. */
inline void
bytes_out::wu (unsigned HOST_WIDE_INT v)
{
wi ((HOST_WIDE_INT) v);
}
inline unsigned HOST_WIDE_INT
bytes_in::wu ()
{
return (unsigned HOST_WIDE_INT) wi ();
}
/* size_t written as unsigned or unsigned wide int. */
inline void
bytes_out::z (size_t s)
{
if (sizeof (s) == sizeof (unsigned))
u (s);
else
wu (s);
}
inline size_t
bytes_in::z ()
{
if (sizeof (size_t) == sizeof (unsigned))
return u ();
else
return wu ();
}
/* Buffer simply memcpied. */
void *
bytes_out::buf (size_t len)
{
align (sizeof (void *) * 2);
return write (len);
}
void
bytes_out::buf (const void *src, size_t len)
{
if (void *ptr = buf (len))
memcpy (ptr, src, len);
}
const void *
bytes_in::buf (size_t len)
{
align (sizeof (void *) * 2);
const char *ptr = read (len);
return ptr;
}
/* strings as an size_t length, followed by the buffer. Make sure
there's a NUL terminator on read. */
void
bytes_out::str (const char *string, size_t len)
{
z (len);
if (len)
{
gcc_checking_assert (!string[len]);
buf (string, len + 1);
}
}
const char *
bytes_in::str (size_t *len_p)
{
size_t len = z ();
/* We're about to trust some user data. */
if (overrun)
len = 0;
if (len_p)
*len_p = len;
const char *str = NULL;
if (len)
{
str = reinterpret_cast<const char *> (buf (len + 1));
if (!str || str[len])
{
set_overrun ();
str = NULL;
}
}
return str ? str : "";
}
cpp_hashnode *
bytes_in::cpp_node ()
{
size_t len;
const char *s = str (&len);
if (!len)
return NULL;
return ::cpp_node (get_identifier_with_length (s, len));
}
/* Format a string directly to the buffer, including a terminating
NUL. Intended for human consumption. */
void
bytes_out::printf (const char *format, ...)
{
va_list args;
/* Exercise buffer expansion. */
size_t len = EXPERIMENT (10, 500);
while (char *ptr = write (len))
{
va_start (args, format);
size_t actual = vsnprintf (ptr, len, format, args) + 1;
va_end (args);
if (actual <= len)
{
unuse (len - actual);
break;
}
unuse (len);
len = actual;
}
}
void
bytes_out::print_time (const char *kind, const tm *time, const char *tz)
{
printf ("%stime: %4u/%02u/%02u %02u:%02u:%02u %s",
kind, time->tm_year + 1900, time->tm_mon + 1, time->tm_mday,
time->tm_hour, time->tm_min, time->tm_sec, tz);
}
/* Encapsulated Lazy Records Of Named Declarations.
Header: Stunningly Elf32_Ehdr-like
Sections: Sectional data
[1-N) : User data sections
N .strtab : strings, stunningly ELF STRTAB-like
Index: Section table, stunningly ELF32_Shdr-like. */
class elf {
protected:
/* Constants used within the format. */
enum private_constants {
/* File kind. */
ET_NONE = 0,
EM_NONE = 0,
OSABI_NONE = 0,
/* File format. */
EV_CURRENT = 1,
CLASS32 = 1,
DATA2LSB = 1,
DATA2MSB = 2,
/* Section numbering. */
SHN_UNDEF = 0,
SHN_LORESERVE = 0xff00,
SHN_XINDEX = 0xffff,
/* Section types. */
SHT_NONE = 0, /* No contents. */
SHT_PROGBITS = 1, /* Random bytes. */
SHT_STRTAB = 3, /* A string table. */
/* Section flags. */
SHF_NONE = 0x00, /* Nothing. */
SHF_STRINGS = 0x20, /* NUL-Terminated strings. */
/* I really hope we do not get CMI files larger than 4GB. */
MY_CLASS = CLASS32,
/* It is host endianness that is relevant. */
MY_ENDIAN = DATA2LSB
#ifdef WORDS_BIGENDIAN
^ DATA2LSB ^ DATA2MSB
#endif
};
public:
/* Constants visible to users. */
enum public_constants {
/* Special error codes. Breaking layering a bit. */
E_BAD_DATA = -1, /* Random unexpected data errors. */
E_BAD_LAZY = -2, /* Badly ordered laziness. */
E_BAD_IMPORT = -3 /* A nested import failed. */
};
protected:
/* File identification. On-disk representation. */
struct ident {
uint8_t magic[4]; /* 0x7f, 'E', 'L', 'F' */
uint8_t klass; /* 4:CLASS32 */
uint8_t data; /* 5:DATA2[LM]SB */
uint8_t version; /* 6:EV_CURRENT */
uint8_t osabi; /* 7:OSABI_NONE */
uint8_t abiver; /* 8: 0 */
uint8_t pad[7]; /* 9-15 */
};
/* File header. On-disk representation. */
struct header {
struct ident ident;
uint16_t type; /* ET_NONE */
uint16_t machine; /* EM_NONE */
uint32_t version; /* EV_CURRENT */
uint32_t entry; /* 0 */
uint32_t phoff; /* 0 */
uint32_t shoff; /* Section Header Offset in file */
uint32_t flags;
uint16_t ehsize; /* ELROND Header SIZE -- sizeof (header) */
uint16_t phentsize; /* 0 */
uint16_t phnum; /* 0 */
uint16_t shentsize; /* Section Header SIZE -- sizeof (section) */
uint16_t shnum; /* Section Header NUM */
uint16_t shstrndx; /* Section Header STRing iNDeX */
};
/* File section. On-disk representation. */
struct section {
uint32_t name; /* String table offset. */
uint32_t type; /* SHT_* */
uint32_t flags; /* SHF_* */
uint32_t addr; /* 0 */
uint32_t offset; /* OFFSET in file */
uint32_t size; /* SIZE of section */
uint32_t link; /* 0 */
uint32_t info; /* 0 */
uint32_t addralign; /* 0 */
uint32_t entsize; /* ENTry SIZE, usually 0 */
};
protected:
data hdr; /* The header. */
data sectab; /* The section table. */
data strtab; /* String table. */
int fd; /* File descriptor we're reading or writing. */
int err; /* Sticky error code. */
public:
/* Construct from STREAM. E is errno if STREAM NULL. */
elf (int fd, int e)
:hdr (), sectab (), strtab (), fd (fd), err (fd >= 0 ? 0 : e)
{}
~elf ()
{
gcc_checking_assert (fd < 0 && !hdr.buffer
&& !sectab.buffer && !strtab.buffer);
}
public:
/* Return the error, if we have an error. */
int get_error () const
{
return err;
}
/* Set the error, unless it's already been set. */
void set_error (int e = E_BAD_DATA)
{
if (!err)
err = e;
}
/* Get an error string. */
const char *get_error (const char *) const;
public:
/* Begin reading/writing file. Return false on error. */
bool begin () const
{
return !get_error ();
}
/* Finish reading/writing file. Return false on error. */
bool end ();
};
/* Return error string. */
const char *
elf::get_error (const char *name) const
{
if (!name)
return "Unknown CMI mapping";
switch (err)
{
case 0:
gcc_unreachable ();
case E_BAD_DATA:
return "Bad file data";
case E_BAD_IMPORT:
return "Bad import dependency";
case E_BAD_LAZY:
return "Bad lazy ordering";
default:
return xstrerror (err);
}
}
/* Finish file, return true if there's an error. */
bool
elf::end ()
{
/* Close the stream and free the section table. */
if (fd >= 0 && close (fd))
set_error (errno);
fd = -1;
return !get_error ();
}
/* ELROND reader. */
class elf_in : public elf {
typedef elf parent;
private:
/* For freezing & defrosting. */
#if !defined (HOST_LACKS_INODE_NUMBERS)
dev_t device;
ino_t inode;
#endif
public:
elf_in (int fd, int e)
:parent (fd, e)
{
}
~elf_in ()
{
}
public:
bool is_frozen () const
{
return fd < 0 && hdr.pos;
}
bool is_freezable () const
{
return fd >= 0 && hdr.pos;
}
void freeze ();
bool defrost (const char *);
/* If BYTES is in the mmapped area, allocate a new buffer for it. */
void preserve (bytes_in &bytes ATTRIBUTE_UNUSED)
{
#if MAPPED_READING
if (hdr.buffer && bytes.buffer >= hdr.buffer
&& bytes.buffer < hdr.buffer + hdr.pos)
{
char *buf = bytes.buffer;
bytes.buffer = data::simple_memory.grow (NULL, bytes.size);
memcpy (bytes.buffer, buf, bytes.size);
}
#endif
}
/* If BYTES is not in SELF's mmapped area, free it. SELF might be
NULL. */
static void release (elf_in *self ATTRIBUTE_UNUSED, bytes_in &bytes)
{
#if MAPPED_READING
if (!(self && self->hdr.buffer && bytes.buffer >= self->hdr.buffer
&& bytes.buffer < self->hdr.buffer + self->hdr.pos))
#endif
data::simple_memory.shrink (bytes.buffer);
bytes.buffer = NULL;
bytes.size = 0;
}
public:
static void grow (data &data, unsigned needed)
{
gcc_checking_assert (!data.buffer);
#if !MAPPED_READING
data.buffer = XNEWVEC (char, needed);
#endif
data.size = needed;
}
static void shrink (data &data)
{
#if !MAPPED_READING
XDELETEVEC (data.buffer);
#endif
data.buffer = NULL;
data.size = 0;
}
public:
const section *get_section (unsigned s) const
{
if (s * sizeof (section) < sectab.size)
return reinterpret_cast<const section *>
(§ab.buffer[s * sizeof (section)]);
else
return NULL;
}
unsigned get_section_limit () const
{
return sectab.size / sizeof (section);
}
protected:
const char *read (data *, unsigned, unsigned);
public:
/* Read section by number. */
bool read (data *d, const section *s)
{
return s && read (d, s->offset, s->size);
}
/* Find section by name. */
unsigned find (const char *name);
/* Find section by index. */
const section *find (unsigned snum, unsigned type = SHT_PROGBITS);
public:
/* Release the string table, when we're done with it. */
void release ()
{
shrink (strtab);
}
public:
bool begin (location_t);
bool end ()
{
release ();
#if MAPPED_READING
if (hdr.buffer)
munmap (hdr.buffer, hdr.pos);
hdr.buffer = NULL;
#endif
shrink (sectab);
return parent::end ();
}
public:
/* Return string name at OFFSET. Checks OFFSET range. Always
returns non-NULL. We know offset 0 is an empty string. */
const char *name (unsigned offset)
{
return &strtab.buffer[offset < strtab.size ? offset : 0];
}
};
/* ELROND writer. */
class elf_out : public elf, public data::allocator {
typedef elf parent;
/* Desired section alignment on disk. */
static const int SECTION_ALIGN = 16;
private:
ptr_int_hash_map identtab; /* Map of IDENTIFIERS to strtab offsets. */
unsigned pos; /* Write position in file. */
#if MAPPED_WRITING
unsigned offset; /* Offset of the mapping. */
unsigned extent; /* Length of mapping. */
unsigned page_size; /* System page size. */
#endif
public:
elf_out (int fd, int e)
:parent (fd, e), identtab (500), pos (0)
{
#if MAPPED_WRITING
offset = extent = 0;
page_size = sysconf (_SC_PAGE_SIZE);
if (page_size < SECTION_ALIGN)
/* Something really strange. */
set_error (EINVAL);
#endif
}
~elf_out ()
{
data::simple_memory.shrink (hdr);
data::simple_memory.shrink (sectab);
data::simple_memory.shrink (strtab);
}
#if MAPPED_WRITING
private:
void create_mapping (unsigned ext, bool extending = true);
void remove_mapping ();
#endif
protected:
using allocator::grow;
char *grow (char *, unsigned needed) final override;
#if MAPPED_WRITING
using allocator::shrink;
void shrink (char *) final override;
#endif
public:
unsigned get_section_limit () const
{
return sectab.pos / sizeof (section);
}
protected:
unsigned add (unsigned type, unsigned name = 0,
unsigned off = 0, unsigned size = 0, unsigned flags = SHF_NONE);
unsigned write (const data &);
#if MAPPED_WRITING
unsigned write (const bytes_out &);
#endif
public:
/* IDENTIFIER to strtab offset. */
unsigned name (tree ident);
/* String literal to strtab offset. */
unsigned name (const char *n);
/* Qualified name of DECL to strtab offset. */
unsigned qualified_name (tree decl, bool is_defn);
private:
unsigned strtab_write (const char *s, unsigned l);
void strtab_write (tree decl, int);
public:
/* Add a section with contents or strings. */
unsigned add (const bytes_out &, bool string_p, unsigned name);
public:
/* Begin and end writing. */
bool begin ();
bool end ();
};
/* Begin reading section NAME (of type PROGBITS) from SOURCE.
Data always checked for CRC. */
bool
bytes_in::begin (location_t loc, elf_in *source, const char *name)
{
unsigned snum = source->find (name);
return begin (loc, source, snum, name);
}
/* Begin reading section numbered SNUM with NAME (may be NULL). */
bool
bytes_in::begin (location_t loc, elf_in *source, unsigned snum, const char *name)
{
if (!source->read (this, source->find (snum))
|| !size || !check_crc ())
{
source->set_error (elf::E_BAD_DATA);
source->shrink (*this);
if (name)
error_at (loc, "section %qs is missing or corrupted", name);
else
error_at (loc, "section #%u is missing or corrupted", snum);
return false;
}
pos = 4;
return true;
}
/* Finish reading a section. */
bool
bytes_in::end (elf_in *src)
{
if (more_p ())
set_overrun ();
if (overrun)
src->set_error ();
src->shrink (*this);
return !overrun;
}
/* Begin writing buffer. */
void
bytes_out::begin (bool need_crc)
{
if (need_crc)
pos = 4;
memory->grow (*this, 0, false);
}
/* Finish writing buffer. Stream out to SINK as named section NAME.
Return section number or 0 on failure. If CRC_PTR is true, crc
the data. Otherwise it is a string section. */
unsigned
bytes_out::end (elf_out *sink, unsigned name, unsigned *crc_ptr)
{
lengths[3] += pos;
spans[3]++;
set_crc (crc_ptr);
unsigned sec_num = sink->add (*this, !crc_ptr, name);
memory->shrink (*this);
return sec_num;
}
/* Close and open the file, without destroying it. */
void
elf_in::freeze ()
{
gcc_checking_assert (!is_frozen ());
#if MAPPED_READING
if (munmap (hdr.buffer, hdr.pos) < 0)
set_error (errno);
#endif
if (close (fd) < 0)
set_error (errno);
fd = -1;
}
bool
elf_in::defrost (const char *name)
{
gcc_checking_assert (is_frozen ());
struct stat stat;
fd = open (name, O_RDONLY | O_CLOEXEC | O_BINARY);
if (fd < 0 || fstat (fd, &stat) < 0)
set_error (errno);
else
{
bool ok = hdr.pos == unsigned (stat.st_size);
#ifndef HOST_LACKS_INODE_NUMBERS
if (device != stat.st_dev
|| inode != stat.st_ino)
ok = false;
#endif
if (!ok)
set_error (EMFILE);
#if MAPPED_READING
if (ok)
{
char *mapping = reinterpret_cast<char *>
(mmap (NULL, hdr.pos, PROT_READ, MAP_SHARED, fd, 0));
if (mapping == MAP_FAILED)
fail:
set_error (errno);
else
{
if (madvise (mapping, hdr.pos, MADV_RANDOM))
goto fail;
/* These buffers are never NULL in this case. */
strtab.buffer = mapping + strtab.pos;
sectab.buffer = mapping + sectab.pos;
hdr.buffer = mapping;
}
}
#endif
}
return !get_error ();
}
/* Read at current position into BUFFER. Return true on success. */
const char *
elf_in::read (data *data, unsigned pos, unsigned length)
{
#if MAPPED_READING
if (pos + length > hdr.pos)
{
set_error (EINVAL);
return NULL;
}
#else
if (pos != ~0u && lseek (fd, pos, SEEK_SET) < 0)
{
set_error (errno);
return NULL;
}
#endif
grow (*data, length);
#if MAPPED_READING
data->buffer = hdr.buffer + pos;
#else
if (::read (fd, data->buffer, data->size) != ssize_t (length))
{
set_error (errno);
shrink (*data);
return NULL;
}
#endif
return data->buffer;
}
/* Read section SNUM of TYPE. Return section pointer or NULL on error. */
const elf::section *
elf_in::find (unsigned snum, unsigned type)
{
const section *sec = get_section (snum);
if (!snum || !sec || sec->type != type)
return NULL;
return sec;
}
/* Find a section NAME and TYPE. Return section number, or zero on
failure. */
unsigned
elf_in::find (const char *sname)
{
for (unsigned pos = sectab.size; pos -= sizeof (section); )
{
const section *sec
= reinterpret_cast<const section *> (§ab.buffer[pos]);
if (0 == strcmp (sname, name (sec->name)))
return pos / sizeof (section);
}
return 0;
}
/* Begin reading file. Verify header. Pull in section and string
tables. Return true on success. */
bool
elf_in::begin (location_t loc)
{
if (!parent::begin ())
return false;
struct stat stat;
unsigned size = 0;
if (!fstat (fd, &stat))
{
#if !defined (HOST_LACKS_INODE_NUMBERS)
device = stat.st_dev;
inode = stat.st_ino;
#endif
/* Never generate files > 4GB, check we've not been given one. */
if (stat.st_size == unsigned (stat.st_size))
size = unsigned (stat.st_size);
}
#if MAPPED_READING
/* MAP_SHARED so that the file is backing store. If someone else
concurrently writes it, they're wrong. */
void *mapping = mmap (NULL, size, PROT_READ, MAP_SHARED, fd, 0);
if (mapping == MAP_FAILED)
{
fail:
set_error (errno);
return false;
}
/* We'll be hopping over this randomly. Some systems declare the
first parm as char *, and other declare it as void *. */
if (madvise (reinterpret_cast <char *> (mapping), size, MADV_RANDOM))
goto fail;
hdr.buffer = (char *)mapping;
#else
read (&hdr, 0, sizeof (header));
#endif
hdr.pos = size; /* Record size of the file. */
const header *h = reinterpret_cast<const header *> (hdr.buffer);
if (!h)
return false;
if (h->ident.magic[0] != 0x7f
|| h->ident.magic[1] != 'E'
|| h->ident.magic[2] != 'L'
|| h->ident.magic[3] != 'F')
{
error_at (loc, "not Encapsulated Lazy Records of Named Declarations");
failed:
shrink (hdr);
return false;
}
/* We expect a particular format -- the ELF is not intended to be
distributable. */
if (h->ident.klass != MY_CLASS
|| h->ident.data != MY_ENDIAN
|| h->ident.version != EV_CURRENT
|| h->type != ET_NONE
|| h->machine != EM_NONE
|| h->ident.osabi != OSABI_NONE)
{
error_at (loc, "unexpected encapsulation format or type");
goto failed;
}
int e = -1;
if (!h->shoff || h->shentsize != sizeof (section))
{
malformed:
set_error (e);
error_at (loc, "encapsulation is malformed");
goto failed;
}
unsigned strndx = h->shstrndx;
unsigned shnum = h->shnum;
if (shnum == SHN_XINDEX)
{
if (!read (§ab, h->shoff, sizeof (section)))
{
section_table_fail:
e = errno;
goto malformed;
}
shnum = get_section (0)->size;
/* Freeing does mean we'll re-read it in the case we're not
mapping, but this is going to be rare. */
shrink (sectab);
}
if (!shnum)
goto malformed;
if (!read (§ab, h->shoff, shnum * sizeof (section)))
goto section_table_fail;
if (strndx == SHN_XINDEX)
strndx = get_section (0)->link;
if (!read (&strtab, find (strndx, SHT_STRTAB)))
goto malformed;
/* The string table should be at least one byte, with NUL chars
at either end. */
if (!(strtab.size && !strtab.buffer[0]
&& !strtab.buffer[strtab.size - 1]))
goto malformed;
#if MAPPED_READING
/* Record the offsets of the section and string tables. */
sectab.pos = h->shoff;
strtab.pos = shnum * sizeof (section);
#else
shrink (hdr);
#endif
return true;
}
/* Create a new mapping. */
#if MAPPED_WRITING
void
elf_out::create_mapping (unsigned ext, bool extending)
{
#ifndef HAVE_POSIX_FALLOCATE
#define posix_fallocate(fd,off,len) ftruncate (fd, off + len)
#endif
void *mapping = MAP_FAILED;
if (extending && ext < 1024 * 1024)
{
if (!posix_fallocate (fd, offset, ext * 2))
mapping = mmap (NULL, ext * 2, PROT_READ | PROT_WRITE,
MAP_SHARED, fd, offset);
if (mapping != MAP_FAILED)
ext *= 2;
}
if (mapping == MAP_FAILED)
{
if (!extending || !posix_fallocate (fd, offset, ext))
mapping = mmap (NULL, ext, PROT_READ | PROT_WRITE,
MAP_SHARED, fd, offset);
if (mapping == MAP_FAILED)
{
set_error (errno);
mapping = NULL;
ext = 0;
}
}
#undef posix_fallocate
hdr.buffer = (char *)mapping;
extent = ext;
}
#endif
/* Flush out the current mapping. */
#if MAPPED_WRITING
void
elf_out::remove_mapping ()
{
if (hdr.buffer)
{
/* MS_ASYNC dtrt with the removed mapping, including a
subsequent overlapping remap. */
if (msync (hdr.buffer, extent, MS_ASYNC)
|| munmap (hdr.buffer, extent))
/* We're somewhat screwed at this point. */
set_error (errno);
}
hdr.buffer = NULL;
}
#endif
/* Grow a mapping of PTR to be NEEDED bytes long. This gets
interesting if the new size grows the EXTENT. */
char *
elf_out::grow (char *data, unsigned needed)
{
if (!data)
{
/* First allocation, check we're aligned. */
gcc_checking_assert (!(pos & (SECTION_ALIGN - 1)));
#if MAPPED_WRITING
data = hdr.buffer + (pos - offset);
#endif
}
#if MAPPED_WRITING
unsigned off = data - hdr.buffer;
if (off + needed > extent)
{
/* We need to grow the mapping. */
unsigned lwm = off & ~(page_size - 1);
unsigned hwm = (off + needed + page_size - 1) & ~(page_size - 1);
gcc_checking_assert (hwm > extent);
remove_mapping ();
offset += lwm;
create_mapping (extent < hwm - lwm ? hwm - lwm : extent);
data = hdr.buffer + (off - lwm);
}
#else
data = allocator::grow (data, needed);
#endif
return data;
}
#if MAPPED_WRITING
/* Shrinking is a NOP. */
void
elf_out::shrink (char *)
{
}
#endif
/* Write S of length L to the strtab buffer. L must include the ending
NUL, if that's what you want. */
unsigned
elf_out::strtab_write (const char *s, unsigned l)
{
if (strtab.pos + l > strtab.size)
data::simple_memory.grow (strtab, strtab.pos + l, false);
memcpy (strtab.buffer + strtab.pos, s, l);
unsigned res = strtab.pos;
strtab.pos += l;
return res;
}
/* Write qualified name of decl. INNER >0 if this is a definition, <0
if this is a qualifier of an outer name. */
void
elf_out::strtab_write (tree decl, int inner)
{
tree ctx = CP_DECL_CONTEXT (decl);
if (TYPE_P (ctx))
ctx = TYPE_NAME (ctx);
if (ctx != global_namespace)
strtab_write (ctx, -1);
tree name = DECL_NAME (decl);
if (!name)
name = DECL_ASSEMBLER_NAME_RAW (decl);
strtab_write (IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name));
if (inner)
strtab_write (&"::{}"[inner+1], 2);
}
/* Map IDENTIFIER IDENT to strtab offset. Inserts into strtab if not
already there. */
unsigned
elf_out::name (tree ident)
{
unsigned res = 0;
if (ident)
{
bool existed;
int *slot = &identtab.get_or_insert (ident, &existed);
if (!existed)
*slot = strtab_write (IDENTIFIER_POINTER (ident),
IDENTIFIER_LENGTH (ident) + 1);
res = *slot;
}
return res;
}
/* Map LITERAL to strtab offset. Does not detect duplicates and
expects LITERAL to remain live until strtab is written out. */
unsigned
elf_out::name (const char *literal)
{
return strtab_write (literal, strlen (literal) + 1);
}
/* Map a DECL's qualified name to strtab offset. Does not detect
duplicates. */
unsigned
elf_out::qualified_name (tree decl, bool is_defn)
{
gcc_checking_assert (DECL_P (decl) && decl != global_namespace);
unsigned result = strtab.pos;
strtab_write (decl, is_defn);
strtab_write ("", 1);
return result;
}
/* Add section to file. Return section number. TYPE & NAME identify
the section. OFF and SIZE identify the file location of its
data. FLAGS contains additional info. */
unsigned
elf_out::add (unsigned type, unsigned name, unsigned off, unsigned size,
unsigned flags)
{
gcc_checking_assert (!(off & (SECTION_ALIGN - 1)));
if (sectab.pos + sizeof (section) > sectab.size)
data::simple_memory.grow (sectab, sectab.pos + sizeof (section), false);
section *sec = reinterpret_cast<section *> (sectab.buffer + sectab.pos);
memset (sec, 0, sizeof (section));
sec->type = type;
sec->flags = flags;
sec->name = name;
sec->offset = off;
sec->size = size;
if (flags & SHF_STRINGS)
sec->entsize = 1;
unsigned res = sectab.pos;
sectab.pos += sizeof (section);
return res / sizeof (section);
}
/* Pad to the next alignment boundary, then write BUFFER to disk.
Return the position of the start of the write, or zero on failure. */
unsigned
elf_out::write (const data &buffer)
{
#if MAPPED_WRITING
/* HDR is always mapped. */
if (&buffer != &hdr)
{
bytes_out out (this);
grow (out, buffer.pos, true);
if (out.buffer)
memcpy (out.buffer, buffer.buffer, buffer.pos);
shrink (out);
}
else
/* We should have been aligned during the first allocation. */
gcc_checking_assert (!(pos & (SECTION_ALIGN - 1)));
#else
if (::write (fd, buffer.buffer, buffer.pos) != ssize_t (buffer.pos))
{
set_error (errno);
return 0;
}
#endif
unsigned res = pos;
pos += buffer.pos;
if (unsigned padding = -pos & (SECTION_ALIGN - 1))
{
#if !MAPPED_WRITING
/* Align the section on disk, should help the necessary copies.
fseeking to extend is non-portable. */
static char zero[SECTION_ALIGN];
if (::write (fd, &zero, padding) != ssize_t (padding))
set_error (errno);
#endif
pos += padding;
}
return res;
}
/* Write a streaming buffer. It must be using us as an allocator. */
#if MAPPED_WRITING
unsigned
elf_out::write (const bytes_out &buf)
{
gcc_checking_assert (buf.memory == this);
/* A directly mapped buffer. */
gcc_checking_assert (buf.buffer - hdr.buffer >= 0
&& buf.buffer - hdr.buffer + buf.size <= extent);
unsigned res = pos;
pos += buf.pos;
/* Align up. We're not going to advance into the next page. */
pos += -pos & (SECTION_ALIGN - 1);
return res;
}
#endif
/* Write data and add section. STRING_P is true for a string
section, false for PROGBITS. NAME identifies the section (0 is the
empty name). DATA is the contents. Return section number or 0 on
failure (0 is the undef section). */
unsigned
elf_out::add (const bytes_out &data, bool string_p, unsigned name)
{
unsigned off = write (data);
return add (string_p ? SHT_STRTAB : SHT_PROGBITS, name,
off, data.pos, string_p ? SHF_STRINGS : SHF_NONE);
}
/* Begin writing the file. Initialize the section table and write an
empty header. Return false on failure. */
bool
elf_out::begin ()
{
if (!parent::begin ())
return false;
/* Let the allocators pick a default. */
data::simple_memory.grow (strtab, 0, false);
data::simple_memory.grow (sectab, 0, false);
/* The string table starts with an empty string. */
name ("");
/* Create the UNDEF section. */
add (SHT_NONE);
#if MAPPED_WRITING
/* Start a mapping. */
create_mapping (EXPERIMENT (page_size,
(32767 + page_size) & ~(page_size - 1)));
if (!hdr.buffer)
return false;
#endif
/* Write an empty header. */
grow (hdr, sizeof (header), true);
header *h = reinterpret_cast<header *> (hdr.buffer);
memset (h, 0, sizeof (header));
hdr.pos = hdr.size;
write (hdr);
return !get_error ();
}
/* Finish writing the file. Write out the string & section tables.
Fill in the header. Return true on error. */
bool
elf_out::end ()
{
if (fd >= 0)
{
/* Write the string table. */
unsigned strnam = name (".strtab");
unsigned stroff = write (strtab);
unsigned strndx = add (SHT_STRTAB, strnam, stroff, strtab.pos,
SHF_STRINGS);
/* Store escape values in section[0]. */
if (strndx >= SHN_LORESERVE)
{
reinterpret_cast<section *> (sectab.buffer)->link = strndx;
strndx = SHN_XINDEX;
}
unsigned shnum = sectab.pos / sizeof (section);
if (shnum >= SHN_LORESERVE)
{
reinterpret_cast<section *> (sectab.buffer)->size = shnum;
shnum = SHN_XINDEX;
}
unsigned shoff = write (sectab);
#if MAPPED_WRITING
if (offset)
{
remove_mapping ();
offset = 0;
create_mapping ((sizeof (header) + page_size - 1) & ~(page_size - 1),
false);
}
unsigned length = pos;
#else
if (lseek (fd, 0, SEEK_SET) < 0)
set_error (errno);
#endif
/* Write header. */
if (!get_error ())
{
/* Write the correct header now. */
header *h = reinterpret_cast<header *> (hdr.buffer);
h->ident.magic[0] = 0x7f;
h->ident.magic[1] = 'E'; /* Elrond */
h->ident.magic[2] = 'L'; /* is an */
h->ident.magic[3] = 'F'; /* elf. */
h->ident.klass = MY_CLASS;
h->ident.data = MY_ENDIAN;
h->ident.version = EV_CURRENT;
h->ident.osabi = OSABI_NONE;
h->type = ET_NONE;
h->machine = EM_NONE;
h->version = EV_CURRENT;
h->shoff = shoff;
h->ehsize = sizeof (header);
h->shentsize = sizeof (section);
h->shnum = shnum;
h->shstrndx = strndx;
pos = 0;
write (hdr);
}
#if MAPPED_WRITING
remove_mapping ();
if (ftruncate (fd, length))
set_error (errno);
#endif
}
data::simple_memory.shrink (sectab);
data::simple_memory.shrink (strtab);
return parent::end ();
}
/********************************************************************/
/* A dependency set. This is used during stream out to determine the
connectivity of the graph. Every namespace-scope declaration that
needs writing has a depset. The depset is filled with the (depsets
of) declarations within this module that it references. For a
declaration that'll generally be named types. For definitions
it'll also be declarations in the body.
From that we can convert the graph to a DAG, via determining the
Strongly Connected Clusters. Each cluster is streamed
independently, and thus we achieve lazy loading.
Other decls that get a depset are namespaces themselves and
unnameable declarations. */
class depset {
private:
tree entity; /* Entity, or containing namespace. */
uintptr_t discriminator; /* Flags or identifier. */
public:
/* The kinds of entity the depset could describe. The ordering is
significant, see entity_kind_name. */
enum entity_kind
{
EK_DECL, /* A decl. */
EK_SPECIALIZATION, /* A specialization. */
EK_PARTIAL, /* A partial specialization. */
EK_USING, /* A using declaration (at namespace scope). */
EK_NAMESPACE, /* A namespace. */
EK_REDIRECT, /* Redirect to a template_decl. */
EK_EXPLICIT_HWM,
EK_BINDING = EK_EXPLICIT_HWM, /* Implicitly encoded. */
EK_FOR_BINDING, /* A decl being inserted for a binding. */
EK_INNER_DECL, /* A decl defined outside of its imported
context. */
EK_DIRECT_HWM = EK_PARTIAL + 1,
EK_BITS = 3 /* Only need to encode below EK_EXPLICIT_HWM. */
};
private:
/* Placement of bit fields in discriminator. */
enum disc_bits
{
DB_ZERO_BIT, /* Set to disambiguate identifier from flags */
DB_SPECIAL_BIT, /* First dep slot is special. */
DB_KIND_BIT, /* Kind of the entity. */
DB_KIND_BITS = EK_BITS,
DB_DEFN_BIT = DB_KIND_BIT + DB_KIND_BITS,
DB_IS_MEMBER_BIT, /* Is an out-of-class member. */
DB_IS_INTERNAL_BIT, /* It is an (erroneous)
internal-linkage entity. */
DB_REFS_INTERNAL_BIT, /* Refers to an internal-linkage
entity. */
DB_IMPORTED_BIT, /* An imported entity. */
DB_UNREACHED_BIT, /* A yet-to-be reached entity. */
DB_HIDDEN_BIT, /* A hidden binding. */
/* The following bits are not independent, but enumerating them is
awkward. */
DB_ALIAS_TMPL_INST_BIT, /* An alias template instantiation. */
DB_ALIAS_SPEC_BIT, /* Specialization of an alias template
(in both spec tables). */
DB_TYPE_SPEC_BIT, /* Specialization in the type table.
*/
DB_FRIEND_SPEC_BIT, /* An instantiated template friend. */
};
public:
/* The first slot is special for EK_SPECIALIZATIONS it is a
spec_entry pointer. It is not relevant for the SCC
determination. */
vec<depset *> deps; /* Depsets we reference. */
public:
unsigned cluster; /* Strongly connected cluster, later entity number */
unsigned section; /* Section written to. */
/* During SCC construction, section is lowlink, until the depset is
removed from the stack. See Tarjan algorithm for details. */
private:
/* Construction via factories. Destruction via hash traits. */
depset (tree entity);
~depset ();
public:
static depset *make_binding (tree, tree);
static depset *make_entity (tree, entity_kind, bool = false);
/* Late setting a binding name -- /then/ insert into hash! */
inline void set_binding_name (tree name)
{
gcc_checking_assert (!get_name ());
discriminator = reinterpret_cast<uintptr_t> (name);
}
private:
template<unsigned I> void set_flag_bit ()
{
gcc_checking_assert (I < 2 || !is_binding ());
discriminator |= 1u << I;
}
template<unsigned I> void clear_flag_bit ()
{
gcc_checking_assert (I < 2 || !is_binding ());
discriminator &= ~(1u << I);
}
template<unsigned I> bool get_flag_bit () const
{
gcc_checking_assert (I < 2 || !is_binding ());
return bool ((discriminator >> I) & 1);
}
public:
bool is_binding () const
{
return !get_flag_bit<DB_ZERO_BIT> ();
}
entity_kind get_entity_kind () const
{
if (is_binding ())
return EK_BINDING;
return entity_kind ((discriminator >> DB_KIND_BIT) & ((1u << EK_BITS) - 1));
}
const char *entity_kind_name () const;
public:
bool has_defn () const
{
return get_flag_bit<DB_DEFN_BIT> ();
}
public:
/* This class-member is defined here, but the class was imported. */
bool is_member () const
{
gcc_checking_assert (get_entity_kind () == EK_DECL);
return get_flag_bit<DB_IS_MEMBER_BIT> ();
}
public:
bool is_internal () const
{
return get_flag_bit<DB_IS_INTERNAL_BIT> ();
}
bool refs_internal () const
{
return get_flag_bit<DB_REFS_INTERNAL_BIT> ();
}
bool is_import () const
{
return get_flag_bit<DB_IMPORTED_BIT> ();
}
bool is_unreached () const
{
return get_flag_bit<DB_UNREACHED_BIT> ();
}
bool is_alias_tmpl_inst () const
{
return get_flag_bit<DB_ALIAS_TMPL_INST_BIT> ();
}
bool is_alias () const
{
return get_flag_bit<DB_ALIAS_SPEC_BIT> ();
}
bool is_hidden () const
{
return get_flag_bit<DB_HIDDEN_BIT> ();
}
bool is_type_spec () const
{
return get_flag_bit<DB_TYPE_SPEC_BIT> ();
}
bool is_friend_spec () const
{
return get_flag_bit<DB_FRIEND_SPEC_BIT> ();
}
public:
/* We set these bit outside of depset. */
void set_hidden_binding ()
{
set_flag_bit<DB_HIDDEN_BIT> ();
}
void clear_hidden_binding ()
{
clear_flag_bit<DB_HIDDEN_BIT> ();
}
public:
bool is_special () const
{
return get_flag_bit<DB_SPECIAL_BIT> ();
}
void set_special ()
{
set_flag_bit<DB_SPECIAL_BIT> ();
}
public:
tree get_entity () const
{
return entity;
}
tree get_name () const
{
gcc_checking_assert (is_binding ());
return reinterpret_cast <tree> (discriminator);
}
public:
/* Traits for a hash table of pointers to bindings. */
struct traits {
/* Each entry is a pointer to a depset. */
typedef depset *value_type;
/* We lookup by container:maybe-identifier pair. */
typedef std::pair<tree,tree> compare_type;
static const bool empty_zero_p = true;
/* hash and equality for compare_type. */
inline static hashval_t hash (const compare_type &p)
{
hashval_t h = pointer_hash<tree_node>::hash (p.first);
if (p.second)
{
hashval_t nh = IDENTIFIER_HASH_VALUE (p.second);
h = iterative_hash_hashval_t (h, nh);
}
return h;
}
inline static bool equal (const value_type b, const compare_type &p)
{
if (b->entity != p.first)
return false;
if (p.second)
return b->discriminator == reinterpret_cast<uintptr_t> (p.second);
else
return !b->is_binding ();
}
/* (re)hasher for a binding itself. */
inline static hashval_t hash (const value_type b)
{
hashval_t h = pointer_hash<tree_node>::hash (b->entity);
if (b->is_binding ())
{
hashval_t nh = IDENTIFIER_HASH_VALUE (b->get_name ());
h = iterative_hash_hashval_t (h, nh);
}
return h;
}
/* Empty via NULL. */
static inline void mark_empty (value_type &p) {p = NULL;}
static inline bool is_empty (value_type p) {return !p;}
/* Nothing is deletable. Everything is insertable. */
static bool is_deleted (value_type) { return false; }
static void mark_deleted (value_type) { gcc_unreachable (); }
/* We own the entities in the hash table. */
static void remove (value_type p)
{
delete (p);
}
};
public:
class hash : public hash_table<traits> {
typedef traits::compare_type key_t;
typedef hash_table<traits> parent;
public:
vec<depset *> worklist; /* Worklist of decls to walk. */
hash *chain; /* Original table. */
depset *current; /* Current depset being depended. */
unsigned section; /* When writing out, the section. */
bool sneakoscope; /* Detecting dark magic (of a voldemort). */
bool reached_unreached; /* We reached an unreached entity. */
public:
hash (size_t size, hash *c = NULL)
: parent (size), chain (c), current (NULL), section (0),
sneakoscope (false), reached_unreached (false)
{
worklist.create (size);
}
~hash ()
{
worklist.release ();
}
public:
bool is_key_order () const
{
return chain != NULL;
}
private:
depset **entity_slot (tree entity, bool = true);
depset **binding_slot (tree ctx, tree name, bool = true);
depset *maybe_add_declaration (tree decl);
public:
depset *find_dependency (tree entity);
depset *find_binding (tree ctx, tree name);
depset *make_dependency (tree decl, entity_kind);
void add_dependency (depset *);
public:
void add_mergeable (depset *);
depset *add_dependency (tree decl, entity_kind);
void add_namespace_context (depset *, tree ns);
private:
static bool add_binding_entity (tree, WMB_Flags, void *);
public:
bool add_namespace_entities (tree ns, bitmap partitions);
void add_specializations (bool decl_p);
void add_partial_entities (vec<tree, va_gc> *);
void add_class_entities (vec<tree, va_gc> *);
public:
void find_dependencies (module_state *);
bool finalize_dependencies ();
vec<depset *> connect ();
};
public:
struct tarjan {
vec<depset *> result;
vec<depset *> stack;
unsigned index;
tarjan (unsigned size)
: index (0)
{
result.create (size);
stack.create (50);
}
~tarjan ()
{
gcc_assert (!stack.length ());
stack.release ();
}
public:
void connect (depset *);
};
};
inline
depset::depset (tree entity)
:entity (entity), discriminator (0), cluster (0), section (0)
{
deps.create (0);
}
inline
depset::~depset ()
{
deps.release ();
}
const char *
depset::entity_kind_name () const
{
/* Same order as entity_kind. */
static const char *const names[] =
{"decl", "specialization", "partial", "using",
"namespace", "redirect", "binding"};
entity_kind kind = get_entity_kind ();
gcc_checking_assert (kind < ARRAY_SIZE (names));
return names[kind];
}
/* Create a depset for a namespace binding NS::NAME. */
depset *depset::make_binding (tree ns, tree name)
{
depset *binding = new depset (ns);
binding->discriminator = reinterpret_cast <uintptr_t> (name);
return binding;
}
depset *depset::make_entity (tree entity, entity_kind ek, bool is_defn)
{
depset *r = new depset (entity);
r->discriminator = ((1 << DB_ZERO_BIT)
| (ek << DB_KIND_BIT)
| is_defn << DB_DEFN_BIT);
return r;
}
class pending_key
{
public:
tree ns;
tree id;
};
template<>
struct default_hash_traits<pending_key>
{
using value_type = pending_key;
static const bool empty_zero_p = false;
static hashval_t hash (const value_type &k)
{
hashval_t h = IDENTIFIER_HASH_VALUE (k.id);
h = iterative_hash_hashval_t (DECL_UID (k.ns), h);
return h;
}
static bool equal (const value_type &k, const value_type &l)
{
return k.ns == l.ns && k.id == l.id;
}
static void mark_empty (value_type &k)
{
k.ns = k.id = NULL_TREE;
}
static void mark_deleted (value_type &k)
{
k.ns = NULL_TREE;
gcc_checking_assert (k.id);
}
static bool is_empty (const value_type &k)
{
return k.ns == NULL_TREE && k.id == NULL_TREE;
}
static bool is_deleted (const value_type &k)
{
return k.ns == NULL_TREE && k.id != NULL_TREE;
}
static void remove (value_type &)
{
}
};
typedef hash_map<pending_key, auto_vec<unsigned>> pending_map_t;
/* Not-loaded entities that are keyed to a namespace-scope
identifier. See module_state::write_pendings for details. */
pending_map_t *pending_table;
/* Decls that need some post processing once a batch of lazy loads has
completed. */
vec<tree, va_heap, vl_embed> *post_load_decls;
/* Some entities are keyed to another entitity for ODR purposes.
For example, at namespace scope, 'inline auto var = []{};', that
lambda is keyed to 'var', and follows its ODRness. */
typedef hash_map<tree, auto_vec<tree>> keyed_map_t;
static keyed_map_t *keyed_table;
/********************************************************************/
/* Tree streaming. The tree streaming is very specific to the tree
structures themselves. A tag indicates the kind of tree being
streamed. -ve tags indicate backreferences to already-streamed
trees. Backreferences are auto-numbered. */
/* Tree tags. */
enum tree_tag {
tt_null, /* NULL_TREE. */
tt_fixed, /* Fixed vector index. */
tt_node, /* By-value node. */
tt_decl, /* By-value mergeable decl. */
tt_tpl_parm, /* Template parm. */
/* The ordering of the following 4 is relied upon in
trees_out::tree_node. */
tt_id, /* Identifier node. */
tt_conv_id, /* Conversion operator name. */
tt_anon_id, /* Anonymous name. */
tt_lambda_id, /* Lambda name. */
tt_typedef_type, /* A (possibly implicit) typedefed type. */
tt_derived_type, /* A type derived from another type. */
tt_variant_type, /* A variant of another type. */
tt_tinfo_var, /* Typeinfo object. */
tt_tinfo_typedef, /* Typeinfo typedef. */
tt_ptrmem_type, /* Pointer to member type. */
tt_nttp_var, /* NTTP_OBJECT VAR_DECL. */
tt_parm, /* Function parameter or result. */
tt_enum_value, /* An enum value. */
tt_enum_decl, /* An enum decl. */
tt_data_member, /* Data member/using-decl. */
tt_binfo, /* A BINFO. */
tt_vtable, /* A vtable. */
tt_thunk, /* A thunk. */
tt_clone_ref,
tt_entity, /* A extra-cluster entity. */
tt_template, /* The TEMPLATE_RESULT of a template. */
};
enum walk_kind {
WK_none, /* No walk to do (a back- or fixed-ref happened). */
WK_normal, /* Normal walk (by-name if possible). */
WK_value, /* By-value walk. */
};
enum merge_kind
{
MK_unique, /* Known unique. */
MK_named, /* Found by CTX, NAME + maybe_arg types etc. */
MK_field, /* Found by CTX and index on TYPE_FIELDS */
MK_vtable, /* Found by CTX and index on TYPE_VTABLES */
MK_as_base, /* Found by CTX. */
MK_partial,
MK_enum, /* Found by CTX, & 1stMemberNAME. */
MK_keyed, /* Found by key & index. */
MK_friend_spec, /* Like named, but has a tmpl & args too. */
MK_local_friend, /* Found by CTX, index. */
MK_indirect_lwm = MK_enum,
/* Template specialization kinds below. These are all found via
primary template and specialization args. */
MK_template_mask = 0x10, /* A template specialization. */
MK_tmpl_decl_mask = 0x4, /* In decl table. */
MK_tmpl_alias_mask = 0x2, /* Also in type table */
MK_tmpl_tmpl_mask = 0x1, /* We want TEMPLATE_DECL. */
MK_type_spec = MK_template_mask,
MK_decl_spec = MK_template_mask | MK_tmpl_decl_mask,
MK_alias_spec = MK_decl_spec | MK_tmpl_alias_mask,
MK_hwm = 0x20
};
/* This is more than a debugging array. NULLs are used to determine
an invalid merge_kind number. */
static char const *const merge_kind_name[MK_hwm] =
{
"unique", "named", "field", "vtable", /* 0...3 */
"asbase", "partial", "enum", "attached", /* 4...7 */
"friend spec", "local friend", NULL, NULL, /* 8...11 */
NULL, NULL, NULL, NULL,
"type spec", "type tmpl spec", /* 16,17 type (template). */
NULL, NULL,
"decl spec", "decl tmpl spec", /* 20,21 decl (template). */
"alias spec", "alias tmpl spec", /* 22,23 alias (template). */
NULL, NULL, NULL, NULL,
NULL, NULL, NULL, NULL,
};
/* Mergeable entity location data. */
struct merge_key {
cp_ref_qualifier ref_q : 2;
unsigned index;
tree ret; /* Return type, if appropriate. */
tree args; /* Arg types, if appropriate. */
tree constraints; /* Constraints. */
merge_key ()
:ref_q (REF_QUAL_NONE), index (0),
ret (NULL_TREE), args (NULL_TREE),
constraints (NULL_TREE)
{
}
};
/* Hashmap of merged duplicates. Usually decls, but can contain
BINFOs. */
typedef hash_map<tree,uintptr_t,
simple_hashmap_traits<nodel_ptr_hash<tree_node>,uintptr_t> >
duplicate_hash_map;
/* Tree stream reader. Note that reading a stream doesn't mark the
read trees with TREE_VISITED. Thus it's quite safe to have
multiple concurrent readers. Which is good, because lazy
loading. */
class trees_in : public bytes_in {
typedef bytes_in parent;
private:
module_state *state; /* Module being imported. */
vec<tree> back_refs; /* Back references. */
duplicate_hash_map *duplicates; /* Map from existings to duplicate. */
vec<tree> post_decls; /* Decls to post process. */
unsigned unused; /* Inhibit any interior TREE_USED
marking. */
public:
trees_in (module_state *);
~trees_in ();
public:
int insert (tree);
tree back_ref (int);
private:
tree start (unsigned = 0);
public:
/* Needed for binfo writing */
bool core_bools (tree);
private:
/* Stream tree_core, lang_decl_specific and lang_type_specific
bits. */
bool core_vals (tree);
bool lang_type_bools (tree);
bool lang_type_vals (tree);
bool lang_decl_bools (tree);
bool lang_decl_vals (tree);
bool lang_vals (tree);
bool tree_node_bools (tree);
bool tree_node_vals (tree);
tree tree_value ();
tree decl_value ();
tree tpl_parm_value ();
private:
tree chained_decls (); /* Follow DECL_CHAIN. */
vec<tree, va_heap> *vec_chained_decls ();
vec<tree, va_gc> *tree_vec (); /* vec of tree. */
vec<tree_pair_s, va_gc> *tree_pair_vec (); /* vec of tree_pair. */
tree tree_list (bool has_purpose);
public:
/* Read a tree node. */
tree tree_node (bool is_use = false);
private:
bool install_entity (tree decl);
tree tpl_parms (unsigned &tpl_levels);
bool tpl_parms_fini (tree decl, unsigned tpl_levels);
bool tpl_header (tree decl, unsigned *tpl_levels);
int fn_parms_init (tree);
void fn_parms_fini (int tag, tree fn, tree existing, bool has_defn);
unsigned add_indirect_tpl_parms (tree);
public:
bool add_indirects (tree);
public:
/* Serialize various definitions. */
bool read_definition (tree decl);
private:
bool is_matching_decl (tree existing, tree decl, bool is_typedef);
static bool install_implicit_member (tree decl);
bool read_function_def (tree decl, tree maybe_template);
bool read_var_def (tree decl, tree maybe_template);
bool read_class_def (tree decl, tree maybe_template);
bool read_enum_def (tree decl, tree maybe_template);
public:
tree decl_container ();
tree key_mergeable (int tag, merge_kind, tree decl, tree inner, tree type,
tree container, bool is_attached);
unsigned binfo_mergeable (tree *);
private:
uintptr_t *find_duplicate (tree existing);
void register_duplicate (tree decl, tree existing);
/* Mark as an already diagnosed bad duplicate. */
void unmatched_duplicate (tree existing)
{
*find_duplicate (existing) |= 1;
}
public:
bool is_duplicate (tree decl)
{
return find_duplicate (decl) != NULL;
}
tree maybe_duplicate (tree decl)
{
if (uintptr_t *dup = find_duplicate (decl))
return reinterpret_cast<tree> (*dup & ~uintptr_t (1));
return decl;
}
tree odr_duplicate (tree decl, bool has_defn);
public:
/* Return the next decl to postprocess, or NULL. */
tree post_process ()
{
return post_decls.length () ? post_decls.pop () : NULL_TREE;
}
private:
/* Register DECL for postprocessing. */
void post_process (tree decl)
{
post_decls.safe_push (decl);
}
private:
void assert_definition (tree, bool installing);
};
trees_in::trees_in (module_state *state)
:parent (), state (state), unused (0)
{
duplicates = NULL;
back_refs.create (500);
post_decls.create (0);
}
trees_in::~trees_in ()
{
delete (duplicates);
back_refs.release ();
post_decls.release ();
}
/* Tree stream writer. */
class trees_out : public bytes_out {
typedef bytes_out parent;
private:
module_state *state; /* The module we are writing. */
ptr_int_hash_map tree_map; /* Trees to references */
depset::hash *dep_hash; /* Dependency table. */
int ref_num; /* Back reference number. */
unsigned section;
#if CHECKING_P
int importedness; /* Checker that imports not occurring
inappropriately. +ve imports ok,
-ve imports not ok. */
#endif
public:
trees_out (allocator *, module_state *, depset::hash &deps, unsigned sec = 0);
~trees_out ();
private:
void mark_trees ();
void unmark_trees ();
public:
/* Hey, let's ignore the well known STL iterator idiom. */
void begin ();
unsigned end (elf_out *sink, unsigned name, unsigned *crc_ptr);
void end ();
public:
enum tags
{
tag_backref = -1, /* Upper bound on the backrefs. */
tag_value = 0, /* Write by value. */
tag_fixed /* Lower bound on the fixed trees. */
};
public:
bool is_key_order () const
{
return dep_hash->is_key_order ();
}
public:
int insert (tree, walk_kind = WK_normal);
private:
void start (tree, bool = false);
private:
walk_kind ref_node (tree);
public:
int get_tag (tree);
void set_importing (int i ATTRIBUTE_UNUSED)
{
#if CHECKING_P
importedness = i;
#endif
}
private:
void core_bools (tree);
void core_vals (tree);
void lang_type_bools (tree);
void lang_type_vals (tree);
void lang_decl_bools (tree);
void lang_decl_vals (tree);
void lang_vals (tree);
void tree_node_bools (tree);
void tree_node_vals (tree);
private:
void chained_decls (tree);
void vec_chained_decls (tree);
void tree_vec (vec<tree, va_gc> *);
void tree_pair_vec (vec<tree_pair_s, va_gc> *);
void tree_list (tree, bool has_purpose);
public:
/* Mark a node for by-value walking. */
void mark_by_value (tree);
public:
void tree_node (tree);
private:
void install_entity (tree decl, depset *);
void tpl_parms (tree parms, unsigned &tpl_levels);
void tpl_parms_fini (tree decl, unsigned tpl_levels);
void fn_parms_fini (tree) {}
unsigned add_indirect_tpl_parms (tree);
public:
void add_indirects (tree);
void fn_parms_init (tree);
void tpl_header (tree decl, unsigned *tpl_levels);
public:
merge_kind get_merge_kind (tree decl, depset *maybe_dep);
tree decl_container (tree decl);
void key_mergeable (int tag, merge_kind, tree decl, tree inner,
tree container, depset *maybe_dep);
void binfo_mergeable (tree binfo);
private:
bool decl_node (tree, walk_kind ref);
void type_node (tree);
void tree_value (tree);
void tpl_parm_value (tree);
public:
void decl_value (tree, depset *);
public:
/* Serialize various definitions. */
void write_definition (tree decl);
void mark_declaration (tree decl, bool do_defn);
private:
void mark_function_def (tree decl);
void mark_var_def (tree decl);
void mark_class_def (tree decl);
void mark_enum_def (tree decl);
void mark_class_member (tree decl, bool do_defn = true);
void mark_binfos (tree type);
private:
void write_var_def (tree decl);
void write_function_def (tree decl);
void write_class_def (tree decl);
void write_enum_def (tree decl);
private:
static void assert_definition (tree);
public:
static void instrument ();
private:
/* Tree instrumentation. */
static unsigned tree_val_count;
static unsigned decl_val_count;
static unsigned back_ref_count;
static unsigned null_count;
};
/* Instrumentation counters. */
unsigned trees_out::tree_val_count;
unsigned trees_out::decl_val_count;
unsigned trees_out::back_ref_count;
unsigned trees_out::null_count;
trees_out::trees_out (allocator *mem, module_state *state, depset::hash &deps,
unsigned section)
:parent (mem), state (state), tree_map (500),
dep_hash (&deps), ref_num (0), section (section)
{
#if CHECKING_P
importedness = 0;
#endif
}
trees_out::~trees_out ()
{
}
/********************************************************************/
/* Location. We're aware of the line-map concept and reproduce it
here. Each imported module allocates a contiguous span of ordinary
maps, and of macro maps. adhoc maps are serialized by contents,
not pre-allocated. The scattered linemaps of a module are
coalesced when writing. */
/* I use half-open [first,second) ranges. */
typedef std::pair<unsigned,unsigned> range_t;
/* A range of locations. */
typedef std::pair<location_t,location_t> loc_range_t;
/* Spans of the line maps that are occupied by this TU. I.e. not
within imports. Only extended when in an interface unit.
Interval zero corresponds to the forced header linemap(s). This
is a singleton object. */
class loc_spans {
public:
/* An interval of line maps. The line maps here represent a contiguous
non-imported range. */
struct span {
loc_range_t ordinary; /* Ordinary map location range. */
loc_range_t macro; /* Macro map location range. */
int ordinary_delta; /* Add to ordinary loc to get serialized loc. */
int macro_delta; /* Likewise for macro loc. */
};
private:
vec<span> *spans;
public:
loc_spans ()
/* Do not preallocate spans, as that causes
--enable-detailed-mem-stats problems. */
: spans (nullptr)
{
}
~loc_spans ()
{
delete spans;
}
public:
span &operator[] (unsigned ix)
{
return (*spans)[ix];
}
unsigned length () const
{
return spans->length ();
}
public:
bool init_p () const
{
return spans != nullptr;
}
/* Initializer. */
void init (const line_maps *lmaps, const line_map_ordinary *map);
/* Slightly skewed preprocessed files can cause us to miss an
initialization in some places. Fallback initializer. */
void maybe_init ()
{
if (!init_p ())
init (line_table, nullptr);
}
public:
enum {
SPAN_RESERVED = 0, /* Reserved (fixed) locations. */
SPAN_FIRST = 1, /* LWM of locations to stream */
SPAN_MAIN = 2 /* Main file and onwards. */
};
public:
location_t main_start () const
{
return (*spans)[SPAN_MAIN].ordinary.first;
}
public:
void open (location_t);
void close ();
public:
/* Propagate imported linemaps to us, if needed. */
bool maybe_propagate (module_state *import, location_t loc);
public:
const span *ordinary (location_t);
const span *macro (location_t);
};
static loc_spans spans;
/* Information about ordinary locations we stream out. */
struct ord_loc_info
{
const line_map_ordinary *src; // line map we're based on
unsigned offset; // offset to this line
unsigned span; // number of locs we span
unsigned remap; // serialization
static int compare (const void *a_, const void *b_)
{
auto *a = static_cast<const ord_loc_info *> (a_);
auto *b = static_cast<const ord_loc_info *> (b_);
if (a->src != b->src)
return a->src < b->src ? -1 : +1;
// Ensure no overlap
gcc_checking_assert (a->offset + a->span <= b->offset
|| b->offset + b->span <= a->offset);
gcc_checking_assert (a->offset != b->offset);
return a->offset < b->offset ? -1 : +1;
}
};
struct ord_loc_traits
{
typedef ord_loc_info value_type;
typedef value_type compare_type;
static const bool empty_zero_p = false;
static hashval_t hash (const value_type &v)
{
auto h = pointer_hash<const line_map_ordinary>::hash (v.src);
return iterative_hash_hashval_t (v.offset, h);
}
static bool equal (const value_type &v, const compare_type p)
{
return v.src == p.src && v.offset == p.offset;
}
static void mark_empty (value_type &v)
{
v.src = nullptr;
}
static bool is_empty (value_type &v)
{
return !v.src;
}
static bool is_deleted (value_type &) { return false; }
static void mark_deleted (value_type &) { gcc_unreachable (); }
static void remove (value_type &) {}
};
/* Table keyed by ord_loc_info, used for noting. */
static hash_table<ord_loc_traits> *ord_loc_table;
/* Sorted vector, used for writing. */
static vec<ord_loc_info> *ord_loc_remap;
/* Information about macro locations we stream out. */
struct macro_loc_info
{
const line_map_macro *src; // original expansion
unsigned remap; // serialization
static int compare (const void *a_, const void *b_)
{
auto *a = static_cast<const macro_loc_info *> (a_);
auto *b = static_cast<const macro_loc_info *> (b_);
gcc_checking_assert (MAP_START_LOCATION (a->src)
!= MAP_START_LOCATION (b->src));
if (MAP_START_LOCATION (a->src) < MAP_START_LOCATION (b->src))
return -1;
else
return +1;
}
};
struct macro_loc_traits
{
typedef macro_loc_info value_type;
typedef const line_map_macro *compare_type;
static const bool empty_zero_p = false;
static hashval_t hash (compare_type p)
{
return pointer_hash<const line_map_macro>::hash (p);
}
static hashval_t hash (const value_type &v)
{
return hash (v.src);
}
static bool equal (const value_type &v, const compare_type p)
{
return v.src == p;
}
static void mark_empty (value_type &v)
{
v.src = nullptr;
}
static bool is_empty (value_type &v)
{
return !v.src;
}
static bool is_deleted (value_type &) { return false; }
static void mark_deleted (value_type &) { gcc_unreachable (); }
static void remove (value_type &) {}
};
/* Table keyed by line_map_macro, used for noting. */
static hash_table<macro_loc_traits> *macro_loc_table;
/* Sorted vector, used for writing. */
static vec<macro_loc_info> *macro_loc_remap;
/* Indirection to allow bsearching imports by ordinary location. */
static vec<module_state *> *ool;
/********************************************************************/
/* Data needed by a module during the process of loading. */
struct GTY(()) slurping {
/* Remap import's module numbering to our numbering. Values are
shifted by 1. Bit0 encodes if the import is direct. */
vec<unsigned, va_heap, vl_embed> *
GTY((skip)) remap; /* Module owner remapping. */
elf_in *GTY((skip)) from; /* The elf loader. */
/* This map is only for header imports themselves -- the global
headers bitmap hold it for the current TU. */
bitmap headers; /* Transitive set of direct imports, including
self. Used for macro visibility and
priority. */
/* These objects point into the mmapped area, unless we're not doing
that, or we got frozen or closed. In those cases they point to
buffers we own. */
bytes_in macro_defs; /* Macro definitions. */
bytes_in macro_tbl; /* Macro table. */
/* Location remapping. first->ordinary, second->macro. */
range_t GTY((skip)) loc_deltas;
unsigned current; /* Section currently being loaded. */
unsigned remaining; /* Number of lazy sections yet to read. */
unsigned lru; /* An LRU counter. */
public:
slurping (elf_in *);
~slurping ();
public:
/* Close the ELF file, if it's open. */
void close ()
{
if (from)
{
from->end ();
delete from;
from = NULL;
}
}
public:
void release_macros ();
public:
void alloc_remap (unsigned size)
{
gcc_assert (!remap);
vec_safe_reserve (remap, size);
for (unsigned ix = size; ix--;)
remap->quick_push (0);
}
unsigned remap_module (unsigned owner)
{
if (owner < remap->length ())
return (*remap)[owner] >> 1;
return 0;
}
public:
/* GC allocation. But we must explicitly delete it. */
static void *operator new (size_t x)
{
return ggc_alloc_atomic (x);
}
static void operator delete (void *p)
{
ggc_free (p);
}
};
slurping::slurping (elf_in *from)
: remap (NULL), from (from),
headers (BITMAP_GGC_ALLOC ()), macro_defs (), macro_tbl (),
loc_deltas (0, 0),
current (~0u), remaining (0), lru (0)
{
}
slurping::~slurping ()
{
vec_free (remap);
remap = NULL;
release_macros ();
close ();
}
void slurping::release_macros ()
{
if (macro_defs.size)
elf_in::release (from, macro_defs);
if (macro_tbl.size)
elf_in::release (from, macro_tbl);
}
/* Flags for extensions that end up being streamed. */
enum streamed_extensions {
SE_OPENMP = 1 << 0,
SE_BITS = 1
};
/* Counter indices. */
enum module_state_counts
{
MSC_sec_lwm,
MSC_sec_hwm,
MSC_pendings,
MSC_entities,
MSC_namespaces,
MSC_bindings,
MSC_macros,
MSC_inits,
MSC_HWM
};
/********************************************************************/
struct module_state_config;
/* Increasing levels of loadedness. */
enum module_loadedness {
ML_NONE, /* Not loaded. */
ML_CONFIG, /* Config loaed. */
ML_PREPROCESSOR, /* Preprocessor loaded. */
ML_LANGUAGE, /* Language loaded. */
};
/* Increasing levels of directness (toplevel) of import. */
enum module_directness {
MD_NONE, /* Not direct. */
MD_PARTITION_DIRECT, /* Direct import of a partition. */
MD_DIRECT, /* Direct import. */
MD_PURVIEW_DIRECT, /* direct import in purview. */
};
/* State of a particular module. */
class GTY((chain_next ("%h.parent"), for_user)) module_state {
public:
/* We always import & export ourselves. */
bitmap imports; /* Transitive modules we're importing. */
bitmap exports; /* Subset of that, that we're exporting. */
module_state *parent;
tree name; /* Name of the module. */
slurping *slurp; /* Data for loading. */
const char *flatname; /* Flatname of module. */
char *filename; /* CMI Filename */
/* Indices into the entity_ary. */
unsigned entity_lwm;
unsigned entity_num;
/* Location ranges for this module. adhoc-locs are decomposed, so
don't have a range. */
loc_range_t GTY((skip)) ordinary_locs;
loc_range_t GTY((skip)) macro_locs; // [lwm,num)
/* LOC is first set too the importing location. When initially
loaded it refers to a module loc whose parent is the importing
location. */
location_t loc; /* Location referring to module itself. */
unsigned crc; /* CRC we saw reading it in. */
unsigned mod; /* Module owner number. */
unsigned remap; /* Remapping during writing. */
unsigned short subst; /* Mangle subst if !0. */
/* How loaded this module is. */
enum module_loadedness loadedness : 2;
bool module_p : 1; /* /The/ module of this TU. */
bool header_p : 1; /* Is a header unit. */
bool interface_p : 1; /* An interface. */
bool partition_p : 1; /* A partition. */
/* How directly this module is imported. */
enum module_directness directness : 2;
bool exported_p : 1; /* directness != MD_NONE && exported. */
bool cmi_noted_p : 1; /* We've told the user about the CMI, don't
do it again */
bool active_init_p : 1; /* This module's global initializer needs
calling. */
bool inform_cmi_p : 1; /* Inform of a read/write. */
bool visited_p : 1; /* A walk-once flag. */
/* Record extensions emitted or permitted. */
unsigned extensions : SE_BITS;
/* 14 bits used, 2 bits remain */
public:
module_state (tree name, module_state *, bool);
~module_state ();
public:
void release ()
{
imports = exports = NULL;
slurped ();
}
void slurped ()
{
delete slurp;
slurp = NULL;
}
elf_in *from () const
{
return slurp->from;
}
public:
/* Kind of this module. */
bool is_module () const
{
return module_p;
}
bool is_header () const
{
return header_p;
}
bool is_interface () const
{
return interface_p;
}
bool is_partition () const
{
return partition_p;
}
/* How this module is used in the current TU. */
bool is_exported () const
{
return exported_p;
}
bool is_direct () const
{
return directness >= MD_DIRECT;
}
bool is_purview_direct () const
{
return directness == MD_PURVIEW_DIRECT;
}
bool is_partition_direct () const
{
return directness == MD_PARTITION_DIRECT;
}
public:
/* Is this a real module? */
bool has_location () const
{
return loc != UNKNOWN_LOCATION;
}
public:
bool check_not_purview (location_t loc);
public:
void mangle (bool include_partition);
public:
void set_import (module_state const *, bool is_export);
void announce (const char *) const;
public:
/* Read and write module. */
void write_begin (elf_out *to, cpp_reader *,
module_state_config &, unsigned &crc);
void write_end (elf_out *to, cpp_reader *,
module_state_config &, unsigned &crc);
bool read_initial (cpp_reader *);
bool read_preprocessor (bool);
bool read_language (bool);
public:
/* Read a section. */
bool load_section (unsigned snum, binding_slot *mslot);
/* Lazily read a section. */
bool lazy_load (unsigned index, binding_slot *mslot);
public:
/* Juggle a limited number of file numbers. */
static void freeze_an_elf ();
bool maybe_defrost ();
public:
void maybe_completed_reading ();
bool check_read (bool outermost, bool ok);
private:
/* The README, for human consumption. */
void write_readme (elf_out *to, cpp_reader *, const char *dialect);
void write_env (elf_out *to);
private:
/* Import tables. */
void write_imports (bytes_out &cfg, bool direct);
unsigned read_imports (bytes_in &cfg, cpp_reader *, line_maps *maps);
private:
void write_imports (elf_out *to, unsigned *crc_ptr);
bool read_imports (cpp_reader *, line_maps *);
private:
void write_partitions (elf_out *to, unsigned, unsigned *crc_ptr);
bool read_partitions (unsigned);
private:
void write_config (elf_out *to, struct module_state_config &, unsigned crc);
bool read_config (struct module_state_config &);
static void write_counts (elf_out *to, unsigned [MSC_HWM], unsigned *crc_ptr);
bool read_counts (unsigned *);
public:
void note_cmi_name ();
private:
static unsigned write_bindings (elf_out *to, vec<depset *> depsets,
unsigned *crc_ptr);
bool read_bindings (unsigned count, unsigned lwm, unsigned hwm);
static void write_namespace (bytes_out &sec, depset *ns_dep);
tree read_namespace (bytes_in &sec);
void write_namespaces (elf_out *to, vec<depset *> spaces,
unsigned, unsigned *crc_ptr);
bool read_namespaces (unsigned);
void intercluster_seed (trees_out &sec, unsigned index, depset *dep);
unsigned write_cluster (elf_out *to, depset *depsets[], unsigned size,
depset::hash &, unsigned *counts, unsigned *crc_ptr);
bool read_cluster (unsigned snum);
private:
unsigned write_inits (elf_out *to, depset::hash &, unsigned *crc_ptr);
bool read_inits (unsigned count);
private:
unsigned write_pendings (elf_out *to, vec<depset *> depsets,
depset::hash &, unsigned *crc_ptr);
bool read_pendings (unsigned count);
private:
void write_entities (elf_out *to, vec<depset *> depsets,
unsigned count, unsigned *crc_ptr);
bool read_entities (unsigned count, unsigned lwm, unsigned hwm);
private:
void write_init_maps ();
range_t write_prepare_maps (module_state_config *, bool);
bool read_prepare_maps (const module_state_config *);
void write_ordinary_maps (elf_out *to, range_t &,
bool, unsigned *crc_ptr);
bool read_ordinary_maps (unsigned, unsigned);
void write_macro_maps (elf_out *to, range_t &, unsigned *crc_ptr);
bool read_macro_maps (unsigned);
private:
void write_define (bytes_out &, const cpp_macro *);
cpp_macro *read_define (bytes_in &, cpp_reader *) const;
vec<cpp_hashnode *> *prepare_macros (cpp_reader *);
unsigned write_macros (elf_out *to, vec<cpp_hashnode *> *, unsigned *crc_ptr);
bool read_macros ();
void install_macros ();
public:
void import_macros ();
public:
static void undef_macro (cpp_reader *, location_t, cpp_hashnode *);
static cpp_macro *deferred_macro (cpp_reader *, location_t, cpp_hashnode *);
public:
static bool note_location (location_t);
static void write_location (bytes_out &, location_t);
location_t read_location (bytes_in &) const;
public:
void set_flatname ();
const char *get_flatname () const
{
return flatname;
}
location_t imported_from () const;
public:
void set_filename (const Cody::Packet &);
bool do_import (cpp_reader *, bool outermost);
};
/* Hash module state by name. This cannot be a member of
module_state, because of GTY restrictions. We never delete from
the hash table, but ggc_ptr_hash doesn't support that
simplification. */
struct module_state_hash : ggc_ptr_hash<module_state> {
typedef std::pair<tree,uintptr_t> compare_type; /* {name,parent} */
static inline hashval_t hash (const value_type m);
static inline hashval_t hash (const compare_type &n);
static inline bool equal (const value_type existing,
const compare_type &candidate);
};
module_state::module_state (tree name, module_state *parent, bool partition)
: imports (BITMAP_GGC_ALLOC ()), exports (BITMAP_GGC_ALLOC ()),
parent (parent), name (name), slurp (NULL),
flatname (NULL), filename (NULL),
entity_lwm (~0u >> 1), entity_num (0),
ordinary_locs (0, 0), macro_locs (0, 0),
loc (UNKNOWN_LOCATION),
crc (0), mod (MODULE_UNKNOWN), remap (0), subst (0)
{
loadedness = ML_NONE;
module_p = header_p = interface_p = partition_p = false;
directness = MD_NONE;
exported_p = false;
cmi_noted_p = false;
active_init_p = false;
partition_p = partition;
inform_cmi_p = false;
visited_p = false;
extensions = 0;
if (name && TREE_CODE (name) == STRING_CST)
{
header_p = true;
const char *string = TREE_STRING_POINTER (name);
gcc_checking_assert (string[0] == '.'
? IS_DIR_SEPARATOR (string[1])
: IS_ABSOLUTE_PATH (string));
}
gcc_checking_assert (!(parent && header_p));
}
module_state::~module_state ()
{
release ();
}
/* Hash module state. */
static hashval_t
module_name_hash (const_tree name)
{
if (TREE_CODE (name) == STRING_CST)
return htab_hash_string (TREE_STRING_POINTER (name));
else
return IDENTIFIER_HASH_VALUE (name);
}
hashval_t
module_state_hash::hash (const value_type m)
{
hashval_t ph = pointer_hash<void>::hash
(reinterpret_cast<void *> (reinterpret_cast<uintptr_t> (m->parent)
| m->is_partition ()));
hashval_t nh = module_name_hash (m->name);
return iterative_hash_hashval_t (ph, nh);
}
/* Hash a name. */
hashval_t
module_state_hash::hash (const compare_type &c)
{
hashval_t ph = pointer_hash<void>::hash (reinterpret_cast<void *> (c.second));
hashval_t nh = module_name_hash (c.first);
return iterative_hash_hashval_t (ph, nh);
}
bool
module_state_hash::equal (const value_type existing,
const compare_type &candidate)
{
uintptr_t ep = (reinterpret_cast<uintptr_t> (existing->parent)
| existing->is_partition ());
if (ep != candidate.second)
return false;
/* Identifier comparison is by pointer. If the string_csts happen
to be the same object, then they're equal too. */
if (existing->name == candidate.first)
return true;
/* If neither are string csts, they can't be equal. */
if (TREE_CODE (candidate.first) != STRING_CST
|| TREE_CODE (existing->name) != STRING_CST)
return false;
/* String equality. */
if (TREE_STRING_LENGTH (existing->name)
== TREE_STRING_LENGTH (candidate.first)
&& !memcmp (TREE_STRING_POINTER (existing->name),
TREE_STRING_POINTER (candidate.first),
TREE_STRING_LENGTH (existing->name)))
return true;
return false;
}
/********************************************************************/
/* Global state */
/* Mapper name. */
static const char *module_mapper_name;
/* Deferred import queue (FIFO). */
static vec<module_state *, va_heap, vl_embed> *pending_imports;
/* CMI repository path and workspace. */
static char *cmi_repo;
static size_t cmi_repo_length;
static char *cmi_path;
static size_t cmi_path_alloc;
/* Count of available and loaded clusters. */
static unsigned available_clusters;
static unsigned loaded_clusters;
/* What the current TU is. */
unsigned module_kind;
/* Global trees. */
static const std::pair<tree *, unsigned> global_tree_arys[] =
{
std::pair<tree *, unsigned> (sizetype_tab, stk_type_kind_last),
std::pair<tree *, unsigned> (integer_types, itk_none),
std::pair<tree *, unsigned> (global_trees, TI_MODULE_HWM),
std::pair<tree *, unsigned> (c_global_trees, CTI_MODULE_HWM),
std::pair<tree *, unsigned> (cp_global_trees, CPTI_MODULE_HWM),
std::pair<tree *, unsigned> (NULL, 0)
};
static GTY(()) vec<tree, va_gc> *fixed_trees;
static unsigned global_crc;
/* Lazy loading can open many files concurrently, there are
per-process limits on that. We pay attention to the process limit,
and attempt to increase it when we run out. Otherwise we use an
LRU scheme to figure out who to flush. Note that if the import
graph /depth/ exceeds lazy_limit, we'll exceed the limit. */
static unsigned lazy_lru; /* LRU counter. */
static unsigned lazy_open; /* Number of open modules */
static unsigned lazy_limit; /* Current limit of open modules. */
static unsigned lazy_hard_limit; /* Hard limit on open modules. */
/* Account for source, assembler and dump files & directory searches.
We don't keep the source file's open, so we don't have to account
for #include depth. I think dump files are opened and closed per
pass, but ICBW. */
#define LAZY_HEADROOM 15 /* File descriptor headroom. */
/* Vector of module state. Indexed by OWNER. Has at least 2 slots. */
static GTY(()) vec<module_state *, va_gc> *modules;
/* Hash of module state, findable by {name, parent}. */
static GTY(()) hash_table<module_state_hash> *modules_hash;
/* Map of imported entities. We map DECL_UID to index of entity
vector. */
typedef hash_map<unsigned/*UID*/, unsigned/*index*/,
simple_hashmap_traits<int_hash<unsigned,0>, unsigned>
> entity_map_t;
static entity_map_t *entity_map;
/* Doesn't need GTYing, because any tree referenced here is also
findable by, symbol table, specialization table, return type of
reachable function. */
static vec<binding_slot, va_heap, vl_embed> *entity_ary;
/* Members entities of imported classes that are defined in this TU.
These are where the entity's context is not from the current TU.
We need to emit the definition (but not the enclosing class).
We could find these by walking ALL the imported classes that we
could provide a member definition. But that's expensive,
especially when you consider lazy implicit member declarations,
which could be ANY imported class. */
static GTY(()) vec<tree, va_gc> *class_members;
/* The same problem exists for class template partial
specializations. Now that we have constraints, the invariant of
expecting them in the instantiation table no longer holds. One of
the constrained partial specializations will be there, but the
others not so much. It's not even an unconstrained partial
spacialization in the table :( so any partial template declaration
is added to this list too. */
static GTY(()) vec<tree, va_gc> *partial_specializations;
/********************************************************************/
/* Our module mapper (created lazily). */
module_client *mapper;
static module_client *make_mapper (location_t loc);
inline module_client *get_mapper (location_t loc)
{
auto *res = mapper;
if (!res)
res = make_mapper (loc);
return res;
}
/********************************************************************/
static tree
get_clone_target (tree decl)
{
tree target;
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
tree res_orig = DECL_CLONED_FUNCTION (DECL_TEMPLATE_RESULT (decl));
target = DECL_TI_TEMPLATE (res_orig);
}
else
target = DECL_CLONED_FUNCTION (decl);
gcc_checking_assert (DECL_MAYBE_IN_CHARGE_CDTOR_P (target));
return target;
}
/* Like FOR_EACH_CLONE, but will walk cloned templates. */
#define FOR_EVERY_CLONE(CLONE, FN) \
if (!DECL_MAYBE_IN_CHARGE_CDTOR_P (FN)); \
else \
for (CLONE = DECL_CHAIN (FN); \
CLONE && DECL_CLONED_FUNCTION_P (CLONE); \
CLONE = DECL_CHAIN (CLONE))
/* It'd be nice if USE_TEMPLATE was a field of template_info
(a) it'd solve the enum case dealt with below,
(b) both class templates and decl templates would store this in the
same place
(c) this function wouldn't need the by-ref arg, which is annoying. */
static tree
node_template_info (tree decl, int &use)
{
tree ti = NULL_TREE;
int use_tpl = -1;
if (DECL_IMPLICIT_TYPEDEF_P (decl))
{
tree type = TREE_TYPE (decl);
ti = TYPE_TEMPLATE_INFO (type);
if (ti)
{
if (TYPE_LANG_SPECIFIC (type))
use_tpl = CLASSTYPE_USE_TEMPLATE (type);
else
{
/* An enum, where we don't explicitly encode use_tpl.
If the containing context (a type or a function), is
an ({im,ex}plicit) instantiation, then this is too.
If it's a partial or explicit specialization, then
this is not!. */
tree ctx = CP_DECL_CONTEXT (decl);
if (TYPE_P (ctx))
ctx = TYPE_NAME (ctx);
node_template_info (ctx, use);
use_tpl = use != 2 ? use : 0;
}
}
}
else if (DECL_LANG_SPECIFIC (decl)
&& (TREE_CODE (decl) == VAR_DECL
|| TREE_CODE (decl) == TYPE_DECL
|| TREE_CODE (decl) == FUNCTION_DECL
|| TREE_CODE (decl) == FIELD_DECL
|| TREE_CODE (decl) == TEMPLATE_DECL))
{
use_tpl = DECL_USE_TEMPLATE (decl);
ti = DECL_TEMPLATE_INFO (decl);
}
use = use_tpl;
return ti;
}
/* Find the index in entity_ary for an imported DECL. It should
always be there, but bugs can cause it to be missing, and that can
crash the crash reporting -- let's not do that! When streaming
out we place entities from this module there too -- with negated
indices. */
static unsigned
import_entity_index (tree decl, bool null_ok = false)
{
if (unsigned *slot = entity_map->get (DECL_UID (decl)))
return *slot;
gcc_checking_assert (null_ok);
return ~(~0u >> 1);
}
/* Find the module for an imported entity at INDEX in the entity ary.
There must be one. */
static module_state *
import_entity_module (unsigned index)
{
if (index > ~(~0u >> 1))
/* This is an index for an exported entity. */
return (*modules)[0];
/* Do not include the current TU (not an off-by-one error). */
unsigned pos = 1;
unsigned len = modules->length () - pos;
while (len)
{
unsigned half = len / 2;
module_state *probe = (*modules)[pos + half];
if (index < probe->entity_lwm)
len = half;
else if (index < probe->entity_lwm + probe->entity_num)
return probe;
else
{
pos += half + 1;
len = len - (half + 1);
}
}
gcc_unreachable ();
}
/********************************************************************/
/* A dumping machinery. */
class dumper {
public:
enum {
LOCATION = TDF_LINENO, /* -lineno:Source location streaming. */
DEPEND = TDF_GRAPH, /* -graph:Dependency graph construction. */
CLUSTER = TDF_BLOCKS, /* -blocks:Clusters. */
TREE = TDF_UID, /* -uid:Tree streaming. */
MERGE = TDF_ALIAS, /* -alias:Mergeable Entities. */
ELF = TDF_ASMNAME, /* -asmname:Elf data. */
MACRO = TDF_VOPS /* -vops:Macros. */
};
private:
struct impl {
typedef vec<module_state *, va_heap, vl_embed> stack_t;
FILE *stream; /* Dump stream. */
unsigned indent; /* Local indentation. */
bool bol; /* Beginning of line. */
stack_t stack; /* Trailing array of module_state. */
bool nested_name (tree); /* Dump a name following DECL_CONTEXT. */
};
public:
/* The dumper. */
impl *dumps;
dump_flags_t flags;
public:
/* Push/pop module state dumping. */
unsigned push (module_state *);
void pop (unsigned);
public:
/* Change local indentation. */
void indent ()
{
if (dumps)
dumps->indent++;
}
void outdent ()
{
if (dumps)
{
gcc_checking_assert (dumps->indent);
dumps->indent--;
}
}
public:
/* Is dump enabled?. */
bool operator () (int mask = 0)
{
if (!dumps || !dumps->stream)
return false;
if (mask && !(mask & flags))
return false;
return true;
}
/* Dump some information. */
bool operator () (const char *, ...);
};
/* The dumper. */
static dumper dump = {0, dump_flags_t (0)};
/* Push to dumping M. Return previous indentation level. */
unsigned
dumper::push (module_state *m)
{
FILE *stream = NULL;
if (!dumps || !dumps->stack.length ())
{
stream = dump_begin (module_dump_id, &flags);
if (!stream)
return 0;
}
if (!dumps || !dumps->stack.space (1))
{
/* Create or extend the dump implementor. */
unsigned current = dumps ? dumps->stack.length () : 0;
unsigned count = current ? current * 2 : EXPERIMENT (1, 20);
size_t alloc = (offsetof (impl, stack)
+ impl::stack_t::embedded_size (count));
dumps = XRESIZEVAR (impl, dumps, alloc);
dumps->stack.embedded_init (count, current);
}
if (stream)
dumps->stream = stream;
unsigned n = dumps->indent;
dumps->indent = 0;
dumps->bol = true;
dumps->stack.quick_push (m);
if (m)
{
module_state *from = NULL;
if (dumps->stack.length () > 1)
from = dumps->stack[dumps->stack.length () - 2];
else
dump ("");
dump (from ? "Starting module %M (from %M)"
: "Starting module %M", m, from);
}
return n;
}
/* Pop from dumping. Restore indentation to N. */
void dumper::pop (unsigned n)
{
if (!dumps)
return;
gcc_checking_assert (dump () && !dumps->indent);
if (module_state *m = dumps->stack[dumps->stack.length () - 1])
{
module_state *from = (dumps->stack.length () > 1
? dumps->stack[dumps->stack.length () - 2] : NULL);
dump (from ? "Finishing module %M (returning to %M)"
: "Finishing module %M", m, from);
}
dumps->stack.pop ();
dumps->indent = n;
if (!dumps->stack.length ())
{
dump_end (module_dump_id, dumps->stream);
dumps->stream = NULL;
}
}
/* Dump a nested name for arbitrary tree T. Sometimes it won't have a
name. */
bool
dumper::impl::nested_name (tree t)
{
tree ti = NULL_TREE;
int origin = -1;
tree name = NULL_TREE;
if (t && TREE_CODE (t) == TREE_BINFO)
t = BINFO_TYPE (t);
if (t && TYPE_P (t))
t = TYPE_NAME (t);
if (t && DECL_P (t))
{
if (t == global_namespace || DECL_TEMPLATE_PARM_P (t))
;
else if (tree ctx = DECL_CONTEXT (t))
if (TREE_CODE (ctx) == TRANSLATION_UNIT_DECL
|| nested_name (ctx))
fputs ("::", stream);
int use_tpl;
ti = node_template_info (t, use_tpl);
if (ti && TREE_CODE (TI_TEMPLATE (ti)) == TEMPLATE_DECL
&& (DECL_TEMPLATE_RESULT (TI_TEMPLATE (ti)) == t))
t = TI_TEMPLATE (ti);
tree not_tmpl = t;
if (TREE_CODE (t) == TEMPLATE_DECL)
{
fputs ("template ", stream);
not_tmpl = DECL_TEMPLATE_RESULT (t);
}
if (not_tmpl
&& DECL_P (not_tmpl)
&& DECL_LANG_SPECIFIC (not_tmpl)
&& DECL_MODULE_IMPORT_P (not_tmpl))
{
/* We need to be careful here, so as to not explode on
inconsistent data -- we're probably debugging, because
Something Is Wrong. */
unsigned index = import_entity_index (t, true);
if (!(index & ~(~0u >> 1)))
origin = import_entity_module (index)->mod;
else if (index > ~(~0u >> 1))
/* An imported partition member that we're emitting. */
origin = 0;
else
origin = -2;
}
name = DECL_NAME (t) ? DECL_NAME (t)
: HAS_DECL_ASSEMBLER_NAME_P (t) ? DECL_ASSEMBLER_NAME_RAW (t)
: NULL_TREE;
}
else
name = t;
if (name)
switch (TREE_CODE (name))
{
default:
fputs ("#unnamed#", stream);
break;
case IDENTIFIER_NODE:
fwrite (IDENTIFIER_POINTER (name), 1, IDENTIFIER_LENGTH (name), stream);
break;
case INTEGER_CST:
print_hex (wi::to_wide (name), stream);
break;
case STRING_CST:
/* If TREE_TYPE is NULL, this is a raw string. */
fwrite (TREE_STRING_POINTER (name), 1,
TREE_STRING_LENGTH (name) - (TREE_TYPE (name) != NULL_TREE),
stream);
break;
}
else
fputs ("#null#", stream);
if (origin >= 0)
{
const module_state *module = (*modules)[origin];
fprintf (stream, "@%s:%d", !module ? "" : !module->name ? "(unnamed)"
: module->get_flatname (), origin);
}
else if (origin == -2)
fprintf (stream, "@???");
if (ti)
{
tree args = INNERMOST_TEMPLATE_ARGS (TI_ARGS (ti));
fputs ("<", stream);
if (args)
for (int ix = 0; ix != TREE_VEC_LENGTH (args); ix++)
{
if (ix)
fputs (",", stream);
nested_name (TREE_VEC_ELT (args, ix));
}
fputs (">", stream);
}
return true;
}
/* Formatted dumping. FORMAT begins with '+' do not emit a trailing
new line. (Normally it is appended.)
Escapes:
%C - tree_code
%I - identifier
%M - module_state
%N - name -- DECL_NAME
%P - context:name pair
%R - unsigned:unsigned ratio
%S - symbol -- DECL_ASSEMBLER_NAME
%U - long unsigned
%V - version
--- the following are printf-like, but without its flexibility
%d - decimal int
%p - pointer
%s - string
%u - unsigned int
%x - hex int
We do not implement the printf modifiers. */
bool
dumper::operator () (const char *format, ...)
{
if (!(*this) ())
return false;
bool no_nl = format[0] == '+';
format += no_nl;
if (dumps->bol)
{
/* Module import indent. */
if (unsigned depth = dumps->stack.length () - 1)
{
const char *prefix = ">>>>";
fprintf (dumps->stream, (depth <= strlen (prefix)
? &prefix[strlen (prefix) - depth]
: ">.%d.>"), depth);
}
/* Local indent. */
if (unsigned indent = dumps->indent)
{
const char *prefix = " ";
fprintf (dumps->stream, (indent <= strlen (prefix)
? &prefix[strlen (prefix) - indent]
: " .%d. "), indent);
}
dumps->bol = false;
}
va_list args;
va_start (args, format);
while (const char *esc = strchr (format, '%'))
{
fwrite (format, 1, (size_t)(esc - format), dumps->stream);
format = ++esc;
switch (*format++)
{
default:
gcc_unreachable ();
case '%':
fputc ('%', dumps->stream);
break;
case 'C': /* Code */
{
tree_code code = (tree_code)va_arg (args, unsigned);
fputs (get_tree_code_name (code), dumps->stream);
}
break;
case 'I': /* Identifier. */
{
tree t = va_arg (args, tree);
dumps->nested_name (t);
}
break;
case 'M': /* Module. */
{
const char *str = "(none)";
if (module_state *m = va_arg (args, module_state *))
{
if (!m->has_location ())
str = "(detached)";
else
str = m->get_flatname ();
}
fputs (str, dumps->stream);
}
break;
case 'N': /* Name. */
{
tree t = va_arg (args, tree);
while (t && TREE_CODE (t) == OVERLOAD)
t = OVL_FUNCTION (t);
fputc ('\'', dumps->stream);
dumps->nested_name (t);
fputc ('\'', dumps->stream);
}
break;
case 'P': /* Pair. */
{
tree ctx = va_arg (args, tree);
tree name = va_arg (args, tree);
fputc ('\'', dumps->stream);
dumps->nested_name (ctx);
if (ctx && ctx != global_namespace)
fputs ("::", dumps->stream);
dumps->nested_name (name);
fputc ('\'', dumps->stream);
}
break;
case 'R': /* Ratio */
{
unsigned a = va_arg (args, unsigned);
unsigned b = va_arg (args, unsigned);
fprintf (dumps->stream, "%.1f", (float) a / (b + !b));
}
break;
case 'S': /* Symbol name */
{
tree t = va_arg (args, tree);
if (t && TYPE_P (t))
t = TYPE_NAME (t);
if (t && HAS_DECL_ASSEMBLER_NAME_P (t)
&& DECL_ASSEMBLER_NAME_SET_P (t))
{
fputc ('(', dumps->stream);
fputs (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (t)),
dumps->stream);
fputc (')', dumps->stream);
}
}
break;
case 'U': /* long unsigned. */
{
unsigned long u = va_arg (args, unsigned long);
fprintf (dumps->stream, "%lu", u);
}
break;
case 'V': /* Verson. */
{
unsigned v = va_arg (args, unsigned);
verstr_t string;
version2string (v, string);
fputs (string, dumps->stream);
}
break;
case 'c': /* Character. */
{
int c = va_arg (args, int);
fputc (c, dumps->stream);
}
break;
case 'd': /* Decimal Int. */
{
int d = va_arg (args, int);
fprintf (dumps->stream, "%d", d);
}
break;
case 'p': /* Pointer. */
{
void *p = va_arg (args, void *);
fprintf (dumps->stream, "%p", p);
}
break;
case 's': /* String. */
{
const char *s = va_arg (args, char *);
gcc_checking_assert (s);
fputs (s, dumps->stream);
}
break;
case 'u': /* Unsigned. */
{
unsigned u = va_arg (args, unsigned);
fprintf (dumps->stream, "%u", u);
}
break;
case 'x': /* Hex. */
{
unsigned x = va_arg (args, unsigned);
fprintf (dumps->stream, "%x", x);
}
break;
}
}
fputs (format, dumps->stream);
va_end (args);
if (!no_nl)
{
dumps->bol = true;
fputc ('\n', dumps->stream);
}
return true;
}
struct note_def_cache_hasher : ggc_cache_ptr_hash<tree_node>
{
static int keep_cache_entry (tree t)
{
if (!CHECKING_P)
/* GTY is unfortunately not clever enough to conditionalize
this. */
gcc_unreachable ();
if (ggc_marked_p (t))
return -1;
unsigned n = dump.push (NULL);
/* This might or might not be an error. We should note its
dropping whichever. */
dump () && dump ("Dropping %N from note_defs table", t);
dump.pop (n);
return 0;
}
};
/* We should stream each definition at most once.
This needs to be a cache because there are cases where a definition
ends up being not retained, and we need to drop those so we don't
get confused if memory is reallocated. */
typedef hash_table<note_def_cache_hasher> note_defs_table_t;
static GTY((cache)) note_defs_table_t *note_defs;
void
trees_in::assert_definition (tree decl ATTRIBUTE_UNUSED,
bool installing ATTRIBUTE_UNUSED)
{
#if CHECKING_P
tree *slot = note_defs->find_slot (decl, installing ? INSERT : NO_INSERT);
tree not_tmpl = STRIP_TEMPLATE (decl);
if (installing)
{
/* We must be inserting for the first time. */
gcc_assert (!*slot);
*slot = decl;
}
else
/* If this is not the mergeable entity, it should not be in the
table. If it is a non-global-module mergeable entity, it
should be in the table. Global module entities could have been
defined textually in the current TU and so might or might not
be present. */
gcc_assert (!is_duplicate (decl)
? !slot
: (slot
|| !DECL_LANG_SPECIFIC (not_tmpl)
|| !DECL_MODULE_PURVIEW_P (not_tmpl)
|| (!DECL_MODULE_IMPORT_P (not_tmpl)
&& header_module_p ())));
if (not_tmpl != decl)
gcc_assert (!note_defs->find_slot (not_tmpl, NO_INSERT));
#endif
}
void
trees_out::assert_definition (tree decl ATTRIBUTE_UNUSED)
{
#if CHECKING_P
tree *slot = note_defs->find_slot (decl, INSERT);
gcc_assert (!*slot);
*slot = decl;
if (TREE_CODE (decl) == TEMPLATE_DECL)
gcc_assert (!note_defs->find_slot (DECL_TEMPLATE_RESULT (decl), NO_INSERT));
#endif
}
/********************************************************************/
static bool
noisy_p ()
{
if (quiet_flag)
return false;
pp_needs_newline (global_dc->printer) = true;
diagnostic_set_last_function (global_dc, (diagnostic_info *) NULL);
return true;
}
/* Set the cmi repo. Strip trailing '/', '.' becomes NULL. */
static void
set_cmi_repo (const char *r)
{
XDELETEVEC (cmi_repo);
XDELETEVEC (cmi_path);
cmi_path_alloc = 0;
cmi_repo = NULL;
cmi_repo_length = 0;
if (!r || !r[0])
return;
size_t len = strlen (r);
cmi_repo = XNEWVEC (char, len + 1);
memcpy (cmi_repo, r, len + 1);
if (len > 1 && IS_DIR_SEPARATOR (cmi_repo[len-1]))
len--;
if (len == 1 && cmi_repo[0] == '.')
len--;
cmi_repo[len] = 0;
cmi_repo_length = len;
}
/* TO is a repo-relative name. Provide one that we may use from where
we are. */
static const char *
maybe_add_cmi_prefix (const char *to, size_t *len_p = NULL)
{
size_t len = len_p || cmi_repo_length ? strlen (to) : 0;
if (cmi_repo_length && !IS_ABSOLUTE_PATH (to))
{
if (cmi_path_alloc < cmi_repo_length + len + 2)
{
XDELETEVEC (cmi_path);
cmi_path_alloc = cmi_repo_length + len * 2 + 2;
cmi_path = XNEWVEC (char, cmi_path_alloc);
memcpy (cmi_path, cmi_repo, cmi_repo_length);
cmi_path[cmi_repo_length] = DIR_SEPARATOR;
}
memcpy (&cmi_path[cmi_repo_length + 1], to, len + 1);
len += cmi_repo_length + 1;
to = cmi_path;
}
if (len_p)
*len_p = len;
return to;
}
/* Try and create the directories of PATH. */
static void
create_dirs (char *path)
{
/* Try and create the missing directories. */
for (char *base = path; *base; base++)
if (IS_DIR_SEPARATOR (*base))
{
char sep = *base;
*base = 0;
int failed = mkdir (path, S_IRWXU | S_IRWXG | S_IRWXO);
dump () && dump ("Mkdir ('%s') errno:=%u", path, failed ? errno : 0);
*base = sep;
if (failed
/* Maybe racing with another creator (of a *different*
module). */
&& errno != EEXIST)
break;
}
}
/* Given a CLASSTYPE_DECL_LIST VALUE get the template friend decl,
if that's what this is. */
static tree
friend_from_decl_list (tree frnd)
{
tree res = frnd;
if (TREE_CODE (frnd) != TEMPLATE_DECL)
{
tree tmpl = NULL_TREE;
if (TYPE_P (frnd))
{
res = TYPE_NAME (frnd);
if (CLASS_TYPE_P (frnd)
&& CLASSTYPE_TEMPLATE_INFO (frnd))
tmpl = CLASSTYPE_TI_TEMPLATE (frnd);
}
else if (DECL_TEMPLATE_INFO (frnd))
{
tmpl = DECL_TI_TEMPLATE (frnd);
if (TREE_CODE (tmpl) != TEMPLATE_DECL)
tmpl = NULL_TREE;
}
if (tmpl && DECL_TEMPLATE_RESULT (tmpl) == res)
res = tmpl;
}
return res;
}
static tree
find_enum_member (tree ctx, tree name)
{
for (tree values = TYPE_VALUES (ctx);
values; values = TREE_CHAIN (values))
if (DECL_NAME (TREE_VALUE (values)) == name)
return TREE_VALUE (values);
return NULL_TREE;
}
/********************************************************************/
/* Instrumentation gathered writing bytes. */
void
bytes_out::instrument ()
{
dump ("Wrote %u bytes in %u blocks", lengths[3], spans[3]);
dump ("Wrote %u bits in %u bytes", lengths[0] + lengths[1], lengths[2]);
for (unsigned ix = 0; ix < 2; ix++)
dump (" %u %s spans of %R bits", spans[ix],
ix ? "one" : "zero", lengths[ix], spans[ix]);
dump (" %u blocks with %R bits padding", spans[2],
lengths[2] * 8 - (lengths[0] + lengths[1]), spans[2]);
}
/* Instrumentation gathered writing trees. */
void
trees_out::instrument ()
{
if (dump (""))
{
bytes_out::instrument ();
dump ("Wrote:");
dump (" %u decl trees", decl_val_count);
dump (" %u other trees", tree_val_count);
dump (" %u back references", back_ref_count);
dump (" %u null trees", null_count);
}
}
/* Setup and teardown for a tree walk. */
void
trees_out::begin ()
{
gcc_assert (!streaming_p () || !tree_map.elements ());
mark_trees ();
if (streaming_p ())
parent::begin ();
}
unsigned
trees_out::end (elf_out *sink, unsigned name, unsigned *crc_ptr)
{
gcc_checking_assert (streaming_p ());
unmark_trees ();
return parent::end (sink, name, crc_ptr);
}
void
trees_out::end ()
{
gcc_assert (!streaming_p ());
unmark_trees ();
/* Do not parent::end -- we weren't streaming. */
}
void
trees_out::mark_trees ()
{
if (size_t size = tree_map.elements ())
{
/* This isn't our first rodeo, destroy and recreate the
tree_map. I'm a bad bad man. Use the previous size as a
guess for the next one (so not all bad). */
tree_map.~ptr_int_hash_map ();
new (&tree_map) ptr_int_hash_map (size);
}
/* Install the fixed trees, with +ve references. */
unsigned limit = fixed_trees->length ();
for (unsigned ix = 0; ix != limit; ix++)
{
tree val = (*fixed_trees)[ix];
bool existed = tree_map.put (val, ix + tag_fixed);
gcc_checking_assert (!TREE_VISITED (val) && !existed);
TREE_VISITED (val) = true;
}
ref_num = 0;
}
/* Unmark the trees we encountered */
void
trees_out::unmark_trees ()
{
ptr_int_hash_map::iterator end (tree_map.end ());
for (ptr_int_hash_map::iterator iter (tree_map.begin ()); iter != end; ++iter)
{
tree node = reinterpret_cast<tree> ((*iter).first);
int ref = (*iter).second;
/* We should have visited the node, and converted its mergeable
reference to a regular reference. */
gcc_checking_assert (TREE_VISITED (node)
&& (ref <= tag_backref || ref >= tag_fixed));
TREE_VISITED (node) = false;
}
}
/* Mark DECL for by-value walking. We do this by inserting it into
the tree map with a reference of zero. May be called multiple
times on the same node. */
void
trees_out::mark_by_value (tree decl)
{
gcc_checking_assert (DECL_P (decl)
/* Enum consts are INTEGER_CSTS. */
|| TREE_CODE (decl) == INTEGER_CST
|| TREE_CODE (decl) == TREE_BINFO);
if (TREE_VISITED (decl))
/* Must already be forced or fixed. */
gcc_checking_assert (*tree_map.get (decl) >= tag_value);
else
{
bool existed = tree_map.put (decl, tag_value);
gcc_checking_assert (!existed);
TREE_VISITED (decl) = true;
}
}
int
trees_out::get_tag (tree t)
{
gcc_checking_assert (TREE_VISITED (t));
return *tree_map.get (t);
}
/* Insert T into the map, return its tag number. */
int
trees_out::insert (tree t, walk_kind walk)
{
gcc_checking_assert (walk != WK_normal || !TREE_VISITED (t));
int tag = --ref_num;
bool existed;
int &slot = tree_map.get_or_insert (t, &existed);
gcc_checking_assert (TREE_VISITED (t) == existed
&& (!existed
|| (walk == WK_value && slot == tag_value)));
TREE_VISITED (t) = true;
slot = tag;
return tag;
}
/* Insert T into the backreference array. Return its back reference
number. */
int
trees_in::insert (tree t)
{
gcc_checking_assert (t || get_overrun ());
back_refs.safe_push (t);
return -(int)back_refs.length ();
}
/* A chained set of decls. */
void
trees_out::chained_decls (tree decls)
{
for (; decls; decls = DECL_CHAIN (decls))
{
if (VAR_OR_FUNCTION_DECL_P (decls)
&& DECL_LOCAL_DECL_P (decls))
{
/* Make sure this is the first encounter, and mark for
walk-by-value. */
gcc_checking_assert (!TREE_VISITED (decls)
&& !DECL_TEMPLATE_INFO (decls));
mark_by_value (decls);
}
tree_node (decls);
}
tree_node (NULL_TREE);
}
tree
trees_in::chained_decls ()
{
tree decls = NULL_TREE;
for (tree *chain = &decls;;)
if (tree decl = tree_node ())
{
if (!DECL_P (decl) || DECL_CHAIN (decl))
{
set_overrun ();
break;
}
*chain = decl;
chain = &DECL_CHAIN (decl);
}
else
break;
return decls;
}
/* A vector of decls following DECL_CHAIN. */
void
trees_out::vec_chained_decls (tree decls)
{
if (streaming_p ())
{
unsigned len = 0;
for (tree decl = decls; decl; decl = DECL_CHAIN (decl))
len++;
u (len);
}
for (tree decl = decls; decl; decl = DECL_CHAIN (decl))
{
if (DECL_IMPLICIT_TYPEDEF_P (decl)
&& TYPE_NAME (TREE_TYPE (decl)) != decl)
/* An anonynmous struct with a typedef name. An odd thing to
write. */
tree_node (NULL_TREE);
else
tree_node (decl);
}
}
vec<tree, va_heap> *
trees_in::vec_chained_decls ()
{
vec<tree, va_heap> *v = NULL;
if (unsigned len = u ())
{
vec_alloc (v, len);
for (unsigned ix = 0; ix < len; ix++)
{
tree decl = tree_node ();
if (decl && !DECL_P (decl))
{
set_overrun ();
break;
}
v->quick_push (decl);
}
if (get_overrun ())
{
vec_free (v);
v = NULL;
}
}
return v;
}
/* A vector of trees. */
void
trees_out::tree_vec (vec<tree, va_gc> *v)
{
unsigned len = vec_safe_length (v);
if (streaming_p ())
u (len);
for (unsigned ix = 0; ix != len; ix++)
tree_node ((*v)[ix]);
}
vec<tree, va_gc> *
trees_in::tree_vec ()
{
vec<tree, va_gc> *v = NULL;
if (unsigned len = u ())
{
vec_alloc (v, len);
for (unsigned ix = 0; ix != len; ix++)
v->quick_push (tree_node ());
}
return v;
}
/* A vector of tree pairs. */
void
trees_out::tree_pair_vec (vec<tree_pair_s, va_gc> *v)
{
unsigned len = vec_safe_length (v);
if (streaming_p ())
u (len);
if (len)
for (unsigned ix = 0; ix != len; ix++)
{
tree_pair_s const &s = (*v)[ix];
tree_node (s.purpose);
tree_node (s.value);
}
}
vec<tree_pair_s, va_gc> *
trees_in::tree_pair_vec ()
{
vec<tree_pair_s, va_gc> *v = NULL;
if (unsigned len = u ())
{
vec_alloc (v, len);
for (unsigned ix = 0; ix != len; ix++)
{
tree_pair_s s;
s.purpose = tree_node ();
s.value = tree_node ();
v->quick_push (s);
}
}
return v;
}
void
trees_out::tree_list (tree list, bool has_purpose)
{
for (; list; list = TREE_CHAIN (list))
{
gcc_checking_assert (TREE_VALUE (list));
tree_node (TREE_VALUE (list));
if (has_purpose)
tree_node (TREE_PURPOSE (list));
}
tree_node (NULL_TREE);
}
tree
trees_in::tree_list (bool has_purpose)
{
tree res = NULL_TREE;
for (tree *chain = &res; tree value = tree_node ();
chain = &TREE_CHAIN (*chain))
{
tree purpose = has_purpose ? tree_node () : NULL_TREE;
*chain = build_tree_list (purpose, value);
}
return res;
}
/* Start tree write. Write information to allocate the receiving
node. */
void
trees_out::start (tree t, bool code_streamed)
{
if (TYPE_P (t))
{
enum tree_code code = TREE_CODE (t);
gcc_checking_assert (TYPE_MAIN_VARIANT (t) == t);
/* All these types are TYPE_NON_COMMON. */
gcc_checking_assert (code == RECORD_TYPE
|| code == UNION_TYPE
|| code == ENUMERAL_TYPE
|| code == TEMPLATE_TYPE_PARM
|| code == TEMPLATE_TEMPLATE_PARM
|| code == BOUND_TEMPLATE_TEMPLATE_PARM);
}
if (!code_streamed)
u (TREE_CODE (t));
switch (TREE_CODE (t))
{
default:
if (TREE_CODE_CLASS (TREE_CODE (t)) == tcc_vl_exp)
u (VL_EXP_OPERAND_LENGTH (t));
break;
case INTEGER_CST:
u (TREE_INT_CST_NUNITS (t));
u (TREE_INT_CST_EXT_NUNITS (t));
u (TREE_INT_CST_OFFSET_NUNITS (t));
break;
case OMP_CLAUSE:
state->extensions |= SE_OPENMP;
u (OMP_CLAUSE_CODE (t));
break;
case STRING_CST:
str (TREE_STRING_POINTER (t), TREE_STRING_LENGTH (t));
break;
case VECTOR_CST:
u (VECTOR_CST_LOG2_NPATTERNS (t));
u (VECTOR_CST_NELTS_PER_PATTERN (t));
break;
case TREE_BINFO:
u (BINFO_N_BASE_BINFOS (t));
break;
case TREE_VEC:
u (TREE_VEC_LENGTH (t));
break;
case FIXED_CST:
case POLY_INT_CST:
gcc_unreachable (); /* Not supported in C++. */
break;
case IDENTIFIER_NODE:
case SSA_NAME:
case TARGET_MEM_REF:
case TRANSLATION_UNIT_DECL:
/* We shouldn't meet these. */
gcc_unreachable ();
break;
}
}
/* Start tree read. Allocate the receiving node. */
tree
trees_in::start (unsigned code)
{
tree t = NULL_TREE;
if (!code)
code = u ();
switch (code)
{
default:
if (code >= MAX_TREE_CODES)
{
fail:
set_overrun ();
return NULL_TREE;
}
else if (TREE_CODE_CLASS (code) == tcc_vl_exp)
{
unsigned ops = u ();
t = build_vl_exp (tree_code (code), ops);
}
else
t = make_node (tree_code (code));
break;
case INTEGER_CST:
{
unsigned n = u ();
unsigned e = u ();
t = make_int_cst (n, e);
TREE_INT_CST_OFFSET_NUNITS(t) = u ();
}
break;
case OMP_CLAUSE:
{
if (!(state->extensions & SE_OPENMP))
goto fail;
unsigned omp_code = u ();
t = build_omp_clause (UNKNOWN_LOCATION, omp_clause_code (omp_code));
}
break;
case STRING_CST:
{
size_t l;
const char *chars = str (&l);
t = build_string (l, chars);
}
break;
case VECTOR_CST:
{
unsigned log2_npats = u ();
unsigned elts_per = u ();
t = make_vector (log2_npats, elts_per);
}
break;
case TREE_BINFO:
t = make_tree_binfo (u ());
break;
case TREE_VEC:
t = make_tree_vec (u ());
break;
case FIXED_CST:
case IDENTIFIER_NODE:
case POLY_INT_CST:
case SSA_NAME:
case TARGET_MEM_REF:
case TRANSLATION_UNIT_DECL:
goto fail;
}
return t;
}
/* The structure streamers access the raw fields, because the
alternative, of using the accessor macros can require using
different accessors for the same underlying field, depending on the
tree code. That's both confusing and annoying. */
/* Read & write the core boolean flags. */
void
trees_out::core_bools (tree t)
{
#define WB(X) (b (X))
tree_code code = TREE_CODE (t);
WB (t->base.side_effects_flag);
WB (t->base.constant_flag);
WB (t->base.addressable_flag);
WB (t->base.volatile_flag);
WB (t->base.readonly_flag);
/* base.asm_written_flag is a property of the current TU's use of
this decl. */
WB (t->base.nowarning_flag);
/* base.visited read as zero (it's set for writer, because that's
how we mark nodes). */
/* base.used_flag is not streamed. Readers may set TREE_USED of
decls they use. */
WB (t->base.nothrow_flag);
WB (t->base.static_flag);
if (TREE_CODE_CLASS (code) != tcc_type)
/* This is TYPE_CACHED_VALUES_P for types. */
WB (t->base.public_flag);
WB (t->base.private_flag);
WB (t->base.protected_flag);
WB (t->base.deprecated_flag);
WB (t->base.default_def_flag);
switch (code)
{
case CALL_EXPR:
case INTEGER_CST:
case SSA_NAME:
case TARGET_MEM_REF:
case TREE_VEC:
/* These use different base.u fields. */
break;
default:
WB (t->base.u.bits.lang_flag_0);
bool flag_1 = t->base.u.bits.lang_flag_1;
if (!flag_1)
;
else if (code == TEMPLATE_INFO)
/* This is TI_PENDING_TEMPLATE_FLAG, not relevant to reader. */
flag_1 = false;
else if (code == VAR_DECL)
{
/* This is DECL_INITIALIZED_P. */
if (TREE_CODE (DECL_CONTEXT (t)) != FUNCTION_DECL)
/* We'll set this when reading the definition. */
flag_1 = false;
}
WB (flag_1);
WB (t->base.u.bits.lang_flag_2);
WB (t->base.u.bits.lang_flag_3);
WB (t->base.u.bits.lang_flag_4);
WB (t->base.u.bits.lang_flag_5);
WB (t->base.u.bits.lang_flag_6);
WB (t->base.u.bits.saturating_flag);
WB (t->base.u.bits.unsigned_flag);
WB (t->base.u.bits.packed_flag);
WB (t->base.u.bits.user_align);
WB (t->base.u.bits.nameless_flag);
WB (t->base.u.bits.atomic_flag);
break;
}
if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON))
{
WB (t->type_common.no_force_blk_flag);
WB (t->type_common.needs_constructing_flag);
WB (t->type_common.transparent_aggr_flag);
WB (t->type_common.restrict_flag);
WB (t->type_common.string_flag);
WB (t->type_common.lang_flag_0);
WB (t->type_common.lang_flag_1);
WB (t->type_common.lang_flag_2);
WB (t->type_common.lang_flag_3);
WB (t->type_common.lang_flag_4);
WB (t->type_common.lang_flag_5);
WB (t->type_common.lang_flag_6);
WB (t->type_common.typeless_storage);
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
{
WB (t->decl_common.nonlocal_flag);
WB (t->decl_common.virtual_flag);
WB (t->decl_common.ignored_flag);
WB (t->decl_common.abstract_flag);
WB (t->decl_common.artificial_flag);
WB (t->decl_common.preserve_flag);
WB (t->decl_common.debug_expr_is_from);
WB (t->decl_common.lang_flag_0);
WB (t->decl_common.lang_flag_1);
WB (t->decl_common.lang_flag_2);
WB (t->decl_common.lang_flag_3);
WB (t->decl_common.lang_flag_4);
WB (t->decl_common.lang_flag_5);
WB (t->decl_common.lang_flag_6);
WB (t->decl_common.lang_flag_7);
WB (t->decl_common.lang_flag_8);
WB (t->decl_common.decl_flag_0);
{
/* DECL_EXTERNAL -> decl_flag_1
== it is defined elsewhere
DECL_NOT_REALLY_EXTERN -> base.not_really_extern
== that was a lie, it is here */
bool is_external = t->decl_common.decl_flag_1;
if (!is_external)
/* decl_flag_1 is DECL_EXTERNAL. Things we emit here, might
well be external from the POV of an importer. */
// FIXME: Do we need to know if this is a TEMPLATE_RESULT --
// a flag from the caller?
switch (code)
{
default:
break;
case VAR_DECL:
if (TREE_PUBLIC (t)
&& !(TREE_STATIC (t)
&& DECL_FUNCTION_SCOPE_P (t)
&& DECL_DECLARED_INLINE_P (DECL_CONTEXT (t)))
&& !DECL_VAR_DECLARED_INLINE_P (t))
is_external = true;
break;
case FUNCTION_DECL:
if (TREE_PUBLIC (t)
&& !DECL_DECLARED_INLINE_P (t))
is_external = true;
break;
}
WB (is_external);
}
WB (t->decl_common.decl_flag_2);
WB (t->decl_common.decl_flag_3);
WB (t->decl_common.not_gimple_reg_flag);
WB (t->decl_common.decl_by_reference_flag);
WB (t->decl_common.decl_read_flag);
WB (t->decl_common.decl_nonshareable_flag);
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
{
WB (t->decl_with_vis.defer_output);
WB (t->decl_with_vis.hard_register);
WB (t->decl_with_vis.common_flag);
WB (t->decl_with_vis.in_text_section);
WB (t->decl_with_vis.in_constant_pool);
WB (t->decl_with_vis.dllimport_flag);
WB (t->decl_with_vis.weak_flag);
WB (t->decl_with_vis.seen_in_bind_expr);
WB (t->decl_with_vis.comdat_flag);
WB (t->decl_with_vis.visibility_specified);
WB (t->decl_with_vis.init_priority_p);
WB (t->decl_with_vis.shadowed_for_var_p);
WB (t->decl_with_vis.cxx_constructor);
WB (t->decl_with_vis.cxx_destructor);
WB (t->decl_with_vis.final);
WB (t->decl_with_vis.regdecl_flag);
}
if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
{
WB (t->function_decl.static_ctor_flag);
WB (t->function_decl.static_dtor_flag);
WB (t->function_decl.uninlinable);
WB (t->function_decl.possibly_inlined);
WB (t->function_decl.novops_flag);
WB (t->function_decl.returns_twice_flag);
WB (t->function_decl.malloc_flag);
WB (t->function_decl.declared_inline_flag);
WB (t->function_decl.no_inline_warning_flag);
WB (t->function_decl.no_instrument_function_entry_exit);
WB (t->function_decl.no_limit_stack);
WB (t->function_decl.disregard_inline_limits);
WB (t->function_decl.pure_flag);
WB (t->function_decl.looping_const_or_pure_flag);
WB (t->function_decl.has_debug_args_flag);
WB (t->function_decl.versioned_function);
/* decl_type is a (misnamed) 2 bit discriminator. */
unsigned kind = t->function_decl.decl_type;
WB ((kind >> 0) & 1);
WB ((kind >> 1) & 1);
}
#undef WB
}
bool
trees_in::core_bools (tree t)
{
#define RB(X) ((X) = b ())
tree_code code = TREE_CODE (t);
RB (t->base.side_effects_flag);
RB (t->base.constant_flag);
RB (t->base.addressable_flag);
RB (t->base.volatile_flag);
RB (t->base.readonly_flag);
/* base.asm_written_flag is not streamed. */
RB (t->base.nowarning_flag);
/* base.visited is not streamed. */
/* base.used_flag is not streamed. */
RB (t->base.nothrow_flag);
RB (t->base.static_flag);
if (TREE_CODE_CLASS (code) != tcc_type)
RB (t->base.public_flag);
RB (t->base.private_flag);
RB (t->base.protected_flag);
RB (t->base.deprecated_flag);
RB (t->base.default_def_flag);
switch (code)
{
case CALL_EXPR:
case INTEGER_CST:
case SSA_NAME:
case TARGET_MEM_REF:
case TREE_VEC:
/* These use different base.u fields. */
break;
default:
RB (t->base.u.bits.lang_flag_0);
RB (t->base.u.bits.lang_flag_1);
RB (t->base.u.bits.lang_flag_2);
RB (t->base.u.bits.lang_flag_3);
RB (t->base.u.bits.lang_flag_4);
RB (t->base.u.bits.lang_flag_5);
RB (t->base.u.bits.lang_flag_6);
RB (t->base.u.bits.saturating_flag);
RB (t->base.u.bits.unsigned_flag);
RB (t->base.u.bits.packed_flag);
RB (t->base.u.bits.user_align);
RB (t->base.u.bits.nameless_flag);
RB (t->base.u.bits.atomic_flag);
break;
}
if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON))
{
RB (t->type_common.no_force_blk_flag);
RB (t->type_common.needs_constructing_flag);
RB (t->type_common.transparent_aggr_flag);
RB (t->type_common.restrict_flag);
RB (t->type_common.string_flag);
RB (t->type_common.lang_flag_0);
RB (t->type_common.lang_flag_1);
RB (t->type_common.lang_flag_2);
RB (t->type_common.lang_flag_3);
RB (t->type_common.lang_flag_4);
RB (t->type_common.lang_flag_5);
RB (t->type_common.lang_flag_6);
RB (t->type_common.typeless_storage);
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
{
RB (t->decl_common.nonlocal_flag);
RB (t->decl_common.virtual_flag);
RB (t->decl_common.ignored_flag);
RB (t->decl_common.abstract_flag);
RB (t->decl_common.artificial_flag);
RB (t->decl_common.preserve_flag);
RB (t->decl_common.debug_expr_is_from);
RB (t->decl_common.lang_flag_0);
RB (t->decl_common.lang_flag_1);
RB (t->decl_common.lang_flag_2);
RB (t->decl_common.lang_flag_3);
RB (t->decl_common.lang_flag_4);
RB (t->decl_common.lang_flag_5);
RB (t->decl_common.lang_flag_6);
RB (t->decl_common.lang_flag_7);
RB (t->decl_common.lang_flag_8);
RB (t->decl_common.decl_flag_0);
RB (t->decl_common.decl_flag_1);
RB (t->decl_common.decl_flag_2);
RB (t->decl_common.decl_flag_3);
RB (t->decl_common.not_gimple_reg_flag);
RB (t->decl_common.decl_by_reference_flag);
RB (t->decl_common.decl_read_flag);
RB (t->decl_common.decl_nonshareable_flag);
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
{
RB (t->decl_with_vis.defer_output);
RB (t->decl_with_vis.hard_register);
RB (t->decl_with_vis.common_flag);
RB (t->decl_with_vis.in_text_section);
RB (t->decl_with_vis.in_constant_pool);
RB (t->decl_with_vis.dllimport_flag);
RB (t->decl_with_vis.weak_flag);
RB (t->decl_with_vis.seen_in_bind_expr);
RB (t->decl_with_vis.comdat_flag);
RB (t->decl_with_vis.visibility_specified);
RB (t->decl_with_vis.init_priority_p);
RB (t->decl_with_vis.shadowed_for_var_p);
RB (t->decl_with_vis.cxx_constructor);
RB (t->decl_with_vis.cxx_destructor);
RB (t->decl_with_vis.final);
RB (t->decl_with_vis.regdecl_flag);
}
if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
{
RB (t->function_decl.static_ctor_flag);
RB (t->function_decl.static_dtor_flag);
RB (t->function_decl.uninlinable);
RB (t->function_decl.possibly_inlined);
RB (t->function_decl.novops_flag);
RB (t->function_decl.returns_twice_flag);
RB (t->function_decl.malloc_flag);
RB (t->function_decl.declared_inline_flag);
RB (t->function_decl.no_inline_warning_flag);
RB (t->function_decl.no_instrument_function_entry_exit);
RB (t->function_decl.no_limit_stack);
RB (t->function_decl.disregard_inline_limits);
RB (t->function_decl.pure_flag);
RB (t->function_decl.looping_const_or_pure_flag);
RB (t->function_decl.has_debug_args_flag);
RB (t->function_decl.versioned_function);
/* decl_type is a (misnamed) 2 bit discriminator. */
unsigned kind = 0;
kind |= unsigned (b ()) << 0;
kind |= unsigned (b ()) << 1;
t->function_decl.decl_type = function_decl_type (kind);
}
#undef RB
return !get_overrun ();
}
void
trees_out::lang_decl_bools (tree t)
{
#define WB(X) (b (X))
const struct lang_decl *lang = DECL_LANG_SPECIFIC (t);
WB (lang->u.base.language == lang_cplusplus);
WB ((lang->u.base.use_template >> 0) & 1);
WB ((lang->u.base.use_template >> 1) & 1);
/* Do not write lang->u.base.not_really_extern, importer will set
when reading the definition (if any). */
WB (lang->u.base.initialized_in_class);
WB (lang->u.base.threadprivate_or_deleted_p);
/* Do not write lang->u.base.anticipated_p, it is a property of the
current TU. */
WB (lang->u.base.friend_or_tls);
WB (lang->u.base.unknown_bound_p);
/* Do not write lang->u.base.odr_used, importer will recalculate if
they do ODR use this decl. */
WB (lang->u.base.concept_p);
WB (lang->u.base.var_declared_inline_p);
WB (lang->u.base.dependent_init_p);
/* When building a header unit, everthing is marked as purview, (so
we know which decls to write). But when we import them we do not
want to mark them as in module purview. */
WB (lang->u.base.module_purview_p && !header_module_p ());
WB (lang->u.base.module_attach_p);
if (VAR_OR_FUNCTION_DECL_P (t))
WB (lang->u.base.module_keyed_decls_p);
switch (lang->u.base.selector)
{
default:
gcc_unreachable ();
case lds_fn: /* lang_decl_fn. */
WB (lang->u.fn.global_ctor_p);
WB (lang->u.fn.global_dtor_p);
WB (lang->u.fn.static_function);
WB (lang->u.fn.pure_virtual);
WB (lang->u.fn.defaulted_p);
WB (lang->u.fn.has_in_charge_parm_p);
WB (lang->u.fn.has_vtt_parm_p);
/* There shouldn't be a pending inline at this point. */
gcc_assert (!lang->u.fn.pending_inline_p);
WB (lang->u.fn.nonconverting);
WB (lang->u.fn.thunk_p);
WB (lang->u.fn.this_thunk_p);
/* Do not stream lang->u.hidden_friend_p, it is a property of
the TU. */
WB (lang->u.fn.omp_declare_reduction_p);
WB (lang->u.fn.has_dependent_explicit_spec_p);
WB (lang->u.fn.immediate_fn_p);
WB (lang->u.fn.maybe_deleted);
goto lds_min;
case lds_decomp: /* lang_decl_decomp. */
/* No bools. */
goto lds_min;
case lds_min: /* lang_decl_min. */
lds_min:
/* No bools. */
break;
case lds_ns: /* lang_decl_ns. */
/* No bools. */
break;
case lds_parm: /* lang_decl_parm. */
/* No bools. */
break;
}
#undef WB
}
bool
trees_in::lang_decl_bools (tree t)
{
#define RB(X) ((X) = b ())
struct lang_decl *lang = DECL_LANG_SPECIFIC (t);
lang->u.base.language = b () ? lang_cplusplus : lang_c;
unsigned v;
v = b () << 0;
v |= b () << 1;
lang->u.base.use_template = v;
/* lang->u.base.not_really_extern is not streamed. */
RB (lang->u.base.initialized_in_class);
RB (lang->u.base.threadprivate_or_deleted_p);
/* lang->u.base.anticipated_p is not streamed. */
RB (lang->u.base.friend_or_tls);
RB (lang->u.base.unknown_bound_p);
/* lang->u.base.odr_used is not streamed. */
RB (lang->u.base.concept_p);
RB (lang->u.base.var_declared_inline_p);
RB (lang->u.base.dependent_init_p);
RB (lang->u.base.module_purview_p);
RB (lang->u.base.module_attach_p);
if (VAR_OR_FUNCTION_DECL_P (t))
RB (lang->u.base.module_keyed_decls_p);
switch (lang->u.base.selector)
{
default:
gcc_unreachable ();
case lds_fn: /* lang_decl_fn. */
RB (lang->u.fn.global_ctor_p);
RB (lang->u.fn.global_dtor_p);
RB (lang->u.fn.static_function);
RB (lang->u.fn.pure_virtual);
RB (lang->u.fn.defaulted_p);
RB (lang->u.fn.has_in_charge_parm_p);
RB (lang->u.fn.has_vtt_parm_p);
RB (lang->u.fn.nonconverting);
RB (lang->u.fn.thunk_p);
RB (lang->u.fn.this_thunk_p);
/* lang->u.fn.hidden_friend_p is not streamed. */
RB (lang->u.fn.omp_declare_reduction_p);
RB (lang->u.fn.has_dependent_explicit_spec_p);
RB (lang->u.fn.immediate_fn_p);
RB (lang->u.fn.maybe_deleted);
goto lds_min;
case lds_decomp: /* lang_decl_decomp. */
/* No bools. */
goto lds_min;
case lds_min: /* lang_decl_min. */
lds_min:
/* No bools. */
break;
case lds_ns: /* lang_decl_ns. */
/* No bools. */
break;
case lds_parm: /* lang_decl_parm. */
/* No bools. */
break;
}
#undef RB
return !get_overrun ();
}
void
trees_out::lang_type_bools (tree t)
{
#define WB(X) (b (X))
const struct lang_type *lang = TYPE_LANG_SPECIFIC (t);
WB (lang->has_type_conversion);
WB (lang->has_copy_ctor);
WB (lang->has_default_ctor);
WB (lang->const_needs_init);
WB (lang->ref_needs_init);
WB (lang->has_const_copy_assign);
WB ((lang->use_template >> 0) & 1);
WB ((lang->use_template >> 1) & 1);
WB (lang->has_mutable);
WB (lang->com_interface);
WB (lang->non_pod_class);
WB (lang->nearly_empty_p);
WB (lang->user_align);
WB (lang->has_copy_assign);
WB (lang->has_new);
WB (lang->has_array_new);
WB ((lang->gets_delete >> 0) & 1);
WB ((lang->gets_delete >> 1) & 1);
// Interfaceness is recalculated upon reading. May have to revisit?
// How do dllexport and dllimport interact across a module?
// lang->interface_only
// lang->interface_unknown
WB (lang->contains_empty_class_p);
WB (lang->anon_aggr);
WB (lang->non_zero_init);
WB (lang->empty_p);
WB (lang->vec_new_uses_cookie);
WB (lang->declared_class);
WB (lang->diamond_shaped);
WB (lang->repeated_base);
gcc_assert (!lang->being_defined);
// lang->debug_requested
WB (lang->fields_readonly);
WB (lang->ptrmemfunc_flag);
WB (lang->lazy_default_ctor);
WB (lang->lazy_copy_ctor);
WB (lang->lazy_copy_assign);
WB (lang->lazy_destructor);
WB (lang->has_const_copy_ctor);
WB (lang->has_complex_copy_ctor);
WB (lang->has_complex_copy_assign);
WB (lang->non_aggregate);
WB (lang->has_complex_dflt);
WB (lang->has_list_ctor);
WB (lang->non_std_layout);
WB (lang->is_literal);
WB (lang->lazy_move_ctor);
WB (lang->lazy_move_assign);
WB (lang->has_complex_move_ctor);
WB (lang->has_complex_move_assign);
WB (lang->has_constexpr_ctor);
WB (lang->unique_obj_representations);
WB (lang->unique_obj_representations_set);
#undef WB
}
bool
trees_in::lang_type_bools (tree t)
{
#define RB(X) ((X) = b ())
struct lang_type *lang = TYPE_LANG_SPECIFIC (t);
RB (lang->has_type_conversion);
RB (lang->has_copy_ctor);
RB (lang->has_default_ctor);
RB (lang->const_needs_init);
RB (lang->ref_needs_init);
RB (lang->has_const_copy_assign);
unsigned v;
v = b () << 0;
v |= b () << 1;
lang->use_template = v;
RB (lang->has_mutable);
RB (lang->com_interface);
RB (lang->non_pod_class);
RB (lang->nearly_empty_p);
RB (lang->user_align);
RB (lang->has_copy_assign);
RB (lang->has_new);
RB (lang->has_array_new);
v = b () << 0;
v |= b () << 1;
lang->gets_delete = v;
// lang->interface_only
// lang->interface_unknown
lang->interface_unknown = true; // Redetermine interface
RB (lang->contains_empty_class_p);
RB (lang->anon_aggr);
RB (lang->non_zero_init);
RB (lang->empty_p);
RB (lang->vec_new_uses_cookie);
RB (lang->declared_class);
RB (lang->diamond_shaped);
RB (lang->repeated_base);
gcc_assert (!lang->being_defined);
gcc_assert (!lang->debug_requested);
RB (lang->fields_readonly);
RB (lang->ptrmemfunc_flag);
RB (lang->lazy_default_ctor);
RB (lang->lazy_copy_ctor);
RB (lang->lazy_copy_assign);
RB (lang->lazy_destructor);
RB (lang->has_const_copy_ctor);
RB (lang->has_complex_copy_ctor);
RB (lang->has_complex_copy_assign);
RB (lang->non_aggregate);
RB (lang->has_complex_dflt);
RB (lang->has_list_ctor);
RB (lang->non_std_layout);
RB (lang->is_literal);
RB (lang->lazy_move_ctor);
RB (lang->lazy_move_assign);
RB (lang->has_complex_move_ctor);
RB (lang->has_complex_move_assign);
RB (lang->has_constexpr_ctor);
RB (lang->unique_obj_representations);
RB (lang->unique_obj_representations_set);
#undef RB
return !get_overrun ();
}
/* Read & write the core values and pointers. */
void
trees_out::core_vals (tree t)
{
#define WU(X) (u (X))
#define WT(X) (tree_node (X))
tree_code code = TREE_CODE (t);
/* First by shape of the tree. */
if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
{
/* Write this early, for better log information. */
WT (t->decl_minimal.name);
if (!DECL_TEMPLATE_PARM_P (t))
WT (t->decl_minimal.context);
if (state)
state->write_location (*this, t->decl_minimal.locus);
}
if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON))
{
/* The only types we write also have TYPE_NON_COMMON. */
gcc_checking_assert (CODE_CONTAINS_STRUCT (code, TS_TYPE_NON_COMMON));
/* We only stream the main variant. */
gcc_checking_assert (TYPE_MAIN_VARIANT (t) == t);
/* Stream the name & context first, for better log information */
WT (t->type_common.name);
WT (t->type_common.context);
/* By construction we want to make sure we have the canonical
and main variants already in the type table, so emit them
now. */
WT (t->type_common.main_variant);
tree canonical = t->type_common.canonical;
if (canonical && DECL_TEMPLATE_PARM_P (TYPE_NAME (t)))
/* We do not want to wander into different templates.
Reconstructed on stream in. */
canonical = t;
WT (canonical);
/* type_common.next_variant is internally manipulated. */
/* type_common.pointer_to, type_common.reference_to. */
if (streaming_p ())
{
WU (t->type_common.precision);
WU (t->type_common.contains_placeholder_bits);
WU (t->type_common.mode);
WU (t->type_common.align);
}
if (!RECORD_OR_UNION_CODE_P (code))
{
WT (t->type_common.size);
WT (t->type_common.size_unit);
}
WT (t->type_common.attributes);
WT (t->type_common.common.chain); /* TYPE_STUB_DECL. */
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
{
if (streaming_p ())
{
WU (t->decl_common.mode);
WU (t->decl_common.off_align);
WU (t->decl_common.align);
}
/* For templates these hold instantiation (partial and/or
specialization) information. */
if (code != TEMPLATE_DECL)
{
WT (t->decl_common.size);
WT (t->decl_common.size_unit);
}
WT (t->decl_common.attributes);
// FIXME: Does this introduce cross-decl links? For instance
// from instantiation to the template. If so, we'll need more
// deduplication logic. I think we'll need to walk the blocks
// of the owning function_decl's abstract origin in tandem, to
// generate the locating data needed?
WT (t->decl_common.abstract_origin);
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
{
WT (t->decl_with_vis.assembler_name);
if (streaming_p ())
WU (t->decl_with_vis.visibility);
}
if (CODE_CONTAINS_STRUCT (code, TS_TYPE_NON_COMMON))
{
/* Records and unions hold FIELDS, VFIELD & BINFO on these
things. */
if (!RECORD_OR_UNION_CODE_P (code) && code != ENUMERAL_TYPE)
{
// FIXME: These are from tpl_parm_value's 'type' writing.
// Perhaps it should just be doing them directly?
gcc_checking_assert (code == TEMPLATE_TYPE_PARM
|| code == TEMPLATE_TEMPLATE_PARM
|| code == BOUND_TEMPLATE_TEMPLATE_PARM);
gcc_checking_assert (!TYPE_CACHED_VALUES_P (t));
WT (t->type_non_common.values);
WT (t->type_non_common.maxval);
WT (t->type_non_common.minval);
}
WT (t->type_non_common.lang_1);
}
if (CODE_CONTAINS_STRUCT (code, TS_EXP))
{
if (state)
state->write_location (*this, t->exp.locus);
/* Walk in forward order, as (for instance) REQUIRES_EXPR has a
bunch of unscoped parms on its first operand. It's safer to
create those in order. */
bool vl = TREE_CODE_CLASS (code) == tcc_vl_exp;
for (unsigned limit = (vl ? VL_EXP_OPERAND_LENGTH (t)
: TREE_OPERAND_LENGTH (t)),
ix = unsigned (vl); ix != limit; ix++)
WT (TREE_OPERAND (t, ix));
}
else
/* The CODE_CONTAINS tables were inaccurate when I started. */
gcc_checking_assert (TREE_CODE_CLASS (code) != tcc_expression
&& TREE_CODE_CLASS (code) != tcc_binary
&& TREE_CODE_CLASS (code) != tcc_unary
&& TREE_CODE_CLASS (code) != tcc_reference
&& TREE_CODE_CLASS (code) != tcc_comparison
&& TREE_CODE_CLASS (code) != tcc_statement
&& TREE_CODE_CLASS (code) != tcc_vl_exp);
/* Then by CODE. Special cases and/or 1:1 tree shape
correspondance. */
switch (code)
{
default:
break;
case ARGUMENT_PACK_SELECT: /* Transient during instantiation. */
case DEFERRED_PARSE: /* Expanded upon completion of
outermost class. */
case IDENTIFIER_NODE: /* Streamed specially. */
case BINDING_VECTOR: /* Only in namespace-scope symbol
table. */
case SSA_NAME:
case TRANSLATION_UNIT_DECL: /* There is only one, it is a
global_tree. */
case USERDEF_LITERAL: /* Expanded during parsing. */
gcc_unreachable (); /* Should never meet. */
/* Constants. */
case COMPLEX_CST:
WT (TREE_REALPART (t));
WT (TREE_IMAGPART (t));
break;
case FIXED_CST:
gcc_unreachable (); /* Not supported in C++. */
case INTEGER_CST:
if (streaming_p ())
{
unsigned num = TREE_INT_CST_EXT_NUNITS (t);
for (unsigned ix = 0; ix != num; ix++)
wu (TREE_INT_CST_ELT (t, ix));
}
break;
case POLY_INT_CST:
gcc_unreachable (); /* Not supported in C++. */
case REAL_CST:
if (streaming_p ())
buf (TREE_REAL_CST_PTR (t), sizeof (real_value));
break;
case STRING_CST:
/* Streamed during start. */
break;
case VECTOR_CST:
for (unsigned ix = vector_cst_encoded_nelts (t); ix--;)
WT (VECTOR_CST_ENCODED_ELT (t, ix));
break;
/* Decls. */
case VAR_DECL:
if (DECL_CONTEXT (t)
&& TREE_CODE (DECL_CONTEXT (t)) != FUNCTION_DECL)
break;
/* FALLTHROUGH */
case RESULT_DECL:
case PARM_DECL:
if (DECL_HAS_VALUE_EXPR_P (t))
WT (DECL_VALUE_EXPR (t));
/* FALLTHROUGH */
case CONST_DECL:
case IMPORTED_DECL:
WT (t->decl_common.initial);
break;
case FIELD_DECL:
WT (t->field_decl.offset);
WT (t->field_decl.bit_field_type);
WT (t->field_decl.qualifier); /* bitfield unit. */
WT (t->field_decl.bit_offset);
WT (t->field_decl.fcontext);
WT (t->decl_common.initial);
break;
case LABEL_DECL:
if (streaming_p ())
{
WU (t->label_decl.label_decl_uid);
WU (t->label_decl.eh_landing_pad_nr);
}
break;
case FUNCTION_DECL:
if (streaming_p ())
{
/* Builtins can be streamed by value when a header declares
them. */
WU (DECL_BUILT_IN_CLASS (t));
if (DECL_BUILT_IN_CLASS (t) != NOT_BUILT_IN)
WU (DECL_UNCHECKED_FUNCTION_CODE (t));
}
WT (t->function_decl.personality);
WT (t->function_decl.function_specific_target);
WT (t->function_decl.function_specific_optimization);
WT (t->function_decl.vindex);
if (DECL_HAS_DEPENDENT_EXPLICIT_SPEC_P (t))
WT (lookup_explicit_specifier (t));
break;
case USING_DECL:
/* USING_DECL_DECLS */
WT (t->decl_common.initial);
/* FALLTHROUGH */
case TYPE_DECL:
/* USING_DECL: USING_DECL_SCOPE */
/* TYPE_DECL: DECL_ORIGINAL_TYPE */
WT (t->decl_non_common.result);
break;
/* Miscellaneous common nodes. */
case BLOCK:
if (state)
{
state->write_location (*this, t->block.locus);
state->write_location (*this, t->block.end_locus);
}
/* DECL_LOCAL_DECL_P decls are first encountered here and
streamed by value. */
chained_decls (t->block.vars);
/* nonlocalized_vars is a middle-end thing. */
WT (t->block.subblocks);
WT (t->block.supercontext);
// FIXME: As for decl's abstract_origin, does this introduce crosslinks?
WT (t->block.abstract_origin);
/* fragment_origin, fragment_chain are middle-end things. */
WT (t->block.chain);
/* nonlocalized_vars, block_num & die are middle endy/debug
things. */
break;
case CALL_EXPR:
if (streaming_p ())
WU (t->base.u.ifn);
break;
case CONSTRUCTOR:
{
unsigned len = vec_safe_length (t->constructor.elts);
if (streaming_p ())
WU (len);
if (len)
for (unsigned ix = 0; ix != len; ix++)
{
const constructor_elt &elt = (*t->constructor.elts)[ix];
WT (elt.index);
WT (elt.value);
}
}
break;
case OMP_CLAUSE:
{
/* The ompcode is serialized in start. */
if (streaming_p ())
WU (t->omp_clause.subcode.map_kind);
if (state)
state->write_location (*this, t->omp_clause.locus);
unsigned len = omp_clause_num_ops[OMP_CLAUSE_CODE (t)];
for (unsigned ix = 0; ix != len; ix++)
WT (t->omp_clause.ops[ix]);
}
break;
case STATEMENT_LIST:
for (tree stmt : tsi_range (t))
if (stmt)
WT (stmt);
WT (NULL_TREE);
break;
case OPTIMIZATION_NODE:
case TARGET_OPTION_NODE:
// FIXME: Our representation for these two nodes is a cache of
// the resulting set of options. Not a record of the options
// that got changed by a particular attribute or pragma. Should
// we record that, or should we record the diff from the command
// line options? The latter seems the right behaviour, but is
// (a) harder, and I guess could introduce strangeness if the
// importer has set some incompatible set of optimization flags?
gcc_unreachable ();
break;
case TREE_BINFO:
{
WT (t->binfo.common.chain);
WT (t->binfo.offset);
WT (t->binfo.inheritance);
WT (t->binfo.vptr_field);
WT (t->binfo.vtable);
WT (t->binfo.virtuals);
WT (t->binfo.vtt_subvtt);
WT (t->binfo.vtt_vptr);
tree_vec (BINFO_BASE_ACCESSES (t));
unsigned num = vec_safe_length (BINFO_BASE_ACCESSES (t));
for (unsigned ix = 0; ix != num; ix++)
WT (BINFO_BASE_BINFO (t, ix));
}
break;
case TREE_LIST:
WT (t->list.purpose);
WT (t->list.value);
WT (t->list.common.chain);
break;
case TREE_VEC:
for (unsigned ix = TREE_VEC_LENGTH (t); ix--;)
WT (TREE_VEC_ELT (t, ix));
/* We stash NON_DEFAULT_TEMPLATE_ARGS_COUNT on TREE_CHAIN! */
gcc_checking_assert (!t->type_common.common.chain
|| (TREE_CODE (t->type_common.common.chain)
== INTEGER_CST));
WT (t->type_common.common.chain);
break;
/* C++-specific nodes ... */
case BASELINK:
WT (((lang_tree_node *)t)->baselink.binfo);
WT (((lang_tree_node *)t)->baselink.functions);
WT (((lang_tree_node *)t)->baselink.access_binfo);
break;
case CONSTRAINT_INFO:
WT (((lang_tree_node *)t)->constraint_info.template_reqs);
WT (((lang_tree_node *)t)->constraint_info.declarator_reqs);
WT (((lang_tree_node *)t)->constraint_info.associated_constr);
break;
case DEFERRED_NOEXCEPT:
WT (((lang_tree_node *)t)->deferred_noexcept.pattern);
WT (((lang_tree_node *)t)->deferred_noexcept.args);
break;
case LAMBDA_EXPR:
WT (((lang_tree_node *)t)->lambda_expression.capture_list);
WT (((lang_tree_node *)t)->lambda_expression.this_capture);
WT (((lang_tree_node *)t)->lambda_expression.extra_scope);
/* pending_proxies is a parse-time thing. */
gcc_assert (!((lang_tree_node *)t)->lambda_expression.pending_proxies);
if (state)
state->write_location
(*this, ((lang_tree_node *)t)->lambda_expression.locus);
if (streaming_p ())
{
WU (((lang_tree_node *)t)->lambda_expression.default_capture_mode);
WU (((lang_tree_node *)t)->lambda_expression.discriminator);
}
break;
case OVERLOAD:
WT (((lang_tree_node *)t)->overload.function);
WT (t->common.chain);
break;
case PTRMEM_CST:
WT (((lang_tree_node *)t)->ptrmem.member);
break;
case STATIC_ASSERT:
WT (((lang_tree_node *)t)->static_assertion.condition);
WT (((lang_tree_node *)t)->static_assertion.message);
if (state)
state->write_location
(*this, ((lang_tree_node *)t)->static_assertion.location);
break;
case TEMPLATE_DECL:
/* Streamed with the template_decl node itself. */
gcc_checking_assert
(TREE_VISITED (((lang_tree_node *)t)->template_decl.arguments));
gcc_checking_assert
(TREE_VISITED (((lang_tree_node *)t)->template_decl.result)
|| dep_hash->find_dependency (t)->is_alias_tmpl_inst ());
if (DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (t))
WT (DECL_CHAIN (t));
break;
case TEMPLATE_INFO:
{
WT (((lang_tree_node *)t)->template_info.tmpl);
WT (((lang_tree_node *)t)->template_info.args);
const auto *ac = (((lang_tree_node *)t)
->template_info.deferred_access_checks);
unsigned len = vec_safe_length (ac);
if (streaming_p ())
u (len);
if (len)
{
for (unsigned ix = 0; ix != len; ix++)
{
const auto &m = (*ac)[ix];
WT (m.binfo);
WT (m.decl);
WT (m.diag_decl);
if (state)
state->write_location (*this, m.loc);
}
}
}
break;
case TEMPLATE_PARM_INDEX:
if (streaming_p ())
{
WU (((lang_tree_node *)t)->tpi.index);
WU (((lang_tree_node *)t)->tpi.level);
WU (((lang_tree_node *)t)->tpi.orig_level);
}
WT (((lang_tree_node *)t)->tpi.decl);
/* TEMPLATE_PARM_DESCENDANTS (AKA TREE_CHAIN) is an internal
cache, do not stream. */
break;
case TRAIT_EXPR:
WT (((lang_tree_node *)t)->trait_expression.type1);
WT (((lang_tree_node *)t)->trait_expression.type2);
if (streaming_p ())
WU (((lang_tree_node *)t)->trait_expression.kind);
break;
}
if (CODE_CONTAINS_STRUCT (code, TS_TYPED))
{
/* We want to stream the type of a expression-like nodes /after/
we've streamed the operands. The type often contains (bits
of the) types of the operands, and with things like decltype
and noexcept in play, we really want to stream the decls
defining the type before we try and stream the type on its
own. Otherwise we can find ourselves trying to read in a
decl, when we're already partially reading in a component of
its type. And that's bad. */
tree type = t->typed.type;
unsigned prec = 0;
switch (code)
{
default:
break;
case TEMPLATE_DECL:
/* We fill in the template's type separately. */
type = NULL_TREE;
break;
case TYPE_DECL:
if (DECL_ORIGINAL_TYPE (t) && t == TYPE_NAME (type))
/* This is a typedef. We set its type separately. */
type = NULL_TREE;
break;
case ENUMERAL_TYPE:
if (type && !ENUM_FIXED_UNDERLYING_TYPE_P (t))
{
/* Type is a restricted range integer type derived from the
integer_types. Find the right one. */
prec = TYPE_PRECISION (type);
tree name = DECL_NAME (TYPE_NAME (type));
for (unsigned itk = itk_none; itk--;)
if (integer_types[itk]
&& DECL_NAME (TYPE_NAME (integer_types[itk])) == name)
{
type = integer_types[itk];
break;
}
gcc_assert (type != t->typed.type);
}
break;
}
WT (type);
if (prec && streaming_p ())
WU (prec);
}
#undef WT
#undef WU
}
// Streaming in a reference to a decl can cause that decl to be
// TREE_USED, which is the mark_used behaviour we need most of the
// time. The trees_in::unused can be incremented to inhibit this,
// which is at least needed for vtables.
bool
trees_in::core_vals (tree t)
{
#define RU(X) ((X) = u ())
#define RUC(T,X) ((X) = T (u ()))
#define RT(X) ((X) = tree_node ())
#define RTU(X) ((X) = tree_node (true))
tree_code code = TREE_CODE (t);
/* First by tree shape. */
if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
{
RT (t->decl_minimal.name);
if (!DECL_TEMPLATE_PARM_P (t))
RT (t->decl_minimal.context);
/* Don't zap the locus just yet, we don't record it correctly
and thus lose all location information. */
t->decl_minimal.locus = state->read_location (*this);
}
if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON))
{
RT (t->type_common.name);
RT (t->type_common.context);
RT (t->type_common.main_variant);
RT (t->type_common.canonical);
/* type_common.next_variant is internally manipulated. */
/* type_common.pointer_to, type_common.reference_to. */
RU (t->type_common.precision);
RU (t->type_common.contains_placeholder_bits);
RUC (machine_mode, t->type_common.mode);
RU (t->type_common.align);
if (!RECORD_OR_UNION_CODE_P (code))
{
RT (t->type_common.size);
RT (t->type_common.size_unit);
}
RT (t->type_common.attributes);
RT (t->type_common.common.chain); /* TYPE_STUB_DECL. */
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
{
RUC (machine_mode, t->decl_common.mode);
RU (t->decl_common.off_align);
RU (t->decl_common.align);
if (code != TEMPLATE_DECL)
{
RT (t->decl_common.size);
RT (t->decl_common.size_unit);
}
RT (t->decl_common.attributes);
RT (t->decl_common.abstract_origin);
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
{
RT (t->decl_with_vis.assembler_name);
RUC (symbol_visibility, t->decl_with_vis.visibility);
}
if (CODE_CONTAINS_STRUCT (code, TS_TYPE_NON_COMMON))
{
/* Records and unions hold FIELDS, VFIELD & BINFO on these
things. */
if (!RECORD_OR_UNION_CODE_P (code) && code != ENUMERAL_TYPE)
{
/* This is not clobbering TYPE_CACHED_VALUES, because this
is a type that doesn't have any. */
gcc_checking_assert (!TYPE_CACHED_VALUES_P (t));
RT (t->type_non_common.values);
RT (t->type_non_common.maxval);
RT (t->type_non_common.minval);
}
RT (t->type_non_common.lang_1);
}
if (CODE_CONTAINS_STRUCT (code, TS_EXP))
{
t->exp.locus = state->read_location (*this);
bool vl = TREE_CODE_CLASS (code) == tcc_vl_exp;
for (unsigned limit = (vl ? VL_EXP_OPERAND_LENGTH (t)
: TREE_OPERAND_LENGTH (t)),
ix = unsigned (vl); ix != limit; ix++)
RTU (TREE_OPERAND (t, ix));
}
/* Then by CODE. Special cases and/or 1:1 tree shape
correspondance. */
switch (code)
{
default:
break;
case ARGUMENT_PACK_SELECT:
case DEFERRED_PARSE:
case IDENTIFIER_NODE:
case BINDING_VECTOR:
case SSA_NAME:
case TRANSLATION_UNIT_DECL:
case USERDEF_LITERAL:
return false; /* Should never meet. */
/* Constants. */
case COMPLEX_CST:
RT (TREE_REALPART (t));
RT (TREE_IMAGPART (t));
break;
case FIXED_CST:
/* Not suported in C++. */
return false;
case INTEGER_CST:
{
unsigned num = TREE_INT_CST_EXT_NUNITS (t);
for (unsigned ix = 0; ix != num; ix++)
TREE_INT_CST_ELT (t, ix) = wu ();
}
break;
case POLY_INT_CST:
/* Not suported in C++. */
return false;
case REAL_CST:
if (const void *bytes = buf (sizeof (real_value)))
memcpy (TREE_REAL_CST_PTR (t), bytes, sizeof (real_value));
break;
case STRING_CST:
/* Streamed during start. */
break;
case VECTOR_CST:
for (unsigned ix = vector_cst_encoded_nelts (t); ix--;)
RT (VECTOR_CST_ENCODED_ELT (t, ix));
break;
/* Decls. */
case VAR_DECL:
if (DECL_CONTEXT (t)
&& TREE_CODE (DECL_CONTEXT (t)) != FUNCTION_DECL)
break;
/* FALLTHROUGH */
case RESULT_DECL:
case PARM_DECL:
if (DECL_HAS_VALUE_EXPR_P (t))
{
/* The DECL_VALUE hash table is a cache, thus if we're
reading a duplicate (which we end up discarding), the
value expr will also be cleaned up at the next gc. */
tree val = tree_node ();
SET_DECL_VALUE_EXPR (t, val);
}
/* FALLTHROUGH */
case CONST_DECL:
case IMPORTED_DECL:
RT (t->decl_common.initial);
break;
case FIELD_DECL:
RT (t->field_decl.offset);
RT (t->field_decl.bit_field_type);
RT (t->field_decl.qualifier);
RT (t->field_decl.bit_offset);
RT (t->field_decl.fcontext);
RT (t->decl_common.initial);
break;
case LABEL_DECL:
RU (t->label_decl.label_decl_uid);
RU (t->label_decl.eh_landing_pad_nr);
break;
case FUNCTION_DECL:
{
unsigned bltin = u ();
t->function_decl.built_in_class = built_in_class (bltin);
if (bltin != NOT_BUILT_IN)
{
bltin = u ();
DECL_UNCHECKED_FUNCTION_CODE (t) = built_in_function (bltin);
}
RT (t->function_decl.personality);
RT (t->function_decl.function_specific_target);
RT (t->function_decl.function_specific_optimization);
RT (t->function_decl.vindex);
if (DECL_HAS_DEPENDENT_EXPLICIT_SPEC_P (t))
{
tree spec;
RT (spec);
store_explicit_specifier (t, spec);
}
}
break;
case USING_DECL:
/* USING_DECL_DECLS */
RT (t->decl_common.initial);
/* FALLTHROUGH */
case TYPE_DECL:
/* USING_DECL: USING_DECL_SCOPE */
/* TYPE_DECL: DECL_ORIGINAL_TYPE */
RT (t->decl_non_common.result);
break;
/* Miscellaneous common nodes. */
case BLOCK:
t->block.locus = state->read_location (*this);
t->block.end_locus = state->read_location (*this);
t->block.vars = chained_decls ();
/* nonlocalized_vars is middle-end. */
RT (t->block.subblocks);
RT (t->block.supercontext);
RT (t->block.abstract_origin);
/* fragment_origin, fragment_chain are middle-end. */
RT (t->block.chain);
/* nonlocalized_vars, block_num, die are middle endy/debug
things. */
break;
case CALL_EXPR:
RUC (internal_fn, t->base.u.ifn);
break;
case CONSTRUCTOR:
if (unsigned len = u ())
{
vec_alloc (t->constructor.elts, len);
for (unsigned ix = 0; ix != len; ix++)
{
constructor_elt elt;
RT (elt.index);
RTU (elt.value);
t->constructor.elts->quick_push (elt);
}
}
break;
case OMP_CLAUSE:
{
RU (t->omp_clause.subcode.map_kind);
t->omp_clause.locus = state->read_location (*this);
unsigned len = omp_clause_num_ops[OMP_CLAUSE_CODE (t)];
for (unsigned ix = 0; ix != len; ix++)
RT (t->omp_clause.ops[ix]);
}
break;
case STATEMENT_LIST:
{
tree_stmt_iterator iter = tsi_start (t);
for (tree stmt; RT (stmt);)
tsi_link_after (&iter, stmt, TSI_CONTINUE_LINKING);
}
break;
case OPTIMIZATION_NODE:
case TARGET_OPTION_NODE:
/* Not yet implemented, see trees_out::core_vals. */
gcc_unreachable ();
break;
case TREE_BINFO:
RT (t->binfo.common.chain);
RT (t->binfo.offset);
RT (t->binfo.inheritance);
RT (t->binfo.vptr_field);
/* Do not mark the vtables as USED in the address expressions
here. */
unused++;
RT (t->binfo.vtable);
RT (t->binfo.virtuals);
RT (t->binfo.vtt_subvtt);
RT (t->binfo.vtt_vptr);
unused--;
BINFO_BASE_ACCESSES (t) = tree_vec ();
if (!get_overrun ())
{
unsigned num = vec_safe_length (BINFO_BASE_ACCESSES (t));
for (unsigned ix = 0; ix != num; ix++)
BINFO_BASE_APPEND (t, tree_node ());
}
break;
case TREE_LIST:
RT (t->list.purpose);
RT (t->list.value);
RT (t->list.common.chain);
break;
case TREE_VEC:
for (unsigned ix = TREE_VEC_LENGTH (t); ix--;)
RT (TREE_VEC_ELT (t, ix));
RT (t->type_common.common.chain);
break;
/* C++-specific nodes ... */
case BASELINK:
RT (((lang_tree_node *)t)->baselink.binfo);
RTU (((lang_tree_node *)t)->baselink.functions);
RT (((lang_tree_node *)t)->baselink.access_binfo);
break;
case CONSTRAINT_INFO:
RT (((lang_tree_node *)t)->constraint_info.template_reqs);
RT (((lang_tree_node *)t)->constraint_info.declarator_reqs);
RT (((lang_tree_node *)t)->constraint_info.associated_constr);
break;
case DEFERRED_NOEXCEPT:
RT (((lang_tree_node *)t)->deferred_noexcept.pattern);
RT (((lang_tree_node *)t)->deferred_noexcept.args);
break;
case LAMBDA_EXPR:
RT (((lang_tree_node *)t)->lambda_expression.capture_list);
RT (((lang_tree_node *)t)->lambda_expression.this_capture);
RT (((lang_tree_node *)t)->lambda_expression.extra_scope);
/* lambda_expression.pending_proxies is NULL */
((lang_tree_node *)t)->lambda_expression.locus
= state->read_location (*this);
RUC (cp_lambda_default_capture_mode_type,
((lang_tree_node *)t)->lambda_expression.default_capture_mode);
RU (((lang_tree_node *)t)->lambda_expression.discriminator);
break;
case OVERLOAD:
RT (((lang_tree_node *)t)->overload.function);
RT (t->common.chain);
break;
case PTRMEM_CST:
RT (((lang_tree_node *)t)->ptrmem.member);
break;
case STATIC_ASSERT:
RT (((lang_tree_node *)t)->static_assertion.condition);
RT (((lang_tree_node *)t)->static_assertion.message);
((lang_tree_node *)t)->static_assertion.location
= state->read_location (*this);
break;
case TEMPLATE_DECL:
/* Streamed when reading the raw template decl itself. */
gcc_assert (((lang_tree_node *)t)->template_decl.arguments);
gcc_assert (((lang_tree_node *)t)->template_decl.result);
if (DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (t))
RT (DECL_CHAIN (t));
break;
case TEMPLATE_INFO:
RT (((lang_tree_node *)t)->template_info.tmpl);
RT (((lang_tree_node *)t)->template_info.args);
if (unsigned len = u ())
{
auto &ac = (((lang_tree_node *)t)
->template_info.deferred_access_checks);
vec_alloc (ac, len);
for (unsigned ix = 0; ix != len; ix++)
{
deferred_access_check m;
RT (m.binfo);
RT (m.decl);
RT (m.diag_decl);
m.loc = state->read_location (*this);
ac->quick_push (m);
}
}
break;
case TEMPLATE_PARM_INDEX:
RU (((lang_tree_node *)t)->tpi.index);
RU (((lang_tree_node *)t)->tpi.level);
RU (((lang_tree_node *)t)->tpi.orig_level);
RT (((lang_tree_node *)t)->tpi.decl);
break;
case TRAIT_EXPR:
RT (((lang_tree_node *)t)->trait_expression.type1);
RT (((lang_tree_node *)t)->trait_expression.type2);
RUC (cp_trait_kind, ((lang_tree_node *)t)->trait_expression.kind);
break;
}
if (CODE_CONTAINS_STRUCT (code, TS_TYPED))
{
tree type = tree_node ();
if (type && code == ENUMERAL_TYPE && !ENUM_FIXED_UNDERLYING_TYPE_P (t))
{
unsigned precision = u ();
type = build_distinct_type_copy (type);
TYPE_PRECISION (type) = precision;
set_min_and_max_values_for_integral_type (type, precision,
TYPE_SIGN (type));
}
if (code != TEMPLATE_DECL)
t->typed.type = type;
}
#undef RT
#undef RM
#undef RU
return !get_overrun ();
}
void
trees_out::lang_decl_vals (tree t)
{
const struct lang_decl *lang = DECL_LANG_SPECIFIC (t);
#define WU(X) (u (X))
#define WT(X) (tree_node (X))
/* Module index already written. */
switch (lang->u.base.selector)
{
default:
gcc_unreachable ();
case lds_fn: /* lang_decl_fn. */
if (streaming_p ())
{
if (DECL_NAME (t) && IDENTIFIER_OVL_OP_P (DECL_NAME (t)))
WU (lang->u.fn.ovl_op_code);
}
if (DECL_CLASS_SCOPE_P (t))
WT (lang->u.fn.context);
if (lang->u.fn.thunk_p)
{
/* The thunked-to function. */
WT (lang->u.fn.befriending_classes);
if (streaming_p ())
wi (lang->u.fn.u5.fixed_offset);
}
else
WT (lang->u.fn.u5.cloned_function);
if (FNDECL_USED_AUTO (t))
WT (lang->u.fn.u.saved_auto_return_type);
goto lds_min;
case lds_decomp: /* lang_decl_decomp. */
WT (lang->u.decomp.base);
goto lds_min;
case lds_min: /* lang_decl_min. */
lds_min:
WT (lang->u.min.template_info);
{
tree access = lang->u.min.access;
/* DECL_ACCESS needs to be maintained by the definition of the
(derived) class that changes the access. The other users
of DECL_ACCESS need to write it here. */
if (!DECL_THUNK_P (t)
&& (DECL_CONTEXT (t) && TYPE_P (DECL_CONTEXT (t))))
access = NULL_TREE;
WT (access);
}
break;
case lds_ns: /* lang_decl_ns. */
break;
case lds_parm: /* lang_decl_parm. */
if (streaming_p ())
{
WU (lang->u.parm.level);
WU (lang->u.parm.index);
}
break;
}
#undef WU
#undef WT
}
bool
trees_in::lang_decl_vals (tree t)
{
struct lang_decl *lang = DECL_LANG_SPECIFIC (t);
#define RU(X) ((X) = u ())
#define RT(X) ((X) = tree_node ())
/* Module index already read. */
switch (lang->u.base.selector)
{
default:
gcc_unreachable ();
case lds_fn: /* lang_decl_fn. */
if (DECL_NAME (t) && IDENTIFIER_OVL_OP_P (DECL_NAME (t)))
{
unsigned code = u ();
/* Check consistency. */
if (code >= OVL_OP_MAX
|| (ovl_op_info[IDENTIFIER_ASSIGN_OP_P (DECL_NAME (t))][code]
.ovl_op_code) == OVL_OP_ERROR_MARK)
set_overrun ();
else
lang->u.fn.ovl_op_code = code;
}
if (DECL_CLASS_SCOPE_P (t))
RT (lang->u.fn.context);
if (lang->u.fn.thunk_p)
{
RT (lang->u.fn.befriending_classes);
lang->u.fn.u5.fixed_offset = wi ();
}
else
RT (lang->u.fn.u5.cloned_function);
if (FNDECL_USED_AUTO (t))
RT (lang->u.fn.u.saved_auto_return_type);
goto lds_min;
case lds_decomp: /* lang_decl_decomp. */
RT (lang->u.decomp.base);
goto lds_min;
case lds_min: /* lang_decl_min. */
lds_min:
RT (lang->u.min.template_info);
RT (lang->u.min.access);
break;
case lds_ns: /* lang_decl_ns. */
break;
case lds_parm: /* lang_decl_parm. */
RU (lang->u.parm.level);
RU (lang->u.parm.index);
break;
}
#undef RU
#undef RT
return !get_overrun ();
}
/* Most of the value contents of lang_type is streamed in
define_class. */
void
trees_out::lang_type_vals (tree t)
{
const struct lang_type *lang = TYPE_LANG_SPECIFIC (t);
#define WU(X) (u (X))
#define WT(X) (tree_node (X))
if (streaming_p ())
WU (lang->align);
#undef WU
#undef WT
}
bool
trees_in::lang_type_vals (tree t)
{
struct lang_type *lang = TYPE_LANG_SPECIFIC (t);
#define RU(X) ((X) = u ())
#define RT(X) ((X) = tree_node ())
RU (lang->align);
#undef RU
#undef RT
return !get_overrun ();
}
/* Write out the bools of T, including information about any
LANG_SPECIFIC information. Including allocation of any lang
specific object. */
void
trees_out::tree_node_bools (tree t)
{
gcc_checking_assert (streaming_p ());
/* We should never stream a namespace. */
gcc_checking_assert (TREE_CODE (t) != NAMESPACE_DECL
|| DECL_NAMESPACE_ALIAS (t));
core_bools (t);
switch (TREE_CODE_CLASS (TREE_CODE (t)))
{
case tcc_declaration:
{
bool specific = DECL_LANG_SPECIFIC (t) != NULL;
b (specific);
if (specific && VAR_P (t))
b (DECL_DECOMPOSITION_P (t));
if (specific)
lang_decl_bools (t);
}
break;
case tcc_type:
{
bool specific = (TYPE_MAIN_VARIANT (t) == t
&& TYPE_LANG_SPECIFIC (t) != NULL);
gcc_assert (TYPE_LANG_SPECIFIC (t)
== TYPE_LANG_SPECIFIC (TYPE_MAIN_VARIANT (t)));
b (specific);
if (specific)
lang_type_bools (t);
}
break;
default:
break;
}
bflush ();
}
bool
trees_in::tree_node_bools (tree t)
{
bool ok = core_bools (t);
if (ok)
switch (TREE_CODE_CLASS (TREE_CODE (t)))
{
case tcc_declaration:
if (b ())
{
bool decomp = VAR_P (t) && b ();
ok = maybe_add_lang_decl_raw (t, decomp);
if (ok)
ok = lang_decl_bools (t);
}
break;
case tcc_type:
if (b ())
{
ok = maybe_add_lang_type_raw (t);
if (ok)
ok = lang_type_bools (t);
}
break;
default:
break;
}
bflush ();
if (!ok || get_overrun ())
return false;
return true;
}
/* Write out the lang-specifc vals of node T. */
void
trees_out::lang_vals (tree t)
{
switch (TREE_CODE_CLASS (TREE_CODE (t)))
{
case tcc_declaration:
if (DECL_LANG_SPECIFIC (t))
lang_decl_vals (t);
break;
case tcc_type:
if (TYPE_MAIN_VARIANT (t) == t && TYPE_LANG_SPECIFIC (t))
lang_type_vals (t);
break;
default:
break;
}
}
bool
trees_in::lang_vals (tree t)
{
bool ok = true;
switch (TREE_CODE_CLASS (TREE_CODE (t)))
{
case tcc_declaration:
if (DECL_LANG_SPECIFIC (t))
ok = lang_decl_vals (t);
break;
case tcc_type:
if (TYPE_LANG_SPECIFIC (t))
ok = lang_type_vals (t);
else
TYPE_LANG_SPECIFIC (t) = TYPE_LANG_SPECIFIC (TYPE_MAIN_VARIANT (t));
break;
default:
break;
}
return ok;
}
/* Write out the value fields of node T. */
void
trees_out::tree_node_vals (tree t)
{
core_vals (t);
lang_vals (t);
}
bool
trees_in::tree_node_vals (tree t)
{
bool ok = core_vals (t);
if (ok)
ok = lang_vals (t);
return ok;
}
/* If T is a back reference, fixed reference or NULL, write out its
code and return WK_none. Otherwise return WK_value if we must write
by value, or WK_normal otherwise. */
walk_kind
trees_out::ref_node (tree t)
{
if (!t)
{
if (streaming_p ())
{
/* NULL_TREE -> tt_null. */
null_count++;
i (tt_null);
}
return WK_none;
}
if (!TREE_VISITED (t))
return WK_normal;
/* An already-visited tree. It must be in the map. */
int val = get_tag (t);
if (val == tag_value)
/* An entry we should walk into. */
return WK_value;
const char *kind;
if (val <= tag_backref)
{
/* Back reference -> -ve number */
if (streaming_p ())
i (val);
kind = "backref";
}
else if (val >= tag_fixed)
{
/* Fixed reference -> tt_fixed */
val -= tag_fixed;
if (streaming_p ())
i (tt_fixed), u (val);
kind = "fixed";
}
if (streaming_p ())
{
back_ref_count++;
dump (dumper::TREE)
&& dump ("Wrote %s:%d %C:%N%S", kind, val, TREE_CODE (t), t, t);
}
return WK_none;
}
tree
trees_in::back_ref (int tag)
{
tree res = NULL_TREE;
if (tag < 0 && unsigned (~tag) < back_refs.length ())
res = back_refs[~tag];
if (!res
/* Checking TREE_CODE is a dereference, so we know this is not a
wild pointer. Checking the code provides evidence we've not
corrupted something. */
|| TREE_CODE (res) >= MAX_TREE_CODES)
set_overrun ();
else
dump (dumper::TREE) && dump ("Read backref:%d found %C:%N%S", tag,
TREE_CODE (res), res, res);
return res;
}
unsigned
trees_out::add_indirect_tpl_parms (tree parms)
{
unsigned len = 0;
for (; parms; parms = TREE_CHAIN (parms), len++)
{
if (TREE_VISITED (parms))
break;
int tag = insert (parms);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Indirect:%d template's parameter %u %C:%N",
tag, len, TREE_CODE (parms), parms);
}
if (streaming_p ())
u (len);
return len;
}
unsigned
trees_in::add_indirect_tpl_parms (tree parms)
{
unsigned len = u ();
for (unsigned ix = 0; ix != len; parms = TREE_CHAIN (parms), ix++)
{
int tag = insert (parms);
dump (dumper::TREE)
&& dump ("Indirect:%d template's parameter %u %C:%N",
tag, ix, TREE_CODE (parms), parms);
}
return len;
}
/* We've just found DECL by name. Insert nodes that come with it, but
cannot be found by name, so we'll not accidentally walk into them. */
void
trees_out::add_indirects (tree decl)
{
unsigned count = 0;
// FIXME:OPTIMIZATION We'll eventually want default fn parms of
// templates and perhaps default template parms too. The former can
// be referenced from instantiations (as they are lazily
// instantiated). Also (deferred?) exception specifications of
// templates. See the note about PARM_DECLs in trees_out::decl_node.
tree inner = decl;
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
count += add_indirect_tpl_parms (DECL_TEMPLATE_PARMS (decl));
inner = DECL_TEMPLATE_RESULT (decl);
int tag = insert (inner);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Indirect:%d template's result %C:%N",
tag, TREE_CODE (inner), inner);
count++;
}
if (TREE_CODE (inner) == TYPE_DECL)
{
/* Make sure the type is in the map too. Otherwise we get
different RECORD_TYPEs for the same type, and things go
south. */
tree type = TREE_TYPE (inner);
gcc_checking_assert (DECL_ORIGINAL_TYPE (inner)
|| TYPE_NAME (type) == inner);
int tag = insert (type);
if (streaming_p ())
dump (dumper::TREE) && dump ("Indirect:%d decl's type %C:%N", tag,
TREE_CODE (type), type);
count++;
}
if (streaming_p ())
{
u (count);
dump (dumper::TREE) && dump ("Inserted %u indirects", count);
}
}
bool
trees_in::add_indirects (tree decl)
{
unsigned count = 0;
tree inner = decl;
if (TREE_CODE (inner) == TEMPLATE_DECL)
{
count += add_indirect_tpl_parms (DECL_TEMPLATE_PARMS (decl));
inner = DECL_TEMPLATE_RESULT (decl);
int tag = insert (inner);
dump (dumper::TREE)
&& dump ("Indirect:%d templates's result %C:%N", tag,
TREE_CODE (inner), inner);
count++;
}
if (TREE_CODE (inner) == TYPE_DECL)
{
tree type = TREE_TYPE (inner);
gcc_checking_assert (DECL_ORIGINAL_TYPE (inner)
|| TYPE_NAME (type) == inner);
int tag = insert (type);
dump (dumper::TREE)
&& dump ("Indirect:%d decl's type %C:%N", tag, TREE_CODE (type), type);
count++;
}
dump (dumper::TREE) && dump ("Inserted %u indirects", count);
return count == u ();
}
/* Stream a template parameter. There are 4.5 kinds of parameter:
a) Template - TEMPLATE_DECL->TYPE_DECL->TEMPLATE_TEMPLATE_PARM
TEMPLATE_TYPE_PARM_INDEX TPI
b) Type - TYPE_DECL->TEMPLATE_TYPE_PARM TEMPLATE_TYPE_PARM_INDEX TPI
c.1) NonTYPE - PARM_DECL DECL_INITIAL TPI We meet this first
c.2) NonTYPE - CONST_DECL DECL_INITIAL Same TPI
d) BoundTemplate - TYPE_DECL->BOUND_TEMPLATE_TEMPLATE_PARM
TEMPLATE_TYPE_PARM_INDEX->TPI
TEMPLATE_TEMPLATE_PARM_INFO->TEMPLATE_INFO
All of these point to a TEMPLATE_PARM_INDEX, and #B also has a TEMPLATE_INFO
*/
void
trees_out::tpl_parm_value (tree parm)
{
gcc_checking_assert (DECL_P (parm) && DECL_TEMPLATE_PARM_P (parm));
int parm_tag = insert (parm);
if (streaming_p ())
{
i (tt_tpl_parm);
dump (dumper::TREE) && dump ("Writing template parm:%d %C:%N",
parm_tag, TREE_CODE (parm), parm);
start (parm);
tree_node_bools (parm);
}
tree inner = parm;
if (TREE_CODE (inner) == TEMPLATE_DECL)
{
inner = DECL_TEMPLATE_RESULT (inner);
int inner_tag = insert (inner);
if (streaming_p ())
{
dump (dumper::TREE) && dump ("Writing inner template parm:%d %C:%N",
inner_tag, TREE_CODE (inner), inner);
start (inner);
tree_node_bools (inner);
}
}
tree type = NULL_TREE;
if (TREE_CODE (inner) == TYPE_DECL)
{
type = TREE_TYPE (inner);
int type_tag = insert (type);
if (streaming_p ())
{
dump (dumper::TREE) && dump ("Writing template parm type:%d %C:%N",
type_tag, TREE_CODE (type), type);
start (type);
tree_node_bools (type);
}
}
if (inner != parm)
{
/* This is a template-template parameter. */
unsigned tpl_levels = 0;
tpl_header (parm, &tpl_levels);
tpl_parms_fini (parm, tpl_levels);
}
tree_node_vals (parm);
if (inner != parm)
tree_node_vals (inner);
if (type)
{
tree_node_vals (type);
if (DECL_NAME (inner) == auto_identifier
|| DECL_NAME (inner) == decltype_auto_identifier)
{
/* Placeholder auto. */
tree_node (DECL_INITIAL (inner));
tree_node (DECL_SIZE_UNIT (inner));
}
}
if (streaming_p ())
dump (dumper::TREE) && dump ("Wrote template parm:%d %C:%N",
parm_tag, TREE_CODE (parm), parm);
}
tree
trees_in::tpl_parm_value ()
{
tree parm = start ();
if (!parm || !tree_node_bools (parm))
return NULL_TREE;
int parm_tag = insert (parm);
dump (dumper::TREE) && dump ("Reading template parm:%d %C:%N",
parm_tag, TREE_CODE (parm), parm);
tree inner = parm;
if (TREE_CODE (inner) == TEMPLATE_DECL)
{
inner = start ();
if (!inner || !tree_node_bools (inner))
return NULL_TREE;
int inner_tag = insert (inner);
dump (dumper::TREE) && dump ("Reading inner template parm:%d %C:%N",
inner_tag, TREE_CODE (inner), inner);
DECL_TEMPLATE_RESULT (parm) = inner;
}
tree type = NULL_TREE;
if (TREE_CODE (inner) == TYPE_DECL)
{
type = start ();
if (!type || !tree_node_bools (type))
return NULL_TREE;
int type_tag = insert (type);
dump (dumper::TREE) && dump ("Reading template parm type:%d %C:%N",
type_tag, TREE_CODE (type), type);
TREE_TYPE (inner) = TREE_TYPE (parm) = type;
TYPE_NAME (type) = parm;
}
if (inner != parm)
{
/* A template template parameter. */
unsigned tpl_levels = 0;
tpl_header (parm, &tpl_levels);
tpl_parms_fini (parm, tpl_levels);
}
tree_node_vals (parm);
if (inner != parm)
tree_node_vals (inner);
if (type)
{
tree_node_vals (type);
if (DECL_NAME (inner) == auto_identifier
|| DECL_NAME (inner) == decltype_auto_identifier)
{
/* Placeholder auto. */
DECL_INITIAL (inner) = tree_node ();
DECL_SIZE_UNIT (inner) = tree_node ();
}
if (TYPE_CANONICAL (type))
{
gcc_checking_assert (TYPE_CANONICAL (type) == type);
TYPE_CANONICAL (type) = canonical_type_parameter (type);
}
}
dump (dumper::TREE) && dump ("Read template parm:%d %C:%N",
parm_tag, TREE_CODE (parm), parm);
return parm;
}
void
trees_out::install_entity (tree decl, depset *dep)
{
gcc_checking_assert (streaming_p ());
/* Write the entity index, so we can insert it as soon as we
know this is new. */
u (dep ? dep->cluster + 1 : 0);
if (CHECKING_P && dep)
{
/* Add it to the entity map, such that we can tell it is
part of us. */
bool existed;
unsigned *slot = &entity_map->get_or_insert
(DECL_UID (decl), &existed);
if (existed)
/* If it existed, it should match. */
gcc_checking_assert (decl == (*entity_ary)[*slot]);
*slot = ~dep->cluster;
}
}
bool
trees_in::install_entity (tree decl)
{
unsigned entity_index = u ();
if (!entity_index)
return false;
if (entity_index > state->entity_num)
{
set_overrun ();
return false;
}
/* Insert the real decl into the entity ary. */
unsigned ident = state->entity_lwm + entity_index - 1;
(*entity_ary)[ident] = decl;
/* And into the entity map, if it's not already there. */
tree not_tmpl = STRIP_TEMPLATE (decl);
if (!DECL_LANG_SPECIFIC (not_tmpl)
|| !DECL_MODULE_ENTITY_P (not_tmpl))
{
retrofit_lang_decl (not_tmpl);
DECL_MODULE_ENTITY_P (not_tmpl) = true;
/* Insert into the entity hash (it cannot already be there). */
bool existed;
unsigned &slot = entity_map->get_or_insert (DECL_UID (decl), &existed);
gcc_checking_assert (!existed);
slot = ident;
}
return true;
}
static bool has_definition (tree decl);
/* DECL is a decl node that must be written by value. DEP is the
decl's depset. */
void
trees_out::decl_value (tree decl, depset *dep)
{
/* We should not be writing clones or template parms. */
gcc_checking_assert (DECL_P (decl)
&& !DECL_CLONED_FUNCTION_P (decl)
&& !DECL_TEMPLATE_PARM_P (decl));
/* We should never be writing non-typedef ptrmemfuncs by value. */
gcc_checking_assert (TREE_CODE (decl) != TYPE_DECL
|| DECL_ORIGINAL_TYPE (decl)
|| !TYPE_PTRMEMFUNC_P (TREE_TYPE (decl)));
merge_kind mk = get_merge_kind (decl, dep);
if (CHECKING_P)
{
/* Never start in the middle of a template. */
int use_tpl = -1;
if (tree ti = node_template_info (decl, use_tpl))
gcc_checking_assert (TREE_CODE (TI_TEMPLATE (ti)) == OVERLOAD
|| TREE_CODE (TI_TEMPLATE (ti)) == FIELD_DECL
|| (DECL_TEMPLATE_RESULT (TI_TEMPLATE (ti))
!= decl));
}
if (streaming_p ())
{
/* A new node -> tt_decl. */
decl_val_count++;
i (tt_decl);
u (mk);
start (decl);
if (mk != MK_unique)
{
if (!(mk & MK_template_mask) && !state->is_header ())
{
/* Tell the importer whether this is a global module entity,
or a module entity. This bool merges into the next block
of bools. Sneaky. */
tree o = get_originating_module_decl (decl);
bool is_attached = false;
tree not_tmpl = STRIP_TEMPLATE (o);
if (DECL_LANG_SPECIFIC (not_tmpl)
&& DECL_MODULE_ATTACH_P (not_tmpl))
is_attached = true;
b (is_attached);
}
b (dep && dep->has_defn ());
}
tree_node_bools (decl);
}
int tag = insert (decl, WK_value);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Writing %s:%d %C:%N%S", merge_kind_name[mk], tag,
TREE_CODE (decl), decl, decl);
tree inner = decl;
int inner_tag = 0;
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
inner = DECL_TEMPLATE_RESULT (decl);
inner_tag = insert (inner, WK_value);
if (streaming_p ())
{
int code = TREE_CODE (inner);
u (code);
start (inner, true);
tree_node_bools (inner);
dump (dumper::TREE)
&& dump ("Writing %s:%d %C:%N%S", merge_kind_name[mk], inner_tag,
TREE_CODE (inner), inner, inner);
}
}
tree type = NULL_TREE;
int type_tag = 0;
tree stub_decl = NULL_TREE;
int stub_tag = 0;
if (TREE_CODE (inner) == TYPE_DECL)
{
type = TREE_TYPE (inner);
bool has_type = (type == TYPE_MAIN_VARIANT (type)
&& TYPE_NAME (type) == inner);
if (streaming_p ())
u (has_type ? TREE_CODE (type) : 0);
if (has_type)
{
type_tag = insert (type, WK_value);
if (streaming_p ())
{
start (type, true);
tree_node_bools (type);
dump (dumper::TREE)
&& dump ("Writing type:%d %C:%N", type_tag,
TREE_CODE (type), type);
}
stub_decl = TYPE_STUB_DECL (type);
bool has_stub = inner != stub_decl;
if (streaming_p ())
u (has_stub ? TREE_CODE (stub_decl) : 0);
if (has_stub)
{
stub_tag = insert (stub_decl);
if (streaming_p ())
{
start (stub_decl, true);
tree_node_bools (stub_decl);
dump (dumper::TREE)
&& dump ("Writing stub_decl:%d %C:%N", stub_tag,
TREE_CODE (stub_decl), stub_decl);
}
}
else
stub_decl = NULL_TREE;
}
else
/* Regular typedef. */
type = NULL_TREE;
}
/* Stream the container, we want it correctly canonicalized before
we start emitting keys for this decl. */
tree container = decl_container (decl);
unsigned tpl_levels = 0;
if (decl != inner)
tpl_header (decl, &tpl_levels);
if (TREE_CODE (inner) == FUNCTION_DECL)
fn_parms_init (inner);
/* Now write out the merging information, and then really
install the tag values. */
key_mergeable (tag, mk, decl, inner, container, dep);
if (streaming_p ())
dump (dumper::MERGE)
&& dump ("Wrote:%d's %s merge key %C:%N", tag,
merge_kind_name[mk], TREE_CODE (decl), decl);
if (TREE_CODE (inner) == FUNCTION_DECL)
fn_parms_fini (inner);
if (!is_key_order ())
tree_node_vals (decl);
if (inner_tag)
{
if (!is_key_order ())
tree_node_vals (inner);
tpl_parms_fini (decl, tpl_levels);
}
if (type && !is_key_order ())
{
tree_node_vals (type);
if (stub_decl)
tree_node_vals (stub_decl);
}
if (!is_key_order ())
{
if (mk & MK_template_mask
|| mk == MK_partial
|| mk == MK_friend_spec)
{
if (mk != MK_partial)
{
// FIXME: We should make use of the merge-key by
// exposing it outside of key_mergeable. But this gets
// the job done.
auto *entry = reinterpret_cast <spec_entry *> (dep->deps[0]);
if (streaming_p ())
u (get_mergeable_specialization_flags (entry->tmpl, decl));
tree_node (entry->tmpl);
tree_node (entry->args);
}
else
{
tree ti = get_template_info (inner);
tree_node (TI_TEMPLATE (ti));
tree_node (TI_ARGS (ti));
}
}
tree_node (get_constraints (decl));
}
if (streaming_p ())
{
/* Do not stray outside this section. */
gcc_checking_assert (!dep || dep->section == dep_hash->section);
/* Write the entity index, so we can insert it as soon as we
know this is new. */
install_entity (decl, dep);
}
if (VAR_OR_FUNCTION_DECL_P (inner)
&& DECL_LANG_SPECIFIC (inner)
&& DECL_MODULE_KEYED_DECLS_P (inner)
&& !is_key_order ())
{
/* Stream the keyed entities. */
auto *attach_vec = keyed_table->get (inner);
unsigned num = attach_vec->length ();
if (streaming_p ())
u (num);
for (unsigned ix = 0; ix != num; ix++)
{
tree attached = (*attach_vec)[ix];
tree_node (attached);
if (streaming_p ())
dump (dumper::MERGE)
&& dump ("Written %d[%u] attached decl %N", tag, ix, attached);
}
}
bool is_typedef = false;
if (!type && TREE_CODE (inner) == TYPE_DECL)
{
tree t = TREE_TYPE (inner);
unsigned tdef_flags = 0;
if (DECL_ORIGINAL_TYPE (inner)
&& TYPE_NAME (TREE_TYPE (inner)) == inner)
{
tdef_flags |= 1;
if (TYPE_STRUCTURAL_EQUALITY_P (t)
&& TYPE_DEPENDENT_P_VALID (t)
&& TYPE_DEPENDENT_P (t))
tdef_flags |= 2;
}
if (streaming_p ())
u (tdef_flags);
if (tdef_flags & 1)
{
/* A typedef type. */
int type_tag = insert (t);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Cloned:%d %s %C:%N", type_tag,
tdef_flags & 2 ? "depalias" : "typedef",
TREE_CODE (t), t);
is_typedef = true;
}
}
if (streaming_p () && DECL_MAYBE_IN_CHARGE_CDTOR_P (decl))
{
bool cloned_p
= (DECL_CHAIN (decl) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl)));
bool needs_vtt_parm_p
= (cloned_p && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (decl)));
bool omit_inherited_parms_p
= (cloned_p && DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)
&& base_ctor_omit_inherited_parms (decl));
unsigned flags = (int (cloned_p) << 0
| int (needs_vtt_parm_p) << 1
| int (omit_inherited_parms_p) << 2);
u (flags);
dump (dumper::TREE) && dump ("CDTOR %N is %scloned",
decl, cloned_p ? "" : "not ");
}
if (streaming_p ())
dump (dumper::TREE) && dump ("Written decl:%d %C:%N", tag,
TREE_CODE (decl), decl);
if (NAMESPACE_SCOPE_P (inner))
gcc_checking_assert (!dep == (VAR_OR_FUNCTION_DECL_P (inner)
&& DECL_LOCAL_DECL_P (inner)));
else if ((TREE_CODE (inner) == TYPE_DECL
&& !is_typedef
&& TYPE_NAME (TREE_TYPE (inner)) == inner)
|| TREE_CODE (inner) == FUNCTION_DECL)
{
bool write_defn = !dep && has_definition (decl);
if (streaming_p ())
u (write_defn);
if (write_defn)
write_definition (decl);
}
}
tree
trees_in::decl_value ()
{
int tag = 0;
bool is_attached = false;
bool has_defn = false;
unsigned mk_u = u ();
if (mk_u >= MK_hwm || !merge_kind_name[mk_u])
{
set_overrun ();
return NULL_TREE;
}
unsigned saved_unused = unused;
unused = 0;
merge_kind mk = merge_kind (mk_u);
tree decl = start ();
if (decl)
{
if (mk != MK_unique)
{
if (!(mk & MK_template_mask) && !state->is_header ())
/* See note in trees_out about where this bool is sequenced. */
is_attached = b ();
has_defn = b ();
}
if (!tree_node_bools (decl))
decl = NULL_TREE;
}
/* Insert into map. */
tag = insert (decl);
if (decl)
dump (dumper::TREE)
&& dump ("Reading:%d %C", tag, TREE_CODE (decl));
tree inner = decl;
int inner_tag = 0;
if (decl && TREE_CODE (decl) == TEMPLATE_DECL)
{
int code = u ();
inner = start (code);
if (inner && tree_node_bools (inner))
DECL_TEMPLATE_RESULT (decl) = inner;
else
decl = NULL_TREE;
inner_tag = insert (inner);
if (decl)
dump (dumper::TREE)
&& dump ("Reading:%d %C", inner_tag, TREE_CODE (inner));
}
tree type = NULL_TREE;
int type_tag = 0;
tree stub_decl = NULL_TREE;
int stub_tag = 0;
if (decl && TREE_CODE (inner) == TYPE_DECL)
{
if (unsigned type_code = u ())
{
type = start (type_code);
if (type && tree_node_bools (type))
{
TREE_TYPE (inner) = type;
TYPE_NAME (type) = inner;
}
else
decl = NULL_TREE;
type_tag = insert (type);
if (decl)
dump (dumper::TREE)
&& dump ("Reading type:%d %C", type_tag, TREE_CODE (type));
if (unsigned stub_code = u ())
{
stub_decl = start (stub_code);
if (stub_decl && tree_node_bools (stub_decl))
{
TREE_TYPE (stub_decl) = type;
TYPE_STUB_DECL (type) = stub_decl;
}
else
decl = NULL_TREE;
stub_tag = insert (stub_decl);
if (decl)
dump (dumper::TREE)
&& dump ("Reading stub_decl:%d %C", stub_tag,
TREE_CODE (stub_decl));
}
}
}
if (!decl)
{
bail:
if (inner_tag != 0)
back_refs[~inner_tag] = NULL_TREE;
if (type_tag != 0)
back_refs[~type_tag] = NULL_TREE;
if (stub_tag != 0)
back_refs[~stub_tag] = NULL_TREE;
if (tag != 0)
back_refs[~tag] = NULL_TREE;
set_overrun ();
/* Bail. */
unused = saved_unused;
return NULL_TREE;
}
/* Read the container, to ensure it's already been streamed in. */
tree container = decl_container ();
unsigned tpl_levels = 0;
/* Figure out if this decl is already known about. */
int parm_tag = 0;
if (decl != inner)
if (!tpl_header (decl, &tpl_levels))
goto bail;
if (TREE_CODE (inner) == FUNCTION_DECL)
parm_tag = fn_parms_init (inner);
tree existing = key_mergeable (tag, mk, decl, inner, type, container,
is_attached);
tree existing_inner = existing;
if (existing)
{
if (existing == error_mark_node)
goto bail;
if (TREE_CODE (STRIP_TEMPLATE (existing)) == TYPE_DECL)
{
tree etype = TREE_TYPE (existing);
if (TYPE_LANG_SPECIFIC (etype)
&& COMPLETE_TYPE_P (etype)
&& !CLASSTYPE_MEMBER_VEC (etype))
/* Give it a member vec, we're likely gonna be looking
inside it. */
set_class_bindings (etype, -1);
}
/* Install the existing decl into the back ref array. */
register_duplicate (decl, existing);
back_refs[~tag] = existing;
if (inner_tag != 0)
{
existing_inner = DECL_TEMPLATE_RESULT (existing);
back_refs[~inner_tag] = existing_inner;
}
if (type_tag != 0)
{
tree existing_type = TREE_TYPE (existing);
back_refs[~type_tag] = existing_type;
if (stub_tag != 0)
back_refs[~stub_tag] = TYPE_STUB_DECL (existing_type);
}
}
if (parm_tag)
fn_parms_fini (parm_tag, inner, existing_inner, has_defn);
if (!tree_node_vals (decl))
goto bail;
if (inner_tag)
{
gcc_checking_assert (DECL_TEMPLATE_RESULT (decl) == inner);
if (!tree_node_vals (inner))
goto bail;
if (!tpl_parms_fini (decl, tpl_levels))
goto bail;
}
if (type && (!tree_node_vals (type)
|| (stub_decl && !tree_node_vals (stub_decl))))
goto bail;
spec_entry spec;
unsigned spec_flags = 0;
if (mk & MK_template_mask
|| mk == MK_partial
|| mk == MK_friend_spec)
{
if (mk == MK_partial)
spec_flags = 2;
else
spec_flags = u ();
spec.tmpl = tree_node ();
spec.args = tree_node ();
}
/* Hold constraints on the spec field, for a short while. */
spec.spec = tree_node ();
dump (dumper::TREE) && dump ("Read:%d %C:%N", tag, TREE_CODE (decl), decl);
existing = back_refs[~tag];
bool installed = install_entity (existing);
bool is_new = existing == decl;
if (VAR_OR_FUNCTION_DECL_P (inner)
&& DECL_LANG_SPECIFIC (inner)
&& DECL_MODULE_KEYED_DECLS_P (inner))
{
/* Read and maybe install the attached entities. */
bool existed;
auto &set = keyed_table->get_or_insert (STRIP_TEMPLATE (existing),
&existed);
unsigned num = u ();
if (is_new == existed)
set_overrun ();
if (is_new)
set.reserve (num);
for (unsigned ix = 0; !get_overrun () && ix != num; ix++)
{
tree attached = tree_node ();
dump (dumper::MERGE)
&& dump ("Read %d[%u] %s attached decl %N", tag, ix,
is_new ? "new" : "matched", attached);
if (is_new)
set.quick_push (attached);
else if (set[ix] != attached)
set_overrun ();
}
}
/* Regular typedefs will have a NULL TREE_TYPE at this point. */
unsigned tdef_flags = 0;
bool is_typedef = false;
if (!type && TREE_CODE (inner) == TYPE_DECL)
{
tdef_flags = u ();
if (tdef_flags & 1)
is_typedef = true;
}
if (is_new)
{
/* A newly discovered node. */
if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
/* Mark this identifier as naming a virtual function --
lookup_overrides relies on this optimization. */
IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = true;
if (installed)
{
/* Mark the entity as imported. */
retrofit_lang_decl (inner);
DECL_MODULE_IMPORT_P (inner) = true;
}
if (spec.spec)
set_constraints (decl, spec.spec);
if (TREE_CODE (decl) == INTEGER_CST && !TREE_OVERFLOW (decl))
{
decl = cache_integer_cst (decl, true);
back_refs[~tag] = decl;
}
if (is_typedef)
{
/* Frob it to be ready for cloning. */
TREE_TYPE (inner) = DECL_ORIGINAL_TYPE (inner);
DECL_ORIGINAL_TYPE (inner) = NULL_TREE;
set_underlying_type (inner);
if (tdef_flags & 2)
{
/* Match instantiate_alias_template's handling. */
tree type = TREE_TYPE (inner);
TYPE_DEPENDENT_P (type) = true;
TYPE_DEPENDENT_P_VALID (type) = true;
SET_TYPE_STRUCTURAL_EQUALITY (type);
}
}
if (inner_tag)
/* Set the TEMPLATE_DECL's type. */
TREE_TYPE (decl) = TREE_TYPE (inner);
/* Add to specialization tables now that constraints etc are
added. */
if (mk == MK_partial)
{
bool is_type = TREE_CODE (inner) == TYPE_DECL;
spec.spec = is_type ? type : inner;
add_mergeable_specialization (!is_type, false,
&spec, decl, spec_flags);
}
else if (mk & MK_template_mask)
{
bool is_type = !(mk & MK_tmpl_decl_mask);
spec.spec = is_type ? type : mk & MK_tmpl_tmpl_mask ? inner : decl;
add_mergeable_specialization (!is_type,
!is_type && mk & MK_tmpl_alias_mask,
&spec, decl, spec_flags);
}
if (NAMESPACE_SCOPE_P (decl)
&& (mk == MK_named || mk == MK_unique
|| mk == MK_enum || mk == MK_friend_spec)
&& !(VAR_OR_FUNCTION_DECL_P (decl) && DECL_LOCAL_DECL_P (decl)))
add_module_namespace_decl (CP_DECL_CONTEXT (decl), decl);
if (DECL_ARTIFICIAL (decl)
&& TREE_CODE (decl) == FUNCTION_DECL
&& !DECL_TEMPLATE_INFO (decl)
&& DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl))
&& TYPE_SIZE (DECL_CONTEXT (decl))
&& !DECL_THUNK_P (decl))
/* A new implicit member function, when the class is
complete. This means the importee declared it, and
we must now add it to the class. Note that implicit
member fns of template instantiations do not themselves
look like templates. */
if (!install_implicit_member (inner))
set_overrun ();
}
else
{
/* DECL is the to-be-discarded decl. Its internal pointers will
be to the EXISTING's structure. Frob it to point to its
own other structures, so loading its definition will alter
it, and not the existing decl. */
dump (dumper::MERGE) && dump ("Deduping %N", existing);
if (inner_tag)
DECL_TEMPLATE_RESULT (decl) = inner;
if (type)
{
/* Point at the to-be-discarded type & decl. */
TYPE_NAME (type) = inner;
TREE_TYPE (inner) = type;
TYPE_STUB_DECL (type) = stub_decl ? stub_decl : inner;
if (stub_decl)
TREE_TYPE (stub_decl) = type;
}
if (inner_tag)
/* Set the TEMPLATE_DECL's type. */
TREE_TYPE (decl) = TREE_TYPE (inner);
if (!is_matching_decl (existing, decl, is_typedef))
unmatched_duplicate (existing);
if (TREE_CODE (inner) == FUNCTION_DECL)
{
tree e_inner = STRIP_TEMPLATE (existing);
for (auto parm = DECL_ARGUMENTS (inner);
parm; parm = DECL_CHAIN (parm))
DECL_CONTEXT (parm) = e_inner;
}
/* And our result is the existing node. */
decl = existing;
}
if (mk == MK_friend_spec)
{
tree e = match_mergeable_specialization (true, &spec);
if (!e)
{
spec.spec = inner;
add_mergeable_specialization (true, false, &spec, decl, spec_flags);
}
else if (e != existing)
set_overrun ();
}
if (is_typedef)
{
/* Insert the type into the array now. */
tag = insert (TREE_TYPE (decl));
dump (dumper::TREE)
&& dump ("Cloned:%d typedef %C:%N",
tag, TREE_CODE (TREE_TYPE (decl)), TREE_TYPE (decl));
}
unused = saved_unused;
if (DECL_MAYBE_IN_CHARGE_CDTOR_P (decl))
{
unsigned flags = u ();
if (is_new)
{
bool cloned_p = flags & 1;
dump (dumper::TREE) && dump ("CDTOR %N is %scloned",
decl, cloned_p ? "" : "not ");
if (cloned_p)
build_cdtor_clones (decl, flags & 2, flags & 4,
/* Update the member vec, if there is
one (we're in a different cluster
to the class defn). */
CLASSTYPE_MEMBER_VEC (DECL_CONTEXT (decl)));
}
}
if (!NAMESPACE_SCOPE_P (inner)
&& ((TREE_CODE (inner) == TYPE_DECL
&& !is_typedef
&& TYPE_NAME (TREE_TYPE (inner)) == inner)
|| TREE_CODE (inner) == FUNCTION_DECL)
&& u ())
read_definition (decl);
return decl;
}
/* DECL is an unnameable member of CTX. Return a suitable identifying
index. */
static unsigned
get_field_ident (tree ctx, tree decl)
{
gcc_checking_assert (TREE_CODE (decl) == USING_DECL
|| !DECL_NAME (decl)
|| IDENTIFIER_ANON_P (DECL_NAME (decl)));
unsigned ix = 0;
for (tree fields = TYPE_FIELDS (ctx);
fields; fields = DECL_CHAIN (fields))
{
if (fields == decl)
return ix;
if (DECL_CONTEXT (fields) == ctx
&& (TREE_CODE (fields) == USING_DECL
|| (TREE_CODE (fields) == FIELD_DECL
&& (!DECL_NAME (fields)
|| IDENTIFIER_ANON_P (DECL_NAME (fields))))))
/* Count this field. */
ix++;
}
gcc_unreachable ();
}
static tree
lookup_field_ident (tree ctx, unsigned ix)
{
for (tree fields = TYPE_FIELDS (ctx);
fields; fields = DECL_CHAIN (fields))
if (DECL_CONTEXT (fields) == ctx
&& (TREE_CODE (fields) == USING_DECL
|| (TREE_CODE (fields) == FIELD_DECL
&& (!DECL_NAME (fields)
|| IDENTIFIER_ANON_P (DECL_NAME (fields))))))
if (!ix--)
return fields;
return NULL_TREE;
}
/* Reference DECL. REF indicates the walk kind we are performing.
Return true if we should write this decl by value. */
bool
trees_out::decl_node (tree decl, walk_kind ref)
{
gcc_checking_assert (DECL_P (decl) && !DECL_TEMPLATE_PARM_P (decl)
&& DECL_CONTEXT (decl));
if (ref == WK_value)
{
depset *dep = dep_hash->find_dependency (decl);
decl_value (decl, dep);
return false;
}
switch (TREE_CODE (decl))
{
default:
break;
case FUNCTION_DECL:
gcc_checking_assert (!DECL_LOCAL_DECL_P (decl));
break;
case RESULT_DECL:
/* Unlike PARM_DECLs, RESULT_DECLs are only generated and
referenced when we're inside the function itself. */
return true;
case PARM_DECL:
{
if (streaming_p ())
i (tt_parm);
tree_node (DECL_CONTEXT (decl));
if (streaming_p ())
{
/* That must have put this in the map. */
walk_kind ref = ref_node (decl);
if (ref != WK_none)
// FIXME:OPTIMIZATION We can wander into bits of the
// template this was instantiated from. For instance
// deferred noexcept and default parms. Currently we'll
// end up cloning those bits of tree. It would be nice
// to reference those specific nodes. I think putting
// those things in the map when we reference their
// template by name. See the note in add_indirects.
return true;
dump (dumper::TREE)
&& dump ("Wrote %s reference %N",
TREE_CODE (decl) == PARM_DECL ? "parameter" : "result",
decl);
}
}
return false;
case IMPORTED_DECL:
/* This describes a USING_DECL to the ME's debug machinery. It
originates from the fortran FE, and has nothing to do with
C++ modules. */
return true;
case LABEL_DECL:
return true;
case CONST_DECL:
{
/* If I end up cloning enum decls, implementing C++20 using
E::v, this will need tweaking. */
if (streaming_p ())
i (tt_enum_decl);
tree ctx = DECL_CONTEXT (decl);
gcc_checking_assert (TREE_CODE (ctx) == ENUMERAL_TYPE);
tree_node (ctx);
tree_node (DECL_NAME (decl));
int tag = insert (decl);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Wrote enum decl:%d %C:%N", tag, TREE_CODE (decl), decl);
return false;
}
break;
case USING_DECL:
if (TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
break;
/* FALLTHROUGH */
case FIELD_DECL:
{
if (streaming_p ())
i (tt_data_member);
tree ctx = DECL_CONTEXT (decl);
tree_node (ctx);
tree name = NULL_TREE;
if (TREE_CODE (decl) == USING_DECL)
;
else
{
name = DECL_NAME (decl);
if (name && IDENTIFIER_ANON_P (name))
name = NULL_TREE;
}
tree_node (name);
if (!name && streaming_p ())
{
unsigned ix = get_field_ident (ctx, decl);
u (ix);
}
int tag = insert (decl);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Wrote member:%d %C:%N", tag, TREE_CODE (decl), decl);
return false;
}
break;
case VAR_DECL:
gcc_checking_assert (!DECL_LOCAL_DECL_P (decl));
if (DECL_VTABLE_OR_VTT_P (decl))
{
/* VTT or VTABLE, they are all on the vtables list. */
tree ctx = CP_DECL_CONTEXT (decl);
tree vtable = CLASSTYPE_VTABLES (ctx);
for (unsigned ix = 0; ; vtable = DECL_CHAIN (vtable), ix++)
if (vtable == decl)
{
gcc_checking_assert (DECL_VIRTUAL_P (decl));
if (streaming_p ())
{
u (tt_vtable);
u (ix);
dump (dumper::TREE)
&& dump ("Writing vtable %N[%u]", ctx, ix);
}
tree_node (ctx);
return false;
}
gcc_unreachable ();
}
if (DECL_TINFO_P (decl))
{
tinfo:
/* A typeinfo, tt_tinfo_typedef or tt_tinfo_var. */
bool is_var = TREE_CODE (decl) == VAR_DECL;
tree type = TREE_TYPE (decl);
unsigned ix = get_pseudo_tinfo_index (type);
if (streaming_p ())
{
i (is_var ? tt_tinfo_var : tt_tinfo_typedef);
u (ix);
}
if (is_var)
{
/* We also need the type it is for and mangled name, so
the reader doesn't need to complete the type (which
would break section ordering). The type it is for is
stashed on the name's TREE_TYPE. */
tree name = DECL_NAME (decl);
tree_node (name);
type = TREE_TYPE (name);
tree_node (type);
}
int tag = insert (decl);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Wrote tinfo_%s:%d %u %N", is_var ? "var" : "type",
tag, ix, type);
if (!is_var)
{
tag = insert (type);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Wrote tinfo_type:%d %u %N", tag, ix, type);
}
return false;
}
if (DECL_NTTP_OBJECT_P (decl))
{
/* A NTTP parm object. */
if (streaming_p ())
i (tt_nttp_var);
tree_node (tparm_object_argument (decl));
tree_node (DECL_NAME (decl));
int tag = insert (decl);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Wrote nttp object:%d %N", tag, DECL_NAME (decl));
return false;
}
break;
case TYPE_DECL:
if (DECL_TINFO_P (decl))
goto tinfo;
break;
}
if (DECL_THUNK_P (decl))
{
/* Thunks are similar to binfos -- write the thunked-to decl and
then thunk-specific key info. */
if (streaming_p ())
{
i (tt_thunk);
i (THUNK_FIXED_OFFSET (decl));
}
tree target = decl;
while (DECL_THUNK_P (target))
target = THUNK_TARGET (target);
tree_node (target);
tree_node (THUNK_VIRTUAL_OFFSET (decl));
int tag = insert (decl);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Wrote:%d thunk %N to %N", tag, DECL_NAME (decl), target);
return false;
}
if (DECL_CLONED_FUNCTION_P (decl))
{
tree target = get_clone_target (decl);
if (streaming_p ())
i (tt_clone_ref);
tree_node (target);
tree_node (DECL_NAME (decl));
int tag = insert (decl);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Wrote:%d clone %N of %N", tag, DECL_NAME (decl), target);
return false;
}
/* Everything left should be a thing that is in the entity table.
Mostly things that can be defined outside of their (original
declaration) context. */
gcc_checking_assert (TREE_CODE (decl) == TEMPLATE_DECL
|| TREE_CODE (decl) == VAR_DECL
|| TREE_CODE (decl) == FUNCTION_DECL
|| TREE_CODE (decl) == TYPE_DECL
|| TREE_CODE (decl) == USING_DECL
|| TREE_CODE (decl) == CONCEPT_DECL
|| TREE_CODE (decl) == NAMESPACE_DECL);
int use_tpl = -1;
tree ti = node_template_info (decl, use_tpl);
tree tpl = NULL_TREE;
/* If this is the TEMPLATE_DECL_RESULT of a TEMPLATE_DECL, get the
TEMPLATE_DECL. Note TI_TEMPLATE is not a TEMPLATE_DECL for
(some) friends, so we need to check that. */
// FIXME: Should local friend template specializations be by value?
// They don't get idents so we'll never know they're imported, but I
// think we can only reach them from the TU that defines the
// befriending class?
if (ti && TREE_CODE (TI_TEMPLATE (ti)) == TEMPLATE_DECL
&& DECL_TEMPLATE_RESULT (TI_TEMPLATE (ti)) == decl)
{
tpl = TI_TEMPLATE (ti);
partial_template:
if (streaming_p ())
{
i (tt_template);
dump (dumper::TREE)
&& dump ("Writing implicit template %C:%N%S",
TREE_CODE (tpl), tpl, tpl);
}
tree_node (tpl);
/* Streaming TPL caused us to visit DECL and maybe its type. */
gcc_checking_assert (TREE_VISITED (decl));
if (DECL_IMPLICIT_TYPEDEF_P (decl))
gcc_checking_assert (TREE_VISITED (TREE_TYPE (decl)));
return false;
}
tree ctx = CP_DECL_CONTEXT (decl);
depset *dep = NULL;
if (streaming_p ())
dep = dep_hash->find_dependency (decl);
else if (TREE_CODE (ctx) != FUNCTION_DECL
|| TREE_CODE (decl) == TEMPLATE_DECL
|| (dep_hash->sneakoscope && DECL_IMPLICIT_TYPEDEF_P (decl))
|| (DECL_LANG_SPECIFIC (decl)
&& DECL_MODULE_IMPORT_P (decl)))
{
auto kind = (TREE_CODE (decl) == NAMESPACE_DECL
&& !DECL_NAMESPACE_ALIAS (decl)
? depset::EK_NAMESPACE : depset::EK_DECL);
dep = dep_hash->add_dependency (decl, kind);
}
if (!dep)
{
/* Some internal entity of context. Do by value. */
decl_value (decl, NULL);
return false;
}
if (dep->get_entity_kind () == depset::EK_REDIRECT)
{
/* The DECL_TEMPLATE_RESULT of a partial specialization.
Write the partial specialization's template. */
depset *redirect = dep->deps[0];
gcc_checking_assert (redirect->get_entity_kind () == depset::EK_PARTIAL);
tpl = redirect->get_entity ();
goto partial_template;
}
if (streaming_p ())
{
/* Locate the entity. */
unsigned index = dep->cluster;
unsigned import = 0;
if (dep->is_import ())
import = dep->section;
else if (CHECKING_P)
/* It should be what we put there. */
gcc_checking_assert (index == ~import_entity_index (decl));
#if CHECKING_P
gcc_assert (!import || importedness >= 0);
#endif
i (tt_entity);
u (import);
u (index);
}
int tag = insert (decl);
if (streaming_p () && dump (dumper::TREE))
{
char const *kind = "import";
module_state *from = (*modules)[0];
if (dep->is_import ())
/* Rediscover the unremapped index. */
from = import_entity_module (import_entity_index (decl));
else
{
tree o = get_originating_module_decl (decl);
o = STRIP_TEMPLATE (o);
kind = (DECL_LANG_SPECIFIC (o) && DECL_MODULE_PURVIEW_P (o)
? "purview" : "GMF");
}
dump ("Wrote %s:%d %C:%N@%M", kind,
tag, TREE_CODE (decl), decl, from);
}
add_indirects (decl);
return false;
}
void
trees_out::type_node (tree type)
{
gcc_assert (TYPE_P (type));
tree root = (TYPE_NAME (type)
? TREE_TYPE (TYPE_NAME (type)) : TYPE_MAIN_VARIANT (type));
if (type != root)
{
if (streaming_p ())
i (tt_variant_type);
tree_node (root);
int flags = -1;
if (TREE_CODE (type) == FUNCTION_TYPE
|| TREE_CODE (type) == METHOD_TYPE)
{
int quals = type_memfn_quals (type);
int rquals = type_memfn_rqual (type);
tree raises = TYPE_RAISES_EXCEPTIONS (type);
bool late = TYPE_HAS_LATE_RETURN_TYPE (type);
if (raises != TYPE_RAISES_EXCEPTIONS (root)
|| rquals != type_memfn_rqual (root)
|| quals != type_memfn_quals (root)
|| late != TYPE_HAS_LATE_RETURN_TYPE (root))
flags = rquals | (int (late) << 2) | (quals << 3);
}
else
{
if (TYPE_USER_ALIGN (type))
flags = TYPE_ALIGN_RAW (type);
}
if (streaming_p ())
i (flags);
if (flags < 0)
;
else if (TREE_CODE (type) == FUNCTION_TYPE
|| TREE_CODE (type) == METHOD_TYPE)
{
tree raises = TYPE_RAISES_EXCEPTIONS (type);
if (raises == TYPE_RAISES_EXCEPTIONS (root))
raises = error_mark_node;
tree_node (raises);
}
tree_node (TYPE_ATTRIBUTES (type));
if (streaming_p ())
{
/* Qualifiers. */
int rquals = cp_type_quals (root);
int quals = cp_type_quals (type);
if (quals == rquals)
quals = -1;
i (quals);
}
if (ref_node (type) != WK_none)
{
int tag = insert (type);
if (streaming_p ())
{
i (0);
dump (dumper::TREE)
&& dump ("Wrote:%d variant type %C", tag, TREE_CODE (type));
}
}
return;
}
if (tree name = TYPE_NAME (type))
if ((TREE_CODE (name) == TYPE_DECL && DECL_ORIGINAL_TYPE (name))
|| DECL_TEMPLATE_PARM_P (name)
|| TREE_CODE (type) == RECORD_TYPE
|| TREE_CODE (type) == UNION_TYPE
|| TREE_CODE (type) == ENUMERAL_TYPE)
{
/* We can meet template parms that we didn't meet in the
tpl_parms walk, because we're referring to a derived type
that was previously constructed from equivalent template
parms. */
if (streaming_p ())
{
i (tt_typedef_type);
dump (dumper::TREE)
&& dump ("Writing %stypedef %C:%N",
DECL_IMPLICIT_TYPEDEF_P (name) ? "implicit " : "",
TREE_CODE (name), name);
}
tree_node (name);
if (streaming_p ())
dump (dumper::TREE) && dump ("Wrote typedef %C:%N%S",
TREE_CODE (name), name, name);
gcc_checking_assert (TREE_VISITED (type));
return;
}
if (TYPE_PTRMEMFUNC_P (type))
{
/* This is a distinct type node, masquerading as a structure. */
tree fn_type = TYPE_PTRMEMFUNC_FN_TYPE (type);
if (streaming_p ())
i (tt_ptrmem_type);
tree_node (fn_type);
int tag = insert (type);
if (streaming_p ())
dump (dumper::TREE) && dump ("Written:%d ptrmem type", tag);
return;
}
if (streaming_p ())
{
u (tt_derived_type);
u (TREE_CODE (type));
}
tree_node (TREE_TYPE (type));
switch (TREE_CODE (type))
{
default:
/* We should never meet a type here that is indescribable in
terms of other types. */
gcc_unreachable ();
case ARRAY_TYPE:
tree_node (TYPE_DOMAIN (type));
if (streaming_p ())
/* Dependent arrays are constructed with TYPE_DEPENENT_P
already set. */
u (TYPE_DEPENDENT_P (type));
break;
case COMPLEX_TYPE:
/* No additional data. */
break;
case BOOLEAN_TYPE:
/* A non-standard boolean type. */
if (streaming_p ())
u (TYPE_PRECISION (type));
break;
case INTEGER_TYPE:
if (TREE_TYPE (type))
{
/* A range type (representing an array domain). */
tree_node (TYPE_MIN_VALUE (type));
tree_node (TYPE_MAX_VALUE (type));
}
else
{
/* A new integral type (representing a bitfield). */
if (streaming_p ())
{
unsigned prec = TYPE_PRECISION (type);
bool unsigned_p = TYPE_UNSIGNED (type);
u ((prec << 1) | unsigned_p);
}
}
break;
case METHOD_TYPE:
case FUNCTION_TYPE:
{
gcc_checking_assert (type_memfn_rqual (type) == REF_QUAL_NONE);
tree arg_types = TYPE_ARG_TYPES (type);
if (TREE_CODE (type) == METHOD_TYPE)
{
tree_node (TREE_TYPE (TREE_VALUE (arg_types)));
arg_types = TREE_CHAIN (arg_types);
}
tree_node (arg_types);
}
break;
case OFFSET_TYPE:
tree_node (TYPE_OFFSET_BASETYPE (type));
break;
case POINTER_TYPE:
/* No additional data. */
break;
case REFERENCE_TYPE:
if (streaming_p ())
u (TYPE_REF_IS_RVALUE (type));
break;
case DECLTYPE_TYPE:
case TYPEOF_TYPE:
case DEPENDENT_OPERATOR_TYPE:
tree_node (TYPE_VALUES_RAW (type));
if (TREE_CODE (type) == DECLTYPE_TYPE)
/* We stash a whole bunch of things into decltype's
flags. */
if (streaming_p ())
tree_node_bools (type);
break;
case TRAIT_TYPE:
tree_node (TRAIT_TYPE_KIND_RAW (type));
tree_node (TRAIT_TYPE_TYPE1 (type));
tree_node (TRAIT_TYPE_TYPE2 (type));
break;
case TYPE_ARGUMENT_PACK:
/* No additional data. */
break;
case TYPE_PACK_EXPANSION:
if (streaming_p ())
u (PACK_EXPANSION_LOCAL_P (type));
tree_node (PACK_EXPANSION_PARAMETER_PACKS (type));
tree_node (PACK_EXPANSION_EXTRA_ARGS (type));
break;
case TYPENAME_TYPE:
{
tree_node (TYPE_CONTEXT (type));
tree_node (DECL_NAME (TYPE_NAME (type)));
tree_node (TYPENAME_TYPE_FULLNAME (type));
if (streaming_p ())
{
enum tag_types tag_type = none_type;
if (TYPENAME_IS_ENUM_P (type))
tag_type = enum_type;
else if (TYPENAME_IS_CLASS_P (type))
tag_type = class_type;
u (int (tag_type));
}
}
break;
case UNBOUND_CLASS_TEMPLATE:
{
tree decl = TYPE_NAME (type);
tree_node (DECL_CONTEXT (decl));
tree_node (DECL_NAME (decl));
tree_node (DECL_TEMPLATE_PARMS (decl));
}
break;
case VECTOR_TYPE:
if (streaming_p ())
{
poly_uint64 nunits = TYPE_VECTOR_SUBPARTS (type);
/* to_constant asserts that only coeff[0] is of interest. */
wu (static_cast<unsigned HOST_WIDE_INT> (nunits.to_constant ()));
}
break;
}
/* We may have met the type during emitting the above. */
if (ref_node (type) != WK_none)
{
int tag = insert (type);
if (streaming_p ())
{
i (0);
dump (dumper::TREE)
&& dump ("Wrote:%d derived type %C", tag, TREE_CODE (type));
}
}
return;
}
/* T is (mostly*) a non-mergeable node that must be written by value.
The mergeable case is a BINFO, which are as-if DECLSs. */
void
trees_out::tree_value (tree t)
{
/* We should never be writing a type by value. tree_type should
have streamed it, or we're going via its TYPE_DECL. */
gcc_checking_assert (!TYPE_P (t));
if (DECL_P (t))
/* No template, type, var or function, except anonymous
non-context vars. */
gcc_checking_assert ((TREE_CODE (t) != TEMPLATE_DECL
&& TREE_CODE (t) != TYPE_DECL
&& (TREE_CODE (t) != VAR_DECL
|| (!DECL_NAME (t) && !DECL_CONTEXT (t)))
&& TREE_CODE (t) != FUNCTION_DECL));
if (streaming_p ())
{
/* A new node -> tt_node. */
tree_val_count++;
i (tt_node);
start (t);
tree_node_bools (t);
}
if (TREE_CODE (t) == TREE_BINFO)
/* Binfos are decl-like and need merging information. */
binfo_mergeable (t);
int tag = insert (t, WK_value);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Writing tree:%d %C:%N", tag, TREE_CODE (t), t);
tree_node_vals (t);
if (streaming_p ())
dump (dumper::TREE) && dump ("Written tree:%d %C:%N", tag, TREE_CODE (t), t);
}
tree
trees_in::tree_value ()
{
tree t = start ();
if (!t || !tree_node_bools (t))
return NULL_TREE;
tree existing = t;
if (TREE_CODE (t) == TREE_BINFO)
{
tree type;
unsigned ix = binfo_mergeable (&type);
if (TYPE_BINFO (type))
{
/* We already have a definition, this must be a duplicate. */
dump (dumper::MERGE)
&& dump ("Deduping binfo %N[%u]", type, ix);
existing = TYPE_BINFO (type);
while (existing && ix--)
existing = TREE_CHAIN (existing);
if (existing)
register_duplicate (t, existing);
else
/* Error, mismatch -- diagnose in read_class_def's
checking. */
existing = t;
}
}
/* Insert into map. */
int tag = insert (existing);
dump (dumper::TREE)
&& dump ("Reading tree:%d %C", tag, TREE_CODE (t));
if (!tree_node_vals (t))
{
back_refs[~tag] = NULL_TREE;
set_overrun ();
/* Bail. */
return NULL_TREE;
}
dump (dumper::TREE) && dump ("Read tree:%d %C:%N", tag, TREE_CODE (t), t);
if (TREE_CODE (existing) == INTEGER_CST && !TREE_OVERFLOW (existing))
{
existing = cache_integer_cst (t, true);
back_refs[~tag] = existing;
}
return existing;
}
/* Stream out tree node T. We automatically create local back
references, which is essentially a single pass lisp
self-referential structure pretty-printer. */
void
trees_out::tree_node (tree t)
{
dump.indent ();
walk_kind ref = ref_node (t);
if (ref == WK_none)
goto done;
if (ref != WK_normal)
goto skip_normal;
if (TREE_CODE (t) == IDENTIFIER_NODE)
{
/* An identifier node -> tt_id, tt_conv_id, tt_anon_id, tt_lambda_id. */
int code = tt_id;
if (IDENTIFIER_ANON_P (t))
code = IDENTIFIER_LAMBDA_P (t) ? tt_lambda_id : tt_anon_id;
else if (IDENTIFIER_CONV_OP_P (t))
code = tt_conv_id;
if (streaming_p ())
i (code);
if (code == tt_conv_id)
{
tree type = TREE_TYPE (t);
gcc_checking_assert (type || t == conv_op_identifier);
tree_node (type);
}
else if (code == tt_id && streaming_p ())
str (IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t));
int tag = insert (t);
if (streaming_p ())
{
/* We know the ordering of the 4 id tags. */
static const char *const kinds[] =
{"", "conv_op ", "anon ", "lambda "};
dump (dumper::TREE)
&& dump ("Written:%d %sidentifier:%N", tag,
kinds[code - tt_id],
code == tt_conv_id ? TREE_TYPE (t) : t);
}
goto done;
}
if (TREE_CODE (t) == TREE_BINFO)
{
/* A BINFO -> tt_binfo.
We must do this by reference. We stream the binfo tree
itself when streaming its owning RECORD_TYPE. That we got
here means the dominating type is not in this SCC. */
if (streaming_p ())
i (tt_binfo);
binfo_mergeable (t);
gcc_checking_assert (!TREE_VISITED (t));
int tag = insert (t);
if (streaming_p ())
dump (dumper::TREE) && dump ("Inserting binfo:%d %N", tag, t);
goto done;
}
if (TREE_CODE (t) == INTEGER_CST
&& !TREE_OVERFLOW (t)
&& TREE_CODE (TREE_TYPE (t)) == ENUMERAL_TYPE)
{
/* An integral constant of enumeral type. See if it matches one
of the enumeration values. */
for (tree values = TYPE_VALUES (TREE_TYPE (t));
values; values = TREE_CHAIN (values))
{
tree decl = TREE_VALUE (values);
if (tree_int_cst_equal (DECL_INITIAL (decl), t))
{
if (streaming_p ())
u (tt_enum_value);
tree_node (decl);
dump (dumper::TREE) && dump ("Written enum value %N", decl);
goto done;
}
}
/* It didn't match. We'll write it a an explicit INTEGER_CST
node. */
}
if (TYPE_P (t))
{
type_node (t);
goto done;
}
if (DECL_P (t))
{
if (DECL_TEMPLATE_PARM_P (t))
{
tpl_parm_value (t);
goto done;
}
if (!DECL_CONTEXT (t))
{
/* There are a few cases of decls with no context. We'll write
these by value, but first assert they are cases we expect. */
gcc_checking_assert (ref == WK_normal);
switch (TREE_CODE (t))
{
default: gcc_unreachable ();
case LABEL_DECL:
/* CASE_LABEL_EXPRs contain uncontexted LABEL_DECLs. */
gcc_checking_assert (!DECL_NAME (t));
break;
case VAR_DECL:
/* AGGR_INIT_EXPRs cons up anonymous uncontexted VAR_DECLs. */
gcc_checking_assert (!DECL_NAME (t)
&& DECL_ARTIFICIAL (t));
break;
case PARM_DECL:
/* REQUIRES_EXPRs have a tree list of uncontexted
PARM_DECLS. It'd be nice if they had a
distinguishing flag to double check. */
break;
}
goto by_value;
}
}
skip_normal:
if (DECL_P (t) && !decl_node (t, ref))
goto done;
/* Otherwise by value */
by_value:
tree_value (t);
done:
/* And, breath out. */
dump.outdent ();
}
/* Stream in a tree node. */
tree
trees_in::tree_node (bool is_use)
{
if (get_overrun ())
return NULL_TREE;
dump.indent ();
int tag = i ();
tree res = NULL_TREE;
switch (tag)
{
default:
/* backref, pull it out of the map. */
res = back_ref (tag);
break;
case tt_null:
/* NULL_TREE. */
break;
case tt_fixed:
/* A fixed ref, find it in the fixed_ref array. */
{
unsigned fix = u ();
if (fix < (*fixed_trees).length ())
{
res = (*fixed_trees)[fix];
dump (dumper::TREE) && dump ("Read fixed:%u %C:%N%S", fix,
TREE_CODE (res), res, res);
}
if (!res)
set_overrun ();
}
break;
case tt_parm:
{
tree fn = tree_node ();
if (fn && TREE_CODE (fn) == FUNCTION_DECL)
res = tree_node ();
if (res)
dump (dumper::TREE)
&& dump ("Read %s reference %N",
TREE_CODE (res) == PARM_DECL ? "parameter" : "result",
res);
}
break;
case tt_node:
/* A new node. Stream it in. */
res = tree_value ();
break;
case tt_decl:
/* A new decl. Stream it in. */
res = decl_value ();
break;
case tt_tpl_parm:
/* A template parameter. Stream it in. */
res = tpl_parm_value ();
break;
case tt_id:
/* An identifier node. */
{
size_t l;
const char *chars = str (&l);
res = get_identifier_with_length (chars, l);
int tag = insert (res);
dump (dumper::TREE)
&& dump ("Read identifier:%d %N", tag, res);
}
break;
case tt_conv_id:
/* A conversion operator. Get the type and recreate the
identifier. */
{
tree type = tree_node ();
if (!get_overrun ())
{
res = type ? make_conv_op_name (type) : conv_op_identifier;
int tag = insert (res);
dump (dumper::TREE)
&& dump ("Created conv_op:%d %S for %N", tag, res, type);
}
}
break;
case tt_anon_id:
case tt_lambda_id:
/* An anonymous or lambda id. */
{
res = make_anon_name ();
if (tag == tt_lambda_id)
IDENTIFIER_LAMBDA_P (res) = true;
int tag = insert (res);
dump (dumper::TREE)
&& dump ("Read %s identifier:%d %N",
IDENTIFIER_LAMBDA_P (res) ? "lambda" : "anon", tag, res);
}
break;
case tt_typedef_type:
res = tree_node ();
if (res)
{
dump (dumper::TREE)
&& dump ("Read %stypedef %C:%N",
DECL_IMPLICIT_TYPEDEF_P (res) ? "implicit " : "",
TREE_CODE (res), res);
res = TREE_TYPE (res);
}
break;
case tt_derived_type:
/* A type derived from some other type. */
{
enum tree_code code = tree_code (u ());
res = tree_node ();
switch (code)
{
default:
set_overrun ();
break;
case ARRAY_TYPE:
{
tree domain = tree_node ();
int dep = u ();
if (!get_overrun ())
res = build_cplus_array_type (res, domain, dep);
}
break;
case COMPLEX_TYPE:
if (!get_overrun ())
res = build_complex_type (res);
break;
case BOOLEAN_TYPE:
{
unsigned precision = u ();
if (!get_overrun ())
res = build_nonstandard_boolean_type (precision);
}
break;
case INTEGER_TYPE:
if (res)
{
/* A range type (representing an array domain). */
tree min = tree_node ();
tree max = tree_node ();
if (!get_overrun ())
res = build_range_type (res, min, max);
}
else
{
/* A new integral type (representing a bitfield). */
unsigned enc = u ();
if (!get_overrun ())
res = build_nonstandard_integer_type (enc >> 1, enc & 1);
}
break;
case FUNCTION_TYPE:
case METHOD_TYPE:
{
tree klass = code == METHOD_TYPE ? tree_node () : NULL_TREE;
tree args = tree_node ();
if (!get_overrun ())
{
if (klass)
res = build_method_type_directly (klass, res, args);
else
res = build_function_type (res, args);
}
}
break;
case OFFSET_TYPE:
{
tree base = tree_node ();
if (!get_overrun ())
res = build_offset_type (base, res);
}
break;
case POINTER_TYPE:
if (!get_overrun ())
res = build_pointer_type (res);
break;
case REFERENCE_TYPE:
{
bool rval = bool (u ());
if (!get_overrun ())
res = cp_build_reference_type (res, rval);
}
break;
case DECLTYPE_TYPE:
case TYPEOF_TYPE:
case DEPENDENT_OPERATOR_TYPE:
{
tree expr = tree_node ();
if (!get_overrun ())
{
res = cxx_make_type (code);
TYPE_VALUES_RAW (res) = expr;
if (code == DECLTYPE_TYPE)
tree_node_bools (res);
SET_TYPE_STRUCTURAL_EQUALITY (res);
}
}
break;
case TRAIT_TYPE:
{
tree kind = tree_node ();
tree type1 = tree_node ();
tree type2 = tree_node ();
if (!get_overrun ())
{
res = cxx_make_type (TRAIT_TYPE);
TRAIT_TYPE_KIND_RAW (res) = kind;
TRAIT_TYPE_TYPE1 (res) = type1;
TRAIT_TYPE_TYPE2 (res) = type2;
SET_TYPE_STRUCTURAL_EQUALITY (res);
}
}
break;
case TYPE_ARGUMENT_PACK:
if (!get_overrun ())
{
tree pack = cxx_make_type (TYPE_ARGUMENT_PACK);
ARGUMENT_PACK_ARGS (pack) = res;
res = pack;
}
break;
case TYPE_PACK_EXPANSION:
{
bool local = u ();
tree param_packs = tree_node ();
tree extra_args = tree_node ();
if (!get_overrun ())
{
tree expn = cxx_make_type (TYPE_PACK_EXPANSION);
SET_TYPE_STRUCTURAL_EQUALITY (expn);
PACK_EXPANSION_PATTERN (expn) = res;
PACK_EXPANSION_PARAMETER_PACKS (expn) = param_packs;
PACK_EXPANSION_EXTRA_ARGS (expn) = extra_args;
PACK_EXPANSION_LOCAL_P (expn) = local;
res = expn;
}
}
break;
case TYPENAME_TYPE:
{
tree ctx = tree_node ();
tree name = tree_node ();
tree fullname = tree_node ();
enum tag_types tag_type = tag_types (u ());
if (!get_overrun ())
res = build_typename_type (ctx, name, fullname, tag_type);
}
break;
case UNBOUND_CLASS_TEMPLATE:
{
tree ctx = tree_node ();
tree name = tree_node ();
tree parms = tree_node ();
if (!get_overrun ())
res = make_unbound_class_template_raw (ctx, name, parms);
}
break;
case VECTOR_TYPE:
{
unsigned HOST_WIDE_INT nunits = wu ();
if (!get_overrun ())
res = build_vector_type (res, static_cast<poly_int64> (nunits));
}
break;
}
int tag = i ();
if (!tag)
{
tag = insert (res);
if (res)
dump (dumper::TREE)
&& dump ("Created:%d derived type %C", tag, code);
}
else
res = back_ref (tag);
}
break;
case tt_variant_type:
/* Variant of some type. */
{
res = tree_node ();
int flags = i ();
if (get_overrun ())
;
else if (flags < 0)
/* No change. */;
else if (TREE_CODE (res) == FUNCTION_TYPE
|| TREE_CODE (res) == METHOD_TYPE)
{
cp_ref_qualifier rqual = cp_ref_qualifier (flags & 3);
bool late = (flags >> 2) & 1;
cp_cv_quals quals = cp_cv_quals (flags >> 3);
tree raises = tree_node ();
if (raises == error_mark_node)
raises = TYPE_RAISES_EXCEPTIONS (res);
res = build_cp_fntype_variant (res, rqual, raises, late);
if (TREE_CODE (res) == FUNCTION_TYPE)
res = apply_memfn_quals (res, quals, rqual);
}
else
{
res = build_aligned_type (res, (1u << flags) >> 1);
TYPE_USER_ALIGN (res) = true;
}
if (tree attribs = tree_node ())
res = cp_build_type_attribute_variant (res, attribs);
int quals = i ();
if (quals >= 0 && !get_overrun ())
res = cp_build_qualified_type (res, quals);
int tag = i ();
if (!tag)
{
tag = insert (res);
if (res)
dump (dumper::TREE)
&& dump ("Created:%d variant type %C", tag, TREE_CODE (res));
}
else
res = back_ref (tag);
}
break;
case tt_tinfo_var:
case tt_tinfo_typedef:
/* A tinfo var or typedef. */
{
bool is_var = tag == tt_tinfo_var;
unsigned ix = u ();
tree type = NULL_TREE;
if (is_var)
{
tree name = tree_node ();
type = tree_node ();
if (!get_overrun ())
res = get_tinfo_decl_direct (type, name, int (ix));
}
else
{
if (!get_overrun ())
{
type = get_pseudo_tinfo_type (ix);
res = TYPE_NAME (type);
}
}
if (res)
{
int tag = insert (res);
dump (dumper::TREE)
&& dump ("Created tinfo_%s:%d %S:%u for %N",
is_var ? "var" : "decl", tag, res, ix, type);
if (!is_var)
{
tag = insert (type);
dump (dumper::TREE)
&& dump ("Created tinfo_type:%d %u %N", tag, ix, type);
}
}
}
break;
case tt_ptrmem_type:
/* A pointer to member function. */
{
tree type = tree_node ();
if (type && TREE_CODE (type) == POINTER_TYPE
&& TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
{
res = build_ptrmemfunc_type (type);
int tag = insert (res);
dump (dumper::TREE) && dump ("Created:%d ptrmem type", tag);
}
else
set_overrun ();
}
break;
case tt_nttp_var:
/* An NTTP object. */
{
tree init = tree_node ();
tree name = tree_node ();
if (!get_overrun ())
{
res = get_template_parm_object (init, name);
int tag = insert (res);
dump (dumper::TREE)
&& dump ("Created nttp object:%d %N", tag, name);
}
}
break;
case tt_enum_value:
/* An enum const value. */
{
if (tree decl = tree_node ())
{
dump (dumper::TREE) && dump ("Read enum value %N", decl);
res = DECL_INITIAL (decl);
}
if (!res)
set_overrun ();
}
break;
case tt_enum_decl:
/* An enum decl. */
{
tree ctx = tree_node ();
tree name = tree_node ();
if (!get_overrun ()
&& TREE_CODE (ctx) == ENUMERAL_TYPE)
res = find_enum_member (ctx, name);
if (!res)
set_overrun ();
else
{
int tag = insert (res);
dump (dumper::TREE)
&& dump ("Read enum decl:%d %C:%N", tag, TREE_CODE (res), res);
}
}
break;
case tt_data_member:
/* A data member. */
{
tree ctx = tree_node ();
tree name = tree_node ();
if (!get_overrun ()
&& RECORD_OR_UNION_TYPE_P (ctx))
{
if (name)
res = lookup_class_binding (ctx, name);
else
res = lookup_field_ident (ctx, u ());
if (!res
|| TREE_CODE (res) != FIELD_DECL
|| DECL_CONTEXT (res) != ctx)
res = NULL_TREE;
}
if (!res)
set_overrun ();
else
{
int tag = insert (res);
dump (dumper::TREE)
&& dump ("Read member:%d %C:%N", tag, TREE_CODE (res), res);
}
}
break;
case tt_binfo:
/* A BINFO. Walk the tree of the dominating type. */
{
tree type;
unsigned ix = binfo_mergeable (&type);
if (type)
{
res = TYPE_BINFO (type);
for (; ix && res; res = TREE_CHAIN (res))
ix--;
if (!res)
set_overrun ();
}
if (get_overrun ())
break;
/* Insert binfo into backreferences. */
tag = insert (res);
dump (dumper::TREE) && dump ("Read binfo:%d %N", tag, res);
}
break;
case tt_vtable:
{
unsigned ix = u ();
tree ctx = tree_node ();
dump (dumper::TREE) && dump ("Reading vtable %N[%u]", ctx, ix);
if (TREE_CODE (ctx) == RECORD_TYPE && TYPE_LANG_SPECIFIC (ctx))
for (res = CLASSTYPE_VTABLES (ctx); res; res = DECL_CHAIN (res))
if (!ix--)
break;
if (!res)
set_overrun ();
}
break;
case tt_thunk:
{
int fixed = i ();
tree target = tree_node ();
tree virt = tree_node ();
for (tree thunk = DECL_THUNKS (target);
thunk; thunk = DECL_CHAIN (thunk))
if (THUNK_FIXED_OFFSET (thunk) == fixed
&& !THUNK_VIRTUAL_OFFSET (thunk) == !virt
&& (!virt
|| tree_int_cst_equal (virt, THUNK_VIRTUAL_OFFSET (thunk))))
{
res = thunk;
break;
}
int tag = insert (res);
if (res)
dump (dumper::TREE)
&& dump ("Read:%d thunk %N to %N", tag, DECL_NAME (res), target);
else
set_overrun ();
}
break;
case tt_clone_ref:
{
tree target = tree_node ();
tree name = tree_node ();
if (DECL_P (target) && DECL_MAYBE_IN_CHARGE_CDTOR_P (target))
{
tree clone;
FOR_EVERY_CLONE (clone, target)
if (DECL_NAME (clone) == name)
{
res = clone;
break;
}
}
if (!res)
set_overrun ();
int tag = insert (res);
if (res)
dump (dumper::TREE)
&& dump ("Read:%d clone %N of %N", tag, DECL_NAME (res), target);
else
set_overrun ();
}
break;
case tt_entity:
/* Index into the entity table. Perhaps not loaded yet! */
{
unsigned origin = state->slurp->remap_module (u ());
unsigned ident = u ();
module_state *from = (*modules)[origin];
if (!origin || ident >= from->entity_num)
set_overrun ();
if (!get_overrun ())
{
binding_slot *slot = &(*entity_ary)[from->entity_lwm + ident];
if (slot->is_lazy ())
if (!from->lazy_load (ident, slot))
set_overrun ();
res = *slot;
}
if (res)
{
const char *kind = (origin != state->mod ? "Imported" : "Named");
int tag = insert (res);
dump (dumper::TREE)
&& dump ("%s:%d %C:%N@%M", kind, tag, TREE_CODE (res),
res, (*modules)[origin]);
if (!add_indirects (res))
{
set_overrun ();
res = NULL_TREE;
}
}
}
break;
case tt_template:
/* A template. */
if (tree tpl = tree_node ())
{
res = DECL_TEMPLATE_RESULT (tpl);
dump (dumper::TREE)
&& dump ("Read template %C:%N", TREE_CODE (res), res);
}
break;
}
if (is_use && !unused && res && DECL_P (res) && !TREE_USED (res))
{
/* Mark decl used as mark_used does -- we cannot call
mark_used in the middle of streaming, we only need a subset
of its functionality. */
TREE_USED (res) = true;
/* And for structured bindings also the underlying decl. */
if (DECL_DECOMPOSITION_P (res) && DECL_DECOMP_BASE (res))
TREE_USED (DECL_DECOMP_BASE (res)) = true;
if (DECL_CLONED_FUNCTION_P (res))
TREE_USED (DECL_CLONED_FUNCTION (res)) = true;
}
dump.outdent ();
return res;
}
void
trees_out::tpl_parms (tree parms, unsigned &tpl_levels)
{
if (!parms)
return;
if (TREE_VISITED (parms))
{
ref_node (parms);
return;
}
tpl_parms (TREE_CHAIN (parms), tpl_levels);
tree vec = TREE_VALUE (parms);
unsigned len = TREE_VEC_LENGTH (vec);
/* Depth. */
int tag = insert (parms);
if (streaming_p ())
{
i (len + 1);
dump (dumper::TREE)
&& dump ("Writing template parms:%d level:%N length:%d",
tag, TREE_PURPOSE (parms), len);
}
tree_node (TREE_PURPOSE (parms));
for (unsigned ix = 0; ix != len; ix++)
{
tree parm = TREE_VEC_ELT (vec, ix);
tree decl = TREE_VALUE (parm);
gcc_checking_assert (DECL_TEMPLATE_PARM_P (decl));
if (CHECKING_P)
switch (TREE_CODE (decl))
{
default: gcc_unreachable ();
case TEMPLATE_DECL:
gcc_assert ((TREE_CODE (TREE_TYPE (decl)) == TEMPLATE_TEMPLATE_PARM)
&& (TREE_CODE (DECL_TEMPLATE_RESULT (decl)) == TYPE_DECL)
&& (TYPE_NAME (TREE_TYPE (decl)) == decl));
break;
case TYPE_DECL:
gcc_assert ((TREE_CODE (TREE_TYPE (decl)) == TEMPLATE_TYPE_PARM)
&& (TYPE_NAME (TREE_TYPE (decl)) == decl));
break;
case PARM_DECL:
gcc_assert ((TREE_CODE (DECL_INITIAL (decl)) == TEMPLATE_PARM_INDEX)
&& (TREE_CODE (TEMPLATE_PARM_DECL (DECL_INITIAL (decl)))
== CONST_DECL)
&& (DECL_TEMPLATE_PARM_P
(TEMPLATE_PARM_DECL (DECL_INITIAL (decl)))));
break;
}
tree_node (decl);
tree_node (TEMPLATE_PARM_CONSTRAINTS (parm));
}
tpl_levels++;
}
tree
trees_in::tpl_parms (unsigned &tpl_levels)
{
tree parms = NULL_TREE;
while (int len = i ())
{
if (len < 0)
{
parms = back_ref (len);
continue;
}
len -= 1;
parms = tree_cons (NULL_TREE, NULL_TREE, parms);
int tag = insert (parms);
TREE_PURPOSE (parms) = tree_node ();
dump (dumper::TREE)
&& dump ("Reading template parms:%d level:%N length:%d",
tag, TREE_PURPOSE (parms), len);
tree vec = make_tree_vec (len);
for (int ix = 0; ix != len; ix++)
{
tree decl = tree_node ();
if (!decl)
return NULL_TREE;
tree parm = build_tree_list (NULL, decl);
TEMPLATE_PARM_CONSTRAINTS (parm) = tree_node ();
TREE_VEC_ELT (vec, ix) = parm;
}
TREE_VALUE (parms) = vec;
tpl_levels++;
}
return parms;
}
void
trees_out::tpl_parms_fini (tree tmpl, unsigned tpl_levels)
{
for (tree parms = DECL_TEMPLATE_PARMS (tmpl);
tpl_levels--; parms = TREE_CHAIN (parms))
{
tree vec = TREE_VALUE (parms);
tree_node (TREE_TYPE (vec));
tree dflt = error_mark_node;
for (unsigned ix = TREE_VEC_LENGTH (vec); ix--;)
{
tree parm = TREE_VEC_ELT (vec, ix);
if (dflt)
{
dflt = TREE_PURPOSE (parm);
tree_node (dflt);
}
if (streaming_p ())
{
tree decl = TREE_VALUE (parm);
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
tree ctx = DECL_CONTEXT (decl);
tree inner = DECL_TEMPLATE_RESULT (decl);
tree tpi = (TREE_CODE (inner) == TYPE_DECL
? TEMPLATE_TYPE_PARM_INDEX (TREE_TYPE (decl))
: DECL_INITIAL (inner));
bool original = (TEMPLATE_PARM_LEVEL (tpi)
== TEMPLATE_PARM_ORIG_LEVEL (tpi));
/* Original template template parms have a context
of their owning template. Reduced ones do not. */
gcc_checking_assert (original ? ctx == tmpl : !ctx);
}
}
}
}
}
bool
trees_in::tpl_parms_fini (tree tmpl, unsigned tpl_levels)
{
for (tree parms = DECL_TEMPLATE_PARMS (tmpl);
tpl_levels--; parms = TREE_CHAIN (parms))
{
tree vec = TREE_VALUE (parms);
tree dflt = error_mark_node;
TREE_TYPE (vec) = tree_node ();
for (unsigned ix = TREE_VEC_LENGTH (vec); ix--;)
{
tree parm = TREE_VEC_ELT (vec, ix);
if (dflt)
{
dflt = tree_node ();
if (get_overrun ())
return false;
TREE_PURPOSE (parm) = dflt;
}
tree decl = TREE_VALUE (parm);
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
tree inner = DECL_TEMPLATE_RESULT (decl);
tree tpi = (TREE_CODE (inner) == TYPE_DECL
? TEMPLATE_TYPE_PARM_INDEX (TREE_TYPE (decl))
: DECL_INITIAL (inner));
bool original = (TEMPLATE_PARM_LEVEL (tpi)
== TEMPLATE_PARM_ORIG_LEVEL (tpi));
/* Original template template parms have a context
of their owning template. Reduced ones do not. */
if (original)
DECL_CONTEXT (decl) = tmpl;
}
}
}
return true;
}
/* PARMS is a LIST, one node per level.
TREE_VALUE is a TREE_VEC of parm info for that level.
each ELT is a TREE_LIST
TREE_VALUE is PARM_DECL, TYPE_DECL or TEMPLATE_DECL
TREE_PURPOSE is the default value. */
void
trees_out::tpl_header (tree tpl, unsigned *tpl_levels)
{
tree parms = DECL_TEMPLATE_PARMS (tpl);
tpl_parms (parms, *tpl_levels);
/* Mark end. */
if (streaming_p ())
u (0);
if (*tpl_levels)
tree_node (TEMPLATE_PARMS_CONSTRAINTS (parms));
}
bool
trees_in::tpl_header (tree tpl, unsigned *tpl_levels)
{
tree parms = tpl_parms (*tpl_levels);
if (!parms)
return false;
DECL_TEMPLATE_PARMS (tpl) = parms;
if (*tpl_levels)
TEMPLATE_PARMS_CONSTRAINTS (parms) = tree_node ();
return true;
}
/* Stream skeleton parm nodes, with their flags, type & parm indices.
All the parms will have consecutive tags. */
void
trees_out::fn_parms_init (tree fn)
{
/* First init them. */
int base_tag = ref_num - 1;
int ix = 0;
for (tree parm = DECL_ARGUMENTS (fn);
parm; parm = DECL_CHAIN (parm), ix++)
{
if (streaming_p ())
{
start (parm);
tree_node_bools (parm);
}
int tag = insert (parm);
gcc_checking_assert (base_tag - ix == tag);
}
/* Mark the end. */
if (streaming_p ())
u (0);
/* Now stream their contents. */
ix = 0;
for (tree parm = DECL_ARGUMENTS (fn);
parm; parm = DECL_CHAIN (parm), ix++)
{
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Writing parm:%d %u (%N) of %N",
base_tag - ix, ix, parm, fn);
tree_node_vals (parm);
}
}
/* Build skeleton parm nodes, read their flags, type & parm indices. */
int
trees_in::fn_parms_init (tree fn)
{
int base_tag = ~(int)back_refs.length ();
tree *parm_ptr = &DECL_ARGUMENTS (fn);
int ix = 0;
for (; int code = u (); ix++)
{
tree parm = start (code);
if (!tree_node_bools (parm))
return 0;
int tag = insert (parm);
gcc_checking_assert (base_tag - ix == tag);
*parm_ptr = parm;
parm_ptr = &DECL_CHAIN (parm);
}
ix = 0;
for (tree parm = DECL_ARGUMENTS (fn);
parm; parm = DECL_CHAIN (parm), ix++)
{
dump (dumper::TREE)
&& dump ("Reading parm:%d %u (%N) of %N",
base_tag - ix, ix, parm, fn);
if (!tree_node_vals (parm))
return 0;
}
return base_tag;
}
/* Read the remaining parm node data. Replace with existing (if
non-null) in the map. */
void
trees_in::fn_parms_fini (int tag, tree fn, tree existing, bool is_defn)
{
tree existing_parm = existing ? DECL_ARGUMENTS (existing) : NULL_TREE;
tree parms = DECL_ARGUMENTS (fn);
unsigned ix = 0;
for (tree parm = parms; parm; parm = DECL_CHAIN (parm), ix++)
{
if (existing_parm)
{
if (is_defn && !DECL_SAVED_TREE (existing))
{
/* If we're about to become the definition, set the
names of the parms from us. */
DECL_NAME (existing_parm) = DECL_NAME (parm);
DECL_SOURCE_LOCATION (existing_parm) = DECL_SOURCE_LOCATION (parm);
}
back_refs[~tag] = existing_parm;
existing_parm = DECL_CHAIN (existing_parm);
}
tag--;
}
}
/* DEP is the depset of some decl we're streaming by value. Determine
the merging behaviour. */
merge_kind
trees_out::get_merge_kind (tree decl, depset *dep)
{
if (!dep)
{
if (VAR_OR_FUNCTION_DECL_P (decl))
{
/* Any var or function with template info should have DEP. */
gcc_checking_assert (!DECL_LANG_SPECIFIC (decl)
|| !DECL_TEMPLATE_INFO (decl));
if (DECL_LOCAL_DECL_P (decl))
return MK_unique;
}
/* Either unique, or some member of a class that cannot have an
out-of-class definition. For instance a FIELD_DECL. */
tree ctx = CP_DECL_CONTEXT (decl);
if (TREE_CODE (ctx) == FUNCTION_DECL)
{
/* USING_DECLs and NAMESPACE_DECLs cannot have DECL_TEMPLATE_INFO --
this isn't permitting them to have one. */
gcc_checking_assert (TREE_CODE (decl) == USING_DECL
|| TREE_CODE (decl) == NAMESPACE_DECL
|| !DECL_LANG_SPECIFIC (decl)
|| !DECL_TEMPLATE_INFO (decl));
return MK_unique;
}
if (TREE_CODE (decl) == TEMPLATE_DECL
&& DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (decl))
return MK_local_friend;
gcc_checking_assert (TYPE_P (ctx));
if (TREE_CODE (decl) == USING_DECL)
return MK_field;
if (TREE_CODE (decl) == FIELD_DECL)
{
if (DECL_NAME (decl))
{
/* Anonymous FIELD_DECLs have a NULL name. */
gcc_checking_assert (!IDENTIFIER_ANON_P (DECL_NAME (decl)));
return MK_named;
}
if (!DECL_NAME (decl)
&& !RECORD_OR_UNION_TYPE_P (TREE_TYPE (decl))
&& !DECL_BIT_FIELD_REPRESENTATIVE (decl))
{
/* The underlying storage unit for a bitfield. We do not
need to dedup it, because it's only reachable through
the bitfields it represents. And those are deduped. */
// FIXME: Is that assertion correct -- do we ever fish it
// out and put it in an expr?
gcc_checking_assert ((TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
? TREE_CODE (TREE_TYPE (TREE_TYPE (decl)))
: TREE_CODE (TREE_TYPE (decl)))
== INTEGER_TYPE);
return MK_unique;
}
return MK_field;
}
if (TREE_CODE (decl) == CONST_DECL)
return MK_named;
if (TREE_CODE (decl) == VAR_DECL
&& DECL_VTABLE_OR_VTT_P (decl))
return MK_vtable;
if (DECL_THUNK_P (decl))
/* Thunks are unique-enough, because they're only referenced
from the vtable. And that's either new (so we want the
thunks), or it's a duplicate (so it will be dropped). */
return MK_unique;
/* There should be no other cases. */
gcc_unreachable ();
}
gcc_checking_assert (TREE_CODE (decl) != FIELD_DECL
&& TREE_CODE (decl) != USING_DECL
&& TREE_CODE (decl) != CONST_DECL);
if (is_key_order ())
{
/* When doing the mergeablilty graph, there's an indirection to
the actual depset. */
gcc_assert (dep->is_special ());
dep = dep->deps[0];
}
gcc_checking_assert (decl == dep->get_entity ());
merge_kind mk = MK_named;
switch (dep->get_entity_kind ())
{
default:
gcc_unreachable ();
case depset::EK_PARTIAL:
mk = MK_partial;
break;
case depset::EK_DECL:
{
tree ctx = CP_DECL_CONTEXT (decl);
switch (TREE_CODE (ctx))
{
default:
gcc_unreachable ();
case FUNCTION_DECL:
// FIXME: This can occur for (a) voldemorty TYPE_DECLS
// (which are returned from a function), or (b)
// block-scope class definitions in template functions.
// These are as unique as the containing function. While
// on read-back we can discover if the CTX was a
// duplicate, we don't have a mechanism to get from the
// existing CTX to the existing version of this decl.
gcc_checking_assert
(DECL_IMPLICIT_TYPEDEF_P (STRIP_TEMPLATE (decl)));
mk = MK_unique;
break;
case RECORD_TYPE:
case UNION_TYPE:
if (DECL_NAME (decl) == as_base_identifier)
mk = MK_as_base;
else if (IDENTIFIER_ANON_P (DECL_NAME (decl)))
mk = MK_field;
break;
case NAMESPACE_DECL:
if (DECL_IMPLICIT_TYPEDEF_P (STRIP_TEMPLATE (decl))
&& LAMBDA_TYPE_P (TREE_TYPE (decl)))
if (tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (CLASSTYPE_LAMBDA_EXPR
(TREE_TYPE (decl))))
if (TREE_CODE (scope) == VAR_DECL
&& DECL_MODULE_KEYED_DECLS_P (scope))
{
mk = MK_keyed;
break;
}
if (TREE_CODE (decl) == TEMPLATE_DECL
&& DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (decl))
mk = MK_local_friend;
else if (IDENTIFIER_ANON_P (DECL_NAME (decl)))
{
if (DECL_IMPLICIT_TYPEDEF_P (decl)
&& UNSCOPED_ENUM_P (TREE_TYPE (decl))
&& TYPE_VALUES (TREE_TYPE (decl)))
/* Keyed by first enum value, and underlying type. */
mk = MK_enum;
else
/* No way to merge it, it is an ODR land-mine. */
mk = MK_unique;
}
}
}
break;
case depset::EK_SPECIALIZATION:
{
gcc_checking_assert (dep->is_special ());
if (TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
/* An block-scope classes of templates are themselves
templates. */
gcc_checking_assert (DECL_IMPLICIT_TYPEDEF_P (decl));
if (dep->is_friend_spec ())
mk = MK_friend_spec;
else if (dep->is_type_spec ())
mk = MK_type_spec;
else if (dep->is_alias ())
mk = MK_alias_spec;
else
mk = MK_decl_spec;
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
spec_entry *entry = reinterpret_cast <spec_entry *> (dep->deps[0]);
if (TREE_CODE (entry->spec) != TEMPLATE_DECL)
mk = merge_kind (mk | MK_tmpl_tmpl_mask);
}
}
break;
}
return mk;
}
/* The container of DECL -- not necessarily its context! */
tree
trees_out::decl_container (tree decl)
{
int use_tpl;
tree tpl = NULL_TREE;
if (tree template_info = node_template_info (decl, use_tpl))
tpl = TI_TEMPLATE (template_info);
if (tpl == decl)
tpl = nullptr;
/* Stream the template we're instantiated from. */
tree_node (tpl);
tree container = NULL_TREE;
if (TREE_CODE (decl) == TEMPLATE_DECL
&& DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (decl))
container = DECL_CHAIN (decl);
else
container = CP_DECL_CONTEXT (decl);
if (TYPE_P (container))
container = TYPE_NAME (container);
tree_node (container);
return container;
}
tree
trees_in::decl_container ()
{
/* The maybe-template. */
(void)tree_node ();
tree container = tree_node ();
return container;
}
/* Write out key information about a mergeable DEP. Does not write
the contents of DEP itself. The context has already been
written. The container has already been streamed. */
void
trees_out::key_mergeable (int tag, merge_kind mk, tree decl, tree inner,
tree container, depset *dep)
{
if (dep && is_key_order ())
{
gcc_checking_assert (dep->is_special ());
dep = dep->deps[0];
}
if (streaming_p ())
dump (dumper::MERGE)
&& dump ("Writing:%d's %s merge key (%s) %C:%N", tag, merge_kind_name[mk],
dep ? dep->entity_kind_name () : "contained",
TREE_CODE (decl), decl);
/* Now write the locating information. */
if (mk & MK_template_mask)
{
/* Specializations are located via their originating template,
and the set of template args they specialize. */
gcc_checking_assert (dep && dep->is_special ());
spec_entry *entry = reinterpret_cast <spec_entry *> (dep->deps[0]);
tree_node (entry->tmpl);
tree_node (entry->args);
if (mk & MK_tmpl_decl_mask)
if (flag_concepts && TREE_CODE (inner) == VAR_DECL)
{
/* Variable template partial specializations might need
constraints (see spec_hasher::equal). It's simpler to
write NULL when we don't need them. */
tree constraints = NULL_TREE;
if (uses_template_parms (entry->args))
constraints = get_constraints (inner);
tree_node (constraints);
}
if (CHECKING_P)
{
/* Make sure we can locate the decl. */
tree existing = match_mergeable_specialization
(bool (mk & MK_tmpl_decl_mask), entry);
gcc_assert (existing);
if (mk & MK_tmpl_decl_mask)
{
if (mk & MK_tmpl_alias_mask)
/* It should be in both tables. */
gcc_checking_assert
(same_type_p (match_mergeable_specialization (false, entry),
TREE_TYPE (existing)));
if (mk & MK_tmpl_tmpl_mask)
existing = DECL_TI_TEMPLATE (existing);
}
else
{
if (mk & MK_tmpl_tmpl_mask)
existing = CLASSTYPE_TI_TEMPLATE (existing);
else
existing = TYPE_NAME (existing);
}
/* The walkabout should have found ourselves. */
gcc_checking_assert (TREE_CODE (decl) == TYPE_DECL
? same_type_p (TREE_TYPE (decl),
TREE_TYPE (existing))
: existing == decl);
}
}
else if (mk != MK_unique)
{
merge_key key;
tree name = DECL_NAME (decl);
switch (mk)
{
default:
gcc_unreachable ();
case MK_named:
case MK_friend_spec:
if (IDENTIFIER_CONV_OP_P (name))
name = conv_op_identifier;
if (TREE_CODE (inner) == FUNCTION_DECL)
{
/* Functions are distinguished by parameter types. */
tree fn_type = TREE_TYPE (inner);
key.ref_q = type_memfn_rqual (fn_type);
key.args = TYPE_ARG_TYPES (fn_type);
if (tree reqs = get_constraints (inner))
{
if (cxx_dialect < cxx20)
reqs = CI_ASSOCIATED_CONSTRAINTS (reqs);
else
reqs = CI_DECLARATOR_REQS (reqs);
key.constraints = reqs;
}
if (IDENTIFIER_CONV_OP_P (name)
|| (decl != inner
&& !(name == fun_identifier
/* In case the user names something _FUN */
&& LAMBDA_TYPE_P (DECL_CONTEXT (inner)))))
/* And a function template, or conversion operator needs
the return type. Except for the _FUN thunk of a
generic lambda, which has a recursive decl_type'd
return type. */
// FIXME: What if the return type is a voldemort?
key.ret = fndecl_declared_return_type (inner);
}
break;
case MK_field:
{
unsigned ix = 0;
if (TREE_CODE (inner) != FIELD_DECL)
name = NULL_TREE;
else
gcc_checking_assert (!name || !IDENTIFIER_ANON_P (name));
for (tree field = TYPE_FIELDS (TREE_TYPE (container));
; field = DECL_CHAIN (field))
{
tree finner = STRIP_TEMPLATE (field);
if (TREE_CODE (finner) == TREE_CODE (inner))
{
if (finner == inner)
break;
ix++;
}
}
key.index = ix;
}
break;
case MK_vtable:
{
tree vtable = CLASSTYPE_VTABLES (TREE_TYPE (container));
for (unsigned ix = 0; ; vtable = DECL_CHAIN (vtable), ix++)
if (vtable == decl)
{
key.index = ix;
break;
}
name = NULL_TREE;
}
break;
case MK_as_base:
gcc_checking_assert
(decl == TYPE_NAME (CLASSTYPE_AS_BASE (TREE_TYPE (container))));
break;
case MK_local_friend:
{
/* Find by index on the class's DECL_LIST */
unsigned ix = 0;
for (tree decls = CLASSTYPE_DECL_LIST (TREE_CHAIN (decl));
decls; decls = TREE_CHAIN (decls))
if (!TREE_PURPOSE (decls))
{
tree frnd = friend_from_decl_list (TREE_VALUE (decls));
if (frnd == decl)
break;
ix++;
}
key.index = ix;
name = NULL_TREE;
}
break;
case MK_enum:
{
/* Anonymous enums are located by their first identifier,
and underlying type. */
tree type = TREE_TYPE (decl);
gcc_checking_assert (UNSCOPED_ENUM_P (type));
/* Using the type name drops the bit precision we might
have been using on the enum. */
key.ret = TYPE_NAME (ENUM_UNDERLYING_TYPE (type));
if (tree values = TYPE_VALUES (type))
name = DECL_NAME (TREE_VALUE (values));
}
break;
case MK_keyed:
{
gcc_checking_assert (LAMBDA_TYPE_P (TREE_TYPE (inner)));
tree scope = LAMBDA_EXPR_EXTRA_SCOPE (CLASSTYPE_LAMBDA_EXPR
(TREE_TYPE (inner)));
gcc_checking_assert (TREE_CODE (scope) == VAR_DECL);
auto *root = keyed_table->get (scope);
unsigned ix = root->length ();
/* If we don't find it, we'll write a really big number
that the reader will ignore. */
while (ix--)
if ((*root)[ix] == inner)
break;
/* Use the keyed-to decl as the 'name'. */
name = scope;
key.index = ix;
}
break;
case MK_partial:
{
tree ti = get_template_info (inner);
key.constraints = get_constraints (inner);
key.ret = TI_TEMPLATE (ti);
key.args = TI_ARGS (ti);
}
break;
}
tree_node (name);
if (streaming_p ())
{
unsigned code = (key.ref_q << 0) | (key.index << 2);
u (code);
}
if (mk == MK_enum)
tree_node (key.ret);
else if (mk == MK_partial
|| (mk == MK_named && inner
&& TREE_CODE (inner) == FUNCTION_DECL))
{
tree_node (key.ret);
tree arg = key.args;
if (mk == MK_named)
while (arg && arg != void_list_node)
{
tree_node (TREE_VALUE (arg));
arg = TREE_CHAIN (arg);
}
tree_node (arg);
tree_node (key.constraints);
}
}
}
/* DECL is a new declaration that may be duplicated in OVL. Use RET &
ARGS to find its clone, or NULL. If DECL's DECL_NAME is NULL, this
has been found by a proxy. It will be an enum type located by its
first member.
We're conservative with matches, so ambiguous decls will be
registered as different, then lead to a lookup error if the two
modules are both visible. Perhaps we want to do something similar
to duplicate decls to get ODR errors on loading? We already have
some special casing for namespaces. */
static tree
check_mergeable_decl (merge_kind mk, tree decl, tree ovl, merge_key const &key)
{
tree found = NULL_TREE;
for (ovl_iterator iter (ovl); !found && iter; ++iter)
{
tree match = *iter;
tree d_inner = decl;
tree m_inner = match;
again:
if (TREE_CODE (d_inner) != TREE_CODE (m_inner))
{
if (TREE_CODE (match) == NAMESPACE_DECL
&& !DECL_NAMESPACE_ALIAS (match))
/* Namespaces are never overloaded. */
found = match;
continue;
}
switch (TREE_CODE (d_inner))
{
case TEMPLATE_DECL:
if (template_heads_equivalent_p (d_inner, m_inner))
{
d_inner = DECL_TEMPLATE_RESULT (d_inner);
m_inner = DECL_TEMPLATE_RESULT (m_inner);
if (d_inner == error_mark_node
&& TYPE_DECL_ALIAS_P (m_inner))
{
found = match;
break;
}
goto again;
}
break;
case FUNCTION_DECL:
if (tree m_type = TREE_TYPE (m_inner))
if ((!key.ret
|| same_type_p (key.ret, fndecl_declared_return_type (m_inner)))
&& type_memfn_rqual (m_type) == key.ref_q
&& compparms (key.args, TYPE_ARG_TYPES (m_type))
/* Reject if old is a "C" builtin and new is not "C".
Matches decls_match behaviour. */
&& (!DECL_IS_UNDECLARED_BUILTIN (m_inner)
|| !DECL_EXTERN_C_P (m_inner)
|| DECL_EXTERN_C_P (d_inner)))
{
tree m_reqs = get_constraints (m_inner);
if (m_reqs)
{
if (cxx_dialect < cxx20)
m_reqs = CI_ASSOCIATED_CONSTRAINTS (m_reqs);
else
m_reqs = CI_DECLARATOR_REQS (m_reqs);
}
if (cp_tree_equal (key.constraints, m_reqs))
found = match;
}
break;
case TYPE_DECL:
if (DECL_IMPLICIT_TYPEDEF_P (d_inner)
== DECL_IMPLICIT_TYPEDEF_P (m_inner))
{
if (!IDENTIFIER_ANON_P (DECL_NAME (m_inner)))
return match;
else if (mk == MK_enum
&& (TYPE_NAME (ENUM_UNDERLYING_TYPE (TREE_TYPE (m_inner)))
== key.ret))
found = match;
}
break;
default:
found = match;
break;
}
}
return found;
}
/* DECL, INNER & TYPE are a skeleton set of nodes for a decl. Only
the bools have been filled in. Read its merging key and merge it.
Returns the existing decl if there is one. */
tree
trees_in::key_mergeable (int tag, merge_kind mk, tree decl, tree inner,
tree type, tree container, bool is_attached)
{
const char *kind = "new";
tree existing = NULL_TREE;
if (mk & MK_template_mask)
{
// FIXME: We could stream the specialization hash?
spec_entry spec;
spec.tmpl = tree_node ();
spec.args = tree_node ();
if (get_overrun ())
return error_mark_node;
DECL_NAME (decl) = DECL_NAME (spec.tmpl);
DECL_CONTEXT (decl) = DECL_CONTEXT (spec.tmpl);
DECL_NAME (inner) = DECL_NAME (decl);
DECL_CONTEXT (inner) = DECL_CONTEXT (decl);
tree constr = NULL_TREE;
bool is_decl = mk & MK_tmpl_decl_mask;
if (is_decl)
{
if (flag_concepts && TREE_CODE (inner) == VAR_DECL)
{
constr = tree_node ();
if (constr)
set_constraints (inner, constr);
}
spec.spec = (mk & MK_tmpl_tmpl_mask) ? inner : decl;
}
else
spec.spec = type;
existing = match_mergeable_specialization (is_decl, &spec);
if (constr)
/* We'll add these back later, if this is the new decl. */
remove_constraints (inner);
if (!existing)
; /* We'll add to the table once read. */
else if (mk & MK_tmpl_decl_mask)
{
/* A declaration specialization. */
if (mk & MK_tmpl_tmpl_mask)
existing = DECL_TI_TEMPLATE (existing);
}
else
{
/* A type specialization. */
if (mk & MK_tmpl_tmpl_mask)
existing = CLASSTYPE_TI_TEMPLATE (existing);
else
existing = TYPE_NAME (existing);
}
}
else if (mk == MK_unique)
kind = "unique";
else
{
tree name = tree_node ();
merge_key key;
unsigned code = u ();
key.ref_q = cp_ref_qualifier ((code >> 0) & 3);
key.index = code >> 2;
if (mk == MK_enum)
key.ret = tree_node ();
else if (mk == MK_partial
|| ((mk == MK_named || mk == MK_friend_spec)
&& TREE_CODE (inner) == FUNCTION_DECL))
{
key.ret = tree_node ();
tree arg, *arg_ptr = &key.args;
while ((arg = tree_node ())
&& arg != void_list_node
&& mk != MK_partial)
{
*arg_ptr = tree_cons (NULL_TREE, arg, NULL_TREE);
arg_ptr = &TREE_CHAIN (*arg_ptr);
}
*arg_ptr = arg;
key.constraints = tree_node ();
}
if (get_overrun ())
return error_mark_node;
if (mk < MK_indirect_lwm)
{
DECL_NAME (decl) = name;
DECL_CONTEXT (decl) = FROB_CONTEXT (container);
}
DECL_NAME (inner) = DECL_NAME (decl);
DECL_CONTEXT (inner) = DECL_CONTEXT (decl);
if (mk == MK_partial)
{
for (tree spec = DECL_TEMPLATE_SPECIALIZATIONS (key.ret);
spec; spec = TREE_CHAIN (spec))
{
tree tmpl = TREE_VALUE (spec);
tree ti = get_template_info (tmpl);
if (template_args_equal (key.args, TI_ARGS (ti))
&& cp_tree_equal (key.constraints,
get_constraints
(DECL_TEMPLATE_RESULT (tmpl))))
{
existing = tmpl;
break;
}
}
}
else
switch (TREE_CODE (container))
{
default:
gcc_unreachable ();
case NAMESPACE_DECL:
if (mk == MK_keyed)
{
if (DECL_LANG_SPECIFIC (name)
&& VAR_OR_FUNCTION_DECL_P (name)
&& DECL_MODULE_KEYED_DECLS_P (name))
if (auto *set = keyed_table->get (name))
if (key.index < set->length ())
{
existing = (*set)[key.index];
if (existing)
{
gcc_checking_assert
(DECL_IMPLICIT_TYPEDEF_P (existing));
if (inner != decl)
existing
= CLASSTYPE_TI_TEMPLATE (TREE_TYPE (existing));
}
}
}
else if (is_attached
&& !(state->is_module () || state->is_partition ()))
kind = "unique";
else
{
gcc_checking_assert (mk == MK_named || mk == MK_enum);
tree mvec;
tree *vslot = mergeable_namespace_slots (container, name,
is_attached, &mvec);
existing = check_mergeable_decl (mk, decl, *vslot, key);
if (!existing)
add_mergeable_namespace_entity (vslot, decl);
else
{
/* Note that we now have duplicates to deal with in
name lookup. */
if (is_attached)
BINDING_VECTOR_PARTITION_DUPS_P (mvec) = true;
else
BINDING_VECTOR_GLOBAL_DUPS_P (mvec) = true;
}
}
break;
case FUNCTION_DECL:
// FIXME: What about a voldemort? how do we find what it
// duplicates? Do we have to number vmorts relative to
// their containing function? But how would that work
// when matching an in-TU declaration?
kind = "unique";
break;
case TYPE_DECL:
if (is_attached && !(state->is_module () || state->is_partition ())
/* Implicit member functions can come from
anywhere. */
&& !(DECL_ARTIFICIAL (decl)
&& TREE_CODE (decl) == FUNCTION_DECL
&& !DECL_THUNK_P (decl)))
kind = "unique";
else
{
tree ctx = TREE_TYPE (container);
/* For some reason templated enumeral types are not marked
as COMPLETE_TYPE_P, even though they have members.
This may well be a bug elsewhere. */
if (TREE_CODE (ctx) == ENUMERAL_TYPE)
existing = find_enum_member (ctx, name);
else if (COMPLETE_TYPE_P (ctx))
{
switch (mk)
{
default:
gcc_unreachable ();
case MK_named:
existing = lookup_class_binding (ctx, name);
if (existing)
{
tree inner = decl;
if (TREE_CODE (inner) == TEMPLATE_DECL
&& !DECL_MEMBER_TEMPLATE_P (inner))
inner = DECL_TEMPLATE_RESULT (inner);
existing = check_mergeable_decl
(mk, inner, existing, key);
if (!existing && DECL_ALIAS_TEMPLATE_P (decl))
{} // FIXME: Insert into specialization
// tables, we'll need the arguments for that!
}
break;
case MK_field:
{
unsigned ix = key.index;
for (tree field = TYPE_FIELDS (ctx);
field; field = DECL_CHAIN (field))
{
tree finner = STRIP_TEMPLATE (field);
if (TREE_CODE (finner) == TREE_CODE (inner))
if (!ix--)
{
existing = field;
break;
}
}
}
break;
case MK_vtable:
{
unsigned ix = key.index;
for (tree vtable = CLASSTYPE_VTABLES (ctx);
vtable; vtable = DECL_CHAIN (vtable))
if (!ix--)
{
existing = vtable;
break;
}
}
break;
case MK_as_base:
{
tree as_base = CLASSTYPE_AS_BASE (ctx);
if (as_base && as_base != ctx)
existing = TYPE_NAME (as_base);
}
break;
case MK_local_friend:
{
unsigned ix = key.index;
for (tree decls = CLASSTYPE_DECL_LIST (ctx);
decls; decls = TREE_CHAIN (decls))
if (!TREE_PURPOSE (decls) && !ix--)
{
existing
= friend_from_decl_list (TREE_VALUE (decls));
break;
}
}
break;
}
if (existing && mk < MK_indirect_lwm && mk != MK_partial
&& TREE_CODE (decl) == TEMPLATE_DECL
&& !DECL_MEMBER_TEMPLATE_P (decl))
{
tree ti;
if (DECL_IMPLICIT_TYPEDEF_P (existing))
ti = TYPE_TEMPLATE_INFO (TREE_TYPE (existing));
else
ti = DECL_TEMPLATE_INFO (existing);
existing = TI_TEMPLATE (ti);
}
}
}
}
}
dump (dumper::MERGE)
&& dump ("Read:%d's %s merge key (%s) %C:%N", tag, merge_kind_name[mk],
existing ? "matched" : kind, TREE_CODE (decl), decl);
return existing;
}
void
trees_out::binfo_mergeable (tree binfo)
{
tree dom = binfo;
while (tree parent = BINFO_INHERITANCE_CHAIN (dom))
dom = parent;
tree type = BINFO_TYPE (dom);
gcc_checking_assert (TYPE_BINFO (type) == dom);
tree_node (type);
if (streaming_p ())
{
unsigned ix = 0;
for (; dom != binfo; dom = TREE_CHAIN (dom))
ix++;
u (ix);
}
}
unsigned
trees_in::binfo_mergeable (tree *type)
{
*type = tree_node ();
return u ();
}
/* DECL is a just streamed mergeable decl that should match EXISTING. Check
it does and issue an appropriate diagnostic if not. Merge any
bits from DECL to EXISTING. This is stricter matching than
decls_match, because we can rely on ODR-sameness, and we cannot use
decls_match because it can cause instantiations of constraints. */
bool
trees_in::is_matching_decl (tree existing, tree decl, bool is_typedef)
{
// FIXME: We should probably do some duplicate decl-like stuff here
// (beware, default parms should be the same?) Can we just call
// duplicate_decls and teach it how to handle the module-specific
// permitted/required duplications?
// We know at this point that the decls have matched by key, so we
// can elide some of the checking
gcc_checking_assert (TREE_CODE (existing) == TREE_CODE (decl));
tree d_inner = decl;
tree e_inner = existing;
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
d_inner = DECL_TEMPLATE_RESULT (d_inner);
e_inner = DECL_TEMPLATE_RESULT (e_inner);
gcc_checking_assert (TREE_CODE (e_inner) == TREE_CODE (d_inner));
}
if (TREE_CODE (d_inner) == FUNCTION_DECL)
{
tree e_ret = fndecl_declared_return_type (existing);
tree d_ret = fndecl_declared_return_type (decl);
if (decl != d_inner && DECL_NAME (d_inner) == fun_identifier
&& LAMBDA_TYPE_P (DECL_CONTEXT (d_inner)))
/* This has a recursive type that will compare different. */;
else if (!same_type_p (d_ret, e_ret))
goto mismatch;
tree e_type = TREE_TYPE (e_inner);
tree d_type = TREE_TYPE (d_inner);
if (DECL_EXTERN_C_P (d_inner) != DECL_EXTERN_C_P (e_inner))
goto mismatch;
for (tree e_args = TYPE_ARG_TYPES (e_type),
d_args = TYPE_ARG_TYPES (d_type);
e_args != d_args && (e_args || d_args);
e_args = TREE_CHAIN (e_args), d_args = TREE_CHAIN (d_args))
{
if (!(e_args && d_args))
goto mismatch;
if (!same_type_p (TREE_VALUE (d_args), TREE_VALUE (e_args)))
goto mismatch;
// FIXME: Check default values
}
/* If EXISTING has an undeduced or uninstantiated exception
specification, but DECL does not, propagate the exception
specification. Otherwise we end up asserting or trying to
instantiate it in the middle of loading. */
tree e_spec = TYPE_RAISES_EXCEPTIONS (e_type);
tree d_spec = TYPE_RAISES_EXCEPTIONS (d_type);
if (DEFERRED_NOEXCEPT_SPEC_P (e_spec))
{
if (!DEFERRED_NOEXCEPT_SPEC_P (d_spec)
|| (UNEVALUATED_NOEXCEPT_SPEC_P (e_spec)
&& !UNEVALUATED_NOEXCEPT_SPEC_P (d_spec)))
{
dump (dumper::MERGE)
&& dump ("Propagating instantiated noexcept to %N", existing);
TREE_TYPE (existing) = d_type;
/* Propagate to existing clones. */
tree clone;
FOR_EACH_CLONE (clone, existing)
{
if (TREE_TYPE (clone) == e_type)
TREE_TYPE (clone) = d_type;
else
TREE_TYPE (clone)
= build_exception_variant (TREE_TYPE (clone), d_spec);
}
}
}
else if (!DEFERRED_NOEXCEPT_SPEC_P (d_spec)
&& !comp_except_specs (d_spec, e_spec, ce_type))
goto mismatch;
}
else if (is_typedef)
{
if (!DECL_ORIGINAL_TYPE (e_inner)
|| !same_type_p (DECL_ORIGINAL_TYPE (d_inner),
DECL_ORIGINAL_TYPE (e_inner)))
goto mismatch;
}
/* Using cp_tree_equal because we can meet TYPE_ARGUMENT_PACKs
here. I suspect the entities that directly do that are things
that shouldn't go to duplicate_decls (FIELD_DECLs etc). */
else if (!cp_tree_equal (TREE_TYPE (decl), TREE_TYPE (existing)))
{
mismatch:
if (DECL_IS_UNDECLARED_BUILTIN (existing))
/* Just like duplicate_decls, presum the user knows what
they're doing in overriding a builtin. */
TREE_TYPE (existing) = TREE_TYPE (decl);
else
{
// FIXME:QOI Might be template specialization from a module,
// not necessarily global module
error_at (DECL_SOURCE_LOCATION (decl),
"conflicting global module declaration %#qD", decl);
inform (DECL_SOURCE_LOCATION (existing),
"existing declaration %#qD", existing);
return false;
}
}
if (DECL_IS_UNDECLARED_BUILTIN (existing)
&& !DECL_IS_UNDECLARED_BUILTIN (decl))
{
/* We're matching a builtin that the user has yet to declare.
We are the one! This is very much duplicate-decl
shenanigans. */
DECL_SOURCE_LOCATION (existing) = DECL_SOURCE_LOCATION (decl);
if (TREE_CODE (decl) != TYPE_DECL)
{
/* Propagate exceptions etc. */
TREE_TYPE (existing) = TREE_TYPE (decl);
TREE_NOTHROW (existing) = TREE_NOTHROW (decl);
}
/* This is actually an import! */
DECL_MODULE_IMPORT_P (existing) = true;
/* Yay, sliced! */
existing->base = decl->base;
if (TREE_CODE (decl) == FUNCTION_DECL)
{
/* Ew :( */
memcpy (&existing->decl_common.size,
&decl->decl_common.size,
(offsetof (tree_decl_common, pt_uid)
- offsetof (tree_decl_common, size)));
auto bltin_class = DECL_BUILT_IN_CLASS (decl);
existing->function_decl.built_in_class = bltin_class;
auto fncode = DECL_UNCHECKED_FUNCTION_CODE (decl);
DECL_UNCHECKED_FUNCTION_CODE (existing) = fncode;
if (existing->function_decl.built_in_class == BUILT_IN_NORMAL)
{
if (builtin_decl_explicit_p (built_in_function (fncode)))
switch (fncode)
{
case BUILT_IN_STPCPY:
set_builtin_decl_implicit_p
(built_in_function (fncode), true);
break;
default:
set_builtin_decl_declared_p
(built_in_function (fncode), true);
break;
}
copy_attributes_to_builtin (decl);
}
}
}
if (VAR_OR_FUNCTION_DECL_P (decl)
&& DECL_TEMPLATE_INSTANTIATED (decl))
/* Don't instantiate again! */
DECL_TEMPLATE_INSTANTIATED (existing) = true;
if (TREE_CODE (d_inner) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (d_inner))
DECL_DECLARED_INLINE_P (e_inner) = true;
if (!DECL_EXTERNAL (d_inner))
DECL_EXTERNAL (e_inner) = false;
// FIXME: Check default tmpl and fn parms here
return true;
}
/* FN is an implicit member function that we've discovered is new to
the class. Add it to the TYPE_FIELDS chain and the method vector.
Reset the appropriate classtype lazy flag. */
bool
trees_in::install_implicit_member (tree fn)
{
tree ctx = DECL_CONTEXT (fn);
tree name = DECL_NAME (fn);
/* We know these are synthesized, so the set of expected prototypes
is quite restricted. We're not validating correctness, just
distinguishing beteeen the small set of possibilities. */
tree parm_type = TREE_VALUE (FUNCTION_FIRST_USER_PARMTYPE (fn));
if (IDENTIFIER_CTOR_P (name))
{
if (CLASSTYPE_LAZY_DEFAULT_CTOR (ctx)
&& VOID_TYPE_P (parm_type))
CLASSTYPE_LAZY_DEFAULT_CTOR (ctx) = false;
else if (!TYPE_REF_P (parm_type))
return false;
else if (CLASSTYPE_LAZY_COPY_CTOR (ctx)
&& !TYPE_REF_IS_RVALUE (parm_type))
CLASSTYPE_LAZY_COPY_CTOR (ctx) = false;
else if (CLASSTYPE_LAZY_MOVE_CTOR (ctx))
CLASSTYPE_LAZY_MOVE_CTOR (ctx) = false;
else
return false;
}
else if (IDENTIFIER_DTOR_P (name))
{
if (CLASSTYPE_LAZY_DESTRUCTOR (ctx))
CLASSTYPE_LAZY_DESTRUCTOR (ctx) = false;
else
return false;
if (DECL_VIRTUAL_P (fn))
/* A virtual dtor should have been created when the class
became complete. */
return false;
}
else if (name == assign_op_identifier)
{
if (!TYPE_REF_P (parm_type))
return false;
else if (CLASSTYPE_LAZY_COPY_ASSIGN (ctx)
&& !TYPE_REF_IS_RVALUE (parm_type))
CLASSTYPE_LAZY_COPY_ASSIGN (ctx) = false;
else if (CLASSTYPE_LAZY_MOVE_ASSIGN (ctx))
CLASSTYPE_LAZY_MOVE_ASSIGN (ctx) = false;
else
return false;
}
else
return false;
dump (dumper::MERGE) && dump ("Adding implicit member %N", fn);
DECL_CHAIN (fn) = TYPE_FIELDS (ctx);
TYPE_FIELDS (ctx) = fn;
add_method (ctx, fn, false);
/* Propagate TYPE_FIELDS. */
fixup_type_variants (ctx);
return true;
}
/* Return non-zero if DECL has a definition that would be interesting to
write out. */
static bool
has_definition (tree decl)
{
bool is_tmpl = TREE_CODE (decl) == TEMPLATE_DECL;
if (is_tmpl)
decl = DECL_TEMPLATE_RESULT (decl);
switch (TREE_CODE (decl))
{
default:
break;
case FUNCTION_DECL:
if (!DECL_SAVED_TREE (decl))
/* Not defined. */
break;
if (DECL_DECLARED_INLINE_P (decl))
return true;
if (DECL_THIS_STATIC (decl)
&& (header_module_p ()
|| (!DECL_LANG_SPECIFIC (decl) || !DECL_MODULE_PURVIEW_P (decl))))
/* GM static function. */
return true;
if (DECL_TEMPLATE_INFO (decl))
{
int use_tpl = DECL_USE_TEMPLATE (decl);
// FIXME: Partial specializations have definitions too.
if (use_tpl < 2)
return true;
}
break;
case TYPE_DECL:
{
tree type = TREE_TYPE (decl);
if (type == TYPE_MAIN_VARIANT (type)
&& decl == TYPE_NAME (type)
&& (TREE_CODE (type) == ENUMERAL_TYPE
? TYPE_VALUES (type) : TYPE_FIELDS (type)))
return true;
}
break;
case VAR_DECL:
if (DECL_LANG_SPECIFIC (decl)
&& DECL_TEMPLATE_INFO (decl))
return DECL_INITIAL (decl);
else
{
if (!DECL_INITIALIZED_P (decl))
return false;
if (header_module_p ()
|| (!DECL_LANG_SPECIFIC (decl) || !DECL_MODULE_PURVIEW_P (decl)))
/* GM static variable. */
return true;
if (!TREE_CONSTANT (decl))
return false;
return true;
}
break;
case CONCEPT_DECL:
if (DECL_INITIAL (decl))
return true;
break;
}
return false;
}
uintptr_t *
trees_in::find_duplicate (tree existing)
{
if (!duplicates)
return NULL;
return duplicates->get (existing);
}
/* We're starting to read a duplicate DECL. EXISTING is the already
known node. */
void
trees_in::register_duplicate (tree decl, tree existing)
{
if (!duplicates)
duplicates = new duplicate_hash_map (40);
bool existed;
uintptr_t &slot = duplicates->get_or_insert (existing, &existed);
gcc_checking_assert (!existed);
slot = reinterpret_cast<uintptr_t> (decl);
}
/* We've read a definition of MAYBE_EXISTING. If not a duplicate,
return MAYBE_EXISTING (into which the definition should be
installed). Otherwise return NULL if already known bad, or the
duplicate we read (for ODR checking, or extracting additional merge
information). */
tree
trees_in::odr_duplicate (tree maybe_existing, bool has_defn)
{
tree res = NULL_TREE;
if (uintptr_t *dup = find_duplicate (maybe_existing))
{
if (!(*dup & 1))
res = reinterpret_cast<tree> (*dup);
}
else
res = maybe_existing;
assert_definition (maybe_existing, res && !has_defn);
// FIXME: We probably need to return the template, so that the
// template header can be checked?
return res ? STRIP_TEMPLATE (res) : NULL_TREE;
}
/* The following writer functions rely on the current behaviour of
depset::hash::add_dependency making the decl and defn depset nodes
depend on eachother. That way we don't have to worry about seeding
the tree map with named decls that cannot be looked up by name (I.e
template and function parms). We know the decl and definition will
be in the same cluster, which is what we want. */
void
trees_out::write_function_def (tree decl)
{
tree_node (DECL_RESULT (decl));
tree_node (DECL_INITIAL (decl));
tree_node (DECL_SAVED_TREE (decl));
tree_node (DECL_FRIEND_CONTEXT (decl));
constexpr_fundef *cexpr = retrieve_constexpr_fundef (decl);
int tag = 0;
if (cexpr)
{
if (cexpr->result == error_mark_node)
/* We'll stream the RESULT_DECL naturally during the
serialization. We never need to fish it back again, so
that's ok. */
tag = 0;
else
tag = insert (cexpr->result);
}
if (streaming_p ())
{
i (tag);
if (tag)
dump (dumper::TREE)
&& dump ("Constexpr:%d result %N", tag, cexpr->result);
}
if (tag)
{
unsigned ix = 0;
for (tree parm = cexpr->parms; parm; parm = DECL_CHAIN (parm), ix++)
{
tag = insert (parm);
if (streaming_p ())
dump (dumper::TREE)
&& dump ("Constexpr:%d parm:%u %N", tag, ix, parm);
}
tree_node (cexpr->body);
}
if (streaming_p ())
{
unsigned flags = 0;
if (DECL_NOT_REALLY_EXTERN (decl))
flags |= 1;
u (flags);
}
}
void
trees_out::mark_function_def (tree)
{
}
bool
trees_in::read_function_def (tree decl, tree maybe_template)
{
dump () && dump ("Reading function definition %N", decl);
tree result = tree_node ();
tree initial = tree_node ();
tree saved = tree_node ();
tree context = tree_node ();
constexpr_fundef cexpr;
tree maybe_dup = odr_duplicate (maybe_template, DECL_SAVED_TREE (decl));
bool installing = maybe_dup && !DECL_SAVED_TREE (decl);
if (int wtag = i ())
{
int tag = 1;
cexpr.result = error_mark_node;
cexpr.result = copy_decl (result);
tag = insert (cexpr.result);
if (wtag != tag)
set_overrun ();
dump (dumper::TREE)
&& dump ("Constexpr:%d result %N", tag, cexpr.result);
cexpr.parms = NULL_TREE;
tree *chain = &cexpr.parms;
unsigned ix = 0;
for (tree parm = DECL_ARGUMENTS (maybe_dup ? maybe_dup : decl);
parm; parm = DECL_CHAIN (parm), ix++)
{
tree p = copy_decl (parm);
tag = insert (p);
dump (dumper::TREE)
&& dump ("Constexpr:%d parm:%u %N", tag, ix, p);
*chain = p;
chain = &DECL_CHAIN (p);
}
cexpr.body = tree_node ();
cexpr.decl = decl;
}
else
cexpr.decl = NULL_TREE;
unsigned flags = u ();
if (get_overrun ())
return NULL_TREE;
if (installing)
{
DECL_NOT_REALLY_EXTERN (decl) = flags & 1;
DECL_RESULT (decl) = result;
DECL_INITIAL (decl) = initial;
DECL_SAVED_TREE (decl) = saved;
if (maybe_dup)
DECL_ARGUMENTS (decl) = DECL_ARGUMENTS (maybe_dup);
if (context)
SET_DECL_FRIEND_CONTEXT (decl, context);
if (cexpr.decl)
register_constexpr_fundef (cexpr);
post_process (maybe_template);
}
else if (maybe_dup)
{
// FIXME:QOI Check matching defn
}
return true;
}
/* Also for CONCEPT_DECLs. */
void
trees_out::write_var_def (tree decl)
{
tree init = DECL_INITIAL (decl);
tree_node (init);
if (!init)
{
tree dyn_init = NULL_TREE;
if (DECL_NONTRIVIALLY_INITIALIZED_P (decl))
{
dyn_init = value_member (decl,
CP_DECL_THREAD_LOCAL_P (decl)
? tls_aggregates : static_aggregates);
gcc_checking_assert (dyn_init);
/* Mark it so write_inits knows this is needed. */
TREE_LANG_FLAG_0 (dyn_init) = true;
dyn_init = TREE_PURPOSE (dyn_init);
}
tree_node (dyn_init);
}
}
void
trees_out::mark_var_def (tree)
{
}
bool
trees_in::read_var_def (tree decl, tree maybe_template)
{
/* Do not mark the virtual table entries as used. */
bool vtable = TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl);
unused += vtable;
tree init = tree_node ();
tree dyn_init = init ? NULL_TREE : tree_node ();
unused -= vtable;
if (get_overrun ())
return false;
bool initialized = (VAR_P (decl) ? bool (DECL_INITIALIZED_P (decl))
: bool (DECL_INITIAL (decl)));
tree maybe_dup = odr_duplicate (maybe_template, initialized);
bool installing = maybe_dup && !initialized;
if (installing)
{
if (DECL_EXTERNAL (decl))
DECL_NOT_REALLY_EXTERN (decl) = true;
if (VAR_P (decl))
{
DECL_INITIALIZED_P (decl) = true;
if (maybe_dup && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (maybe_dup))
DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
}
DECL_INITIAL (decl) = init;
if (!dyn_init)
;
else if (CP_DECL_THREAD_LOCAL_P (decl))
tls_aggregates = tree_cons (dyn_init, decl, tls_aggregates);
else
static_aggregates = tree_cons (dyn_init, decl, static_aggregates);
}
else if (maybe_dup)
{
// FIXME:QOI Check matching defn
}
return true;
}
/* If MEMBER doesn't have an independent life outside the class,
return it (or its TEMPLATE_DECL). Otherwise NULL. */
static tree
member_owned_by_class (tree member)
{
gcc_assert (DECL_P (member));
/* Clones are owned by their origin. */
if (DECL_CLONED_FUNCTION_P (member))
return NULL;
if (TREE_CODE (member) == FIELD_DECL)
/* FIELD_DECLS can have template info in some cases. We always
want the FIELD_DECL though, as there's never a TEMPLATE_DECL
wrapping them. */
return member;
int use_tpl = -1;
if (tree ti = node_template_info (member, use_tpl))
{
// FIXME: Don't bail on things that CANNOT have their own
// template header. No, make sure they're in the same cluster.
if (use_tpl > 0)
return NULL_TREE;
if (DECL_TEMPLATE_RESULT (TI_TEMPLATE (ti)) == member)
member = TI_TEMPLATE (ti);
}
return member;
}
void
trees_out::write_class_def (tree defn)
{
gcc_assert (DECL_P (defn));
if (streaming_p ())
dump () && dump ("Writing class definition %N", defn);
tree type = TREE_TYPE (defn);
tree_node (TYPE_SIZE (type));
tree_node (TYPE_SIZE_UNIT (type));
tree_node (TYPE_VFIELD (type));
tree_node (TYPE_BINFO (type));
vec_chained_decls (TYPE_FIELDS (type));
/* Every class but __as_base has a type-specific. */
gcc_checking_assert (!TYPE_LANG_SPECIFIC (type) == IS_FAKE_BASE_TYPE (type));
if (TYPE_LANG_SPECIFIC (type))
{
{
vec<tree, va_gc> *v = CLASSTYPE_MEMBER_VEC (type);
if (!v)
{
gcc_checking_assert (!streaming_p ());
/* Force a class vector. */
v = set_class_bindings (type, -1);
gcc_checking_assert (v);
}
unsigned len = v->length ();
if (streaming_p ())
u (len);
for (unsigned ix = 0; ix != len; ix++)
{
tree m = (*v)[ix];
if (TREE_CODE (m) == TYPE_DECL
&& DECL_ARTIFICIAL (m)
&& TYPE_STUB_DECL (TREE_TYPE (m)) == m)
/* This is a using-decl for a type, or an anonymous
struct (maybe with a typedef name). Write the type. */
m = TREE_TYPE (m);
tree_node (m);
}
}
tree_node (CLASSTYPE_LAMBDA_EXPR (type));
/* TYPE_CONTAINS_VPTR_P looks at the vbase vector, which the
reader won't know at this point. */
int has_vptr = TYPE_CONTAINS_VPTR_P (type);
if (streaming_p ())
{
unsigned nvbases = vec_safe_length (CLASSTYPE_VBASECLASSES (type));
u (nvbases);
i (has_vptr);
}
if (has_vptr)
{
tree_vec (CLASSTYPE_PURE_VIRTUALS (type));
tree_pair_vec (CLASSTYPE_VCALL_INDICES (type));
tree_node (CLASSTYPE_KEY_METHOD (type));
}
}
if (TYPE_LANG_SPECIFIC (type))
{
tree_node (CLASSTYPE_PRIMARY_BINFO (type));
tree as_base = CLASSTYPE_AS_BASE (type);
if (as_base)
as_base = TYPE_NAME (as_base);
tree_node (as_base);
/* Write the vtables. */
tree vtables = CLASSTYPE_VTABLES (type);
vec_chained_decls (vtables);
for (; vtables; vtables = TREE_CHAIN (vtables))
write_definition (vtables);
/* Write the friend classes. */
tree_list (CLASSTYPE_FRIEND_CLASSES (type), false);
/* Write the friend functions. */
for (tree friends = DECL_FRIENDLIST (defn);
friends; friends = TREE_CHAIN (friends))
{
/* Name of these friends. */
tree_node (TREE_PURPOSE (friends));
tree_list (TREE_VALUE (friends), false);
}
/* End of friend fns. */
tree_node (NULL_TREE);
/* Write the decl list. */
tree_list (CLASSTYPE_DECL_LIST (type), true);
if (TYPE_CONTAINS_VPTR_P (type))
{
/* Write the thunks. */
for (tree decls = TYPE_FIELDS (type);
decls; decls = DECL_CHAIN (decls))
if (TREE_CODE (decls) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decls)
&& DECL_THUNKS (decls))
{
tree_node (decls);
/* Thunks are always unique, so chaining is ok. */
chained_decls (DECL_THUNKS (decls));
}
tree_node (NULL_TREE);
}
}
}
void
trees_out::mark_class_member (tree member, bool do_defn)
{
gcc_assert (DECL_P (member));
member = member_owned_by_class (member);
if (member)
mark_declaration (member, do_defn && has_definition (member));
}
void
trees_out::mark_class_def (tree defn)
{
gcc_assert (DECL_P (defn));
tree type = TREE_TYPE (defn);
/* Mark the class members that are not type-decls and cannot have
independent definitions. */
for (tree member = TYPE_FIELDS (type); member; member = DECL_CHAIN (member))
if (TREE_CODE (member) == FIELD_DECL
|| TREE_CODE (member) == USING_DECL
/* A cloned enum-decl from 'using enum unrelated;' */
|| (TREE_CODE (member) == CONST_DECL
&& DECL_CONTEXT (member) == type))
{
mark_class_member (member);
if (TREE_CODE (member) == FIELD_DECL)
if (tree repr = DECL_BIT_FIELD_REPRESENTATIVE (member))
mark_declaration (repr, false);
}
/* Mark the binfo hierarchy. */
for (tree child = TYPE_BINFO (type); child; child = TREE_CHAIN (child))
mark_by_value (child);
if (TYPE_LANG_SPECIFIC (type))
{
for (tree vtable = CLASSTYPE_VTABLES (type);
vtable; vtable = TREE_CHAIN (vtable))
mark_declaration (vtable, true);
if (TYPE_CONTAINS_VPTR_P (type))
/* Mark the thunks, they belong to the class definition,
/not/ the thunked-to function. */
for (tree decls = TYPE_FIELDS (type);
decls; decls = DECL_CHAIN (decls))
if (TREE_CODE (decls) == FUNCTION_DECL)
for (tree thunks = DECL_THUNKS (decls);
thunks; thunks = DECL_CHAIN (thunks))
mark_declaration (thunks, false);
}
}
/* Nop sorting, needed for resorting the member vec. */
static void
nop (void *, void *, void *)
{
}
bool
trees_in::read_class_def (tree defn, tree maybe_template)
{
gcc_assert (DECL_P (defn));
dump () && dump ("Reading class definition %N", defn);
tree type = TREE_TYPE (defn);
tree size = tree_node ();
tree size_unit = tree_node ();
tree vfield = tree_node ();
tree binfo = tree_node ();
vec<tree, va_gc> *vbase_vec = NULL;
vec<tree, va_gc> *member_vec = NULL;
vec<tree, va_gc> *pure_virts = NULL;
vec<tree_pair_s, va_gc> *vcall_indices = NULL;
tree key_method = NULL_TREE;
tree lambda = NULL_TREE;
/* Read the fields. */
vec<tree, va_heap> *fields = vec_chained_decls ();
if (TYPE_LANG_SPECIFIC (type))
{
if (unsigned len = u ())
{
vec_alloc (member_vec, len);
for (unsigned ix = 0; ix != len; ix++)
{
tree m = tree_node ();
if (get_overrun ())
break;
if (TYPE_P (m))
m = TYPE_STUB_DECL (m);
member_vec->quick_push (m);
}
}
lambda = tree_node ();
if (!get_overrun ())
{
unsigned nvbases = u ();
if (nvbases)
{
vec_alloc (vbase_vec, nvbases);
for (tree child = binfo; child; child = TREE_CHAIN (child))
if (BINFO_VIRTUAL_P (child))
vbase_vec->quick_push (child);
}
}
if (!get_overrun ())
{
int has_vptr = i ();
if (has_vptr)
{
pure_virts = tree_vec ();
vcall_indices = tree_pair_vec ();
key_method = tree_node ();
}
}
}
tree maybe_dup = odr_duplicate (maybe_template, TYPE_SIZE (type));
bool installing = maybe_dup && !TYPE_SIZE (type);
if (installing)
{
if (DECL_EXTERNAL (defn) && TYPE_LANG_SPECIFIC (type))
{
/* We don't deal with not-really-extern, because, for a
module you want the import to be the interface, and for a
header-unit, you're doing it wrong. */
CLASSTYPE_INTERFACE_UNKNOWN (type) = false;
CLASSTYPE_INTERFACE_ONLY (type) = true;
}
if (maybe_dup != defn)
{
// FIXME: This is needed on other defns too, almost
// duplicate-decl like? See is_matching_decl too.
/* Copy flags from the duplicate. */
tree type_dup = TREE_TYPE (maybe_dup);
/* Core pieces. */
TYPE_MODE_RAW (type) = TYPE_MODE_RAW (type_dup);
SET_DECL_MODE (defn, DECL_MODE (maybe_dup));
TREE_ADDRESSABLE (type) = TREE_ADDRESSABLE (type_dup);
DECL_SIZE (defn) = DECL_SIZE (maybe_dup);
DECL_SIZE_UNIT (defn) = DECL_SIZE_UNIT (maybe_dup);
DECL_ALIGN_RAW (defn) = DECL_ALIGN_RAW (maybe_dup);
DECL_WARN_IF_NOT_ALIGN_RAW (defn)
= DECL_WARN_IF_NOT_ALIGN_RAW (maybe_dup);
DECL_USER_ALIGN (defn) = DECL_USER_ALIGN (maybe_dup);
/* C++ pieces. */
TYPE_POLYMORPHIC_P (type) = TYPE_POLYMORPHIC_P (type_dup);
TYPE_HAS_USER_CONSTRUCTOR (type)
= TYPE_HAS_USER_CONSTRUCTOR (type_dup);
TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type_dup);
if (auto ls = TYPE_LANG_SPECIFIC (type_dup))
{
if (TYPE_LANG_SPECIFIC (type))
{
CLASSTYPE_BEFRIENDING_CLASSES (type_dup)
= CLASSTYPE_BEFRIENDING_CLASSES (type);
if (!ANON_AGGR_TYPE_P (type))
CLASSTYPE_TYPEINFO_VAR (type_dup)
= CLASSTYPE_TYPEINFO_VAR (type);
}
for (tree v = type; v; v = TYPE_NEXT_VARIANT (v))
TYPE_LANG_SPECIFIC (v) = ls;
}
}
TYPE_SIZE (type) = size;
TYPE_SIZE_UNIT (type) = size_unit;
if (fields)
{
tree *chain = &TYPE_FIELDS (type);
unsigned len = fields->length ();
for (unsigned ix = 0; ix != len; ix++)
{
tree decl = (*fields)[ix];
if (!decl)
{
/* An anonymous struct with typedef name. */
tree tdef = (*fields)[ix+1];
decl = TYPE_STUB_DECL (TREE_TYPE (tdef));
gcc_checking_assert (IDENTIFIER_ANON_P (DECL_NAME (decl))
&& decl != tdef);
}
gcc_checking_assert (!*chain == !DECL_CLONED_FUNCTION_P (decl));
*chain = decl;
chain = &DECL_CHAIN (decl);
if (TREE_CODE (decl) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
ANON_AGGR_TYPE_FIELD
(TYPE_MAIN_VARIANT (TREE_TYPE (decl))) = decl;
if (TREE_CODE (decl) == USING_DECL
&& TREE_CODE (USING_DECL_SCOPE (decl)) == RECORD_TYPE)
{
/* Reconstruct DECL_ACCESS. */
tree decls = USING_DECL_DECLS (decl);
tree access = declared_access (decl);
for (ovl_iterator iter (decls); iter; ++iter)
{
tree d = *iter;
retrofit_lang_decl (d);
tree list = DECL_ACCESS (d);
if (!purpose_member (type, list))
DECL_ACCESS (d) = tree_cons (type, access, list);
}
}
}
}
TYPE_VFIELD (type) = vfield;
TYPE_BINFO (type) = binfo;
if (TYPE_LANG_SPECIFIC (type))
{
CLASSTYPE_LAMBDA_EXPR (type) = lambda;
CLASSTYPE_MEMBER_VEC (type) = member_vec;
CLASSTYPE_PURE_VIRTUALS (type) = pure_virts;
CLASSTYPE_VCALL_INDICES (type) = vcall_indices;
CLASSTYPE_KEY_METHOD (type) = key_method;
CLASSTYPE_VBASECLASSES (type) = vbase_vec;
/* Resort the member vector. */
resort_type_member_vec (member_vec, NULL, nop, NULL);
}
}
else if (maybe_dup)
{
// FIXME:QOI Check matching defn
}
if (TYPE_LANG_SPECIFIC (type))
{
tree primary = tree_node ();
tree as_base = tree_node ();
if (as_base)
as_base = TREE_TYPE (as_base);
/* Read the vtables. */
vec<tree, va_heap> *vtables = vec_chained_decls ();
if (vtables)
{
unsigned len = vtables->length ();
for (unsigned ix = 0; ix != len; ix++)
{
tree vtable = (*vtables)[ix];
read_var_def (vtable, vtable);
}
}
tree friend_classes = tree_list (false);
tree friend_functions = NULL_TREE;
for (tree *chain = &friend_functions;
tree name = tree_node (); chain = &TREE_CHAIN (*chain))
{
tree val = tree_list (false);
*chain = build_tree_list (name, val);
}
tree decl_list = tree_list (true);
if (installing)
{
CLASSTYPE_PRIMARY_BINFO (type) = primary;
CLASSTYPE_AS_BASE (type) = as_base;
if (vtables)
{
if (!CLASSTYPE_KEY_METHOD (type)
/* Sneaky user may have defined it inline
out-of-class. */
|| DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (type)))
vec_safe_push (keyed_classes, type);
unsigned len = vtables->length ();
tree *chain = &CLASSTYPE_VTABLES (type);
for (unsigned ix = 0; ix != len; ix++)
{
tree vtable = (*vtables)[ix];
gcc_checking_assert (!*chain);
*chain = vtable;
chain = &DECL_CHAIN (vtable);
}
}
CLASSTYPE_FRIEND_CLASSES (type) = friend_classes;
DECL_FRIENDLIST (defn) = friend_functions;
CLASSTYPE_DECL_LIST (type) = decl_list;
for (; friend_classes; friend_classes = TREE_CHAIN (friend_classes))
{
tree f = TREE_VALUE (friend_classes);
if (CLASS_TYPE_P (f))
{
CLASSTYPE_BEFRIENDING_CLASSES (f)
= tree_cons (NULL_TREE, type,
CLASSTYPE_BEFRIENDING_CLASSES (f));
dump () && dump ("Class %N befriending %C:%N",
type, TREE_CODE (f), f);
}
}
for (; friend_functions;
friend_functions = TREE_CHAIN (friend_functions))
for (tree friend_decls = TREE_VALUE (friend_functions);
friend_decls; friend_decls = TREE_CHAIN (friend_decls))
{
tree f = TREE_VALUE (friend_decls);
DECL_BEFRIENDING_CLASSES (f)
= tree_cons (NULL_TREE, type, DECL_BEFRIENDING_CLASSES (f));
dump () && dump ("Class %N befriending %C:%N",
type, TREE_CODE (f), f);
}
}
if (TYPE_CONTAINS_VPTR_P (type))
/* Read and install the thunks. */
while (tree vfunc = tree_node ())
{
tree thunks = chained_decls ();
if (installing)
SET_DECL_THUNKS (vfunc, thunks);
}
vec_free (vtables);
}
/* Propagate to all variants. */
if (installing)
fixup_type_variants (type);
/* IS_FAKE_BASE_TYPE is inaccurate at this point, because if this is
the fake base, we've not hooked it into the containing class's
data structure yet. Fortunately it has a unique name. */
if (installing
&& DECL_NAME (defn) != as_base_identifier
&& (!CLASSTYPE_TEMPLATE_INFO (type)
|| !uses_template_parms (TI_ARGS (CLASSTYPE_TEMPLATE_INFO (type)))))
/* Emit debug info. It'd be nice to know if the interface TU
already emitted this. */
rest_of_type_compilation (type, !LOCAL_CLASS_P (type));
vec_free (fields);
return !get_overrun ();
}
void
trees_out::write_enum_def (tree decl)
{
tree type = TREE_TYPE (decl);
tree_node (TYPE_VALUES (type));
tree_node (TYPE_MIN_VALUE (type));
tree_node (TYPE_MAX_VALUE (type));
}
void
trees_out::mark_enum_def (tree decl)
{
tree type = TREE_TYPE (decl);
for (tree values = TYPE_VALUES (type); values; values = TREE_CHAIN (values))
{
tree cst = TREE_VALUE (values);
mark_by_value (cst);
/* We must mark the init to avoid circularity in tt_enum_int. */
if (tree init = DECL_INITIAL (cst))
if (TREE_CODE (init) == INTEGER_CST)
mark_by_value (init);
}
}
bool
trees_in::read_enum_def (tree defn, tree maybe_template)
{
tree type = TREE_TYPE (defn);
tree values = tree_node ();
tree min = tree_node ();
tree max = tree_node ();
if (get_overrun ())
return false;
tree maybe_dup = odr_duplicate (maybe_template, TYPE_VALUES (type));
bool installing = maybe_dup && !TYPE_VALUES (type);
if (installing)
{
TYPE_VALUES (type) = values;
TYPE_MIN_VALUE (type) = min;
TYPE_MAX_VALUE (type) = max;
rest_of_type_compilation (type, DECL_NAMESPACE_SCOPE_P (defn));
}
else if (maybe_dup)
{
tree known = TYPE_VALUES (type);
for (; known && values;
known = TREE_CHAIN (known), values = TREE_CHAIN (values))
{
tree known_decl = TREE_VALUE (known);
tree new_decl = TREE_VALUE (values);
if (DECL_NAME (known_decl) != DECL_NAME (new_decl))
goto bad;
new_decl = maybe_duplicate (new_decl);
if (!cp_tree_equal (DECL_INITIAL (known_decl),
DECL_INITIAL (new_decl)))
goto bad;
}
if (known || values)
goto bad;
if (!cp_tree_equal (TYPE_MIN_VALUE (type), min)
|| !cp_tree_equal (TYPE_MAX_VALUE (type), max))
{
bad:;
error_at (DECL_SOURCE_LOCATION (maybe_dup),
"definition of %qD does not match", maybe_dup);
inform (DECL_SOURCE_LOCATION (defn),
"existing definition %qD", defn);
tree known_decl = NULL_TREE, new_decl = NULL_TREE;
if (known)
known_decl = TREE_VALUE (known);
if (values)
new_decl = maybe_duplicate (TREE_VALUE (values));
if (known_decl && new_decl)
{
inform (DECL_SOURCE_LOCATION (new_decl),
"... this enumerator %qD", new_decl);
inform (DECL_SOURCE_LOCATION (known_decl),
"enumerator %qD does not match ...", known_decl);
}
else if (known_decl || new_decl)
{
tree extra = known_decl ? known_decl : new_decl;
inform (DECL_SOURCE_LOCATION (extra),
"additional enumerators beginning with %qD", extra);
}
else
inform (DECL_SOURCE_LOCATION (maybe_dup),
"enumeration range differs");
/* Mark it bad. */
unmatched_duplicate (maybe_template);
}
}
return true;
}
/* Write out the body of DECL. See above circularity note. */
void
trees_out::write_definition (tree decl)
{
if (streaming_p ())
{
assert_definition (decl);
dump ()
&& dump ("Writing definition %C:%N", TREE_CODE (decl), decl);
}
else
dump (dumper::DEPEND)
&& dump ("Depending definition %C:%N", TREE_CODE (decl), decl);
again:
switch (TREE_CODE (decl))
{
default:
gcc_unreachable ();
case TEMPLATE_DECL:
decl = DECL_TEMPLATE_RESULT (decl);
goto again;
case FUNCTION_DECL:
write_function_def (decl);
break;
case TYPE_DECL:
{
tree type = TREE_TYPE (decl);
gcc_assert (TYPE_MAIN_VARIANT (type) == type
&& TYPE_NAME (type) == decl);
if (TREE_CODE (type) == ENUMERAL_TYPE)
write_enum_def (decl);
else
write_class_def (decl);
}
break;
case VAR_DECL:
case CONCEPT_DECL:
write_var_def (decl);
break;
}
}
/* Mark a declaration for by-value walking. If DO_DEFN is true, mark
its body too. */
void
trees_out::mark_declaration (tree decl, bool do_defn)
{
mark_by_value (decl);
if (TREE_CODE (decl) == TEMPLATE_DECL)
decl = DECL_TEMPLATE_RESULT (decl);
if (!do_defn)
return;
switch (TREE_CODE (decl))
{
default:
gcc_unreachable ();
case FUNCTION_DECL:
mark_function_def (decl);
break;
case TYPE_DECL:
{
tree type = TREE_TYPE (decl);
gcc_assert (TYPE_MAIN_VARIANT (type) == type
&& TYPE_NAME (type) == decl);
if (TREE_CODE (type) == ENUMERAL_TYPE)
mark_enum_def (decl);
else
mark_class_def (decl);
}
break;
case VAR_DECL:
case CONCEPT_DECL:
mark_var_def (decl);
break;
}
}
/* Read in the body of DECL. See above circularity note. */
bool
trees_in::read_definition (tree decl)
{
dump () && dump ("Reading definition %C %N", TREE_CODE (decl), decl);
tree maybe_template = decl;
again:
switch (TREE_CODE (decl))
{
default:
break;
case TEMPLATE_DECL:
decl = DECL_TEMPLATE_RESULT (decl);
goto again;
case FUNCTION_DECL:
return read_function_def (decl, maybe_template);
case TYPE_DECL:
{
tree type = TREE_TYPE (decl);
gcc_assert (TYPE_MAIN_VARIANT (type) == type
&& TYPE_NAME (type) == decl);
if (TREE_CODE (type) == ENUMERAL_TYPE)
return read_enum_def (decl, maybe_template);
else
return read_class_def (decl, maybe_template);
}
break;
case VAR_DECL:
case CONCEPT_DECL:
return read_var_def (decl, maybe_template);
}
return false;
}
/* Lookup an maybe insert a slot for depset for KEY. */
depset **
depset::hash::entity_slot (tree entity, bool insert)
{
traits::compare_type key (entity, NULL);
depset **slot = find_slot_with_hash (key, traits::hash (key),
insert ? INSERT : NO_INSERT);
return slot;
}
depset **
depset::hash::binding_slot (tree ctx, tree name, bool insert)
{
traits::compare_type key (ctx, name);
depset **slot = find_slot_with_hash (key, traits::hash (key),
insert ? INSERT : NO_INSERT);
return slot;
}
depset *
depset::hash::find_dependency (tree decl)
{
depset **slot = entity_slot (decl, false);
return slot ? *slot : NULL;
}
depset *
depset::hash::find_binding (tree ctx, tree name)
{
depset **slot = binding_slot (ctx, name, false);
return slot ? *slot : NULL;
}
/* DECL is a newly discovered dependency. Create the depset, if it
doesn't already exist. Add it to the worklist if so.
DECL will be an OVL_USING_P OVERLOAD, if it's from a binding that's
a using decl.
We do not have to worry about adding the same dependency more than
once. First it's harmless, but secondly the TREE_VISITED marking
prevents us wanting to do it anyway. */
depset *
depset::hash::make_dependency (tree decl, entity_kind ek)
{
/* Make sure we're being told consistent information. */
gcc_checking_assert ((ek == EK_NAMESPACE)
== (TREE_CODE (decl) == NAMESPACE_DECL
&& !DECL_NAMESPACE_ALIAS (decl)));
gcc_checking_assert (ek != EK_BINDING && ek != EK_REDIRECT);
gcc_checking_assert (TREE_CODE (decl) != FIELD_DECL
&& (TREE_CODE (decl) != USING_DECL
|| TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL));
gcc_checking_assert (!is_key_order ());
if (ek == EK_USING)
gcc_checking_assert (TREE_CODE (decl) == OVERLOAD);
if (TREE_CODE (decl) == TEMPLATE_DECL)
/* The template should have copied these from its result decl. */
gcc_checking_assert (DECL_MODULE_EXPORT_P (decl)
== DECL_MODULE_EXPORT_P (DECL_TEMPLATE_RESULT (decl)));
depset **slot = entity_slot (decl, true);
depset *dep = *slot;
bool for_binding = ek == EK_FOR_BINDING;
if (!dep)
{
if ((DECL_IMPLICIT_TYPEDEF_P (decl)
/* ... not an enum, for instance. */
&& RECORD_OR_UNION_TYPE_P (TREE_TYPE (decl))
&& TYPE_LANG_SPECIFIC (TREE_TYPE (decl))
&& CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)) == 2)
|| (VAR_P (decl)
&& DECL_LANG_SPECIFIC (decl)
&& DECL_USE_TEMPLATE (decl) == 2))
{
/* A partial or explicit specialization. Partial
specializations might not be in the hash table, because
there can be multiple differently-constrained variants.
template<typename T> class silly;
template<typename T> requires true class silly {};
We need to find them, insert their TEMPLATE_DECL in the
dep_hash, and then convert the dep we just found into a
redirect. */
tree ti = get_template_info (decl);
tree tmpl = TI_TEMPLATE (ti);
tree partial = NULL_TREE;
for (tree spec = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
spec; spec = TREE_CHAIN (spec))
if (DECL_TEMPLATE_RESULT (TREE_VALUE (spec)) == decl)
{
partial = TREE_VALUE (spec);
break;
}
if (partial)
{
/* Eagerly create an empty redirect. The following
make_dependency call could cause hash reallocation,
and invalidate slot's value. */
depset *redirect = make_entity (decl, EK_REDIRECT);
/* Redirects are never reached -- always snap to their target. */
redirect->set_flag_bit<DB_UNREACHED_BIT> ();
*slot = redirect;
depset *tmpl_dep = make_dependency (partial, EK_PARTIAL);
gcc_checking_assert (tmpl_dep->get_entity_kind () == EK_PARTIAL);
redirect->deps.safe_push (tmpl_dep);
return redirect;
}
}
bool has_def = ek != EK_USING && has_definition (decl);
if (ek > EK_BINDING)
ek = EK_DECL;
/* The only OVERLOADS we should see are USING decls from
bindings. */
*slot = dep = make_entity (decl, ek, has_def);
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
if (DECL_ALIAS_TEMPLATE_P (decl) && DECL_TEMPLATE_INFO (decl))
dep->set_flag_bit<DB_ALIAS_TMPL_INST_BIT> ();
else if (CHECKING_P)
/* The template_result should otherwise not be in the
table, or be an empty redirect (created above). */
if (auto *eslot = entity_slot (DECL_TEMPLATE_RESULT (decl), false))
gcc_checking_assert ((*eslot)->get_entity_kind () == EK_REDIRECT
&& !(*eslot)->deps.length ());
}
if (ek != EK_USING)
{
tree not_tmpl = STRIP_TEMPLATE (decl);
if (DECL_LANG_SPECIFIC (not_tmpl)
&& DECL_MODULE_IMPORT_P (not_tmpl))
{
/* Store the module number and index in cluster/section,
so we don't have to look them up again. */
unsigned index = import_entity_index (decl);
module_state *from = import_entity_module (index);
/* Remap will be zero for imports from partitions, which
we want to treat as-if declared in this TU. */
if (from->remap)
{
dep->cluster = index - from->entity_lwm;
dep->section = from->remap;
dep->set_flag_bit<DB_IMPORTED_BIT> ();
}
}
if (ek == EK_DECL
&& !dep->is_import ()
&& TREE_CODE (CP_DECL_CONTEXT (decl)) == NAMESPACE_DECL
&& !(TREE_CODE (decl) == TEMPLATE_DECL
&& DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (decl)))
{
tree ctx = CP_DECL_CONTEXT (decl);
if (!TREE_PUBLIC (ctx))
/* Member of internal namespace. */
dep->set_flag_bit<DB_IS_INTERNAL_BIT> ();
else if (VAR_OR_FUNCTION_DECL_P (not_tmpl)
&& DECL_THIS_STATIC (not_tmpl))
{
/* An internal decl. This is ok in a GM entity. */
if (!(header_module_p ()
|| !DECL_LANG_SPECIFIC (not_tmpl)
|| !DECL_MODULE_PURVIEW_P (not_tmpl)))
dep->set_flag_bit<DB_IS_INTERNAL_BIT> ();
}
}
}
if (!dep->is_import ())
worklist.safe_push (dep);
}
dump (dumper::DEPEND)
&& dump ("%s on %s %C:%N found",
ek == EK_REDIRECT ? "Redirect"
: for_binding ? "Binding" : "Dependency",
dep->entity_kind_name (), TREE_CODE (decl), decl);
return dep;
}
/* DEP is a newly discovered dependency. Append it to current's
depset. */
void
depset::hash::add_dependency (depset *dep)
{
gcc_checking_assert (current && !is_key_order ());
current->deps.safe_push (dep);
if (dep->is_internal () && !current->is_internal ())
current->set_flag_bit<DB_REFS_INTERNAL_BIT> ();
if (current->get_entity_kind () == EK_USING
&& DECL_IMPLICIT_TYPEDEF_P (dep->get_entity ())
&& TREE_CODE (TREE_TYPE (dep->get_entity ())) == ENUMERAL_TYPE)
{
/* CURRENT is an unwrapped using-decl and DECL is an enum's
implicit typedef. Is CURRENT a member of the enum? */
tree c_decl = OVL_FUNCTION (current->get_entity ());
if (TREE_CODE (c_decl) == CONST_DECL
&& (current->deps[0]->get_entity ()
== CP_DECL_CONTEXT (dep->get_entity ())))
/* Make DECL depend on CURRENT. */
dep->deps.safe_push (current);
}
if (dep->is_unreached ())
{
/* The dependency is reachable now. */
reached_unreached = true;
dep->clear_flag_bit<DB_UNREACHED_BIT> ();
dump (dumper::DEPEND)
&& dump ("Reaching unreached %s %C:%N", dep->entity_kind_name (),
TREE_CODE (dep->get_entity ()), dep->get_entity ());
}
}
depset *
depset::hash::add_dependency (tree decl, entity_kind ek)
{
depset *dep;
if (is_key_order ())
{
dep = find_dependency (decl);
if (dep)
{
current->deps.safe_push (dep);
dump (dumper::MERGE)
&& dump ("Key dependency on %s %C:%N found",
dep->entity_kind_name (), TREE_CODE (decl), decl);
}
else
{
/* It's not a mergeable decl, look for it in the original
table. */
dep = chain->find_dependency (decl);
gcc_checking_assert (dep);
}
}
else
{
dep = make_dependency (decl, ek);
if (dep->get_entity_kind () != EK_REDIRECT)
add_dependency (dep);
}
return dep;
}
void
depset::hash::add_namespace_context (depset *dep, tree ns)
{
depset *ns_dep = make_dependency (ns, depset::EK_NAMESPACE);
dep->deps.safe_push (ns_dep);
/* Mark it as special if imported so we don't walk connect when
SCCing. */
if (!dep->is_binding () && ns_dep->is_import ())
dep->set_special ();
}
struct add_binding_data
{
tree ns;
bitmap partitions;
depset *binding;
depset::hash *hash;
bool met_namespace;
};
/* Return true if we are, or contain something that is exported. */
bool
depset::hash::add_binding_entity (tree decl, WMB_Flags flags, void *data_)
{
auto data = static_cast <add_binding_data *> (data_);
if (!(TREE_CODE (decl) == NAMESPACE_DECL && !DECL_NAMESPACE_ALIAS (decl)))
{
tree inner = decl;
if (TREE_CODE (inner) == CONST_DECL
&& TREE_CODE (DECL_CONTEXT (inner)) == ENUMERAL_TYPE)
inner = TYPE_NAME (DECL_CONTEXT (inner));
else if (TREE_CODE (inner) == TEMPLATE_DECL)
inner = DECL_TEMPLATE_RESULT (inner);
if (!DECL_LANG_SPECIFIC (inner) || !DECL_MODULE_PURVIEW_P (inner))
/* Ignore global module fragment entities. */
return false;
if (VAR_OR_FUNCTION_DECL_P (inner)
&& DECL_THIS_STATIC (inner))
{
if (!header_module_p ())
/* Ignore internal-linkage entitites. */
return false;
}
if ((TREE_CODE (decl) == VAR_DECL
|| TREE_CODE (decl) == TYPE_DECL)
&& DECL_TINFO_P (decl))
/* Ignore TINFO things. */
return false;
if (TREE_CODE (decl) == VAR_DECL && DECL_NTTP_OBJECT_P (decl))
/* Ignore NTTP objects. */
return false;
if (!(flags & WMB_Using) && CP_DECL_CONTEXT (decl) != data->ns)
{
/* A using that lost its wrapper or an unscoped enum
constant. */
flags = WMB_Flags (flags | WMB_Using);
if (DECL_MODULE_EXPORT_P (TREE_CODE (decl) == CONST_DECL
? TYPE_NAME (TREE_TYPE (decl))
: STRIP_TEMPLATE (decl)))
flags = WMB_Flags (flags | WMB_Export);
}
if (!data->binding)
/* No binding to check. */;
else if (flags & WMB_Using)
{
/* Look in the binding to see if we already have this
using. */
for (unsigned ix = data->binding->deps.length (); --ix;)
{
depset *d = data->binding->deps[ix];
if (d->get_entity_kind () == EK_USING
&& OVL_FUNCTION (d->get_entity ()) == decl)
{
if (!(flags & WMB_Hidden))
d->clear_hidden_binding ();
if (flags & WMB_Export)
OVL_EXPORT_P (d->get_entity ()) = true;
return bool (flags & WMB_Export);
}
}
}
else if (flags & WMB_Dups)
{
/* Look in the binding to see if we already have this decl. */
for (unsigned ix = data->binding->deps.length (); --ix;)
{
depset *d = data->binding->deps[ix];
if (d->get_entity () == decl)
{
if (!(flags & WMB_Hidden))
d->clear_hidden_binding ();
return false;
}
}
}
/* We're adding something. */
if (!data->binding)
{
data->binding = make_binding (data->ns, DECL_NAME (decl));
data->hash->add_namespace_context (data->binding, data->ns);
depset **slot = data->hash->binding_slot (data->ns,
DECL_NAME (decl), true);
gcc_checking_assert (!*slot);
*slot = data->binding;
}
/* Make sure nobody left a tree visited lying about. */
gcc_checking_assert (!TREE_VISITED (decl));
if (flags & WMB_Using)
{
decl = ovl_make (decl, NULL_TREE);
if (flags & WMB_Export)
OVL_EXPORT_P (decl) = true;
}
depset *dep = data->hash->make_dependency
(decl, flags & WMB_Using ? EK_USING : EK_FOR_BINDING);
if (flags & WMB_Hidden)
dep->set_hidden_binding ();
data->binding->deps.safe_push (dep);
/* Binding and contents are mutually dependent. */
dep->deps.safe_push (data->binding);
return (flags & WMB_Using
? flags & WMB_Export : DECL_MODULE_EXPORT_P (decl));
}
else if (DECL_NAME (decl) && !data->met_namespace)
{
/* Namespace, walk exactly once. */
gcc_checking_assert (TREE_PUBLIC (decl));
data->met_namespace = true;
if (data->hash->add_namespace_entities (decl, data->partitions))
{
/* It contains an exported thing, so it is exported. */
gcc_checking_assert (DECL_MODULE_PURVIEW_P (decl));
DECL_MODULE_EXPORT_P (decl) = true;
}
if (DECL_MODULE_PURVIEW_P (decl))
{
data->hash->make_dependency (decl, depset::EK_NAMESPACE);
return DECL_MODULE_EXPORT_P (decl);
}
}
return false;
}
/* Recursively find all the namespace bindings of NS. Add a depset
for every binding that contains an export or module-linkage entity.
Add a defining depset for every such decl that we need to write a
definition. Such defining depsets depend on the binding depset.
Returns true if we contain something exported. */
bool
depset::hash::add_namespace_entities (tree ns, bitmap partitions)
{
dump () && dump ("Looking for writables in %N", ns);
dump.indent ();
unsigned count = 0;
add_binding_data data;
data.ns = ns;
data.partitions = partitions;
data.hash = this;
hash_table<named_decl_hash>::iterator end
(DECL_NAMESPACE_BINDINGS (ns)->end ());
for (hash_table<named_decl_hash>::iterator iter
(DECL_NAMESPACE_BINDINGS (ns)->begin ()); iter != end; ++iter)
{
data.binding = nullptr;
data.met_namespace = false;
if (walk_module_binding (*iter, partitions, add_binding_entity, &data))
count++;
}
if (count)
dump () && dump ("Found %u entries", count);
dump.outdent ();
return count != 0;
}
void
depset::hash::add_partial_entities (vec<tree, va_gc> *partial_classes)
{
for (unsigned ix = 0; ix != partial_classes->length (); ix++)
{
tree inner = (*partial_classes)[ix];
depset *dep = make_dependency (inner, depset::EK_DECL);
if (dep->get_entity_kind () == depset::EK_REDIRECT)
/* We should have recorded the template as a partial
specialization. */
gcc_checking_assert (dep->deps[0]->get_entity_kind ()
== depset::EK_PARTIAL);
else
/* It was an explicit specialization, not a partial one. */
gcc_checking_assert (dep->get_entity_kind ()
== depset::EK_SPECIALIZATION);
}
}
/* Add the members of imported classes that we defined in this TU.
This will also include lazily created implicit member function
declarations. (All others will be definitions.) */
void
depset::hash::add_class_entities (vec<tree, va_gc> *class_members)
{
for (unsigned ix = 0; ix != class_members->length (); ix++)
{
tree defn = (*class_members)[ix];
depset *dep = make_dependency (defn, EK_INNER_DECL);
if (dep->get_entity_kind () == EK_REDIRECT)
dep = dep->deps[0];
/* Only non-instantiations need marking as members. */
if (dep->get_entity_kind () == EK_DECL)
dep->set_flag_bit <DB_IS_MEMBER_BIT> ();
}
}
/* We add the partial & explicit specializations, and the explicit
instantiations. */
static void
specialization_add (bool decl_p, spec_entry *entry, void *data_)
{
vec<spec_entry *> *data = reinterpret_cast <vec<spec_entry *> *> (data_);
if (!decl_p)
{
/* We exclusively use decls to locate things. Make sure there's
no mismatch between the two specialization tables we keep.
pt.cc optimizes instantiation lookup using a complicated
heuristic. We don't attempt to replicate that algorithm, but
observe its behaviour and reproduce it upon read back. */
gcc_checking_assert (DECL_ALIAS_TEMPLATE_P (entry->tmpl)
|| TREE_CODE (entry->spec) == ENUMERAL_TYPE
|| DECL_CLASS_TEMPLATE_P (entry->tmpl));
/* Only alias templates can appear in both tables (and
if they're in the type table they must also be in the decl
table). */
gcc_checking_assert
(!match_mergeable_specialization (true, entry)
== !DECL_ALIAS_TEMPLATE_P (entry->tmpl));
}
else if (VAR_OR_FUNCTION_DECL_P (entry->spec))
gcc_checking_assert (!DECL_LOCAL_DECL_P (entry->spec));
data->safe_push (entry);
}
/* Arbitrary stable comparison. */
static int
specialization_cmp (const void *a_, const void *b_)
{
const spec_entry *ea = *reinterpret_cast<const spec_entry *const *> (a_);
const spec_entry *eb = *reinterpret_cast<const spec_entry *const *> (b_);
if (ea == eb)
return 0;
tree a = ea->spec;
tree b = eb->spec;
if (TYPE_P (a))
{
a = TYPE_NAME (a);
b = TYPE_NAME (b);
}
if (a == b)
/* This can happen with friend specializations. Just order by
entry address. See note in depset_cmp. */
return ea < eb ? -1 : +1;
return DECL_UID (a) < DECL_UID (b) ? -1 : +1;
}
/* We add all kinds of specialializations. Implicit specializations
should only streamed and walked if they are reachable from
elsewhere. Hence the UNREACHED flag. This is making the
assumption that it is cheaper to reinstantiate them on demand
elsewhere, rather than stream them in when we instantiate their
general template. Also, if we do stream them, we can only do that
if they are not internal (which they can become if they themselves
touch an internal entity?). */
void
depset::hash::add_specializations (bool decl_p)
{
vec<spec_entry *> data;
data.create (100);
walk_specializations (decl_p, specialization_add, &data);
data.qsort (specialization_cmp);
while (data.length ())
{
spec_entry *entry = data.pop ();
tree spec = entry->spec;
int use_tpl = 0;
bool is_alias = false;
bool is_friend = false;
if (decl_p && DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (entry->tmpl))
/* A friend of a template. This is keyed to the
instantiation. */
is_friend = true;
if (!decl_p && DECL_ALIAS_TEMPLATE_P (entry->tmpl))
{
spec = TYPE_NAME (spec);
is_alias = true;
}
if (decl_p || is_alias)
{
if (tree ti = DECL_TEMPLATE_INFO (spec))
{
tree tmpl = TI_TEMPLATE (ti);
use_tpl = DECL_USE_TEMPLATE (spec);
if (spec == DECL_TEMPLATE_RESULT (tmpl))
{
spec = tmpl;
gcc_checking_assert (DECL_USE_TEMPLATE (spec) == use_tpl);
}
else if (is_friend)
{
if (TI_TEMPLATE (ti) != entry->tmpl
|| !template_args_equal (TI_ARGS (ti), entry->tmpl))
goto template_friend;
}
}
else
{
template_friend:;
gcc_checking_assert (is_friend);
/* This is a friend of a template class, but not the one
that generated entry->spec itself (i.e. it's an
equivalent clone). We do not need to record
this. */
continue;
}
}
else
{
if (TREE_CODE (spec) == ENUMERAL_TYPE)
{
tree ctx = DECL_CONTEXT (TYPE_NAME (spec));
if (TYPE_P (ctx))
use_tpl = CLASSTYPE_USE_TEMPLATE (ctx);
else
use_tpl = DECL_USE_TEMPLATE (ctx);
}
else
use_tpl = CLASSTYPE_USE_TEMPLATE (spec);
tree ti = TYPE_TEMPLATE_INFO (spec);
tree tmpl = TI_TEMPLATE (ti);
spec = TYPE_NAME (spec);
if (spec == DECL_TEMPLATE_RESULT (tmpl))
{
spec = tmpl;
use_tpl = DECL_USE_TEMPLATE (spec);
}
}
bool needs_reaching = false;
if (use_tpl == 1)
/* Implicit instantiations only walked if we reach them. */
needs_reaching = true;
else if (!DECL_LANG_SPECIFIC (spec)
|| !DECL_MODULE_PURVIEW_P (STRIP_TEMPLATE (spec)))
/* Likewise, GMF explicit or partial specializations. */
needs_reaching = true;
#if false && CHECKING_P
/* The instantiation isn't always on
DECL_TEMPLATE_INSTANTIATIONS, */
// FIXME: we probably need to remember this information?
/* Verify the specialization is on the
DECL_TEMPLATE_INSTANTIATIONS of the template. */
for (tree cons = DECL_TEMPLATE_INSTANTIATIONS (entry->tmpl);
cons; cons = TREE_CHAIN (cons))
if (TREE_VALUE (cons) == entry->spec)
{
gcc_assert (entry->args == TREE_PURPOSE (cons));
goto have_spec;
}
gcc_unreachable ();
have_spec:;
#endif
/* Make sure nobody left a tree visited lying about. */
gcc_checking_assert (!TREE_VISITED (spec));
depset *dep = make_dependency (spec, depset::EK_SPECIALIZATION);
if (dep->is_special ())
{
/* An already located specialization, this must be the TYPE
corresponding to an alias_decl we found in the decl
table. */
spec_entry *other = reinterpret_cast <spec_entry *> (dep->deps[0]);
gcc_checking_assert (!decl_p && is_alias && !dep->is_type_spec ());
gcc_checking_assert (other->tmpl == entry->tmpl
&& template_args_equal (other->args, entry->args)
&& TREE_TYPE (other->spec) == entry->spec);
dep->set_flag_bit<DB_ALIAS_SPEC_BIT> ();
}
else
{
gcc_checking_assert (decl_p || !is_alias);
if (dep->get_entity_kind () == depset::EK_REDIRECT)
dep = dep->deps[0];
else if (dep->get_entity_kind () == depset::EK_SPECIALIZATION)
{
dep->set_special ();
dep->deps.safe_push (reinterpret_cast<depset *> (entry));
if (!decl_p)
dep->set_flag_bit<DB_TYPE_SPEC_BIT> ();
}
if (needs_reaching)
dep->set_flag_bit<DB_UNREACHED_BIT> ();
if (is_friend)
dep->set_flag_bit<DB_FRIEND_SPEC_BIT> ();
}
}
data.release ();
}
/* Add a depset into the mergeable hash. */
void
depset::hash::add_mergeable (depset *mergeable)
{
gcc_checking_assert (is_key_order ());
entity_kind ek = mergeable->get_entity_kind ();
tree decl = mergeable->get_entity ();
gcc_checking_assert (ek < EK_DIRECT_HWM);
depset **slot = entity_slot (decl, true);
gcc_checking_assert (!*slot);
depset *dep = make_entity (decl, ek);
*slot = dep;
worklist.safe_push (dep);
/* So we can locate the mergeable depset this depset refers to,
mark the first dep. */
dep->set_special ();
dep->deps.safe_push (mergeable);
}
/* Find the innermost-namespace scope of DECL, and that
namespace-scope decl. */
tree
find_pending_key (tree decl, tree *decl_p = nullptr)
{
tree ns = decl;
do
{
decl = ns;
ns = CP_DECL_CONTEXT (ns);
if (TYPE_P (ns))
ns = TYPE_NAME (ns);
}
while (TREE_CODE (ns) != NAMESPACE_DECL);
if (decl_p)
*decl_p = decl;
return ns;
}
/* Iteratively find dependencies. During the walk we may find more
entries on the same binding that need walking. */
void
depset::hash::find_dependencies (module_state *module)
{
trees_out walker (NULL, module, *this);
vec<depset *> unreached;
unreached.create (worklist.length ());
for (;;)
{
reached_unreached = false;
while (worklist.length ())
{
depset *item = worklist.pop ();
gcc_checking_assert (!item->is_binding ());
if (item->is_unreached ())
unreached.quick_push (item);
else
{
current = item;
tree decl = current->get_entity ();
dump (is_key_order () ? dumper::MERGE : dumper::DEPEND)
&& dump ("Dependencies of %s %C:%N",
is_key_order () ? "key-order"
: current->entity_kind_name (), TREE_CODE (decl), decl);
dump.indent ();
walker.begin ();
if (current->get_entity_kind () == EK_USING)
walker.tree_node (OVL_FUNCTION (decl));
else if (TREE_VISITED (decl))
/* A global tree. */;
else if (item->get_entity_kind () == EK_NAMESPACE)
{
module->note_location (DECL_SOURCE_LOCATION (decl));
add_namespace_context (current, CP_DECL_CONTEXT (decl));
}
else
{
walker.mark_declaration (decl, current->has_defn ());
if (!walker.is_key_order ()
&& (item->get_entity_kind () == EK_SPECIALIZATION
|| item->get_entity_kind () == EK_PARTIAL
|| (item->get_entity_kind () == EK_DECL
&& item->is_member ())))
{
tree ns = find_pending_key (decl, nullptr);
add_namespace_context (item, ns);
}
// FIXME: Perhaps p1815 makes this redundant? Or at
// least simplifies it. Voldemort types are only
// ever emissable when containing (inline) function
// definition is emitted?
/* Turn the Sneakoscope on when depending the decl. */
sneakoscope = true;
walker.decl_value (decl, current);
sneakoscope = false;
if (current->has_defn ())
walker.write_definition (decl);
}
walker.end ();
if (!walker.is_key_order ()
&& TREE_CODE (decl) == TEMPLATE_DECL
&& !DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (decl))
/* Mark all the explicit & partial specializations as
reachable. */
for (tree cons = DECL_TEMPLATE_INSTANTIATIONS (decl);
cons; cons = TREE_CHAIN (cons))
{
tree spec = TREE_VALUE (cons);
if (TYPE_P (spec))
spec = TYPE_NAME (spec);
int use_tpl;
node_template_info (spec, use_tpl);
if (use_tpl & 2)
{
depset *spec_dep = find_dependency (spec);
if (spec_dep->get_entity_kind () == EK_REDIRECT)
spec_dep = spec_dep->deps[0];
if (spec_dep->is_unreached ())
{
reached_unreached = true;
spec_dep->clear_flag_bit<DB_UNREACHED_BIT> ();
dump (dumper::DEPEND)
&& dump ("Reaching unreached specialization"
" %C:%N", TREE_CODE (spec), spec);
}
}
}
dump.outdent ();
current = NULL;
}
}
if (!reached_unreached)
break;
/* It's possible the we reached the unreached before we
processed it in the above loop, so we'll be doing this an
extra time. However, to avoid that we have to do some
bit shuffling that also involves a scan of the list.
Swings & roundabouts I guess. */
std::swap (worklist, unreached);
}
unreached.release ();
}
/* Compare two entries of a single binding. TYPE_DECL before
non-exported before exported. */
static int
binding_cmp (const void *a_, const void *b_)
{
depset *a = *(depset *const *)a_;
depset *b = *(depset *const *)b_;
tree a_ent = a->get_entity ();
tree b_ent = b->get_entity ();
gcc_checking_assert (a_ent != b_ent
&& !a->is_binding ()
&& !b->is_binding ());
/* Implicit typedefs come first. */
bool a_implicit = DECL_IMPLICIT_TYPEDEF_P (a_ent);
bool b_implicit = DECL_IMPLICIT_TYPEDEF_P (b_ent);
if (a_implicit || b_implicit)
{
/* A binding with two implicit type decls? That's unpossible! */
gcc_checking_assert (!(a_implicit && b_implicit));
return a_implicit ? -1 : +1; /* Implicit first. */
}
/* Hidden before non-hidden. */
bool a_hidden = a->is_hidden ();
bool b_hidden = b->is_hidden ();
if (a_hidden != b_hidden)
return a_hidden ? -1 : +1;
bool a_using = a->get_entity_kind () == depset::EK_USING;
bool a_export;
if (a_using)
{
a_export = OVL_EXPORT_P (a_ent);
a_ent = OVL_FUNCTION (a_ent);
}
else
a_export = DECL_MODULE_EXPORT_P (TREE_CODE (a_ent) == CONST_DECL
? TYPE_NAME (TREE_TYPE (a_ent))
: STRIP_TEMPLATE (a_ent));
bool b_using = b->get_entity_kind () == depset::EK_USING;
bool b_export;
if (b_using)
{
b_export = OVL_EXPORT_P (b_ent);
b_ent = OVL_FUNCTION (b_ent);
}
else
b_export = DECL_MODULE_EXPORT_P (TREE_CODE (b_ent) == CONST_DECL
? TYPE_NAME (TREE_TYPE (b_ent))
: STRIP_TEMPLATE (b_ent));
/* Non-exports before exports. */
if (a_export != b_export)
return a_export ? +1 : -1;
/* At this point we don't care, but want a stable sort. */
if (a_using != b_using)
/* using first. */
return a_using? -1 : +1;
return DECL_UID (a_ent) < DECL_UID (b_ent) ? -1 : +1;
}
/* Sort the bindings, issue errors about bad internal refs. */
bool
depset::hash::finalize_dependencies ()
{
bool ok = true;
depset::hash::iterator end (this->end ());
for (depset::hash::iterator iter (begin ()); iter != end; ++iter)
{
depset *dep = *iter;
if (dep->is_binding ())
{
/* Keep the containing namespace dep first. */
gcc_checking_assert (dep->deps.length () > 1
&& (dep->deps[0]->get_entity_kind ()
== EK_NAMESPACE)
&& (dep->deps[0]->get_entity ()
== dep->get_entity ()));
if (dep->deps.length () > 2)
gcc_qsort (&dep->deps[1], dep->deps.length () - 1,
sizeof (dep->deps[1]), binding_cmp);
}
else if (dep->refs_internal ())
{
for (unsigned ix = dep->deps.length (); ix--;)
{
depset *rdep = dep->deps[ix];
if (rdep->is_internal ())
{
// FIXME:QOI Better location information? We're
// losing, so it doesn't matter about efficiency
tree decl = dep->get_entity ();
error_at (DECL_SOURCE_LOCATION (decl),
"%q#D references internal linkage entity %q#D",
decl, rdep->get_entity ());
break;
}
}
ok = false;
}
}
return ok;
}
/* Core of TARJAN's algorithm to find Strongly Connected Components
within a graph. See https://en.wikipedia.org/wiki/
Tarjan%27s_strongly_connected_components_algorithm for details.
We use depset::section as lowlink. Completed nodes have
depset::cluster containing the cluster number, with the top
bit set.
A useful property is that the output vector is a reverse
topological sort of the resulting DAG. In our case that means
dependent SCCs are found before their dependers. We make use of
that property. */
void
depset::tarjan::connect (depset *v)
{
gcc_checking_assert (v->is_binding ()
|| !(v->is_unreached () || v->is_import ()));
v->cluster = v->section = ++index;
stack.safe_push (v);
/* Walk all our dependencies, ignore a first marked slot */
for (unsigned ix = v->is_special (); ix != v->deps.length (); ix++)
{
depset *dep = v->deps[ix];
if (dep->is_binding () || !dep->is_import ())
{
unsigned lwm = dep->cluster;
if (!dep->cluster)
{
/* A new node. Connect it. */
connect (dep);
lwm = dep->section;
}
if (dep->section && v->section > lwm)
v->section = lwm;
}
}
if (v->section == v->cluster)
{
/* Root of a new SCC. Push all the members onto the result list. */
unsigned num = v->cluster;
depset *p;
do
{
p = stack.pop ();
p->cluster = num;
p->section = 0;
result.quick_push (p);
}
while (p != v);
}
}
/* Compare two depsets. The specific ordering is unimportant, we're
just trying to get consistency. */
static int
depset_cmp (const void *a_, const void *b_)
{
depset *a = *(depset *const *)a_;
depset *b = *(depset *const *)b_;
depset::entity_kind a_kind = a->get_entity_kind ();
depset::entity_kind b_kind = b->get_entity_kind ();
if (a_kind != b_kind)
/* Different entity kinds, order by that. */
return a_kind < b_kind ? -1 : +1;
tree a_decl = a->get_entity ();
tree b_decl = b->get_entity ();
if (a_kind == depset::EK_USING)
{
/* If one is a using, the other must be too. */
a_decl = OVL_FUNCTION (a_decl);
b_decl = OVL_FUNCTION (b_decl);
}
if (a_decl != b_decl)
/* Different entities, order by their UID. */
return DECL_UID (a_decl) < DECL_UID (b_decl) ? -1 : +1;
if (a_kind == depset::EK_BINDING)
{
/* Both are bindings. Order by identifier hash. */
gcc_checking_assert (a->get_name () != b->get_name ());
return (IDENTIFIER_HASH_VALUE (a->get_name ())
< IDENTIFIER_HASH_VALUE (b->get_name ())
? -1 : +1);
}
/* They are the same decl. This can happen with two using decls
pointing to the same target. The best we can aim for is
consistently telling qsort how to order them. Hopefully we'll
never have to debug a case that depends on this. Oh, who am I
kidding? Good luck. */
gcc_checking_assert (a_kind == depset::EK_USING);
/* Order by depset address. Not the best, but it is something. */
return a < b ? -1 : +1;
}
/* Sort the clusters in SCC such that those that depend on one another
are placed later. */
// FIXME: I am not convinced this is needed and, if needed,
// sufficient. We emit the decls in this order but that emission
// could walk into later decls (from the body of the decl, or default
// arg-like things). Why doesn't that walk do the right thing? And
// if it DTRT why do we need to sort here -- won't things naturally
// work? I think part of the issue is that when we're going to refer
// to an entity by name, and that entity is in the same cluster as us,
// we need to actually walk that entity, if we've not already walked
// it.
static void
sort_cluster (depset::hash *original, depset *scc[], unsigned size)
{
depset::hash table (size, original);
dump.indent ();
/* Place bindings last, usings before that. It's not strictly
necessary, but it does make things neater. Says Mr OCD. */
unsigned bind_lwm = size;
unsigned use_lwm = size;
for (unsigned ix = 0; ix != use_lwm;)
{
depset *dep = scc[ix];
switch (dep->get_entity_kind ())
{
case depset::EK_BINDING:
/* Move to end. No increment. Notice this could be moving
a using decl, which we'll then move again. */
if (--bind_lwm != ix)
{
scc[ix] = scc[bind_lwm];
scc[bind_lwm] = dep;
}
if (use_lwm > bind_lwm)
{
use_lwm--;
break;
}
/* We must have copied a using, so move it too. */
dep = scc[ix];
gcc_checking_assert (dep->get_entity_kind () == depset::EK_USING);
/* FALLTHROUGH */
case depset::EK_USING:
if (--use_lwm != ix)
{
scc[ix] = scc[use_lwm];
scc[use_lwm] = dep;
}
break;
case depset::EK_DECL:
case depset::EK_SPECIALIZATION:
case depset::EK_PARTIAL:
table.add_mergeable (dep);
ix++;
break;
default:
gcc_unreachable ();
}
}
gcc_checking_assert (use_lwm <= bind_lwm);
dump (dumper::MERGE) && dump ("Ordering %u/%u depsets", use_lwm, size);
table.find_dependencies (nullptr);
vec<depset *> order = table.connect ();
gcc_checking_assert (order.length () == use_lwm);
/* Now rewrite entries [0,lwm), in the dependency order we
discovered. Usually each entity is in its own cluster. Rarely,
we can get multi-entity clusters, in which case all but one must
only be reached from within the cluster. This happens for
something like:
template<typename T>
auto Foo (const T &arg) -> TPL<decltype (arg)>;
The instantiation of TPL will be in the specialization table, and
refer to Foo via arg. But we can only get to that specialization
from Foo's declaration, so we only need to treat Foo as mergable
(We'll do structural comparison of TPL<decltype (arg)>).
Finding the single cluster entry dep is very tricky and
expensive. Let's just not do that. It's harmless in this case
anyway. */
unsigned pos = 0;
unsigned cluster = ~0u;
for (unsigned ix = 0; ix != order.length (); ix++)
{
gcc_checking_assert (order[ix]->is_special ());
depset *dep = order[ix]->deps[0];
scc[pos++] = dep;
dump (dumper::MERGE)
&& dump ("Mergeable %u is %N%s", ix, dep->get_entity (),
order[ix]->cluster == cluster ? " (tight)" : "");
cluster = order[ix]->cluster;
}
gcc_checking_assert (pos == use_lwm);
order.release ();
dump (dumper::MERGE) && dump ("Ordered %u keys", pos);
dump.outdent ();
}
/* Reduce graph to SCCS clusters. SCCS will be populated with the
depsets in dependency order. Each depset's CLUSTER field contains
its cluster number. Each SCC has a unique cluster number, and are
contiguous in SCCS. Cluster numbers are otherwise arbitrary. */
vec<depset *>
depset::hash::connect ()
{
tarjan connector (size ());
vec<depset *> deps;
deps.create (size ());
iterator end (this->end ());
for (iterator iter (begin ()); iter != end; ++iter)
{
depset *item = *iter;
entity_kind kind = item->get_entity_kind ();
if (kind == EK_BINDING
|| !(kind == EK_REDIRECT
|| item->is_unreached ()
|| item->is_import ()))
deps.quick_push (item);
}
/* Iteration over the hash table is an unspecified ordering. While
that has advantages, it causes 2 problems. Firstly repeatable
builds are tricky. Secondly creating testcases that check
dependencies are correct by making sure a bad ordering would
happen if that was wrong. */
deps.qsort (depset_cmp);
while (deps.length ())
{
depset *v = deps.pop ();
dump (dumper::CLUSTER) &&
(v->is_binding ()
? dump ("Connecting binding %P", v->get_entity (), v->get_name ())
: dump ("Connecting %s %s %C:%N",
is_key_order () ? "key-order"
: !v->has_defn () ? "declaration" : "definition",
v->entity_kind_name (), TREE_CODE (v->get_entity ()),
v->get_entity ()));
if (!v->cluster)
connector.connect (v);
}
deps.release ();
return connector.result;
}
/* Initialize location spans. */
void
loc_spans::init (const line_maps *lmaps, const line_map_ordinary *map)
{
gcc_checking_assert (!init_p ());
spans = new vec<span> ();
spans->reserve (20);
span interval;
interval.ordinary.first = 0;
interval.macro.second = MAX_LOCATION_T + 1;
interval.ordinary_delta = interval.macro_delta = 0;
/* A span for reserved fixed locs. */
interval.ordinary.second
= MAP_START_LOCATION (LINEMAPS_ORDINARY_MAP_AT (line_table, 0));
interval.macro.first = interval.macro.second;
dump (dumper::LOCATION)
&& dump ("Fixed span %u ordinary:[%u,%u) macro:[%u,%u)", spans->length (),
interval.ordinary.first, interval.ordinary.second,
interval.macro.first, interval.macro.second);
spans->quick_push (interval);
/* A span for command line & forced headers. */
interval.ordinary.first = interval.ordinary.second;
interval.macro.second = interval.macro.first;
if (map)
{
interval.ordinary.second = map->start_location;
interval.macro.first = LINEMAPS_MACRO_LOWEST_LOCATION (lmaps);
}
dump (dumper::LOCATION)
&& dump ("Pre span %u ordinary:[%u,%u) macro:[%u,%u)", spans->length (),
interval.ordinary.first, interval.ordinary.second,
interval.macro.first, interval.macro.second);
spans->quick_push (interval);
/* Start an interval for the main file. */
interval.ordinary.first = interval.ordinary.second;
interval.macro.second = interval.macro.first;
dump (dumper::LOCATION)
&& dump ("Main span %u ordinary:[%u,*) macro:[*,%u)", spans->length (),
interval.ordinary.first, interval.macro.second);
spans->quick_push (interval);
}
/* Reopen the span, if we want the about-to-be-inserted set of maps to
be propagated in our own location table. I.e. we are the primary
interface and we're importing a partition. */
bool
loc_spans::maybe_propagate (module_state *import, location_t hwm)
{
bool opened = (module_interface_p () && !module_partition_p ()
&& import->is_partition ());
if (opened)
open (hwm);
return opened;
}
/* Open a new linemap interval. The just-created ordinary map is the
first map of the interval. */
void
loc_spans::open (location_t hwm)
{
span interval;
interval.ordinary.first = interval.ordinary.second = hwm;
interval.macro.first = interval.macro.second
= LINEMAPS_MACRO_LOWEST_LOCATION (line_table);
interval.ordinary_delta = interval.macro_delta = 0;
dump (dumper::LOCATION)
&& dump ("Opening span %u ordinary:[%u,... macro:...,%u)",
spans->length (), interval.ordinary.first,
interval.macro.second);
if (spans->length ())
{
/* No overlapping! */
auto &last = spans->last ();
gcc_checking_assert (interval.ordinary.first >= last.ordinary.second);
gcc_checking_assert (interval.macro.second <= last.macro.first);
}
spans->safe_push (interval);
}
/* Close out the current linemap interval. The last maps are within
the interval. */
void
loc_spans::close ()
{
span &interval = spans->last ();
interval.ordinary.second
= ((line_table->highest_location + (1 << line_table->default_range_bits))
& ~((1u << line_table->default_range_bits) - 1));
interval.macro.first = LINEMAPS_MACRO_LOWEST_LOCATION (line_table);
dump (dumper::LOCATION)
&& dump ("Closing span %u ordinary:[%u,%u) macro:[%u,%u)",
spans->length () - 1,
interval.ordinary.first,interval.ordinary.second,
interval.macro.first, interval.macro.second);
}
/* Given an ordinary location LOC, return the lmap_interval it resides
in. NULL if it is not in an interval. */
const loc_spans::span *
loc_spans::ordinary (location_t loc)
{
unsigned len = spans->length ();
unsigned pos = 0;
while (len)
{
unsigned half = len / 2;
const span &probe = (*spans)[pos + half];
if (loc < probe.ordinary.first)
len = half;
else if (loc < probe.ordinary.second)
return &probe;
else
{
pos += half + 1;
len = len - (half + 1);
}
}
return NULL;
}
/* Likewise, given a macro location LOC, return the lmap interval it
resides in. */
const loc_spans::span *
loc_spans::macro (location_t loc)
{
unsigned len = spans->length ();
unsigned pos = 0;
while (len)
{
unsigned half = len / 2;
const span &probe = (*spans)[pos + half];
if (loc >= probe.macro.second)
len = half;
else if (loc >= probe.macro.first)
return &probe;
else
{
pos += half + 1;
len = len - (half + 1);
}
}
return NULL;
}
/* Return the ordinary location closest to FROM. */
static location_t
ordinary_loc_of (line_maps *lmaps, location_t from)
{
while (!IS_ORDINARY_LOC (from))
{
if (IS_ADHOC_LOC (from))
from = get_location_from_adhoc_loc (lmaps, from);
if (from >= LINEMAPS_MACRO_LOWEST_LOCATION (lmaps))
{
/* Find the ordinary location nearest FROM. */
const line_map *map = linemap_lookup (lmaps, from);
const line_map_macro *mac_map = linemap_check_macro (map);
from = MACRO_MAP_EXPANSION_POINT_LOCATION (mac_map);
}
}
return from;
}
static module_state **
get_module_slot (tree name, module_state *parent, bool partition, bool insert)
{
module_state_hash::compare_type ct (name, uintptr_t (parent) | partition);
hashval_t hv = module_state_hash::hash (ct);
return modules_hash->find_slot_with_hash (ct, hv, insert ? INSERT : NO_INSERT);
}
static module_state *
get_primary (module_state *parent)
{
while (parent->is_partition ())
parent = parent->parent;
if (!parent->name)
// Implementation unit has null name
parent = parent->parent;
return parent;
}
/* Find or create module NAME & PARENT in the hash table. */
module_state *
get_module (tree name, module_state *parent, bool partition)
{
if (partition)
{
if (!parent)
parent = get_primary ((*modules)[0]);
if (!parent->is_partition () && !parent->flatname)
parent->set_flatname ();
}
module_state **slot = get_module_slot (name, parent, partition, true);
module_state *state = *slot;
if (!state)
{
state = (new (ggc_alloc<module_state> ())
module_state (name, parent, partition));
*slot = state;
}
return state;
}
/* Process string name PTR into a module_state. */
static module_state *
get_module (const char *ptr)
{
if (ptr[0] == '.' ? IS_DIR_SEPARATOR (ptr[1]) : IS_ABSOLUTE_PATH (ptr))
/* A header name. */
return get_module (build_string (strlen (ptr), ptr));
bool partition = false;
module_state *mod = NULL;
for (const char *probe = ptr;; probe++)
if (!*probe || *probe == '.' || *probe == ':')
{
if (probe == ptr)
return NULL;
mod = get_module (get_identifier_with_length (ptr, probe - ptr),
mod, partition);
ptr = probe;
if (*ptr == ':')
{
if (partition)
return NULL;
partition = true;
}
if (!*ptr++)
break;
}
else if (!(ISALPHA (*probe) || *probe == '_'
|| (probe != ptr && ISDIGIT (*probe))))
return NULL;
return mod;
}
/* Create a new mapper connecting to OPTION. */
module_client *
make_mapper (location_t loc)
{
timevar_start (TV_MODULE_MAPPER);
const char *option = module_mapper_name;
if (!option)
option = getenv ("CXX_MODULE_MAPPER");
mapper = module_client::open_module_client
(loc, option, &set_cmi_repo,
(save_decoded_options[0].opt_index == OPT_SPECIAL_program_name)
&& save_decoded_options[0].arg != progname
? save_decoded_options[0].arg : nullptr);
timevar_stop (TV_MODULE_MAPPER);
return mapper;
}
static unsigned lazy_snum;
static bool
recursive_lazy (unsigned snum = ~0u)
{
if (lazy_snum)
{
error_at (input_location, "recursive lazy load");
return true;
}
lazy_snum = snum;
return false;
}
/* If THIS is the current purview, issue an import error and return false. */
bool
module_state::check_not_purview (location_t from)
{
module_state *imp = (*modules)[0];
if (imp && !imp->name)
imp = imp->parent;
if (imp == this)
{
/* Cannot import the current module. */
error_at (from, "cannot import module in its own purview");
inform (loc, "module %qs declared here", get_flatname ());
return false;
}
return true;
}
/* Module name substitutions. */
static vec<module_state *,va_heap> substs;
void
module_state::mangle (bool include_partition)
{
if (subst)
mangle_module_substitution (subst);
else
{
if (parent)
parent->mangle (include_partition);
if (include_partition || !is_partition ())
{
// Partitions are significant for global initializer
// functions
bool partition = is_partition () && !parent->is_partition ();
subst = mangle_module_component (name, partition);
substs.safe_push (this);
}
}
}
void
mangle_module (int mod, bool include_partition)
{
module_state *imp = (*modules)[mod];
gcc_checking_assert (!imp->is_header ());
if (!imp->name)
/* Set when importing the primary module interface. */
imp = imp->parent;
imp->mangle (include_partition);
}
/* Clean up substitutions. */
void
mangle_module_fini ()
{
while (substs.length ())
substs.pop ()->subst = 0;
}
/* Announce WHAT about the module. */
void
module_state::announce (const char *what) const
{
if (noisy_p ())
{
fprintf (stderr, " %s:%s", what, get_flatname ());
fflush (stderr);
}
}
/* A human-readable README section. The contents of this section to
not contribute to the CRC, so the contents can change per
compilation. That allows us to embed CWD, hostname, build time and
what not. It is a STRTAB that may be extracted with:
readelf -pgnu.c++.README $(module).gcm */
void
module_state::write_readme (elf_out *to, cpp_reader *reader, const char *dialect)
{
bytes_out readme (to);
readme.begin (false);
readme.printf ("GNU C++ %s",
is_header () ? "header unit"
: !is_partition () ? "primary interface"
: is_interface () ? "interface partition"
: "internal partition");
/* Compiler's version. */
readme.printf ("compiler: %s", version_string);
/* Module format version. */
verstr_t string;
version2string (MODULE_VERSION, string);
readme.printf ("version: %s", string);
/* Module information. */
readme.printf ("module: %s", get_flatname ());
readme.printf ("source: %s", main_input_filename);
readme.printf ("dialect: %s", dialect);
if (extensions)
readme.printf ("extensions: %s",
extensions & SE_OPENMP ? "-fopenmp" : "");
/* The following fields could be expected to change between
otherwise identical compilations. Consider a distributed build
system. We should have a way of overriding that. */
if (char *cwd = getcwd (NULL, 0))
{
readme.printf ("cwd: %s", cwd);
free (cwd);
}
readme.printf ("repository: %s", cmi_repo ? cmi_repo : ".");
#if NETWORKING
{
char hostname[64];
if (!gethostname (hostname, sizeof (hostname)))
readme.printf ("host: %s", hostname);
}
#endif
{
/* This of course will change! */
time_t stampy;
auto kind = cpp_get_date (reader, &stampy);
if (kind != CPP_time_kind::UNKNOWN)
{
struct tm *time;
time = gmtime (&stampy);
readme.print_time ("build", time, "UTC");
if (kind == CPP_time_kind::DYNAMIC)
{
time = localtime (&stampy);
readme.print_time ("local", time,
#if defined (__USE_MISC) || defined (__USE_BSD) /* Is there a better way? */
time->tm_zone
#else
""
#endif
);
}
}
}
/* Its direct imports. */
for (unsigned ix = 1; ix < modules->length (); ix++)
{
module_state *state = (*modules)[ix];
if (state->is_direct ())
readme.printf ("%s: %s %s", state->exported_p ? "export" : "import",
state->get_flatname (), state->filename);
}
readme.end (to, to->name (MOD_SNAME_PFX ".README"), NULL);
}
/* Sort environment var names in reverse order. */
static int
env_var_cmp (const void *a_, const void *b_)
{
const unsigned char *a = *(const unsigned char *const *)a_;
const unsigned char *b = *(const unsigned char *const *)b_;
for (unsigned ix = 0; ; ix++)
{
bool a_end = !a[ix] || a[ix] == '=';
if (a[ix] == b[ix])
{
if (a_end)
break;
}
else
{
bool b_end = !b[ix] || b[ix] == '=';
if (!a_end && !b_end)
return a[ix] < b[ix] ? +1 : -1;
if (a_end && b_end)
break;
return a_end ? +1 : -1;
}
}
return 0;
}
/* Write the environment. It is a STRTAB that may be extracted with:
readelf -pgnu.c++.ENV $(module).gcm */
void
module_state::write_env (elf_out *to)
{
vec<const char *> vars;
vars.create (20);
extern char **environ;
while (const char *var = environ[vars.length ()])
vars.safe_push (var);
vars.qsort (env_var_cmp);
bytes_out env (to);
env.begin (false);
while (vars.length ())
env.printf ("%s", vars.pop ());
env.end (to, to->name (MOD_SNAME_PFX ".ENV"), NULL);
vars.release ();
}
/* Write the direct or indirect imports.
u:N
{
u:index
s:name
u32:crc
s:filename (direct)
u:exported (direct)
} imports[N]
*/
void
module_state::write_imports (bytes_out &sec, bool direct)
{
unsigned count = 0;
for (unsigned ix = 1; ix < modules->length (); ix++)
{
module_state *imp = (*modules)[ix];
if (imp->remap && imp->is_direct () == direct)
count++;
}
gcc_assert (!direct || count);
sec.u (count);
for (unsigned ix = 1; ix < modules->length (); ix++)
{
module_state *imp = (*modules)[ix];
if (imp->remap && imp->is_direct () == direct)
{
dump () && dump ("Writing %simport:%u->%u %M (crc=%x)",
!direct ? "indirect "
: imp->exported_p ? "exported " : "",
ix, imp->remap, imp, imp->crc);
sec.u (imp->remap);
sec.str (imp->get_flatname ());
sec.u32 (imp->crc);
if (direct)
{
write_location (sec, imp->imported_from ());
sec.str (imp->filename);
int exportedness = 0;
if (imp->exported_p)
exportedness = +1;
else if (!imp->is_purview_direct ())
exportedness = -1;
sec.i (exportedness);
}
}
}
}
/* READER, LMAPS != NULL == direct imports,
== NUL == indirect imports. */
unsigned
module_state::read_imports (bytes_in &sec, cpp_reader *reader, line_maps *lmaps)
{
unsigned count = sec.u ();
unsigned loaded = 0;
while (count--)
{
unsigned ix = sec.u ();
if (ix >= slurp->remap->length () || !ix || (*slurp->remap)[ix])
{
sec.set_overrun ();
break;
}
const char *name = sec.str (NULL);
module_state *imp = get_module (name);
unsigned crc = sec.u32 ();
int exportedness = 0;
/* If the import is a partition, it must be the same primary
module as this TU. */
if (imp && imp->is_partition () &&
(!named_module_p ()
|| (get_primary ((*modules)[0]) != get_primary (imp))))
imp = NULL;
if (!imp)
sec.set_overrun ();
if (sec.get_overrun ())
break;
if (lmaps)
{
/* A direct import, maybe load it. */
location_t floc = read_location (sec);
const char *fname = sec.str (NULL);
exportedness = sec.i ();
if (sec.get_overrun ())
break;
if (!imp->check_not_purview (loc))
continue;
if (imp->loadedness == ML_NONE)
{
imp->loc = floc;
imp->crc = crc;
if (!imp->get_flatname ())
imp->set_flatname ();
unsigned n = dump.push (imp);
if (!imp->filename && fname)
imp->filename = xstrdup (fname);
if (imp->is_partition ())
dump () && dump ("Importing elided partition %M", imp);
if (!imp->do_import (reader, false))
imp = NULL;
dump.pop (n);
if (!imp)
continue;
}
if (is_partition ())
{
if (!imp->is_direct ())
imp->directness = MD_PARTITION_DIRECT;
if (exportedness > 0)
imp->exported_p = true;
}
}
else
{
/* An indirect import, find it, it should already be here. */
if (imp->loadedness == ML_NONE)
{
error_at (loc, "indirect import %qs is not already loaded", name);
continue;
}
}
if (imp->crc != crc)
error_at (loc, "import %qs has CRC mismatch", imp->get_flatname ());
(*slurp->remap)[ix] = (imp->mod << 1) | (lmaps != NULL);
if (lmaps && exportedness >= 0)
set_import (imp, bool (exportedness));
dump () && dump ("Found %simport:%u %M->%u", !lmaps ? "indirect "
: exportedness > 0 ? "exported "
: exportedness < 0 ? "gmf" : "", ix, imp,
imp->mod);
loaded++;
}
return loaded;
}
/* Write the import table to MOD_SNAME_PFX.imp. */
void
module_state::write_imports (elf_out *to, unsigned *crc_ptr)
{
dump () && dump ("Writing imports");
dump.indent ();
bytes_out sec (to);
sec.begin ();
write_imports (sec, true);
write_imports (sec, false);
sec.end (to, to->name (MOD_SNAME_PFX ".imp"), crc_ptr);
dump.outdent ();
}
bool
module_state::read_imports (cpp_reader *reader, line_maps *lmaps)
{
bytes_in sec;
if (!sec.begin (loc, from (), MOD_SNAME_PFX ".imp"))
return false;
dump () && dump ("Reading %u imports", slurp->remap->length () - 1);
dump.indent ();
/* Read the imports. */
unsigned direct = read_imports (sec, reader, lmaps);
unsigned indirect = read_imports (sec, NULL, NULL);
if (direct + indirect + 1 != slurp->remap->length ())
from ()->set_error (elf::E_BAD_IMPORT);
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
/* We're the primary module interface, but have partitions. Document
them so that non-partition module implementation units know which
have already been loaded. */
void
module_state::write_partitions (elf_out *to, unsigned count, unsigned *crc_ptr)
{
dump () && dump ("Writing %u elided partitions", count);
dump.indent ();
bytes_out sec (to);
sec.begin ();
for (unsigned ix = 1; ix != modules->length (); ix++)
{
module_state *imp = (*modules)[ix];
if (imp->is_partition ())
{
dump () && dump ("Writing elided partition %M (crc=%x)",
imp, imp->crc);
sec.str (imp->get_flatname ());
sec.u32 (imp->crc);
write_location (sec, imp->is_direct ()
? imp->imported_from () : UNKNOWN_LOCATION);
sec.str (imp->filename);
}
}
sec.end (to, to->name (MOD_SNAME_PFX ".prt"), crc_ptr);
dump.outdent ();
}
bool
module_state::read_partitions (unsigned count)
{
bytes_in sec;
if (!sec.begin (loc, from (), MOD_SNAME_PFX ".prt"))
return false;
dump () && dump ("Reading %u elided partitions", count);
dump.indent ();
while (count--)
{
const char *name = sec.str (NULL);
unsigned crc = sec.u32 ();
location_t floc = read_location (sec);
const char *fname = sec.str (NULL);
if (sec.get_overrun ())
break;
dump () && dump ("Reading elided partition %s (crc=%x)", name, crc);
module_state *imp = get_module (name);
if (!imp /* Partition should be ... */
|| !imp->is_partition () /* a partition ... */
|| imp->loadedness != ML_NONE /* that is not yet loaded ... */
|| get_primary (imp) != this) /* whose primary is this. */
{
sec.set_overrun ();
break;
}
if (!imp->has_location ())
imp->loc = floc;
imp->crc = crc;
if (!imp->filename && fname[0])
imp->filename = xstrdup (fname);
}
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
/* Data for config reading and writing. */
struct module_state_config {
const char *dialect_str;
unsigned num_imports;
unsigned num_partitions;
unsigned num_entities;
unsigned ordinary_locs;
unsigned macro_locs;
unsigned loc_range_bits;
unsigned active_init;
public:
module_state_config ()
:dialect_str (get_dialect ()),
num_imports (0), num_partitions (0), num_entities (0),
ordinary_locs (0), macro_locs (0), loc_range_bits (0),
active_init (0)
{
}
static void release ()
{
XDELETEVEC (dialect);
dialect = NULL;
}
private:
static const char *get_dialect ();
static char *dialect;
};
char *module_state_config::dialect;
/* Generate a string of the significant compilation options.
Generally assume the user knows what they're doing, in the same way
that object files can be mixed. */
const char *
module_state_config::get_dialect ()
{
if (!dialect)
dialect = concat (get_cxx_dialect_name (cxx_dialect),
/* C++ implies these, only show if disabled. */
flag_exceptions ? "" : "/no-exceptions",
flag_rtti ? "" : "/no-rtti",
flag_new_inheriting_ctors ? "" : "/old-inheriting-ctors",
/* C++ 20 implies concepts. */
cxx_dialect < cxx20 && flag_concepts ? "/concepts" : "",
flag_coroutines ? "/coroutines" : "",
flag_module_implicit_inline ? "/implicit-inline" : "",
NULL);
return dialect;
}
/* Contents of a cluster. */
enum cluster_tag {
ct_decl, /* A decl. */
ct_defn, /* A definition. */
ct_bind, /* A binding. */
ct_hwm
};
/* Binding modifiers. */
enum ct_bind_flags
{
cbf_export = 0x1, /* An exported decl. */
cbf_hidden = 0x2, /* A hidden (friend) decl. */
cbf_using = 0x4, /* A using decl. */
cbf_wrapped = 0x8, /* ... that is wrapped. */
};
/* DEP belongs to a different cluster, seed it to prevent
unfortunately timed duplicate import. */
// FIXME: QOI For inter-cluster references we could just only pick
// one entity from an earlier cluster. Even better track
// dependencies between earlier clusters
void
module_state::intercluster_seed (trees_out &sec, unsigned index_hwm, depset *dep)
{
if (dep->is_import ()
|| dep->cluster < index_hwm)
{
tree ent = dep->get_entity ();
if (!TREE_VISITED (ent))
{
sec.tree_node (ent);
dump (dumper::CLUSTER)
&& dump ("Seeded %s %N",
dep->is_import () ? "import" : "intercluster", ent);
}
}
}
/* Write the cluster of depsets in SCC[0-SIZE).
dep->section -> section number
dep->cluster -> entity number
*/
unsigned
module_state::write_cluster (elf_out *to, depset *scc[], unsigned size,
depset::hash &table, unsigned *counts,
unsigned *crc_ptr)
{
dump () && dump ("Writing section:%u %u depsets", table.section, size);
dump.indent ();
trees_out sec (to, this, table, table.section);
sec.begin ();
unsigned index_lwm = counts[MSC_entities];
/* Determine entity numbers, mark for writing. */
dump (dumper::CLUSTER) && dump ("Cluster members:") && (dump.indent (), true);
for (unsigned ix = 0; ix != size; ix++)
{
depset *b = scc[ix];
switch (b->get_entity_kind ())
{
default:
gcc_unreachable ();
case depset::EK_BINDING:
{
dump (dumper::CLUSTER)
&& dump ("[%u]=%s %P", ix, b->entity_kind_name (),
b->get_entity (), b->get_name ());
depset *ns_dep = b->deps[0];
gcc_checking_assert (ns_dep->get_entity_kind ()
== depset::EK_NAMESPACE
&& ns_dep->get_entity () == b->get_entity ());
for (unsigned jx = b->deps.length (); --jx;)
{
depset *dep = b->deps[jx];
// We could be declaring something that is also a
// (merged) import
gcc_checking_assert (dep->is_import ()
|| TREE_VISITED (dep->get_entity ())
|| (dep->get_entity_kind ()
== depset::EK_USING));
}
}
break;
case depset::EK_DECL:
case depset::EK_SPECIALIZATION:
case depset::EK_PARTIAL:
b->cluster = counts[MSC_entities]++;
sec.mark_declaration (b->get_entity (), b->has_defn ());
/* FALLTHROUGH */
case depset::EK_USING:
gcc_checking_assert (!b->is_import ()
&& !b->is_unreached ());
dump (dumper::CLUSTER)
&& dump ("[%u]=%s %s %N", ix, b->entity_kind_name (),
b->has_defn () ? "definition" : "declaration",
b->get_entity ());
break;
}
}
dump (dumper::CLUSTER) && (dump.outdent (), true);
/* Ensure every out-of-cluster decl is referenced before we start
streaming. We must do both imports *and* earlier clusters,
because the latter could reach into the former and cause a
duplicate loop. */
sec.set_importing (+1);
for (unsigned ix = 0; ix != size; ix++)
{
depset *b = scc[ix];
for (unsigned jx = (b->get_entity_kind () == depset::EK_BINDING
|| b->is_special ()) ? 1 : 0;
jx != b->deps.length (); jx++)
{
depset *dep = b->deps[jx];
if (dep->is_binding ())
{
for (unsigned ix = dep->deps.length (); --ix;)
{
depset *bind = dep->deps[ix];
if (bind->get_entity_kind () == depset::EK_USING)
bind = bind->deps[1];
intercluster_seed (sec, index_lwm, bind);
}
/* Also check the namespace itself. */
dep = dep->deps[0];
}
intercluster_seed (sec, index_lwm, dep);
}
}
sec.tree_node (NULL_TREE);
/* We're done importing now. */
sec.set_importing (-1);
/* Write non-definitions. */
for (unsigned ix = 0; ix != size; ix++)
{
depset *b = scc[ix];
tree decl = b->get_entity ();
switch (b->get_entity_kind ())
{
default:
gcc_unreachable ();
break;
case depset::EK_BINDING:
{
gcc_assert (TREE_CODE (decl) == NAMESPACE_DECL);
dump () && dump ("Depset:%u binding %C:%P", ix, TREE_CODE (decl),
decl, b->get_name ());
sec.u (ct_bind);
sec.tree_node (decl);
sec.tree_node (b->get_name ());
/* Write in reverse order, so reading will see the exports
first, thus building the overload chain will be
optimized. */
for (unsigned jx = b->deps.length (); --jx;)
{
depset *dep = b->deps[jx];
tree bound = dep->get_entity ();
unsigned flags = 0;
if (dep->get_entity_kind () == depset::EK_USING)
{
tree ovl = bound;
bound = OVL_FUNCTION (bound);
if (!(TREE_CODE (bound) == CONST_DECL
&& UNSCOPED_ENUM_P (TREE_TYPE (bound))
&& decl == TYPE_NAME (TREE_TYPE (bound))))
{
/* An unscope enumerator in its enumeration's
scope is not a using. */
flags |= cbf_using;
if (OVL_USING_P (ovl))
flags |= cbf_wrapped;
}
if (OVL_EXPORT_P (ovl))
flags |= cbf_export;
}
else
{
/* An implicit typedef must be at one. */
gcc_assert (!DECL_IMPLICIT_TYPEDEF_P (bound) || jx == 1);
if (dep->is_hidden ())
flags |= cbf_hidden;
else if (DECL_MODULE_EXPORT_P (STRIP_TEMPLATE (bound)))
flags |= cbf_export;
}
gcc_checking_assert (DECL_P (bound));
sec.i (flags);
sec.tree_node (bound);
}
/* Terminate the list. */
sec.i (-1);
}
break;
case depset::EK_USING:
dump () && dump ("Depset:%u %s %C:%N", ix, b->entity_kind_name (),
TREE_CODE (decl), decl);
break;
case depset::EK_SPECIALIZATION:
case depset::EK_PARTIAL:
case depset::EK_DECL:
dump () && dump ("Depset:%u %s entity:%u %C:%N", ix,
b->entity_kind_name (), b->cluster,
TREE_CODE (decl), decl);
sec.u (ct_decl);
sec.tree_node (decl);
dump () && dump ("Wrote declaration entity:%u %C:%N",
b->cluster, TREE_CODE (decl), decl);
break;
}
}
depset *namer = NULL;
/* Write out definitions */
for (unsigned ix = 0; ix != size; ix++)
{
depset *b = scc[ix];
tree decl = b->get_entity ();
switch (b->get_entity_kind ())
{
default:
break;
case depset::EK_SPECIALIZATION:
case depset::EK_PARTIAL:
case depset::EK_DECL:
if (!namer)
namer = b;
if (b->has_defn ())
{
sec.u (ct_defn);
sec.tree_node (decl);
dump () && dump ("Writing definition %N", decl);
sec.write_definition (decl);
if (!namer->has_defn ())
namer = b;
}
break;
}
}
/* We don't find the section by name. Use depset's decl's name for
human friendliness. */
unsigned name = 0;
tree naming_decl = NULL_TREE;
if (namer)
{
naming_decl = namer->get_entity ();
if (namer->get_entity_kind () == depset::EK_USING)
/* This unfortunately names the section from the target of the
using decl. But the name is only a guide, so Do Not Care. */
naming_decl = OVL_FUNCTION (naming_decl);
if (DECL_IMPLICIT_TYPEDEF_P (naming_decl))
/* Lose any anonymousness. */
naming_decl = TYPE_NAME (TREE_TYPE (naming_decl));
name = to->qualified_name (naming_decl, namer->has_defn ());
}
unsigned bytes = sec.pos;
unsigned snum = sec.end (to, name, crc_ptr);
for (unsigned ix = size; ix--;)
gcc_checking_assert (scc[ix]->section == snum);
dump.outdent ();
dump () && dump ("Wrote section:%u named-by:%N", table.section, naming_decl);
return bytes;
}
/* Read a cluster from section SNUM. */
bool
module_state::read_cluster (unsigned snum)
{
trees_in sec (this);
if (!sec.begin (loc, from (), snum))
return false;
dump () && dump ("Reading section:%u", snum);
dump.indent ();
/* We care about structural equality. */
comparing_dependent_aliases++;
/* First seed the imports. */
while (tree import = sec.tree_node ())
dump (dumper::CLUSTER) && dump ("Seeded import %N", import);
while (!sec.get_overrun () && sec.more_p ())
{
unsigned ct = sec.u ();
switch (ct)
{
default:
sec.set_overrun ();
break;
case ct_bind:
/* A set of namespace bindings. */
{
tree ns = sec.tree_node ();
tree name = sec.tree_node ();
tree decls = NULL_TREE;
tree visible = NULL_TREE;
tree type = NULL_TREE;
bool dedup = false;
/* We rely on the bindings being in the reverse order of
the resulting overload set. */
for (;;)
{
int flags = sec.i ();
if (flags < 0)
break;
if ((flags & cbf_hidden)
&& (flags & (cbf_using | cbf_export)))
sec.set_overrun ();
tree decl = sec.tree_node ();
if (sec.get_overrun ())
break;
if (decls && TREE_CODE (decl) == TYPE_DECL)
{
/* Stat hack. */
if (type || !DECL_IMPLICIT_TYPEDEF_P (decl))
sec.set_overrun ();
type = decl;
}
else
{
if (decls
|| (flags & (cbf_hidden | cbf_wrapped))
|| DECL_FUNCTION_TEMPLATE_P (decl))
{
decls = ovl_make (decl, decls);
if (flags & cbf_using)
{
dedup = true;
OVL_USING_P (decls) = true;
if (flags & cbf_export)
OVL_EXPORT_P (decls) = true;
}
if (flags & cbf_hidden)
OVL_HIDDEN_P (decls) = true;
else if (dedup)
OVL_DEDUP_P (decls) = true;
}
else
decls = decl;
if (flags & cbf_export
|| (!(flags & cbf_hidden)
&& (is_module () || is_partition ())))
visible = decls;
}
}
if (!decls)
sec.set_overrun ();
if (sec.get_overrun ())
break; /* Bail. */
dump () && dump ("Binding of %P", ns, name);
if (!set_module_binding (ns, name, mod,
is_header () ? -1
: is_module () || is_partition () ? 1
: 0,
decls, type, visible))
sec.set_overrun ();
}
break;
case ct_decl:
/* A decl. */
{
tree decl = sec.tree_node ();
dump () && dump ("Read declaration of %N", decl);
}
break;
case ct_defn:
{
tree decl = sec.tree_node ();
dump () && dump ("Reading definition of %N", decl);
sec.read_definition (decl);
}
break;
}
}
/* When lazy loading is in effect, we can be in the middle of
parsing or instantiating a function. Save it away.
push_function_context does too much work. */
tree old_cfd = current_function_decl;
struct function *old_cfun = cfun;
while (tree decl = sec.post_process ())
{
bool abstract = false;
if (TREE_CODE (decl) == TEMPLATE_DECL)
{
abstract = true;
decl = DECL_TEMPLATE_RESULT (decl);
}
current_function_decl = decl;
allocate_struct_function (decl, abstract);
cfun->language = ggc_cleared_alloc<language_function> ();
cfun->language->base.x_stmt_tree.stmts_are_full_exprs_p = 1;
if (abstract)
;
else if (DECL_ABSTRACT_P (decl))
vec_safe_push (post_load_decls, decl);
else
{
bool aggr = aggregate_value_p (DECL_RESULT (decl), decl);
#ifdef PCC_STATIC_STRUCT_RETURN
cfun->returns_pcc_struct = aggr;
#endif
cfun->returns_struct = aggr;
if (DECL_COMDAT (decl))
// FIXME: Comdat grouping?
comdat_linkage (decl);
note_vague_linkage_fn (decl);
cgraph_node::finalize_function (decl, true);
}
}
/* Look, function.cc's interface to cfun does too much for us, we
just need to restore the old value. I do not want to go
redesigning that API right now. */
#undef cfun
cfun = old_cfun;
current_function_decl = old_cfd;
comparing_dependent_aliases--;
dump.outdent ();
dump () && dump ("Read section:%u", snum);
loaded_clusters++;
if (!sec.end (from ()))
return false;
return true;
}
void
module_state::write_namespace (bytes_out &sec, depset *dep)
{
unsigned ns_num = dep->cluster;
unsigned ns_import = 0;
if (dep->is_import ())
ns_import = dep->section;
else if (dep->get_entity () != global_namespace)
ns_num++;
sec.u (ns_import);
sec.u (ns_num);
}
tree
module_state::read_namespace (bytes_in &sec)
{
unsigned ns_import = sec.u ();
unsigned ns_num = sec.u ();
tree ns = NULL_TREE;
if (ns_import || ns_num)
{
if (!ns_import)
ns_num--;
if (unsigned origin = slurp->remap_module (ns_import))
{
module_state *from = (*modules)[origin];
if (ns_num < from->entity_num)
{
binding_slot &slot = (*entity_ary)[from->entity_lwm + ns_num];
if (!slot.is_lazy ())
ns = slot;
}
}
else
sec.set_overrun ();
}
else
ns = global_namespace;
return ns;
}
/* SPACES is a sorted vector of namespaces. Write out the namespaces
to MOD_SNAME_PFX.nms section. */
void
module_state::write_namespaces (elf_out *to, vec<depset *> spaces,
unsigned num, unsigned *crc_p)
{
dump () && dump ("Writing namespaces");
dump.indent ();
bytes_out sec (to);
sec.begin ();
for (unsigned ix = 0; ix != num; ix++)
{
depset *b = spaces[ix];
tree ns = b->get_entity ();
gcc_checking_assert (TREE_CODE (ns) == NAMESPACE_DECL);
/* P1815 may have something to say about this. */
gcc_checking_assert (TREE_PUBLIC (ns));
unsigned flags = 0;
if (TREE_PUBLIC (ns))
flags |= 1;
if (DECL_NAMESPACE_INLINE_P (ns))
flags |= 2;
if (DECL_MODULE_PURVIEW_P (ns))
flags |= 4;
if (DECL_MODULE_EXPORT_P (ns))
flags |= 8;
dump () && dump ("Writing namespace:%u %N%s%s%s%s",
b->cluster, ns,
flags & 1 ? ", public" : "",
flags & 2 ? ", inline" : "",
flags & 4 ? ", purview" : "",
flags & 8 ? ", export" : "");
sec.u (b->cluster);
sec.u (to->name (DECL_NAME (ns)));
write_namespace (sec, b->deps[0]);
sec.u (flags);
write_location (sec, DECL_SOURCE_LOCATION (ns));
}
sec.end (to, to->name (MOD_SNAME_PFX ".nms"), crc_p);
dump.outdent ();
}
/* Read the namespace hierarchy from MOD_SNAME_PFX.namespace. Fill in
SPACES from that data. */
bool
module_state::read_namespaces (unsigned num)
{
bytes_in sec;
if (!sec.begin (loc, from (), MOD_SNAME_PFX ".nms"))
return false;
dump () && dump ("Reading namespaces");
dump.indent ();
for (unsigned ix = 0; ix != num; ix++)
{
unsigned entity_index = sec.u ();
unsigned name = sec.u ();
tree parent = read_namespace (sec);
/* See comment in write_namespace about why not bits. */
unsigned flags = sec.u ();
location_t src_loc = read_location (sec);
if (entity_index >= entity_num
|| !parent
|| (flags & 0xc) == 0x8)
sec.set_overrun ();
if (sec.get_overrun ())
break;
tree id = name ? get_identifier (from ()->name (name)) : NULL_TREE;
dump () && dump ("Read namespace:%u %P%s%s%s%s",
entity_index, parent, id,
flags & 1 ? ", public" : "",
flags & 2 ? ", inline" : "",
flags & 4 ? ", purview" : "",
flags & 8 ? ", export" : "");
bool visible_p = ((flags & 8)
|| ((flags & 1)
&& (flags & 4)
&& (is_partition () || is_module ())));
tree inner = add_imported_namespace (parent, id, src_loc, mod,
bool (flags & 2), visible_p);
if (!inner)
{
sec.set_overrun ();
break;
}
if (is_partition ())
{
if (flags & 4)
DECL_MODULE_PURVIEW_P (inner) = true;
if (flags & 8)
DECL_MODULE_EXPORT_P (inner) = true;
}
/* Install the namespace. */
(*entity_ary)[entity_lwm + entity_index] = inner;
if (DECL_MODULE_IMPORT_P (inner))
{
bool existed;
unsigned *slot = &entity_map->get_or_insert
(DECL_UID (inner), &existed);
if (existed)
/* If it existed, it should match. */
gcc_checking_assert (inner == (*entity_ary)[*slot]);
else
*slot = entity_lwm + entity_index;
}
}
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
/* Write the binding TABLE to MOD_SNAME_PFX.bnd */
unsigned
module_state::write_bindings (elf_out *to, vec<depset *> sccs, unsigned *crc_p)
{
dump () && dump ("Writing binding table");
dump.indent ();
unsigned num = 0;
bytes_out sec (to);
sec.begin ();
for (unsigned ix = 0; ix != sccs.length (); ix++)
{
depset *b = sccs[ix];
if (b->is_binding ())
{
tree ns = b->get_entity ();
dump () && dump ("Bindings %P section:%u", ns, b->get_name (),
b->section);
sec.u (to->name (b->get_name ()));
write_namespace (sec, b->deps[0]);
sec.u (b->section);
num++;
}
}
sec.end (to, to->name (MOD_SNAME_PFX ".bnd"), crc_p);
dump.outdent ();
return num;
}
/* Read the binding table from MOD_SNAME_PFX.bind. */
bool
module_state::read_bindings (unsigned num, unsigned lwm, unsigned hwm)
{
bytes_in sec;
if (!sec.begin (loc, from (), MOD_SNAME_PFX ".bnd"))
return false;
dump () && dump ("Reading binding table");
dump.indent ();
for (; !sec.get_overrun () && num--;)
{
const char *name = from ()->name (sec.u ());
tree ns = read_namespace (sec);
unsigned snum = sec.u ();
if (!ns || !name || (snum - lwm) >= (hwm - lwm))
sec.set_overrun ();
if (!sec.get_overrun ())
{
tree id = get_identifier (name);
dump () && dump ("Bindings %P section:%u", ns, id, snum);
if (mod && !import_module_binding (ns, id, mod, snum))
break;
}
}
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
/* Write the entity table to MOD_SNAME_PFX.ent
Each entry is a section number. */
void
module_state::write_entities (elf_out *to, vec<depset *> depsets,
unsigned count, unsigned *crc_p)
{
dump () && dump ("Writing entities");
dump.indent ();
bytes_out sec (to);
sec.begin ();
unsigned current = 0;
for (unsigned ix = 0; ix < depsets.length (); ix++)
{
depset *d = depsets[ix];
switch (d->get_entity_kind ())
{
default:
break;
case depset::EK_NAMESPACE:
if (!d->is_import () && d->get_entity () != global_namespace)
{
gcc_checking_assert (d->cluster == current);
current++;
sec.u (0);
}
break;
case depset::EK_DECL:
case depset::EK_SPECIALIZATION:
case depset::EK_PARTIAL:
gcc_checking_assert (!d->is_unreached ()
&& !d->is_import ()
&& d->cluster == current
&& d->section);
current++;
sec.u (d->section);
break;
}
}
gcc_assert (count == current);
sec.end (to, to->name (MOD_SNAME_PFX ".ent"), crc_p);
dump.outdent ();
}
bool
module_state::read_entities (unsigned count, unsigned lwm, unsigned hwm)
{
trees_in sec (this);
if (!sec.begin (loc, from (), MOD_SNAME_PFX ".ent"))
return false;
dump () && dump ("Reading entities");
dump.indent ();
for (binding_slot *slot = entity_ary->begin () + entity_lwm; count--; slot++)
{
unsigned snum = sec.u ();
if (snum && (snum - lwm) >= (hwm - lwm))
sec.set_overrun ();
if (sec.get_overrun ())
break;
if (snum)
slot->set_lazy (snum << 2);
}
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
/* Write the pending table to MOD_SNAME_PFX.pnd
The pending table holds information about clusters that need to be
loaded because they contain information about something that is not
found by namespace-scope lookup.
The three cases are:
(a) Template (maybe-partial) specializations that we have
instantiated or defined. When an importer needs to instantiate
that template, they /must have/ the partial, explicit & extern
specializations available. If they have the other specializations
available, they'll have less work to do. Thus, when we're about to
instantiate FOO, we have to be able to ask 'are there any
specialization of FOO in our imports?'.
(b) (Maybe-implicit) member functions definitions. A class could
be defined in one header, and an inline member defined in a
different header (this occurs in the STL). Similarly, like the
specialization case, an implicit member function could have been
'instantiated' in one module, and it'd be nice to not have to
reinstantiate it in another.
(c) A member classes completed elsewhere. A member class could be
declared in one header and defined in another. We need to know to
load the class definition before looking in it. This turns out to
be a specific case of #b, so we can treat these the same. But it
does highlight an issue -- there could be an intermediate import
between the outermost containing namespace-scope class and the
innermost being-defined member class. This is actually possible
with all of these cases, so be aware -- we're not just talking of
one level of import to get to the innermost namespace.
This gets complicated fast, it took me multiple attempts to even
get something remotely working. Partially because I focussed on
optimizing what I think turns out to be a smaller problem, given
the known need to do the more general case *anyway*. I document
the smaller problem, because it does appear to be the natural way
to do it. It's trap!
**** THE TRAP
Let's refer to the primary template or the containing class as the
KEY. And the specialization or member as the PENDING-ENTITY. (To
avoid having to say those mouthfuls all the time.)
In either case, we have an entity and we need some way of mapping
that to a set of entities that need to be loaded before we can
proceed with whatever processing of the entity we were going to do.
We need to link the key to the pending-entity in some way. Given a
key, tell me the pending-entities I need to have loaded. However
we tie the key to the pending-entity must not rely on the key being
loaded -- that'd defeat the lazy loading scheme.
As the key will be an import in we know its entity number (either
because we imported it, or we're writing it out too). Thus we can
generate a map of key-indices to pending-entities. The
pending-entity indices will be into our span of the entity table,
and thus allow them to be lazily loaded. The key index will be
into another slot of the entity table. Notice that this checking
could be expensive, we don't want to iterate over a bunch of
pending-entity indices (across multiple imports), every time we're
about do to the thing with the key. We need to quickly determine
'definitely nothing needed'.
That's almost good enough, except that key indices are not unique
in a couple of cases :( Specifically the Global Module or a module
partition can result in multiple modules assigning an entity index
for the key. The decl-merging on loading will detect that so we
only have one Key loaded, and in the entity hash it'll indicate the
entity index of first load. Which might be different to how we
know it. Notice this is restricted to GM entities or this-module
entities. Foreign imports cannot have this.
We can simply resolve this in the direction of how this module
referred to the key to how the importer knows it. Look in the
entity table slot that we nominate, maybe lazy load it, and then
lookup the resultant entity in the entity hash to learn how the
importer knows it.
But we need to go in the other direction :( Given the key, find all
the index-aliases of that key. We can partially solve that by
adding an alias hash table. Whenever we load a merged decl, add or
augment a mapping from the entity (or its entity-index) to the
newly-discovered index. Then when we look for pending entities of
a key, we also iterate over this aliases this mapping provides.
But that requires the alias to be loaded. And that's not
necessarily true.
*** THE SIMPLER WAY
The remaining fixed thing we have is the innermost namespace
containing the ultimate namespace-scope container of the key and
the name of that container (which might be the key itself). I.e. a
namespace-decl/identifier/module tuple. Let's call this the
top-key. We'll discover that the module is not important here,
because of cross-module possibilities mentioned in case #c above.
We can't markup namespace-binding slots. The best we can do is
mark the binding vector with 'there's something here', and have
another map from namespace/identifier pairs to a vector of pending
entity indices.
Maintain a pending-entity map. This is keyed by top-key, and
maps to a vector of pending-entity indices. On the binding vector
have flags saying whether the pending-name-entity map has contents.
(We might want to further extend the key to be GM-vs-Partition and
specialization-vs-member, but let's not get ahead of ourselves.)
For every key-like entity, find the outermost namespace-scope
name. Use that to lookup in the pending-entity map and then make
sure the specified entities are loaded.
An optimization might be to have a flag in each key-entity saying
that its top key might be in the entity table. It's not clear to
me how to set that flag cheaply -- cheaper than just looking.
FIXME: It'd be nice to have a bit in decls to tell us whether to
even try this. We can have a 'already done' flag, that we set when
we've done KLASS's lazy pendings. When we import a module that
registers pendings on the same top-key as KLASS we need to clear
the flag. A recursive walk of the top-key clearing the bit will
suffice. Plus we only need to recurse on classes that have the bit
set. (That means we need to set the bit on parents of KLASS here,
don't forget.) However, first: correctness, second: efficiency. */
unsigned
module_state::write_pendings (elf_out *to, vec<depset *> depsets,
depset::hash &table, unsigned *crc_p)
{
dump () && dump ("Writing pending-entities");
dump.indent ();
trees_out sec (to, this, table);
sec.begin ();
unsigned count = 0;
tree cache_ns = NULL_TREE;
tree cache_id = NULL_TREE;
unsigned cache_section = ~0;
for (unsigned ix = 0; ix < depsets.length (); ix++)
{
depset *d = depsets[ix];
if (d->is_binding ())
continue;
if (d->is_import ())
continue;
if (!(d->get_entity_kind () == depset::EK_SPECIALIZATION
|| d->get_entity_kind () == depset::EK_PARTIAL
|| (d->get_entity_kind () == depset::EK_DECL && d->is_member ())))
continue;
tree key_decl = nullptr;
tree key_ns = find_pending_key (d->get_entity (), &key_decl);
tree key_name = DECL_NAME (key_decl);
if (IDENTIFIER_ANON_P (key_name))
{
gcc_checking_assert (IDENTIFIER_LAMBDA_P (key_name));
if (tree attached = LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (key_decl)))
key_name = DECL_NAME (attached);
else
{
/* There's nothing to attach it to. Must
always reinstantiate. */
dump ()
&& dump ("Unattached lambda %N[%u] section:%u",
d->get_entity_kind () == depset::EK_DECL
? "Member" : "Specialization", d->get_entity (),
d->cluster, d->section);
continue;
}
}
char const *also = "";
if (d->section == cache_section
&& key_ns == cache_ns
&& key_name == cache_id)
/* Same section & key as previous, no need to repeat ourselves. */
also = "also ";
else
{
cache_ns = key_ns;
cache_id = key_name;
cache_section = d->section;
gcc_checking_assert (table.find_dependency (cache_ns));
sec.tree_node (cache_ns);
sec.tree_node (cache_id);
sec.u (d->cluster);
count++;
}
dump () && dump ("Pending %s %N entity:%u section:%u %skeyed to %P",
d->get_entity_kind () == depset::EK_DECL
? "member" : "specialization", d->get_entity (),
d->cluster, cache_section, also, cache_ns, cache_id);
}
sec.end (to, to->name (MOD_SNAME_PFX ".pnd"), crc_p);
dump.outdent ();
return count;
}
bool
module_state::read_pendings (unsigned count)
{
trees_in sec (this);
if (!sec.begin (loc, from (), MOD_SNAME_PFX ".pnd"))
return false;
dump () && dump ("Reading %u pendings", count);
dump.indent ();
for (unsigned ix = 0; ix != count; ix++)
{
pending_key key;
unsigned index;
key.ns = sec.tree_node ();
key.id = sec.tree_node ();
index = sec.u ();
if (!key.ns || !key.id
|| !(TREE_CODE (key.ns) == NAMESPACE_DECL
&& !DECL_NAMESPACE_ALIAS (key.ns))
|| !identifier_p (key.id)
|| index >= entity_num)
sec.set_overrun ();
if (sec.get_overrun ())
break;
dump () && dump ("Pending:%u keyed to %P", index, key.ns, key.id);
index += entity_lwm;
auto &vec = pending_table->get_or_insert (key);
vec.safe_push (index);
}
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
/* Read & write locations. */
enum loc_kind {
LK_ORDINARY,
LK_MACRO,
LK_IMPORT_ORDINARY,
LK_IMPORT_MACRO,
LK_ADHOC,
LK_RESERVED,
};
static const module_state *
module_for_ordinary_loc (location_t loc)
{
unsigned pos = 0;
unsigned len = ool->length () - pos;
while (len)
{
unsigned half = len / 2;
module_state *probe = (*ool)[pos + half];
if (loc < probe->ordinary_locs.first)
len = half;
else if (loc < probe->ordinary_locs.first + probe->ordinary_locs.second)
return probe;
else
{
pos += half + 1;
len = len - (half + 1);
}
}
return nullptr;
}
static const module_state *
module_for_macro_loc (location_t loc)
{
unsigned pos = 1;
unsigned len = modules->length () - pos;
while (len)
{
unsigned half = len / 2;
module_state *probe = (*modules)[pos + half];
if (loc < probe->macro_locs.first)
{
pos += half + 1;
len = len - (half + 1);
}
else if (loc >= probe->macro_locs.first + probe->macro_locs.second)
len = half;
else
return probe;
}
return NULL;
}
location_t
module_state::imported_from () const
{
location_t from = loc;
line_map_ordinary const *fmap
= linemap_check_ordinary (linemap_lookup (line_table, from));
if (MAP_MODULE_P (fmap))
from = linemap_included_from (fmap);
return from;
}
/* Note that LOC will need writing. This allows us to prune locations
that are not needed. */
bool
module_state::note_location (location_t loc)
{
bool added = false;
if (!macro_loc_table && !ord_loc_table)
;
else if (loc < RESERVED_LOCATION_COUNT)
;
else if (IS_ADHOC_LOC (loc))
{
location_t locus = get_location_from_adhoc_loc (line_table, loc);
note_location (locus);
source_range range = get_range_from_loc (line_table, loc);
if (range.m_start != locus)
note_location (range.m_start);
note_location (range.m_finish);
}
else if (loc >= LINEMAPS_MACRO_LOWEST_LOCATION (line_table))
{
if (spans.macro (loc))
{
const line_map *map = linemap_lookup (line_table, loc);
const line_map_macro *mac_map = linemap_check_macro (map);
hashval_t hv = macro_loc_traits::hash (mac_map);
macro_loc_info *slot
= macro_loc_table->find_slot_with_hash (mac_map, hv, INSERT);
if (!slot->src)
{
slot->src = mac_map;
slot->remap = 0;
// Expansion locations could themselves be from a
// macro, we need to note them all.
note_location (mac_map->expansion);
gcc_checking_assert (mac_map->n_tokens);
location_t tloc = UNKNOWN_LOCATION;
for (unsigned ix = mac_map->n_tokens * 2; ix--;)
if (mac_map->macro_locations[ix] != tloc)
{
tloc = mac_map->macro_locations[ix];
note_location (tloc);
}
added = true;
}
}
}
else if (IS_ORDINARY_LOC (loc))
{
if (spans.ordinary (loc))
{
const line_map *map = linemap_lookup (line_table, loc);
const line_map_ordinary *ord_map = linemap_check_ordinary (map);
ord_loc_info lkup;
lkup.src = ord_map;
lkup.span = 1 << ord_map->m_column_and_range_bits;
lkup.offset = (loc - MAP_START_LOCATION (ord_map)) & ~(lkup.span - 1);
lkup.remap = 0;
ord_loc_info *slot = (ord_loc_table->find_slot_with_hash
(lkup, ord_loc_traits::hash (lkup), INSERT));
if (!slot->src)
{
*slot = lkup;
added = true;
}
}
}
else
gcc_unreachable ();
return added;
}
/* If we're not streaming, record that we need location LOC.
Otherwise stream it. */
void
module_state::write_location (bytes_out &sec, location_t loc)
{
if (!sec.streaming_p ())
{
note_location (loc);
return;
}
if (loc < RESERVED_LOCATION_COUNT)
{
dump (dumper::LOCATION) && dump ("Reserved location %u", unsigned (loc));
sec.u (LK_RESERVED + loc);
}
else if (IS_ADHOC_LOC (loc))
{
dump (dumper::LOCATION) && dump ("Adhoc location");
sec.u (LK_ADHOC);
location_t locus = get_location_from_adhoc_loc (line_table, loc);
write_location (sec, locus);
source_range range = get_range_from_loc (line_table, loc);
if (range.m_start == locus)
/* Compress. */
range.m_start = UNKNOWN_LOCATION;
write_location (sec, range.m_start);
write_location (sec, range.m_finish);
unsigned discriminator = get_discriminator_from_adhoc_loc (line_table, loc);
sec.u (discriminator);
}
else if (loc >= LINEMAPS_MACRO_LOWEST_LOCATION (line_table))
{
const macro_loc_info *info = nullptr;
unsigned offset = 0;
if (unsigned hwm = macro_loc_remap->length ())
{
info = macro_loc_remap->begin ();
while (hwm != 1)
{
unsigned mid = hwm / 2;
if (MAP_START_LOCATION (info[mid].src) <= loc)
{
info += mid;
hwm -= mid;
}
else
hwm = mid;
}
offset = loc - MAP_START_LOCATION (info->src);
if (offset > info->src->n_tokens)
info = nullptr;
}
gcc_checking_assert (bool (info) == bool (spans.macro (loc)));
if (info)
{
offset += info->remap;
sec.u (LK_MACRO);
sec.u (offset);
dump (dumper::LOCATION)
&& dump ("Macro location %u output %u", loc, offset);
}
else if (const module_state *import = module_for_macro_loc (loc))
{
unsigned off = loc - import->macro_locs.first;
sec.u (LK_IMPORT_MACRO);
sec.u (import->remap);
sec.u (off);
dump (dumper::LOCATION)
&& dump ("Imported macro location %u output %u:%u",
loc, import->remap, off);
}
else
gcc_unreachable ();
}
else if (IS_ORDINARY_LOC (loc))
{
const ord_loc_info *info = nullptr;
unsigned offset = 0;
if (unsigned hwm = ord_loc_remap->length ())
{
info = ord_loc_remap->begin ();
while (hwm != 1)
{
unsigned mid = hwm / 2;
if (MAP_START_LOCATION (info[mid].src) + info[mid].offset <= loc)
{
info += mid;
hwm -= mid;
}
else
hwm = mid;
}
offset = loc - MAP_START_LOCATION (info->src) - info->offset;
if (offset > info->span)
info = nullptr;
}
gcc_checking_assert (bool (info) == bool (spans.ordinary (loc)));
if (info)
{
offset += info->remap;
sec.u (LK_ORDINARY);
sec.u (offset);
dump (dumper::LOCATION)
&& dump ("Ordinary location %u output %u", loc, offset);
}
else if (const module_state *import = module_for_ordinary_loc (loc))
{
unsigned off = loc - import->ordinary_locs.first;
sec.u (LK_IMPORT_ORDINARY);
sec.u (import->remap);
sec.u (off);
dump (dumper::LOCATION)
&& dump ("Imported ordinary location %u output %u:%u",
import->remap, import->remap, off);
}
else
gcc_unreachable ();
}
else
gcc_unreachable ();
}
location_t
module_state::read_location (bytes_in &sec) const
{
location_t locus = UNKNOWN_LOCATION;
unsigned kind = sec.u ();
switch (kind)
{
default:
{
if (kind < LK_RESERVED + RESERVED_LOCATION_COUNT)
locus = location_t (kind - LK_RESERVED);
else
sec.set_overrun ();
dump (dumper::LOCATION)
&& dump ("Reserved location %u", unsigned (locus));
}
break;
case LK_ADHOC:
{
dump (dumper::LOCATION) && dump ("Adhoc location");
locus = read_location (sec);
source_range range;
range.m_start = read_location (sec);
if (range.m_start == UNKNOWN_LOCATION)
range.m_start = locus;
range.m_finish = read_location (sec);
unsigned discriminator = sec.u ();
if (locus != loc && range.m_start != loc && range.m_finish != loc)
locus = get_combined_adhoc_loc (line_table, locus, range, NULL, discriminator);
}
break;
case LK_MACRO:
{
unsigned off = sec.u ();
if (macro_locs.second)
{
if (off < macro_locs.second)
locus = off + macro_locs.first;
else
sec.set_overrun ();
}
else
locus = loc;
dump (dumper::LOCATION)
&& dump ("Macro %u becoming %u", off, locus);
}
break;
case LK_ORDINARY:
{
unsigned off = sec.u ();
if (ordinary_locs.second)
{
if (off < ordinary_locs.second)
locus = off + ordinary_locs.first;
else
sec.set_overrun ();
}
else
locus = loc;
dump (dumper::LOCATION)
&& dump ("Ordinary location %u becoming %u", off, locus);
}
break;
case LK_IMPORT_MACRO:
case LK_IMPORT_ORDINARY:
{
unsigned mod = sec.u ();
unsigned off = sec.u ();
const module_state *import = NULL;
if (!mod && !slurp->remap)
/* This is an early read of a partition location during the
read of our ordinary location map. */
import = this;
else
{
mod = slurp->remap_module (mod);
if (!mod)
sec.set_overrun ();
else
import = (*modules)[mod];
}
if (import)
{
if (kind == LK_IMPORT_MACRO)
{
if (!import->macro_locs.second)
locus = import->loc;
else if (off < import->macro_locs.second)
locus = off + import->macro_locs.first;
else
sec.set_overrun ();
}
else
{
if (!import->ordinary_locs.second)
locus = import->loc;
else if (off < import->ordinary_locs.second)
locus = import->ordinary_locs.first + off;
else
sec.set_overrun ();
}
}
}
break;
}
return locus;
}
/* Allocate hash tables to record needed locations. */
void
module_state::write_init_maps ()
{
macro_loc_table = new hash_table<macro_loc_traits> (EXPERIMENT (1, 400));
ord_loc_table = new hash_table<ord_loc_traits> (EXPERIMENT (1, 400));
}
/* Prepare the span adjustments. We prune unneeded locations -- at
this point every needed location must have been seen by
note_location. */
range_t
module_state::write_prepare_maps (module_state_config *cfg, bool has_partitions)
{
dump () && dump ("Preparing locations");
dump.indent ();
dump () && dump ("Reserved locations [%u,%u) macro [%u,%u)",
spans[loc_spans::SPAN_RESERVED].ordinary.first,
spans[loc_spans::SPAN_RESERVED].ordinary.second,
spans[loc_spans::SPAN_RESERVED].macro.first,
spans[loc_spans::SPAN_RESERVED].macro.second);
range_t info {0, 0};
// Sort the noted lines.
vec_alloc (ord_loc_remap, ord_loc_table->size ());
for (auto iter = ord_loc_table->begin (), end = ord_loc_table->end ();
iter != end; ++iter)
ord_loc_remap->quick_push (*iter);
ord_loc_remap->qsort (&ord_loc_info::compare);
// Note included-from maps.
bool added = false;
const line_map_ordinary *current = nullptr;
for (auto iter = ord_loc_remap->begin (), end = ord_loc_remap->end ();
iter != end; ++iter)
if (iter->src != current)
{
current = iter->src;
for (auto probe = current;
auto from = linemap_included_from (probe);
probe = linemap_check_ordinary (linemap_lookup (line_table, from)))
{
if (has_partitions)
{
// Partition locations need to elide their module map
// entry.
probe
= linemap_check_ordinary (linemap_lookup (line_table, from));
if (MAP_MODULE_P (probe))
from = linemap_included_from (probe);
}
if (!note_location (from))
break;
added = true;
}
}
if (added)
{
// Reconstruct the line array as we added items to the hash table.
vec_free (ord_loc_remap);
vec_alloc (ord_loc_remap, ord_loc_table->size ());
for (auto iter = ord_loc_table->begin (), end = ord_loc_table->end ();
iter != end; ++iter)
ord_loc_remap->quick_push (*iter);
ord_loc_remap->qsort (&ord_loc_info::compare);
}
delete ord_loc_table;
ord_loc_table = nullptr;
// Merge (sufficiently) adjacent spans, and calculate remapping.
constexpr unsigned adjacency = 2; // Allow 2 missing lines.
auto begin = ord_loc_remap->begin (), end = ord_loc_remap->end ();
auto dst = begin;
unsigned offset = 0, range_bits = 0;
ord_loc_info *base = nullptr;
for (auto iter = begin; iter != end; ++iter)
{
if (base && iter->src == base->src)
{
if (base->offset + base->span +
((adjacency << base->src->m_column_and_range_bits)
// If there are few c&r bits, allow further separation.
| (adjacency << 4))
>= iter->offset)
{
// Merge.
offset -= base->span;
base->span = iter->offset + iter->span - base->offset;
offset += base->span;
continue;
}
}
else if (range_bits < iter->src->m_range_bits)
range_bits = iter->src->m_range_bits;
offset += ((1u << iter->src->m_range_bits) - 1);
offset &= ~((1u << iter->src->m_range_bits) - 1);
iter->remap = offset;
offset += iter->span;
base = dst;
*dst++ = *iter;
}
ord_loc_remap->truncate (dst - begin);
info.first = ord_loc_remap->length ();
cfg->ordinary_locs = offset;
cfg->loc_range_bits = range_bits;
dump () && dump ("Ordinary maps:%u locs:%u range_bits:%u",
info.first, cfg->ordinary_locs,
cfg->loc_range_bits);
// Remap the macro locations.
vec_alloc (macro_loc_remap, macro_loc_table->size ());
for (auto iter = macro_loc_table->begin (), end = macro_loc_table->end ();
iter != end; ++iter)
macro_loc_remap->quick_push (*iter);
delete macro_loc_table;
macro_loc_table = nullptr;
macro_loc_remap->qsort (¯o_loc_info::compare);
offset = 0;
for (auto iter = macro_loc_remap->begin (), end = macro_loc_remap->end ();
iter != end; ++iter)
{
auto mac = iter->src;
iter->remap = offset;
offset += mac->n_tokens;
}
info.second = macro_loc_remap->length ();
cfg->macro_locs = offset;
dump () && dump ("Macro maps:%u locs:%u", info.second, cfg->macro_locs);
dump.outdent ();
// If we have no ordinary locs, we must also have no macro locs.
gcc_checking_assert (cfg->ordinary_locs || !cfg->macro_locs);
return info;
}
bool
module_state::read_prepare_maps (const module_state_config *cfg)
{
location_t ordinary = line_table->highest_location + 1;
ordinary += cfg->ordinary_locs;
location_t macro = LINEMAPS_MACRO_LOWEST_LOCATION (line_table);
macro -= cfg->macro_locs;
if (ordinary < LINE_MAP_MAX_LOCATION_WITH_COLS
&& macro >= LINE_MAP_MAX_LOCATION)
/* OK, we have enough locations. */
return true;
ordinary_locs.first = ordinary_locs.second = 0;
macro_locs.first = macro_locs.second = 0;
static bool informed = false;
if (!informed)
{
/* Just give the notice once. */
informed = true;
inform (loc, "unable to represent further imported source locations");
}
return false;
}
/* Write & read the location maps. Not called if there are no
locations. */
void
module_state::write_ordinary_maps (elf_out *to, range_t &info,
bool has_partitions, unsigned *crc_p)
{
dump () && dump ("Writing ordinary location maps");
dump.indent ();
vec<const char *> filenames;
filenames.create (20);
/* Determine the unique filenames. */
const line_map_ordinary *current = nullptr;
for (auto iter = ord_loc_remap->begin (), end = ord_loc_remap->end ();
iter != end; ++iter)
if (iter->src != current)
{
current = iter->src;
const char *fname = ORDINARY_MAP_FILE_NAME (iter->src);
/* We should never find a module linemap in an interval. */
gcc_checking_assert (!MAP_MODULE_P (iter->src));
/* We expect very few filenames, so just an array.
(Not true when headers are still in play :() */
for (unsigned jx = filenames.length (); jx--;)
{
const char *name = filenames[jx];
if (0 == strcmp (name, fname))
{
/* Reset the linemap's name, because for things like
preprocessed input we could have multiple instances
of the same name, and we'd rather not percolate
that. */
const_cast<line_map_ordinary *> (iter->src)->to_file = name;
fname = NULL;
break;
}
}
if (fname)
filenames.safe_push (fname);
}
bytes_out sec (to);
sec.begin ();
/* Write the filenames. */
unsigned len = filenames.length ();
sec.u (len);
dump () && dump ("%u source file names", len);
for (unsigned ix = 0; ix != len; ix++)
{
const char *fname = filenames[ix];
dump (dumper::LOCATION) && dump ("Source file[%u]=%s", ix, fname);
sec.str (fname);
}
sec.u (info.first); /* Num maps. */
const ord_loc_info *base = nullptr;
for (auto iter = ord_loc_remap->begin (), end = ord_loc_remap->end ();
iter != end; ++iter)
{
dump (dumper::LOCATION)
&& dump ("Span:%u ordinary [%u+%u,+%u)->[%u,+%u)",
iter - ord_loc_remap->begin (),
MAP_START_LOCATION (iter->src), iter->offset, iter->span,
iter->remap, iter->span);
if (!base || iter->src != base->src)
base = iter;
sec.u (iter->offset - base->offset);
if (base == iter)
{
sec.u (iter->src->sysp);
sec.u (iter->src->m_range_bits);
sec.u (iter->src->m_column_and_range_bits - iter->src->m_range_bits);
const char *fname = ORDINARY_MAP_FILE_NAME (iter->src);
for (unsigned ix = 0; ix != filenames.length (); ix++)
if (filenames[ix] == fname)
{
sec.u (ix);
break;
}
unsigned line = ORDINARY_MAP_STARTING_LINE_NUMBER (iter->src);
line += iter->offset >> iter->src->m_column_and_range_bits;
sec.u (line);
}
sec.u (iter->remap);
if (base == iter)
{
/* Write the included from location, which means reading it
while reading in the ordinary maps. So we'd better not
be getting ahead of ourselves. */
location_t from = linemap_included_from (iter->src);
gcc_checking_assert (from < MAP_START_LOCATION (iter->src));
if (from != UNKNOWN_LOCATION && has_partitions)
{
/* A partition's span will have a from pointing at a
MODULE_INC. Find that map's from. */
line_map_ordinary const *fmap
= linemap_check_ordinary (linemap_lookup (line_table, from));
if (MAP_MODULE_P (fmap))
from = linemap_included_from (fmap);
}
write_location (sec, from);
}
}
filenames.release ();
sec.end (to, to->name (MOD_SNAME_PFX ".olm"), crc_p);
dump.outdent ();
}
void
module_state::write_macro_maps (elf_out *to, range_t &info, unsigned *crc_p)
{
dump () && dump ("Writing macro location maps");
dump.indent ();
bytes_out sec (to);
sec.begin ();
dump () && dump ("Macro maps:%u", info.second);
sec.u (info.second);
unsigned macro_num = 0;
for (auto iter = macro_loc_remap->end (), begin = macro_loc_remap->begin ();
iter-- != begin;)
{
auto mac = iter->src;
sec.u (iter->remap);
sec.u (mac->n_tokens);
sec.cpp_node (mac->macro);
write_location (sec, mac->expansion);
const location_t *locs = mac->macro_locations;
/* There are lots of identical runs. */
location_t prev = UNKNOWN_LOCATION;
unsigned count = 0;
unsigned runs = 0;
for (unsigned jx = mac->n_tokens * 2; jx--;)
{
location_t tok_loc = locs[jx];
if (tok_loc == prev)
{
count++;
continue;
}
runs++;
sec.u (count);
count = 1;
prev = tok_loc;
write_location (sec, tok_loc);
}
sec.u (count);
dump (dumper::LOCATION)
&& dump ("Macro:%u %I %u/%u*2 locations [%u,%u)->%u",
macro_num, identifier (mac->macro),
runs, mac->n_tokens,
MAP_START_LOCATION (mac),
MAP_START_LOCATION (mac) + mac->n_tokens,
iter->remap);
macro_num++;
}
gcc_assert (macro_num == info.second);
sec.end (to, to->name (MOD_SNAME_PFX ".mlm"), crc_p);
dump.outdent ();
}
bool
module_state::read_ordinary_maps (unsigned num_ord_locs, unsigned range_bits)
{
bytes_in sec;
if (!sec.begin (loc, from (), MOD_SNAME_PFX ".olm"))
return false;
dump () && dump ("Reading ordinary location maps");
dump.indent ();
/* Read the filename table. */
unsigned len = sec.u ();
dump () && dump ("%u source file names", len);
vec<const char *> filenames;
filenames.create (len);
for (unsigned ix = 0; ix != len; ix++)
{
size_t l;
const char *buf = sec.str (&l);
char *fname = XNEWVEC (char, l + 1);
memcpy (fname, buf, l + 1);
dump (dumper::LOCATION) && dump ("Source file[%u]=%s", ix, fname);
/* We leak these names into the line-map table. But it
doesn't own them. */
filenames.quick_push (fname);
}
unsigned num_ordinary = sec.u ();
dump () && dump ("Ordinary maps:%u, range_bits:%u", num_ordinary, range_bits);
location_t offset = line_table->highest_location + 1;
offset += ((1u << range_bits) - 1);
offset &= ~((1u << range_bits) - 1);
ordinary_locs.first = offset;
bool propagated = spans.maybe_propagate (this, offset);
line_map_ordinary *maps = static_cast<line_map_ordinary *>
(line_map_new_raw (line_table, false, num_ordinary));
const line_map_ordinary *base = nullptr;
for (unsigned ix = 0; ix != num_ordinary && !sec.get_overrun (); ix++)
{
line_map_ordinary *map = &maps[ix];
unsigned offset = sec.u ();
if (!offset)
{
map->reason = LC_RENAME;
map->sysp = sec.u ();
map->m_range_bits = sec.u ();
map->m_column_and_range_bits = sec.u () + map->m_range_bits;
unsigned fnum = sec.u ();
map->to_file = (fnum < filenames.length () ? filenames[fnum] : "");
map->to_line = sec.u ();
base = map;
}
else
{
*map = *base;
map->to_line += offset >> map->m_column_and_range_bits;
}
unsigned remap = sec.u ();
map->start_location = remap + ordinary_locs.first;
if (base == map)
{
/* Root the outermost map at our location. */
ordinary_locs.second = remap;
location_t from = read_location (sec);
map->included_from = from != UNKNOWN_LOCATION ? from : loc;
}
}
ordinary_locs.second = num_ord_locs;
/* highest_location is the one handed out, not the next one to
hand out. */
line_table->highest_location = ordinary_locs.first + ordinary_locs.second - 1;
if (line_table->highest_location >= LINE_MAP_MAX_LOCATION_WITH_COLS)
/* We shouldn't run out of locations, as we checked before
starting. */
sec.set_overrun ();
dump () && dump ("Ordinary location [%u,+%u)",
ordinary_locs.first, ordinary_locs.second);
if (propagated)
spans.close ();
filenames.release ();
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
bool
module_state::read_macro_maps (unsigned num_macro_locs)
{
bytes_in sec;
if (!sec.begin (loc, from (), MOD_SNAME_PFX ".mlm"))
return false;
dump () && dump ("Reading macro location maps");
dump.indent ();
unsigned num_macros = sec.u ();
dump () && dump ("Macro maps:%u locs:%u", num_macros, num_macro_locs);
bool propagated = spans.maybe_propagate (this,
line_table->highest_location + 1);
location_t offset = LINEMAPS_MACRO_LOWEST_LOCATION (line_table);
macro_locs.second = num_macro_locs;
macro_locs.first = offset - num_macro_locs;
dump () && dump ("Macro loc delta %d", offset);
dump () && dump ("Macro locations [%u,%u)",
macro_locs.first, macro_locs.second);
for (unsigned ix = 0; ix != num_macros && !sec.get_overrun (); ix++)
{
unsigned offset = sec.u ();
unsigned n_tokens = sec.u ();
cpp_hashnode *node = sec.cpp_node ();
location_t exp_loc = read_location (sec);
const line_map_macro *macro
= linemap_enter_macro (line_table, node, exp_loc, n_tokens);
if (!macro)
/* We shouldn't run out of locations, as we checked that we
had enough before starting. */
break;
gcc_checking_assert (MAP_START_LOCATION (macro)
== offset + macro_locs.first);
location_t *locs = macro->macro_locations;
location_t tok_loc = UNKNOWN_LOCATION;
unsigned count = sec.u ();
unsigned runs = 0;
for (unsigned jx = macro->n_tokens * 2; jx-- && !sec.get_overrun ();)
{
while (!count-- && !sec.get_overrun ())
{
runs++;
tok_loc = read_location (sec);
count = sec.u ();
}
locs[jx] = tok_loc;
}
if (count)
sec.set_overrun ();
dump (dumper::LOCATION)
&& dump ("Macro:%u %I %u/%u*2 locations [%u,%u)",
ix, identifier (node), runs, n_tokens,
MAP_START_LOCATION (macro),
MAP_START_LOCATION (macro) + n_tokens);
}
dump () && dump ("Macro location lwm:%u", macro_locs.first);
if (propagated)
spans.close ();
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
/* Serialize the definition of MACRO. */
void
module_state::write_define (bytes_out &sec, const cpp_macro *macro)
{
sec.u (macro->count);
sec.b (macro->fun_like);
sec.b (macro->variadic);
sec.b (macro->syshdr);
sec.bflush ();
write_location (sec, macro->line);
if (macro->fun_like)
{
sec.u (macro->paramc);
const cpp_hashnode *const *parms = macro->parm.params;
for (unsigned ix = 0; ix != macro->paramc; ix++)
sec.cpp_node (parms[ix]);
}
unsigned len = 0;
for (unsigned ix = 0; ix != macro->count; ix++)
{
const cpp_token *token = ¯o->exp.tokens[ix];
write_location (sec, token->src_loc);
sec.u (token->type);
sec.u (token->flags);
switch (cpp_token_val_index (token))
{
default:
gcc_unreachable ();
case CPP_TOKEN_FLD_ARG_NO:
/* An argument reference. */
sec.u (token->val.macro_arg.arg_no);
sec.cpp_node (token->val.macro_arg.spelling);
break;
case CPP_TOKEN_FLD_NODE:
/* An identifier. */
sec.cpp_node (token->val.node.node);
if (token->val.node.spelling == token->val.node.node)
/* The spelling will usually be the same. so optimize
that. */
sec.str (NULL, 0);
else
sec.cpp_node (token->val.node.spelling);
break;
case CPP_TOKEN_FLD_NONE:
break;
case CPP_TOKEN_FLD_STR:
/* A string, number or comment. Not always NUL terminated,
we stream out in a single contatenation with embedded
NULs as that's a safe default. */
len += token->val.str.len + 1;
sec.u (token->val.str.len);
break;
case CPP_TOKEN_FLD_SOURCE:
case CPP_TOKEN_FLD_TOKEN_NO:
case CPP_TOKEN_FLD_PRAGMA:
/* These do not occur inside a macro itself. */
gcc_unreachable ();
}
}
if (len)
{
char *ptr = reinterpret_cast<char *> (sec.buf (len));
len = 0;
for (unsigned ix = 0; ix != macro->count; ix++)
{
const cpp_token *token = ¯o->exp.tokens[ix];
if (cpp_token_val_index (token) == CPP_TOKEN_FLD_STR)
{
memcpy (ptr + len, token->val.str.text,
token->val.str.len);
len += token->val.str.len;
ptr[len++] = 0;
}
}
}
}
/* Read a macro definition. */
cpp_macro *
module_state::read_define (bytes_in &sec, cpp_reader *reader) const
{
unsigned count = sec.u ();
/* We rely on knowing cpp_reader's hash table is ident_hash, and
its subobject allocator is stringpool_ggc_alloc and that is just
a wrapper for ggc_alloc_atomic. */
cpp_macro *macro
= (cpp_macro *)ggc_alloc_atomic (sizeof (cpp_macro)
+ sizeof (cpp_token) * (count - !!count));
memset (macro, 0, sizeof (cpp_macro) + sizeof (cpp_token) * (count - !!count));
macro->count = count;
macro->kind = cmk_macro;
macro->imported_p = true;
macro->fun_like = sec.b ();
macro->variadic = sec.b ();
macro->syshdr = sec.b ();
sec.bflush ();
macro->line = read_location (sec);
if (macro->fun_like)
{
unsigned paramc = sec.u ();
cpp_hashnode **params
= (cpp_hashnode **)ggc_alloc_atomic (sizeof (cpp_hashnode *) * paramc);
macro->paramc = paramc;
macro->parm.params = params;
for (unsigned ix = 0; ix != paramc; ix++)
params[ix] = sec.cpp_node ();
}
unsigned len = 0;
for (unsigned ix = 0; ix != count && !sec.get_overrun (); ix++)
{
cpp_token *token = ¯o->exp.tokens[ix];
token->src_loc = read_location (sec);
token->type = cpp_ttype (sec.u ());
token->flags = sec.u ();
switch (cpp_token_val_index (token))
{
default:
sec.set_overrun ();
break;
case CPP_TOKEN_FLD_ARG_NO:
/* An argument reference. */
{
unsigned arg_no = sec.u ();
if (arg_no - 1 >= macro->paramc)
sec.set_overrun ();
token->val.macro_arg.arg_no = arg_no;
token->val.macro_arg.spelling = sec.cpp_node ();
}
break;
case CPP_TOKEN_FLD_NODE:
/* An identifier. */
token->val.node.node = sec.cpp_node ();
token->val.node.spelling = sec.cpp_node ();
if (!token->val.node.spelling)
token->val.node.spelling = token->val.node.node;
break;
case CPP_TOKEN_FLD_NONE:
break;
case CPP_TOKEN_FLD_STR:
/* A string, number or comment. */
token->val.str.len = sec.u ();
len += token->val.str.len + 1;
break;
}
}
if (len)
if (const char *ptr = reinterpret_cast<const char *> (sec.buf (len)))
{
/* There should be a final NUL. */
if (ptr[len-1])
sec.set_overrun ();
/* cpp_alloc_token_string will add a final NUL. */
const unsigned char *buf
= cpp_alloc_token_string (reader, (const unsigned char *)ptr, len - 1);
len = 0;
for (unsigned ix = 0; ix != count && !sec.get_overrun (); ix++)
{
cpp_token *token = ¯o->exp.tokens[ix];
if (cpp_token_val_index (token) == CPP_TOKEN_FLD_STR)
{
token->val.str.text = buf + len;
len += token->val.str.len;
if (buf[len++])
sec.set_overrun ();
}
}
}
if (sec.get_overrun ())
return NULL;
return macro;
}
/* Exported macro data. */
struct GTY(()) macro_export {
cpp_macro *def;
location_t undef_loc;
macro_export ()
:def (NULL), undef_loc (UNKNOWN_LOCATION)
{
}
};
/* Imported macro data. */
class macro_import {
public:
struct slot {
#if defined (WORDS_BIGENDIAN) && SIZEOF_VOID_P == 8
int offset;
#endif
/* We need to ensure we don't use the LSB for representation, as
that's the union discriminator below. */
unsigned bits;
#if !(defined (WORDS_BIGENDIAN) && SIZEOF_VOID_P == 8)
int offset;
#endif
public:
enum Layout {
L_DEF = 1,
L_UNDEF = 2,
L_BOTH = 3,
L_MODULE_SHIFT = 2
};
public:
/* Not a regular ctor, because we put it in a union, and that's
not allowed in C++ 98. */
static slot ctor (unsigned module, unsigned defness)
{
gcc_checking_assert (defness);
slot s;
s.bits = defness | (module << L_MODULE_SHIFT);
s.offset = -1;
return s;
}
public:
unsigned get_defness () const
{
return bits & L_BOTH;
}
unsigned get_module () const
{
return bits >> L_MODULE_SHIFT;
}
void become_undef ()
{
bits &= ~unsigned (L_DEF);
bits |= unsigned (L_UNDEF);
}
};
private:
typedef vec<slot, va_heap, vl_embed> ary_t;
union either {
/* Discriminated by bits 0|1 != 0. The expected case is that
there will be exactly one slot per macro, hence the effort of
packing that. */
ary_t *ary;
slot single;
} u;
public:
macro_import ()
{
u.ary = NULL;
}
private:
bool single_p () const
{
return u.single.bits & slot::L_BOTH;
}
bool occupied_p () const
{
return u.ary != NULL;
}
public:
unsigned length () const
{
gcc_checking_assert (occupied_p ());
return single_p () ? 1 : u.ary->length ();
}
slot &operator[] (unsigned ix)
{
gcc_checking_assert (occupied_p ());
if (single_p ())
{
gcc_checking_assert (!ix);
return u.single;
}
else
return (*u.ary)[ix];
}
public:
slot &exported ();
slot &append (unsigned module, unsigned defness);
};
/* O is a new import to append to the list for. If we're an empty
set, initialize us. */
macro_import::slot &
macro_import::append (unsigned module, unsigned defness)
{
if (!occupied_p ())
{
u.single = slot::ctor (module, defness);
return u.single;
}
else
{
bool single = single_p ();
ary_t *m = single ? NULL : u.ary;
vec_safe_reserve (m, 1 + single);
if (single)
m->quick_push (u.single);
u.ary = m;
return *u.ary->quick_push (slot::ctor (module, defness));
}
}
/* We're going to export something. Make sure the first import slot
is us. */
macro_import::slot &
macro_import::exported ()
{
if (occupied_p () && !(*this)[0].get_module ())
{
slot &res = (*this)[0];
res.bits |= slot::L_DEF;
return res;
}
slot *a = &append (0, slot::L_DEF);
if (!single_p ())
{
slot &f = (*this)[0];
std::swap (f, *a);
a = &f;
}
return *a;
}
/* The import (&exported) macros. cpp_hasnode's deferred field
indexes this array (offset by 1, so zero means 'not present'. */
static vec<macro_import, va_heap, vl_embed> *macro_imports;
/* The exported macros. A macro_import slot's zeroth element's offset
indexes this array. If the zeroth slot is not for module zero,
there is no export. */
static GTY(()) vec<macro_export, va_gc> *macro_exports;
/* The reachable set of header imports from this TU. */
static GTY(()) bitmap headers;
/* Get the (possibly empty) macro imports for NODE. */
static macro_import &
get_macro_imports (cpp_hashnode *node)
{
if (node->deferred)
return (*macro_imports)[node->deferred - 1];
vec_safe_reserve (macro_imports, 1);
node->deferred = macro_imports->length () + 1;
return *vec_safe_push (macro_imports, macro_import ());
}
/* Get the macro export for export EXP of NODE. */
static macro_export &
get_macro_export (macro_import::slot &slot)
{
if (slot.offset >= 0)
return (*macro_exports)[slot.offset];
vec_safe_reserve (macro_exports, 1);
slot.offset = macro_exports->length ();
return *macro_exports->quick_push (macro_export ());
}
/* If NODE is an exportable macro, add it to the export set. */
static int
maybe_add_macro (cpp_reader *, cpp_hashnode *node, void *data_)
{
bool exporting = false;
if (cpp_user_macro_p (node))
if (cpp_macro *macro = node->value.macro)
/* Ignore imported, builtins, command line and forced header macros. */
if (!macro->imported_p
&& !macro->lazy && macro->line >= spans.main_start ())
{
gcc_checking_assert (macro->kind == cmk_macro);
/* I don't want to deal with this corner case, that I suspect is
a devil's advocate reading of the standard. */
gcc_checking_assert (!macro->extra_tokens);
macro_import::slot &slot = get_macro_imports (node).exported ();
macro_export &exp = get_macro_export (slot);
exp.def = macro;
exporting = true;
}
if (!exporting && node->deferred)
{
macro_import &imports = (*macro_imports)[node->deferred - 1];
macro_import::slot &slot = imports[0];
if (!slot.get_module ())
{
gcc_checking_assert (slot.get_defness ());
exporting = true;
}
}
if (exporting)
static_cast<vec<cpp_hashnode *> *> (data_)->safe_push (node);
return 1; /* Don't stop. */
}
/* Order cpp_hashnodes A_ and B_ by their exported macro locations. */
static int
macro_loc_cmp (const void *a_, const void *b_)
{
const cpp_hashnode *node_a = *(const cpp_hashnode *const *)a_;
macro_import &import_a = (*macro_imports)[node_a->deferred - 1];
const macro_export &export_a = (*macro_exports)[import_a[0].offset];
location_t loc_a = export_a.def ? export_a.def->line : export_a.undef_loc;
const cpp_hashnode *node_b = *(const cpp_hashnode *const *)b_;
macro_import &import_b = (*macro_imports)[node_b->deferred - 1];
const macro_export &export_b = (*macro_exports)[import_b[0].offset];
location_t loc_b = export_b.def ? export_b.def->line : export_b.undef_loc;
if (loc_a < loc_b)
return +1;
else if (loc_a > loc_b)
return -1;
else
return 0;
}
/* Gather the macro definitions and undefinitions that we will need to
write out. */
vec<cpp_hashnode *> *
module_state::prepare_macros (cpp_reader *reader)
{
vec<cpp_hashnode *> *macros;
vec_alloc (macros, 100);
cpp_forall_identifiers (reader, maybe_add_macro, macros);
dump (dumper::MACRO) && dump ("No more than %u macros", macros->length ());
macros->qsort (macro_loc_cmp);
// Note the locations.
for (unsigned ix = macros->length (); ix--;)
{
cpp_hashnode *node = (*macros)[ix];
macro_import::slot &slot = (*macro_imports)[node->deferred - 1][0];
macro_export &mac = (*macro_exports)[slot.offset];
if (IDENTIFIER_KEYWORD_P (identifier (node)))
continue;
if (mac.undef_loc != UNKNOWN_LOCATION)
note_location (mac.undef_loc);
if (mac.def)
{
note_location (mac.def->line);
for (unsigned ix = 0; ix != mac.def->count; ix++)
note_location (mac.def->exp.tokens[ix].src_loc);
}
}
return macros;
}
/* Write out the exported defines. This is two sections, one
containing the definitions, the other a table of node names. */
unsigned
module_state::write_macros (elf_out *to, vec<cpp_hashnode *> *macros,
unsigned *crc_p)
{
dump () && dump ("Writing macros");
dump.indent ();
/* Write the defs */
bytes_out sec (to);
sec.begin ();
unsigned count = 0;
for (unsigned ix = macros->length (); ix--;)
{
cpp_hashnode *node = (*macros)[ix];
macro_import::slot &slot = (*macro_imports)[node->deferred - 1][0];
gcc_assert (!slot.get_module () && slot.get_defness ());
macro_export &mac = (*macro_exports)[slot.offset];
gcc_assert (!!(slot.get_defness () & macro_import::slot::L_UNDEF)
== (mac.undef_loc != UNKNOWN_LOCATION)
&& !!(slot.get_defness () & macro_import::slot::L_DEF)
== (mac.def != NULL));
if (IDENTIFIER_KEYWORD_P (identifier (node)))
{
warning_at (mac.def->line, 0,
"not exporting %<#define %E%> as it is a keyword",
identifier (node));
slot.offset = 0;
continue;
}
count++;
slot.offset = sec.pos;
dump (dumper::MACRO)
&& dump ("Writing macro %s%s%s %I at %u",
slot.get_defness () & macro_import::slot::L_UNDEF
? "#undef" : "",
slot.get_defness () == macro_import::slot::L_BOTH
? " & " : "",
slot.get_defness () & macro_import::slot::L_DEF
? "#define" : "",
identifier (node), slot.offset);
if (mac.undef_loc != UNKNOWN_LOCATION)
write_location (sec, mac.undef_loc);
if (mac.def)
write_define (sec, mac.def);
}
if (count)
// We may have ended on a tokenless macro with a very short
// location, that will cause problems reading its bit flags.
sec.u (0);
sec.end (to, to->name (MOD_SNAME_PFX ".def"), crc_p);
if (count)
{
/* Write the table. */
bytes_out sec (to);
sec.begin ();
sec.u (count);
for (unsigned ix = macros->length (); ix--;)
{
const cpp_hashnode *node = (*macros)[ix];
macro_import::slot &slot = (*macro_imports)[node->deferred - 1][0];
if (slot.offset)
{
sec.cpp_node (node);
sec.u (slot.get_defness ());
sec.u (slot.offset);
}
}
sec.end (to, to->name (MOD_SNAME_PFX ".mac"), crc_p);
}
dump.outdent ();
return count;
}
bool
module_state::read_macros ()
{
/* Get the def section. */
if (!slurp->macro_defs.begin (loc, from (), MOD_SNAME_PFX ".def"))
return false;
/* Get the tbl section, if there are defs. */
if (slurp->macro_defs.more_p ()
&& !slurp->macro_tbl.begin (loc, from (), MOD_SNAME_PFX ".mac"))
return false;
return true;
}
/* Install the macro name table. */
void
module_state::install_macros ()
{
bytes_in &sec = slurp->macro_tbl;
if (!sec.size)
return;
dump () && dump ("Reading macro table %M", this);
dump.indent ();
unsigned count = sec.u ();
dump () && dump ("%u macros", count);
while (count--)
{
cpp_hashnode *node = sec.cpp_node ();
macro_import &imp = get_macro_imports (node);
unsigned flags = sec.u () & macro_import::slot::L_BOTH;
if (!flags)
sec.set_overrun ();
if (sec.get_overrun ())
break;
macro_import::slot &slot = imp.append (mod, flags);
slot.offset = sec.u ();
dump (dumper::MACRO)
&& dump ("Read %s macro %s%s%s %I at %u",
imp.length () > 1 ? "add" : "new",
flags & macro_import::slot::L_UNDEF ? "#undef" : "",
flags == macro_import::slot::L_BOTH ? " & " : "",
flags & macro_import::slot::L_DEF ? "#define" : "",
identifier (node), slot.offset);
/* We'll leak an imported definition's TOKEN_FLD_STR's data
here. But that only happens when we've had to resolve the
deferred macro before this import -- why are you doing
that? */
if (cpp_macro *cur = cpp_set_deferred_macro (node))
if (!cur->imported_p)
{
macro_import::slot &slot = imp.exported ();
macro_export &exp = get_macro_export (slot);
exp.def = cur;
dump (dumper::MACRO)
&& dump ("Saving current #define %I", identifier (node));
}
}
/* We're now done with the table. */
elf_in::release (slurp->from, sec);
dump.outdent ();
}
/* Import the transitive macros. */
void
module_state::import_macros ()
{
bitmap_ior_into (headers, slurp->headers);
bitmap_iterator bititer;
unsigned bitnum;
EXECUTE_IF_SET_IN_BITMAP (slurp->headers, 0, bitnum, bititer)
(*modules)[bitnum]->install_macros ();
}
/* NODE is being undefined at LOC. Record it in the export table, if
necessary. */
void
module_state::undef_macro (cpp_reader *, location_t loc, cpp_hashnode *node)
{
if (!node->deferred)
/* The macro is not imported, so our undef is irrelevant. */
return;
unsigned n = dump.push (NULL);
macro_import::slot &slot = (*macro_imports)[node->deferred - 1].exported ();
macro_export &exp = get_macro_export (slot);
exp.undef_loc = loc;
slot.become_undef ();
exp.def = NULL;
dump (dumper::MACRO) && dump ("Recording macro #undef %I", identifier (node));
dump.pop (n);
}
/* NODE is a deferred macro node. Determine the definition and return
it, with NULL if undefined. May issue diagnostics.
This can leak memory, when merging declarations -- the string
contents (TOKEN_FLD_STR) of each definition are allocated in
unreclaimable cpp objstack. Only one will win. However, I do not
expect this to be common -- mostly macros have a single point of
definition. Perhaps we could restore the objstack to its position
after the first imported definition (if that wins)? The macros
themselves are GC'd. */
cpp_macro *
module_state::deferred_macro (cpp_reader *reader, location_t loc,
cpp_hashnode *node)
{
macro_import &imports = (*macro_imports)[node->deferred - 1];
unsigned n = dump.push (NULL);
dump (dumper::MACRO) && dump ("Deferred macro %I", identifier (node));
bitmap visible (BITMAP_GGC_ALLOC ());
if (!((imports[0].get_defness () & macro_import::slot::L_UNDEF)
&& !imports[0].get_module ()))
{
/* Calculate the set of visible header imports. */
bitmap_copy (visible, headers);
for (unsigned ix = imports.length (); ix--;)
{
const macro_import::slot &slot = imports[ix];
unsigned mod = slot.get_module ();
if ((slot.get_defness () & macro_import::slot::L_UNDEF)
&& bitmap_bit_p (visible, mod))
{
bitmap arg = mod ? (*modules)[mod]->slurp->headers : headers;
bitmap_and_compl_into (visible, arg);
bitmap_set_bit (visible, mod);
}
}
}
bitmap_set_bit (visible, 0);
/* Now find the macros that are still visible. */
bool failed = false;
cpp_macro *def = NULL;
vec<macro_export> defs;
defs.create (imports.length ());
for (unsigned ix = imports.length (); ix--;)
{
const macro_import::slot &slot = imports[ix];
unsigned mod = slot.get_module ();
if (bitmap_bit_p (visible, mod))
{
macro_export *pushed = NULL;
if (mod)
{
const module_state *imp = (*modules)[mod];
bytes_in &sec = imp->slurp->macro_defs;
if (!sec.get_overrun ())
{
dump (dumper::MACRO)
&& dump ("Reading macro %s%s%s %I module %M at %u",
slot.get_defness () & macro_import::slot::L_UNDEF
? "#undef" : "",
slot.get_defness () == macro_import::slot::L_BOTH
? " & " : "",
slot.get_defness () & macro_import::slot::L_DEF
? "#define" : "",
identifier (node), imp, slot.offset);
sec.random_access (slot.offset);
macro_export exp;
if (slot.get_defness () & macro_import::slot::L_UNDEF)
exp.undef_loc = imp->read_location (sec);
if (slot.get_defness () & macro_import::slot::L_DEF)
exp.def = imp->read_define (sec, reader);
if (sec.get_overrun ())
error_at (loc, "macro definitions of %qE corrupted",
imp->name);
else
pushed = defs.quick_push (exp);
}
}
else
pushed = defs.quick_push ((*macro_exports)[slot.offset]);
if (pushed && pushed->def)
{
if (!def)
def = pushed->def;
else if (cpp_compare_macros (def, pushed->def))
failed = true;
}
}
}
if (failed)
{
/* If LOC is the first loc, this is the end of file check, which
is a warning. */
if (loc == MAP_START_LOCATION (LINEMAPS_ORDINARY_MAP_AT (line_table, 0)))
warning_at (loc, OPT_Winvalid_imported_macros,
"inconsistent imported macro definition %qE",
identifier (node));
else
error_at (loc, "inconsistent imported macro definition %qE",
identifier (node));
for (unsigned ix = defs.length (); ix--;)
{
macro_export &exp = defs[ix];
if (exp.undef_loc)
inform (exp.undef_loc, "%<#undef %E%>", identifier (node));
if (exp.def)
inform (exp.def->line, "%<#define %s%>",
cpp_macro_definition (reader, node, exp.def));
}
def = NULL;
}
defs.release ();
dump.pop (n);
return def;
}
/* Stream the static aggregates. Sadly some headers (ahem:
iostream) contain static vars, and rely on them to run global
ctors. */
unsigned
module_state::write_inits (elf_out *to, depset::hash &table, unsigned *crc_ptr)
{
if (!static_aggregates && !tls_aggregates)
return 0;
dump () && dump ("Writing initializers");
dump.indent ();
static_aggregates = nreverse (static_aggregates);
tls_aggregates = nreverse (tls_aggregates);
unsigned count = 0;
trees_out sec (to, this, table, ~0u);
sec.begin ();
tree list = static_aggregates;
for (int passes = 0; passes != 2; passes++)
{
for (tree init = list; init; init = TREE_CHAIN (init), count++)
if (TREE_LANG_FLAG_0 (init))
{
tree decl = TREE_VALUE (init);
dump ("Initializer:%u for %N", count, decl);
sec.tree_node (decl);
}
list = tls_aggregates;
}
sec.end (to, to->name (MOD_SNAME_PFX ".ini"), crc_ptr);
dump.outdent ();
return count;
}
/* We have to defer some post-load processing until we've completed
reading, because they can cause more reading. */
static void
post_load_processing ()
{
/* We mustn't cause a GC, our caller should have arranged for that
not to happen. */
gcc_checking_assert (function_depth);
if (!post_load_decls)
return;
tree old_cfd = current_function_decl;
struct function *old_cfun = cfun;
while (post_load_decls->length ())
{
tree decl = post_load_decls->pop ();
dump () && dump ("Post-load processing of %N", decl);
gcc_checking_assert (DECL_ABSTRACT_P (decl));
/* Cloning can cause loading -- specifically operator delete for
the deleting dtor. */
maybe_clone_body (decl);
}
cfun = old_cfun;
current_function_decl = old_cfd;
}
bool
module_state::read_inits (unsigned count)
{
trees_in sec (this);
if (!sec.begin (loc, from (), from ()->find (MOD_SNAME_PFX ".ini")))
return false;
dump () && dump ("Reading %u initializers", count);
dump.indent ();
lazy_snum = ~0u;
for (unsigned ix = 0; ix != count; ix++)
{
/* Merely referencing the decl causes its initializer to be read
and added to the correct list. */
tree decl = sec.tree_node ();
if (sec.get_overrun ())
break;
if (decl)
dump ("Initializer:%u for %N", count, decl);
}
lazy_snum = 0;
post_load_processing ();
dump.outdent ();
if (!sec.end (from ()))
return false;
return true;
}
void
module_state::write_counts (elf_out *to, unsigned counts[MSC_HWM],
unsigned *crc_ptr)
{
bytes_out cfg (to);
cfg.begin ();
for (unsigned ix = MSC_HWM; ix--;)
cfg.u (counts[ix]);
if (dump ())
{
dump ("Cluster sections are [%u,%u)",
counts[MSC_sec_lwm], counts[MSC_sec_hwm]);
dump ("Bindings %u", counts[MSC_bindings]);
dump ("Pendings %u", counts[MSC_pendings]);
dump ("Entities %u", counts[MSC_entities]);
dump ("Namespaces %u", counts[MSC_namespaces]);
dump ("Macros %u", counts[MSC_macros]);
dump ("Initializers %u", counts[MSC_inits]);
}
cfg.end (to, to->name (MOD_SNAME_PFX ".cnt"), crc_ptr);
}
bool
module_state::read_counts (unsigned counts[MSC_HWM])
{
bytes_in cfg;
if (!cfg.begin (loc, from (), MOD_SNAME_PFX ".cnt"))
return false;
for (unsigned ix = MSC_HWM; ix--;)
counts[ix] = cfg.u ();
if (dump ())
{
dump ("Declaration sections are [%u,%u)",
counts[MSC_sec_lwm], counts[MSC_sec_hwm]);
dump ("Bindings %u", counts[MSC_bindings]);
dump ("Pendings %u", counts[MSC_pendings]);
dump ("Entities %u", counts[MSC_entities]);
dump ("Namespaces %u", counts[MSC_namespaces]);
dump ("Macros %u", counts[MSC_macros]);
dump ("Initializers %u", counts[MSC_inits]);
}
return cfg.end (from ());
}
/* Tool configuration: MOD_SNAME_PFX .config
This is data that confirms current state (or fails). */
void
module_state::write_config (elf_out *to, module_state_config &config,
unsigned inner_crc)
{
bytes_out cfg (to);
cfg.begin ();
/* Write version and inner crc as u32 values, for easier
debug inspection. */
dump () && dump ("Writing version=%V, inner_crc=%x",
MODULE_VERSION, inner_crc);
cfg.u32 (unsigned (MODULE_VERSION));
cfg.u32 (inner_crc);
cfg.u (to->name (is_header () ? "" : get_flatname ()));
/* Configuration. */
dump () && dump ("Writing target='%s', host='%s'",
TARGET_MACHINE, HOST_MACHINE);
unsigned target = to->name (TARGET_MACHINE);
unsigned host = (!strcmp (TARGET_MACHINE, HOST_MACHINE)
? target : to->name (HOST_MACHINE));
cfg.u (target);
cfg.u (host);
cfg.str (config.dialect_str);
cfg.u (extensions);
/* Global tree information. We write the globals crc separately,
rather than mix it directly into the overall crc, as it is used
to ensure data match between instances of the compiler, not
integrity of the file. */
dump () && dump ("Writing globals=%u, crc=%x",
fixed_trees->length (), global_crc);
cfg.u (fixed_trees->length ());
cfg.u32 (global_crc);
if (is_partition ())
cfg.u (is_interface ());
cfg.u (config.num_imports);
cfg.u (config.num_partitions);
cfg.u (config.num_entities);
cfg.u (config.ordinary_locs);
cfg.u (config.macro_locs);
cfg.u (config.loc_range_bits);
cfg.u (config.active_init);
/* Now generate CRC, we'll have incorporated the inner CRC because
of its serialization above. */
cfg.end (to, to->name (MOD_SNAME_PFX ".cfg"), &crc);
dump () && dump ("Writing CRC=%x", crc);
}
void
module_state::note_cmi_name ()
{
if (!cmi_noted_p && filename)
{
cmi_noted_p = true;
inform (loc, "compiled module file is %qs",
maybe_add_cmi_prefix (filename));
}
}
bool
module_state::read_config (module_state_config &config)
{
bytes_in cfg;
if (!cfg.begin (loc, from (), MOD_SNAME_PFX ".cfg"))
return false;
/* Check version. */
unsigned my_ver = MODULE_VERSION;
unsigned their_ver = cfg.u32 ();
dump () && dump (my_ver == their_ver ? "Version %V"
: "Expecting %V found %V", my_ver, their_ver);
if (their_ver != my_ver)
{
/* The compiler versions differ. Close enough? */
verstr_t my_string, their_string;
version2string (my_ver, my_string);
version2string (their_ver, their_string);
/* Reject when either is non-experimental or when experimental
major versions differ. */
bool reject_p = ((!IS_EXPERIMENTAL (my_ver)
|| !IS_EXPERIMENTAL (their_ver)
|| MODULE_MAJOR (my_ver) != MODULE_MAJOR (their_ver))
/* The 'I know what I'm doing' switch. */
&& !flag_module_version_ignore);
bool inform_p = true;
if (reject_p)
{
cfg.set_overrun ();
error_at (loc, "compiled module is %sversion %s",
IS_EXPERIMENTAL (their_ver) ? "experimental " : "",
their_string);
}
else
inform_p = warning_at (loc, 0, "compiled module is %sversion %s",
IS_EXPERIMENTAL (their_ver) ? "experimental " : "",
their_string);
if (inform_p)
{
inform (loc, "compiler is %sversion %s%s%s",
IS_EXPERIMENTAL (my_ver) ? "experimental " : "",
my_string,
reject_p ? "" : flag_module_version_ignore
? ", be it on your own head!" : ", close enough?",
reject_p ? "" : " \xc2\xaf\\_(\xe3\x83\x84)_/\xc2\xaf");
note_cmi_name ();
}
if (reject_p)
goto done;
}
/* We wrote the inner crc merely to merge it, so simply read it
back and forget it. */
cfg.u32 ();
/* Check module name. */
{
const char *their_name = from ()->name (cfg.u ());
const char *our_name = "";
if (!is_header ())
our_name = get_flatname ();
/* Header units can be aliased, so name checking is
inappropriate. */
if (0 != strcmp (their_name, our_name))
{
error_at (loc,
their_name[0] && our_name[0] ? G_("module %qs found")
: their_name[0]
? G_("header module expected, module %qs found")
: G_("module %qs expected, header module found"),
their_name[0] ? their_name : our_name);
cfg.set_overrun ();
goto done;
}
}
/* Check the CRC after the above sanity checks, so that the user is
clued in. */
{
unsigned e_crc = crc;
crc = cfg.get_crc ();
dump () && dump ("Reading CRC=%x", crc);
if (!is_direct () && crc != e_crc)
{
error_at (loc, "module %qs CRC mismatch", get_flatname ());
cfg.set_overrun ();
goto done;
}
}
/* Check target & host. */
{
const char *their_target = from ()->name (cfg.u ());
const char *their_host = from ()->name (cfg.u ());
dump () && dump ("Read target='%s', host='%s'", their_target, their_host);
if (strcmp (their_target, TARGET_MACHINE)
|| strcmp (their_host, HOST_MACHINE))
{
error_at (loc, "target & host is %qs:%qs, expected %qs:%qs",
their_target, TARGET_MACHINE, their_host, HOST_MACHINE);
cfg.set_overrun ();
goto done;
}
}
/* Check compilation dialect. This must match. */
{
const char *their_dialect = cfg.str ();
if (strcmp (their_dialect, config.dialect_str))
{
error_at (loc, "language dialect differs %qs, expected %qs",
their_dialect, config.dialect_str);
cfg.set_overrun ();
goto done;
}
}
/* Check for extensions. If they set any, we must have them set
too. */
{
unsigned ext = cfg.u ();
unsigned allowed = (flag_openmp ? SE_OPENMP : 0);
if (unsigned bad = ext & ~allowed)
{
if (bad & SE_OPENMP)
error_at (loc, "module contains OpenMP, use %<-fopenmp%> to enable");
cfg.set_overrun ();
goto done;
}
extensions = ext;
}
/* Check global trees. */
{
unsigned their_fixed_length = cfg.u ();
unsigned their_fixed_crc = cfg.u32 ();
dump () && dump ("Read globals=%u, crc=%x",
their_fixed_length, their_fixed_crc);
if (!flag_preprocess_only
&& (their_fixed_length != fixed_trees->length ()
|| their_fixed_crc != global_crc))
{
error_at (loc, "fixed tree mismatch");
cfg.set_overrun ();
goto done;
}
}
/* All non-partitions are interfaces. */
interface_p = !is_partition () || cfg.u ();
config.num_imports = cfg.u ();
config.num_partitions = cfg.u ();
config.num_entities = cfg.u ();
config.ordinary_locs = cfg.u ();
config.macro_locs = cfg.u ();
config.loc_range_bits = cfg.u ();
config.active_init = cfg.u ();
done:
return cfg.end (from ());
}
/* Comparator for ordering the Ordered Ordinary Location array. */
static int
ool_cmp (const void *a_, const void *b_)
{
auto *a = *static_cast<const module_state *const *> (a_);
auto *b = *static_cast<const module_state *const *> (b_);
if (a == b)
return 0;
else if (a->ordinary_locs.first < b->ordinary_locs.first)
return -1;
else
return +1;
}
/* Use ELROND format to record the following sections:
qualified-names : binding value(s)
MOD_SNAME_PFX.README : human readable, strings
MOD_SNAME_PFX.ENV : environment strings, strings
MOD_SNAME_PFX.nms : namespace hierarchy
MOD_SNAME_PFX.bnd : binding table
MOD_SNAME_PFX.spc : specialization table
MOD_SNAME_PFX.imp : import table
MOD_SNAME_PFX.ent : entity table
MOD_SNAME_PFX.prt : partitions table
MOD_SNAME_PFX.olm : ordinary line maps
MOD_SNAME_PFX.mlm : macro line maps
MOD_SNAME_PFX.def : macro definitions
MOD_SNAME_PFX.mac : macro index
MOD_SNAME_PFX.ini : inits
MOD_SNAME_PFX.cnt : counts
MOD_SNAME_PFX.cfg : config data
*/
void
module_state::write_begin (elf_out *to, cpp_reader *reader,
module_state_config &config, unsigned &crc)
{
/* Figure out remapped module numbers, which might elide
partitions. */
bitmap partitions = NULL;
if (!is_header () && !is_partition ())
partitions = BITMAP_GGC_ALLOC ();
write_init_maps ();
unsigned mod_hwm = 1;
for (unsigned ix = 1; ix != modules->length (); ix++)
{
module_state *imp = (*modules)[ix];
/* Promote any non-partition direct import from a partition, unless
we're a partition. */
if (!is_partition () && !imp->is_partition ()
&& imp->is_partition_direct ())
imp->directness = MD_PURVIEW_DIRECT;
/* Write any import that is not a partition, unless we're a
partition. */
if (!partitions || !imp->is_partition ())
imp->remap = mod_hwm++;
else
{
dump () && dump ("Partition %M %u", imp, ix);
bitmap_set_bit (partitions, ix);
imp->remap = 0;
/* All interface partitions must be exported. */
if (imp->is_interface () && !bitmap_bit_p (exports, imp->mod))
{
error_at (imp->loc, "interface partition is not exported");
bitmap_set_bit (exports, imp->mod);
}
/* All the partition entities should have been loaded when
loading the partition. */
if (CHECKING_P)
for (unsigned jx = 0; jx != imp->entity_num; jx++)
{
binding_slot *slot = &(*entity_ary)[imp->entity_lwm + jx];
gcc_checking_assert (!slot->is_lazy ());
}
}
if (imp->is_direct () && (imp->remap || imp->is_partition ()))
note_location (imp->imported_from ());
}
if (partitions && bitmap_empty_p (partitions))
/* No partitions present. */
partitions = nullptr;
/* Find the set of decls we must write out. */
depset::hash table (DECL_NAMESPACE_BINDINGS (global_namespace)->size () * 8);
/* Add the specializations before the writables, so that we can
detect injected friend specializations. */
table.add_specializations (true);
table.add_specializations (false);
if (partial_specializations)
{
table.add_partial_entities (partial_specializations);
partial_specializations = NULL;
}
table.add_namespace_entities (global_namespace, partitions);
if (class_members)
{
table.add_class_entities (class_members);
class_members = NULL;
}
/* Now join everything up. */
table.find_dependencies (this);
if (!table.finalize_dependencies ())
{
to->set_error ();
return;
}
#if CHECKING_P
/* We're done verifying at-most once reading, reset to verify
at-most once writing. */
note_defs = note_defs_table_t::create_ggc (1000);
#endif
/* Determine Strongy Connected Components. */
vec<depset *> sccs = table.connect ();
vec_alloc (ool, modules->length ());
for (unsigned ix = modules->length (); --ix;)
{
auto *import = (*modules)[ix];
if (import->loadedness > ML_NONE
&& !(partitions && bitmap_bit_p (partitions, import->mod)))
ool->quick_push (import);
}
ool->qsort (ool_cmp);
vec<cpp_hashnode *> *macros = nullptr;
if (is_header ())
macros = prepare_macros (reader);
config.num_imports = mod_hwm;
config.num_partitions = modules->length () - mod_hwm;
auto map_info = write_prepare_maps (&config, bool (config.num_partitions));
unsigned counts[MSC_HWM];
memset (counts, 0, sizeof (counts));
/* depset::cluster is the cluster number,
depset::section is unspecified scratch value.
The following loops make use of the tarjan property that
dependencies will be earlier in the SCCS array. */
/* This first loop determines the number of depsets in each SCC, and
also the number of namespaces we're dealing with. During the
loop, the meaning of a couple of depset fields now change:
depset::cluster -> size_of cluster, if first of cluster & !namespace
depset::section -> section number of cluster (if !namespace). */
unsigned n_spaces = 0;
counts[MSC_sec_lwm] = counts[MSC_sec_hwm] = to->get_section_limit ();
for (unsigned size, ix = 0; ix < sccs.length (); ix += size)
{
depset **base = &sccs[ix];
if (base[0]->get_entity_kind () == depset::EK_NAMESPACE)
{
n_spaces++;
size = 1;
}
else
{
/* Count the members in this cluster. */
for (size = 1; ix + size < sccs.length (); size++)
if (base[size]->cluster != base[0]->cluster)
break;
for (unsigned jx = 0; jx != size; jx++)
{
/* Set the section number. */
base[jx]->cluster = ~(~0u >> 1); /* A bad value. */
base[jx]->section = counts[MSC_sec_hwm];
}
/* Save the size in the first member's cluster slot. */
base[0]->cluster = size;
counts[MSC_sec_hwm]++;
}
}
/* Write the clusters. Namespace decls are put in the spaces array.
The meaning of depset::cluster changes to provide the
unnamed-decl count of the depset's decl (and remains zero for
non-decls and non-unnamed). */
unsigned bytes = 0;
vec<depset *> spaces;
spaces.create (n_spaces);
for (unsigned size, ix = 0; ix < sccs.length (); ix += size)
{
depset **base = &sccs[ix];
if (base[0]->get_entity_kind () == depset::EK_NAMESPACE)
{
tree decl = base[0]->get_entity ();
if (decl == global_namespace)
base[0]->cluster = 0;
else if (!base[0]->is_import ())
{
base[0]->cluster = counts[MSC_entities]++;
spaces.quick_push (base[0]);
counts[MSC_namespaces]++;
if (CHECKING_P)
{
/* Add it to the entity map, such that we can tell it is
part of us. */
bool existed;
unsigned *slot = &entity_map->get_or_insert
(DECL_UID (decl), &existed);
if (existed)
/* It must have come from a partition. */
gcc_checking_assert
(import_entity_module (*slot)->is_partition ());
*slot = ~base[0]->cluster;
}
dump (dumper::CLUSTER) && dump ("Cluster namespace %N", decl);
}
size = 1;
}
else
{
size = base[0]->cluster;
/* Cluster is now used to number entities. */
base[0]->cluster = ~(~0u >> 1); /* A bad value. */
sort_cluster (&table, base, size);
/* Record the section for consistency checking during stream
out -- we don't want to start writing decls in different
sections. */
table.section = base[0]->section;
bytes += write_cluster (to, base, size, table, counts, &crc);
table.section = 0;
}
}
/* depset::cluster - entity number (on entities)
depset::section - cluster number */
/* We'd better have written as many sections and found as many
namespaces as we predicted. */
gcc_assert (counts[MSC_sec_hwm] == to->get_section_limit ()
&& spaces.length () == counts[MSC_namespaces]);
/* Write the entitites. None happens if we contain namespaces or
nothing. */
config.num_entities = counts[MSC_entities];
if (counts[MSC_entities])
write_entities (to, sccs, counts[MSC_entities], &crc);
/* Write the namespaces. */
if (counts[MSC_namespaces])
write_namespaces (to, spaces, counts[MSC_namespaces], &crc);
/* Write the bindings themselves. */
counts[MSC_bindings] = write_bindings (to, sccs, &crc);
/* Write the unnamed. */
counts[MSC_pendings] = write_pendings (to, sccs, table, &crc);
/* Write the import table. */
if (config.num_imports > 1)
write_imports (to, &crc);
/* Write elided partition table. */
if (config.num_partitions)
write_partitions (to, config.num_partitions, &crc);
/* Write the line maps. */
if (config.ordinary_locs)
write_ordinary_maps (to, map_info, bool (config.num_partitions), &crc);
if (config.macro_locs)
write_macro_maps (to, map_info, &crc);
if (is_header ())
{
counts[MSC_macros] = write_macros (to, macros, &crc);
counts[MSC_inits] = write_inits (to, table, &crc);
vec_free (macros);
}
unsigned clusters = counts[MSC_sec_hwm] - counts[MSC_sec_lwm];
dump () && dump ("Wrote %u clusters, average %u bytes/cluster",
clusters, (bytes + clusters / 2) / (clusters + !clusters));
trees_out::instrument ();
write_counts (to, counts, &crc);
spaces.release ();
sccs.release ();
vec_free (macro_loc_remap);
vec_free (ord_loc_remap);
vec_free (ool);
// FIXME:QOI: Have a command line switch to control more detailed
// information (which might leak data you do not want to leak).
// Perhaps (some of) the write_readme contents should also be
// so-controlled.
if (false)
write_env (to);
}
// Finish module writing after we've emitted all dynamic initializers.
void
module_state::write_end (elf_out *to, cpp_reader *reader,
module_state_config &config, unsigned &crc)
{
/* And finish up. */
write_config (to, config, crc);
/* Human-readable info. */
write_readme (to, reader, config.dialect_str);
dump () && dump ("Wrote %u sections", to->get_section_limit ());
}
/* Initial read of a CMI. Checks config, loads up imports and line
maps. */
bool
module_state::read_initial (cpp_reader *reader)
{
module_state_config config;
bool ok = true;
if (ok && !from ()->begin (loc))
ok = false;
if (ok && !read_config (config))
ok = false;
bool have_locs = ok && read_prepare_maps (&config);
/* Ordinary maps before the imports. */
if (!(have_locs && config.ordinary_locs))
ordinary_locs.first = line_table->highest_location + 1;
else if (!read_ordinary_maps (config.ordinary_locs, config.loc_range_bits))
ok = false;
/* Allocate the REMAP vector. */
slurp->alloc_remap (config.num_imports);
if (ok)
{
/* Read the import table. Decrement current to stop this CMI
from being evicted during the import. */
slurp->current--;
if (config.num_imports > 1 && !read_imports (reader, line_table))
ok = false;
slurp->current++;
}
/* Read the elided partition table, if we're the primary partition. */
if (ok && config.num_partitions && is_module ()
&& !read_partitions (config.num_partitions))
ok = false;
/* Determine the module's number. */
gcc_checking_assert (mod == MODULE_UNKNOWN);
gcc_checking_assert (this != (*modules)[0]);
{
/* Allocate space in the entities array now -- that array must be
monotonically in step with the modules array. */
entity_lwm = vec_safe_length (entity_ary);
entity_num = config.num_entities;
gcc_checking_assert (modules->length () == 1
|| modules->last ()->entity_lwm <= entity_lwm);
vec_safe_reserve (entity_ary, config.num_entities);
binding_slot slot;
slot.u.binding = NULL_TREE;
for (unsigned count = config.num_entities; count--;)
entity_ary->quick_push (slot);
}
/* We'll run out of other resources before we run out of module
indices. */
mod = modules->length ();
vec_safe_push (modules, this);
/* We always import and export ourselves. */
bitmap_set_bit (imports, mod);
bitmap_set_bit (exports, mod);
if (ok)
(*slurp->remap)[0] = mod << 1;
dump () && dump ("Assigning %M module number %u", this, mod);
/* We should not have been frozen during the importing done by
read_config. */
gcc_assert (!from ()->is_frozen ());
/* Macro maps after the imports. */
if (!(ok && have_locs && config.macro_locs))
macro_locs.first = LINEMAPS_MACRO_LOWEST_LOCATION (line_table);
else if (!read_macro_maps (config.macro_locs))
ok = false;
/* Note whether there's an active initializer. */
active_init_p = !is_header () && bool (config.active_init);
gcc_assert (slurp->current == ~0u);
return ok;
}
/* Read a preprocessor state. */
bool
module_state::read_preprocessor (bool outermost)
{
gcc_checking_assert (is_header () && slurp
&& slurp->remap_module (0) == mod);
if (loadedness == ML_PREPROCESSOR)
return !(from () && from ()->get_error ());
bool ok = true;
/* Read direct header imports. */
unsigned len = slurp->remap->length ();
for (unsigned ix = 1; ok && ix != len; ix++)
{
unsigned map = (*slurp->remap)[ix];
if (map & 1)
{
module_state *import = (*modules)[map >> 1];
if (import->is_header ())
{
ok = import->read_preprocessor (false);
bitmap_ior_into (slurp->headers, import->slurp->headers);
}
}
}
/* Record as a direct header. */
if (ok)
bitmap_set_bit (slurp->headers, mod);
if (ok && !read_macros ())
ok = false;
loadedness = ML_PREPROCESSOR;
announce ("macros");
if (flag_preprocess_only)
/* We're done with the string table. */
from ()->release ();
return check_read (outermost, ok);
}
/* Read language state. */
bool
module_state::read_language (bool outermost)
{
gcc_checking_assert (!lazy_snum);
if (loadedness == ML_LANGUAGE)
return !(slurp && from () && from ()->get_error ());
gcc_checking_assert (slurp && slurp->current == ~0u
&& slurp->remap_module (0) == mod);
bool ok = true;
/* Read direct imports. */
unsigned len = slurp->remap->length ();
for (unsigned ix = 1; ok && ix != len; ix++)
{
unsigned map = (*slurp->remap)[ix];
if (map & 1)
{
module_state *import = (*modules)[map >> 1];
if (!import->read_language (false))
ok = false;
}
}
unsigned counts[MSC_HWM];
if (ok && !read_counts (counts))
ok = false;
function_depth++; /* Prevent unexpected GCs. */
if (ok && counts[MSC_entities] != entity_num)
ok = false;
if (ok && counts[MSC_entities]
&& !read_entities (counts[MSC_entities],
counts[MSC_sec_lwm], counts[MSC_sec_hwm]))
ok = false;
/* Read the namespace hierarchy. */
if (ok && counts[MSC_namespaces]
&& !read_namespaces (counts[MSC_namespaces]))
ok = false;
if (ok && !read_bindings (counts[MSC_bindings],
counts[MSC_sec_lwm], counts[MSC_sec_hwm]))
ok = false;
/* And unnamed. */
if (ok && counts[MSC_pendings] && !read_pendings (counts[MSC_pendings]))
ok = false;
if (ok)
{
slurp->remaining = counts[MSC_sec_hwm] - counts[MSC_sec_lwm];
available_clusters += counts[MSC_sec_hwm] - counts[MSC_sec_lwm];
}
if (!flag_module_lazy
|| (is_partition ()
&& module_interface_p ()
&& !module_partition_p ()))
{
/* Read the sections in forward order, so that dependencies are read
first. See note about tarjan_connect. */
ggc_collect ();
lazy_snum = ~0u;
unsigned hwm = counts[MSC_sec_hwm];
for (unsigned ix = counts[MSC_sec_lwm]; ok && ix != hwm; ix++)
if (!load_section (ix, NULL))
{
ok = false;
break;
}
lazy_snum = 0;
post_load_processing ();
ggc_collect ();
if (ok && CHECKING_P)
for (unsigned ix = 0; ix != entity_num; ix++)
gcc_assert (!(*entity_ary)[ix + entity_lwm].is_lazy ());
}
// If the import is a header-unit, we need to register initializers
// of any static objects it contains (looking at you _Ioinit).
// Notice, the ordering of these initializers will be that of a
// dynamic initializer at this point in the current TU. (Other
// instances of these objects in other TUs will be initialized as
// part of that TU's global initializers.)
if (ok && counts[MSC_inits] && !read_inits (counts[MSC_inits]))
ok = false;
function_depth--;
announce (flag_module_lazy ? "lazy" : "imported");
loadedness = ML_LANGUAGE;
gcc_assert (slurp->current == ~0u);
/* We're done with the string table. */
from ()->release ();
return check_read (outermost, ok);
}
bool
module_state::maybe_defrost ()
{
bool ok = true;
if (from ()->is_frozen ())
{
if (lazy_open >= lazy_limit)
freeze_an_elf ();
dump () && dump ("Defrosting '%s'", filename);
ok = from ()->defrost (maybe_add_cmi_prefix (filename));
lazy_open++;
}
return ok;
}
/* Load section SNUM, dealing with laziness. It doesn't matter if we
have multiple concurrent loads, because we do not use TREE_VISITED
when reading back in. */
bool
module_state::load_section (unsigned snum, binding_slot *mslot)
{
if (from ()->get_error ())
return false;
if (snum >= slurp->current)
from ()->set_error (elf::E_BAD_LAZY);
else if (maybe_defrost ())
{
unsigned old_current = slurp->current;
slurp->current = snum;
slurp->lru = 0; /* Do not swap out. */
slurp->remaining--;
read_cluster (snum);
slurp->lru = ++lazy_lru;
slurp->current = old_current;
}
if (mslot && mslot->is_lazy ())
{
/* Oops, the section didn't set this slot. */
from ()->set_error (elf::E_BAD_DATA);
*mslot = NULL_TREE;
}
bool ok = !from ()->get_error ();
if (!ok)
{
error_at (loc, "failed to read compiled module cluster %u: %s",
snum, from ()->get_error (filename));
note_cmi_name ();
}
maybe_completed_reading ();
return ok;
}
void
module_state::maybe_completed_reading ()
{
if (loadedness == ML_LANGUAGE && slurp->current == ~0u && !slurp->remaining)
{
lazy_open--;
/* We no longer need the macros, all tokenizing has been done. */
slurp->release_macros ();
from ()->end ();
slurp->close ();
slurped ();
}
}
/* After a reading operation, make sure things are still ok. If not,
emit an error and clean up. */
bool
module_state::check_read (bool outermost, bool ok)
{
gcc_checking_assert (!outermost || slurp->current == ~0u);
if (!ok)
from ()->set_error ();
if (int e = from ()->get_error ())
{
error_at (loc, "failed to read compiled module: %s",
from ()->get_error (filename));
note_cmi_name ();
if (e == EMFILE
|| e == ENFILE
#if MAPPED_READING
|| e == ENOMEM
#endif
|| false)
inform (loc, "consider using %<-fno-module-lazy%>,"
" increasing %<-param-lazy-modules=%u%> value,"
" or increasing the per-process file descriptor limit",
param_lazy_modules);
else if (e == ENOENT)
inform (loc, "imports must be built before being imported");
if (outermost)
fatal_error (loc, "returning to the gate for a mechanical issue");
ok = false;
}
maybe_completed_reading ();
return ok;
}
/* Return the IDENTIFIER_NODE naming module IX. This is the name
including dots. */
char const *
module_name (unsigned ix, bool header_ok)
{
if (modules)
{
module_state *imp = (*modules)[ix];
if (ix && !imp->name)
imp = imp->parent;
if (header_ok || !imp->is_header ())
return imp->get_flatname ();
}
return NULL;
}
/* Return the bitmap describing what modules are imported. Remember,
we always import ourselves. */
bitmap
get_import_bitmap ()
{
return (*modules)[0]->imports;
}
/* Return the visible imports and path of instantiation for an
instantiation at TINST. If TINST is nullptr, we're not in an
instantiation, and thus will return the visible imports of the
current TU (and NULL *PATH_MAP_P). We cache the information on
the tinst level itself. */
static bitmap
path_of_instantiation (tinst_level *tinst, bitmap *path_map_p)
{
gcc_checking_assert (modules_p ());
if (!tinst)
{
/* Not inside an instantiation, just the regular case. */
*path_map_p = nullptr;
return get_import_bitmap ();
}
if (!tinst->path)
{
/* Calculate. */
bitmap visible = path_of_instantiation (tinst->next, path_map_p);
bitmap path_map = *path_map_p;
if (!path_map)
{
path_map = BITMAP_GGC_ALLOC ();
bitmap_set_bit (path_map, 0);
}
tree decl = tinst->tldcl;
if (TREE_CODE (decl) == TREE_LIST)
decl = TREE_PURPOSE (decl);
if (TYPE_P (decl))
decl = TYPE_NAME (decl);
if (unsigned mod = get_originating_module (decl))
if (!bitmap_bit_p (path_map, mod))
{
/* This is brand new information! */
bitmap new_path = BITMAP_GGC_ALLOC ();
bitmap_copy (new_path, path_map);
bitmap_set_bit (new_path, mod);
path_map = new_path;
bitmap imports = (*modules)[mod]->imports;
if (bitmap_intersect_compl_p (imports, visible))
{
/* IMPORTS contains additional modules to VISIBLE. */
bitmap new_visible = BITMAP_GGC_ALLOC ();
bitmap_ior (new_visible, visible, imports);
visible = new_visible;
}
}
tinst->path = path_map;
tinst->visible = visible;
}
*path_map_p = tinst->path;
return tinst->visible;
}
/* Return the bitmap describing what modules are visible along the
path of instantiation. If we're not an instantiation, this will be
the visible imports of the TU. *PATH_MAP_P is filled in with the
modules owning the instantiation path -- we see the module-linkage
entities of those modules. */
bitmap
visible_instantiation_path (bitmap *path_map_p)
{
if (!modules_p ())
return NULL;
return path_of_instantiation (current_instantiation (), path_map_p);
}
/* We've just directly imported IMPORT. Update our import/export
bitmaps. IS_EXPORT is true if we're reexporting the OTHER. */
void
module_state::set_import (module_state const *import, bool is_export)
{
gcc_checking_assert (this != import);
/* We see IMPORT's exports (which includes IMPORT). If IMPORT is
the primary interface or a partition we'll see its imports. */
bitmap_ior_into (imports, import->is_module () || import->is_partition ()
? import->imports : import->exports);
if (is_export)
/* We'll export OTHER's exports. */
bitmap_ior_into (exports, import->exports);
}
/* Return the declaring entity of DECL. That is the decl determining
how to decorate DECL with module information. Returns NULL_TREE if
it's the global module. */
tree
get_originating_module_decl (tree decl)
{
/* An enumeration constant. */
if (TREE_CODE (decl) == CONST_DECL
&& DECL_CONTEXT (decl)
&& (TREE_CODE (DECL_CONTEXT (decl)) == ENUMERAL_TYPE))
decl = TYPE_NAME (DECL_CONTEXT (decl));
else if (TREE_CODE (decl) == FIELD_DECL
|| TREE_CODE (decl) == USING_DECL)
{
decl = DECL_CONTEXT (decl);
if (TREE_CODE (decl) != FUNCTION_DECL)
decl = TYPE_NAME (decl);
}
gcc_checking_assert (TREE_CODE (decl) == TEMPLATE_DECL
|| TREE_CODE (decl) == FUNCTION_DECL
|| TREE_CODE (decl) == TYPE_DECL
|| TREE_CODE (decl) == VAR_DECL
|| TREE_CODE (decl) == CONCEPT_DECL
|| TREE_CODE (decl) == NAMESPACE_DECL);
for (;;)
{
/* Uninstantiated template friends are owned by the befriending
class -- not their context. */
if (TREE_CODE (decl) == TEMPLATE_DECL
&& DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P (decl))
decl = TYPE_NAME (DECL_CHAIN (decl));
int use;
if (tree ti = node_template_info (decl, use))
{
decl = TI_TEMPLATE (ti);
if (TREE_CODE (decl) != TEMPLATE_DECL)
{
/* A friend template specialization. */
gcc_checking_assert (OVL_P (decl));
return global_namespace;
}
}
else
{
tree ctx = CP_DECL_CONTEXT (decl);
if (TREE_CODE (ctx) == NAMESPACE_DECL)
break;
if (TYPE_P (ctx))
{
ctx = TYPE_NAME (ctx);
if (!ctx)
{
/* Some kind of internal type. */
gcc_checking_assert (DECL_ARTIFICIAL (decl));
return global_namespace;
}
}
decl = ctx;
}
}
return decl;
}
int
get_originating_module (tree decl, bool for_mangle)
{
tree owner = get_originating_module_decl (decl);
tree not_tmpl = STRIP_TEMPLATE (owner);
if (!DECL_LANG_SPECIFIC (not_tmpl))
return for_mangle ? -1 : 0;
if (for_mangle && !DECL_MODULE_ATTACH_P (not_tmpl))
return -1;
int mod = !DECL_MODULE_IMPORT_P (not_tmpl) ? 0 : get_importing_module (owner);
gcc_checking_assert (!for_mangle || !(*modules)[mod]->is_header ());
return mod;
}
unsigned
get_importing_module (tree decl, bool flexible)
{
unsigned index = import_entity_index (decl, flexible);
if (index == ~(~0u >> 1))
return -1;
module_state *module = import_entity_module (index);
return module->mod;
}
/* Is it permissible to redeclare DECL. */
bool
module_may_redeclare (tree decl)
{
for (;;)
{
tree ctx = CP_DECL_CONTEXT (decl);
if (TREE_CODE (ctx) == NAMESPACE_DECL)
// Found the namespace-scope decl.
break;
if (!CLASS_TYPE_P (ctx))
// We've met a non-class scope. Such a thing is not
// reopenable, so we must be ok.
return true;
decl = TYPE_NAME (ctx);
}
tree not_tmpl = STRIP_TEMPLATE (decl);
int use_tpl = 0;
if (node_template_info (not_tmpl, use_tpl) && use_tpl)
// Specializations of any kind can be redeclared anywhere.
// FIXME: Should we be checking this in more places on the scope chain?
return true;
if (!DECL_LANG_SPECIFIC (not_tmpl) || !DECL_MODULE_ATTACH_P (not_tmpl))
// Decl is attached to global module. Current scope needs to be too.
return !module_attach_p ();
module_state *me = (*modules)[0];
module_state *them = me;
if (DECL_LANG_SPECIFIC (not_tmpl) && DECL_MODULE_IMPORT_P (not_tmpl))
{
/* We can be given the TEMPLATE_RESULT. We want the
TEMPLATE_DECL. */
int use_tpl = -1;
if (tree ti = node_template_info (decl, use_tpl))
{
tree tmpl = TI_TEMPLATE (ti);
if (use_tpl == 2)
{
/* A partial specialization. Find that specialization's
template_decl. */
for (tree list = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
list; list = TREE_CHAIN (list))
if (DECL_TEMPLATE_RESULT (TREE_VALUE (list)) == decl)
{
decl = TREE_VALUE (list);
break;
}
}
else if (DECL_TEMPLATE_RESULT (tmpl) == decl)
decl = tmpl;
}
unsigned index = import_entity_index (decl);
them = import_entity_module (index);
}
// Decl is attached to named module. Current scope needs to be
// attaching to the same module.
if (!module_attach_p ())
return false;
// Both attached to named module.
if (me == them)
return true;
return me && get_primary (them) == get_primary (me);
}
/* DECL is being created by this TU. Record it came from here. We
record module purview, so we can see if partial or explicit
specialization needs to be written out, even though its purviewness
comes from the most general template. */
void
set_instantiating_module (tree decl)
{
gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
|| TREE_CODE (decl) == VAR_DECL
|| TREE_CODE (decl) == TYPE_DECL
|| TREE_CODE (decl) == CONCEPT_DECL
|| TREE_CODE (decl) == TEMPLATE_DECL
|| (TREE_CODE (decl) == NAMESPACE_DECL
&& DECL_NAMESPACE_ALIAS (decl)));
if (!modules_p ())
return;
decl = STRIP_TEMPLATE (decl);
if (!DECL_LANG_SPECIFIC (decl) && module_purview_p ())
retrofit_lang_decl (decl);
if (DECL_LANG_SPECIFIC (decl))
{
DECL_MODULE_PURVIEW_P (decl) = module_purview_p ();
/* If this was imported, we'll still be in the entity_hash. */
DECL_MODULE_IMPORT_P (decl) = false;
}
}
/* If DECL is a class member, whose class is not defined in this TU
(it was imported), remember this decl. */
void
set_defining_module (tree decl)
{
gcc_checking_assert (!DECL_LANG_SPECIFIC (decl)
|| !DECL_MODULE_IMPORT_P (decl));
if (module_has_cmi_p ())
{
tree ctx = DECL_CONTEXT (decl);
if (ctx
&& (TREE_CODE (ctx) == RECORD_TYPE || TREE_CODE (ctx) == UNION_TYPE)
&& DECL_LANG_SPECIFIC (TYPE_NAME (ctx))
&& DECL_MODULE_IMPORT_P (TYPE_NAME (ctx)))
{
/* This entity's context is from an import. We may need to
record this entity to make sure we emit it in the CMI.
Template specializations are in the template hash tables,
so we don't need to record them here as well. */
int use_tpl = -1;
tree ti = node_template_info (decl, use_tpl);
if (use_tpl <= 0)
{
if (ti)
{
gcc_checking_assert (!use_tpl);
/* Get to the TEMPLATE_DECL. */
decl = TI_TEMPLATE (ti);
}
/* Record it on the class_members list. */
vec_safe_push (class_members, decl);
}
}
else if (DECL_IMPLICIT_TYPEDEF_P (decl)
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
/* This is a partial or explicit specialization. */
vec_safe_push (partial_specializations, decl);
}
}
void
set_originating_module (tree decl, bool friend_p ATTRIBUTE_UNUSED)
{
set_instantiating_module (decl);
if (!DECL_NAMESPACE_SCOPE_P (decl))
return;
gcc_checking_assert (friend_p || decl == get_originating_module_decl (decl));
if (module_attach_p ())
{
retrofit_lang_decl (decl);
DECL_MODULE_ATTACH_P (decl) = true;
}
if (!module_exporting_p ())
return;
// FIXME: Check ill-formed linkage
DECL_MODULE_EXPORT_P (decl) = true;
}
/* DECL is keyed to CTX for odr purposes. */
void
maybe_key_decl (tree ctx, tree decl)
{
if (!modules_p ())
return;
// FIXME: For now just deal with lambdas attached to var decls.
// This might be sufficient?
if (TREE_CODE (ctx) != VAR_DECL)
return;
gcc_checking_assert (DECL_NAMESPACE_SCOPE_P (ctx));
if (!keyed_table)
keyed_table = new keyed_map_t (EXPERIMENT (1, 400));
auto &vec = keyed_table->get_or_insert (ctx);
if (!vec.length ())
{
retrofit_lang_decl (ctx);
DECL_MODULE_KEYED_DECLS_P (ctx) = true;
}
vec.safe_push (decl);
}
/* Create the flat name string. It is simplest to have it handy. */
void
module_state::set_flatname ()
{
gcc_checking_assert (!flatname);
if (parent)
{
auto_vec<tree,5> ids;
size_t len = 0;
char const *primary = NULL;
size_t pfx_len = 0;
for (module_state *probe = this;
probe;
probe = probe->parent)
if (is_partition () && !probe->is_partition ())
{
primary = probe->get_flatname ();
pfx_len = strlen (primary);
break;
}
else
{
ids.safe_push (probe->name);
len += IDENTIFIER_LENGTH (probe->name) + 1;
}
char *flat = XNEWVEC (char, pfx_len + len + is_partition ());
flatname = flat;
if (primary)
{
memcpy (flat, primary, pfx_len);
flat += pfx_len;
*flat++ = ':';
}
for (unsigned len = 0; ids.length ();)
{
if (len)
flat[len++] = '.';
tree elt = ids.pop ();
unsigned l = IDENTIFIER_LENGTH (elt);
memcpy (flat + len, IDENTIFIER_POINTER (elt), l + 1);
len += l;
}
}
else if (is_header ())
flatname = TREE_STRING_POINTER (name);
else
flatname = IDENTIFIER_POINTER (name);
}
/* Read the CMI file for a module. */
bool
module_state::do_import (cpp_reader *reader, bool outermost)
{
gcc_assert (global_namespace == current_scope () && loadedness == ML_NONE);
loc = linemap_module_loc (line_table, loc, get_flatname ());
if (lazy_open >= lazy_limit)
freeze_an_elf ();
int fd = -1;
int e = ENOENT;
if (filename)
{
const char *file = maybe_add_cmi_prefix (filename);
dump () && dump ("CMI is %s", file);
if (note_module_cmi_yes || inform_cmi_p)
inform (loc, "reading CMI %qs", file);
fd = open (file, O_RDONLY | O_CLOEXEC | O_BINARY);
e = errno;
}
gcc_checking_assert (!slurp);
slurp = new slurping (new elf_in (fd, e));
bool ok = true;
if (!from ()->get_error ())
{
announce ("importing");
loadedness = ML_CONFIG;
lazy_open++;
ok = read_initial (reader);
slurp->lru = ++lazy_lru;
}
gcc_assert (slurp->current == ~0u);
return check_read (outermost, ok);
}
/* Attempt to increase the file descriptor limit. */
static bool
try_increase_lazy (unsigned want)
{
gcc_checking_assert (lazy_open >= lazy_limit);
/* If we're increasing, saturate at hard limit. */
if (want > lazy_hard_limit && lazy_limit < lazy_hard_limit)
want = lazy_hard_limit;
#if HAVE_SETRLIMIT
if ((!lazy_limit || !param_lazy_modules)
&& lazy_hard_limit
&& want <= lazy_hard_limit)
{
struct rlimit rlimit;
rlimit.rlim_cur = want + LAZY_HEADROOM;
rlimit.rlim_max = lazy_hard_limit + LAZY_HEADROOM;
if (!setrlimit (RLIMIT_NOFILE, &rlimit))
lazy_limit = want;
}
#endif
return lazy_open < lazy_limit;
}
/* Pick a victim module to freeze its reader. */
void
module_state::freeze_an_elf ()
{
if (try_increase_lazy (lazy_open * 2))
return;
module_state *victim = NULL;
for (unsigned ix = modules->length (); ix--;)
{
module_state *candidate = (*modules)[ix];
if (candidate && candidate->slurp && candidate->slurp->lru
&& candidate->from ()->is_freezable ()
&& (!victim || victim->slurp->lru > candidate->slurp->lru))
victim = candidate;
}
if (victim)
{
dump () && dump ("Freezing '%s'", victim->filename);
if (victim->slurp->macro_defs.size)
/* Save the macro definitions to a buffer. */
victim->from ()->preserve (victim->slurp->macro_defs);
if (victim->slurp->macro_tbl.size)
/* Save the macro definitions to a buffer. */
victim->from ()->preserve (victim->slurp->macro_tbl);
victim->from ()->freeze ();
lazy_open--;
}
else
dump () && dump ("No module available for freezing");
}
/* Load the lazy slot *MSLOT, INDEX'th slot of the module. */
bool
module_state::lazy_load (unsigned index, binding_slot *mslot)
{
unsigned n = dump.push (this);
gcc_checking_assert (function_depth);
unsigned cookie = mslot->get_lazy ();
unsigned snum = cookie >> 2;
dump () && dump ("Loading entity %M[%u] section:%u", this, index, snum);
bool ok = load_section (snum, mslot);
dump.pop (n);
return ok;
}
/* Load MOD's binding for NS::ID into *MSLOT. *MSLOT contains the
lazy cookie. OUTER is true if this is the outermost lazy, (used
for diagnostics). */
void
lazy_load_binding (unsigned mod, tree ns, tree id, binding_slot *mslot)
{
int count = errorcount + warningcount;
timevar_start (TV_MODULE_IMPORT);
/* Stop GC happening, even in outermost loads (because our caller
could well be building up a lookup set). */
function_depth++;
gcc_checking_assert (mod);
module_state *module = (*modules)[mod];
unsigned n = dump.push (module);
unsigned snum = mslot->get_lazy ();
dump () && dump ("Lazily binding %P@%N section:%u", ns, id,
module->name, snum);
bool ok = !recursive_lazy (snum);
if (ok)
{
ok = module->load_section (snum, mslot);
lazy_snum = 0;
post_load_processing ();
}
dump.pop (n);
function_depth--;
timevar_stop (TV_MODULE_IMPORT);
if (!ok)
fatal_error (input_location,
module->is_header ()
? G_("failed to load binding %<%E%s%E%>")
: G_("failed to load binding %<%E%s%E@%s%>"),
ns, &"::"[ns == global_namespace ? 2 : 0], id,
module->get_flatname ());
if (count != errorcount + warningcount)
inform (input_location,
module->is_header ()
? G_("during load of binding %<%E%s%E%>")
: G_("during load of binding %<%E%s%E@%s%>"),
ns, &"::"[ns == global_namespace ? 2 : 0], id,
module->get_flatname ());
}
/* Load any pending entities keyed to the top-key of DECL. */
void
lazy_load_pendings (tree decl)
{
tree key_decl;
pending_key key;
key.ns = find_pending_key (decl, &key_decl);
key.id = DECL_NAME (key_decl);
auto *pending_vec = pending_table ? pending_table->get (key) : nullptr;
if (!pending_vec)
return;
int count = errorcount + warningcount;
timevar_start (TV_MODULE_IMPORT);
bool ok = !recursive_lazy ();
if (ok)
{
function_depth++; /* Prevent GC */
unsigned n = dump.push (NULL);
dump () && dump ("Reading %u pending entities keyed to %P",
pending_vec->length (), key.ns, key.id);
for (unsigned ix = pending_vec->length (); ix--;)
{
unsigned index = (*pending_vec)[ix];
binding_slot *slot = &(*entity_ary)[index];
if (slot->is_lazy ())
{
module_state *import = import_entity_module (index);
if (!import->lazy_load (index - import->entity_lwm, slot))
ok = false;
}
else if (dump ())
{
module_state *import = import_entity_module (index);
dump () && dump ("Entity %M[%u] already loaded",
import, index - import->entity_lwm);
}
}
pending_table->remove (key);
dump.pop (n);
lazy_snum = 0;
post_load_processing ();
function_depth--;
}
timevar_stop (TV_MODULE_IMPORT);
if (!ok)
fatal_error (input_location, "failed to load pendings for %<%E%s%E%>",
key.ns, &"::"[key.ns == global_namespace ? 2 : 0], key.id);
if (count != errorcount + warningcount)
inform (input_location, "during load of pendings for %<%E%s%E%>",
key.ns, &"::"[key.ns == global_namespace ? 2 : 0], key.id);
}
static void
direct_import (module_state *import, cpp_reader *reader)
{
timevar_start (TV_MODULE_IMPORT);
unsigned n = dump.push (import);
gcc_checking_assert (import->is_direct () && import->has_location ());
if (import->loadedness == ML_NONE)
if (!import->do_import (reader, true))
gcc_unreachable ();
if (import->loadedness < ML_LANGUAGE)
{
if (!keyed_table)
keyed_table = new keyed_map_t (EXPERIMENT (1, 400));
import->read_language (true);
}
(*modules)[0]->set_import (import, import->exported_p);
dump.pop (n);
timevar_stop (TV_MODULE_IMPORT);
}
/* Import module IMPORT. */
void
import_module (module_state *import, location_t from_loc, bool exporting_p,
tree, cpp_reader *reader)
{
if (!import->check_not_purview (from_loc))
return;
if (!import->is_header () && current_lang_depth ())
/* Only header units should appear inside language
specifications. The std doesn't specify this, but I think
that's an error in resolving US 033, because language linkage
is also our escape clause to getting things into the global
module, so we don't want to confuse things by having to think
about whether 'extern "C++" { import foo; }' puts foo's
contents into the global module all of a sudden. */
warning (0, "import of named module %qs inside language-linkage block",
import->get_flatname ());
if (exporting_p || module_exporting_p ())
import->exported_p = true;
if (import->loadedness != ML_NONE)
{
from_loc = ordinary_loc_of (line_table, from_loc);
linemap_module_reparent (line_table, import->loc, from_loc);
}
gcc_checking_assert (!import->module_p);
gcc_checking_assert (import->is_direct () && import->has_location ());
direct_import (import, reader);
}
/* Declare the name of the current module to be NAME. EXPORTING_p is
true if this TU is the exporting module unit. */
void
declare_module (module_state *module, location_t from_loc, bool exporting_p,
tree, cpp_reader *reader)
{
gcc_assert (global_namespace == current_scope ());
module_state *current = (*modules)[0];
if (module_purview_p () || module->loadedness > ML_CONFIG)
{
error_at (from_loc, module_purview_p ()
? G_("module already declared")
: G_("module already imported"));
if (module_purview_p ())
module = current;
inform (module->loc, module_purview_p ()
? G_("module %qs declared here")
: G_("module %qs imported here"),
module->get_flatname ());
return;
}
gcc_checking_assert (module->module_p);
gcc_checking_assert (module->is_direct () && module->has_location ());
/* Yer a module, 'arry. */
module_kind = module->is_header () ? MK_HEADER : MK_NAMED | MK_ATTACH;
// Even in header units, we consider the decls to be purview
module_kind |= MK_PURVIEW;
if (module->is_partition ())
module_kind |= MK_PARTITION;
if (exporting_p)
{
module->interface_p = true;
module_kind |= MK_INTERFACE;
}
if (module_has_cmi_p ())
{
/* Copy the importing information we may have already done. We
do not need to separate out the imports that only happen in
the GMF, inspite of what the literal wording of the std
might imply. See p2191, the core list had a discussion
where the module implementors agreed that the GMF of a named
module is invisible to importers. */
module->imports = current->imports;
module->mod = 0;
(*modules)[0] = module;
}
else
{
module->interface_p = true;
current->parent = module; /* So mangler knows module identity. */
direct_import (module, reader);
}
}
/* Return true IFF we must emit a module global initializer function
(which will be called by importers' init code). */
bool
module_global_init_needed ()
{
return module_has_cmi_p () && !header_module_p ();
}
/* Calculate which, if any, import initializers need calling. */
bool
module_determine_import_inits ()
{
if (!modules || header_module_p ())
return false;
/* Prune active_init_p. We need the same bitmap allocation
scheme as for the imports member. */
function_depth++; /* Disable GC. */
bitmap covered_imports (BITMAP_GGC_ALLOC ());
bool any = false;
/* Because indirect imports are before their direct import, and
we're scanning the array backwards, we only need one pass! */
for (unsigned ix = modules->length (); --ix;)
{
module_state *import = (*modules)[ix];
if (!import->active_init_p)
;
else if (bitmap_bit_p (covered_imports, ix))
import->active_init_p = false;
else
{
/* Everything this imports is therefore handled by its
initializer, so doesn't need initializing by us. */
bitmap_ior_into (covered_imports, import->imports);
any = true;
}
}
function_depth--;
return any;
}
/* Emit calls to each direct import's global initializer. Including
direct imports of directly imported header units. The initializers
of (static) entities in header units will be called by their
importing modules (for the instance contained within that), or by
the current TU (for the instances we've brought in). Of course
such header unit behaviour is evil, but iostream went through that
door some time ago. */
void
module_add_import_initializers ()
{
if (!modules || header_module_p ())
return;
tree fntype = build_function_type (void_type_node, void_list_node);
releasing_vec args; // There are no args
for (unsigned ix = modules->length (); --ix;)
{
module_state *import = (*modules)[ix];
if (import->active_init_p)
{
tree name = mangle_module_global_init (ix);
tree fndecl = build_lang_decl (FUNCTION_DECL, name, fntype);
DECL_CONTEXT (fndecl) = FROB_CONTEXT (global_namespace);
SET_DECL_ASSEMBLER_NAME (fndecl, name);
TREE_PUBLIC (fndecl) = true;
determine_visibility (fndecl);
tree call = cp_build_function_call_vec (fndecl, &args,
tf_warning_or_error);
finish_expr_stmt (call);
}
}
}
/* NAME & LEN are a preprocessed header name, possibly including the
surrounding "" or <> characters. Return the raw string name of the
module to which it refers. This will be an absolute path, or begin
with ./, so it is immediately distinguishable from a (non-header
unit) module name. If READER is non-null, ask the preprocessor to
locate the header to which it refers using the appropriate include
path. Note that we do never do \ processing of the string, as that
matches the preprocessor's behaviour. */
static const char *
canonicalize_header_name (cpp_reader *reader, location_t loc, bool unquoted,
const char *str, size_t &len_r)
{
size_t len = len_r;
static char *buf = 0;
static size_t alloc = 0;
if (!unquoted)
{
gcc_checking_assert (len >= 2
&& ((reader && str[0] == '<' && str[len-1] == '>')
|| (str[0] == '"' && str[len-1] == '"')));
str += 1;
len -= 2;
}
if (reader)
{
gcc_assert (!unquoted);
if (len >= alloc)
{
alloc = len + 1;
buf = XRESIZEVEC (char, buf, alloc);
}
memcpy (buf, str, len);
buf[len] = 0;
if (const char *hdr
= cpp_probe_header_unit (reader, buf, str[-1] == '<', loc))
{
len = strlen (hdr);
str = hdr;
}
else
str = buf;
}
if (!(str[0] == '.' ? IS_DIR_SEPARATOR (str[1]) : IS_ABSOLUTE_PATH (str)))
{
/* Prepend './' */
if (len + 3 > alloc)
{
alloc = len + 3;
buf = XRESIZEVEC (char, buf, alloc);
}
buf[0] = '.';
buf[1] = DIR_SEPARATOR;
memmove (buf + 2, str, len);
len += 2;
buf[len] = 0;
str = buf;
}
len_r = len;
return str;
}
/* Set the CMI name from a cody packet. Issue an error if
ill-formed. */
void module_state::set_filename (const Cody::Packet &packet)
{
gcc_checking_assert (!filename);
if (packet.GetCode () == Cody::Client::PC_PATHNAME)
filename = xstrdup (packet.GetString ().c_str ());
else
{
gcc_checking_assert (packet.GetCode () == Cody::Client::PC_ERROR);
error_at (loc, "unknown Compiled Module Interface: %s",
packet.GetString ().c_str ());
}
}
/* Figure out whether to treat HEADER as an include or an import. */
static char *
maybe_translate_include (cpp_reader *reader, line_maps *lmaps, location_t loc,
const char *path)
{
if (!modules_p ())
{
/* Turn off. */
cpp_get_callbacks (reader)->translate_include = NULL;
return nullptr;
}
if (!spans.init_p ())
/* Before the main file, don't divert. */
return nullptr;
dump.push (NULL);
dump () && dump ("Checking include translation '%s'", path);
auto *mapper = get_mapper (cpp_main_loc (reader));
size_t len = strlen (path);
path = canonicalize_header_name (NULL, loc, true, path, len);
auto packet = mapper->IncludeTranslate (path, Cody::Flags::None, len);
int xlate = false;
if (packet.GetCode () == Cody::Client::PC_BOOL)
xlate = -int (packet.GetInteger ());
else if (packet.GetCode () == Cody::Client::PC_PATHNAME)
{
/* Record the CMI name for when we do the import. */
module_state *import = get_module (build_string (len, path));
import->set_filename (packet);
xlate = +1;
}
else
{
gcc_checking_assert (packet.GetCode () == Cody::Client::PC_ERROR);
error_at (loc, "cannot determine %<#include%> translation of %s: %s",
path, packet.GetString ().c_str ());
}
bool note = false;
if (note_include_translate_yes && xlate > 1)
note = true;
else if (note_include_translate_no && xlate == 0)
note = true;
else if (note_includes)
/* We do not expect the note_includes vector to be large, so O(N)
iteration. */
for (unsigned ix = note_includes->length (); !note && ix--;)
if (!strcmp ((*note_includes)[ix], path))
note = true;
if (note)
inform (loc, xlate
? G_("include %qs translated to import")
: G_("include %qs processed textually") , path);
dump () && dump (xlate ? "Translating include to import"
: "Keeping include as include");
dump.pop (0);
if (!(xlate > 0))
return nullptr;
/* Create the translation text. */
loc = ordinary_loc_of (lmaps, loc);
const line_map_ordinary *map
= linemap_check_ordinary (linemap_lookup (lmaps, loc));
unsigned col = SOURCE_COLUMN (map, loc);
col -= (col != 0); /* Columns are 1-based. */
unsigned alloc = len + col + 60;
char *res = XNEWVEC (char, alloc);
strcpy (res, "__import");
unsigned actual = 8;
if (col > actual)
{
/* Pad out so the filename appears at the same position. */
memset (res + actual, ' ', col - actual);
actual = col;
}
/* No need to encode characters, that's not how header names are
handled. */
actual += snprintf (res + actual, alloc - actual,
"\"%s\" [[__translated]];\n", path);
gcc_checking_assert (actual < alloc);
/* cpplib will delete the buffer. */
return res;
}
static void
begin_header_unit (cpp_reader *reader)
{
/* Set the module header name from the main_input_filename. */
const char *main = main_input_filename;
size_t len = strlen (main);
main = canonicalize_header_name (NULL, 0, true, main, len);
module_state *module = get_module (build_string (len, main));
preprocess_module (module, cpp_main_loc (reader), false, false, true, reader);
}
/* We've just properly entered the main source file. I.e. after the
command line, builtins and forced headers. Record the line map and
location of this map. Note we may be called more than once. The
first call sticks. */
void
module_begin_main_file (cpp_reader *reader, line_maps *lmaps,
const line_map_ordinary *map)
{
gcc_checking_assert (lmaps == line_table);
if (modules_p () && !spans.init_p ())
{
unsigned n = dump.push (NULL);
spans.init (lmaps, map);
dump.pop (n);
if (flag_header_unit && !cpp_get_options (reader)->preprocessed)
{
/* Tell the preprocessor this is an include file. */
cpp_retrofit_as_include (reader);
begin_header_unit (reader);
}
}
}
/* Process the pending_import queue, making sure we know the
filenames. */
static void
name_pending_imports (cpp_reader *reader)
{
auto *mapper = get_mapper (cpp_main_loc (reader));
if (!vec_safe_length (pending_imports))
/* Not doing anything. */
return;
timevar_start (TV_MODULE_MAPPER);
auto n = dump.push (NULL);
dump () && dump ("Resolving direct import names");
bool want_deps = (bool (mapper->get_flags () & Cody::Flags::NameOnly)
|| cpp_get_deps (reader));
bool any = false;
for (unsigned ix = 0; ix != pending_imports->length (); ix++)
{
module_state *module = (*pending_imports)[ix];
gcc_checking_assert (module->is_direct ());
if (!module->filename && !module->visited_p)
{
bool export_p = (module->module_p
&& (module->is_partition () || module->exported_p));
Cody::Flags flags = Cody::Flags::None;
if (flag_preprocess_only
&& !(module->is_header () && !export_p))
{
if (!want_deps)
continue;
flags = Cody::Flags::NameOnly;
}
if (!any)
{
any = true;
mapper->Cork ();
}
if (export_p)
mapper->ModuleExport (module->get_flatname (), flags);
else
mapper->ModuleImport (module->get_flatname (), flags);
module->visited_p = true;
}
}
if (any)
{
auto response = mapper->Uncork ();
auto r_iter = response.begin ();
for (unsigned ix = 0; ix != pending_imports->length (); ix++)
{
module_state *module = (*pending_imports)[ix];
if (module->visited_p)
{
module->visited_p = false;
gcc_checking_assert (!module->filename);
module->set_filename (*r_iter);
++r_iter;
}
}
}
dump.pop (n);
timevar_stop (TV_MODULE_MAPPER);
}
/* We've just lexed a module-specific control line for MODULE. Mark
the module as a direct import, and possibly load up its macro
state. Returns the primary module, if this is a module
declaration. */
/* Perhaps we should offer a preprocessing mode where we read the
directives from the header unit, rather than require the header's
CMI. */
module_state *
preprocess_module (module_state *module, location_t from_loc,
bool in_purview, bool is_import, bool is_export,
cpp_reader *reader)
{
if (!is_import)
{
if (module->loc)
/* It's already been mentioned, so ignore its module-ness. */
is_import = true;
else
{
/* Record it is the module. */
module->module_p = true;
if (is_export)
{
module->exported_p = true;
module->interface_p = true;
}
}
}
if (module->directness < MD_DIRECT + in_purview)
{
/* Mark as a direct import. */
module->directness = module_directness (MD_DIRECT + in_purview);
/* Set the location to be most informative for users. */
from_loc = ordinary_loc_of (line_table, from_loc);
if (module->loadedness != ML_NONE)
linemap_module_reparent (line_table, module->loc, from_loc);
else
{
module->loc = from_loc;
if (!module->flatname)
module->set_flatname ();
}
}
auto desired = ML_CONFIG;
if (is_import
&& module->is_header ()
&& (!cpp_get_options (reader)->preprocessed
|| cpp_get_options (reader)->directives_only))
/* We need preprocessor state now. */
desired = ML_PREPROCESSOR;
if (!is_import || module->loadedness < desired)
{
vec_safe_push (pending_imports, module);
if (desired == ML_PREPROCESSOR)
{
unsigned n = dump.push (NULL);
dump () && dump ("Reading %M preprocessor state", module);
name_pending_imports (reader);
/* Preserve the state of the line-map. */
unsigned pre_hwm = LINEMAPS_ORDINARY_USED (line_table);
/* We only need to close the span, if we're going to emit a
CMI. But that's a little tricky -- our token scanner
needs to be smarter -- and this isn't much state.
Remember, we've not parsed anything at this point, so
our module state flags are inadequate. */
spans.maybe_init ();
spans.close ();
timevar_start (TV_MODULE_IMPORT);
/* Load the config of each pending import -- we must assign
module numbers monotonically. */
for (unsigned ix = 0; ix != pending_imports->length (); ix++)
{
auto *import = (*pending_imports)[ix];
if (!(import->module_p
&& (import->is_partition () || import->exported_p))
&& import->loadedness == ML_NONE
&& (import->is_header () || !flag_preprocess_only))
{
unsigned n = dump.push (import);
import->do_import (reader, true);
dump.pop (n);
}
}
vec_free (pending_imports);
/* Restore the line-map state. */
spans.open (linemap_module_restore (line_table, pre_hwm));
/* Now read the preprocessor state of this particular
import. */
if (module->loadedness == ML_CONFIG
&& module->read_preprocessor (true))
module->import_macros ();
timevar_stop (TV_MODULE_IMPORT);
dump.pop (n);
}
}
return is_import ? NULL : get_primary (module);
}
/* We've completed phase-4 translation. Emit any dependency
information for the not-yet-loaded direct imports, and fill in
their file names. We'll have already loaded up the direct header
unit wavefront. */
void
preprocessed_module (cpp_reader *reader)
{
unsigned n = dump.push (NULL);
dump () && dump ("Completed phase-4 (tokenization) processing");
name_pending_imports (reader);
vec_free (pending_imports);
spans.maybe_init ();
spans.close ();
using iterator = hash_table<module_state_hash>::iterator;
if (mkdeps *deps = cpp_get_deps (reader))
{
/* Walk the module hash, informing the dependency machinery. */
iterator end = modules_hash->end ();
for (iterator iter = modules_hash->begin (); iter != end; ++iter)
{
module_state *module = *iter;
if (module->is_direct ())
{
if (module->is_module ()
&& (module->is_interface () || module->is_partition ()))
deps_add_module_target (deps, module->get_flatname (),
maybe_add_cmi_prefix (module->filename),
module->is_header());
else
deps_add_module_dep (deps, module->get_flatname ());
}
}
}
if (flag_header_unit && !flag_preprocess_only)
{
/* Find the main module -- remember, it's not yet in the module
array. */
iterator end = modules_hash->end ();
for (iterator iter = modules_hash->begin (); iter != end; ++iter)
{
module_state *module = *iter;
if (module->is_module ())
{
declare_module (module, cpp_main_loc (reader), true, NULL, reader);
module_kind |= MK_EXPORTING;
break;
}
}
}
dump.pop (n);
}
/* VAL is a global tree, add it to the global vec if it is
interesting. Add some of its targets, if they too are
interesting. We do not add identifiers, as they can be re-found
via the identifier hash table. There is a cost to the number of
global trees. */
static int
maybe_add_global (tree val, unsigned &crc)
{
int v = 0;
if (val && !(identifier_p (val) || TREE_VISITED (val)))
{
TREE_VISITED (val) = true;
crc = crc32_unsigned (crc, fixed_trees->length ());
vec_safe_push (fixed_trees, val);
v++;
if (CODE_CONTAINS_STRUCT (TREE_CODE (val), TS_TYPED))
v += maybe_add_global (TREE_TYPE (val), crc);
if (CODE_CONTAINS_STRUCT (TREE_CODE (val), TS_TYPE_COMMON))
v += maybe_add_global (TYPE_NAME (val), crc);
}
return v;
}
/* Initialize module state. Create the hash table, determine the
global trees. Create the module for current TU. */
void
init_modules (cpp_reader *reader)
{
/* PCH should not be reachable because of lang-specs, but the
user could have overriden that. */
if (pch_file)
fatal_error (input_location,
"C++ modules are incompatible with precompiled headers");
if (cpp_get_options (reader)->traditional)
fatal_error (input_location,
"C++ modules are incompatible with traditional preprocessing");
if (flag_preprocess_only)
{
cpp_options *cpp_opts = cpp_get_options (reader);
if (flag_no_output
|| (cpp_opts->deps.style != DEPS_NONE
&& !cpp_opts->deps.need_preprocessor_output))
{
warning (0, flag_dump_macros == 'M'
? G_("macro debug output may be incomplete with modules")
: G_("module dependencies require preprocessing"));
if (cpp_opts->deps.style != DEPS_NONE)
inform (input_location, "you should use the %<-%s%> option",
cpp_opts->deps.style == DEPS_SYSTEM ? "MD" : "MMD");
}
}
/* :: is always exported. */
DECL_MODULE_EXPORT_P (global_namespace) = true;
modules_hash = hash_table<module_state_hash>::create_ggc (31);
vec_safe_reserve (modules, 20);
/* Create module for current TU. */
module_state *current
= new (ggc_alloc<module_state> ()) module_state (NULL_TREE, NULL, false);
current->mod = 0;
bitmap_set_bit (current->imports, 0);
modules->quick_push (current);
gcc_checking_assert (!fixed_trees);
headers = BITMAP_GGC_ALLOC ();
if (note_includes)
/* Canonicalize header names. */
for (unsigned ix = 0; ix != note_includes->length (); ix++)
{
const char *hdr = (*note_includes)[ix];
size_t len = strlen (hdr);
bool system = hdr[0] == '<';
bool user = hdr[0] == '"';
bool delimed = system || user;
if (len <= (delimed ? 2 : 0)
|| (delimed && hdr[len-1] != (system ? '>' : '"')))
error ("invalid header name %qs", hdr);
hdr = canonicalize_header_name (delimed ? reader : NULL,
0, !delimed, hdr, len);
char *path = XNEWVEC (char, len + 1);
memcpy (path, hdr, len);
path[len] = 0;
(*note_includes)[ix] = path;
}
if (note_cmis)
/* Canonicalize & mark module names. */
for (unsigned ix = 0; ix != note_cmis->length (); ix++)
{
const char *name = (*note_cmis)[ix];
size_t len = strlen (name);
bool is_system = name[0] == '<';
bool is_user = name[0] == '"';
bool is_pathname = false;
if (!(is_system || is_user))
for (unsigned ix = len; !is_pathname && ix--;)
is_pathname = IS_DIR_SEPARATOR (name[ix]);
if (is_system || is_user || is_pathname)
{
if (len <= (is_pathname ? 0 : 2)
|| (!is_pathname && name[len-1] != (is_system ? '>' : '"')))
{
error ("invalid header name %qs", name);
continue;
}
else
name = canonicalize_header_name (is_pathname ? nullptr : reader,
0, is_pathname, name, len);
}
if (auto module = get_module (name))
module->inform_cmi_p = 1;
else
error ("invalid module name %qs", name);
}
dump.push (NULL);
/* Determine lazy handle bound. */
{
unsigned limit = 1000;
#if HAVE_GETRLIMIT
struct rlimit rlimit;
if (!getrlimit (RLIMIT_NOFILE, &rlimit))
{
lazy_hard_limit = (rlimit.rlim_max < 1000000
? unsigned (rlimit.rlim_max) : 1000000);
lazy_hard_limit = (lazy_hard_limit > LAZY_HEADROOM
? lazy_hard_limit - LAZY_HEADROOM : 0);
if (rlimit.rlim_cur < limit)
limit = unsigned (rlimit.rlim_cur);
}
#endif
limit = limit > LAZY_HEADROOM ? limit - LAZY_HEADROOM : 1;
if (unsigned parm = param_lazy_modules)
{
if (parm <= limit || !lazy_hard_limit || !try_increase_lazy (parm))
lazy_limit = parm;
}
else
lazy_limit = limit;
}
if (dump ())
{
verstr_t ver;
version2string (MODULE_VERSION, ver);
dump ("Source: %s", main_input_filename);
dump ("Compiler: %s", version_string);
dump ("Modules: %s", ver);
dump ("Checking: %s",
#if CHECKING_P
"checking"
#elif ENABLE_ASSERT_CHECKING
"asserting"
#else
"release"
#endif
);
dump ("Compiled by: "
#ifdef __GNUC__
"GCC %d.%d, %s", __GNUC__, __GNUC_MINOR__,
#ifdef __OPTIMIZE__
"optimizing"
#else
"not optimizing"
#endif
#else
"not GCC"
#endif
);
dump ("Reading: %s", MAPPED_READING ? "mmap" : "fileio");
dump ("Writing: %s", MAPPED_WRITING ? "mmap" : "fileio");
dump ("Lazy limit: %u", lazy_limit);
dump ("Lazy hard limit: %u", lazy_hard_limit);
dump ("");
}
/* Construct the global tree array. This is an array of unique
global trees (& types). Do this now, rather than lazily, as
some global trees are lazily created and we don't want that to
mess with our syndrome of fixed trees. */
unsigned crc = 0;
vec_alloc (fixed_trees, 200);
dump () && dump ("+Creating globals");
/* Insert the TRANSLATION_UNIT_DECL. */
TREE_VISITED (DECL_CONTEXT (global_namespace)) = true;
fixed_trees->quick_push (DECL_CONTEXT (global_namespace));
for (unsigned jx = 0; global_tree_arys[jx].first; jx++)
{
const tree *ptr = global_tree_arys[jx].first;
unsigned limit = global_tree_arys[jx].second;
for (unsigned ix = 0; ix != limit; ix++, ptr++)
{
!(ix & 31) && dump ("") && dump ("+\t%u:%u:", jx, ix);
unsigned v = maybe_add_global (*ptr, crc);
dump () && dump ("+%u", v);
}
}
global_crc = crc32_unsigned (crc, fixed_trees->length ());
dump ("") && dump ("Created %u unique globals, crc=%x",
fixed_trees->length (), global_crc);
for (unsigned ix = fixed_trees->length (); ix--;)
TREE_VISITED ((*fixed_trees)[ix]) = false;
dump.pop (0);
if (!flag_module_lazy)
/* Get the mapper now, if we're not being lazy. */
get_mapper (cpp_main_loc (reader));
if (!flag_preprocess_only)
{
pending_table = new pending_map_t (EXPERIMENT (1, 400));
entity_map = new entity_map_t (EXPERIMENT (1, 400));
vec_safe_reserve (entity_ary, EXPERIMENT (1, 400));
}
#if CHECKING_P
note_defs = note_defs_table_t::create_ggc (1000);
#endif
if (flag_header_unit && cpp_get_options (reader)->preprocessed)
begin_header_unit (reader);
/* Collect here to make sure things are tagged correctly (when
aggressively GC'd). */
ggc_collect ();
}
/* If NODE is a deferred macro, load it. */
static int
load_macros (cpp_reader *reader, cpp_hashnode *node, void *)
{
location_t main_loc
= MAP_START_LOCATION (LINEMAPS_ORDINARY_MAP_AT (line_table, 0));
if (cpp_user_macro_p (node)
&& !node->value.macro)
{
cpp_macro *macro = cpp_get_deferred_macro (reader, node, main_loc);
dump () && dump ("Loaded macro #%s %I",
macro ? "define" : "undef", identifier (node));
}
return 1;
}
/* At the end of tokenizing, we no longer need the macro tables of
imports. But the user might have requested some checking. */
void
maybe_check_all_macros (cpp_reader *reader)
{
if (!warn_imported_macros)
return;
/* Force loading of any remaining deferred macros. This will
produce diagnostics if they are ill-formed. */
unsigned n = dump.push (NULL);
cpp_forall_identifiers (reader, load_macros, NULL);
dump.pop (n);
}
// State propagated from finish_module_processing to fini_modules
struct module_processing_cookie
{
elf_out out;
module_state_config config;
char *cmi_name;
char *tmp_name;
unsigned crc;
bool began;
module_processing_cookie (char *cmi, char *tmp, int fd, int e)
: out (fd, e), cmi_name (cmi), tmp_name (tmp), crc (0), began (false)
{
}
~module_processing_cookie ()
{
XDELETEVEC (tmp_name);
XDELETEVEC (cmi_name);
}
};
/* Write the CMI, if we're a module interface. */
void *
finish_module_processing (cpp_reader *reader)
{
module_processing_cookie *cookie = nullptr;
if (header_module_p ())
module_kind &= ~MK_EXPORTING;
if (!modules || !(*modules)[0]->name)
{
if (flag_module_only)
warning (0, "%<-fmodule-only%> used for non-interface");
}
else if (!flag_syntax_only)
{
int fd = -1;
int e = -1;
timevar_start (TV_MODULE_EXPORT);
/* Force a valid but empty line map at the end. This simplifies
the line table preparation and writing logic. */
linemap_add (line_table, LC_ENTER, false, "", 0);
/* We write to a tmpname, and then atomically rename. */
char *cmi_name = NULL;
char *tmp_name = NULL;
module_state *state = (*modules)[0];
unsigned n = dump.push (state);
state->announce ("creating");
if (state->filename)
{
size_t len = 0;
cmi_name = xstrdup (maybe_add_cmi_prefix (state->filename, &len));
tmp_name = XNEWVEC (char, len + 3);
memcpy (tmp_name, cmi_name, len);
strcpy (&tmp_name[len], "~");
if (!errorcount)
for (unsigned again = 2; ; again--)
{
fd = open (tmp_name,
O_RDWR | O_CREAT | O_TRUNC | O_CLOEXEC | O_BINARY,
S_IRUSR|S_IWUSR|S_IRGRP|S_IWGRP|S_IROTH|S_IWOTH);
e = errno;
if (fd >= 0 || !again || e != ENOENT)
break;
create_dirs (tmp_name);
}
if (note_module_cmi_yes || state->inform_cmi_p)
inform (state->loc, "writing CMI %qs", cmi_name);
dump () && dump ("CMI is %s", cmi_name);
}
cookie = new module_processing_cookie (cmi_name, tmp_name, fd, e);
if (errorcount)
warning_at (state->loc, 0, "not writing module %qs due to errors",
state->get_flatname ());
else if (cookie->out.begin ())
{
cookie->began = true;
auto loc = input_location;
/* So crashes finger-point the module decl. */
input_location = state->loc;
state->write_begin (&cookie->out, reader, cookie->config, cookie->crc);
input_location = loc;
}
dump.pop (n);
timevar_stop (TV_MODULE_EXPORT);
ggc_collect ();
}
if (modules)
{
unsigned n = dump.push (NULL);
dump () && dump ("Imported %u modules", modules->length () - 1);
dump () && dump ("Containing %u clusters", available_clusters);
dump () && dump ("Loaded %u clusters (%u%%)", loaded_clusters,
(loaded_clusters * 100 + available_clusters / 2) /
(available_clusters + !available_clusters));
dump.pop (n);
}
return cookie;
}
// Do the final emission of a module. At this point we know whether
// the module static initializer is a NOP or not.
static void
late_finish_module (cpp_reader *reader, module_processing_cookie *cookie,
bool init_fn_non_empty)
{
timevar_start (TV_MODULE_EXPORT);
module_state *state = (*modules)[0];
unsigned n = dump.push (state);
state->announce ("finishing");
cookie->config.active_init = init_fn_non_empty;
if (cookie->began)
state->write_end (&cookie->out, reader, cookie->config, cookie->crc);
if (cookie->out.end () && cookie->cmi_name)
{
/* Some OS's do not replace NEWNAME if it already exists.
This'll have a race condition in erroneous concurrent
builds. */
unlink (cookie->cmi_name);
if (rename (cookie->tmp_name, cookie->cmi_name))
{
dump () && dump ("Rename ('%s','%s') errno=%u",
cookie->tmp_name, cookie->cmi_name, errno);
cookie->out.set_error (errno);
}
}
if (cookie->out.get_error () && cookie->began)
{
error_at (state->loc, "failed to write compiled module: %s",
cookie->out.get_error (state->filename));
state->note_cmi_name ();
}
if (!errorcount)
{
auto *mapper = get_mapper (cpp_main_loc (reader));
mapper->ModuleCompiled (state->get_flatname ());
}
else if (cookie->cmi_name)
{
/* We failed, attempt to erase all evidence we even tried. */
unlink (cookie->tmp_name);
unlink (cookie->cmi_name);
}
delete cookie;
dump.pop (n);
timevar_stop (TV_MODULE_EXPORT);
}
void
fini_modules (cpp_reader *reader, void *cookie, bool has_inits)
{
if (cookie)
late_finish_module (reader,
static_cast<module_processing_cookie *> (cookie),
has_inits);
/* We're done with the macro tables now. */
vec_free (macro_exports);
vec_free (macro_imports);
headers = NULL;
/* We're now done with everything but the module names. */
set_cmi_repo (NULL);
if (mapper)
{
timevar_start (TV_MODULE_MAPPER);
module_client::close_module_client (0, mapper);
mapper = nullptr;
timevar_stop (TV_MODULE_MAPPER);
}
module_state_config::release ();
#if CHECKING_P
note_defs = NULL;
#endif
if (modules)
for (unsigned ix = modules->length (); --ix;)
if (module_state *state = (*modules)[ix])
state->release ();
/* No need to lookup modules anymore. */
modules_hash = NULL;
/* Or entity array. We still need the entity map to find import numbers. */
vec_free (entity_ary);
entity_ary = NULL;
/* Or remember any pending entities. */
delete pending_table;
pending_table = NULL;
/* Or any keys -- Let it go! */
delete keyed_table;
keyed_table = NULL;
/* Allow a GC, we've possibly made much data unreachable. */
ggc_collect ();
}
/* If CODE is a module option, handle it & return true. Otherwise
return false. For unknown reasons I cannot get the option
generation machinery to set fmodule-mapper or -fmodule-header to
make a string type option variable. */
bool
handle_module_option (unsigned code, const char *str, int)
{
auto hdr = CMS_header;
switch (opt_code (code))
{
case OPT_fmodule_mapper_:
module_mapper_name = str;
return true;
case OPT_fmodule_header_:
{
if (!strcmp (str, "user"))
hdr = CMS_user;
else if (!strcmp (str, "system"))
hdr = CMS_system;
else
error ("unknown header kind %qs", str);
}
/* Fallthrough. */
case OPT_fmodule_header:
flag_header_unit = hdr;
flag_modules = 1;
return true;
case OPT_flang_info_include_translate_:
vec_safe_push (note_includes, str);
return true;
case OPT_flang_info_module_cmi_:
vec_safe_push (note_cmis, str);
return true;
default:
return false;
}
}
/* Set preprocessor callbacks and options for modules. */
void
module_preprocess_options (cpp_reader *reader)
{
gcc_checking_assert (!lang_hooks.preprocess_undef);
if (modules_p ())
{
auto *cb = cpp_get_callbacks (reader);
cb->translate_include = maybe_translate_include;
cb->user_deferred_macro = module_state::deferred_macro;
if (flag_header_unit)
{
/* If the preprocessor hook is already in use, that
implementation will call the undef langhook. */
if (cb->undef)
lang_hooks.preprocess_undef = module_state::undef_macro;
else
cb->undef = module_state::undef_macro;
}
auto *opt = cpp_get_options (reader);
opt->module_directives = true;
opt->main_search = cpp_main_search (flag_header_unit);
}
}
#include "gt-cp-module.h"
|