File size: 94,754 Bytes
3dcad1f |
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 |
;;; Continuation-passing style (CPS) intermediate language (IL)
;; Copyright (C) 2013-2015,2017-2021,2023 Free Software Foundation, Inc.
;;;; This library is free software; you can redistribute it and/or
;;;; modify it under the terms of the GNU Lesser General Public
;;;; License as published by the Free Software Foundation; either
;;;; version 3 of the License, or (at your option) any later version.
;;;;
;;;; This library is distributed in the hope that it will be useful,
;;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
;;;; Lesser General Public License for more details.
;;;;
;;;; You should have received a copy of the GNU Lesser General Public
;;;; License along with this library; if not, write to the Free Software
;;;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
;;; Commentary:
;;;
;;; This pass converts Tree-IL to the continuation-passing style (CPS)
;;; language.
;;;
;;; CPS is a lower-level representation than Tree-IL. Converting to
;;; CPS, beyond adding names for all control points and all values,
;;; simplifies expressions in the following ways, among others:
;;;
;;; * Fixing the order of evaluation.
;;;
;;; * Converting assigned variables to boxed variables.
;;;
;;; * Requiring that Scheme's <letrec> has already been lowered to
;;; <fix>.
;;;
;;; * Inlining default-value initializers into lambda-case
;;; expressions.
;;;
;;; * Inlining prompt bodies.
;;;
;;; * Turning toplevel and module references into primcalls. This
;;; involves explicitly modelling the "scope" of toplevel lookups
;;; (indicating the module with respect to which toplevel bindings
;;; are resolved).
;;;
;;; The utility of CPS is that it gives a name to everything: every
;;; intermediate value, and every control point (continuation). As such
;;; it is more verbose than Tree-IL, but at the same time more simple as
;;; the number of concepts is reduced.
;;;
;;; Code:
(define-module (language tree-il compile-cps)
#:use-module (ice-9 match)
#:use-module ((srfi srfi-1) #:select (fold filter-map))
#:use-module (srfi srfi-26)
#:use-module ((system foreign) #:select (make-pointer pointer->scm))
#:use-module (system base target)
#:use-module (system base types internal)
#:use-module (language cps)
#:use-module (language cps utils)
#:use-module (language cps with-cps)
#:use-module (language tree-il cps-primitives)
#:use-module (language tree-il)
#:use-module (language cps intmap)
#:export (compile-cps define-custom-primcall-converter))
(define (convert-primcall/default cps k src op param . args)
(with-cps cps
(build-term
($continue k src ($primcall op param args)))))
(define *primcall-converters* (make-hash-table))
(define-syntax-rule (define-primcall-converter name proc)
(hashq-set! *primcall-converters* 'name proc))
(define (convert-primcall* cps k src op param args)
(let ((proc (hashq-ref *primcall-converters* op convert-primcall/default)))
(apply proc cps k src op param args)))
(define (convert-primcall cps k src op param . args)
(convert-primcall* cps k src op param args))
(define (ensure-vector cps src op pred v have-length)
(define expected-type
(match pred
('vector? "vector")
('mutable-vector? "mutable vector")))
(define not-vector (vector (symbol->string op) 1 expected-type))
(with-cps cps
(letv ulen)
(letk knot-vector
($kargs () () ($throw src 'raise-type-error not-vector (v))))
(let$ body (have-length ulen))
(letk k ($kargs ('ulen) (ulen) ,body))
(letk kv
($kargs () ()
($continue k src ($primcall 'vector-length #f (v)))))
(letk kheap-object
($kargs () ()
($branch knot-vector kv src pred #f (v))))
(build-term
($branch knot-vector kheap-object src 'heap-object? #f (v)))))
(define (untag-fixnum-index-in-range cps src op idx ulen have-index-in-range)
;; Precondition: ULEN is a U64. Should be within positive fixnum
;; range.
(define not-fixnum (vector (symbol->string op) 2 "small integer"))
(define out-of-range (vector (symbol->string op) 2))
(with-cps cps
(letv sidx uidx)
(letk knot-fixnum
($kargs () () ($throw src 'raise-type-error not-fixnum (idx))))
(letk kout-of-range
($kargs () () ($throw src 'raise-range-error out-of-range (idx))))
(let$ body (have-index-in-range uidx))
(letk k ($kargs () () ,body))
(letk kboundlen
($kargs ('uidx) (uidx)
($branch kout-of-range k src 'u64-< #f (uidx ulen))))
(letk kcast
($kargs () ()
($continue kboundlen src ($primcall 's64->u64 #f (sidx)))))
(letk kbound0
($kargs ('sidx) (sidx)
($branch kcast kout-of-range src 's64-imm-< 0 (sidx))))
(letk kuntag
($kargs () ()
($continue kbound0 src ($primcall 'untag-fixnum #f (idx)))))
(build-term ($branch knot-fixnum kuntag src 'fixnum? #f (idx)))))
(define (untag-fixnum-in-imm-range cps src op size max have-int-in-range)
(define not-fixnum (vector (symbol->string op) 2 "small integer"))
(define out-of-range (vector (symbol->string op) 2))
(with-cps cps
(letv ssize usize)
(letk knot-fixnum
($kargs () () ($throw src 'raise-type-error not-fixnum (size))))
(letk kout-of-range
($kargs () () ($throw src 'raise-range-error out-of-range (size))))
(let$ body (have-int-in-range usize))
(letk k ($kargs () () ,body))
(letk kboundlen
($kargs ('usize) (usize)
($branch k kout-of-range src 'imm-u64-< max (usize))))
(letk kcast
($kargs () ()
($continue kboundlen src ($primcall 's64->u64 #f (ssize)))))
(letk kbound0
($kargs ('ssize) (ssize)
($branch kcast kout-of-range src 's64-imm-< 0 (ssize))))
(letk kuntag
($kargs () ()
($continue kbound0 src ($primcall 'untag-fixnum #f (size)))))
(build-term ($branch knot-fixnum kuntag src 'fixnum? #f (size)))))
(define (prepare-vector-access cps src op pred v idx access)
(ensure-vector
cps src op pred v
(lambda (cps ulen)
(untag-fixnum-index-in-range
cps src op idx ulen
(lambda (cps uidx)
(access cps v uidx))))))
(define (prepare-vector-access/immediate cps src op pred v idx access)
(unless (and (exact-integer? idx) (<= 0 idx (1- (target-max-vector-length))))
(error "precondition failed" idx))
(ensure-vector
cps src op pred v
(lambda (cps ulen)
(define out-of-range (vector (symbol->string op) 2))
(with-cps cps
(letv tidx)
(letk kthrow
($kargs ('tidx) (tidx)
($throw src 'raise-range-error out-of-range (tidx))))
(letk kout-of-range
($kargs () ()
($continue kthrow src ($const idx))))
(let$ body (access v idx))
(letk k ($kargs () () ,body))
(build-term
($branch kout-of-range k src 'imm-u64-< idx (ulen)))))))
(define-primcall-converter vector-length
(lambda (cps k src op param v)
(ensure-vector
cps src op 'vector? v
(lambda (cps ulen)
(with-cps cps
(letv slen)
(letk kcast ($kargs ('slen) (slen)
($continue k src ($primcall 'tag-fixnum #f (slen)))))
(build-term
($continue kcast src ($primcall 'u64->s64 #f (ulen)))))))))
(define-primcall-converter vector-ref
(lambda (cps k src op param v idx)
(prepare-vector-access
cps src op 'vector? v idx
(lambda (cps v uidx)
(with-cps cps
(build-term
($continue k src
($primcall 'vector-ref #f (v uidx)))))))))
(define-primcall-converter vector-ref/immediate
(lambda (cps k src op param v)
(prepare-vector-access/immediate
cps src 'vector-ref 'vector? v param
(lambda (cps v idx)
(with-cps cps
(build-term
($continue k src
($primcall 'vector-ref/immediate idx (v)))))))))
(define-primcall-converter vector-set!
(lambda (cps k src op param v idx val)
(prepare-vector-access
cps src op 'mutable-vector? v idx
(lambda (cps v uidx)
(with-cps cps
(build-term
($continue k src
($primcall 'vector-set! #f (v uidx val)))))))))
(define-primcall-converter vector-set!/immediate
(lambda (cps k src op param v val)
(prepare-vector-access/immediate
cps src 'vector-set! 'mutable-vector? v param
(lambda (cps v idx)
(with-cps cps
(build-term
($continue k src
($primcall 'vector-set!/immediate idx (v val)))))))))
(define-primcall-converter vector-init!
;; FIXME: By lowering to the same as vector-set!/immediate, we lose
;; the information that this is an init, and that it can probably skip
;; a write barrier. Guile doesn't do write barriers yet, though.
(lambda (cps k src op param v val)
(define idx param)
(with-cps cps
(build-term
($continue k src
($primcall 'vector-set!/immediate idx (v val)))))))
(define-primcall-converter allocate-vector
(lambda (cps k src op param)
(define size param)
(unless (and (exact-integer? size) (<= 0 size (target-max-vector-length)))
(error "precondition failed" size))
(with-cps cps
(build-term
($continue k src
($primcall 'allocate-vector/immediate size ()))))))
(define-primcall-converter make-vector
(lambda (cps k src op param size init)
(untag-fixnum-in-imm-range
cps src op size (target-max-vector-length)
(lambda (cps usize)
(with-cps cps
(letv v uidx)
(letk kdone
($kargs () ()
($continue k src ($values (v)))))
(letk kloop ,#f) ;; Patched later.
(letk kback
($kargs () ()
($continue kloop src
($primcall 'uadd/immediate 1 (uidx)))))
(letk kinit
($kargs () ()
($continue kback src
($primcall 'vector-set! #f (v uidx init)))))
(setk kloop
($kargs ('uidx) (uidx)
($branch kdone kinit src 'u64-< #f (uidx usize))))
(letk kbody
($kargs ('v) (v)
($continue kloop src ($primcall 'load-u64 0 ()))))
(build-term
($continue kbody src
($primcall 'allocate-vector #f (usize)))))))))
(define-primcall-converter make-vector/immediate
(lambda (cps k src op param init)
(define size param)
(define (init-fields cps v)
;; Inline the initializations, up to vectors of size 31. Above
;; that it's a bit of a waste, so reify a loop instead.
(cond
((< size 32)
(let lp ((cps cps) (idx 0))
(if (< idx size)
(with-cps cps
(let$ next (lp (1+ idx)))
(letk knext ($kargs () () ,next))
(build-term
($continue knext src
($primcall 'vector-set!/immediate idx (v init)))))
(with-cps cps
(build-term
($continue k src ($values (v))))))))
(else
(with-cps cps
(letv uidx)
(letk kdone
($kargs () ()
($continue k src ($values (v)))))
(letk kloop ,#f) ;; Patched later.
(letk kback
($kargs () ()
($continue kloop src
($primcall 'uadd/immediate 1 (uidx)))))
(letk kinit
($kargs () ()
($continue kback src
($primcall 'vector-set! #f (v uidx init)))))
(setk kloop
($kargs ('uidx) (uidx)
($branch kdone kinit src 'u64-imm-< size (uidx))))
(build-term
($continue kloop src ($primcall 'load-u64 0 ())))))))
(unless (and (exact-integer? size) (<= 0 size (target-max-vector-length)))
(error "precondition failed" size))
(with-cps cps
(letv v)
(let$ init-and-continue (init-fields v))
(letk kinit ($kargs ('v) (v) ,init-and-continue))
(build-term
($continue kinit src
($primcall 'allocate-vector/immediate size ()))))))
(define-primcall-converter symbol->string
(lambda (cps k src op param sym)
(define not-symbol #("symbol->string" 1 "symbol"))
(with-cps cps
(letk knot-symbol
($kargs () () ($throw src 'raise-type-error not-symbol (sym))))
;; This is the right lowering but the Guile-VM backend gets it a
;; bit wrong: the symbol->string intrinsic instruction includes a
;; type-check and actually allocates. We should change symbols in
;; Guile-VM so that symbol->string is cheaper.
(letk ksym
($kargs () ()
($continue k src ($primcall 'symbol->string #f (sym)))))
(letk kheap-object
($kargs () ()
($branch knot-symbol ksym src 'symbol? #f (sym))))
(build-term
($branch knot-symbol kheap-object src 'heap-object? #f (sym))))))
(define-primcall-converter symbol->keyword
(lambda (cps k src op param sym)
(define not-symbol #("symbol->keyword" 1 "symbol"))
(with-cps cps
(letk knot-symbol
($kargs () () ($throw src 'raise-type-error not-symbol (sym))))
(letk ksym
($kargs () ()
($continue k src ($primcall 'symbol->keyword #f (sym)))))
(letk kheap-object
($kargs () ()
($branch knot-symbol ksym src 'symbol? #f (sym))))
(build-term
($branch knot-symbol kheap-object src 'heap-object? #f (sym))))))
(define-primcall-converter keyword->symbol
(lambda (cps k src op param kw)
(define not-keyword #("keyword->symbol" 1 "keyword"))
(with-cps cps
(letk knot-keyword
($kargs () () ($throw src 'raise-type-error not-keyword (kw))))
(letk kkw
($kargs () ()
($continue k src ($primcall 'keyword->symbol #f (kw)))))
(letk kheap-object
($kargs () ()
($branch knot-keyword kkw src 'keyword? #f (kw))))
(build-term
($branch knot-keyword kheap-object src 'heap-object? #f (kw))))))
(define-primcall-converter string->utf8
(lambda (cps k src op param str)
(define not-string #("string->utf8" 1 "string"))
(with-cps cps
(letk knot-string
($kargs () () ($throw src 'raise-type-error not-string (str))))
(letk kstr
($kargs () ()
($continue k src ($primcall 'string->utf8 #f (str)))))
(letk kheap-object
($kargs () ()
($branch knot-string kstr src 'string? #f (str))))
(build-term
($branch knot-string kheap-object src 'heap-object? #f (str))))))
(define-primcall-converter string-utf8-length
(lambda (cps k src op param str)
(define not-string #("string-utf8-length" 1 "string"))
(with-cps cps
(letv len)
(letk knot-string
($kargs () () ($throw src 'raise-type-error not-string (str))))
(letk ktag
($kargs ('len) (len)
($continue k src ($primcall 'u64->scm #f (len)))))
(letk kstr
($kargs () ()
($continue ktag src ($primcall 'string-utf8-length #f (str)))))
(letk kheap-object
($kargs () ()
($branch knot-string kstr src 'string? #f (str))))
(build-term
($branch knot-string kheap-object src 'heap-object? #f (str))))))
(define-primcall-converter utf8->string
(lambda (cps k src op param bv)
(define not-bv #("utf8->string" 1 "bytevector"))
(with-cps cps
(letk knot-bv
($kargs () () ($throw src 'raise-type-error not-bv (bv))))
(letk kbv
($kargs () ()
($continue k src ($primcall 'utf8->string #f (bv)))))
(letk kheap-object
($kargs () ()
($branch knot-bv kbv src 'bytevector? #f (bv))))
(build-term
($branch knot-bv kheap-object src 'heap-object? #f (bv))))))
(define (ensure-pair cps src op pred x is-pair)
(define what
(match pred
('pair? "pair")
('mutable-pair? "mutable pair")))
(define not-pair (vector (symbol->string op) 1 "pair"))
(with-cps cps
(letk knot-pair ($kargs () () ($throw src 'raise-type-error not-pair (x))))
(let$ body (is-pair))
(letk k ($kargs () () ,body))
(letk kheap-object ($kargs () () ($branch knot-pair k src pred #f (x))))
(build-term ($branch knot-pair kheap-object src 'heap-object? #f (x)))))
(define-primcall-converter car
(lambda (cps k src op param pair)
(ensure-pair
cps src 'car 'pair? pair
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'car #f (pair)))))))))
(define-primcall-converter cdr
(lambda (cps k src op param pair)
(ensure-pair
cps src 'cdr 'pair? pair
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'cdr #f (pair)))))))))
(define-primcall-converter set-car!
(lambda (cps k src op param pair val)
(ensure-pair
;; FIXME: Use mutable-pair? as predicate.
cps src 'set-car! 'pair? pair
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'set-car! #f (pair val)))))))))
(define-primcall-converter set-cdr!
(lambda (cps k src op param pair val)
(ensure-pair
;; FIXME: Use mutable-pair? as predicate.
cps src 'set-cdr! 'pair? pair
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'set-cdr! #f (pair val)))))))))
(define target-has-unbound-boxes?
(let ((cache (make-hash-table)))
(lambda ()
(let ((rt (target-runtime)))
(match (hashq-get-handle cache rt)
((k . v) v)
(#f (let ((iface (resolve-interface `(language cps ,rt))))
(define v (module-ref iface 'target-has-unbound-boxes?))
(hashq-set! cache rt v)
v)))))))
(define-primcall-converter %box-ref
(lambda (cps k src op param box)
(cond
((target-has-unbound-boxes?)
(define unbound
#(misc-error "variable-ref" "Unbound variable: ~S"))
(with-cps cps
(letv val)
(letk kunbound ($kargs () () ($throw src 'throw/value unbound (box))))
(letk kbound ($kargs () () ($continue k src ($values (val)))))
(letk ktest
($kargs ('val) (val)
($branch kbound kunbound src 'undefined? #f (val))))
(build-term
($continue ktest src
($primcall 'box-ref #f (box))))))
(else
(with-cps cps
(build-term
($continue k src ($primcall 'box-ref #f (box)))))))))
(define-primcall-converter %box-set!
(lambda (cps k src op param box val)
(with-cps cps
(build-term
($continue k src
($primcall 'box-set! #f (box val)))))))
(define (ensure-box cps src op x is-box)
(define not-box (vector (symbol->string op) 1 "box"))
(with-cps cps
(letk knot-box ($kargs () () ($throw src 'raise-type-error not-box (x))))
(let$ body (is-box))
(letk k ($kargs () () ,body))
(letk kheap-object ($kargs () () ($branch knot-box k src 'variable? #f (x))))
(build-term ($branch knot-box kheap-object src 'heap-object? #f (x)))))
(define-primcall-converter box-ref
(lambda (cps k src op param box)
(ensure-box
cps src 'variable-ref box
(lambda (cps)
(convert-primcall cps k src '%box-ref param box)))))
(define-primcall-converter box-set!
(lambda (cps k src op param box val)
(ensure-box
cps src 'variable-set! box
(lambda (cps)
(convert-primcall cps k src '%box-set! param box val)))))
(define (ensure-struct cps src op x have-vtable)
(define not-struct (vector (symbol->string op) 1 "struct"))
(with-cps cps
(letv vtable)
(letk knot-struct
($kargs () () ($throw src 'raise-type-error not-struct (x))))
(let$ body (have-vtable vtable))
(letk k ($kargs ('vtable) (vtable) ,body))
(letk kvtable ($kargs () ()
($continue k src ($primcall 'struct-vtable #f (x)))))
(letk kheap-object
($kargs () () ($branch knot-struct kvtable src 'struct? #f (x))))
(build-term ($branch knot-struct kheap-object src 'heap-object? #f (x)))))
(define-primcall-converter struct-vtable
(lambda (cps k src op param struct)
(ensure-struct
cps src 'struct-vtable struct
(lambda (cps vtable)
(with-cps cps
(build-term
($continue k src ($values (vtable)))))))))
(define (ensure-vtable cps src op vtable is-vtable)
(ensure-struct
cps src op vtable
(lambda (cps vtable-vtable)
(define not-vtable (vector (symbol->string op) 1 "vtable"))
(with-cps cps
(letk kf
($kargs () () ($throw src 'raise-type-error not-vtable (vtable))))
(let$ body (is-vtable))
(letk k ($kargs () () ,body))
(build-term
($branch kf k src 'vtable-vtable? #f (vtable-vtable)))))))
(define-primcall-converter allocate-struct
(lambda (cps k src op nfields vtable)
(ensure-vtable
cps src 'allocate-struct vtable
(lambda (cps)
(define bad-arity (vector (symbol->string op)))
(define has-unboxed
(vector (symbol->string op) 1 "vtable with no unboxed fields"))
(with-cps cps
(letv actual-nfields)
(letk kbad-arity
($kargs () () ($throw src 'raise-arity-error bad-arity (vtable))))
(letk kunboxed
($kargs () () ($throw src 'raise-type-error has-unboxed (vtable))))
(letk kalloc
($kargs () ()
($continue k src
($primcall 'allocate-struct nfields (vtable)))))
(letk kaccess
($kargs () ()
($branch kalloc kunboxed src
'vtable-has-unboxed-fields? nfields (vtable))))
(letk knfields
($kargs ('nfields) (actual-nfields)
($branch kbad-arity kaccess src
'u64-imm-= nfields (actual-nfields))))
(build-term
($continue knfields src
($primcall 'vtable-size #f (vtable)))))))))
(define (ensure-struct-index-in-range cps src op vtable idx in-range)
(define bad-type (vector (symbol->string op) 2 "boxed field"))
(define out-of-range (vector (symbol->string op) 2))
(with-cps cps
(letv nfields throwval1 throwval2)
(letk kthrow1
($kargs (#f) (throwval1)
($throw src 'raise-range-error out-of-range (throwval1))))
(letk kthrow2
($kargs (#f) (throwval2)
($throw src 'raise-type-error bad-type (throwval2))))
(letk kbadidx ($kargs () () ($continue kthrow1 src ($const idx))))
(letk kbadtype ($kargs () () ($continue kthrow2 src ($const idx))))
(let$ body (in-range))
(letk k ($kargs () () ,body))
(letk kaccess
($kargs () ()
($branch kbadtype k src 'vtable-field-boxed? idx (vtable))))
(letk knfields
($kargs ('nfields) (nfields)
($branch kbadidx kaccess src 'imm-u64-< idx (nfields))))
(build-term
($continue knfields src
($primcall 'vtable-size #f (vtable))))))
(define (prepare-struct-scm-access cps src op struct idx in-range)
(define not-struct (vector (symbol->string op) 1 "struct"))
(ensure-struct
cps src op struct
(lambda (cps vtable)
(ensure-struct-index-in-range cps src op vtable idx in-range))))
(define-primcall-converter struct-ref/immediate
(lambda (cps k src op param struct)
(define idx param)
(prepare-struct-scm-access
cps src op struct idx
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'struct-ref idx (struct)))))))))
(define-primcall-converter struct-set!/immediate
(lambda (cps k src op param struct val)
(define idx param)
(prepare-struct-scm-access
cps src op struct idx
(lambda (cps)
(with-cps cps
(letk k* ($kargs () () ($continue k src ($values (val)))))
(build-term
($continue k* src
($primcall 'struct-set! idx (struct val)))))))))
(define-primcall-converter struct-init!
(lambda (cps k src op param s val)
(define idx param)
(with-cps cps
(build-term
($continue k src
($primcall 'struct-set! idx (s val)))))))
(define-primcall-converter struct-ref
(lambda (cps k src op param struct idx)
(with-cps cps
(letv prim res)
(letk krecv ($kreceive '(res) #f k))
(letk kprim ($kargs ('prim) (prim)
($continue krecv src ($call prim (struct idx)))))
(build-term
($continue kprim src ($prim 'struct-ref))))))
(define-primcall-converter struct-set!
(lambda (cps k src op param struct idx val)
(with-cps cps
(letv prim res)
;; struct-set! prim returns the value.
(letk krecv ($kreceive '(res) #f k))
(letk kprim ($kargs ('prim) (prim)
($continue krecv src ($call prim (struct idx val)))))
(build-term
($continue kprim src ($prim 'struct-set!))))))
(define (untag-bytevector-index cps src op idx ulen width have-uidx)
(define not-fixnum
(vector (symbol->string op) 2 "small integer"))
(define out-of-range (vector (symbol->string op) 2))
(with-cps cps
(letv sidx uidx maxidx+1)
(letk knot-fixnum
($kargs () () ($throw src 'raise-type-error not-fixnum (idx))))
(letk kout-of-range
($kargs () () ($throw src 'raise-range-error out-of-range (idx))))
(let$ body (have-uidx uidx))
(letk k ($kargs () () ,body))
(letk ktestidx
($kargs ('maxidx+1) (maxidx+1)
($branch kout-of-range k src 'u64-< #f (uidx maxidx+1))))
(letk kdeclen
($kargs () ()
($continue ktestidx src
($primcall 'usub/immediate (1- width) (ulen)))))
(letk ktestlen
($kargs ('uidx) (uidx)
($branch kout-of-range kdeclen src 'imm-u64-< (1- width) (ulen))))
(letk kcvt
($kargs () ()
($continue ktestlen src ($primcall 's64->u64 #f (sidx)))))
(letk kbound0
($kargs ('sidx) (sidx)
($branch kcvt kout-of-range src 's64-imm-< 0 (sidx))))
(letk kuntag
($kargs () ()
($continue kbound0 src ($primcall 'untag-fixnum #f (idx)))))
(build-term ($branch knot-fixnum kuntag src 'fixnum? #f (idx)))))
(define (ensure-bytevector cps k src op pred x)
(define what
(match pred
('bytevector? "bytevector")
('mutable-bytevector? "mutable bytevector")))
(define bad-type (vector (symbol->string op) 1 what))
(with-cps cps
(letk kf ($kargs () () ($throw src 'raise-type-error bad-type (x))))
(letk kheap-object ($kargs () () ($branch kf k src pred #f (x))))
(build-term ($branch kf kheap-object src 'heap-object? #f (x)))))
(define (prepare-bytevector-access cps src op pred bv idx width
have-ptr-and-uidx)
(with-cps cps
(letv rlen)
(let$ access
(untag-bytevector-index
src op idx rlen width
(lambda (cps uidx)
(with-cps cps
(letv ptr)
(let$ body (have-ptr-and-uidx ptr uidx))
(letk k ($kargs ('ptr) (ptr) ,body))
(build-term
($continue k src
($primcall 'bv-contents #f (bv))))))))
(letk k ($kargs ('rlen) (rlen) ,access))
(letk klen
($kargs () ()
($continue k src
($primcall 'bv-length #f (bv)))))
($ (ensure-bytevector klen src op pred bv))))
(define (bytevector-ref-converter scheme-name ptr-op width kind)
(define (tag cps k src val)
(match kind
('unsigned
(if (< (ash 1 (* width 8)) (target-most-positive-fixnum))
(with-cps cps
(letv s)
(letk kcvt
($kargs ('s) (s)
($continue k src ($primcall 'tag-fixnum #f (s)))))
(build-term
($continue kcvt src ($primcall 'u64->s64 #f (val)))))
(with-cps cps
(build-term
($continue k src ($primcall 'u64->scm #f (val)))))))
('signed
(if (< (ash 1 (* width 8)) (target-most-positive-fixnum))
(with-cps cps
(build-term
($continue k src ($primcall 'tag-fixnum #f (val)))))
(with-cps cps
(build-term
($continue k src ($primcall 's64->scm #f (val)))))))
('float
(with-cps cps
(build-term
($continue k src ($primcall 'f64->scm #f (val))))))))
(lambda (cps k src op param bv idx)
(prepare-bytevector-access
cps src scheme-name 'bytevector? bv idx width
(lambda (cps ptr uidx)
(with-cps cps
(letv val)
(let$ body (tag k src val))
(letk ktag ($kargs ('val) (val) ,body))
(build-term
($continue ktag src
($primcall ptr-op 'bytevector (bv ptr uidx)))))))))
(define (bytevector-set-converter scheme-name ptr-op width kind)
(define out-of-range (vector (symbol->string scheme-name) 3))
(define (limit-urange cps src val uval hi in-range)
(with-cps cps
(letk kbad ($kargs () ()
($throw src 'raise-range-error out-of-range (val))))
(let$ body (in-range uval))
(letk k ($kargs () () ,body))
(build-term
($branch k kbad src 'imm-u64-< hi (uval)))))
(define (limit-srange cps src val sval lo hi in-range)
(with-cps cps
(letk kbad ($kargs () ()
($throw src 'raise-range-error out-of-range (val))))
(let$ body (in-range sval))
(letk k ($kargs () () ,body))
(letk k' ($kargs () ()
($branch k kbad src 's64-imm-< lo (sval))))
(build-term
($branch k' kbad src 'imm-s64-< hi (sval)))))
(define (integer-unboxer lo hi)
(lambda (cps src val have-val)
(cond
((<= hi (target-most-positive-fixnum))
(let ((have-val (if (zero? lo)
(lambda (cps s)
(with-cps cps
(letv u)
(let$ body (have-val u))
(letk k ($kargs ('u) (u) ,body))
(build-term
($continue k src
($primcall 's64->u64 #f (s))))))
have-val)))
(with-cps cps
(letv sval)
(letk kbad ($kargs () ()
($throw src 'raise-range-error out-of-range (val))))
(let$ body (have-val sval))
(letk k ($kargs () () ,body))
(letk khi ($kargs () ()
($branch k kbad src 'imm-s64-< hi (sval))))
(letk klo ($kargs ('sval) (sval)
($branch khi kbad src 's64-imm-< lo (sval))))
(letk kuntag
($kargs () ()
($continue klo src ($primcall 'untag-fixnum #f (val)))))
(build-term
($branch kbad kuntag src 'fixnum? #f (val))))))
((zero? lo)
(with-cps cps
(letv u)
(let$ body (limit-urange src val u hi have-val))
(letk khi ($kargs ('u) (u) ,body))
(build-term
($continue khi src ($primcall 'scm->u64 #f (val))))))
(else
(with-cps cps
(letv s)
(let$ body (limit-srange src val s lo hi have-val))
(letk khi ($kargs ('s) (s) ,body))
(build-term
($continue khi src ($primcall 'scm->s64 #f (val)))))))))
(define untag
(match kind
('unsigned (integer-unboxer 0 (1- (ash 1 (* width 8)))))
('signed (integer-unboxer (ash -1 (1- (* width 8)))
(1- (ash 1 (1- (* width 8))))))
('float
(lambda (cps src val have-val)
(with-cps cps
(letv f)
(let$ body (have-val f))
(letk k ($kargs ('f) (f) ,body))
(build-term
($continue k src ($primcall 'scm->f64 #f (val)))))))))
(lambda (cps k src op param bv idx val)
(prepare-bytevector-access
cps src scheme-name 'bytevector? bv idx width
(lambda (cps ptr uidx)
(untag
cps src val
(lambda (cps uval)
(with-cps cps
(build-term
($continue k src
($primcall ptr-op 'bytevector (bv ptr uidx uval)))))))))))
(define-syntax-rule (define-bytevector-ref-converter
cps-name scheme-name op width kind)
(define-primcall-converter cps-name
(bytevector-ref-converter 'scheme-name 'op width 'kind)))
(define-syntax-rule (define-bytevector-ref-converters (cvt ...) ...)
(begin
(define-bytevector-ref-converter cvt ...)
...))
(define-syntax-rule (define-bytevector-set-converter
cps-name scheme-name op width kind)
(define-primcall-converter cps-name
(bytevector-set-converter 'scheme-name 'op width 'kind)))
(define-syntax-rule (define-bytevector-set-converters (cvt ...) ...)
(begin
(define-bytevector-set-converter cvt ...)
...))
(define-primcall-converter bv-length
(lambda (cps k src op param bv)
(with-cps cps
(letv rlen)
(letk ktag ($kargs ('rlen) (rlen)
($continue k src ($primcall 'u64->scm #f (rlen)))))
(letk klen
($kargs () ()
($continue ktag src
($primcall 'bv-length #f (bv)))))
($ (ensure-bytevector klen src op 'bytevector? bv)))))
(define-bytevector-ref-converters
(bv-u8-ref bytevector-u8-ref u8-ref 1 unsigned)
(bv-u16-ref bytevector-u16-native-ref u16-ref 2 unsigned)
(bv-u32-ref bytevector-u32-native-ref u32-ref 4 unsigned)
(bv-u64-ref bytevector-u64-native-ref u64-ref 8 unsigned)
(bv-s8-ref bytevector-s8-ref s8-ref 1 signed)
(bv-s16-ref bytevector-s16-native-ref s16-ref 2 signed)
(bv-s32-ref bytevector-s32-native-ref s32-ref 4 signed)
(bv-s64-ref bytevector-s64-native-ref s64-ref 8 signed)
(bv-f32-ref bytevector-ieee-single-native-ref f32-ref 4 float)
(bv-f64-ref bytevector-ieee-double-native-ref f64-ref 8 float))
(define-bytevector-set-converters
(bv-u8-set! bytevector-u8-set! u8-set! 1 unsigned)
(bv-u16-set! bytevector-u16-native-set! u16-set! 2 unsigned)
(bv-u32-set! bytevector-u32-native-set! u32-set! 4 unsigned)
(bv-u64-set! bytevector-u64-native-set! u64-set! 8 unsigned)
(bv-s8-set! bytevector-s8-set! s8-set! 1 signed)
(bv-s16-set! bytevector-s16-native-set! s16-set! 2 signed)
(bv-s32-set! bytevector-s32-native-set! s32-set! 4 signed)
(bv-s64-set! bytevector-s64-native-set! s64-set! 8 signed)
(bv-f32-set! bytevector-ieee-single-native-set! f32-set! 4 float)
(bv-f64-set! bytevector-ieee-double-native-set! f64-set! 8 float))
(define (ensure-string cps src op x have-length)
(define not-string (vector (symbol->string op) 1 "string"))
(with-cps cps
(letv rlen)
(letk knot-string
($kargs () () ($throw src 'raise-type-error not-string (x))))
(let$ body (have-length rlen))
(letk k ($kargs ('rlen) (rlen) ,body))
(letk ks
($kargs () ()
($continue k src
($primcall 'string-length #f (x)))))
(letk kheap-object
($kargs () ()
($branch knot-string ks src 'string? #f (x))))
(build-term
($branch knot-string kheap-object src 'heap-object? #f (x)))))
(define-primcall-converter string-length
(lambda (cps k src op param x)
(ensure-string
cps src op x
(lambda (cps ulen)
(with-cps cps
(build-term
($continue k src ($primcall 'u64->scm #f (ulen)))))))))
(define-primcall-converter string-ref
(lambda (cps k src op param s idx)
(define out-of-range #("string-ref" 2))
(ensure-string
cps src op s
(lambda (cps ulen)
(with-cps cps
(letv uidx start upos buf ptr tag mask bits uwpos u32 uchar)
(letk kout-of-range
($kargs () ()
($throw src 'raise-range-error out-of-range (idx))))
(letk kchar
($kargs ('uchar) (uchar)
($continue k src
($primcall 'tag-char #f (uchar)))))
(letk kref
($kargs () ()
($continue kchar src
($primcall 'string-ref #f (s uidx)))))
(letk krange
($kargs ('uidx) (uidx)
($branch kout-of-range kref src 'u64-< #f (uidx ulen))))
(build-term
($continue krange src ($primcall 'scm->u64 #f (idx)))))))))
(define-primcall-converter string-set!
(lambda (cps k src op param s idx ch)
(define out-of-range #("string-set!" 2))
(define not-char #("string-set!" 3 "char"))
(define stringbuf-f-wide #x400)
(ensure-string
cps src op s
(lambda (cps ulen)
(with-cps cps
(letv uidx uchar)
(letk kout-of-range
($kargs () ()
($throw src 'raise-range-error out-of-range (idx))))
(letk knot-char
($kargs () () ($throw src 'raise-type-error not-char (ch))))
(letk kset
($kargs ('uchar) (uchar)
($continue k src
($primcall 'string-set! #f (s uidx uchar)))))
(letk kchar
($kargs () ()
($continue kset src ($primcall 'untag-char #f (ch)))))
(letk kchar?
($kargs () ()
($branch knot-char kchar src 'char? #f (ch))))
(letk krange
($kargs ('uidx) (uidx)
($branch kout-of-range kchar? src 'u64-< #f (uidx ulen))))
(build-term
($continue krange src ($primcall 'scm->u64 #f (idx)))))))))
(define-primcall-converter integer->char
(lambda (cps k src op param i)
(define not-fixnum #("integer->char" 1 "small integer"))
(define out-of-range #("integer->char" 1))
(define codepoint-surrogate-start #xd800)
(define codepoint-surrogate-end #xdfff)
(define codepoint-max #x10ffff)
(with-cps cps
(letv si ui)
(letk knot-fixnum
($kargs () () ($throw src 'raise-type-error not-fixnum (i))))
(letk kf
($kargs () () ($throw src 'raise-range-error out-of-range (i))))
(letk ktag ($kargs ('ui) (ui)
($continue k src ($primcall 'tag-char #f (ui)))))
(letk kt ($kargs () ()
($continue ktag src ($primcall 's64->u64 #f (si)))))
(letk kmax
($kargs () ()
($branch kt kf src 'imm-s64-< codepoint-max (si))))
(letk khi
($kargs () ()
($branch kf kmax src 'imm-s64-< codepoint-surrogate-end (si))))
(letk klo
($kargs () ()
($branch khi kt src 's64-imm-< codepoint-surrogate-start (si))))
(letk kbound0
($kargs ('si) (si)
($branch klo kf src 's64-imm-< 0 (si))))
(letk kuntag
($kargs () ()
($continue kbound0 src ($primcall 'untag-fixnum #f (i)))))
(build-term ($branch knot-fixnum kuntag src 'fixnum? #f (i))))))
(define-primcall-converter char->integer
(lambda (cps k src op param ch)
(define not-char #("char->integer" 1 "char"))
(with-cps cps
(letv ui si)
(letk knot-char
($kargs () () ($throw src 'raise-type-error not-char (ch))))
(letk ktag ($kargs ('si) (si)
($continue k src ($primcall 'tag-fixnum #f (si)))))
(letk kcvt ($kargs ('ui) (ui)
($continue ktag src ($primcall 'u64->s64 #f (ui)))))
(letk kuntag ($kargs () ()
($continue kcvt src ($primcall 'untag-char #f (ch)))))
(build-term
($branch knot-char kuntag src 'char? #f (ch))))))
(define (convert-shift cps k src op param obj idx)
(with-cps cps
(letv idx')
(letk k' ($kargs ('idx) (idx')
($continue k src ($primcall op param (obj idx')))))
(build-term ($continue k' src ($primcall 'scm->u64 #f (idx))))))
(define-primcall-converter rsh convert-shift)
(define-primcall-converter lsh convert-shift)
(define (ensure-atomic-box cps src op x is-atomic-box)
(define bad-type (vector (symbol->string op) 1 "atomic box"))
(with-cps cps
(letk kbad ($kargs () () ($throw src 'raise-type-error bad-type (x))))
(let$ body (is-atomic-box))
(letk k ($kargs () () ,body))
(letk kheap-object ($kargs () () ($branch kbad k src 'atomic-box? #f (x))))
(build-term ($branch kbad kheap-object src 'heap-object? #f (x)))))
(define-primcall-converter atomic-box-ref
(lambda (cps k src op param x)
(ensure-atomic-box
cps src 'atomic-box-ref x
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'atomic-box-ref #f (x)))))))))
(define-primcall-converter atomic-box-set!
(lambda (cps k src op param x val)
(ensure-atomic-box
cps src 'atomic-box-set! x
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'atomic-box-set! #f (x val)))))))))
(define-primcall-converter atomic-box-swap!
(lambda (cps k src op param x val)
(ensure-atomic-box
cps src 'atomic-box-swap! x
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'atomic-box-swap! #f (x val)))))))))
(define-primcall-converter atomic-box-compare-and-swap!
(lambda (cps k src op param x expected desired)
(ensure-atomic-box
cps src 'atomic-box-compare-and-swap! x
(lambda (cps)
(with-cps cps
(build-term
($continue k src
($primcall 'atomic-box-compare-and-swap! #f
(x expected desired)))))))))
;;; Guile's semantics are that a toplevel lambda captures a reference on
;;; the current module, and that all contained lambdas use that module
;;; to resolve toplevel variables. This parameter tracks whether or not
;;; we are in a toplevel lambda. If we are in a lambda, the parameter
;;; is bound to a fresh name identifying the module that was current
;;; when the toplevel lambda is defined.
;;;
;;; This is more complicated than it need be. Ideally we should resolve
;;; all toplevel bindings to bindings from specific modules, unless the
;;; binding is unbound. This is always valid if the compilation unit
;;; sets the module explicitly, as when compiling a module, but it
;;; doesn't work for files auto-compiled for use with `load'.
;;;
(define current-topbox-scope (make-parameter #f))
(define scope-counter (make-parameter #f))
(define (fresh-scope-id)
(let ((scope-id (scope-counter)))
(scope-counter (1+ scope-id))
scope-id))
;;; For calls to known imported values, we don't want to duplicate the
;;; "resolve the import" code at each call site. Instead we generate a
;;; stub per callee, and have callers call-label the callees.
;;;
(define module-call-stubs (make-parameter #f))
(define (module-call-label cps mod name public? nargs)
"Return three values: the new CPS, the label to call, and the value to
use as the proc slot."
(define call-stub-key (list mod name public? nargs))
(define var-cache-key (list mod name public?))
(define var-cache
(build-exp ($primcall 'cache-ref var-cache-key ())))
(match (assoc-ref (module-call-stubs) call-stub-key)
(#f
(let* ((trampoline-name (string->symbol
(format #f "~a~a~a"
name (if public? "@" "@@")
(string-join (map symbol->string mod)
"/"))))
(cached (fresh-var))
(args (let lp ((n 0))
(if (< n nargs)
(cons (fresh-var) (lp (1+ n)))
'())))
(argv (cons cached args))
(names (let lp ((n 0))
(if (< n (1+ nargs))
(cons (string->symbol
(string-append "arg" (number->string n)))
(lp (1+ n)))
'()))))
(with-cps cps
(letv fresh-var var proc)
(letk ktail ($ktail))
(letk kcall
($kargs ('proc) (proc)
($continue ktail #f ($call proc args))))
(letk kref
($kargs ('var) (var)
($continue kcall #f
($primcall 'box-ref #f (var)))))
(letk kcache2
($kargs () ()
($continue kref #f ($values (fresh-var)))))
(letk kcache
($kargs ('var) (fresh-var)
($continue kcache2 #f
($primcall 'cache-set! var-cache-key (fresh-var)))))
(letk klookup
($kargs () ()
($continue kcache #f
($primcall (if public?
'lookup-bound-public
'lookup-bound-private)
(list mod name) ()))))
(letk kcached
($kargs () ()
($continue kref #f ($values (cached)))))
(letk kentry
($kargs names argv
($branch klookup kcached #f 'heap-object? #f (cached))))
(letk kfun ($kfun #f `((name . ,trampoline-name)) #f ktail kentry))
($ ((lambda (cps)
(module-call-stubs
(acons call-stub-key kfun (module-call-stubs)))
(values cps kfun var-cache)))))))
(kfun
(values cps kfun var-cache))))
(define (toplevel-box cps src name bound? have-var)
(match (current-topbox-scope)
(#f
(with-cps cps
(letv mod name-var box)
(let$ body (have-var box))
(letk kbox ($kargs ('box) (box) ,body))
(letk kname ($kargs ('name) (name-var)
($continue kbox src
($primcall (if bound? 'lookup-bound 'lookup) #f
(mod name-var)))))
(letk kmod ($kargs ('mod) (mod)
($continue kname src ($const name))))
(build-term
($continue kmod src ($primcall 'current-module #f ())))))
(scope
(with-cps cps
(letv box)
(let$ body (have-var box))
(letk kbox ($kargs ('box) (box) ,body))
($ (convert-primcall kbox src 'cached-toplevel-box
(list scope name bound?)))))))
(define (module-box cps src module name public? bound? val-proc)
(with-cps cps
(letv box)
(let$ body (val-proc box))
(letk kbox ($kargs ('box) (box) ,body))
($ (convert-primcall kbox src 'cached-module-box
(list module name public? bound?)))))
(define (capture-toplevel-scope cps src scope-id k)
(with-cps cps
(letv module)
(let$ body (convert-primcall k src 'cache-current-module!
(list scope-id) module))
(letk kmodule ($kargs ('module) (module) ,body))
($ (convert-primcall kmodule src 'current-module #f))))
(define (fold-formals proc seed arity gensyms inits)
(match arity
(($ $arity req opt rest kw allow-other-keys?)
(let ()
(define (fold-req names gensyms seed)
(match names
(() (fold-opt opt gensyms inits seed))
((name . names)
(proc name (car gensyms) #f
(fold-req names (cdr gensyms) seed)))))
(define (fold-opt names gensyms inits seed)
(match names
(() (fold-rest rest gensyms inits seed))
((name . names)
(proc name (car gensyms) (car inits)
(fold-opt names (cdr gensyms) (cdr inits) seed)))))
(define (fold-rest rest gensyms inits seed)
(match rest
(#f (fold-kw kw gensyms inits seed))
(name (proc name (car gensyms) #f
(fold-kw kw (cdr gensyms) inits seed)))))
(define (fold-kw kw gensyms inits seed)
(match kw
(()
(unless (null? gensyms)
(error "too many gensyms"))
(unless (null? inits)
(error "too many inits"))
seed)
(((key name var) . kw)
;; Could be that var is not a gensym any more.
(when (symbol? var)
(unless (eq? var (car gensyms))
(error "unexpected keyword arg order")))
(proc name (car gensyms) (car inits)
(fold-kw kw (cdr gensyms) (cdr inits) seed)))))
(fold-req req gensyms seed)))))
(define (init-default-value cps name sym subst init body)
(match (hashq-ref subst sym)
((orig-var subst-var box?)
(let ((src (tree-il-srcv init)))
(define (maybe-box cps k make-body)
(if box?
(with-cps cps
(letv phi)
(let$ body (convert-primcall k src 'box #f phi))
(letk kbox ($kargs (name) (phi) ,body))
($ (make-body kbox)))
(make-body cps k)))
(with-cps cps
(letk knext ($kargs (name) (subst-var) ,body))
($ (maybe-box
knext
(lambda (cps k)
(with-cps cps
(letk kbound ($kargs () () ($continue k src
($values (orig-var)))))
(letv val rest)
(letk krest ($kargs (name 'rest) (val rest)
($continue k src ($values (val)))))
(letk kreceive ($kreceive (list name) 'rest krest))
(let$ init (convert init kreceive subst))
(letk kunbound ($kargs () () ,init))
(build-term
($branch kbound kunbound src
'undefined? #f (orig-var))))))))))))
(define (build-list cps k src vals)
(match vals
(()
(with-cps cps
(build-term ($continue k src ($const '())))))
((v . vals)
(with-cps cps
(letv tail)
(let$ head (convert-primcall k src 'cons #f v tail))
(letk ktail ($kargs ('tail) (tail) ,head))
($ (build-list ktail src vals))))))
(define (sanitize-meta meta)
(match meta
(() '())
(((k . v) . meta)
(let ((meta (sanitize-meta meta)))
(case k
((arg-representations noreturn return-type maybe-unused) meta)
(else (acons k v meta)))))))
;;; The conversion from Tree-IL to CPS essentially wraps every
;;; expression in a $kreceive, which models the Tree-IL semantics that
;;; extra values are simply truncated. In CPS, this means that the
;;; $kreceive has a rest argument after the required arguments, if any,
;;; and that the rest argument is unused.
;;;
;;; All CPS expressions that can return a variable number of values
;;; (i.e., $call and $abort) must continue to $kreceive, which checks
;;; the return arity and on success passes the parsed values along to a
;;; $kargs. If the $call or $abort is in tail position they continue to
;;; $ktail instead, and then the values are parsed by the $kreceive of
;;; the non-tail caller.
;;;
;;; Other CPS terms like $values, $const, and the like all have a
;;; specific return arity, and must continue to $kargs instead of
;;; $kreceive or $ktail. This allows the compiler to reason precisely
;;; about their result values. To make sure that this is the case,
;;; whenever the CPS conversion would reify one of these terms it needs
;;; to ensure that the continuation actually accepts the return arity of
;;; the primcall.
;;;
;;; Some Tree-IL primcalls residualize CPS primcalls that return zero
;;; values, for example box-set!. In this case the Tree-IL semantics
;;; are that the result of the expression is the undefined value. That
;;; is to say, the result of this expression is #t:
;;;
;;; (let ((x 30)) (eq? (set! x 10) (if #f #f)))
;;;
;;; So in the case that the continuation expects a value but the
;;; primcall produces zero values, we insert the "unspecified" value.
;;;
(define (adapt-arity cps k src nvals)
(match nvals
(0
;; As mentioned above, in the Tree-IL semantics the primcall
;; produces the unspecified value, but in CPS it produces no
;; values. Therefore we plug the unspecified value into the
;; continuation.
(match (intmap-ref cps k)
(($ $ktail)
(with-cps cps
(let$ body (with-cps-constants ((unspecified *unspecified*))
(build-term
($continue k src ($values (unspecified))))))
(letk kvoid ($kargs () () ,body))
kvoid))
(($ $kargs ()) (with-cps cps k))
(($ $kreceive arity kargs)
(match arity
(($ $arity () () (not #f) () #f)
(with-cps cps
(letk kvoid ($kargs () () ($continue kargs src ($const '()))))
kvoid))
(($ $arity (_) () #f () #f)
(with-cps cps
(letk kvoid ($kargs () ()
($continue kargs src ($const *unspecified*))))
kvoid))
(($ $arity (_) () _ () #f)
(with-cps cps
(let$ void (with-cps-constants ((unspecified *unspecified*)
(rest '()))
(build-term
($continue kargs src
($values (unspecified rest))))))
(letk kvoid ($kargs () () ,void))
kvoid))
(_
;; Arity mismatch. Serialize a values call.
(with-cps cps
(letv values)
(let$ void (with-cps-constants ((unspecified *unspecified*))
(build-term
($continue k src
($call values (unspecified))))))
(letk kvoid ($kargs ('values) (values) ,void))
(letk kvalues ($kargs () ()
($continue kvoid src ($prim 'values))))
kvalues))))))
(1
(match (intmap-ref cps k)
(($ $ktail)
(with-cps cps
(letv val)
(letk kval ($kargs ('val) (val)
($continue k src ($values (val)))))
kval))
(($ $kargs (_)) (with-cps cps k))
(($ $kreceive arity kargs)
(match arity
(($ $arity () () (not #f) () #f)
(with-cps cps
(letv val)
(let$ body (with-cps-constants ((nil '()))
($ (convert-primcall kargs src 'cons #f
val nil))))
(letk kval ($kargs ('val) (val) ,body))
kval))
(($ $arity (_) () #f () #f)
(with-cps cps
kargs))
(($ $arity (_) () _ () #f)
(with-cps cps
(letv val)
(let$ body (with-cps-constants ((rest '()))
(build-term
($continue kargs src ($values (val rest))))))
(letk kval ($kargs ('val) (val) ,body))
kval))
(_
;; Arity mismatch. Serialize a values call.
(with-cps cps
(letv val values)
(letk kvalues ($kargs ('values) (values)
($continue k src
($call values (val)))))
(letk kval ($kargs ('val) (val)
($continue kvalues src ($prim 'values))))
kval))))))))
(define *custom-primcall-converters* (make-hash-table))
(define-syntax-rule
(define-custom-primcall-converter (name cps src args convert-args k)
. body)
(let ((convert (lambda (cps src args convert-args k) . body)))
(hashq-set! *custom-primcall-converters* 'name convert)))
(define (custom-primcall-converter name)
(hashq-ref *custom-primcall-converters* name))
(define-custom-primcall-converter (throw cps src args convert-args k)
(define (fallback)
(convert-args cps args
(lambda (cps args)
(match args
((key . args)
(with-cps cps
(letv arglist)
(letk kargs ($kargs ('arglist) (arglist)
($throw src 'throw #f (key arglist))))
($ (build-list kargs src args))))))))
(define (specialize op param . args)
(convert-args cps args
(lambda (cps args)
(with-cps cps
(build-term
($throw src op param args))))))
(match args
((($ <const> _ key) ($ <const> _ subr) ($ <const> _ msg) args data)
;; Specialize `throw' invocations corresponding to common
;; "error" invocations.
(let ()
(match (vector args data)
(#(($ <primcall> _ 'cons (x ($ <const> _ ())))
($ <primcall> _ 'cons (x ($ <const> _ ()))))
(specialize 'throw/value+data `#(,key ,subr ,msg) x))
(#(($ <primcall> _ 'cons (x ($ <const> _ ()))) ($ <const> _ #f))
(specialize 'throw/value `#(,key ,subr ,msg) x))
(_ (fallback)))))
(_ (fallback))))
(define-custom-primcall-converter (raise-exception cps src args convert-args k)
;; When called with just one arg, we know that raise-exception is
;; non-continuing, and so we can prune the graph at its continuation.
;; This improves flow analysis, because the path that leads to the
;; raise-exception doesn't rejoin the graph.
(convert-args cps args
(lambda (cps args)
(match args
((exn)
(with-cps cps
(build-term
($throw src 'raise-exception #f (exn)))))))))
(define-custom-primcall-converter (raise-type-error cps src args convert-args k)
(match args
((($ <const> _ #((? string? proc-name)
(? exact-integer? pos)
(? string? what)))
val)
;; When called with just one arg, we know that raise-exception is
;; non-continuing, and so we can prune the graph at its continuation.
;; This improves flow analysis, because the path that leads to the
;; raise-exception doesn't rejoin the graph.
(convert-args cps (list val)
(lambda (cps vals)
(with-cps cps
(build-term
($throw src 'raise-type-error (vector proc-name pos what)
vals))))))))
(define-custom-primcall-converter (values cps src args convert-args k)
(convert-args cps args
(lambda (cps args)
(match (intmap-ref cps k)
(($ $ktail)
(with-cps cps
(build-term
($continue k src ($values args)))))
(($ $kargs names)
;; Can happen if continuation already saw we produced the
;; right number of values.
(with-cps cps
(build-term
($continue k src ($values args)))))
(($ $kreceive ($ $arity req () rest () #f) kargs)
(cond
((and (not rest) (= (length args) (length req)))
(with-cps cps
(build-term
($continue kargs src ($values args)))))
((and rest (>= (length args) (length req)))
(with-cps cps
(letv rest)
(letk krest ($kargs ('rest) (rest)
($continue kargs src
($values ,(append (list-head args (length req))
(list rest))))))
($ (build-list krest src (list-tail args (length req))))))
(else
;; Number of values mismatch; reify a values call.
(with-cps cps
(letv val values)
(letk kvalues ($kargs ('values) (values)
($continue k src ($call values args))))
(build-term ($continue kvalues src ($prim 'values)))))))))))
;; cps exp k-name alist -> cps term
(define (convert cps exp k subst)
(define (zero-valued? exp)
(match exp
((or ($ <module-set>) ($ <toplevel-set>) ($ <toplevel-define>)
($ <lexical-set>))
#t)
(($ <let> src names syms vals body) (zero-valued? body))
;; Can't use <fix> here as the hack that <fix> uses to convert its
;; functions relies on continuation being single-valued.
;; (($ <fix> src names syms vals body) (zero-valued? body))
(($ <let-values> src exp body) (zero-valued? body))
(($ <seq> src head tail) (zero-valued? tail))
(($ <primcall> src 'values args) (= (length args) 0))
(($ <primcall> src name args)
(match (tree-il-primitive->cps-primitive+nargs+nvalues name)
(#f #f)
(#(cps-prim nargs nvalues)
(and (eqv? nvalues 0)
(eqv? nargs (length args))))))
(_ #f)))
(define (single-valued? exp)
(match exp
((or ($ <void>) ($ <const>) ($ <primitive-ref>) ($ <module-ref>)
($ <toplevel-ref>) ($ <lambda>))
#t)
(($ <let> src names syms vals body) (single-valued? body))
(($ <fix> src names syms vals body) (single-valued? body))
(($ <let-values> src exp body) (single-valued? body))
(($ <seq> src head tail) (single-valued? tail))
(($ <primcall> src 'values args) (= (length args) 1))
(($ <primcall> src name args)
(match (tree-il-primitive->cps-primitive+nargs+nvalues name)
(#f #f)
(#(cps-prim nargs nvalues)
(and (eqv? nvalues 1)
(eqv? nargs (length args))))))
(_ #f)))
;; exp (v-name -> term) -> term
(define (convert-arg cps exp k)
(match exp
(($ <lexical-ref> src name sym)
(match (hashq-ref subst sym)
((orig-var box #t)
(with-cps cps
(letv unboxed)
(let$ body (k unboxed))
(letk kunboxed ($kargs ('unboxed) (unboxed) ,body))
(build-term ($continue kunboxed src
($primcall 'box-ref #f (box))))))
((orig-var subst-var #f) (k cps subst-var))
(var (k cps var))))
((? single-valued?)
(with-cps cps
(letv arg)
(let$ body (k arg))
(letk karg ($kargs ('arg) (arg) ,body))
($ (convert exp karg subst))))
(_
(with-cps cps
(letv arg rest)
(let$ body (k arg))
(letk karg ($kargs ('arg 'rest) (arg rest) ,body))
(letk kreceive ($kreceive '(arg) 'rest karg))
($ (convert exp kreceive subst))))))
;; (exp ...) ((v-name ...) -> term) -> term
(define (convert-args cps exps k)
(match exps
(() (k cps '()))
((exp . exps)
(convert-arg cps exp
(lambda (cps name)
(convert-args cps exps
(lambda (cps names)
(k cps (cons name names)))))))))
(define (box-bound-var cps name sym body)
(match (hashq-ref subst sym)
((orig-var subst-var #t)
(with-cps cps
(letk k ($kargs (name) (subst-var) ,body))
($ (convert-primcall k #f 'box #f orig-var))))
(else
(with-cps cps body))))
(define (box-bound-vars cps names syms body)
(match (vector names syms)
(#((name . names) (sym . syms))
(with-cps cps
(let$ body (box-bound-var name sym body))
($ (box-bound-vars names syms body))))
(#(() ()) (with-cps cps body))))
(define (bound-var sym)
(match (hashq-ref subst sym)
((var . _) var)
((? exact-integer? var) var)))
(match exp
(($ <lexical-ref> src name sym)
(with-cps cps
(let$ k (adapt-arity k src 1))
(rewrite-term (hashq-ref subst sym)
((orig-var box #t) ($continue k src
($primcall 'box-ref #f (box))))
((orig-var subst-var #f) ($continue k src ($values (subst-var))))
(var ($continue k src ($values (var)))))))
(($ <void> src)
(with-cps cps
(let$ k (adapt-arity k src 1))
(build-term ($continue k src ($const *unspecified*)))))
(($ <const> src exp)
(with-cps cps
(let$ k (adapt-arity k src 1))
(build-term ($continue k src ($const exp)))))
(($ <primitive-ref> src name)
(with-cps cps
(let$ k (adapt-arity k src 1))
(build-term ($continue k src ($prim name)))))
(($ <lambda> fun-src meta body)
(let ()
(define (convert-clauses cps body ktail)
(match body
(#f (values cps #f))
(($ <lambda-case> src req opt rest kw inits gensyms body alternate)
(let* ((arity (make-$arity req (or opt '()) rest
(map (match-lambda
((kw name sym)
(list kw name (bound-var sym))))
(if kw (cdr kw) '()))
(and kw (car kw))))
(names (fold-formals (lambda (name sym init names)
(cons name names))
'()
arity gensyms inits)))
(define (fold-formals* cps f seed arity gensyms inits)
(match (fold-formals
(lambda (name sym init cps+seed)
(match cps+seed
((cps . seed)
(call-with-values (lambda ()
(f cps name sym init seed))
(lambda (cps seed) (cons cps seed))))))
(cons cps seed) arity gensyms inits)
((cps . seed) (values cps seed))))
(with-cps cps
(let$ kalt (convert-clauses alternate ktail))
(let$ body (convert body ktail subst))
(let$ body
(fold-formals*
(lambda (cps name sym init body)
(if init
(init-default-value cps name sym subst init body)
(box-bound-var cps name sym body)))
body arity gensyms inits))
(letk kargs ($kargs names (map bound-var gensyms) ,body))
(letk kclause ($kclause ,arity kargs kalt))
kclause)))))
(if (current-topbox-scope)
(with-cps cps
(letv self)
(letk ktail ($ktail))
(let$ kclause (convert-clauses body ktail))
(letk kfun ($kfun fun-src (sanitize-meta meta) self ktail kclause))
(let$ k (adapt-arity k fun-src 1))
(build-term ($continue k fun-src ($fun kfun))))
(let ((scope-id (fresh-scope-id)))
(with-cps cps
(let$ body ((lambda (cps)
(parameterize ((current-topbox-scope scope-id))
(convert cps exp k subst)))))
(letk kscope ($kargs () () ,body))
($ (capture-toplevel-scope fun-src scope-id kscope)))))))
(($ <module-ref> src mod name public?)
(module-box
cps src mod name public? #t
(lambda (cps box)
(with-cps cps
(let$ k (adapt-arity k src 1))
(build-term ($continue k src
($primcall 'box-ref #f (box))))))))
(($ <module-set> src mod name public? exp)
(convert-arg cps exp
(lambda (cps val)
(module-box
cps src mod name public? #t
(lambda (cps box)
(with-cps cps
(let$ k (adapt-arity k src 0))
(build-term
($continue k src
($primcall 'box-set! #f (box val))))))))))
(($ <toplevel-ref> src mod name)
(toplevel-box
cps src name #t
(lambda (cps box)
(with-cps cps
(let$ k (adapt-arity k src 1))
(build-term
($continue k src
($primcall 'box-ref #f (box))))))))
(($ <toplevel-set> src mod name exp)
(convert-arg cps exp
(lambda (cps val)
(toplevel-box
cps src name #f
(lambda (cps box)
(with-cps cps
(let$ k (adapt-arity k src 0))
(build-term
($continue k src
($primcall 'box-set! #f (box val))))))))))
(($ <toplevel-define> src modname name exp)
(convert-arg cps exp
(lambda (cps val)
(with-cps cps
(let$ k (adapt-arity k src 0))
(letv box mod)
(letk kset ($kargs ('box) (box)
($continue k src
($primcall 'box-set! #f (box val)))))
($ (with-cps-constants ((name name))
(letk kmod
($kargs ('mod) (mod)
($continue kset src
($primcall 'define! #f (mod name)))))
(build-term
($continue kmod src ($primcall 'current-module #f ())))))))))
(($ <call> src ($ <module-ref> src2 mod name public?) args)
(convert-args cps args
(lambda (cps args)
(call-with-values
(lambda () (module-call-label cps mod name public? (length args)))
(lambda (cps kfun proc-exp)
(with-cps cps
(letv cache)
(letk kcall ($kargs ('cache) (cache)
($continue k src
($callk kfun #f ,(cons cache args)))))
(build-term
($continue kcall src2 ,proc-exp))))))))
(($ <call> src proc args)
(convert-args cps (cons proc args)
(match-lambda*
((cps (proc . args))
(with-cps cps
(build-term ($continue k src ($call proc args))))))))
(($ <primcall> src name args)
(cond
((custom-primcall-converter name)
=> (lambda (convert-primcall)
(convert-primcall cps src args convert-args k)))
((tree-il-primitive->cps-primitive+nargs+nvalues name)
=>
(match-lambda
(#(cps-prim nargs nvalues)
(define (cvt cps k src op args)
(define (default)
(convert-args cps args
(lambda (cps args)
(with-cps cps
($ (convert-primcall* k src op #f args))))))
(define-syntax-rule (specialize-case (pat (op c (arg ...))) ...
(_ def))
(match (cons cps-prim args)
(pat
(convert-args cps (list arg ...)
(lambda (cps args)
(with-cps cps
($ (convert-primcall* k src 'op c args))))))
...
(_ def)))
(define (uint? val) (and (exact-integer? val) (<= 0 val)))
(define (vector-index? val)
(and (exact-integer? val)
(<= 0 val (1- (target-max-vector-length)))))
(define (vector-size? val)
(and (exact-integer? val)
(<= 0 val (target-max-vector-length))))
(define (negint? val) (and (exact-integer? val) (< val 0)))
;; FIXME: Add case for mul
(specialize-case
(('allocate-vector ($ <const> _ n))
(allocate-vector n ()))
(('make-vector ($ <const> _ (? vector-size? n)) init)
(make-vector/immediate n (init)))
(('vector-ref v ($ <const> _ (? vector-index? n)))
(vector-ref/immediate n (v)))
(('vector-set! v ($ <const> _ (? vector-index? n)) x)
(vector-set!/immediate n (v x)))
(('vector-init! v ($ <const> _ n) x)
(vector-init! n (v x)))
(('allocate-struct v ($ <const> _ n))
(allocate-struct n (v)))
(('struct-ref s ($ <const> _ (? uint? n)))
(struct-ref/immediate n (s)))
(('struct-set! s ($ <const> _ (? uint? n)) x)
(struct-set!/immediate n (s x)))
(('struct-init! s ($ <const> _ n) x)
(struct-init! n (s x)))
(('add x ($ <const> _ (? number? y)))
(add/immediate y (x)))
(('add ($ <const> _ (? number? y)) x)
(add/immediate y (x)))
(('sub x ($ <const> _ (? number? y)))
(sub/immediate y (x)))
(('lsh x ($ <const> _ (? uint? y)))
(lsh/immediate y (x)))
(('rsh x ($ <const> _ (? uint? y)))
(rsh/immediate y (x)))
(('logand x ($ <const> _ (? exact-integer? y)))
(logand/immediate y (x)))
(('logand ($ <const> _ (? exact-integer? x)) y)
(logand/immediate x (y)))
(_
(default))))
;; Tree-IL primcalls are sloppy, in that it could be that
;; they are called with too many or too few arguments. In
;; CPS we are more strict and only residualize a $primcall
;; if the argument count matches.
(if (= nargs (length args))
(with-cps cps
(let$ k (adapt-arity k src nvalues))
($ (cvt k src cps-prim args)))
(convert-args cps args
(lambda (cps args)
(with-cps cps
(letv prim)
(letk kprim ($kargs ('prim) (prim)
($continue k src ($call prim args))))
(build-term ($continue kprim src ($prim name))))))))))
(else
;; We have something that's a primcall for Tree-IL but not for
;; CPS; compile as a call.
(convert-args cps args
(lambda (cps args)
(with-cps cps
(letv prim)
(letk kprim ($kargs ('prim) (prim)
($continue k src ($call prim args))))
(build-term ($continue kprim src ($prim name)))))))))
;; Prompts with inline handlers.
(($ <prompt> src escape-only? tag body
($ <lambda> hsrc hmeta
($ <lambda-case> _ hreq #f hrest #f () hsyms hbody #f)))
;; Handler:
;; khargs: check args returned to handler, -> khbody
;; khbody: the handler, -> k
;;
;; Post-body:
;; krest: collect return vals from body to list, -> kpop
;; kpop: pop the prompt, -> kprim
;; kprim: load the values primitive, -> kret
;; kret: (apply values rvals), -> k
;;
;; Escape prompts evaluate the body with the continuation of krest.
;; Otherwise we do a no-inline call to body, continuing to krest.
(convert-arg cps tag
(lambda (cps tag)
(let ((hnames (append hreq (if hrest (list hrest) '())))
(bound-vars (map bound-var hsyms)))
(define (convert-body cps khargs krest)
(if escape-only?
(with-cps cps
(let$ body (convert body krest subst))
(letk kbody ($kargs () () ,body))
(build-term ($prompt kbody khargs src #t tag)))
(convert-arg cps body
(lambda (cps thunk)
(with-cps cps
(letk kbody ($kargs () ()
($continue krest (tree-il-srcv body)
($primcall 'call-thunk/no-inline #f
(thunk)))))
(build-term ($prompt kbody khargs (tree-il-srcv body)
#f tag)))))))
(with-cps cps
(letv prim vals apply)
(let$ hbody (convert hbody k subst))
(let$ hbody (box-bound-vars hnames hsyms hbody))
(letk khbody ($kargs hnames bound-vars ,hbody))
(letk khargs ($kreceive hreq hrest khbody))
(letk kapp ($kargs ('apply) (apply)
($continue k src ($call apply (prim vals)))))
(letk kprim ($kargs ('prim) (prim)
($continue kapp src ($prim 'apply))))
(letk kret ($kargs () ()
($continue kprim src ($prim 'values))))
(letk kpop ($kargs ('rest) (vals)
($continue kret src ($primcall 'unwind #f ()))))
;; FIXME: Attach hsrc to $kreceive.
(letk krest ($kreceive '() 'rest kpop))
($ (convert-body khargs krest)))))))
(($ <abort> src tag args ($ <const> _ ()))
(convert-args cps (cons tag args)
(lambda (cps args*)
(with-cps cps
(letv abort)
(letk kabort ($kargs ('abort) (abort)
($continue k src ($call abort args*))))
(build-term
($continue kabort src ($prim 'abort-to-prompt)))))))
(($ <abort> src tag args tail)
(convert-args cps
(append (list (make-primitive-ref #f 'apply)
(make-primitive-ref #f 'abort-to-prompt)
tag)
args
(list tail))
(lambda (cps args*)
(match args*
((apply . apply-args)
(with-cps cps
(build-term ($continue k src ($call apply apply-args)))))))))
(($ <conditional> src test consequent alternate)
(define (convert-test cps test kt kf)
(match test
(($ <primcall> src 'eq? (a ($ <const> _ b)))
(convert-arg cps a
(lambda (cps a)
(with-cps cps
(build-term ($branch kf kt src 'eq-constant? b (a)))))))
(($ <primcall> src 'eq? (($ <const> _ a) b))
(convert-arg cps b
(lambda (cps b)
(with-cps cps
(build-term ($branch kf kt src 'eq-constant? a (b)))))))
(($ <primcall> src (? branching-primitive? name) args)
(convert-args cps args
(lambda (cps args)
(cond
((heap-type-predicate? name)
(with-cps cps
(letk kt* ($kargs () ()
($branch kf kt src name #f args)))
(build-term
($branch kf kt* src 'heap-object? #f args))))
((number-type-predicate? name)
(match args
((arg)
(define not-number
(vector (symbol->string name) 1 "number"))
(with-cps cps
(letk kerr
($kargs () ()
($throw src 'raise-type-error not-number (arg))))
(letk ktest ($kargs () ()
($branch kf kt src name #f (arg))))
(build-term
($branch kerr ktest src 'number? #f (arg)))))))
(else
(with-cps cps
(build-term ($branch kf kt src name #f args))))))))
(($ <conditional> src test consequent alternate)
(with-cps cps
(let$ t (convert-test consequent kt kf))
(let$ f (convert-test alternate kt kf))
(letk kt* ($kargs () () ,t))
(letk kf* ($kargs () () ,f))
($ (convert-test test kt* kf*))))
(($ <const> src c)
(with-cps cps
(build-term ($continue (if c kt kf) src ($values ())))))
(_ (convert-arg cps test
(lambda (cps test)
(with-cps cps
(build-term ($branch kt kf src 'false? #f (test)))))))))
(with-cps cps
(let$ t (convert consequent k subst))
(let$ f (convert alternate k subst))
(letk kt ($kargs () () ,t))
(letk kf ($kargs () () ,f))
($ (convert-test test kt kf))))
(($ <lexical-set> src name gensym exp)
(convert-arg cps exp
(lambda (cps exp)
(match (hashq-ref subst gensym)
((orig-var box #t)
(with-cps cps
(let$ k (adapt-arity k src 0))
(build-term
($continue k src
($primcall 'box-set! #f (box exp))))))))))
(($ <seq> src head tail)
(if (zero-valued? head)
(with-cps cps
(let$ tail (convert tail k subst))
(letk kseq ($kargs () () ,tail))
($ (convert head kseq subst)))
(with-cps cps
(let$ tail (convert tail k subst))
(letv vals)
(letk kseq ($kargs ('vals) (vals) ,tail))
(letk kreceive ($kreceive '() 'vals kseq))
($ (convert head kreceive subst)))))
(($ <let> src names syms vals body)
(let lp ((cps cps) (names names) (syms syms) (vals vals))
(match (list names syms vals)
((() () ()) (convert cps body k subst))
(((name . names) (sym . syms) (val . vals))
(with-cps cps
(let$ body (lp names syms vals))
(let$ body (box-bound-var name sym body))
($ ((lambda (cps)
(if (single-valued? val)
(with-cps cps
(letk klet ($kargs (name) ((bound-var sym)) ,body))
($ (convert val klet subst)))
(with-cps cps
(letv rest)
(letk klet ($kargs (name 'rest) ((bound-var sym) rest) ,body))
(letk kreceive ($kreceive (list name) 'rest klet))
($ (convert val kreceive subst))))))))))))
(($ <fix> src names gensyms funs body)
;; Some letrecs can be contified; that happens later.
(define (convert-funs cps funs)
(match funs
(()
(with-cps cps '()))
((fun . funs)
(with-cps cps
(let$ fun (convert fun k subst))
(let$ funs (convert-funs funs))
(cons (match fun
(($ $continue _ _ (and fun ($ $fun)))
fun))
funs)))))
(if (current-topbox-scope)
(let ((vars (map bound-var gensyms)))
(with-cps cps
(let$ body (convert body k subst))
(letk krec ($kargs names vars ,body))
(let$ funs (convert-funs funs))
(build-term ($continue krec src ($rec names vars funs)))))
(let ((scope-id (fresh-scope-id)))
(with-cps cps
(let$ body ((lambda (cps)
(parameterize ((current-topbox-scope scope-id))
(convert cps exp k subst)))))
(letk kscope ($kargs () () ,body))
($ (capture-toplevel-scope src scope-id kscope))))))
(($ <let-values> src exp
($ <lambda-case> lsrc req #f rest #f () syms body #f))
(let ((names (append req (if rest (list rest) '())))
(bound-vars (map bound-var syms)))
(with-cps cps
(let$ body (convert body k subst))
(let$ body (box-bound-vars names syms body))
(letk kargs ($kargs names bound-vars ,body))
(letk kreceive ($kreceive req rest kargs))
($ (convert exp kreceive subst)))))))
(define (build-subst exp)
"Compute a mapping from lexical gensyms to CPS variable indexes. CPS
uses small integers to identify variables, instead of gensyms.
This subst table serves an additional purpose of mapping variables to
replacements. The usual reason to replace one variable by another is
assignment conversion. Default argument values is the other reason.
The result is a hash table mapping symbols to substitutions (in the case
that a variable is substituted) or to indexes. A substitution is a list
of the form:
(ORIG-INDEX SUBST-INDEX BOXED?)
A true value for BOXED? indicates that the replacement variable is in a
box. If a variable is not substituted, the mapped value is a small
integer."
(let ((table (make-hash-table)))
(define (down exp)
(match exp
(($ <lexical-set> src name sym exp)
(match (hashq-ref table sym)
((orig subst #t) #t)
((orig subst #f) (hashq-set! table sym (list orig subst #t)))
((? number? idx) (hashq-set! table sym (list idx (fresh-var) #t)))))
(($ <lambda-case> src req opt rest kw inits gensyms body alternate)
(fold-formals (lambda (name sym init seed)
(hashq-set! table sym
(if init
(list (fresh-var) (fresh-var) #f)
(fresh-var))))
#f
(make-$arity req (or opt '()) rest
(if kw (cdr kw) '()) (and kw (car kw)))
gensyms
inits))
(($ <let> src names gensyms vals body)
(for-each (lambda (sym)
(hashq-set! table sym (fresh-var)))
gensyms))
(($ <fix> src names gensyms vals body)
(for-each (lambda (sym)
(hashq-set! table sym (fresh-var)))
gensyms))
(_ #t))
(values))
(define (up exp) (values))
((make-tree-il-folder) exp down up)
table))
(define (cps-convert/thunk exp)
(parameterize ((label-counter 0)
(var-counter 0)
(scope-counter 0)
(module-call-stubs '()))
(with-cps empty-intmap
(letv init)
;; Allocate kinit first so that we know that the entry point's
;; label is zero. This simplifies data flow in the compiler if we
;; can just pass around the program as a map of continuations and
;; know that the entry point is label 0.
(letk kinit ,#f)
(letk ktail ($ktail))
(let$ body (convert exp ktail (build-subst exp)))
(letk kbody ($kargs () () ,body))
(letk kclause ($kclause ('() '() #f '() #f) kbody #f))
($ ((lambda (cps)
(let ((init (build-cont
($kfun (tree-il-srcv exp) '() init ktail kclause))))
(with-cps (persistent-intmap (intmap-replace! cps kinit init))
kinit))))))))
(define (canonicalize exp)
(define (reduce-conditional exp)
(match exp
(($ <conditional> src
($ <conditional> _ test ($ <const> _ t) ($ <const> _ f))
consequent alternate)
(cond
((and t (not f))
(reduce-conditional (make-conditional src test consequent alternate)))
((and (not t) f)
(reduce-conditional (make-conditional src test alternate consequent)))
(else
exp)))
(_ exp)))
(define (evaluate-args-eagerly-if-needed src inits k)
;; Some macros generate calls to "vector" or "list" with like 300
;; arguments. Since we eventually compile to lower-level operations
;; like make-vector and vector-set! or cons, it reduces live
;; variable pressure to sink initializers if we can, if we can prove
;; that the initializer can't capture the continuation. (More on
;; that caveat here:
;; http://wingolog.org/archives/2013/11/02/scheme-quiz-time).
;;
;; Normally we would do this transformation in the optimizer, but
;; it's quite tricky there and quite easy here, so we do it here.
(match inits
(() (k '()))
((init . inits)
(match init
((or ($ <const>) ($ <void>) ($ <lambda>) ($ <lexical-ref>))
(evaluate-args-eagerly-if-needed
src inits (lambda (inits) (k (cons init inits)))))
(_
(with-lexicals src (init)
(evaluate-args-eagerly-if-needed
src inits (lambda (inits) (k (cons init inits))))))))))
(post-order
(lambda (exp)
(match exp
(($ <conditional>)
(reduce-conditional exp))
(($ <primcall> src '<= (a b))
;; No need to reduce as <= is a branching primitive.
(make-conditional src (make-primcall src '<= (list a b))
(make-const src #t)
(make-const src #f)))
(($ <primcall> src '>= (a b))
;; No need to reduce as < is a branching primitive.
(make-conditional src (make-primcall src '<= (list b a))
(make-const src #t)
(make-const src #f)))
(($ <primcall> src '> (a b))
;; No need to reduce as < is a branching primitive.
(make-conditional src (make-primcall src '< (list b a))
(make-const src #t)
(make-const src #f)))
(($ <primcall> src (? branching-primitive? name) args)
;; No need to reduce because test is not reducible: reifying
;; #t/#f is the right thing.
(make-conditional src exp
(make-const src #t)
(make-const src #f)))
(($ <primcall> src 'not (x))
(reduce-conditional
(make-conditional src x
(make-const src #f)
(make-const src #t))))
(($ <primcall> src (or 'eqv? 'equal?) (a b))
(let ()
(define-syntax-rule (primcall name . args)
(make-primcall src 'name (list . args)))
(define-syntax primcall-chain
(syntax-rules ()
((_ x) x)
((_ x . y)
(make-conditional src (primcall . x) (primcall-chain . y)
(make-const src #f)))))
(define-syntax-rule (bool x)
(make-conditional src x (make-const src #t) (make-const src #f)))
(with-lexicals src (a b)
(make-conditional
src
(primcall eq? a b)
(make-const src #t)
(match (primcall-name exp)
('eqv?
;; Completely inline.
(primcall-chain (heap-number? a)
(heap-number? b)
(bool (primcall heap-numbers-equal? a b))))
('equal?
;; Partially inline.
(primcall-chain (heap-object? a)
(heap-object? b)
(primcall equal? a b))))))))
(($ <primcall> src 'vector args)
;; Expand to "allocate-vector" + "vector-init!".
(evaluate-args-eagerly-if-needed
src args
(lambda (args)
(define-syntax-rule (primcall name . args)
(make-primcall src 'name (list . args)))
(define-syntax-rule (const val)
(make-const src val))
(let ((v (primcall allocate-vector (const (length args)))))
(with-lexicals src (v)
(list->seq
src
(append (map (lambda (idx arg)
(primcall vector-init! v (const idx) arg))
(iota (length args))
args)
(list v))))))))
(($ <primcall> src 'make-struct/simple (vtable . args))
;; Expand to "allocate-struct" + "struct-init!".
(evaluate-args-eagerly-if-needed
src args
(lambda (args)
(define-syntax-rule (primcall name . args)
(make-primcall src 'name (list . args)))
(define-syntax-rule (const val)
(make-const src val))
(let ((s (primcall allocate-struct vtable (const (length args)))))
(with-lexicals src (s)
(list->seq
src
(append (map (lambda (idx arg)
(primcall struct-init! s (const idx) arg))
(iota (length args))
args)
(list s))))))))
(($ <primcall> src 'list args)
;; Expand to "cons".
(evaluate-args-eagerly-if-needed
src args
(lambda (args)
(define-syntax-rule (primcall name . args)
(make-primcall src 'name (list . args)))
(define-syntax-rule (const val)
(make-const src val))
(fold (lambda (arg tail) (primcall cons arg tail))
(const '())
(reverse args)))))
;; Lower (logand x (lognot y)) to (logsub x y). We do it here
;; instead of in CPS because it gets rid of the lognot entirely;
;; if type folding can't prove Y to be an exact integer, then DCE
;; would have to leave it in the program for its possible
;; effects.
(($ <primcall> src 'logand (x ($ <primcall> _ 'lognot (y))))
(make-primcall src 'logsub (list x y)))
(($ <primcall> src 'logand (($ <primcall> _ 'lognot (y)) x))
(make-primcall src 'logsub (list x y)))
(($ <primcall> src 'throw ())
(make-call src (make-primitive-ref src 'throw) '()))
(($ <primcall> src 'raise-exception (and args (not (_))))
(make-call src (make-primitive-ref src 'raise-exception) args))
(($ <prompt> src escape-only? tag body
($ <lambda> hsrc hmeta
($ <lambda-case> _ hreq #f hrest #f () hsyms hbody #f)))
exp)
(($ <primcall> src 'ash (a b))
(match b
(($ <const> src2 (? exact-integer? n))
(if (< n 0)
(make-primcall src 'rsh (list a (make-const src2 (- n))))
(make-primcall src 'lsh (list a b))))
(_
(with-lexicals src (a b)
(make-conditional
src
(make-primcall src '< (list b (make-const src 0)))
(let ((n (make-primcall src '- (list (make-const src 0) b))))
(make-primcall src 'rsh (list a n)))
(make-primcall src 'lsh (list a b)))))))
(_ exp)))
exp))
(define (compile-cps exp env opts)
(values (cps-convert/thunk (canonicalize exp)) env env))
;;; Local Variables:
;;; eval: (put 'convert-arg 'scheme-indent-function 2)
;;; eval: (put 'convert-args 'scheme-indent-function 2)
;;; End:
|