Work at SourceForge, help us to make it a better place! We have an immediate need for a Support Technician in our San Francisco or Denver office.

Close

[debae3]: src / runtime / gc-common.c Maximize Restore History

Download this file

gc-common.c    3034 lines (2579 with data), 93.6 kB

   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
/*
* Garbage Collection common functions for scavenging, moving and sizing
* objects. These are for use with both GC (stop & copy GC) and GENCGC
*/
/*
* This software is part of the SBCL system. See the README file for
* more information.
*
* This software is derived from the CMU CL system, which was
* written at Carnegie Mellon University and released into the
* public domain. The software is in the public domain and is
* provided with absolutely no warranty. See the COPYING and CREDITS
* files for more information.
*/
/*
* For a review of garbage collection techniques (e.g. generational
* GC) and terminology (e.g. "scavenging") see Paul R. Wilson,
* "Uniprocessor Garbage Collection Techniques". As of 20000618, this
* had been accepted for _ACM Computing Surveys_ and was available
* as a PostScript preprint through
* <http://www.cs.utexas.edu/users/oops/papers.html>
* as
* <ftp://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps>.
*/
#include <stdio.h>
#include <signal.h>
#include <string.h>
#include "sbcl.h"
#include "runtime.h"
#include "os.h"
#include "interr.h"
#include "globals.h"
#include "interrupt.h"
#include "validate.h"
#include "lispregs.h"
#include "arch.h"
#include "gc.h"
#include "genesis/primitive-objects.h"
#include "genesis/static-symbols.h"
#include "genesis/layout.h"
#include "genesis/hash-table.h"
#include "gc-internal.h"
#ifdef LISP_FEATURE_SPARC
#define LONG_FLOAT_SIZE 4
#else
#ifdef LISP_FEATURE_X86
#define LONG_FLOAT_SIZE 3
#endif
#endif
os_vm_size_t dynamic_space_size = DEFAULT_DYNAMIC_SPACE_SIZE;
os_vm_size_t thread_control_stack_size = DEFAULT_CONTROL_STACK_SIZE;
inline static boolean
forwarding_pointer_p(lispobj *pointer) {
lispobj first_word=*pointer;
#ifdef LISP_FEATURE_GENCGC
return (first_word == 0x01);
#else
return (is_lisp_pointer(first_word)
&& new_space_p(first_word));
#endif
}
static inline lispobj *
forwarding_pointer_value(lispobj *pointer) {
#ifdef LISP_FEATURE_GENCGC
return (lispobj *) ((pointer_sized_uint_t) pointer[1]);
#else
return (lispobj *) ((pointer_sized_uint_t) pointer[0]);
#endif
}
static inline lispobj
set_forwarding_pointer(lispobj * pointer, lispobj newspace_copy) {
#ifdef LISP_FEATURE_GENCGC
pointer[0]=0x01;
pointer[1]=newspace_copy;
#else
pointer[0]=newspace_copy;
#endif
return newspace_copy;
}
sword_t (*scavtab[256])(lispobj *where, lispobj object);
lispobj (*transother[256])(lispobj object);
sword_t (*sizetab[256])(lispobj *where);
struct weak_pointer *weak_pointers;
os_vm_size_t bytes_consed_between_gcs = 12*1024*1024;
/*
* copying objects
*/
/* gc_general_copy_object is inline from gc-internal.h */
/* to copy a boxed object */
lispobj
copy_object(lispobj object, sword_t nwords)
{
return gc_general_copy_object(object, nwords, BOXED_PAGE_FLAG);
}
lispobj
copy_code_object(lispobj object, sword_t nwords)
{
return gc_general_copy_object(object, nwords, CODE_PAGE_FLAG);
}
static sword_t scav_lose(lispobj *where, lispobj object); /* forward decl */
/* FIXME: Most calls end up going to some trouble to compute an
* 'n_words' value for this function. The system might be a little
* simpler if this function used an 'end' parameter instead. */
void
scavenge(lispobj *start, sword_t n_words)
{
lispobj *end = start + n_words;
lispobj *object_ptr;
for (object_ptr = start; object_ptr < end;) {
lispobj object = *object_ptr;
#ifdef LISP_FEATURE_GENCGC
if (forwarding_pointer_p(object_ptr))
lose("unexpect forwarding pointer in scavenge: %p, start=%p, n=%l\n",
object_ptr, start, n_words);
#endif
if (is_lisp_pointer(object)) {
if (from_space_p(object)) {
/* It currently points to old space. Check for a
* forwarding pointer. */
lispobj *ptr = native_pointer(object);
if (forwarding_pointer_p(ptr)) {
/* Yes, there's a forwarding pointer. */
*object_ptr = LOW_WORD(forwarding_pointer_value(ptr));
object_ptr++;
} else {
/* Scavenge that pointer. */
object_ptr +=
(scavtab[widetag_of(object)])(object_ptr, object);
}
} else {
/* It points somewhere other than oldspace. Leave it
* alone. */
object_ptr++;
}
}
#if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
/* This workaround is probably not needed for those ports
which don't have a partitioned register set (and therefore
scan the stack conservatively for roots). */
else if (n_words == 1) {
/* there are some situations where an other-immediate may
end up in a descriptor register. I'm not sure whether
this is supposed to happen, but if it does then we
don't want to (a) barf or (b) scavenge over the
data-block, because there isn't one. So, if we're
checking a single word and it's anything other than a
pointer, just hush it up */
int widetag = widetag_of(object);
if ((scavtab[widetag] == scav_lose) ||
(((sizetab[widetag])(object_ptr)) > 1)) {
fprintf(stderr,"warning: \
attempted to scavenge non-descriptor value %x at %p.\n\n\
If you can reproduce this warning, please send a bug report\n\
(see manual page for details).\n",
object, object_ptr);
}
object_ptr++;
}
#endif
else if (fixnump(object)) {
/* It's a fixnum: really easy.. */
object_ptr++;
} else {
/* It's some sort of header object or another. */
object_ptr += (scavtab[widetag_of(object)])(object_ptr, object);
}
}
gc_assert_verbose(object_ptr == end, "Final object pointer %p, start %p, end %p\n",
object_ptr, start, end);
}
static lispobj trans_fun_header(lispobj object); /* forward decls */
static lispobj trans_boxed(lispobj object);
static sword_t
scav_fun_pointer(lispobj *where, lispobj object)
{
lispobj *first_pointer;
lispobj copy;
gc_assert(is_lisp_pointer(object));
/* Object is a pointer into from_space - not a FP. */
first_pointer = (lispobj *) native_pointer(object);
/* must transport object -- object may point to either a function
* header, a closure function header, or to a closure header. */
switch (widetag_of(*first_pointer)) {
case SIMPLE_FUN_HEADER_WIDETAG:
copy = trans_fun_header(object);
break;
default:
copy = trans_boxed(object);
break;
}
if (copy != object) {
/* Set forwarding pointer */
set_forwarding_pointer(first_pointer,copy);
}
gc_assert(is_lisp_pointer(copy));
gc_assert(!from_space_p(copy));
*where = copy;
return 1;
}
static struct code *
trans_code(struct code *code)
{
struct code *new_code;
lispobj first, l_code, l_new_code;
uword_t nheader_words, ncode_words, nwords;
uword_t displacement;
lispobj fheaderl, *prev_pointer;
/* if object has already been transported, just return pointer */
first = code->header;
if (forwarding_pointer_p((lispobj *)code)) {
#ifdef DEBUG_CODE_GC
printf("Was already transported\n");
#endif
return (struct code *) forwarding_pointer_value
((lispobj *)((pointer_sized_uint_t) code));
}
gc_assert(widetag_of(first) == CODE_HEADER_WIDETAG);
/* prepare to transport the code vector */
l_code = (lispobj) LOW_WORD(code) | OTHER_POINTER_LOWTAG;
ncode_words = fixnum_value(code->code_size);
nheader_words = HeaderValue(code->header);
nwords = ncode_words + nheader_words;
nwords = CEILING(nwords, 2);
l_new_code = copy_code_object(l_code, nwords);
new_code = (struct code *) native_pointer(l_new_code);
#if defined(DEBUG_CODE_GC)
printf("Old code object at 0x%08x, new code object at 0x%08x.\n",
(uword_t) code, (uword_t) new_code);
printf("Code object is %d words long.\n", nwords);
#endif
#ifdef LISP_FEATURE_GENCGC
if (new_code == code)
return new_code;
#endif
displacement = l_new_code - l_code;
set_forwarding_pointer((lispobj *)code, l_new_code);
/* set forwarding pointers for all the function headers in the */
/* code object. also fix all self pointers */
fheaderl = code->entry_points;
prev_pointer = &new_code->entry_points;
while (fheaderl != NIL) {
struct simple_fun *fheaderp, *nfheaderp;
lispobj nfheaderl;
fheaderp = (struct simple_fun *) native_pointer(fheaderl);
gc_assert(widetag_of(fheaderp->header) == SIMPLE_FUN_HEADER_WIDETAG);
/* Calculate the new function pointer and the new */
/* function header. */
nfheaderl = fheaderl + displacement;
nfheaderp = (struct simple_fun *) native_pointer(nfheaderl);
#ifdef DEBUG_CODE_GC
printf("fheaderp->header (at %x) <- %x\n",
&(fheaderp->header) , nfheaderl);
#endif
set_forwarding_pointer((lispobj *)fheaderp, nfheaderl);
/* fix self pointer. */
nfheaderp->self =
#if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
FUN_RAW_ADDR_OFFSET +
#endif
nfheaderl;
*prev_pointer = nfheaderl;
fheaderl = fheaderp->next;
prev_pointer = &nfheaderp->next;
}
#ifdef LISP_FEATURE_GENCGC
/* Cheneygc doesn't need this os_flush_icache, it flushes the whole
spaces once when all copying is done. */
os_flush_icache((os_vm_address_t) (((sword_t *)new_code) + nheader_words),
ncode_words * sizeof(sword_t));
#endif
#ifdef LISP_FEATURE_X86
gencgc_apply_code_fixups(code, new_code);
#endif
return new_code;
}
static sword_t
scav_code_header(lispobj *where, lispobj object)
{
struct code *code;
sword_t n_header_words, n_code_words, n_words;
lispobj entry_point; /* tagged pointer to entry point */
struct simple_fun *function_ptr; /* untagged pointer to entry point */
code = (struct code *) where;
n_code_words = fixnum_value(code->code_size);
n_header_words = HeaderValue(object);
n_words = n_code_words + n_header_words;
n_words = CEILING(n_words, 2);
/* Scavenge the boxed section of the code data block. */
scavenge(where + 1, n_header_words - 1);
/* Scavenge the boxed section of each function object in the
* code data block. */
for (entry_point = code->entry_points;
entry_point != NIL;
entry_point = function_ptr->next) {
gc_assert_verbose(is_lisp_pointer(entry_point),
"Entry point %lx\n is not a lisp pointer.",
(sword_t)entry_point);
function_ptr = (struct simple_fun *) native_pointer(entry_point);
gc_assert(widetag_of(function_ptr->header)==SIMPLE_FUN_HEADER_WIDETAG);
scavenge(&function_ptr->name, 1);
scavenge(&function_ptr->arglist, 1);
scavenge(&function_ptr->type, 1);
scavenge(&function_ptr->info, 1);
}
return n_words;
}
static lispobj
trans_code_header(lispobj object)
{
struct code *ncode;
ncode = trans_code((struct code *) native_pointer(object));
return (lispobj) LOW_WORD(ncode) | OTHER_POINTER_LOWTAG;
}
static sword_t
size_code_header(lispobj *where)
{
struct code *code;
sword_t nheader_words, ncode_words, nwords;
code = (struct code *) where;
ncode_words = fixnum_value(code->code_size);
nheader_words = HeaderValue(code->header);
nwords = ncode_words + nheader_words;
nwords = CEILING(nwords, 2);
return nwords;
}
#if !defined(LISP_FEATURE_X86) && ! defined(LISP_FEATURE_X86_64)
static sword_t
scav_return_pc_header(lispobj *where, lispobj object)
{
lose("attempted to scavenge a return PC header where=0x%08x object=0x%08x\n",
(uword_t) where,
(uword_t) object);
return 0; /* bogus return value to satisfy static type checking */
}
#endif /* LISP_FEATURE_X86 */
static lispobj
trans_return_pc_header(lispobj object)
{
struct simple_fun *return_pc;
uword_t offset;
struct code *code, *ncode;
return_pc = (struct simple_fun *) native_pointer(object);
/* FIXME: was times 4, should it really be N_WORD_BYTES? */
offset = HeaderValue(return_pc->header) * N_WORD_BYTES;
/* Transport the whole code object */
code = (struct code *) ((uword_t) return_pc - offset);
ncode = trans_code(code);
return ((lispobj) LOW_WORD(ncode) + offset) | OTHER_POINTER_LOWTAG;
}
/* On the 386, closures hold a pointer to the raw address instead of the
* function object, so we can use CALL [$FDEFN+const] to invoke
* the function without loading it into a register. Given that code
* objects don't move, we don't need to update anything, but we do
* have to figure out that the function is still live. */
#if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
static sword_t
scav_closure_header(lispobj *where, lispobj object)
{
struct closure *closure;
lispobj fun;
closure = (struct closure *)where;
fun = closure->fun - FUN_RAW_ADDR_OFFSET;
scavenge(&fun, 1);
#ifdef LISP_FEATURE_GENCGC
/* The function may have moved so update the raw address. But
* don't write unnecessarily. */
if (closure->fun != fun + FUN_RAW_ADDR_OFFSET)
closure->fun = fun + FUN_RAW_ADDR_OFFSET;
#endif
return 2;
}
#endif
#if !(defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64))
static sword_t
scav_fun_header(lispobj *where, lispobj object)
{
lose("attempted to scavenge a function header where=0x%08x object=0x%08x\n",
(uword_t) where,
(uword_t) object);
return 0; /* bogus return value to satisfy static type checking */
}
#endif /* LISP_FEATURE_X86 */
static lispobj
trans_fun_header(lispobj object)
{
struct simple_fun *fheader;
uword_t offset;
struct code *code, *ncode;
fheader = (struct simple_fun *) native_pointer(object);
/* FIXME: was times 4, should it really be N_WORD_BYTES? */
offset = HeaderValue(fheader->header) * N_WORD_BYTES;
/* Transport the whole code object */
code = (struct code *) ((uword_t) fheader - offset);
ncode = trans_code(code);
return ((lispobj) LOW_WORD(ncode) + offset) | FUN_POINTER_LOWTAG;
}
/*
* instances
*/
static sword_t
scav_instance_pointer(lispobj *where, lispobj object)
{
lispobj copy, *first_pointer;
/* Object is a pointer into from space - not a FP. */
copy = trans_boxed(object);
#ifdef LISP_FEATURE_GENCGC
gc_assert(copy != object);
#endif
first_pointer = (lispobj *) native_pointer(object);
set_forwarding_pointer(first_pointer,copy);
*where = copy;
return 1;
}
/*
* lists and conses
*/
static lispobj trans_list(lispobj object);
static sword_t
scav_list_pointer(lispobj *where, lispobj object)
{
lispobj first, *first_pointer;
gc_assert(is_lisp_pointer(object));
/* Object is a pointer into from space - not FP. */
first_pointer = (lispobj *) native_pointer(object);
first = trans_list(object);
gc_assert(first != object);
/* Set forwarding pointer */
set_forwarding_pointer(first_pointer, first);
gc_assert(is_lisp_pointer(first));
gc_assert(!from_space_p(first));
*where = first;
return 1;
}
static lispobj
trans_list(lispobj object)
{
lispobj new_list_pointer;
struct cons *cons, *new_cons;
lispobj cdr;
cons = (struct cons *) native_pointer(object);
/* Copy 'object'. */
new_cons = (struct cons *)
gc_general_alloc(sizeof(struct cons), BOXED_PAGE_FLAG, ALLOC_QUICK);
new_cons->car = cons->car;
new_cons->cdr = cons->cdr; /* updated later */
new_list_pointer = make_lispobj(new_cons,lowtag_of(object));
/* Grab the cdr: set_forwarding_pointer will clobber it in GENCGC */
cdr = cons->cdr;
set_forwarding_pointer((lispobj *)cons, new_list_pointer);
/* Try to linearize the list in the cdr direction to help reduce
* paging. */
while (1) {
lispobj new_cdr;
struct cons *cdr_cons, *new_cdr_cons;
if(lowtag_of(cdr) != LIST_POINTER_LOWTAG ||
!from_space_p(cdr) ||
forwarding_pointer_p((lispobj *)native_pointer(cdr)))
break;
cdr_cons = (struct cons *) native_pointer(cdr);
/* Copy 'cdr'. */
new_cdr_cons = (struct cons*)
gc_general_alloc(sizeof(struct cons), BOXED_PAGE_FLAG, ALLOC_QUICK);
new_cdr_cons->car = cdr_cons->car;
new_cdr_cons->cdr = cdr_cons->cdr;
new_cdr = make_lispobj(new_cdr_cons, lowtag_of(cdr));
/* Grab the cdr before it is clobbered. */
cdr = cdr_cons->cdr;
set_forwarding_pointer((lispobj *)cdr_cons, new_cdr);
/* Update the cdr of the last cons copied into new space to
* keep the newspace scavenge from having to do it. */
new_cons->cdr = new_cdr;
new_cons = new_cdr_cons;
}
return new_list_pointer;
}
/*
* scavenging and transporting other pointers
*/
static sword_t
scav_other_pointer(lispobj *where, lispobj object)
{
lispobj first, *first_pointer;
gc_assert(is_lisp_pointer(object));
/* Object is a pointer into from space - not FP. */
first_pointer = (lispobj *) native_pointer(object);
first = (transother[widetag_of(*first_pointer)])(object);
if (first != object) {
set_forwarding_pointer(first_pointer, first);
#ifdef LISP_FEATURE_GENCGC
*where = first;
#endif
}
#ifndef LISP_FEATURE_GENCGC
*where = first;
#endif
gc_assert(is_lisp_pointer(first));
gc_assert(!from_space_p(first));
return 1;
}
/*
* immediate, boxed, and unboxed objects
*/
static sword_t
size_pointer(lispobj *where)
{
return 1;
}
static sword_t
scav_immediate(lispobj *where, lispobj object)
{
return 1;
}
static lispobj
trans_immediate(lispobj object)
{
lose("trying to transport an immediate\n");
return NIL; /* bogus return value to satisfy static type checking */
}
static sword_t
size_immediate(lispobj *where)
{
return 1;
}
static sword_t
scav_boxed(lispobj *where, lispobj object)
{
return 1;
}
static sword_t
scav_instance(lispobj *where, lispobj object)
{
lispobj nuntagged;
sword_t ntotal = HeaderValue(object);
lispobj layout = ((struct instance *)where)->slots[0];
if (!layout)
return 1;
if (forwarding_pointer_p(native_pointer(layout)))
layout = (lispobj) forwarding_pointer_value(native_pointer(layout));
nuntagged = ((struct layout *)native_pointer(layout))->n_untagged_slots;
scavenge(where + 1, ntotal - fixnum_value(nuntagged));
return ntotal + 1;
}
static lispobj
trans_boxed(lispobj object)
{
lispobj header;
uword_t length;
gc_assert(is_lisp_pointer(object));
header = *((lispobj *) native_pointer(object));
length = HeaderValue(header) + 1;
length = CEILING(length, 2);
return copy_object(object, length);
}
static sword_t
size_boxed(lispobj *where)
{
lispobj header;
uword_t length;
header = *where;
length = HeaderValue(header) + 1;
length = CEILING(length, 2);
return length;
}
/* Note: on the sparc we don't have to do anything special for fdefns, */
/* 'cause the raw-addr has a function lowtag. */
#if !defined(LISP_FEATURE_SPARC)
static sword_t
scav_fdefn(lispobj *where, lispobj object)
{
struct fdefn *fdefn;
fdefn = (struct fdefn *)where;
/* FSHOW((stderr, "scav_fdefn, function = %p, raw_addr = %p\n",
fdefn->fun, fdefn->raw_addr)); */
if ((char *)(fdefn->fun + FUN_RAW_ADDR_OFFSET) == fdefn->raw_addr) {
scavenge(where + 1, sizeof(struct fdefn)/sizeof(lispobj) - 1);
/* Don't write unnecessarily. */
if (fdefn->raw_addr != (char *)(fdefn->fun + FUN_RAW_ADDR_OFFSET))
fdefn->raw_addr = (char *)(fdefn->fun + FUN_RAW_ADDR_OFFSET);
/* gc.c has more casts here, which may be relevant or alternatively
may be compiler warning defeaters. try
fdefn->raw_addr = ((char *) LOW_WORD(fdefn->fun)) + FUN_RAW_ADDR_OFFSET;
*/
return sizeof(struct fdefn) / sizeof(lispobj);
} else {
return 1;
}
}
#endif
static sword_t
scav_unboxed(lispobj *where, lispobj object)
{
uword_t length;
length = HeaderValue(object) + 1;
length = CEILING(length, 2);
return length;
}
static lispobj
trans_unboxed(lispobj object)
{
lispobj header;
uword_t length;
gc_assert(is_lisp_pointer(object));
header = *((lispobj *) native_pointer(object));
length = HeaderValue(header) + 1;
length = CEILING(length, 2);
return copy_unboxed_object(object, length);
}
static sword_t
size_unboxed(lispobj *where)
{
lispobj header;
uword_t length;
header = *where;
length = HeaderValue(header) + 1;
length = CEILING(length, 2);
return length;
}
/* vector-like objects */
static sword_t
scav_base_string(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
/* NOTE: Strings contain one more byte of data than the length */
/* slot indicates. */
vector = (struct vector *) where;
length = fixnum_value(vector->length) + 1;
nwords = CEILING(NWORDS(length, 8) + 2, 2);
return nwords;
}
static lispobj
trans_base_string(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
/* NOTE: A string contains one more byte of data (a terminating
* '\0' to help when interfacing with C functions) than indicated
* by the length slot. */
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length) + 1;
nwords = CEILING(NWORDS(length, 8) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_base_string(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
/* NOTE: A string contains one more byte of data (a terminating
* '\0' to help when interfacing with C functions) than indicated
* by the length slot. */
vector = (struct vector *) where;
length = fixnum_value(vector->length) + 1;
nwords = CEILING(NWORDS(length, 8) + 2, 2);
return nwords;
}
static sword_t
scav_character_string(lispobj *where, lispobj object)
{
struct vector *vector;
int length, nwords;
/* NOTE: Strings contain one more byte of data than the length */
/* slot indicates. */
vector = (struct vector *) where;
length = fixnum_value(vector->length) + 1;
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return nwords;
}
static lispobj
trans_character_string(lispobj object)
{
struct vector *vector;
int length, nwords;
gc_assert(is_lisp_pointer(object));
/* NOTE: A string contains one more byte of data (a terminating
* '\0' to help when interfacing with C functions) than indicated
* by the length slot. */
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length) + 1;
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_character_string(lispobj *where)
{
struct vector *vector;
int length, nwords;
/* NOTE: A string contains one more byte of data (a terminating
* '\0' to help when interfacing with C functions) than indicated
* by the length slot. */
vector = (struct vector *) where;
length = fixnum_value(vector->length) + 1;
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return nwords;
}
static lispobj
trans_vector(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(length + 2, 2);
return copy_large_object(object, nwords);
}
static sword_t
size_vector(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(length + 2, 2);
return nwords;
}
static sword_t
scav_vector_nil(lispobj *where, lispobj object)
{
return 2;
}
static lispobj
trans_vector_nil(lispobj object)
{
gc_assert(is_lisp_pointer(object));
return copy_unboxed_object(object, 2);
}
static sword_t
size_vector_nil(lispobj *where)
{
/* Just the header word and the length word */
return 2;
}
static sword_t
scav_vector_bit(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 1) + 2, 2);
return nwords;
}
static lispobj
trans_vector_bit(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 1) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_bit(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 1) + 2, 2);
return nwords;
}
static sword_t
scav_vector_unsigned_byte_2(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 2) + 2, 2);
return nwords;
}
static lispobj
trans_vector_unsigned_byte_2(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 2) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_unsigned_byte_2(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 2) + 2, 2);
return nwords;
}
static sword_t
scav_vector_unsigned_byte_4(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 4) + 2, 2);
return nwords;
}
static lispobj
trans_vector_unsigned_byte_4(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 4) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_unsigned_byte_4(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 4) + 2, 2);
return nwords;
}
static sword_t
scav_vector_unsigned_byte_8(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 8) + 2, 2);
return nwords;
}
/*********************/
static lispobj
trans_vector_unsigned_byte_8(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 8) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_unsigned_byte_8(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 8) + 2, 2);
return nwords;
}
static sword_t
scav_vector_unsigned_byte_16(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 16) + 2, 2);
return nwords;
}
static lispobj
trans_vector_unsigned_byte_16(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 16) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_unsigned_byte_16(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 16) + 2, 2);
return nwords;
}
static sword_t
scav_vector_unsigned_byte_32(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return nwords;
}
static lispobj
trans_vector_unsigned_byte_32(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_unsigned_byte_32(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return nwords;
}
#if N_WORD_BITS == 64
static sword_t
scav_vector_unsigned_byte_64(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return nwords;
}
static lispobj
trans_vector_unsigned_byte_64(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_unsigned_byte_64(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return nwords;
}
#endif
static sword_t
scav_vector_single_float(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return nwords;
}
static lispobj
trans_vector_single_float(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_single_float(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 32) + 2, 2);
return nwords;
}
static sword_t
scav_vector_double_float(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return nwords;
}
static lispobj
trans_vector_double_float(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_double_float(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return nwords;
}
#ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
static long
scav_vector_long_float(lispobj *where, lispobj object)
{
struct vector *vector;
long length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(length *
LONG_FLOAT_SIZE
+ 2, 2);
return nwords;
}
static lispobj
trans_vector_long_float(lispobj object)
{
struct vector *vector;
long length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(length * LONG_FLOAT_SIZE + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static long
size_vector_long_float(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(length * LONG_FLOAT_SIZE + 2, 2);
return nwords;
}
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
static sword_t
scav_vector_complex_single_float(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return nwords;
}
static lispobj
trans_vector_complex_single_float(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_complex_single_float(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 64) + 2, 2);
return nwords;
}
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
static sword_t
scav_vector_complex_double_float(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 128) + 2, 2);
return nwords;
}
static lispobj
trans_vector_complex_double_float(lispobj object)
{
struct vector *vector;
sword_t length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 128) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static sword_t
size_vector_complex_double_float(lispobj *where)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(NWORDS(length, 128) + 2, 2);
return nwords;
}
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
static long
scav_vector_complex_long_float(lispobj *where, lispobj object)
{
struct vector *vector;
sword_t length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(length * (2* LONG_FLOAT_SIZE) + 2, 2);
return nwords;
}
static lispobj
trans_vector_complex_long_float(lispobj object)
{
struct vector *vector;
long length, nwords;
gc_assert(is_lisp_pointer(object));
vector = (struct vector *) native_pointer(object);
length = fixnum_value(vector->length);
nwords = CEILING(length * (2*LONG_FLOAT_SIZE) + 2, 2);
return copy_large_unboxed_object(object, nwords);
}
static long
size_vector_complex_long_float(lispobj *where)
{
struct vector *vector;
long length, nwords;
vector = (struct vector *) where;
length = fixnum_value(vector->length);
nwords = CEILING(length * (2*LONG_FLOAT_SIZE) + 2, 2);
return nwords;
}
#endif
#define WEAK_POINTER_NWORDS \
CEILING((sizeof(struct weak_pointer) / sizeof(lispobj)), 2)
static lispobj
trans_weak_pointer(lispobj object)
{
lispobj copy;
#ifndef LISP_FEATURE_GENCGC
struct weak_pointer *wp;
#endif
gc_assert(is_lisp_pointer(object));
#if defined(DEBUG_WEAK)
printf("Transporting weak pointer from 0x%08x\n", object);
#endif
/* Need to remember where all the weak pointers are that have */
/* been transported so they can be fixed up in a post-GC pass. */
copy = copy_object(object, WEAK_POINTER_NWORDS);
#ifndef LISP_FEATURE_GENCGC
wp = (struct weak_pointer *) native_pointer(copy);
gc_assert(widetag_of(wp->header)==WEAK_POINTER_WIDETAG);
/* Push the weak pointer onto the list of weak pointers. */
wp->next = (struct weak_pointer *)LOW_WORD(weak_pointers);
weak_pointers = wp;
#endif
return copy;
}
static sword_t
size_weak_pointer(lispobj *where)
{
return WEAK_POINTER_NWORDS;
}
void scan_weak_pointers(void)
{
struct weak_pointer *wp, *next_wp;
for (wp = weak_pointers, next_wp = NULL; wp != NULL; wp = next_wp) {
lispobj value = wp->value;
lispobj *first_pointer;
gc_assert(widetag_of(wp->header)==WEAK_POINTER_WIDETAG);
next_wp = wp->next;
wp->next = NULL;
if (next_wp == wp) /* gencgc uses a ref to self for end of list */
next_wp = NULL;
if (!(is_lisp_pointer(value) && from_space_p(value)))
continue;
/* Now, we need to check whether the object has been forwarded. If
* it has been, the weak pointer is still good and needs to be
* updated. Otherwise, the weak pointer needs to be nil'ed
* out. */
first_pointer = (lispobj *)native_pointer(value);
if (forwarding_pointer_p(first_pointer)) {
wp->value=
(lispobj)LOW_WORD(forwarding_pointer_value(first_pointer));
} else {
/* Break it. */
wp->value = NIL;
wp->broken = T;
}
}
}
/* Hash tables */
#if N_WORD_BITS == 32
#define EQ_HASH_MASK 0x1fffffff
#elif N_WORD_BITS == 64
#define EQ_HASH_MASK 0x1fffffffffffffff
#endif
/* Compute the EQ-hash of KEY. This must match POINTER-HASH in
* target-hash-table.lisp. */
#define EQ_HASH(key) ((key) & EQ_HASH_MASK)
/* List of weak hash tables chained through their NEXT-WEAK-HASH-TABLE
* slot. Set to NULL at the end of a collection.
*
* This is not optimal because, when a table is tenured, it won't be
* processed automatically; only the yougest generation is GC'd by
* default. On the other hand, all applications will need an
* occasional full GC anyway, so it's not that bad either. */
struct hash_table *weak_hash_tables = NULL;
/* Return true if OBJ has already survived the current GC. */
static inline int
survived_gc_yet (lispobj obj)
{
return (!is_lisp_pointer(obj) || !from_space_p(obj) ||
forwarding_pointer_p(native_pointer(obj)));
}
static inline int
weak_hash_entry_alivep (lispobj weakness, lispobj key, lispobj value)
{
switch (weakness) {
case KEY:
return survived_gc_yet(key);
case VALUE:
return survived_gc_yet(value);
case KEY_OR_VALUE:
return (survived_gc_yet(key) || survived_gc_yet(value));
case KEY_AND_VALUE:
return (survived_gc_yet(key) && survived_gc_yet(value));
default:
gc_assert(0);
/* Shut compiler up. */
return 0;
}
}
/* Return the beginning of data in ARRAY (skipping the header and the
* length) or NULL if it isn't an array of the specified widetag after
* all. */
static inline lispobj *
get_array_data (lispobj array, int widetag, uword_t *length)
{
if (is_lisp_pointer(array) &&
(widetag_of(*(lispobj *)native_pointer(array)) == widetag)) {
if (length != NULL)
*length = fixnum_value(((lispobj *)native_pointer(array))[1]);
return ((lispobj *)native_pointer(array)) + 2;
} else {
return NULL;
}
}
/* Only need to worry about scavenging the _real_ entries in the
* table. Phantom entries such as the hash table itself at index 0 and
* the empty marker at index 1 were scavenged by scav_vector that
* either called this function directly or arranged for it to be
* called later by pushing the hash table onto weak_hash_tables. */
static void
scav_hash_table_entries (struct hash_table *hash_table)
{
lispobj *kv_vector;
uword_t kv_length;
lispobj *index_vector;
uword_t length;
lispobj *next_vector;
uword_t next_vector_length;
lispobj *hash_vector;
uword_t hash_vector_length;
lispobj empty_symbol;
lispobj weakness = hash_table->weakness;
uword_t i;
kv_vector = get_array_data(hash_table->table,
SIMPLE_VECTOR_WIDETAG, &kv_length);
if (kv_vector == NULL)
lose("invalid kv_vector %x\n", hash_table->table);
index_vector = get_array_data(hash_table->index_vector,
SIMPLE_ARRAY_WORD_WIDETAG, &length);
if (index_vector == NULL)
lose("invalid index_vector %x\n", hash_table->index_vector);
next_vector = get_array_data(hash_table->next_vector,
SIMPLE_ARRAY_WORD_WIDETAG,
&next_vector_length);
if (next_vector == NULL)
lose("invalid next_vector %x\n", hash_table->next_vector);
hash_vector = get_array_data(hash_table->hash_vector,
SIMPLE_ARRAY_WORD_WIDETAG,
&hash_vector_length);
if (hash_vector != NULL)
gc_assert(hash_vector_length == next_vector_length);
/* These lengths could be different as the index_vector can be a
* different length from the others, a larger index_vector could
* help reduce collisions. */
gc_assert(next_vector_length*2 == kv_length);
empty_symbol = kv_vector[1];
/* fprintf(stderr,"* empty_symbol = %x\n", empty_symbol);*/
if (widetag_of(*(lispobj *)native_pointer(empty_symbol)) !=
SYMBOL_HEADER_WIDETAG) {
lose("not a symbol where empty-hash-table-slot symbol expected: %x\n",
*(lispobj *)native_pointer(empty_symbol));
}
/* Work through the KV vector. */
for (i = 1; i < next_vector_length; i++) {
lispobj old_key = kv_vector[2*i];
lispobj value = kv_vector[2*i+1];
if ((weakness == NIL) ||
weak_hash_entry_alivep(weakness, old_key, value)) {
/* Scavenge the key and value. */
scavenge(&kv_vector[2*i],2);
/* If an EQ-based key has moved, mark the hash-table for
* rehashing. */
if (!hash_vector || hash_vector[i] == MAGIC_HASH_VECTOR_VALUE) {
lispobj new_key = kv_vector[2*i];
if (old_key != new_key && new_key != empty_symbol) {
hash_table->needs_rehash_p = T;
}
}
}
}
}
sword_t
scav_vector (lispobj *where, lispobj object)
{
uword_t kv_length;
struct hash_table *hash_table;
/* SB-VM:VECTOR-VALID-HASHING-SUBTYPE is set for EQ-based and weak
* hash tables in the Lisp HASH-TABLE code to indicate need for
* special GC support. */
if (HeaderValue(object) == subtype_VectorNormal)
return 1;
kv_length = fixnum_value(where[1]);
/*FSHOW((stderr,"/kv_length = %d\n", kv_length));*/
/* Scavenge element 0, which may be a hash-table structure. */
scavenge(where+2, 1);
if (!is_lisp_pointer(where[2])) {
/* This'll happen when REHASH clears the header of old-kv-vector
* and fills it with zero, but some other thread simulatenously
* sets the header in %%PUTHASH.
*/
fprintf(stderr,
"Warning: no pointer at %p in hash table: this indicates "
"non-fatal corruption caused by concurrent access to a "
"hash-table from multiple threads. Any accesses to "
"hash-tables shared between threads should be protected "
"by locks.\n", (uword_t)&where[2]);
// We've scavenged three words.
return 3;
}
hash_table = (struct hash_table *)native_pointer(where[2]);
/*FSHOW((stderr,"/hash_table = %x\n", hash_table));*/
if (widetag_of(hash_table->header) != INSTANCE_HEADER_WIDETAG) {
lose("hash table not instance (%x at %x)\n",
hash_table->header,
hash_table);
}
/* Scavenge element 1, which should be some internal symbol that
* the hash table code reserves for marking empty slots. */
scavenge(where+3, 1);
if (!is_lisp_pointer(where[3])) {
lose("not empty-hash-table-slot symbol pointer: %x\n", where[3]);
}
/* Scavenge hash table, which will fix the positions of the other
* needed objects. */
scavenge((lispobj *)hash_table,
sizeof(struct hash_table) / sizeof(lispobj));
/* Cross-check the kv_vector. */
if (where != (lispobj *)native_pointer(hash_table->table)) {
lose("hash_table table!=this table %x\n", hash_table->table);
}
if (hash_table->weakness == NIL) {
scav_hash_table_entries(hash_table);
} else {
/* Delay scavenging of this table by pushing it onto
* weak_hash_tables (if it's not there already) for the weak
* object phase. */
if (hash_table->next_weak_hash_table == NIL) {
hash_table->next_weak_hash_table = (lispobj)weak_hash_tables;
weak_hash_tables = hash_table;
}
}
return (CEILING(kv_length + 2, 2));
}
void
scav_weak_hash_tables (void)
{
struct hash_table *table;
/* Scavenge entries whose triggers are known to survive. */
for (table = weak_hash_tables; table != NULL;
table = (struct hash_table *)table->next_weak_hash_table) {
scav_hash_table_entries(table);
}
}
/* Walk through the chain whose first element is *FIRST and remove
* dead weak entries. */
static inline void
scan_weak_hash_table_chain (struct hash_table *hash_table, lispobj *prev,
lispobj *kv_vector, lispobj *index_vector,
lispobj *next_vector, lispobj *hash_vector,
lispobj empty_symbol, lispobj weakness)
{
unsigned index = *prev;
while (index) {
unsigned next = next_vector[index];
lispobj key = kv_vector[2 * index];
lispobj value = kv_vector[2 * index + 1];
gc_assert(key != empty_symbol);
gc_assert(value != empty_symbol);
if (!weak_hash_entry_alivep(weakness, key, value)) {
unsigned count = fixnum_value(hash_table->number_entries);
gc_assert(count > 0);
*prev = next;
hash_table->number_entries = make_fixnum(count - 1);
next_vector[index] = fixnum_value(hash_table->next_free_kv);
hash_table->next_free_kv = make_fixnum(index);
kv_vector[2 * index] = empty_symbol;
kv_vector[2 * index + 1] = empty_symbol;
if (hash_vector)
hash_vector[index] = MAGIC_HASH_VECTOR_VALUE;
} else {
prev = &next_vector[index];
}
index = next;
}
}
static void
scan_weak_hash_table (struct hash_table *hash_table)
{
lispobj *kv_vector;
lispobj *index_vector;
uword_t length = 0; /* prevent warning */
lispobj *next_vector;
uword_t next_vector_length = 0; /* prevent warning */
lispobj *hash_vector;
lispobj empty_symbol;
lispobj weakness = hash_table->weakness;
uword_t i;
kv_vector = get_array_data(hash_table->table,
SIMPLE_VECTOR_WIDETAG, NULL);
index_vector = get_array_data(hash_table->index_vector,
SIMPLE_ARRAY_WORD_WIDETAG, &length);
next_vector = get_array_data(hash_table->next_vector,
SIMPLE_ARRAY_WORD_WIDETAG,
&next_vector_length);
hash_vector = get_array_data(hash_table->hash_vector,
SIMPLE_ARRAY_WORD_WIDETAG, NULL);
empty_symbol = kv_vector[1];
for (i = 0; i < length; i++) {
scan_weak_hash_table_chain(hash_table, &index_vector[i],
kv_vector, index_vector, next_vector,
hash_vector, empty_symbol, weakness);
}
}
/* Remove dead entries from weak hash tables. */
void
scan_weak_hash_tables (void)
{
struct hash_table *table, *next;
for (table = weak_hash_tables; table != NULL; table = next) {
next = (struct hash_table *)table->next_weak_hash_table;
table->next_weak_hash_table = NIL;
scan_weak_hash_table(table);
}
weak_hash_tables = NULL;
}
/*
* initialization
*/
static sword_t
scav_lose(lispobj *where, lispobj object)
{
lose("no scavenge function for object 0x%08x (widetag 0x%x)\n",
(uword_t)object,
widetag_of(*where));
return 0; /* bogus return value to satisfy static type checking */
}
static lispobj
trans_lose(lispobj object)
{
lose("no transport function for object 0x%08x (widetag 0x%x)\n",
(uword_t)object,
widetag_of(*(lispobj*)native_pointer(object)));
return NIL; /* bogus return value to satisfy static type checking */
}
static sword_t
size_lose(lispobj *where)
{
lose("no size function for object at 0x%08x (widetag 0x%x)\n",
(uword_t)where,
widetag_of(*where));
return 1; /* bogus return value to satisfy static type checking */
}
/*
* initialization
*/
void
gc_init_tables(void)
{
uword_t i, j;
/* Set default value in all slots of scavenge table. FIXME
* replace this gnarly sizeof with something based on
* N_WIDETAG_BITS */
for (i = 0; i < ((sizeof scavtab)/(sizeof scavtab[0])); i++) {
scavtab[i] = scav_lose;
}
/* For each type which can be selected by the lowtag alone, set
* multiple entries in our widetag scavenge table (one for each
* possible value of the high bits).
*/
for (i = 0; i < (1<<(N_WIDETAG_BITS-N_LOWTAG_BITS)); i++) {
for (j = 0; j < (1<<N_LOWTAG_BITS); j++) {
if (fixnump(j)) {
scavtab[j|(i<<N_LOWTAG_BITS)] = scav_immediate;
}
}
scavtab[FUN_POINTER_LOWTAG|(i<<N_LOWTAG_BITS)] = scav_fun_pointer;
/* skipping OTHER_IMMEDIATE_0_LOWTAG */
scavtab[LIST_POINTER_LOWTAG|(i<<N_LOWTAG_BITS)] = scav_list_pointer;
scavtab[INSTANCE_POINTER_LOWTAG|(i<<N_LOWTAG_BITS)] =
scav_instance_pointer;
/* skipping OTHER_IMMEDIATE_1_LOWTAG */
scavtab[OTHER_POINTER_LOWTAG|(i<<N_LOWTAG_BITS)] = scav_other_pointer;
}
/* Other-pointer types (those selected by all eight bits of the
* tag) get one entry each in the scavenge table. */
scavtab[BIGNUM_WIDETAG] = scav_unboxed;
scavtab[RATIO_WIDETAG] = scav_boxed;
#if N_WORD_BITS == 64
scavtab[SINGLE_FLOAT_WIDETAG] = scav_immediate;
#else
scavtab[SINGLE_FLOAT_WIDETAG] = scav_unboxed;
#endif
scavtab[DOUBLE_FLOAT_WIDETAG] = scav_unboxed;
#ifdef LONG_FLOAT_WIDETAG
scavtab[LONG_FLOAT_WIDETAG] = scav_unboxed;
#endif
scavtab[COMPLEX_WIDETAG] = scav_boxed;
#ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
scavtab[COMPLEX_SINGLE_FLOAT_WIDETAG] = scav_unboxed;
#endif
#ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
scavtab[COMPLEX_DOUBLE_FLOAT_WIDETAG] = scav_unboxed;
#endif
#ifdef COMPLEX_LONG_FLOAT_WIDETAG
scavtab[COMPLEX_LONG_FLOAT_WIDETAG] = scav_unboxed;
#endif
#ifdef SIMD_PACK_WIDETAG
scavtab[SIMD_PACK_WIDETAG] = scav_unboxed;
#endif
scavtab[SIMPLE_ARRAY_WIDETAG] = scav_boxed;
scavtab[SIMPLE_BASE_STRING_WIDETAG] = scav_base_string;
#ifdef SIMPLE_CHARACTER_STRING_WIDETAG
scavtab[SIMPLE_CHARACTER_STRING_WIDETAG] = scav_character_string;
#endif
scavtab[SIMPLE_BIT_VECTOR_WIDETAG] = scav_vector_bit;
scavtab[SIMPLE_ARRAY_NIL_WIDETAG] = scav_vector_nil;
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG] =
scav_vector_unsigned_byte_2;
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG] =
scav_vector_unsigned_byte_4;
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG] =
scav_vector_unsigned_byte_8;
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG] =
scav_vector_unsigned_byte_8;
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG] =
scav_vector_unsigned_byte_16;
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG] =
scav_vector_unsigned_byte_16;
#if (N_WORD_BITS == 32)
scavtab[SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG] =
scav_vector_unsigned_byte_32;
#endif
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG] =
scav_vector_unsigned_byte_32;
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG] =
scav_vector_unsigned_byte_32;
#if (N_WORD_BITS == 64)
scavtab[SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG] =
scav_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG] =
scav_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
scavtab[SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG] =
scav_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
scavtab[SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG] = scav_vector_unsigned_byte_8;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
scavtab[SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG] =
scav_vector_unsigned_byte_16;
#endif
#if (N_WORD_BITS == 32)
scavtab[SIMPLE_ARRAY_FIXNUM_WIDETAG] =
scav_vector_unsigned_byte_32;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
scavtab[SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG] =
scav_vector_unsigned_byte_32;
#endif
#if (N_WORD_BITS == 64)
scavtab[SIMPLE_ARRAY_FIXNUM_WIDETAG] =
scav_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
scavtab[SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG] =
scav_vector_unsigned_byte_64;
#endif
scavtab[SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG] = scav_vector_single_float;
scavtab[SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG] = scav_vector_double_float;
#ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
scavtab[SIMPLE_ARRAY_LONG_FLOAT_WIDETAG] = scav_vector_long_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
scavtab[SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG] =
scav_vector_complex_single_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
scavtab[SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG] =
scav_vector_complex_double_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
scavtab[SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG] =
scav_vector_complex_long_float;
#endif
scavtab[COMPLEX_BASE_STRING_WIDETAG] = scav_boxed;
#ifdef COMPLEX_CHARACTER_STRING_WIDETAG
scavtab[COMPLEX_CHARACTER_STRING_WIDETAG] = scav_boxed;
#endif
scavtab[COMPLEX_VECTOR_NIL_WIDETAG] = scav_boxed;
scavtab[COMPLEX_BIT_VECTOR_WIDETAG] = scav_boxed;
scavtab[COMPLEX_VECTOR_WIDETAG] = scav_boxed;
scavtab[COMPLEX_ARRAY_WIDETAG] = scav_boxed;
scavtab[CODE_HEADER_WIDETAG] = scav_code_header;
#if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
scavtab[SIMPLE_FUN_HEADER_WIDETAG] = scav_fun_header;
scavtab[RETURN_PC_HEADER_WIDETAG] = scav_return_pc_header;
#endif
scavtab[FUNCALLABLE_INSTANCE_HEADER_WIDETAG] = scav_boxed;
#if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
scavtab[CLOSURE_HEADER_WIDETAG] = scav_closure_header;
#else
scavtab[CLOSURE_HEADER_WIDETAG] = scav_boxed;
#endif
scavtab[VALUE_CELL_HEADER_WIDETAG] = scav_boxed;
scavtab[SYMBOL_HEADER_WIDETAG] = scav_boxed;
scavtab[CHARACTER_WIDETAG] = scav_immediate;
scavtab[SAP_WIDETAG] = scav_unboxed;
scavtab[UNBOUND_MARKER_WIDETAG] = scav_immediate;
scavtab[NO_TLS_VALUE_MARKER_WIDETAG] = scav_immediate;
scavtab[INSTANCE_HEADER_WIDETAG] = scav_instance;
#if defined(LISP_FEATURE_SPARC)
scavtab[FDEFN_WIDETAG] = scav_boxed;
#else
scavtab[FDEFN_WIDETAG] = scav_fdefn;
#endif
scavtab[SIMPLE_VECTOR_WIDETAG] = scav_vector;
/* transport other table, initialized same way as scavtab */
for (i = 0; i < ((sizeof transother)/(sizeof transother[0])); i++)
transother[i] = trans_lose;
transother[BIGNUM_WIDETAG] = trans_unboxed;
transother[RATIO_WIDETAG] = trans_boxed;
#if N_WORD_BITS == 64
transother[SINGLE_FLOAT_WIDETAG] = trans_immediate;
#else
transother[SINGLE_FLOAT_WIDETAG] = trans_unboxed;
#endif
transother[DOUBLE_FLOAT_WIDETAG] = trans_unboxed;
#ifdef LONG_FLOAT_WIDETAG
transother[LONG_FLOAT_WIDETAG] = trans_unboxed;
#endif
transother[COMPLEX_WIDETAG] = trans_boxed;
#ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
transother[COMPLEX_SINGLE_FLOAT_WIDETAG] = trans_unboxed;
#endif
#ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
transother[COMPLEX_DOUBLE_FLOAT_WIDETAG] = trans_unboxed;
#endif
#ifdef COMPLEX_LONG_FLOAT_WIDETAG
transother[COMPLEX_LONG_FLOAT_WIDETAG] = trans_unboxed;
#endif
transother[SIMPLE_ARRAY_WIDETAG] = trans_boxed; /* but not GENCGC */
transother[SIMPLE_BASE_STRING_WIDETAG] = trans_base_string;
#ifdef SIMPLE_CHARACTER_STRING_WIDETAG
transother[SIMPLE_CHARACTER_STRING_WIDETAG] = trans_character_string;
#endif
transother[SIMPLE_BIT_VECTOR_WIDETAG] = trans_vector_bit;
transother[SIMPLE_VECTOR_WIDETAG] = trans_vector;
transother[SIMPLE_ARRAY_NIL_WIDETAG] = trans_vector_nil;
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG] =
trans_vector_unsigned_byte_2;
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG] =
trans_vector_unsigned_byte_4;
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG] =
trans_vector_unsigned_byte_8;
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG] =
trans_vector_unsigned_byte_8;
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG] =
trans_vector_unsigned_byte_16;
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG] =
trans_vector_unsigned_byte_16;
#if (N_WORD_BITS == 32)
transother[SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG] =
trans_vector_unsigned_byte_32;
#endif
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG] =
trans_vector_unsigned_byte_32;
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG] =
trans_vector_unsigned_byte_32;
#if (N_WORD_BITS == 64)
transother[SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG] =
trans_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG] =
trans_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
transother[SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG] =
trans_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
transother[SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG] =
trans_vector_unsigned_byte_8;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
transother[SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG] =
trans_vector_unsigned_byte_16;
#endif
#if (N_WORD_BITS == 32)
transother[SIMPLE_ARRAY_FIXNUM_WIDETAG] =
trans_vector_unsigned_byte_32;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
transother[SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG] =
trans_vector_unsigned_byte_32;
#endif
#if (N_WORD_BITS == 64)
transother[SIMPLE_ARRAY_FIXNUM_WIDETAG] =
trans_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
transother[SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG] =
trans_vector_unsigned_byte_64;
#endif
transother[SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG] =
trans_vector_single_float;
transother[SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG] =
trans_vector_double_float;
#ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
transother[SIMPLE_ARRAY_LONG_FLOAT_WIDETAG] =
trans_vector_long_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
transother[SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG] =
trans_vector_complex_single_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
transother[SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG] =
trans_vector_complex_double_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
transother[SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG] =
trans_vector_complex_long_float;
#endif
transother[COMPLEX_BASE_STRING_WIDETAG] = trans_boxed;
#ifdef COMPLEX_CHARACTER_STRING_WIDETAG
transother[COMPLEX_CHARACTER_STRING_WIDETAG] = trans_boxed;
#endif
transother[COMPLEX_BIT_VECTOR_WIDETAG] = trans_boxed;
transother[COMPLEX_VECTOR_NIL_WIDETAG] = trans_boxed;
transother[COMPLEX_VECTOR_WIDETAG] = trans_boxed;
transother[COMPLEX_ARRAY_WIDETAG] = trans_boxed;
transother[CODE_HEADER_WIDETAG] = trans_code_header;
transother[SIMPLE_FUN_HEADER_WIDETAG] = trans_fun_header;
transother[RETURN_PC_HEADER_WIDETAG] = trans_return_pc_header;
transother[CLOSURE_HEADER_WIDETAG] = trans_boxed;
transother[FUNCALLABLE_INSTANCE_HEADER_WIDETAG] = trans_boxed;
transother[VALUE_CELL_HEADER_WIDETAG] = trans_boxed;
transother[SYMBOL_HEADER_WIDETAG] = trans_boxed;
transother[CHARACTER_WIDETAG] = trans_immediate;
transother[SAP_WIDETAG] = trans_unboxed;
#ifdef SIMD_PACK_WIDETAG
transother[SIMD_PACK_WIDETAG] = trans_unboxed;
#endif
transother[UNBOUND_MARKER_WIDETAG] = trans_immediate;
transother[NO_TLS_VALUE_MARKER_WIDETAG] = trans_immediate;
transother[WEAK_POINTER_WIDETAG] = trans_weak_pointer;
transother[INSTANCE_HEADER_WIDETAG] = trans_boxed;
transother[FDEFN_WIDETAG] = trans_boxed;
/* size table, initialized the same way as scavtab */
for (i = 0; i < ((sizeof sizetab)/(sizeof sizetab[0])); i++)
sizetab[i] = size_lose;
for (i = 0; i < (1<<(N_WIDETAG_BITS-N_LOWTAG_BITS)); i++) {
for (j = 0; j < (1<<N_LOWTAG_BITS); j++) {
if (fixnump(j)) {
sizetab[j|(i<<N_LOWTAG_BITS)] = size_immediate;
}
}
sizetab[FUN_POINTER_LOWTAG|(i<<N_LOWTAG_BITS)] = size_pointer;
/* skipping OTHER_IMMEDIATE_0_LOWTAG */
sizetab[LIST_POINTER_LOWTAG|(i<<N_LOWTAG_BITS)] = size_pointer;
sizetab[INSTANCE_POINTER_LOWTAG|(i<<N_LOWTAG_BITS)] = size_pointer;
/* skipping OTHER_IMMEDIATE_1_LOWTAG */
sizetab[OTHER_POINTER_LOWTAG|(i<<N_LOWTAG_BITS)] = size_pointer;
}
sizetab[BIGNUM_WIDETAG] = size_unboxed;
sizetab[RATIO_WIDETAG] = size_boxed;
#if N_WORD_BITS == 64
sizetab[SINGLE_FLOAT_WIDETAG] = size_immediate;
#else
sizetab[SINGLE_FLOAT_WIDETAG] = size_unboxed;
#endif
sizetab[DOUBLE_FLOAT_WIDETAG] = size_unboxed;
#ifdef LONG_FLOAT_WIDETAG
sizetab[LONG_FLOAT_WIDETAG] = size_unboxed;
#endif
sizetab[COMPLEX_WIDETAG] = size_boxed;
#ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
sizetab[COMPLEX_SINGLE_FLOAT_WIDETAG] = size_unboxed;
#endif
#ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
sizetab[COMPLEX_DOUBLE_FLOAT_WIDETAG] = size_unboxed;
#endif
#ifdef COMPLEX_LONG_FLOAT_WIDETAG
sizetab[COMPLEX_LONG_FLOAT_WIDETAG] = size_unboxed;
#endif
sizetab[SIMPLE_ARRAY_WIDETAG] = size_boxed;
sizetab[SIMPLE_BASE_STRING_WIDETAG] = size_base_string;
#ifdef SIMPLE_CHARACTER_STRING_WIDETAG
sizetab[SIMPLE_CHARACTER_STRING_WIDETAG] = size_character_string;
#endif
sizetab[SIMPLE_BIT_VECTOR_WIDETAG] = size_vector_bit;
sizetab[SIMPLE_VECTOR_WIDETAG] = size_vector;
sizetab[SIMPLE_ARRAY_NIL_WIDETAG] = size_vector_nil;
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG] =
size_vector_unsigned_byte_2;
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG] =
size_vector_unsigned_byte_4;
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG] =
size_vector_unsigned_byte_8;
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG] =
size_vector_unsigned_byte_8;
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG] =
size_vector_unsigned_byte_16;
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG] =
size_vector_unsigned_byte_16;
#if (N_WORD_BITS == 32)
sizetab[SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG] =
size_vector_unsigned_byte_32;
#endif
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG] =
size_vector_unsigned_byte_32;
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG] =
size_vector_unsigned_byte_32;
#if (N_WORD_BITS == 64)
sizetab[SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG] =
size_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG] =
size_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
sizetab[SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG] =
size_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
sizetab[SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG] = size_vector_unsigned_byte_8;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
sizetab[SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG] =
size_vector_unsigned_byte_16;
#endif
#if (N_WORD_BITS == 32)
sizetab[SIMPLE_ARRAY_FIXNUM_WIDETAG] =
size_vector_unsigned_byte_32;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
sizetab[SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG] =
size_vector_unsigned_byte_32;
#endif
#if (N_WORD_BITS == 64)
sizetab[SIMPLE_ARRAY_FIXNUM_WIDETAG] =
size_vector_unsigned_byte_64;
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
sizetab[SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG] =
size_vector_unsigned_byte_64;
#endif
sizetab[SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG] = size_vector_single_float;
sizetab[SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG] = size_vector_double_float;
#ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
sizetab[SIMPLE_ARRAY_LONG_FLOAT_WIDETAG] = size_vector_long_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
sizetab[SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG] =
size_vector_complex_single_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
sizetab[SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG] =
size_vector_complex_double_float;
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
sizetab[SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG] =
size_vector_complex_long_float;
#endif
sizetab[COMPLEX_BASE_STRING_WIDETAG] = size_boxed;
#ifdef COMPLEX_CHARACTER_STRING_WIDETAG
sizetab[COMPLEX_CHARACTER_STRING_WIDETAG] = size_boxed;
#endif
sizetab[COMPLEX_VECTOR_NIL_WIDETAG] = size_boxed;
sizetab[COMPLEX_BIT_VECTOR_WIDETAG] = size_boxed;
sizetab[COMPLEX_VECTOR_WIDETAG] = size_boxed;
sizetab[COMPLEX_ARRAY_WIDETAG] = size_boxed;
sizetab[CODE_HEADER_WIDETAG] = size_code_header;
#if 0
/* We shouldn't see these, so just lose if it happens. */
sizetab[SIMPLE_FUN_HEADER_WIDETAG] = size_function_header;
sizetab[RETURN_PC_HEADER_WIDETAG] = size_return_pc_header;
#endif
sizetab[CLOSURE_HEADER_WIDETAG] = size_boxed;
sizetab[FUNCALLABLE_INSTANCE_HEADER_WIDETAG] = size_boxed;
sizetab[VALUE_CELL_HEADER_WIDETAG] = size_boxed;
sizetab[SYMBOL_HEADER_WIDETAG] = size_boxed;
sizetab[CHARACTER_WIDETAG] = size_immediate;
sizetab[SAP_WIDETAG] = size_unboxed;
#ifdef SIMD_PACK_WIDETAG
sizetab[SIMD_PACK_WIDETAG] = size_unboxed;
#endif
sizetab[UNBOUND_MARKER_WIDETAG] = size_immediate;
sizetab[NO_TLS_VALUE_MARKER_WIDETAG] = size_immediate;
sizetab[WEAK_POINTER_WIDETAG] = size_weak_pointer;
sizetab[INSTANCE_HEADER_WIDETAG] = size_boxed;
sizetab[FDEFN_WIDETAG] = size_boxed;
}
/* Find the code object for the given pc, or return NULL on
failure. */
lispobj *
component_ptr_from_pc(lispobj *pc)
{
lispobj *object = NULL;
if ( (object = search_read_only_space(pc)) )
;
else if ( (object = search_static_space(pc)) )
;
else
object = search_dynamic_space(pc);
if (object) /* if we found something */
if (widetag_of(*object) == CODE_HEADER_WIDETAG)
return(object);
return (NULL);
}
/* Scan an area looking for an object which encloses the given pointer.
* Return the object start on success or NULL on failure. */
lispobj *
gc_search_space(lispobj *start, size_t words, lispobj *pointer)
{
while (words > 0) {
size_t count = 1;
lispobj thing = *start;
/* If thing is an immediate then this is a cons. */
if (is_lisp_pointer(thing) || is_lisp_immediate(thing))
count = 2;
else
count = (sizetab[widetag_of(thing)])(start);
/* Check whether the pointer is within this object. */
if ((pointer >= start) && (pointer < (start+count))) {
/* found it! */
/*FSHOW((stderr,"/found %x in %x %x\n", pointer, start, thing));*/
return(start);
}
/* Round up the count. */
count = CEILING(count,2);
start += count;
words -= count;
}
return (NULL);
}
/* Helper for valid_lisp_pointer_p (below) and
* possibly_valid_dynamic_space_pointer (gencgc).
*
* pointer is the pointer to validate, and start_addr is the address
* of the enclosing object.
*/
int
looks_like_valid_lisp_pointer_p(lispobj pointer, lispobj *start_addr)
{
if (!is_lisp_pointer(pointer)) {
return 0;
}
/* Check that the object pointed to is consistent with the pointer
* low tag. */
switch (lowtag_of(pointer)) {
case FUN_POINTER_LOWTAG:
/* Start_addr should be the enclosing code object, or a closure
* header. */
switch (widetag_of(*start_addr)) {
case CODE_HEADER_WIDETAG:
/* Make sure we actually point to a function in the code object,
* as opposed to a random point there. */
if (SIMPLE_FUN_HEADER_WIDETAG==widetag_of(native_pointer(pointer)[0]))
return 1;
else
return 0;
case CLOSURE_HEADER_WIDETAG:
case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
if (pointer != make_lispobj(start_addr, FUN_POINTER_LOWTAG)) {
return 0;
}
break;
default:
return 0;
}
break;
case LIST_POINTER_LOWTAG:
if (pointer != make_lispobj(start_addr, LIST_POINTER_LOWTAG)) {
return 0;
}
/* Is it plausible cons? */
if ((is_lisp_pointer(start_addr[0]) ||
is_lisp_immediate(start_addr[0])) &&
(is_lisp_pointer(start_addr[1]) ||
is_lisp_immediate(start_addr[1])))
break;
else {
return 0;
}
case INSTANCE_POINTER_LOWTAG:
if (pointer != make_lispobj(start_addr, INSTANCE_POINTER_LOWTAG)) {
return 0;
}
if (widetag_of(start_addr[0]) != INSTANCE_HEADER_WIDETAG) {
return 0;
}
break;
case OTHER_POINTER_LOWTAG:
#if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
/* The all-architecture test below is good as far as it goes,
* but an LRA object is similar to a FUN-POINTER: It is
* embedded within a CODE-OBJECT pointed to by start_addr, and
* cannot be found by simply walking the heap, therefore we
* need to check for it. -- AB, 2010-Jun-04 */
if ((widetag_of(start_addr[0]) == CODE_HEADER_WIDETAG)) {
lispobj *potential_lra = native_pointer(pointer);
if ((widetag_of(potential_lra[0]) == RETURN_PC_HEADER_WIDETAG) &&
((potential_lra - HeaderValue(potential_lra[0])) == start_addr)) {
return 1; /* It's as good as we can verify. */
}
}
#endif
if (pointer != make_lispobj(start_addr, OTHER_POINTER_LOWTAG)) {
return 0;
}
/* Is it plausible? Not a cons. XXX should check the headers. */
if (is_lisp_pointer(start_addr[0]) || ((start_addr[0] & 3) == 0)) {
return 0;
}
switch (widetag_of(start_addr[0])) {
case UNBOUND_MARKER_WIDETAG:
case NO_TLS_VALUE_MARKER_WIDETAG:
case CHARACTER_WIDETAG:
#if N_WORD_BITS == 64
case SINGLE_FLOAT_WIDETAG:
#endif
return 0;
/* only pointed to by function pointers? */
case CLOSURE_HEADER_WIDETAG:
case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
return 0;
case INSTANCE_HEADER_WIDETAG:
return 0;
/* the valid other immediate pointer objects */
case SIMPLE_VECTOR_WIDETAG:
case RATIO_WIDETAG:
case COMPLEX_WIDETAG:
#ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
case COMPLEX_SINGLE_FLOAT_WIDETAG:
#endif
#ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
case COMPLEX_DOUBLE_FLOAT_WIDETAG:
#endif
#ifdef COMPLEX_LONG_FLOAT_WIDETAG
case COMPLEX_LONG_FLOAT_WIDETAG:
#endif
#ifdef SIMD_PACK_WIDETAG
case SIMD_PACK_WIDETAG:
#endif
case SIMPLE_ARRAY_WIDETAG:
case COMPLEX_BASE_STRING_WIDETAG:
#ifdef COMPLEX_CHARACTER_STRING_WIDETAG
case COMPLEX_CHARACTER_STRING_WIDETAG:
#endif
case COMPLEX_VECTOR_NIL_WIDETAG:
case COMPLEX_BIT_VECTOR_WIDETAG:
case COMPLEX_VECTOR_WIDETAG:
case COMPLEX_ARRAY_WIDETAG:
case VALUE_CELL_HEADER_WIDETAG:
case SYMBOL_HEADER_WIDETAG:
case FDEFN_WIDETAG:
case CODE_HEADER_WIDETAG:
case BIGNUM_WIDETAG:
#if N_WORD_BITS != 64
case SINGLE_FLOAT_WIDETAG:
#endif
case DOUBLE_FLOAT_WIDETAG:
#ifdef LONG_FLOAT_WIDETAG
case LONG_FLOAT_WIDETAG:
#endif
case SIMPLE_BASE_STRING_WIDETAG:
#ifdef SIMPLE_CHARACTER_STRING_WIDETAG
case SIMPLE_CHARACTER_STRING_WIDETAG:
#endif
case SIMPLE_BIT_VECTOR_WIDETAG:
case SIMPLE_ARRAY_NIL_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
#ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
#endif
#ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
#endif
case SIMPLE_ARRAY_FIXNUM_WIDETAG:
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
#endif
#ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
#endif
case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
#ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
#endif
#ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
#endif
case SAP_WIDETAG:
case WEAK_POINTER_WIDETAG:
break;
default:
return 0;
}
break;
default:
return 0;
}
/* looks good */
return 1;
}
/* Used by the debugger to validate possibly bogus pointers before
* calling MAKE-LISP-OBJ on them.
*
* FIXME: We would like to make this perfect, because if the debugger
* constructs a reference to a bugs lisp object, and it ends up in a
* location scavenged by the GC all hell breaks loose.
*
* Whereas possibly_valid_dynamic_space_pointer has to be conservative
* and return true for all valid pointers, this could actually be eager
* and lie about a few pointers without bad results... but that should
* be reflected in the name.
*/
int
valid_lisp_pointer_p(lispobj *pointer)
{
lispobj *start;
if (((start=search_dynamic_space(pointer))!=NULL) ||
((start=search_static_space(pointer))!=NULL) ||
((start=search_read_only_space(pointer))!=NULL))
return looks_like_valid_lisp_pointer_p((lispobj)pointer, start);
else
return 0;
}
boolean
maybe_gc(os_context_t *context)
{
lispobj gc_happened;
struct thread *thread = arch_os_get_current_thread();
fake_foreign_function_call(context);
/* SUB-GC may return without GCing if *GC-INHIBIT* is set, in
* which case we will be running with no gc trigger barrier
* thing for a while. But it shouldn't be long until the end
* of WITHOUT-GCING.
*
* FIXME: It would be good to protect the end of dynamic space for
* CheneyGC and signal a storage condition from there.
*/
/* Restore the signal mask from the interrupted context before
* calling into Lisp if interrupts are enabled. Why not always?
*
* Suppose there is a WITHOUT-INTERRUPTS block far, far out. If an
* interrupt hits while in SUB-GC, it is deferred and the
* os_context_sigmask of that interrupt is set to block further
* deferrable interrupts (until the first one is
* handled). Unfortunately, that context refers to this place and
* when we return from here the signals will not be blocked.
*
* A kludgy alternative is to propagate the sigmask change to the
* outer context.
*/
#if !(defined(LISP_FEATURE_WIN32) || defined(LISP_FEATURE_SB_SAFEPOINT))
check_gc_signals_unblocked_or_lose(os_context_sigmask_addr(context));
unblock_gc_signals(0, 0);
#endif
FSHOW((stderr, "/maybe_gc: calling SUB_GC\n"));
/* FIXME: Nothing must go wrong during GC else we end up running
* the debugger, error handlers, and user code in general in a
* potentially unsafe place. Running out of the control stack or
* the heap in SUB-GC are ways to lose. Of course, deferrables
* cannot be unblocked because there may be a pending handler, or
* we may even be in a WITHOUT-INTERRUPTS. */
gc_happened = funcall0(StaticSymbolFunction(SUB_GC));
FSHOW((stderr, "/maybe_gc: gc_happened=%s\n",
(gc_happened == NIL)
? "NIL"
: ((gc_happened == T)
? "T"
: "0")));
/* gc_happened can take three values: T, NIL, 0.
*
* T means that the thread managed to trigger a GC, and post-gc
* must be called.
*
* NIL means that the thread is within without-gcing, and no GC
* has occurred.
*
* Finally, 0 means that *a* GC has occurred, but it wasn't
* triggered by this thread; success, but post-gc doesn't have
* to be called.
*/
if ((gc_happened == T) &&
/* See if interrupts are enabled or it's possible to enable
* them. POST-GC has a similar check, but we don't want to
* unlock deferrables in that case and get a pending interrupt
* here. */
((SymbolValue(INTERRUPTS_ENABLED,thread) != NIL) ||
(SymbolValue(ALLOW_WITH_INTERRUPTS,thread) != NIL))) {
#ifndef LISP_FEATURE_WIN32
sigset_t *context_sigmask = os_context_sigmask_addr(context);
if (!deferrables_blocked_p(context_sigmask)) {
thread_sigmask(SIG_SETMASK, context_sigmask, 0);
#ifndef LISP_FEATURE_SB_SAFEPOINT
check_gc_signals_unblocked_or_lose(0);
#endif
#endif
FSHOW((stderr, "/maybe_gc: calling POST_GC\n"));
funcall0(StaticSymbolFunction(POST_GC));
#ifndef LISP_FEATURE_WIN32
} else {
FSHOW((stderr, "/maybe_gc: punting on POST_GC due to blockage\n"));
}
#endif
}
undo_fake_foreign_function_call(context);
FSHOW((stderr, "/maybe_gc: returning\n"));
return (gc_happened != NIL);
}
#define BYTES_ZERO_BEFORE_END (1<<12)
/* There used to be a similar function called SCRUB-CONTROL-STACK in
* Lisp and another called zero_stack() in cheneygc.c, but since it's
* shorter to express in, and more often called from C, I keep only
* the C one after fixing it. -- MG 2009-03-25 */
/* Zero the unused portion of the control stack so that old objects
* are not kept alive because of uninitialized stack variables.
*
* "To summarize the problem, since not all allocated stack frame
* slots are guaranteed to be written by the time you call an another
* function or GC, there may be garbage pointers retained in your dead
* stack locations. The stack scrubbing only affects the part of the
* stack from the SP to the end of the allocated stack." - ram, on
* cmucl-imp, Tue, 25 Sep 2001
*
* So, as an (admittedly lame) workaround, from time to time we call
* scrub-control-stack to zero out all the unused portion. This is
* supposed to happen when the stack is mostly empty, so that we have
* a chance of clearing more of it: callers are currently (2002.07.18)
* REPL, SUB-GC and sig_stop_for_gc_handler. */
/* Take care not to tread on the guard page and the hard guard page as
* it would be unkind to sig_stop_for_gc_handler. Touching the return
* guard page is not dangerous. For this to work the guard page must
* be zeroed when protected. */
/* FIXME: I think there is no guarantee that once
* BYTES_ZERO_BEFORE_END bytes are zero the rest are also zero. This
* may be what the "lame" adjective in the above comment is for. In
* this case, exact gc may lose badly. */
void
scrub_control_stack()
{
scrub_thread_control_stack(arch_os_get_current_thread());
}
void
scrub_thread_control_stack(struct thread *th)
{
os_vm_address_t guard_page_address = CONTROL_STACK_GUARD_PAGE(th);
os_vm_address_t hard_guard_page_address = CONTROL_STACK_HARD_GUARD_PAGE(th);
#ifdef LISP_FEATURE_C_STACK_IS_CONTROL_STACK
/* On these targets scrubbing from C is a bad idea, so we punt to
* a routine in $ARCH-assem.S. */
extern void arch_scrub_control_stack(struct thread *, os_vm_address_t, os_vm_address_t);
arch_scrub_control_stack(th, guard_page_address, hard_guard_page_address);
#else
lispobj *sp = access_control_stack_pointer(th);
scrub:
if ((((os_vm_address_t)sp < (hard_guard_page_address + os_vm_page_size)) &&
((os_vm_address_t)sp >= hard_guard_page_address)) ||
(((os_vm_address_t)sp < (guard_page_address + os_vm_page_size)) &&
((os_vm_address_t)sp >= guard_page_address) &&
(th->control_stack_guard_page_protected != NIL)))
return;
#ifdef LISP_FEATURE_STACK_GROWS_DOWNWARD_NOT_UPWARD
do {
*sp = 0;
} while (((uword_t)sp--) & (BYTES_ZERO_BEFORE_END - 1));
if ((os_vm_address_t)sp < (hard_guard_page_address + os_vm_page_size))
return;
do {
if (*sp)
goto scrub;
} while (((uword_t)sp--) & (BYTES_ZERO_BEFORE_END - 1));
#else
do {
*sp = 0;
} while (((uword_t)++sp) & (BYTES_ZERO_BEFORE_END - 1));
if ((os_vm_address_t)sp >= hard_guard_page_address)
return;
do {
if (*sp)
goto scrub;
} while (((uword_t)++sp) & (BYTES_ZERO_BEFORE_END - 1));
#endif
#endif /* LISP_FEATURE_C_STACK_IS_CONTROL_STACK */
}
#if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
void
scavenge_control_stack(struct thread *th)
{
lispobj *object_ptr;
/* In order to properly support dynamic-extent allocation of
* non-CONS objects, the control stack requires special handling.
* Rather than calling scavenge() directly, grovel over it fixing
* broken hearts, scavenging pointers to oldspace, and pitching a
* fit when encountering unboxed data. This prevents stray object
* headers from causing the scavenger to blow past the end of the
* stack (an error case checked in scavenge()). We don't worry
* about treating unboxed words as boxed or vice versa, because
* the compiler isn't allowed to store unboxed objects on the
* control stack. -- AB, 2011-Dec-02 */
for (object_ptr = th->control_stack_start;
object_ptr < access_control_stack_pointer(th);
object_ptr++) {
lispobj object = *object_ptr;
#ifdef LISP_FEATURE_GENCGC
if (forwarding_pointer_p(object_ptr))
lose("unexpected forwarding pointer in scavenge_control_stack: %p, start=%p, end=%p\n",
object_ptr, th->control_stack_start, access_control_stack_pointer(th));
#endif
if (is_lisp_pointer(object) && from_space_p(object)) {
/* It currently points to old space. Check for a
* forwarding pointer. */
lispobj *ptr = native_pointer(object);
if (forwarding_pointer_p(ptr)) {
/* Yes, there's a forwarding pointer. */
*object_ptr = LOW_WORD(forwarding_pointer_value(ptr));
} else {
/* Scavenge that pointer. */
long n_words_scavenged =
(scavtab[widetag_of(object)])(object_ptr, object);
gc_assert(n_words_scavenged == 1);
}
} else if (scavtab[widetag_of(object)] == scav_lose) {
lose("unboxed object in scavenge_control_stack: %p->%x, start=%p, end=%p\n",
object_ptr, object, th->control_stack_start, access_control_stack_pointer(th));
}
}
}
/* Scavenging Interrupt Contexts */
static int boxed_registers[] = BOXED_REGISTERS;
/* The GC has a notion of an "interior pointer" register, an unboxed
* register that typically contains a pointer to inside an object
* referenced by another pointer. The most obvious of these is the
* program counter, although many compiler backends define a "Lisp
* Interior Pointer" register known to the runtime as reg_LIP, and
* various CPU architectures have other registers that also partake of
* the interior-pointer nature. As the code for pairing an interior
* pointer value up with its "base" register, and fixing it up after
* scavenging is complete is horribly repetitive, a few macros paper
* over the monotony. --AB, 2010-Jul-14 */
/* These macros are only ever used over a lexical environment which
* defines a pointer to an os_context_t called context, thus we don't
* bother to pass that context in as a parameter. */
/* Define how to access a given interior pointer. */
#define ACCESS_INTERIOR_POINTER_pc \
*os_context_pc_addr(context)
#define ACCESS_INTERIOR_POINTER_lip \
*os_context_register_addr(context, reg_LIP)
#define ACCESS_INTERIOR_POINTER_lr \
*os_context_lr_addr(context)
#define ACCESS_INTERIOR_POINTER_npc \
*os_context_npc_addr(context)
#define ACCESS_INTERIOR_POINTER_ctr \
*os_context_ctr_addr(context)
#define INTERIOR_POINTER_VARS(name) \
uword_t name##_offset; \
int name##_register_pair
#define PAIR_INTERIOR_POINTER(name) \
pair_interior_pointer(context, \
ACCESS_INTERIOR_POINTER_##name, \
&name##_offset, \
&name##_register_pair)
/* One complexity here is that if a paired register is not found for
* an interior pointer, then that pointer does not get updated.
* Originally, there was some commentary about using an index of -1
* when calling os_context_register_addr() on SPARC referring to the
* program counter, but the real reason is to allow an interior
* pointer register to point to the runtime, read-only space, or
* static space without problems. */
#define FIXUP_INTERIOR_POINTER(name) \
do { \
if (name##_register_pair >= 0) { \
ACCESS_INTERIOR_POINTER_##name = \
(*os_context_register_addr(context, \
name##_register_pair) \
& ~LOWTAG_MASK) \
+ name##_offset; \
} \
} while (0)
static void
pair_interior_pointer(os_context_t *context, uword_t pointer,
uword_t *saved_offset, int *register_pair)
{
int i;
/*
* I (RLT) think this is trying to find the boxed register that is
* closest to the LIP address, without going past it. Usually, it's
* reg_CODE or reg_LRA. But sometimes, nothing can be found.
*/
/* 0x7FFFFFFF on 32-bit platforms;
0x7FFFFFFFFFFFFFFF on 64-bit platforms */
*saved_offset = (((uword_t)1) << (N_WORD_BITS - 1)) - 1;
*register_pair = -1;
for (i = 0; i < (sizeof(boxed_registers) / sizeof(int)); i++) {
uword_t reg;
sword_t offset;
int index;
index = boxed_registers[i];
reg = *os_context_register_addr(context, index);
/* An interior pointer is never relative to a non-pointer
* register (an oversight in the original implementation).
* The simplest argument for why this is true is to consider
* the fixnum that happens by coincide to be the word-index in
* memory of the header for some object plus two. This is
* happenstance would cause the register containing the fixnum
* to be selected as the register_pair if the interior pointer
* is to anywhere after the first two words of the object.
* The fixnum won't be changed during GC, but the object might
* move, thus destroying the interior pointer. --AB,
* 2010-Jul-14 */
if (is_lisp_pointer(reg) &&
((reg & ~LOWTAG_MASK) <= pointer)) {
offset = pointer - (reg & ~LOWTAG_MASK);
if (offset < *saved_offset) {
*saved_offset = offset;
*register_pair = index;
}
}
}
}
static void
scavenge_interrupt_context(os_context_t * context)
{
int i;
/* FIXME: The various #ifdef noise here is precisely that: noise.
* Is it possible to fold it into the macrology so that we have
* one set of #ifdefs and then INTERIOR_POINTER_VARS /et alia/
* compile out for the registers that don't exist on a given
* platform? */
INTERIOR_POINTER_VARS(pc);
#ifdef reg_LIP
INTERIOR_POINTER_VARS(lip);
#endif
#ifdef ARCH_HAS_LINK_REGISTER
INTERIOR_POINTER_VARS(lr);
#endif
#ifdef ARCH_HAS_NPC_REGISTER
INTERIOR_POINTER_VARS(npc);
#endif
#ifdef LISP_FEATURE_PPC
INTERIOR_POINTER_VARS(ctr);
#endif
PAIR_INTERIOR_POINTER(pc);
#ifdef reg_LIP
PAIR_INTERIOR_POINTER(lip);
#endif
#ifdef ARCH_HAS_LINK_REGISTER
PAIR_INTERIOR_POINTER(lr);
#endif
#ifdef ARCH_HAS_NPC_REGISTER
PAIR_INTERIOR_POINTER(npc);
#endif
#ifdef LISP_FEATURE_PPC
PAIR_INTERIOR_POINTER(ctr);
#endif
/* Scavenge all boxed registers in the context. */
for (i = 0; i < (sizeof(boxed_registers) / sizeof(int)); i++) {
int index;
lispobj foo;
index = boxed_registers[i];
foo = *os_context_register_addr(context, index);
scavenge(&foo, 1);
*os_context_register_addr(context, index) = foo;
/* this is unlikely to work as intended on bigendian
* 64 bit platforms */
scavenge((lispobj *) os_context_register_addr(context, index), 1);
}
/* Now that the scavenging is done, repair the various interior
* pointers. */
FIXUP_INTERIOR_POINTER(pc);
#ifdef reg_LIP
FIXUP_INTERIOR_POINTER(lip);
#endif
#ifdef ARCH_HAS_LINK_REGISTER
FIXUP_INTERIOR_POINTER(lr);
#endif
#ifdef ARCH_HAS_NPC_REGISTER
FIXUP_INTERIOR_POINTER(npc);
#endif
#ifdef LISP_FEATURE_PPC
FIXUP_INTERIOR_POINTER(ctr);
#endif
}
void
scavenge_interrupt_contexts(struct thread *th)
{
int i, index;
os_context_t *context;
index = fixnum_value(SymbolValue(FREE_INTERRUPT_CONTEXT_INDEX,th));
#if defined(DEBUG_PRINT_CONTEXT_INDEX)
printf("Number of active contexts: %d\n", index);
#endif
for (i = 0; i < index; i++) {
context = th->interrupt_contexts[i];
scavenge_interrupt_context(context);
}
}
#endif /* x86oid targets */