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
|
/* Callgraph handling code.
Copyright (C) 2003-2019 Free Software Foundation, Inc.
Contributed by Jan Hubicka
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/>. */
/* This file contains basic routines manipulating call graph
The call-graph is a data structure designed for inter-procedural
optimization. It represents a multi-graph where nodes are functions
(symbols within symbol table) and edges are call sites. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "backend.h"
#include "target.h"
#include "rtl.h"
#include "tree.h"
#include "gimple.h"
#include "predict.h"
#include "alloc-pool.h"
#include "gimple-ssa.h"
#include "cgraph.h"
#include "lto-streamer.h"
#include "fold-const.h"
#include "varasm.h"
#include "calls.h"
#include "print-tree.h"
#include "langhooks.h"
#include "intl.h"
#include "tree-eh.h"
#include "gimple-iterator.h"
#include "tree-cfg.h"
#include "tree-ssa.h"
#include "value-prof.h"
#include "ipa-utils.h"
#include "symbol-summary.h"
#include "tree-vrp.h"
#include "ipa-prop.h"
#include "ipa-fnsummary.h"
#include "cfgloop.h"
#include "gimple-pretty-print.h"
#include "tree-dfa.h"
#include "profile.h"
#include "params.h"
#include "context.h"
#include "gimplify.h"
#include "stringpool.h"
#include "attribs.h"
#include "selftest.h"
/* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
#include "tree-pass.h"
/* Queue of cgraph nodes scheduled to be lowered. */
symtab_node *x_cgraph_nodes_queue;
#define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
/* Symbol table global context. */
symbol_table *symtab;
/* List of hooks triggered on cgraph_edge events. */
struct cgraph_edge_hook_list {
cgraph_edge_hook hook;
void *data;
struct cgraph_edge_hook_list *next;
};
/* List of hooks triggered on cgraph_node events. */
struct cgraph_node_hook_list {
cgraph_node_hook hook;
void *data;
struct cgraph_node_hook_list *next;
};
/* List of hooks triggered on events involving two cgraph_edges. */
struct cgraph_2edge_hook_list {
cgraph_2edge_hook hook;
void *data;
struct cgraph_2edge_hook_list *next;
};
/* List of hooks triggered on events involving two cgraph_nodes. */
struct cgraph_2node_hook_list {
cgraph_2node_hook hook;
void *data;
struct cgraph_2node_hook_list *next;
};
/* Hash descriptor for cgraph_function_version_info. */
struct function_version_hasher : ggc_ptr_hash<cgraph_function_version_info>
{
static hashval_t hash (cgraph_function_version_info *);
static bool equal (cgraph_function_version_info *,
cgraph_function_version_info *);
};
/* Map a cgraph_node to cgraph_function_version_info using this htab.
The cgraph_function_version_info has a THIS_NODE field that is the
corresponding cgraph_node.. */
static GTY(()) hash_table<function_version_hasher> *cgraph_fnver_htab = NULL;
/* Hash function for cgraph_fnver_htab. */
hashval_t
function_version_hasher::hash (cgraph_function_version_info *ptr)
{
int uid = ptr->this_node->get_uid ();
return (hashval_t)(uid);
}
/* eq function for cgraph_fnver_htab. */
bool
function_version_hasher::equal (cgraph_function_version_info *n1,
cgraph_function_version_info *n2)
{
return n1->this_node->get_uid () == n2->this_node->get_uid ();
}
/* Mark as GC root all allocated nodes. */
static GTY(()) struct cgraph_function_version_info *
version_info_node = NULL;
/* Return true if NODE's address can be compared. */
bool
symtab_node::address_can_be_compared_p ()
{
/* Address of virtual tables and functions is never compared. */
if (DECL_VIRTUAL_P (decl))
return false;
/* Address of C++ cdtors is never compared. */
if (is_a <cgraph_node *> (this)
&& (DECL_CXX_CONSTRUCTOR_P (decl)
|| DECL_CXX_DESTRUCTOR_P (decl)))
return false;
/* Constant pool symbols addresses are never compared.
flag_merge_constants permits us to assume the same on readonly vars. */
if (is_a <varpool_node *> (this)
&& (DECL_IN_CONSTANT_POOL (decl)
|| (flag_merge_constants >= 2
&& TREE_READONLY (decl) && !TREE_THIS_VOLATILE (decl))))
return false;
return true;
}
/* Get the cgraph_function_version_info node corresponding to node. */
cgraph_function_version_info *
cgraph_node::function_version (void)
{
cgraph_function_version_info key;
key.this_node = this;
if (cgraph_fnver_htab == NULL)
return NULL;
return cgraph_fnver_htab->find (&key);
}
/* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
corresponding to cgraph_node NODE. */
cgraph_function_version_info *
cgraph_node::insert_new_function_version (void)
{
version_info_node = NULL;
version_info_node = ggc_cleared_alloc<cgraph_function_version_info> ();
version_info_node->this_node = this;
if (cgraph_fnver_htab == NULL)
cgraph_fnver_htab = hash_table<function_version_hasher>::create_ggc (2);
*cgraph_fnver_htab->find_slot (version_info_node, INSERT)
= version_info_node;
return version_info_node;
}
/* Remove the cgraph_function_version_info node given by DECL_V. */
static void
delete_function_version (cgraph_function_version_info *decl_v)
{
if (decl_v == NULL)
return;
if (version_info_node == decl_v)
version_info_node = NULL;
if (decl_v->prev != NULL)
decl_v->prev->next = decl_v->next;
if (decl_v->next != NULL)
decl_v->next->prev = decl_v->prev;
if (cgraph_fnver_htab != NULL)
cgraph_fnver_htab->remove_elt (decl_v);
}
/* Remove the cgraph_function_version_info and cgraph_node for DECL. This
DECL is a duplicate declaration. */
void
cgraph_node::delete_function_version_by_decl (tree decl)
{
cgraph_node *decl_node = cgraph_node::get (decl);
if (decl_node == NULL)
return;
delete_function_version (decl_node->function_version ());
decl_node->remove ();
}
/* Record that DECL1 and DECL2 are semantically identical function
versions. */
void
cgraph_node::record_function_versions (tree decl1, tree decl2)
{
cgraph_node *decl1_node = cgraph_node::get_create (decl1);
cgraph_node *decl2_node = cgraph_node::get_create (decl2);
cgraph_function_version_info *decl1_v = NULL;
cgraph_function_version_info *decl2_v = NULL;
cgraph_function_version_info *before;
cgraph_function_version_info *after;
gcc_assert (decl1_node != NULL && decl2_node != NULL);
decl1_v = decl1_node->function_version ();
decl2_v = decl2_node->function_version ();
if (decl1_v != NULL && decl2_v != NULL)
return;
if (decl1_v == NULL)
decl1_v = decl1_node->insert_new_function_version ();
if (decl2_v == NULL)
decl2_v = decl2_node->insert_new_function_version ();
/* Chain decl2_v and decl1_v. All semantically identical versions
will be chained together. */
before = decl1_v;
after = decl2_v;
while (before->next != NULL)
before = before->next;
while (after->prev != NULL)
after= after->prev;
before->next = after;
after->prev = before;
}
/* Initialize callgraph dump file. */
void
symbol_table::initialize (void)
{
if (!dump_file)
dump_file = dump_begin (TDI_cgraph, NULL);
if (!ipa_clones_dump_file)
ipa_clones_dump_file = dump_begin (TDI_clones, NULL);
}
/* Allocate new callgraph node and insert it into basic data structures. */
cgraph_node *
symbol_table::create_empty (void)
{
cgraph_node *node = allocate_cgraph_symbol ();
node->type = SYMTAB_FUNCTION;
node->frequency = NODE_FREQUENCY_NORMAL;
node->count_materialization_scale = REG_BR_PROB_BASE;
cgraph_count++;
return node;
}
/* Register HOOK to be called with DATA on each removed edge. */
cgraph_edge_hook_list *
symbol_table::add_edge_removal_hook (cgraph_edge_hook hook, void *data)
{
cgraph_edge_hook_list *entry;
cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook;
entry = (cgraph_edge_hook_list *) xmalloc (sizeof (*entry));
entry->hook = hook;
entry->data = data;
entry->next = NULL;
while (*ptr)
ptr = &(*ptr)->next;
*ptr = entry;
return entry;
}
/* Remove ENTRY from the list of hooks called on removing edges. */
void
symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list *entry)
{
cgraph_edge_hook_list **ptr = &m_first_edge_removal_hook;
while (*ptr != entry)
ptr = &(*ptr)->next;
*ptr = entry->next;
free (entry);
}
/* Call all edge removal hooks. */
void
symbol_table::call_edge_removal_hooks (cgraph_edge *e)
{
cgraph_edge_hook_list *entry = m_first_edge_removal_hook;
while (entry)
{
entry->hook (e, entry->data);
entry = entry->next;
}
}
/* Register HOOK to be called with DATA on each removed node. */
cgraph_node_hook_list *
symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook, void *data)
{
cgraph_node_hook_list *entry;
cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook;
entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry));
entry->hook = hook;
entry->data = data;
entry->next = NULL;
while (*ptr)
ptr = &(*ptr)->next;
*ptr = entry;
return entry;
}
/* Remove ENTRY from the list of hooks called on removing nodes. */
void
symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list *entry)
{
cgraph_node_hook_list **ptr = &m_first_cgraph_removal_hook;
while (*ptr != entry)
ptr = &(*ptr)->next;
*ptr = entry->next;
free (entry);
}
/* Call all node removal hooks. */
void
symbol_table::call_cgraph_removal_hooks (cgraph_node *node)
{
cgraph_node_hook_list *entry = m_first_cgraph_removal_hook;
while (entry)
{
entry->hook (node, entry->data);
entry = entry->next;
}
}
/* Call all node removal hooks. */
void
symbol_table::call_cgraph_insertion_hooks (cgraph_node *node)
{
cgraph_node_hook_list *entry = m_first_cgraph_insertion_hook;
while (entry)
{
entry->hook (node, entry->data);
entry = entry->next;
}
}
/* Register HOOK to be called with DATA on each inserted node. */
cgraph_node_hook_list *
symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook, void *data)
{
cgraph_node_hook_list *entry;
cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook;
entry = (cgraph_node_hook_list *) xmalloc (sizeof (*entry));
entry->hook = hook;
entry->data = data;
entry->next = NULL;
while (*ptr)
ptr = &(*ptr)->next;
*ptr = entry;
return entry;
}
/* Remove ENTRY from the list of hooks called on inserted nodes. */
void
symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list *entry)
{
cgraph_node_hook_list **ptr = &m_first_cgraph_insertion_hook;
while (*ptr != entry)
ptr = &(*ptr)->next;
*ptr = entry->next;
free (entry);
}
/* Register HOOK to be called with DATA on each duplicated edge. */
cgraph_2edge_hook_list *
symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook, void *data)
{
cgraph_2edge_hook_list *entry;
cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook;
entry = (cgraph_2edge_hook_list *) xmalloc (sizeof (*entry));
entry->hook = hook;
entry->data = data;
entry->next = NULL;
while (*ptr)
ptr = &(*ptr)->next;
*ptr = entry;
return entry;
}
/* Remove ENTRY from the list of hooks called on duplicating edges. */
void
symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list *entry)
{
cgraph_2edge_hook_list **ptr = &m_first_edge_duplicated_hook;
while (*ptr != entry)
ptr = &(*ptr)->next;
*ptr = entry->next;
free (entry);
}
/* Call all edge duplication hooks. */
void
symbol_table::call_edge_duplication_hooks (cgraph_edge *cs1, cgraph_edge *cs2)
{
cgraph_2edge_hook_list *entry = m_first_edge_duplicated_hook;
while (entry)
{
entry->hook (cs1, cs2, entry->data);
entry = entry->next;
}
}
/* Register HOOK to be called with DATA on each duplicated node. */
cgraph_2node_hook_list *
symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook, void *data)
{
cgraph_2node_hook_list *entry;
cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook;
entry = (cgraph_2node_hook_list *) xmalloc (sizeof (*entry));
entry->hook = hook;
entry->data = data;
entry->next = NULL;
while (*ptr)
ptr = &(*ptr)->next;
*ptr = entry;
return entry;
}
/* Remove ENTRY from the list of hooks called on duplicating nodes. */
void
symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list *entry)
{
cgraph_2node_hook_list **ptr = &m_first_cgraph_duplicated_hook;
while (*ptr != entry)
ptr = &(*ptr)->next;
*ptr = entry->next;
free (entry);
}
/* Call all node duplication hooks. */
void
symbol_table::call_cgraph_duplication_hooks (cgraph_node *node,
cgraph_node *node2)
{
cgraph_2node_hook_list *entry = m_first_cgraph_duplicated_hook;
while (entry)
{
entry->hook (node, node2, entry->data);
entry = entry->next;
}
}
/* Return cgraph node assigned to DECL. Create new one when needed. */
cgraph_node *
cgraph_node::create (tree decl)
{
cgraph_node *node = symtab->create_empty ();
gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
node->decl = decl;
node->count = profile_count::uninitialized ();
if ((flag_openacc || flag_openmp)
&& lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl)))
{
node->offloadable = 1;
if (ENABLE_OFFLOADING)
g->have_offload = true;
}
if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl)))
node->ifunc_resolver = true;
node->register_symbol ();
if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
{
node->origin = cgraph_node::get_create (DECL_CONTEXT (decl));
node->next_nested = node->origin->nested;
node->origin->nested = node;
}
return node;
}
/* Try to find a call graph node for declaration DECL and if it does not exist
or if it corresponds to an inline clone, create a new one. */
cgraph_node *
cgraph_node::get_create (tree decl)
{
cgraph_node *first_clone = cgraph_node::get (decl);
if (first_clone && !first_clone->inlined_to)
return first_clone;
cgraph_node *node = cgraph_node::create (decl);
if (first_clone)
{
first_clone->clone_of = node;
node->clones = first_clone;
node->order = first_clone->order;
symtab->symtab_prevail_in_asm_name_hash (node);
node->decl->decl_with_vis.symtab_node = node;
if (dump_file)
fprintf (dump_file, "Introduced new external node "
"(%s) and turned into root of the clone tree.\n",
node->dump_name ());
}
else if (dump_file)
fprintf (dump_file, "Introduced new external node "
"(%s).\n", node->dump_name ());
return node;
}
/* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
the function body is associated with (not necessarily cgraph_node (DECL). */
cgraph_node *
cgraph_node::create_alias (tree alias, tree target)
{
cgraph_node *alias_node;
gcc_assert (TREE_CODE (target) == FUNCTION_DECL
|| TREE_CODE (target) == IDENTIFIER_NODE);
gcc_assert (TREE_CODE (alias) == FUNCTION_DECL);
alias_node = cgraph_node::get_create (alias);
gcc_assert (!alias_node->definition);
alias_node->alias_target = target;
alias_node->definition = true;
alias_node->alias = true;
if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias)) != NULL)
alias_node->transparent_alias = alias_node->weakref = true;
if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (alias)))
alias_node->ifunc_resolver = true;
return alias_node;
}
/* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
and NULL otherwise.
Same body aliases are output whenever the body of DECL is output,
and cgraph_node::get (ALIAS) transparently returns
cgraph_node::get (DECL). */
cgraph_node *
cgraph_node::create_same_body_alias (tree alias, tree decl)
{
cgraph_node *n;
/* If aliases aren't supported by the assembler, fail. */
if (!TARGET_SUPPORTS_ALIASES)
return NULL;
/* Langhooks can create same body aliases of symbols not defined.
Those are useless. Drop them on the floor. */
if (symtab->global_info_ready)
return NULL;
n = cgraph_node::create_alias (alias, decl);
n->cpp_implicit_alias = true;
if (symtab->cpp_implicit_aliases_done)
n->resolve_alias (cgraph_node::get (decl));
return n;
}
/* Add thunk alias into callgraph. The alias declaration is ALIAS and it
aliases DECL with an adjustments made into the first parameter.
See comments in struct cgraph_thunk_info for detail on the parameters. */
cgraph_node *
cgraph_node::create_thunk (tree alias, tree, bool this_adjusting,
HOST_WIDE_INT fixed_offset,
HOST_WIDE_INT virtual_value,
HOST_WIDE_INT indirect_offset,
tree virtual_offset,
tree real_alias)
{
cgraph_node *node;
node = cgraph_node::get (alias);
if (node)
node->reset ();
else
node = cgraph_node::create (alias);
/* Make sure that if VIRTUAL_OFFSET is in sync with VIRTUAL_VALUE. */
gcc_checking_assert (virtual_offset
? virtual_value == wi::to_wide (virtual_offset)
: virtual_value == 0);
node->thunk.fixed_offset = fixed_offset;
node->thunk.virtual_value = virtual_value;
node->thunk.indirect_offset = indirect_offset;
node->thunk.alias = real_alias;
node->thunk.this_adjusting = this_adjusting;
node->thunk.virtual_offset_p = virtual_offset != NULL;
node->thunk.thunk_p = true;
node->definition = true;
return node;
}
/* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
Return NULL if there's no such node. */
cgraph_node *
cgraph_node::get_for_asmname (tree asmname)
{
/* We do not want to look at inline clones. */
for (symtab_node *node = symtab_node::get_for_asmname (asmname);
node;
node = node->next_sharing_asm_name)
{
cgraph_node *cn = dyn_cast <cgraph_node *> (node);
if (cn && !cn->inlined_to)
return cn;
}
return NULL;
}
/* Returns a hash value for X (which really is a cgraph_edge). */
hashval_t
cgraph_edge_hasher::hash (cgraph_edge *e)
{
/* This is a really poor hash function, but it is what htab_hash_pointer
uses. */
return (hashval_t) ((intptr_t)e->call_stmt >> 3);
}
/* Returns a hash value for X (which really is a cgraph_edge). */
hashval_t
cgraph_edge_hasher::hash (gimple *call_stmt)
{
/* This is a really poor hash function, but it is what htab_hash_pointer
uses. */
return (hashval_t) ((intptr_t)call_stmt >> 3);
}
/* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
inline bool
cgraph_edge_hasher::equal (cgraph_edge *x, gimple *y)
{
return x->call_stmt == y;
}
/* Add call graph edge E to call site hash of its caller. */
static inline void
cgraph_update_edge_in_call_site_hash (cgraph_edge *e)
{
gimple *call = e->call_stmt;
*e->caller->call_site_hash->find_slot_with_hash
(call, cgraph_edge_hasher::hash (call), INSERT) = e;
}
/* Add call graph edge E to call site hash of its caller. */
static inline void
cgraph_add_edge_to_call_site_hash (cgraph_edge *e)
{
/* There are two speculative edges for every statement (one direct,
one indirect); always hash the direct one. */
if (e->speculative && e->indirect_unknown_callee)
return;
cgraph_edge **slot = e->caller->call_site_hash->find_slot_with_hash
(e->call_stmt, cgraph_edge_hasher::hash (e->call_stmt), INSERT);
if (*slot)
{
gcc_assert (((cgraph_edge *)*slot)->speculative);
if (e->callee)
*slot = e;
return;
}
gcc_assert (!*slot || e->speculative);
*slot = e;
}
/* Return the callgraph edge representing the GIMPLE_CALL statement
CALL_STMT. */
cgraph_edge *
cgraph_node::get_edge (gimple *call_stmt)
{
cgraph_edge *e, *e2;
int n = 0;
if (call_site_hash)
return call_site_hash->find_with_hash
(call_stmt, cgraph_edge_hasher::hash (call_stmt));
/* This loop may turn out to be performance problem. In such case adding
hashtables into call nodes with very many edges is probably best
solution. It is not good idea to add pointer into CALL_EXPR itself
because we want to make possible having multiple cgraph nodes representing
different clones of the same body before the body is actually cloned. */
for (e = callees; e; e = e->next_callee)
{
if (e->call_stmt == call_stmt)
break;
n++;
}
if (!e)
for (e = indirect_calls; e; e = e->next_callee)
{
if (e->call_stmt == call_stmt)
break;
n++;
}
if (n > 100)
{
call_site_hash = hash_table<cgraph_edge_hasher>::create_ggc (120);
for (e2 = callees; e2; e2 = e2->next_callee)
cgraph_add_edge_to_call_site_hash (e2);
for (e2 = indirect_calls; e2; e2 = e2->next_callee)
cgraph_add_edge_to_call_site_hash (e2);
}
return e;
}
/* Change field call_stmt of edge to NEW_STMT.
If UPDATE_SPECULATIVE and E is any component of speculative
edge, then update all components. */
void
cgraph_edge::set_call_stmt (gcall *new_stmt, bool update_speculative)
{
tree decl;
/* Speculative edges has three component, update all of them
when asked to. */
if (update_speculative && speculative)
{
cgraph_edge *direct, *indirect;
ipa_ref *ref;
speculative_call_info (direct, indirect, ref);
direct->set_call_stmt (new_stmt, false);
indirect->set_call_stmt (new_stmt, false);
ref->stmt = new_stmt;
return;
}
/* Only direct speculative edges go to call_site_hash. */
if (caller->call_site_hash
&& (!speculative || !indirect_unknown_callee))
{
caller->call_site_hash->remove_elt_with_hash
(call_stmt, cgraph_edge_hasher::hash (call_stmt));
}
cgraph_edge *e = this;
call_stmt = new_stmt;
if (indirect_unknown_callee
&& (decl = gimple_call_fndecl (new_stmt)))
{
/* Constant propagation (and possibly also inlining?) can turn an
indirect call into a direct one. */
cgraph_node *new_callee = cgraph_node::get (decl);
gcc_checking_assert (new_callee);
e = make_direct (new_callee);
}
function *fun = DECL_STRUCT_FUNCTION (e->caller->decl);
e->can_throw_external = stmt_can_throw_external (fun, new_stmt);
if (e->caller->call_site_hash)
cgraph_add_edge_to_call_site_hash (e);
}
/* Allocate a cgraph_edge structure and fill it with data according to the
parameters of which only CALLEE can be NULL (when creating an indirect call
edge). CLONING_P should be set if properties that are copied from an
original edge should not be calculated. */
cgraph_edge *
symbol_table::create_edge (cgraph_node *caller, cgraph_node *callee,
gcall *call_stmt, profile_count count,
bool indir_unknown_callee, bool cloning_p)
{
cgraph_edge *edge;
/* LTO does not actually have access to the call_stmt since these
have not been loaded yet. */
if (call_stmt)
{
/* This is a rather expensive check possibly triggering
construction of call stmt hashtable. */
cgraph_edge *e;
gcc_checking_assert (!(e = caller->get_edge (call_stmt))
|| e->speculative);
gcc_assert (is_gimple_call (call_stmt));
}
edge = ggc_alloc<cgraph_edge> ();
edge->m_summary_id = -1;
edges_count++;
gcc_assert (++edges_max_uid != 0);
edge->m_uid = edges_max_uid;
edge->aux = NULL;
edge->caller = caller;
edge->callee = callee;
edge->prev_caller = NULL;
edge->next_caller = NULL;
edge->prev_callee = NULL;
edge->next_callee = NULL;
edge->lto_stmt_uid = 0;
edge->count = count;
edge->call_stmt = call_stmt;
edge->indirect_info = NULL;
edge->indirect_inlining_edge = 0;
edge->speculative = false;
edge->indirect_unknown_callee = indir_unknown_callee;
if (call_stmt && caller->call_site_hash)
cgraph_add_edge_to_call_site_hash (edge);
if (cloning_p)
return edge;
edge->can_throw_external
= call_stmt ? stmt_can_throw_external (DECL_STRUCT_FUNCTION (caller->decl),
call_stmt) : false;
edge->inline_failed = CIF_FUNCTION_NOT_CONSIDERED;
edge->call_stmt_cannot_inline_p = false;
if (opt_for_fn (edge->caller->decl, flag_devirtualize)
&& call_stmt && DECL_STRUCT_FUNCTION (caller->decl))
edge->in_polymorphic_cdtor
= decl_maybe_in_construction_p (NULL, NULL, call_stmt,
caller->decl);
else
edge->in_polymorphic_cdtor = caller->thunk.thunk_p;
return edge;
}
/* Create edge from a given function to CALLEE in the cgraph. CLONING_P should
be set if properties that are copied from an original edge should not be
calculated. */
cgraph_edge *
cgraph_node::create_edge (cgraph_node *callee,
gcall *call_stmt, profile_count count, bool cloning_p)
{
cgraph_edge *edge = symtab->create_edge (this, callee, call_stmt, count,
false, cloning_p);
if (!cloning_p)
initialize_inline_failed (edge);
edge->next_caller = callee->callers;
if (callee->callers)
callee->callers->prev_caller = edge;
edge->next_callee = callees;
if (callees)
callees->prev_callee = edge;
callees = edge;
callee->callers = edge;
return edge;
}
/* Allocate cgraph_indirect_call_info and set its fields to default values. */
cgraph_indirect_call_info *
cgraph_allocate_init_indirect_info (void)
{
cgraph_indirect_call_info *ii;
ii = ggc_cleared_alloc<cgraph_indirect_call_info> ();
ii->param_index = -1;
return ii;
}
/* Create an indirect edge with a yet-undetermined callee where the call
statement destination is a formal parameter of the caller with index
PARAM_INDEX. CLONING_P should be set if properties that are copied from an
original edge should not be calculated and indirect_info structure should
not be calculated. */
cgraph_edge *
cgraph_node::create_indirect_edge (gcall *call_stmt, int ecf_flags,
profile_count count,
bool cloning_p)
{
cgraph_edge *edge = symtab->create_edge (this, NULL, call_stmt, count, true,
cloning_p);
tree target;
if (!cloning_p)
initialize_inline_failed (edge);
edge->indirect_info = cgraph_allocate_init_indirect_info ();
edge->indirect_info->ecf_flags = ecf_flags;
edge->indirect_info->vptr_changed = true;
/* Record polymorphic call info. */
if (!cloning_p
&& call_stmt
&& (target = gimple_call_fn (call_stmt))
&& virtual_method_call_p (target))
{
ipa_polymorphic_call_context context (decl, target, call_stmt);
/* Only record types can have virtual calls. */
edge->indirect_info->polymorphic = true;
edge->indirect_info->param_index = -1;
edge->indirect_info->otr_token
= tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target));
edge->indirect_info->otr_type = obj_type_ref_class (target);
gcc_assert (TREE_CODE (edge->indirect_info->otr_type) == RECORD_TYPE);
edge->indirect_info->context = context;
}
edge->next_callee = indirect_calls;
if (indirect_calls)
indirect_calls->prev_callee = edge;
indirect_calls = edge;
return edge;
}
/* Remove the edge from the list of the callees of the caller. */
void
cgraph_edge::remove_caller (void)
{
if (prev_callee)
prev_callee->next_callee = next_callee;
if (next_callee)
next_callee->prev_callee = prev_callee;
if (!prev_callee)
{
if (indirect_unknown_callee)
caller->indirect_calls = next_callee;
else
caller->callees = next_callee;
}
if (caller->call_site_hash)
caller->call_site_hash->remove_elt_with_hash
(call_stmt, cgraph_edge_hasher::hash (call_stmt));
}
/* Put the edge onto the free list. */
void
symbol_table::free_edge (cgraph_edge *e)
{
edges_count--;
if (e->m_summary_id != -1)
edge_released_summary_ids.safe_push (e->m_summary_id);
if (e->indirect_info)
ggc_free (e->indirect_info);
ggc_free (e);
}
/* Remove the edge in the cgraph. */
void
cgraph_edge::remove (void)
{
/* Call all edge removal hooks. */
symtab->call_edge_removal_hooks (this);
if (!indirect_unknown_callee)
/* Remove from callers list of the callee. */
remove_callee ();
/* Remove from callees list of the callers. */
remove_caller ();
/* Put the edge onto the free list. */
symtab->free_edge (this);
}
/* Turn edge into speculative call calling N2. Update
the profile so the direct call is taken COUNT times
with FREQUENCY.
At clone materialization time, the indirect call E will
be expanded as:
if (call_dest == N2)
n2 ();
else
call call_dest
At this time the function just creates the direct call,
the reference representing the if conditional and attaches
them all to the original indirect call statement.
Return direct edge created. */
cgraph_edge *
cgraph_edge::make_speculative (cgraph_node *n2, profile_count direct_count)
{
cgraph_node *n = caller;
ipa_ref *ref = NULL;
cgraph_edge *e2;
if (dump_file)
fprintf (dump_file, "Indirect call -> speculative call %s => %s\n",
n->dump_name (), n2->dump_name ());
speculative = true;
e2 = n->create_edge (n2, call_stmt, direct_count);
initialize_inline_failed (e2);
e2->speculative = true;
if (TREE_NOTHROW (n2->decl))
e2->can_throw_external = false;
else
e2->can_throw_external = can_throw_external;
e2->lto_stmt_uid = lto_stmt_uid;
e2->in_polymorphic_cdtor = in_polymorphic_cdtor;
count -= e2->count;
symtab->call_edge_duplication_hooks (this, e2);
ref = n->create_reference (n2, IPA_REF_ADDR, call_stmt);
ref->lto_stmt_uid = lto_stmt_uid;
ref->speculative = speculative;
n2->mark_address_taken ();
return e2;
}
/* Speculative call consist of three components:
1) an indirect edge representing the original call
2) an direct edge representing the new call
3) ADDR_EXPR reference representing the speculative check.
All three components are attached to single statement (the indirect
call) and if one of them exists, all of them must exist.
Given speculative call edge, return all three components.
*/
void
cgraph_edge::speculative_call_info (cgraph_edge *&direct,
cgraph_edge *&indirect,
ipa_ref *&reference)
{
ipa_ref *ref;
int i;
cgraph_edge *e2;
cgraph_edge *e = this;
if (!e->indirect_unknown_callee)
for (e2 = e->caller->indirect_calls;
e2->call_stmt != e->call_stmt || e2->lto_stmt_uid != e->lto_stmt_uid;
e2 = e2->next_callee)
;
else
{
e2 = e;
/* We can take advantage of the call stmt hash. */
if (e2->call_stmt)
{
e = e->caller->get_edge (e2->call_stmt);
gcc_assert (e->speculative && !e->indirect_unknown_callee);
}
else
for (e = e->caller->callees;
e2->call_stmt != e->call_stmt
|| e2->lto_stmt_uid != e->lto_stmt_uid;
e = e->next_callee)
;
}
gcc_assert (e->speculative && e2->speculative);
direct = e;
indirect = e2;
reference = NULL;
for (i = 0; e->caller->iterate_reference (i, ref); i++)
if (ref->speculative
&& ((ref->stmt && ref->stmt == e->call_stmt)
|| (!ref->stmt && ref->lto_stmt_uid == e->lto_stmt_uid)))
{
reference = ref;
break;
}
/* Speculative edge always consist of all three components - direct edge,
indirect and reference. */
gcc_assert (e && e2 && ref);
}
/* Speculative call edge turned out to be direct call to CALLEE_DECL.
Remove the speculative call sequence and return edge representing the call.
It is up to caller to redirect the call as appropriate. */
cgraph_edge *
cgraph_edge::resolve_speculation (tree callee_decl)
{
cgraph_edge *edge = this;
cgraph_edge *e2;
ipa_ref *ref;
gcc_assert (edge->speculative);
edge->speculative_call_info (e2, edge, ref);
if (!callee_decl
|| !ref->referred->semantically_equivalent_p
(symtab_node::get (callee_decl)))
{
if (dump_file)
{
if (callee_decl)
{
fprintf (dump_file, "Speculative indirect call %s => %s has "
"turned out to have contradicting known target ",
edge->caller->dump_name (),
e2->callee->dump_name ());
print_generic_expr (dump_file, callee_decl);
fprintf (dump_file, "\n");
}
else
{
fprintf (dump_file, "Removing speculative call %s => %s\n",
edge->caller->dump_name (),
e2->callee->dump_name ());
}
}
}
else
{
cgraph_edge *tmp = edge;
if (dump_file)
fprintf (dump_file, "Speculative call turned into direct call.\n");
edge = e2;
e2 = tmp;
/* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
in the functions inlined through it. */
}
edge->count += e2->count;
edge->speculative = false;
e2->speculative = false;
ref->remove_reference ();
if (e2->indirect_unknown_callee || e2->inline_failed)
e2->remove ();
else
e2->callee->remove_symbol_and_inline_clones ();
if (edge->caller->call_site_hash)
cgraph_update_edge_in_call_site_hash (edge);
return edge;
}
/* Make an indirect edge with an unknown callee an ordinary edge leading to
CALLEE. DELTA is an integer constant that is to be added to the this
pointer (first parameter) to compensate for skipping a thunk adjustment. */
cgraph_edge *
cgraph_edge::make_direct (cgraph_node *callee)
{
cgraph_edge *edge = this;
gcc_assert (indirect_unknown_callee);
/* If we are redirecting speculative call, make it non-speculative. */
if (indirect_unknown_callee && speculative)
{
edge = edge->resolve_speculation (callee->decl);
/* On successful speculation just return the pre existing direct edge. */
if (!edge->indirect_unknown_callee)
return edge;
}
indirect_unknown_callee = 0;
ggc_free (indirect_info);
indirect_info = NULL;
/* Get the edge out of the indirect edge list. */
if (prev_callee)
prev_callee->next_callee = next_callee;
if (next_callee)
next_callee->prev_callee = prev_callee;
if (!prev_callee)
caller->indirect_calls = next_callee;
/* Put it into the normal callee list */
prev_callee = NULL;
next_callee = caller->callees;
if (caller->callees)
caller->callees->prev_callee = edge;
caller->callees = edge;
/* Insert to callers list of the new callee. */
edge->set_callee (callee);
/* We need to re-determine the inlining status of the edge. */
initialize_inline_failed (edge);
return edge;
}
/* If necessary, change the function declaration in the call statement
associated with E so that it corresponds to the edge callee. */
gimple *
cgraph_edge::redirect_call_stmt_to_callee (void)
{
cgraph_edge *e = this;
tree decl = gimple_call_fndecl (e->call_stmt);
gcall *new_stmt;
gimple_stmt_iterator gsi;
if (e->speculative)
{
cgraph_edge *e2;
gcall *new_stmt;
ipa_ref *ref;
e->speculative_call_info (e, e2, ref);
/* If there already is an direct call (i.e. as a result of inliner's
substitution), forget about speculating. */
if (decl)
e = e->resolve_speculation (decl);
else
{
/* Expand speculation into GIMPLE code. */
if (dump_file)
{
fprintf (dump_file,
"Expanding speculative call of %s -> %s count: ",
e->caller->dump_name (),
e->callee->dump_name ());
e->count.dump (dump_file);
fprintf (dump_file, "\n");
}
gcc_assert (e2->speculative);
push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl));
profile_probability prob = e->count.probability_in (e->count
+ e2->count);
if (!prob.initialized_p ())
prob = profile_probability::even ();
new_stmt = gimple_ic (e->call_stmt,
dyn_cast<cgraph_node *> (ref->referred),
prob);
e->speculative = false;
e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt,
false);
e->count = gimple_bb (e->call_stmt)->count;
e2->speculative = false;
e2->count = gimple_bb (e2->call_stmt)->count;
ref->speculative = false;
ref->stmt = NULL;
/* Indirect edges are not both in the call site hash.
get it updated. */
if (e->caller->call_site_hash)
cgraph_update_edge_in_call_site_hash (e2);
pop_cfun ();
/* Continue redirecting E to proper target. */
}
}
if (e->indirect_unknown_callee
|| decl == e->callee->decl)
return e->call_stmt;
if (flag_checking && decl)
{
cgraph_node *node = cgraph_node::get (decl);
gcc_assert (!node || !node->clone.param_adjustments);
}
if (symtab->dump_file)
{
fprintf (symtab->dump_file, "updating call of %s -> %s: ",
e->caller->dump_name (), e->callee->dump_name ());
print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags);
if (e->callee->clone.param_adjustments)
e->callee->clone.param_adjustments->dump (symtab->dump_file);
unsigned performed_len
= vec_safe_length (e->caller->clone.performed_splits);
if (performed_len > 0)
fprintf (symtab->dump_file, "Performed splits records:\n");
for (unsigned i = 0; i < performed_len; i++)
{
ipa_param_performed_split *sm
= &(*e->caller->clone.performed_splits)[i];
print_node_brief (symtab->dump_file, " dummy_decl: ", sm->dummy_decl,
TDF_UID);
fprintf (symtab->dump_file, ", unit_offset: %u\n", sm->unit_offset);
}
}
if (ipa_param_adjustments *padjs = e->callee->clone.param_adjustments)
{
/* We need to defer cleaning EH info on the new statement to
fixup-cfg. We may not have dominator information at this point
and thus would end up with unreachable blocks and have no way
to communicate that we need to run CFG cleanup then. */
int lp_nr = lookup_stmt_eh_lp (e->call_stmt);
if (lp_nr != 0)
remove_stmt_from_eh_lp (e->call_stmt);
tree old_fntype = gimple_call_fntype (e->call_stmt);
new_stmt = padjs->modify_call (e->call_stmt,
e->caller->clone.performed_splits,
e->callee->decl, false);
cgraph_node *origin = e->callee;
while (origin->clone_of)
origin = origin->clone_of;
if ((origin->former_clone_of
&& old_fntype == TREE_TYPE (origin->former_clone_of))
|| old_fntype == TREE_TYPE (origin->decl))
gimple_call_set_fntype (new_stmt, TREE_TYPE (e->callee->decl));
else
{
tree new_fntype = padjs->build_new_function_type (old_fntype, true);
gimple_call_set_fntype (new_stmt, new_fntype);
}
if (lp_nr != 0)
add_stmt_to_eh_lp (new_stmt, lp_nr);
}
else
{
new_stmt = e->call_stmt;
gimple_call_set_fndecl (new_stmt, e->callee->decl);
update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
}
/* If changing the call to __cxa_pure_virtual or similar noreturn function,
adjust gimple_call_fntype too. */
if (gimple_call_noreturn_p (new_stmt)
&& VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e->callee->decl)))
&& TYPE_ARG_TYPES (TREE_TYPE (e->callee->decl))
&& (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e->callee->decl)))
== void_type_node))
gimple_call_set_fntype (new_stmt, TREE_TYPE (e->callee->decl));
/* If the call becomes noreturn, remove the LHS if possible. */
tree lhs = gimple_call_lhs (new_stmt);
if (lhs
&& gimple_call_noreturn_p (new_stmt)
&& (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt)))
|| should_remove_lhs_p (lhs)))
{
if (TREE_CODE (lhs) == SSA_NAME)
{
tree var = create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e->caller->decl),
TREE_TYPE (lhs), NULL);
var = get_or_create_ssa_default_def
(DECL_STRUCT_FUNCTION (e->caller->decl), var);
gimple *set_stmt = gimple_build_assign (lhs, var);
gsi = gsi_for_stmt (new_stmt);
gsi_insert_before_without_update (&gsi, set_stmt, GSI_SAME_STMT);
update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), set_stmt);
}
gimple_call_set_lhs (new_stmt, NULL_TREE);
update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
}
/* If new callee has no static chain, remove it. */
if (gimple_call_chain (new_stmt) && !DECL_STATIC_CHAIN (e->callee->decl))
{
gimple_call_set_chain (new_stmt, NULL);
update_stmt_fn (DECL_STRUCT_FUNCTION (e->caller->decl), new_stmt);
}
maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e->caller->decl),
new_stmt);
e->caller->set_call_stmt_including_clones (e->call_stmt, new_stmt, false);
if (symtab->dump_file)
{
fprintf (symtab->dump_file, " updated to:");
print_gimple_stmt (symtab->dump_file, e->call_stmt, 0, dump_flags);
}
return new_stmt;
}
/* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
of OLD_STMT if it was previously call statement.
If NEW_STMT is NULL, the call has been dropped without any
replacement. */
static void
cgraph_update_edges_for_call_stmt_node (cgraph_node *node,
gimple *old_stmt, tree old_call,
gimple *new_stmt)
{
tree new_call = (new_stmt && is_gimple_call (new_stmt))
? gimple_call_fndecl (new_stmt) : 0;
/* We are seeing indirect calls, then there is nothing to update. */
if (!new_call && !old_call)
return;
/* See if we turned indirect call into direct call or folded call to one builtin
into different builtin. */
if (old_call != new_call)
{
cgraph_edge *e = node->get_edge (old_stmt);
cgraph_edge *ne = NULL;
profile_count count;
if (e)
{
/* Keep calls marked as dead dead. */
if (new_stmt && is_gimple_call (new_stmt) && e->callee
&& fndecl_built_in_p (e->callee->decl, BUILT_IN_UNREACHABLE))
{
node->get_edge (old_stmt)->set_call_stmt
(as_a <gcall *> (new_stmt));
return;
}
/* See if the edge is already there and has the correct callee. It
might be so because of indirect inlining has already updated
it. We also might've cloned and redirected the edge. */
if (new_call && e->callee)
{
cgraph_node *callee = e->callee;
while (callee)
{
if (callee->decl == new_call
|| callee->former_clone_of == new_call)
{
e->set_call_stmt (as_a <gcall *> (new_stmt));
return;
}
callee = callee->clone_of;
}
}
/* Otherwise remove edge and create new one; we can't simply redirect
since function has changed, so inline plan and other information
attached to edge is invalid. */
count = e->count;
if (e->indirect_unknown_callee || e->inline_failed)
e->remove ();
else
e->callee->remove_symbol_and_inline_clones ();
}
else if (new_call)
{
/* We are seeing new direct call; compute profile info based on BB. */
basic_block bb = gimple_bb (new_stmt);
count = bb->count;
}
if (new_call)
{
ne = node->create_edge (cgraph_node::get_create (new_call),
as_a <gcall *> (new_stmt), count);
gcc_assert (ne->inline_failed);
}
}
/* We only updated the call stmt; update pointer in cgraph edge.. */
else if (old_stmt != new_stmt)
node->get_edge (old_stmt)->set_call_stmt (as_a <gcall *> (new_stmt));
}
/* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
of OLD_STMT before it was updated (updating can happen inplace). */
void
cgraph_update_edges_for_call_stmt (gimple *old_stmt, tree old_decl,
gimple *new_stmt)
{
cgraph_node *orig = cgraph_node::get (cfun->decl);
cgraph_node *node;
gcc_checking_assert (orig);
cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt);
if (orig->clones)
for (node = orig->clones; node != orig;)
{
cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, new_stmt);
if (node->clones)
node = node->clones;
else if (node->next_sibling_clone)
node = node->next_sibling_clone;
else
{
while (node != orig && !node->next_sibling_clone)
node = node->clone_of;
if (node != orig)
node = node->next_sibling_clone;
}
}
}
/* Remove all callees from the node. */
void
cgraph_node::remove_callees (void)
{
cgraph_edge *e, *f;
/* It is sufficient to remove the edges from the lists of callers of
the callees. The callee list of the node can be zapped with one
assignment. */
for (e = callees; e; e = f)
{
f = e->next_callee;
symtab->call_edge_removal_hooks (e);
if (!e->indirect_unknown_callee)
e->remove_callee ();
symtab->free_edge (e);
}
for (e = indirect_calls; e; e = f)
{
f = e->next_callee;
symtab->call_edge_removal_hooks (e);
if (!e->indirect_unknown_callee)
e->remove_callee ();
symtab->free_edge (e);
}
indirect_calls = NULL;
callees = NULL;
if (call_site_hash)
{
call_site_hash->empty ();
call_site_hash = NULL;
}
}
/* Remove all callers from the node. */
void
cgraph_node::remove_callers (void)
{
cgraph_edge *e, *f;
/* It is sufficient to remove the edges from the lists of callees of
the callers. The caller list of the node can be zapped with one
assignment. */
for (e = callers; e; e = f)
{
f = e->next_caller;
symtab->call_edge_removal_hooks (e);
e->remove_caller ();
symtab->free_edge (e);
}
callers = NULL;
}
/* Helper function for cgraph_release_function_body and free_lang_data.
It releases body from function DECL without having to inspect its
possibly non-existent symtab node. */
void
release_function_body (tree decl)
{
function *fn = DECL_STRUCT_FUNCTION (decl);
if (fn)
{
if (fn->cfg
&& loops_for_fn (fn))
{
fn->curr_properties &= ~PROP_loops;
loop_optimizer_finalize (fn);
}
if (fn->gimple_df)
{
delete_tree_ssa (fn);
fn->eh = NULL;
}
if (fn->cfg)
{
gcc_assert (!dom_info_available_p (fn, CDI_DOMINATORS));
gcc_assert (!dom_info_available_p (fn, CDI_POST_DOMINATORS));
delete_tree_cfg_annotations (fn);
clear_edges (fn);
fn->cfg = NULL;
}
if (fn->value_histograms)
free_histograms (fn);
gimple_set_body (decl, NULL);
/* Struct function hangs a lot of data that would leak if we didn't
removed all pointers to it. */
ggc_free (fn);
DECL_STRUCT_FUNCTION (decl) = NULL;
}
DECL_SAVED_TREE (decl) = NULL;
}
/* Release memory used to represent body of function.
Use this only for functions that are released before being translated to
target code (i.e. RTL). Functions that are compiled to RTL and beyond
are free'd in final.c via free_after_compilation().
KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
void
cgraph_node::release_body (bool keep_arguments)
{
ipa_transforms_to_apply.release ();
if (!used_as_abstract_origin && symtab->state != PARSING)
{
DECL_RESULT (decl) = NULL;
if (!keep_arguments)
DECL_ARGUMENTS (decl) = NULL;
}
/* If the node is abstract and needed, then do not clear
DECL_INITIAL of its associated function declaration because it's
needed to emit debug info later. */
if (!used_as_abstract_origin && DECL_INITIAL (decl))
DECL_INITIAL (decl) = error_mark_node;
release_function_body (decl);
if (lto_file_data)
{
lto_free_function_in_decl_state_for_node (this);
lto_file_data = NULL;
}
}
/* Remove function from symbol table. */
void
cgraph_node::remove (void)
{
if (symtab->ipa_clones_dump_file && symtab->cloned_nodes.contains (this))
fprintf (symtab->ipa_clones_dump_file,
"Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order,
DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl),
DECL_SOURCE_COLUMN (decl));
symtab->call_cgraph_removal_hooks (this);
remove_callers ();
remove_callees ();
ipa_transforms_to_apply.release ();
delete_function_version (function_version ());
/* Incremental inlining access removed nodes stored in the postorder list.
*/
force_output = false;
forced_by_abi = false;
cgraph_node *next;
for (cgraph_node *n = nested; n; n = next)
{
next = n->next_nested;
n->origin = NULL;
n->next_nested = NULL;
}
nested = NULL;
if (origin)
{
cgraph_node **node2 = &origin->nested;
while (*node2 != this)
node2 = &(*node2)->next_nested;
*node2 = next_nested;
}
unregister ();
if (prev_sibling_clone)
prev_sibling_clone->next_sibling_clone = next_sibling_clone;
else if (clone_of)
clone_of->clones = next_sibling_clone;
if (next_sibling_clone)
next_sibling_clone->prev_sibling_clone = prev_sibling_clone;
if (clones)
{
cgraph_node *n, *next;
if (clone_of)
{
for (n = clones; n->next_sibling_clone; n = n->next_sibling_clone)
n->clone_of = clone_of;
n->clone_of = clone_of;
n->next_sibling_clone = clone_of->clones;
if (clone_of->clones)
clone_of->clones->prev_sibling_clone = n;
clone_of->clones = clones;
}
else
{
/* We are removing node with clones. This makes clones inconsistent,
but assume they will be removed subsequently and just keep clone
tree intact. This can happen in unreachable function removal since
we remove unreachable functions in random order, not by bottom-up
walk of clone trees. */
for (n = clones; n; n = next)
{
next = n->next_sibling_clone;
n->next_sibling_clone = NULL;
n->prev_sibling_clone = NULL;
n->clone_of = NULL;
}
}
}
/* While all the clones are removed after being proceeded, the function
itself is kept in the cgraph even after it is compiled. Check whether
we are done with this body and reclaim it proactively if this is the case.
*/
if (symtab->state != LTO_STREAMING)
{
cgraph_node *n = cgraph_node::get (decl);
if (!n
|| (!n->clones && !n->clone_of && !n->inlined_to
&& ((symtab->global_info_ready || in_lto_p)
&& (TREE_ASM_WRITTEN (n->decl)
|| DECL_EXTERNAL (n->decl)
|| !n->analyzed
|| (!flag_wpa && n->in_other_partition)))))
release_body ();
}
else
{
lto_free_function_in_decl_state_for_node (this);
lto_file_data = NULL;
}
decl = NULL;
if (call_site_hash)
{
call_site_hash->empty ();
call_site_hash = NULL;
}
symtab->release_symbol (this);
}
/* Likewise indicate that a node is having address taken. */
void
cgraph_node::mark_address_taken (void)
{
/* Indirect inlining can figure out that all uses of the address are
inlined. */
if (inlined_to)
{
gcc_assert (cfun->after_inlining);
gcc_assert (callers->indirect_inlining_edge);
return;
}
/* FIXME: address_taken flag is used both as a shortcut for testing whether
IPA_REF_ADDR reference exists (and thus it should be set on node
representing alias we take address of) and as a test whether address
of the object was taken (and thus it should be set on node alias is
referring to). We should remove the first use and the remove the
following set. */
address_taken = 1;
cgraph_node *node = ultimate_alias_target ();
node->address_taken = 1;
}
/* Return local info node for the compiled function. */
cgraph_node *
cgraph_node::local_info_node (tree decl)
{
gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
cgraph_node *node = get (decl);
if (!node)
return NULL;
return node->ultimate_alias_target ();
}
/* Return RTL info for the compiled function. */
cgraph_rtl_info *
cgraph_node::rtl_info (const_tree decl)
{
gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
cgraph_node *node = get (decl);
if (!node)
return NULL;
enum availability avail;
node = node->ultimate_alias_target (&avail);
if (decl != current_function_decl
&& (avail < AVAIL_AVAILABLE
|| (node->decl != current_function_decl
&& !TREE_ASM_WRITTEN (node->decl))))
return NULL;
/* Allocate if it doesn't exist. */
if (node->rtl == NULL)
{
node->rtl = ggc_cleared_alloc<cgraph_rtl_info> ();
SET_HARD_REG_SET (node->rtl->function_used_regs);
}
return node->rtl;
}
/* Return a string describing the failure REASON. */
const char*
cgraph_inline_failed_string (cgraph_inline_failed_t reason)
{
#undef DEFCIFCODE
#define DEFCIFCODE(code, type, string) string,
static const char *cif_string_table[CIF_N_REASONS] = {
#include "cif-code.def"
};
/* Signedness of an enum type is implementation defined, so cast it
to unsigned before testing. */
gcc_assert ((unsigned) reason < CIF_N_REASONS);
return cif_string_table[reason];
}
/* Return a type describing the failure REASON. */
cgraph_inline_failed_type_t
cgraph_inline_failed_type (cgraph_inline_failed_t reason)
{
#undef DEFCIFCODE
#define DEFCIFCODE(code, type, string) type,
static cgraph_inline_failed_type_t cif_type_table[CIF_N_REASONS] = {
#include "cif-code.def"
};
/* Signedness of an enum type is implementation defined, so cast it
to unsigned before testing. */
gcc_assert ((unsigned) reason < CIF_N_REASONS);
return cif_type_table[reason];
}
/* Names used to print out the availability enum. */
const char * const cgraph_availability_names[] =
{"unset", "not_available", "overwritable", "available", "local"};
/* Output flags of edge to a file F. */
void
cgraph_edge::dump_edge_flags (FILE *f)
{
if (speculative)
fprintf (f, "(speculative) ");
if (!inline_failed)
fprintf (f, "(inlined) ");
if (call_stmt_cannot_inline_p)
fprintf (f, "(call_stmt_cannot_inline_p) ");
if (indirect_inlining_edge)
fprintf (f, "(indirect_inlining) ");
if (count.initialized_p ())
{
fprintf (f, "(");
count.dump (f);
fprintf (f, ",");
fprintf (f, "%.2f per call) ", sreal_frequency ().to_double ());
}
if (can_throw_external)
fprintf (f, "(can throw external) ");
}
/* Dump call graph node to file F. */
void
cgraph_node::dump (FILE *f)
{
cgraph_edge *edge;
dump_base (f);
if (inlined_to)
fprintf (f, " Function %s is inline copy in %s\n",
dump_name (),
inlined_to->dump_name ());
if (clone_of)
fprintf (f, " Clone of %s\n", clone_of->dump_asm_name ());
if (symtab->function_flags_ready)
fprintf (f, " Availability: %s\n",
cgraph_availability_names [get_availability ()]);
if (profile_id)
fprintf (f, " Profile id: %i\n",
profile_id);
cgraph_function_version_info *vi = function_version ();
if (vi != NULL)
{
fprintf (f, " Version info: ");
if (vi->prev != NULL)
{
fprintf (f, "prev: ");
fprintf (f, "%s ", vi->prev->this_node->dump_asm_name ());
}
if (vi->next != NULL)
{
fprintf (f, "next: ");
fprintf (f, "%s ", vi->next->this_node->dump_asm_name ());
}
if (vi->dispatcher_resolver != NULL_TREE)
fprintf (f, "dispatcher: %s",
lang_hooks.decl_printable_name (vi->dispatcher_resolver, 2));
fprintf (f, "\n");
}
fprintf (f, " Function flags:");
if (count.initialized_p ())
{
fprintf (f, " count:");
count.dump (f);
}
if (tp_first_run > 0)
fprintf (f, " first_run:%i", tp_first_run);
if (origin)
fprintf (f, " nested in:%s", origin->asm_name ());
if (gimple_has_body_p (decl))
fprintf (f, " body");
if (process)
fprintf (f, " process");
if (local)
fprintf (f, " local");
if (redefined_extern_inline)
fprintf (f, " redefined_extern_inline");
if (only_called_at_startup)
fprintf (f, " only_called_at_startup");
if (only_called_at_exit)
fprintf (f, " only_called_at_exit");
if (tm_clone)
fprintf (f, " tm_clone");
if (calls_comdat_local)
fprintf (f, " calls_comdat_local");
if (icf_merged)
fprintf (f, " icf_merged");
if (merged_comdat)
fprintf (f, " merged_comdat");
if (split_part)
fprintf (f, " split_part");
if (indirect_call_target)
fprintf (f, " indirect_call_target");
if (nonfreeing_fn)
fprintf (f, " nonfreeing_fn");
if (DECL_STATIC_CONSTRUCTOR (decl))
fprintf (f," static_constructor (priority:%i)", get_init_priority ());
if (DECL_STATIC_DESTRUCTOR (decl))
fprintf (f," static_destructor (priority:%i)", get_fini_priority ());
if (frequency == NODE_FREQUENCY_HOT)
fprintf (f, " hot");
if (frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)
fprintf (f, " unlikely_executed");
if (frequency == NODE_FREQUENCY_EXECUTED_ONCE)
fprintf (f, " executed_once");
if (opt_for_fn (decl, optimize_size))
fprintf (f, " optimize_size");
if (parallelized_function)
fprintf (f, " parallelized_function");
if (DECL_IS_OPERATOR_NEW_P (decl))
fprintf (f, " operator_new");
if (DECL_IS_OPERATOR_DELETE_P (decl))
fprintf (f, " operator_delete");
fprintf (f, "\n");
if (thunk.thunk_p)
{
fprintf (f, " Thunk");
if (thunk.alias)
fprintf (f, " of %s (asm:%s)",
lang_hooks.decl_printable_name (thunk.alias, 2),
IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk.alias)));
fprintf (f, " fixed offset %i virtual value %i indirect_offset %i "
"has virtual offset %i\n",
(int)thunk.fixed_offset,
(int)thunk.virtual_value,
(int)thunk.indirect_offset,
(int)thunk.virtual_offset_p);
}
else if (former_thunk_p ())
fprintf (f, " Former thunk fixed offset %i virtual value %i "
"indirect_offset %i has virtual offset %i\n",
(int)thunk.fixed_offset,
(int)thunk.virtual_value,
(int)thunk.indirect_offset,
(int)thunk.virtual_offset_p);
if (alias && thunk.alias
&& DECL_P (thunk.alias))
{
fprintf (f, " Alias of %s",
lang_hooks.decl_printable_name (thunk.alias, 2));
if (DECL_ASSEMBLER_NAME_SET_P (thunk.alias))
fprintf (f, " (asm:%s)",
IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk.alias)));
fprintf (f, "\n");
}
fprintf (f, " Called by: ");
profile_count sum = profile_count::zero ();
for (edge = callers; edge; edge = edge->next_caller)
{
fprintf (f, "%s ", edge->caller->dump_name ());
edge->dump_edge_flags (f);
if (edge->count.initialized_p ())
sum += edge->count.ipa ();
}
fprintf (f, "\n Calls: ");
for (edge = callees; edge; edge = edge->next_callee)
{
fprintf (f, "%s ", edge->callee->dump_name ());
edge->dump_edge_flags (f);
}
fprintf (f, "\n");
if (count.ipa ().initialized_p ())
{
bool ok = true;
bool min = false;
ipa_ref *ref;
FOR_EACH_ALIAS (this, ref)
if (dyn_cast <cgraph_node *> (ref->referring)->count.initialized_p ())
sum += dyn_cast <cgraph_node *> (ref->referring)->count.ipa ();
if (inlined_to
|| (symtab->state < EXPANSION
&& ultimate_alias_target () == this && only_called_directly_p ()))
ok = !count.ipa ().differs_from_p (sum);
else if (count.ipa () > profile_count::from_gcov_type (100)
&& count.ipa () < sum.apply_scale (99, 100))
ok = false, min = true;
if (!ok)
{
fprintf (f, " Invalid sum of caller counts ");
sum.dump (f);
if (min)
fprintf (f, ", should be at most ");
else
fprintf (f, ", should be ");
count.ipa ().dump (f);
fprintf (f, "\n");
}
}
for (edge = indirect_calls; edge; edge = edge->next_callee)
{
if (edge->indirect_info->polymorphic)
{
fprintf (f, " Polymorphic indirect call of type ");
print_generic_expr (f, edge->indirect_info->otr_type, TDF_SLIM);
fprintf (f, " token:%i", (int) edge->indirect_info->otr_token);
}
else
fprintf (f, " Indirect call");
edge->dump_edge_flags (f);
if (edge->indirect_info->param_index != -1)
{
fprintf (f, " of param:%i", edge->indirect_info->param_index);
if (edge->indirect_info->agg_contents)
fprintf (f, " loaded from %s %s at offset %i",
edge->indirect_info->member_ptr ? "member ptr" : "aggregate",
edge->indirect_info->by_ref ? "passed by reference":"",
(int)edge->indirect_info->offset);
if (edge->indirect_info->vptr_changed)
fprintf (f, " (vptr maybe changed)");
}
fprintf (f, "\n");
if (edge->indirect_info->polymorphic)
edge->indirect_info->context.dump (f);
}
}
/* Dump call graph node to file F in graphviz format. */
void
cgraph_node::dump_graphviz (FILE *f)
{
cgraph_edge *edge;
for (edge = callees; edge; edge = edge->next_callee)
{
cgraph_node *callee = edge->callee;
fprintf (f, "\t\"%s\" -> \"%s\"\n", dump_name (), callee->dump_name ());
}
}
/* Dump call graph node NODE to stderr. */
DEBUG_FUNCTION void
cgraph_node::debug (void)
{
dump (stderr);
}
/* Dump the callgraph to file F. */
void
cgraph_node::dump_cgraph (FILE *f)
{
cgraph_node *node;
fprintf (f, "callgraph:\n\n");
FOR_EACH_FUNCTION (node)
node->dump (f);
}
/* Return true when the DECL can possibly be inlined. */
bool
cgraph_function_possibly_inlined_p (tree decl)
{
if (!symtab->global_info_ready)
return !DECL_UNINLINABLE (decl);
return DECL_POSSIBLY_INLINED (decl);
}
/* cgraph_node is no longer nested function; update cgraph accordingly. */
void
cgraph_node::unnest (void)
{
cgraph_node **node2 = &origin->nested;
gcc_assert (origin);
while (*node2 != this)
node2 = &(*node2)->next_nested;
*node2 = next_nested;
origin = NULL;
}
/* Return function availability. See cgraph.h for description of individual
return values. */
enum availability
cgraph_node::get_availability (symtab_node *ref)
{
if (ref)
{
cgraph_node *cref = dyn_cast <cgraph_node *> (ref);
if (cref)
ref = cref->inlined_to;
}
enum availability avail;
if (!analyzed)
avail = AVAIL_NOT_AVAILABLE;
else if (local)
avail = AVAIL_LOCAL;
else if (inlined_to)
avail = AVAIL_AVAILABLE;
else if (transparent_alias)
ultimate_alias_target (&avail, ref);
else if (ifunc_resolver
|| lookup_attribute ("noipa", DECL_ATTRIBUTES (decl)))
avail = AVAIL_INTERPOSABLE;
else if (!externally_visible)
avail = AVAIL_AVAILABLE;
/* If this is a reference from symbol itself and there are no aliases, we
may be sure that the symbol was not interposed by something else because
the symbol itself would be unreachable otherwise.
Also comdat groups are always resolved in groups. */
else if ((this == ref && !has_aliases_p ())
|| (ref && get_comdat_group ()
&& get_comdat_group () == ref->get_comdat_group ()))
avail = AVAIL_AVAILABLE;
/* Inline functions are safe to be analyzed even if their symbol can
be overwritten at runtime. It is not meaningful to enforce any sane
behavior on replacing inline function by different body. */
else if (DECL_DECLARED_INLINE_P (decl))
avail = AVAIL_AVAILABLE;
/* If the function can be overwritten, return OVERWRITABLE. Take
care at least of two notable extensions - the COMDAT functions
used to share template instantiations in C++ (this is symmetric
to code cp_cannot_inline_tree_fn and probably shall be shared and
the inlinability hooks completely eliminated). */
else if (decl_replaceable_p (decl) && !DECL_EXTERNAL (decl))
avail = AVAIL_INTERPOSABLE;
else avail = AVAIL_AVAILABLE;
return avail;
}
/* Worker for cgraph_node_can_be_local_p. */
static bool
cgraph_node_cannot_be_local_p_1 (cgraph_node *node, void *)
{
return !(!node->force_output
&& ((DECL_COMDAT (node->decl)
&& !node->forced_by_abi
&& !node->used_from_object_file_p ()
&& !node->same_comdat_group)
|| !node->externally_visible));
}
/* Return true if cgraph_node can be made local for API change.
Extern inline functions and C++ COMDAT functions can be made local
at the expense of possible code size growth if function is used in multiple
compilation units. */
bool
cgraph_node::can_be_local_p (void)
{
return (!address_taken
&& !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1,
NULL, true));
}
/* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
When INCLUDE_OVERWRITABLE is false, overwritable symbols are
skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
skipped. */
bool
cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback)
(cgraph_node *, void *),
void *data,
bool include_overwritable,
bool exclude_virtual_thunks)
{
cgraph_edge *e;
ipa_ref *ref;
enum availability avail = AVAIL_AVAILABLE;
if (include_overwritable
|| (avail = get_availability ()) > AVAIL_INTERPOSABLE)
{
if (callback (this, data))
return true;
}
FOR_EACH_ALIAS (this, ref)
{
cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
if (include_overwritable
|| alias->get_availability () > AVAIL_INTERPOSABLE)
if (alias->call_for_symbol_thunks_and_aliases (callback, data,
include_overwritable,
exclude_virtual_thunks))
return true;
}
if (avail <= AVAIL_INTERPOSABLE)
return false;
for (e = callers; e; e = e->next_caller)
if (e->caller->thunk.thunk_p
&& (include_overwritable
|| e->caller->get_availability () > AVAIL_INTERPOSABLE)
&& !(exclude_virtual_thunks
&& e->caller->thunk.virtual_offset_p))
if (e->caller->call_for_symbol_thunks_and_aliases (callback, data,
include_overwritable,
exclude_virtual_thunks))
return true;
return false;
}
/* Worker to bring NODE local. */
bool
cgraph_node::make_local (cgraph_node *node, void *)
{
gcc_checking_assert (node->can_be_local_p ());
if (DECL_COMDAT (node->decl) || DECL_EXTERNAL (node->decl))
{
node->make_decl_local ();
node->set_section (NULL);
node->set_comdat_group (NULL);
node->externally_visible = false;
node->forced_by_abi = false;
node->local = true;
node->set_section (NULL);
node->unique_name = ((node->resolution == LDPR_PREVAILING_DEF_IRONLY
|| node->resolution == LDPR_PREVAILING_DEF_IRONLY_EXP)
&& !flag_incremental_link);
node->resolution = LDPR_PREVAILING_DEF_IRONLY;
gcc_assert (node->get_availability () == AVAIL_LOCAL);
}
return false;
}
/* Bring cgraph node local. */
void
cgraph_node::make_local (void)
{
call_for_symbol_thunks_and_aliases (cgraph_node::make_local, NULL, true);
}
/* Worker to set nothrow flag. */
static void
set_nothrow_flag_1 (cgraph_node *node, bool nothrow, bool non_call,
bool *changed)
{
cgraph_edge *e;
if (nothrow && !TREE_NOTHROW (node->decl))
{
/* With non-call exceptions we can't say for sure if other function body
was not possibly optimized to still throw. */
if (!non_call || node->binds_to_current_def_p ())
{
TREE_NOTHROW (node->decl) = true;
*changed = true;
for (e = node->callers; e; e = e->next_caller)
e->can_throw_external = false;
}
}
else if (!nothrow && TREE_NOTHROW (node->decl))
{
TREE_NOTHROW (node->decl) = false;
*changed = true;
}
ipa_ref *ref;
FOR_EACH_ALIAS (node, ref)
{
cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
if (!nothrow || alias->get_availability () > AVAIL_INTERPOSABLE)
set_nothrow_flag_1 (alias, nothrow, non_call, changed);
}
for (cgraph_edge *e = node->callers; e; e = e->next_caller)
if (e->caller->thunk.thunk_p
&& (!nothrow || e->caller->get_availability () > AVAIL_INTERPOSABLE))
set_nothrow_flag_1 (e->caller, nothrow, non_call, changed);
}
/* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
if any to NOTHROW. */
bool
cgraph_node::set_nothrow_flag (bool nothrow)
{
bool changed = false;
bool non_call = opt_for_fn (decl, flag_non_call_exceptions);
if (!nothrow || get_availability () > AVAIL_INTERPOSABLE)
set_nothrow_flag_1 (this, nothrow, non_call, &changed);
else
{
ipa_ref *ref;
FOR_EACH_ALIAS (this, ref)
{
cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
if (!nothrow || alias->get_availability () > AVAIL_INTERPOSABLE)
set_nothrow_flag_1 (alias, nothrow, non_call, &changed);
}
}
return changed;
}
/* Worker to set malloc flag. */
static void
set_malloc_flag_1 (cgraph_node *node, bool malloc_p, bool *changed)
{
if (malloc_p && !DECL_IS_MALLOC (node->decl))
{
DECL_IS_MALLOC (node->decl) = true;
*changed = true;
}
ipa_ref *ref;
FOR_EACH_ALIAS (node, ref)
{
cgraph_node *alias = dyn_cast<cgraph_node *> (ref->referring);
if (!malloc_p || alias->get_availability () > AVAIL_INTERPOSABLE)
set_malloc_flag_1 (alias, malloc_p, changed);
}
for (cgraph_edge *e = node->callers; e; e = e->next_caller)
if (e->caller->thunk.thunk_p
&& (!malloc_p || e->caller->get_availability () > AVAIL_INTERPOSABLE))
set_malloc_flag_1 (e->caller, malloc_p, changed);
}
/* Set DECL_IS_MALLOC on NODE's decl and on NODE's aliases if any. */
bool
cgraph_node::set_malloc_flag (bool malloc_p)
{
bool changed = false;
if (!malloc_p || get_availability () > AVAIL_INTERPOSABLE)
set_malloc_flag_1 (this, malloc_p, &changed);
else
{
ipa_ref *ref;
FOR_EACH_ALIAS (this, ref)
{
cgraph_node *alias = dyn_cast<cgraph_node *> (ref->referring);
if (!malloc_p || alias->get_availability () > AVAIL_INTERPOSABLE)
set_malloc_flag_1 (alias, malloc_p, &changed);
}
}
return changed;
}
/* Worker to set_const_flag. */
static void
set_const_flag_1 (cgraph_node *node, bool set_const, bool looping,
bool *changed)
{
/* Static constructors and destructors without a side effect can be
optimized out. */
if (set_const && !looping)
{
if (DECL_STATIC_CONSTRUCTOR (node->decl))
{
DECL_STATIC_CONSTRUCTOR (node->decl) = 0;
*changed = true;
}
if (DECL_STATIC_DESTRUCTOR (node->decl))
{
DECL_STATIC_DESTRUCTOR (node->decl) = 0;
*changed = true;
}
}
if (!set_const)
{
if (TREE_READONLY (node->decl))
{
TREE_READONLY (node->decl) = 0;
DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false;
*changed = true;
}
}
else
{
/* Consider function:
bool a(int *p)
{
return *p==*p;
}
During early optimization we will turn this into:
bool a(int *p)
{
return true;
}
Now if this function will be detected as CONST however when interposed
it may end up being just pure. We always must assume the worst
scenario here. */
if (TREE_READONLY (node->decl))
{
if (!looping && DECL_LOOPING_CONST_OR_PURE_P (node->decl))
{
DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false;
*changed = true;
}
}
else if (node->binds_to_current_def_p ())
{
TREE_READONLY (node->decl) = true;
DECL_LOOPING_CONST_OR_PURE_P (node->decl) = looping;
DECL_PURE_P (node->decl) = false;
*changed = true;
}
else
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Dropping state to PURE because function does "
"not bind to current def.\n");
if (!DECL_PURE_P (node->decl))
{
DECL_PURE_P (node->decl) = true;
DECL_LOOPING_CONST_OR_PURE_P (node->decl) = looping;
*changed = true;
}
else if (!looping && DECL_LOOPING_CONST_OR_PURE_P (node->decl))
{
DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false;
*changed = true;
}
}
}
ipa_ref *ref;
FOR_EACH_ALIAS (node, ref)
{
cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
if (!set_const || alias->get_availability () > AVAIL_INTERPOSABLE)
set_const_flag_1 (alias, set_const, looping, changed);
}
for (cgraph_edge *e = node->callers; e; e = e->next_caller)
if (e->caller->thunk.thunk_p
&& (!set_const || e->caller->get_availability () > AVAIL_INTERPOSABLE))
{
/* Virtual thunks access virtual offset in the vtable, so they can
only be pure, never const. */
if (set_const
&& (e->caller->thunk.virtual_offset_p
|| !node->binds_to_current_def_p (e->caller)))
*changed |= e->caller->set_pure_flag (true, looping);
else
set_const_flag_1 (e->caller, set_const, looping, changed);
}
}
/* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
If SET_CONST if false, clear the flag.
When setting the flag be careful about possible interposition and
do not set the flag for functions that can be interposed and set pure
flag for functions that can bind to other definition.
Return true if any change was done. */
bool
cgraph_node::set_const_flag (bool set_const, bool looping)
{
bool changed = false;
if (!set_const || get_availability () > AVAIL_INTERPOSABLE)
set_const_flag_1 (this, set_const, looping, &changed);
else
{
ipa_ref *ref;
FOR_EACH_ALIAS (this, ref)
{
cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
if (!set_const || alias->get_availability () > AVAIL_INTERPOSABLE)
set_const_flag_1 (alias, set_const, looping, &changed);
}
}
return changed;
}
/* Info used by set_pure_flag_1. */
struct set_pure_flag_info
{
bool pure;
bool looping;
bool changed;
};
/* Worker to set_pure_flag. */
static bool
set_pure_flag_1 (cgraph_node *node, void *data)
{
struct set_pure_flag_info *info = (struct set_pure_flag_info *)data;
/* Static constructors and destructors without a side effect can be
optimized out. */
if (info->pure && !info->looping)
{
if (DECL_STATIC_CONSTRUCTOR (node->decl))
{
DECL_STATIC_CONSTRUCTOR (node->decl) = 0;
info->changed = true;
}
if (DECL_STATIC_DESTRUCTOR (node->decl))
{
DECL_STATIC_DESTRUCTOR (node->decl) = 0;
info->changed = true;
}
}
if (info->pure)
{
if (!DECL_PURE_P (node->decl) && !TREE_READONLY (node->decl))
{
DECL_PURE_P (node->decl) = true;
DECL_LOOPING_CONST_OR_PURE_P (node->decl) = info->looping;
info->changed = true;
}
else if (DECL_LOOPING_CONST_OR_PURE_P (node->decl)
&& !info->looping)
{
DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false;
info->changed = true;
}
}
else
{
if (DECL_PURE_P (node->decl))
{
DECL_PURE_P (node->decl) = false;
DECL_LOOPING_CONST_OR_PURE_P (node->decl) = false;
info->changed = true;
}
}
return false;
}
/* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
if any to PURE.
When setting the flag, be careful about possible interposition.
Return true if any change was done. */
bool
cgraph_node::set_pure_flag (bool pure, bool looping)
{
struct set_pure_flag_info info = {pure, looping, false};
call_for_symbol_thunks_and_aliases (set_pure_flag_1, &info, !pure, true);
return info.changed;
}
/* Return true when cgraph_node cannot return or throw and thus
it is safe to ignore its side effects for IPA analysis. */
bool
cgraph_node::cannot_return_p (void)
{
int flags = flags_from_decl_or_type (decl);
if (!opt_for_fn (decl, flag_exceptions))
return (flags & ECF_NORETURN) != 0;
else
return ((flags & (ECF_NORETURN | ECF_NOTHROW))
== (ECF_NORETURN | ECF_NOTHROW));
}
/* Return true when call of edge cannot lead to return from caller
and thus it is safe to ignore its side effects for IPA analysis
when computing side effects of the caller.
FIXME: We could actually mark all edges that have no reaching
patch to the exit block or throw to get better results. */
bool
cgraph_edge::cannot_lead_to_return_p (void)
{
if (caller->cannot_return_p ())
return true;
if (indirect_unknown_callee)
{
int flags = indirect_info->ecf_flags;
if (!opt_for_fn (caller->decl, flag_exceptions))
return (flags & ECF_NORETURN) != 0;
else
return ((flags & (ECF_NORETURN | ECF_NOTHROW))
== (ECF_NORETURN | ECF_NOTHROW));
}
else
return callee->cannot_return_p ();
}
/* Return true if the edge may be considered hot. */
bool
cgraph_edge::maybe_hot_p (void)
{
if (!maybe_hot_count_p (NULL, count.ipa ()))
return false;
if (caller->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED
|| (callee
&& callee->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED))
return false;
if (caller->frequency > NODE_FREQUENCY_UNLIKELY_EXECUTED
&& (callee
&& callee->frequency <= NODE_FREQUENCY_EXECUTED_ONCE))
return false;
if (opt_for_fn (caller->decl, optimize_size))
return false;
if (caller->frequency == NODE_FREQUENCY_HOT)
return true;
if (!count.initialized_p ())
return true;
cgraph_node *where = caller->inlined_to ? caller->inlined_to : caller;
if (!where->count.initialized_p ())
return false;
if (caller->frequency == NODE_FREQUENCY_EXECUTED_ONCE)
{
if (count.apply_scale (2, 1) < where->count.apply_scale (3, 1))
return false;
}
else if (count.apply_scale (param_hot_bb_frequency_fraction , 1)
< where->count)
return false;
return true;
}
/* Worker for cgraph_can_remove_if_no_direct_calls_p. */
static bool
nonremovable_p (cgraph_node *node, void *)
{
return !node->can_remove_if_no_direct_calls_and_refs_p ();
}
/* Return true if whole comdat group can be removed if there are no direct
calls to THIS. */
bool
cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline)
{
struct ipa_ref *ref;
/* For local symbols or non-comdat group it is the same as
can_remove_if_no_direct_calls_p. */
if (!externally_visible || !same_comdat_group)
{
if (DECL_EXTERNAL (decl))
return true;
if (address_taken)
return false;
return !call_for_symbol_and_aliases (nonremovable_p, NULL, true);
}
if (will_inline && address_taken)
return false;
/* Otherwise check if we can remove the symbol itself and then verify
that only uses of the comdat groups are direct call to THIS
or its aliases. */
if (!can_remove_if_no_direct_calls_and_refs_p ())
return false;
/* Check that all refs come from within the comdat group. */
for (int i = 0; iterate_referring (i, ref); i++)
if (ref->referring->get_comdat_group () != get_comdat_group ())
return false;
struct cgraph_node *target = ultimate_alias_target ();
for (cgraph_node *next = dyn_cast<cgraph_node *> (same_comdat_group);
next != this; next = dyn_cast<cgraph_node *> (next->same_comdat_group))
{
if (!externally_visible)
continue;
if (!next->alias
&& !next->can_remove_if_no_direct_calls_and_refs_p ())
return false;
/* If we see different symbol than THIS, be sure to check calls. */
if (next->ultimate_alias_target () != target)
for (cgraph_edge *e = next->callers; e; e = e->next_caller)
if (e->caller->get_comdat_group () != get_comdat_group ()
|| will_inline)
return false;
/* If function is not being inlined, we care only about
references outside of the comdat group. */
if (!will_inline)
for (int i = 0; next->iterate_referring (i, ref); i++)
if (ref->referring->get_comdat_group () != get_comdat_group ())
return false;
}
return true;
}
/* Return true when function cgraph_node can be expected to be removed
from program when direct calls in this compilation unit are removed.
As a special case COMDAT functions are
cgraph_can_remove_if_no_direct_calls_p while the are not
cgraph_only_called_directly_p (it is possible they are called from other
unit)
This function behaves as cgraph_only_called_directly_p because eliminating
all uses of COMDAT function does not make it necessarily disappear from
the program unless we are compiling whole program or we do LTO. In this
case we know we win since dynamic linking will not really discard the
linkonce section. */
bool
cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
(bool will_inline)
{
gcc_assert (!inlined_to);
if (DECL_EXTERNAL (decl))
return true;
if (!in_lto_p && !flag_whole_program)
{
/* If the symbol is in comdat group, we need to verify that whole comdat
group becomes unreachable. Technically we could skip references from
within the group, too. */
if (!only_called_directly_p ())
return false;
if (same_comdat_group && externally_visible)
{
struct cgraph_node *target = ultimate_alias_target ();
if (will_inline && address_taken)
return true;
for (cgraph_node *next = dyn_cast<cgraph_node *> (same_comdat_group);
next != this;
next = dyn_cast<cgraph_node *> (next->same_comdat_group))
{
if (!externally_visible)
continue;
if (!next->alias
&& !next->only_called_directly_p ())
return false;
/* If we see different symbol than THIS,
be sure to check calls. */
if (next->ultimate_alias_target () != target)
for (cgraph_edge *e = next->callers; e; e = e->next_caller)
if (e->caller->get_comdat_group () != get_comdat_group ()
|| will_inline)
return false;
}
}
return true;
}
else
return can_remove_if_no_direct_calls_p (will_inline);
}
/* Worker for cgraph_only_called_directly_p. */
static bool
cgraph_not_only_called_directly_p_1 (cgraph_node *node, void *)
{
return !node->only_called_directly_or_aliased_p ();
}
/* Return true when function cgraph_node and all its aliases are only called
directly.
i.e. it is not externally visible, address was not taken and
it is not used in any other non-standard way. */
bool
cgraph_node::only_called_directly_p (void)
{
gcc_assert (ultimate_alias_target () == this);
return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1,
NULL, true);
}
/* Collect all callers of NODE. Worker for collect_callers_of_node. */
static bool
collect_callers_of_node_1 (cgraph_node *node, void *data)
{
vec<cgraph_edge *> *redirect_callers = (vec<cgraph_edge *> *)data;
cgraph_edge *cs;
enum availability avail;
node->ultimate_alias_target (&avail);
if (avail > AVAIL_INTERPOSABLE)
for (cs = node->callers; cs != NULL; cs = cs->next_caller)
if (!cs->indirect_inlining_edge
&& !cs->caller->thunk.thunk_p)
redirect_callers->safe_push (cs);
return false;
}
/* Collect all callers of cgraph_node and its aliases that are known to lead to
cgraph_node (i.e. are not overwritable). */
vec<cgraph_edge *>
cgraph_node::collect_callers (void)
{
vec<cgraph_edge *> redirect_callers = vNULL;
call_for_symbol_thunks_and_aliases (collect_callers_of_node_1,
&redirect_callers, false);
return redirect_callers;
}
/* Return TRUE if NODE2 a clone of NODE or is equivalent to it. Return
optimistically true if this cannot be determined. */
static bool
clone_of_p (cgraph_node *node, cgraph_node *node2)
{
node = node->ultimate_alias_target ();
node2 = node2->ultimate_alias_target ();
if (node2->clone_of == node
|| node2->former_clone_of == node->decl)
return true;
if (!node->thunk.thunk_p && !node->former_thunk_p ())
{
while (node2 && node->decl != node2->decl)
node2 = node2->clone_of;
return node2 != NULL;
}
/* There are no virtual clones of thunks so check former_clone_of or if we
might have skipped thunks because this adjustments are no longer
necessary. */
while (node->thunk.thunk_p || node->former_thunk_p ())
{
if (!node->thunk.this_adjusting)
return false;
/* In case of instrumented expanded thunks, which can have multiple calls
in them, we do not know how to continue and just have to be
optimistic. */
if (node->callees->next_callee)
return true;
node = node->callees->callee->ultimate_alias_target ();
if (!node2->clone.param_adjustments
|| node2->clone.param_adjustments->first_param_intact_p ())
return false;
if (node2->former_clone_of == node->decl)
return true;
cgraph_node *n2 = node2;
while (n2 && node->decl != n2->decl)
n2 = n2->clone_of;
if (n2)
return true;
}
return false;
}
/* Verify edge count and frequency. */
bool
cgraph_edge::verify_count ()
{
bool error_found = false;
if (!count.verify ())
{
error ("caller edge count invalid");
error_found = true;
}
return error_found;
}
/* Switch to THIS_CFUN if needed and print STMT to stderr. */
static void
cgraph_debug_gimple_stmt (function *this_cfun, gimple *stmt)
{
bool fndecl_was_null = false;
/* debug_gimple_stmt needs correct cfun */
if (cfun != this_cfun)
set_cfun (this_cfun);
/* ...and an actual current_function_decl */
if (!current_function_decl)
{
current_function_decl = this_cfun->decl;
fndecl_was_null = true;
}
debug_gimple_stmt (stmt);
if (fndecl_was_null)
current_function_decl = NULL;
}
/* Verify that call graph edge corresponds to DECL from the associated
statement. Return true if the verification should fail. */
bool
cgraph_edge::verify_corresponds_to_fndecl (tree decl)
{
cgraph_node *node;
if (!decl || callee->inlined_to)
return false;
if (symtab->state == LTO_STREAMING)
return false;
node = cgraph_node::get (decl);
/* We do not know if a node from a different partition is an alias or what it
aliases and therefore cannot do the former_clone_of check reliably. When
body_removed is set, we have lost all information about what was alias or
thunk of and also cannot proceed. */
if (!node
|| node->body_removed
|| node->in_other_partition
|| callee->icf_merged
|| callee->in_other_partition)
return false;
node = node->ultimate_alias_target ();
/* Optimizers can redirect unreachable calls or calls triggering undefined
behavior to builtin_unreachable. */
if (fndecl_built_in_p (callee->decl, BUILT_IN_UNREACHABLE))
return false;
if (callee->former_clone_of != node->decl
&& (node != callee->ultimate_alias_target ())
&& !clone_of_p (node, callee))
return true;
else
return false;
}
/* Disable warnings about missing quoting in GCC diagnostics for
the verification errors. Their format strings don't follow GCC
diagnostic conventions and the calls are ultimately followed by
one to internal_error. */
#if __GNUC__ >= 10
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wformat-diag"
#endif
/* Verify cgraph nodes of given cgraph node. */
DEBUG_FUNCTION void
cgraph_node::verify_node (void)
{
cgraph_edge *e;
function *this_cfun = DECL_STRUCT_FUNCTION (decl);
basic_block this_block;
gimple_stmt_iterator gsi;
bool error_found = false;
if (seen_error ())
return;
timevar_push (TV_CGRAPH_VERIFY);
error_found |= verify_base ();
for (e = callees; e; e = e->next_callee)
if (e->aux)
{
error ("aux field set for edge %s->%s",
identifier_to_locale (e->caller->name ()),
identifier_to_locale (e->callee->name ()));
error_found = true;
}
if (!count.verify ())
{
error ("cgraph count invalid");
error_found = true;
}
if (inlined_to && same_comdat_group)
{
error ("inline clone in same comdat group list");
error_found = true;
}
if (!definition && !in_other_partition && local)
{
error ("local symbols must be defined");
error_found = true;
}
if (inlined_to && externally_visible)
{
error ("externally visible inline clone");
error_found = true;
}
if (inlined_to && address_taken)
{
error ("inline clone with address taken");
error_found = true;
}
if (inlined_to && force_output)
{
error ("inline clone is forced to output");
error_found = true;
}
for (e = indirect_calls; e; e = e->next_callee)
{
if (e->aux)
{
error ("aux field set for indirect edge from %s",
identifier_to_locale (e->caller->name ()));
error_found = true;
}
if (!e->indirect_unknown_callee
|| !e->indirect_info)
{
error ("An indirect edge from %s is not marked as indirect or has "
"associated indirect_info, the corresponding statement is: ",
identifier_to_locale (e->caller->name ()));
cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
error_found = true;
}
}
bool check_comdat = comdat_local_p ();
for (e = callers; e; e = e->next_caller)
{
if (e->verify_count ())
error_found = true;
if (check_comdat
&& !in_same_comdat_group_p (e->caller))
{
error ("comdat-local function called by %s outside its comdat",
identifier_to_locale (e->caller->name ()));
error_found = true;
}
if (!e->inline_failed)
{
if (inlined_to
!= (e->caller->inlined_to
? e->caller->inlined_to : e->caller))
{
error ("inlined_to pointer is wrong");
error_found = true;
}
if (callers->next_caller)
{
error ("multiple inline callers");
error_found = true;
}
}
else
if (inlined_to)
{
error ("inlined_to pointer set for noninline callers");
error_found = true;
}
}
for (e = callees; e; e = e->next_callee)
{
if (e->verify_count ())
error_found = true;
if (gimple_has_body_p (e->caller->decl)
&& !e->caller->inlined_to
&& !e->speculative
/* Optimized out calls are redirected to __builtin_unreachable. */
&& (e->count.nonzero_p ()
|| ! e->callee->decl
|| !fndecl_built_in_p (e->callee->decl, BUILT_IN_UNREACHABLE))
&& count
== ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl))->count
&& (!e->count.ipa_p ()
&& e->count.differs_from_p (gimple_bb (e->call_stmt)->count)))
{
error ("caller edge count does not match BB count");
fprintf (stderr, "edge count: ");
e->count.dump (stderr);
fprintf (stderr, "\n bb count: ");
gimple_bb (e->call_stmt)->count.dump (stderr);
fprintf (stderr, "\n");
error_found = true;
}
}
for (e = indirect_calls; e; e = e->next_callee)
{
if (e->verify_count ())
error_found = true;
if (gimple_has_body_p (e->caller->decl)
&& !e->caller->inlined_to
&& !e->speculative
&& e->count.ipa_p ()
&& count
== ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl))->count
&& (!e->count.ipa_p ()
&& e->count.differs_from_p (gimple_bb (e->call_stmt)->count)))
{
error ("indirect call count does not match BB count");
fprintf (stderr, "edge count: ");
e->count.dump (stderr);
fprintf (stderr, "\n bb count: ");
gimple_bb (e->call_stmt)->count.dump (stderr);
fprintf (stderr, "\n");
error_found = true;
}
}
if (!callers && inlined_to)
{
error ("inlined_to pointer is set but no predecessors found");
error_found = true;
}
if (inlined_to == this)
{
error ("inlined_to pointer refers to itself");
error_found = true;
}
if (clone_of)
{
cgraph_node *first_clone = clone_of->clones;
if (first_clone != this)
{
if (prev_sibling_clone->clone_of != clone_of)
{
error ("cgraph_node has wrong clone_of");
error_found = true;
}
}
}
if (clones)
{
cgraph_node *n;
for (n = clones; n; n = n->next_sibling_clone)
if (n->clone_of != this)
break;
if (n)
{
error ("cgraph_node has wrong clone list");
error_found = true;
}
}
if ((prev_sibling_clone || next_sibling_clone) && !clone_of)
{
error ("cgraph_node is in clone list but it is not clone");
error_found = true;
}
if (!prev_sibling_clone && clone_of && clone_of->clones != this)
{
error ("cgraph_node has wrong prev_clone pointer");
error_found = true;
}
if (prev_sibling_clone && prev_sibling_clone->next_sibling_clone != this)
{
error ("double linked list of clones corrupted");
error_found = true;
}
if (analyzed && alias)
{
bool ref_found = false;
int i;
ipa_ref *ref = NULL;
if (callees)
{
error ("Alias has call edges");
error_found = true;
}
for (i = 0; iterate_reference (i, ref); i++)
if (ref->use != IPA_REF_ALIAS)
{
error ("Alias has non-alias reference");
error_found = true;
}
else if (ref_found)
{
error ("Alias has more than one alias reference");
error_found = true;
}
else
ref_found = true;
if (!ref_found)
{
error ("Analyzed alias has no reference");
error_found = true;
}
}
if (analyzed && thunk.thunk_p)
{
if (!callees)
{
error ("No edge out of thunk node");
error_found = true;
}
else if (callees->next_callee)
{
error ("More than one edge out of thunk node");
error_found = true;
}
if (gimple_has_body_p (decl) && !inlined_to)
{
error ("Thunk is not supposed to have body");
error_found = true;
}
}
else if (analyzed && gimple_has_body_p (decl)
&& !TREE_ASM_WRITTEN (decl)
&& (!DECL_EXTERNAL (decl) || inlined_to)
&& !flag_wpa)
{
if (this_cfun->cfg)
{
hash_set<gimple *> stmts;
int i;
ipa_ref *ref = NULL;
/* Reach the trees by walking over the CFG, and note the
enclosing basic-blocks in the call edges. */
FOR_EACH_BB_FN (this_block, this_cfun)
{
for (gsi = gsi_start_phis (this_block);
!gsi_end_p (gsi); gsi_next (&gsi))
stmts.add (gsi_stmt (gsi));
for (gsi = gsi_start_bb (this_block);
!gsi_end_p (gsi);
gsi_next (&gsi))
{
gimple *stmt = gsi_stmt (gsi);
stmts.add (stmt);
if (is_gimple_call (stmt))
{
cgraph_edge *e = get_edge (stmt);
tree decl = gimple_call_fndecl (stmt);
if (e)
{
if (e->aux)
{
error ("shared call_stmt:");
cgraph_debug_gimple_stmt (this_cfun, stmt);
error_found = true;
}
if (!e->indirect_unknown_callee)
{
if (e->verify_corresponds_to_fndecl (decl))
{
error ("edge points to wrong declaration:");
debug_tree (e->callee->decl);
fprintf (stderr," Instead of:");
debug_tree (decl);
error_found = true;
}
}
else if (decl)
{
error ("an indirect edge with unknown callee "
"corresponding to a call_stmt with "
"a known declaration:");
error_found = true;
cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
}
e->aux = (void *)1;
}
else if (decl)
{
error ("missing callgraph edge for call stmt:");
cgraph_debug_gimple_stmt (this_cfun, stmt);
error_found = true;
}
}
}
}
for (i = 0; iterate_reference (i, ref); i++)
if (ref->stmt && !stmts.contains (ref->stmt))
{
error ("reference to dead statement");
cgraph_debug_gimple_stmt (this_cfun, ref->stmt);
error_found = true;
}
}
else
/* No CFG available?! */
gcc_unreachable ();
for (e = callees; e; e = e->next_callee)
{
if (!e->aux)
{
error ("edge %s->%s has no corresponding call_stmt",
identifier_to_locale (e->caller->name ()),
identifier_to_locale (e->callee->name ()));
cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
error_found = true;
}
e->aux = 0;
}
for (e = indirect_calls; e; e = e->next_callee)
{
if (!e->aux && !e->speculative)
{
error ("an indirect edge from %s has no corresponding call_stmt",
identifier_to_locale (e->caller->name ()));
cgraph_debug_gimple_stmt (this_cfun, e->call_stmt);
error_found = true;
}
e->aux = 0;
}
}
if (nested != NULL)
{
for (cgraph_node *n = nested; n != NULL; n = n->next_nested)
{
if (n->origin == NULL)
{
error ("missing origin for a node in a nested list");
error_found = true;
}
else if (n->origin != this)
{
error ("origin points to a different parent");
error_found = true;
break;
}
}
}
if (next_nested != NULL && origin == NULL)
{
error ("missing origin for a node in a nested list");
error_found = true;
}
if (error_found)
{
dump (stderr);
internal_error ("verify_cgraph_node failed");
}
timevar_pop (TV_CGRAPH_VERIFY);
}
/* Verify whole cgraph structure. */
DEBUG_FUNCTION void
cgraph_node::verify_cgraph_nodes (void)
{
cgraph_node *node;
if (seen_error ())
return;
FOR_EACH_FUNCTION (node)
node->verify ();
}
#if __GNUC__ >= 10
# pragma GCC diagnostic pop
#endif
/* Walk the alias chain to return the function cgraph_node is alias of.
Walk through thunks, too.
When AVAILABILITY is non-NULL, get minimal availability in the chain.
When REF is non-NULL, assume that reference happens in symbol REF
when determining the availability. */
cgraph_node *
cgraph_node::function_symbol (enum availability *availability,
struct symtab_node *ref)
{
cgraph_node *node = ultimate_alias_target (availability, ref);
while (node->thunk.thunk_p)
{
ref = node;
node = node->callees->callee;
if (availability)
{
enum availability a;
a = node->get_availability (ref);
if (a < *availability)
*availability = a;
}
node = node->ultimate_alias_target (availability, ref);
}
return node;
}
/* Walk the alias chain to return the function cgraph_node is alias of.
Walk through non virtual thunks, too. Thus we return either a function
or a virtual thunk node.
When AVAILABILITY is non-NULL, get minimal availability in the chain.
When REF is non-NULL, assume that reference happens in symbol REF
when determining the availability. */
cgraph_node *
cgraph_node::function_or_virtual_thunk_symbol
(enum availability *availability,
struct symtab_node *ref)
{
cgraph_node *node = ultimate_alias_target (availability, ref);
while (node->thunk.thunk_p && !node->thunk.virtual_offset_p)
{
ref = node;
node = node->callees->callee;
if (availability)
{
enum availability a;
a = node->get_availability (ref);
if (a < *availability)
*availability = a;
}
node = node->ultimate_alias_target (availability, ref);
}
return node;
}
/* When doing LTO, read cgraph_node's body from disk if it is not already
present. */
bool
cgraph_node::get_untransformed_body (void)
{
lto_file_decl_data *file_data;
const char *data, *name;
size_t len;
tree decl = this->decl;
/* Check if body is already there. Either we have gimple body or
the function is thunk and in that case we set DECL_ARGUMENTS. */
if (DECL_ARGUMENTS (decl) || gimple_has_body_p (decl))
return false;
gcc_assert (in_lto_p && !DECL_RESULT (decl));
timevar_push (TV_IPA_LTO_GIMPLE_IN);
file_data = lto_file_data;
name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
/* We may have renamed the declaration, e.g., a static function. */
name = lto_get_decl_name_mapping (file_data, name);
struct lto_in_decl_state *decl_state
= lto_get_function_in_decl_state (file_data, decl);
cgraph_node *origin = this;
while (origin->clone_of)
origin = origin->clone_of;
int stream_order = origin->order - file_data->order_base;
data = lto_get_section_data (file_data, LTO_section_function_body,
name, stream_order, &len,
decl_state->compressed);
if (!data)
fatal_error (input_location, "%s: section %s.%d is missing",
file_data->file_name, name, stream_order);
gcc_assert (DECL_STRUCT_FUNCTION (decl) == NULL);
if (!quiet_flag)
fprintf (stderr, " in:%s", IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
lto_input_function_body (file_data, this, data);
lto_stats.num_function_bodies++;
lto_free_section_data (file_data, LTO_section_function_body, name,
data, len, decl_state->compressed);
lto_free_function_in_decl_state_for_node (this);
/* Keep lto file data so ipa-inline-analysis knows about cross module
inlining. */
timevar_pop (TV_IPA_LTO_GIMPLE_IN);
return true;
}
/* Prepare function body. When doing LTO, read cgraph_node's body from disk
if it is not already present. When some IPA transformations are scheduled,
apply them. */
bool
cgraph_node::get_body (void)
{
bool updated;
updated = get_untransformed_body ();
/* Getting transformed body makes no sense for inline clones;
we should never use this on real clones because they are materialized
early.
TODO: Materializing clones here will likely lead to smaller LTRANS
footprint. */
gcc_assert (!inlined_to && !clone_of);
if (ipa_transforms_to_apply.exists ())
{
opt_pass *saved_current_pass = current_pass;
FILE *saved_dump_file = dump_file;
const char *saved_dump_file_name = dump_file_name;
dump_flags_t saved_dump_flags = dump_flags;
dump_file_name = NULL;
set_dump_file (NULL);
push_cfun (DECL_STRUCT_FUNCTION (decl));
execute_all_ipa_transforms (true);
cgraph_edge::rebuild_edges ();
free_dominance_info (CDI_DOMINATORS);
free_dominance_info (CDI_POST_DOMINATORS);
pop_cfun ();
updated = true;
current_pass = saved_current_pass;
set_dump_file (saved_dump_file);
dump_file_name = saved_dump_file_name;
dump_flags = saved_dump_flags;
}
return updated;
}
/* Return the DECL_STRUCT_FUNCTION of the function. */
struct function *
cgraph_node::get_fun () const
{
const cgraph_node *node = this;
struct function *fun = DECL_STRUCT_FUNCTION (node->decl);
while (!fun && node->clone_of)
{
node = node->clone_of;
fun = DECL_STRUCT_FUNCTION (node->decl);
}
return fun;
}
/* Reset all state within cgraph.c so that we can rerun the compiler
within the same process. For use by toplev::finalize. */
void
cgraph_c_finalize (void)
{
symtab = NULL;
x_cgraph_nodes_queue = NULL;
cgraph_fnver_htab = NULL;
version_info_node = NULL;
}
/* A worker for call_for_symbol_and_aliases. */
bool
cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback) (cgraph_node *,
void *),
void *data,
bool include_overwritable)
{
ipa_ref *ref;
FOR_EACH_ALIAS (this, ref)
{
cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring);
if (include_overwritable
|| alias->get_availability () > AVAIL_INTERPOSABLE)
if (alias->call_for_symbol_and_aliases (callback, data,
include_overwritable))
return true;
}
return false;
}
/* Return true if NODE has thunk. */
bool
cgraph_node::has_thunk_p (cgraph_node *node, void *)
{
for (cgraph_edge *e = node->callers; e; e = e->next_caller)
if (e->caller->thunk.thunk_p)
return true;
return false;
}
/* Expected frequency of executions within the function. */
sreal
cgraph_edge::sreal_frequency ()
{
return count.to_sreal_scale (caller->inlined_to
? caller->inlined_to->count
: caller->count);
}
/* During LTO stream in this can be used to check whether call can possibly
be internal to the current translation unit. */
bool
cgraph_edge::possibly_call_in_translation_unit_p (void)
{
gcc_checking_assert (in_lto_p && caller->prevailing_p ());
/* While incremental linking we may end up getting function body later. */
if (flag_incremental_link == INCREMENTAL_LINK_LTO)
return true;
/* We may be smarter here and avoid streaming in indirect calls we can't
track, but that would require arranging streaming the indirect call
summary first. */
if (!callee)
return true;
/* If callee is local to the original translation unit, it will be
defined. */
if (!TREE_PUBLIC (callee->decl) && !DECL_EXTERNAL (callee->decl))
return true;
/* Otherwise we need to lookup prevailing symbol (symbol table is not merged,
yet) and see if it is a definition. In fact we may also resolve aliases,
but that is probably not too important. */
symtab_node *node = callee;
for (int n = 10; node->previous_sharing_asm_name && n ; n--)
node = node->previous_sharing_asm_name;
if (node->previous_sharing_asm_name)
node = symtab_node::get_for_asmname (DECL_ASSEMBLER_NAME (callee->decl));
gcc_assert (TREE_PUBLIC (node->decl));
return node->get_availability () >= AVAIL_INTERPOSABLE;
}
/* A stashed copy of "symtab" for use by selftest::symbol_table_test.
This needs to be a global so that it can be a GC root, and thus
prevent the stashed copy from being garbage-collected if the GC runs
during a symbol_table_test. */
symbol_table *saved_symtab;
#if CHECKING_P
namespace selftest {
/* class selftest::symbol_table_test. */
/* Constructor. Store the old value of symtab, and create a new one. */
symbol_table_test::symbol_table_test ()
{
gcc_assert (saved_symtab == NULL);
saved_symtab = symtab;
symtab = new (ggc_alloc <symbol_table> ()) symbol_table ();
}
/* Destructor. Restore the old value of symtab. */
symbol_table_test::~symbol_table_test ()
{
gcc_assert (saved_symtab != NULL);
symtab = saved_symtab;
saved_symtab = NULL;
}
/* Verify that symbol_table_test works. */
static void
test_symbol_table_test ()
{
/* Simulate running two selftests involving symbol tables. */
for (int i = 0; i < 2; i++)
{
symbol_table_test stt;
tree test_decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
get_identifier ("test_decl"),
build_function_type_list (void_type_node,
NULL_TREE));
cgraph_node *node = cgraph_node::get_create (test_decl);
gcc_assert (node);
/* Verify that the node has order 0 on both iterations,
and thus that nodes have predictable dump names in selftests. */
ASSERT_EQ (node->order, 0);
ASSERT_STREQ (node->dump_name (), "test_decl/0");
}
}
/* Run all of the selftests within this file. */
void
cgraph_c_tests ()
{
test_symbol_table_test ();
}
} // namespace selftest
#endif /* CHECKING_P */
#include "gt-cgraph.h"
|