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
|
{
Copyright (c) 1998-2012 by the Free Pascal team
This unit implements the base class for the register allocator
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
****************************************************************************
}
{$i fpcdefs.inc}
{ $define DEBUG_REGALLOC}
{ $define DEBUG_SPILLCOALESCE}
{ $define DEBUG_REGISTERLIFE}
{ Allow duplicate allocations, can be used to get the .s file written }
{ $define ALLOWDUPREG}
{$ifdef DEBUG_REGALLOC}
{$define EXTDEBUG}
{$endif DEBUG_REGALLOC}
unit rgobj;
interface
uses
cutils, cpubase,
aasmtai,aasmdata,aasmsym,aasmcpu,
cclasses,globtype,cgbase,cgutils;
type
{
The interference bitmap contains of 2 layers:
layer 1 - 256*256 blocks with pointers to layer 2 blocks
layer 2 - blocks of 32*256 (32 bytes = 256 bits)
}
Tinterferencebitmap2 = array[byte] of set of byte;
Pinterferencebitmap2 = ^Tinterferencebitmap2;
Tinterferencebitmap1 = array[byte] of Pinterferencebitmap2;
pinterferencebitmap1 = ^tinterferencebitmap1;
Tinterferencebitmap=class
private
maxx1,
maxy1 : byte;
fbitmap : pinterferencebitmap1;
function getbitmap(x,y:tsuperregister):boolean;
procedure setbitmap(x,y:tsuperregister;b:boolean);
public
constructor create;
destructor destroy;override;
property bitmap[x,y:tsuperregister]:boolean read getbitmap write setbitmap;default;
end;
Tmovelistheader=record
count,
maxcount,
sorted_until : cardinal;
end;
Tmovelist=record
header : Tmovelistheader;
data : array[tsuperregister] of Tlinkedlistitem;
end;
Pmovelist=^Tmovelist;
{In the register allocator we keep track of move instructions.
These instructions are moved between five linked lists. There
is also a linked list per register to keep track about the moves
it is associated with. Because we need to determine quickly in
which of the five lists it is we add anu enumeradtion to each
move instruction.}
Tmoveset=(ms_coalesced_moves,ms_constrained_moves,ms_frozen_moves,
ms_worklist_moves,ms_active_moves);
Tmoveins=class(Tlinkedlistitem)
moveset:Tmoveset;
x,y:Tsuperregister;
end;
Treginfoflag=(
ri_coalesced, { the register is coalesced with other register }
ri_selected, { the register is put to selectstack }
ri_spill_read, { the register contains a value loaded from a spilled register }
ri_has_initial_loc { the register has the initial memory location (e.g. a parameter in the stack) }
);
Treginfoflagset=set of Treginfoflag;
Treginfo=record
live_start,
live_end : Tai;
subreg : tsubregister;
alias : Tsuperregister;
{ The register allocator assigns each register a colour }
colour : Tsuperregister;
movelist : Pmovelist;
adjlist : Psuperregisterworklist;
degree : TSuperregister;
flags : Treginfoflagset;
weight : longint;
{$ifdef llvm}
def : pointer;
{$endif llvm}
count_uses : longint;
total_interferences : longint;
real_reg_interferences: word;
end;
Preginfo=^TReginfo;
tspillreginfo = record
{ a single register may appear more than once in an instruction,
but with different subregister types -> store all subregister types
that occur, so we can add the necessary constraints for the inline
register that will have to replace it }
spillregconstraints : set of TSubRegister;
orgreg : tsuperregister;
loadreg,
storereg: tregister;
regread, regwritten, mustbespilled: boolean;
end;
tspillregsinfo = record
reginfocount: longint;
reginfo: array[0..3] of tspillreginfo;
end;
Pspill_temp_list=^Tspill_temp_list;
Tspill_temp_list=array[tsuperregister] of Treference;
{ used to store where a register is spilled and what interferences it has at the point of being spilled }
tspillinfo = record
spilllocation : treference;
spilled : boolean;
interferences : Tinterferencebitmap;
end;
{#------------------------------------------------------------------
This class implements the default register allocator. It is used by the
code generator to allocate and free registers which might be valid
across nodes. It also contains utility routines related to registers.
Some of the methods in this class should be overridden
by cpu-specific implementations.
--------------------------------------------------------------------}
trgobj=class
preserved_by_proc : tcpuregisterset;
used_in_proc : tcpuregisterset;
{ generate SSA code? }
ssa_safe: boolean;
constructor create(Aregtype:Tregistertype;
Adefaultsub:Tsubregister;
const Ausable:array of tsuperregister;
Afirst_imaginary:Tsuperregister;
Apreserved_by_proc:Tcpuregisterset);
destructor destroy;override;
{ Allocate a register. An internalerror will be generated if there is
no more free registers which can be allocated.}
function getregister(list:TAsmList;subreg:Tsubregister):Tregister;virtual;
{ Get the register specified.}
procedure getcpuregister(list:TAsmList;r:Tregister);virtual;
procedure ungetcpuregister(list:TAsmList;r:Tregister);virtual;
{ Get multiple registers specified.}
procedure alloccpuregisters(list:TAsmList;const r:Tcpuregisterset);virtual;
{ Free multiple registers specified.}
procedure dealloccpuregisters(list:TAsmList;const r:Tcpuregisterset);virtual;
function uses_registers:boolean;virtual;
procedure add_reg_instruction(instr:Tai;r:tregister;aweight:longint);
procedure add_move_instruction(instr:Taicpu);
{ Do the register allocation.}
procedure do_register_allocation(list:TAsmList;headertai:tai);virtual;
{ Adds an interference edge.
don't move this to the protected section, the arm cg requires to access this (FK) }
procedure add_edge(u,v:Tsuperregister);
{ translates a single given imaginary register to it's real register }
procedure translate_register(var reg : tregister);
{ sets the initial memory location of the register }
procedure set_reg_initial_location(reg: tregister; const ref: treference);
protected
maxreginfo,
maxreginfoinc,
maxreg : Tsuperregister;
regtype : Tregistertype;
{ default subregister used }
defaultsub : tsubregister;
live_registers:Tsuperregisterworklist;
spillednodes: tsuperregisterworklist;
{ can be overridden to add cpu specific interferences }
procedure add_cpu_interferences(p : tai);virtual;
procedure add_constraints(reg:Tregister);virtual;
function getregisterinline(list:TAsmList;const subregconstraints:Tsubregisterset):Tregister;
procedure ungetregisterinline(list:TAsmList;r:Tregister);
function get_spill_subreg(r : tregister) : tsubregister;virtual;
function do_spill_replace(list:TAsmList;instr:tai_cpu_abstract_sym;orgreg:tsuperregister;const spilltemp:treference):boolean;virtual;
{ the orgrsupeg parameter is only here for the llvm target, so it can
discover the def to use for the load }
procedure do_spill_read(list:TAsmList;pos:tai;const spilltemp:treference;tempreg:tregister;orgsupreg:tsuperregister);virtual;
procedure do_spill_written(list:TAsmList;pos:tai;const spilltemp:treference;tempreg:tregister;orgsupreg:tsuperregister);virtual;
function addreginfo(var regs: tspillregsinfo; const r: tsuperregisterset; reg: tregister; operation: topertype): boolean;
function instr_get_oper_spilling_info(var regs: tspillregsinfo; const r: tsuperregisterset; instr: tai_cpu_abstract_sym; opidx: longint): boolean; virtual;
procedure substitute_spilled_registers(const regs: tspillregsinfo; instr: tai_cpu_abstract_sym; opidx: longint); virtual;
procedure try_replace_reg(const regs: tspillregsinfo; var reg: tregister; useloadreg: boolean);
function instr_spill_register(list:TAsmList;
instr:tai_cpu_abstract_sym;
const r:Tsuperregisterset;
const spilltemplist:Tspill_temp_list): boolean;virtual;
procedure insert_regalloc_info_all(list:TAsmList);
procedure determine_spill_registers(list:TAsmList;headertail:tai); virtual;
procedure get_spill_temp(list:TAsmlist;spill_temps: Pspill_temp_list; supreg: tsuperregister);virtual;
strict protected
{ Highest register allocated until now.}
reginfo : PReginfo;
usable_registers_cnt : word;
private
int_live_range_direction: TRADirection;
{ First imaginary register.}
first_imaginary : Tsuperregister;
usable_registers : array[0..maxcpuregister] of tsuperregister;
usable_register_set : tcpuregisterset;
ibitmap : Tinterferencebitmap;
simplifyworklist,
freezeworklist,
spillworklist,
coalescednodes,
selectstack : tsuperregisterworklist;
worklist_moves,
active_moves,
frozen_moves,
coalesced_moves,
constrained_moves,
{ in this list we collect all moveins which should be disposed after register allocation finishes,
we still need the moves for spill coalesce for the whole register allocation process, so they cannot be
released as soon as they are frozen or whatever }
move_garbage : Tlinkedlist;
extended_backwards,
backwards_was_first : tbitset;
has_usedmarks: boolean;
has_directalloc: boolean;
spillinfo : array of tspillinfo;
{ Disposes of the reginfo array.}
procedure dispose_reginfo;
{ Prepare the register colouring.}
procedure prepare_colouring;
{ Clean up after register colouring.}
procedure epilogue_colouring;
{ Colour the registers; that is do the register allocation.}
procedure colour_registers;
procedure insert_regalloc_info(list:TAsmList;u:tsuperregister);
procedure generate_interference_graph(list:TAsmList;headertai:tai);
{ sort spilled nodes by increasing number of interferences }
procedure sort_spillednodes;
{ translates the registers in the given assembler list }
procedure translate_registers(list:TAsmList);
function spill_registers(list:TAsmList;headertai:tai):boolean;virtual;
function getnewreg(subreg:tsubregister):tsuperregister;
procedure add_edges_used(u:Tsuperregister);
procedure add_to_movelist(u:Tsuperregister;data:Tlinkedlistitem);
function move_related(n:Tsuperregister):boolean;
procedure make_work_list;
procedure sort_simplify_worklist;
procedure enable_moves(n:Tsuperregister);
procedure decrement_degree(m:Tsuperregister);
procedure simplify;
procedure add_worklist(u:Tsuperregister);
function adjacent_ok(u,v:Tsuperregister):boolean;
function conservative(u,v:Tsuperregister):boolean;
procedure coalesce;
procedure freeze_moves(u:Tsuperregister);
procedure freeze;
procedure select_spill;
procedure assign_colours;
procedure clear_interferences(u:Tsuperregister);
procedure set_live_range_direction(dir: TRADirection);
procedure set_live_start(reg : tsuperregister;t : tai);
function get_live_start(reg : tsuperregister) : tai;
procedure set_live_end(reg : tsuperregister;t : tai);
function get_live_end(reg : tsuperregister) : tai;
procedure alloc_spillinfo(max_reg: Tsuperregister);
{$ifdef DEBUG_SPILLCOALESCE}
procedure write_spill_stats;
{$endif DEBUG_SPILLCOALESCE}
public
{$ifdef EXTDEBUG}
procedure writegraph(loopidx:longint);
{$endif EXTDEBUG}
procedure combine(u,v:Tsuperregister);
{ set v as an alias for u }
procedure set_alias(u,v:Tsuperregister);
function get_alias(n:Tsuperregister):Tsuperregister;
property live_range_direction: TRADirection read int_live_range_direction write set_live_range_direction;
property live_start[reg : tsuperregister]: tai read get_live_start write set_live_start;
property live_end[reg : tsuperregister]: tai read get_live_end write set_live_end;
end;
const
first_reg = 0;
last_reg = high(tsuperregister)-1;
maxspillingcounter = 20;
implementation
uses
sysutils,
globals,
verbose,tgobj,procinfo,cgobj;
procedure sort_movelist(ml:Pmovelist);
{Ok, sorting pointers is silly, but it does the job to make Trgobj.combine
faster.}
var h,i,p:longword;
t:Tlinkedlistitem;
begin
with ml^ do
begin
if header.count<2 then
exit;
p:=1;
while 2*cardinal(p)<header.count do
p:=2*p;
while p<>0 do
begin
for h:=p to header.count-1 do
begin
i:=h;
t:=data[i];
repeat
if ptruint(data[i-p])<=ptruint(t) then
break;
data[i]:=data[i-p];
dec(i,p);
until i<p;
data[i]:=t;
end;
p:=p shr 1;
end;
header.sorted_until:=header.count-1;
end;
end;
{******************************************************************************
tinterferencebitmap
******************************************************************************}
constructor tinterferencebitmap.create;
begin
inherited create;
maxx1:=1;
fbitmap:=AllocMem(sizeof(tinterferencebitmap1)*2);
end;
destructor tinterferencebitmap.destroy;
var i,j:byte;
begin
for i:=0 to maxx1 do
for j:=0 to maxy1 do
if assigned(fbitmap[i,j]) then
dispose(fbitmap[i,j]);
freemem(fbitmap);
end;
function tinterferencebitmap.getbitmap(x,y:tsuperregister):boolean;
var
page : pinterferencebitmap2;
begin
result:=false;
if (x shr 8>maxx1) then
exit;
page:=fbitmap[x shr 8,y shr 8];
result:=assigned(page) and
((x and $ff) in page^[y and $ff]);
end;
procedure tinterferencebitmap.setbitmap(x,y:tsuperregister;b:boolean);
var
x1,y1 : byte;
begin
x1:=x shr 8;
y1:=y shr 8;
if x1>maxx1 then
begin
reallocmem(fbitmap,sizeof(tinterferencebitmap1)*(x1+1));
fillchar(fbitmap[maxx1+1],sizeof(tinterferencebitmap1)*(x1-maxx1),0);
maxx1:=x1;
end;
if not assigned(fbitmap[x1,y1]) then
begin
if y1>maxy1 then
maxy1:=y1;
new(fbitmap[x1,y1]);
fillchar(fbitmap[x1,y1]^,sizeof(tinterferencebitmap2),0);
end;
if b then
include(fbitmap[x1,y1]^[y and $ff],(x and $ff))
else
exclude(fbitmap[x1,y1]^[y and $ff],(x and $ff));
end;
{******************************************************************************
trgobj
******************************************************************************}
constructor trgobj.create(Aregtype:Tregistertype;
Adefaultsub:Tsubregister;
const Ausable:array of tsuperregister;
Afirst_imaginary:Tsuperregister;
Apreserved_by_proc:Tcpuregisterset);
var
i : cardinal;
begin
{ empty super register sets can cause very strange problems }
if high(Ausable)=-1 then
internalerror(200210181);
live_range_direction:=rad_forward;
first_imaginary:=Afirst_imaginary;
maxreg:=Afirst_imaginary;
regtype:=Aregtype;
defaultsub:=Adefaultsub;
preserved_by_proc:=Apreserved_by_proc;
// default values set by newinstance
// used_in_proc:=[];
// ssa_safe:=false;
live_registers.init;
{ Get reginfo for CPU registers }
maxreginfo:=first_imaginary;
maxreginfoinc:=16;
worklist_moves:=Tlinkedlist.create;
move_garbage:=TLinkedList.Create;
reginfo:=allocmem(first_imaginary*sizeof(treginfo));
for i:=0 to first_imaginary-1 do
begin
reginfo[i].degree:=high(tsuperregister);
reginfo[i].alias:=RS_INVALID;
end;
{ Usable registers }
// default value set by constructor
// fillchar(usable_registers,sizeof(usable_registers),0);
for i:=low(Ausable) to high(Ausable) do
begin
usable_registers[i]:=Ausable[i];
include(usable_register_set,Ausable[i]);
end;
usable_registers_cnt:=high(Ausable)+1;
{ Initialize Worklists }
spillednodes.init;
simplifyworklist.init;
freezeworklist.init;
spillworklist.init;
coalescednodes.init;
selectstack.init;
end;
destructor trgobj.destroy;
begin
spillednodes.done;
simplifyworklist.done;
freezeworklist.done;
spillworklist.done;
coalescednodes.done;
selectstack.done;
live_registers.done;
move_garbage.free;
worklist_moves.free;
dispose_reginfo;
extended_backwards.free;
backwards_was_first.free;
end;
procedure Trgobj.dispose_reginfo;
var
i : cardinal;
begin
if reginfo<>nil then
begin
for i:=0 to maxreg-1 do
with reginfo[i] do
begin
if adjlist<>nil then
dispose(adjlist,done);
if movelist<>nil then
dispose(movelist);
end;
freemem(reginfo);
reginfo:=nil;
end;
end;
function trgobj.getnewreg(subreg:tsubregister):tsuperregister;
var
oldmaxreginfo : tsuperregister;
begin
result:=maxreg;
inc(maxreg);
if maxreg>=last_reg then
Message(parser_f_too_complex_proc);
if maxreg>=maxreginfo then
begin
oldmaxreginfo:=maxreginfo;
{ Prevent overflow }
if maxreginfoinc>last_reg-maxreginfo then
maxreginfo:=last_reg
else
begin
inc(maxreginfo,maxreginfoinc);
if maxreginfoinc<256 then
maxreginfoinc:=maxreginfoinc*2;
end;
reallocmem(reginfo,maxreginfo*sizeof(treginfo));
{ Do we really need it to clear it ? At least for 1.0.x (PFV) }
fillchar(reginfo[oldmaxreginfo],(maxreginfo-oldmaxreginfo)*sizeof(treginfo),0);
end;
reginfo[result].subreg:=subreg;
end;
function trgobj.getregister(list:TAsmList;subreg:Tsubregister):Tregister;
begin
{$ifdef EXTDEBUG}
if reginfo=nil then
InternalError(2004020901);
{$endif EXTDEBUG}
if defaultsub=R_SUBNONE then
result:=newreg(regtype,getnewreg(R_SUBNONE),R_SUBNONE)
else
result:=newreg(regtype,getnewreg(subreg),subreg);
end;
function trgobj.uses_registers:boolean;
begin
result:=(maxreg>first_imaginary) or has_usedmarks or has_directalloc;
end;
procedure trgobj.ungetcpuregister(list:TAsmList;r:Tregister);
begin
if (getsupreg(r)>=first_imaginary) then
InternalError(2004020902);
list.concat(Tai_regalloc.dealloc(r,nil));
end;
procedure trgobj.getcpuregister(list:TAsmList;r:Tregister);
var
supreg:Tsuperregister;
begin
supreg:=getsupreg(r);
if supreg>=first_imaginary then
internalerror(2003121503);
include(used_in_proc,supreg);
has_directalloc:=true;
list.concat(Tai_regalloc.alloc(r,nil));
end;
procedure trgobj.alloccpuregisters(list:TAsmList;const r:Tcpuregisterset);
var i:cardinal;
begin
for i:=0 to first_imaginary-1 do
if i in r then
getcpuregister(list,newreg(regtype,i,defaultsub));
end;
procedure trgobj.dealloccpuregisters(list:TAsmList;const r:Tcpuregisterset);
var i:cardinal;
begin
for i:=0 to first_imaginary-1 do
if i in r then
ungetcpuregister(list,newreg(regtype,i,defaultsub));
end;
const
rtindex : longint = 0;
procedure trgobj.do_register_allocation(list:TAsmList;headertai:tai);
var
spillingcounter:longint;
endspill:boolean;
i : Longint;
begin
{ Insert regalloc info for imaginary registers }
insert_regalloc_info_all(list);
ibitmap:=tinterferencebitmap.create;
generate_interference_graph(list,headertai);
{$ifdef DEBUG_SPILLCOALESCE}
if maxreg>first_imaginary then
writeln(current_procinfo.procdef.mangledname, ': register allocation [',regtype,']');
{$endif DEBUG_SPILLCOALESCE}
{$ifdef DEBUG_REGALLOC}
if maxreg>first_imaginary then
writegraph(rtindex);
{$endif DEBUG_REGALLOC}
inc(rtindex);
{ Don't do the real allocation when -sr is passed }
if (cs_no_regalloc in current_settings.globalswitches) then
exit;
{ Spill registers which interfere with all usable real registers.
It is pointless to keep them for further processing. Also it may
cause endless spilling.
This can happen when compiling for very constrained CPUs such as
i8086 where indexed memory access instructions allow only
few registers as arguments and additionally the calling convention
provides no general purpose volatile registers.
Also spill registers which have the initial memory location
and are used only once. This allows to access the memory location
directly, without preloading it to a register.
}
for i:=first_imaginary to maxreg-1 do
with reginfo[i] do
if (real_reg_interferences>=usable_registers_cnt) or
{ also spill registers which have the initial memory location
and are used only once }
((ri_has_initial_loc in flags) and (weight<=200)) then
spillednodes.add(i);
if spillednodes.length<>0 then
begin
spill_registers(list,headertai);
spillednodes.clear;
end;
{Do register allocation.}
spillingcounter:=0;
repeat
determine_spill_registers(list,headertai);
endspill:=true;
if spillednodes.length<>0 then
begin
inc(spillingcounter);
if spillingcounter>maxspillingcounter then
begin
{$ifdef EXTDEBUG}
{ Only exit here so the .s file is still generated. Assembling
the file will still trigger an error }
exit;
{$else}
internalerror(200309041);
{$endif}
end;
endspill:=not spill_registers(list,headertai);
end;
until endspill;
ibitmap.free;
translate_registers(list);
{$ifdef DEBUG_SPILLCOALESCE}
write_spill_stats;
{$endif DEBUG_SPILLCOALESCE}
{ we need the translation table for debugging info and verbose assembler output,
so not dispose them yet (FK)
}
for i:=0 to High(spillinfo) do
spillinfo[i].interferences.Free;
spillinfo:=nil;
end;
procedure trgobj.add_constraints(reg:Tregister);
begin
end;
procedure trgobj.add_edge(u,v:Tsuperregister);
{This procedure will add an edge to the virtual interference graph.}
procedure addadj(u,v:Tsuperregister);
begin
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2012101901);
{$endif}
with reginfo[u] do
begin
if adjlist=nil then
new(adjlist,init);
adjlist^.add(v);
if (v<first_imaginary) and
(v in usable_register_set) then
inc(real_reg_interferences);
end;
end;
begin
if (u<>v) and not(ibitmap[v,u]) then
begin
ibitmap[v,u]:=true;
ibitmap[u,v]:=true;
{Precoloured nodes are not stored in the interference graph.}
if (u>=first_imaginary) then
addadj(u,v);
if (v>=first_imaginary) then
addadj(v,u);
end;
end;
procedure trgobj.add_edges_used(u:Tsuperregister);
var i:cardinal;
begin
with live_registers do
if length>0 then
for i:=0 to length-1 do
add_edge(u,get_alias(buf^[i]));
end;
{$ifdef EXTDEBUG}
procedure trgobj.writegraph(loopidx:longint);
{This procedure writes out the current interference graph in the
register allocator.}
var f:text;
i,j:cardinal;
begin
assign(f,current_procinfo.procdef.mangledname+'_igraph'+tostr(loopidx));
rewrite(f);
writeln(f,'Interference graph of ',current_procinfo.procdef.fullprocname(true));
writeln(f,'Register type: ',regtype,', First imaginary register is ',first_imaginary,' ($',hexstr(first_imaginary,2),')');
writeln(f);
write(f,' ');
for i:=0 to maxreg div 16 do
for j:=0 to 15 do
write(f,hexstr(i,1));
writeln(f);
write(f,'Weight Degree Uses IntfCnt ');
for i:=0 to maxreg div 16 do
write(f,'0123456789ABCDEF');
writeln(f);
for i:=0 to maxreg-1 do
begin
write(f,reginfo[i].weight:5,' ',reginfo[i].degree:5,' ',reginfo[i].count_uses:5,' ',reginfo[i].total_interferences:5,' ');
if (i<first_imaginary) and
(findreg_by_number(newreg(regtype,TSuperRegister(i),defaultsub))<>0) then
write(f,std_regname(newreg(regtype,TSuperRegister(i),defaultsub))+':'+hexstr(i,2):7)
else
write(f,' ',hexstr(i,2):4);
for j:=0 to maxreg-1 do
if ibitmap[i,j] then
write(f,'*')
else
write(f,'-');
writeln(f);
end;
close(f);
end;
{$endif EXTDEBUG}
procedure trgobj.add_to_movelist(u:Tsuperregister;data:Tlinkedlistitem);
begin
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2012101902);
{$endif}
with reginfo[u] do
begin
if movelist=nil then
begin
{ don't use sizeof(tmovelistheader), because that ignores alignment }
getmem(movelist,ptruint(@movelist^.data)-ptruint(movelist)+16*sizeof(pointer));
movelist^.header.maxcount:=16;
movelist^.header.count:=0;
movelist^.header.sorted_until:=0;
end
else
begin
if movelist^.header.count>=movelist^.header.maxcount then
begin
movelist^.header.maxcount:=movelist^.header.maxcount*2;
{ don't use sizeof(tmovelistheader), because that ignores alignment }
reallocmem(movelist,ptruint(@movelist^.data)-ptruint(movelist)+movelist^.header.maxcount*sizeof(pointer));
end;
end;
movelist^.data[movelist^.header.count]:=data;
inc(movelist^.header.count);
end;
end;
procedure trgobj.set_live_range_direction(dir: TRADirection);
begin
if (dir in [rad_backwards,rad_backwards_reinit]) then
begin
if not assigned(extended_backwards) then
begin
{ create expects a "size", not a "max bit" parameter -> +1 }
backwards_was_first:=tbitset.create(maxreg+1);
extended_backwards:=tbitset.create(maxreg+1);
end
else
begin
if (dir=rad_backwards_reinit) then
extended_backwards.clear;
backwards_was_first.clear;
end;
int_live_range_direction:=rad_backwards;
end
else
int_live_range_direction:=rad_forward;
end;
procedure trgobj.set_live_start(reg: tsuperregister; t: tai);
begin
reginfo[reg].live_start:=t;
end;
function trgobj.get_live_start(reg: tsuperregister): tai;
begin
result:=reginfo[reg].live_start;
end;
procedure trgobj.set_live_end(reg: tsuperregister; t: tai);
begin
reginfo[reg].live_end:=t;
end;
function trgobj.get_live_end(reg: tsuperregister): tai;
begin
result:=reginfo[reg].live_end;
end;
procedure trgobj.alloc_spillinfo(max_reg: Tsuperregister);
var
j: longint;
begin
if Length(spillinfo)<max_reg then
begin
j:=Length(spillinfo);
SetLength(spillinfo,max_reg);
fillchar(spillinfo[j],sizeof(spillinfo[0])*(Length(spillinfo)-j),0);
end;
end;
procedure trgobj.add_reg_instruction(instr:Tai;r:tregister;aweight:longint);
var
supreg : tsuperregister;
begin
supreg:=getsupreg(r);
{$ifdef extdebug}
if not (cs_no_regalloc in current_settings.globalswitches) and
(supreg>=maxreginfo) then
internalerror(200411061);
{$endif extdebug}
if supreg>=first_imaginary then
with reginfo[supreg] do
begin
{ avoid overflow }
if high(weight)-aweight<weight then
weight:=high(weight)
else
inc(weight,aweight);
if (live_range_direction=rad_forward) then
begin
if not assigned(live_start) then
live_start:=instr;
live_end:=instr;
end
else
begin
if not extended_backwards.isset(supreg) then
begin
extended_backwards.include(supreg);
live_start := instr;
if not assigned(live_end) then
begin
backwards_was_first.include(supreg);
live_end := instr;
end;
end
else
begin
if backwards_was_first.isset(supreg) then
live_end := instr;
end
end
end;
end;
procedure trgobj.add_move_instruction(instr:Taicpu);
{This procedure notifies a certain as a move instruction so the
register allocator can try to eliminate it.}
var i:Tmoveins;
sreg, dreg : Tregister;
ssupreg,dsupreg:Tsuperregister;
begin
{$ifdef extdebug}
if (instr.oper[O_MOV_SOURCE]^.typ<>top_reg) or
(instr.oper[O_MOV_DEST]^.typ<>top_reg) then
internalerror(200311291);
{$endif}
sreg:=instr.oper[O_MOV_SOURCE]^.reg;
dreg:=instr.oper[O_MOV_DEST]^.reg;
{ How should we handle m68k move %d0,%a0? }
if (getregtype(sreg)<>getregtype(dreg)) then
exit;
i:=Tmoveins.create;
i.moveset:=ms_worklist_moves;
worklist_moves.insert(i);
ssupreg:=getsupreg(sreg);
add_to_movelist(ssupreg,i);
dsupreg:=getsupreg(dreg);
{ On m68k move can mix address and integer registers,
this leads to problems ... PM }
if (ssupreg<>dsupreg) {and (getregtype(sreg)=getregtype(dreg))} then
{Avoid adding the same move instruction twice to a single register.}
add_to_movelist(dsupreg,i);
i.x:=ssupreg;
i.y:=dsupreg;
end;
function trgobj.move_related(n:Tsuperregister):boolean;
var i:cardinal;
begin
move_related:=false;
with reginfo[n] do
if movelist<>nil then
with movelist^ do
for i:=0 to header.count-1 do
if Tmoveins(data[i]).moveset in [ms_worklist_moves,ms_active_moves] then
begin
move_related:=true;
break;
end;
end;
procedure Trgobj.sort_simplify_worklist;
{Sorts the simplifyworklist by the number of interferences the
registers in it cause. This allows simplify to execute in
constant time.
Sort the list in the descending order, since items of simplifyworklist
are retrieved from end to start and then items are added to selectstack.
The selectstack list is also processed from end to start.
Such way nodes with most interferences will get their colors first.
Since degree of nodes in simplifyworklist before sorting is always
less than the number of usable registers this should not trigger spilling
and should lead to a better register allocation in some cases.
}
var p,h,i,leni,lent:longword;
t:Tsuperregister;
adji,adjt:Psuperregisterworklist;
begin
with simplifyworklist do
begin
if length<2 then
exit;
p:=1;
while 2*p<length do
p:=2*p;
while p<>0 do
begin
for h:=p to length-1 do
begin
i:=h;
t:=buf^[i];
adjt:=reginfo[buf^[i]].adjlist;
lent:=0;
if adjt<>nil then
lent:=adjt^.length;
repeat
adji:=reginfo[buf^[i-p]].adjlist;
leni:=0;
if adji<>nil then
leni:=adji^.length;
if leni>=lent then
break;
buf^[i]:=buf^[i-p];
dec(i,p)
until i<p;
buf^[i]:=t;
end;
p:=p shr 1;
end;
end;
end;
{ sort spilled nodes by increasing number of interferences }
procedure Trgobj.sort_spillednodes;
var
p,h,i,leni,lent:longword;
t:Tsuperregister;
adji,adjt:Psuperregisterworklist;
begin
with spillednodes do
begin
if length<2 then
exit;
p:=1;
while 2*p<length do
p:=2*p;
while p<>0 do
begin
for h:=p to length-1 do
begin
i:=h;
t:=buf^[i];
adjt:=reginfo[buf^[i]].adjlist;
lent:=0;
if adjt<>nil then
lent:=adjt^.length;
repeat
adji:=reginfo[buf^[i-p]].adjlist;
leni:=0;
if adji<>nil then
leni:=adji^.length;
if leni<=lent then
break;
buf^[i]:=buf^[i-p];
dec(i,p)
until i<p;
buf^[i]:=t;
end;
p:=p shr 1;
end;
end;
end;
procedure trgobj.make_work_list;
var n:cardinal;
begin
{If we have 7 cpu registers, and the degree of a node >= 7, we cannot
assign it to any of the registers, thus it is significant.}
for n:=first_imaginary to maxreg-1 do
with reginfo[n] do
begin
if adjlist=nil then
degree:=0
else
degree:=adjlist^.length;
if degree>=usable_registers_cnt then
spillworklist.add(n)
else if move_related(n) then
freezeworklist.add(n)
else if not(ri_coalesced in flags) then
simplifyworklist.add(n);
end;
sort_simplify_worklist;
end;
procedure trgobj.prepare_colouring;
begin
make_work_list;
active_moves:=Tlinkedlist.create;
frozen_moves:=Tlinkedlist.create;
coalesced_moves:=Tlinkedlist.create;
constrained_moves:=Tlinkedlist.create;
selectstack.clear;
end;
procedure trgobj.enable_moves(n:Tsuperregister);
var m:Tlinkedlistitem;
i:cardinal;
begin
with reginfo[n] do
if movelist<>nil then
for i:=0 to movelist^.header.count-1 do
begin
m:=movelist^.data[i];
if Tmoveins(m).moveset in [ms_worklist_moves,ms_active_moves] then
if Tmoveins(m).moveset=ms_active_moves then
begin
{Move m from the set active_moves to the set worklist_moves.}
active_moves.remove(m);
Tmoveins(m).moveset:=ms_worklist_moves;
worklist_moves.concat(m);
end;
end;
end;
procedure Trgobj.decrement_degree(m:Tsuperregister);
var adj : Psuperregisterworklist;
n : tsuperregister;
d,i : cardinal;
begin
with reginfo[m] do
begin
d:=degree;
if d=0 then
internalerror(200312151);
dec(degree);
if d=usable_registers_cnt then
begin
{Enable moves for m.}
enable_moves(m);
{Enable moves for adjacent.}
adj:=adjlist;
if adj<>nil then
for i:=1 to adj^.length do
begin
n:=adj^.buf^[i-1];
if reginfo[n].flags*[ri_selected,ri_coalesced]<>[] then
enable_moves(n);
end;
{Remove the node from the spillworklist.}
if not spillworklist.delete(m) then
internalerror(200310145);
if move_related(m) then
freezeworklist.add(m)
else
simplifyworklist.add(m);
end;
end;
end;
procedure trgobj.simplify;
var adj : Psuperregisterworklist;
m,n : Tsuperregister;
i : cardinal;
begin
{We take the element with the least interferences out of the
simplifyworklist. Since the simplifyworklist is now sorted, we
no longer need to search, but we can simply take the first element.}
m:=simplifyworklist.get;
{Push it on the selectstack.}
selectstack.add(m);
with reginfo[m] do
begin
include(flags,ri_selected);
adj:=adjlist;
end;
if adj<>nil then
for i:=1 to adj^.length do
begin
n:=adj^.buf^[i-1];
if (n>=first_imaginary) and
(reginfo[n].flags*[ri_selected,ri_coalesced]=[]) then
decrement_degree(n);
end;
end;
function trgobj.get_alias(n:Tsuperregister):Tsuperregister;
begin
while ri_coalesced in reginfo[n].flags do
n:=reginfo[n].alias;
get_alias:=n;
end;
procedure trgobj.add_worklist(u:Tsuperregister);
begin
if (u>=first_imaginary) and
(not move_related(u)) and
(reginfo[u].degree<usable_registers_cnt) then
begin
if not freezeworklist.delete(u) then
internalerror(200308161); {must be found}
simplifyworklist.add(u);
end;
end;
function trgobj.adjacent_ok(u,v:Tsuperregister):boolean;
{Check wether u and v should be coalesced. u is precoloured.}
function ok(t,r:Tsuperregister):boolean;
begin
ok:=(t<first_imaginary) or
// disabled for now, see issue #22405
// ((r<first_imaginary) and (r in usable_register_set)) or
(reginfo[t].degree<usable_registers_cnt) or
ibitmap[r,t];
end;
var adj : Psuperregisterworklist;
i : cardinal;
n : tsuperregister;
begin
with reginfo[v] do
begin
adjacent_ok:=true;
adj:=adjlist;
if adj<>nil then
for i:=1 to adj^.length do
begin
n:=adj^.buf^[i-1];
if (flags*[ri_coalesced,ri_selected]=[]) and not ok(n,u) then
begin
adjacent_ok:=false;
break;
end;
end;
end;
end;
function trgobj.conservative(u,v:Tsuperregister):boolean;
var adj : Psuperregisterworklist;
done : Tsuperregisterset; {To prevent that we count nodes twice.}
i,k:cardinal;
n : tsuperregister;
begin
k:=0;
supregset_reset(done,false,maxreg);
with reginfo[u] do
begin
adj:=adjlist;
if adj<>nil then
for i:=1 to adj^.length do
begin
n:=adj^.buf^[i-1];
if reginfo[n].flags*[ri_coalesced,ri_selected]=[] then
begin
supregset_include(done,n);
if reginfo[n].degree>=usable_registers_cnt then
inc(k);
end;
end;
end;
adj:=reginfo[v].adjlist;
if adj<>nil then
for i:=1 to adj^.length do
begin
n:=adj^.buf^[i-1];
if (u<first_imaginary) and
(n>=first_imaginary) and
not ibitmap[u,n] and
(usable_registers_cnt-reginfo[n].real_reg_interferences<=1) then
begin
{ Do not coalesce if 'u' is the last usable real register available
for imaginary register 'n'. }
conservative:=false;
exit;
end;
if not supregset_in(done,n) and
(reginfo[n].degree>=usable_registers_cnt) and
(reginfo[n].flags*[ri_coalesced,ri_selected]=[]) then
inc(k);
end;
conservative:=(k<usable_registers_cnt);
end;
procedure trgobj.set_alias(u,v:Tsuperregister);
begin
{ don't make registers that the register allocator shouldn't touch (such
as stack and frame pointers) be aliases for other registers, because
then it can propagate them and even start changing them if the aliased
register gets changed }
if ((u<first_imaginary) and
not(u in usable_register_set)) or
((v<first_imaginary) and
not(v in usable_register_set)) then
exit;
include(reginfo[v].flags,ri_coalesced);
if reginfo[v].alias<>0 then
internalerror(200712291);
reginfo[v].alias:=get_alias(u);
coalescednodes.add(v);
end;
procedure trgobj.combine(u,v:Tsuperregister);
var adj : Psuperregisterworklist;
i,n,p,q:cardinal;
t : tsuperregister;
searched:Tlinkedlistitem;
found : boolean;
begin
if not freezeworklist.delete(v) then
spillworklist.delete(v);
coalescednodes.add(v);
include(reginfo[v].flags,ri_coalesced);
reginfo[v].alias:=u;
{Combine both movelists. Since the movelists are sets, only add
elements that are not already present. The movelists cannot be
empty by definition; nodes are only coalesced if there is a move
between them. To prevent quadratic time blowup (movelists of
especially machine registers can get very large because of moves
generated during calls) we need to go into disgusting complexity.
(See webtbs/tw2242 for an example that stresses this.)
We want to sort the movelist to be able to search logarithmically.
Unfortunately, sorting the movelist every time before searching
is counter-productive, since the movelist usually grows with a few
items at a time. Therefore, we split the movelist into a sorted
and an unsorted part and search through both. If the unsorted part
becomes too large, we sort.}
if assigned(reginfo[u].movelist) then
begin
{We have to weigh the cost of sorting the list against searching
the cost of the unsorted part. I use factor of 8 here; if the
number of items is less than 8 times the numer of unsorted items,
we'll sort the list.}
with reginfo[u].movelist^ do
if header.count<8*(header.count-header.sorted_until) then
sort_movelist(reginfo[u].movelist);
if assigned(reginfo[v].movelist) then
begin
for n:=0 to reginfo[v].movelist^.header.count-1 do
begin
{Binary search the sorted part of the list.}
searched:=reginfo[v].movelist^.data[n];
p:=0;
q:=reginfo[u].movelist^.header.sorted_until;
i:=0;
if q<>0 then
repeat
i:=(p+q) shr 1;
if ptruint(searched)>ptruint(reginfo[u].movelist^.data[i]) then
p:=i+1
else
q:=i;
until p=q;
with reginfo[u].movelist^ do
if searched<>data[i] then
begin
{Linear search the unsorted part of the list.}
found:=false;
for i:=header.sorted_until+1 to header.count-1 do
if searched=data[i] then
begin
found:=true;
break;
end;
if not found then
add_to_movelist(u,searched);
end;
end;
end;
end;
enable_moves(v);
adj:=reginfo[v].adjlist;
if adj<>nil then
for i:=1 to adj^.length do
begin
t:=adj^.buf^[i-1];
with reginfo[t] do
if not(ri_coalesced in flags) then
begin
{t has a connection to v. Since we are adding v to u, we
need to connect t to u. However, beware if t was already
connected to u...}
if (ibitmap[t,u]) and not (ri_selected in flags) then
{... because in that case, we are actually removing an edge
and the degree of t decreases.}
decrement_degree(t)
else
begin
add_edge(t,u);
{We have added an edge to t and u. So their degree increases.
However, v is added to u. That means its neighbours will
no longer point to v, but to u instead. Therefore, only the
degree of u increases.}
if (u>=first_imaginary) and not (ri_selected in flags) then
inc(reginfo[u].degree);
end;
end;
end;
if (reginfo[u].degree>=usable_registers_cnt) and freezeworklist.delete(u) then
spillworklist.add(u);
end;
procedure trgobj.coalesce;
var m:Tmoveins;
x,y,u,v:cardinal;
begin
m:=Tmoveins(worklist_moves.getfirst);
x:=get_alias(m.x);
y:=get_alias(m.y);
if (y<first_imaginary) then
begin
u:=y;
v:=x;
end
else
begin
u:=x;
v:=y;
end;
if (u=v) then
begin
m.moveset:=ms_coalesced_moves; {Already coalesced.}
coalesced_moves.insert(m);
add_worklist(u);
end
{Do u and v interfere? In that case the move is constrained. Two
precoloured nodes interfere allways. If v is precoloured, by the above
code u is precoloured, thus interference...}
else if (v<first_imaginary) or ibitmap[u,v] then
begin
m.moveset:=ms_constrained_moves; {Cannot coalesce yet...}
constrained_moves.insert(m);
add_worklist(u);
add_worklist(v);
end
{Next test: is it possible and a good idea to coalesce?? Note: don't
coalesce registers that should not be touched by the register allocator,
such as stack/framepointers, because otherwise they can be changed }
else if (((u<first_imaginary) and adjacent_ok(u,v)) or
conservative(u,v)) and
((u>first_imaginary) or
(u in usable_register_set)) and
((v>first_imaginary) or
(v in usable_register_set)) then
begin
m.moveset:=ms_coalesced_moves; {Move coalesced!}
coalesced_moves.insert(m);
combine(u,v);
add_worklist(u);
end
else
begin
m.moveset:=ms_active_moves;
active_moves.insert(m);
end;
end;
procedure trgobj.freeze_moves(u:Tsuperregister);
var i:cardinal;
m:Tlinkedlistitem;
v,x,y:Tsuperregister;
begin
if reginfo[u].movelist<>nil then
for i:=0 to reginfo[u].movelist^.header.count-1 do
begin
m:=reginfo[u].movelist^.data[i];
if Tmoveins(m).moveset in [ms_worklist_moves,ms_active_moves] then
begin
x:=Tmoveins(m).x;
y:=Tmoveins(m).y;
if get_alias(y)=get_alias(u) then
v:=get_alias(x)
else
v:=get_alias(y);
{Move m from active_moves/worklist_moves to frozen_moves.}
if Tmoveins(m).moveset=ms_active_moves then
active_moves.remove(m)
else
worklist_moves.remove(m);
Tmoveins(m).moveset:=ms_frozen_moves;
frozen_moves.insert(m);
if (v>=first_imaginary) and not(move_related(v)) and
(reginfo[v].degree<usable_registers_cnt) then
begin
freezeworklist.delete(v);
simplifyworklist.add(v);
end;
end;
end;
end;
procedure trgobj.freeze;
var n:Tsuperregister;
begin
{ We need to take a random element out of the freezeworklist. We take
the last element. Dirty code! }
n:=freezeworklist.get;
{Add it to the simplifyworklist.}
simplifyworklist.add(n);
freeze_moves(n);
end;
{ The spilling approach selected by SPILLING_NEW does not work well for AVR as it eploits apparently the problem of the current
reg. allocator with AVR. The current reg. allocator is not aware of the fact that r1-r15 and r16-r31 are not equal on AVR }
{$if defined(AVR)}
{$define SPILLING_OLD}
{$else defined(AVR)}
{ $define SPILLING_NEW}
{$endif defined(AVR)}
{$ifndef SPILLING_NEW}
{$define SPILLING_OLD}
{$endif SPILLING_NEW}
procedure trgobj.select_spill;
var
n : tsuperregister;
adj : psuperregisterworklist;
maxlength,minlength,p,i :word;
minweight: longint;
{$ifdef SPILLING_NEW}
dist: Double;
{$endif}
begin
{$ifdef SPILLING_NEW}
{ This new approach for selecting the next spill candidate takes care of the weight of a register:
It spills the register with the lowest weight but only if it is expected that it results in convergence of
register allocation. Convergence is expected if a register is spilled where the average of the active interferences
- active interference means that the register is used in an instruction - is lower than
the degree.
Example (modify means read and the write):
modify reg1
loop:
modify reg2
modify reg3
modify reg4
modify reg5
modify reg6
modify reg7
modify reg1
In this example, all register have the same degree. However, spilling reg1 is most benefical as it is used least. Furthermore,
spilling reg1 is a step toward solving the coloring problem as the registers used during spilling will have a lower degree
as no register are in use at the location where reg1 is spilled.
}
minweight:=high(longint);
p:=0;
with spillworklist do
begin
{ Safe: This procedure is only called if length<>0 }
for i:=0 to length-1 do
begin
adj:=reginfo[buf^[i]].adjlist;
dist:=adj^.length-reginfo[buf^[i]].total_interferences/reginfo[buf^[i]].count_uses;
if assigned(adj) and
(reginfo[buf^[i]].weight<minweight) and
(dist>=1) and
(reginfo[buf^[i]].weight>0) then
begin
p:=i;
minweight:=reginfo[buf^[i]].weight;
end;
end;
n:=buf^[p];
deleteidx(p);
end;
{$endif SPILLING_NEW}
{$ifdef SPILLING_OLD}
{ We must look for the element with the most interferences in the
spillworklist. This is required because those registers are creating
the most conflicts and keeping them in a register will not reduce the
complexity and even can cause the help registers for the spilling code
to get too much conflicts with the result that the spilling code
will never converge (PFV)
We need a special processing for nodes with the ri_spill_read flag set.
These nodes contain a value loaded from a previously spilled node.
We need to avoid another spilling of ri_spill_read nodes, since it will
likely lead to an endless loop and the register allocation will fail.
}
maxlength:=0;
minweight:=high(longint);
p:=high(p);
with spillworklist do
begin
{Safe: This procedure is only called if length<>0}
{ Search for a candidate to be spilled, ignoring nodes with the ri_spill_read flag set. }
for i:=0 to length-1 do
if not(ri_spill_read in reginfo[buf^[i]].flags) then
begin
adj:=reginfo[buf^[i]].adjlist;
if assigned(adj) and
(
(adj^.length>maxlength) or
((adj^.length=maxlength) and (reginfo[buf^[i]].weight<minweight))
) then
begin
p:=i;
maxlength:=adj^.length;
minweight:=reginfo[buf^[i]].weight;
end;
end;
if p=high(p) then
begin
{ If no normal nodes found, then only ri_spill_read nodes are present
in the list. Finding the node with the least interferences and
the least weight.
This allows us to put the most restricted ri_spill_read nodes
to the top of selectstack so they will be the first to get
a color assigned.
}
minlength:=high(maxlength);
minweight:=high(minweight);
p:=0;
for i:=0 to length-1 do
begin
adj:=reginfo[buf^[i]].adjlist;
if assigned(adj) and
(
(adj^.length<minlength) or
((adj^.length=minlength) and (reginfo[buf^[i]].weight<minweight))
) then
begin
p:=i;
minlength:=adj^.length;
minweight:=reginfo[buf^[i]].weight;
end;
end;
end;
n:=buf^[p];
deleteidx(p);
end;
{$endif SPILLING_OLD}
simplifyworklist.add(n);
freeze_moves(n);
end;
procedure trgobj.assign_colours;
{Assign_colours assigns the actual colours to the registers.}
var adj : Psuperregisterworklist;
i,j,k : cardinal;
n,a,c : Tsuperregister;
colourednodes : Tsuperregisterset;
adj_colours:set of 0..255;
found : boolean;
{$if declared(RS_STACK_POINTER_REG) and (RS_STACK_POINTER_REG<>RS_INVALID)}
tmpr: tregister;
{$endif}
begin
spillednodes.clear;
{Reset colours}
for n:=0 to maxreg-1 do
reginfo[n].colour:=n;
{Colour the cpu registers...}
supregset_reset(colourednodes,false,maxreg);
for n:=0 to first_imaginary-1 do
supregset_include(colourednodes,n);
{Now colour the imaginary registers on the select-stack.}
for i:=selectstack.length downto 1 do
begin
n:=selectstack.buf^[i-1];
{Create a list of colours that we cannot assign to n.}
adj_colours:=[];
adj:=reginfo[n].adjlist;
if adj<>nil then
for j:=0 to adj^.length-1 do
begin
a:=get_alias(adj^.buf^[j]);
if supregset_in(colourednodes,a) and (reginfo[a].colour<=255) then
include(adj_colours,reginfo[a].colour);
end;
{ e.g. AVR does not have a stack pointer register }
{$if declared(RS_STACK_POINTER_REG) and (RS_STACK_POINTER_REG<>RS_INVALID)}
{ FIXME: temp variable r is needed here to avoid Internal error 20060521 }
{ while compiling the compiler. }
tmpr:=NR_STACK_POINTER_REG;
if (regtype=getregtype(tmpr)) then
include(adj_colours,RS_STACK_POINTER_REG);
{$ifend}
{Assume a spill by default...}
found:=false;
{Search for a colour not in this list.}
for k:=0 to usable_registers_cnt-1 do
begin
c:=usable_registers[k];
if not(c in adj_colours) then
begin
reginfo[n].colour:=c;
found:=true;
supregset_include(colourednodes,n);
break;
end;
end;
if not found then
spillednodes.add(n);
end;
{Finally colour the nodes that were coalesced.}
for i:=1 to coalescednodes.length do
begin
n:=coalescednodes.buf^[i-1];
k:=get_alias(n);
reginfo[n].colour:=reginfo[k].colour;
end;
end;
procedure trgobj.colour_registers;
begin
repeat
if simplifyworklist.length<>0 then
simplify
else if not(worklist_moves.empty) then
coalesce
else if freezeworklist.length<>0 then
freeze
else if spillworklist.length<>0 then
select_spill;
until (simplifyworklist.length=0) and
worklist_moves.empty and
(freezeworklist.length=0) and
(spillworklist.length=0);
assign_colours;
end;
procedure trgobj.epilogue_colouring;
begin
{ remove all items from the worklists, but do not free them, they are still needed for spill coalesce }
move_garbage.concatList(worklist_moves);
move_garbage.concatList(active_moves);
active_moves.Free;
active_moves:=nil;
move_garbage.concatList(frozen_moves);
frozen_moves.Free;
frozen_moves:=nil;
move_garbage.concatList(coalesced_moves);
coalesced_moves.Free;
coalesced_moves:=nil;
move_garbage.concatList(constrained_moves);
constrained_moves.Free;
constrained_moves:=nil;
end;
procedure trgobj.clear_interferences(u:Tsuperregister);
{Remove node u from the interference graph and remove all collected
move instructions it is associated with.}
var i : word;
v : Tsuperregister;
adj,adj2 : Psuperregisterworklist;
begin
adj:=reginfo[u].adjlist;
if adj<>nil then
begin
for i:=1 to adj^.length do
begin
v:=adj^.buf^[i-1];
{Remove (u,v) and (v,u) from bitmap.}
ibitmap[u,v]:=false;
ibitmap[v,u]:=false;
{Remove (v,u) from adjacency list.}
adj2:=reginfo[v].adjlist;
if adj2<>nil then
begin
adj2^.delete(u);
if adj2^.length=0 then
begin
dispose(adj2,done);
reginfo[v].adjlist:=nil;
end;
end;
end;
{Remove ( u,* ) from adjacency list.}
dispose(adj,done);
reginfo[u].adjlist:=nil;
end;
end;
function trgobj.getregisterinline(list:TAsmList;const subregconstraints:Tsubregisterset):Tregister;
var
p : Tsuperregister;
subreg: tsubregister;
begin
for subreg:=high(tsubregister) downto low(tsubregister) do
if subreg in subregconstraints then
break;
p:=getnewreg(subreg);
live_registers.add(p);
result:=newreg(regtype,p,subreg);
add_edges_used(p);
add_constraints(result);
{ also add constraints for other sizes used for this register }
if subreg<>low(tsubregister) then
for subreg:=pred(subreg) downto low(tsubregister) do
if subreg in subregconstraints then
add_constraints(newreg(regtype,getsupreg(result),subreg));
end;
procedure trgobj.ungetregisterinline(list:TAsmList;r:Tregister);
var
supreg:Tsuperregister;
begin
supreg:=getsupreg(r);
live_registers.delete(supreg);
insert_regalloc_info(list,supreg);
end;
procedure trgobj.insert_regalloc_info(list:TAsmList;u:tsuperregister);
var
p : tai;
r : tregister;
palloc,
pdealloc : tai_regalloc;
begin
{ Insert regallocs for all imaginary registers }
with reginfo[u] do
begin
r:=newreg(regtype,u,subreg);
if assigned(live_start) then
begin
{ Generate regalloc and bind it to an instruction, this
is needed to find all live registers belonging to an
instruction during the spilling }
if live_start.typ=ait_instruction then
palloc:=tai_regalloc.alloc(r,live_start)
else
palloc:=tai_regalloc.alloc(r,nil);
if live_end.typ=ait_instruction then
pdealloc:=tai_regalloc.dealloc(r,live_end)
else
pdealloc:=tai_regalloc.dealloc(r,nil);
{ Insert live start allocation before the instruction/reg_a_sync }
list.insertbefore(palloc,live_start);
{ Insert live end deallocation before reg allocations
to reduce conflicts }
p:=live_end;
while assigned(p) and
assigned(p.previous) and
(tai(p.previous).typ=ait_regalloc) and
(tai_regalloc(p.previous).ratype=ra_alloc) and
(tai_regalloc(p.previous).reg<>r) do
p:=tai(p.previous);
{ , but add release after a reg_a_sync }
if assigned(p) and
(p.typ=ait_regalloc) and
(tai_regalloc(p).ratype=ra_sync) then
p:=tai(p.next);
if assigned(p) then
list.insertbefore(pdealloc,p)
else
list.concat(pdealloc);
end;
end;
end;
procedure trgobj.insert_regalloc_info_all(list:TAsmList);
var
supreg : tsuperregister;
begin
{ Insert regallocs for all imaginary registers }
for supreg:=first_imaginary to maxreg-1 do
insert_regalloc_info(list,supreg);
end;
procedure trgobj.determine_spill_registers(list: TAsmList; headertail: tai);
begin
prepare_colouring;
colour_registers;
epilogue_colouring;
end;
procedure trgobj.get_spill_temp(list: TAsmlist; spill_temps: Pspill_temp_list; supreg: tsuperregister);
var
size: ptrint;
begin
{Get a temp for the spilled register, the size must at least equal a complete register,
take also care of the fact that subreg can be larger than a single register like doubles
that occupy 2 registers }
{ only force the whole register in case of integers. Storing a register that contains
a single precision value as a double can cause conversion errors on e.g. ARM VFP }
if (regtype=R_INTREGISTER) then
size:=max(tcgsize2size[reg_cgsize(newreg(regtype,supreg,R_SUBWHOLE))],
tcgsize2size[reg_cgsize(newreg(regtype,supreg,reginfo[supreg].subreg))])
else
size:=tcgsize2size[reg_cgsize(newreg(regtype,supreg,reginfo[supreg].subreg))];
tg.gettemp(list,
size,size,
tt_noreuse,spill_temps^[supreg]);
end;
procedure trgobj.add_cpu_interferences(p : tai);
begin
end;
procedure trgobj.generate_interference_graph(list:TAsmList;headertai:tai);
procedure RecordUse(var r : Treginfo);
begin
inc(r.total_interferences,live_registers.length);
inc(r.count_uses);
end;
var
p : tai;
i : integer;
supreg, u: tsuperregister;
{$ifdef arm}
so: pshifterop;
{$endif arm}
begin
{ All allocations are available. Now we can generate the
interference graph. Walk through all instructions, we can
start with the headertai, because before the header tai is
only symbols. }
live_registers.clear;
p:=headertai;
while assigned(p) do
begin
prefetch(pointer(p.next)^);
case p.typ of
ait_instruction:
with Taicpu(p) do
begin
current_filepos:=fileinfo;
{For speed reasons, get_alias isn't used here, instead,
assign_colours will also set the colour of coalesced nodes.
If there are registers with colour=0, then the coalescednodes
list probably doesn't contain these registers, causing
assign_colours not to do this properly.}
for i:=0 to ops-1 do
with oper[i]^ do
case typ of
top_reg:
if (getregtype(reg)=regtype) then
begin
u:=getsupreg(reg);
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2018111701);
{$endif}
RecordUse(reginfo[u]);
end;
top_ref:
begin
if regtype in [R_INTREGISTER,R_ADDRESSREGISTER] then
with ref^ do
begin
if (base<>NR_NO) and
(getregtype(base)=regtype) then
begin
u:=getsupreg(base);
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2018111702);
{$endif}
RecordUse(reginfo[u]);
end;
if (index<>NR_NO) and
(getregtype(index)=regtype) then
begin
u:=getsupreg(index);
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2018111703);
{$endif}
RecordUse(reginfo[u]);
end;
{$if defined(x86)}
if (segment<>NR_NO) and
(getregtype(segment)=regtype) then
begin
u:=getsupreg(segment);
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2018111704);
{$endif}
RecordUse(reginfo[u]);
end;
{$endif defined(x86)}
end;
end;
{$ifdef arm}
Top_shifterop:
begin
if regtype=R_INTREGISTER then
begin
so:=shifterop;
if (so^.rs<>NR_NO) and
(getregtype(so^.rs)=regtype) then
RecordUse(reginfo[getsupreg(so^.rs)]);
end;
end;
{$endif arm}
else
;
end;
end;
ait_regalloc:
with Tai_regalloc(p) do
begin
if (getregtype(reg)=regtype) then
begin
supreg:=getsupreg(reg);
case ratype of
ra_alloc :
begin
live_registers.add(supreg);
{$ifdef DEBUG_REGISTERLIFE}
write(live_registers.length,' ');
for i:=0 to live_registers.length-1 do
write(std_regname(newreg(regtype,live_registers.buf^[i],defaultsub)),' ');
writeln;
{$endif DEBUG_REGISTERLIFE}
add_edges_used(supreg);
end;
ra_dealloc :
begin
live_registers.delete(supreg);
{$ifdef DEBUG_REGISTERLIFE}
write(live_registers.length,' ');
for i:=0 to live_registers.length-1 do
write(std_regname(newreg(regtype,live_registers.buf^[i],defaultsub)),' ');
writeln;
{$endif DEBUG_REGISTERLIFE}
add_edges_used(supreg);
end;
ra_markused :
if (supreg<first_imaginary) then
begin
include(used_in_proc,supreg);
has_usedmarks:=true;
end;
else
;
end;
{ constraints needs always to be updated }
add_constraints(reg);
end;
end;
else
;
end;
add_cpu_interferences(p);
p:=Tai(p.next);
end;
{$ifdef EXTDEBUG}
if live_registers.length>0 then
begin
for i:=0 to live_registers.length-1 do
begin
{ Only report for imaginary registers }
if live_registers.buf^[i]>=first_imaginary then
Comment(V_Warning,'Register '+std_regname(newreg(regtype,live_registers.buf^[i],defaultsub))+' not released');
end;
end;
{$endif}
end;
procedure trgobj.translate_register(var reg : tregister);
begin
if (getregtype(reg)=regtype) then
setsupreg(reg,reginfo[getsupreg(reg)].colour)
else
internalerror(200602021);
end;
procedure trgobj.set_reg_initial_location(reg: tregister; const ref: treference);
var
supreg: TSuperRegister;
begin
supreg:=getsupreg(reg);
if (supreg<first_imaginary) or (supreg>=maxreg) then
internalerror(2020090501);
alloc_spillinfo(supreg+1);
spillinfo[supreg].spilllocation:=ref;
include(reginfo[supreg].flags,ri_has_initial_loc);
end;
procedure trgobj.translate_registers(list: TAsmList);
function get_reg_name_full(r: tregister; include_prefix: boolean): string;
var
rr:tregister;
sr:TSuperRegister;
begin
sr:=getsupreg(r);
if reginfo[sr].live_start=nil then
begin
result:='';
exit;
end;
if (sr<length(spillinfo)) and spillinfo[sr].spilled then
with spillinfo[sr].spilllocation do
begin
result:='['+std_regname(base);
if offset>=0 then
result:=result+'+';
result:=result+IntToStr(offset)+']';
if include_prefix then
result:='stack '+result;
end
else
begin
rr:=r;
setsupreg(rr,reginfo[sr].colour);
result:=std_regname(rr);
if include_prefix then
result:='register '+result;
end;
{$if defined(cpu8bitalu) or defined(cpu16bitalu)}
if (sr>=first_int_imreg) and cg.has_next_reg[sr] then
result:=result+':'+get_reg_name_full(cg.GetNextReg(r),false);
{$endif defined(cpu8bitalu) or defined(cpu16bitalu)}
end;
var
hp,p,q:Tai;
i:shortint;
u:longint;
s:string;
{$ifdef arm}
so:pshifterop;
{$endif arm}
begin
{ Leave when no imaginary registers are used }
if maxreg<=first_imaginary then
exit;
p:=Tai(list.first);
while assigned(p) do
begin
prefetch(pointer(p.next)^);
case p.typ of
ait_regalloc:
with Tai_regalloc(p) do
begin
if (getregtype(reg)=regtype) then
begin
{ Only alloc/dealloc is needed for the optimizer, remove
other regalloc }
if not(ratype in [ra_alloc,ra_dealloc]) then
begin
q:=Tai(next);
list.remove(p);
p.free;
p:=q;
continue;
end
else
begin
u:=reginfo[getsupreg(reg)].colour;
include(used_in_proc,u);
{$ifdef EXTDEBUG}
if u>=maxreginfo then
internalerror(2015040501);
{$endif}
setsupreg(reg,u);
end;
end;
end;
ait_varloc:
begin
if (getregtype(tai_varloc(p).newlocation)=regtype) then
begin
if (cs_asm_source in current_settings.globalswitches) then
begin
s:=get_reg_name_full(tai_varloc(p).newlocation,tai_varloc(p).newlocationhi=NR_NO);
if s<>'' then
begin
if tai_varloc(p).newlocationhi<>NR_NO then
s:=get_reg_name_full(tai_varloc(p).newlocationhi,true)+':'+s;
hp:=Tai_comment.Create(strpnew('Var '+tai_varloc(p).varsym.realname+' located in '+s));
list.insertafter(hp,p);
end;
setsupreg(tai_varloc(p).newlocation,reginfo[getsupreg(tai_varloc(p).newlocation)].colour);
if tai_varloc(p).newlocationhi<>NR_NO then
setsupreg(tai_varloc(p).newlocationhi,reginfo[getsupreg(tai_varloc(p).newlocationhi)].colour);
end;
q:=tai(p.next);
list.remove(p);
p.free;
p:=q;
continue;
end;
end;
ait_instruction:
with Taicpu(p) do
begin
current_filepos:=fileinfo;
{For speed reasons, get_alias isn't used here, instead,
assign_colours will also set the colour of coalesced nodes.
If there are registers with colour=0, then the coalescednodes
list probably doesn't contain these registers, causing
assign_colours not to do this properly.}
for i:=0 to ops-1 do
with oper[i]^ do
case typ of
Top_reg:
if (getregtype(reg)=regtype) then
begin
u:=getsupreg(reg);
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2012101903);
{$endif}
setsupreg(reg,reginfo[u].colour);
end;
Top_ref:
begin
if regtype in [R_INTREGISTER,R_ADDRESSREGISTER] then
with ref^ do
begin
if (base<>NR_NO) and
(getregtype(base)=regtype) then
begin
u:=getsupreg(base);
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2012101904);
{$endif}
setsupreg(base,reginfo[u].colour);
end;
if (index<>NR_NO) and
(getregtype(index)=regtype) then
begin
u:=getsupreg(index);
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2012101905);
{$endif}
setsupreg(index,reginfo[u].colour);
end;
{$if defined(x86)}
if (segment<>NR_NO) and
(getregtype(segment)=regtype) then
begin
u:=getsupreg(segment);
{$ifdef EXTDEBUG}
if (u>=maxreginfo) then
internalerror(2013052401);
{$endif}
setsupreg(segment,reginfo[u].colour);
end;
{$endif defined(x86)}
end;
end;
{$ifdef arm}
Top_shifterop:
begin
if regtype=R_INTREGISTER then
begin
so:=shifterop;
if (so^.rs<>NR_NO) and
(getregtype(so^.rs)=regtype) then
setsupreg(so^.rs,reginfo[getsupreg(so^.rs)].colour);
end;
end;
{$endif arm}
else
;
end;
{ Maybe the operation can be removed when
it is a move and both arguments are the same }
if is_same_reg_move(regtype) then
begin
q:=Tai(p.next);
list.remove(p);
p.free;
p:=q;
continue;
end;
end;
else
;
end;
p:=Tai(p.next);
end;
current_filepos:=current_procinfo.exitpos;
end;
function trgobj.spill_registers(list:TAsmList;headertai:tai):boolean;
{ Returns true if any help registers have been used }
var
i : cardinal;
t : tsuperregister;
p,q : Tai;
regs_to_spill_set:Tsuperregisterset;
spill_temps : ^Tspill_temp_list;
supreg,x,y : tsuperregister;
templist : TAsmList;
j : Longint;
getnewspillloc : Boolean;
begin
spill_registers:=false;
live_registers.clear;
{ spilling should start with the node with the highest number of interferences, so we can coalesce as
much as possible spilled nodes (coalesce in case of spilled node means they share the same memory location) }
sort_spillednodes;
for i:=first_imaginary to maxreg-1 do
exclude(reginfo[i].flags,ri_selected);
spill_temps:=allocmem(sizeof(treference)*maxreg);
supregset_reset(regs_to_spill_set,false,$ffff);
{$ifdef DEBUG_SPILLCOALESCE}
writeln('trgobj.spill_registers: Got maxreg ',maxreg);
writeln('trgobj.spill_registers: Spilling ',spillednodes.length,' nodes');
{$endif DEBUG_SPILLCOALESCE}
{ after each round of spilling, more registers could be used due to allocations for spilling }
alloc_spillinfo(maxreg);
{ Allocate temps and insert in front of the list }
templist:=TAsmList.create;
{ Safe: this procedure is only called if there are spilled nodes. }
with spillednodes do
{ the node with the highest interferences is the last one }
for i:=length-1 downto 0 do
begin
t:=buf^[i];
{$ifdef DEBUG_SPILLCOALESCE}
writeln('trgobj.spill_registers: Spilling ',t);
{$endif DEBUG_SPILLCOALESCE}
spillinfo[t].interferences:=Tinterferencebitmap.create;
{ copy interferences }
for j:=0 to maxreg-1 do
spillinfo[t].interferences[0,j]:=ibitmap[t,j];
{ Alternative representation. }
supregset_include(regs_to_spill_set,t);
{ Clear all interferences of the spilled register. }
clear_interferences(t);
getnewspillloc:=not (ri_has_initial_loc in reginfo[t].flags);
if not getnewspillloc then
spill_temps^[t]:=spillinfo[t].spilllocation;
{ check if we can "coalesce" spilled nodes. To do so, it is required that they do not
interfere but are connected by a move instruction
doing so might save some mem->mem moves }
if (cs_opt_level3 in current_settings.optimizerswitches) and
getnewspillloc and
assigned(reginfo[t].movelist) then
for j:=0 to reginfo[t].movelist^.header.count-1 do
begin
x:=Tmoveins(reginfo[t].movelist^.data[j]).x;
y:=Tmoveins(reginfo[t].movelist^.data[j]).y;
if (x=t) and
(spillinfo[get_alias(y)].spilled) and
not(spillinfo[get_alias(y)].interferences[0,t]) then
begin
spill_temps^[t]:=spillinfo[get_alias(y)].spilllocation;
{$ifdef DEBUG_SPILLCOALESCE}
writeln('trgobj.spill_registers: Spill coalesce ',t,' to ',y);
{$endif DEBUG_SPILLCOALESCE}
getnewspillloc:=false;
break;
end
else if (y=t) and
(spillinfo[get_alias(x)].spilled) and
not(spillinfo[get_alias(x)].interferences[0,t]) then
begin
{$ifdef DEBUG_SPILLCOALESCE}
writeln('trgobj.spill_registers: Spill coalesce ',t,' to ',x);
{$endif DEBUG_SPILLCOALESCE}
spill_temps^[t]:=spillinfo[get_alias(x)].spilllocation;
getnewspillloc:=false;
break;
end;
end;
if getnewspillloc then
get_spill_temp(templist,spill_temps,t);
{$ifdef DEBUG_SPILLCOALESCE}
writeln('trgobj.spill_registers: Spill temp: ',getsupreg(spill_temps^[t].base),'+',spill_temps^[t].offset);
{$endif DEBUG_SPILLCOALESCE}
{ set spilled only as soon as a temp is assigned, else a mov iregX,iregX results in a spill coalesce with itself }
spillinfo[t].spilled:=true;
spillinfo[t].spilllocation:=spill_temps^[t];
end;
list.insertlistafter(headertai,templist);
templist.free;
{ Walk through all instructions, we can start with the headertai,
because before the header tai is only symbols }
p:=headertai;
while assigned(p) do
begin
case p.typ of
ait_regalloc:
with Tai_regalloc(p) do
begin
if (getregtype(reg)=regtype) then
begin
{A register allocation of a spilled register can be removed.}
supreg:=getsupreg(reg);
if supregset_in(regs_to_spill_set,supreg) then
begin
{ Remove loading of the register from its initial memory location
(e.g. load of a stack parameter to the register). }
if (ratype=ra_alloc) and
(ri_has_initial_loc in reginfo[supreg].flags) and
(instr<>nil) then
begin
list.remove(instr);
FreeAndNil(instr);
dec(reginfo[supreg].weight,100);
end;
{ Remove the regalloc }
q:=Tai(p.next);
list.remove(p);
p.free;
p:=q;
continue;
end
else
begin
case ratype of
ra_alloc :
live_registers.add(supreg);
ra_dealloc :
live_registers.delete(supreg);
else
;
end;
end;
end;
end;
{$ifdef llvm}
ait_llvmins,
{$endif llvm}
ait_instruction:
with tai_cpu_abstract_sym(p) do
begin
// writeln(gas_op2str[tai_cpu_abstract_sym(p).opcode]);
current_filepos:=fileinfo;
if instr_spill_register(list,tai_cpu_abstract_sym(p),regs_to_spill_set,spill_temps^) then
spill_registers:=true;
end;
else
;
end;
p:=Tai(p.next);
end;
current_filepos:=current_procinfo.exitpos;
{Safe: this procedure is only called if there are spilled nodes.}
with spillednodes do
for i:=0 to length-1 do
begin
j:=buf^[i];
if tg.istemp(spill_temps^[j]) then
tg.ungettemp(list,spill_temps^[j]);
end;
freemem(spill_temps);
end;
function trgobj.do_spill_replace(list:TAsmList;instr:tai_cpu_abstract_sym;orgreg:tsuperregister;const spilltemp:treference):boolean;
begin
result:=false;
end;
procedure trgobj.do_spill_read(list:TAsmList;pos:tai;const spilltemp:treference;tempreg:tregister;orgsupreg:tsuperregister);
var
ins:tai_cpu_abstract_sym;
begin
ins:=spilling_create_load(spilltemp,tempreg);
add_cpu_interferences(ins);
list.insertafter(ins,pos);
{$ifdef DEBUG_SPILLING}
list.Insertbefore(tai_comment.Create(strpnew('Spilling: Spill Read')),ins);
{$endif}
end;
procedure Trgobj.do_spill_written(list:TAsmList;pos:tai;const spilltemp:treference;tempreg:tregister;orgsupreg:tsuperregister);
var
ins:tai_cpu_abstract_sym;
begin
ins:=spilling_create_store(tempreg,spilltemp);
add_cpu_interferences(ins);
list.insertafter(ins,pos);
{$ifdef DEBUG_SPILLING}
list.Insertbefore(tai_comment.Create(strpnew('Spilling: Spill Write')),ins);
{$endif}
end;
function trgobj.get_spill_subreg(r : tregister) : tsubregister;
begin
result:=defaultsub;
end;
function trgobj.addreginfo(var regs: tspillregsinfo; const r: tsuperregisterset; reg: tregister; operation: topertype): boolean;
var
i, tmpindex: longint;
supreg: tsuperregister;
begin
result:=false;
tmpindex := regs.reginfocount;
supreg := get_alias(getsupreg(reg));
{ did we already encounter this register? }
for i := 0 to pred(regs.reginfocount) do
if (regs.reginfo[i].orgreg = supreg) then
begin
tmpindex := i;
break;
end;
if tmpindex > high(regs.reginfo) then
internalerror(2003120301);
regs.reginfo[tmpindex].orgreg := supreg;
include(regs.reginfo[tmpindex].spillregconstraints,get_spill_subreg(reg));
if supregset_in(r,supreg) then
begin
{ add/update info on this register }
regs.reginfo[tmpindex].mustbespilled := true;
case operation of
operand_read:
regs.reginfo[tmpindex].regread := true;
operand_write:
regs.reginfo[tmpindex].regwritten := true;
operand_readwrite:
begin
regs.reginfo[tmpindex].regread := true;
regs.reginfo[tmpindex].regwritten := true;
end;
end;
result:=true;
end;
inc(regs.reginfocount,ord(regs.reginfocount=tmpindex));
end;
function trgobj.instr_get_oper_spilling_info(var regs: tspillregsinfo; const r: tsuperregisterset; instr: tai_cpu_abstract_sym; opidx: longint): boolean;
begin
result:=false;
with instr.oper[opidx]^ do
begin
case typ of
top_reg:
begin
if (getregtype(reg) = regtype) then
result:=addreginfo(regs,r,reg,instr.spilling_get_operation_type(opidx));
end;
top_ref:
begin
if regtype in [R_INTREGISTER,R_ADDRESSREGISTER] then
with ref^ do
begin
if (base <> NR_NO) and
(getregtype(base)=regtype) then
result:=addreginfo(regs,r,base,instr.spilling_get_operation_type_ref(opidx,base));
if (index <> NR_NO) and
(getregtype(index)=regtype) then
result:=addreginfo(regs,r,index,instr.spilling_get_operation_type_ref(opidx,index)) or result;
{$if defined(x86)}
if (segment <> NR_NO) and
(getregtype(segment)=regtype) then
result:=addreginfo(regs,r,segment,instr.spilling_get_operation_type_ref(opidx,segment)) or result;
{$endif defined(x86)}
end;
end;
{$ifdef ARM}
top_shifterop:
begin
if regtype in [R_INTREGISTER,R_ADDRESSREGISTER] then
if shifterop^.rs<>NR_NO then
result:=addreginfo(regs,r,shifterop^.rs,operand_read);
end;
{$endif ARM}
else
;
end;
end;
end;
procedure trgobj.try_replace_reg(const regs: tspillregsinfo; var reg: tregister; useloadreg: boolean);
var
i: longint;
supreg: tsuperregister;
begin
supreg:=get_alias(getsupreg(reg));
for i:=0 to pred(regs.reginfocount) do
if (regs.reginfo[i].mustbespilled) and
(regs.reginfo[i].orgreg=supreg) then
begin
{ Only replace supreg }
if useloadreg then
setsupreg(reg, getsupreg(regs.reginfo[i].loadreg))
else
setsupreg(reg, getsupreg(regs.reginfo[i].storereg));
break;
end;
end;
procedure trgobj.substitute_spilled_registers(const regs: tspillregsinfo; instr: tai_cpu_abstract_sym; opidx: longint);
begin
with instr.oper[opidx]^ do
case typ of
top_reg:
begin
if (getregtype(reg) = regtype) then
try_replace_reg(regs, reg, not ssa_safe or
(instr.spilling_get_operation_type(opidx)=operand_read));
end;
top_ref:
begin
if regtype in [R_INTREGISTER, R_ADDRESSREGISTER] then
begin
if (ref^.base <> NR_NO) and
(getregtype(ref^.base)=regtype) then
try_replace_reg(regs, ref^.base,
not ssa_safe or (instr.spilling_get_operation_type_ref(opidx, ref^.base)=operand_read));
if (ref^.index <> NR_NO) and
(getregtype(ref^.index)=regtype) then
try_replace_reg(regs, ref^.index,
not ssa_safe or (instr.spilling_get_operation_type_ref(opidx, ref^.index)=operand_read));
{$if defined(x86)}
if (ref^.segment <> NR_NO) and
(getregtype(ref^.segment)=regtype) then
try_replace_reg(regs, ref^.segment, true { always read-only });
{$endif defined(x86)}
end;
end;
{$ifdef ARM}
top_shifterop:
begin
if regtype in [R_INTREGISTER, R_ADDRESSREGISTER] then
try_replace_reg(regs, shifterop^.rs, true { always read-only });
end;
{$endif ARM}
else
;
end;
end;
function trgobj.instr_spill_register(list:TAsmList;
instr:tai_cpu_abstract_sym;
const r:Tsuperregisterset;
const spilltemplist:Tspill_temp_list): boolean;
var
counter: longint;
regs: tspillregsinfo;
spilled: boolean;
var
loadpos,
storepos : tai;
oldlive_registers : tsuperregisterworklist;
begin
result := false;
fillchar(regs,sizeof(regs),0);
for counter := low(regs.reginfo) to high(regs.reginfo) do
begin
regs.reginfo[counter].orgreg := RS_INVALID;
regs.reginfo[counter].loadreg := NR_INVALID;
regs.reginfo[counter].storereg := NR_INVALID;
end;
spilled := false;
{ check whether and if so which and how (read/written) this instructions contains
registers that must be spilled }
for counter := 0 to instr.ops-1 do
spilled:=instr_get_oper_spilling_info(regs,r,instr,counter) or spilled;
{ if no spilling for this instruction we can leave }
if not spilled then
exit;
{$if defined(x86) or defined(mips) or defined(sparcgen) or defined(arm) or defined(m68k)}
{ Try replacing the register with the spilltemp. This is useful only
for the i386,x86_64 that support memory locations for several instructions
For non-x86 it is nevertheless possible to replace moves to/from the register
with loads/stores to spilltemp (Sergei) }
for counter := 0 to pred(regs.reginfocount) do
with regs.reginfo[counter] do
begin
if mustbespilled then
begin
if do_spill_replace(list,instr,orgreg,spilltemplist[orgreg]) then
mustbespilled:=false;
end;
end;
{$endif defined(x86) or defined(mips) or defined(sparcgen) or defined(arm) or defined(m68k)}
{
There are registers that need are spilled. We generate the
following code for it. The used positions where code need
to be inserted are marked using #. Note that code is always inserted
before the positions using pos.previous. This way the position is always
the same since pos doesn't change, but pos.previous is modified everytime
new code is inserted.
[
- reg_allocs load spills
- load spills
]
[#loadpos
- reg_deallocs
- reg_allocs
]
[
- reg_deallocs for load-only spills
- reg_allocs for store-only spills
]
[#instr
- original instruction
]
[
- store spills
- reg_deallocs store spills
]
[#storepos
]
}
result := true;
oldlive_registers.copyfrom(live_registers);
{ Process all tai_regallocs belonging to this instruction, ignore explicit
inserted regallocs. These can happend for example in i386:
mov ref,ireg26
<regdealloc ireg26, instr=taicpu of lea>
<regalloc edi, insrt=nil>
lea [ireg26+ireg17],edi
All released registers are also added to the live_registers because
they can't be used during the spilling }
loadpos:=tai(instr.previous);
while assigned(loadpos) and
(loadpos.typ=ait_regalloc) and
((tai_regalloc(loadpos).instr=nil) or
(tai_regalloc(loadpos).instr=instr)) do
begin
{ Only add deallocs belonging to the instruction. Explicit inserted deallocs
belong to the previous instruction and not the current instruction }
if (tai_regalloc(loadpos).instr=instr) and
(tai_regalloc(loadpos).ratype=ra_dealloc) then
live_registers.add(getsupreg(tai_regalloc(loadpos).reg));
loadpos:=tai(loadpos.previous);
end;
loadpos:=tai(loadpos.next);
{ Load the spilled registers }
for counter := 0 to pred(regs.reginfocount) do
with regs.reginfo[counter] do
begin
if mustbespilled and regread then
begin
loadreg:=getregisterinline(list,regs.reginfo[counter].spillregconstraints);
do_spill_read(list,tai(loadpos.previous),spilltemplist[orgreg],loadreg,orgreg);
include(reginfo[getsupreg(loadreg)].flags,ri_spill_read);
end;
end;
{ Release temp registers of read-only registers, and add reference of the instruction
to the reginfo }
for counter := 0 to pred(regs.reginfocount) do
with regs.reginfo[counter] do
begin
if mustbespilled and regread and
(ssa_safe or
not regwritten) then
begin
{ The original instruction will be the next that uses this register
set weigth of the newly allocated register higher than the old one,
so it will selected for spilling with a lower priority than
the original one, this prevents an endless spilling loop if orgreg
is short living, see e.g. tw25164.pp }
add_reg_instruction(instr,loadreg,reginfo[orgreg].weight+1);
ungetregisterinline(list,loadreg);
end;
end;
{ Allocate temp registers of write-only registers, and add reference of the instruction
to the reginfo }
for counter := 0 to pred(regs.reginfocount) do
with regs.reginfo[counter] do
begin
if mustbespilled and regwritten then
begin
{ When the register is also loaded there is already a register assigned }
if (not regread) or
ssa_safe then
begin
storereg:=getregisterinline(list,regs.reginfo[counter].spillregconstraints);
{ we also use loadreg for store replacements in case we
don't have ensure ssa -> initialise loadreg even if
there are no reads }
if not regread then
loadreg:=storereg;
end
else
storereg:=loadreg;
{ The original instruction will be the next that uses this register, this
also needs to be done for read-write registers,
set weigth of the newly allocated register higher than the old one,
so it will selected for spilling with a lower priority than
the original one, this prevents an endless spilling loop if orgreg
is short living, see e.g. tw25164.pp }
add_reg_instruction(instr,storereg,reginfo[orgreg].weight+1);
end;
end;
{ store the spilled registers }
if not assigned(instr.next) then
list.concat(tai_marker.Create(mark_Position));
storepos:=tai(instr.next);
for counter := 0 to pred(regs.reginfocount) do
with regs.reginfo[counter] do
begin
if mustbespilled and regwritten then
begin
do_spill_written(list,tai(storepos.previous),spilltemplist[orgreg],storereg,orgreg);
ungetregisterinline(list,storereg);
end;
end;
{ now all spilling code is generated we can restore the live registers. This
must be done after the store because the store can need an extra register
that also needs to conflict with the registers of the instruction }
live_registers.done;
live_registers:=oldlive_registers;
{ substitute registers }
for counter:=0 to instr.ops-1 do
substitute_spilled_registers(regs,instr,counter);
{ We have modified the instruction; perhaps the new instruction has
certain constraints regarding which imaginary registers interfere
with certain physical registers. }
add_cpu_interferences(instr);
end;
{$ifdef DEBUG_SPILLCOALESCE}
procedure trgobj.write_spill_stats;
{ This procedure outputs spilling statistincs.
If no spilling has occurred, no output is provided.
NUM is the number of spilled registers.
EFF is efficiency of the spilling which is based on
weight and usage count of registers. Range 0-100%.
0% means all imaginary registers have been spilled.
100% means no imaginary registers have been spilled
(no output in this case).
Higher value is better.
}
var
i,spillingcounter,max_weight:longint;
all_weight,spill_weight,d: double;
begin
max_weight:=1;
for i:=first_imaginary to maxreg-1 do
with reginfo[i] do
if weight>max_weight then
max_weight:=weight;
spillingcounter:=0;
spill_weight:=0;
all_weight:=0;
for i:=first_imaginary to maxreg-1 do
with reginfo[i] do
begin
d:=weight/max_weight;
all_weight:=all_weight+d;
if (weight>100) and
(i<=high(spillinfo)) and
spillinfo[i].spilled then
begin
inc(spillingcounter);
spill_weight:=spill_weight+d;
end;
end;
if spillingcounter>0 then
begin
d:=(1.0-spill_weight/all_weight)*100.0;
writeln(current_procinfo.procdef.mangledname,' [',regtype,']: spill stats: NUM: ',spillingcounter, ', EFF: ',d:4:1,'%');
end;
end;
{$endif DEBUG_SPILLCOALESCE}
end.
|