1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
8165
8166
8167
8168
8169
8170
8171
8172
8173
8174
8175
8176
8177
8178
8179
8180
8181
8182
8183
8184
8185
8186
8187
8188
8189
8190
8191
8192
8193
8194
8195
8196
8197
8198
8199
8200
8201
8202
8203
8204
8205
8206
8207
8208
8209
8210
8211
8212
8213
8214
8215
8216
8217
8218
8219
8220
8221
8222
8223
8224
8225
8226
8227
8228
8229
8230
8231
8232
8233
8234
8235
8236
8237
8238
8239
8240
8241
8242
8243
8244
8245
8246
8247
8248
8249
8250
8251
8252
8253
8254
8255
8256
8257
8258
8259
8260
8261
8262
8263
8264
8265
8266
8267
8268
8269
8270
8271
8272
8273
8274
8275
8276
8277
8278
8279
8280
8281
8282
8283
8284
8285
8286
8287
8288
8289
8290
8291
8292
8293
8294
8295
8296
8297
8298
8299
8300
8301
8302
8303
8304
8305
8306
8307
8308
8309
8310
8311
8312
8313
8314
8315
8316
8317
8318
8319
8320
8321
8322
8323
8324
8325
8326
8327
8328
8329
8330
8331
8332
8333
8334
8335
8336
8337
8338
8339
8340
8341
8342
8343
8344
8345
8346
8347
8348
8349
8350
8351
8352
8353
8354
8355
8356
8357
8358
8359
8360
8361
8362
8363
8364
8365
8366
8367
8368
8369
8370
8371
8372
8373
8374
8375
8376
8377
8378
8379
8380
8381
8382
8383
8384
8385
8386
8387
8388
8389
8390
8391
8392
8393
8394
8395
8396
8397
8398
8399
8400
8401
8402
8403
8404
8405
8406
8407
8408
8409
8410
8411
8412
8413
8414
8415
8416
8417
8418
8419
8420
8421
8422
8423
8424
8425
8426
8427
8428
8429
8430
8431
8432
8433
8434
8435
8436
8437
8438
8439
8440
8441
8442
8443
8444
8445
8446
8447
8448
8449
8450
8451
8452
8453
8454
8455
8456
8457
8458
8459
8460
8461
8462
8463
8464
8465
8466
8467
8468
8469
8470
8471
8472
8473
8474
8475
8476
8477
8478
8479
8480
8481
8482
8483
8484
8485
8486
8487
8488
8489
8490
8491
8492
8493
8494
8495
8496
8497
8498
8499
8500
8501
8502
8503
8504
8505
8506
8507
8508
8509
8510
8511
8512
8513
8514
8515
8516
8517
8518
8519
8520
8521
8522
8523
8524
8525
8526
8527
8528
8529
8530
8531
8532
8533
8534
8535
8536
8537
8538
8539
8540
8541
8542
8543
8544
8545
8546
8547
8548
8549
8550
8551
8552
8553
8554
8555
8556
8557
8558
8559
8560
8561
8562
8563
8564
8565
8566
8567
8568
8569
8570
8571
8572
8573
8574
8575
8576
8577
8578
8579
8580
8581
8582
8583
8584
8585
8586
8587
8588
8589
8590
8591
8592
8593
8594
8595
8596
8597
8598
8599
8600
8601
8602
8603
8604
8605
8606
8607
8608
8609
8610
8611
8612
8613
8614
8615
8616
8617
8618
8619
8620
8621
8622
8623
8624
8625
8626
8627
8628
8629
8630
8631
8632
8633
8634
8635
8636
8637
8638
8639
8640
8641
8642
8643
8644
8645
8646
8647
8648
8649
8650
8651
8652
8653
8654
8655
8656
8657
8658
8659
8660
8661
8662
8663
8664
8665
8666
8667
8668
8669
8670
8671
8672
8673
8674
8675
8676
8677
8678
8679
8680
8681
8682
8683
8684
8685
8686
8687
8688
8689
8690
8691
8692
8693
8694
8695
8696
8697
8698
8699
8700
8701
8702
8703
8704
8705
8706
8707
8708
8709
8710
8711
8712
8713
8714
8715
8716
8717
8718
8719
8720
8721
8722
8723
8724
8725
8726
8727
8728
8729
8730
8731
8732
8733
8734
8735
8736
8737
8738
8739
8740
8741
8742
8743
8744
8745
8746
8747
8748
8749
8750
8751
8752
8753
8754
8755
8756
8757
8758
8759
8760
8761
8762
8763
8764
8765
8766
8767
8768
8769
8770
8771
8772
8773
8774
8775
8776
8777
8778
8779
8780
8781
8782
8783
8784
8785
8786
8787
8788
8789
8790
8791
8792
8793
8794
8795
8796
8797
8798
8799
8800
8801
8802
8803
8804
8805
8806
8807
8808
8809
8810
8811
8812
8813
8814
8815
8816
8817
8818
8819
8820
8821
8822
8823
8824
8825
8826
8827
8828
8829
8830
8831
8832
8833
8834
8835
8836
8837
8838
8839
8840
8841
8842
8843
8844
8845
8846
8847
8848
8849
8850
8851
8852
8853
8854
8855
8856
8857
8858
8859
8860
8861
8862
8863
8864
8865
8866
8867
8868
8869
8870
8871
8872
8873
8874
8875
8876
8877
8878
8879
8880
8881
8882
8883
8884
8885
8886
8887
8888
8889
8890
8891
8892
8893
8894
8895
8896
8897
8898
8899
8900
8901
8902
8903
8904
8905
8906
8907
8908
8909
8910
8911
8912
8913
8914
8915
8916
8917
8918
8919
8920
8921
8922
8923
8924
8925
8926
8927
8928
8929
8930
8931
8932
8933
8934
8935
8936
8937
8938
8939
8940
8941
8942
8943
8944
8945
8946
8947
8948
8949
8950
8951
8952
8953
8954
8955
8956
8957
8958
8959
8960
8961
8962
8963
8964
8965
8966
8967
8968
8969
8970
8971
8972
8973
8974
8975
8976
8977
8978
8979
8980
8981
8982
8983
8984
8985
8986
8987
8988
8989
8990
8991
8992
8993
8994
8995
8996
8997
8998
8999
9000
9001
9002
9003
9004
9005
9006
9007
9008
9009
9010
9011
9012
9013
9014
9015
9016
9017
9018
9019
9020
9021
9022
9023
9024
9025
9026
9027
9028
9029
9030
9031
9032
9033
9034
9035
9036
9037
9038
9039
9040
9041
9042
9043
9044
9045
9046
9047
9048
9049
9050
9051
9052
9053
9054
9055
9056
9057
9058
9059
9060
9061
9062
9063
9064
9065
9066
9067
9068
9069
9070
9071
9072
9073
9074
9075
9076
9077
9078
9079
9080
9081
9082
9083
9084
9085
9086
9087
9088
9089
9090
9091
9092
9093
9094
9095
9096
9097
9098
9099
9100
9101
9102
9103
9104
9105
9106
9107
9108
9109
9110
9111
9112
9113
9114
9115
9116
9117
9118
9119
9120
9121
9122
9123
9124
9125
9126
9127
9128
9129
9130
9131
9132
9133
9134
9135
9136
9137
9138
9139
9140
9141
9142
9143
9144
9145
9146
9147
9148
9149
9150
9151
9152
9153
9154
9155
9156
9157
9158
9159
9160
9161
9162
9163
9164
9165
9166
9167
9168
9169
9170
9171
9172
9173
9174
9175
9176
9177
9178
9179
9180
9181
9182
9183
9184
9185
9186
9187
9188
9189
9190
9191
9192
9193
9194
9195
9196
9197
9198
9199
9200
9201
9202
9203
9204
9205
9206
9207
9208
9209
9210
9211
9212
9213
9214
9215
9216
9217
9218
9219
9220
9221
9222
9223
9224
9225
9226
9227
9228
9229
9230
9231
9232
9233
9234
9235
9236
9237
9238
9239
9240
9241
9242
9243
9244
9245
9246
9247
9248
9249
9250
9251
9252
9253
9254
9255
9256
9257
9258
9259
9260
9261
9262
9263
9264
9265
9266
9267
9268
9269
9270
9271
9272
9273
9274
9275
9276
9277
9278
9279
9280
9281
9282
9283
9284
9285
9286
9287
9288
9289
9290
9291
9292
9293
9294
9295
9296
9297
9298
9299
9300
9301
9302
9303
9304
9305
9306
9307
9308
9309
9310
9311
9312
9313
9314
9315
9316
9317
9318
9319
9320
9321
9322
9323
9324
9325
9326
9327
9328
9329
9330
9331
9332
9333
9334
9335
9336
9337
9338
9339
9340
9341
9342
9343
9344
9345
9346
9347
9348
9349
9350
9351
9352
9353
9354
9355
9356
9357
9358
9359
9360
9361
9362
9363
9364
9365
9366
9367
9368
9369
9370
9371
9372
9373
9374
9375
9376
9377
9378
9379
9380
9381
9382
9383
9384
9385
9386
9387
9388
9389
9390
9391
9392
9393
9394
9395
9396
9397
9398
9399
9400
9401
9402
9403
9404
9405
9406
9407
9408
9409
9410
9411
9412
9413
9414
9415
9416
9417
9418
9419
9420
9421
9422
9423
9424
9425
9426
9427
9428
9429
9430
9431
9432
9433
9434
9435
9436
9437
9438
9439
9440
9441
9442
9443
9444
9445
9446
9447
9448
9449
9450
9451
9452
9453
9454
9455
9456
9457
9458
9459
9460
9461
9462
9463
9464
9465
9466
9467
9468
9469
9470
9471
9472
9473
9474
9475
9476
9477
9478
9479
9480
9481
9482
9483
9484
9485
9486
9487
9488
9489
9490
9491
9492
9493
9494
9495
9496
9497
9498
9499
9500
9501
9502
9503
9504
9505
9506
9507
9508
9509
9510
9511
9512
9513
9514
9515
9516
9517
9518
9519
9520
9521
9522
9523
9524
9525
9526
9527
9528
9529
9530
9531
9532
9533
9534
9535
9536
9537
9538
9539
9540
9541
9542
9543
9544
9545
9546
9547
9548
9549
9550
9551
9552
9553
9554
9555
9556
9557
9558
9559
9560
9561
9562
9563
9564
9565
9566
9567
9568
9569
9570
9571
9572
9573
9574
9575
9576
9577
9578
9579
9580
9581
9582
9583
9584
9585
9586
9587
9588
9589
9590
9591
9592
9593
9594
9595
9596
9597
9598
9599
9600
9601
9602
9603
9604
9605
9606
9607
9608
9609
9610
9611
9612
9613
9614
9615
9616
9617
9618
9619
9620
9621
9622
9623
9624
9625
9626
9627
9628
9629
9630
9631
9632
9633
9634
9635
9636
9637
9638
9639
9640
9641
9642
9643
9644
9645
9646
9647
9648
9649
9650
9651
9652
9653
9654
9655
9656
9657
9658
9659
9660
9661
9662
9663
9664
9665
9666
9667
9668
9669
9670
9671
9672
9673
9674
9675
9676
9677
9678
9679
9680
9681
9682
9683
9684
9685
9686
9687
9688
9689
9690
9691
9692
9693
9694
9695
9696
9697
9698
9699
9700
9701
9702
9703
9704
9705
9706
9707
9708
9709
9710
9711
9712
9713
9714
9715
9716
9717
9718
9719
9720
9721
9722
9723
9724
9725
9726
9727
9728
9729
9730
9731
9732
9733
9734
9735
9736
9737
9738
9739
9740
9741
9742
9743
9744
9745
9746
9747
9748
9749
9750
9751
9752
9753
9754
9755
9756
9757
9758
9759
9760
9761
9762
9763
9764
9765
9766
9767
9768
9769
9770
9771
9772
9773
9774
9775
9776
9777
9778
9779
9780
9781
9782
9783
9784
9785
9786
9787
9788
9789
9790
9791
9792
9793
9794
9795
9796
9797
9798
9799
9800
9801
9802
9803
9804
9805
9806
9807
9808
9809
9810
9811
9812
9813
9814
9815
9816
9817
9818
9819
9820
9821
9822
9823
9824
9825
9826
9827
9828
9829
9830
9831
9832
9833
9834
9835
9836
9837
9838
9839
9840
9841
9842
9843
9844
9845
9846
9847
9848
9849
9850
9851
9852
9853
9854
9855
9856
9857
9858
9859
9860
9861
9862
9863
9864
9865
9866
9867
9868
9869
9870
9871
9872
9873
9874
9875
9876
9877
9878
9879
9880
9881
9882
9883
9884
9885
9886
9887
9888
9889
9890
9891
9892
9893
9894
9895
9896
9897
9898
9899
9900
9901
9902
9903
9904
9905
9906
9907
9908
9909
9910
9911
9912
9913
9914
9915
9916
9917
9918
9919
9920
9921
9922
9923
9924
9925
9926
9927
9928
9929
9930
9931
9932
9933
9934
9935
9936
9937
9938
9939
9940
9941
9942
9943
9944
9945
9946
9947
9948
9949
9950
9951
9952
9953
9954
9955
9956
9957
9958
9959
9960
9961
9962
9963
9964
9965
9966
9967
9968
9969
9970
9971
9972
9973
9974
9975
9976
9977
9978
9979
9980
9981
9982
9983
9984
9985
9986
9987
9988
9989
9990
9991
9992
9993
9994
9995
9996
9997
9998
9999
10000
10001
10002
10003
10004
10005
10006
10007
10008
10009
10010
10011
10012
10013
10014
10015
10016
10017
10018
10019
10020
10021
10022
10023
10024
10025
10026
10027
10028
10029
10030
10031
10032
10033
10034
10035
10036
10037
10038
10039
10040
10041
10042
10043
10044
10045
10046
10047
10048
10049
10050
10051
10052
10053
10054
10055
10056
10057
10058
10059
10060
10061
10062
10063
10064
10065
10066
10067
10068
10069
10070
10071
10072
10073
10074
10075
10076
10077
10078
10079
10080
10081
10082
10083
10084
10085
10086
10087
10088
10089
10090
10091
10092
10093
10094
10095
10096
10097
10098
10099
10100
10101
10102
10103
10104
10105
10106
10107
10108
10109
10110
10111
10112
10113
10114
10115
10116
10117
10118
10119
10120
10121
10122
10123
10124
10125
10126
10127
10128
10129
10130
10131
10132
10133
10134
10135
10136
10137
10138
10139
10140
10141
10142
10143
10144
10145
10146
10147
10148
10149
10150
10151
10152
10153
10154
10155
10156
10157
10158
10159
10160
10161
10162
10163
10164
10165
10166
10167
10168
10169
10170
10171
10172
10173
10174
10175
10176
10177
10178
10179
10180
10181
10182
10183
10184
10185
10186
10187
10188
10189
10190
10191
10192
10193
10194
10195
10196
10197
10198
10199
10200
10201
10202
10203
10204
10205
10206
10207
10208
10209
10210
10211
10212
10213
10214
10215
10216
10217
10218
10219
10220
10221
10222
10223
10224
10225
10226
10227
10228
10229
10230
10231
10232
10233
10234
10235
10236
10237
10238
10239
10240
10241
10242
10243
10244
10245
10246
10247
10248
10249
10250
10251
10252
10253
10254
10255
10256
10257
10258
10259
10260
10261
10262
10263
10264
10265
10266
10267
10268
10269
10270
10271
10272
10273
10274
10275
10276
10277
10278
10279
10280
10281
10282
10283
10284
10285
10286
10287
10288
10289
10290
10291
10292
10293
10294
10295
10296
10297
10298
10299
10300
10301
10302
10303
10304
10305
10306
10307
10308
10309
10310
10311
10312
10313
10314
10315
10316
10317
10318
10319
10320
10321
10322
10323
10324
10325
10326
10327
10328
10329
10330
10331
10332
10333
10334
10335
10336
10337
10338
10339
10340
10341
10342
10343
10344
10345
10346
10347
10348
10349
10350
10351
10352
10353
10354
10355
10356
10357
10358
10359
10360
10361
10362
10363
10364
10365
10366
10367
10368
10369
10370
10371
10372
10373
10374
10375
10376
10377
10378
10379
10380
10381
10382
10383
10384
10385
10386
10387
10388
10389
10390
10391
10392
10393
10394
10395
10396
10397
10398
10399
10400
10401
10402
10403
10404
10405
10406
10407
10408
10409
10410
10411
10412
10413
10414
10415
10416
10417
10418
10419
10420
10421
10422
10423
10424
10425
10426
10427
10428
10429
10430
10431
10432
10433
10434
10435
10436
10437
10438
10439
10440
10441
10442
10443
10444
10445
10446
10447
10448
10449
10450
10451
10452
10453
10454
10455
10456
10457
10458
10459
10460
10461
10462
10463
10464
10465
10466
10467
10468
10469
10470
10471
10472
10473
10474
10475
10476
10477
10478
10479
10480
10481
10482
10483
10484
10485
10486
10487
10488
10489
10490
10491
10492
10493
10494
10495
10496
10497
10498
10499
10500
10501
10502
10503
10504
10505
10506
10507
10508
10509
10510
10511
10512
10513
10514
10515
10516
10517
10518
10519
10520
10521
10522
10523
10524
10525
10526
10527
10528
10529
10530
10531
10532
10533
10534
10535
10536
10537
10538
10539
10540
10541
10542
10543
10544
10545
10546
10547
10548
10549
10550
10551
10552
10553
10554
10555
10556
10557
10558
10559
10560
10561
10562
10563
10564
10565
10566
10567
10568
10569
10570
10571
10572
10573
10574
10575
10576
10577
10578
10579
10580
10581
10582
10583
10584
10585
10586
10587
10588
10589
10590
10591
10592
10593
10594
10595
10596
10597
10598
10599
10600
10601
10602
10603
10604
10605
10606
10607
10608
10609
10610
10611
10612
10613
10614
10615
10616
10617
10618
10619
10620
10621
10622
10623
10624
10625
10626
10627
10628
10629
10630
10631
10632
10633
10634
10635
10636
10637
10638
10639
10640
10641
10642
10643
10644
10645
10646
10647
10648
10649
10650
10651
10652
10653
10654
10655
10656
10657
10658
10659
10660
10661
10662
10663
10664
10665
10666
10667
10668
10669
10670
10671
10672
10673
10674
10675
10676
10677
10678
10679
10680
10681
10682
10683
10684
10685
10686
10687
10688
10689
10690
10691
10692
10693
10694
10695
10696
10697
10698
10699
10700
10701
10702
10703
10704
10705
10706
10707
10708
10709
10710
10711
10712
10713
10714
10715
10716
10717
10718
10719
10720
10721
10722
10723
10724
10725
10726
10727
10728
10729
10730
10731
10732
10733
10734
10735
10736
10737
10738
10739
10740
10741
10742
10743
10744
10745
10746
10747
10748
10749
10750
10751
10752
10753
10754
10755
10756
10757
10758
10759
10760
10761
10762
10763
10764
10765
10766
10767
10768
10769
10770
10771
10772
10773
10774
10775
10776
10777
10778
10779
10780
10781
10782
10783
10784
10785
10786
10787
10788
10789
10790
10791
10792
10793
10794
10795
10796
10797
10798
10799
10800
10801
10802
10803
10804
10805
10806
10807
10808
10809
10810
10811
10812
10813
10814
10815
10816
10817
10818
10819
10820
10821
10822
10823
10824
10825
10826
10827
10828
10829
10830
10831
10832
10833
10834
10835
10836
10837
10838
10839
10840
10841
10842
10843
10844
10845
10846
10847
10848
10849
10850
10851
10852
10853
10854
10855
10856
10857
10858
10859
10860
10861
10862
10863
10864
10865
10866
10867
10868
10869
10870
10871
10872
10873
10874
10875
10876
10877
10878
10879
10880
10881
10882
10883
10884
10885
10886
10887
10888
10889
10890
10891
10892
10893
10894
10895
10896
10897
10898
10899
10900
10901
10902
10903
10904
10905
10906
10907
10908
10909
10910
10911
10912
10913
10914
10915
10916
10917
10918
10919
10920
10921
10922
10923
10924
10925
10926
10927
10928
10929
10930
10931
10932
10933
10934
10935
10936
10937
10938
10939
10940
10941
10942
10943
10944
10945
10946
10947
10948
10949
10950
10951
10952
10953
10954
10955
10956
10957
10958
10959
10960
10961
10962
10963
10964
10965
10966
10967
10968
10969
10970
10971
10972
10973
10974
10975
10976
10977
10978
10979
10980
10981
10982
10983
10984
10985
10986
10987
10988
10989
10990
10991
10992
10993
10994
10995
10996
10997
10998
10999
11000
11001
11002
11003
11004
11005
11006
11007
11008
11009
11010
11011
11012
11013
11014
11015
11016
11017
11018
11019
11020
11021
11022
11023
11024
11025
11026
11027
11028
11029
11030
11031
11032
11033
11034
11035
11036
11037
11038
11039
11040
11041
11042
11043
11044
11045
11046
11047
11048
11049
11050
11051
11052
11053
11054
11055
11056
11057
11058
11059
11060
11061
11062
11063
11064
11065
11066
11067
11068
11069
11070
11071
11072
11073
11074
11075
11076
11077
11078
11079
11080
11081
11082
11083
11084
11085
11086
11087
11088
11089
11090
11091
11092
11093
11094
11095
11096
11097
11098
11099
11100
11101
11102
11103
11104
11105
11106
11107
11108
11109
11110
11111
11112
11113
11114
11115
11116
11117
11118
11119
11120
11121
11122
11123
11124
11125
11126
11127
11128
11129
11130
11131
11132
11133
11134
11135
11136
11137
11138
11139
11140
11141
11142
11143
11144
11145
11146
11147
11148
11149
11150
11151
11152
11153
11154
11155
11156
11157
11158
11159
11160
11161
11162
11163
11164
11165
11166
11167
11168
11169
11170
11171
11172
11173
11174
11175
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
/*XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XX
XX Compiler XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
#include "jitpch.h"
#ifdef _MSC_VER
#pragma hdrstop
#endif // _MSC_VER
#include "hostallocator.h"
#include "emit.h"
#include "ssabuilder.h"
#include "valuenum.h"
#include "rangecheck.h"
#ifndef LEGACY_BACKEND
#include "lower.h"
#endif // !LEGACY_BACKEND
#include "jittelemetry.h"
#if defined(DEBUG)
// Column settings for COMPlus_JitDumpIR. We could(should) make these programmable.
#define COLUMN_OPCODE 30
#define COLUMN_OPERANDS (COLUMN_OPCODE + 25)
#define COLUMN_KINDS 110
#define COLUMN_FLAGS (COLUMN_KINDS + 32)
#endif
#if defined(DEBUG)
unsigned Compiler::jitTotalMethodCompiled = 0;
#endif // defined(DEBUG)
#if defined(DEBUG)
LONG Compiler::jitNestingLevel = 0;
#endif // defined(DEBUG)
#ifdef ALT_JIT
// static
bool Compiler::s_pAltJitExcludeAssembliesListInitialized = false;
AssemblyNamesList2* Compiler::s_pAltJitExcludeAssembliesList = nullptr;
#endif // ALT_JIT
/*****************************************************************************
*
* Little helpers to grab the current cycle counter value; this is done
* differently based on target architecture, host toolchain, etc. The
* main thing is to keep the overhead absolutely minimal; in fact, on
* x86/x64 we use RDTSC even though it's not thread-safe; GetThreadCycles
* (which is monotonous) is just too expensive.
*/
#ifdef FEATURE_JIT_METHOD_PERF
#if defined(_HOST_X86_) || defined(_HOST_AMD64_)
#if defined(_MSC_VER)
#include <intrin.h>
inline bool _our_GetThreadCycles(unsigned __int64* cycleOut)
{
*cycleOut = __rdtsc();
return true;
}
#elif defined(__clang__)
inline bool _our_GetThreadCycles(unsigned __int64* cycleOut)
{
uint32_t hi, lo;
__asm__ __volatile__("rdtsc" : "=a"(lo), "=d"(hi));
*cycleOut = (static_cast<unsigned __int64>(hi) << 32) | static_cast<unsigned __int64>(lo);
return true;
}
#else // neither _MSC_VER nor __clang__
// The following *might* work - might as well try.
#define _our_GetThreadCycles(cp) GetThreadCycles(cp)
#endif
#elif defined(_HOST_ARM_) || defined(_HOST_ARM64_)
// If this doesn't work please see ../gc/gc.cpp for additional ARM
// info (and possible solutions).
#define _our_GetThreadCycles(cp) GetThreadCycles(cp)
#else // not x86/x64 and not ARM
// Don't know what this target is, but let's give it a try; if
// someone really wants to make this work, please add the right
// code here.
#define _our_GetThreadCycles(cp) GetThreadCycles(cp)
#endif // which host OS
#endif // FEATURE_JIT_METHOD_PERF
/*****************************************************************************/
inline unsigned getCurTime()
{
SYSTEMTIME tim;
GetSystemTime(&tim);
return (((tim.wHour * 60) + tim.wMinute) * 60 + tim.wSecond) * 1000 + tim.wMilliseconds;
}
/*****************************************************************************/
#ifdef DEBUG
/*****************************************************************************/
static FILE* jitSrcFilePtr;
static unsigned jitCurSrcLine;
void Compiler::JitLogEE(unsigned level, const char* fmt, ...)
{
va_list args;
if (verbose)
{
va_start(args, fmt);
vflogf(jitstdout, fmt, args);
va_end(args);
}
va_start(args, fmt);
vlogf(level, fmt, args);
va_end(args);
}
void Compiler::compDspSrcLinesByLineNum(unsigned line, bool seek)
{
if (!jitSrcFilePtr)
{
return;
}
if (jitCurSrcLine == line)
{
return;
}
if (jitCurSrcLine > line)
{
if (!seek)
{
return;
}
if (fseek(jitSrcFilePtr, 0, SEEK_SET) != 0)
{
printf("Compiler::compDspSrcLinesByLineNum: fseek returned an error.\n");
}
jitCurSrcLine = 0;
}
if (!seek)
{
printf(";\n");
}
do
{
char temp[128];
size_t llen;
if (!fgets(temp, sizeof(temp), jitSrcFilePtr))
{
return;
}
if (seek)
{
continue;
}
llen = strlen(temp);
if (llen && temp[llen - 1] == '\n')
{
temp[llen - 1] = 0;
}
printf("; %s\n", temp);
} while (++jitCurSrcLine < line);
if (!seek)
{
printf(";\n");
}
}
/*****************************************************************************/
void Compiler::compDspSrcLinesByNativeIP(UNATIVE_OFFSET curIP)
{
static IPmappingDsc* nextMappingDsc;
static unsigned lastLine;
if (!opts.dspLines)
{
return;
}
if (curIP == 0)
{
if (genIPmappingList)
{
nextMappingDsc = genIPmappingList;
lastLine = jitGetILoffs(nextMappingDsc->ipmdILoffsx);
unsigned firstLine = jitGetILoffs(nextMappingDsc->ipmdILoffsx);
unsigned earlierLine = (firstLine < 5) ? 0 : firstLine - 5;
compDspSrcLinesByLineNum(earlierLine, true); // display previous 5 lines
compDspSrcLinesByLineNum(firstLine, false);
}
else
{
nextMappingDsc = nullptr;
}
return;
}
if (nextMappingDsc)
{
UNATIVE_OFFSET offset = nextMappingDsc->ipmdNativeLoc.CodeOffset(genEmitter);
if (offset <= curIP)
{
IL_OFFSET nextOffs = jitGetILoffs(nextMappingDsc->ipmdILoffsx);
if (lastLine < nextOffs)
{
compDspSrcLinesByLineNum(nextOffs);
}
else
{
// This offset corresponds to a previous line. Rewind to that line
compDspSrcLinesByLineNum(nextOffs - 2, true);
compDspSrcLinesByLineNum(nextOffs);
}
lastLine = nextOffs;
nextMappingDsc = nextMappingDsc->ipmdNext;
}
}
}
/*****************************************************************************/
#endif // DEBUG
/*****************************************************************************/
#if defined(DEBUG) || MEASURE_NODE_SIZE || MEASURE_BLOCK_SIZE || DISPLAY_SIZES || CALL_ARG_STATS
static unsigned genMethodCnt; // total number of methods JIT'ted
unsigned genMethodICnt; // number of interruptible methods
unsigned genMethodNCnt; // number of non-interruptible methods
static unsigned genSmallMethodsNeedingExtraMemoryCnt = 0;
#endif
/*****************************************************************************/
#if MEASURE_NODE_SIZE
NodeSizeStats genNodeSizeStats;
NodeSizeStats genNodeSizeStatsPerFunc;
unsigned genTreeNcntHistBuckets[] = {10, 20, 30, 40, 50, 100, 200, 300, 400, 500, 1000, 5000, 10000, 0};
Histogram genTreeNcntHist(HostAllocator::getHostAllocator(), genTreeNcntHistBuckets);
unsigned genTreeNsizHistBuckets[] = {1000, 5000, 10000, 50000, 100000, 500000, 1000000, 0};
Histogram genTreeNsizHist(HostAllocator::getHostAllocator(), genTreeNsizHistBuckets);
#endif // MEASURE_NODE_SIZE
/*****************************************************************************/
#if MEASURE_MEM_ALLOC
unsigned memSizeHistBuckets[] = {20, 50, 75, 100, 150, 250, 500, 1000, 5000, 0};
Histogram memAllocHist(HostAllocator::getHostAllocator(), memSizeHistBuckets);
Histogram memUsedHist(HostAllocator::getHostAllocator(), memSizeHistBuckets);
#endif // MEASURE_MEM_ALLOC
/*****************************************************************************
*
* Variables to keep track of total code amounts.
*/
#if DISPLAY_SIZES
size_t grossVMsize; // Total IL code size
size_t grossNCsize; // Native code + data size
size_t totalNCsize; // Native code + data + GC info size (TODO-Cleanup: GC info size only accurate for JIT32_GCENCODER)
size_t gcHeaderISize; // GC header size: interruptible methods
size_t gcPtrMapISize; // GC pointer map size: interruptible methods
size_t gcHeaderNSize; // GC header size: non-interruptible methods
size_t gcPtrMapNSize; // GC pointer map size: non-interruptible methods
#endif // DISPLAY_SIZES
/*****************************************************************************
*
* Variables to keep track of argument counts.
*/
#if CALL_ARG_STATS
unsigned argTotalCalls;
unsigned argHelperCalls;
unsigned argStaticCalls;
unsigned argNonVirtualCalls;
unsigned argVirtualCalls;
unsigned argTotalArgs; // total number of args for all calls (including objectPtr)
unsigned argTotalDWordArgs;
unsigned argTotalLongArgs;
unsigned argTotalFloatArgs;
unsigned argTotalDoubleArgs;
unsigned argTotalRegArgs;
unsigned argTotalTemps;
unsigned argTotalLclVar;
unsigned argTotalDeferred;
unsigned argTotalConst;
unsigned argTotalObjPtr;
unsigned argTotalGTF_ASGinArgs;
unsigned argMaxTempsPerMethod;
unsigned argCntBuckets[] = {0, 1, 2, 3, 4, 5, 6, 10, 0};
Histogram argCntTable(HostAllocator::getHostAllocator(), argCntBuckets);
unsigned argDWordCntBuckets[] = {0, 1, 2, 3, 4, 5, 6, 10, 0};
Histogram argDWordCntTable(HostAllocator::getHostAllocator(), argDWordCntBuckets);
unsigned argDWordLngCntBuckets[] = {0, 1, 2, 3, 4, 5, 6, 10, 0};
Histogram argDWordLngCntTable(HostAllocator::getHostAllocator(), argDWordLngCntBuckets);
unsigned argTempsCntBuckets[] = {0, 1, 2, 3, 4, 5, 6, 10, 0};
Histogram argTempsCntTable(HostAllocator::getHostAllocator(), argTempsCntBuckets);
#endif // CALL_ARG_STATS
/*****************************************************************************
*
* Variables to keep track of basic block counts.
*/
#if COUNT_BASIC_BLOCKS
// --------------------------------------------------
// Basic block count frequency table:
// --------------------------------------------------
// <= 1 ===> 26872 count ( 56% of total)
// 2 .. 2 ===> 669 count ( 58% of total)
// 3 .. 3 ===> 4687 count ( 68% of total)
// 4 .. 5 ===> 5101 count ( 78% of total)
// 6 .. 10 ===> 5575 count ( 90% of total)
// 11 .. 20 ===> 3028 count ( 97% of total)
// 21 .. 50 ===> 1108 count ( 99% of total)
// 51 .. 100 ===> 182 count ( 99% of total)
// 101 .. 1000 ===> 34 count (100% of total)
// 1001 .. 10000 ===> 0 count (100% of total)
// --------------------------------------------------
unsigned bbCntBuckets[] = {1, 2, 3, 5, 10, 20, 50, 100, 1000, 10000, 0};
Histogram bbCntTable(HostAllocator::getHostAllocator(), bbCntBuckets);
/* Histogram for the IL opcode size of methods with a single basic block */
unsigned bbSizeBuckets[] = {1, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 0};
Histogram bbOneBBSizeTable(HostAllocator::getHostAllocator(), bbSizeBuckets);
#endif // COUNT_BASIC_BLOCKS
/*****************************************************************************
*
* Used by optFindNaturalLoops to gather statistical information such as
* - total number of natural loops
* - number of loops with 1, 2, ... exit conditions
* - number of loops that have an iterator (for like)
* - number of loops that have a constant iterator
*/
#if COUNT_LOOPS
unsigned totalLoopMethods; // counts the total number of methods that have natural loops
unsigned maxLoopsPerMethod; // counts the maximum number of loops a method has
unsigned totalLoopOverflows; // # of methods that identified more loops than we can represent
unsigned totalLoopCount; // counts the total number of natural loops
unsigned totalUnnatLoopCount; // counts the total number of (not-necessarily natural) loops
unsigned totalUnnatLoopOverflows; // # of methods that identified more unnatural loops than we can represent
unsigned iterLoopCount; // counts the # of loops with an iterator (for like)
unsigned simpleTestLoopCount; // counts the # of loops with an iterator and a simple loop condition (iter < const)
unsigned constIterLoopCount; // counts the # of loops with a constant iterator (for like)
bool hasMethodLoops; // flag to keep track if we already counted a method as having loops
unsigned loopsThisMethod; // counts the number of loops in the current method
bool loopOverflowThisMethod; // True if we exceeded the max # of loops in the method.
/* Histogram for number of loops in a method */
unsigned loopCountBuckets[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 0};
Histogram loopCountTable(HostAllocator::getHostAllocator(), loopCountBuckets);
/* Histogram for number of loop exits */
unsigned loopExitCountBuckets[] = {0, 1, 2, 3, 4, 5, 6, 0};
Histogram loopExitCountTable(HostAllocator::getHostAllocator(), loopExitCountBuckets);
#endif // COUNT_LOOPS
//------------------------------------------------------------------------
// getJitGCType: Given the VM's CorInfoGCType convert it to the JIT's var_types
//
// Arguments:
// gcType - an enum value that originally came from an element
// of the BYTE[] returned from getClassGClayout()
//
// Return Value:
// The corresponsing enum value from the JIT's var_types
//
// Notes:
// The gcLayout of each field of a struct is returned from getClassGClayout()
// as a BYTE[] but each BYTE element is actually a CorInfoGCType value
// Note when we 'know' that there is only one element in theis array
// the JIT will often pass the address of a single BYTE, instead of a BYTE[]
//
var_types Compiler::getJitGCType(BYTE gcType)
{
var_types result = TYP_UNKNOWN;
CorInfoGCType corInfoType = (CorInfoGCType)gcType;
if (corInfoType == TYPE_GC_NONE)
{
result = TYP_I_IMPL;
}
else if (corInfoType == TYPE_GC_REF)
{
result = TYP_REF;
}
else if (corInfoType == TYPE_GC_BYREF)
{
result = TYP_BYREF;
}
else
{
noway_assert(!"Bad value of 'gcType'");
}
return result;
}
#if FEATURE_MULTIREG_ARGS
//---------------------------------------------------------------------------
// getStructGcPtrsFromOp: Given a GenTree node of TYP_STRUCT that represents
// a pass by value argument, return the gcPtr layout
// for the pointers sized fields
// Arguments:
// op - the operand of TYP_STRUCT that is passed by value
// gcPtrsOut - an array of BYTES that are written by this method
// they will contain the VM's CorInfoGCType values
// for each pointer sized field
// Return Value:
// Two [or more] values are written into the gcPtrs array
//
// Note that for ARM64 there will alwys be exactly two pointer sized fields
void Compiler::getStructGcPtrsFromOp(GenTreePtr op, BYTE* gcPtrsOut)
{
assert(op->TypeGet() == TYP_STRUCT);
#ifdef _TARGET_ARM64_
if (op->OperGet() == GT_OBJ)
{
CORINFO_CLASS_HANDLE objClass = op->gtObj.gtClass;
int structSize = info.compCompHnd->getClassSize(objClass);
assert(structSize <= 2 * TARGET_POINTER_SIZE);
BYTE gcPtrsTmp[2] = {TYPE_GC_NONE, TYPE_GC_NONE};
info.compCompHnd->getClassGClayout(objClass, &gcPtrsTmp[0]);
gcPtrsOut[0] = gcPtrsTmp[0];
gcPtrsOut[1] = gcPtrsTmp[1];
}
else if (op->OperGet() == GT_LCL_VAR)
{
GenTreeLclVarCommon* varNode = op->AsLclVarCommon();
unsigned varNum = varNode->gtLclNum;
assert(varNum < lvaCount);
LclVarDsc* varDsc = &lvaTable[varNum];
// At this point any TYP_STRUCT LclVar must be a 16-byte pass by value argument
assert(varDsc->lvSize() == 2 * TARGET_POINTER_SIZE);
gcPtrsOut[0] = varDsc->lvGcLayout[0];
gcPtrsOut[1] = varDsc->lvGcLayout[1];
}
else
#endif
{
noway_assert(!"Unsupported Oper for getStructGcPtrsFromOp");
}
}
#endif // FEATURE_MULTIREG_ARGS
#ifdef ARM_SOFTFP
//---------------------------------------------------------------------------
// IsSingleFloat32Struct:
// Check if the given struct type contains only one float32 value type
//
// Arguments:
// clsHnd - the handle for the struct type
//
// Return Value:
// true if the given struct type contains only one float32 value type,
// false otherwise.
//
bool Compiler::isSingleFloat32Struct(CORINFO_CLASS_HANDLE clsHnd)
{
for (;;)
{
// all of class chain must be of value type and must have only one field
if (!info.compCompHnd->isValueClass(clsHnd) || info.compCompHnd->getClassNumInstanceFields(clsHnd) != 1)
{
return false;
}
CORINFO_CLASS_HANDLE* pClsHnd = &clsHnd;
CORINFO_FIELD_HANDLE fldHnd = info.compCompHnd->getFieldInClass(clsHnd, 0);
CorInfoType fieldType = info.compCompHnd->getFieldType(fldHnd, pClsHnd);
switch (fieldType)
{
case CORINFO_TYPE_VALUECLASS:
clsHnd = *pClsHnd;
break;
case CORINFO_TYPE_FLOAT:
return true;
default:
return false;
}
}
}
#endif // ARM_SOFTFP
//-----------------------------------------------------------------------------
// getPrimitiveTypeForStruct:
// Get the "primitive" type that is is used for a struct
// of size 'structSize'.
// We examine 'clsHnd' to check the GC layout of the struct and
// return TYP_REF for structs that simply wrap an object.
// If the struct is a one element HFA, we will return the
// proper floating point type.
//
// Arguments:
// structSize - the size of the struct type, cannot be zero
// clsHnd - the handle for the struct type, used when may have
// an HFA or if we need the GC layout for an object ref.
//
// Return Value:
// The primitive type (i.e. byte, short, int, long, ref, float, double)
// used to pass or return structs of this size.
// If we shouldn't use a "primitive" type then TYP_UNKNOWN is returned.
// Notes:
// For 32-bit targets (X86/ARM32) the 64-bit TYP_LONG type is not
// considered a primitive type by this method.
// So a struct that wraps a 'long' is passed and returned in the
// same way as any other 8-byte struct
// For ARM32 if we have an HFA struct that wraps a 64-bit double
// we will return TYP_DOUBLE.
//
var_types Compiler::getPrimitiveTypeForStruct(unsigned structSize, CORINFO_CLASS_HANDLE clsHnd)
{
assert(structSize != 0);
var_types useType;
switch (structSize)
{
case 1:
useType = TYP_BYTE;
break;
case 2:
useType = TYP_SHORT;
break;
#ifndef _TARGET_XARCH_
case 3:
useType = TYP_INT;
break;
#endif // _TARGET_XARCH_
#ifdef _TARGET_64BIT_
case 4:
if (IsHfa(clsHnd))
{
// A structSize of 4 with IsHfa, it must be an HFA of one float
useType = TYP_FLOAT;
}
else
{
useType = TYP_INT;
}
break;
#ifndef _TARGET_XARCH_
case 5:
case 6:
case 7:
useType = TYP_I_IMPL;
break;
#endif // _TARGET_XARCH_
#endif // _TARGET_64BIT_
case TARGET_POINTER_SIZE:
#ifdef ARM_SOFTFP
// For ARM_SOFTFP, HFA is unsupported so we need to check in another way
// This matters only for size-4 struct cause bigger structs would be processed with RetBuf
if (isSingleFloat32Struct(clsHnd))
#else // !ARM_SOFTFP
if (IsHfa(clsHnd))
#endif // ARM_SOFTFP
{
#ifdef _TARGET_64BIT_
var_types hfaType = GetHfaType(clsHnd);
// A structSize of 8 with IsHfa, we have two possiblities:
// An HFA of one double or an HFA of two floats
//
// Check and exclude the case of an HFA of two floats
if (hfaType == TYP_DOUBLE)
{
// We have an HFA of one double
useType = TYP_DOUBLE;
}
else
{
assert(hfaType == TYP_FLOAT);
// We have an HFA of two floats
// This should be passed or returned in two FP registers
useType = TYP_UNKNOWN;
}
#else // a 32BIT target
// A structSize of 4 with IsHfa, it must be an HFA of one float
useType = TYP_FLOAT;
#endif // _TARGET_64BIT_
}
else
{
BYTE gcPtr = 0;
// Check if this pointer-sized struct is wrapping a GC object
info.compCompHnd->getClassGClayout(clsHnd, &gcPtr);
useType = getJitGCType(gcPtr);
}
break;
#ifdef _TARGET_ARM_
case 8:
if (IsHfa(clsHnd))
{
var_types hfaType = GetHfaType(clsHnd);
// A structSize of 8 with IsHfa, we have two possiblities:
// An HFA of one double or an HFA of two floats
//
// Check and exclude the case of an HFA of two floats
if (hfaType == TYP_DOUBLE)
{
// We have an HFA of one double
useType = TYP_DOUBLE;
}
else
{
assert(hfaType == TYP_FLOAT);
// We have an HFA of two floats
// This should be passed or returned in two FP registers
useType = TYP_UNKNOWN;
}
}
else
{
// We don't have an HFA
useType = TYP_UNKNOWN;
}
break;
#endif // _TARGET_ARM_
default:
useType = TYP_UNKNOWN;
break;
}
return useType;
}
//-----------------------------------------------------------------------------
// getArgTypeForStruct:
// Get the type that is used to pass values of the given struct type.
// If you have already retrieved the struct size then it should be
// passed as the optional third argument, as this allows us to avoid
// an extra call to getClassSize(clsHnd)
//
// Arguments:
// clsHnd - the handle for the struct type
// wbPassStruct - An "out" argument with information about how
// the struct is to be passed
// structSize - the size of the struct type,
// or zero if we should call getClassSize(clsHnd)
//
// Return Value:
// For wbPassStruct you can pass a 'nullptr' and nothing will be written
// or returned for that out parameter.
// When *wbPassStruct is SPK_PrimitiveType this method's return value
// is the primitive type used to pass the struct.
// When *wbPassStruct is SPK_ByReference this method's return value
// is always TYP_UNKNOWN and the struct type is passed by reference to a copy
// When *wbPassStruct is SPK_ByValue or SPK_ByValueAsHfa this method's return value
// is always TYP_STRUCT and the struct type is passed by value either
// using multiple registers or on the stack.
//
// Assumptions:
// The size must be the size of the given type.
// The given class handle must be for a value type (struct).
//
// Notes:
// About HFA types:
// When the clsHnd is a one element HFA type we return the appropriate
// floating point primitive type and *wbPassStruct is SPK_PrimitiveType
// If there are two or more elements in the HFA type then the this method's
// return value is TYP_STRUCT and *wbPassStruct is SPK_ByValueAsHfa
//
var_types Compiler::getArgTypeForStruct(CORINFO_CLASS_HANDLE clsHnd,
structPassingKind* wbPassStruct,
unsigned structSize /* = 0 */)
{
var_types useType = TYP_UNKNOWN;
structPassingKind howToPassStruct = SPK_Unknown; // We must change this before we return
if (structSize == 0)
{
structSize = info.compCompHnd->getClassSize(clsHnd);
}
assert(structSize > 0);
#ifdef FEATURE_UNIX_AMD64_STRUCT_PASSING
// An 8-byte struct may need to be passed in a floating point register
// So we always consult the struct "Classifier" routine
//
SYSTEMV_AMD64_CORINFO_STRUCT_REG_PASSING_DESCRIPTOR structDesc;
eeGetSystemVAmd64PassStructInRegisterDescriptor(clsHnd, &structDesc);
// If we have one eightByteCount then we can set 'useType' based on that
if (structDesc.eightByteCount == 1)
{
// Set 'useType' to the type of the first eightbyte item
useType = GetEightByteType(structDesc, 0);
}
#elif defined(_TARGET_X86_)
// On x86 we never pass structs as primitive types (unless the VM unwraps them for us)
useType = TYP_UNKNOWN;
#else // all other targets
// The largest primitive type is 8 bytes (TYP_DOUBLE)
// so we can skip calling getPrimitiveTypeForStruct when we
// have a struct that is larger than that.
//
if (structSize <= sizeof(double))
{
// We set the "primitive" useType based upon the structSize
// and also examine the clsHnd to see if it is an HFA of count one
useType = getPrimitiveTypeForStruct(structSize, clsHnd);
}
#endif // all other targets
// Did we change this struct type into a simple "primitive" type?
//
if (useType != TYP_UNKNOWN)
{
// Yes, we should use the "primitive" type in 'useType'
howToPassStruct = SPK_PrimitiveType;
}
else // We can't replace the struct with a "primitive" type
{
// See if we can pass this struct by value, possibly in multiple registers
// or if we should pass it by reference to a copy
//
if (structSize <= MAX_PASS_MULTIREG_BYTES)
{
// Structs that are HFA's are passed by value in multiple registers
if (IsHfa(clsHnd))
{
// HFA's of count one should have been handled by getPrimitiveTypeForStruct
assert(GetHfaCount(clsHnd) >= 2);
// setup wbPassType and useType indicate that this is passed by value as an HFA
// using multiple registers
// (when all of the parameters registers are used, then the stack will be used)
howToPassStruct = SPK_ByValueAsHfa;
useType = TYP_STRUCT;
}
else // Not an HFA struct type
{
#ifdef FEATURE_UNIX_AMD64_STRUCT_PASSING
// The case of (structDesc.eightByteCount == 1) should have already been handled
if (structDesc.eightByteCount > 1)
{
// setup wbPassType and useType indicate that this is passed by value in multiple registers
// (when all of the parameters registers are used, then the stack will be used)
howToPassStruct = SPK_ByValue;
useType = TYP_STRUCT;
}
else
{
assert(structDesc.eightByteCount == 0);
// Otherwise we pass this struct by reference to a copy
// setup wbPassType and useType indicate that this is passed using one register
// (by reference to a copy)
howToPassStruct = SPK_ByReference;
useType = TYP_UNKNOWN;
}
#elif defined(_TARGET_ARM64_)
// Structs that are pointer sized or smaller should have been handled by getPrimitiveTypeForStruct
assert(structSize > TARGET_POINTER_SIZE);
// On ARM64 structs that are 9-16 bytes are passed by value in multiple registers
//
if (structSize <= (TARGET_POINTER_SIZE * 2))
{
// setup wbPassType and useType indicate that this is passed by value in multiple registers
// (when all of the parameters registers are used, then the stack will be used)
howToPassStruct = SPK_ByValue;
useType = TYP_STRUCT;
}
else // a structSize that is 17-32 bytes in size
{
// Otherwise we pass this struct by reference to a copy
// setup wbPassType and useType indicate that this is passed using one register
// (by reference to a copy)
howToPassStruct = SPK_ByReference;
useType = TYP_UNKNOWN;
}
#elif defined(_TARGET_X86_) || defined(_TARGET_ARM_)
// Otherwise we pass this struct by value on the stack
// setup wbPassType and useType indicate that this is passed by value according to the X86/ARM32 ABI
howToPassStruct = SPK_ByValue;
useType = TYP_STRUCT;
#else // _TARGET_XXX_
noway_assert(!"Unhandled TARGET in getArgTypeForStruct (with FEATURE_MULTIREG_ARGS=1)");
#endif // _TARGET_XXX_
}
}
else // (structSize > MAX_PASS_MULTIREG_BYTES)
{
// We have a (large) struct that can't be replaced with a "primitive" type
// and can't be passed in multiple registers
CLANG_FORMAT_COMMENT_ANCHOR;
#if defined(_TARGET_X86_) || defined(_TARGET_ARM_)
// Otherwise we pass this struct by value on the stack
// setup wbPassType and useType indicate that this is passed by value according to the X86/ARM32 ABI
howToPassStruct = SPK_ByValue;
useType = TYP_STRUCT;
#elif defined(_TARGET_AMD64_) || defined(_TARGET_ARM64_)
// Otherwise we pass this struct by reference to a copy
// setup wbPassType and useType indicate that this is passed using one register (by reference to a copy)
howToPassStruct = SPK_ByReference;
useType = TYP_UNKNOWN;
#else // _TARGET_XXX_
noway_assert(!"Unhandled TARGET in getArgTypeForStruct");
#endif // _TARGET_XXX_
}
}
// 'howToPassStruct' must be set to one of the valid values before we return
assert(howToPassStruct != SPK_Unknown);
if (wbPassStruct != nullptr)
{
*wbPassStruct = howToPassStruct;
}
return useType;
}
//-----------------------------------------------------------------------------
// getReturnTypeForStruct:
// Get the type that is used to return values of the given struct type.
// If you have already retrieved the struct size then it should be
// passed as the optional third argument, as this allows us to avoid
// an extra call to getClassSize(clsHnd)
//
// Arguments:
// clsHnd - the handle for the struct type
// wbReturnStruct - An "out" argument with information about how
// the struct is to be returned
// structSize - the size of the struct type,
// or zero if we should call getClassSize(clsHnd)
//
// Return Value:
// For wbReturnStruct you can pass a 'nullptr' and nothing will be written
// or returned for that out parameter.
// When *wbReturnStruct is SPK_PrimitiveType this method's return value
// is the primitive type used to return the struct.
// When *wbReturnStruct is SPK_ByReference this method's return value
// is always TYP_UNKNOWN and the struct type is returned using a return buffer
// When *wbReturnStruct is SPK_ByValue or SPK_ByValueAsHfa this method's return value
// is always TYP_STRUCT and the struct type is returned using multiple registers.
//
// Assumptions:
// The size must be the size of the given type.
// The given class handle must be for a value type (struct).
//
// Notes:
// About HFA types:
// When the clsHnd is a one element HFA type then this method's return
// value is the appropriate floating point primitive type and
// *wbReturnStruct is SPK_PrimitiveType.
// If there are two or more elements in the HFA type and the target supports
// multireg return types then the return value is TYP_STRUCT and
// *wbReturnStruct is SPK_ByValueAsHfa.
// Additionally if there are two or more elements in the HFA type and
// the target doesn't support multreg return types then it is treated
// as if it wasn't an HFA type.
// About returning TYP_STRUCT:
// Whenever this method's return value is TYP_STRUCT it always means
// that multiple registers are used to return this struct.
//
var_types Compiler::getReturnTypeForStruct(CORINFO_CLASS_HANDLE clsHnd,
structPassingKind* wbReturnStruct /* = nullptr */,
unsigned structSize /* = 0 */)
{
var_types useType = TYP_UNKNOWN;
structPassingKind howToReturnStruct = SPK_Unknown; // We must change this before we return
assert(clsHnd != NO_CLASS_HANDLE);
if (structSize == 0)
{
structSize = info.compCompHnd->getClassSize(clsHnd);
}
assert(structSize > 0);
#ifdef FEATURE_UNIX_AMD64_STRUCT_PASSING
// An 8-byte struct may need to be returned in a floating point register
// So we always consult the struct "Classifier" routine
//
SYSTEMV_AMD64_CORINFO_STRUCT_REG_PASSING_DESCRIPTOR structDesc;
eeGetSystemVAmd64PassStructInRegisterDescriptor(clsHnd, &structDesc);
// If we have one eightByteCount then we can set 'useType' based on that
if (structDesc.eightByteCount == 1)
{
// Set 'useType' to the type of the first eightbyte item
useType = GetEightByteType(structDesc, 0);
assert(structDesc.passedInRegisters == true);
}
#else // not UNIX_AMD64
// The largest primitive type is 8 bytes (TYP_DOUBLE)
// so we can skip calling getPrimitiveTypeForStruct when we
// have a struct that is larger than that.
//
if (structSize <= sizeof(double))
{
// We set the "primitive" useType based upon the structSize
// and also examine the clsHnd to see if it is an HFA of count one
useType = getPrimitiveTypeForStruct(structSize, clsHnd);
}
#endif // FEATURE_UNIX_AMD64_STRUCT_PASSING
#ifdef _TARGET_64BIT_
// Note this handles an odd case when FEATURE_MULTIREG_RET is disabled and HFAs are enabled
//
// getPrimitiveTypeForStruct will return TYP_UNKNOWN for a struct that is an HFA of two floats
// because when HFA are enabled, normally we would use two FP registers to pass or return it
//
// But if we don't have support for multiple register return types, we have to change this.
// Since we what we have an 8-byte struct (float + float) we change useType to TYP_I_IMPL
// so that the struct is returned instead using an 8-byte integer register.
//
if ((FEATURE_MULTIREG_RET == 0) && (useType == TYP_UNKNOWN) && (structSize == (2 * sizeof(float))) && IsHfa(clsHnd))
{
useType = TYP_I_IMPL;
}
#endif
// Did we change this struct type into a simple "primitive" type?
//
if (useType != TYP_UNKNOWN)
{
// Yes, we should use the "primitive" type in 'useType'
howToReturnStruct = SPK_PrimitiveType;
}
else // We can't replace the struct with a "primitive" type
{
// See if we can return this struct by value, possibly in multiple registers
// or if we should return it using a return buffer register
//
if ((FEATURE_MULTIREG_RET == 1) && (structSize <= MAX_RET_MULTIREG_BYTES))
{
// Structs that are HFA's are returned in multiple registers
if (IsHfa(clsHnd))
{
// HFA's of count one should have been handled by getPrimitiveTypeForStruct
assert(GetHfaCount(clsHnd) >= 2);
// setup wbPassType and useType indicate that this is returned by value as an HFA
// using multiple registers
howToReturnStruct = SPK_ByValueAsHfa;
useType = TYP_STRUCT;
}
else // Not an HFA struct type
{
#ifdef FEATURE_UNIX_AMD64_STRUCT_PASSING
// The case of (structDesc.eightByteCount == 1) should have already been handled
if (structDesc.eightByteCount > 1)
{
// setup wbPassType and useType indicate that this is returned by value in multiple registers
howToReturnStruct = SPK_ByValue;
useType = TYP_STRUCT;
assert(structDesc.passedInRegisters == true);
}
else
{
assert(structDesc.eightByteCount == 0);
// Otherwise we return this struct using a return buffer
// setup wbPassType and useType indicate that this is return using a return buffer register
// (reference to a return buffer)
howToReturnStruct = SPK_ByReference;
useType = TYP_UNKNOWN;
assert(structDesc.passedInRegisters == false);
}
#elif defined(_TARGET_ARM64_)
// Structs that are pointer sized or smaller should have been handled by getPrimitiveTypeForStruct
assert(structSize > TARGET_POINTER_SIZE);
// On ARM64 structs that are 9-16 bytes are returned by value in multiple registers
//
if (structSize <= (TARGET_POINTER_SIZE * 2))
{
// setup wbPassType and useType indicate that this is return by value in multiple registers
howToReturnStruct = SPK_ByValue;
useType = TYP_STRUCT;
}
else // a structSize that is 17-32 bytes in size
{
// Otherwise we return this struct using a return buffer
// setup wbPassType and useType indicate that this is returned using a return buffer register
// (reference to a return buffer)
howToReturnStruct = SPK_ByReference;
useType = TYP_UNKNOWN;
}
#elif defined(_TARGET_ARM_) || defined(_TARGET_X86_)
// Otherwise we return this struct using a return buffer
// setup wbPassType and useType indicate that this is returned using a return buffer register
// (reference to a return buffer)
howToReturnStruct = SPK_ByReference;
useType = TYP_UNKNOWN;
#else // _TARGET_XXX_
noway_assert(!"Unhandled TARGET in getReturnTypeForStruct (with FEATURE_MULTIREG_ARGS=1)");
#endif // _TARGET_XXX_
}
}
else // (structSize > MAX_RET_MULTIREG_BYTES) || (FEATURE_MULTIREG_RET == 0)
{
// We have a (large) struct that can't be replaced with a "primitive" type
// and can't be returned in multiple registers
// We return this struct using a return buffer register
// setup wbPassType and useType indicate that this is returned using a return buffer register
// (reference to a return buffer)
howToReturnStruct = SPK_ByReference;
useType = TYP_UNKNOWN;
}
}
// 'howToReturnStruct' must be set to one of the valid values before we return
assert(howToReturnStruct != SPK_Unknown);
if (wbReturnStruct != nullptr)
{
*wbReturnStruct = howToReturnStruct;
}
return useType;
}
///////////////////////////////////////////////////////////////////////////////
//
// MEASURE_NOWAY: code to measure and rank dynamic occurences of noway_assert.
// (Just the appearances of noway_assert, whether the assert is true or false.)
// This might help characterize the cost of noway_assert in non-DEBUG builds,
// or determine which noway_assert should be simple DEBUG-only asserts.
//
///////////////////////////////////////////////////////////////////////////////
#if MEASURE_NOWAY
struct FileLine
{
char* m_file;
unsigned m_line;
char* m_condStr;
FileLine() : m_file(nullptr), m_line(0), m_condStr(nullptr)
{
}
FileLine(const char* file, unsigned line, const char* condStr) : m_line(line)
{
size_t newSize = (strlen(file) + 1) * sizeof(char);
m_file = (char*)HostAllocator::getHostAllocator()->Alloc(newSize);
strcpy_s(m_file, newSize, file);
newSize = (strlen(condStr) + 1) * sizeof(char);
m_condStr = (char*)HostAllocator::getHostAllocator()->Alloc(newSize);
strcpy_s(m_condStr, newSize, condStr);
}
FileLine(const FileLine& other)
{
m_file = other.m_file;
m_line = other.m_line;
m_condStr = other.m_condStr;
}
// GetHashCode() and Equals() are needed by SimplerHashTable
static unsigned GetHashCode(FileLine fl)
{
assert(fl.m_file != nullptr);
unsigned code = fl.m_line;
for (const char* p = fl.m_file; *p != '\0'; p++)
{
code += *p;
}
// Could also add condStr.
return code;
}
static bool Equals(FileLine fl1, FileLine fl2)
{
return (fl1.m_line == fl2.m_line) && (0 == strcmp(fl1.m_file, fl2.m_file));
}
};
typedef SimplerHashTable<FileLine, FileLine, size_t, JitSimplerHashBehavior> FileLineToCountMap;
FileLineToCountMap* NowayAssertMap;
void Compiler::RecordNowayAssert(const char* filename, unsigned line, const char* condStr)
{
if (NowayAssertMap == nullptr)
{
NowayAssertMap = new (HostAllocator::getHostAllocator()) FileLineToCountMap(HostAllocator::getHostAllocator());
}
FileLine fl(filename, line, condStr);
size_t* pCount = NowayAssertMap->LookupPointer(fl);
if (pCount == nullptr)
{
NowayAssertMap->Set(fl, 1);
}
else
{
++(*pCount);
}
}
void RecordNowayAssertGlobal(const char* filename, unsigned line, const char* condStr)
{
if ((JitConfig.JitMeasureNowayAssert() == 1) && (JitTls::GetCompiler() != nullptr))
{
JitTls::GetCompiler()->RecordNowayAssert(filename, line, condStr);
}
}
struct NowayAssertCountMap
{
size_t count;
FileLine fl;
NowayAssertCountMap() : count(0)
{
}
static int __cdecl compare(const void* elem1, const void* elem2)
{
NowayAssertCountMap* e1 = (NowayAssertCountMap*)elem1;
NowayAssertCountMap* e2 = (NowayAssertCountMap*)elem2;
return (int)((ssize_t)e2->count - (ssize_t)e1->count); // sort in descending order
}
};
void DisplayNowayAssertMap()
{
if (NowayAssertMap != nullptr)
{
FILE* fout;
LPCWSTR strJitMeasureNowayAssertFile = JitConfig.JitMeasureNowayAssertFile();
if (strJitMeasureNowayAssertFile != nullptr)
{
fout = _wfopen(strJitMeasureNowayAssertFile, W("a"));
if (fout == nullptr)
{
fprintf(jitstdout, "Failed to open JitMeasureNowayAssertFile \"%ws\"\n", strJitMeasureNowayAssertFile);
return;
}
}
else
{
fout = jitstdout;
}
// Iterate noway assert map, create sorted table by occurrence, dump it.
unsigned count = NowayAssertMap->GetCount();
NowayAssertCountMap* nacp = new NowayAssertCountMap[count];
unsigned i = 0;
for (FileLineToCountMap::KeyIterator iter = NowayAssertMap->Begin(), end = NowayAssertMap->End();
!iter.Equal(end); ++iter)
{
nacp[i].count = iter.GetValue();
nacp[i].fl = iter.Get();
++i;
}
qsort(nacp, count, sizeof(nacp[0]), NowayAssertCountMap::compare);
if (fout == jitstdout)
{
// Don't output the header if writing to a file, since we'll be appending to existing dumps in that case.
fprintf(fout, "\nnoway_assert counts:\n");
fprintf(fout, "count, file, line, text\n");
}
for (i = 0; i < count; i++)
{
fprintf(fout, "%u, %s, %u, \"%s\"\n", nacp[i].count, nacp[i].fl.m_file, nacp[i].fl.m_line,
nacp[i].fl.m_condStr);
}
if (fout != jitstdout)
{
fclose(fout);
fout = nullptr;
}
}
}
#endif // MEASURE_NOWAY
/*****************************************************************************
* variables to keep track of how many iterations we go in a dataflow pass
*/
#if DATAFLOW_ITER
unsigned CSEiterCount; // counts the # of iteration for the CSE dataflow
unsigned CFiterCount; // counts the # of iteration for the Const Folding dataflow
#endif // DATAFLOW_ITER
#if MEASURE_BLOCK_SIZE
size_t genFlowNodeSize;
size_t genFlowNodeCnt;
#endif // MEASURE_BLOCK_SIZE
/*****************************************************************************/
// We keep track of methods we've already compiled.
/*****************************************************************************
* Declare the statics
*/
#ifdef DEBUG
/* static */
unsigned Compiler::s_compMethodsCount = 0; // to produce unique label names
#endif
#if MEASURE_MEM_ALLOC
/* static */
bool Compiler::s_dspMemStats = false;
#endif
#ifndef PROFILING_SUPPORTED
const bool Compiler::Options::compNoPInvokeInlineCB = false;
#endif
/*****************************************************************************
*
* One time initialization code
*/
/* static */
void Compiler::compStartup()
{
#if DISPLAY_SIZES
grossVMsize = grossNCsize = totalNCsize = 0;
#endif // DISPLAY_SIZES
// Initialize the JIT's allocator.
ArenaAllocator::startup();
/* Initialize the table of tree node sizes */
GenTree::InitNodeSize();
#ifdef JIT32_GCENCODER
// Initialize the GC encoder lookup table
GCInfo::gcInitEncoderLookupTable();
#endif
/* Initialize the emitter */
emitter::emitInit();
// Static vars of ValueNumStore
ValueNumStore::InitValueNumStoreStatics();
compDisplayStaticSizes(jitstdout);
}
/*****************************************************************************
*
* One time finalization code
*/
/* static */
void Compiler::compShutdown()
{
#ifdef ALT_JIT
if (s_pAltJitExcludeAssembliesList != nullptr)
{
s_pAltJitExcludeAssembliesList->~AssemblyNamesList2(); // call the destructor
s_pAltJitExcludeAssembliesList = nullptr;
}
#endif // ALT_JIT
#if MEASURE_NOWAY
DisplayNowayAssertMap();
#endif // MEASURE_NOWAY
ArenaAllocator::shutdown();
/* Shut down the emitter */
emitter::emitDone();
#if defined(DEBUG) || defined(INLINE_DATA)
// Finish reading and/or writing inline xml
InlineStrategy::FinalizeXml();
#endif // defined(DEBUG) || defined(INLINE_DATA)
#if defined(DEBUG) || MEASURE_NODE_SIZE || MEASURE_BLOCK_SIZE || DISPLAY_SIZES || CALL_ARG_STATS
if (genMethodCnt == 0)
{
return;
}
#endif
#if NODEBASH_STATS
GenTree::ReportOperBashing(jitstdout);
#endif
// Where should we write our statistics output?
FILE* fout = jitstdout;
#ifdef FEATURE_JIT_METHOD_PERF
if (compJitTimeLogFilename != nullptr)
{
FILE* jitTimeLogFile = _wfopen(compJitTimeLogFilename, W("a"));
if (jitTimeLogFile != nullptr)
{
CompTimeSummaryInfo::s_compTimeSummary.Print(jitTimeLogFile);
fclose(jitTimeLogFile);
}
}
#endif // FEATURE_JIT_METHOD_PERF
#if FUNC_INFO_LOGGING
if (compJitFuncInfoFile != nullptr)
{
fclose(compJitFuncInfoFile);
compJitFuncInfoFile = nullptr;
}
#endif // FUNC_INFO_LOGGING
#if COUNT_RANGECHECKS
if (optRangeChkAll > 0)
{
fprintf(fout, "Removed %u of %u range checks\n", optRangeChkRmv, optRangeChkAll);
}
#endif // COUNT_RANGECHECKS
#if COUNT_AST_OPERS
// Add up all the counts so that we can show percentages of total
unsigned gtc = 0;
for (unsigned op = 0; op < GT_COUNT; op++)
gtc += GenTree::s_gtNodeCounts[op];
if (gtc > 0)
{
unsigned rem_total = gtc;
unsigned rem_large = 0;
unsigned rem_small = 0;
unsigned tot_large = 0;
unsigned tot_small = 0;
fprintf(fout, "\nGenTree operator counts (approximate):\n\n");
for (unsigned op = 0; op < GT_COUNT; op++)
{
unsigned siz = GenTree::s_gtTrueSizes[op];
unsigned cnt = GenTree::s_gtNodeCounts[op];
double pct = 100.0 * cnt / gtc;
if (siz > TREE_NODE_SZ_SMALL)
tot_large += cnt;
else
tot_small += cnt;
// Let's not show anything below a threshold
if (pct >= 0.5)
{
fprintf(fout, " GT_%-17s %7u (%4.1lf%%) %3u bytes each\n", GenTree::OpName((genTreeOps)op), cnt,
pct, siz);
rem_total -= cnt;
}
else
{
if (siz > TREE_NODE_SZ_SMALL)
rem_large += cnt;
else
rem_small += cnt;
}
}
if (rem_total > 0)
{
fprintf(fout, " All other GT_xxx ... %7u (%4.1lf%%) ... %4.1lf%% small + %4.1lf%% large\n", rem_total,
100.0 * rem_total / gtc, 100.0 * rem_small / gtc, 100.0 * rem_large / gtc);
}
fprintf(fout, " -----------------------------------------------------\n");
fprintf(fout, " Total ....... %11u --ALL-- ... %4.1lf%% small + %4.1lf%% large\n", gtc,
100.0 * tot_small / gtc, 100.0 * tot_large / gtc);
fprintf(fout, "\n");
}
#endif // COUNT_AST_OPERS
#if DISPLAY_SIZES
if (grossVMsize && grossNCsize)
{
fprintf(fout, "\n");
fprintf(fout, "--------------------------------------\n");
fprintf(fout, "Function and GC info size stats\n");
fprintf(fout, "--------------------------------------\n");
fprintf(fout, "[%7u VM, %8u %6s %4u%%] %s\n", grossVMsize, grossNCsize, Target::g_tgtCPUName,
100 * grossNCsize / grossVMsize, "Total (excluding GC info)");
fprintf(fout, "[%7u VM, %8u %6s %4u%%] %s\n", grossVMsize, totalNCsize, Target::g_tgtCPUName,
100 * totalNCsize / grossVMsize, "Total (including GC info)");
if (gcHeaderISize || gcHeaderNSize)
{
fprintf(fout, "\n");
fprintf(fout, "GC tables : [%7uI,%7uN] %7u byt (%u%% of IL, %u%% of %s).\n",
gcHeaderISize + gcPtrMapISize, gcHeaderNSize + gcPtrMapNSize, totalNCsize - grossNCsize,
100 * (totalNCsize - grossNCsize) / grossVMsize, 100 * (totalNCsize - grossNCsize) / grossNCsize,
Target::g_tgtCPUName);
fprintf(fout, "GC headers : [%7uI,%7uN] %7u byt, [%4.1fI,%4.1fN] %4.1f byt/meth\n", gcHeaderISize,
gcHeaderNSize, gcHeaderISize + gcHeaderNSize, (float)gcHeaderISize / (genMethodICnt + 0.001),
(float)gcHeaderNSize / (genMethodNCnt + 0.001),
(float)(gcHeaderISize + gcHeaderNSize) / genMethodCnt);
fprintf(fout, "GC ptr maps : [%7uI,%7uN] %7u byt, [%4.1fI,%4.1fN] %4.1f byt/meth\n", gcPtrMapISize,
gcPtrMapNSize, gcPtrMapISize + gcPtrMapNSize, (float)gcPtrMapISize / (genMethodICnt + 0.001),
(float)gcPtrMapNSize / (genMethodNCnt + 0.001),
(float)(gcPtrMapISize + gcPtrMapNSize) / genMethodCnt);
}
else
{
fprintf(fout, "\n");
fprintf(fout, "GC tables take up %u bytes (%u%% of instr, %u%% of %6s code).\n",
totalNCsize - grossNCsize, 100 * (totalNCsize - grossNCsize) / grossVMsize,
100 * (totalNCsize - grossNCsize) / grossNCsize, Target::g_tgtCPUName);
}
#ifdef DEBUG
#if DOUBLE_ALIGN
fprintf(fout, "%u out of %u methods generated with double-aligned stack\n",
Compiler::s_lvaDoubleAlignedProcsCount, genMethodCnt);
#endif
#endif
}
#endif // DISPLAY_SIZES
#if CALL_ARG_STATS
compDispCallArgStats(fout);
#endif
#if COUNT_BASIC_BLOCKS
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "Basic block count frequency table:\n");
fprintf(fout, "--------------------------------------------------\n");
bbCntTable.dump(fout);
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "\n");
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "IL method size frequency table for methods with a single basic block:\n");
fprintf(fout, "--------------------------------------------------\n");
bbOneBBSizeTable.dump(fout);
fprintf(fout, "--------------------------------------------------\n");
#endif // COUNT_BASIC_BLOCKS
#if COUNT_LOOPS
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Loop stats\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Total number of methods with loops is %5u\n", totalLoopMethods);
fprintf(fout, "Total number of loops is %5u\n", totalLoopCount);
fprintf(fout, "Maximum number of loops per method is %5u\n", maxLoopsPerMethod);
fprintf(fout, "# of methods overflowing nat loop table is %5u\n", totalLoopOverflows);
fprintf(fout, "Total number of 'unnatural' loops is %5u\n", totalUnnatLoopCount);
fprintf(fout, "# of methods overflowing unnat loop limit is %5u\n", totalUnnatLoopOverflows);
fprintf(fout, "Total number of loops with an iterator is %5u\n", iterLoopCount);
fprintf(fout, "Total number of loops with a simple iterator is %5u\n", simpleTestLoopCount);
fprintf(fout, "Total number of loops with a constant iterator is %5u\n", constIterLoopCount);
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "Loop count frequency table:\n");
fprintf(fout, "--------------------------------------------------\n");
loopCountTable.dump(fout);
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "Loop exit count frequency table:\n");
fprintf(fout, "--------------------------------------------------\n");
loopExitCountTable.dump(fout);
fprintf(fout, "--------------------------------------------------\n");
#endif // COUNT_LOOPS
#if DATAFLOW_ITER
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Total number of iterations in the CSE dataflow loop is %5u\n", CSEiterCount);
fprintf(fout, "Total number of iterations in the CF dataflow loop is %5u\n", CFiterCount);
#endif // DATAFLOW_ITER
#if MEASURE_NODE_SIZE
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "GenTree node allocation stats\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Allocated %6u tree nodes (%7u bytes total, avg %4u bytes per method)\n",
genNodeSizeStats.genTreeNodeCnt, genNodeSizeStats.genTreeNodeSize,
genNodeSizeStats.genTreeNodeSize / genMethodCnt);
fprintf(fout, "Allocated %7u bytes of unused tree node space (%3.2f%%)\n",
genNodeSizeStats.genTreeNodeSize - genNodeSizeStats.genTreeNodeActualSize,
(float)(100 * (genNodeSizeStats.genTreeNodeSize - genNodeSizeStats.genTreeNodeActualSize)) /
genNodeSizeStats.genTreeNodeSize);
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Distribution of per-method GenTree node counts:\n");
genTreeNcntHist.dump(fout);
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Distribution of per-method GenTree node allocations (in bytes):\n");
genTreeNsizHist.dump(fout);
#endif // MEASURE_NODE_SIZE
#if MEASURE_BLOCK_SIZE
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "BasicBlock and flowList/BasicBlockList allocation stats\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Allocated %6u basic blocks (%7u bytes total, avg %4u bytes per method)\n", BasicBlock::s_Count,
BasicBlock::s_Size, BasicBlock::s_Size / genMethodCnt);
fprintf(fout, "Allocated %6u flow nodes (%7u bytes total, avg %4u bytes per method)\n", genFlowNodeCnt,
genFlowNodeSize, genFlowNodeSize / genMethodCnt);
#endif // MEASURE_BLOCK_SIZE
#if MEASURE_MEM_ALLOC
if (s_dspMemStats)
{
fprintf(fout, "\nAll allocations:\n");
s_aggMemStats.Print(jitstdout);
fprintf(fout, "\nLargest method:\n");
s_maxCompMemStats.Print(jitstdout);
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Distribution of total memory allocated per method (in KB):\n");
memAllocHist.dump(fout);
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Distribution of total memory used per method (in KB):\n");
memUsedHist.dump(fout);
}
#endif // MEASURE_MEM_ALLOC
#if LOOP_HOIST_STATS
#ifdef DEBUG // Always display loop stats in retail
if (JitConfig.DisplayLoopHoistStats() != 0)
#endif // DEBUG
{
PrintAggregateLoopHoistStats(jitstdout);
}
#endif // LOOP_HOIST_STATS
#if MEASURE_PTRTAB_SIZE
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "GC pointer table stats\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Reg pointer descriptor size (internal): %8u (avg %4u per method)\n", GCInfo::s_gcRegPtrDscSize,
GCInfo::s_gcRegPtrDscSize / genMethodCnt);
fprintf(fout, "Total pointer table size: %8u (avg %4u per method)\n", GCInfo::s_gcTotalPtrTabSize,
GCInfo::s_gcTotalPtrTabSize / genMethodCnt);
#endif // MEASURE_PTRTAB_SIZE
#if MEASURE_NODE_SIZE || MEASURE_BLOCK_SIZE || MEASURE_PTRTAB_SIZE || DISPLAY_SIZES
if (genMethodCnt != 0)
{
fprintf(fout, "\n");
fprintf(fout, "A total of %6u methods compiled", genMethodCnt);
#if DISPLAY_SIZES
if (genMethodICnt || genMethodNCnt)
{
fprintf(fout, " (%u interruptible, %u non-interruptible)", genMethodICnt, genMethodNCnt);
}
#endif // DISPLAY_SIZES
fprintf(fout, ".\n");
}
#endif // MEASURE_NODE_SIZE || MEASURE_BLOCK_SIZE || MEASURE_PTRTAB_SIZE || DISPLAY_SIZES
#if EMITTER_STATS
emitterStats(fout);
#endif
#if MEASURE_FATAL
fprintf(fout, "\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, "Fatal errors stats\n");
fprintf(fout, "---------------------------------------------------\n");
fprintf(fout, " badCode: %u\n", fatal_badCode);
fprintf(fout, " noWay: %u\n", fatal_noWay);
fprintf(fout, " NOMEM: %u\n", fatal_NOMEM);
fprintf(fout, " noWayAssertBody: %u\n", fatal_noWayAssertBody);
#ifdef DEBUG
fprintf(fout, " noWayAssertBodyArgs: %u\n", fatal_noWayAssertBodyArgs);
#endif // DEBUG
fprintf(fout, " NYI: %u\n", fatal_NYI);
#endif // MEASURE_FATAL
}
/*****************************************************************************
* Display static data structure sizes.
*/
/* static */
void Compiler::compDisplayStaticSizes(FILE* fout)
{
#if MEASURE_NODE_SIZE
GenTree::DumpNodeSizes(fout);
#endif
#if MEASURE_BLOCK_SIZE
BasicBlock* bbDummy = nullptr;
fprintf(fout, "\n");
fprintf(fout, "Offset / size of bbNext = %3u / %3u\n", offsetof(BasicBlock, bbNext),
sizeof(bbDummy->bbNext));
fprintf(fout, "Offset / size of bbNum = %3u / %3u\n", offsetof(BasicBlock, bbNum),
sizeof(bbDummy->bbNum));
fprintf(fout, "Offset / size of bbPostOrderNum = %3u / %3u\n", offsetof(BasicBlock, bbPostOrderNum),
sizeof(bbDummy->bbPostOrderNum));
fprintf(fout, "Offset / size of bbRefs = %3u / %3u\n", offsetof(BasicBlock, bbRefs),
sizeof(bbDummy->bbRefs));
fprintf(fout, "Offset / size of bbFlags = %3u / %3u\n", offsetof(BasicBlock, bbFlags),
sizeof(bbDummy->bbFlags));
fprintf(fout, "Offset / size of bbWeight = %3u / %3u\n", offsetof(BasicBlock, bbWeight),
sizeof(bbDummy->bbWeight));
fprintf(fout, "Offset / size of bbJumpKind = %3u / %3u\n", offsetof(BasicBlock, bbJumpKind),
sizeof(bbDummy->bbJumpKind));
fprintf(fout, "Offset / size of bbJumpOffs = %3u / %3u\n", offsetof(BasicBlock, bbJumpOffs),
sizeof(bbDummy->bbJumpOffs));
fprintf(fout, "Offset / size of bbJumpDest = %3u / %3u\n", offsetof(BasicBlock, bbJumpDest),
sizeof(bbDummy->bbJumpDest));
fprintf(fout, "Offset / size of bbJumpSwt = %3u / %3u\n", offsetof(BasicBlock, bbJumpSwt),
sizeof(bbDummy->bbJumpSwt));
fprintf(fout, "Offset / size of bbEntryState = %3u / %3u\n", offsetof(BasicBlock, bbEntryState),
sizeof(bbDummy->bbEntryState));
fprintf(fout, "Offset / size of bbStkTempsIn = %3u / %3u\n", offsetof(BasicBlock, bbStkTempsIn),
sizeof(bbDummy->bbStkTempsIn));
fprintf(fout, "Offset / size of bbStkTempsOut = %3u / %3u\n", offsetof(BasicBlock, bbStkTempsOut),
sizeof(bbDummy->bbStkTempsOut));
fprintf(fout, "Offset / size of bbTryIndex = %3u / %3u\n", offsetof(BasicBlock, bbTryIndex),
sizeof(bbDummy->bbTryIndex));
fprintf(fout, "Offset / size of bbHndIndex = %3u / %3u\n", offsetof(BasicBlock, bbHndIndex),
sizeof(bbDummy->bbHndIndex));
fprintf(fout, "Offset / size of bbCatchTyp = %3u / %3u\n", offsetof(BasicBlock, bbCatchTyp),
sizeof(bbDummy->bbCatchTyp));
fprintf(fout, "Offset / size of bbStkDepth = %3u / %3u\n", offsetof(BasicBlock, bbStkDepth),
sizeof(bbDummy->bbStkDepth));
fprintf(fout, "Offset / size of bbFPinVars = %3u / %3u\n", offsetof(BasicBlock, bbFPinVars),
sizeof(bbDummy->bbFPinVars));
fprintf(fout, "Offset / size of bbPreds = %3u / %3u\n", offsetof(BasicBlock, bbPreds),
sizeof(bbDummy->bbPreds));
fprintf(fout, "Offset / size of bbReach = %3u / %3u\n", offsetof(BasicBlock, bbReach),
sizeof(bbDummy->bbReach));
fprintf(fout, "Offset / size of bbIDom = %3u / %3u\n", offsetof(BasicBlock, bbIDom),
sizeof(bbDummy->bbIDom));
fprintf(fout, "Offset / size of bbDfsNum = %3u / %3u\n", offsetof(BasicBlock, bbDfsNum),
sizeof(bbDummy->bbDfsNum));
fprintf(fout, "Offset / size of bbCodeOffs = %3u / %3u\n", offsetof(BasicBlock, bbCodeOffs),
sizeof(bbDummy->bbCodeOffs));
fprintf(fout, "Offset / size of bbCodeOffsEnd = %3u / %3u\n", offsetof(BasicBlock, bbCodeOffsEnd),
sizeof(bbDummy->bbCodeOffsEnd));
fprintf(fout, "Offset / size of bbVarUse = %3u / %3u\n", offsetof(BasicBlock, bbVarUse),
sizeof(bbDummy->bbVarUse));
fprintf(fout, "Offset / size of bbVarDef = %3u / %3u\n", offsetof(BasicBlock, bbVarDef),
sizeof(bbDummy->bbVarDef));
fprintf(fout, "Offset / size of bbLiveIn = %3u / %3u\n", offsetof(BasicBlock, bbLiveIn),
sizeof(bbDummy->bbLiveIn));
fprintf(fout, "Offset / size of bbLiveOut = %3u / %3u\n", offsetof(BasicBlock, bbLiveOut),
sizeof(bbDummy->bbLiveOut));
fprintf(fout, "Offset / size of bbMemorySsaPhiFunc = %3u / %3u\n", offsetof(BasicBlock, bbMemorySsaPhiFunc),
sizeof(bbDummy->bbMemorySsaPhiFunc));
fprintf(fout, "Offset / size of bbMemorySsaNumIn = %3u / %3u\n", offsetof(BasicBlock, bbMemorySsaNumIn),
sizeof(bbDummy->bbMemorySsaNumIn));
fprintf(fout, "Offset / size of bbMemorySsaNumOut = %3u / %3u\n", offsetof(BasicBlock, bbMemorySsaNumOut),
sizeof(bbDummy->bbMemorySsaNumOut));
fprintf(fout, "Offset / size of bbScope = %3u / %3u\n", offsetof(BasicBlock, bbScope),
sizeof(bbDummy->bbScope));
fprintf(fout, "Offset / size of bbCseGen = %3u / %3u\n", offsetof(BasicBlock, bbCseGen),
sizeof(bbDummy->bbCseGen));
fprintf(fout, "Offset / size of bbCseIn = %3u / %3u\n", offsetof(BasicBlock, bbCseIn),
sizeof(bbDummy->bbCseIn));
fprintf(fout, "Offset / size of bbCseOut = %3u / %3u\n", offsetof(BasicBlock, bbCseOut),
sizeof(bbDummy->bbCseOut));
fprintf(fout, "Offset / size of bbEmitCookie = %3u / %3u\n", offsetof(BasicBlock, bbEmitCookie),
sizeof(bbDummy->bbEmitCookie));
#if FEATURE_EH_FUNCLETS && defined(_TARGET_ARM_)
fprintf(fout, "Offset / size of bbUnwindNopEmitCookie = %3u / %3u\n", offsetof(BasicBlock, bbUnwindNopEmitCookie),
sizeof(bbDummy->bbUnwindNopEmitCookie));
#endif // FEATURE_EH_FUNCLETS && defined(_TARGET_ARM_)
#ifdef VERIFIER
fprintf(fout, "Offset / size of bbStackIn = %3u / %3u\n", offsetof(BasicBlock, bbStackIn),
sizeof(bbDummy->bbStackIn));
fprintf(fout, "Offset / size of bbStackOut = %3u / %3u\n", offsetof(BasicBlock, bbStackOut),
sizeof(bbDummy->bbStackOut));
fprintf(fout, "Offset / size of bbTypesIn = %3u / %3u\n", offsetof(BasicBlock, bbTypesIn),
sizeof(bbDummy->bbTypesIn));
fprintf(fout, "Offset / size of bbTypesOut = %3u / %3u\n", offsetof(BasicBlock, bbTypesOut),
sizeof(bbDummy->bbTypesOut));
#endif // VERIFIER
#if FEATURE_STACK_FP_X87
fprintf(fout, "Offset / size of bbFPStateX87 = %3u / %3u\n", offsetof(BasicBlock, bbFPStateX87),
sizeof(bbDummy->bbFPStateX87));
#endif // FEATURE_STACK_FP_X87
#ifdef DEBUG
fprintf(fout, "Offset / size of bbLoopNum = %3u / %3u\n", offsetof(BasicBlock, bbLoopNum),
sizeof(bbDummy->bbLoopNum));
#endif // DEBUG
fprintf(fout, "\n");
fprintf(fout, "Size of BasicBlock = %3u\n", sizeof(BasicBlock));
#endif // MEASURE_BLOCK_SIZE
#if EMITTER_STATS
emitterStaticStats(fout);
#endif
}
/*****************************************************************************
*
* Constructor
*/
void Compiler::compInit(ArenaAllocator* pAlloc, InlineInfo* inlineInfo)
{
assert(pAlloc);
compAllocator = pAlloc;
// Inlinee Compile object will only be allocated when needed for the 1st time.
InlineeCompiler = nullptr;
// Set the inline info.
impInlineInfo = inlineInfo;
eeInfoInitialized = false;
compDoAggressiveInlining = false;
if (compIsForInlining())
{
m_inlineStrategy = nullptr;
compInlineResult = inlineInfo->inlineResult;
compAsIAllocator = nullptr; // We shouldn't be using the compAsIAllocator for other than the root compiler.
#if MEASURE_MEM_ALLOC
compAsIAllocatorBitset = nullptr;
compAsIAllocatorGC = nullptr;
compAsIAllocatorLoopHoist = nullptr;
#ifdef DEBUG
compAsIAllocatorDebugOnly = nullptr;
#endif // DEBUG
#endif // MEASURE_MEM_ALLOC
compQMarks = nullptr;
}
else
{
m_inlineStrategy = new (this, CMK_Inlining) InlineStrategy(this);
compInlineResult = nullptr;
compAsIAllocator = new (this, CMK_Unknown) CompAllocator(this, CMK_AsIAllocator);
#if MEASURE_MEM_ALLOC
compAsIAllocatorBitset = new (this, CMK_Unknown) CompAllocator(this, CMK_bitset);
compAsIAllocatorGC = new (this, CMK_Unknown) CompAllocator(this, CMK_GC);
compAsIAllocatorLoopHoist = new (this, CMK_Unknown) CompAllocator(this, CMK_LoopHoist);
#ifdef DEBUG
compAsIAllocatorDebugOnly = new (this, CMK_Unknown) CompAllocator(this, CMK_DebugOnly);
#endif // DEBUG
#endif // MEASURE_MEM_ALLOC
compQMarks = new (this, CMK_Unknown) ExpandArrayStack<GenTreePtr>(getAllocator());
}
#ifdef FEATURE_TRACELOGGING
// Make sure JIT telemetry is initialized as soon as allocations can be made
// but no later than a point where noway_asserts can be thrown.
// 1. JIT telemetry could allocate some objects internally.
// 2. NowayAsserts are tracked through telemetry.
// Note: JIT telemetry could gather data when compiler is not fully initialized.
// So you have to initialize the compiler variables you use for telemetry.
assert((unsigned)PHASE_PRE_IMPORT == 0);
previousCompletedPhase = PHASE_PRE_IMPORT;
info.compILCodeSize = 0;
info.compMethodHnd = nullptr;
compJitTelemetry.Initialize(this);
#endif
#ifdef DEBUG
bRangeAllowStress = false;
#endif
fgInit();
lvaInit();
if (!compIsForInlining())
{
codeGen = getCodeGenerator(this);
#ifdef LEGACY_BACKEND
raInit();
#endif // LEGACY_BACKEND
optInit();
#ifndef LEGACY_BACKEND
hashBv::Init(this);
#endif // !LEGACY_BACKEND
compVarScopeMap = nullptr;
// If this method were a real constructor for Compiler, these would
// become method initializations.
impPendingBlockMembers = ExpandArray<BYTE>(getAllocator());
impSpillCliquePredMembers = ExpandArray<BYTE>(getAllocator());
impSpillCliqueSuccMembers = ExpandArray<BYTE>(getAllocator());
memset(&lvMemoryPerSsaData, 0, sizeof(PerSsaArray));
lvMemoryPerSsaData.Init(getAllocator());
lvMemoryNumSsaNames = 0;
//
// Initialize all the per-method statistics gathering data structures.
//
optLoopsCloned = 0;
#if MEASURE_MEM_ALLOC
genMemStats.Init();
#endif // MEASURE_MEM_ALLOC
#if LOOP_HOIST_STATS
m_loopsConsidered = 0;
m_curLoopHasHoistedExpression = false;
m_loopsWithHoistedExpressions = 0;
m_totalHoistedExpressions = 0;
#endif // LOOP_HOIST_STATS
#if MEASURE_NODE_SIZE
genNodeSizeStatsPerFunc.Init();
#endif // MEASURE_NODE_SIZE
}
else
{
codeGen = nullptr;
}
compJmpOpUsed = false;
compLongUsed = false;
compTailCallUsed = false;
compLocallocUsed = false;
compQmarkRationalized = false;
compQmarkUsed = false;
compFloatingPointUsed = false;
compUnsafeCastUsed = false;
#if CPU_USES_BLOCK_MOVE
compBlkOpUsed = false;
#endif
#if FEATURE_STACK_FP_X87
compMayHaveTransitionBlocks = false;
#endif
compNeedsGSSecurityCookie = false;
compGSReorderStackLayout = false;
#if STACK_PROBES
compStackProbePrologDone = false;
#endif
compGeneratingProlog = false;
compGeneratingEpilog = false;
#ifndef LEGACY_BACKEND
compLSRADone = false;
#endif // !LEGACY_BACKEND
compRationalIRForm = false;
#ifdef DEBUG
compCodeGenDone = false;
compRegSetCheckLevel = 0;
opts.compMinOptsIsUsed = false;
#endif
opts.compMinOptsIsSet = false;
// Used by fgFindJumpTargets for inlining heuristics.
opts.instrCount = 0;
// Used to track when we should consider running EarlyProp
optMethodFlags = 0;
for (unsigned i = 0; i < MAX_LOOP_NUM; i++)
{
AllVarSetOps::AssignNoCopy(this, optLoopTable[i].lpAsgVars, AllVarSetOps::UninitVal());
}
#ifdef DEBUG
m_nodeTestData = nullptr;
m_loopHoistCSEClass = FIRST_LOOP_HOIST_CSE_CLASS;
#endif
m_switchDescMap = nullptr;
m_blockToEHPreds = nullptr;
m_fieldSeqStore = nullptr;
m_zeroOffsetFieldMap = nullptr;
m_arrayInfoMap = nullptr;
m_refAnyClass = nullptr;
for (MemoryKind memoryKind : allMemoryKinds())
{
m_memorySsaMap[memoryKind] = nullptr;
}
#ifdef DEBUG
if (!compIsForInlining())
{
compDoComponentUnitTestsOnce();
}
#endif // DEBUG
vnStore = nullptr;
m_opAsgnVarDefSsaNums = nullptr;
m_indirAssignMap = nullptr;
fgSsaPassesCompleted = 0;
fgVNPassesCompleted = 0;
// check that HelperCallProperties are initialized
assert(s_helperCallProperties.IsPure(CORINFO_HELP_GETSHARED_GCSTATIC_BASE));
assert(!s_helperCallProperties.IsPure(CORINFO_HELP_GETFIELDOBJ)); // quick sanity check
// We start with the flow graph in tree-order
fgOrder = FGOrderTree;
#ifdef FEATURE_SIMD
// SIMD Types
SIMDFloatHandle = nullptr;
SIMDDoubleHandle = nullptr;
SIMDIntHandle = nullptr;
SIMDUShortHandle = nullptr;
SIMDUByteHandle = nullptr;
SIMDShortHandle = nullptr;
SIMDByteHandle = nullptr;
SIMDLongHandle = nullptr;
SIMDUIntHandle = nullptr;
SIMDULongHandle = nullptr;
SIMDVector2Handle = nullptr;
SIMDVector3Handle = nullptr;
SIMDVector4Handle = nullptr;
SIMDVectorHandle = nullptr;
#endif
compUsesThrowHelper = false;
}
/*****************************************************************************
*
* Destructor
*/
void Compiler::compDone()
{
}
void* Compiler::compGetHelperFtn(CorInfoHelpFunc ftnNum, /* IN */
void** ppIndirection) /* OUT */
{
void* addr;
if (info.compMatchedVM)
{
addr = info.compCompHnd->getHelperFtn(ftnNum, ppIndirection);
}
else
{
// If we don't have a matched VM, we won't get valid results when asking for a helper function.
addr = (void*)0xCA11CA11; // "callcall"
}
return addr;
}
unsigned Compiler::compGetTypeSize(CorInfoType cit, CORINFO_CLASS_HANDLE clsHnd)
{
var_types sigType = genActualType(JITtype2varType(cit));
unsigned sigSize;
sigSize = genTypeSize(sigType);
if (cit == CORINFO_TYPE_VALUECLASS)
{
sigSize = info.compCompHnd->getClassSize(clsHnd);
}
else if (cit == CORINFO_TYPE_REFANY)
{
sigSize = 2 * sizeof(void*);
}
return sigSize;
}
#ifdef DEBUG
static bool DidComponentUnitTests = false;
void Compiler::compDoComponentUnitTestsOnce()
{
if (!JitConfig.RunComponentUnitTests())
{
return;
}
if (!DidComponentUnitTests)
{
DidComponentUnitTests = true;
ValueNumStore::RunTests(this);
BitSetSupport::TestSuite(getAllocatorDebugOnly());
}
}
#endif // DEBUG
/******************************************************************************
*
* The Emitter uses this callback function to allocate its memory
*/
/* static */
void* Compiler::compGetMemCallback(void* p, size_t size, CompMemKind cmk)
{
assert(p);
return ((Compiler*)p)->compGetMem(size, cmk);
}
/*****************************************************************************
*
* The central memory allocation routine used by the compiler. Normally this
* is a simple inline method defined in compiler.hpp, but for debugging it's
* often convenient to keep it non-inline.
*/
#ifdef DEBUG
void* Compiler::compGetMem(size_t sz, CompMemKind cmk)
{
#if 0
#if SMALL_TREE_NODES
if (sz != TREE_NODE_SZ_SMALL &&
sz != TREE_NODE_SZ_LARGE && sz > 32)
{
printf("Alloc %3u bytes\n", sz);
}
#else
if (sz != sizeof(GenTree) && sz > 32)
{
printf("Alloc %3u bytes\n", sz);
}
#endif
#endif // 0
#if MEASURE_MEM_ALLOC
genMemStats.AddAlloc(sz, cmk);
#endif
void* ptr = compAllocator->allocateMemory(sz);
// Verify that the current block is aligned. Only then will the next
// block allocated be on an aligned boundary.
assert((size_t(ptr) & (sizeof(size_t) - 1)) == 0);
return ptr;
}
#endif
/*****************************************************************************/
#ifdef DEBUG
/*****************************************************************************/
VarName Compiler::compVarName(regNumber reg, bool isFloatReg)
{
if (isFloatReg)
{
#if FEATURE_STACK_FP_X87
assert(reg < FP_STK_SIZE); // would like to have same assert as below but sometimes you get -1?
#else
assert(genIsValidFloatReg(reg));
#endif
}
else
{
assert(genIsValidReg(reg));
}
if ((info.compVarScopesCount > 0) && compCurBB && opts.varNames)
{
unsigned lclNum;
LclVarDsc* varDsc;
/* Look for the matching register */
for (lclNum = 0, varDsc = lvaTable; lclNum < lvaCount; lclNum++, varDsc++)
{
/* If the variable is not in a register, or not in the register we're looking for, quit. */
/* Also, if it is a compiler generated variable (i.e. slot# > info.compVarScopesCount), don't bother. */
if ((varDsc->lvRegister != 0) && (varDsc->lvRegNum == reg) && (varDsc->IsFloatRegType() || !isFloatReg) &&
(varDsc->lvSlotNum < info.compVarScopesCount))
{
/* check if variable in that register is live */
if (VarSetOps::IsMember(this, compCurLife, varDsc->lvVarIndex))
{
/* variable is live - find the corresponding slot */
VarScopeDsc* varScope =
compFindLocalVar(varDsc->lvSlotNum, compCurBB->bbCodeOffs, compCurBB->bbCodeOffsEnd);
if (varScope)
{
return varScope->vsdName;
}
}
}
}
#ifdef LEGACY_BACKEND
// maybe var is marked dead, but still used (last use)
if (!isFloatReg && codeGen->regSet.rsUsedTree[reg] != NULL)
{
GenTreePtr nodePtr;
if (GenTree::OperIsUnary(codeGen->regSet.rsUsedTree[reg]->OperGet()))
{
assert(codeGen->regSet.rsUsedTree[reg]->gtOp.gtOp1 != NULL);
nodePtr = codeGen->regSet.rsUsedTree[reg]->gtOp.gtOp1;
}
else
{
nodePtr = codeGen->regSet.rsUsedTree[reg];
}
if ((nodePtr->gtOper == GT_REG_VAR) && (nodePtr->gtRegVar.gtRegNum == reg) &&
(nodePtr->gtRegVar.gtLclNum < info.compVarScopesCount))
{
VarScopeDsc* varScope =
compFindLocalVar(nodePtr->gtRegVar.gtLclNum, compCurBB->bbCodeOffs, compCurBB->bbCodeOffsEnd);
if (varScope)
return varScope->vsdName;
}
}
#endif // LEGACY_BACKEND
}
return nullptr;
}
const char* Compiler::compRegVarName(regNumber reg, bool displayVar, bool isFloatReg)
{
#ifdef _TARGET_ARM_
isFloatReg = genIsValidFloatReg(reg);
#endif
if (displayVar && (reg != REG_NA))
{
VarName varName = compVarName(reg, isFloatReg);
if (varName)
{
const int NAME_VAR_REG_BUFFER_LEN = 4 + 256 + 1;
static char nameVarReg[2][NAME_VAR_REG_BUFFER_LEN]; // to avoid overwriting the buffer when have 2
// consecutive calls before printing
static int index = 0; // for circular index into the name array
index = (index + 1) % 2; // circular reuse of index
sprintf_s(nameVarReg[index], NAME_VAR_REG_BUFFER_LEN, "%s'%s'", getRegName(reg, isFloatReg),
VarNameToStr(varName));
return nameVarReg[index];
}
}
/* no debug info required or no variable in that register
-> return standard name */
return getRegName(reg, isFloatReg);
}
#define MAX_REG_PAIR_NAME_LENGTH 10
const char* Compiler::compRegPairName(regPairNo regPair)
{
static char regNameLong[MAX_REG_PAIR_NAME_LENGTH];
if (regPair == REG_PAIR_NONE)
{
return "NA|NA";
}
assert(regPair >= REG_PAIR_FIRST && regPair <= REG_PAIR_LAST);
strcpy_s(regNameLong, sizeof(regNameLong), compRegVarName(genRegPairLo(regPair)));
strcat_s(regNameLong, sizeof(regNameLong), "|");
strcat_s(regNameLong, sizeof(regNameLong), compRegVarName(genRegPairHi(regPair)));
return regNameLong;
}
const char* Compiler::compRegNameForSize(regNumber reg, size_t size)
{
if (size == 0 || size >= 4)
{
return compRegVarName(reg, true);
}
// clang-format off
static
const char * sizeNames[][2] =
{
{ "al", "ax" },
{ "cl", "cx" },
{ "dl", "dx" },
{ "bl", "bx" },
#ifdef _TARGET_AMD64_
{ "spl", "sp" }, // ESP
{ "bpl", "bp" }, // EBP
{ "sil", "si" }, // ESI
{ "dil", "di" }, // EDI
{ "r8b", "r8w" },
{ "r9b", "r9w" },
{ "r10b", "r10w" },
{ "r11b", "r11w" },
{ "r12b", "r12w" },
{ "r13b", "r13w" },
{ "r14b", "r14w" },
{ "r15b", "r15w" },
#endif // _TARGET_AMD64_
};
// clang-format on
assert(isByteReg(reg));
assert(genRegMask(reg) & RBM_BYTE_REGS);
assert(size == 1 || size == 2);
return sizeNames[reg][size - 1];
}
const char* Compiler::compFPregVarName(unsigned fpReg, bool displayVar)
{
const int NAME_VAR_REG_BUFFER_LEN = 4 + 256 + 1;
static char nameVarReg[2][NAME_VAR_REG_BUFFER_LEN]; // to avoid overwriting the buffer when have 2 consecutive calls
// before printing
static int index = 0; // for circular index into the name array
index = (index + 1) % 2; // circular reuse of index
#if FEATURE_STACK_FP_X87
/* 'fpReg' is the distance from the bottom of the stack, ie.
* it is independant of the current FP stack level
*/
if (displayVar && codeGen->genFPregCnt)
{
assert(fpReg < FP_STK_SIZE);
assert(compCodeGenDone || (fpReg <= codeGen->compCurFPState.m_uStackSize));
int pos = codeGen->genFPregCnt - (fpReg + 1 - codeGen->genGetFPstkLevel());
if (pos >= 0)
{
VarName varName = compVarName((regNumber)pos, true);
if (varName)
{
sprintf_s(nameVarReg[index], NAME_VAR_REG_BUFFER_LEN, "ST(%d)'%s'", fpReg, VarNameToStr(varName));
return nameVarReg[index];
}
}
}
#endif // FEATURE_STACK_FP_X87
/* no debug info required or no variable in that register
-> return standard name */
sprintf_s(nameVarReg[index], NAME_VAR_REG_BUFFER_LEN, "ST(%d)", fpReg);
return nameVarReg[index];
}
const char* Compiler::compLocalVarName(unsigned varNum, unsigned offs)
{
unsigned i;
VarScopeDsc* t;
for (i = 0, t = info.compVarScopes; i < info.compVarScopesCount; i++, t++)
{
if (t->vsdVarNum != varNum)
{
continue;
}
if (offs >= t->vsdLifeBeg && offs < t->vsdLifeEnd)
{
return VarNameToStr(t->vsdName);
}
}
return nullptr;
}
/*****************************************************************************/
#endif // DEBUG
/*****************************************************************************/
void Compiler::compSetProcessor()
{
const JitFlags& jitFlags = *opts.jitFlags;
#if defined(_TARGET_ARM_)
info.genCPU = CPU_ARM;
#elif defined(_TARGET_AMD64_)
info.genCPU = CPU_X64;
#elif defined(_TARGET_X86_)
if (jitFlags.IsSet(JitFlags::JIT_FLAG_TARGET_P4))
info.genCPU = CPU_X86_PENTIUM_4;
else
info.genCPU = CPU_X86;
#endif
//
// Processor specific optimizations
//
CLANG_FORMAT_COMMENT_ANCHOR;
#ifdef _TARGET_XARCH_
opts.compCanUseSSE3_4 = false;
if (!jitFlags.IsSet(JitFlags::JIT_FLAG_PREJIT) && jitFlags.IsSet(JitFlags::JIT_FLAG_USE_SSE3_4))
{
if (JitConfig.EnableSSE3_4() != 0)
{
opts.compCanUseSSE3_4 = true;
}
}
#ifdef FEATURE_AVX_SUPPORT
// COMPlus_EnableAVX can be used to disable using AVX if available on a target machine.
opts.compCanUseAVX = false;
if (!jitFlags.IsSet(JitFlags::JIT_FLAG_PREJIT) && jitFlags.IsSet(JitFlags::JIT_FLAG_USE_AVX2))
{
if (JitConfig.EnableAVX() != 0)
{
opts.compCanUseAVX = true;
}
}
#endif // FEATURE_AVX_SUPPORT
if (!compIsForInlining())
{
#ifdef FEATURE_AVX_SUPPORT
if (opts.compCanUseAVX)
{
codeGen->getEmitter()->SetUseAVX(true);
// Assume each JITted method does not contain AVX instruction at first
codeGen->getEmitter()->SetContainsAVX(false);
codeGen->getEmitter()->SetContains256bitAVX(false);
}
else
#endif // FEATURE_AVX_SUPPORT
if (opts.compCanUseSSE3_4)
{
codeGen->getEmitter()->SetUseSSE3_4(true);
}
}
#endif // _TARGET_XARCH_
#ifdef _TARGET_AMD64_
opts.compUseFCOMI = false;
opts.compUseCMOV = true;
opts.compCanUseSSE2 = true;
#elif defined(_TARGET_X86_)
opts.compUseFCOMI = jitFlags.IsSet(JitFlags::JIT_FLAG_USE_FCOMI);
opts.compUseCMOV = jitFlags.IsSet(JitFlags::JIT_FLAG_USE_CMOV);
opts.compCanUseSSE2 = jitFlags.IsSet(JitFlags::JIT_FLAG_USE_SSE2);
#if !defined(LEGACY_BACKEND) && !defined(FEATURE_CORECLR)
// RyuJIT/x86 requires SSE2 to be available: there is no support for generating floating-point
// code with x87 instructions. On .NET Core, the VM always tells us that SSE2 is available.
// However, on desktop, under ngen, (and presumably in the unlikely case you're actually
// running on a machine without SSE2), the VM does not set the SSE2 flag. We ignore this and
// go ahead and generate SSE2 code anyway.
if (!opts.compCanUseSSE2)
{
JITDUMP("VM didn't set CORJIT_FLG_USE_SSE2! Ignoring, and generating SSE2 code anyway.\n");
opts.compCanUseSSE2 = true;
}
#endif // !defined(LEGACY_BACKEND) && !defined(FEATURE_CORECLR)
#ifdef DEBUG
if (opts.compUseFCOMI)
opts.compUseFCOMI = !compStressCompile(STRESS_USE_FCOMI, 50);
if (opts.compUseCMOV)
opts.compUseCMOV = !compStressCompile(STRESS_USE_CMOV, 50);
#ifdef LEGACY_BACKEND
// Should we override the SSE2 setting?
enum
{
SSE2_FORCE_DISABLE = 0,
SSE2_FORCE_USE = 1,
SSE2_FORCE_INVALID = -1
};
if (JitConfig.JitCanUseSSE2() == SSE2_FORCE_DISABLE)
opts.compCanUseSSE2 = false;
else if (JitConfig.JitCanUseSSE2() == SSE2_FORCE_USE)
opts.compCanUseSSE2 = true;
else if (opts.compCanUseSSE2)
opts.compCanUseSSE2 = !compStressCompile(STRESS_GENERIC_VARN, 50);
#else // !LEGACY_BACKEND
// RyuJIT/x86 requires SSE2 to be available and hence
// don't turn off compCanUseSSE2 under stress.
assert(opts.compCanUseSSE2);
#endif // !LEGACY_BACKEND
#endif // DEBUG
#endif // _TARGET_X86_
}
#ifdef PROFILING_SUPPORTED
// A Dummy routine to receive Enter/Leave/Tailcall profiler callbacks.
// These are used when complus_JitEltHookEnabled=1
#ifdef _TARGET_AMD64_
void DummyProfilerELTStub(UINT_PTR ProfilerHandle, UINT_PTR callerSP)
{
return;
}
#else //! _TARGET_AMD64_
void DummyProfilerELTStub(UINT_PTR ProfilerHandle)
{
return;
}
#endif //!_TARGET_AMD64_
#endif // PROFILING_SUPPORTED
bool Compiler::compIsFullTrust()
{
return (info.compCompHnd->canSkipMethodVerification(info.compMethodHnd) == CORINFO_VERIFICATION_CAN_SKIP);
}
bool Compiler::compShouldThrowOnNoway(
#ifdef FEATURE_TRACELOGGING
const char* filename, unsigned line
#endif
)
{
#ifdef FEATURE_TRACELOGGING
compJitTelemetry.NotifyNowayAssert(filename, line);
#endif
// In min opts, we don't want the noway assert to go through the exception
// path. Instead we want it to just silently go through codegen for
// compat reasons.
// If we are not in full trust, we should always fire for security.
return !opts.MinOpts() || !compIsFullTrust();
}
// ConfigInteger does not offer an option for decimal flags. Any numbers are interpreted as hex.
// I could add the decimal option to ConfigInteger or I could write a function to reinterpret this
// value as the user intended.
unsigned ReinterpretHexAsDecimal(unsigned in)
{
// ex: in: 0x100 returns: 100
unsigned result = 0;
unsigned index = 1;
// default value
if (in == INT_MAX)
{
return in;
}
while (in)
{
unsigned digit = in % 16;
in >>= 4;
assert(digit < 10);
result += digit * index;
index *= 10;
}
return result;
}
void Compiler::compInitOptions(JitFlags* jitFlags)
{
#ifdef UNIX_AMD64_ABI
opts.compNeedToAlignFrame = false;
#endif // UNIX_AMD64_ABI
memset(&opts, 0, sizeof(opts));
if (compIsForInlining())
{
// The following flags are lost when inlining. (They are removed in
// Compiler::fgInvokeInlineeCompiler().)
assert(!jitFlags->IsSet(JitFlags::JIT_FLAG_BBOPT));
assert(!jitFlags->IsSet(JitFlags::JIT_FLAG_BBINSTR));
assert(!jitFlags->IsSet(JitFlags::JIT_FLAG_PROF_ENTERLEAVE));
assert(!jitFlags->IsSet(JitFlags::JIT_FLAG_DEBUG_EnC));
assert(!jitFlags->IsSet(JitFlags::JIT_FLAG_DEBUG_INFO));
assert(jitFlags->IsSet(JitFlags::JIT_FLAG_SKIP_VERIFICATION));
}
opts.jitFlags = jitFlags;
opts.compFlags = CLFLG_MAXOPT; // Default value is for full optimization
if (jitFlags->IsSet(JitFlags::JIT_FLAG_DEBUG_CODE) || jitFlags->IsSet(JitFlags::JIT_FLAG_MIN_OPT) ||
jitFlags->IsSet(JitFlags::JIT_FLAG_TIER0))
{
opts.compFlags = CLFLG_MINOPT;
}
// Don't optimize .cctors (except prejit) or if we're an inlinee
else if (!jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT) && ((info.compFlags & FLG_CCTOR) == FLG_CCTOR) &&
!compIsForInlining())
{
opts.compFlags = CLFLG_MINOPT;
}
// Default value is to generate a blend of size and speed optimizations
//
opts.compCodeOpt = BLENDED_CODE;
// If the EE sets SIZE_OPT or if we are compiling a Class constructor
// we will optimize for code size at the expense of speed
//
if (jitFlags->IsSet(JitFlags::JIT_FLAG_SIZE_OPT) || ((info.compFlags & FLG_CCTOR) == FLG_CCTOR))
{
opts.compCodeOpt = SMALL_CODE;
}
//
// If the EE sets SPEED_OPT we will optimize for speed at the expense of code size
//
else if (jitFlags->IsSet(JitFlags::JIT_FLAG_SPEED_OPT) ||
(jitFlags->IsSet(JitFlags::JIT_FLAG_TIER1) && !jitFlags->IsSet(JitFlags::JIT_FLAG_MIN_OPT)))
{
opts.compCodeOpt = FAST_CODE;
assert(!jitFlags->IsSet(JitFlags::JIT_FLAG_SIZE_OPT));
}
//-------------------------------------------------------------------------
opts.compDbgCode = jitFlags->IsSet(JitFlags::JIT_FLAG_DEBUG_CODE);
opts.compDbgInfo = jitFlags->IsSet(JitFlags::JIT_FLAG_DEBUG_INFO);
opts.compDbgEnC = jitFlags->IsSet(JitFlags::JIT_FLAG_DEBUG_EnC);
#if REGEN_SHORTCUTS || REGEN_CALLPAT
// We never want to have debugging enabled when regenerating GC encoding patterns
opts.compDbgCode = false;
opts.compDbgInfo = false;
opts.compDbgEnC = false;
#endif
compSetProcessor();
#ifdef DEBUG
opts.dspOrder = false;
if (compIsForInlining())
{
verbose = impInlineInfo->InlinerCompiler->verbose;
}
else
{
verbose = false;
codeGen->setVerbose(false);
}
verboseTrees = verbose && shouldUseVerboseTrees();
verboseSsa = verbose && shouldUseVerboseSsa();
asciiTrees = shouldDumpASCIITrees();
opts.dspDiffable = compIsForInlining() ? impInlineInfo->InlinerCompiler->opts.dspDiffable : false;
#endif
opts.compNeedSecurityCheck = false;
opts.altJit = false;
#if defined(LATE_DISASM) && !defined(DEBUG)
// For non-debug builds with the late disassembler built in, we currently always do late disassembly
// (we have no way to determine when not to, since we don't have class/method names).
// In the DEBUG case, this is initialized to false, below.
opts.doLateDisasm = true;
#endif
#ifdef DEBUG
const JitConfigValues::MethodSet* pfAltJit;
if (jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
{
pfAltJit = &JitConfig.AltJitNgen();
}
else
{
pfAltJit = &JitConfig.AltJit();
}
#ifdef ALT_JIT
if (pfAltJit->contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.altJit = true;
}
unsigned altJitLimit = ReinterpretHexAsDecimal(JitConfig.AltJitLimit());
if (altJitLimit > 0 && Compiler::jitTotalMethodCompiled >= altJitLimit)
{
opts.altJit = false;
}
#endif // ALT_JIT
#else // !DEBUG
const char* altJitVal;
if (jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
{
altJitVal = JitConfig.AltJitNgen().list();
}
else
{
altJitVal = JitConfig.AltJit().list();
}
#ifdef ALT_JIT
// In release mode, you either get all methods or no methods. You must use "*" as the parameter, or we ignore it.
// You don't get to give a regular expression of methods to match.
// (Partially, this is because we haven't computed and stored the method and class name except in debug, and it
// might be expensive to do so.)
if ((altJitVal != nullptr) && (strcmp(altJitVal, "*") == 0))
{
opts.altJit = true;
}
#endif // ALT_JIT
#endif // !DEBUG
#ifdef ALT_JIT
// Take care of COMPlus_AltJitExcludeAssemblies.
if (opts.altJit)
{
// First, initialize the AltJitExcludeAssemblies list, but only do it once.
if (!s_pAltJitExcludeAssembliesListInitialized)
{
const wchar_t* wszAltJitExcludeAssemblyList = JitConfig.AltJitExcludeAssemblies();
if (wszAltJitExcludeAssemblyList != nullptr)
{
// NOTE: The Assembly name list is allocated in the process heap, not in the no-release heap, which is
// reclaimed
// for every compilation. This is ok because we only allocate once, due to the static.
s_pAltJitExcludeAssembliesList = new (HostAllocator::getHostAllocator())
AssemblyNamesList2(wszAltJitExcludeAssemblyList, HostAllocator::getHostAllocator());
}
s_pAltJitExcludeAssembliesListInitialized = true;
}
if (s_pAltJitExcludeAssembliesList != nullptr)
{
// We have an exclusion list. See if this method is in an assembly that is on the list.
// Note that we check this for every method, since we might inline across modules, and
// if the inlinee module is on the list, we don't want to use the altjit for it.
const char* methodAssemblyName = info.compCompHnd->getAssemblyName(
info.compCompHnd->getModuleAssembly(info.compCompHnd->getClassModule(info.compClassHnd)));
if (s_pAltJitExcludeAssembliesList->IsInList(methodAssemblyName))
{
opts.altJit = false;
}
}
}
#endif // ALT_JIT
#ifdef DEBUG
bool altJitConfig = !pfAltJit->isEmpty();
// If we have a non-empty AltJit config then we change all of these other
// config values to refer only to the AltJit. Otherwise, a lot of COMPlus_* variables
// would apply to both the altjit and the normal JIT, but we only care about
// debugging the altjit if the COMPlus_AltJit configuration is set.
//
if (compIsForImportOnly() && (!altJitConfig || opts.altJit))
{
if (JitConfig.JitImportBreak().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
assert(!"JitImportBreak reached");
}
}
bool verboseDump = false;
bool dumpIR = false;
bool dumpIRTypes = false;
bool dumpIRLocals = false;
bool dumpIRRegs = false;
bool dumpIRSsa = false;
bool dumpIRValnums = false;
bool dumpIRCosts = false;
bool dumpIRFlags = false;
bool dumpIRKinds = false;
bool dumpIRNodes = false;
bool dumpIRNoLists = false;
bool dumpIRNoLeafs = false;
bool dumpIRNoStmts = false;
bool dumpIRTrees = false;
bool dumpIRLinear = false;
bool dumpIRDataflow = false;
bool dumpIRBlockHeaders = false;
bool dumpIRExit = false;
LPCWSTR dumpIRPhase = nullptr;
LPCWSTR dumpIRFormat = nullptr;
if (!altJitConfig || opts.altJit)
{
LPCWSTR dumpIRFormat = nullptr;
// We should only enable 'verboseDump' when we are actually compiling a matching method
// and not enable it when we are just considering inlining a matching method.
//
if (!compIsForInlining())
{
if (jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
{
if (JitConfig.NgenDump().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
verboseDump = true;
}
unsigned ngenHashDumpVal = (unsigned)JitConfig.NgenHashDump();
if ((ngenHashDumpVal != (DWORD)-1) && (ngenHashDumpVal == info.compMethodHash()))
{
verboseDump = true;
}
if (JitConfig.NgenDumpIR().contains(info.compMethodName, info.compClassName,
&info.compMethodInfo->args))
{
dumpIR = true;
}
unsigned ngenHashDumpIRVal = (unsigned)JitConfig.NgenHashDumpIR();
if ((ngenHashDumpIRVal != (DWORD)-1) && (ngenHashDumpIRVal == info.compMethodHash()))
{
dumpIR = true;
}
dumpIRFormat = JitConfig.NgenDumpIRFormat();
dumpIRPhase = JitConfig.NgenDumpIRPhase();
}
else
{
if (JitConfig.JitDump().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
verboseDump = true;
}
unsigned jitHashDumpVal = (unsigned)JitConfig.JitHashDump();
if ((jitHashDumpVal != (DWORD)-1) && (jitHashDumpVal == info.compMethodHash()))
{
verboseDump = true;
}
if (JitConfig.JitDumpIR().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
dumpIR = true;
}
unsigned jitHashDumpIRVal = (unsigned)JitConfig.JitHashDumpIR();
if ((jitHashDumpIRVal != (DWORD)-1) && (jitHashDumpIRVal == info.compMethodHash()))
{
dumpIR = true;
}
dumpIRFormat = JitConfig.JitDumpIRFormat();
dumpIRPhase = JitConfig.JitDumpIRPhase();
}
}
if (dumpIRPhase == nullptr)
{
dumpIRPhase = W("*");
}
this->dumpIRPhase = dumpIRPhase;
if (dumpIRFormat != nullptr)
{
this->dumpIRFormat = dumpIRFormat;
}
dumpIRTrees = false;
dumpIRLinear = true;
if (dumpIRFormat != nullptr)
{
for (LPCWSTR p = dumpIRFormat; (*p != 0);)
{
for (; (*p != 0); p++)
{
if (*p != L' ')
{
break;
}
}
if (*p == 0)
{
break;
}
static bool dumpedHelp = false;
if ((*p == L'?') && (!dumpedHelp))
{
printf("*******************************************************************************\n");
printf("\n");
dFormatIR();
printf("\n");
printf("\n");
printf("Available specifiers (comma separated):\n");
printf("\n");
printf("? dump out value of COMPlus_JitDumpIRFormat and this list of values\n");
printf("\n");
printf("linear linear IR dump (default)\n");
printf("tree tree IR dump (traditional)\n");
printf("mixed intermingle tree dump with linear IR dump\n");
printf("\n");
printf("dataflow use data flow form of linear IR dump\n");
printf("structural use structural form of linear IR dump\n");
printf("all implies structural, include everything\n");
printf("\n");
printf("kinds include tree node kinds in dump, example: \"kinds=[LEAF][LOCAL]\"\n");
printf("flags include tree node flags in dump, example: \"flags=[CALL][GLOB_REF]\" \n");
printf("types includes tree node types in dump, example: \".int\"\n");
printf("locals include local numbers and tracking numbers in dump, example: \"(V3,T1)\"\n");
printf("regs include register assignments in dump, example: \"(rdx)\"\n");
printf("ssa include SSA numbers in dump, example: \"<d:3>\" or \"<u:3>\"\n");
printf("valnums include Value numbers in dump, example: \"<v:$c4>\" or \"<v:$c4,$c5>\"\n");
printf("\n");
printf("nolist exclude GT_LIST nodes from dump\n");
printf("noleafs exclude LEAF nodes from dump (fold into operations)\n");
printf("nostmts exclude GT_STMTS from dump (unless required by dependencies)\n");
printf("\n");
printf("blkhdrs include block headers\n");
printf("exit exit program after last phase dump (used with single method)\n");
printf("\n");
printf("*******************************************************************************\n");
dumpedHelp = true;
}
if (wcsncmp(p, W("types"), 5) == 0)
{
dumpIRTypes = true;
}
if (wcsncmp(p, W("locals"), 6) == 0)
{
dumpIRLocals = true;
}
if (wcsncmp(p, W("regs"), 4) == 0)
{
dumpIRRegs = true;
}
if (wcsncmp(p, W("ssa"), 3) == 0)
{
dumpIRSsa = true;
}
if (wcsncmp(p, W("valnums"), 7) == 0)
{
dumpIRValnums = true;
}
if (wcsncmp(p, W("costs"), 5) == 0)
{
dumpIRCosts = true;
}
if (wcsncmp(p, W("flags"), 5) == 0)
{
dumpIRFlags = true;
}
if (wcsncmp(p, W("kinds"), 5) == 0)
{
dumpIRKinds = true;
}
if (wcsncmp(p, W("nodes"), 5) == 0)
{
dumpIRNodes = true;
}
if (wcsncmp(p, W("exit"), 4) == 0)
{
dumpIRExit = true;
}
if (wcsncmp(p, W("nolists"), 7) == 0)
{
dumpIRNoLists = true;
}
if (wcsncmp(p, W("noleafs"), 7) == 0)
{
dumpIRNoLeafs = true;
}
if (wcsncmp(p, W("nostmts"), 7) == 0)
{
dumpIRNoStmts = true;
}
if (wcsncmp(p, W("trees"), 5) == 0)
{
dumpIRTrees = true;
dumpIRLinear = false;
}
if (wcsncmp(p, W("structural"), 10) == 0)
{
dumpIRLinear = true;
dumpIRNoStmts = false;
dumpIRNoLeafs = false;
dumpIRNoLists = false;
}
if (wcsncmp(p, W("all"), 3) == 0)
{
dumpIRLinear = true;
dumpIRKinds = true;
dumpIRFlags = true;
dumpIRTypes = true;
dumpIRLocals = true;
dumpIRRegs = true;
dumpIRSsa = true;
dumpIRValnums = true;
dumpIRCosts = true;
dumpIRNoStmts = false;
dumpIRNoLeafs = false;
dumpIRNoLists = false;
}
if (wcsncmp(p, W("linear"), 6) == 0)
{
dumpIRTrees = false;
dumpIRLinear = true;
}
if (wcsncmp(p, W("mixed"), 5) == 0)
{
dumpIRTrees = true;
dumpIRLinear = true;
}
if (wcsncmp(p, W("dataflow"), 8) == 0)
{
dumpIRDataflow = true;
dumpIRNoLeafs = true;
dumpIRNoLists = true;
dumpIRNoStmts = true;
}
if (wcsncmp(p, W("blkhdrs"), 7) == 0)
{
dumpIRBlockHeaders = true;
}
for (; (*p != 0); p++)
{
if (*p == L',')
{
p++;
break;
}
}
}
}
}
if (verboseDump)
{
verbose = true;
}
if (dumpIR)
{
this->dumpIR = true;
}
if (dumpIRTypes)
{
this->dumpIRTypes = true;
}
if (dumpIRLocals)
{
this->dumpIRLocals = true;
}
if (dumpIRRegs)
{
this->dumpIRRegs = true;
}
if (dumpIRSsa)
{
this->dumpIRSsa = true;
}
if (dumpIRValnums)
{
this->dumpIRValnums = true;
}
if (dumpIRCosts)
{
this->dumpIRCosts = true;
}
if (dumpIRFlags)
{
this->dumpIRFlags = true;
}
if (dumpIRKinds)
{
this->dumpIRKinds = true;
}
if (dumpIRNodes)
{
this->dumpIRNodes = true;
}
if (dumpIRNoLists)
{
this->dumpIRNoLists = true;
}
if (dumpIRNoLeafs)
{
this->dumpIRNoLeafs = true;
}
if (dumpIRNoLeafs && dumpIRDataflow)
{
this->dumpIRDataflow = true;
}
if (dumpIRNoStmts)
{
this->dumpIRNoStmts = true;
}
if (dumpIRTrees)
{
this->dumpIRTrees = true;
}
if (dumpIRLinear)
{
this->dumpIRLinear = true;
}
if (dumpIRBlockHeaders)
{
this->dumpIRBlockHeaders = true;
}
if (dumpIRExit)
{
this->dumpIRExit = true;
}
#endif // DEBUG
#ifdef FEATURE_SIMD
// Minimum bar for availing SIMD benefits is SSE2 on AMD64/x86.
featureSIMD = jitFlags->IsSet(JitFlags::JIT_FLAG_FEATURE_SIMD);
setUsesSIMDTypes(false);
#endif // FEATURE_SIMD
if (compIsForImportOnly())
{
return;
}
#if FEATURE_TAILCALL_OPT
// By default opportunistic tail call optimization is enabled.
// Recognition is done in the importer so this must be set for
// inlinees as well.
opts.compTailCallOpt = true;
#endif // FEATURE_TAILCALL_OPT
if (compIsForInlining())
{
return;
}
// The rest of the opts fields that we initialize here
// should only be used when we generate code for the method
// They should not be used when importing or inlining
CLANG_FORMAT_COMMENT_ANCHOR;
#if FEATURE_TAILCALL_OPT
opts.compTailCallLoopOpt = true;
#endif // FEATURE_TAILCALL_OPT
opts.genFPorder = true;
opts.genFPopt = true;
opts.instrCount = 0;
opts.lvRefCount = 0;
#ifdef PROFILING_SUPPORTED
opts.compJitELTHookEnabled = false;
#endif // PROFILING_SUPPORTED
#ifdef DEBUG
opts.dspInstrs = false;
opts.dspEmit = false;
opts.dspLines = false;
opts.varNames = false;
opts.dmpHex = false;
opts.disAsm = false;
opts.disAsmSpilled = false;
opts.disDiffable = false;
opts.dspCode = false;
opts.dspEHTable = false;
opts.dspGCtbls = false;
opts.disAsm2 = false;
opts.dspUnwind = false;
opts.compLongAddress = false;
opts.optRepeat = false;
#ifdef LATE_DISASM
opts.doLateDisasm = false;
#endif // LATE_DISASM
compDebugBreak = false;
// If we have a non-empty AltJit config then we change all of these other
// config values to refer only to the AltJit.
//
if (!altJitConfig || opts.altJit)
{
if (jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
{
if ((JitConfig.NgenOrder() & 1) == 1)
{
opts.dspOrder = true;
}
if (JitConfig.NgenGCDump().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.dspGCtbls = true;
}
if (JitConfig.NgenDisasm().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.disAsm = true;
}
if (JitConfig.NgenDisasm().contains("SPILLED", nullptr, nullptr))
{
opts.disAsmSpilled = true;
}
if (JitConfig.NgenUnwindDump().contains(info.compMethodName, info.compClassName,
&info.compMethodInfo->args))
{
opts.dspUnwind = true;
}
if (JitConfig.NgenEHDump().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.dspEHTable = true;
}
}
else
{
if ((JitConfig.JitOrder() & 1) == 1)
{
opts.dspOrder = true;
}
if (JitConfig.JitGCDump().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.dspGCtbls = true;
}
if (JitConfig.JitDisasm().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.disAsm = true;
}
if (JitConfig.JitDisasm().contains("SPILLED", nullptr, nullptr))
{
opts.disAsmSpilled = true;
}
if (JitConfig.JitUnwindDump().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.dspUnwind = true;
}
if (JitConfig.JitEHDump().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.dspEHTable = true;
}
}
#ifdef LATE_DISASM
if (JitConfig.JitLateDisasm().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
opts.doLateDisasm = true;
#endif // LATE_DISASM
// This one applies to both Ngen/Jit Disasm output: COMPlus_JitDiffableDasm=1
if (JitConfig.DiffableDasm() != 0)
{
opts.disDiffable = true;
opts.dspDiffable = true;
}
if (JitConfig.JitLongAddress() != 0)
{
opts.compLongAddress = true;
}
if (JitConfig.JitOptRepeat().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
opts.optRepeat = true;
}
}
if (verboseDump)
{
opts.dspCode = true;
opts.dspEHTable = true;
opts.dspGCtbls = true;
opts.disAsm2 = true;
opts.dspUnwind = true;
verbose = true;
verboseTrees = shouldUseVerboseTrees();
verboseSsa = shouldUseVerboseSsa();
codeGen->setVerbose(true);
}
treesBeforeAfterMorph = (JitConfig.TreesBeforeAfterMorph() == 1);
morphNum = 0; // Initialize the morphed-trees counting.
expensiveDebugCheckLevel = JitConfig.JitExpensiveDebugCheckLevel();
if (expensiveDebugCheckLevel == 0)
{
// If we're in a stress mode that modifies the flowgraph, make 1 the default.
if (fgStressBBProf() || compStressCompile(STRESS_DO_WHILE_LOOPS, 30))
{
expensiveDebugCheckLevel = 1;
}
}
if (verbose)
{
printf("****** START compiling %s (MethodHash=%08x)\n", info.compFullName, info.compMethodHash());
printf("Generating code for %s %s\n", Target::g_tgtPlatformName, Target::g_tgtCPUName);
printf(""); // in our logic this causes a flush
}
if (JitConfig.JitBreak().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
assert(!"JitBreak reached");
}
unsigned jitHashBreakVal = (unsigned)JitConfig.JitHashBreak();
if ((jitHashBreakVal != (DWORD)-1) && (jitHashBreakVal == info.compMethodHash()))
{
assert(!"JitHashBreak reached");
}
if (verbose ||
JitConfig.JitDebugBreak().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args) ||
JitConfig.JitBreak().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
compDebugBreak = true;
}
memset(compActiveStressModes, 0, sizeof(compActiveStressModes));
#endif // DEBUG
//-------------------------------------------------------------------------
#ifdef DEBUG
assert(!codeGen->isGCTypeFixed());
opts.compGcChecks = (JitConfig.JitGCChecks() != 0) || compStressCompile(STRESS_GENERIC_VARN, 5);
enum
{
STACK_CHECK_ON_RETURN = 0x1,
STACK_CHECK_ON_CALL = 0x2,
STACK_CHECK_ALL = 0x3,
};
DWORD dwJitStackChecks = JitConfig.JitStackChecks();
if (compStressCompile(STRESS_GENERIC_VARN, 5))
{
dwJitStackChecks = STACK_CHECK_ALL;
}
opts.compStackCheckOnRet = (dwJitStackChecks & DWORD(STACK_CHECK_ON_RETURN)) != 0;
opts.compStackCheckOnCall = (dwJitStackChecks & DWORD(STACK_CHECK_ON_CALL)) != 0;
#endif
#if MEASURE_MEM_ALLOC
s_dspMemStats = (JitConfig.DisplayMemStats() != 0);
#endif
#ifdef PROFILING_SUPPORTED
opts.compNoPInvokeInlineCB = jitFlags->IsSet(JitFlags::JIT_FLAG_PROF_NO_PINVOKE_INLINE);
// Cache the profiler handle
if (jitFlags->IsSet(JitFlags::JIT_FLAG_PROF_ENTERLEAVE))
{
BOOL hookNeeded;
BOOL indirected;
info.compCompHnd->GetProfilingHandle(&hookNeeded, &compProfilerMethHnd, &indirected);
compProfilerHookNeeded = !!hookNeeded;
compProfilerMethHndIndirected = !!indirected;
}
else
{
compProfilerHookNeeded = false;
compProfilerMethHnd = nullptr;
compProfilerMethHndIndirected = false;
}
// Honour COMPlus_JitELTHookEnabled only if VM has not asked us to generate profiler
// hooks in the first place. That is, override VM only if it hasn't asked for a
// profiler callback for this method.
if (!compProfilerHookNeeded && (JitConfig.JitELTHookEnabled() != 0))
{
opts.compJitELTHookEnabled = true;
}
// TBD: Exclude PInvoke stubs
if (opts.compJitELTHookEnabled)
{
compProfilerMethHnd = (void*)DummyProfilerELTStub;
compProfilerMethHndIndirected = false;
}
#endif // PROFILING_SUPPORTED
#if FEATURE_TAILCALL_OPT
const wchar_t* strTailCallOpt = JitConfig.TailCallOpt();
if (strTailCallOpt != nullptr)
{
opts.compTailCallOpt = (UINT)_wtoi(strTailCallOpt) != 0;
}
if (JitConfig.TailCallLoopOpt() == 0)
{
opts.compTailCallLoopOpt = false;
}
#endif
opts.compScopeInfo = opts.compDbgInfo;
#ifdef LATE_DISASM
codeGen->getDisAssembler().disOpenForLateDisAsm(info.compMethodName, info.compClassName,
info.compMethodInfo->args.pSig);
#endif
//-------------------------------------------------------------------------
opts.compReloc = jitFlags->IsSet(JitFlags::JIT_FLAG_RELOC);
#ifdef DEBUG
#if defined(_TARGET_XARCH_) && !defined(LEGACY_BACKEND)
// Whether encoding of absolute addr as PC-rel offset is enabled in RyuJIT
opts.compEnablePCRelAddr = (JitConfig.EnablePCRelAddr() != 0);
#endif
#endif // DEBUG
opts.compProcedureSplitting = jitFlags->IsSet(JitFlags::JIT_FLAG_PROCSPLIT);
#ifdef _TARGET_ARM64_
// TODO-ARM64-NYI: enable hot/cold splitting
opts.compProcedureSplitting = false;
#endif // _TARGET_ARM64_
#ifdef DEBUG
opts.compProcedureSplittingEH = opts.compProcedureSplitting;
#endif // DEBUG
if (opts.compProcedureSplitting)
{
// Note that opts.compdbgCode is true under ngen for checked assemblies!
opts.compProcedureSplitting = !opts.compDbgCode;
#ifdef DEBUG
// JitForceProcedureSplitting is used to force procedure splitting on checked assemblies.
// This is useful for debugging on a checked build. Note that we still only do procedure
// splitting in the zapper.
if (JitConfig.JitForceProcedureSplitting().contains(info.compMethodName, info.compClassName,
&info.compMethodInfo->args))
{
opts.compProcedureSplitting = true;
}
// JitNoProcedureSplitting will always disable procedure splitting.
if (JitConfig.JitNoProcedureSplitting().contains(info.compMethodName, info.compClassName,
&info.compMethodInfo->args))
{
opts.compProcedureSplitting = false;
}
//
// JitNoProcedureSplittingEH will disable procedure splitting in functions with EH.
if (JitConfig.JitNoProcedureSplittingEH().contains(info.compMethodName, info.compClassName,
&info.compMethodInfo->args))
{
opts.compProcedureSplittingEH = false;
}
#endif
}
fgProfileBuffer = nullptr;
fgProfileData_ILSizeMismatch = false;
fgNumProfileRuns = 0;
if (jitFlags->IsSet(JitFlags::JIT_FLAG_BBOPT))
{
assert(!compIsForInlining());
HRESULT hr;
hr = info.compCompHnd->getBBProfileData(info.compMethodHnd, &fgProfileBufferCount, &fgProfileBuffer,
&fgNumProfileRuns);
// a failed result that also has a non-NULL fgProfileBuffer
// indicates that the ILSize for the method no longer matches
// the ILSize for the method when profile data was collected.
//
// We will discard the IBC data in this case
//
if (FAILED(hr) && (fgProfileBuffer != nullptr))
{
fgProfileData_ILSizeMismatch = true;
fgProfileBuffer = nullptr;
}
#ifdef DEBUG
// A successful result implies a non-NULL fgProfileBuffer
//
if (SUCCEEDED(hr))
{
assert(fgProfileBuffer != nullptr);
}
// A failed result implies a NULL fgProfileBuffer
// see implementation of Compiler::fgHaveProfileData()
//
if (FAILED(hr))
{
assert(fgProfileBuffer == nullptr);
}
#endif
}
opts.compNeedStackProbes = false;
#ifdef DEBUG
if (JitConfig.StackProbesOverride() != 0 || compStressCompile(STRESS_GENERIC_VARN, 5))
{
opts.compNeedStackProbes = true;
}
#endif
#ifdef DEBUG
// Now, set compMaxUncheckedOffsetForNullObject for STRESS_NULL_OBJECT_CHECK
if (compStressCompile(STRESS_NULL_OBJECT_CHECK, 30))
{
compMaxUncheckedOffsetForNullObject = (size_t)JitConfig.JitMaxUncheckedOffset();
if (verbose)
{
printf("STRESS_NULL_OBJECT_CHECK: compMaxUncheckedOffsetForNullObject=0x%X\n",
compMaxUncheckedOffsetForNullObject);
}
}
if (verbose)
{
printf("OPTIONS: compCodeOpt = %s\n",
(opts.compCodeOpt == BLENDED_CODE)
? "BLENDED_CODE"
: (opts.compCodeOpt == SMALL_CODE) ? "SMALL_CODE"
: (opts.compCodeOpt == FAST_CODE) ? "FAST_CODE" : "UNKNOWN_CODE");
printf("OPTIONS: compDbgCode = %s\n", dspBool(opts.compDbgCode));
printf("OPTIONS: compDbgInfo = %s\n", dspBool(opts.compDbgInfo));
printf("OPTIONS: compDbgEnC = %s\n", dspBool(opts.compDbgEnC));
printf("OPTIONS: compProcedureSplitting = %s\n", dspBool(opts.compProcedureSplitting));
printf("OPTIONS: compProcedureSplittingEH = %s\n", dspBool(opts.compProcedureSplittingEH));
if (jitFlags->IsSet(JitFlags::JIT_FLAG_BBOPT) && fgHaveProfileData())
{
printf("OPTIONS: using real profile data\n");
}
if (fgProfileData_ILSizeMismatch)
{
printf("OPTIONS: discarded IBC profile data due to mismatch in ILSize\n");
}
if (jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
{
printf("OPTIONS: Jit invoked for ngen\n");
}
printf("OPTIONS: Stack probing is %s\n", opts.compNeedStackProbes ? "ENABLED" : "DISABLED");
}
#endif
opts.compGCPollType = GCPOLL_NONE;
if (jitFlags->IsSet(JitFlags::JIT_FLAG_GCPOLL_CALLS))
{
opts.compGCPollType = GCPOLL_CALL;
}
else if (jitFlags->IsSet(JitFlags::JIT_FLAG_GCPOLL_INLINE))
{
// make sure that the EE didn't set both flags.
assert(opts.compGCPollType == GCPOLL_NONE);
opts.compGCPollType = GCPOLL_INLINE;
}
}
#ifdef DEBUG
void JitDump(const char* pcFormat, ...)
{
va_list lst;
va_start(lst, pcFormat);
vflogf(jitstdout, pcFormat, lst);
va_end(lst);
}
bool Compiler::compJitHaltMethod()
{
/* This method returns true when we use an INS_BREAKPOINT to allow us to step into the generated native code */
/* Note that this these two "Jit" environment variables also work for ngen images */
if (JitConfig.JitHalt().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
return true;
}
/* Use this Hash variant when there are a lot of method with the same name and different signatures */
unsigned fJitHashHaltVal = (unsigned)JitConfig.JitHashHalt();
if ((fJitHashHaltVal != (unsigned)-1) && (fJitHashHaltVal == info.compMethodHash()))
{
return true;
}
return false;
}
/*****************************************************************************
* Should we use a "stress-mode" for the given stressArea. We have different
* areas to allow the areas to be mixed in different combinations in
* different methods.
* 'weight' indicates how often (as a percentage) the area should be stressed.
* It should reflect the usefulness:overhead ratio.
*/
const LPCWSTR Compiler::s_compStressModeNames[STRESS_COUNT + 1] = {
#define STRESS_MODE(mode) W("STRESS_") W(#mode),
STRESS_MODES
#undef STRESS_MODE
};
bool Compiler::compStressCompile(compStressArea stressArea, unsigned weight)
{
unsigned hash;
DWORD stressLevel;
if (!bRangeAllowStress)
{
return false;
}
if (!JitConfig.JitStressOnly().isEmpty() &&
!JitConfig.JitStressOnly().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
return false;
}
bool doStress = false;
const wchar_t* strStressModeNames;
// Does user explicitly prevent using this STRESS_MODE through the command line?
const wchar_t* strStressModeNamesNot = JitConfig.JitStressModeNamesNot();
if ((strStressModeNamesNot != nullptr) &&
(wcsstr(strStressModeNamesNot, s_compStressModeNames[stressArea]) != nullptr))
{
if (verbose)
{
printf("JitStressModeNamesNot contains %ws\n", s_compStressModeNames[stressArea]);
}
doStress = false;
goto _done;
}
// Does user explicitly set this STRESS_MODE through the command line?
strStressModeNames = JitConfig.JitStressModeNames();
if (strStressModeNames != nullptr)
{
if (wcsstr(strStressModeNames, s_compStressModeNames[stressArea]) != nullptr)
{
if (verbose)
{
printf("JitStressModeNames contains %ws\n", s_compStressModeNames[stressArea]);
}
doStress = true;
goto _done;
}
// This stress mode name did not match anything in the stress
// mode whitelist. If user has requested only enable mode,
// don't allow this stress mode to turn on.
const bool onlyEnableMode = JitConfig.JitStressModeNamesOnly() != 0;
if (onlyEnableMode)
{
doStress = false;
goto _done;
}
}
// 0: No stress (Except when explicitly set in complus_JitStressModeNames)
// !=2: Vary stress. Performance will be slightly/moderately degraded
// 2: Check-all stress. Performance will be REALLY horrible
stressLevel = getJitStressLevel();
assert(weight <= MAX_STRESS_WEIGHT);
/* Check for boundary conditions */
if (stressLevel == 0 || weight == 0)
{
return false;
}
// Should we allow unlimited stress ?
if (stressArea > STRESS_COUNT_VARN && stressLevel == 2)
{
return true;
}
if (weight == MAX_STRESS_WEIGHT)
{
doStress = true;
goto _done;
}
// Get a hash which can be compared with 'weight'
assert(stressArea != 0);
hash = (info.compMethodHash() ^ stressArea ^ stressLevel) % MAX_STRESS_WEIGHT;
assert(hash < MAX_STRESS_WEIGHT && weight <= MAX_STRESS_WEIGHT);
doStress = (hash < weight);
_done:
if (doStress && !compActiveStressModes[stressArea])
{
if (verbose)
{
printf("\n\n*** JitStress: %ws ***\n\n", s_compStressModeNames[stressArea]);
}
compActiveStressModes[stressArea] = 1;
}
return doStress;
}
#endif // DEBUG
void Compiler::compInitDebuggingInfo()
{
assert(!compIsForInlining());
#ifdef DEBUG
if (verbose)
{
printf("*************** In compInitDebuggingInfo() for %s\n", info.compFullName);
}
#endif
/*-------------------------------------------------------------------------
*
* Get hold of the local variable records, if there are any
*/
info.compVarScopesCount = 0;
if (opts.compScopeInfo)
{
eeGetVars();
}
compInitVarScopeMap();
if (opts.compScopeInfo || opts.compDbgCode)
{
compInitScopeLists();
}
if (opts.compDbgCode && (info.compVarScopesCount > 0))
{
/* Create a new empty basic block. fgExtendDbgLifetimes() may add
initialization of variables which are in scope right from the
start of the (real) first BB (and therefore artificially marked
as alive) into this block.
*/
fgEnsureFirstBBisScratch();
fgInsertStmtAtEnd(fgFirstBB, gtNewNothingNode());
JITDUMP("Debuggable code - Add new BB%02u to perform initialization of variables [%08X]\n", fgFirstBB->bbNum,
dspPtr(fgFirstBB));
}
/*-------------------------------------------------------------------------
*
* Read the stmt-offsets table and the line-number table
*/
info.compStmtOffsetsImplicit = ICorDebugInfo::NO_BOUNDARIES;
// We can only report debug info for EnC at places where the stack is empty.
// Actually, at places where there are not live temps. Else, we won't be able
// to map between the old and the new versions correctly as we won't have
// any info for the live temps.
assert(!opts.compDbgEnC || !opts.compDbgInfo ||
0 == (info.compStmtOffsetsImplicit & ~ICorDebugInfo::STACK_EMPTY_BOUNDARIES));
info.compStmtOffsetsCount = 0;
if (opts.compDbgInfo)
{
/* Get hold of the line# records, if there are any */
eeGetStmtOffsets();
#ifdef DEBUG
if (verbose)
{
printf("info.compStmtOffsetsCount = %d\n", info.compStmtOffsetsCount);
printf("info.compStmtOffsetsImplicit = %04Xh", info.compStmtOffsetsImplicit);
if (info.compStmtOffsetsImplicit)
{
printf(" ( ");
if (info.compStmtOffsetsImplicit & ICorDebugInfo::STACK_EMPTY_BOUNDARIES)
{
printf("STACK_EMPTY ");
}
if (info.compStmtOffsetsImplicit & ICorDebugInfo::NOP_BOUNDARIES)
{
printf("NOP ");
}
if (info.compStmtOffsetsImplicit & ICorDebugInfo::CALL_SITE_BOUNDARIES)
{
printf("CALL_SITE ");
}
printf(")");
}
printf("\n");
IL_OFFSET* pOffs = info.compStmtOffsets;
for (unsigned i = 0; i < info.compStmtOffsetsCount; i++, pOffs++)
{
printf("%02d) IL_%04Xh\n", i, *pOffs);
}
}
#endif
}
}
void Compiler::compSetOptimizationLevel()
{
bool theMinOptsValue;
unsigned jitMinOpts;
if (compIsForInlining())
{
theMinOptsValue = impInlineInfo->InlinerCompiler->opts.MinOpts();
goto _SetMinOpts;
}
theMinOptsValue = false;
if (opts.compFlags == CLFLG_MINOPT)
{
JITLOG((LL_INFO100, "CLFLG_MINOPT set for method %s\n", info.compFullName));
theMinOptsValue = true;
}
#ifdef DEBUG
jitMinOpts = JitConfig.JitMinOpts();
if (!theMinOptsValue && (jitMinOpts > 0))
{
unsigned methodCount = Compiler::jitTotalMethodCompiled;
unsigned methodCountMask = methodCount & 0xFFF;
unsigned kind = (jitMinOpts & 0xF000000) >> 24;
switch (kind)
{
default:
if (jitMinOpts <= methodCount)
{
if (verbose)
{
printf(" Optimizations disabled by JitMinOpts and methodCount\n");
}
theMinOptsValue = true;
}
break;
case 0xD:
{
unsigned firstMinopts = (jitMinOpts >> 12) & 0xFFF;
unsigned secondMinopts = (jitMinOpts >> 0) & 0xFFF;
if ((firstMinopts == methodCountMask) || (secondMinopts == methodCountMask))
{
if (verbose)
{
printf("0xD: Optimizations disabled by JitMinOpts and methodCountMask\n");
}
theMinOptsValue = true;
}
}
break;
case 0xE:
{
unsigned startMinopts = (jitMinOpts >> 12) & 0xFFF;
unsigned endMinopts = (jitMinOpts >> 0) & 0xFFF;
if ((startMinopts <= methodCountMask) && (endMinopts >= methodCountMask))
{
if (verbose)
{
printf("0xE: Optimizations disabled by JitMinOpts and methodCountMask\n");
}
theMinOptsValue = true;
}
}
break;
case 0xF:
{
unsigned bitsZero = (jitMinOpts >> 12) & 0xFFF;
unsigned bitsOne = (jitMinOpts >> 0) & 0xFFF;
if (((methodCountMask & bitsOne) == bitsOne) && ((~methodCountMask & bitsZero) == bitsZero))
{
if (verbose)
{
printf("0xF: Optimizations disabled by JitMinOpts and methodCountMask\n");
}
theMinOptsValue = true;
}
}
break;
}
}
if (!theMinOptsValue)
{
if (JitConfig.JitMinOptsName().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
theMinOptsValue = true;
}
}
#if 0
// The code in this #if can be used to debug optimization issues according to method hash.
// To use, uncomment, rebuild and set environment variables minoptshashlo and minoptshashhi.
#ifdef DEBUG
unsigned methHash = info.compMethodHash();
char* lostr = getenv("minoptshashlo");
unsigned methHashLo = 0;
if (lostr != nullptr)
{
sscanf_s(lostr, "%x", &methHashLo);
char* histr = getenv("minoptshashhi");
unsigned methHashHi = UINT32_MAX;
if (histr != nullptr)
{
sscanf_s(histr, "%x", &methHashHi);
if (methHash >= methHashLo && methHash <= methHashHi)
{
printf("MinOpts for method %s, hash = 0x%x.\n",
info.compFullName, info.compMethodHash());
printf(""); // in our logic this causes a flush
theMinOptsValue = true;
}
}
}
#endif
#endif
if (compStressCompile(STRESS_MIN_OPTS, 5))
{
theMinOptsValue = true;
}
// For PREJIT we never drop down to MinOpts
// unless unless CLFLG_MINOPT is set
else if (!opts.jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
{
if ((unsigned)JitConfig.JitMinOptsCodeSize() < info.compILCodeSize)
{
JITLOG((LL_INFO10, "IL Code Size exceeded, using MinOpts for method %s\n", info.compFullName));
theMinOptsValue = true;
}
else if ((unsigned)JitConfig.JitMinOptsInstrCount() < opts.instrCount)
{
JITLOG((LL_INFO10, "IL instruction count exceeded, using MinOpts for method %s\n", info.compFullName));
theMinOptsValue = true;
}
else if ((unsigned)JitConfig.JitMinOptsBbCount() < fgBBcount)
{
JITLOG((LL_INFO10, "Basic Block count exceeded, using MinOpts for method %s\n", info.compFullName));
theMinOptsValue = true;
}
else if ((unsigned)JitConfig.JitMinOptsLvNumCount() < lvaCount)
{
JITLOG((LL_INFO10, "Local Variable Num count exceeded, using MinOpts for method %s\n", info.compFullName));
theMinOptsValue = true;
}
else if ((unsigned)JitConfig.JitMinOptsLvRefCount() < opts.lvRefCount)
{
JITLOG((LL_INFO10, "Local Variable Ref count exceeded, using MinOpts for method %s\n", info.compFullName));
theMinOptsValue = true;
}
if (theMinOptsValue == true)
{
JITLOG((LL_INFO10000, "IL Code Size,Instr %4d,%4d, Basic Block count %3d, Local Variable Num,Ref count "
"%3d,%3d for method %s\n",
info.compILCodeSize, opts.instrCount, fgBBcount, lvaCount, opts.lvRefCount, info.compFullName));
if (JitConfig.JitBreakOnMinOpts() != 0)
{
assert(!"MinOpts enabled");
}
}
}
#else // !DEBUG
// Retail check if we should force Minopts due to the complexity of the method
// For PREJIT we never drop down to MinOpts
// unless unless CLFLG_MINOPT is set
if (!theMinOptsValue && !opts.jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT) &&
((DEFAULT_MIN_OPTS_CODE_SIZE < info.compILCodeSize) || (DEFAULT_MIN_OPTS_INSTR_COUNT < opts.instrCount) ||
(DEFAULT_MIN_OPTS_BB_COUNT < fgBBcount) || (DEFAULT_MIN_OPTS_LV_NUM_COUNT < lvaCount) ||
(DEFAULT_MIN_OPTS_LV_REF_COUNT < opts.lvRefCount)))
{
theMinOptsValue = true;
}
#endif // DEBUG
JITLOG((LL_INFO10000,
"IL Code Size,Instr %4d,%4d, Basic Block count %3d, Local Variable Num,Ref count %3d,%3d for method %s\n",
info.compILCodeSize, opts.instrCount, fgBBcount, lvaCount, opts.lvRefCount, info.compFullName));
#if 0
// The code in this #if has been useful in debugging loop cloning issues, by
// enabling selective enablement of the loop cloning optimization according to
// method hash.
#ifdef DEBUG
if (!theMinOptsValue)
{
unsigned methHash = info.compMethodHash();
char* lostr = getenv("opthashlo");
unsigned methHashLo = 0;
if (lostr != NULL)
{
sscanf_s(lostr, "%x", &methHashLo);
// methHashLo = (unsigned(atoi(lostr)) << 2); // So we don't have to use negative numbers.
}
char* histr = getenv("opthashhi");
unsigned methHashHi = UINT32_MAX;
if (histr != NULL)
{
sscanf_s(histr, "%x", &methHashHi);
// methHashHi = (unsigned(atoi(histr)) << 2); // So we don't have to use negative numbers.
}
if (methHash < methHashLo || methHash > methHashHi)
{
theMinOptsValue = true;
}
else
{
printf("Doing optimization in in %s (0x%x).\n", info.compFullName, methHash);
}
}
#endif
#endif
_SetMinOpts:
// Set the MinOpts value
opts.SetMinOpts(theMinOptsValue);
#ifdef DEBUG
if (verbose && !compIsForInlining())
{
printf("OPTIONS: opts.MinOpts() == %s\n", opts.MinOpts() ? "true" : "false");
}
#endif
/* Control the optimizations */
if (opts.MinOpts() || opts.compDbgCode)
{
opts.compFlags &= ~CLFLG_MAXOPT;
opts.compFlags |= CLFLG_MINOPT;
}
if (!compIsForInlining())
{
codeGen->setFramePointerRequired(false);
codeGen->setFrameRequired(false);
if (opts.MinOpts() || opts.compDbgCode)
{
codeGen->setFrameRequired(true);
}
#if !defined(_TARGET_AMD64_)
// The VM sets JitFlags::JIT_FLAG_FRAMED for two reasons: (1) the COMPlus_JitFramed variable is set, or
// (2) the function is marked "noinline". The reason for #2 is that people mark functions
// noinline to ensure the show up on in a stack walk. But for AMD64, we don't need a frame
// pointer for the frame to show up in stack walk.
if (opts.jitFlags->IsSet(JitFlags::JIT_FLAG_FRAMED))
codeGen->setFrameRequired(true);
#endif
if (opts.jitFlags->IsSet(JitFlags::JIT_FLAG_RELOC))
{
codeGen->genAlignLoops = false; // loop alignment not supported for prejitted code
// The zapper doesn't set JitFlags::JIT_FLAG_ALIGN_LOOPS, and there is
// no reason for it to set it as the JIT doesn't currently support loop alignment
// for prejitted images. (The JIT doesn't know the final address of the code, hence
// it can't align code based on unknown addresses.)
assert(!opts.jitFlags->IsSet(JitFlags::JIT_FLAG_ALIGN_LOOPS));
}
else
{
codeGen->genAlignLoops = opts.jitFlags->IsSet(JitFlags::JIT_FLAG_ALIGN_LOOPS);
}
}
info.compUnwrapContextful = !opts.MinOpts() && !opts.compDbgCode;
fgCanRelocateEHRegions = true;
}
#ifdef _TARGET_ARMARCH_
// Function compRsvdRegCheck:
// given a curState to use for calculating the total frame size
// it will return true if the REG_OPT_RSVD should be reserved so
// that it can be use to form large offsets when accessing stack
// based LclVar including both incoming and out going argument areas.
//
// The method advances the frame layout state to curState by calling
// lvaFrameSize(curState).
//
bool Compiler::compRsvdRegCheck(FrameLayoutState curState)
{
// Always do the layout even if returning early. Callers might
// depend on us to do the layout.
unsigned frameSize = lvaFrameSize(curState);
if (opts.MinOpts())
{
// Have a recovery path in case we fail to reserve REG_OPT_RSVD and go
// over the limit of SP and FP offset ranges due to large
// temps.
return true;
}
unsigned calleeSavedRegMaxSz = CALLEE_SAVED_REG_MAXSZ;
if (compFloatingPointUsed)
{
calleeSavedRegMaxSz += CALLEE_SAVED_FLOAT_MAXSZ;
}
noway_assert(frameSize > calleeSavedRegMaxSz);
#if defined(_TARGET_ARM64_)
// TODO-ARM64-CQ: update this!
return true; // just always assume we'll need it, for now
#else // _TARGET_ARM_
// frame layout:
//
// low addresses
// inArgs compArgSize
// origSP --->
// LR --->
// R11 --->
// + callee saved regs CALLEE_SAVED_REG_MAXSZ (32 bytes)
// optional saved fp regs 16 * sizeof(float) (64 bytes)
// - lclSize
// incl. TEMPS MAX_SPILL_TEMP_SIZE
// + incl. outArgs
// SP --->
// -
// high addresses
// With codeGen->isFramePointerRequired we use R11 to access incoming args with positive offsets
// and use R11 to access LclVars with negative offsets in the non funclet or
// main region we use SP with positive offsets. The limiting factor in the
// codeGen->isFramePointerRequired case is that we need the offset to be less than or equal to 0x7C
// for negative offsets, but positive offsets can be imm12 limited by vldr/vstr
// using +/-imm8.
//
// Subtract 4 bytes for alignment of a local var because number of temps could
// trigger a misaligned double or long.
//
unsigned maxR11ArgLimit = (compFloatingPointUsed ? 0x03FC : 0x0FFC);
unsigned maxR11LclLimit = 0x0078;
if (codeGen->isFramePointerRequired())
{
unsigned maxR11LclOffs = frameSize;
unsigned maxR11ArgOffs = compArgSize + (2 * REGSIZE_BYTES);
if (maxR11LclOffs > maxR11LclLimit || maxR11ArgOffs > maxR11ArgLimit)
{
return true;
}
}
// So this case is the SP based frame case, but note that we also will use SP based
// offsets for R11 based frames in the non-funclet main code area. However if we have
// passed the above max_R11_offset check these SP checks won't fire.
// Check local coverage first. If vldr/vstr will be used the limit can be +/-imm8.
unsigned maxSPLclLimit = (compFloatingPointUsed ? 0x03F8 : 0x0FF8);
if (frameSize > (codeGen->isFramePointerUsed() ? (maxR11LclLimit + maxSPLclLimit) : maxSPLclLimit))
{
return true;
}
// Check arguments coverage.
if ((!codeGen->isFramePointerUsed() || (compArgSize > maxR11ArgLimit)) && (compArgSize + frameSize) > maxSPLclLimit)
{
return true;
}
// We won't need to reserve REG_OPT_RSVD.
//
return false;
#endif // _TARGET_ARM_
}
#endif // _TARGET_ARMARCH_
void Compiler::compFunctionTraceStart()
{
#ifdef DEBUG
if (compIsForInlining())
{
return;
}
if ((JitConfig.JitFunctionTrace() != 0) && !opts.disDiffable)
{
LONG newJitNestingLevel = InterlockedIncrement(&Compiler::jitNestingLevel);
if (newJitNestingLevel <= 0)
{
printf("{ Illegal nesting level %d }\n", newJitNestingLevel);
}
for (LONG i = 0; i < newJitNestingLevel - 1; i++)
{
printf(" ");
}
printf("{ Start Jitting %s (MethodHash=%08x)\n", info.compFullName,
info.compMethodHash()); /* } editor brace matching workaround for this printf */
}
#endif // DEBUG
}
void Compiler::compFunctionTraceEnd(void* methodCodePtr, ULONG methodCodeSize, bool isNYI)
{
#ifdef DEBUG
assert(!compIsForInlining());
if ((JitConfig.JitFunctionTrace() != 0) && !opts.disDiffable)
{
LONG newJitNestingLevel = InterlockedDecrement(&Compiler::jitNestingLevel);
if (newJitNestingLevel < 0)
{
printf("{ Illegal nesting level %d }\n", newJitNestingLevel);
}
for (LONG i = 0; i < newJitNestingLevel; i++)
{
printf(" ");
}
/* { editor brace-matching workaround for following printf */
printf("} Jitted Entry %03x at" FMT_ADDR "method %s size %08x%s\n", Compiler::jitTotalMethodCompiled,
DBG_ADDR(methodCodePtr), info.compFullName, methodCodeSize,
isNYI ? " NYI" : (compIsForImportOnly() ? " import only" : ""));
}
#endif // DEBUG
}
//*********************************************************************************************
// #Phases
//
// This is the most interesting 'toplevel' function in the JIT. It goes through the operations of
// importing, morphing, optimizations and code generation. This is called from the EE through the
// code:CILJit::compileMethod function.
//
// For an overview of the structure of the JIT, see:
// https://github.com/dotnet/coreclr/blob/master/Documentation/botr/ryujit-overview.md
//
void Compiler::compCompile(void** methodCodePtr, ULONG* methodCodeSize, JitFlags* compileFlags)
{
if (compIsForInlining())
{
// Notify root instance that an inline attempt is about to import IL
impInlineRoot()->m_inlineStrategy->NoteImport();
}
hashBv::Init(this);
VarSetOps::AssignAllowUninitRhs(this, compCurLife, VarSetOps::UninitVal());
/* The temp holding the secret stub argument is used by fgImport() when importing the intrinsic. */
if (info.compPublishStubParam)
{
assert(lvaStubArgumentVar == BAD_VAR_NUM);
lvaStubArgumentVar = lvaGrabTempWithImplicitUse(false DEBUGARG("stub argument"));
lvaTable[lvaStubArgumentVar].lvType = TYP_I_IMPL;
}
EndPhase(PHASE_PRE_IMPORT);
compFunctionTraceStart();
/* Convert the instrs in each basic block to a tree based intermediate representation */
fgImport();
assert(!fgComputePredsDone);
if (fgCheapPredsValid)
{
// Remove cheap predecessors before inlining and fat call transformation;
// allowing the cheap predecessor lists to be inserted causes problems
// with splitting existing blocks.
fgRemovePreds();
}
if (IsTargetAbi(CORINFO_CORERT_ABI) && doesMethodHaveFatPointer())
{
fgTransformFatCalli();
}
EndPhase(PHASE_IMPORTATION);
if (compIsForInlining())
{
/* Quit inlining if fgImport() failed for any reason. */
if (!compDonotInline())
{
/* Filter out unimported BBs */
fgRemoveEmptyBlocks();
}
EndPhase(PHASE_POST_IMPORT);
#ifdef FEATURE_JIT_METHOD_PERF
if (pCompJitTimer != nullptr)
{
#if MEASURE_CLRAPI_CALLS
EndPhase(PHASE_CLR_API);
#endif
pCompJitTimer->Terminate(this, CompTimeSummaryInfo::s_compTimeSummary, false);
}
#endif
return;
}
assert(!compDonotInline());
// Maybe the caller was not interested in generating code
if (compIsForImportOnly())
{
compFunctionTraceEnd(nullptr, 0, false);
return;
}
#if !FEATURE_EH
// If we aren't yet supporting EH in a compiler bring-up, remove as many EH handlers as possible, so
// we can pass tests that contain try/catch EH, but don't actually throw any exceptions.
fgRemoveEH();
#endif // !FEATURE_EH
if (compileFlags->IsSet(JitFlags::JIT_FLAG_BBINSTR))
{
fgInstrumentMethod();
}
// We could allow ESP frames. Just need to reserve space for
// pushing EBP if the method becomes an EBP-frame after an edit.
// Note that requiring a EBP Frame disallows double alignment. Thus if we change this
// we either have to disallow double alignment for E&C some other way or handle it in EETwain.
if (opts.compDbgEnC)
{
codeGen->setFramePointerRequired(true);
// Since we need a slots for security near ebp, its not possible
// to do this after an Edit without shifting all the locals.
// So we just always reserve space for these slots in case an Edit adds them
opts.compNeedSecurityCheck = true;
// We don't care about localloc right now. If we do support it,
// EECodeManager::FixContextForEnC() needs to handle it smartly
// in case the localloc was actually executed.
//
// compLocallocUsed = true;
}
EndPhase(PHASE_POST_IMPORT);
/* Initialize the BlockSet epoch */
NewBasicBlockEpoch();
/* Massage the trees so that we can generate code out of them */
fgMorph();
EndPhase(PHASE_MORPH_END);
/* GS security checks for unsafe buffers */
if (getNeedsGSSecurityCookie())
{
#ifdef DEBUG
if (verbose)
{
printf("\n*************** -GS checks for unsafe buffers \n");
}
#endif
gsGSChecksInitCookie();
if (compGSReorderStackLayout)
{
gsCopyShadowParams();
}
#ifdef DEBUG
if (verbose)
{
fgDispBasicBlocks(true);
printf("\n");
}
#endif
}
EndPhase(PHASE_GS_COOKIE);
/* Compute bbNum, bbRefs and bbPreds */
JITDUMP("\nRenumbering the basic blocks for fgComputePred\n");
fgRenumberBlocks();
noway_assert(!fgComputePredsDone); // This is the first time full (not cheap) preds will be computed.
fgComputePreds();
EndPhase(PHASE_COMPUTE_PREDS);
/* If we need to emit GC Poll calls, mark the blocks that need them now. This is conservative and can
* be optimized later. */
fgMarkGCPollBlocks();
EndPhase(PHASE_MARK_GC_POLL_BLOCKS);
/* From this point on the flowgraph information such as bbNum,
* bbRefs or bbPreds has to be kept updated */
// Compute the edge weights (if we have profile data)
fgComputeEdgeWeights();
EndPhase(PHASE_COMPUTE_EDGE_WEIGHTS);
#if FEATURE_EH_FUNCLETS
/* Create funclets from the EH handlers. */
fgCreateFunclets();
EndPhase(PHASE_CREATE_FUNCLETS);
#endif // FEATURE_EH_FUNCLETS
if (!opts.MinOpts() && !opts.compDbgCode)
{
optOptimizeLayout();
EndPhase(PHASE_OPTIMIZE_LAYOUT);
// Compute reachability sets and dominators.
fgComputeReachability();
}
// Transform each GT_ALLOCOBJ node into either an allocation helper call or
// local variable allocation on the stack.
ObjectAllocator objectAllocator(this);
objectAllocator.Run();
if (!opts.MinOpts() && !opts.compDbgCode)
{
/* Perform loop inversion (i.e. transform "while" loops into
"repeat" loops) and discover and classify natural loops
(e.g. mark iterative loops as such). Also marks loop blocks
and sets bbWeight to the loop nesting levels
*/
optOptimizeLoops();
EndPhase(PHASE_OPTIMIZE_LOOPS);
// Clone loops with optimization opportunities, and
// choose the one based on dynamic condition evaluation.
optCloneLoops();
EndPhase(PHASE_CLONE_LOOPS);
/* Unroll loops */
optUnrollLoops();
EndPhase(PHASE_UNROLL_LOOPS);
}
#ifdef DEBUG
fgDebugCheckLinks();
#endif
/* Create the variable table (and compute variable ref counts) */
lvaMarkLocalVars();
EndPhase(PHASE_MARK_LOCAL_VARS);
// IMPORTANT, after this point, every place where trees are modified or cloned
// the local variable reference counts must be updated
// You can test the value of the following variable to see if
// the local variable ref counts must be updated
//
assert(lvaLocalVarRefCounted == true);
if (!opts.MinOpts() && !opts.compDbgCode)
{
/* Optimize boolean conditions */
optOptimizeBools();
EndPhase(PHASE_OPTIMIZE_BOOLS);
// optOptimizeBools() might have changed the number of blocks; the dominators/reachability might be bad.
}
/* Figure out the order in which operators are to be evaluated */
fgFindOperOrder();
EndPhase(PHASE_FIND_OPER_ORDER);
// Weave the tree lists. Anyone who modifies the tree shapes after
// this point is responsible for calling fgSetStmtSeq() to keep the
// nodes properly linked.
// This can create GC poll calls, and create new BasicBlocks (without updating dominators/reachability).
fgSetBlockOrder();
EndPhase(PHASE_SET_BLOCK_ORDER);
// IMPORTANT, after this point, every place where tree topology changes must redo evaluation
// order (gtSetStmtInfo) and relink nodes (fgSetStmtSeq) if required.
CLANG_FORMAT_COMMENT_ANCHOR;
#ifdef DEBUG
// Now we have determined the order of evaluation and the gtCosts for every node.
// If verbose, dump the full set of trees here before the optimization phases mutate them
//
if (verbose)
{
fgDispBasicBlocks(true); // 'true' will call fgDumpTrees() after dumping the BasicBlocks
printf("\n");
}
#endif
// At this point we know if we are fully interruptible or not
if (!opts.MinOpts() && !opts.compDbgCode)
{
bool doSsa = true;
bool doEarlyProp = true;
bool doValueNum = true;
bool doLoopHoisting = true;
bool doCopyProp = true;
bool doAssertionProp = true;
bool doRangeAnalysis = true;
int iterations = 1;
#if defined(OPT_CONFIG)
doSsa = (JitConfig.JitDoSsa() != 0);
doEarlyProp = doSsa && (JitConfig.JitDoEarlyProp() != 0);
doValueNum = doSsa && (JitConfig.JitDoValueNumber() != 0);
doLoopHoisting = doValueNum && (JitConfig.JitDoLoopHoisting() != 0);
doCopyProp = doValueNum && (JitConfig.JitDoCopyProp() != 0);
doAssertionProp = doValueNum && (JitConfig.JitDoAssertionProp() != 0);
doRangeAnalysis = doAssertionProp && (JitConfig.JitDoRangeAnalysis() != 0);
if (opts.optRepeat)
{
iterations = JitConfig.JitOptRepeatCount();
}
#endif // defined(OPT_CONFIG)
while (iterations > 0)
{
if (doSsa)
{
fgSsaBuild();
EndPhase(PHASE_BUILD_SSA);
}
if (doEarlyProp)
{
/* Propagate array length and rewrite getType() method call */
optEarlyProp();
EndPhase(PHASE_EARLY_PROP);
}
if (doValueNum)
{
fgValueNumber();
EndPhase(PHASE_VALUE_NUMBER);
}
if (doLoopHoisting)
{
/* Hoist invariant code out of loops */
optHoistLoopCode();
EndPhase(PHASE_HOIST_LOOP_CODE);
}
if (doCopyProp)
{
/* Perform VN based copy propagation */
optVnCopyProp();
EndPhase(PHASE_VN_COPY_PROP);
}
#if FEATURE_ANYCSE
/* Remove common sub-expressions */
optOptimizeCSEs();
#endif // FEATURE_ANYCSE
#if ASSERTION_PROP
if (doAssertionProp)
{
/* Assertion propagation */
optAssertionPropMain();
EndPhase(PHASE_ASSERTION_PROP_MAIN);
}
if (doRangeAnalysis)
{
/* Optimize array index range checks */
RangeCheck rc(this);
rc.OptimizeRangeChecks();
EndPhase(PHASE_OPTIMIZE_INDEX_CHECKS);
}
#endif // ASSERTION_PROP
/* update the flowgraph if we modified it during the optimization phase*/
if (fgModified)
{
fgUpdateFlowGraph();
EndPhase(PHASE_UPDATE_FLOW_GRAPH);
// Recompute the edge weight if we have modified the flow graph
fgComputeEdgeWeights();
EndPhase(PHASE_COMPUTE_EDGE_WEIGHTS2);
}
// Iterate if requested, resetting annotations first.
if (--iterations == 0)
{
break;
}
ResetOptAnnotations();
RecomputeLoopInfo();
}
}
#ifdef _TARGET_AMD64_
// Check if we need to add the Quirk for the PPP backward compat issue
compQuirkForPPPflag = compQuirkForPPP();
#endif
fgDetermineFirstColdBlock();
EndPhase(PHASE_DETERMINE_FIRST_COLD_BLOCK);
#ifdef DEBUG
fgDebugCheckLinks(compStressCompile(STRESS_REMORPH_TREES, 50));
// Stash the current estimate of the function's size if necessary.
if (verbose)
{
compSizeEstimate = 0;
compCycleEstimate = 0;
for (BasicBlock* block = fgFirstBB; block != nullptr; block = block->bbNext)
{
for (GenTreeStmt* stmt = block->firstStmt(); stmt != nullptr; stmt = stmt->getNextStmt())
{
compSizeEstimate += stmt->GetCostSz();
compCycleEstimate += stmt->GetCostEx();
}
}
}
#endif
#ifndef LEGACY_BACKEND
// rationalize trees
Rationalizer rat(this); // PHASE_RATIONALIZE
rat.Run();
#endif // !LEGACY_BACKEND
// Here we do "simple lowering". When the RyuJIT backend works for all
// platforms, this will be part of the more general lowering phase. For now, though, we do a separate
// pass of "final lowering." We must do this before (final) liveness analysis, because this creates
// range check throw blocks, in which the liveness must be correct.
fgSimpleLowering();
EndPhase(PHASE_SIMPLE_LOWERING);
#ifdef LEGACY_BACKEND
/* Local variable liveness */
fgLocalVarLiveness();
EndPhase(PHASE_LCLVARLIVENESS);
#endif // !LEGACY_BACKEND
#ifdef DEBUG
fgDebugCheckBBlist();
fgDebugCheckLinks();
#endif
/* Enable this to gather statistical data such as
* call and register argument info, flowgraph and loop info, etc. */
compJitStats();
#ifdef _TARGET_ARM_
if (compLocallocUsed)
{
// We reserve REG_SAVED_LOCALLOC_SP to store SP on entry for stack unwinding
codeGen->regSet.rsMaskResvd |= RBM_SAVED_LOCALLOC_SP;
}
#endif // _TARGET_ARM_
#ifdef _TARGET_ARMARCH_
if (compRsvdRegCheck(PRE_REGALLOC_FRAME_LAYOUT))
{
// We reserve R10/IP1 in this case to hold the offsets in load/store instructions
codeGen->regSet.rsMaskResvd |= RBM_OPT_RSVD;
assert(REG_OPT_RSVD != REG_FP);
}
// compRsvdRegCheck() has read out the FramePointerUsed property, but doLinearScan()
// tries to overwrite it later. This violates the PhasedVar rule and triggers an assertion.
// TODO-ARM-Bug?: What is the proper way to handle this situation?
codeGen->resetFramePointerUsedWritePhase();
#ifdef DEBUG
//
// Display the pre-regalloc frame offsets that we have tentatively decided upon
//
if (verbose)
lvaTableDump();
#endif
#endif // _TARGET_ARMARCH_
/* Assign registers to variables, etc. */
CLANG_FORMAT_COMMENT_ANCHOR;
#ifndef LEGACY_BACKEND
///////////////////////////////////////////////////////////////////////////////
// Dominator and reachability sets are no longer valid. They haven't been
// maintained up to here, and shouldn't be used (unless recomputed).
///////////////////////////////////////////////////////////////////////////////
fgDomsComputed = false;
/* Create LSRA before Lowering, this way Lowering can initialize the TreeNode Map */
m_pLinearScan = getLinearScanAllocator(this);
/* Lower */
Lowering lower(this, m_pLinearScan); // PHASE_LOWERING
lower.Run();
assert(lvaSortAgain == false); // We should have re-run fgLocalVarLiveness() in lower.Run()
lvaTrackedFixed = true; // We can not add any new tracked variables after this point.
/* Now that lowering is completed we can proceed to perform register allocation */
m_pLinearScan->doLinearScan();
EndPhase(PHASE_LINEAR_SCAN);
// Copied from rpPredictRegUse()
genFullPtrRegMap = (codeGen->genInterruptible || !codeGen->isFramePointerUsed());
#else // LEGACY_BACKEND
lvaTrackedFixed = true; // We cannot add any new tracked variables after this point.
// For the classic JIT32 at this point lvaSortAgain can be set and raAssignVars() will call lvaSortOnly()
// Now do "classic" register allocation.
raAssignVars();
EndPhase(PHASE_RA_ASSIGN_VARS);
#endif // LEGACY_BACKEND
#ifdef DEBUG
fgDebugCheckLinks();
#endif
/* Generate code */
codeGen->genGenerateCode(methodCodePtr, methodCodeSize);
#ifdef FEATURE_JIT_METHOD_PERF
if (pCompJitTimer)
{
#if MEASURE_CLRAPI_CALLS
EndPhase(PHASE_CLR_API);
#endif
pCompJitTimer->Terminate(this, CompTimeSummaryInfo::s_compTimeSummary, true);
}
#endif
RecordStateAtEndOfCompilation();
#ifdef FEATURE_TRACELOGGING
compJitTelemetry.NotifyEndOfCompilation();
#endif
#if defined(DEBUG)
++Compiler::jitTotalMethodCompiled;
#endif // defined(DEBUG)
compFunctionTraceEnd(*methodCodePtr, *methodCodeSize, false);
#if FUNC_INFO_LOGGING
if (compJitFuncInfoFile != nullptr)
{
assert(!compIsForInlining());
#ifdef DEBUG // We only have access to info.compFullName in DEBUG builds.
fprintf(compJitFuncInfoFile, "%s\n", info.compFullName);
#elif FEATURE_SIMD
fprintf(compJitFuncInfoFile, " %s\n", eeGetMethodFullName(info.compMethodHnd));
#endif
fprintf(compJitFuncInfoFile, ""); // in our logic this causes a flush
}
#endif // FUNC_INFO_LOGGING
}
//------------------------------------------------------------------------
// ResetOptAnnotations: Clear annotations produced during global optimizations.
//
// Notes:
// The intent of this method is to clear any information typically assumed
// to be set only once; it is used between iterations when JitOptRepeat is
// in effect.
void Compiler::ResetOptAnnotations()
{
assert(opts.optRepeat);
assert(JitConfig.JitOptRepeatCount() > 0);
fgResetForSsa();
vnStore = nullptr;
m_opAsgnVarDefSsaNums = nullptr;
m_blockToEHPreds = nullptr;
fgSsaPassesCompleted = 0;
fgVNPassesCompleted = 0;
for (BasicBlock* block = fgFirstBB; block != nullptr; block = block->bbNext)
{
for (GenTreeStmt* stmt = block->firstStmt(); stmt != nullptr; stmt = stmt->getNextStmt())
{
stmt->gtFlags &= ~GTF_STMT_HAS_CSE;
for (GenTreePtr tree = stmt->gtStmt.gtStmtList; tree != nullptr; tree = tree->gtNext)
{
tree->ClearVN();
tree->ClearAssertion();
tree->gtCSEnum = NO_CSE;
}
}
}
}
//------------------------------------------------------------------------
// RecomputeLoopInfo: Recompute loop annotations between opt-repeat iterations.
//
// Notes:
// The intent of this method is to update loop structure annotations, and those
// they depend on; these annotations may have become stale during optimization,
// and need to be up-to-date before running another iteration of optimizations.
void Compiler::RecomputeLoopInfo()
{
assert(opts.optRepeat);
assert(JitConfig.JitOptRepeatCount() > 0);
// Recompute reachability sets, dominators, and loops.
optLoopCount = 0;
fgDomsComputed = false;
for (BasicBlock* block = fgFirstBB; block != nullptr; block = block->bbNext)
{
block->bbFlags &= ~BBF_LOOP_FLAGS;
}
fgComputeReachability();
// Rebuild the loop tree annotations themselves. Since this is performed as
// part of 'optOptimizeLoops', this will also re-perform loop rotation, but
// not other optimizations, as the others are not part of 'optOptimizeLoops'.
optOptimizeLoops();
}
/*****************************************************************************/
void Compiler::ProcessShutdownWork(ICorStaticInfo* statInfo)
{
}
#ifdef _TARGET_AMD64_
// Check if we need to add the Quirk for the PPP backward compat issue.
// This Quirk addresses a compatibility issue between the new RyuJit and the previous JIT64.
// A backward compatibity issue called 'PPP' exists where a PInvoke call passes a 32-byte struct
// into a native API which basically writes 48 bytes of data into the struct.
// With the stack frame layout used by the RyuJIT the extra 16 bytes written corrupts a
// caller saved register and this leads to an A/V in the calling method.
// The older JIT64 jit compiler just happened to have a different stack layout and/or
// caller saved register set so that it didn't hit the A/V in the caller.
// By increasing the amount of stack allocted for the struct by 32 bytes we can fix this.
//
// Return true if we actually perform the Quirk, otherwise return false
//
bool Compiler::compQuirkForPPP()
{
if (lvaCount != 2)
{ // We require that there are exactly two locals
return false;
}
if (compTailCallUsed)
{ // Don't try this quirk if a tail call was used
return false;
}
bool hasOutArgs = false;
LclVarDsc* varDscExposedStruct = nullptr;
unsigned lclNum;
LclVarDsc* varDsc;
/* Look for struct locals that are address taken */
for (lclNum = 0, varDsc = lvaTable; lclNum < lvaCount; lclNum++, varDsc++)
{
if (varDsc->lvIsParam) // It can't be a parameter
{
continue;
}
// We require that the OutgoingArg space lclVar exists
if (lclNum == lvaOutgoingArgSpaceVar)
{
hasOutArgs = true; // Record that we saw it
continue;
}
// Look for a 32-byte address exposed Struct and record its varDsc
if ((varDsc->TypeGet() == TYP_STRUCT) && varDsc->lvAddrExposed && (varDsc->lvExactSize == 32))
{
varDscExposedStruct = varDsc;
}
}
// We only perform the Quirk when there are two locals
// one of them is a address exposed struct of size 32
// and the other is the outgoing arg space local
//
if (hasOutArgs && (varDscExposedStruct != nullptr))
{
#ifdef DEBUG
if (verbose)
{
printf("\nAdding a backwards compatibility quirk for the 'PPP' issue\n");
}
#endif // DEBUG
// Increase the exact size of this struct by 32 bytes
// This fixes the PPP backward compat issue
varDscExposedStruct->lvExactSize += 32;
return true;
}
return false;
}
#endif // _TARGET_AMD64_
/*****************************************************************************/
#ifdef DEBUG
void* forceFrameJIT; // used to force to frame &useful for fastchecked debugging
bool Compiler::skipMethod()
{
static ConfigMethodRange fJitRange;
fJitRange.EnsureInit(JitConfig.JitRange());
assert(!fJitRange.Error());
// Normally JitConfig.JitRange() is null, we don't want to skip
// jitting any methods.
//
// So, the logic below relies on the fact that a null range string
// passed to ConfigMethodRange represents the set of all methods.
if (!fJitRange.Contains(info.compCompHnd, info.compMethodHnd))
{
return true;
}
if (JitConfig.JitExclude().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
return true;
}
if (!JitConfig.JitInclude().isEmpty() &&
!JitConfig.JitInclude().contains(info.compMethodName, info.compClassName, &info.compMethodInfo->args))
{
return true;
}
return false;
}
#endif
/*****************************************************************************/
int Compiler::compCompile(CORINFO_METHOD_HANDLE methodHnd,
CORINFO_MODULE_HANDLE classPtr,
COMP_HANDLE compHnd,
CORINFO_METHOD_INFO* methodInfo,
void** methodCodePtr,
ULONG* methodCodeSize,
JitFlags* compileFlags)
{
#ifdef FEATURE_JIT_METHOD_PERF
static bool checkedForJitTimeLog = false;
pCompJitTimer = nullptr;
if (!checkedForJitTimeLog)
{
// Call into VM to get the config strings. FEATURE_JIT_METHOD_PERF is enabled for
// retail builds. Do not call the regular Config helper here as it would pull
// in a copy of the config parser into the clrjit.dll.
InterlockedCompareExchangeT(&Compiler::compJitTimeLogFilename, compHnd->getJitTimeLogFilename(), NULL);
// At a process or module boundary clear the file and start afresh.
JitTimer::PrintCsvHeader();
checkedForJitTimeLog = true;
}
if ((Compiler::compJitTimeLogFilename != nullptr) || (JitTimeLogCsv() != nullptr))
{
pCompJitTimer = JitTimer::Create(this, methodInfo->ILCodeSize);
}
#endif // FEATURE_JIT_METHOD_PERF
#ifdef DEBUG
Compiler* me = this;
forceFrameJIT = (void*)&me; // let us see the this pointer in fastchecked build
// set this early so we can use it without relying on random memory values
verbose = compIsForInlining() ? impInlineInfo->InlinerCompiler->verbose : false;
this->dumpIR = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIR : false;
this->dumpIRPhase = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRPhase : nullptr;
this->dumpIRFormat = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRFormat : nullptr;
this->dumpIRTypes = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRTypes : false;
this->dumpIRLocals = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRLocals : false;
this->dumpIRRegs = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRRegs : false;
this->dumpIRSsa = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRSsa : false;
this->dumpIRValnums = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRValnums : false;
this->dumpIRCosts = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRCosts : false;
this->dumpIRFlags = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRFlags : false;
this->dumpIRKinds = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRKinds : false;
this->dumpIRNodes = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRNodes : false;
this->dumpIRNoLists = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRNoLists : false;
this->dumpIRNoLeafs = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRNoLeafs : false;
this->dumpIRNoStmts = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRNoStmts : false;
this->dumpIRTrees = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRTrees : false;
this->dumpIRLinear = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRLinear : false;
this->dumpIRDataflow = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRDataflow : false;
this->dumpIRBlockHeaders = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRBlockHeaders : NULL;
this->dumpIRExit = compIsForInlining() ? impInlineInfo->InlinerCompiler->dumpIRExit : NULL;
#endif
#if defined(DEBUG) || defined(INLINE_DATA)
info.compMethodHashPrivate = 0;
#endif // defined(DEBUG) || defined(INLINE_DATA)
#if FUNC_INFO_LOGGING
LPCWSTR tmpJitFuncInfoFilename = JitConfig.JitFuncInfoFile();
if (tmpJitFuncInfoFilename != nullptr)
{
LPCWSTR oldFuncInfoFileName =
InterlockedCompareExchangeT(&compJitFuncInfoFilename, tmpJitFuncInfoFilename, NULL);
if (oldFuncInfoFileName == nullptr)
{
assert(compJitFuncInfoFile == nullptr);
compJitFuncInfoFile = _wfopen(compJitFuncInfoFilename, W("a"));
if (compJitFuncInfoFile == nullptr)
{
#if defined(DEBUG) && !defined(FEATURE_PAL) // no 'perror' in the PAL
perror("Failed to open JitFuncInfoLogFile");
#endif // defined(DEBUG) && !defined(FEATURE_PAL)
}
}
}
#endif // FUNC_INFO_LOGGING
// if (s_compMethodsCount==0) setvbuf(jitstdout, NULL, _IONBF, 0);
info.compCompHnd = compHnd;
info.compMethodHnd = methodHnd;
info.compMethodInfo = methodInfo;
// Do we have a matched VM? Or are we "abusing" the VM to help us do JIT work (such as using an x86 native VM
// with an ARM-targeting "altjit").
info.compMatchedVM = IMAGE_FILE_MACHINE_TARGET == info.compCompHnd->getExpectedTargetArchitecture();
#if (defined(_TARGET_UNIX_) && !defined(_HOST_UNIX_)) || (!defined(_TARGET_UNIX_) && defined(_HOST_UNIX_))
// The host and target platforms don't match. This info isn't handled by the existing
// getExpectedTargetArchitecture() JIT-EE interface method.
info.compMatchedVM = false;
#endif
compMaxUncheckedOffsetForNullObject = eeGetEEInfo()->maxUncheckedOffsetForNullObject;
// Set the context for token lookup.
if (compIsForInlining())
{
impTokenLookupContextHandle = impInlineInfo->tokenLookupContextHandle;
assert(impInlineInfo->inlineCandidateInfo->clsHandle == compHnd->getMethodClass(methodHnd));
info.compClassHnd = impInlineInfo->inlineCandidateInfo->clsHandle;
assert(impInlineInfo->inlineCandidateInfo->clsAttr == info.compCompHnd->getClassAttribs(info.compClassHnd));
// printf("%x != %x\n", impInlineInfo->inlineCandidateInfo->clsAttr,
// info.compCompHnd->getClassAttribs(info.compClassHnd));
info.compClassAttr = impInlineInfo->inlineCandidateInfo->clsAttr;
}
else
{
impTokenLookupContextHandle = MAKE_METHODCONTEXT(info.compMethodHnd);
info.compClassHnd = compHnd->getMethodClass(methodHnd);
info.compClassAttr = info.compCompHnd->getClassAttribs(info.compClassHnd);
}
info.compProfilerCallback = false; // Assume false until we are told to hook this method.
#if defined(DEBUG) || defined(LATE_DISASM)
const char* classNamePtr;
info.compMethodName = eeGetMethodName(methodHnd, &classNamePtr);
unsigned len = (unsigned)roundUp(strlen(classNamePtr) + 1);
info.compClassName = (char*)compGetMem(len, CMK_DebugOnly);
strcpy_s((char*)info.compClassName, len, classNamePtr);
info.compFullName = eeGetMethodFullName(methodHnd);
#endif // defined(DEBUG) || defined(LATE_DISASM)
#ifdef DEBUG
if (!compIsForInlining())
{
JitTls::GetLogEnv()->setCompiler(this);
}
// Have we been told to be more selective in our Jitting?
if (skipMethod())
{
if (compIsForInlining())
{
compInlineResult->NoteFatal(InlineObservation::CALLEE_MARKED_AS_SKIPPED);
}
return CORJIT_SKIPPED;
}
// Opt-in to jit stress based on method hash ranges.
//
// Note the default (with JitStressRange not set) is that all
// methods will be subject to stress.
static ConfigMethodRange fJitStressRange;
fJitStressRange.EnsureInit(JitConfig.JitStressRange());
assert(!fJitStressRange.Error());
bRangeAllowStress = fJitStressRange.Contains(info.compCompHnd, info.compMethodHnd);
#endif // DEBUG
// Set this before the first 'BADCODE'
// Skip verification where possible
tiVerificationNeeded = !compileFlags->IsSet(JitFlags::JIT_FLAG_SKIP_VERIFICATION);
assert(!compIsForInlining() || !tiVerificationNeeded); // Inlinees must have been verified.
// assume the code is verifiable unless proven otherwise
tiIsVerifiableCode = TRUE;
tiRuntimeCalloutNeeded = false;
CorInfoInstantiationVerification instVerInfo = INSTVER_GENERIC_PASSED_VERIFICATION;
if (!compIsForInlining() && tiVerificationNeeded)
{
instVerInfo = compHnd->isInstantiationOfVerifiedGeneric(methodHnd);
if (tiVerificationNeeded && (instVerInfo == INSTVER_GENERIC_FAILED_VERIFICATION))
{
CorInfoCanSkipVerificationResult canSkipVerificationResult =
info.compCompHnd->canSkipMethodVerification(info.compMethodHnd);
switch (canSkipVerificationResult)
{
case CORINFO_VERIFICATION_CANNOT_SKIP:
// We cannot verify concrete instantiation.
// We can only verify the typical/open instantiation
// The VM should throw a VerificationException instead of allowing this.
NO_WAY("Verification of closed instantiations is not supported");
break;
case CORINFO_VERIFICATION_CAN_SKIP:
// The VM should first verify the open instantiation. If unverifiable code
// is detected, it should pass in JitFlags::JIT_FLAG_SKIP_VERIFICATION.
assert(!"The VM should have used JitFlags::JIT_FLAG_SKIP_VERIFICATION");
tiVerificationNeeded = false;
break;
case CORINFO_VERIFICATION_RUNTIME_CHECK:
// This is a concrete generic instantiation with unverifiable code, that also
// needs a runtime callout.
tiVerificationNeeded = false;
tiRuntimeCalloutNeeded = true;
break;
case CORINFO_VERIFICATION_DONT_JIT:
// We cannot verify concrete instantiation.
// We can only verify the typical/open instantiation
// The VM should throw a VerificationException instead of allowing this.
BADCODE("NGEN of unverifiable transparent code is not supported");
break;
}
}
// load any constraints for verification, noting any cycles to be rejected by the verifying importer
if (tiVerificationNeeded)
{
compHnd->initConstraintsForVerification(methodHnd, &info.hasCircularClassConstraints,
&info.hasCircularMethodConstraints);
}
}
/* Setup an error trap */
struct Param
{
Compiler* pThis;
CORINFO_MODULE_HANDLE classPtr;
COMP_HANDLE compHnd;
CORINFO_METHOD_INFO* methodInfo;
void** methodCodePtr;
ULONG* methodCodeSize;
JitFlags* compileFlags;
CorInfoInstantiationVerification instVerInfo;
int result;
} param;
param.pThis = this;
param.classPtr = classPtr;
param.compHnd = compHnd;
param.methodInfo = methodInfo;
param.methodCodePtr = methodCodePtr;
param.methodCodeSize = methodCodeSize;
param.compileFlags = compileFlags;
param.instVerInfo = instVerInfo;
param.result = CORJIT_INTERNALERROR;
setErrorTrap(compHnd, Param*, pParam, ¶m) // ERROR TRAP: Start normal block
{
pParam->result = pParam->pThis->compCompileHelper(pParam->classPtr, pParam->compHnd, pParam->methodInfo,
pParam->methodCodePtr, pParam->methodCodeSize,
pParam->compileFlags, pParam->instVerInfo);
}
finallyErrorTrap() // ERROR TRAP: The following block handles errors
{
/* Cleanup */
if (compIsForInlining())
{
goto DoneCleanUp;
}
/* Tell the emitter that we're done with this function */
genEmitter->emitEndCG();
DoneCleanUp:
compDone();
}
endErrorTrap() // ERROR TRAP: End
return param.result;
}
#if defined(DEBUG) || defined(INLINE_DATA)
unsigned Compiler::Info::compMethodHash() const
{
if (compMethodHashPrivate == 0)
{
compMethodHashPrivate = compCompHnd->getMethodHash(compMethodHnd);
}
return compMethodHashPrivate;
}
#endif // defined(DEBUG) || defined(INLINE_DATA)
void Compiler::compCompileFinish()
{
#if defined(DEBUG) || MEASURE_NODE_SIZE || MEASURE_BLOCK_SIZE || DISPLAY_SIZES || CALL_ARG_STATS
genMethodCnt++;
#endif
#if MEASURE_MEM_ALLOC
{
// Grab the relevant lock.
CritSecHolder statsLock(s_memStatsLock);
// Make the updates.
genMemStats.nraTotalSizeAlloc = compGetAllocator()->getTotalBytesAllocated();
genMemStats.nraTotalSizeUsed = compGetAllocator()->getTotalBytesUsed();
memAllocHist.record((unsigned)((genMemStats.nraTotalSizeAlloc + 1023) / 1024));
memUsedHist.record((unsigned)((genMemStats.nraTotalSizeUsed + 1023) / 1024));
s_aggMemStats.Add(genMemStats);
if (genMemStats.allocSz > s_maxCompMemStats.allocSz)
{
s_maxCompMemStats = genMemStats;
}
}
#ifdef DEBUG
if (s_dspMemStats || verbose)
{
printf("\nAllocations for %s (MethodHash=%08x)\n", info.compFullName, info.compMethodHash());
genMemStats.Print(jitstdout);
}
#endif // DEBUG
#endif // MEASURE_MEM_ALLOC
#if LOOP_HOIST_STATS
AddLoopHoistStats();
#endif // LOOP_HOIST_STATS
#if MEASURE_NODE_SIZE
genTreeNcntHist.record(static_cast<unsigned>(genNodeSizeStatsPerFunc.genTreeNodeCnt));
genTreeNsizHist.record(static_cast<unsigned>(genNodeSizeStatsPerFunc.genTreeNodeSize));
#endif
#if defined(DEBUG)
// Small methods should fit in ArenaAllocator::getDefaultPageSize(), or else
// we should bump up ArenaAllocator::getDefaultPageSize()
if ((info.compILCodeSize <= 32) && // Is it a reasonably small method?
(info.compNativeCodeSize < 512) && // Some trivial methods generate huge native code. eg. pushing a single huge
// struct
(impInlinedCodeSize <= 128) && // Is the the inlining reasonably bounded?
// Small methods cannot meaningfully have a big number of locals
// or arguments. We always track arguments at the start of
// the prolog which requires memory
(info.compLocalsCount <= 32) && (!opts.MinOpts()) && // We may have too many local variables, etc
(getJitStressLevel() == 0) && // We need extra memory for stress
!opts.optRepeat && // We need extra memory to repeat opts
!compAllocator->bypassHostAllocator() && // ArenaAllocator::getDefaultPageSize() is artificially low for
// DirectAlloc
(compAllocator->getTotalBytesAllocated() > (2 * ArenaAllocator::getDefaultPageSize())) &&
// Factor of 2x is because data-structures are bigger under DEBUG
#ifndef LEGACY_BACKEND
// RyuJIT backend needs memory tuning! TODO-Cleanup: remove this case when memory tuning is complete.
(compAllocator->getTotalBytesAllocated() > (10 * ArenaAllocator::getDefaultPageSize())) &&
#endif
!verbose) // We allocate lots of memory to convert sets to strings for JitDump
{
genSmallMethodsNeedingExtraMemoryCnt++;
// Less than 1% of all methods should run into this.
// We cannot be more strict as there are always degenerate cases where we
// would need extra memory (like huge structs as locals - see lvaSetStruct()).
assert((genMethodCnt < 500) || (genSmallMethodsNeedingExtraMemoryCnt < (genMethodCnt / 100)));
}
#endif // DEBUG
#if defined(DEBUG) || defined(INLINE_DATA)
m_inlineStrategy->DumpData();
m_inlineStrategy->DumpXml();
#endif
#ifdef DEBUG
if (opts.dspOrder)
{
// mdMethodDef __stdcall CEEInfo::getMethodDefFromMethod(CORINFO_METHOD_HANDLE hMethod)
mdMethodDef currentMethodToken = info.compCompHnd->getMethodDefFromMethod(info.compMethodHnd);
unsigned profCallCount = 0;
if (opts.jitFlags->IsSet(JitFlags::JIT_FLAG_BBOPT) && fgHaveProfileData())
{
assert(fgProfileBuffer[0].ILOffset == 0);
profCallCount = fgProfileBuffer[0].ExecutionCount;
}
static bool headerPrinted = false;
if (!headerPrinted)
{
// clang-format off
headerPrinted = true;
printf(" | Profiled | Exec- | Method has | calls | Num |LclV |AProp| CSE | Reg |bytes | %3s code size | \n", Target::g_tgtCPUName);
printf(" mdToken | | RGN | Count | EH | FRM | LOOP | NRM | IND | BBs | Cnt | Cnt | Cnt | Alloc | IL | HOT | COLD | method name \n");
printf("---------+-----+------+----------+----+-----+------+-----+-----+-----+-----+-----+-----+---------+------+-------+-------+-----------\n");
// 06001234 | PRF | HOT | 219 | EH | ebp | LOOP | 15 | 6 | 12 | 17 | 12 | 8 | 28 p2 | 145 | 211 | 123 | System.Example(int)
// clang-format on
}
printf("%08X | ", currentMethodToken);
CorInfoRegionKind regionKind = info.compMethodInfo->regionKind;
if (opts.altJit)
{
printf("ALT | ");
}
else if (fgHaveProfileData())
{
printf("PRF | ");
}
else
{
printf(" | ");
}
if (regionKind == CORINFO_REGION_NONE)
{
printf(" | ");
}
else if (regionKind == CORINFO_REGION_HOT)
{
printf(" HOT | ");
}
else if (regionKind == CORINFO_REGION_COLD)
{
printf("COLD | ");
}
else if (regionKind == CORINFO_REGION_JIT)
{
printf(" JIT | ");
}
else
{
printf("UNKN | ");
}
printf("%8d | ", profCallCount);
if (compHndBBtabCount > 0)
{
printf("EH | ");
}
else
{
printf(" | ");
}
if (rpFrameType == FT_EBP_FRAME)
{
printf("%3s | ", STR_FPBASE);
}
else if (rpFrameType == FT_ESP_FRAME)
{
printf("%3s | ", STR_SPBASE);
}
#if DOUBLE_ALIGN
else if (rpFrameType == FT_DOUBLE_ALIGN_FRAME)
{
printf("dbl | ");
}
#endif
else // (rpFrameType == FT_NOT_SET)
{
printf("??? | ");
}
if (fgHasLoops)
{
printf("LOOP |");
}
else
{
printf(" |");
}
printf(" %3d |", optCallCount);
printf(" %3d |", optIndirectCallCount);
printf(" %3d |", fgBBcountAtCodegen);
printf(" %3d |", lvaCount);
if (opts.MinOpts())
{
printf(" MinOpts |");
}
else
{
printf(" %3d |", optAssertionCount);
#if FEATURE_ANYCSE
printf(" %3d |", optCSEcount);
#else
printf(" %3d |", 0);
#endif // FEATURE_ANYCSE
}
#ifndef LEGACY_BACKEND
printf(" LSRA |"); // TODO-Cleanup: dump some interesting LSRA stat into the order file?
#else // LEGACY_BACKEND
printf("%s%4d p%1d |", (tmpCount > 0) ? "T" : " ", rpStkPredict / BB_UNITY_WEIGHT, rpPasses);
#endif // LEGACY_BACKEND
printf(" %4d |", info.compMethodInfo->ILCodeSize);
printf(" %5d |", info.compTotalHotCodeSize);
printf(" %5d |", info.compTotalColdCodeSize);
printf(" %s\n", eeGetMethodFullName(info.compMethodHnd));
printf(""); // in our logic this causes a flush
}
if (verbose)
{
printf("****** DONE compiling %s\n", info.compFullName);
printf(""); // in our logic this causes a flush
}
// Only call _DbgBreakCheck when we are jitting, not when we are ngen-ing
// For ngen the int3 or breakpoint instruction will be right at the
// start of the ngen method and we will stop when we execute it.
//
if (!opts.jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
{
if (compJitHaltMethod())
{
#if !defined(_TARGET_ARM64_) && !defined(_HOST_UNIX_)
// TODO-ARM64-NYI: re-enable this when we have an OS that supports a pop-up dialog
// Don't do an assert, but just put up the dialog box so we get just-in-time debugger
// launching. When you hit 'retry' it will continue and naturally stop at the INT 3
// that the JIT put in the code
_DbgBreakCheck(__FILE__, __LINE__, "JitHalt");
#endif
}
}
#endif // DEBUG
}
#ifdef PSEUDORANDOM_NOP_INSERTION
// this is zlib adler32 checksum. source came from windows base
#define BASE 65521L // largest prime smaller than 65536
#define NMAX 5552
// NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1
#define DO1(buf, i) \
{ \
s1 += buf[i]; \
s2 += s1; \
}
#define DO2(buf, i) \
DO1(buf, i); \
DO1(buf, i + 1);
#define DO4(buf, i) \
DO2(buf, i); \
DO2(buf, i + 2);
#define DO8(buf, i) \
DO4(buf, i); \
DO4(buf, i + 4);
#define DO16(buf) \
DO8(buf, 0); \
DO8(buf, 8);
unsigned adler32(unsigned adler, char* buf, unsigned int len)
{
unsigned int s1 = adler & 0xffff;
unsigned int s2 = (adler >> 16) & 0xffff;
int k;
if (buf == NULL)
return 1L;
while (len > 0)
{
k = len < NMAX ? len : NMAX;
len -= k;
while (k >= 16)
{
DO16(buf);
buf += 16;
k -= 16;
}
if (k != 0)
do
{
s1 += *buf++;
s2 += s1;
} while (--k);
s1 %= BASE;
s2 %= BASE;
}
return (s2 << 16) | s1;
}
#endif
unsigned getMethodBodyChecksum(__in_z char* code, int size)
{
#ifdef PSEUDORANDOM_NOP_INSERTION
return adler32(0, code, size);
#else
return 0;
#endif
}
int Compiler::compCompileHelper(CORINFO_MODULE_HANDLE classPtr,
COMP_HANDLE compHnd,
CORINFO_METHOD_INFO* methodInfo,
void** methodCodePtr,
ULONG* methodCodeSize,
JitFlags* compileFlags,
CorInfoInstantiationVerification instVerInfo)
{
CORINFO_METHOD_HANDLE methodHnd = info.compMethodHnd;
info.compCode = methodInfo->ILCode;
info.compILCodeSize = methodInfo->ILCodeSize;
if (info.compILCodeSize == 0)
{
BADCODE("code size is zero");
}
if (compIsForInlining())
{
#ifdef DEBUG
unsigned methAttr_Old = impInlineInfo->inlineCandidateInfo->methAttr;
unsigned methAttr_New = info.compCompHnd->getMethodAttribs(info.compMethodHnd);
unsigned flagsToIgnore = CORINFO_FLG_DONT_INLINE | CORINFO_FLG_FORCEINLINE;
assert((methAttr_Old & (~flagsToIgnore)) == (methAttr_New & (~flagsToIgnore)));
#endif
info.compFlags = impInlineInfo->inlineCandidateInfo->methAttr;
}
else
{
info.compFlags = info.compCompHnd->getMethodAttribs(info.compMethodHnd);
#ifdef PSEUDORANDOM_NOP_INSERTION
info.compChecksum = getMethodBodyChecksum((char*)methodInfo->ILCode, methodInfo->ILCodeSize);
#endif
}
// compInitOptions will set the correct verbose flag.
compInitOptions(compileFlags);
#ifdef ALT_JIT
if (!compIsForInlining() && !opts.altJit)
{
// We're an altjit, but the COMPlus_AltJit configuration did not say to compile this method,
// so skip it.
return CORJIT_SKIPPED;
}
#endif // ALT_JIT
#ifdef DEBUG
if (verbose)
{
printf("IL to import:\n");
dumpILRange(info.compCode, info.compILCodeSize);
}
#endif
// Check for COMPlus_AgressiveInlining
if (JitConfig.JitAggressiveInlining())
{
compDoAggressiveInlining = true;
}
if (compDoAggressiveInlining)
{
info.compFlags |= CORINFO_FLG_FORCEINLINE;
}
#ifdef DEBUG
// Check for ForceInline stress.
if (compStressCompile(STRESS_FORCE_INLINE, 0))
{
info.compFlags |= CORINFO_FLG_FORCEINLINE;
}
if (compIsForInlining())
{
JITLOG((LL_INFO100000, "\nINLINER impTokenLookupContextHandle for %s is 0x%p.\n",
eeGetMethodFullName(info.compMethodHnd), dspPtr(impTokenLookupContextHandle)));
}
// Force verification if asked to do so
if (JitConfig.JitForceVer())
{
tiVerificationNeeded = (instVerInfo == INSTVER_NOT_INSTANTIATION);
}
if (tiVerificationNeeded)
{
JITLOG((LL_INFO10000, "tiVerificationNeeded initially set to true for %s\n", info.compFullName));
}
#endif // DEBUG
/* Since tiVerificationNeeded can be turned off in the middle of
compiling a method, and it might have caused blocks to be queued up
for reimporting, impCanReimport can be used to check for reimporting. */
impCanReimport = (tiVerificationNeeded || compStressCompile(STRESS_CHK_REIMPORT, 15));
// Need security prolog/epilog callouts when there is a declarative security in the method.
tiSecurityCalloutNeeded = ((info.compFlags & CORINFO_FLG_NOSECURITYWRAP) == 0);
if (tiSecurityCalloutNeeded || (info.compFlags & CORINFO_FLG_SECURITYCHECK))
{
// We need to allocate the security object on the stack
// when the method being compiled has a declarative security
// (i.e. when CORINFO_FLG_NOSECURITYWRAP is reset for the current method).
// This is also the case when we inject a prolog and epilog in the method.
opts.compNeedSecurityCheck = true;
}
/* Initialize set a bunch of global values */
info.compScopeHnd = classPtr;
info.compXcptnsCount = methodInfo->EHcount;
info.compMaxStack = methodInfo->maxStack;
compHndBBtab = nullptr;
compHndBBtabCount = 0;
compHndBBtabAllocCount = 0;
info.compNativeCodeSize = 0;
info.compTotalHotCodeSize = 0;
info.compTotalColdCodeSize = 0;
#ifdef DEBUG
compCurBB = nullptr;
lvaTable = nullptr;
// Reset node ID counter
compGenTreeID = 0;
#endif
/* Initialize emitter */
if (!compIsForInlining())
{
codeGen->getEmitter()->emitBegCG(this, compHnd);
}
info.compIsStatic = (info.compFlags & CORINFO_FLG_STATIC) != 0;
info.compIsContextful = (info.compClassAttr & CORINFO_FLG_CONTEXTFUL) != 0;
info.compPublishStubParam = opts.jitFlags->IsSet(JitFlags::JIT_FLAG_PUBLISH_SECRET_PARAM);
switch (methodInfo->args.getCallConv())
{
case CORINFO_CALLCONV_VARARG:
case CORINFO_CALLCONV_NATIVEVARARG:
info.compIsVarArgs = true;
break;
case CORINFO_CALLCONV_DEFAULT:
info.compIsVarArgs = false;
break;
default:
BADCODE("bad calling convention");
}
info.compRetNativeType = info.compRetType = JITtype2varType(methodInfo->args.retType);
info.compCallUnmanaged = 0;
info.compLvFrameListRoot = BAD_VAR_NUM;
info.compInitMem = ((methodInfo->options & CORINFO_OPT_INIT_LOCALS) != 0);
/* Allocate the local variable table */
lvaInitTypeRef();
if (!compIsForInlining())
{
compInitDebuggingInfo();
}
const bool forceInline = !!(info.compFlags & CORINFO_FLG_FORCEINLINE);
if (!compIsForInlining() && opts.jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
{
// We're prejitting the root method. We also will analyze it as
// a potential inline candidate.
InlineResult prejitResult(this, methodHnd, "prejit");
// Do the initial inline screen.
impCanInlineIL(methodHnd, methodInfo, forceInline, &prejitResult);
// Temporarily install the prejitResult as the
// compInlineResult so it's available to fgFindJumpTargets
// and can accumulate more observations as the IL is
// scanned.
//
// We don't pass prejitResult in as a parameter to avoid
// potential aliasing confusion -- the other call to
// fgFindBasicBlocks may have set up compInlineResult and
// the code in fgFindJumpTargets references that data
// member extensively.
assert(compInlineResult == nullptr);
assert(impInlineInfo == nullptr);
compInlineResult = &prejitResult;
// Find the basic blocks. We must do this regardless of
// inlineability, since we are prejitting this method.
//
// This will also update the status of this method as
// an inline candidate.
fgFindBasicBlocks();
// Undo the temporary setup.
assert(compInlineResult == &prejitResult);
compInlineResult = nullptr;
// If still a viable, discretionary inline, assess
// profitability.
if (prejitResult.IsDiscretionaryCandidate())
{
prejitResult.DetermineProfitability(methodInfo);
}
// Handle the results of the inline analysis.
if (prejitResult.IsFailure())
{
// This method is a bad inlinee according to our
// analysis. We will let the InlineResult destructor
// mark it as noinline in the prejit image to save the
// jit some work.
//
// This decision better not be context-dependent.
assert(prejitResult.IsNever());
}
else
{
// This looks like a viable inline candidate. Since
// we're not actually inlining, don't report anything.
prejitResult.SetReported();
}
}
else
{
// We are jitting the root method, or inlining.
fgFindBasicBlocks();
}
// If we're inlining and the candidate is bad, bail out.
if (compDonotInline())
{
goto _Next;
}
compSetOptimizationLevel();
#if COUNT_BASIC_BLOCKS
bbCntTable.record(fgBBcount);
if (fgBBcount == 1)
{
bbOneBBSizeTable.record(methodInfo->ILCodeSize);
}
#endif // COUNT_BASIC_BLOCKS
#ifdef DEBUG
if (verbose)
{
printf("Basic block list for '%s'\n", info.compFullName);
fgDispBasicBlocks();
}
#endif
#ifdef DEBUG
/* Give the function a unique number */
if (opts.disAsm || opts.dspEmit || verbose)
{
s_compMethodsCount = ~info.compMethodHash() & 0xffff;
}
else
{
s_compMethodsCount++;
}
#endif
if (compIsForInlining())
{
compInlineResult->NoteInt(InlineObservation::CALLEE_NUMBER_OF_BASIC_BLOCKS, fgBBcount);
if (compInlineResult->IsFailure())
{
goto _Next;
}
}
#ifdef DEBUG
if (JitConfig.DumpJittedMethods() == 1 && !compIsForInlining())
{
printf("Compiling %4d %s::%s, IL size = %u, hsh=0x%x\n", Compiler::jitTotalMethodCompiled, info.compClassName,
info.compMethodName, info.compILCodeSize, info.compMethodHash());
}
if (compIsForInlining())
{
compGenTreeID = impInlineInfo->InlinerCompiler->compGenTreeID;
}
#endif
compCompile(methodCodePtr, methodCodeSize, compileFlags);
#ifdef DEBUG
if (compIsForInlining())
{
impInlineInfo->InlinerCompiler->compGenTreeID = compGenTreeID;
}
#endif
_Next:
if (compDonotInline())
{
// Verify we have only one inline result in play.
assert(impInlineInfo->inlineResult == compInlineResult);
}
if (!compIsForInlining())
{
compCompileFinish();
// Did we just compile for a target architecture that the VM isn't expecting? If so, the VM
// can't used the generated code (and we better be an AltJit!).
if (!info.compMatchedVM)
{
return CORJIT_SKIPPED;
}
#ifdef ALT_JIT
#ifdef DEBUG
if (JitConfig.RunAltJitCode() == 0)
{
return CORJIT_SKIPPED;
}
#endif // DEBUG
#endif // ALT_JIT
}
/* Success! */
return CORJIT_OK;
}
//------------------------------------------------------------------------
// compFindLocalVarLinear: Linear search for variable's scope containing offset.
//
// Arguments:
// varNum The variable number to search for in the array of scopes.
// offs The offset value which should occur within the life of the variable.
//
// Return Value:
// VarScopeDsc* of a matching variable that contains the offset within its life
// begin and life end or nullptr when there is no match found.
//
// Description:
// Linear search for matching variables with their life begin and end containing
// the offset.
// or NULL if one couldn't be found.
//
// Note:
// Usually called for scope count = 4. Could be called for values upto 8.
//
VarScopeDsc* Compiler::compFindLocalVarLinear(unsigned varNum, unsigned offs)
{
for (unsigned i = 0; i < info.compVarScopesCount; i++)
{
VarScopeDsc* dsc = &info.compVarScopes[i];
if ((dsc->vsdVarNum == varNum) && (dsc->vsdLifeBeg <= offs) && (dsc->vsdLifeEnd > offs))
{
return dsc;
}
}
return nullptr;
}
//------------------------------------------------------------------------
// compFindLocalVar: Search for variable's scope containing offset.
//
// Arguments:
// varNum The variable number to search for in the array of scopes.
// offs The offset value which should occur within the life of the variable.
//
// Return Value:
// VarScopeDsc* of a matching variable that contains the offset within its life
// begin and life end.
// or NULL if one couldn't be found.
//
// Description:
// Linear search for matching variables with their life begin and end containing
// the offset only when the scope count is < MAX_LINEAR_FIND_LCL_SCOPELIST,
// else use the hashtable lookup.
//
VarScopeDsc* Compiler::compFindLocalVar(unsigned varNum, unsigned offs)
{
if (info.compVarScopesCount < MAX_LINEAR_FIND_LCL_SCOPELIST)
{
return compFindLocalVarLinear(varNum, offs);
}
else
{
VarScopeDsc* ret = compFindLocalVar(varNum, offs, offs);
assert(ret == compFindLocalVarLinear(varNum, offs));
return ret;
}
}
//------------------------------------------------------------------------
// compFindLocalVar: Search for variable's scope containing offset.
//
// Arguments:
// varNum The variable number to search for in the array of scopes.
// lifeBeg The life begin of the variable's scope
// lifeEnd The life end of the variable's scope
//
// Return Value:
// VarScopeDsc* of a matching variable that contains the offset within its life
// begin and life end, or NULL if one couldn't be found.
//
// Description:
// Following are the steps used:
// 1. Index into the hashtable using varNum.
// 2. Iterate through the linked list at index varNum to find a matching
// var scope.
//
VarScopeDsc* Compiler::compFindLocalVar(unsigned varNum, unsigned lifeBeg, unsigned lifeEnd)
{
assert(compVarScopeMap != nullptr);
VarScopeMapInfo* info;
if (compVarScopeMap->Lookup(varNum, &info))
{
VarScopeListNode* list = info->head;
while (list != nullptr)
{
if ((list->data->vsdLifeBeg <= lifeBeg) && (list->data->vsdLifeEnd > lifeEnd))
{
return list->data;
}
list = list->next;
}
}
return nullptr;
}
//-------------------------------------------------------------------------
// compInitVarScopeMap: Create a scope map so it can be looked up by varNum
//
// Description:
// Map.K => Map.V :: varNum => List(ScopeDsc)
//
// Create a scope map that can be indexed by varNum and can be iterated
// on it's values to look for matching scope when given an offs or
// lifeBeg and lifeEnd.
//
// Notes:
// 1. Build the map only when we think linear search is slow, i.e.,
// MAX_LINEAR_FIND_LCL_SCOPELIST is large.
// 2. Linked list preserves original array order.
//
void Compiler::compInitVarScopeMap()
{
if (info.compVarScopesCount < MAX_LINEAR_FIND_LCL_SCOPELIST)
{
return;
}
assert(compVarScopeMap == nullptr);
compVarScopeMap = new (getAllocator()) VarNumToScopeDscMap(getAllocator());
// 599 prime to limit huge allocations; for ex: duplicated scopes on single var.
compVarScopeMap->Reallocate(min(info.compVarScopesCount, 599));
for (unsigned i = 0; i < info.compVarScopesCount; ++i)
{
unsigned varNum = info.compVarScopes[i].vsdVarNum;
VarScopeListNode* node = VarScopeListNode::Create(&info.compVarScopes[i], getAllocator());
// Index by varNum and if the list exists append "node" to the "list".
VarScopeMapInfo* info;
if (compVarScopeMap->Lookup(varNum, &info))
{
info->tail->next = node;
info->tail = node;
}
// Create a new list.
else
{
info = VarScopeMapInfo::Create(node, getAllocator());
compVarScopeMap->Set(varNum, info);
}
}
}
static int __cdecl genCmpLocalVarLifeBeg(const void* elem1, const void* elem2)
{
return (*((VarScopeDsc**)elem1))->vsdLifeBeg - (*((VarScopeDsc**)elem2))->vsdLifeBeg;
}
static int __cdecl genCmpLocalVarLifeEnd(const void* elem1, const void* elem2)
{
return (*((VarScopeDsc**)elem1))->vsdLifeEnd - (*((VarScopeDsc**)elem2))->vsdLifeEnd;
}
inline void Compiler::compInitScopeLists()
{
if (info.compVarScopesCount == 0)
{
compEnterScopeList = compExitScopeList = nullptr;
return;
}
// Populate the 'compEnterScopeList' and 'compExitScopeList' lists
compEnterScopeList = new (this, CMK_DebugInfo) VarScopeDsc*[info.compVarScopesCount];
compExitScopeList = new (this, CMK_DebugInfo) VarScopeDsc*[info.compVarScopesCount];
for (unsigned i = 0; i < info.compVarScopesCount; i++)
{
compEnterScopeList[i] = compExitScopeList[i] = &info.compVarScopes[i];
}
qsort(compEnterScopeList, info.compVarScopesCount, sizeof(*compEnterScopeList), genCmpLocalVarLifeBeg);
qsort(compExitScopeList, info.compVarScopesCount, sizeof(*compExitScopeList), genCmpLocalVarLifeEnd);
}
void Compiler::compResetScopeLists()
{
if (info.compVarScopesCount == 0)
{
return;
}
assert(compEnterScopeList && compExitScopeList);
compNextEnterScope = compNextExitScope = 0;
}
VarScopeDsc* Compiler::compGetNextEnterScope(unsigned offs, bool scan)
{
assert(info.compVarScopesCount);
assert(compEnterScopeList && compExitScopeList);
if (compNextEnterScope < info.compVarScopesCount)
{
assert(compEnterScopeList[compNextEnterScope]);
unsigned nextEnterOff = compEnterScopeList[compNextEnterScope]->vsdLifeBeg;
assert(scan || (offs <= nextEnterOff));
if (!scan)
{
if (offs == nextEnterOff)
{
return compEnterScopeList[compNextEnterScope++];
}
}
else
{
if (nextEnterOff <= offs)
{
return compEnterScopeList[compNextEnterScope++];
}
}
}
return nullptr;
}
VarScopeDsc* Compiler::compGetNextExitScope(unsigned offs, bool scan)
{
assert(info.compVarScopesCount);
assert(compEnterScopeList && compExitScopeList);
if (compNextExitScope < info.compVarScopesCount)
{
assert(compExitScopeList[compNextExitScope]);
unsigned nextExitOffs = compExitScopeList[compNextExitScope]->vsdLifeEnd;
assert(scan || (offs <= nextExitOffs));
if (!scan)
{
if (offs == nextExitOffs)
{
return compExitScopeList[compNextExitScope++];
}
}
else
{
if (nextExitOffs <= offs)
{
return compExitScopeList[compNextExitScope++];
}
}
}
return nullptr;
}
// The function will call the callback functions for scopes with boundaries
// at instrs from the current status of the scope lists to 'offset',
// ordered by instrs.
void Compiler::compProcessScopesUntil(unsigned offset,
VARSET_TP* inScope,
void (Compiler::*enterScopeFn)(VARSET_TP* inScope, VarScopeDsc*),
void (Compiler::*exitScopeFn)(VARSET_TP* inScope, VarScopeDsc*))
{
assert(offset != BAD_IL_OFFSET);
assert(inScope != nullptr);
bool foundExit = false, foundEnter = true;
VarScopeDsc* scope;
VarScopeDsc* nextExitScope = nullptr;
VarScopeDsc* nextEnterScope = nullptr;
unsigned offs = offset, curEnterOffs = 0;
goto START_FINDING_SCOPES;
// We need to determine the scopes which are open for the current block.
// This loop walks over the missing blocks between the current and the
// previous block, keeping the enter and exit offsets in lockstep.
do
{
foundExit = foundEnter = false;
if (nextExitScope)
{
(this->*exitScopeFn)(inScope, nextExitScope);
nextExitScope = nullptr;
foundExit = true;
}
offs = nextEnterScope ? nextEnterScope->vsdLifeBeg : offset;
while ((scope = compGetNextExitScope(offs, true)) != nullptr)
{
foundExit = true;
if (!nextEnterScope || scope->vsdLifeEnd > nextEnterScope->vsdLifeBeg)
{
// We overshot the last found Enter scope. Save the scope for later
// and find an entering scope
nextExitScope = scope;
break;
}
(this->*exitScopeFn)(inScope, scope);
}
if (nextEnterScope)
{
(this->*enterScopeFn)(inScope, nextEnterScope);
curEnterOffs = nextEnterScope->vsdLifeBeg;
nextEnterScope = nullptr;
foundEnter = true;
}
offs = nextExitScope ? nextExitScope->vsdLifeEnd : offset;
START_FINDING_SCOPES:
while ((scope = compGetNextEnterScope(offs, true)) != nullptr)
{
foundEnter = true;
if ((nextExitScope && scope->vsdLifeBeg >= nextExitScope->vsdLifeEnd) || (scope->vsdLifeBeg > curEnterOffs))
{
// We overshot the last found exit scope. Save the scope for later
// and find an exiting scope
nextEnterScope = scope;
break;
}
(this->*enterScopeFn)(inScope, scope);
if (!nextExitScope)
{
curEnterOffs = scope->vsdLifeBeg;
}
}
} while (foundExit || foundEnter);
}
#if defined(DEBUG)
void Compiler::compDispScopeLists()
{
unsigned i;
printf("Local variable scopes = %d\n", info.compVarScopesCount);
if (info.compVarScopesCount)
{
printf(" \tVarNum \tLVNum \t Name \tBeg \tEnd\n");
}
printf("Sorted by enter scope:\n");
for (i = 0; i < info.compVarScopesCount; i++)
{
VarScopeDsc* varScope = compEnterScopeList[i];
assert(varScope);
printf("%2d: \t%02Xh \t%02Xh \t%10s \t%03Xh \t%03Xh", i, varScope->vsdVarNum, varScope->vsdLVnum,
VarNameToStr(varScope->vsdName) == nullptr ? "UNKNOWN" : VarNameToStr(varScope->vsdName),
varScope->vsdLifeBeg, varScope->vsdLifeEnd);
if (compNextEnterScope == i)
{
printf(" <-- next enter scope");
}
printf("\n");
}
printf("Sorted by exit scope:\n");
for (i = 0; i < info.compVarScopesCount; i++)
{
VarScopeDsc* varScope = compExitScopeList[i];
assert(varScope);
printf("%2d: \t%02Xh \t%02Xh \t%10s \t%03Xh \t%03Xh", i, varScope->vsdVarNum, varScope->vsdLVnum,
VarNameToStr(varScope->vsdName) == nullptr ? "UNKNOWN" : VarNameToStr(varScope->vsdName),
varScope->vsdLifeBeg, varScope->vsdLifeEnd);
if (compNextExitScope == i)
{
printf(" <-- next exit scope");
}
printf("\n");
}
}
void Compiler::compDispLocalVars()
{
printf("info.compVarScopesCount = %d\n", info.compVarScopesCount);
if (info.compVarScopesCount > 0)
{
printf(" \tVarNum \tLVNum \t Name \tBeg \tEnd\n");
}
for (unsigned i = 0; i < info.compVarScopesCount; i++)
{
VarScopeDsc* varScope = &info.compVarScopes[i];
printf("%2d: \t%02Xh \t%02Xh \t%10s \t%03Xh \t%03Xh\n", i, varScope->vsdVarNum, varScope->vsdLVnum,
VarNameToStr(varScope->vsdName) == nullptr ? "UNKNOWN" : VarNameToStr(varScope->vsdName),
varScope->vsdLifeBeg, varScope->vsdLifeEnd);
}
}
#endif // DEBUG
/*****************************************************************************/
#if MEASURE_CLRAPI_CALLS
struct WrapICorJitInfo : public ICorJitInfo
{
//------------------------------------------------------------------------
// WrapICorJitInfo::makeOne: allocate an instance of WrapICorJitInfo
//
// Arguments:
// alloc - the allocator to get memory from for the instance
// compile - the compiler instance
// compHndRef - the ICorJitInfo handle from the EE; the caller's
// copy may be replaced with a "wrapper" instance
//
// Return Value:
// If the config flags indicate that ICorJitInfo should be wrapped,
// we return the "wrapper" instance; otherwise we return "nullptr".
static WrapICorJitInfo* makeOne(ArenaAllocator* alloc, Compiler* compiler, COMP_HANDLE& compHndRef /* INOUT */)
{
WrapICorJitInfo* wrap = nullptr;
if (JitConfig.JitEECallTimingInfo() != 0)
{
// It's too early to use the default allocator, so we do this
// in two steps to be safe (the constructor doesn't need to do
// anything except fill in the vtable pointer, so we let the
// compiler do it).
void* inst = alloc->allocateMemory(roundUp(sizeof(WrapICorJitInfo)));
if (inst != nullptr)
{
// If you get a build error here due to 'WrapICorJitInfo' being
// an abstract class, it's very likely that the wrapper bodies
// in ICorJitInfo_API_wrapper.hpp are no longer in sync with
// the EE interface; please be kind and update the header file.
wrap = new (inst, jitstd::placement_t()) WrapICorJitInfo();
wrap->wrapComp = compiler;
// Save the real handle and replace it with our wrapped version.
wrap->wrapHnd = compHndRef;
compHndRef = wrap;
}
}
return wrap;
}
private:
Compiler* wrapComp;
COMP_HANDLE wrapHnd; // the "real thing"
public:
#include "ICorJitInfo_API_wrapper.hpp"
};
#endif // MEASURE_CLRAPI_CALLS
/*****************************************************************************/
// Compile a single method
int jitNativeCode(CORINFO_METHOD_HANDLE methodHnd,
CORINFO_MODULE_HANDLE classPtr,
COMP_HANDLE compHnd,
CORINFO_METHOD_INFO* methodInfo,
void** methodCodePtr,
ULONG* methodCodeSize,
JitFlags* compileFlags,
void* inlineInfoPtr)
{
//
// A non-NULL inlineInfo means we are compiling the inlinee method.
//
InlineInfo* inlineInfo = (InlineInfo*)inlineInfoPtr;
bool jitFallbackCompile = false;
START:
int result = CORJIT_INTERNALERROR;
ArenaAllocator* pAlloc = nullptr;
ArenaAllocator alloc;
#if MEASURE_CLRAPI_CALLS
WrapICorJitInfo* wrapCLR = nullptr;
#endif
if (inlineInfo)
{
// Use inliner's memory allocator when compiling the inlinee.
pAlloc = inlineInfo->InlinerCompiler->compGetAllocator();
}
else
{
IEEMemoryManager* pMemoryManager = compHnd->getMemoryManager();
// Try to reuse the pre-inited allocator
pAlloc = ArenaAllocator::getPooledAllocator(pMemoryManager);
if (pAlloc == nullptr)
{
alloc = ArenaAllocator(pMemoryManager);
pAlloc = &alloc;
}
}
Compiler* pComp;
pComp = nullptr;
struct Param
{
Compiler* pComp;
ArenaAllocator* pAlloc;
ArenaAllocator* alloc;
bool jitFallbackCompile;
CORINFO_METHOD_HANDLE methodHnd;
CORINFO_MODULE_HANDLE classPtr;
COMP_HANDLE compHnd;
CORINFO_METHOD_INFO* methodInfo;
void** methodCodePtr;
ULONG* methodCodeSize;
JitFlags* compileFlags;
InlineInfo* inlineInfo;
#if MEASURE_CLRAPI_CALLS
WrapICorJitInfo* wrapCLR;
#endif
int result;
} param;
param.pComp = nullptr;
param.pAlloc = pAlloc;
param.alloc = &alloc;
param.jitFallbackCompile = jitFallbackCompile;
param.methodHnd = methodHnd;
param.classPtr = classPtr;
param.compHnd = compHnd;
param.methodInfo = methodInfo;
param.methodCodePtr = methodCodePtr;
param.methodCodeSize = methodCodeSize;
param.compileFlags = compileFlags;
param.inlineInfo = inlineInfo;
#if MEASURE_CLRAPI_CALLS
param.wrapCLR = nullptr;
#endif
param.result = result;
setErrorTrap(compHnd, Param*, pParamOuter, ¶m)
{
setErrorTrap(nullptr, Param*, pParam, pParamOuter)
{
if (pParam->inlineInfo)
{
// Lazily create the inlinee compiler object
if (pParam->inlineInfo->InlinerCompiler->InlineeCompiler == nullptr)
{
pParam->inlineInfo->InlinerCompiler->InlineeCompiler =
(Compiler*)pParam->pAlloc->allocateMemory(roundUp(sizeof(*pParam->pComp)));
}
// Use the inlinee compiler object
pParam->pComp = pParam->inlineInfo->InlinerCompiler->InlineeCompiler;
#ifdef DEBUG
// memset(pParam->pComp, 0xEE, sizeof(Compiler));
#endif
}
else
{
// Allocate create the inliner compiler object
pParam->pComp = (Compiler*)pParam->pAlloc->allocateMemory(roundUp(sizeof(*pParam->pComp)));
}
#if MEASURE_CLRAPI_CALLS
pParam->wrapCLR = WrapICorJitInfo::makeOne(pParam->pAlloc, pParam->pComp, pParam->compHnd);
#endif
// push this compiler on the stack (TLS)
pParam->pComp->prevCompiler = JitTls::GetCompiler();
JitTls::SetCompiler(pParam->pComp);
// PREFIX_ASSUME gets turned into ASSERT_CHECK and we cannot have it here
#if defined(_PREFAST_) || defined(_PREFIX_)
PREFIX_ASSUME(pParam->pComp != NULL);
#else
assert(pParam->pComp != nullptr);
#endif
pParam->pComp->compInit(pParam->pAlloc, pParam->inlineInfo);
#ifdef DEBUG
pParam->pComp->jitFallbackCompile = pParam->jitFallbackCompile;
#endif
// Now generate the code
pParam->result =
pParam->pComp->compCompile(pParam->methodHnd, pParam->classPtr, pParam->compHnd, pParam->methodInfo,
pParam->methodCodePtr, pParam->methodCodeSize, pParam->compileFlags);
}
finallyErrorTrap()
{
// Add a dummy touch to pComp so that it is kept alive, and is easy to get to
// during debugging since all other data can be obtained through it.
//
if (pParamOuter->pComp) // If OOM is thrown when allocating memory for pComp, we will end up here.
// In that case, pComp is still NULL.
{
pParamOuter->pComp->info.compCode = nullptr;
// pop the compiler off the TLS stack only if it was linked above
assert(JitTls::GetCompiler() == pParamOuter->pComp);
JitTls::SetCompiler(JitTls::GetCompiler()->prevCompiler);
}
if (pParamOuter->inlineInfo == nullptr)
{
// Free up the allocator we were using
pParamOuter->pAlloc->destroy();
}
}
endErrorTrap()
}
impJitErrorTrap()
{
// If we were looking at an inlinee....
if (inlineInfo != nullptr)
{
// Note that we failed to compile the inlinee, and that
// there's no point trying to inline it again anywhere else.
inlineInfo->inlineResult->NoteFatal(InlineObservation::CALLEE_COMPILATION_ERROR);
}
param.result = __errc;
}
endErrorTrap()
result = param.result;
if (!inlineInfo && (result == CORJIT_INTERNALERROR || result == CORJIT_RECOVERABLEERROR) && !jitFallbackCompile)
{
// If we failed the JIT, reattempt with debuggable code.
jitFallbackCompile = true;
// Update the flags for 'safer' code generation.
compileFlags->Set(JitFlags::JIT_FLAG_MIN_OPT);
compileFlags->Clear(JitFlags::JIT_FLAG_SIZE_OPT);
compileFlags->Clear(JitFlags::JIT_FLAG_SPEED_OPT);
goto START;
}
return result;
}
#if defined(FEATURE_UNIX_AMD64_STRUCT_PASSING)
// GetTypeFromClassificationAndSizes:
// Returns the type of the eightbyte accounting for the classification and size of the eightbyte.
//
// args:
// classType: classification type
// size: size of the eightbyte.
//
// static
var_types Compiler::GetTypeFromClassificationAndSizes(SystemVClassificationType classType, int size)
{
var_types type = TYP_UNKNOWN;
switch (classType)
{
case SystemVClassificationTypeInteger:
if (size == 1)
{
type = TYP_BYTE;
}
else if (size <= 2)
{
type = TYP_SHORT;
}
else if (size <= 4)
{
type = TYP_INT;
}
else if (size <= 8)
{
type = TYP_LONG;
}
else
{
assert(false && "GetTypeFromClassificationAndSizes Invalid Integer classification type.");
}
break;
case SystemVClassificationTypeIntegerReference:
type = TYP_REF;
break;
case SystemVClassificationTypeIntegerByRef:
type = TYP_BYREF;
break;
case SystemVClassificationTypeSSE:
if (size <= 4)
{
type = TYP_FLOAT;
}
else if (size <= 8)
{
type = TYP_DOUBLE;
}
else
{
assert(false && "GetTypeFromClassificationAndSizes Invalid SSE classification type.");
}
break;
default:
assert(false && "GetTypeFromClassificationAndSizes Invalid classification type.");
break;
}
return type;
}
//-------------------------------------------------------------------
// GetEightByteType: Returns the type of eightbyte slot of a struct
//
// Arguments:
// structDesc - struct classification description.
// slotNum - eightbyte slot number for the struct.
//
// Return Value:
// type of the eightbyte slot of the struct
//
// static
var_types Compiler::GetEightByteType(const SYSTEMV_AMD64_CORINFO_STRUCT_REG_PASSING_DESCRIPTOR& structDesc,
unsigned slotNum)
{
var_types eightByteType = TYP_UNDEF;
unsigned len = structDesc.eightByteSizes[slotNum];
switch (structDesc.eightByteClassifications[slotNum])
{
case SystemVClassificationTypeInteger:
// See typelist.h for jit type definition.
// All the types of size < 4 bytes are of jit type TYP_INT.
if (structDesc.eightByteSizes[slotNum] <= 4)
{
eightByteType = TYP_INT;
}
else if (structDesc.eightByteSizes[slotNum] <= 8)
{
eightByteType = TYP_LONG;
}
else
{
assert(false && "GetEightByteType Invalid Integer classification type.");
}
break;
case SystemVClassificationTypeIntegerReference:
assert(len == REGSIZE_BYTES);
eightByteType = TYP_REF;
break;
case SystemVClassificationTypeIntegerByRef:
assert(len == REGSIZE_BYTES);
eightByteType = TYP_BYREF;
break;
case SystemVClassificationTypeSSE:
if (structDesc.eightByteSizes[slotNum] <= 4)
{
eightByteType = TYP_FLOAT;
}
else if (structDesc.eightByteSizes[slotNum] <= 8)
{
eightByteType = TYP_DOUBLE;
}
else
{
assert(false && "GetEightByteType Invalid SSE classification type.");
}
break;
default:
assert(false && "GetEightByteType Invalid classification type.");
break;
}
return eightByteType;
}
//------------------------------------------------------------------------------------------------------
// GetStructTypeOffset: Gets the type, size and offset of the eightbytes of a struct for System V systems.
//
// Arguments:
// 'structDesc' - struct description
// 'type0' - out param; returns the type of the first eightbyte.
// 'type1' - out param; returns the type of the second eightbyte.
// 'offset0' - out param; returns the offset of the first eightbyte.
// 'offset1' - out param; returns the offset of the second eightbyte.
//
// static
void Compiler::GetStructTypeOffset(const SYSTEMV_AMD64_CORINFO_STRUCT_REG_PASSING_DESCRIPTOR& structDesc,
var_types* type0,
var_types* type1,
unsigned __int8* offset0,
unsigned __int8* offset1)
{
*offset0 = structDesc.eightByteOffsets[0];
*offset1 = structDesc.eightByteOffsets[1];
*type0 = TYP_UNKNOWN;
*type1 = TYP_UNKNOWN;
// Set the first eightbyte data
if (structDesc.eightByteCount >= 1)
{
*type0 = GetEightByteType(structDesc, 0);
}
// Set the second eight byte data
if (structDesc.eightByteCount == 2)
{
*type1 = GetEightByteType(structDesc, 1);
}
}
#endif // defined(FEATURE_UNIX_AMD64_STRUCT_PASSING)
/*****************************************************************************/
/*****************************************************************************/
#ifdef DEBUG
Compiler::NodeToIntMap* Compiler::FindReachableNodesInNodeTestData()
{
NodeToIntMap* reachable = new (getAllocatorDebugOnly()) NodeToIntMap(getAllocatorDebugOnly());
if (m_nodeTestData == nullptr)
{
return reachable;
}
// Otherwise, iterate.
for (BasicBlock* block = fgFirstBB; block != nullptr; block = block->bbNext)
{
for (GenTreePtr stmt = block->FirstNonPhiDef(); stmt != nullptr; stmt = stmt->gtNext)
{
for (GenTreePtr tree = stmt->gtStmt.gtStmtList; tree; tree = tree->gtNext)
{
TestLabelAndNum tlAndN;
// For call nodes, translate late args to what they stand for.
if (tree->OperGet() == GT_CALL)
{
GenTreeCall* call = tree->AsCall();
GenTreeArgList* args = call->gtCallArgs;
unsigned i = 0;
while (args != nullptr)
{
GenTreePtr arg = args->Current();
if (arg->gtFlags & GTF_LATE_ARG)
{
// Find the corresponding late arg.
GenTreePtr lateArg = call->fgArgInfo->GetLateArg(i);
if (GetNodeTestData()->Lookup(lateArg, &tlAndN))
{
reachable->Set(lateArg, 0);
}
}
i++;
args = args->Rest();
}
}
if (GetNodeTestData()->Lookup(tree, &tlAndN))
{
reachable->Set(tree, 0);
}
}
}
}
return reachable;
}
void Compiler::TransferTestDataToNode(GenTreePtr from, GenTreePtr to)
{
TestLabelAndNum tlAndN;
// We can't currently associate multiple annotations with a single node.
// If we need to, we can fix this...
// If the table is null, don't create it just to do the lookup, which would fail...
if (m_nodeTestData != nullptr && GetNodeTestData()->Lookup(from, &tlAndN))
{
assert(!GetNodeTestData()->Lookup(to, &tlAndN));
// We can't currently associate multiple annotations with a single node.
// If we need to, we can fix this...
TestLabelAndNum tlAndNTo;
assert(!GetNodeTestData()->Lookup(to, &tlAndNTo));
GetNodeTestData()->Remove(from);
GetNodeTestData()->Set(to, tlAndN);
}
}
void Compiler::CopyTestDataToCloneTree(GenTreePtr from, GenTreePtr to)
{
if (m_nodeTestData == nullptr)
{
return;
}
if (from == nullptr)
{
assert(to == nullptr);
return;
}
// Otherwise...
TestLabelAndNum tlAndN;
if (GetNodeTestData()->Lookup(from, &tlAndN))
{
// We can't currently associate multiple annotations with a single node.
// If we need to, we can fix this...
TestLabelAndNum tlAndNTo;
assert(!GetNodeTestData()->Lookup(to, &tlAndNTo));
GetNodeTestData()->Set(to, tlAndN);
}
// Now recurse, in parallel on both trees.
genTreeOps oper = from->OperGet();
unsigned kind = from->OperKind();
assert(oper == to->OperGet());
// Cconstant or leaf nodes have no children.
if (kind & (GTK_CONST | GTK_LEAF))
{
return;
}
// Otherwise, is it a 'simple' unary/binary operator?
if (kind & GTK_SMPOP)
{
if (from->gtOp.gtOp1 != nullptr)
{
assert(to->gtOp.gtOp1 != nullptr);
CopyTestDataToCloneTree(from->gtOp.gtOp1, to->gtOp.gtOp1);
}
else
{
assert(to->gtOp.gtOp1 == nullptr);
}
if (from->gtGetOp2IfPresent() != nullptr)
{
assert(to->gtGetOp2IfPresent() != nullptr);
CopyTestDataToCloneTree(from->gtGetOp2(), to->gtGetOp2());
}
else
{
assert(to->gtGetOp2IfPresent() == nullptr);
}
return;
}
// Otherwise, see what kind of a special operator we have here.
switch (oper)
{
case GT_STMT:
CopyTestDataToCloneTree(from->gtStmt.gtStmtExpr, to->gtStmt.gtStmtExpr);
return;
case GT_CALL:
CopyTestDataToCloneTree(from->gtCall.gtCallObjp, to->gtCall.gtCallObjp);
CopyTestDataToCloneTree(from->gtCall.gtCallArgs, to->gtCall.gtCallArgs);
CopyTestDataToCloneTree(from->gtCall.gtCallLateArgs, to->gtCall.gtCallLateArgs);
if (from->gtCall.gtCallType == CT_INDIRECT)
{
CopyTestDataToCloneTree(from->gtCall.gtCallCookie, to->gtCall.gtCallCookie);
CopyTestDataToCloneTree(from->gtCall.gtCallAddr, to->gtCall.gtCallAddr);
}
// The other call types do not have additional GenTree arguments.
return;
case GT_FIELD:
CopyTestDataToCloneTree(from->gtField.gtFldObj, to->gtField.gtFldObj);
return;
case GT_ARR_ELEM:
assert(from->gtArrElem.gtArrRank == to->gtArrElem.gtArrRank);
for (unsigned dim = 0; dim < from->gtArrElem.gtArrRank; dim++)
{
CopyTestDataToCloneTree(from->gtArrElem.gtArrInds[dim], to->gtArrElem.gtArrInds[dim]);
}
CopyTestDataToCloneTree(from->gtArrElem.gtArrObj, to->gtArrElem.gtArrObj);
return;
case GT_CMPXCHG:
CopyTestDataToCloneTree(from->gtCmpXchg.gtOpLocation, to->gtCmpXchg.gtOpLocation);
CopyTestDataToCloneTree(from->gtCmpXchg.gtOpValue, to->gtCmpXchg.gtOpValue);
CopyTestDataToCloneTree(from->gtCmpXchg.gtOpComparand, to->gtCmpXchg.gtOpComparand);
return;
case GT_ARR_BOUNDS_CHECK:
#ifdef FEATURE_SIMD
case GT_SIMD_CHK:
#endif // FEATURE_SIMD
CopyTestDataToCloneTree(from->gtBoundsChk.gtIndex, to->gtBoundsChk.gtIndex);
CopyTestDataToCloneTree(from->gtBoundsChk.gtArrLen, to->gtBoundsChk.gtArrLen);
return;
default:
unreached();
}
}
#endif // DEBUG
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XX
XX jvc XX
XX XX
XX Functions for the stand-alone version of the JIT . XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
/*****************************************************************************/
void codeGeneratorCodeSizeBeg()
{
}
/*****************************************************************************/
/*****************************************************************************
*
* If any temporary tables are smaller than 'genMinSize2free' we won't bother
* freeing them.
*/
const size_t genMinSize2free = 64;
/*****************************************************************************/
/*****************************************************************************
*
* Used for counting pointer assignments.
*/
/*****************************************************************************/
void codeGeneratorCodeSizeEnd()
{
}
/*****************************************************************************
*
* Gather statistics - mainly used for the standalone
* Enable various #ifdef's to get the information you need
*/
void Compiler::compJitStats()
{
#if CALL_ARG_STATS
/* Method types and argument statistics */
compCallArgStats();
#endif // CALL_ARG_STATS
}
#if CALL_ARG_STATS
/*****************************************************************************
*
* Gather statistics about method calls and arguments
*/
void Compiler::compCallArgStats()
{
GenTreePtr args;
GenTreePtr argx;
BasicBlock* block;
GenTreePtr stmt;
GenTreePtr call;
unsigned argNum;
unsigned argDWordNum;
unsigned argLngNum;
unsigned argFltNum;
unsigned argDblNum;
unsigned regArgNum;
unsigned regArgDeferred;
unsigned regArgTemp;
unsigned regArgLclVar;
unsigned regArgConst;
unsigned argTempsThisMethod = 0;
assert(fgStmtListThreaded);
for (block = fgFirstBB; block; block = block->bbNext)
{
for (stmt = block->bbTreeList; stmt; stmt = stmt->gtNext)
{
assert(stmt->gtOper == GT_STMT);
for (call = stmt->gtStmt.gtStmtList; call; call = call->gtNext)
{
if (call->gtOper != GT_CALL)
continue;
argNum =
regArgNum = regArgDeferred = regArgTemp =
regArgConst = regArgLclVar =
argDWordNum = argLngNum = argFltNum = argDblNum = 0;
argTotalCalls++;
if (!call->gtCall.gtCallObjp)
{
if (call->gtCall.gtCallType == CT_HELPER)
{
argHelperCalls++;
}
else
{
argStaticCalls++;
}
}
else
{
/* We have a 'this' pointer */
argDWordNum++;
argNum++;
regArgNum++;
regArgDeferred++;
argTotalObjPtr++;
if (call->gtFlags & (GTF_CALL_VIRT_VTABLE | GTF_CALL_VIRT_STUB))
{
/* virtual function */
argVirtualCalls++;
}
else
{
argNonVirtualCalls++;
}
}
#ifdef LEGACY_BACKEND
// TODO-Cleaenup: We need to add support below for additional node types that RyuJIT backend has in the
// IR.
// Gather arguments information.
for (args = call->gtCall.gtCallArgs; args; args = args->gtOp.gtOp2)
{
argx = args->gtOp.gtOp1;
argNum++;
switch (genActualType(argx->TypeGet()))
{
case TYP_INT:
case TYP_REF:
case TYP_BYREF:
argDWordNum++;
break;
case TYP_LONG:
argLngNum++;
break;
case TYP_FLOAT:
argFltNum++;
break;
case TYP_DOUBLE:
argDblNum++;
break;
case TYP_VOID:
/* This is a deferred register argument */
assert(argx->gtOper == GT_NOP);
assert(argx->gtFlags & GTF_LATE_ARG);
argDWordNum++;
break;
}
/* Is this argument a register argument? */
if (argx->gtFlags & GTF_LATE_ARG)
{
regArgNum++;
/* We either have a deferred argument or a temp */
if (argx->gtOper == GT_NOP)
{
regArgDeferred++;
}
else
{
assert(argx->gtOper == GT_ASG);
regArgTemp++;
}
}
}
/* Look at the register arguments and count how many constants, local vars */
for (args = call->gtCall.gtCallLateArgs; args; args = args->gtOp.gtOp2)
{
argx = args->gtOp.gtOp1;
switch (argx->gtOper)
{
case GT_CNS_INT:
regArgConst++;
break;
case GT_LCL_VAR:
regArgLclVar++;
break;
}
}
assert(argNum == argDWordNum + argLngNum + argFltNum + argDblNum);
assert(regArgNum == regArgDeferred + regArgTemp);
argTotalArgs += argNum;
argTotalRegArgs += regArgNum;
argTotalDWordArgs += argDWordNum;
argTotalLongArgs += argLngNum;
argTotalFloatArgs += argFltNum;
argTotalDoubleArgs += argDblNum;
argTotalDeferred += regArgDeferred;
argTotalTemps += regArgTemp;
argTotalConst += regArgConst;
argTotalLclVar += regArgLclVar;
argTempsThisMethod += regArgTemp;
argCntTable.record(argNum);
argDWordCntTable.record(argDWordNum);
argDWordLngCntTable.record(argDWordNum + (2 * argLngNum));
#endif // LEGACY_BACKEND
}
}
}
argTempsCntTable.record(argTempsThisMethod);
if (argMaxTempsPerMethod < argTempsThisMethod)
{
argMaxTempsPerMethod = argTempsThisMethod;
}
}
/* static */
void Compiler::compDispCallArgStats(FILE* fout)
{
if (argTotalCalls == 0)
return;
fprintf(fout, "\n");
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "Call stats\n");
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "Total # of calls = %d, calls / method = %.3f\n\n", argTotalCalls,
(float)argTotalCalls / genMethodCnt);
fprintf(fout, "Percentage of helper calls = %4.2f %%\n", (float)(100 * argHelperCalls) / argTotalCalls);
fprintf(fout, "Percentage of static calls = %4.2f %%\n", (float)(100 * argStaticCalls) / argTotalCalls);
fprintf(fout, "Percentage of virtual calls = %4.2f %%\n", (float)(100 * argVirtualCalls) / argTotalCalls);
fprintf(fout, "Percentage of non-virtual calls = %4.2f %%\n\n", (float)(100 * argNonVirtualCalls) / argTotalCalls);
fprintf(fout, "Average # of arguments per call = %.2f%%\n\n", (float)argTotalArgs / argTotalCalls);
fprintf(fout, "Percentage of DWORD arguments = %.2f %%\n", (float)(100 * argTotalDWordArgs) / argTotalArgs);
fprintf(fout, "Percentage of LONG arguments = %.2f %%\n", (float)(100 * argTotalLongArgs) / argTotalArgs);
fprintf(fout, "Percentage of FLOAT arguments = %.2f %%\n", (float)(100 * argTotalFloatArgs) / argTotalArgs);
fprintf(fout, "Percentage of DOUBLE arguments = %.2f %%\n\n", (float)(100 * argTotalDoubleArgs) / argTotalArgs);
if (argTotalRegArgs == 0)
return;
/*
fprintf(fout, "Total deferred arguments = %d \n", argTotalDeferred);
fprintf(fout, "Total temp arguments = %d \n\n", argTotalTemps);
fprintf(fout, "Total 'this' arguments = %d \n", argTotalObjPtr);
fprintf(fout, "Total local var arguments = %d \n", argTotalLclVar);
fprintf(fout, "Total constant arguments = %d \n\n", argTotalConst);
*/
fprintf(fout, "\nRegister Arguments:\n\n");
fprintf(fout, "Percentage of deferred arguments = %.2f %%\n", (float)(100 * argTotalDeferred) / argTotalRegArgs);
fprintf(fout, "Percentage of temp arguments = %.2f %%\n\n", (float)(100 * argTotalTemps) / argTotalRegArgs);
fprintf(fout, "Maximum # of temps per method = %d\n\n", argMaxTempsPerMethod);
fprintf(fout, "Percentage of ObjPtr arguments = %.2f %%\n", (float)(100 * argTotalObjPtr) / argTotalRegArgs);
// fprintf(fout, "Percentage of global arguments = %.2f %%\n", (float)(100 * argTotalDWordGlobEf) /
// argTotalRegArgs);
fprintf(fout, "Percentage of constant arguments = %.2f %%\n", (float)(100 * argTotalConst) / argTotalRegArgs);
fprintf(fout, "Percentage of lcl var arguments = %.2f %%\n\n", (float)(100 * argTotalLclVar) / argTotalRegArgs);
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "Argument count frequency table (includes ObjPtr):\n");
fprintf(fout, "--------------------------------------------------\n");
argCntTable.dump(fout);
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "DWORD argument count frequency table (w/o LONG):\n");
fprintf(fout, "--------------------------------------------------\n");
argDWordCntTable.dump(fout);
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "Temps count frequency table (per method):\n");
fprintf(fout, "--------------------------------------------------\n");
argTempsCntTable.dump(fout);
fprintf(fout, "--------------------------------------------------\n");
/*
fprintf(fout, "--------------------------------------------------\n");
fprintf(fout, "DWORD argument count frequency table (w/ LONG):\n");
fprintf(fout, "--------------------------------------------------\n");
argDWordLngCntTable.dump(fout);
fprintf(fout, "--------------------------------------------------\n");
*/
}
#endif // CALL_ARG_STATS
// JIT time end to end, and by phases.
#ifdef FEATURE_JIT_METHOD_PERF
// Static variables
CritSecObject CompTimeSummaryInfo::s_compTimeSummaryLock;
CompTimeSummaryInfo CompTimeSummaryInfo::s_compTimeSummary;
#if MEASURE_CLRAPI_CALLS
double JitTimer::s_cyclesPerSec = CycleTimer::CyclesPerSecond();
#endif
#endif // FEATURE_JIT_METHOD_PERF
#if defined(FEATURE_JIT_METHOD_PERF) || DUMP_FLOWGRAPHS || defined(FEATURE_TRACELOGGING)
const char* PhaseNames[] = {
#define CompPhaseNameMacro(enum_nm, string_nm, short_nm, hasChildren, parent, measureIR) string_nm,
#include "compphases.h"
};
const char* PhaseEnums[] = {
#define CompPhaseNameMacro(enum_nm, string_nm, short_nm, hasChildren, parent, measureIR) #enum_nm,
#include "compphases.h"
};
const LPCWSTR PhaseShortNames[] = {
#define CompPhaseNameMacro(enum_nm, string_nm, short_nm, hasChildren, parent, measureIR) W(short_nm),
#include "compphases.h"
};
#endif // defined(FEATURE_JIT_METHOD_PERF) || DUMP_FLOWGRAPHS
#ifdef FEATURE_JIT_METHOD_PERF
bool PhaseHasChildren[] = {
#define CompPhaseNameMacro(enum_nm, string_nm, short_nm, hasChildren, parent, measureIR) hasChildren,
#include "compphases.h"
};
int PhaseParent[] = {
#define CompPhaseNameMacro(enum_nm, string_nm, short_nm, hasChildren, parent, measureIR) parent,
#include "compphases.h"
};
bool PhaseReportsIRSize[] = {
#define CompPhaseNameMacro(enum_nm, string_nm, short_nm, hasChildren, parent, measureIR) measureIR,
#include "compphases.h"
};
CompTimeInfo::CompTimeInfo(unsigned byteCodeBytes)
: m_byteCodeBytes(byteCodeBytes)
, m_totalCycles(0)
, m_parentPhaseEndSlop(0)
, m_timerFailure(false)
#if MEASURE_CLRAPI_CALLS
, m_allClrAPIcalls(0)
, m_allClrAPIcycles(0)
#endif
{
for (int i = 0; i < PHASE_NUMBER_OF; i++)
{
m_invokesByPhase[i] = 0;
m_cyclesByPhase[i] = 0;
#if MEASURE_CLRAPI_CALLS
m_CLRinvokesByPhase[i] = 0;
m_CLRcyclesByPhase[i] = 0;
#endif
}
#if MEASURE_CLRAPI_CALLS
assert(ARRAYSIZE(m_perClrAPIcalls) == API_ICorJitInfo_Names::API_COUNT);
assert(ARRAYSIZE(m_perClrAPIcycles) == API_ICorJitInfo_Names::API_COUNT);
assert(ARRAYSIZE(m_maxClrAPIcycles) == API_ICorJitInfo_Names::API_COUNT);
for (int i = 0; i < API_ICorJitInfo_Names::API_COUNT; i++)
{
m_perClrAPIcalls[i] = 0;
m_perClrAPIcycles[i] = 0;
m_maxClrAPIcycles[i] = 0;
}
#endif
}
bool CompTimeSummaryInfo::IncludedInFilteredData(CompTimeInfo& info)
{
return false; // info.m_byteCodeBytes < 10;
}
//------------------------------------------------------------------------
// CompTimeSummaryInfo::AddInfo: Record timing info from one compile.
//
// Arguments:
// info - The timing information to record.
// includePhases - If "true", the per-phase info in "info" is valid,
// which means that a "normal" compile has ended; if
// the value is "false" we are recording the results
// of a partial compile (typically an import-only run
// on behalf of the inliner) in which case the phase
// info is not valid and so we only record EE call
// overhead.
void CompTimeSummaryInfo::AddInfo(CompTimeInfo& info, bool includePhases)
{
if (info.m_timerFailure)
{
return; // Don't update if there was a failure.
}
CritSecHolder timeLock(s_compTimeSummaryLock);
if (includePhases)
{
bool includeInFiltered = IncludedInFilteredData(info);
m_numMethods++;
// Update the totals and maxima.
m_total.m_byteCodeBytes += info.m_byteCodeBytes;
m_maximum.m_byteCodeBytes = max(m_maximum.m_byteCodeBytes, info.m_byteCodeBytes);
m_total.m_totalCycles += info.m_totalCycles;
m_maximum.m_totalCycles = max(m_maximum.m_totalCycles, info.m_totalCycles);
#if MEASURE_CLRAPI_CALLS
// Update the CLR-API values.
m_total.m_allClrAPIcalls += info.m_allClrAPIcalls;
m_maximum.m_allClrAPIcalls = max(m_maximum.m_allClrAPIcalls, info.m_allClrAPIcalls);
m_total.m_allClrAPIcycles += info.m_allClrAPIcycles;
m_maximum.m_allClrAPIcycles = max(m_maximum.m_allClrAPIcycles, info.m_allClrAPIcycles);
#endif
if (includeInFiltered)
{
m_numFilteredMethods++;
m_filtered.m_byteCodeBytes += info.m_byteCodeBytes;
m_filtered.m_totalCycles += info.m_totalCycles;
m_filtered.m_parentPhaseEndSlop += info.m_parentPhaseEndSlop;
}
for (int i = 0; i < PHASE_NUMBER_OF; i++)
{
m_total.m_invokesByPhase[i] += info.m_invokesByPhase[i];
m_total.m_cyclesByPhase[i] += info.m_cyclesByPhase[i];
#if MEASURE_CLRAPI_CALLS
m_total.m_CLRinvokesByPhase[i] += info.m_CLRinvokesByPhase[i];
m_total.m_CLRcyclesByPhase[i] += info.m_CLRcyclesByPhase[i];
#endif
if (includeInFiltered)
{
m_filtered.m_invokesByPhase[i] += info.m_invokesByPhase[i];
m_filtered.m_cyclesByPhase[i] += info.m_cyclesByPhase[i];
#if MEASURE_CLRAPI_CALLS
m_filtered.m_CLRinvokesByPhase[i] += info.m_CLRinvokesByPhase[i];
m_filtered.m_CLRcyclesByPhase[i] += info.m_CLRcyclesByPhase[i];
#endif
}
m_maximum.m_cyclesByPhase[i] = max(m_maximum.m_cyclesByPhase[i], info.m_cyclesByPhase[i]);
#if MEASURE_CLRAPI_CALLS
m_maximum.m_CLRcyclesByPhase[i] = max(m_maximum.m_CLRcyclesByPhase[i], info.m_CLRcyclesByPhase[i]);
#endif
}
m_total.m_parentPhaseEndSlop += info.m_parentPhaseEndSlop;
m_maximum.m_parentPhaseEndSlop = max(m_maximum.m_parentPhaseEndSlop, info.m_parentPhaseEndSlop);
}
#if MEASURE_CLRAPI_CALLS
else
{
m_totMethods++;
// Update the "global" CLR-API values.
m_total.m_allClrAPIcalls += info.m_allClrAPIcalls;
m_maximum.m_allClrAPIcalls = max(m_maximum.m_allClrAPIcalls, info.m_allClrAPIcalls);
m_total.m_allClrAPIcycles += info.m_allClrAPIcycles;
m_maximum.m_allClrAPIcycles = max(m_maximum.m_allClrAPIcycles, info.m_allClrAPIcycles);
// Update the per-phase CLR-API values.
m_total.m_invokesByPhase[PHASE_CLR_API] += info.m_allClrAPIcalls;
m_maximum.m_invokesByPhase[PHASE_CLR_API] =
max(m_maximum.m_perClrAPIcalls[PHASE_CLR_API], info.m_allClrAPIcalls);
m_total.m_cyclesByPhase[PHASE_CLR_API] += info.m_allClrAPIcycles;
m_maximum.m_cyclesByPhase[PHASE_CLR_API] =
max(m_maximum.m_cyclesByPhase[PHASE_CLR_API], info.m_allClrAPIcycles);
}
for (int i = 0; i < API_ICorJitInfo_Names::API_COUNT; i++)
{
m_total.m_perClrAPIcalls[i] += info.m_perClrAPIcalls[i];
m_maximum.m_perClrAPIcalls[i] = max(m_maximum.m_perClrAPIcalls[i], info.m_perClrAPIcalls[i]);
m_total.m_perClrAPIcycles[i] += info.m_perClrAPIcycles[i];
m_maximum.m_perClrAPIcycles[i] = max(m_maximum.m_perClrAPIcycles[i], info.m_perClrAPIcycles[i]);
m_maximum.m_maxClrAPIcycles[i] = max(m_maximum.m_maxClrAPIcycles[i], info.m_maxClrAPIcycles[i]);
}
#endif
}
// Static
LPCWSTR Compiler::compJitTimeLogFilename = nullptr;
void CompTimeSummaryInfo::Print(FILE* f)
{
if (f == nullptr)
{
return;
}
// Otherwise...
double countsPerSec = CycleTimer::CyclesPerSecond();
if (countsPerSec == 0.0)
{
fprintf(f, "Processor does not have a high-frequency timer.\n");
return;
}
bool extraInfo = (JitConfig.JitEECallTimingInfo() != 0);
double totTime_ms = 0.0;
fprintf(f, "JIT Compilation time report:\n");
fprintf(f, " Compiled %d methods.\n", m_numMethods);
if (m_numMethods != 0)
{
fprintf(f, " Compiled %d bytecodes total (%d max, %8.2f avg).\n", m_total.m_byteCodeBytes,
m_maximum.m_byteCodeBytes, (double)m_total.m_byteCodeBytes / (double)m_numMethods);
totTime_ms = ((double)m_total.m_totalCycles / countsPerSec) * 1000.0;
fprintf(f, " Time: total: %10.3f Mcycles/%10.3f ms\n", ((double)m_total.m_totalCycles / 1000000.0),
totTime_ms);
fprintf(f, " max: %10.3f Mcycles/%10.3f ms\n", ((double)m_maximum.m_totalCycles) / 1000000.0,
((double)m_maximum.m_totalCycles / countsPerSec) * 1000.0);
fprintf(f, " avg: %10.3f Mcycles/%10.3f ms\n",
((double)m_total.m_totalCycles) / 1000000.0 / (double)m_numMethods, totTime_ms / (double)m_numMethods);
const char* extraHdr1 = "";
const char* extraHdr2 = "";
#if MEASURE_CLRAPI_CALLS
if (extraInfo)
{
extraHdr1 = " CLRs/meth % in CLR";
extraHdr2 = "-----------------------";
}
#endif
fprintf(f, "\n Total time by phases:\n");
fprintf(f, " PHASE inv/meth Mcycles time (ms) %% of total max (ms)%s\n",
extraHdr1);
fprintf(f, " ---------------------------------------------------------------------------------------%s\n",
extraHdr2);
// Ensure that at least the names array and the Phases enum have the same number of entries:
assert(sizeof(PhaseNames) / sizeof(const char*) == PHASE_NUMBER_OF);
for (int i = 0; i < PHASE_NUMBER_OF; i++)
{
double phase_tot_ms = (((double)m_total.m_cyclesByPhase[i]) / countsPerSec) * 1000.0;
double phase_max_ms = (((double)m_maximum.m_cyclesByPhase[i]) / countsPerSec) * 1000.0;
double phase_tot_pct = 100.0 * phase_tot_ms / totTime_ms;
#if MEASURE_CLRAPI_CALLS
// Skip showing CLR API call info if we didn't collect any
if (i == PHASE_CLR_API && !extraInfo)
continue;
#endif
// Indent nested phases, according to depth.
int ancPhase = PhaseParent[i];
while (ancPhase != -1)
{
fprintf(f, " ");
ancPhase = PhaseParent[ancPhase];
}
fprintf(f, " %-30s %6.2f %10.2f %9.3f %8.2f%% %8.3f", PhaseNames[i],
((double)m_total.m_invokesByPhase[i]) / ((double)m_numMethods),
((double)m_total.m_cyclesByPhase[i]) / 1000000.0, phase_tot_ms, (phase_tot_ms * 100.0 / totTime_ms),
phase_max_ms);
#if MEASURE_CLRAPI_CALLS
if (extraInfo && i != PHASE_CLR_API)
{
double nest_tot_ms = (((double)m_total.m_CLRcyclesByPhase[i]) / countsPerSec) * 1000.0;
double nest_percent = nest_tot_ms * 100.0 / totTime_ms;
double calls_per_fn = ((double)m_total.m_CLRinvokesByPhase[i]) / ((double)m_numMethods);
if (nest_percent > 0.1 || calls_per_fn > 10)
fprintf(f, " %5.1f %8.2f%%", calls_per_fn, nest_percent);
}
#endif
fprintf(f, "\n");
}
// Show slop if it's over a certain percentage of the total
double pslop_pct = 100.0 * m_total.m_parentPhaseEndSlop * 1000.0 / countsPerSec / totTime_ms;
if (pslop_pct >= 1.0)
{
fprintf(f, "\n 'End phase slop' should be very small (if not, there's unattributed time): %9.3f Mcycles = "
"%3.1f%% of total.\n\n",
m_total.m_parentPhaseEndSlop / 1000000.0, pslop_pct);
}
}
if (m_numFilteredMethods > 0)
{
fprintf(f, " Compiled %d methods that meet the filter requirement.\n", m_numFilteredMethods);
fprintf(f, " Compiled %d bytecodes total (%8.2f avg).\n", m_filtered.m_byteCodeBytes,
(double)m_filtered.m_byteCodeBytes / (double)m_numFilteredMethods);
double totTime_ms = ((double)m_filtered.m_totalCycles / countsPerSec) * 1000.0;
fprintf(f, " Time: total: %10.3f Mcycles/%10.3f ms\n", ((double)m_filtered.m_totalCycles / 1000000.0),
totTime_ms);
fprintf(f, " avg: %10.3f Mcycles/%10.3f ms\n",
((double)m_filtered.m_totalCycles) / 1000000.0 / (double)m_numFilteredMethods,
totTime_ms / (double)m_numFilteredMethods);
fprintf(f, " Total time by phases:\n");
fprintf(f, " PHASE inv/meth Mcycles time (ms) %% of total\n");
fprintf(f, " --------------------------------------------------------------------------------------\n");
// Ensure that at least the names array and the Phases enum have the same number of entries:
assert(sizeof(PhaseNames) / sizeof(const char*) == PHASE_NUMBER_OF);
for (int i = 0; i < PHASE_NUMBER_OF; i++)
{
double phase_tot_ms = (((double)m_filtered.m_cyclesByPhase[i]) / countsPerSec) * 1000.0;
// Indent nested phases, according to depth.
int ancPhase = PhaseParent[i];
while (ancPhase != -1)
{
fprintf(f, " ");
ancPhase = PhaseParent[ancPhase];
}
fprintf(f, " %-30s %5.2f %10.2f %9.3f %8.2f%%\n", PhaseNames[i],
((double)m_filtered.m_invokesByPhase[i]) / ((double)m_numFilteredMethods),
((double)m_filtered.m_cyclesByPhase[i]) / 1000000.0, phase_tot_ms,
(phase_tot_ms * 100.0 / totTime_ms));
}
double fslop_ms = m_filtered.m_parentPhaseEndSlop * 1000.0 / countsPerSec;
if (fslop_ms > 1.0)
{
fprintf(f,
"\n 'End phase slop' should be very small (if not, there's unattributed time): %9.3f Mcycles.\n",
m_filtered.m_parentPhaseEndSlop);
}
}
#if MEASURE_CLRAPI_CALLS
if (m_total.m_allClrAPIcalls > 0 && m_total.m_allClrAPIcycles > 0)
{
fprintf(f, "\n");
if (m_totMethods > 0)
fprintf(f, " Imported %u methods.\n\n", m_numMethods + m_totMethods);
fprintf(f, " CLR API # calls total time max time avg time %% "
"of total\n");
fprintf(f, " -------------------------------------------------------------------------------");
fprintf(f, "---------------------\n");
static const char* APInames[] = {
#define DEF_CLR_API(name) #name,
#include "ICorJitInfo_API_names.h"
};
unsigned shownCalls = 0;
double shownMillis = 0.0;
#ifdef DEBUG
unsigned checkedCalls = 0;
double checkedMillis = 0.0;
#endif
for (unsigned pass = 0; pass < 2; pass++)
{
for (unsigned i = 0; i < API_ICorJitInfo_Names::API_COUNT; i++)
{
unsigned calls = m_total.m_perClrAPIcalls[i];
if (calls == 0)
continue;
unsigned __int64 cycles = m_total.m_perClrAPIcycles[i];
double millis = 1000.0 * cycles / countsPerSec;
// Don't show the small fry to keep the results manageable
if (millis < 0.5)
{
// We always show the following API because it is always called
// exactly once for each method and its body is the simplest one
// possible (it just returns an integer constant), and therefore
// it can be used to measure the overhead of adding the CLR API
// timing code. Roughly speaking, on a 3GHz x64 box the overhead
// per call should be around 40 ns when using RDTSC, compared to
// about 140 ns when using GetThreadCycles() under Windows.
if (i != API_ICorJitInfo_Names::API_getExpectedTargetArchitecture)
continue;
}
// In the first pass we just compute the totals.
if (pass == 0)
{
shownCalls += m_total.m_perClrAPIcalls[i];
shownMillis += millis;
continue;
}
unsigned __int32 maxcyc = m_maximum.m_maxClrAPIcycles[i];
double max_ms = 1000.0 * maxcyc / countsPerSec;
fprintf(f, " %-40s", APInames[i]); // API name
fprintf(f, " %8u %9.1f ms", calls, millis); // #calls, total time
fprintf(f, " %8.1f ms %8.1f ns", max_ms, 1000000.0 * millis / calls); // max, avg time
fprintf(f, " %5.1f%%\n", 100.0 * millis / shownMillis); // % of total
#ifdef DEBUG
checkedCalls += m_total.m_perClrAPIcalls[i];
checkedMillis += millis;
#endif
}
}
#ifdef DEBUG
assert(checkedCalls == shownCalls);
assert(checkedMillis == shownMillis);
#endif
if (shownCalls > 0 || shownMillis > 0)
{
fprintf(f, " -------------------------");
fprintf(f, "---------------------------------------------------------------------------\n");
fprintf(f, " Total for calls shown above %8u %10.1f ms", shownCalls, shownMillis);
if (totTime_ms > 0.0)
fprintf(f, " (%4.1lf%% of overall JIT time)", shownMillis * 100.0 / totTime_ms);
fprintf(f, "\n");
}
fprintf(f, "\n");
}
#endif
fprintf(f, "\n");
}
JitTimer::JitTimer(unsigned byteCodeSize) : m_info(byteCodeSize)
{
#if MEASURE_CLRAPI_CALLS
m_CLRcallInvokes = 0;
m_CLRcallCycles = 0;
#endif
#ifdef DEBUG
m_lastPhase = (Phases)-1;
#if MEASURE_CLRAPI_CALLS
m_CLRcallAPInum = -1;
#endif
#endif
unsigned __int64 threadCurCycles;
if (_our_GetThreadCycles(&threadCurCycles))
{
m_start = threadCurCycles;
m_curPhaseStart = threadCurCycles;
}
}
void JitTimer::EndPhase(Compiler* compiler, Phases phase)
{
// Otherwise...
// We re-run some phases currently, so this following assert doesn't work.
// assert((int)phase > (int)m_lastPhase); // We should end phases in increasing order.
unsigned __int64 threadCurCycles;
if (_our_GetThreadCycles(&threadCurCycles))
{
unsigned __int64 phaseCycles = (threadCurCycles - m_curPhaseStart);
// If this is not a leaf phase, the assumption is that the last subphase must have just recently ended.
// Credit the duration to "slop", the total of which should be very small.
if (PhaseHasChildren[phase])
{
m_info.m_parentPhaseEndSlop += phaseCycles;
}
else
{
// It is a leaf phase. Credit duration to it.
m_info.m_invokesByPhase[phase]++;
m_info.m_cyclesByPhase[phase] += phaseCycles;
#if MEASURE_CLRAPI_CALLS
// Record the CLR API timing info as well.
m_info.m_CLRinvokesByPhase[phase] += m_CLRcallInvokes;
m_info.m_CLRcyclesByPhase[phase] += m_CLRcallCycles;
#endif
// Credit the phase's ancestors, if any.
int ancPhase = PhaseParent[phase];
while (ancPhase != -1)
{
m_info.m_cyclesByPhase[ancPhase] += phaseCycles;
ancPhase = PhaseParent[ancPhase];
}
#if MEASURE_CLRAPI_CALLS
const Phases lastPhase = PHASE_CLR_API;
#else
const Phases lastPhase = PHASE_NUMBER_OF;
#endif
if (phase + 1 == lastPhase)
{
m_info.m_totalCycles = (threadCurCycles - m_start);
}
else
{
m_curPhaseStart = threadCurCycles;
}
}
if ((JitConfig.JitMeasureIR() != 0) && PhaseReportsIRSize[phase])
{
m_info.m_nodeCountAfterPhase[phase] = compiler->fgMeasureIR();
}
else
{
m_info.m_nodeCountAfterPhase[phase] = 0;
}
}
#ifdef DEBUG
m_lastPhase = phase;
#endif
#if MEASURE_CLRAPI_CALLS
m_CLRcallInvokes = 0;
m_CLRcallCycles = 0;
#endif
}
#if MEASURE_CLRAPI_CALLS
//------------------------------------------------------------------------
// JitTimer::CLRApiCallEnter: Start the stopwatch for an EE call.
//
// Arguments:
// apix - The API index - an "enum API_ICorJitInfo_Names" value.
//
void JitTimer::CLRApiCallEnter(unsigned apix)
{
assert(m_CLRcallAPInum == -1); // Nested calls not allowed
m_CLRcallAPInum = apix;
// If we can't get the cycles, we'll just ignore this call
if (!_our_GetThreadCycles(&m_CLRcallStart))
m_CLRcallStart = 0;
}
//------------------------------------------------------------------------
// JitTimer::CLRApiCallLeave: compute / record time spent in an EE call.
//
// Arguments:
// apix - The API's "enum API_ICorJitInfo_Names" value; this value
// should match the value passed to the most recent call to
// "CLRApiCallEnter" (i.e. these must come as matched pairs),
// and they also may not nest.
//
void JitTimer::CLRApiCallLeave(unsigned apix)
{
// Make sure we're actually inside a measured CLR call.
assert(m_CLRcallAPInum != -1);
m_CLRcallAPInum = -1;
// Ignore this one if we don't have a valid starting counter.
if (m_CLRcallStart != 0)
{
if (JitConfig.JitEECallTimingInfo() != 0)
{
unsigned __int64 threadCurCycles;
if (_our_GetThreadCycles(&threadCurCycles))
{
// Compute the cycles spent in the call.
threadCurCycles -= m_CLRcallStart;
// Add the cycles to the 'phase' and bump its use count.
m_info.m_cyclesByPhase[PHASE_CLR_API] += threadCurCycles;
m_info.m_invokesByPhase[PHASE_CLR_API] += 1;
// Add the values to the "per API" info.
m_info.m_allClrAPIcycles += threadCurCycles;
m_info.m_allClrAPIcalls += 1;
m_info.m_perClrAPIcalls[apix] += 1;
m_info.m_perClrAPIcycles[apix] += threadCurCycles;
m_info.m_maxClrAPIcycles[apix] = max(m_info.m_maxClrAPIcycles[apix], (unsigned __int32)threadCurCycles);
// Subtract the cycles from the enclosing phase by bumping its start time
m_curPhaseStart += threadCurCycles;
// Update the running totals.
m_CLRcallInvokes += 1;
m_CLRcallCycles += threadCurCycles;
}
}
m_CLRcallStart = 0;
}
assert(m_CLRcallAPInum != -1); // No longer in this API call.
m_CLRcallAPInum = -1;
}
#endif // MEASURE_CLRAPI_CALLS
CritSecObject JitTimer::s_csvLock;
LPCWSTR Compiler::JitTimeLogCsv()
{
LPCWSTR jitTimeLogCsv = JitConfig.JitTimeLogCsv();
return jitTimeLogCsv;
}
void JitTimer::PrintCsvHeader()
{
LPCWSTR jitTimeLogCsv = Compiler::JitTimeLogCsv();
if (jitTimeLogCsv == nullptr)
{
return;
}
CritSecHolder csvLock(s_csvLock);
FILE* fp = _wfopen(jitTimeLogCsv, W("a"));
if (fp != nullptr)
{
// Seek to the end of the file s.t. `ftell` doesn't lie to us on Windows
fseek(fp, 0, SEEK_END);
// Write the header if the file is empty
if (ftell(fp) == 0)
{
fprintf(fp, "\"Method Name\",");
fprintf(fp, "\"Method Index\",");
fprintf(fp, "\"IL Bytes\",");
fprintf(fp, "\"Basic Blocks\",");
fprintf(fp, "\"Opt Level\",");
fprintf(fp, "\"Loops Cloned\",");
for (int i = 0; i < PHASE_NUMBER_OF; i++)
{
fprintf(fp, "\"%s\",", PhaseNames[i]);
if (PhaseReportsIRSize[i])
{
fprintf(fp, "\"Node Count After %s\",", PhaseNames[i]);
}
}
InlineStrategy::DumpCsvHeader(fp);
fprintf(fp, "\"Executable Code Bytes\",");
fprintf(fp, "\"GC Info Bytes\",");
fprintf(fp, "\"Total Bytes Allocated\",");
fprintf(fp, "\"Total Cycles\",");
fprintf(fp, "\"CPS\"\n");
}
fclose(fp);
}
}
extern ICorJitHost* g_jitHost;
void JitTimer::PrintCsvMethodStats(Compiler* comp)
{
LPCWSTR jitTimeLogCsv = Compiler::JitTimeLogCsv();
if (jitTimeLogCsv == nullptr)
{
return;
}
// eeGetMethodFullName uses locks, so don't enter crit sec before this call.
const char* methName = comp->eeGetMethodFullName(comp->info.compMethodHnd);
// Try and access the SPMI index to report in the data set.
//
// If the jit is not hosted under SPMI this will return the
// default value of zero.
//
// Query the jit host directly here instead of going via the
// config cache, since value will change for each method.
int index = g_jitHost->getIntConfigValue(W("SuperPMIMethodContextNumber"), 0);
CritSecHolder csvLock(s_csvLock);
FILE* fp = _wfopen(jitTimeLogCsv, W("a"));
fprintf(fp, "\"%s\",", methName);
fprintf(fp, "%d,", index);
fprintf(fp, "%u,", comp->info.compILCodeSize);
fprintf(fp, "%u,", comp->fgBBcount);
fprintf(fp, "%u,", comp->opts.MinOpts());
fprintf(fp, "%u,", comp->optLoopsCloned);
unsigned __int64 totCycles = 0;
for (int i = 0; i < PHASE_NUMBER_OF; i++)
{
if (!PhaseHasChildren[i])
{
totCycles += m_info.m_cyclesByPhase[i];
}
fprintf(fp, "%I64u,", m_info.m_cyclesByPhase[i]);
if (PhaseReportsIRSize[i])
{
fprintf(fp, "%u,", m_info.m_nodeCountAfterPhase[i]);
}
}
comp->m_inlineStrategy->DumpCsvData(fp);
fprintf(fp, "%Iu,", comp->info.compNativeCodeSize);
fprintf(fp, "%Iu,", comp->compInfoBlkSize);
fprintf(fp, "%Iu,", comp->compGetAllocator()->getTotalBytesAllocated());
fprintf(fp, "%I64u,", m_info.m_totalCycles);
fprintf(fp, "%f\n", CycleTimer::CyclesPerSecond());
fclose(fp);
}
// Completes the timing of the current method, and adds it to "sum".
void JitTimer::Terminate(Compiler* comp, CompTimeSummaryInfo& sum, bool includePhases)
{
if (includePhases)
{
PrintCsvMethodStats(comp);
}
sum.AddInfo(m_info, includePhases);
}
#endif // FEATURE_JIT_METHOD_PERF
#if MEASURE_MEM_ALLOC
// static vars.
CritSecObject Compiler::s_memStatsLock; // Default constructor.
Compiler::AggregateMemStats Compiler::s_aggMemStats; // Default constructor.
Compiler::MemStats Compiler::s_maxCompMemStats; // Default constructor.
const char* Compiler::MemStats::s_CompMemKindNames[] = {
#define CompMemKindMacro(kind) #kind,
#include "compmemkind.h"
};
void Compiler::MemStats::Print(FILE* f)
{
fprintf(f, "count: %10u, size: %10llu, max = %10llu\n", allocCnt, allocSz, allocSzMax);
fprintf(f, "allocateMemory: %10llu, nraUsed: %10llu\n", nraTotalSizeAlloc, nraTotalSizeUsed);
PrintByKind(f);
}
void Compiler::MemStats::PrintByKind(FILE* f)
{
fprintf(f, "\nAlloc'd bytes by kind:\n %20s | %10s | %7s\n", "kind", "size", "pct");
fprintf(f, " %20s-+-%10s-+-%7s\n", "--------------------", "----------", "-------");
float allocSzF = static_cast<float>(allocSz);
for (int cmk = 0; cmk < CMK_Count; cmk++)
{
float pct = 100.0f * static_cast<float>(allocSzByKind[cmk]) / allocSzF;
fprintf(f, " %20s | %10llu | %6.2f%%\n", s_CompMemKindNames[cmk], allocSzByKind[cmk], pct);
}
fprintf(f, "\n");
}
void Compiler::AggregateMemStats::Print(FILE* f)
{
fprintf(f, "For %9u methods:\n", nMethods);
if (nMethods == 0)
{
return;
}
fprintf(f, " count: %12u (avg %7u per method)\n", allocCnt, allocCnt / nMethods);
fprintf(f, " alloc size : %12llu (avg %7llu per method)\n", allocSz, allocSz / nMethods);
fprintf(f, " max alloc : %12llu\n", allocSzMax);
fprintf(f, "\n");
fprintf(f, " allocateMemory : %12llu (avg %7llu per method)\n", nraTotalSizeAlloc, nraTotalSizeAlloc / nMethods);
fprintf(f, " nraUsed : %12llu (avg %7llu per method)\n", nraTotalSizeUsed, nraTotalSizeUsed / nMethods);
PrintByKind(f);
}
#endif // MEASURE_MEM_ALLOC
#if LOOP_HOIST_STATS
// Static fields.
CritSecObject Compiler::s_loopHoistStatsLock; // Default constructor.
unsigned Compiler::s_loopsConsidered = 0;
unsigned Compiler::s_loopsWithHoistedExpressions = 0;
unsigned Compiler::s_totalHoistedExpressions = 0;
// static
void Compiler::PrintAggregateLoopHoistStats(FILE* f)
{
fprintf(f, "\n");
fprintf(f, "---------------------------------------------------\n");
fprintf(f, "Loop hoisting stats\n");
fprintf(f, "---------------------------------------------------\n");
double pctWithHoisted = 0.0;
if (s_loopsConsidered > 0)
{
pctWithHoisted = 100.0 * (double(s_loopsWithHoistedExpressions) / double(s_loopsConsidered));
}
double exprsPerLoopWithExpr = 0.0;
if (s_loopsWithHoistedExpressions > 0)
{
exprsPerLoopWithExpr = double(s_totalHoistedExpressions) / double(s_loopsWithHoistedExpressions);
}
fprintf(f, "Considered %d loops. Of these, we hoisted expressions out of %d (%6.2f%%).\n", s_loopsConsidered,
s_loopsWithHoistedExpressions, pctWithHoisted);
fprintf(f, " A total of %d expressions were hoisted, an average of %5.2f per loop-with-hoisted-expr.\n",
s_totalHoistedExpressions, exprsPerLoopWithExpr);
}
void Compiler::AddLoopHoistStats()
{
CritSecHolder statsLock(s_loopHoistStatsLock);
s_loopsConsidered += m_loopsConsidered;
s_loopsWithHoistedExpressions += m_loopsWithHoistedExpressions;
s_totalHoistedExpressions += m_totalHoistedExpressions;
}
void Compiler::PrintPerMethodLoopHoistStats()
{
double pctWithHoisted = 0.0;
if (m_loopsConsidered > 0)
{
pctWithHoisted = 100.0 * (double(m_loopsWithHoistedExpressions) / double(m_loopsConsidered));
}
double exprsPerLoopWithExpr = 0.0;
if (m_loopsWithHoistedExpressions > 0)
{
exprsPerLoopWithExpr = double(m_totalHoistedExpressions) / double(m_loopsWithHoistedExpressions);
}
printf("Considered %d loops. Of these, we hoisted expressions out of %d (%5.2f%%).\n", m_loopsConsidered,
m_loopsWithHoistedExpressions, pctWithHoisted);
printf(" A total of %d expressions were hoisted, an average of %5.2f per loop-with-hoisted-expr.\n",
m_totalHoistedExpressions, exprsPerLoopWithExpr);
}
#endif // LOOP_HOIST_STATS
//------------------------------------------------------------------------
// RecordStateAtEndOfInlining: capture timing data (if enabled) after
// inlining as completed.
//
// Note:
// Records data needed for SQM and inlining data dumps. Should be
// called after inlining is complete. (We do this after inlining
// because this marks the last point at which the JIT is likely to
// cause type-loading and class initialization).
void Compiler::RecordStateAtEndOfInlining()
{
#if defined(DEBUG) || defined(INLINE_DATA) || defined(FEATURE_CLRSQM)
m_compCyclesAtEndOfInlining = 0;
m_compTickCountAtEndOfInlining = 0;
bool b = CycleTimer::GetThreadCyclesS(&m_compCyclesAtEndOfInlining);
if (!b)
{
return; // We don't have a thread cycle counter.
}
m_compTickCountAtEndOfInlining = GetTickCount();
#endif // defined(DEBUG) || defined(INLINE_DATA) || defined(FEATURE_CLRSQM)
}
//------------------------------------------------------------------------
// RecordStateAtEndOfCompilation: capture timing data (if enabled) after
// compilation is completed.
void Compiler::RecordStateAtEndOfCompilation()
{
#if defined(DEBUG) || defined(INLINE_DATA) || defined(FEATURE_CLRSQM)
// Common portion
m_compCycles = 0;
unsigned __int64 compCyclesAtEnd;
bool b = CycleTimer::GetThreadCyclesS(&compCyclesAtEnd);
if (!b)
{
return; // We don't have a thread cycle counter.
}
assert(compCyclesAtEnd >= m_compCyclesAtEndOfInlining);
m_compCycles = compCyclesAtEnd - m_compCyclesAtEndOfInlining;
#endif // defined(DEBUG) || defined(INLINE_DATA) || defined(FEATURE_CLRSQM)
#ifdef FEATURE_CLRSQM
// SQM only portion
unsigned __int64 mcycles64 = m_compCycles / ((unsigned __int64)1000000);
unsigned mcycles;
if (mcycles64 > UINT32_MAX)
{
mcycles = UINT32_MAX;
}
else
{
mcycles = (unsigned)mcycles64;
}
DWORD ticksAtEnd = GetTickCount();
assert(ticksAtEnd >= m_compTickCountAtEndOfInlining);
DWORD compTicks = ticksAtEnd - m_compTickCountAtEndOfInlining;
if (mcycles >= 1000)
{
info.compCompHnd->logSQMLongJitEvent(mcycles, compTicks, info.compILCodeSize, fgBBcount, opts.MinOpts(),
info.compMethodHnd);
}
#endif // FEATURE_CLRSQM
}
#if FUNC_INFO_LOGGING
// static
LPCWSTR Compiler::compJitFuncInfoFilename = nullptr;
// static
FILE* Compiler::compJitFuncInfoFile = nullptr;
#endif // FUNC_INFO_LOGGING
#ifdef DEBUG
// dumpConvertedVarSet() is just like dumpVarSet(), except we assume the varset bits are tracked
// variable indices, and we convert them to variable numbers, sort the variable numbers, and
// print them as variable numbers. To do this, we use a temporary set indexed by
// variable number. We can't use the "all varset" type because it is still size-limited, and might
// not be big enough to handle all possible variable numbers.
void dumpConvertedVarSet(Compiler* comp, VARSET_VALARG_TP vars)
{
BYTE* pVarNumSet; // trivial set: one byte per varNum, 0 means not in set, 1 means in set.
size_t varNumSetBytes = comp->lvaCount * sizeof(BYTE);
pVarNumSet = (BYTE*)_alloca(varNumSetBytes);
memset(pVarNumSet, 0, varNumSetBytes); // empty the set
VARSET_ITER_INIT(comp, iter, vars, varIndex);
while (iter.NextElem(comp, &varIndex))
{
unsigned varNum = comp->lvaTrackedToVarNum[varIndex];
assert(varNum < comp->lvaCount);
pVarNumSet[varNum] = 1; // This varNum is in the set
}
bool first = true;
printf("{");
for (size_t varNum = 0; varNum < comp->lvaCount; varNum++)
{
if (pVarNumSet[varNum] == 1)
{
if (!first)
{
printf(" ");
}
printf("V%02u", varNum);
first = false;
}
}
printf("}");
}
/*XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XX
XX Debugging helpers XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
/*****************************************************************************/
/* The following functions are intended to be called from the debugger, to dump
* various data structures.
*
* The versions that start with 'c' take a Compiler* as the first argument.
* The versions that start with 'd' use the tlsCompiler, so don't require a Compiler*.
*
* Summary:
* cBlock, dBlock : Display a basic block (call fgTableDispBasicBlock()).
* cBlocks, dBlocks : Display all the basic blocks of a function (call fgDispBasicBlocks()).
* cBlocksV, dBlocksV : Display all the basic blocks of a function (call fgDispBasicBlocks(true)).
* "V" means "verbose", and will dump all the trees.
* cTree, dTree : Display a tree (call gtDispTree()).
* cTreeLIR, dTreeLIR : Display a tree in LIR form (call gtDispLIRNode()).
* cTrees, dTrees : Display all the trees in a function (call fgDumpTrees()).
* cEH, dEH : Display the EH handler table (call fgDispHandlerTab()).
* cVar, dVar : Display a local variable given its number (call lvaDumpEntry()).
* cVarDsc, dVarDsc : Display a local variable given a LclVarDsc* (call lvaDumpEntry()).
* cVars, dVars : Display the local variable table (call lvaTableDump()).
* cVarsFinal, dVarsFinal : Display the local variable table (call lvaTableDump(FINAL_FRAME_LAYOUT)).
* cBlockCheapPreds, dBlockCheapPreds : Display a block's cheap predecessors (call block->dspCheapPreds()).
* cBlockPreds, dBlockPreds : Display a block's predecessors (call block->dspPreds()).
* cBlockSuccs, dBlockSuccs : Display a block's successors (call block->dspSuccs(compiler)).
* cReach, dReach : Display all block reachability (call fgDispReach()).
* cDoms, dDoms : Display all block dominators (call fgDispDoms()).
* cLiveness, dLiveness : Display per-block variable liveness (call fgDispBBLiveness()).
* cCVarSet, dCVarSet : Display a "converted" VARSET_TP: the varset is assumed to be tracked variable
* indices. These are converted to variable numbers and sorted. (Calls
* dumpConvertedVarSet()).
*
* cFuncIR, dFuncIR : Display all the basic blocks of a function in linear IR form.
* cLoopIR, dLoopIR : Display a loop in linear IR form.
* dLoopNumIR : Display a loop (given number) in linear IR form.
* cBlockIR, dBlockIR : Display a basic block in linear IR form.
* cTreeIR, dTreeIR : Display a tree in linear IR form.
* dTabStopIR : Display spaces to the next tab stop column
* cTreeTypeIR dTreeTypeIR : Display tree type
* cTreeKindsIR dTreeKindsIR : Display tree kinds
* cTreeFlagsIR dTreeFlagsIR : Display tree flags
* cOperandIR dOperandIR : Display tree operand
* cLeafIR dLeafIR : Display tree leaf
* cIndirIR dIndirIR : Display indir tree as [t#] or [leaf]
* cListIR dListIR : Display tree list
* cSsaNumIR dSsaNumIR : Display SSA number as <u|d:#>
* cValNumIR dValNumIR : Display Value number as <v{l|c}:#{,R}>
* cDependsIR : Display dependencies of a tree DEP(t# ...) node
* based on child comma tree nodes
* dFormatIR : Display dump format specified on command line
*
*
* The following don't require a Compiler* to work:
* dVarSet : Display a VARSET_TP (call dumpVarSet()).
* dRegMask : Display a regMaskTP (call dspRegMask(mask)).
*/
void cBlock(Compiler* comp, BasicBlock* block)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Block %u\n", sequenceNumber++);
comp->fgTableDispBasicBlock(block);
}
void cBlocks(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Blocks %u\n", sequenceNumber++);
comp->fgDispBasicBlocks();
}
void cBlocksV(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *BlocksV %u\n", sequenceNumber++);
comp->fgDispBasicBlocks(true);
}
void cTree(Compiler* comp, GenTree* tree)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Tree %u\n", sequenceNumber++);
comp->gtDispTree(tree, nullptr, ">>>");
}
void cTreeLIR(Compiler* comp, GenTree* tree)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *TreeLIR %u\n", sequenceNumber++);
comp->gtDispLIRNode(tree);
}
void cTrees(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Trees %u\n", sequenceNumber++);
comp->fgDumpTrees(comp->fgFirstBB, nullptr);
}
void cEH(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *EH %u\n", sequenceNumber++);
comp->fgDispHandlerTab();
}
void cVar(Compiler* comp, unsigned lclNum)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Var %u\n", sequenceNumber++);
comp->lvaDumpEntry(lclNum, Compiler::FINAL_FRAME_LAYOUT);
}
void cVarDsc(Compiler* comp, LclVarDsc* varDsc)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *VarDsc %u\n", sequenceNumber++);
unsigned lclNum = (unsigned)(varDsc - comp->lvaTable);
comp->lvaDumpEntry(lclNum, Compiler::FINAL_FRAME_LAYOUT);
}
void cVars(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Vars %u\n", sequenceNumber++);
comp->lvaTableDump();
}
void cVarsFinal(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Vars %u\n", sequenceNumber++);
comp->lvaTableDump(Compiler::FINAL_FRAME_LAYOUT);
}
void cBlockCheapPreds(Compiler* comp, BasicBlock* block)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *BlockCheapPreds %u\n",
sequenceNumber++);
block->dspCheapPreds();
}
void cBlockPreds(Compiler* comp, BasicBlock* block)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *BlockPreds %u\n", sequenceNumber++);
block->dspPreds();
}
void cBlockSuccs(Compiler* comp, BasicBlock* block)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *BlockSuccs %u\n", sequenceNumber++);
block->dspSuccs(comp);
}
void cReach(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Reach %u\n", sequenceNumber++);
comp->fgDispReach();
}
void cDoms(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Doms %u\n", sequenceNumber++);
comp->fgDispDoms();
}
void cLiveness(Compiler* comp)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== *Liveness %u\n", sequenceNumber++);
comp->fgDispBBLiveness();
}
void cCVarSet(Compiler* comp, VARSET_VALARG_TP vars)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== dCVarSet %u\n", sequenceNumber++);
dumpConvertedVarSet(comp, vars);
printf("\n"); // dumpConvertedVarSet() doesn't emit a trailing newline
}
void dBlock(BasicBlock* block)
{
cBlock(JitTls::GetCompiler(), block);
}
void dBlocks()
{
cBlocks(JitTls::GetCompiler());
}
void dBlocksV()
{
cBlocksV(JitTls::GetCompiler());
}
void dTree(GenTree* tree)
{
cTree(JitTls::GetCompiler(), tree);
}
void dTreeLIR(GenTree* tree)
{
cTreeLIR(JitTls::GetCompiler(), tree);
}
void dTrees()
{
cTrees(JitTls::GetCompiler());
}
void dEH()
{
cEH(JitTls::GetCompiler());
}
void dVar(unsigned lclNum)
{
cVar(JitTls::GetCompiler(), lclNum);
}
void dVarDsc(LclVarDsc* varDsc)
{
cVarDsc(JitTls::GetCompiler(), varDsc);
}
void dVars()
{
cVars(JitTls::GetCompiler());
}
void dVarsFinal()
{
cVarsFinal(JitTls::GetCompiler());
}
void dBlockPreds(BasicBlock* block)
{
cBlockPreds(JitTls::GetCompiler(), block);
}
void dBlockCheapPreds(BasicBlock* block)
{
cBlockCheapPreds(JitTls::GetCompiler(), block);
}
void dBlockSuccs(BasicBlock* block)
{
cBlockSuccs(JitTls::GetCompiler(), block);
}
void dReach()
{
cReach(JitTls::GetCompiler());
}
void dDoms()
{
cDoms(JitTls::GetCompiler());
}
void dLiveness()
{
cLiveness(JitTls::GetCompiler());
}
void dCVarSet(VARSET_VALARG_TP vars)
{
cCVarSet(JitTls::GetCompiler(), vars);
}
void dRegMask(regMaskTP mask)
{
static unsigned sequenceNumber = 0; // separate calls with a number to indicate this function has been called
printf("===================================================================== dRegMask %u\n", sequenceNumber++);
dspRegMask(mask);
printf("\n"); // dspRegMask() doesn't emit a trailing newline
}
void dBlockList(BasicBlockList* list)
{
printf("WorkList: ");
while (list != nullptr)
{
printf("BB%02u ", list->block->bbNum);
list = list->next;
}
printf("\n");
}
// Global variables available in debug mode. That are set by debug APIs for finding
// Trees, Stmts, and/or Blocks using id or bbNum.
// That can be used in watch window or as a way to get address of fields for data break points.
GenTree* dbTree;
GenTreeStmt* dbStmt;
BasicBlock* dbTreeBlock;
BasicBlock* dbBlock;
// Debug APIs for finding Trees, Stmts, and/or Blocks.
// As a side effect, they set the debug variables above.
GenTree* dFindTree(GenTree* tree, unsigned id)
{
GenTree* child;
if (tree == nullptr)
{
return nullptr;
}
if (tree->gtTreeID == id)
{
dbTree = tree;
return tree;
}
unsigned childCount = tree->NumChildren();
for (unsigned childIndex = 0; childIndex < childCount; childIndex++)
{
child = tree->GetChild(childIndex);
child = dFindTree(child, id);
if (child != nullptr)
{
return child;
}
}
return nullptr;
}
GenTree* dFindTree(unsigned id)
{
Compiler* comp = JitTls::GetCompiler();
BasicBlock* block;
GenTree* tree;
dbTreeBlock = nullptr;
dbTree = nullptr;
for (block = comp->fgFirstBB; block != nullptr; block = block->bbNext)
{
for (GenTreeStmt* stmt = block->firstStmt(); stmt; stmt = stmt->gtNextStmt)
{
tree = dFindTree(stmt, id);
if (tree != nullptr)
{
dbTreeBlock = block;
return tree;
}
}
}
return nullptr;
}
GenTreeStmt* dFindStmt(unsigned id)
{
Compiler* comp = JitTls::GetCompiler();
BasicBlock* block;
dbStmt = nullptr;
unsigned stmtId = 0;
for (block = comp->fgFirstBB; block != nullptr; block = block->bbNext)
{
for (GenTreeStmt* stmt = block->firstStmt(); stmt; stmt = stmt->gtNextStmt)
{
stmtId++;
if (stmtId == id)
{
dbStmt = stmt;
return stmt;
}
}
}
return nullptr;
}
BasicBlock* dFindBlock(unsigned bbNum)
{
Compiler* comp = JitTls::GetCompiler();
BasicBlock* block = nullptr;
dbBlock = nullptr;
for (block = comp->fgFirstBB; block != nullptr; block = block->bbNext)
{
if (block->bbNum == bbNum)
{
dbBlock = block;
break;
}
}
return block;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out function in linear IR form
*/
void cFuncIR(Compiler* comp)
{
BasicBlock* block;
printf("Method %s::%s, hsh=0x%x\n", comp->info.compClassName, comp->info.compMethodName,
comp->info.compMethodHash());
printf("\n");
for (block = comp->fgFirstBB; block != nullptr; block = block->bbNext)
{
cBlockIR(comp, block);
}
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out the format specifiers from COMPlus_JitDumpIRFormat
*/
void dFormatIR()
{
Compiler* comp = JitTls::GetCompiler();
if (comp->dumpIRFormat != nullptr)
{
printf("COMPlus_JitDumpIRFormat=%ls", comp->dumpIRFormat);
}
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out function in linear IR form
*/
void dFuncIR()
{
cFuncIR(JitTls::GetCompiler());
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out loop in linear IR form
*/
void cLoopIR(Compiler* comp, Compiler::LoopDsc* loop)
{
BasicBlock* blockHead = loop->lpHead;
BasicBlock* blockFirst = loop->lpFirst;
BasicBlock* blockTop = loop->lpTop;
BasicBlock* blockEntry = loop->lpEntry;
BasicBlock* blockBottom = loop->lpBottom;
BasicBlock* blockExit = loop->lpExit;
BasicBlock* blockLast = blockBottom->bbNext;
BasicBlock* block;
printf("LOOP\n");
printf("\n");
printf("HEAD BB%02u\n", blockHead->bbNum);
printf("FIRST BB%02u\n", blockFirst->bbNum);
printf("TOP BB%02u\n", blockTop->bbNum);
printf("ENTRY BB%02u\n", blockEntry->bbNum);
if (loop->lpExitCnt == 1)
{
printf("EXIT BB%02u\n", blockExit->bbNum);
}
else
{
printf("EXITS %u", loop->lpExitCnt);
}
printf("BOTTOM BB%02u\n", blockBottom->bbNum);
printf("\n");
cBlockIR(comp, blockHead);
for (block = blockFirst; ((block != nullptr) && (block != blockLast)); block = block->bbNext)
{
cBlockIR(comp, block);
}
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out loop in linear IR form
*/
void dLoopIR(Compiler::LoopDsc* loop)
{
cLoopIR(JitTls::GetCompiler(), loop);
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out loop (given loop number) in linear IR form
*/
void dLoopNumIR(unsigned loopNum)
{
Compiler* comp = JitTls::GetCompiler();
if (loopNum >= comp->optLoopCount)
{
printf("loopNum %u out of range\n");
return;
}
Compiler::LoopDsc* loop = &comp->optLoopTable[loopNum];
cLoopIR(JitTls::GetCompiler(), loop);
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump spaces to specified tab stop
*/
int dTabStopIR(int curr, int tabstop)
{
int chars = 0;
if (tabstop <= curr)
{
chars += printf(" ");
}
for (int i = curr; i < tabstop; i++)
{
chars += printf(" ");
}
return chars;
}
void cNodeIR(Compiler* comp, GenTree* tree);
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out block in linear IR form
*/
void cBlockIR(Compiler* comp, BasicBlock* block)
{
bool noStmts = comp->dumpIRNoStmts;
bool trees = comp->dumpIRTrees;
if (comp->dumpIRBlockHeaders)
{
block->dspBlockHeader(comp);
}
else
{
printf("BB%02u:\n", block->bbNum);
}
printf("\n");
if (!block->IsLIR())
{
for (GenTreeStmt* stmt = block->firstStmt(); stmt; stmt = stmt->gtNextStmt)
{
// Print current stmt.
if (trees)
{
cTree(comp, stmt);
printf("\n");
printf("=====================================================================\n");
}
if (comp->compRationalIRForm)
{
GenTree* tree;
foreach_treenode_execution_order(tree, stmt)
{
cNodeIR(comp, tree);
}
}
else
{
cTreeIR(comp, stmt);
}
if (!noStmts && !trees)
{
printf("\n");
}
}
}
else
{
for (GenTree* node = block->bbTreeList; node != nullptr; node = node->gtNext)
{
cNodeIR(comp, node);
}
}
int chars = 0;
chars += dTabStopIR(chars, COLUMN_OPCODE);
chars += printf(" ");
switch (block->bbJumpKind)
{
case BBJ_EHFINALLYRET:
chars += printf("BRANCH(EHFINALLYRET)");
break;
case BBJ_EHFILTERRET:
chars += printf("BRANCH(EHFILTERRET)");
break;
case BBJ_EHCATCHRET:
chars += printf("BRANCH(EHCATCHRETURN)");
chars += dTabStopIR(chars, COLUMN_OPERANDS);
chars += printf(" BB%02u", block->bbJumpDest->bbNum);
break;
case BBJ_THROW:
chars += printf("BRANCH(THROW)");
break;
case BBJ_RETURN:
chars += printf("BRANCH(RETURN)");
break;
case BBJ_NONE:
// For fall-through blocks
chars += printf("BRANCH(NONE)");
break;
case BBJ_ALWAYS:
chars += printf("BRANCH(ALWAYS)");
chars += dTabStopIR(chars, COLUMN_OPERANDS);
chars += printf(" BB%02u", block->bbJumpDest->bbNum);
if (block->bbFlags & BBF_KEEP_BBJ_ALWAYS)
{
chars += dTabStopIR(chars, COLUMN_KINDS);
chars += printf("; [KEEP_BBJ_ALWAYS]");
}
break;
case BBJ_LEAVE:
chars += printf("BRANCH(LEAVE)");
chars += dTabStopIR(chars, COLUMN_OPERANDS);
chars += printf(" BB%02u", block->bbJumpDest->bbNum);
break;
case BBJ_CALLFINALLY:
chars += printf("BRANCH(CALLFINALLY)");
chars += dTabStopIR(chars, COLUMN_OPERANDS);
chars += printf(" BB%02u", block->bbJumpDest->bbNum);
break;
case BBJ_COND:
chars += printf("BRANCH(COND)");
chars += dTabStopIR(chars, COLUMN_OPERANDS);
chars += printf(" BB%02u", block->bbJumpDest->bbNum);
break;
case BBJ_SWITCH:
chars += printf("BRANCH(SWITCH)");
chars += dTabStopIR(chars, COLUMN_OPERANDS);
unsigned jumpCnt;
jumpCnt = block->bbJumpSwt->bbsCount;
BasicBlock** jumpTab;
jumpTab = block->bbJumpSwt->bbsDstTab;
do
{
chars += printf("%c BB%02u", (jumpTab == block->bbJumpSwt->bbsDstTab) ? ' ' : ',', (*jumpTab)->bbNum);
} while (++jumpTab, --jumpCnt);
break;
default:
unreached();
break;
}
printf("\n");
if (block->bbNext != nullptr)
{
printf("\n");
}
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out block in linear IR form
*/
void dBlockIR(BasicBlock* block)
{
cBlockIR(JitTls::GetCompiler(), block);
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree node type for linear IR form
*/
int cTreeTypeIR(Compiler* comp, GenTree* tree)
{
int chars = 0;
var_types type = tree->TypeGet();
const char* typeName = varTypeName(type);
chars += printf(".%s", typeName);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree node type for linear IR form
*/
int dTreeTypeIR(GenTree* tree)
{
int chars = cTreeTypeIR(JitTls::GetCompiler(), tree);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree node kind for linear IR form
*/
int cTreeKindsIR(Compiler* comp, GenTree* tree)
{
int chars = 0;
unsigned kind = tree->OperKind();
chars += printf("kinds=");
if (kind == GTK_SPECIAL)
{
chars += printf("[SPECIAL]");
}
if (kind & GTK_CONST)
{
chars += printf("[CONST]");
}
if (kind & GTK_LEAF)
{
chars += printf("[LEAF]");
}
if (kind & GTK_UNOP)
{
chars += printf("[UNOP]");
}
if (kind & GTK_BINOP)
{
chars += printf("[BINOP]");
}
if (kind & GTK_LOGOP)
{
chars += printf("[LOGOP]");
}
if (kind & GTK_ASGOP)
{
chars += printf("[ASGOP]");
}
if (kind & GTK_COMMUTE)
{
chars += printf("[COMMUTE]");
}
if (kind & GTK_EXOP)
{
chars += printf("[EXOP]");
}
if (kind & GTK_LOCAL)
{
chars += printf("[LOCAL]");
}
if (kind & GTK_SMPOP)
{
chars += printf("[SMPOP]");
}
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree node kind for linear IR form
*/
int dTreeKindsIR(GenTree* tree)
{
int chars = cTreeKindsIR(JitTls::GetCompiler(), tree);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree node flags for linear IR form
*/
int cTreeFlagsIR(Compiler* comp, GenTree* tree)
{
int chars = 0;
if (tree->gtFlags != 0)
{
chars += printf("flags=");
// Node flags
CLANG_FORMAT_COMMENT_ANCHOR;
#if defined(DEBUG)
#if SMALL_TREE_NODES
if (comp->dumpIRNodes)
{
if (tree->gtDebugFlags & GTF_DEBUG_NODE_LARGE)
{
chars += printf("[NODE_LARGE]");
}
if (tree->gtDebugFlags & GTF_DEBUG_NODE_SMALL)
{
chars += printf("[NODE_SMALL]");
}
}
#endif // SMALL_TREE_NODES
if (tree->gtDebugFlags & GTF_DEBUG_NODE_MORPHED)
{
chars += printf("[MORPHED]");
}
#endif // defined(DEBUG)
if (tree->gtFlags & GTF_COLON_COND)
{
chars += printf("[COLON_COND]");
}
// Operator flags
genTreeOps op = tree->OperGet();
switch (op)
{
case GT_LCL_VAR:
case GT_LCL_VAR_ADDR:
case GT_LCL_FLD:
case GT_LCL_FLD_ADDR:
case GT_STORE_LCL_FLD:
case GT_STORE_LCL_VAR:
case GT_REG_VAR:
if (tree->gtFlags & GTF_VAR_DEF)
{
chars += printf("[VAR_DEF]");
}
if (tree->gtFlags & GTF_VAR_USEASG)
{
chars += printf("[VAR_USEASG]");
}
if (tree->gtFlags & GTF_VAR_USEDEF)
{
chars += printf("[VAR_USEDEF]");
}
if (tree->gtFlags & GTF_VAR_CAST)
{
chars += printf("[VAR_CAST]");
}
if (tree->gtFlags & GTF_VAR_ITERATOR)
{
chars += printf("[VAR_ITERATOR]");
}
if (tree->gtFlags & GTF_VAR_CLONED)
{
chars += printf("[VAR_CLONED]");
}
if (tree->gtFlags & GTF_VAR_DEATH)
{
chars += printf("[VAR_DEATH]");
}
if (tree->gtFlags & GTF_VAR_ARR_INDEX)
{
chars += printf("[VAR_ARR_INDEX]");
}
#if defined(DEBUG)
if (tree->gtDebugFlags & GTF_DEBUG_VAR_CSE_REF)
{
chars += printf("[VAR_CSE_REF]");
}
#endif
if (op == GT_REG_VAR)
{
if (tree->gtFlags & GTF_REG_BIRTH)
{
chars += printf("[REG_BIRTH]");
}
}
break;
case GT_NOP:
if (tree->gtFlags & GTF_NOP_DEATH)
{
chars += printf("[NOP_DEATH]");
}
break;
case GT_NO_OP:
if (tree->gtFlags & GTF_NO_OP_NO)
{
chars += printf("[NO_OP_NO]");
}
break;
case GT_FIELD:
if (tree->gtFlags & GTF_FLD_NULLCHECK)
{
chars += printf("[FLD_NULLCHECK]");
}
if (tree->gtFlags & GTF_FLD_VOLATILE)
{
chars += printf("[FLD_VOLATILE]");
}
break;
case GT_INDEX:
if (tree->gtFlags & GTF_INX_RNGCHK)
{
chars += printf("[INX_RNGCHK]");
}
if (tree->gtFlags & GTF_INX_REFARR_LAYOUT)
{
chars += printf("[INX_REFARR_LAYOUT]");
}
if (tree->gtFlags & GTF_INX_STRING_LAYOUT)
{
chars += printf("[INX_STRING_LAYOUT]");
}
break;
case GT_IND:
case GT_STOREIND:
if (tree->gtFlags & GTF_IND_VOLATILE)
{
chars += printf("[IND_VOLATILE]");
}
if (tree->gtFlags & GTF_IND_REFARR_LAYOUT)
{
chars += printf("[IND_REFARR_LAYOUT]");
}
if (tree->gtFlags & GTF_IND_TGTANYWHERE)
{
chars += printf("[IND_TGTANYWHERE]");
}
if (tree->gtFlags & GTF_IND_TLS_REF)
{
chars += printf("[IND_TLS_REF]");
}
if (tree->gtFlags & GTF_IND_ASG_LHS)
{
chars += printf("[IND_ASG_LHS]");
}
if (tree->gtFlags & GTF_IND_UNALIGNED)
{
chars += printf("[IND_UNALIGNED]");
}
if (tree->gtFlags & GTF_IND_INVARIANT)
{
chars += printf("[IND_INVARIANT]");
}
if (tree->gtFlags & GTF_IND_ARR_LEN)
{
chars += printf("[IND_ARR_INDEX]");
}
break;
case GT_CLS_VAR:
if (tree->gtFlags & GTF_CLS_VAR_ASG_LHS)
{
chars += printf("[CLS_VAR_ASG_LHS]");
}
break;
case GT_ADDR:
if (tree->gtFlags & GTF_ADDR_ONSTACK)
{
chars += printf("[ADDR_ONSTACK]");
}
break;
case GT_MUL:
#if !defined(_TARGET_64BIT_) && !defined(LEGACY_BACKEND)
case GT_MUL_LONG:
#endif
if (tree->gtFlags & GTF_MUL_64RSLT)
{
chars += printf("[64RSLT]");
}
if (tree->gtFlags & GTF_ADDRMODE_NO_CSE)
{
chars += printf("[ADDRMODE_NO_CSE]");
}
break;
case GT_ADD:
if (tree->gtFlags & GTF_ADDRMODE_NO_CSE)
{
chars += printf("[ADDRMODE_NO_CSE]");
}
break;
case GT_LSH:
if (tree->gtFlags & GTF_ADDRMODE_NO_CSE)
{
chars += printf("[ADDRMODE_NO_CSE]");
}
break;
case GT_MOD:
case GT_UMOD:
if (tree->gtFlags & GTF_MOD_INT_RESULT)
{
chars += printf("[MOD_INT_RESULT]");
}
break;
case GT_EQ:
case GT_NE:
case GT_LT:
case GT_LE:
case GT_GT:
case GT_GE:
if (tree->gtFlags & GTF_RELOP_NAN_UN)
{
chars += printf("[RELOP_NAN_UN]");
}
if (tree->gtFlags & GTF_RELOP_JMP_USED)
{
chars += printf("[RELOP_JMP_USED]");
}
if (tree->gtFlags & GTF_RELOP_QMARK)
{
chars += printf("[RELOP_QMARK]");
}
break;
case GT_QMARK:
if (tree->gtFlags & GTF_QMARK_CAST_INSTOF)
{
chars += printf("[QMARK_CAST_INSTOF]");
}
break;
case GT_BOX:
if (tree->gtFlags & GTF_BOX_VALUE)
{
chars += printf("[BOX_VALUE]");
}
break;
case GT_CNS_INT:
{
unsigned handleKind = (tree->gtFlags & GTF_ICON_HDL_MASK);
switch (handleKind)
{
case GTF_ICON_SCOPE_HDL:
chars += printf("[ICON_SCOPE_HDL]");
break;
case GTF_ICON_CLASS_HDL:
chars += printf("[ICON_CLASS_HDL]");
break;
case GTF_ICON_METHOD_HDL:
chars += printf("[ICON_METHOD_HDL]");
break;
case GTF_ICON_FIELD_HDL:
chars += printf("[ICON_FIELD_HDL]");
break;
case GTF_ICON_STATIC_HDL:
chars += printf("[ICON_STATIC_HDL]");
break;
case GTF_ICON_STR_HDL:
chars += printf("[ICON_STR_HDL]");
break;
case GTF_ICON_PSTR_HDL:
chars += printf("[ICON_PSTR_HDL]");
break;
case GTF_ICON_PTR_HDL:
chars += printf("[ICON_PTR_HDL]");
break;
case GTF_ICON_VARG_HDL:
chars += printf("[ICON_VARG_HDL]");
break;
case GTF_ICON_PINVKI_HDL:
chars += printf("[ICON_PINVKI_HDL]");
break;
case GTF_ICON_TOKEN_HDL:
chars += printf("[ICON_TOKEN_HDL]");
break;
case GTF_ICON_TLS_HDL:
chars += printf("[ICON_TLD_HDL]");
break;
case GTF_ICON_FTN_ADDR:
chars += printf("[ICON_FTN_ADDR]");
break;
case GTF_ICON_CIDMID_HDL:
chars += printf("[ICON_CIDMID_HDL]");
break;
case GTF_ICON_BBC_PTR:
chars += printf("[ICON_BBC_PTR]");
break;
case GTF_ICON_FIELD_OFF:
chars += printf("[ICON_FIELD_OFF]");
break;
}
}
break;
case GT_OBJ:
case GT_STORE_OBJ:
if (tree->AsObj()->HasGCPtr())
{
chars += printf("[BLK_HASGCPTR]");
}
__fallthrough;
case GT_BLK:
case GT_DYN_BLK:
case GT_STORE_BLK:
case GT_STORE_DYN_BLK:
if (tree->gtFlags & GTF_BLK_VOLATILE)
{
chars += printf("[BLK_VOLATILE]");
}
if (tree->AsBlk()->IsUnaligned())
{
chars += printf("[BLK_UNALIGNED]");
}
break;
case GT_CALL:
if (tree->gtFlags & GTF_CALL_UNMANAGED)
{
chars += printf("[CALL_UNMANAGED]");
}
if (tree->gtFlags & GTF_CALL_INLINE_CANDIDATE)
{
chars += printf("[CALL_INLINE_CANDIDATE]");
}
if (tree->gtFlags & GTF_CALL_NONVIRT)
{
chars += printf("[CALL_NONVIRT]");
}
if (tree->gtFlags & GTF_CALL_VIRT_VTABLE)
{
chars += printf("[CALL_VIRT_VTABLE]");
}
if (tree->gtFlags & GTF_CALL_VIRT_STUB)
{
chars += printf("[CALL_VIRT_STUB]");
}
if (tree->gtFlags & GTF_CALL_NULLCHECK)
{
chars += printf("[CALL_NULLCHECK]");
}
if (tree->gtFlags & GTF_CALL_POP_ARGS)
{
chars += printf("[CALL_POP_ARGS]");
}
if (tree->gtFlags & GTF_CALL_HOISTABLE)
{
chars += printf("[CALL_HOISTABLE]");
}
if (tree->gtFlags & GTF_CALL_REG_SAVE)
{
chars += printf("[CALL_REG_SAVE]");
}
// More flags associated with calls.
{
GenTreeCall* call = tree->AsCall();
if (call->gtCallMoreFlags & GTF_CALL_M_EXPLICIT_TAILCALL)
{
chars += printf("[CALL_M_EXPLICIT_TAILCALL]");
}
if (call->gtCallMoreFlags & GTF_CALL_M_TAILCALL)
{
chars += printf("[CALL_M_TAILCALL]");
}
if (call->gtCallMoreFlags & GTF_CALL_M_VARARGS)
{
chars += printf("[CALL_M_VARARGS]");
}
if (call->gtCallMoreFlags & GTF_CALL_M_RETBUFFARG)
{
chars += printf("[CALL_M_RETBUFFARG]");
}
if (call->gtCallMoreFlags & GTF_CALL_M_DELEGATE_INV)
{
chars += printf("[CALL_M_DELEGATE_INV]");
}
if (call->gtCallMoreFlags & GTF_CALL_M_NOGCCHECK)
{
chars += printf("[CALL_M_NOGCCHECK]");
}
if (call->gtCallMoreFlags & GTF_CALL_M_SPECIAL_INTRINSIC)
{
chars += printf("[CALL_M_SPECIAL_INTRINSIC]");
}
if (call->IsUnmanaged())
{
if (call->gtCallMoreFlags & GTF_CALL_M_UNMGD_THISCALL)
{
chars += printf("[CALL_M_UNMGD_THISCALL]");
}
}
else if (call->IsVirtualStub())
{
if (call->gtCallMoreFlags & GTF_CALL_M_VIRTSTUB_REL_INDIRECT)
{
chars += printf("[CALL_M_VIRTSTUB_REL_INDIRECT]");
}
}
else if (!call->IsVirtual())
{
if (call->gtCallMoreFlags & GTF_CALL_M_NONVIRT_SAME_THIS)
{
chars += printf("[CALL_M_NONVIRT_SAME_THIS]");
}
}
if (call->gtCallMoreFlags & GTF_CALL_M_FRAME_VAR_DEATH)
{
chars += printf("[CALL_M_FRAME_VAR_DEATH]");
}
#ifndef LEGACY_BACKEND
if (call->gtCallMoreFlags & GTF_CALL_M_TAILCALL_VIA_HELPER)
{
chars += printf("[CALL_M_TAILCALL_VIA_HELPER]");
}
#endif
#if FEATURE_TAILCALL_OPT
if (call->gtCallMoreFlags & GTF_CALL_M_IMPLICIT_TAILCALL)
{
chars += printf("[CALL_M_IMPLICIT_TAILCALL]");
}
#endif
if (call->gtCallMoreFlags & GTF_CALL_M_PINVOKE)
{
chars += printf("[CALL_M_PINVOKE]");
}
}
break;
case GT_STMT:
if (tree->gtFlags & GTF_STMT_CMPADD)
{
chars += printf("[STMT_CMPADD]");
}
if (tree->gtFlags & GTF_STMT_HAS_CSE)
{
chars += printf("[STMT_HAS_CSE]");
}
break;
default:
{
unsigned flags = (tree->gtFlags & (~(unsigned)(GTF_COMMON_MASK | GTF_OVERFLOW)));
if (flags != 0)
{
chars += printf("[%08X]", flags);
}
}
break;
}
// Common flags.
if (tree->gtFlags & GTF_ASG)
{
chars += printf("[ASG]");
}
if (tree->gtFlags & GTF_CALL)
{
chars += printf("[CALL]");
}
switch (op)
{
case GT_MUL:
case GT_CAST:
case GT_ADD:
case GT_SUB:
case GT_ASG_ADD:
case GT_ASG_SUB:
if (tree->gtFlags & GTF_OVERFLOW)
{
chars += printf("[OVERFLOW]");
}
break;
default:
break;
}
if (tree->gtFlags & GTF_EXCEPT)
{
chars += printf("[EXCEPT]");
}
if (tree->gtFlags & GTF_GLOB_REF)
{
chars += printf("[GLOB_REF]");
}
if (tree->gtFlags & GTF_ORDER_SIDEEFF)
{
chars += printf("[ORDER_SIDEEFF]");
}
if (tree->gtFlags & GTF_REVERSE_OPS)
{
if (op != GT_LCL_VAR)
{
chars += printf("[REVERSE_OPS]");
}
}
if (tree->gtFlags & GTF_REG_VAL)
{
chars += printf("[REG_VAL]");
}
if (tree->gtFlags & GTF_SPILLED)
{
chars += printf("[SPILLED_OPER]");
}
#if defined(LEGACY_BACKEND)
if (tree->gtFlags & GTF_SPILLED_OP2)
{
chars += printf("[SPILLED_OP2]");
}
#endif
if (tree->gtFlags & GTF_ZSF_SET)
{
chars += printf("[ZSF_SET]");
}
#if FEATURE_SET_FLAGS
if (tree->gtFlags & GTF_SET_FLAGS)
{
if ((op != GT_IND) && (op != GT_STOREIND))
{
chars += printf("[ZSF_SET_FLAGS]");
}
}
#endif
if (tree->gtFlags & GTF_IND_NONFAULTING)
{
if ((op == GT_IND) || (op == GT_STOREIND))
{
chars += printf("[IND_NONFAULTING]");
}
}
if (tree->gtFlags & GTF_MAKE_CSE)
{
chars += printf("[MAKE_CSE]");
}
if (tree->gtFlags & GTF_DONT_CSE)
{
chars += printf("[DONT_CSE]");
}
if (tree->gtFlags & GTF_BOOLEAN)
{
chars += printf("[BOOLEAN]");
}
if (tree->gtFlags & GTF_SMALL_OK)
{
chars += printf("[SMALL_OK]");
}
if (tree->gtFlags & GTF_UNSIGNED)
{
chars += printf("[SMALL_UNSIGNED]");
}
if (tree->gtFlags & GTF_LATE_ARG)
{
chars += printf("[SMALL_LATE_ARG]");
}
if (tree->gtFlags & GTF_SPILL)
{
chars += printf("[SPILL]");
}
if (tree->gtFlags & GTF_SPILL_HIGH)
{
chars += printf("[SPILL_HIGH]");
}
if (tree->gtFlags & GTF_REUSE_REG_VAL)
{
if (op == GT_CNS_INT)
{
chars += printf("[REUSE_REG_VAL]");
}
}
}
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree node flags for linear IR form
*/
int dTreeFlagsIR(GenTree* tree)
{
int chars = cTreeFlagsIR(JitTls::GetCompiler(), tree);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out SSA number on tree node for linear IR form
*/
int cSsaNumIR(Compiler* comp, GenTree* tree)
{
int chars = 0;
if (tree->gtLclVarCommon.HasSsaName())
{
if (tree->gtFlags & GTF_VAR_USEASG)
{
assert(tree->gtFlags & GTF_VAR_DEF);
chars += printf("<u:%d><d:%d>", tree->gtLclVarCommon.gtSsaNum, comp->GetSsaNumForLocalVarDef(tree));
}
else
{
chars += printf("<%s:%d>", (tree->gtFlags & GTF_VAR_DEF) ? "d" : "u", tree->gtLclVarCommon.gtSsaNum);
}
}
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out SSA number on tree node for linear IR form
*/
int dSsaNumIR(GenTree* tree)
{
int chars = cSsaNumIR(JitTls::GetCompiler(), tree);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out Value Number on tree node for linear IR form
*/
int cValNumIR(Compiler* comp, GenTree* tree)
{
int chars = 0;
if (tree->gtVNPair.GetLiberal() != ValueNumStore::NoVN)
{
assert(tree->gtVNPair.GetConservative() != ValueNumStore::NoVN);
ValueNumPair vnp = tree->gtVNPair;
ValueNum vn;
if (vnp.BothEqual())
{
chars += printf("<v:");
vn = vnp.GetLiberal();
chars += printf(STR_VN "%x", vn);
if (ValueNumStore::isReservedVN(vn))
{
chars += printf("R");
}
chars += printf(">");
}
else
{
vn = vnp.GetLiberal();
chars += printf("<v:");
chars += printf(STR_VN "%x", vn);
if (ValueNumStore::isReservedVN(vn))
{
chars += printf("R");
}
chars += printf(",");
vn = vnp.GetConservative();
chars += printf(STR_VN "%x", vn);
if (ValueNumStore::isReservedVN(vn))
{
chars += printf("R");
}
chars += printf(">");
}
}
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out Value Number on tree node for linear IR form
*/
int dValNumIR(GenTree* tree)
{
int chars = cValNumIR(JitTls::GetCompiler(), tree);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree leaf node for linear IR form
*/
int cLeafIR(Compiler* comp, GenTree* tree)
{
int chars = 0;
genTreeOps op = tree->OperGet();
const char* ilKind = nullptr;
const char* ilName = nullptr;
unsigned ilNum = 0;
unsigned lclNum = 0;
bool hasSsa = false;
switch (op)
{
case GT_PHI_ARG:
case GT_LCL_VAR:
case GT_LCL_VAR_ADDR:
case GT_STORE_LCL_VAR:
case GT_REG_VAR:
lclNum = tree->gtLclVarCommon.gtLclNum;
comp->gtGetLclVarNameInfo(lclNum, &ilKind, &ilName, &ilNum);
if (ilName != nullptr)
{
chars += printf("%s", ilName);
}
else
{
LclVarDsc* varDsc = comp->lvaTable + lclNum;
chars += printf("%s%d", ilKind, ilNum);
if (comp->dumpIRLocals)
{
chars += printf("(V%02u", lclNum);
if (varDsc->lvTracked)
{
chars += printf(":T%02u", varDsc->lvVarIndex);
}
if (comp->dumpIRRegs)
{
if (varDsc->lvRegister)
{
if (isRegPairType(varDsc->TypeGet()))
{
chars += printf(":%s:%s",
getRegName(varDsc->lvOtherReg), // hi32
getRegName(varDsc->lvRegNum)); // lo32
}
else
{
chars += printf(":%s", getRegName(varDsc->lvRegNum));
}
}
else
{
switch (tree->GetRegTag())
{
case GenTree::GT_REGTAG_REG:
chars += printf(":%s", comp->compRegVarName(tree->gtRegNum));
break;
#if CPU_LONG_USES_REGPAIR
case GenTree::GT_REGTAG_REGPAIR:
chars += printf(":%s", comp->compRegPairName(tree->gtRegPair));
break;
#endif
default:
break;
}
}
}
chars += printf(")");
}
else if (comp->dumpIRRegs)
{
if (varDsc->lvRegister)
{
chars += printf("(");
if (isRegPairType(varDsc->TypeGet()))
{
chars += printf("%s:%s",
getRegName(varDsc->lvOtherReg), // hi32
getRegName(varDsc->lvRegNum)); // lo32
}
else
{
chars += printf("%s", getRegName(varDsc->lvRegNum));
}
chars += printf(")");
}
else
{
switch (tree->GetRegTag())
{
case GenTree::GT_REGTAG_REG:
chars += printf("(%s)", comp->compRegVarName(tree->gtRegNum));
break;
#if CPU_LONG_USES_REGPAIR
case GenTree::GT_REGTAG_REGPAIR:
chars += printf("(%s)", comp->compRegPairName(tree->gtRegPair));
break;
#endif
default:
break;
}
}
}
}
if (op == GT_REG_VAR)
{
if (isFloatRegType(tree->gtType))
{
assert(tree->gtRegVar.gtRegNum == tree->gtRegNum);
chars += printf("(FPV%u)", tree->gtRegNum);
}
else
{
chars += printf("(%s)", comp->compRegVarName(tree->gtRegVar.gtRegNum));
}
}
hasSsa = true;
break;
case GT_LCL_FLD:
case GT_LCL_FLD_ADDR:
case GT_STORE_LCL_FLD:
lclNum = tree->gtLclVarCommon.gtLclNum;
comp->gtGetLclVarNameInfo(lclNum, &ilKind, &ilName, &ilNum);
if (ilName != nullptr)
{
chars += printf("%s+%u", ilName, tree->gtLclFld.gtLclOffs);
}
else
{
chars += printf("%s%d+%u", ilKind, ilNum, tree->gtLclFld.gtLclOffs);
LclVarDsc* varDsc = comp->lvaTable + lclNum;
if (comp->dumpIRLocals)
{
chars += printf("(V%02u", lclNum);
if (varDsc->lvTracked)
{
chars += printf(":T%02u", varDsc->lvVarIndex);
}
if (comp->dumpIRRegs)
{
if (varDsc->lvRegister)
{
if (isRegPairType(varDsc->TypeGet()))
{
chars += printf(":%s:%s",
getRegName(varDsc->lvOtherReg), // hi32
getRegName(varDsc->lvRegNum)); // lo32
}
else
{
chars += printf(":%s", getRegName(varDsc->lvRegNum));
}
}
else
{
switch (tree->GetRegTag())
{
case GenTree::GT_REGTAG_REG:
chars += printf(":%s", comp->compRegVarName(tree->gtRegNum));
break;
#if CPU_LONG_USES_REGPAIR
case GenTree::GT_REGTAG_REGPAIR:
chars += printf(":%s", comp->compRegPairName(tree->gtRegPair));
break;
#endif
default:
break;
}
}
}
chars += printf(")");
}
else if (comp->dumpIRRegs)
{
if (varDsc->lvRegister)
{
chars += printf("(");
if (isRegPairType(varDsc->TypeGet()))
{
chars += printf("%s:%s",
getRegName(varDsc->lvOtherReg), // hi32
getRegName(varDsc->lvRegNum)); // lo32
}
else
{
chars += printf("%s", getRegName(varDsc->lvRegNum));
}
chars += printf(")");
}
else
{
switch (tree->GetRegTag())
{
case GenTree::GT_REGTAG_REG:
chars += printf("(%s)", comp->compRegVarName(tree->gtRegNum));
break;
#if CPU_LONG_USES_REGPAIR
case GenTree::GT_REGTAG_REGPAIR:
chars += printf("(%s)", comp->compRegPairName(tree->gtRegPair));
break;
#endif
default:
break;
}
}
}
}
// TODO: We probably want to expand field sequence.
// gtDispFieldSeq(tree->gtLclFld.gtFieldSeq);
hasSsa = true;
break;
case GT_CNS_INT:
if (tree->IsIconHandle())
{
#if 0
// TODO: Commented out because sometimes the CLR throws
// and exception when asking the names of some handles.
// Need to investigate.
const char* className;
const char* fieldName;
const char* methodName;
const wchar_t* str;
switch (tree->GetIconHandleFlag())
{
case GTF_ICON_SCOPE_HDL:
chars += printf("SCOPE(?)");
break;
case GTF_ICON_CLASS_HDL:
className = comp->eeGetClassName((CORINFO_CLASS_HANDLE)tree->gtIntCon.gtIconVal);
chars += printf("CLASS(%s)", className);
break;
case GTF_ICON_METHOD_HDL:
methodName = comp->eeGetMethodName((CORINFO_METHOD_HANDLE)tree->gtIntCon.gtIconVal,
&className);
chars += printf("METHOD(%s.%s)", className, methodName);
break;
case GTF_ICON_FIELD_HDL:
fieldName = comp->eeGetFieldName((CORINFO_FIELD_HANDLE)tree->gtIntCon.gtIconVal,
&className);
chars += printf("FIELD(%s.%s) ", className, fieldName);
break;
case GTF_ICON_STATIC_HDL:
fieldName = comp->eeGetFieldName((CORINFO_FIELD_HANDLE)tree->gtIntCon.gtIconVal,
&className);
chars += printf("STATIC_FIELD(%s.%s)", className, fieldName);
break;
case GTF_ICON_STR_HDL:
str = comp->eeGetCPString(tree->gtIntCon.gtIconVal);
chars += printf("\"%S\"", str);
break;
case GTF_ICON_PSTR_HDL:
chars += printf("PSTR(?)");
break;
case GTF_ICON_PTR_HDL:
chars += printf("PTR(?)");
break;
case GTF_ICON_VARG_HDL:
chars += printf("VARARG(?)");
break;
case GTF_ICON_PINVKI_HDL:
chars += printf("PINVOKE(?)");
break;
case GTF_ICON_TOKEN_HDL:
chars += printf("TOKEN(%08X)", tree->gtIntCon.gtIconVal);
break;
case GTF_ICON_TLS_HDL:
chars += printf("TLS(?)");
break;
case GTF_ICON_FTN_ADDR:
chars += printf("FTN(?)");
break;
case GTF_ICON_CIDMID_HDL:
chars += printf("CIDMID(?)");
break;
case GTF_ICON_BBC_PTR:
chars += printf("BBC(?)");
break;
default:
chars += printf("HANDLE(?)");
break;
}
#else
#ifdef _TARGET_64BIT_
if ((tree->gtIntCon.gtIconVal & 0xFFFFFFFF00000000LL) != 0)
{
chars += printf("HANDLE(0x%llx)", dspPtr(tree->gtIntCon.gtIconVal));
}
else
#endif
{
chars += printf("HANDLE(0x%0x)", dspPtr(tree->gtIntCon.gtIconVal));
}
#endif
}
else
{
if (tree->TypeGet() == TYP_REF)
{
assert(tree->gtIntCon.gtIconVal == 0);
chars += printf("null");
}
#ifdef _TARGET_64BIT_
else if ((tree->gtIntCon.gtIconVal & 0xFFFFFFFF00000000LL) != 0)
{
chars += printf("0x%llx", tree->gtIntCon.gtIconVal);
}
else
#endif
{
chars += printf("%ld(0x%x)", tree->gtIntCon.gtIconVal, tree->gtIntCon.gtIconVal);
}
}
break;
case GT_CNS_LNG:
chars += printf("CONST(LONG)");
break;
case GT_CNS_DBL:
chars += printf("CONST(DOUBLE)");
break;
case GT_CNS_STR:
chars += printf("CONST(STR)");
break;
case GT_JMP:
{
const char* methodName;
const char* className;
methodName = comp->eeGetMethodName((CORINFO_METHOD_HANDLE)tree->gtVal.gtVal1, &className);
chars += printf(" %s.%s", className, methodName);
}
break;
case GT_NO_OP:
case GT_START_NONGC:
case GT_PROF_HOOK:
case GT_CATCH_ARG:
case GT_MEMORYBARRIER:
case GT_ARGPLACE:
case GT_PINVOKE_PROLOG:
#ifndef LEGACY_BACKEND
case GT_JMPTABLE:
#endif
// Do nothing.
break;
case GT_RET_EXPR:
chars += printf("t%d", tree->gtRetExpr.gtInlineCandidate->gtTreeID);
break;
case GT_PHYSREG:
chars += printf("%s", getRegName(tree->gtPhysReg.gtSrcReg, varTypeIsFloating(tree)));
break;
case GT_LABEL:
if (tree->gtLabel.gtLabBB)
{
chars += printf("BB%02u", tree->gtLabel.gtLabBB->bbNum);
}
else
{
chars += printf("BB?");
}
break;
case GT_IL_OFFSET:
if (tree->gtStmt.gtStmtILoffsx == BAD_IL_OFFSET)
{
chars += printf("?");
}
else
{
chars += printf("0x%x", jitGetILoffs(tree->gtStmt.gtStmtILoffsx));
}
break;
case GT_CLS_VAR:
case GT_CLS_VAR_ADDR:
default:
if (tree->OperIsLeaf())
{
chars += printf("<leaf nyi: %s>", tree->OpName(tree->OperGet()));
}
chars += printf("t%d", tree->gtTreeID);
break;
}
if (comp->dumpIRTypes)
{
chars += cTreeTypeIR(comp, tree);
}
if (comp->dumpIRValnums)
{
chars += cValNumIR(comp, tree);
}
if (hasSsa && comp->dumpIRSsa)
{
chars += cSsaNumIR(comp, tree);
}
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree leaf node for linear IR form
*/
int dLeafIR(GenTree* tree)
{
int chars = cLeafIR(JitTls::GetCompiler(), tree);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree indir node for linear IR form
*/
int cIndirIR(Compiler* comp, GenTree* tree)
{
assert(tree->gtOper == GT_IND);
int chars = 0;
GenTree* child;
chars += printf("[");
child = tree->GetChild(0);
chars += cLeafIR(comp, child);
chars += printf("]");
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree indir node for linear IR form
*/
int dIndirIR(GenTree* tree)
{
int chars = cIndirIR(JitTls::GetCompiler(), tree);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree operand node for linear IR form
*/
int cOperandIR(Compiler* comp, GenTree* operand)
{
int chars = 0;
if (operand == nullptr)
{
chars += printf("t?");
return chars;
}
bool dumpTypes = comp->dumpIRTypes;
bool dumpValnums = comp->dumpIRValnums;
bool foldIndirs = comp->dumpIRDataflow;
bool foldLeafs = comp->dumpIRNoLeafs;
bool foldCommas = comp->dumpIRDataflow;
bool dumpDataflow = comp->dumpIRDataflow;
bool foldLists = comp->dumpIRNoLists;
bool dumpRegs = comp->dumpIRRegs;
genTreeOps op = operand->OperGet();
if (foldLeafs && operand->OperIsLeaf())
{
if ((op == GT_ARGPLACE) && foldLists)
{
return chars;
}
chars += cLeafIR(comp, operand);
}
else if (dumpDataflow && (operand->OperIsAssignment() || (op == GT_STORE_LCL_VAR) || (op == GT_STORE_LCL_FLD)))
{
operand = operand->GetChild(0);
chars += cOperandIR(comp, operand);
}
else if ((op == GT_INDEX) && foldIndirs)
{
chars += printf("[t%d]", operand->gtTreeID);
if (dumpTypes)
{
chars += cTreeTypeIR(comp, operand);
}
if (dumpValnums)
{
chars += cValNumIR(comp, operand);
}
}
else if ((op == GT_IND) && foldIndirs)
{
chars += cIndirIR(comp, operand);
if (dumpTypes)
{
chars += cTreeTypeIR(comp, operand);
}
if (dumpValnums)
{
chars += cValNumIR(comp, operand);
}
}
else if ((op == GT_COMMA) && foldCommas)
{
operand = operand->GetChild(1);
chars += cOperandIR(comp, operand);
}
else if ((op == GT_LIST) && foldLists)
{
GenTree* list = operand;
unsigned childCount = list->NumChildren();
operand = list->GetChild(0);
int operandChars = cOperandIR(comp, operand);
chars += operandChars;
if (childCount > 1)
{
if (operandChars > 0)
{
chars += printf(", ");
}
operand = list->GetChild(1);
if (operand->gtOper == GT_LIST)
{
chars += cListIR(comp, operand);
}
else
{
chars += cOperandIR(comp, operand);
}
}
}
else
{
chars += printf("t%d", operand->gtTreeID);
if (dumpRegs)
{
regNumber regNum = operand->GetReg();
if (regNum != REG_NA)
{
chars += printf("(%s)", getRegName(regNum));
}
}
if (dumpTypes)
{
chars += cTreeTypeIR(comp, operand);
}
if (dumpValnums)
{
chars += cValNumIR(comp, operand);
}
}
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree operand node for linear IR form
*/
int dOperandIR(GenTree* operand)
{
int chars = cOperandIR(JitTls::GetCompiler(), operand);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree list of nodes for linear IR form
*/
int cListIR(Compiler* comp, GenTree* list)
{
int chars = 0;
int operandChars;
assert(list->gtOper == GT_LIST);
GenTree* child;
unsigned childCount;
childCount = list->NumChildren();
assert(childCount == 1 || childCount == 2);
operandChars = 0;
for (unsigned childIndex = 0; childIndex < childCount; childIndex++)
{
if ((childIndex > 0) && (operandChars > 0))
{
chars += printf(", ");
}
child = list->GetChild(childIndex);
operandChars = cOperandIR(comp, child);
chars += operandChars;
}
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree list of nodes for linear IR form
*/
int dListIR(GenTree* list)
{
int chars = cListIR(JitTls::GetCompiler(), list);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree dependencies based on comma nodes for linear IR form
*/
int cDependsIR(Compiler* comp, GenTree* comma, bool* first)
{
int chars = 0;
assert(comma->gtOper == GT_COMMA);
GenTree* child;
child = comma->GetChild(0);
if (child->gtOper == GT_COMMA)
{
chars += cDependsIR(comp, child, first);
}
else
{
if (!(*first))
{
chars += printf(", ");
}
chars += printf("t%d", child->gtTreeID);
*first = false;
}
child = comma->GetChild(1);
if (child->gtOper == GT_COMMA)
{
chars += cDependsIR(comp, child, first);
}
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree dependencies based on comma nodes for linear IR form
*/
int dDependsIR(GenTree* comma)
{
int chars = 0;
bool first = TRUE;
chars = cDependsIR(JitTls::GetCompiler(), comma, &first);
return chars;
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree node in linear IR form
*/
void cNodeIR(Compiler* comp, GenTree* tree)
{
bool foldLeafs = comp->dumpIRNoLeafs;
bool foldIndirs = comp->dumpIRDataflow;
bool foldLists = comp->dumpIRNoLists;
bool dataflowView = comp->dumpIRDataflow;
bool dumpTypes = comp->dumpIRTypes;
bool dumpValnums = comp->dumpIRValnums;
bool noStmts = comp->dumpIRNoStmts;
genTreeOps op = tree->OperGet();
unsigned childCount = tree->NumChildren();
GenTree* child;
// What are we skipping?
if (tree->OperIsLeaf())
{
if (foldLeafs)
{
return;
}
}
else if (op == GT_IND)
{
if (foldIndirs)
{
return;
}
}
else if (op == GT_LIST)
{
if (foldLists)
{
return;
}
}
else if (op == GT_STMT)
{
if (noStmts)
{
if (dataflowView)
{
child = tree->GetChild(0);
if (child->gtOper != GT_COMMA)
{
return;
}
}
else
{
return;
}
}
}
else if (op == GT_COMMA)
{
if (dataflowView)
{
return;
}
}
bool nodeIsValue = tree->IsValue();
// Dump tree id or dataflow destination.
int chars = 0;
// if (comp->compRationalIRForm)
// {
// chars += printf("R");
// }
chars += printf(" ");
if (dataflowView && tree->OperIsAssignment())
{
child = tree->GetChild(0);
chars += cOperandIR(comp, child);
}
else if (dataflowView && ((op == GT_STORE_LCL_VAR) || (op == GT_STORE_LCL_FLD)))
{
chars += cLeafIR(comp, tree);
}
else if (dataflowView && (op == GT_STOREIND))
{
child = tree->GetChild(0);
chars += printf("[");
chars += cOperandIR(comp, child);
chars += printf("]");
if (dumpTypes)
{
chars += cTreeTypeIR(comp, tree);
}
if (dumpValnums)
{
chars += cValNumIR(comp, tree);
}
}
else if (nodeIsValue)
{
chars += printf("t%d", tree->gtTreeID);
if (comp->dumpIRRegs)
{
regNumber regNum = tree->GetReg();
if (regNum != REG_NA)
{
chars += printf("(%s)", getRegName(regNum));
}
}
if (dumpTypes)
{
chars += cTreeTypeIR(comp, tree);
}
if (dumpValnums)
{
chars += cValNumIR(comp, tree);
}
}
// Dump opcode and tree ID if need in dataflow view.
chars += dTabStopIR(chars, COLUMN_OPCODE);
const char* opName = tree->OpName(op);
chars += printf(" %c %s", nodeIsValue ? '=' : ' ', opName);
if (dataflowView)
{
if (tree->OperIsAssignment() || (op == GT_STORE_LCL_VAR) || (op == GT_STORE_LCL_FLD) || (op == GT_STOREIND))
{
chars += printf("(t%d)", tree->gtTreeID);
}
}
// Dump modifiers for opcodes to help with readability
if (op == GT_CALL)
{
GenTreeCall* call = tree->AsCall();
if (call->gtCallType == CT_USER_FUNC)
{
if (call->IsVirtualStub())
{
chars += printf(":VS");
}
else if (call->IsVirtualVtable())
{
chars += printf(":VT");
}
else if (call->IsVirtual())
{
chars += printf(":V");
}
}
else if (call->gtCallType == CT_HELPER)
{
chars += printf(":H");
}
else if (call->gtCallType == CT_INDIRECT)
{
chars += printf(":I");
}
else if (call->IsUnmanaged())
{
chars += printf(":U");
}
else
{
if (call->IsVirtualStub())
{
chars += printf(":XVS");
}
else if (call->IsVirtualVtable())
{
chars += printf(":XVT");
}
else
{
chars += printf(":?");
}
}
if (call->IsUnmanaged())
{
if (call->gtCallMoreFlags & GTF_CALL_M_UNMGD_THISCALL)
{
chars += printf(":T");
}
}
if (tree->gtFlags & GTF_CALL_NULLCHECK)
{
chars += printf(":N");
}
}
else if (op == GT_INTRINSIC)
{
CorInfoIntrinsics intrin = tree->gtIntrinsic.gtIntrinsicId;
chars += printf(":");
switch (intrin)
{
case CORINFO_INTRINSIC_Sin:
chars += printf("Sin");
break;
case CORINFO_INTRINSIC_Cos:
chars += printf("Cos");
break;
case CORINFO_INTRINSIC_Sqrt:
chars += printf("Sqrt");
break;
case CORINFO_INTRINSIC_Cosh:
chars += printf("Cosh");
break;
case CORINFO_INTRINSIC_Sinh:
chars += printf("Sinh");
break;
case CORINFO_INTRINSIC_Tan:
chars += printf("Tan");
break;
case CORINFO_INTRINSIC_Tanh:
chars += printf("Tanh");
break;
case CORINFO_INTRINSIC_Asin:
chars += printf("Asin");
break;
case CORINFO_INTRINSIC_Acos:
chars += printf("Acos");
break;
case CORINFO_INTRINSIC_Atan:
chars += printf("Atan");
break;
case CORINFO_INTRINSIC_Atan2:
chars += printf("Atan2");
break;
case CORINFO_INTRINSIC_Log10:
chars += printf("Log10");
break;
case CORINFO_INTRINSIC_Pow:
chars += printf("Pow");
break;
case CORINFO_INTRINSIC_Exp:
chars += printf("Exp");
break;
case CORINFO_INTRINSIC_Ceiling:
chars += printf("Ceiling");
break;
case CORINFO_INTRINSIC_Floor:
chars += printf("Floor");
break;
default:
chars += printf("unknown(%d)", intrin);
break;
}
}
// Dump operands.
chars += dTabStopIR(chars, COLUMN_OPERANDS);
// Dump operator specific fields as operands
switch (op)
{
default:
break;
case GT_FIELD:
{
const char* className = nullptr;
const char* fieldName = comp->eeGetFieldName(tree->gtField.gtFldHnd, &className);
chars += printf(" %s.%s", className, fieldName);
}
break;
case GT_CALL:
if (tree->gtCall.gtCallType != CT_INDIRECT)
{
const char* methodName;
const char* className;
methodName = comp->eeGetMethodName(tree->gtCall.gtCallMethHnd, &className);
chars += printf(" %s.%s", className, methodName);
}
break;
case GT_STORE_LCL_VAR:
case GT_STORE_LCL_FLD:
if (!dataflowView)
{
chars += printf(" ");
chars += cLeafIR(comp, tree);
}
break;
case GT_LEA:
GenTreeAddrMode* lea = tree->AsAddrMode();
GenTree* base = lea->Base();
GenTree* index = lea->Index();
unsigned scale = lea->gtScale;
unsigned offset = lea->gtOffset;
chars += printf(" [");
if (base != nullptr)
{
chars += cOperandIR(comp, base);
}
if (index != nullptr)
{
if (base != nullptr)
{
chars += printf("+");
}
chars += cOperandIR(comp, index);
if (scale > 1)
{
chars += printf("*%u", scale);
}
}
if ((offset != 0) || ((base == nullptr) && (index == nullptr)))
{
if ((base != nullptr) || (index != nullptr))
{
chars += printf("+");
}
chars += printf("%u", offset);
}
chars += printf("]");
break;
}
// Dump operands.
if (tree->OperIsLeaf())
{
chars += printf(" ");
chars += cLeafIR(comp, tree);
}
else if (op == GT_LEA)
{
// Already dumped it above.
}
else if (op == GT_PHI)
{
if (tree->gtOp.gtOp1 != nullptr)
{
bool first = true;
for (GenTreeArgList* args = tree->gtOp.gtOp1->AsArgList(); args != nullptr; args = args->Rest())
{
child = args->Current();
if (!first)
{
chars += printf(",");
}
first = false;
chars += printf(" ");
chars += cOperandIR(comp, child);
}
}
}
else
{
bool hasComma = false;
bool first = true;
int operandChars = 0;
for (unsigned childIndex = 0; childIndex < childCount; childIndex++)
{
child = tree->GetChild(childIndex);
if (child == nullptr)
{
continue;
}
if (child->gtOper == GT_COMMA)
{
hasComma = true;
}
if (dataflowView && (childIndex == 0))
{
if ((op == GT_ASG) || (op == GT_STOREIND))
{
continue;
}
}
if (!first)
{
chars += printf(",");
}
bool isList = (child->gtOper == GT_LIST);
if (!isList || !foldLists)
{
if (foldLeafs && (child->gtOper == GT_ARGPLACE))
{
continue;
}
chars += printf(" ");
operandChars = cOperandIR(comp, child);
chars += operandChars;
if (operandChars > 0)
{
first = false;
}
}
else
{
assert(isList);
chars += printf(" ");
operandChars = cOperandIR(comp, child);
chars += operandChars;
if (operandChars > 0)
{
first = false;
}
}
}
if (dataflowView && hasComma)
{
chars += printf(", DEPS(");
first = true;
for (unsigned childIndex = 0; childIndex < childCount; childIndex++)
{
child = tree->GetChild(childIndex);
if (child->gtOper == GT_COMMA)
{
chars += cDependsIR(comp, child, &first);
}
}
chars += printf(")");
}
}
// Dump kinds, flags, costs
if (comp->dumpIRKinds || comp->dumpIRFlags || comp->dumpIRCosts)
{
chars += dTabStopIR(chars, COLUMN_KINDS);
chars += printf(";");
if (comp->dumpIRKinds)
{
chars += printf(" ");
chars += cTreeKindsIR(comp, tree);
}
if (comp->dumpIRFlags && (tree->gtFlags != 0))
{
if (comp->dumpIRKinds)
{
chars += dTabStopIR(chars, COLUMN_FLAGS);
}
else
{
chars += printf(" ");
}
chars += cTreeFlagsIR(comp, tree);
}
if (comp->dumpIRCosts && (tree->gtCostsInitialized))
{
chars += printf(" CostEx=%d, CostSz=%d", tree->GetCostEx(), tree->GetCostSz());
}
}
printf("\n");
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree in linear IR form
*/
void cTreeIR(Compiler* comp, GenTree* tree)
{
bool foldLeafs = comp->dumpIRNoLeafs;
bool foldIndirs = comp->dumpIRDataflow;
bool foldLists = comp->dumpIRNoLists;
bool dataflowView = comp->dumpIRDataflow;
bool dumpTypes = comp->dumpIRTypes;
bool dumpValnums = comp->dumpIRValnums;
bool noStmts = comp->dumpIRNoStmts;
genTreeOps op = tree->OperGet();
unsigned childCount = tree->NumChildren();
GenTree* child;
// Recurse and dump trees that this node depends on.
if (tree->OperIsLeaf())
{
}
else if (tree->OperIsBinary() && tree->IsReverseOp())
{
child = tree->GetChild(1);
cTreeIR(comp, child);
child = tree->GetChild(0);
cTreeIR(comp, child);
}
else if (op == GT_PHI)
{
// Don't recurse.
}
else
{
assert(!tree->IsReverseOp());
for (unsigned childIndex = 0; childIndex < childCount; childIndex++)
{
child = tree->GetChild(childIndex);
if (child != nullptr)
{
cTreeIR(comp, child);
}
}
}
cNodeIR(comp, tree);
}
/*****************************************************************************
*
* COMPlus_JitDumpIR support - dump out tree in linear IR form
*/
void dTreeIR(GenTree* tree)
{
cTreeIR(JitTls::GetCompiler(), tree);
}
#endif // DEBUG
#if VARSET_COUNTOPS
// static
BitSetSupport::BitSetOpCounter Compiler::m_varsetOpCounter("VarSetOpCounts.log");
#endif
#if ALLVARSET_COUNTOPS
// static
BitSetSupport::BitSetOpCounter Compiler::m_allvarsetOpCounter("AllVarSetOpCounts.log");
#endif
// static
HelperCallProperties Compiler::s_helperCallProperties;
/*****************************************************************************/
/*****************************************************************************/
|