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
|
; ACL2 Version 4.0 -- A Computational Logic for Applicative Common Lisp
; Copyright (C) 2010 University of Texas at Austin
; This version of ACL2 is a descendent of ACL2 Version 1.9, Copyright
; (C) 1997 Computational Logic, Inc. See the documentation topic
; NOTE-2-0.
; This program is free software; you can redistribute it and/or modify
; it under the terms of the GNU General Public License as published by
; the Free Software Foundation; either version 2 of the License, or
; (at your option) any later version.
; This program is distributed in the hope that it will be useful,
; but WITHOUT ANY WARRANTY; without even the implied warranty of
; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
; GNU General Public License for more details.
; You should have received a copy of the GNU General Public License
; along with this program; if not, write to the Free Software
; Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
; Written by: Matt Kaufmann and J Strother Moore
; email: Kaufmann@cs.utexas.edu and Moore@cs.utexas.edu
; Department of Computer Sciences
; University of Texas at Austin
; Austin, TX 78712-1188 U.S.A.
; Acknowledgments: Bob Boyer contributed crucially to the design and
; implementation of early versions of ACL2. Many others, largely at CLI, have
; also contributed to the design of certain features. We especially thank
; Bishop Brock and John Cowles for their contributions. See the documentation
; topic ACKNOWLEDGMENTS for more information.
; This research was supported in part at Computational Logic, Inc. by the
; Defense Advanced Research Projects Agency (DARPA), ARPA Orders #6082, 9151
; and 7406 and by the Office of Naval Research, contracts numbers
; N00014-88-C-0454, N00014-91-C-0130, and N00014-94-C-0193. The views and
; conclusions contained in this document are those of the author(s) and should
; not be interpreted as representing the official policies, either expressed or
; implied, of Computational Logic, Inc., Office of Naval Research, DARPA or the
; U.S. Government.
; This file, acl2.lisp, (a) builds the packages for the ACL2 system, (b)
; defines the functions for loading and compiling ACL2 and for running code
; verified using ACL2, and (c) makes a couple of checks concerning minor,
; non-CLTL, assumptions that we make about Common Lisps in which ACL2 is to
; run.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; CLTL1/CLTL2
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; For the most part, we program in a subset both of CLTL1 and CLTL2.
; However, there are a few places, notably the name of the main
; package for Lisp symbols, where this is impossible. So we use the
; read conditional #+CLTL2. If one wishes to run ACL2 under CLTL2,
; execute the following form before commencing compiling or loading:
; (push :CLTL2 *features*)
; For example, for Allegro and lispworks (respectively) we have the following.
#+(or ansi-cl draft-ansi-cl-2 lispworks clisp ccl)
(push :CLTL2 *features*)
; We use IN-PACKAGE in a way that is consistent with both CLTL1 and
; CLTL2, namely as a macro (i.e., whose argument is not evaluated) for
; switching *package* to an existing package, value ignored.
(in-package #-CLTL2 "USER" #+CLTL2 "COMMON-LISP-USER")
; Avoid warning, at least in Allegro CL, for use of this variable below. Note
; that it is set to nil using GNUmakefile when ACL2_COMPILER_DISABLED is set.
(defvar *acl2-compiler-enabled*)
; Changes Made in Support of CMU Lisp
; (0) (The following issue with Cmulisp no longer seems to be true, at least
; as of Version 19e on Linux.)
; Cmulisp doesn't support EVAL-WHEN. This meant that in the #+cmu case
; I had to put down special code to try to do what other lisps do.
; Generally, this involved just not checking for certain errors (compiling
; files that weren't supposed to be compiled) in #+cmu that were checked
; in other lisps. In one case, namely the initialization of
; current-acl2-world, it involved a little more.
; (1) cmulisp switches from *standard-input* to *terminal-io* when the input
; stream reaches eof; our other lisps all exit to the operating system.
; This means all the batch jobs we submit via make have to be arranged to
; exit from cmulisp before eof. This required changing the top-level
; makefile and the makefiles of all the books. I generally put a
; `:q #+cmu (lisp::quit)' at the end of each workxxx.
; These could be replaced simply by `:q (acl2::exit-lisp)'.
; (2) Cmulisp checks type assertions at runtime. I found two of our assertions
; violated by actual use. In fmt-char we mistakenly claimed the string's
; length was less than 101. This was a typo -- elsewhere in the same
; function we claimed it was just a fixnum -- apparently caused by
; copying a type-declaration and failing to edit it thoroughly. (Another
; variable was correctly limited to 101.)
; In maximal-elements1, used in the selection of induction candidates,
; we claimed (by using int=) that the scores for an induction candidate
; are integers when in fact they are rationals.
; (3) Evidently, all functions in cmulisp pass the compiled-function-p test.
; If you defun foo and immediately get its symbol-function you get
; an object like #<Interpreted function ...>. If you ask whether
; this object is a compiled-function-p you get t. If you compile
; foo the symbol-function changes to an object like #<Function
; ...>, which also passes the test.
; The fact that everything in a symbol-function field looks like a compiled
; function killed us in an interesting way. Most locally, it made
; compile-uncompiled-*1*-defuns write out an empty file of functions to
; compile, because everything looked compiled already. But where that
; really got us was that we use that function to create TMP1.lisp during
; the bootstrapping. TMP1.lisp, recall, contains the mechanically
; generated executable counterparts of logic mode functions defined in
; axioms.lisp. By not generating these we built an image in which the
; relevant functions were undefined. Because of the rugged way we invoke
; them, catching errors and producing a HIDE term if we can't eval them,
; we survived the certification of many books before we finally got to a
; proof that couldn't be done without running one of those functions.
; The proof, in the bdd books, required evaling (nth -1 nil), which
; according to the axioms is nil but which we couldn't deduce because
; ACL2_*1*_COMMON-LISP::NTH was undefined.
; My fix was to define and use compiled-function-p! instead of the standard
; compiled-function-p. The new function has a #+/-cmu split in it. In the
; cmu case I ask
; (not (eq (type-of (symbol-function fn)) 'eval:interpreted-function))
; So I say fn is compiled if its symbol-function is not an object like
; #<Interpreted function ...>.
; (4) CMU Lisp does not allow us to "undefine" a macro-function. That is,
; one is not permitted to store a nil into the macro-function
; field because nil is not a function. We do this when we
; implement undo. We handle it by storing a dummy function
; instead, and change the notion of when a symbol is virgin to
; recognize the case that its symbol-function or macro-function is
; the dummy.
; (5) We made a few fixes and cleanups in order to avoid compiler warnings.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; SAFETY AND PROCLAIMING
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; The user is welcome to modify the following proclaim form.
(proclaim `(optimize #+cltl2 (compilation-speed 0)
; The following may allow more tail recursion elimination (from "Lisp
; Knowledgebase" at lispworks.com); might consider for Allegro CL too.
#+(or lispworks ccl) (debug 0)
#+cmu (extensions:inhibit-warnings 3)
#+sbcl (sb-ext:inhibit-warnings 3)
(speed 3)
; Consider replacing cmu on the next line with (or cmu sbcl). The SBCL manual
; says the following, but a quick test with (or cmu sbcl) yielded no smaller
; .core file size and no quicker (mini-proveall).
; The value of space mostly influences the compiler's decision whether to
; inline operations, which tend to increase the size of programs. Use the
; value 0 with caution, since it can cause the compiler to inline operations
; so indiscriminately that the net effect is to slow the program by causing
; cache misses or even swapping.
(space #+cmu 1 #-cmu 0)
; WARNING: Do not proclaim (cl-user::fixnum-safety 0) for Lispworks. Any
; fixnum-safety less than 3 expects all integers to be fixnums!
(safety
; Consider using (safety 3) if there is a problem with Lispworks. It enabled
; us to see a stack overflow involving collect-assumptions in the proof of
; bitn-lam0 from books/rtl/rel2/support/lop3.lisp. (See save-acl2-in-lispworks
; for how we have eliminated that stack overflow.)
; Safety 1 for CCL has avoided the kernel debugger, e.g. for compiled calls
; of car on a non-nil atom. The following results for CCL show why we have
; decided to keep the safety at 0 by default and why safety 3 is not too bad.
;
; Safety 0:
; 12955.537u 542.877s 3:46:24.68 99.3% 0+0k 0+0io 0pf+0w
;
; Safety 1:
; 15343.578u 562.207s 4:27:03.67 99.2% 0+0k 0+0io 0pf+0w
; Try safety 2 or 3 to find violations with Allegro CL like the car of a
; non-nil atom. (Note: safety 3 has failed in GCL due to a stack overflow.)
; Here are some numbers with Allegro CL, 8 processors with make -j 8:
; Safety 0:
; 11262.699u 291.730s 38:23.72 501.5% 0+0k 0+0io 16pf+0w
; Safety 2:
; 15588.206u 285.249s 54:19.72 486.9% 0+0k 0+0io 0pf+0w
; Safety 3:
; 16450.508u 284.473s 57:46.03 482.8% 0+0k 0+0io 0pf+0w
; Here are GCL numbers, again with make -j 8 (and using "fast builds").
; Safety 0:
; 10013.573u 566.983s 33:33.80 525.4% 0+0k 0+0io 0pf+0w
; Safety 2:
; [Note: books/clause-processors/SULFA/books/sat-tests/test-incremental.lisp
; ran out of space, saving perhaps a minute]
; 15637.669u 511.811s 52:02.78 517.1% 0+0k 0+0io 0pf+0w
,(let ((our-safety
#-CLTL2
(if (boundp 'user::*acl2-safety*)
(symbol-value 'user::*acl2-safety*)
nil)
#+CLTL2
(if (boundp 'common-lisp-user::*acl2-safety*)
(symbol-value 'common-lisp-user::*acl2-safety*)
nil)))
(if our-safety
(progn (format t "Note: Setting SAFETY to ~s."
our-safety)
our-safety)
0))
)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; FILES
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; This is the file acl2.lisp, the first source file for ACL2. The
; names of the other ACL2 source files are listed under *acl2-files*.
; All of ACL2 is written in Common Lisp and we expect that ACL2 will
; run in any Common Lisp except for those Common Lisps which fail the
; tests we execute upon loading this file, acl2.lisp. With the
; exception of this and other initialiation files, files *-raw.lisp,
; and those constructs after the #-acl2-loop-only passim only
; (especially in the file axioms.lisp), ACL2 is written in the
; applicative Common Lisp for which ACL2 is a verification system.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; LISP BUGS AND QUIRKS
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Patch from Gary Byers for OpenMCL 1.0 (CCL). He says (4/13/07):
; Sometime over the last year or so, code was introduced into ACL2 that
; triggered a bug in OpenMCL 1.0 (namely, the initialization of binding
; of LOWER-BOUND in the THE-FIXNUM! macro in basis.lisp treats the expression
; (1+ UPPER-BOUND) as a fixnum (it isn't ...) and winds up negating the
; address of a bignum.
#+(and ccl coral) ; the symbol :CORAL was on *FEATURES* in 1.0 and earlier
(ccl:advise ccl::grovel-numeric-form
(let* ((ccl::*nx-form-type* t)) (:do-it))
:when :around)
; See acl2-fns.lisp for a fix to user-homedir-pathname for some versions of
; GCL.
; We do not yet support GCL ANSI.
#+(and gcl ansi-cl)
(error
"FATAL ERROR: ACL2 does not yet support GCL ANSI. Please use a non-ANSI GCL.")
; To use ACL2 under Lispworks 3.2.0, execute the following to work around a
; bug.
; #+lispworks
; (setf (svref ccl::*funny-symbol-char-table* (char-code #\.)) t)
; Next, we correct *features* for Windows.
#+(and (or winnt win32 windows) (not mswindows))
(setq *features*
(cons :mswindows *features*))
#+(and (or mswindows winnt) unix)
(setq *features*
(delete :unix *features*
:test
(function (lambda (x y)
(equal (symbol-name x) (symbol-name y))))))
; Speed up I/O in Allegro 6 and beyond:
#+(and allegro allegro-version>= (version>= 6 0))
(setf (stream-external-format *terminal-io*)
(excl::find-external-format
#+unix :latin1-base
#-unix :latin1))
; Turn off automatic declaration of special variables, in particular since we
; do not want state declared special; see the comment above
; (eval '(setq state *the-live-state*)) in load-acl2.
#+cmu
(setq ext:*top-level-auto-declare* nil)
; Turn off compiler verbosity going to error stream, since even >& does not
; seem to redirect that stream to a file.
#+(or cmu sbcl)
(setq *compile-verbose* nil)
#+(or cmu sbcl)
(setq *compile-print* nil)
; Turn off gc verbosity (same reason as above).
#+cmu
(setq ext:*gc-verbose* nil)
#+ccl
(when (fboundp 'ccl::gc-verbose) ; not in OpenMCL 1.0 (CCL)
(apply 'ccl::gc-verbose nil nil))
; See later in this file for with-warnings-suppressed (after we introduce and
; enter the ACL2 package).
; Avoid saving source file information, which could cause some slowdown and
; isn't typically exploited by ACL2 users.
#+ccl
(setq ccl::*record-source-file* nil)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; PACKAGES
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; We never intend that this file should be compiled, and hence we do
; not need to obey the CLTL1 strictures about putting all IN-PACKAGE
; forms near the front.
(let ((lisp-pkg (find-package "LISP")))
(if lisp-pkg
(let ((cl-pkg (find-package "COMMON-LISP")))
(cond
((and cl-pkg (eq cl-pkg lisp-pkg))
; Then all is well.
)
#+cmu
; Starting with CMUCL 19a, lisp-pkg and cl-pkg are no longer the same. We view
; CMUCL as CLTL2; see (push :CLTL2 *features*) above, noting that :ANSI-CL is
; in *features*. So in this case, we simply ignore lisp-pkg. Probably we can
; do the same for most other lisps, except for GCL where LISP is populated but
; COMMON-LISP might not be to any significant extent.
(t nil)
#-cmu
(t
(when cl-pkg ; but by the test above, cl-pkg is not lisp-pkg
#-gcl
; Perhaps we can just add the present lisp to the #+cmu above.
(error "This Lisp is unsuitable for ACL2, because the ~
COMMON-LISP~% package is defined but is not the LISP ~
package.")
#+gcl
; Early versions of GCL 2.4.3/2.5.0 had a "COMMON-LISP" package that was
; initially populated only with LISP::T and LISP::NIL. It seems safe to move
; any GCL COMMON-LISP package out of the way before we make "COMMON-LISP" a
; nickname for "LISP".
(rename-package "COMMON-LISP" "COMMON-LISP-renamed"))
(let ((old-name (package-name lisp-pkg)) ; reuse old name, nicknames
(old-nicknames (package-nicknames lisp-pkg)))
(rename-package "LISP"
old-name
(cons "COMMON-LISP" old-nicknames))))))))
(eval-when #-cltl2 (compile)
#+cltl2 (:compile-toplevel)
(error "The file acl2.lisp should never be compiled."))
(dolist
(p (list-all-packages))
(cond ((equal 4 (string< "ACL2" (package-name p)))
(format t
"~%~%Warning: There is already a package with the ~
name ~a. ~%The ACL2 implementation depends upon ~
having complete knowledge of ~%and control over any ~
packge whose name begins with the ~%four letters ``ACL2'', ~
so ACL2 may not work in this Lisp." (package-name p))
(cond ((package-use-list p)
(format t "~%~%Warning: The package with name ~a ~
USES the packages in the list ~a. ACL2 will not work ~
in state of affairs."
(package-name p) (package-use-list p)))))))
(or (find-package "ACL2")
(make-package "ACL2" :use nil))
; The definition of defconst appears just below because we use it
; early in axioms.lisp. But first, we define the constant
; *the-live-state* because it is used below in the definition of
; defconst and cmulisp warns if we use it before it has been defined.
; And, in order to define *the-live-state* we need the ACL2_INVISIBLE
; package, which we define here. This package is used for a few odd
; objects that are to be hidden from the ACL2 user. Symbols in this
; package having names that start with "HONS" are reserved for the
; hons/memoization implementation.
(let ((inv "ACL2_INVISIBLE"))
(or (find-package inv)
(make-package inv :use nil)))
; The value of the constant *the-live-state* is actually just a
; symbol, but that symbol is the unique representative of the one
; single active, global, real-time state of ACL2, which is represented
; both in real-time (e.g., characters not yet typed) and also rather
; efficiently, using typical von Neumann storage techniques.
; Functions that wish to access the global state must have received
; *the-live-state* as an arg. Functions that modify this global state
; must receive it as an arg and return it.
(defconstant acl2::*the-live-state* 'acl2_invisible::|The Live State Itself|)
; (Defconst *var* term) is essentially just (defparameter *var* term). But
; things are made complicated by the desire not to evaluate term unnecessarily.
; Suppose (defconst *var* term) appears in a certified book, say "book.lisp".
; Then when the events in "book.lisp" are processed, a CLTL-COMMAND is executed
; which causes (defconst *var* term) to be evaluated in the underlying raw
; lisp, assigning a value to *var* in Lisp. But now suppose that the compiled
; file for another book, say "book2.o", is loaded on behalf of include-book.
; If defconst were just defparameter, term would be evaluated again (yielding a
; presumably EQUAL value), which is an unfortunate waste of computation.
; We avoid this in the code below by saving, on the raw Lisp property list of
; *var*, under the key 'REDUNDANT-RAW-LISP-DISCRIMINATOR, a triple, (DEFCONST
; term . val), giving the term we evaluated to produce the setting of the var
; and the value, val, produced. When a defconst (defconst *var* term) is
; evaluated, we ask whether *var* has a value. If not, we just proceed
; normally. But if it has a value, we insist that the discriminator be present
; and appropriate or else we cause a hard error. By appropriate in this case
; we mean that it be a DEFCONST such that the value produced last time is EQ to
; the current setting of *var*, and moreover, either the old and new DEFCONST
; have the same (EQUAL) term to evaluate or else the new value is EQUAL to the
; old. The EQ check is meant to provide some safety if the user has manually
; set *var* in raw lisp, as with setq, since the last defconst to it.
; We anticipate that redundant-raw-lisp-discriminator may be used by the
; support functions for other events, e.g., defstobj. So the value of that
; property is not necessarily (DEFCONST term . val) but may depend on the kind
; of event that stored it. The reason we put the discriminator on the raw lisp
; property list of *var* rather than looking in the world of *the-live-state*,
; where we could in principle find an event-landmark, is that we execute many
; defconsts in axioms.lisp, before the world processing functions, like
; getprop, are defined and so the defmacro below must expand to code that can
; be executed in a partially booted ACL2.
(defvar acl2::*compiling-certified-file* nil)
(defmacro acl2::defconst (name term &rest rst)
(declare (ignore rst)) ; e.g., documentation
(let ((disc (gensym)))
`(defparameter ,name
(cond
((boundp ',name)
(cond
(acl2::*compiling-certified-file*
; We avoid the potentially expensive redundancy check done below, which is
; legitimate since we are simply loading a compiled file at the end of
; certify-book. To see how important this optimization can be, try removing it
; before certifying the following book (thanks to Sol Swords for this
; example).
; (in-package "ACL2")
; (defun tree (n)
; (if (zp n)
; nil
; (let ((sub (tree (1- n))))
; (cons sub sub))))
; (defmacro deftree (name n)
; `(defconst ,name ',(tree n)))
; (deftree *big* 35)
(symbol-value ',name))
(t
; Even though ',name is bound, we refer to its value with
; (symbol-value ',name) rather than simply an in-line ,name, to avoid
; compiler warnings.
(let ((,disc (get ',name 'acl2::redundant-raw-lisp-discriminator)))
(cond
((and (consp ,disc)
(eq (car ,disc) 'acl2::defconst))
(assert (consp (cdr ,disc)))
(cond
((and (eq (cdr (cdr ,disc)) (symbol-value ',name))
(or (equal (car (cdr ,disc)) ',term)
(equal (cdr (cdr ,disc)) ,term)))
(symbol-value ',name))
(t (error "Illegal attempt to redeclare the constant ~s."
',name))))
((acl2::raw-mode-p acl2::*the-live-state*)
; In this case we allow redeclaration of the constant; this is, after all, raw
; mode, where there are no guarantees.
,term)
(t
(error "Illegal attempt to redeclare the constant ~s."
',name)))))))
; If ',name is not bound, we must evaluate ,term. Note that we do so
; outside of all local bindings, so as not to disturb variables in
; term. (There should be none -- this is supposed to be a constant,
; but you never know!) We may want to enforce that this code is only executed
; during the boot-strap; see the Essay on Guard Checking.
(t (let* ((val ,term)
(d (list* 'acl2::defconst ',term val)))
(setf (get ',name 'acl2::redundant-raw-lisp-discriminator)
d)
(cdr (cdr d))))))))
; We now get our imports for package ACL2, putting them into the
; variable acl2::*common-lisp-symbols-from-main-lisp-package*.
; We use different variables for common-lisp-symbols-from-main-lisp-package*,
; *acl2-version*, and *acl2-files*, in order to avoid compiler warnings for
; redefined variables. Actually, *acl2-version* no longer exists starting with
; Version_2.9.1, but we keep the name below nonetheless.
(defvar acl2::*copy-of-common-lisp-symbols-from-main-lisp-package*)
(defvar acl2::*copy-of-common-lisp-specials-and-constants*)
(defvar acl2::*copy-of-acl2-version*)
(defconstant acl2::*acl2-files*
; The order of these files determines compilation order.
'(
#+acl2-par "multi-threading-raw"
"axioms"
"memoize" ; but only get special under-the-hood treatment with #+hons
"hons" ; but only get special under-the-hood treatment with #+hons
"basis"
"parallel" ; but only get special under-the-hood treatment with #+acl2-par
#+acl2-par "parallel-raw"
#+hons "memoize-raw"
#+hons "hons-raw"
"translate"
"type-set-a"
"linear-a"
"type-set-b"
"linear-b"
"non-linear"
"rewrite"
"simplify"
"bdd"
"other-processes"
"induct"
"history-management"
"prove"
"defuns"
"proof-checker-pkg"
"proof-checker-a"
"defthm"
"other-events"
"ld"
"proof-checker-b"
"tutorial"
"interface-raw"
"defpkgs"
)
"*acl2-files* is the list of all the files necessary to build
ACL2 from scratch.")
; CLISP version 2.30 (along with perhaps other versions) locks the LISP
; package. That causes problems when we try to read the second form in
; axioms.lisp, which defines
; acl2::*common-lisp-symbols-from-main-lisp-package*, when CLISP tries to read
; some of the symbols in that list (e.g., CALL-METHOD) into the COMMON-LISP
; package. (Specifically, INTERN breaks.) We use eval below to avoid any
; chance (we hope) of getting an "undefined function" warning with earlier
; CLISP versions.
#+clisp
(if (fboundp 'package-lock)
(eval '(setf (package-lock "LISP") nil)))
; CLISP version 2.33 defines the symbol custom::*suppress-check-redefinition*,
; but version 2.30 does not. We temporarily unlock that package if necessary
; in order to define this variable. While we are at it we make the variable
; special, in order to avoid potential compiler warnings in 2.30 when we bind
; it but never use it.
#+clisp
(if (not (find-symbol "*SUPPRESS-CHECK-REDEFINITION*" "CUSTOM"))
(if (fboundp 'package-lock)
(let ((old-lock (package-lock "CUSTOM")))
(eval '(setf (package-lock "CUSTOM") nil))
(let ((sym (intern "*SUPPRESS-CHECK-REDEFINITION*" "CUSTOM")))
(eval `(defvar ,sym nil)))
(eval `(setf (package-lock "CUSTOM") ',old-lock)))
(let ((sym (intern "*SUPPRESS-CHECK-REDEFINITION*" "CUSTOM")))
(eval `(defvar ,sym nil)))))
(with-open-file
(fl "axioms.lisp" :direction :input)
; Get into the main lisp package in order to read in
; *common-lisp-symbols-from-main-lisp-package*.
(let ((*package* (find-package #-CLTL2 "LISP" #+CLTL2 "COMMON-LISP")))
; Skip the in-package
(read fl)
; Do the defconst for *common-lisp-symbols-from-main-lisp-package*.
(setq acl2::*copy-of-common-lisp-symbols-from-main-lisp-package*
(eval (caddr (read fl))))
(import acl2::*copy-of-common-lisp-symbols-from-main-lisp-package* "ACL2")
(setq acl2::*copy-of-acl2-version*
; Keep this in sync with the value of acl2-version in *initial-global-table*.
(concatenate 'string
"ACL2 Version 4.0"
#+non-standard-analysis
"(r)"
#+(and mcl (not ccl))
"(mcl)"))
; Do the defconst for *common-lisp-specials-and-constants*.
(setq acl2::*copy-of-common-lisp-specials-and-constants*
(eval (caddr (read fl))))))
(in-package "ACL2")
(defmacro initialize-state-globals ()
(let ((acl2-compiler-enabled-var
#+cltl2 'common-lisp-user::*acl2-compiler-enabled*
#-cltl2 'user::*acl2-compiler-enabled*))
`(progn (dolist (pair *initial-global-table*)
(f-put-global (car pair) (cdr pair) *the-live-state*))
(f-put-global 'iprint-ar
(compress1 'iprint-ar
(f-get-global 'iprint-ar *the-live-state*))
*the-live-state*)
(f-put-global 'compiler-enabled
; Either t, nil, or :books is fine here. For example, it might be reasonable
; to initialize to (not *suppress-compile-build-time*). But for now we enable
; compilation of books for all Lisps.
(cond ((boundp ',acl2-compiler-enabled-var)
(or (member ,acl2-compiler-enabled-var
'(t nil :books))
(error "Illegal value for ~
user::*acl2-compiler-enabled*, ~s"
,acl2-compiler-enabled-var))
,acl2-compiler-enabled-var)
(t
#+(or ccl sbcl) ; these compile on the fly
:books
#-(or ccl sbcl)
t))
*the-live-state*)
#+unix
(f-put-global 'tmp-dir "/tmp" *the-live-state*)
#-acl2-mv-as-values
(f-put-global 'raw-arity-alist *initial-raw-arity-alist*
*the-live-state*))))
(defconstant *suppress-compile-build-time*
; This flag controls whether explicit calls to the compiler during the build,
; that is via compile and compile-file, are suppressed. The "interpreters" of
; SBCL and CCL compile on-the-fly, so a nice optimization is for us to
; avoid calling the compiler ourselves.
#+(or sbcl ccl) ; these compile on-the-fly
t
#-(or sbcl ccl)
nil)
(defparameter *global-package-prefix* "ACL2_GLOBAL_")
(defparameter *1*-package-prefix* "ACL2_*1*_")
(defun make-global-package (x)
(let* ((n (concatenate 'string *global-package-prefix* x))
(p (find-package n)))
(cond (p
(do-symbols (sym p)
(makunbound sym)))
(t (make-package n :use nil)))))
(defun make-*1*-package (x)
(let* ((n (concatenate 'string *1*-package-prefix* x)))
; Unlike make-global-package, here we really don't have to worry about bound
; (or fbound) symbols. Presumably ``bound'' is irrelevant, and ``fbound'' is
; taken care of by our undoing mechanisms.
(make-package n :use nil)))
(or (find-package "ACL2-INPUT-CHANNEL")
(make-package "ACL2-INPUT-CHANNEL" :use nil))
(or (find-package "ACL2-OUTPUT-CHANNEL")
(make-package "ACL2-OUTPUT-CHANNEL" :use nil))
; Next we define the initial global and *1* packages.
; Keep the following in sync with *main-lisp-package-name*.
(make-global-package "COMMON-LISP")
(make-global-package "KEYWORD")
(make-global-package "ACL2")
(make-global-package "ACL2-INPUT-CHANNEL")
(make-global-package "ACL2-OUTPUT-CHANNEL")
; Keep the following in sync with *main-lisp-package-name*.
(make-*1*-package "COMMON-LISP")
; Functions cannot be defined in the keyword package, so we do not do so.
; (make-*1*-package "KEYWORD")
(make-*1*-package "ACL2")
(make-*1*-package "ACL2-INPUT-CHANNEL")
(make-*1*-package "ACL2-OUTPUT-CHANNEL")
; Common Lisp does not require that the symbol-package of the basic
; Lisp symbols be the basic LISP or COMMON-LISP package, but merely
; that those symbols be exported from that package.
(defparameter acl2::*initial-lisp-symbol-mark*
'acl2_invisible::initial-lisp-symbol-mark)
(dolist (sym *copy-of-common-lisp-symbols-from-main-lisp-package*)
(setf (get sym *initial-lisp-symbol-mark*) "COMMON-LISP"))
(defconstant *acl2-package* (find-package "ACL2"))
(dolist (x *features*)
(cond ((or (equal "AKCL-SET-MV"
(symbol-name x))
(equal "ACL2-LOOP-ONLY"
(symbol-name x))
(equal "ACL2-METERING"
(symbol-name x)))
(format t "~%~%Warning: This Common Lisp may be ~
unsuitable for ACL2 because a symbol with~
~%the name \"ACL2-LOOP-ONLY\", ~
\"AKCL-SET-MV\" or \"ACL2-METERING\" is ~
a member of *FEATURES*."))))
#+akcl
(if (fboundp 'si::set-mv)
(push :akcl-set-mv *features*)
(error "Use a version of ACKL after 206"))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; CHECKS
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; See acl2-check.lisp for more checks.
; The following macro turns off some style warnings. It is defined here
; instead of the "LISP BUGS AND QUIRKS" section because we want to define this
; in the ACL2 package.
(defmacro with-warnings-suppressed (&rest forms)
; Keep this in sync with the handler-bind call in init.lisp. Thanks to Juho
; Snellman for the SBCL form.
; We are happy to turn off redefinition warnings because we trust that
; functions such as add-trip know what they are doing. Without this code, for
; example, :oops can cause many screens of such warnings.
#+sbcl
`(handler-bind
; Warning: We turn off all warnings in SBCL because they are so noisy. Here is
; the story:
; In the case of SBCL, we have noticed that the inhibition of style-warnings
; eliminates a huge amount of noise during the build, probably because
; with-warnings-suppressed is called in compile-acl2. Unfortunately, some of
; that "noise" is the reporting of unused formals. So, developers may want to
; compile in some Lisp other than SBCL in order to see warnings about unused
; formals and perhaps other warnings as well.
; Considerable noise can be eliminated even if sb-kernel:redefinition-warning
; replaces style-warning below (at least, we tried this in SBCL 1.0.19;
; sb-kernel:redefinition-warning doesn't work in SBCL 1.0.3). But there is
; still a lot of noise left when substituting sb-kernel:redefinition-warning
; for style-warning, e.g. on constant names, ignorable variable CONDITION-P in
; memoize, and undefined function warnings for *1* functions defined in
; mutual-recursions. So we leave style-warning in place.
(#+ansi-cl
(style-warning (lambda (c)
(declare (ignore c))
(invoke-restart 'muffle-warning))))
,@forms)
#+cmucl
`(progn (setq ext:*gc-verbose* nil) ,@forms)
#+lispworks
`(let ((compiler::*redefinition-action* :QUIET)) ,@forms)
#+allegro
`(let ((excl:*redefinition-warnings* nil)) ,@forms)
#+clisp
; Setting custom::*suppress-check-redefinition* seems harmless, but doesn't
; help avoid warnings (as of CLISP 2.47) for more than one definition of the
; same function in the same file. We could bind *compile-verbose* to nil, but
; that seems too extreme; although we do something analogous for SBCL, we felt
; compelled there because of extreme noise, which isn't the case for CLISP.
`(let ((custom::*suppress-check-redefinition* t)) ,@forms)
#+ccl
`(let ((ccl::*compiler-warn-on-duplicate-definitions* nil)) ,@forms)
#-(or cmucl sbcl lispworks allegro clisp ccl)
(if (cdr forms) `(progn ,@forms) (car forms)))
(defmacro with-suppression (&rest forms)
; Since "COMMON-LISP" is a package known to ACL2, a user should have permission
; to type 'common-lisp::foo (say) and not get a reader error due to a package
; lock. This macro suppresses the package lock on "COMMON-LISP" for Lisps
; where we know this is necessary, and also inhibits some warnings.
#-(or sbcl clisp) `(with-warnings-suppressed ,@forms)
#+sbcl `(sb-ext:with-unlocked-packages
("COMMON-LISP")
(with-warnings-suppressed ,@forms))
#+clisp `(ext:without-package-lock
("COMMON-LISP")
(with-warnings-suppressed ,@forms)))
(defconstant acl2::*acl2-status-file*
(make-pathname :name "acl2-status"
:type "txt"))
(defun acl2::check-suitability-for-acl2 ()
; As of version 18a, cmulisp spews gc messages to the terminal even when
; standard and error output are redirected. So we turn them off.
(with-warnings-suppressed
(or (not (probe-file *acl2-status-file*))
(delete-file *acl2-status-file*))
(load "acl2-check.lisp")
(with-open-file (str *acl2-status-file*
:direction :output)
(format str
"~s"
:checked))
t))
(defun note-compile-ok ()
(progn (or (not (probe-file *acl2-status-file*))
(delete-file *acl2-status-file*))
(with-open-file (str *acl2-status-file*
:direction :output)
(format str
"~s"
:compiled))))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; COMPILING and LOADING, PART 1
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; To compile ACL2, invoke (load "acl2.lisp") and then invoke
; (acl2::compile-acl2). Having compiled ACL2, to build ACL2, invoke
; (load "acl2.lisp") and then invoke (acl2::load-acl2). To run ACL2
; verified code, one may either load all of ACL2 as above, or
; alternatively, having complied ACL2, invoke (load "acl2.lisp") and
; invoke (acl2::load-acl2-execution-environment). The top-level user
; functions for ACL2 are in package "ACL2", so invoke (in-package
; "ACL2") to obviate typing package names.
; NOTE: In order to compile ACL2, checks must first be run on the suitability
; of the underlying Common Lisp implementation, by executing
; (check-suitability-for-acl2). If the Common Lisp is suitable, this form will
; write the file acl2-status.txt with the symbol :CHECKED. Successful
; compilation should write out that same file with the symbol :COMPILED.
; Compiling is a no-op if *suppress-compile-build-time* is non-nil, but we
; still write :COMPILED as indicated above.
(defvar *lisp-extension* "lisp")
(defparameter *compiled-file-extension*
; Note that books/Makefile-generic, books/Makefile-subdirs, and
; books/Makefile-psubdirs all deal with compiled file extensions.
; Thanks to Gary Byers for suggested the following approach for #+ansi-cl,
; which however appears to work for all Lisps supported as of early 2006.
(pathname-type (compile-file-pathname "foo.lisp")))
#+sbcl ; turn off compiler notes (noisy)
(declaim (sb-ext:muffle-conditions sb-ext:compiler-note))
#+allegro
(eval (read-from-string "
(SETQ COMPILER::DECLARED-FIXNUMS-REMAIN-FIXNUMS-SWITCH
#'(LAMBDA (X Y Z #+(VERSION>= 4 1) D) NIL)) "))
; The following appears to allow tail recursion elimination for functions
; locally defined using LABELS. This is important for efficiency since we
; use LABELS in defining executable counterparts (see e.g. oneify-cltl-code).
#+allegro
(setq compiler:tail-call-non-self-merge-switch t)
; Lispworks Version 4.2.0 has issued the following complaint during compilation
; until the next form was executed:
; **++++ Error in NTH-UPDATE-REWRITER1:
; Function size 73824 is too large.
; But even with the next form, we have seen the following:
; **++++ Error in XTRANS-EVAL:
; Function size 67910 is too large.
#+lispworks
(cl-user::toggle-source-debugging nil)
(defmacro our-with-compilation-unit (form)
; In fact, with-compilation-unit is only defined in dpANS, not CLtL2. But MCL
; and CCL do seem to support it, so we allow it with #+cltl2 and #+ccl.
; We also have noticed that while :CLTL2 belongs to *features* in Version
; :CMU17 (presumably 17f), it does not belong in a cmucl version 18d that we
; obtained for Linux, even though with-compilation-unit continues to be
; defined.
#+cltl2
`(common-lisp::with-compilation-unit
()
,form)
#-cltl2
form)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; BASIC FUNCTIONS TO BE COMPILED
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Functions for proclaiming and for defining ACL2's Implementation of the
; Backquote Readmacro are to be compiled, so we do not include them in the
; present file. Instead we put them in acl2-fns.lisp, after defining the
; following constant. (We could put this defconstant in acl2-fns.lisp, but
; CLISP would warn unless we made it conditional on a (not (boundp ..))
; check. That sort of fix has gotten us into trouble with Allegro, so we take
; the simpler solution of putting the defconstant in this file, which is
; loaded only once (there is no compiled version of this file to load).
(defconstant *acl2-read-character-terminators*
'(#\Tab #\Newline #\Page #\Space #\" #\' #\( #\) #\; #\` #\,))
(our-with-compilation-unit
; At one time we avoided recompiling and had the following code inside a COND:
#|
((and (probe-file object-file)
(<= (file-write-date "acl2-fns.lisp")
(file-write-date object-file)))
(load object-file))
|#
; But for example, if we compile with Allegro under SunOS and then later build
; the system with Allegro under Linux, the same ".fasl" extension could fool us
; into thinking that recompilation is not necessary.
(progn
(load "acl2-fns.lisp") ;we like to load before compiling
(when (not *suppress-compile-build-time*)
(compile-file "acl2-fns.lisp")
; Note that load-compiled is not used below, but on the other hand we are still
; using the original readtable here so that's not a problem.
(load (make-pathname :name "acl2-fns"
:type *compiled-file-extension*)))))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; ACL2-READTABLE
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defparameter *acl2-readtable*
(copy-readtable nil)
"*acl2-readtable* is the readtable we use (a) to restrict the use
#. to cause evaluation during READing (b) and to define our own version
of backquote.")
(defun define-sharp-dot ()
(set-dispatch-macro-character
#\#
#\.
#'sharp-dot-read))
(defun define-sharp-comma ()
(set-dispatch-macro-character
#\#
#\,
#'sharp-comma-read))
(defun define-sharp-atsign ()
(set-dispatch-macro-character
#\#
#\@
#'sharp-atsign-read))
(defun define-sharp-bang ()
(set-dispatch-macro-character
#\#
#\!
#'sharp-bang-read))
(defun modify-acl2-readtable (do-all-changes)
(let ((*readtable* *acl2-readtable*))
; Backquote
(set-macro-character
#\`
#'(lambda (stream char)
(declare (ignore char))
(let ((*backquote-counter* (1+ *backquote-counter*)))
(backquote (read stream t nil t)))))
; Comma
(set-macro-character
#\,
#'(lambda (stream char)
(declare (ignore char))
(let ((*backquote-counter* (1- *backquote-counter*)))
(cond ((< *backquote-counter* 0)
(clear-input stream)
(error "Illegal comma encountered by READ.")))
(case (peek-char nil stream t nil t)
(#\@ (read-char stream t nil t)
(list *comma-atsign* (read stream t nil t)))
(#\. (error ",. not allowed in ACL2 backquote forms."))
(otherwise (list *comma* (read stream t nil t)))))))
; Restrict #.
(when do-all-changes
(define-sharp-dot)
(define-sharp-comma)
(define-sharp-atsign)
(define-sharp-bang))
; Keep control of character reader. However, we do not need to keep such
; control when reading in a .fas file for CLISP, and in fact, the set-theory
; book's use of (code-char 255) generates
; #\LATIN_SMALL_LETTER_Y_WITH_DIAERESIS in set-theory.fas. We see no reason
; to restrict reading of such characters in .fas files.
(when do-all-changes
(set-dispatch-macro-character
#\#
#\\
#'acl2-character-reader))))
(eval-when
#-cltl2
(load eval compile)
#+cltl2
(:load-toplevel :execute :compile-toplevel)
#-clisp
(modify-acl2-readtable t)
#+clisp
(progn (modify-acl2-readtable nil)
(defparameter *acl2-readtable-clisp-fas*
(copy-readtable *acl2-readtable*))
(let ((*readtable* *acl2-readtable*))
(define-sharp-dot)
(define-sharp-comma)
(define-sharp-atsign)
(define-sharp-bang)
(set-dispatch-macro-character
#\#
#\\
#'acl2-character-reader))))
(defvar *reckless-acl2-readtable*
; See "SUPPORT FOR FAST #n= and #n#" in acl2-fns.lisp.
(let ((*readtable* (copy-readtable *acl2-readtable*)))
(set-dispatch-macro-character #\#
#\#
#'reckless-sharp-sharp-read)
(set-dispatch-macro-character #\#
#\=
#'reckless-sharp-equal-read)
*readtable*))
(defvar *load-compiled-verbose* nil)
(defun load-compiled (filename &optional verbose)
; It may be useful to implement the maybe-verbose argument for Lisps that do
; not print a "loading" message. For now, we comment out code below that would
; do this.
(when (and verbose
*load-compiled-verbose*)
(eval `(cw "~%Note: loading file ~s0.~|" ',filename)))
#+clisp
(let ((*readtable* *acl2-readtable-clisp-fas*))
(load filename))
#-clisp
(load filename))
#|
Remarks on *acl2-readtable*
Because read-object$ calls the Common Lisp function read, read-object$
is a function of the values of the Common Lisp symbols (a)
*readtable*, (b) *package*, and (c) *features*. In ACL2, the user can
specify the package to use, via in-package, which sets the global
current-package. The user of ACL2 has no (legitimate) control over the
readtable, which is set above and discussed below.
As for *features*, we currently permit full use of the *features*
facility of the Common Lisp reader, with this caveat: it is an
official part of the ACL2 story that *features* should have the same
setting throughout all phases of ACL2 usage. That is, the user must
set up *features* at the beginning, before starting to use ACL2 and
the user must then leave *features* alone (even though the
implementors of ACL2 put :acl2-loop-only onto *features* during
boot-strapping). One bad consequence of our *features* policy is that
verified files will not in general be verifiable or useable in other
Lisp implementations or installations unless the settings of
*features* relevant to one's usages of the #+ and #- are the same in
the two Lisp implementations. One simple way to obtain peace of mind
on this topic is for the user not to use #+ or #- at all! It might be
cleaner for us simply to prohibit the use of the #+ and #- readmacros
all together in ACL2. This could be done at the cost of replacing the
many uses of #+ and #- in axioms.lisp, and a few other places, with
some sort of regular macro.
Below is a detailed examination of the default Common Lisp readtable
from the perspective of ACL2. We want to make sure that when we read,
we do not have side effects (e.g. via #.) of ACL2 but will merely
either (a) cause an error or (b) generate a Lisp object, which we then
will check with bad-lisp-object before handing it to ACL2 functions.
All of the standard Common Lisp characters are either white space or
constituent, with the following exceptions, which are read macros:
" quote
# number sign
' quote
() parentheses
, comma
; comment
\ single escape
` backquote
| multiple escape
With the exception of number sign, backquote and comma, we certainly
want all of these readmacros to have their usual Common Lisp
semantics.
We have defined our own backquote and discussed it above.
We now review the # situation:
## and #= are for reading possibly circular stuff
bad-lisp-object may run forever
#' reads as function
won't hurt anything
#( vector
will be rejected by bad-lisp-object
#) signals an error
enough said
#* bit vector
will be rejected by bad-lisp-object
#, load-time evaluation
we shut it off
#0-#9 used for infix arguments
ok
#: uninterned symbol
will be rejected by bad-lisp-object
#< signals an error
enough said
#\ character object
will be checked by bad-lisp-object; see also below
#| start comment, ended by |#
ok
#<backspace | tab | newline | linefeed | page | return | space>
signals an error -- ok
#+ and #-
see the discussion of *features* above
#. read time evaluation
we restrict it
#A, #a arrays
will be checked by bad-lisp-object
#B, #b binary rational
ok
#C, #c complex
ok (rejected by bad-lisp-object except for rational components)
#O, #o octal
ok
#P, #p pathname
will be checked by bad-lisp-object
#R, #r radix-n
fine
#S, #s structure
will be rejected by bad-lisp-object
#X, #x hex
ok
Eventually, it will be best to define a read function for ACL2 solely in terms
of ACL2 character reading primitives. Common Lisp read is ambiguous. There is
the ambiguity of backquote described above. There is the abiguity of which
tokens get read as numbers. To make matters a little more scary, there is
nothing that prevents a Common Lisp implementation from adding, for example, a
new # readmacro option that would provide something as potentially catastrophic
as full-blown sharp-dot. One obstacle to doing a read within ACL2 this is
efficiency. For example, ACL2 does not now support unread-char. And given the
requirement that whatever is specified in a guard must be checkable, it is
unclear now how best to add unread-char since Common Lisp does permit one to
detect whether a stream is in a ``just unread'' state. ACL2 could enable one
to answer such a question, but at the cost of having to store the information
every time that a character was unread.
|#
; ACL2's Implementation of the character reader
; We have decided to take full charge of everything that # reader
; does, which is just a part of the way towards writing READ totally
; from scratch. And we are pretty conservative about what #\ does
; accept; one can always get the characters one wants by using
; code-char. Notice for example that if we're not careful, then ACL2
; could be potentially unsound when we have 8-bit characters, because
; it's conceivable that
;
; (equal (char-code "#\fifth-control-character") 5)
;
; is a theorem in one Common Lisp and yet
;
; (equal (char-code "#\fifth-control-character") 6)
;
; is a theorem in another. Bizarre, but apparently not ruled out by
; dpANS.
;
; So, we manage this simply by modifying the character reader so that
; the #\ notation only works for single characters and for Space, Tab,
; Newline, Page, and Rubout; an error is caused otherwise.
; Our algorithm for reading character objects starting with #\ is
; quite simple. We accumulate characters until encountering a
; whitespace character or a terminating macro character, from the list
; *acl2-read-character-terminators*. The result must be either a
; single standard character or else one of the names (up to case,
; which we ignore in the multiple-character case) SPACE, TAB, NEWLINE,
; PAGE, and RUBOUT. Otherwise we cause an error. Note that if we do
; NOT cause an error, then any dpANS-compliant Common Lisp
; implementation's character reader would behave the same way, because
; dpANS says (in the section ``Sharpsign Backslash'') the following.
; ..... After #\ is read, the reader backs up
; over the slash and then reads a token, treating the initial slash
; as a single escape character (whether it really is or not in the
; current readtable).
; The rather involved description from dpANS in the section ``Reader
; Algorithm'' implies that when a token is terminated without error,
; it must be upon first encountering a whitespace character or a
; terminating macro character.
; Finally, here is an argument that we cannot reasonably allow ACL2 to
; accept character notations of the sort akcl allows, such as #\\112
; for #\J for example. (By the way, 112 is octal for 74, which is
; (char-code #\J).) This is sad, because it would have been nice to
; provide a way of reading arbitrary 8-bit characters in ACL2.
; In the following, we refer to documentation from Bill Schelter's
; info version of dpANS.
; So, assume that #\J parses the same as #\\112 (and we'll derive a
; ``contradiction'' of sorts). The documentation from ``Sharpsign
; Backslash'' below implies that #\\112 parses as the character whose
; name is [STRING-UPCASE applied to] the 4-character string \112. So
; if #\\112 parses as #\J, then the name of the character #\J is
; "\\112". Then, the documentation for ``char-name'' (part of which
; is also below) implies that CHAR-NAME returns the character name,
; and hence (CHAR-NAME #\J) must be "\\112". But probably this isn't
; true of the implementation (it's not true for akcl or allegro, for
; example). And, it seems really dangerous for us to redefine
; CHAR-NAME in ACL2.
; What's worse, if we apply the first part of this argument to
; #\Newline, we see that the name of the character #\Newline is
; "\\12", which directly contradicts the final passage below from
; dpANS.
; In what follows we'll quote from dpANS (an emacs Info version). We
; quote here from three sections, separated by ++++++++++++++++++.
#|
Sharpsign Backslash
...................
Syntax: #\<<x>>
[[[ text omitted ]]]
When the token x is more than one character long, the x must have the
syntax of a symbol with no embedded package markers. In this case, the
sharpsign backslash notation parses as the character whose name is
(string-upcase x); see *See Character Names::.
++++++++++++++++++
char-name [Function]
---------------------------------------------------------------------------
`char-name' character => name
Arguments and Values::
......................
character--a character.
name--a string or nil.
Description::
.............
Returns a string that is the name of the character, or nil if the
character has no name.
++++++++++++++++++
Character Names
---------------
The following character names must be present in all conforming
implementations:
Newline
|# ; |
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; COMPILING and LOADING, PART 2
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun compile-acl2 (&optional use-acl2-proclaims)
(declare (ignorable use-acl2-proclaims))
(with-warnings-suppressed
#+sbcl
(declaim (optimize (safety 0) (space 0) (speed 3) (debug 0)))
; Here is a natural place to put compiler options. In fact, we put
; them above, globally.
; (declaim (optimize (safety 0) (space 0) (speed 3)))
; However, Juho Snellman points out that SBCL resets the compiler policy on
; entry to LOAD / COMPILE-FILE, and restores the old value once the file has
; been loaded / compiled; thus the global declaim is no longer in effect once
; COMPILE-ACL2 gets called.
; Note on Illegal Instructions: If ACL2 causes an illegal instruction
; trap it is difficult to figure out what is happening. Here is a
; brute force way to do it.
; (0) create an events file or book that will recreate the
; the state up to the event that causes the illegal instruction.
; (1) Copy saved_acl2 to old_saved_acl2
; (2) replace the declaim above with
; (declaim (optimize (safety 3) (space 0) (speed 0)));
; (3) make full init
; this will fail because of stack overflows during booting.
; (4) fire up old_saved_acl2
; (5) load the saved events file or book, recreating the state.
; (6) :q from (LP)
; (7) (progn (setq old-world-pair (get 'current-acl2-world 'acl2-world-pair))
; t)
; (8) (dolist (name *acl2-files*)
; (or (equal name "defpkgs")
; (load source))) ; load the (safety 3) .o files
; Actually, the last time I did this I loaded each file manually
; and I did not load ld or interface-raw. I think they can be
; loaded here though.
; (9) (progn (f-put-global 'current-acl2-world
; (car old-world-pair) *the-live-state*)
; t)
;(10) (si::use-fast-links nil)
;(11) enter (LP) and execute the offending event.
;(12) once the bug is fixed, be sure to change the declaim
; back to (safety 0) (speed 3) before recompiling.
; Note on loading before compiling. We load each ACL2 source file
; before compiling it to make sure that the functions needed to
; execute macros have been defun-ed before they are called. Normal
; Common Lisp compilation does not do this. So we cause all forms to
; be executed before we start the compilation. This guarantees that
; when macros run, the functions they call have been defined.
; In general, and for the same reason, all ACL2 user checked files
; are also be loaded before they are compiled.
#-acl2-mv-as-values
(when use-acl2-proclaims
(return-from compile-acl2 nil))
; As of version 18a, cmulisp spews gc messages to the terminal even when
; standard and error output are redirected. So we turn them off.
(cond
((or (not (probe-file *acl2-status-file*))
(with-open-file (str *acl2-status-file*
:direction :input)
(not (eq (read str nil)
:checked))))
(check-suitability-for-acl2)))
(when (not *suppress-compile-build-time*)
(our-with-compilation-unit
(let ((*readtable* *acl2-readtable*)
#+akcl
; AKCL compiler note stuff. We have so many tail recursive functions
; that the notes about tail recursion optimization are just too much
; to take.
(compiler:*suppress-compiler-notes* t))
(when use-acl2-proclaims
(load "acl2-proclaims.lisp"))
(dolist (name *acl2-files*)
(or (equal name "defpkgs")
(let ((source (make-pathname :name name
:type *lisp-extension*)))
(load source)
(or (equal name "proof-checker-pkg")
(progn
(when (not use-acl2-proclaims)
; So, we have not loaded acl2-proclaims.lisp.
(proclaim-file source))
(compile-file source)
(load-compiled
(make-pathname :name name
:type *compiled-file-extension*))))))))))
(note-compile-ok)))
(defun no-object-file-or-out-of-date-object-file (fl)
(or (null (probe-file
(make-pathname :name fl :type *compiled-file-extension*)))
(> (file-write-date
(make-pathname :name fl :type *lisp-extension*))
(file-write-date
(make-pathname :name fl :type *compiled-file-extension*)))))
(defun quick-compile-acl2 (&optional very-fast use-acl2-proclaims)
(with-warnings-suppressed
; Here is a natural place to put compiler options.
; (declaim (optimize (safety 0) (space 0) (speed 3)))
; As of version 18a, cmulisp spews gc messages to the terminal even when
; standard and error output are redirected. So we turn them off.
#+cmu
(setq extensions::*gc-verbose* nil)
(cond
((or (not (probe-file (make-pathname :name "acl2-status"
:type "txt")))
(with-open-file (str (make-pathname :name "acl2-status"
:type "txt")
:direction :input)
(not (eq (read str nil)
:checked))))
(check-suitability-for-acl2)))
(our-with-compilation-unit
(let ((compile-rest-flg nil)
(*readtable* *acl2-readtable*)
#+akcl
(si:*notify-gbc* nil)
#+akcl
; AKCL compiler note stuff. We have so many tail recursive functions
; that the notes about tail recursion optimization are just too much
; to take.
(compiler:*suppress-compiler-notes* t)
(files (remove "defpkgs" *acl2-files* :test #'equal)))
(cond
((some #'no-object-file-or-out-of-date-object-file files)
(when use-acl2-proclaims
(load "acl2-proclaims.lisp"))
(dolist
(fl files)
(let ((source (make-pathname :name fl :type *lisp-extension*))
(object (make-pathname :name fl :type *compiled-file-extension*)))
(cond
((or *suppress-compile-build-time*
(equal fl "proof-checker-pkg"))
(load source))
((or compile-rest-flg (no-object-file-or-out-of-date-object-file fl))
(load source)
(proclaim-file source)
(when (not very-fast)
(setq compile-rest-flg t))
(compile-file source)
(load-compiled object))
(t (load-compiled object)
(proclaim-file source))))))
(t "Nothing to do."))))
(note-compile-ok)))
#+gcl
(defvar user::*fast-acl2-gcl-build* nil)
(defun load-acl2 (&optional fast)
#-akcl (declare (ignore fast)) ; fast only avoids slow growth during gcl init
(our-with-compilation-unit ; only needed when *suppress-compile-build-time*
(with-warnings-suppressed
; If we are in the first pass of two passes because of acl2-mv-as-values, then
; don't waste time doing the slow build for GCL (where we compile all *1*
; functions as we go through initialization).
#+(and gcl acl2-mv-as-values)
(when fast
(setq user::*fast-acl2-gcl-build* t))
#+akcl
; We grow the image slowly, since we now do allocation on start-up. We are
; assuming that people will be using load-acl2 only as part of the process of
; building a saved image, and hence that this slow growth policy will be undone
; by the function save-acl2-in-akcl. If we are
(when (not fast)
(loop
for type in
'(cons fixnum symbol array string cfun sfun
; In akcl, at least some versions of it, we cannot call allocate-growth on the
; following two types.
#+gcl contiguous
#+gcl relocatable
)
do
(cond
((or (boundp 'si::*gcl-major-version*) ;GCL 2.0 or greater
(and (boundp 'si::*gcl-version*) ;GCL 1.1
(= si::*gcl-version* 1)))
(si::allocate-growth type 1 10 50 2))
(t (si::allocate-growth type 1 10 50)))))
(cond
((or (not (probe-file *acl2-status-file*))
(with-open-file (str *acl2-status-file*
:direction :input)
(not (member (read str nil)
'(:compiled :initialized)))))
(error "Please compile ACL2 using ~s or~%~
~s, which will write the~%~
token :compiled to the file acl2-status.txt."
'(compile-acl2)
'(quick-compile-acl2 t))))
(let ((*readtable* *acl2-readtable*)
(extension (if *suppress-compile-build-time*
*lisp-extension*
*compiled-file-extension*)))
(dolist (name *acl2-files*)
(or (equal name "defpkgs")
(if (equal name "proof-checker-pkg")
(load "proof-checker-pkg.lisp")
(load-compiled (make-pathname :name name
:type extension)))))
(load "defpkgs.lisp")
(in-package "ACL2")
; Do not make state special, as that can interfere with tail recursion removal.
; The following form is provided merely as a convenience to the user, who may
; want to execute ACL2 forms in raw Lisp. The use of set instead of setq is to
; avoid getting a warning in cmulisp that state is undefined.
(set 'state *the-live-state*)
"ACL2"))))
(defun load-acl2-execution-environment ()
(let ((*readtable* *acl2-readtable*))
(load-compiled (make-pathname :name "axioms"
:type (if *suppress-compile-build-time*
*lisp-extension*
*compiled-file-extension*)))
(load "defpkgs.lisp")
(in-package "ACL2")
"ACL2"))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; DECLARATIONS
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; We use XARGS in DECLARE forms. By making this proclamation, we
; suppress compiler warnings.
(declaim (declaration xargs))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; EXITING LISP
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defparameter *acl2-panic-exit-status* nil)
(defun exit-lisp (&optional (status '0 status-p))
; The status will be returned as the exit status (shell variable $?).
; We avoid passing the status argument when it is 0, in case Windows or other
; operating systems get confused by it.
; It appeared at one point that (ccl::quit 0) is more reliable than
; (ccl::quit), but that's no longer clear. Still, it seems reasonable to pass
; the status explicitly to the individual Lisp's exit function if that status
; is passed explicitly here -- hence the use of status-p.
(setq *acl2-panic-exit-status* status)
#+clisp
(if status-p (user::exit status) (user::exit))
#+lispworks ; Version 4.2.0; older versions have used bye
(if status-p (lisp::quit :status status) (lisp::quit))
#+akcl
(if status-p (lisp::bye status) (lisp::bye))
#+lucid
(lisp::exit) ; don't know how to handle status, but don't support lucid
#+ccl
(if status-p (ccl::quit status) (ccl::quit))
#+cmu
(cond ((null status-p)
(common-lisp-user::quit t))
(t ; quit does not take an exit status as of CMUCL version 19e
(unix:unix-exit status)))
#+allegro
(user::exit status :no-unwind t)
#+(and mcl (not ccl))
(cl-user::quit) ; mcl support is deprecated, so we don't worry about status
#+sbcl
(if status-p
(sb-ext:quit :unix-status status)
(sb-ext:quit))
; Return status (to avoid an ignore declaration) if we cannot exit lisp. The
; caller of this function should complain if Lisp survives the call. The panic
; flag may help though.
(progn status-p status))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; CONSTANTS
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Allegro 6.0 (and probably later versions) warns when the following two (at
; least) constants are in axioms.lisp, even with boundp checks (as in ACL2
; Version_2.5). The warning is a result of evaluating the defconstant twice:
; when loading the source file and when subsequently loading the compiled file.
; So starting with Version_2.6 we put the constants here, since this file
; (acl2.lisp) is not compiled and hence is only loaded once.
; A slight complication is that *slashable-array* uses *slashable-chars*, which
; in turn is used in the definition of function some-slashable. (There are
; other such examples, but we'll focus on that one.) So, defconst
; *slashable-chars* needs to be defined in the ACL2 loop even though, as of
; Version_2.5, it was used in the definition of *slashable-array*, which we
; want to include in the present file. So we inline the defconsts below.
(defconstant *slashable-array*
(let ((ar (make-array 256 :initial-element nil)))
(dolist (ch
; Inline *slashable-chars*; see the comment above.
'(#\Newline #\Page #\Space #\" #\# #\' #\( #\) #\, #\: #\; #\\ #\`
#\a #\b #\c #\d #\e #\f #\g #\h #\i #\j #\k #\l #\m #\n #\o #\p
#\q #\r #\s #\t #\u #\v #\w #\x #\y #\z #\|))
(setf (aref ar (char-code ch))
t))
ar))
(defconstant *suspiciously-first-numeric-array*
(let ((ar (make-array 256 :initial-element nil)))
(dolist (x
; Inline *suspiciously-first-numeric-chars*; see the comment above.
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9 #\+ #\- #\. #\^ #\_))
(setf (aref ar (char-code x))
t))
ar))
(defconstant *suspiciously-first-hex-array*
(let ((ar (make-array 256 :initial-element nil)))
(dolist (x
; Inline *suspiciously-first-hex-chars*; see the comment above.
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9
#\A #\B #\C #\D #\E #\F
#\a #\b #\c #\d #\e #\f
#\+ #\- #\. #\^ #\_))
(setf (aref ar (char-code x))
t))
ar))
(defconstant *base-10-array*
(let ((ar (make-array 256 :initial-element nil)))
(dolist (x
; Inline *base-10-chars*; see the comment above.
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9))
(setf (aref ar (char-code x))
t))
ar))
(defconstant *hex-array*
(let ((ar (make-array 256 :initial-element nil)))
(dolist (x
; Inline *hex-digits*; see the comment above.
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9
#\A #\B #\C #\D #\E #\F
#\a #\b #\c #\d #\e #\f))
(setf (aref ar (char-code x))
t))
ar))
(defconstant *letter-array*
(let ((ar (make-array 256 :initial-element nil)))
(dolist (ch
; Inline *letter-array*; see the comment above.
'(#\A #\B #\C #\D #\E #\F #\G #\H #\I #\J #\K #\L #\M #\N #\O #\P
#\Q #\R #\S #\T #\U #\V #\W #\X #\Y #\Z
#\a #\b #\c #\d #\e #\f #\g #\h #\i #\j #\k #\l #\m #\n #\o #\p
#\q #\r #\s #\t #\u #\v #\w #\x #\y #\z))
(setf (aref ar (char-code ch))
t))
ar))
(defmacro suspiciously-first-numeric-array (print-base)
`(if (eql ,print-base 16)
*suspiciously-first-hex-array*
*suspiciously-first-numeric-array*))
(defmacro numeric-array (print-base)
`(if (eql ,print-base 16)
*hex-array*
*base-10-array*))
(defconstant *char-code-backslash* (char-code #\\))
(defconstant *char-code-slash* (char-code #\/))
(defconstant *char-code-double-gritch* (char-code #\"))
; The following constant was originally in translate.lisp, but CLISP warned
; that it was being redefined. This seems to be the same problem as mentioned
; above for Allegro above, so we define it here.
(defconstant *big-n-special-object* '(nil . nil))
(defconstant *number-of-return-values*
; Keep this in sync with related code in translate11.
32)
(defconstant *boole-array*
; Keep this in sync with the defconst forms just above the definition of
; boole$.
(let ((ar (make-array 16 :element-type 'fixnum))
(i 0))
(declare (type (simple-array fixnum (*)) ar))
(dolist (x `((boole-1 . ,boole-1)
(boole-2 . ,boole-2)
(boole-and . ,boole-and)
(boole-andc1 . ,boole-andc1)
(boole-andc2 . ,boole-andc2)
(boole-c1 . ,boole-c1)
(boole-c2 . ,boole-c2)
(boole-clr . ,boole-clr)
(boole-eqv . ,boole-eqv)
(boole-ior . ,boole-ior)
(boole-nand . ,boole-nand)
(boole-nor . ,boole-nor)
(boole-orc1 . ,boole-orc1)
(boole-orc2 . ,boole-orc2)
(boole-set . ,boole-set)
(boole-xor . ,boole-xor)))
(or (typep (cdr x) 'fixnum)
(error "We expected the value of ~s to be a fixnum, but it is ~s!"
(car x) (cdr x)))
(setf (aref ar i) (cdr x))
(incf i))
ar))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; STATISTICS
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; See the comment in *rewrite-depth-max* about rewrite stack depth:
; (push :acl2-rewrite-meter *features*)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; PROMPTS
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; New ACL2 users sometimes do not notice that they are outside the ACL2
; read-eval-print loop when in a break. See the discussion of "PROMPTS" in
; interface-raw.lisp for how we deal with this. For GCL, we currently (as of
; GCL version 2.6.6) need a patch for built-in function si::break-level. This
; requires a package change, so we put that patch in a file that is not
; compiled; the present file serves nicely.
#+gcl
(in-package "SYSTEM")
#+gcl
(progn
(defvar *debug-prompt-suffix* "")
; See comment about ACL2 for how the following is patched from si::break-level.
(defun break-level-for-acl2 (at &optional env)
(eval '(acl2::print-proof-tree-finish acl2::*the-live-state*))
(let* ((*break-message* (if (stringp at) at *break-message*))
(*quit-tags* (cons (cons *break-level* *quit-tag*) *quit-tags*))
(*quit-tag* (cons nil nil))
(*break-level* (if (not at) *break-level* (cons t *break-level*)))
(*ihs-base* (1+ *ihs-top*))
(*ihs-top* (1- (ihs-top)))
(*current-ihs* *ihs-top*)
(*frs-base* (or (sch-frs-base *frs-top* *ihs-base*) (1+ (frs-top))))
(*frs-top* (frs-top))
(*break-env* nil)
(be *break-enable*)
(*break-enable*
(progn
(if (stringp at) nil be)))
;(*standard-input* *terminal-io*)
(*readtable* (or *break-readtable* *readtable*))
(*read-suppress* nil)
(+ +) (++ ++) (+++ +++)
(- -)
(* *) (** **) (*** ***)
(/ /) (// //) (/// ///)
)
; (terpri *error-output*)
(unless (or be (not (stringp at)))
(simple-backtrace)
(break-quit (length (cdr *break-level*))))
(catch-fatal 1)
(setq *interrupt-enable* t)
(cond ((stringp at) (set-current)(terpri *error-output*)
(setq *no-prompt* nil)
)
(t (set-back at env)))
(loop
(setq +++ ++ ++ + + -)
(cond (*no-prompt* (setq *no-prompt* nil))
(t ; ACL2 patch is in the following form, only
(format *debug-io* "~&~a~a~a>~{~*>~}"
(if (stringp at) "" "dbl:")
(if (eq *package* (find-package 'user)) ""
(package-name *package*))
*debug-prompt-suffix*
*break-level*)))
(force-output *error-output*)
(when
(catch 'step-continue
(catch *quit-tag*
(setq - (locally (declare (notinline read))
(dbl-read *debug-io* nil *top-eof*)))
(when (eq - *top-eof*) (lisp::bye -1))
(let* ( break-command
(values
(multiple-value-list
(LOCALLY (declare (notinline break-call evalhook))
(if (keywordp -)(setq - (cons - nil)))
(cond ((and (consp -) (keywordp (car -)))
(setq break-command t)
(break-call (car -) (cdr -) 'si::break-command))
(t (evalhook - nil nil *break-env*)))))))
(and break-command (eq (car values) :resume )(return))
(setq /// // // / / values *** ** ** * * (car /))
(fresh-line *debug-io*)
(dolist (val /)
(locally (declare (notinline prin1)) (prin1 val *debug-io*))
(terpri *debug-io*)))
nil))
(terpri *debug-io*)
(break-current))))))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Some hacks for CCL
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Bob Boyer uses the following in the hons version. For now, we restrict to
; that version.
; We have observed about an 8% speedup in the #-hons version of ACL2 by not
; saving definition bodies, as opposed to saving them (with the first two setq
; forms below).
#+(and ccl hons)
(setq ccl:*save-definitions* t)
#+(and ccl hons)
(setq ccl:*fasl-save-definitions* t)
; Allow control-d to exit:
#+(and ccl hons)
(setq ccl::*quit-on-eof* t)
; Bob Boyer uses the following at times.
#||
#+ccl
(in-package "CCL")
#+ccl
(flet ((go-slow
()
(set-current-compiler-policy (new-compiler-policy :inline-self-calls #'false))
(set-current-file-compiler-policy (new-compiler-policy :inline-self-calls #'false))
(proclaim '(optimize (debug 3) (compilation-speed 0)
(safety 3) (speed 0) (space 0)))))
(go-slow))
||#
; The following two assignments seemed to speed up regression runs by about
; 7.7% as opposed to only the second, which seemed to have little effect.
; Binding these variables in LP, instead of this, didn't seem to provide any
; of that speed-up.
; NOTE: If you don't like these defaults, try Bob Boyer's approach: put these
; same forms in your ~/ccl-init.lisp file, but replacing nil with t.
; NOTE: The first of these seemed to be necessary even in 32-bit CCL r13193,
; where one might have expected that not to be the case.
#+ccl
(when (boundp 'ccl::*save-interactive-source-locations*)
(setq ccl::*save-interactive-source-locations* nil))
#+ccl
(when (boundp 'ccl::*save-source-locations*)
(setq ccl::*save-source-locations* nil))
|