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
|
// 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 Inline functions XX
XX XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
#ifndef _COMPILER_HPP_
#define _COMPILER_HPP_
#include "emit.h" // for emitter::emitAddLabel
#include "bitvec.h"
#include "compilerbitsettraits.hpp"
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XX
XX Miscellaneous utility functions. Some of these are defined in Utils.cpp XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
/*****************************************************************************/
/*****************************************************************************/
inline bool getInlinePInvokeEnabled()
{
#ifdef DEBUG
return JitConfig.JitPInvokeEnabled() && !JitConfig.StressCOMCall();
#else
return true;
#endif
}
inline bool getInlinePInvokeCheckEnabled()
{
#ifdef DEBUG
return JitConfig.JitPInvokeCheckEnabled() != 0;
#else
return false;
#endif
}
// Enforce float narrowing for buggy compilers (notably preWhidbey VC)
inline float forceCastToFloat(double d)
{
Volatile<float> f = (float)d;
return f;
}
// Enforce UInt32 narrowing for buggy compilers (notably Whidbey Beta 2 LKG)
inline UINT32 forceCastToUInt32(double d)
{
Volatile<UINT32> u = (UINT32)d;
return u;
}
enum RoundLevel
{
ROUND_NEVER = 0, // Never round
ROUND_CMP_CONST = 1, // Round values compared against constants
ROUND_CMP = 2, // Round comparands and return values
ROUND_ALWAYS = 3, // Round always
COUNT_ROUND_LEVEL,
DEFAULT_ROUND_LEVEL = ROUND_NEVER
};
inline RoundLevel getRoundFloatLevel()
{
#ifdef DEBUG
return (RoundLevel)JitConfig.JitRoundFloat();
#else
return DEFAULT_ROUND_LEVEL;
#endif
}
/*****************************************************************************/
/*****************************************************************************
*
* Return the lowest bit that is set
*/
template <typename T>
inline T genFindLowestBit(T value)
{
return (value & (0 - value));
}
/*****************************************************************************/
/*****************************************************************************
*
* Return the highest bit that is set (that is, a mask that includes just the highest bit).
* TODO-ARM64-Throughput: we should convert these to use the _BitScanReverse() / _BitScanReverse64()
* compiler intrinsics, but our CRT header file intrin.h doesn't define these for ARM64 yet.
*/
inline unsigned int genFindHighestBit(unsigned int mask)
{
assert(mask != 0);
unsigned int bit = 1U << ((sizeof(unsigned int) * 8) - 1); // start looking at the top
while ((bit & mask) == 0)
{
bit >>= 1;
}
return bit;
}
inline unsigned __int64 genFindHighestBit(unsigned __int64 mask)
{
assert(mask != 0);
unsigned __int64 bit = 1ULL << ((sizeof(unsigned __int64) * 8) - 1); // start looking at the top
while ((bit & mask) == 0)
{
bit >>= 1;
}
return bit;
}
#if 0
// TODO-ARM64-Cleanup: These should probably be the implementation, when intrin.h is updated for ARM64
inline
unsigned int genFindHighestBit(unsigned int mask)
{
assert(mask != 0);
unsigned int index;
_BitScanReverse(&index, mask);
return 1L << index;
}
inline
unsigned __int64 genFindHighestBit(unsigned __int64 mask)
{
assert(mask != 0);
unsigned int index;
_BitScanReverse64(&index, mask);
return 1LL << index;
}
#endif // 0
/*****************************************************************************
*
* Return true if the given 64-bit value has exactly zero or one bits set.
*/
template <typename T>
inline BOOL genMaxOneBit(T value)
{
return (value & (value - 1)) == 0;
}
/*****************************************************************************
*
* Return true if the given 32-bit value has exactly zero or one bits set.
*/
inline BOOL genMaxOneBit(unsigned value)
{
return (value & (value - 1)) == 0;
}
/*****************************************************************************
*
* Given a value that has exactly one bit set, return the position of that
* bit, in other words return the logarithm in base 2 of the given value.
*/
inline unsigned genLog2(unsigned value)
{
return BitPosition(value);
}
/*****************************************************************************
*
* Given a value that has exactly one bit set, return the position of that
* bit, in other words return the logarithm in base 2 of the given value.
*/
inline unsigned genLog2(unsigned __int64 value)
{
unsigned lo32 = (unsigned)value;
unsigned hi32 = (unsigned)(value >> 32);
if (lo32 != 0)
{
assert(hi32 == 0);
return genLog2(lo32);
}
else
{
return genLog2(hi32) + 32;
}
}
/*****************************************************************************
*
* Return the lowest bit that is set in the given register mask.
*/
inline regMaskTP genFindLowestReg(regMaskTP value)
{
return (regMaskTP)genFindLowestBit(value);
}
/*****************************************************************************
*
* A rather simple routine that counts the number of bits in a given number.
*/
template <typename T>
inline unsigned genCountBits(T bits)
{
unsigned cnt = 0;
while (bits)
{
cnt++;
bits -= genFindLowestBit(bits);
}
return cnt;
}
/*****************************************************************************
*
* Given 3 masks value, end, start, returns the bits of value between start
* and end (exclusive).
*
* value[bitNum(end) - 1, bitNum(start) + 1]
*/
inline unsigned __int64 BitsBetween(unsigned __int64 value, unsigned __int64 end, unsigned __int64 start)
{
assert(start != 0);
assert(start < end);
assert((start & (start - 1)) == 0);
assert((end & (end - 1)) == 0);
return value & ~((start - 1) | start) & // Ones to the left of set bit in the start mask.
(end - 1); // Ones to the right of set bit in the end mask.
}
/*****************************************************************************/
inline bool jitIsScaleIndexMul(size_t val)
{
switch (val)
{
case 1:
case 2:
case 4:
case 8:
return true;
default:
return false;
}
}
// Returns "tree" iff "val" is a valid addressing mode scale shift amount on
// the target architecture.
inline bool jitIsScaleIndexShift(ssize_t val)
{
// It happens that this is the right test for all our current targets: x86, x64 and ARM.
// This test would become target-dependent if we added a new target with a different constraint.
return 0 < val && val < 4;
}
/*****************************************************************************
* Returns true if value is between [start..end).
* The comparison is inclusive of start, exclusive of end.
*/
/* static */
inline bool Compiler::jitIsBetween(unsigned value, unsigned start, unsigned end)
{
return start <= value && value < end;
}
/*****************************************************************************
* Returns true if value is between [start..end].
* The comparison is inclusive of both start and end.
*/
/* static */
inline bool Compiler::jitIsBetweenInclusive(unsigned value, unsigned start, unsigned end)
{
return start <= value && value <= end;
}
/******************************************************************************************
* Return the EH descriptor for the given region index.
*/
inline EHblkDsc* Compiler::ehGetDsc(unsigned regionIndex)
{
assert(regionIndex < compHndBBtabCount);
return &compHndBBtab[regionIndex];
}
/******************************************************************************************
* Return the EH descriptor index of the enclosing try, for the given region index.
*/
inline unsigned Compiler::ehGetEnclosingTryIndex(unsigned regionIndex)
{
return ehGetDsc(regionIndex)->ebdEnclosingTryIndex;
}
/******************************************************************************************
* Return the EH descriptor index of the enclosing handler, for the given region index.
*/
inline unsigned Compiler::ehGetEnclosingHndIndex(unsigned regionIndex)
{
return ehGetDsc(regionIndex)->ebdEnclosingHndIndex;
}
/******************************************************************************************
* Return the EH index given a region descriptor.
*/
inline unsigned Compiler::ehGetIndex(EHblkDsc* ehDsc)
{
assert(compHndBBtab <= ehDsc && ehDsc < compHndBBtab + compHndBBtabCount);
return (unsigned)(ehDsc - compHndBBtab);
}
/******************************************************************************************
* Return the EH descriptor for the most nested 'try' region this BasicBlock is a member of
* (or nullptr if this block is not in a 'try' region).
*/
inline EHblkDsc* Compiler::ehGetBlockTryDsc(BasicBlock* block)
{
if (!block->hasTryIndex())
{
return nullptr;
}
return ehGetDsc(block->getTryIndex());
}
/******************************************************************************************
* Return the EH descriptor for the most nested filter or handler region this BasicBlock is a member of
* (or nullptr if this block is not in a filter or handler region).
*/
inline EHblkDsc* Compiler::ehGetBlockHndDsc(BasicBlock* block)
{
if (!block->hasHndIndex())
{
return nullptr;
}
return ehGetDsc(block->getHndIndex());
}
#if FEATURE_EH_FUNCLETS
/*****************************************************************************
* Get the FuncInfoDsc for the funclet we are currently generating code for.
* This is only valid during codegen.
*
*/
inline FuncInfoDsc* Compiler::funCurrentFunc()
{
return funGetFunc(compCurrFuncIdx);
}
/*****************************************************************************
* Change which funclet we are currently generating code for.
* This is only valid after funclets are created.
*
*/
inline void Compiler::funSetCurrentFunc(unsigned funcIdx)
{
assert(fgFuncletsCreated);
assert(FitsIn<unsigned short>(funcIdx));
noway_assert(funcIdx < compFuncInfoCount);
compCurrFuncIdx = (unsigned short)funcIdx;
}
/*****************************************************************************
* Get the FuncInfoDsc for the given funclet.
* This is only valid after funclets are created.
*
*/
inline FuncInfoDsc* Compiler::funGetFunc(unsigned funcIdx)
{
assert(fgFuncletsCreated);
assert(funcIdx < compFuncInfoCount);
return &compFuncInfos[funcIdx];
}
/*****************************************************************************
* Get the funcIdx for the EH funclet that begins with block.
* This is only valid after funclets are created.
* It is only valid for blocks marked with BBF_FUNCLET_BEG because
* otherwise we would have to do a more expensive check to determine
* if this should return the filter funclet or the filter handler funclet.
*
*/
inline unsigned Compiler::funGetFuncIdx(BasicBlock* block)
{
assert(fgFuncletsCreated);
assert(block->bbFlags & BBF_FUNCLET_BEG);
EHblkDsc* eh = ehGetDsc(block->getHndIndex());
unsigned int funcIdx = eh->ebdFuncIndex;
if (eh->ebdHndBeg != block)
{
// If this is a filter EH clause, but we want the funclet
// for the filter (not the filter handler), it is the previous one
noway_assert(eh->HasFilter());
noway_assert(eh->ebdFilter == block);
assert(funGetFunc(funcIdx)->funKind == FUNC_HANDLER);
assert(funGetFunc(funcIdx)->funEHIndex == funGetFunc(funcIdx - 1)->funEHIndex);
assert(funGetFunc(funcIdx - 1)->funKind == FUNC_FILTER);
funcIdx--;
}
return funcIdx;
}
#else // !FEATURE_EH_FUNCLETS
/*****************************************************************************
* Get the FuncInfoDsc for the funclet we are currently generating code for.
* This is only valid during codegen. For non-funclet platforms, this is
* always the root function.
*
*/
inline FuncInfoDsc* Compiler::funCurrentFunc()
{
return &compFuncInfoRoot;
}
/*****************************************************************************
* Change which funclet we are currently generating code for.
* This is only valid after funclets are created.
*
*/
inline void Compiler::funSetCurrentFunc(unsigned funcIdx)
{
assert(funcIdx == 0);
}
/*****************************************************************************
* Get the FuncInfoDsc for the givven funclet.
* This is only valid after funclets are created.
*
*/
inline FuncInfoDsc* Compiler::funGetFunc(unsigned funcIdx)
{
assert(funcIdx == 0);
return &compFuncInfoRoot;
}
/*****************************************************************************
* No funclets, so always 0.
*
*/
inline unsigned Compiler::funGetFuncIdx(BasicBlock* block)
{
return 0;
}
#endif // !FEATURE_EH_FUNCLETS
/*****************************************************************************
*
* Map a register mask to a register number
*/
inline regNumber genRegNumFromMask(regMaskTP mask)
{
assert(mask != 0); // Must have one bit set, so can't have a mask of zero
/* Convert the mask to a register number */
regNumber regNum = (regNumber)genLog2(mask);
/* Make sure we got it right */
assert(genRegMask(regNum) == mask);
return regNum;
}
/*****************************************************************************
*
* Return the size in bytes of the given type.
*/
extern const BYTE genTypeSizes[TYP_COUNT];
template <class T>
inline unsigned genTypeSize(T type)
{
assert((unsigned)TypeGet(type) < sizeof(genTypeSizes) / sizeof(genTypeSizes[0]));
return genTypeSizes[TypeGet(type)];
}
/*****************************************************************************
*
* Return the "stack slot count" of the given type.
* returns 1 for 32-bit types and 2 for 64-bit types.
*/
extern const BYTE genTypeStSzs[TYP_COUNT];
inline unsigned genTypeStSz(var_types type)
{
assert((unsigned)type < sizeof(genTypeStSzs) / sizeof(genTypeStSzs[0]));
return genTypeStSzs[type];
}
/*****************************************************************************
*
* Return the number of registers required to hold a value of the given type.
*/
/*****************************************************************************
*
* The following function maps a 'precise' type to an actual type as seen
* by the VM (for example, 'byte' maps to 'int').
*/
extern const BYTE genActualTypes[TYP_COUNT];
inline var_types genActualType(var_types type)
{
/* Spot check to make certain the table is in synch with the enum */
assert(genActualTypes[TYP_DOUBLE] == TYP_DOUBLE);
assert(genActualTypes[TYP_FNC] == TYP_FNC);
assert(genActualTypes[TYP_REF] == TYP_REF);
assert((unsigned)type < sizeof(genActualTypes));
return (var_types)genActualTypes[type];
}
/*****************************************************************************/
inline var_types genUnsignedType(var_types type)
{
/* Force signed types into corresponding unsigned type */
switch (type)
{
case TYP_BYTE:
type = TYP_UBYTE;
break;
case TYP_SHORT:
type = TYP_CHAR;
break;
case TYP_INT:
type = TYP_UINT;
break;
case TYP_LONG:
type = TYP_ULONG;
break;
default:
break;
}
return type;
}
/*****************************************************************************/
inline var_types genSignedType(var_types type)
{
/* Force non-small unsigned type into corresponding signed type */
/* Note that we leave the small types alone */
switch (type)
{
case TYP_UINT:
type = TYP_INT;
break;
case TYP_ULONG:
type = TYP_LONG;
break;
default:
break;
}
return type;
}
/*****************************************************************************
* Can this type be passed as a parameter in a register?
*/
inline bool isRegParamType(var_types type)
{
#if defined(_TARGET_X86_)
return (type <= TYP_INT || type == TYP_REF || type == TYP_BYREF);
#else // !_TARGET_X86_
return true;
#endif // !_TARGET_X86_
}
#if defined(_TARGET_AMD64_) || defined(_TARGET_ARM64_)
/*****************************************************************************/
// Returns true if 'type' is a struct that can be enregistered for call args
// or can be returned by value in multiple registers.
// if 'type' is not a struct the return value will be false.
//
// Arguments:
// type - the basic jit var_type for the item being queried
// typeClass - the handle for the struct when 'type' is TYP_STRUCT
// typeSize - Out param (if non-null) is updated with the size of 'type'.
// forReturn - this is true when we asking about a GT_RETURN context;
// this is false when we are asking about an argument context
//
inline bool Compiler::VarTypeIsMultiByteAndCanEnreg(var_types type,
CORINFO_CLASS_HANDLE typeClass,
unsigned* typeSize,
bool forReturn)
{
bool result = false;
unsigned size = 0;
if (varTypeIsStruct(type))
{
size = info.compCompHnd->getClassSize(typeClass);
if (forReturn)
{
structPassingKind howToReturnStruct;
type = getReturnTypeForStruct(typeClass, &howToReturnStruct, size);
}
else
{
structPassingKind howToPassStruct;
type = getArgTypeForStruct(typeClass, &howToPassStruct, size);
}
if (type != TYP_UNKNOWN)
{
result = true;
}
}
else
{
size = genTypeSize(type);
}
if (typeSize != nullptr)
{
*typeSize = size;
}
return result;
}
#endif //_TARGET_AMD64_ || _TARGET_ARM64_
/*****************************************************************************/
#ifdef DEBUG
inline const char* varTypeGCstring(var_types type)
{
switch (type)
{
case TYP_REF:
return "gcr";
case TYP_BYREF:
return "byr";
default:
return "non";
}
}
#endif
/*****************************************************************************/
const char* varTypeName(var_types);
/*****************************************************************************
*
* Helpers to pull big-endian values out of a byte stream.
*/
inline unsigned genGetU1(const BYTE* addr)
{
return addr[0];
}
inline signed genGetI1(const BYTE* addr)
{
return (signed char)addr[0];
}
inline unsigned genGetU2(const BYTE* addr)
{
return (addr[0] << 8) | addr[1];
}
inline signed genGetI2(const BYTE* addr)
{
return (signed short)((addr[0] << 8) | addr[1]);
}
inline unsigned genGetU4(const BYTE* addr)
{
return (addr[0] << 24) | (addr[1] << 16) | (addr[2] << 8) | addr[3];
}
/*****************************************************************************/
// Helpers to pull little-endian values out of a byte stream.
inline unsigned __int8 getU1LittleEndian(const BYTE* ptr)
{
return *(UNALIGNED unsigned __int8*)ptr;
}
inline unsigned __int16 getU2LittleEndian(const BYTE* ptr)
{
return GET_UNALIGNED_VAL16(ptr);
}
inline unsigned __int32 getU4LittleEndian(const BYTE* ptr)
{
return GET_UNALIGNED_VAL32(ptr);
}
inline signed __int8 getI1LittleEndian(const BYTE* ptr)
{
return *(UNALIGNED signed __int8*)ptr;
}
inline signed __int16 getI2LittleEndian(const BYTE* ptr)
{
return GET_UNALIGNED_VAL16(ptr);
}
inline signed __int32 getI4LittleEndian(const BYTE* ptr)
{
return GET_UNALIGNED_VAL32(ptr);
}
inline signed __int64 getI8LittleEndian(const BYTE* ptr)
{
return GET_UNALIGNED_VAL64(ptr);
}
inline float getR4LittleEndian(const BYTE* ptr)
{
__int32 val = getI4LittleEndian(ptr);
return *(float*)&val;
}
inline double getR8LittleEndian(const BYTE* ptr)
{
__int64 val = getI8LittleEndian(ptr);
return *(double*)&val;
}
/*****************************************************************************
*
* Return the bitmask to use in the EXPSET_TP for the CSE with the given CSE index.
* Each GenTree has the following field:
* signed char gtCSEnum; // 0 or the CSE index (negated if def)
* So zero is reserved to mean this node is not a CSE
* and postive values indicate CSE uses and negative values indicate CSE defs.
* The caller of this method must pass a non-zero postive value.
* This precondition is checked by the assert on the first line of this method.
*/
inline EXPSET_TP genCSEnum2bit(unsigned index)
{
assert((index > 0) && (index <= EXPSET_SZ));
return ((EXPSET_TP)1 << (index - 1));
}
#ifdef DEBUG
const char* genES2str(EXPSET_TP set);
const char* refCntWtd2str(unsigned refCntWtd);
#endif
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX GenTree XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
void* GenTree::operator new(size_t sz, Compiler* comp, genTreeOps oper)
{
#if SMALL_TREE_NODES
size_t size = GenTree::s_gtNodeSizes[oper];
#else
size_t size = TREE_NODE_SZ_LARGE;
#endif
#if MEASURE_NODE_SIZE
genNodeSizeStats.genTreeNodeCnt += 1;
genNodeSizeStats.genTreeNodeSize += size;
genNodeSizeStats.genTreeNodeActualSize += sz;
genNodeSizeStatsPerFunc.genTreeNodeCnt += 1;
genNodeSizeStatsPerFunc.genTreeNodeSize += size;
genNodeSizeStatsPerFunc.genTreeNodeActualSize += sz;
#endif // MEASURE_NODE_SIZE
assert(size >= sz);
return comp->compGetMem(size, CMK_ASTNode);
}
// GenTree constructor
inline GenTree::GenTree(genTreeOps oper, var_types type DEBUGARG(bool largeNode))
{
gtOper = oper;
gtType = type;
gtFlags = 0;
gtLIRFlags = 0;
#ifdef DEBUG
gtDebugFlags = 0;
#endif // DEBUG
#ifdef LEGACY_BACKEND
gtUsedRegs = 0;
#endif // LEGACY_BACKEND
#if FEATURE_ANYCSE
gtCSEnum = NO_CSE;
#endif // FEATURE_ANYCSE
#if ASSERTION_PROP
ClearAssertion();
#endif
#if FEATURE_STACK_FP_X87
gtFPlvl = 0;
#endif
gtNext = nullptr;
gtPrev = nullptr;
gtRegNum = REG_NA;
INDEBUG(gtRegTag = GT_REGTAG_NONE;)
INDEBUG(gtCostsInitialized = false;)
#ifdef DEBUG
#if SMALL_TREE_NODES
size_t size = GenTree::s_gtNodeSizes[oper];
if (size == TREE_NODE_SZ_SMALL && !largeNode)
{
gtDebugFlags |= GTF_DEBUG_NODE_SMALL;
}
else if (size == TREE_NODE_SZ_LARGE || largeNode)
{
gtDebugFlags |= GTF_DEBUG_NODE_LARGE;
}
else
{
assert(!"bogus node size");
}
#endif
#endif
#if COUNT_AST_OPERS
InterlockedIncrement(&s_gtNodeCounts[oper]);
#endif
#ifdef DEBUG
gtSeqNum = 0;
gtTreeID = JitTls::GetCompiler()->compGenTreeID++;
gtVNPair.SetBoth(ValueNumStore::NoVN);
gtRegTag = GT_REGTAG_NONE;
gtOperSave = GT_NONE;
#endif
}
/*****************************************************************************/
inline GenTreeStmt* Compiler::gtNewStmt(GenTreePtr expr, IL_OFFSETX offset)
{
/* NOTE - GT_STMT is now a small node in retail */
GenTreeStmt* stmt = new (this, GT_STMT) GenTreeStmt(expr, offset);
return stmt;
}
/*****************************************************************************/
inline GenTreePtr Compiler::gtNewOperNode(genTreeOps oper, var_types type, GenTreePtr op1, bool doSimplifications)
{
assert((GenTree::OperKind(oper) & (GTK_UNOP | GTK_BINOP)) != 0);
assert((GenTree::OperKind(oper) & GTK_EXOP) ==
0); // Can't use this to construct any types that extend unary/binary operator.
assert(op1 != nullptr || oper == GT_PHI || oper == GT_RETFILT || oper == GT_NOP ||
(oper == GT_RETURN && type == TYP_VOID));
if (doSimplifications)
{
// We do some simplifications here.
// If this gets to be too many, try a switch...
// TODO-Cleanup: With the factoring out of array bounds checks, it should not be the
// case that we need to check for the array index case here, but without this check
// we get failures (see for example jit\Directed\Languages\Python\test_methods_d.exe)
if (oper == GT_IND)
{
// IND(ADDR(IND(x)) == IND(x)
if (op1->gtOper == GT_ADDR)
{
if (op1->gtOp.gtOp1->gtOper == GT_IND && (op1->gtOp.gtOp1->gtFlags & GTF_IND_ARR_INDEX) == 0)
{
op1 = op1->gtOp.gtOp1->gtOp.gtOp1;
}
}
}
else if (oper == GT_ADDR)
{
// if "x" is not an array index, ADDR(IND(x)) == x
if (op1->gtOper == GT_IND && (op1->gtFlags & GTF_IND_ARR_INDEX) == 0)
{
return op1->gtOp.gtOp1;
}
}
}
GenTreePtr node = new (this, oper) GenTreeOp(oper, type, op1, nullptr);
//
// the GT_ADDR of a Local Variable implies GTF_ADDR_ONSTACK
//
if ((oper == GT_ADDR) && (op1->OperGet() == GT_LCL_VAR))
{
node->gtFlags |= GTF_ADDR_ONSTACK;
}
return node;
}
// Returns an opcode that is of the largest node size in use.
inline genTreeOps LargeOpOpcode()
{
#if SMALL_TREE_NODES
// Allocate a large node
assert(GenTree::s_gtNodeSizes[GT_CALL] == TREE_NODE_SZ_LARGE);
#endif
return GT_CALL;
}
/******************************************************************************
*
* Use to create nodes which may later be morphed to another (big) operator
*/
inline GenTreePtr Compiler::gtNewLargeOperNode(genTreeOps oper, var_types type, GenTreePtr op1, GenTreePtr op2)
{
assert((GenTree::OperKind(oper) & (GTK_UNOP | GTK_BINOP)) != 0);
assert((GenTree::OperKind(oper) & GTK_EXOP) ==
0); // Can't use this to construct any types that extend unary/binary operator.
#if SMALL_TREE_NODES
// Allocate a large node
assert(GenTree::s_gtNodeSizes[oper] == TREE_NODE_SZ_SMALL);
GenTreePtr node = new (this, LargeOpOpcode()) GenTreeOp(oper, type, op1, op2 DEBUGARG(/*largeNode*/ true));
#else
GenTreePtr node = new (this, oper) GenTreeOp(oper, type, op1, op2);
#endif
return node;
}
/*****************************************************************************
*
* allocates a integer constant entry that represents a handle (something
* that may need to be fixed up).
*/
inline GenTreePtr Compiler::gtNewIconHandleNode(
size_t value, unsigned flags, FieldSeqNode* fields, unsigned handle1, void* handle2)
{
GenTreePtr node;
assert((flags & (GTF_ICON_HDL_MASK | GTF_ICON_FIELD_OFF)) != 0);
// Interpret "fields == NULL" as "not a field."
if (fields == nullptr)
{
fields = FieldSeqStore::NotAField();
}
#if defined(LATE_DISASM)
node = new (this, LargeOpOpcode()) GenTreeIntCon(TYP_I_IMPL, value, fields DEBUGARG(/*largeNode*/ true));
node->gtIntCon.gtIconHdl.gtIconHdl1 = handle1;
node->gtIntCon.gtIconHdl.gtIconHdl2 = handle2;
#else
node = new (this, GT_CNS_INT) GenTreeIntCon(TYP_I_IMPL, value, fields);
#endif
node->gtFlags |= flags;
return node;
}
/*****************************************************************************
*
* It may not be allowed to embed HANDLEs directly into the JITed code (for eg,
* as arguments to JIT helpers). Get a corresponding value that can be embedded.
* These are versions for each specific type of HANDLE
*/
inline GenTreePtr Compiler::gtNewIconEmbScpHndNode(CORINFO_MODULE_HANDLE scpHnd, unsigned hnd1, void* hnd2)
{
void *embedScpHnd, *pEmbedScpHnd;
embedScpHnd = (void*)info.compCompHnd->embedModuleHandle(scpHnd, &pEmbedScpHnd);
assert((!embedScpHnd) != (!pEmbedScpHnd));
return gtNewIconEmbHndNode(embedScpHnd, pEmbedScpHnd, GTF_ICON_SCOPE_HDL, hnd1, hnd2, scpHnd);
}
//-----------------------------------------------------------------------------
inline GenTreePtr Compiler::gtNewIconEmbClsHndNode(CORINFO_CLASS_HANDLE clsHnd, unsigned hnd1, void* hnd2)
{
void *embedClsHnd, *pEmbedClsHnd;
embedClsHnd = (void*)info.compCompHnd->embedClassHandle(clsHnd, &pEmbedClsHnd);
assert((!embedClsHnd) != (!pEmbedClsHnd));
return gtNewIconEmbHndNode(embedClsHnd, pEmbedClsHnd, GTF_ICON_CLASS_HDL, hnd1, hnd2, clsHnd);
}
//-----------------------------------------------------------------------------
inline GenTreePtr Compiler::gtNewIconEmbMethHndNode(CORINFO_METHOD_HANDLE methHnd, unsigned hnd1, void* hnd2)
{
void *embedMethHnd, *pEmbedMethHnd;
embedMethHnd = (void*)info.compCompHnd->embedMethodHandle(methHnd, &pEmbedMethHnd);
assert((!embedMethHnd) != (!pEmbedMethHnd));
return gtNewIconEmbHndNode(embedMethHnd, pEmbedMethHnd, GTF_ICON_METHOD_HDL, hnd1, hnd2, methHnd);
}
//-----------------------------------------------------------------------------
inline GenTreePtr Compiler::gtNewIconEmbFldHndNode(CORINFO_FIELD_HANDLE fldHnd, unsigned hnd1, void* hnd2)
{
void *embedFldHnd, *pEmbedFldHnd;
embedFldHnd = (void*)info.compCompHnd->embedFieldHandle(fldHnd, &pEmbedFldHnd);
assert((!embedFldHnd) != (!pEmbedFldHnd));
return gtNewIconEmbHndNode(embedFldHnd, pEmbedFldHnd, GTF_ICON_FIELD_HDL, hnd1, hnd2, fldHnd);
}
/*****************************************************************************/
inline GenTreeCall* Compiler::gtNewHelperCallNode(unsigned helper, var_types type, unsigned flags, GenTreeArgList* args)
{
GenTreeCall* result = gtNewCallNode(CT_HELPER, eeFindHelper(helper), type, args);
result->gtFlags |= flags;
#if DEBUG
// Helper calls are never candidates.
result->gtInlineObservation = InlineObservation::CALLSITE_IS_CALL_TO_HELPER;
#endif
return result;
}
//------------------------------------------------------------------------
// gtNewAllocObjNode: A little helper to create an object allocation node.
//
// Arguments:
// helper - Value returned by ICorJitInfo::getNewHelper
// clsHnd - Corresponding class handle
// type - Tree return type (e.g. TYP_REF)
// op1 - Node containing an address of VtablePtr
//
// Return Value:
// Returns GT_ALLOCOBJ node that will be later morphed into an
// allocation helper call or local variable allocation on the stack.
inline GenTreePtr Compiler::gtNewAllocObjNode(unsigned int helper,
CORINFO_CLASS_HANDLE clsHnd,
var_types type,
GenTreePtr op1)
{
GenTreePtr node = new (this, GT_ALLOCOBJ) GenTreeAllocObj(type, helper, clsHnd, op1);
return node;
}
/*****************************************************************************/
inline GenTreePtr Compiler::gtNewCodeRef(BasicBlock* block)
{
GenTreePtr node = new (this, GT_LABEL) GenTreeLabel(block);
return node;
}
/*****************************************************************************
*
* A little helper to create a data member reference node.
*/
inline GenTreePtr Compiler::gtNewFieldRef(
var_types typ, CORINFO_FIELD_HANDLE fldHnd, GenTreePtr obj, DWORD offset, bool nullcheck)
{
#if SMALL_TREE_NODES
/* 'GT_FIELD' nodes may later get transformed into 'GT_IND' */
assert(GenTree::s_gtNodeSizes[GT_IND] <= GenTree::s_gtNodeSizes[GT_FIELD]);
GenTreePtr tree = new (this, GT_FIELD) GenTreeField(typ);
#else
GenTreePtr tree = new (this, GT_FIELD) GenTreeField(typ);
#endif
tree->gtField.gtFldObj = obj;
tree->gtField.gtFldHnd = fldHnd;
tree->gtField.gtFldOffset = offset;
tree->gtFlags |= GTF_GLOB_REF;
#ifdef FEATURE_READYTORUN_COMPILER
tree->gtField.gtFieldLookup.addr = nullptr;
#endif
if (nullcheck)
{
tree->gtFlags |= GTF_FLD_NULLCHECK;
}
// If "obj" is the address of a local, note that a field of that struct local has been accessed.
if (obj != nullptr && obj->OperGet() == GT_ADDR && varTypeIsStruct(obj->gtOp.gtOp1) &&
obj->gtOp.gtOp1->OperGet() == GT_LCL_VAR)
{
unsigned lclNum = obj->gtOp.gtOp1->gtLclVarCommon.gtLclNum;
lvaTable[lclNum].lvFieldAccessed = 1;
}
return tree;
}
/*****************************************************************************
*
* A little helper to create an array index node.
*/
inline GenTreePtr Compiler::gtNewIndexRef(var_types typ, GenTreePtr arrayOp, GenTreePtr indexOp)
{
GenTreeIndex* gtIndx = new (this, GT_INDEX) GenTreeIndex(typ, arrayOp, indexOp, genTypeSize(typ));
return gtIndx;
}
/*****************************************************************************
*
* Create (and check for) a "nothing" node, i.e. a node that doesn't produce
* any code. We currently use a "nop" node of type void for this purpose.
*/
inline GenTreePtr Compiler::gtNewNothingNode()
{
return new (this, GT_NOP) GenTreeOp(GT_NOP, TYP_VOID);
}
/*****************************************************************************/
inline bool GenTree::IsNothingNode() const
{
return (gtOper == GT_NOP && gtType == TYP_VOID);
}
/*****************************************************************************
*
* Change the given node to a NOP - May be later changed to a GT_COMMA
*
*****************************************************************************/
inline void GenTree::gtBashToNOP()
{
ChangeOper(GT_NOP);
gtType = TYP_VOID;
gtOp.gtOp1 = gtOp.gtOp2 = nullptr;
gtFlags &= ~(GTF_ALL_EFFECT | GTF_REVERSE_OPS);
}
// return new arg placeholder node. Does not do anything but has a type associated
// with it so we can keep track of register arguments in lists associated w/ call nodes
inline GenTreePtr Compiler::gtNewArgPlaceHolderNode(var_types type, CORINFO_CLASS_HANDLE clsHnd)
{
GenTreePtr node = new (this, GT_ARGPLACE) GenTreeArgPlace(type, clsHnd);
return node;
}
/*****************************************************************************/
inline GenTreePtr Compiler::gtUnusedValNode(GenTreePtr expr)
{
return gtNewOperNode(GT_COMMA, TYP_VOID, expr, gtNewNothingNode());
}
/*****************************************************************************
*
* A wrapper for gtSetEvalOrder and gtComputeFPlvls
* Necessary because the FP levels may need to be re-computed if we reverse
* operands
*/
inline void Compiler::gtSetStmtInfo(GenTree* stmt)
{
assert(stmt->gtOper == GT_STMT);
GenTreePtr expr = stmt->gtStmt.gtStmtExpr;
#if FEATURE_STACK_FP_X87
/* We will try to compute the FP stack level at each node */
codeGen->genResetFPstkLevel();
/* Sometimes we need to redo the FP level computation */
gtFPstLvlRedo = false;
#endif // FEATURE_STACK_FP_X87
#ifdef DEBUG
if (verbose && 0)
{
gtDispTree(stmt);
}
#endif
/* Recursively process the expression */
gtSetEvalOrder(expr);
// Set the statement to have the same costs as the top node of the tree.
stmt->CopyCosts(expr);
#if FEATURE_STACK_FP_X87
/* Unused float values leave one operand on the stack */
assert(codeGen->genGetFPstkLevel() == 0 || codeGen->genGetFPstkLevel() == 1);
/* Do we need to recompute FP stack levels? */
if (gtFPstLvlRedo)
{
codeGen->genResetFPstkLevel();
gtComputeFPlvls(expr);
assert(codeGen->genGetFPstkLevel() == 0 || codeGen->genGetFPstkLevel() == 1);
}
#endif // FEATURE_STACK_FP_X87
}
#if FEATURE_STACK_FP_X87
inline unsigned Compiler::gtSetEvalOrderAndRestoreFPstkLevel(GenTree* tree)
{
unsigned FPlvlSave = codeGen->genFPstkLevel;
unsigned result = gtSetEvalOrder(tree);
codeGen->genFPstkLevel = FPlvlSave;
return result;
}
#else // !FEATURE_STACK_FP_X87
inline unsigned Compiler::gtSetEvalOrderAndRestoreFPstkLevel(GenTree* tree)
{
return gtSetEvalOrder(tree);
}
#endif // FEATURE_STACK_FP_X87
/*****************************************************************************/
#if SMALL_TREE_NODES
/*****************************************************************************/
inline void GenTree::SetOper(genTreeOps oper, ValueNumberUpdate vnUpdate)
{
assert(((gtDebugFlags & GTF_DEBUG_NODE_SMALL) != 0) != ((gtDebugFlags & GTF_DEBUG_NODE_LARGE) != 0));
/* Make sure the node isn't too small for the new operator */
assert(GenTree::s_gtNodeSizes[gtOper] == TREE_NODE_SZ_SMALL ||
GenTree::s_gtNodeSizes[gtOper] == TREE_NODE_SZ_LARGE);
assert(GenTree::s_gtNodeSizes[oper] == TREE_NODE_SZ_SMALL || GenTree::s_gtNodeSizes[oper] == TREE_NODE_SZ_LARGE);
assert(GenTree::s_gtNodeSizes[oper] == TREE_NODE_SZ_SMALL || (gtDebugFlags & GTF_DEBUG_NODE_LARGE));
SetOperRaw(oper);
#ifdef DEBUG
// Maintain the invariant that unary operators always have NULL gtOp2.
// If we ever start explicitly allocating GenTreeUnOp nodes, we wouldn't be
// able to do that (but if we did, we'd have to have a check in gtOp -- perhaps
// a gtUnOp...)
if (OperKind(oper) == GTK_UNOP)
{
gtOp.gtOp2 = nullptr;
}
#endif // DEBUG
#if DEBUGGABLE_GENTREE
// Until we eliminate SetOper/ChangeOper, we also change the vtable of the node, so that
// it shows up correctly in the debugger.
SetVtableForOper(oper);
#endif // DEBUGGABLE_GENTREE
if (oper == GT_CNS_INT)
{
gtIntCon.gtFieldSeq = nullptr;
}
if (vnUpdate == CLEAR_VN)
{
// Clear the ValueNum field as well.
gtVNPair.SetBoth(ValueNumStore::NoVN);
}
}
inline void GenTree::CopyFrom(const GenTree* src, Compiler* comp)
{
/* The source may be big only if the target is also a big node */
assert((gtDebugFlags & GTF_DEBUG_NODE_LARGE) || GenTree::s_gtNodeSizes[src->gtOper] == TREE_NODE_SZ_SMALL);
GenTreePtr prev = gtPrev;
GenTreePtr next = gtNext;
RecordOperBashing(OperGet(), src->OperGet()); // nop unless NODEBASH_STATS is enabled
// The VTable pointer is copied intentionally here
memcpy((void*)this, (void*)src, src->GetNodeSize());
this->gtPrev = prev;
this->gtNext = next;
#ifdef DEBUG
gtSeqNum = 0;
#endif
// Transfer any annotations.
if (src->OperGet() == GT_IND && src->gtFlags & GTF_IND_ARR_INDEX)
{
ArrayInfo arrInfo;
bool b = comp->GetArrayInfoMap()->Lookup(src, &arrInfo);
assert(b);
comp->GetArrayInfoMap()->Set(this, arrInfo);
}
}
inline GenTreePtr Compiler::gtNewCastNode(var_types typ, GenTreePtr op1, var_types castType)
{
GenTreePtr res = new (this, GT_CAST) GenTreeCast(typ, op1, castType);
return res;
}
inline GenTreePtr Compiler::gtNewCastNodeL(var_types typ, GenTreePtr op1, var_types castType)
{
/* Some casts get transformed into 'GT_CALL' or 'GT_IND' nodes */
assert(GenTree::s_gtNodeSizes[GT_CALL] >= GenTree::s_gtNodeSizes[GT_CAST]);
assert(GenTree::s_gtNodeSizes[GT_CALL] >= GenTree::s_gtNodeSizes[GT_IND]);
/* Make a big node first and then change it to be GT_CAST */
GenTreePtr res = new (this, LargeOpOpcode()) GenTreeCast(typ, op1, castType DEBUGARG(/*largeNode*/ true));
return res;
}
/*****************************************************************************/
#else // SMALL_TREE_NODES
/*****************************************************************************/
inline void GenTree::InitNodeSize()
{
}
inline void GenTree::SetOper(genTreeOps oper, ValueNumberUpdate vnUpdate)
{
SetOperRaw(oper);
if (vnUpdate == CLEAR_VN)
{
// Clear the ValueNum field.
gtVNPair.SetBoth(ValueNumStore::NoVN);
}
}
inline void GenTree::CopyFrom(GenTreePtr src)
{
RecordOperBashing(OperGet(), src->OperGet()); // nop unless NODEBASH_STATS is enabled
*this = *src;
#ifdef DEBUG
gtSeqNum = 0;
#endif
}
inline GenTreePtr Compiler::gtNewCastNode(var_types typ, GenTreePtr op1, var_types castType)
{
GenTreePtr tree = gtNewOperNode(GT_CAST, typ, op1);
tree->gtCast.gtCastType = castType;
}
inline GenTreePtr Compiler::gtNewCastNodeL(var_types typ, GenTreePtr op1, var_types castType)
{
return gtNewCastNode(typ, op1, castType);
}
/*****************************************************************************/
#endif // SMALL_TREE_NODES
/*****************************************************************************/
/*****************************************************************************/
inline void GenTree::SetOperRaw(genTreeOps oper)
{
// Please do not do anything here other than assign to gtOper (debug-only
// code is OK, but should be kept to a minimum).
RecordOperBashing(OperGet(), oper); // nop unless NODEBASH_STATS is enabled
gtOper = oper;
}
inline void GenTree::SetOperResetFlags(genTreeOps oper)
{
SetOper(oper);
gtFlags &= GTF_NODE_MASK;
}
inline void GenTree::ChangeOperConst(genTreeOps oper)
{
#ifdef _TARGET_64BIT_
assert(oper != GT_CNS_LNG); // We should never see a GT_CNS_LNG for a 64-bit target!
#endif
assert(OperIsConst(oper)); // use ChangeOper() instead
SetOperResetFlags(oper);
// Some constant subtypes have additional fields that must be initialized.
if (oper == GT_CNS_INT)
{
gtIntCon.gtFieldSeq = FieldSeqStore::NotAField();
}
}
inline void GenTree::ChangeOper(genTreeOps oper, ValueNumberUpdate vnUpdate)
{
assert(!OperIsConst(oper)); // use ChangeOperLeaf() instead
SetOper(oper, vnUpdate);
gtFlags &= GTF_COMMON_MASK;
// Do "oper"-specific initializations...
switch (oper)
{
case GT_LCL_FLD:
gtLclFld.gtLclOffs = 0;
gtLclFld.gtFieldSeq = FieldSeqStore::NotAField();
break;
default:
break;
}
}
inline void GenTree::ChangeOperUnchecked(genTreeOps oper)
{
SetOperRaw(oper); // Trust the caller and don't use SetOper()
gtFlags &= GTF_COMMON_MASK;
}
/*****************************************************************************
* Returns true if the node is &var (created by ldarga and ldloca)
*/
inline bool GenTree::IsVarAddr() const
{
if (gtOper == GT_ADDR)
{
if (gtFlags & GTF_ADDR_ONSTACK)
{
assert((gtType == TYP_BYREF) || (gtType == TYP_I_IMPL));
return true;
}
}
return false;
}
/*****************************************************************************
*
* Returns true if the node is of the "ovf" variety, for example, add.ovf.i1.
* + gtOverflow() can only be called for valid operators (that is, we know it is one
* of the operators which may have GTF_OVERFLOW set).
* + gtOverflowEx() is more expensive, and should be called only if gtOper may be
* an operator for which GTF_OVERFLOW is invalid.
*/
inline bool GenTree::gtOverflow() const
{
#if !defined(_TARGET_64BIT_) && !defined(LEGACY_BACKEND)
assert(gtOper == GT_MUL || gtOper == GT_CAST || gtOper == GT_ADD || gtOper == GT_SUB || gtOper == GT_ASG_ADD ||
gtOper == GT_ASG_SUB || gtOper == GT_ADD_LO || gtOper == GT_SUB_LO || gtOper == GT_ADD_HI ||
gtOper == GT_SUB_HI);
#else
assert(gtOper == GT_MUL || gtOper == GT_CAST || gtOper == GT_ADD || gtOper == GT_SUB || gtOper == GT_ASG_ADD ||
gtOper == GT_ASG_SUB);
#endif
if (gtFlags & GTF_OVERFLOW)
{
assert(varTypeIsIntegral(TypeGet()));
return true;
}
else
{
return false;
}
}
inline bool GenTree::gtOverflowEx() const
{
if (gtOper == GT_MUL || gtOper == GT_CAST || gtOper == GT_ADD || gtOper == GT_SUB ||
#if !defined(_TARGET_64BIT_) && !defined(LEGACY_BACKEND)
gtOper == GT_ADD_HI || gtOper == GT_SUB_HI ||
#endif
gtOper == GT_ASG_ADD || gtOper == GT_ASG_SUB)
{
return gtOverflow();
}
return false;
}
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX LclVarsInfo XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
inline bool Compiler::lvaHaveManyLocals() const
{
return (lvaCount >= lclMAX_TRACKED);
}
/*****************************************************************************
*
* Allocate a temporary variable or a set of temp variables.
*/
inline unsigned Compiler::lvaGrabTemp(bool shortLifetime DEBUGARG(const char* reason))
{
if (compIsForInlining())
{
// Grab the temp using Inliner's Compiler instance.
Compiler* pComp = impInlineInfo->InlinerCompiler; // The Compiler instance for the caller (i.e. the inliner)
if (pComp->lvaHaveManyLocals())
{
// Don't create more LclVar with inlining
compInlineResult->NoteFatal(InlineObservation::CALLSITE_TOO_MANY_LOCALS);
}
unsigned tmpNum = pComp->lvaGrabTemp(shortLifetime DEBUGARG(reason));
lvaTable = pComp->lvaTable;
lvaCount = pComp->lvaCount;
lvaTableCnt = pComp->lvaTableCnt;
return tmpNum;
}
// You cannot allocate more space after frame layout!
noway_assert(lvaDoneFrameLayout < Compiler::TENTATIVE_FRAME_LAYOUT);
/* Check if the lvaTable has to be grown */
if (lvaCount + 1 > lvaTableCnt)
{
unsigned newLvaTableCnt = lvaCount + (lvaCount / 2) + 1;
// Check for overflow
if (newLvaTableCnt <= lvaCount)
{
IMPL_LIMITATION("too many locals");
}
// Note: compGetMemArray might throw.
LclVarDsc* newLvaTable = (LclVarDsc*)compGetMemArray(newLvaTableCnt, sizeof(*lvaTable), CMK_LvaTable);
memcpy(newLvaTable, lvaTable, lvaCount * sizeof(*lvaTable));
memset(newLvaTable + lvaCount, 0, (newLvaTableCnt - lvaCount) * sizeof(*lvaTable));
for (unsigned i = lvaCount; i < newLvaTableCnt; i++)
{
new (&newLvaTable[i], jitstd::placement_t()) LclVarDsc(this); // call the constructor.
}
#if 0
// TODO-Cleanup: Enable this and test.
#ifdef DEBUG
// Fill the old table with junks. So to detect the un-intended use.
memset(lvaTable, fDefaultFill2.val_DontUse_(CLRConfig::INTERNAL_JitDefaultFill, 0xFF), lvaCount * sizeof(*lvaTable));
#endif
#endif
lvaTableCnt = newLvaTableCnt;
lvaTable = newLvaTable;
}
lvaTable[lvaCount].lvType = TYP_UNDEF; // Initialize lvType, lvIsTemp and lvOnFrame
lvaTable[lvaCount].lvIsTemp = shortLifetime;
lvaTable[lvaCount].lvOnFrame = true;
unsigned tempNum = lvaCount;
lvaCount++;
#ifdef DEBUG
if (verbose)
{
printf("\nlvaGrabTemp returning %d (", tempNum);
gtDispLclVar(tempNum, false);
printf(")%s called for %s.\n", shortLifetime ? "" : " (a long lifetime temp)", reason);
}
#endif // DEBUG
return tempNum;
}
inline unsigned Compiler::lvaGrabTemps(unsigned cnt DEBUGARG(const char* reason))
{
if (compIsForInlining())
{
// Grab the temps using Inliner's Compiler instance.
unsigned tmpNum = impInlineInfo->InlinerCompiler->lvaGrabTemps(cnt DEBUGARG(reason));
lvaTable = impInlineInfo->InlinerCompiler->lvaTable;
lvaCount = impInlineInfo->InlinerCompiler->lvaCount;
lvaTableCnt = impInlineInfo->InlinerCompiler->lvaTableCnt;
return tmpNum;
}
#ifdef DEBUG
if (verbose)
{
printf("\nlvaGrabTemps(%d) returning %d..%d (long lifetime temps) called for %s", cnt, lvaCount,
lvaCount + cnt - 1, reason);
}
#endif
// You cannot allocate more space after frame layout!
noway_assert(lvaDoneFrameLayout < Compiler::TENTATIVE_FRAME_LAYOUT);
/* Check if the lvaTable has to be grown */
if (lvaCount + cnt > lvaTableCnt)
{
unsigned newLvaTableCnt = lvaCount + max(lvaCount / 2 + 1, cnt);
// Check for overflow
if (newLvaTableCnt <= lvaCount)
{
IMPL_LIMITATION("too many locals");
}
// Note: compGetMemArray might throw.
LclVarDsc* newLvaTable = (LclVarDsc*)compGetMemArray(newLvaTableCnt, sizeof(*lvaTable), CMK_LvaTable);
memcpy(newLvaTable, lvaTable, lvaCount * sizeof(*lvaTable));
memset(newLvaTable + lvaCount, 0, (newLvaTableCnt - lvaCount) * sizeof(*lvaTable));
for (unsigned i = lvaCount; i < newLvaTableCnt; i++)
{
new (&newLvaTable[i], jitstd::placement_t()) LclVarDsc(this); // call the constructor.
}
#if 0
#ifdef DEBUG
// TODO-Cleanup: Enable this and test.
// Fill the old table with junks. So to detect the un-intended use.
memset(lvaTable, fDefaultFill2.val_DontUse_(CLRConfig::INTERNAL_JitDefaultFill, 0xFF), lvaCount * sizeof(*lvaTable));
#endif
#endif
lvaTableCnt = newLvaTableCnt;
lvaTable = newLvaTable;
}
unsigned tempNum = lvaCount;
while (cnt--)
{
lvaTable[lvaCount].lvType = TYP_UNDEF; // Initialize lvType, lvIsTemp and lvOnFrame
lvaTable[lvaCount].lvIsTemp = false;
lvaTable[lvaCount].lvOnFrame = true;
lvaCount++;
}
return tempNum;
}
/*****************************************************************************
*
* Allocate a temporary variable which is implicitly used by code-gen
* There will be no explicit references to the temp, and so it needs to
* be forced to be kept alive, and not be optimized away.
*/
inline unsigned Compiler::lvaGrabTempWithImplicitUse(bool shortLifetime DEBUGARG(const char* reason))
{
if (compIsForInlining())
{
// Grab the temp using Inliner's Compiler instance.
unsigned tmpNum = impInlineInfo->InlinerCompiler->lvaGrabTempWithImplicitUse(shortLifetime DEBUGARG(reason));
lvaTable = impInlineInfo->InlinerCompiler->lvaTable;
lvaCount = impInlineInfo->InlinerCompiler->lvaCount;
lvaTableCnt = impInlineInfo->InlinerCompiler->lvaTableCnt;
return tmpNum;
}
unsigned lclNum = lvaGrabTemp(shortLifetime DEBUGARG(reason));
LclVarDsc* varDsc = &lvaTable[lclNum];
// This will prevent it from being optimized away
// TODO-CQ: We shouldn't have to go as far as to declare these
// address-exposed -- DoNotEnregister should suffice?
lvaSetVarAddrExposed(lclNum);
// We need lvRefCnt to be non-zero to prevent various asserts from firing.
varDsc->lvRefCnt = 1;
varDsc->lvRefCntWtd = BB_UNITY_WEIGHT;
return lclNum;
}
/*****************************************************************************
*
* If lvaTrackedFixed is false then set the lvaSortAgain flag
* (this allows us to grow the number of tracked variables)
* and zero lvRefCntWtd when lvRefCnt is zero
*/
inline void LclVarDsc::lvaResetSortAgainFlag(Compiler* comp)
{
if (!comp->lvaTrackedFixed)
{
/* Flag this change, set lvaSortAgain to true */
comp->lvaSortAgain = true;
}
/* Set weighted ref count to zero if ref count is zero */
if (lvRefCnt == 0)
{
lvRefCntWtd = 0;
}
}
/*****************************************************************************
*
* Decrement the ref counts for a local variable
*/
inline void LclVarDsc::decRefCnts(BasicBlock::weight_t weight, Compiler* comp, bool propagate)
{
/* Decrement lvRefCnt and lvRefCntWtd */
Compiler::lvaPromotionType promotionType = DUMMY_INIT(Compiler::PROMOTION_TYPE_NONE);
if (varTypeIsStruct(lvType))
{
promotionType = comp->lvaGetPromotionType(this);
}
//
// Decrement counts on the local itself.
//
if (lvType != TYP_STRUCT || promotionType != Compiler::PROMOTION_TYPE_INDEPENDENT)
{
assert(lvRefCnt); // Can't decrement below zero
// TODO: Well, the assert above could be bogus.
// If lvRefCnt has overflowed before, then might drop to 0.
// Therefore we do need the following check to keep lvRefCnt from underflow:
if (lvRefCnt > 0)
{
//
// Decrement lvRefCnt
//
lvRefCnt--;
//
// Decrement lvRefCntWtd
//
if (weight != 0)
{
if (lvIsTemp && (weight * 2 > weight))
{
weight *= 2;
}
if (lvRefCntWtd <= weight)
{ // Can't go below zero
lvRefCntWtd = 0;
}
else
{
lvRefCntWtd -= weight;
}
}
}
}
if (varTypeIsStruct(lvType) && propagate)
{
// For promoted struct locals, decrement lvRefCnt on its field locals as well.
if (promotionType == Compiler::PROMOTION_TYPE_INDEPENDENT ||
promotionType == Compiler::PROMOTION_TYPE_DEPENDENT)
{
for (unsigned i = lvFieldLclStart; i < lvFieldLclStart + lvFieldCnt; ++i)
{
comp->lvaTable[i].decRefCnts(comp->lvaMarkRefsWeight, comp, false); // Don't propagate
}
}
}
if (lvIsStructField && propagate)
{
// Depending on the promotion type, decrement the ref count for the parent struct as well.
promotionType = comp->lvaGetParentPromotionType(this);
LclVarDsc* parentvarDsc = &comp->lvaTable[lvParentLcl];
assert(!parentvarDsc->lvRegStruct);
if (promotionType == Compiler::PROMOTION_TYPE_DEPENDENT)
{
parentvarDsc->decRefCnts(comp->lvaMarkRefsWeight, comp, false); // Don't propagate
}
}
lvaResetSortAgainFlag(comp);
#ifdef DEBUG
if (comp->verbose)
{
unsigned varNum = (unsigned)(this - comp->lvaTable);
assert(&comp->lvaTable[varNum] == this);
printf("New refCnts for V%02u: refCnt = %2u, refCntWtd = %s\n", varNum, lvRefCnt, refCntWtd2str(lvRefCntWtd));
}
#endif
}
/*****************************************************************************
*
* Increment the ref counts for a local variable
*/
inline void LclVarDsc::incRefCnts(BasicBlock::weight_t weight, Compiler* comp, bool propagate)
{
Compiler::lvaPromotionType promotionType = DUMMY_INIT(Compiler::PROMOTION_TYPE_NONE);
if (varTypeIsStruct(lvType))
{
promotionType = comp->lvaGetPromotionType(this);
}
//
// Increment counts on the local itself.
//
if (lvType != TYP_STRUCT || promotionType != Compiler::PROMOTION_TYPE_INDEPENDENT)
{
//
// Increment lvRefCnt
//
int newRefCnt = lvRefCnt + 1;
if (newRefCnt == (unsigned short)newRefCnt) // lvRefCnt is an "unsigned short". Don't overflow it.
{
lvRefCnt = (unsigned short)newRefCnt;
}
// This fires when an uninitialize value for 'weight' is used (see lvaMarkRefsWeight)
assert(weight != 0xdddddddd);
//
// Increment lvRefCntWtd
//
if (weight != 0)
{
// We double the weight of internal temps
//
if (lvIsTemp && (weight * 2 > weight))
{
weight *= 2;
}
unsigned newWeight = lvRefCntWtd + weight;
if (newWeight >= lvRefCntWtd)
{ // lvRefCntWtd is an "unsigned". Don't overflow it
lvRefCntWtd = newWeight;
}
else
{ // On overflow we assign ULONG_MAX
lvRefCntWtd = ULONG_MAX;
}
}
}
if (varTypeIsStruct(lvType) && propagate)
{
// For promoted struct locals, increment lvRefCnt on its field locals as well.
if (promotionType == Compiler::PROMOTION_TYPE_INDEPENDENT ||
promotionType == Compiler::PROMOTION_TYPE_DEPENDENT)
{
for (unsigned i = lvFieldLclStart; i < lvFieldLclStart + lvFieldCnt; ++i)
{
comp->lvaTable[i].incRefCnts(comp->lvaMarkRefsWeight, comp, false); // Don't propagate
}
}
}
if (lvIsStructField && propagate)
{
// Depending on the promotion type, increment the ref count for the parent struct as well.
promotionType = comp->lvaGetParentPromotionType(this);
LclVarDsc* parentvarDsc = &comp->lvaTable[lvParentLcl];
assert(!parentvarDsc->lvRegStruct);
if (promotionType == Compiler::PROMOTION_TYPE_DEPENDENT)
{
parentvarDsc->incRefCnts(comp->lvaMarkRefsWeight, comp, false); // Don't propagate
}
}
lvaResetSortAgainFlag(comp);
#ifdef DEBUG
if (comp->verbose)
{
unsigned varNum = (unsigned)(this - comp->lvaTable);
assert(&comp->lvaTable[varNum] == this);
printf("New refCnts for V%02u: refCnt = %2u, refCntWtd = %s\n", varNum, lvRefCnt, refCntWtd2str(lvRefCntWtd));
}
#endif
}
/*****************************************************************************
*
* Set the lvPrefReg field to reg
*/
inline void LclVarDsc::setPrefReg(regNumber regNum, Compiler* comp)
{
regMaskTP regMask;
if (isFloatRegType(TypeGet()))
{
// Check for FP struct-promoted field being passed in integer register
//
if (!genIsValidFloatReg(regNum))
{
return;
}
regMask = genRegMaskFloat(regNum, TypeGet());
}
else
{
regMask = genRegMask(regNum);
}
#ifdef _TARGET_ARM_
// Don't set a preferred register for a TYP_STRUCT that takes more than one register slot
if ((TypeGet() == TYP_STRUCT) && (lvSize() > REGSIZE_BYTES))
return;
#endif
/* Only interested if we have a new register bit set */
if (lvPrefReg & regMask)
{
return;
}
#ifdef DEBUG
if (comp->verbose)
{
if (lvPrefReg)
{
printf("Change preferred register for V%02u from ", this - comp->lvaTable);
dspRegMask(lvPrefReg);
}
else
{
printf("Set preferred register for V%02u", this - comp->lvaTable);
}
printf(" to ");
dspRegMask(regMask);
printf("\n");
}
#endif
/* Overwrite the lvPrefReg field */
lvPrefReg = (regMaskSmall)regMask;
#ifdef LEGACY_BACKEND
// This is specific to the classic register allocator.
// While walking the trees during reg predict we set the lvPrefReg mask
// and then re-sort the 'tracked' variable when the lvPrefReg mask changes.
if (lvTracked)
{
/* Flag this change, set lvaSortAgain to true */
comp->lvaSortAgain = true;
}
#endif // LEGACY_BACKEND
}
/*****************************************************************************
*
* Add regMask to the lvPrefReg field
*/
inline void LclVarDsc::addPrefReg(regMaskTP regMask, Compiler* comp)
{
assert(regMask != RBM_NONE);
#ifdef _TARGET_ARM_
// Don't set a preferred register for a TYP_STRUCT that takes more than one register slot
if ((lvType == TYP_STRUCT) && (lvSize() > sizeof(void*)))
return;
#endif
/* Only interested if we have a new register bit set */
if (lvPrefReg & regMask)
{
return;
}
#ifdef DEBUG
if (comp->verbose)
{
if (lvPrefReg)
{
printf("Additional preferred register for V%02u from ", this - comp->lvaTable);
dspRegMask(lvPrefReg);
}
else
{
printf("Set preferred register for V%02u", this - comp->lvaTable);
}
printf(" to ");
dspRegMask(lvPrefReg | regMask);
printf("\n");
}
#endif
/* Update the lvPrefReg field */
lvPrefReg |= regMask;
#ifdef LEGACY_BACKEND
// This is specific to the classic register allocator
// While walking the trees during reg predict we set the lvPrefReg mask
// and then resort the 'tracked' variable when the lvPrefReg mask changes
if (lvTracked)
{
/* Flag this change, set lvaSortAgain to true */
comp->lvaSortAgain = true;
}
#endif // LEGACY_BACKEND
}
/*****************************************************************************
*
* The following returns the mask of all tracked locals
* referenced in a statement.
*/
inline VARSET_VALRET_TP Compiler::lvaStmtLclMask(GenTreePtr stmt)
{
GenTreePtr tree;
unsigned varNum;
LclVarDsc* varDsc;
VARSET_TP VARSET_INIT_NOCOPY(lclMask, VarSetOps::MakeEmpty(this));
assert(stmt->gtOper == GT_STMT);
assert(fgStmtListThreaded);
for (tree = stmt->gtStmt.gtStmtList; tree; tree = tree->gtNext)
{
if (tree->gtOper != GT_LCL_VAR)
{
continue;
}
varNum = tree->gtLclVarCommon.gtLclNum;
assert(varNum < lvaCount);
varDsc = lvaTable + varNum;
if (!varDsc->lvTracked)
{
continue;
}
VarSetOps::UnionD(this, lclMask, VarSetOps::MakeSingleton(this, varDsc->lvVarIndex));
}
return lclMask;
}
/*****************************************************************************
* Returns true if the lvType is a TYP_REF or a TYP_BYREF.
* When the lvType is a TYP_STRUCT it searches the GC layout
* of the struct and returns true iff it contains a GC ref.
*/
inline bool Compiler::lvaTypeIsGC(unsigned varNum)
{
if (lvaTable[varNum].TypeGet() == TYP_STRUCT)
{
assert(lvaTable[varNum].lvGcLayout != nullptr); // bits are intialized
return (lvaTable[varNum].lvStructGcCount != 0);
}
return (varTypeIsGC(lvaTable[varNum].TypeGet()));
}
/*****************************************************************************
Is this a synchronized instance method? If so, we will need to report "this"
in the GC information, so that the EE can release the object lock
in case of an exception
We also need to report "this" and keep it alive for all shared generic
code that gets the actual generic context from the "this" pointer and
has exception handlers.
For example, if List<T>::m() is shared between T = object and T = string,
then inside m() an exception handler "catch E<T>" needs to be able to fetch
the 'this' pointer to find out what 'T' is in order to tell if we
should catch the exception or not.
*/
inline bool Compiler::lvaKeepAliveAndReportThis()
{
if (info.compIsStatic || lvaTable[0].TypeGet() != TYP_REF)
{
return false;
}
#ifdef JIT32_GCENCODER
if (info.compFlags & CORINFO_FLG_SYNCH)
return true;
if (info.compMethodInfo->options & CORINFO_GENERICS_CTXT_FROM_THIS)
{
// TODO: Check if any of the exception clauses are
// typed using a generic type. Else, we do not need to report this.
if (info.compXcptnsCount > 0)
return true;
if (opts.compDbgCode)
return true;
if (lvaGenericsContextUsed)
return true;
}
#else // !JIT32_GCENCODER
// If the generics context is the this pointer we need to report it if either
// the VM requires us to keep the generics context alive or it is used in a look-up.
// We keep it alive in the lookup scenario, even when the VM didn't ask us too
// because collectible types need the generics context when gc-ing.
if ((info.compMethodInfo->options & CORINFO_GENERICS_CTXT_FROM_THIS) &&
(lvaGenericsContextUsed || (info.compMethodInfo->options & CORINFO_GENERICS_CTXT_KEEP_ALIVE)))
{
return true;
}
#endif
return false;
}
/*****************************************************************************
Similar to lvaKeepAliveAndReportThis
*/
inline bool Compiler::lvaReportParamTypeArg()
{
if (info.compMethodInfo->options & (CORINFO_GENERICS_CTXT_FROM_METHODDESC | CORINFO_GENERICS_CTXT_FROM_METHODTABLE))
{
assert(info.compTypeCtxtArg != -1);
// If the VM requires us to keep the generics context alive and report it (for example, if any catch
// clause catches a type that uses a generic parameter of this method) this flag will be set.
if (info.compMethodInfo->options & CORINFO_GENERICS_CTXT_KEEP_ALIVE)
{
return true;
}
// Otherwise, if an exact type parameter is needed in the body, report the generics context.
// We do this because collectible types needs the generics context when gc-ing.
if (lvaGenericsContextUsed)
{
return true;
}
}
// Otherwise, we don't need to report it -- the generics context parameter is unused.
return false;
}
//*****************************************************************************
inline unsigned Compiler::lvaCachedGenericContextArgOffset()
{
assert(lvaDoneFrameLayout == FINAL_FRAME_LAYOUT);
return lvaCachedGenericContextArgOffs;
}
/*****************************************************************************
*
* Return the stack framed offset of the given variable; set *FPbased to
* true if the variable is addressed off of FP, false if it's addressed
* off of SP. Note that 'varNum' can be a negated spill-temporary var index.
*
* mustBeFPBased - strong about whether the base reg is FP. But it is also
* strong about not being FPBased after FINAL_FRAME_LAYOUT. i.e.,
* it enforces SP based.
*
* addrModeOffset - is the addressing mode offset, for example: v02 + 0x10
* So, V02 itself is at offset sp + 0x10 and then addrModeOffset is what gets
* added beyond that.
*/
inline
#ifdef _TARGET_ARM_
int
Compiler::lvaFrameAddress(int varNum, bool mustBeFPBased, regNumber* pBaseReg, int addrModeOffset)
#else
int
Compiler::lvaFrameAddress(int varNum, bool* pFPbased)
#endif
{
assert(lvaDoneFrameLayout != NO_FRAME_LAYOUT);
int offset;
bool FPbased;
bool fConservative = false;
var_types type = TYP_UNDEF;
if (varNum >= 0)
{
LclVarDsc* varDsc;
assert((unsigned)varNum < lvaCount);
varDsc = lvaTable + varNum;
type = varDsc->TypeGet();
bool isPrespilledArg = false;
#if defined(_TARGET_ARM_) && defined(PROFILING_SUPPORTED)
isPrespilledArg = varDsc->lvIsParam && compIsProfilerHookNeeded() &&
lvaIsPreSpilled(varNum, codeGen->regSet.rsMaskPreSpillRegs(false));
#endif
// If we have finished with register allocation, and this isn't a stack-based local,
// check that this has a valid stack location.
if (lvaDoneFrameLayout > REGALLOC_FRAME_LAYOUT && !varDsc->lvOnFrame)
{
#ifdef _TARGET_AMD64_
#ifndef FEATURE_UNIX_AMD64_STRUCT_PASSING
// On amd64, every param has a stack location, except on Unix-like systems.
assert(varDsc->lvIsParam);
#endif // FEATURE_UNIX_AMD64_STRUCT_PASSING
#elif defined(_TARGET_X86_) && !defined(LEGACY_BACKEND)
// For !LEGACY_BACKEND on x86, a stack parameter that is enregistered will have a stack location.
assert(varDsc->lvIsParam && !varDsc->lvIsRegArg);
#else // !(_TARGET_AMD64 || !(defined(_TARGET_X86_) && !defined(LEGACY_BACKEND)))
// Otherwise, we only have a valid stack location for:
// A parameter that was passed on the stack, being homed into its register home,
// or a prespilled argument on arm under profiler.
assert((varDsc->lvIsParam && !varDsc->lvIsRegArg && varDsc->lvRegister) || isPrespilledArg);
#endif // !(_TARGET_AMD64 || !(defined(_TARGET_X86_) && !defined(LEGACY_BACKEND)))
}
FPbased = varDsc->lvFramePointerBased;
#ifdef DEBUG
#if FEATURE_FIXED_OUT_ARGS
if ((unsigned)varNum == lvaOutgoingArgSpaceVar)
{
assert(FPbased == false);
}
else
#endif
{
#if DOUBLE_ALIGN
assert(FPbased == (isFramePointerUsed() || (genDoubleAlign() && varDsc->lvIsParam && !varDsc->lvIsRegArg)));
#else
#ifdef _TARGET_X86_
assert(FPbased == isFramePointerUsed());
#endif
#endif
}
#endif // DEBUG
offset = varDsc->lvStkOffs;
}
else // Its a spill-temp
{
FPbased = isFramePointerUsed();
if (lvaDoneFrameLayout == Compiler::FINAL_FRAME_LAYOUT)
{
TempDsc* tmpDsc = tmpFindNum(varNum);
#ifndef LEGACY_BACKEND
// The temp might be in use, since this might be during code generation.
if (tmpDsc == nullptr)
{
tmpDsc = tmpFindNum(varNum, Compiler::TEMP_USAGE_USED);
}
#endif // !LEGACY_BACKEND
assert(tmpDsc != nullptr);
offset = tmpDsc->tdTempOffs();
type = tmpDsc->tdTempType();
}
else
{
// This value is an estimate until we calculate the
// offset after the final frame layout
// ---------------------------------------------------
// : :
// +-------------------------+ base --+
// | LR, ++N for ARM | | frameBaseOffset (= N)
// +-------------------------+ |
// | R11, ++N for ARM | <---FP |
// +-------------------------+ --+
// | compCalleeRegsPushed - N| | lclFrameOffset
// +-------------------------+ --+
// | lclVars | |
// +-------------------------+ |
// | tmp[MAX_SPILL_TEMP] | |
// | tmp[1] | |
// | tmp[0] | | compLclFrameSize
// +-------------------------+ |
// | outgoingArgSpaceSize | |
// +-------------------------+ --+
// | | <---SP
// : :
// ---------------------------------------------------
type = compFloatingPointUsed ? TYP_FLOAT : TYP_INT;
fConservative = true;
if (!FPbased)
{
// Worst case stack based offset.
CLANG_FORMAT_COMMENT_ANCHOR;
#if FEATURE_FIXED_OUT_ARGS
int outGoingArgSpaceSize = lvaOutgoingArgSpaceSize;
#else
int outGoingArgSpaceSize = 0;
#endif
offset = outGoingArgSpaceSize + max(-varNum * TARGET_POINTER_SIZE, (int)lvaGetMaxSpillTempSize());
}
else
{
// Worst case FP based offset.
CLANG_FORMAT_COMMENT_ANCHOR;
#ifdef _TARGET_ARM_
offset = codeGen->genCallerSPtoInitialSPdelta() - codeGen->genCallerSPtoFPdelta();
#else
offset = -(codeGen->genTotalFrameSize());
#endif
}
}
}
#ifdef _TARGET_ARM_
if (FPbased)
{
if (mustBeFPBased)
{
*pBaseReg = REG_FPBASE;
}
// Change the FP-based addressing to the SP-based addressing when possible because
// it generates smaller code on ARM. See frame picture above for the math.
else
{
// If it is the final frame layout phase, we don't have a choice, we should stick
// to either FP based or SP based that we decided in the earlier phase. Because
// we have already selected the instruction. Min-opts will have R10 enabled, so just
// use that.
int spOffset = fConservative ? compLclFrameSize : offset + codeGen->genSPtoFPdelta();
int actualOffset = (spOffset + addrModeOffset);
int ldrEncodeLimit = (varTypeIsFloating(type) ? 0x3FC : 0xFFC);
// Use ldr sp imm encoding.
if (lvaDoneFrameLayout == FINAL_FRAME_LAYOUT || opts.MinOpts() || (actualOffset <= ldrEncodeLimit))
{
offset = spOffset;
*pBaseReg = compLocallocUsed ? REG_SAVED_LOCALLOC_SP : REG_SPBASE;
}
// Use ldr +/-imm8 encoding.
else if (offset >= -0x7C && offset <= ldrEncodeLimit)
{
*pBaseReg = REG_FPBASE;
}
// Use a single movw. prefer locals.
else if (actualOffset <= 0xFFFC) // Fix 383910 ARM ILGEN
{
offset = spOffset;
*pBaseReg = compLocallocUsed ? REG_SAVED_LOCALLOC_SP : REG_SPBASE;
}
// Use movw, movt.
else
{
*pBaseReg = REG_FPBASE;
}
}
}
else
{
*pBaseReg = REG_SPBASE;
}
#else
*pFPbased = FPbased;
#endif
return offset;
}
inline bool Compiler::lvaIsParameter(unsigned varNum)
{
LclVarDsc* varDsc;
assert(varNum < lvaCount);
varDsc = lvaTable + varNum;
return varDsc->lvIsParam;
}
inline bool Compiler::lvaIsRegArgument(unsigned varNum)
{
LclVarDsc* varDsc;
assert(varNum < lvaCount);
varDsc = lvaTable + varNum;
return varDsc->lvIsRegArg;
}
inline BOOL Compiler::lvaIsOriginalThisArg(unsigned varNum)
{
assert(varNum < lvaCount);
BOOL isOriginalThisArg = (varNum == info.compThisArg) && (info.compIsStatic == false);
#ifdef DEBUG
if (isOriginalThisArg)
{
LclVarDsc* varDsc = lvaTable + varNum;
// Should never write to or take the address of the original 'this' arg
CLANG_FORMAT_COMMENT_ANCHOR;
#ifndef JIT32_GCENCODER
// With the general encoder/decoder, when the original 'this' arg is needed as a generics context param, we
// copy to a new local, and mark the original as DoNotEnregister, to
// ensure that it is stack-allocated. It should not be the case that the original one can be modified -- it
// should not be written to, or address-exposed.
assert(!varDsc->lvArgWrite &&
(!varDsc->lvAddrExposed || ((info.compMethodInfo->options & CORINFO_GENERICS_CTXT_FROM_THIS) != 0)));
#else
assert(!varDsc->lvArgWrite && !varDsc->lvAddrExposed);
#endif
}
#endif
return isOriginalThisArg;
}
inline BOOL Compiler::lvaIsOriginalThisReadOnly()
{
return lvaArg0Var == info.compThisArg;
}
/*****************************************************************************
*
* The following is used to detect the cases where the same local variable#
* is used both as a long/double value and a 32-bit value and/or both as an
* integer/address and a float value.
*/
/* static */ inline unsigned Compiler::lvaTypeRefMask(var_types type)
{
const static BYTE lvaTypeRefMasks[] = {
#define DEF_TP(tn, nm, jitType, verType, sz, sze, asze, st, al, tf, howUsed) howUsed,
#include "typelist.h"
#undef DEF_TP
};
assert((unsigned)type < sizeof(lvaTypeRefMasks));
assert(lvaTypeRefMasks[type] != 0);
return lvaTypeRefMasks[type];
}
/*****************************************************************************
*
* The following is used to detect the cases where the same local variable#
* is used both as a long/double value and a 32-bit value and/or both as an
* integer/address and a float value.
*/
inline var_types Compiler::lvaGetActualType(unsigned lclNum)
{
return genActualType(lvaGetRealType(lclNum));
}
inline var_types Compiler::lvaGetRealType(unsigned lclNum)
{
return lvaTable[lclNum].TypeGet();
}
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX Importer XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
inline unsigned Compiler::compMapILargNum(unsigned ILargNum)
{
assert(ILargNum < info.compILargsCount || tiVerificationNeeded);
// Note that this works because if compRetBuffArg/compTypeCtxtArg/lvVarargsHandleArg are not present
// they will be BAD_VAR_NUM (MAX_UINT), which is larger than any variable number.
if (ILargNum >= info.compRetBuffArg)
{
ILargNum++;
assert(ILargNum < info.compLocalsCount || tiVerificationNeeded); // compLocals count already adjusted.
}
if (ILargNum >= (unsigned)info.compTypeCtxtArg)
{
ILargNum++;
assert(ILargNum < info.compLocalsCount || tiVerificationNeeded); // compLocals count already adjusted.
}
if (ILargNum >= (unsigned)lvaVarargsHandleArg)
{
ILargNum++;
assert(ILargNum < info.compLocalsCount || tiVerificationNeeded); // compLocals count already adjusted.
}
assert(ILargNum < info.compArgsCount || tiVerificationNeeded);
return (ILargNum);
}
// For ARM varargs, all arguments go in integer registers, so swizzle the type
inline var_types Compiler::mangleVarArgsType(var_types type)
{
#ifdef _TARGET_ARMARCH_
if (info.compIsVarArgs || opts.compUseSoftFP)
{
switch (type)
{
case TYP_FLOAT:
return TYP_INT;
case TYP_DOUBLE:
return TYP_LONG;
default:
break;
}
}
#endif // _TARGET_ARMARCH_
return type;
}
// For CORECLR there is no vararg on System V systems.
#if FEATURE_VARARG
inline regNumber Compiler::getCallArgIntRegister(regNumber floatReg)
{
#ifdef _TARGET_AMD64_
switch (floatReg)
{
case REG_XMM0:
return REG_RCX;
case REG_XMM1:
return REG_RDX;
case REG_XMM2:
return REG_R8;
case REG_XMM3:
return REG_R9;
default:
unreached();
}
#else // !_TARGET_AMD64_
// How will float args be passed for RyuJIT/x86?
NYI("getCallArgIntRegister for RyuJIT/x86");
return REG_NA;
#endif // !_TARGET_AMD64_
}
inline regNumber Compiler::getCallArgFloatRegister(regNumber intReg)
{
#ifdef _TARGET_AMD64_
switch (intReg)
{
case REG_RCX:
return REG_XMM0;
case REG_RDX:
return REG_XMM1;
case REG_R8:
return REG_XMM2;
case REG_R9:
return REG_XMM3;
default:
unreached();
}
#else // !_TARGET_AMD64_
// How will float args be passed for RyuJIT/x86?
NYI("getCallArgFloatRegister for RyuJIT/x86");
return REG_NA;
#endif // !_TARGET_AMD64_
}
#endif // FEATURE_VARARG
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX Register Allocator XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
/*****************************************************************************/
inline bool rpCanAsgOperWithoutReg(GenTreePtr op, bool lclvar)
{
var_types type;
switch (op->OperGet())
{
case GT_CNS_LNG:
case GT_CNS_INT:
return true;
case GT_LCL_VAR:
type = genActualType(op->TypeGet());
if (lclvar && ((type == TYP_INT) || (type == TYP_REF) || (type == TYP_BYREF)))
{
return true;
}
break;
default:
break;
}
return false;
}
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XX
XX FlowGraph XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
inline bool Compiler::compCanEncodePtrArgCntMax()
{
#ifdef JIT32_GCENCODER
// DDB 204533:
// The GC encoding for fully interruptible methods does not
// support more than 1023 pushed arguments, so we have to
// use a partially interruptible GC info/encoding.
//
return (fgPtrArgCntMax < MAX_PTRARG_OFS);
#else // JIT32_GCENCODER
return true;
#endif
}
/*****************************************************************************
*
* Call the given function pointer for all nodes in the tree. The 'visitor'
* fn should return one of the following values:
*
* WALK_ABORT stop walking and return immediately
* WALK_CONTINUE continue walking
* WALK_SKIP_SUBTREES don't walk any subtrees of the node just visited
*
* computeStack - true if we want to make stack visible to callback function
*/
inline Compiler::fgWalkResult Compiler::fgWalkTreePre(
GenTreePtr* pTree, fgWalkPreFn* visitor, void* callBackData, bool lclVarsOnly, bool computeStack)
{
fgWalkData walkData;
walkData.compiler = this;
walkData.wtprVisitorFn = visitor;
walkData.pCallbackData = callBackData;
walkData.parent = nullptr;
walkData.wtprLclsOnly = lclVarsOnly;
#ifdef DEBUG
walkData.printModified = false;
#endif
fgWalkResult result;
if (computeStack)
{
GenTreeStack parentStack(this);
walkData.parentStack = &parentStack;
result = fgWalkTreePreRec<true>(pTree, &walkData);
}
else
{
walkData.parentStack = nullptr;
result = fgWalkTreePreRec<false>(pTree, &walkData);
}
#ifdef DEBUG
if (verbose && walkData.printModified)
{
gtDispTree(*pTree);
}
#endif
return result;
}
/*****************************************************************************
*
* Same as above, except the tree walk is performed in a depth-first fashion,
* The 'visitor' fn should return one of the following values:
*
* WALK_ABORT stop walking and return immediately
* WALK_CONTINUE continue walking
*
* computeStack - true if we want to make stack visible to callback function
*/
inline Compiler::fgWalkResult Compiler::fgWalkTreePost(GenTreePtr* pTree,
fgWalkPostFn* visitor,
void* callBackData,
bool computeStack)
{
fgWalkData walkData;
walkData.compiler = this;
walkData.wtpoVisitorFn = visitor;
walkData.pCallbackData = callBackData;
walkData.parent = nullptr;
fgWalkResult result;
if (computeStack)
{
GenTreeStack parentStack(this);
walkData.parentStack = &parentStack;
result = fgWalkTreePostRec<true>(pTree, &walkData);
}
else
{
walkData.parentStack = nullptr;
result = fgWalkTreePostRec<false>(pTree, &walkData);
}
assert(result == WALK_CONTINUE || result == WALK_ABORT);
return result;
}
/*****************************************************************************
*
* Has this block been added to throw an inlined exception
* Returns true if the block was added to throw one of:
* range-check exception
* argument exception (used by feature SIMD)
* argument range-check exception (used by feature SIMD)
* divide by zero exception (Not used on X86/X64)
* null reference exception (Not currently used)
* overflow exception
*/
inline bool Compiler::fgIsThrowHlpBlk(BasicBlock* block)
{
if (!fgIsCodeAdded())
{
return false;
}
if (!(block->bbFlags & BBF_INTERNAL) || block->bbJumpKind != BBJ_THROW)
{
return false;
}
GenTree* call = block->lastNode();
#ifdef DEBUG
if (block->IsLIR())
{
LIR::Range& blockRange = LIR::AsRange(block);
for (LIR::Range::ReverseIterator node = blockRange.rbegin(), end = blockRange.rend(); node != end; ++node)
{
if (node->OperGet() == GT_CALL)
{
assert(*node == call);
assert(node == blockRange.rbegin());
break;
}
}
}
#endif
if (!call || (call->gtOper != GT_CALL))
{
return false;
}
if (!((call->gtCall.gtCallMethHnd == eeFindHelper(CORINFO_HELP_RNGCHKFAIL)) ||
(call->gtCall.gtCallMethHnd == eeFindHelper(CORINFO_HELP_THROWDIVZERO)) ||
#if COR_JIT_EE_VERSION > 460
(call->gtCall.gtCallMethHnd == eeFindHelper(CORINFO_HELP_THROWNULLREF)) ||
#endif // COR_JIT_EE_VERSION
(call->gtCall.gtCallMethHnd == eeFindHelper(CORINFO_HELP_OVERFLOW))))
{
return false;
}
// We can get to this point for blocks that we didn't create as throw helper blocks
// under stress, with crazy flow graph optimizations. So, walk the fgAddCodeList
// for the final determination.
for (AddCodeDsc* add = fgAddCodeList; add; add = add->acdNext)
{
if (block == add->acdDstBlk)
{
return add->acdKind == SCK_RNGCHK_FAIL || add->acdKind == SCK_DIV_BY_ZERO || add->acdKind == SCK_OVERFLOW
#if COR_JIT_EE_VERSION > 460
|| add->acdKind == SCK_ARG_EXCPN || add->acdKind == SCK_ARG_RNG_EXCPN
#endif // COR_JIT_EE_VERSION
;
}
}
// We couldn't find it in the fgAddCodeList
return false;
}
/*****************************************************************************
*
* Return the stackLevel of the inserted block that throws exception
* (by calling the EE helper).
*/
inline unsigned Compiler::fgThrowHlpBlkStkLevel(BasicBlock* block)
{
for (AddCodeDsc* add = fgAddCodeList; add; add = add->acdNext)
{
if (block == add->acdDstBlk)
{
// Compute assert cond separately as assert macro cannot have conditional compilation directives.
bool cond =
(add->acdKind == SCK_RNGCHK_FAIL || add->acdKind == SCK_DIV_BY_ZERO || add->acdKind == SCK_OVERFLOW
#if COR_JIT_EE_VERSION > 460
|| add->acdKind == SCK_ARG_EXCPN || add->acdKind == SCK_ARG_RNG_EXCPN
#endif // COR_JIT_EE_VERSION
);
assert(cond);
// TODO: bbTgtStkDepth is DEBUG-only.
// Should we use it regularly and avoid this search.
assert(block->bbTgtStkDepth == add->acdStkLvl);
return add->acdStkLvl;
}
}
noway_assert(!"fgThrowHlpBlkStkLevel should only be called if fgIsThrowHlpBlk() is true, but we can't find the "
"block in the fgAddCodeList list");
/* We couldn't find the basic block: it must not have been a throw helper block */
return 0;
}
/*
Small inline function to change a given block to a throw block.
*/
inline void Compiler::fgConvertBBToThrowBB(BasicBlock* block)
{
block->bbJumpKind = BBJ_THROW;
block->bbSetRunRarely(); // any block with a throw is rare
}
/*****************************************************************************
*
* Return true if we've added any new basic blocks.
*/
inline bool Compiler::fgIsCodeAdded()
{
return fgAddCodeModf;
}
/*****************************************************************************
Is the offset too big?
*/
inline bool Compiler::fgIsBigOffset(size_t offset)
{
return (offset > compMaxUncheckedOffsetForNullObject);
}
/***********************************************************************************
*
* Returns true if back-end will do other than integer division which currently occurs only
* if "divisor" is a positive integer constant and a power of 2 other than 1 and INT_MIN
*/
inline bool Compiler::fgIsSignedDivOptimizable(GenTreePtr divisor)
{
if (!opts.MinOpts() && divisor->IsCnsIntOrI())
{
ssize_t ival = divisor->gtIntConCommon.IconValue();
/* Is the divisor a power of 2 (excluding INT_MIN) ?.
The intent of the third condition below is to exclude INT_MIN on a 64-bit platform
and during codegen we need to encode ival-1 within 32 bits. If ival were INT_MIN
then ival-1 would cause underflow.
Note that we could put #ifdef around the third check so that it is applied only on
64-bit platforms but the below is a more generic way to express it as it is a no-op
on 32-bit platforms.
*/
return (ival > 0 && genMaxOneBit(ival) && ((ssize_t)(int)ival == ival));
}
return false;
}
/************************************************************************************
*
* Returns true if back-end will do other than integer division which currently occurs
* if "divisor" is an unsigned integer constant and a power of 2 other than 1 and zero.
*/
inline bool Compiler::fgIsUnsignedDivOptimizable(GenTreePtr divisor)
{
if (!opts.MinOpts() && divisor->IsCnsIntOrI())
{
size_t ival = divisor->gtIntCon.gtIconVal;
/* Is the divisor a power of 2 ? */
return ival && genMaxOneBit(ival);
}
return false;
}
/*****************************************************************************
*
* Returns true if back-end will do other than integer division which currently occurs
* if "divisor" is a positive integer constant and a power of 2 other than zero
*/
inline bool Compiler::fgIsSignedModOptimizable(GenTreePtr divisor)
{
if (!opts.MinOpts() && divisor->IsCnsIntOrI())
{
size_t ival = divisor->gtIntCon.gtIconVal;
/* Is the divisor a power of 2 ? */
return ssize_t(ival) > 0 && genMaxOneBit(ival);
}
return false;
}
/*****************************************************************************
*
* Returns true if back-end will do other than integer division which currently occurs
* if "divisor" is a positive integer constant and a power of 2 other than zero
*/
inline bool Compiler::fgIsUnsignedModOptimizable(GenTreePtr divisor)
{
if (!opts.MinOpts() && divisor->IsCnsIntOrI())
{
size_t ival = divisor->gtIntCon.gtIconVal;
/* Is the divisor a power of 2 ? */
return ival != 0 && ival == (unsigned)genFindLowestBit(ival);
}
return false;
}
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX TempsInfo XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
/*****************************************************************************/
/* static */ inline unsigned Compiler::tmpSlot(unsigned size)
{
noway_assert(size >= sizeof(int));
noway_assert(size <= TEMP_MAX_SIZE);
assert((size % sizeof(int)) == 0);
assert(size < UINT32_MAX);
return size / sizeof(int) - 1;
}
/*****************************************************************************
*
* Finish allocating temps - should be called each time after a pass is made
* over a function body.
*/
inline void Compiler::tmpEnd()
{
#ifdef DEBUG
if (verbose && (tmpCount > 0))
{
printf("%d tmps used\n", tmpCount);
}
#endif // DEBUG
}
/*****************************************************************************
*
* Shuts down the temp-tracking code. Should be called once per function
* compiled.
*/
inline void Compiler::tmpDone()
{
#ifdef DEBUG
unsigned count;
TempDsc* temp;
assert(tmpAllFree());
for (temp = tmpListBeg(), count = temp ? 1 : 0; temp; temp = tmpListNxt(temp), count += temp ? 1 : 0)
{
assert(temp->tdLegalOffset());
}
// Make sure that all the temps were released
assert(count == tmpCount);
assert(tmpGetCount == 0);
#endif // DEBUG
}
#ifdef DEBUG
inline bool Compiler::shouldUseVerboseTrees()
{
return (JitConfig.JitDumpVerboseTrees() == 1);
}
inline bool Compiler::shouldUseVerboseSsa()
{
return (JitConfig.JitDumpVerboseSsa() == 1);
}
//------------------------------------------------------------------------
// shouldDumpASCIITrees: Should we use only ASCII characters for tree dumps?
//
// Notes:
// This is set to default to 1 in clrConfigValues.h
inline bool Compiler::shouldDumpASCIITrees()
{
return (JitConfig.JitDumpASCII() == 1);
}
/*****************************************************************************
* Should we enable JitStress mode?
* 0: No stress
* !=2: Vary stress. Performance will be slightly/moderately degraded
* 2: Check-all stress. Performance will be REALLY horrible
*/
inline DWORD getJitStressLevel()
{
return JitConfig.JitStress();
}
/*****************************************************************************
* Should we do the strict check for non-virtual call to the virtual method?
*/
inline DWORD StrictCheckForNonVirtualCallToVirtualMethod()
{
return JitConfig.JitStrictCheckForNonVirtualCallToVirtualMethod() == 1;
}
#endif // DEBUG
/*****************************************************************************/
/* Map a register argument number ("RegArgNum") to a register number ("RegNum").
* A RegArgNum is in this range:
* [0, MAX_REG_ARG) -- for integer registers
* [0, MAX_FLOAT_REG_ARG) -- for floating point registers
* Note that RegArgNum's are overlapping for integer and floating-point registers,
* while RegNum's are not (for ARM anyway, though for x86, it might be different).
* If we have a fixed return buffer register and are given it's index
* we return the fixed return buffer register
*/
inline regNumber genMapIntRegArgNumToRegNum(unsigned argNum)
{
if (hasFixedRetBuffReg() && (argNum == theFixedRetBuffArgNum()))
{
return theFixedRetBuffReg();
}
assert(argNum < ArrLen(intArgRegs));
return intArgRegs[argNum];
}
inline regNumber genMapFloatRegArgNumToRegNum(unsigned argNum)
{
#ifndef _TARGET_X86_
assert(argNum < ArrLen(fltArgRegs));
return fltArgRegs[argNum];
#else
assert(!"no x86 float arg regs\n");
return REG_NA;
#endif
}
__forceinline regNumber genMapRegArgNumToRegNum(unsigned argNum, var_types type)
{
if (varTypeIsFloating(type))
{
return genMapFloatRegArgNumToRegNum(argNum);
}
else
{
return genMapIntRegArgNumToRegNum(argNum);
}
}
/*****************************************************************************/
/* Map a register argument number ("RegArgNum") to a register mask of the associated register.
* Note that for floating-pointer registers, only the low register for a register pair
* (for a double on ARM) is returned.
*/
inline regMaskTP genMapIntRegArgNumToRegMask(unsigned argNum)
{
assert(argNum < ArrLen(intArgMasks));
return intArgMasks[argNum];
}
inline regMaskTP genMapFloatRegArgNumToRegMask(unsigned argNum)
{
#ifndef _TARGET_X86_
assert(argNum < ArrLen(fltArgMasks));
return fltArgMasks[argNum];
#else
assert(!"no x86 float arg regs\n");
return RBM_NONE;
#endif
}
__forceinline regMaskTP genMapArgNumToRegMask(unsigned argNum, var_types type)
{
regMaskTP result;
if (varTypeIsFloating(type))
{
result = genMapFloatRegArgNumToRegMask(argNum);
#ifdef _TARGET_ARM_
if (type == TYP_DOUBLE)
{
assert((result & RBM_DBL_REGS) != 0);
result |= (result << 1);
}
#endif
}
else
{
result = genMapIntRegArgNumToRegMask(argNum);
}
return result;
}
/*****************************************************************************/
/* Map a register number ("RegNum") to a register argument number ("RegArgNum")
* If we have a fixed return buffer register we return theFixedRetBuffArgNum
*/
inline unsigned genMapIntRegNumToRegArgNum(regNumber regNum)
{
assert(genRegMask(regNum) & fullIntArgRegMask());
switch (regNum)
{
case REG_ARG_0:
return 0;
#if MAX_REG_ARG >= 2
case REG_ARG_1:
return 1;
#if MAX_REG_ARG >= 3
case REG_ARG_2:
return 2;
#if MAX_REG_ARG >= 4
case REG_ARG_3:
return 3;
#if MAX_REG_ARG >= 5
case REG_ARG_4:
return 4;
#if MAX_REG_ARG >= 6
case REG_ARG_5:
return 5;
#if MAX_REG_ARG >= 7
case REG_ARG_6:
return 6;
#if MAX_REG_ARG >= 8
case REG_ARG_7:
return 7;
#endif
#endif
#endif
#endif
#endif
#endif
#endif
default:
// Check for the Arm64 fixed return buffer argument register
if (hasFixedRetBuffReg() && (regNum == theFixedRetBuffReg()))
{
return theFixedRetBuffArgNum();
}
else
{
assert(!"invalid register arg register");
return BAD_VAR_NUM;
}
}
}
inline unsigned genMapFloatRegNumToRegArgNum(regNumber regNum)
{
assert(genRegMask(regNum) & RBM_FLTARG_REGS);
#ifdef _TARGET_ARM_
return regNum - REG_F0;
#elif defined(_TARGET_ARM64_)
return regNum - REG_V0;
#elif defined(UNIX_AMD64_ABI)
return regNum - REG_FLTARG_0;
#else
#if MAX_FLOAT_REG_ARG >= 1
switch (regNum)
{
case REG_FLTARG_0:
return 0;
#if MAX_REG_ARG >= 2
case REG_FLTARG_1:
return 1;
#if MAX_REG_ARG >= 3
case REG_FLTARG_2:
return 2;
#if MAX_REG_ARG >= 4
case REG_FLTARG_3:
return 3;
#if MAX_REG_ARG >= 5
case REG_FLTARG_4:
return 4;
#endif
#endif
#endif
#endif
default:
assert(!"invalid register arg register");
return BAD_VAR_NUM;
}
#else
assert(!"flt reg args not allowed");
return BAD_VAR_NUM;
#endif
#endif // !arm
}
inline unsigned genMapRegNumToRegArgNum(regNumber regNum, var_types type)
{
if (varTypeIsFloating(type))
{
return genMapFloatRegNumToRegArgNum(regNum);
}
else
{
return genMapIntRegNumToRegArgNum(regNum);
}
}
/*****************************************************************************/
/* Return a register mask with the first 'numRegs' argument registers set.
*/
inline regMaskTP genIntAllRegArgMask(unsigned numRegs)
{
assert(numRegs <= MAX_REG_ARG);
regMaskTP result = RBM_NONE;
for (unsigned i = 0; i < numRegs; i++)
{
result |= intArgMasks[i];
}
return result;
}
#if !FEATURE_STACK_FP_X87
inline regMaskTP genFltAllRegArgMask(unsigned numRegs)
{
assert(numRegs <= MAX_FLOAT_REG_ARG);
regMaskTP result = RBM_NONE;
for (unsigned i = 0; i < numRegs; i++)
{
result |= fltArgMasks[i];
}
return result;
}
#endif // !FEATURE_STACK_FP_X87
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX Liveness XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
/*****************************************************************************
*
* Update the current set of live variables based on the life set recorded
* in the given expression tree node.
*/
template <bool ForCodeGen>
inline void Compiler::compUpdateLife(GenTreePtr tree)
{
// TODO-Cleanup: We shouldn't really be calling this more than once
if (tree == compCurLifeTree)
{
return;
}
if (!tree->OperIsNonPhiLocal() && fgIsIndirOfAddrOfLocal(tree) == nullptr)
{
return;
}
compUpdateLifeVar<ForCodeGen>(tree);
}
template <bool ForCodeGen>
inline void Compiler::compUpdateLife(VARSET_VALARG_TP newLife)
{
if (!VarSetOps::Equal(this, compCurLife, newLife))
{
compChangeLife<ForCodeGen>(newLife DEBUGARG(nullptr));
}
#ifdef DEBUG
else
{
if (verbose)
{
printf("Liveness not changing: %s ", VarSetOps::ToString(this, compCurLife));
dumpConvertedVarSet(this, compCurLife);
printf("\n");
}
}
#endif // DEBUG
}
/*****************************************************************************
*
* We stash cookies in basic blocks for the code emitter; this call retrieves
* the cookie associated with the given basic block.
*/
inline void* emitCodeGetCookie(BasicBlock* block)
{
assert(block);
return block->bbEmitCookie;
}
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX Optimizer XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
#if LOCAL_ASSERTION_PROP
/*****************************************************************************
*
* The following resets the value assignment table
* used only during local assertion prop
*/
inline void Compiler::optAssertionReset(AssertionIndex limit)
{
PREFAST_ASSUME(optAssertionCount <= optMaxAssertionCount);
while (optAssertionCount > limit)
{
AssertionIndex index = optAssertionCount;
AssertionDsc* curAssertion = optGetAssertion(index);
optAssertionCount--;
unsigned lclNum = curAssertion->op1.lcl.lclNum;
assert(lclNum < lvaTableCnt);
BitVecOps::RemoveElemD(apTraits, GetAssertionDep(lclNum), index - 1);
//
// Find the Copy assertions
//
if ((curAssertion->assertionKind == OAK_EQUAL) && (curAssertion->op1.kind == O1K_LCLVAR) &&
(curAssertion->op2.kind == O2K_LCLVAR_COPY))
{
//
// op2.lcl.lclNum no longer depends upon this assertion
//
lclNum = curAssertion->op2.lcl.lclNum;
BitVecOps::RemoveElemD(apTraits, GetAssertionDep(lclNum), index - 1);
}
}
while (optAssertionCount < limit)
{
AssertionIndex index = ++optAssertionCount;
AssertionDsc* curAssertion = optGetAssertion(index);
unsigned lclNum = curAssertion->op1.lcl.lclNum;
BitVecOps::AddElemD(apTraits, GetAssertionDep(lclNum), index - 1);
//
// Check for Copy assertions
//
if ((curAssertion->assertionKind == OAK_EQUAL) && (curAssertion->op1.kind == O1K_LCLVAR) &&
(curAssertion->op2.kind == O2K_LCLVAR_COPY))
{
//
// op2.lcl.lclNum now depends upon this assertion
//
lclNum = curAssertion->op2.lcl.lclNum;
BitVecOps::AddElemD(apTraits, GetAssertionDep(lclNum), index - 1);
}
}
}
/*****************************************************************************
*
* The following removes the i-th entry in the value assignment table
* used only during local assertion prop
*/
inline void Compiler::optAssertionRemove(AssertionIndex index)
{
assert(index > 0);
assert(index <= optAssertionCount);
PREFAST_ASSUME(optAssertionCount <= optMaxAssertionCount);
AssertionDsc* curAssertion = optGetAssertion(index);
// Two cases to consider if (index == optAssertionCount) then the last
// entry in the table is to be removed and that happens automatically when
// optAssertionCount is decremented and we can just clear the optAssertionDep bits
// The other case is when index < optAssertionCount and here we overwrite the
// index-th entry in the table with the data found at the end of the table
// Since we are reordering the rable the optAssertionDep bits need to be recreated
// using optAssertionReset(0) and optAssertionReset(newAssertionCount) will
// correctly update the optAssertionDep bits
//
if (index == optAssertionCount)
{
unsigned lclNum = curAssertion->op1.lcl.lclNum;
BitVecOps::RemoveElemD(apTraits, GetAssertionDep(lclNum), index - 1);
//
// Check for Copy assertions
//
if ((curAssertion->assertionKind == OAK_EQUAL) && (curAssertion->op1.kind == O1K_LCLVAR) &&
(curAssertion->op2.kind == O2K_LCLVAR_COPY))
{
//
// op2.lcl.lclNum no longer depends upon this assertion
//
lclNum = curAssertion->op2.lcl.lclNum;
BitVecOps::RemoveElemD(apTraits, GetAssertionDep(lclNum), index - 1);
}
optAssertionCount--;
}
else
{
AssertionDsc* lastAssertion = optGetAssertion(optAssertionCount);
AssertionIndex newAssertionCount = optAssertionCount - 1;
optAssertionReset(0); // This make optAssertionCount equal 0
memcpy(curAssertion, // the entry to be removed
lastAssertion, // last entry in the table
sizeof(AssertionDsc));
optAssertionReset(newAssertionCount);
}
}
#endif // LOCAL_ASSERTION_PROP
inline void Compiler::LoopDsc::AddModifiedField(Compiler* comp, CORINFO_FIELD_HANDLE fldHnd)
{
if (lpFieldsModified == nullptr)
{
lpFieldsModified =
new (comp->getAllocatorLoopHoist()) Compiler::LoopDsc::FieldHandleSet(comp->getAllocatorLoopHoist());
}
lpFieldsModified->Set(fldHnd, true);
}
inline void Compiler::LoopDsc::AddModifiedElemType(Compiler* comp, CORINFO_CLASS_HANDLE structHnd)
{
if (lpArrayElemTypesModified == nullptr)
{
lpArrayElemTypesModified =
new (comp->getAllocatorLoopHoist()) Compiler::LoopDsc::ClassHandleSet(comp->getAllocatorLoopHoist());
}
lpArrayElemTypesModified->Set(structHnd, true);
}
inline void Compiler::LoopDsc::VERIFY_lpIterTree()
{
#ifdef DEBUG
assert(lpFlags & LPFLG_ITER);
// iterTree should be "lcl <op>= const"
assert(lpIterTree);
assert(lpIterTree->OperKind() & GTK_ASGOP); // +=, -=, etc or = +, = -, etc
if (lpIterTree->OperGet() == GT_ASG)
{
GenTreePtr lhs = lpIterTree->gtOp.gtOp1;
GenTreePtr rhs = lpIterTree->gtOp.gtOp2;
assert(lhs->OperGet() == GT_LCL_VAR);
switch (rhs->gtOper)
{
case GT_ADD:
case GT_SUB:
case GT_MUL:
case GT_RSH:
case GT_LSH:
break;
default:
assert(!"Unknown operator for loop increment");
}
assert(rhs->gtOp.gtOp1->OperGet() == GT_LCL_VAR);
assert(rhs->gtOp.gtOp1->AsLclVarCommon()->GetLclNum() == lhs->AsLclVarCommon()->GetLclNum());
assert(rhs->gtOp.gtOp2->OperGet() == GT_CNS_INT);
}
else
{
assert(lpIterTree->gtOp.gtOp1->OperGet() == GT_LCL_VAR);
assert(lpIterTree->gtOp.gtOp2->OperGet() == GT_CNS_INT);
}
#endif
}
//-----------------------------------------------------------------------------
inline unsigned Compiler::LoopDsc::lpIterVar()
{
VERIFY_lpIterTree();
return lpIterTree->gtOp.gtOp1->gtLclVarCommon.gtLclNum;
}
//-----------------------------------------------------------------------------
inline int Compiler::LoopDsc::lpIterConst()
{
VERIFY_lpIterTree();
if (lpIterTree->OperGet() == GT_ASG)
{
GenTreePtr rhs = lpIterTree->gtOp.gtOp2;
return (int)rhs->gtOp.gtOp2->gtIntCon.gtIconVal;
}
else
{
return (int)lpIterTree->gtOp.gtOp2->gtIntCon.gtIconVal;
}
}
//-----------------------------------------------------------------------------
inline genTreeOps Compiler::LoopDsc::lpIterOper()
{
VERIFY_lpIterTree();
if (lpIterTree->OperGet() == GT_ASG)
{
GenTreePtr rhs = lpIterTree->gtOp.gtOp2;
return rhs->OperGet();
}
else
{
return lpIterTree->OperGet();
}
}
inline var_types Compiler::LoopDsc::lpIterOperType()
{
VERIFY_lpIterTree();
var_types type = lpIterTree->TypeGet();
assert(genActualType(type) == TYP_INT);
if ((lpIterTree->gtFlags & GTF_UNSIGNED) && type == TYP_INT)
{
type = TYP_UINT;
}
return type;
}
inline void Compiler::LoopDsc::VERIFY_lpTestTree()
{
#ifdef DEBUG
assert(lpFlags & LPFLG_ITER);
assert(lpTestTree);
genTreeOps oper = lpTestTree->OperGet();
assert(GenTree::OperIsCompare(oper));
GenTreePtr iterator = nullptr;
GenTreePtr limit = nullptr;
if ((lpTestTree->gtOp.gtOp2->gtOper == GT_LCL_VAR) && (lpTestTree->gtOp.gtOp2->gtFlags & GTF_VAR_ITERATOR) != 0)
{
iterator = lpTestTree->gtOp.gtOp2;
limit = lpTestTree->gtOp.gtOp1;
}
else if ((lpTestTree->gtOp.gtOp1->gtOper == GT_LCL_VAR) &&
(lpTestTree->gtOp.gtOp1->gtFlags & GTF_VAR_ITERATOR) != 0)
{
iterator = lpTestTree->gtOp.gtOp1;
limit = lpTestTree->gtOp.gtOp2;
}
else
{
// one of the nodes has to be the iterator
assert(false);
}
if (lpFlags & LPFLG_CONST_LIMIT)
{
assert(limit->OperIsConst());
}
if (lpFlags & LPFLG_VAR_LIMIT)
{
assert(limit->OperGet() == GT_LCL_VAR);
}
if (lpFlags & LPFLG_ARRLEN_LIMIT)
{
assert(limit->OperGet() == GT_ARR_LENGTH);
}
#endif
}
//-----------------------------------------------------------------------------
inline bool Compiler::LoopDsc::lpIsReversed()
{
VERIFY_lpTestTree();
return ((lpTestTree->gtOp.gtOp2->gtOper == GT_LCL_VAR) &&
(lpTestTree->gtOp.gtOp2->gtFlags & GTF_VAR_ITERATOR) != 0);
}
//-----------------------------------------------------------------------------
inline genTreeOps Compiler::LoopDsc::lpTestOper()
{
VERIFY_lpTestTree();
genTreeOps op = lpTestTree->OperGet();
return lpIsReversed() ? GenTree::SwapRelop(op) : op;
}
//-----------------------------------------------------------------------------
inline GenTreePtr Compiler::LoopDsc::lpIterator()
{
VERIFY_lpTestTree();
return lpIsReversed() ? lpTestTree->gtOp.gtOp2 : lpTestTree->gtOp.gtOp1;
}
//-----------------------------------------------------------------------------
inline GenTreePtr Compiler::LoopDsc::lpLimit()
{
VERIFY_lpTestTree();
return lpIsReversed() ? lpTestTree->gtOp.gtOp1 : lpTestTree->gtOp.gtOp2;
}
//-----------------------------------------------------------------------------
inline int Compiler::LoopDsc::lpConstLimit()
{
VERIFY_lpTestTree();
assert(lpFlags & LPFLG_CONST_LIMIT);
GenTreePtr limit = lpLimit();
assert(limit->OperIsConst());
return (int)limit->gtIntCon.gtIconVal;
}
//-----------------------------------------------------------------------------
inline unsigned Compiler::LoopDsc::lpVarLimit()
{
VERIFY_lpTestTree();
assert(lpFlags & LPFLG_VAR_LIMIT);
GenTreePtr limit = lpLimit();
assert(limit->OperGet() == GT_LCL_VAR);
return limit->gtLclVarCommon.gtLclNum;
}
//-----------------------------------------------------------------------------
inline bool Compiler::LoopDsc::lpArrLenLimit(Compiler* comp, ArrIndex* index)
{
VERIFY_lpTestTree();
assert(lpFlags & LPFLG_ARRLEN_LIMIT);
GenTreePtr limit = lpLimit();
assert(limit->OperGet() == GT_ARR_LENGTH);
// Check if we have a.length or a[i][j].length
if (limit->gtArrLen.ArrRef()->gtOper == GT_LCL_VAR)
{
index->arrLcl = limit->gtArrLen.ArrRef()->gtLclVarCommon.gtLclNum;
index->rank = 0;
return true;
}
// We have a[i].length, extract a[i] pattern.
else if (limit->gtArrLen.ArrRef()->gtOper == GT_COMMA)
{
return comp->optReconstructArrIndex(limit->gtArrLen.ArrRef(), index, BAD_VAR_NUM);
}
return false;
}
/*****************************************************************************
* Is "var" assigned in the loop "lnum" ?
*/
inline bool Compiler::optIsVarAssgLoop(unsigned lnum, unsigned var)
{
assert(lnum < optLoopCount);
if (var < lclMAX_ALLSET_TRACKED)
{
ALLVARSET_TP ALLVARSET_INIT_NOCOPY(vs, AllVarSetOps::MakeSingleton(this, var));
return optIsSetAssgLoop(lnum, vs) != 0;
}
else
{
return optIsVarAssigned(optLoopTable[lnum].lpHead->bbNext, optLoopTable[lnum].lpBottom, nullptr, var);
}
}
/*****************************************************************************
* If the tree is a tracked local variable, return its LclVarDsc ptr.
*/
inline LclVarDsc* Compiler::optIsTrackedLocal(GenTreePtr tree)
{
LclVarDsc* varDsc;
unsigned lclNum;
if (tree->gtOper != GT_LCL_VAR)
{
return nullptr;
}
lclNum = tree->gtLclVarCommon.gtLclNum;
assert(lclNum < lvaCount);
varDsc = lvaTable + lclNum;
/* if variable not tracked, return NULL */
if (!varDsc->lvTracked)
{
return nullptr;
}
return varDsc;
}
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XX
XX Optimization activation rules XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
// are we compiling for fast code, or are we compiling for blended code and
// inside a loop?
// We return true for BLENDED_CODE if the Block executes more than BB_LOOP_WEIGHT/2
inline bool Compiler::optFastCodeOrBlendedLoop(BasicBlock::weight_t bbWeight)
{
return (compCodeOpt() == FAST_CODE) ||
((compCodeOpt() == BLENDED_CODE) && (bbWeight > (BB_LOOP_WEIGHT / 2 * BB_UNITY_WEIGHT)));
}
// are we running on a Intel Pentium 4?
inline bool Compiler::optPentium4(void)
{
return (info.genCPU == CPU_X86_PENTIUM_4);
}
// should we use add/sub instead of inc/dec? (faster on P4, but increases size)
inline bool Compiler::optAvoidIncDec(BasicBlock::weight_t bbWeight)
{
return optPentium4() && optFastCodeOrBlendedLoop(bbWeight);
}
// should we try to replace integer multiplication with lea/add/shift sequences?
inline bool Compiler::optAvoidIntMult(void)
{
return (compCodeOpt() != SMALL_CODE);
}
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX EEInterface XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
extern var_types JITtype2varType(CorInfoType type);
#include "ee_il_dll.hpp"
inline CORINFO_METHOD_HANDLE Compiler::eeFindHelper(unsigned helper)
{
assert(helper < CORINFO_HELP_COUNT);
/* Helpers are marked by the fact that they are odd numbers
* force this to be an odd number (will shift it back to extract) */
return ((CORINFO_METHOD_HANDLE)(size_t)((helper << 2) + 1));
}
inline CorInfoHelpFunc Compiler::eeGetHelperNum(CORINFO_METHOD_HANDLE method)
{
// Helpers are marked by the fact that they are odd numbers
if (!(((size_t)method) & 1))
{
return (CORINFO_HELP_UNDEF);
}
return ((CorInfoHelpFunc)(((size_t)method) >> 2));
}
inline Compiler::fgWalkResult Compiler::CountSharedStaticHelper(GenTreePtr* pTree, fgWalkData* data)
{
if (Compiler::IsSharedStaticHelper(*pTree))
{
int* pCount = (int*)data->pCallbackData;
(*pCount)++;
}
return WALK_CONTINUE;
}
// TODO-Cleanup: Replace calls to IsSharedStaticHelper with new HelperCallProperties
//
inline bool Compiler::IsSharedStaticHelper(GenTreePtr tree)
{
if (tree->gtOper != GT_CALL || tree->gtCall.gtCallType != CT_HELPER)
{
return false;
}
CorInfoHelpFunc helper = eeGetHelperNum(tree->gtCall.gtCallMethHnd);
bool result1 =
// More helpers being added to IsSharedStaticHelper (that have similar behaviors but are not true
// ShareStaticHelperts)
helper == CORINFO_HELP_STRCNS || helper == CORINFO_HELP_BOX ||
// helpers being added to IsSharedStaticHelper
helper == CORINFO_HELP_GETSTATICFIELDADDR_CONTEXT || helper == CORINFO_HELP_GETSTATICFIELDADDR_TLS ||
helper == CORINFO_HELP_GETGENERICS_GCSTATIC_BASE || helper == CORINFO_HELP_GETGENERICS_NONGCSTATIC_BASE ||
helper == CORINFO_HELP_GETGENERICS_GCTHREADSTATIC_BASE ||
helper == CORINFO_HELP_GETGENERICS_NONGCTHREADSTATIC_BASE ||
helper == CORINFO_HELP_GETSHARED_GCSTATIC_BASE || helper == CORINFO_HELP_GETSHARED_NONGCSTATIC_BASE ||
helper == CORINFO_HELP_GETSHARED_GCSTATIC_BASE_NOCTOR ||
helper == CORINFO_HELP_GETSHARED_NONGCSTATIC_BASE_NOCTOR ||
helper == CORINFO_HELP_GETSHARED_GCSTATIC_BASE_DYNAMICCLASS ||
helper == CORINFO_HELP_GETSHARED_NONGCSTATIC_BASE_DYNAMICCLASS ||
helper == CORINFO_HELP_GETSHARED_GCTHREADSTATIC_BASE ||
helper == CORINFO_HELP_GETSHARED_NONGCTHREADSTATIC_BASE ||
helper == CORINFO_HELP_GETSHARED_GCTHREADSTATIC_BASE_NOCTOR ||
helper == CORINFO_HELP_GETSHARED_NONGCTHREADSTATIC_BASE_NOCTOR ||
helper == CORINFO_HELP_GETSHARED_GCTHREADSTATIC_BASE_DYNAMICCLASS ||
helper == CORINFO_HELP_GETSHARED_NONGCTHREADSTATIC_BASE_DYNAMICCLASS ||
#ifdef FEATURE_READYTORUN_COMPILER
helper == CORINFO_HELP_READYTORUN_STATIC_BASE ||
#endif
helper == CORINFO_HELP_CLASSINIT_SHARED_DYNAMICCLASS;
#if 0
// See above TODO-Cleanup
bool result2 = s_helperCallProperties.IsPure(helper) && s_helperCallProperties.NonNullReturn(helper);
assert (result1 == result2);
#endif
return result1;
}
inline bool Compiler::IsTreeAlwaysHoistable(GenTreePtr tree)
{
if (IsSharedStaticHelper(tree))
{
return (GTF_CALL_HOISTABLE & tree->gtFlags) ? true : false;
}
else
{
return false;
}
}
//
// Note that we want to have two special FIELD_HANDLES that will both
// be considered non-Data Offset handles
//
// The special values that we use are FLD_GLOBAL_DS and FLD_GLOBAL_FS
//
inline bool jitStaticFldIsGlobAddr(CORINFO_FIELD_HANDLE fldHnd)
{
return (fldHnd == FLD_GLOBAL_DS || fldHnd == FLD_GLOBAL_FS);
}
#if defined(DEBUG) || defined(FEATURE_JIT_METHOD_PERF) || defined(FEATURE_SIMD)
inline bool Compiler::eeIsNativeMethod(CORINFO_METHOD_HANDLE method)
{
return ((((size_t)method) & 0x2) == 0x2);
}
inline CORINFO_METHOD_HANDLE Compiler::eeGetMethodHandleForNative(CORINFO_METHOD_HANDLE method)
{
assert((((size_t)method) & 0x3) == 0x2);
return (CORINFO_METHOD_HANDLE)(((size_t)method) & ~0x3);
}
#endif
inline CORINFO_METHOD_HANDLE Compiler::eeMarkNativeTarget(CORINFO_METHOD_HANDLE method)
{
assert((((size_t)method) & 0x3) == 0);
if (method == nullptr)
{
return method;
}
else
{
return (CORINFO_METHOD_HANDLE)(((size_t)method) | 0x2);
}
}
/*
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX Compiler XX
XX Inline functions XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
#ifndef DEBUG
inline bool Compiler::compStressCompile(compStressArea stressArea, unsigned weightPercentage)
{
return false;
}
#endif
inline ArenaAllocator* Compiler::compGetAllocator()
{
return compAllocator;
}
/*****************************************************************************
*
* Allocate memory from the no-release allocator. All such memory will be
* freed up simulataneously at the end of the procedure
*/
#ifndef DEBUG
inline void* Compiler::compGetMem(size_t sz, CompMemKind cmk)
{
assert(sz);
#if MEASURE_MEM_ALLOC
genMemStats.AddAlloc(sz, cmk);
#endif
return compAllocator->allocateMemory(sz);
}
#endif
/*****************************************************************************
*
* A common memory allocation for arrays of structures involves the
* multiplication of the number of elements with the size of each element.
* If this computation overflows, then the memory allocation might succeed,
* but not allocate sufficient memory for all the elements. This can cause
* us to overwrite the allocation, and AV or worse, corrupt memory.
*
* This method checks for overflow, and succeeds only when it detects
* that there's no overflow. It should be cheap, because when inlined with
* a constant elemSize, the division should be done in compile time, and so
* at run time we simply have a check of numElem against some number (this
* is why we __forceinline).
*/
#define MAX_MEMORY_PER_ALLOCATION (512 * 1024 * 1024)
__forceinline void* Compiler::compGetMemArray(size_t numElem, size_t elemSize, CompMemKind cmk)
{
if (numElem > (MAX_MEMORY_PER_ALLOCATION / elemSize))
{
NOMEM();
}
return compGetMem(numElem * elemSize, cmk);
}
__forceinline void* Compiler::compGetMemArrayA(size_t numElem, size_t elemSize, CompMemKind cmk)
{
if (numElem > (MAX_MEMORY_PER_ALLOCATION / elemSize))
{
NOMEM();
}
return compGetMemA(numElem * elemSize, cmk);
}
/******************************************************************************
*
* Roundup the allocated size so that if this memory block is aligned,
* then the next block allocated too will be aligned.
* The JIT will always try to keep all the blocks aligned.
*/
inline void* Compiler::compGetMemA(size_t sz, CompMemKind cmk)
{
assert(sz);
size_t allocSz = roundUp(sz, sizeof(size_t));
#if MEASURE_MEM_ALLOC
genMemStats.AddAlloc(allocSz, cmk);
#endif
void* ptr = compAllocator->allocateMemory(allocSz);
// 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;
}
inline void Compiler::compFreeMem(void* ptr)
{
}
#define compFreeMem(ptr) compFreeMem((void*)ptr)
inline bool Compiler::compIsProfilerHookNeeded()
{
#ifdef PROFILING_SUPPORTED
return compProfilerHookNeeded
#if defined(_TARGET_ARM_) || defined(_TARGET_AMD64_)
// IL stubs are excluded by VM and we need to do the same even running
// under a complus env hook to generate profiler hooks
|| (opts.compJitELTHookEnabled && !(opts.eeFlags & CORJIT_FLG_IL_STUB))
#endif
;
#else // PROFILING_SUPPORTED
return false;
#endif
}
/*****************************************************************************
*
* Check for the special case where the object is the constant 0.
* As we can't even fold the tree (null+fldOffs), we are left with
* op1 and op2 both being a constant. This causes lots of problems.
* We simply grab a temp and assign 0 to it and use it in place of the NULL.
*/
inline GenTreePtr Compiler::impCheckForNullPointer(GenTreePtr obj)
{
/* If it is not a GC type, we will be able to fold it.
So don't need to do anything */
if (!varTypeIsGC(obj->TypeGet()))
{
return obj;
}
if (obj->gtOper == GT_CNS_INT)
{
assert(obj->gtType == TYP_REF || obj->gtType == TYP_BYREF);
assert(obj->gtIntCon.gtIconVal == 0);
unsigned tmp = lvaGrabTemp(true DEBUGARG("CheckForNullPointer"));
// We don't need to spill while appending as we are only assigning
// NULL to a freshly-grabbed temp.
impAssignTempGen(tmp, obj, (unsigned)CHECK_SPILL_NONE);
obj = gtNewLclvNode(tmp, obj->gtType);
}
return obj;
}
/*****************************************************************************
*
* Check for the special case where the object is the methods original 'this' pointer.
* Note that, the original 'this' pointer is always local var 0 for non-static method,
* even if we might have created the copy of 'this' pointer in lvaArg0Var.
*/
inline bool Compiler::impIsThis(GenTreePtr obj)
{
if (compIsForInlining())
{
return impInlineInfo->InlinerCompiler->impIsThis(obj);
}
else
{
return ((obj != nullptr) && (obj->gtOper == GT_LCL_VAR) && lvaIsOriginalThisArg(obj->gtLclVarCommon.gtLclNum));
}
}
/*****************************************************************************
*
* Check to see if the delegate is created using "LDFTN <TOK>" or not.
*/
inline bool Compiler::impIsLDFTN_TOKEN(const BYTE* delegateCreateStart, const BYTE* newobjCodeAddr)
{
assert(newobjCodeAddr[0] == CEE_NEWOBJ);
return (newobjCodeAddr - delegateCreateStart == 6 && // LDFTN <TOK> takes 6 bytes
delegateCreateStart[0] == CEE_PREFIX1 && delegateCreateStart[1] == (CEE_LDFTN & 0xFF));
}
/*****************************************************************************
*
* Check to see if the delegate is created using "DUP LDVIRTFTN <TOK>" or not.
*/
inline bool Compiler::impIsDUP_LDVIRTFTN_TOKEN(const BYTE* delegateCreateStart, const BYTE* newobjCodeAddr)
{
assert(newobjCodeAddr[0] == CEE_NEWOBJ);
return (newobjCodeAddr - delegateCreateStart == 7 && // DUP LDVIRTFTN <TOK> takes 6 bytes
delegateCreateStart[0] == CEE_DUP && delegateCreateStart[1] == CEE_PREFIX1 &&
delegateCreateStart[2] == (CEE_LDVIRTFTN & 0xFF));
}
/*****************************************************************************
*
* Returns true if the compiler instance is created for import only (verification).
*/
inline bool Compiler::compIsForImportOnly()
{
return ((opts.eeFlags & CORJIT_FLG_IMPORT_ONLY) != 0);
}
/*****************************************************************************
*
* Returns true if the compiler instance is created for inlining.
*/
inline bool Compiler::compIsForInlining()
{
return (impInlineInfo != nullptr);
}
/*****************************************************************************
*
* Check the inline result field in the compiler to see if inlining failed or not.
*/
inline bool Compiler::compDonotInline()
{
if (compIsForInlining())
{
assert(compInlineResult != nullptr);
return compInlineResult->IsFailure();
}
else
{
return false;
}
}
inline bool Compiler::impIsPrimitive(CorInfoType jitType)
{
return ((CORINFO_TYPE_BOOL <= jitType && jitType <= CORINFO_TYPE_DOUBLE) || jitType == CORINFO_TYPE_PTR);
}
/*****************************************************************************
*
* Get the promotion type of a struct local.
*/
inline Compiler::lvaPromotionType Compiler::lvaGetPromotionType(const LclVarDsc* varDsc)
{
assert(!varDsc->lvPromoted || varTypeIsPromotable(varDsc) || varDsc->lvUnusedStruct);
if (!varDsc->lvPromoted)
{
// no struct promotion for this LclVar
return PROMOTION_TYPE_NONE;
}
if (varDsc->lvDoNotEnregister)
{
// The struct is not enregistered
return PROMOTION_TYPE_DEPENDENT;
}
if (!varDsc->lvIsParam)
{
// The struct is a register candidate
return PROMOTION_TYPE_INDEPENDENT;
}
// Has struct promotion for arguments been disabled using COMPlus_JitNoStructPromotion=2
if (fgNoStructParamPromotion)
{
// The struct parameter is not enregistered
return PROMOTION_TYPE_DEPENDENT;
}
// We have a parameter that could be enregistered
CLANG_FORMAT_COMMENT_ANCHOR;
#if defined(_TARGET_AMD64_) || defined(_TARGET_ARM64_)
// The struct parameter is a register candidate
return PROMOTION_TYPE_INDEPENDENT;
#else
// The struct parameter is not enregistered
return PROMOTION_TYPE_DEPENDENT;
#endif
}
/*****************************************************************************
*
* Get the promotion type of a struct local.
*/
inline Compiler::lvaPromotionType Compiler::lvaGetPromotionType(unsigned varNum)
{
assert(varNum < lvaCount);
return lvaGetPromotionType(&lvaTable[varNum]);
}
/*****************************************************************************
*
* Given a field local, get the promotion type of its parent struct local.
*/
inline Compiler::lvaPromotionType Compiler::lvaGetParentPromotionType(const LclVarDsc* varDsc)
{
assert(varDsc->lvIsStructField);
assert(varDsc->lvParentLcl < lvaCount);
lvaPromotionType promotionType = lvaGetPromotionType(varDsc->lvParentLcl);
assert(promotionType != PROMOTION_TYPE_NONE);
return promotionType;
}
/*****************************************************************************
*
* Given a field local, get the promotion type of its parent struct local.
*/
inline Compiler::lvaPromotionType Compiler::lvaGetParentPromotionType(unsigned varNum)
{
assert(varNum < lvaCount);
return lvaGetParentPromotionType(&lvaTable[varNum]);
}
/*****************************************************************************
*
* Return true if the local is a field local of a promoted struct of type PROMOTION_TYPE_DEPENDENT.
* Return false otherwise.
*/
inline bool Compiler::lvaIsFieldOfDependentlyPromotedStruct(const LclVarDsc* varDsc)
{
if (!varDsc->lvIsStructField)
{
return false;
}
lvaPromotionType promotionType = lvaGetParentPromotionType(varDsc);
if (promotionType == PROMOTION_TYPE_DEPENDENT)
{
return true;
}
assert(promotionType == PROMOTION_TYPE_INDEPENDENT);
return false;
}
//------------------------------------------------------------------------
// lvaIsGCTracked: Determine whether this var should be reported
// as tracked for GC purposes.
//
// Arguments:
// varDsc - the LclVarDsc for the var in question.
//
// Return Value:
// Returns true if the variable should be reported as tracked in the GC info.
//
// Notes:
// This never returns true for struct variables, even if they are tracked.
// This is because struct variables are never tracked as a whole for GC purposes.
// It is up to the caller to ensure that the fields of struct variables are
// correctly tracked.
// On Amd64, we never GC-track fields of dependently promoted structs, even
// though they may be tracked for optimization purposes.
// It seems that on x86 and arm, we simply don't track these
// fields, though I have not verified that. I attempted to make these GC-tracked,
// but there was too much logic that depends on these being untracked, so changing
// this would require non-trivial effort.
inline bool Compiler::lvaIsGCTracked(const LclVarDsc* varDsc)
{
if (varDsc->lvTracked && (varDsc->lvType == TYP_REF || varDsc->lvType == TYP_BYREF))
{
#ifdef _TARGET_AMD64_
return !lvaIsFieldOfDependentlyPromotedStruct(varDsc);
#else // !_TARGET_AMD64_
return true;
#endif // !_TARGET_AMD64_
}
else
{
return false;
}
}
inline void Compiler::EndPhase(Phases phase)
{
#if defined(FEATURE_JIT_METHOD_PERF)
if (pCompJitTimer != nullptr)
{
pCompJitTimer->EndPhase(phase);
}
#endif
#if DUMP_FLOWGRAPHS
fgDumpFlowGraph(phase);
#endif // DUMP_FLOWGRAPHS
previousCompletedPhase = phase;
#ifdef DEBUG
if (dumpIR)
{
if ((*dumpIRPhase == L'*') || (wcscmp(dumpIRPhase, PhaseShortNames[phase]) == 0))
{
printf("\n");
printf("IR after %s (switch: %ls)\n", PhaseEnums[phase], PhaseShortNames[phase]);
printf("\n");
if (dumpIRLinear)
{
dFuncIR();
}
else if (dumpIRTrees)
{
dTrees();
}
// If we are just dumping a single method and we have a request to exit
// after dumping, do so now.
if (dumpIRExit && ((*dumpIRPhase != L'*') || (phase == PHASE_EMIT_GCEH)))
{
exit(0);
}
}
}
#endif
}
/*****************************************************************************/
bool Compiler::fgExcludeFromSsa(unsigned lclNum)
{
if (opts.MinOpts())
{
return true; // If we're doing MinOpts, no SSA vars.
}
LclVarDsc* varDsc = &lvaTable[lclNum];
if (varDsc->lvAddrExposed)
{
return true; // We exclude address-exposed variables.
}
if (!varDsc->lvTracked)
{
return true; // SSA is only done for tracked variables
}
// lvPromoted structs are never tracked...
assert(!varDsc->lvPromoted);
if (varDsc->lvOverlappingFields)
{
return true; // Don't use SSA on structs that have overlapping fields
}
if (varDsc->lvIsStructField && (lvaGetParentPromotionType(lclNum) != PROMOTION_TYPE_INDEPENDENT))
{
// SSA must exclude struct fields that are not independent
// - because we don't model the struct assignment properly when multiple fields can be assigned by one struct
// assignment.
// - SSA doesn't allow a single node to contain multiple SSA definitions.
// - and PROMOTION_TYPE_DEPENDEDNT fields are never candidates for a register.
//
// Example mscorlib method: CompatibilitySwitches:IsCompatibilitySwitchSet
//
return true;
}
// otherwise this variable is *not* excluded for SSA
return false;
}
/*****************************************************************************/
ValueNum Compiler::GetUseAsgDefVNOrTreeVN(GenTreePtr op)
{
if (op->gtFlags & GTF_VAR_USEASG)
{
unsigned lclNum = op->AsLclVarCommon()->GetLclNum();
unsigned ssaNum = GetSsaNumForLocalVarDef(op);
return lvaTable[lclNum].GetPerSsaData(ssaNum)->m_vnPair.GetConservative();
}
else
{
return op->gtVNPair.GetConservative();
}
}
/*****************************************************************************/
unsigned Compiler::GetSsaNumForLocalVarDef(GenTreePtr lcl)
{
// Address-taken variables don't have SSA numbers.
if (fgExcludeFromSsa(lcl->AsLclVarCommon()->gtLclNum))
{
return SsaConfig::RESERVED_SSA_NUM;
}
assert(lcl->gtFlags & (GTF_VAR_DEF | GTF_VAR_USEDEF));
if (lcl->gtFlags & GTF_VAR_USEASG)
{
assert((lcl->gtFlags & GTF_VAR_USEDEF) == 0);
// It's an "lcl op= rhs" assignment. "lcl" is both used and defined here;
// we've chosen in this case to annotate "lcl" with the SSA number (and VN) of the use,
// and to store the SSA number of the def in a side table.
unsigned ssaNum;
// In case of a remorph (fgMorph) in CSE/AssertionProp after SSA phase, there
// wouldn't be an entry for the USEASG portion of the indir addr, return
// reserved.
if (!GetOpAsgnVarDefSsaNums()->Lookup(lcl, &ssaNum))
{
return SsaConfig::RESERVED_SSA_NUM;
}
return ssaNum;
}
else
{
return lcl->AsLclVarCommon()->gtSsaNum;
}
}
/*****************************************************************************
* operator new
*
* Note that compGetMem is an arena allocator that returns memory that is
* not zero-initialized and can contain data from a prior allocation lifetime.
* it also requires that 'sz' be aligned to a multiple of sizeof(int)
*/
inline void* __cdecl operator new(size_t sz, Compiler* context, CompMemKind cmk)
{
sz = AlignUp(sz, sizeof(int));
assert(sz != 0 && (sz & (sizeof(int) - 1)) == 0);
return context->compGetMem(sz, cmk);
}
inline void* __cdecl operator new[](size_t sz, Compiler* context, CompMemKind cmk)
{
sz = AlignUp(sz, sizeof(int));
assert(sz != 0 && (sz & (sizeof(int) - 1)) == 0);
return context->compGetMem(sz, cmk);
}
inline void* __cdecl operator new(size_t sz, void* p, const jitstd::placement_t& /* syntax_difference */)
{
return p;
}
inline void* __cdecl operator new(size_t sz, IAllocator* alloc)
{
return alloc->Alloc(sz);
}
inline void* __cdecl operator new[](size_t sz, IAllocator* alloc)
{
return alloc->Alloc(sz);
}
/*****************************************************************************/
#ifdef DEBUG
inline void printRegMask(regMaskTP mask)
{
printf(REG_MASK_ALL_FMT, mask);
}
inline char* regMaskToString(regMaskTP mask, Compiler* context)
{
const size_t cchRegMask = 24;
char* regmask = new (context, CMK_Unknown) char[cchRegMask];
sprintf_s(regmask, cchRegMask, REG_MASK_ALL_FMT, mask);
return regmask;
}
inline void printRegMaskInt(regMaskTP mask)
{
printf(REG_MASK_INT_FMT, (mask & RBM_ALLINT));
}
inline char* regMaskIntToString(regMaskTP mask, Compiler* context)
{
const size_t cchRegMask = 24;
char* regmask = new (context, CMK_Unknown) char[cchRegMask];
sprintf_s(regmask, cchRegMask, REG_MASK_INT_FMT, (mask & RBM_ALLINT));
return regmask;
}
#endif // DEBUG
inline void BasicBlock::InitVarSets(Compiler* comp)
{
VarSetOps::AssignNoCopy(comp, bbVarUse, VarSetOps::MakeEmpty(comp));
VarSetOps::AssignNoCopy(comp, bbVarDef, VarSetOps::MakeEmpty(comp));
VarSetOps::AssignNoCopy(comp, bbVarTmp, VarSetOps::MakeEmpty(comp));
VarSetOps::AssignNoCopy(comp, bbLiveIn, VarSetOps::MakeEmpty(comp));
VarSetOps::AssignNoCopy(comp, bbLiveOut, VarSetOps::MakeEmpty(comp));
VarSetOps::AssignNoCopy(comp, bbScope, VarSetOps::MakeEmpty(comp));
bbHeapUse = false;
bbHeapDef = false;
bbHeapLiveIn = false;
bbHeapLiveOut = false;
}
// Returns true if the basic block ends with GT_JMP
inline bool BasicBlock::endsWithJmpMethod(Compiler* comp)
{
if (comp->compJmpOpUsed && (bbJumpKind == BBJ_RETURN) && (bbFlags & BBF_HAS_JMP))
{
GenTree* lastNode = this->lastNode();
assert(lastNode != nullptr);
return lastNode->OperGet() == GT_JMP;
}
return false;
}
// Returns true if the basic block ends with either
// i) GT_JMP or
// ii) tail call (implicit or explicit)
//
// Params:
// comp - Compiler instance
// fastTailCallsOnly - Only consider fast tail calls excluding tail calls via helper.
inline bool BasicBlock::endsWithTailCallOrJmp(Compiler* comp, bool fastTailCallsOnly /*=false*/)
{
GenTreePtr tailCall = nullptr;
bool tailCallsConvertibleToLoopOnly = false;
return endsWithJmpMethod(comp) ||
endsWithTailCall(comp, fastTailCallsOnly, tailCallsConvertibleToLoopOnly, &tailCall);
}
//------------------------------------------------------------------------------
// endsWithTailCall : Check if the block ends with a tail call.
//
// Arguments:
// comp - compiler instance
// fastTailCallsOnly - check for fast tail calls only
// tailCallsConvertibleToLoopOnly - check for tail calls convertible to loop only
// tailCall - a pointer to a tree that will be set to the call tree if the block
// ends with a tail call and will be set to nullptr otherwise.
//
// Return Value:
// true if the block ends with a tail call; false otherwise.
//
// Notes:
// At most one of fastTailCallsOnly and tailCallsConvertibleToLoopOnly flags can be true.
inline bool BasicBlock::endsWithTailCall(Compiler* comp,
bool fastTailCallsOnly,
bool tailCallsConvertibleToLoopOnly,
GenTree** tailCall)
{
assert(!fastTailCallsOnly || !tailCallsConvertibleToLoopOnly);
*tailCall = nullptr;
bool result = false;
// Is this a tail call?
// The reason for keeping this under RyuJIT is so as not to impact existing Jit32 x86 and arm
// targets.
if (comp->compTailCallUsed)
{
if (fastTailCallsOnly || tailCallsConvertibleToLoopOnly)
{
// Only fast tail calls or only tail calls convertible to loops
result = (bbFlags & BBF_HAS_JMP) && (bbJumpKind == BBJ_RETURN);
}
else
{
// Fast tail calls, tail calls convertible to loops, and tails calls dispatched via helper
result = (bbJumpKind == BBJ_THROW) || ((bbFlags & BBF_HAS_JMP) && (bbJumpKind == BBJ_RETURN));
}
if (result)
{
GenTree* lastNode = this->lastNode();
if (lastNode->OperGet() == GT_CALL)
{
GenTreeCall* call = lastNode->AsCall();
if (tailCallsConvertibleToLoopOnly)
{
result = call->IsTailCallConvertibleToLoop();
}
else if (fastTailCallsOnly)
{
result = call->IsFastTailCall();
}
else
{
result = call->IsTailCall();
}
if (result)
{
*tailCall = call;
}
}
else
{
result = false;
}
}
}
return result;
}
//------------------------------------------------------------------------------
// endsWithTailCallConvertibleToLoop : Check if the block ends with a tail call convertible to loop.
//
// Arguments:
// comp - compiler instance
// tailCall - a pointer to a tree that will be set to the call tree if the block
// ends with a tail call convertible to loop and will be set to nullptr otherwise.
//
// Return Value:
// true if the block ends with a tail call convertible to loop.
inline bool BasicBlock::endsWithTailCallConvertibleToLoop(Compiler* comp, GenTree** tailCall)
{
bool fastTailCallsOnly = false;
bool tailCallsConvertibleToLoopOnly = true;
return endsWithTailCall(comp, fastTailCallsOnly, tailCallsConvertibleToLoopOnly, tailCall);
}
inline static bool StructHasOverlappingFields(DWORD attribs)
{
return ((attribs & CORINFO_FLG_OVERLAPPING_FIELDS) != 0);
}
inline static bool StructHasCustomLayout(DWORD attribs)
{
return ((attribs & CORINFO_FLG_CUSTOMLAYOUT) != 0);
}
/*****************************************************************************
* This node should not be referenced by anyone now. Set its values to garbage
* to catch extra references
*/
inline void DEBUG_DESTROY_NODE(GenTreePtr tree)
{
#ifdef DEBUG
// printf("DEBUG_DESTROY_NODE for [0x%08x]\n", tree);
// Save gtOper in case we want to find out what this node was
tree->gtOperSave = tree->gtOper;
tree->gtType = TYP_UNDEF;
tree->gtFlags |= 0xFFFFFFFF & ~GTF_NODE_MASK;
if (tree->OperIsSimple())
{
tree->gtOp.gtOp1 = tree->gtOp.gtOp2 = nullptr;
}
// Must do this last, because the "gtOp" check above will fail otherwise.
// Don't call SetOper, because GT_COUNT is not a valid value
tree->gtOper = GT_COUNT;
#endif
}
/*****************************************************************************/
#endif //_COMPILER_HPP_
/*****************************************************************************/
|