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
|
/* Scheme In One Defun, but in C this time.
* COPYRIGHT (c) 1988-1994 BY *
* PARADIGM ASSOCIATES INCORPORATED, CAMBRIDGE, MASSACHUSETTS. *
* ALL RIGHTS RESERVED *
Permission to use, copy, modify, distribute and sell this software
and its documentation for any purpose and without fee is hereby
granted, provided that the above copyright notice appear in all copies
and that both that copyright notice and this permission notice appear
in supporting documentation, and that the name of Paradigm Associates
Inc not be used in advertising or publicity pertaining to distribution
of the software without specific, written prior permission.
PARADIGM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
PARADIGM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
SOFTWARE.
*/
/*
gjc@paradigm.com, gjc@mitech.com
Paradigm Associates Inc Phone: 617-492-6079
29 Putnam Ave, Suite 6
Cambridge, MA 02138
Release 1.0: 24-APR-88
Release 1.1: 25-APR-88, added: macros, predicates, load. With additions by
Barak.Pearlmutter@DOGHEN.BOLTZ.CS.CMU.EDU: Full flonum recognizer,
cleaned up uses of NULL/0. Now distributed with siod.scm.
Release 1.2: 28-APR-88, name changes as requested by JAR@AI.AI.MIT.EDU,
plus some bug fixes.
Release 1.3: 1-MAY-88, changed env to use frames instead of alist.
define now works properly. vms specific function edit.
Release 1.4 20-NOV-89. Minor Cleanup and remodularization.
Now in 3 files, siod.h, slib.c, siod.c. Makes it easier to write your
own main loops. Some short-int changes for lightspeed C included.
Release 1.5 29-NOV-89. Added startup flag -g, select stop and copy
or mark-and-sweep garbage collection, which assumes that the stack/register
marking code is correct for your architecture.
Release 2.0 1-DEC-89. Added repl_hooks, Catch, Throw. This is significantly
different enough (from 1.3) now that I'm calling it a major release.
Release 2.1 4-DEC-89. Small reader features, dot, backquote, comma.
Release 2.2 5-DEC-89. gc,read,print,eval, hooks for user defined datatypes.
Release 2.3 6-DEC-89. save_forms, obarray intern mechanism. comment char.
Release 2.3a......... minor speed-ups. i/o interrupt considerations.
Release 2.4 27-APR-90 gen_readr, for read-from-string.
Release 2.5 18-SEP-90 arrays added to SIOD.C by popular demand. inums.
Release 2.6 11-MAR-92 function prototypes, some remodularization.
Release 2.7 20-MAR-92 hash tables, fasload. Stack check.
Release 2.8 3-APR-92 Bug fixes, \n syntax in string reading.
Release 2.9 28-AUG-92 gc sweep bug fix. fseek, ftell, etc. Change to
envlookup to allow (a . rest) suggested by bowles@is.s.u-tokyo.ac.jp.
Release 2.9a 10-AUG-93. Minor changes for Windows NT.
Release 3.0 12-JAN-94. Release it, include changes/cleanup recommended by
andreasg@nynexst.com for the OS2 C++ compiler. Compilation and running
tested using DEC C, VAX C. WINDOWS NT. GNU C on SPARC.
Festival/Edinburgh Speech Tools changes (awb@cstr.ed.ac.uk) 1996-1999
Note there have been substantial changes to this from its original
form which may have introduced bugs. Please contact Alan W Black
(awb@cstr.ed.ac.uk) first if you find problems unless you can confirm
they also exist in the original siod-3.0 release
March 1999 split off functions into different files to make it easier
for our documentation purposes, sorry maybe this should be called
SNIOD now :-), or maybe Scheme in one Directory.
*/
#include <cstdio>
#include <cstring>
#include <cctype>
#include <csignal>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include "EST_unix.h"
#include "EST_cutils.h"
#include "siod.h"
#include "siodp.h"
#ifdef WIN32
#include "winsock2.h"
#endif
static int restricted_function_call(LISP l);
static long repl(struct repl_hooks *h);
static void gc_mark_and_sweep(void);
static void gc_ms_stats_start(void);
static void gc_ms_stats_end(void);
static void mark_protected_registers(void);
static void mark_locations(LISP *start,LISP *end);
static void gc_sweep(void);
static void mark_locations_array(LISP *x,long n);
static LISP lreadr(struct gen_readio *f);
static LISP lreadparen(struct gen_readio *f);
static LISP lreadstring(struct gen_readio *f);
const char *siod_version(void)
{return("3.0 FIELD TEST");}
LISP heap_1,heap_2;
LISP heap,heap_end,heap_org;
long heap_size = DEFAULT_HEAP_SIZE;
long old_heap_used;
long which_heap;
long gc_status_flag = 0;
long show_backtrace = 0;
char *init_file = (char *) NULL;
char *tkbuffer = NULL;
long gc_kind_copying = 0;
long gc_cells_allocated = 0;
double gc_time_taken;
LISP *stack_start_ptr;
LISP freelist;
long nointerrupt = 1;
long interrupt_differed = 0;
LISP oblistvar = NIL;
LISP current_env = NIL;
static LISP siod_backtrace = NIL;
LISP restricted = NIL;
LISP truth = NIL;
LISP eof_val = NIL;
LISP sym_errobj = NIL;
LISP sym_quote = NIL;
LISP sym_dot = NIL;
LISP unbound_marker = NIL;
LISP *obarray;
long obarray_dim = 100;
struct catch_frame *catch_framep = (struct catch_frame *) NULL;
void (*repl_puts)(char *) = NULL;
LISP (*repl_read)(void) = NULL;
LISP (*repl_eval)(LISP) = NULL;
void (*repl_print)(LISP) = NULL;
repl_getc_fn siod_fancy_getc = f_getc;
repl_ungetc_fn siod_fancy_ungetc = f_ungetc;
LISP *inums;
LISP siod_docstrings = NIL; /* for builtin functions */
long inums_dim = 100;
struct user_type_hooks *user_types = NULL;
struct gc_protected *protected_registers = NULL;
jmp_buf save_regs_gc_mark;
double gc_rt;
long gc_cells_collected;
static const char *user_ch_readm = "";
static const char *user_te_readm = "";
LISP (*user_readm)(int, struct gen_readio *) = NULL;
LISP (*user_readt)(char *,long, int *) = NULL;
void (*fatal_exit_hook)(void) = NULL;
#ifdef THINK_C
int ipoll_counter = 0;
#endif
FILE *fwarn=NULL;
int siod_interactive = 1;
extern "C" {
int el_pos = -1; // actually used by readline
}
const char *repl_prompt = "siod>";
const char *siod_prog_name = "siod";
const char *siod_primary_prompt = "siod> ";
const char *siod_secondary_prompt = "> ";
// A list of objects with gc_free_once set in their user_type_hooks structure
// whose gc_free function has been called in the current GC sweep.
void **dead_pointers = NULL;
int size_dead_pointers = 0;
int num_dead_pointers = 0;
#define DEAD_POINTER_GROWTH (10)
static LISP set_restricted(LISP l);
char *stack_limit_ptr = NULL;
long stack_size =
#ifdef THINK_C
10000;
#else
500000;
#endif
void NNEWCELL(LISP *_into,long _type)
{if NULLP(freelist)
{
gc_for_newcell();
}
*_into = freelist;
freelist = CDR(freelist);
++gc_cells_allocated;
(*_into)->gc_mark = 0;
(*_into)->type = (short) _type;
}
void need_n_cells(int n)
{
/* Check there are N cells available, and force gc if not */
LISP x = NIL;
int i;
for (i=0; i<n; i++)
x = cons(NIL,x);
return;
}
static void start_rememberring_dead(void)
{
num_dead_pointers=0;
}
static int is_dead(void *ptr)
{
int i;
for(i=0; i<num_dead_pointers; i++)
if (dead_pointers[i] == ptr)
return 1;
return 0;
}
static void mark_as_dead(void *ptr)
{
int i;
if (num_dead_pointers == size_dead_pointers)
dead_pointers = wrealloc(dead_pointers, void *, size_dead_pointers += DEAD_POINTER_GROWTH);
for(i=0; i<num_dead_pointers; i++)
if (dead_pointers[i] == ptr)
return;
dead_pointers[num_dead_pointers++] = ptr;
}
void siod_print_welcome(EST_String extra_info)
{printf("Welcome to SIOD, Scheme In One Defun, Version %s\n",
siod_version());
printf("(C) Copyright 1988-1994 Paradigm Associates Inc.\n");
if (extra_info != "")
printf("%s\n", (const char *)extra_info);
}
void siod_print_welcome(void)
{
siod_print_welcome("");
}
void print_hs_1(void)
{printf("heap_size = %ld cells, %ld bytes. %ld inums. GC is %s\n",
heap_size,(long)(heap_size*sizeof(struct obj)),
inums_dim,
(gc_kind_copying == 1) ? "stop and copy" : "mark and sweep");}
void print_hs_2(void)
{if (gc_kind_copying == 1)
printf("heap_1 at %p, heap_2 at %p\n",(void *)heap_1,(void *)heap_2);
else
printf("heap_1 at %p\n",(void *)heap_1);}
/* I don't have a clean way to do this but need to reset this if */
/* ctrl-c occurs. */
int audsp_mode = FALSE;
int siod_ctrl_c = FALSE;
static void err_ctrl_c(void)
{
audsp_mode = FALSE;
siod_ctrl_c = TRUE;
err("control-c interrupt",NIL);}
long no_interrupt(long n)
{long x;
x = nointerrupt;
nointerrupt = n;
if ((nointerrupt == 0) && (interrupt_differed == 1))
{interrupt_differed = 0;
err_ctrl_c();}
return(x);}
extern "C" void handle_sigfpe(int sig SIG_restargs)
{(void)sig;
signal(SIGFPE,handle_sigfpe);
/* Solaris seems to need a relse before it works again */
#ifdef __svr4__
sigrelse(SIGFPE);
#endif
/* linux needs to unmask sigfpe to allow for next one */
#ifdef __linux__
sigset_t set1;
sigemptyset(&set1);
sigaddset(&set1,SIGFPE);
sigprocmask(SIG_UNBLOCK,&set1,NULL);
#endif
signal(SIGFPE,handle_sigfpe);
err("floating point exception",NIL);}
extern "C" void handle_sigint(int sig SIG_restargs)
{(void)sig;
signal(SIGINT,handle_sigint);
/* Solaris seems to need a relse before it works again */
#ifdef __svr4__
sigrelse(SIGINT);
#endif
/* linux needs to unmask sigint to allow for next one */
#ifdef __linux__
sigset_t set1;
sigemptyset(&set1);
sigaddset(&set1,SIGINT);
sigprocmask(SIG_UNBLOCK,&set1,NULL);
#endif
signal(SIGINT,handle_sigint);
if (nointerrupt == 1)
interrupt_differed = 1;
else
err_ctrl_c();}
void siod_reset_prompt(void)
{
el_pos = -1; /* flush remaining input on that line */
repl_prompt = siod_primary_prompt;
interrupt_differed = 0;
nointerrupt = 0;
}
long repl_driver(long want_sigint,long want_init,struct repl_hooks *h)
{int k;
struct repl_hooks hd;
LISP stack_start;
stack_start_ptr = &stack_start;
stack_limit_ptr = STACK_LIMIT(stack_start_ptr,stack_size);
est_errjmp = walloc(jmp_buf,1);
k = setjmp(*est_errjmp);
if(k)
{
sock_acknowledge_error(); /* if there is a client let them know */
siod_reset_prompt();
}
if (k == 2) return(2);
siod_ctrl_c = FALSE;
if (want_sigint) signal(SIGINT,handle_sigint);
close_open_files();
catch_framep = (struct catch_frame *) NULL;
errjmp_ok = 1;
interrupt_differed = 0;
nointerrupt = 0;
if (want_init && init_file && (k == 0)) vload(init_file,0);
// Can't see where else to put this
if ((siod_interactive) && (!isatty(0)))
{ // editline (or its replacement) would do this if stdin was a terminal
fprintf(stdout,"%s",repl_prompt);
fflush(stdout);
}
if (!h)
{hd.repl_puts = repl_puts;
hd.repl_read = repl_read;
hd.repl_eval = repl_eval;
hd.repl_print = repl_print;
return(repl(&hd));}
else
return(repl(h));}
static void ignore_puts(char *st)
{(void)st;}
static void noprompt_puts(char *st)
{if (strcmp(st,"> ") != 0)
put_st(st);}
static char *repl_c_string_arg = NULL;
static long repl_c_string_flag = 0;
static LISP repl_c_string_read(void)
{LISP s;
if (repl_c_string_arg == NULL)
return(eof_val);
s = strcons(strlen(repl_c_string_arg),repl_c_string_arg);
repl_c_string_arg = NULL;
return(read_from_string(get_c_string(s)));}
static void ignore_print(LISP x)
{(void)x;
repl_c_string_flag = 1;}
static void not_ignore_print(LISP x)
{repl_c_string_flag = 1;
pprint(x);}
long repl_c_string(char *str,
long want_sigint,long want_init,long want_print)
{struct repl_hooks h;
long retval;
if (want_print)
h.repl_puts = noprompt_puts;
else
h.repl_puts = ignore_puts;
h.repl_read = repl_c_string_read;
h.repl_eval = NULL;
if (want_print)
h.repl_print = not_ignore_print;
else
h.repl_print = ignore_print;
repl_c_string_arg = str;
repl_c_string_flag = 0;
retval = repl_driver(want_sigint,want_init,&h);
if (retval != 0)
return(retval);
else if (repl_c_string_flag == 1)
return(0);
else
return(2);}
#ifdef unix
#include <sys/types.h>
#include <sys/times.h>
double myruntime(void)
{double total;
struct tms b;
times(&b);
total = b.tms_utime;
total += b.tms_stime;
return(total / 60.0);}
#else
#if defined(THINK_C) | defined(WIN32) | defined(VMS)
#ifndef CLOCKS_PER_SEC
#define CLOCKS_PER_SEC CLK_TCK
#endif
double myruntime(void)
{return(((double) clock()) / ((double) CLOCKS_PER_SEC));}
#else
double myruntime(void)
{time_t x;
time(&x);
return((double) x);}
#endif
#endif
void set_repl_hooks(void (*puts_f)(char *),
LISP (*read_f)(void),
LISP (*eval_f)(LISP),
void (*print_f)(LISP))
{repl_puts = puts_f;
repl_read = read_f;
repl_eval = eval_f;
repl_print = print_f;}
void fput_st(FILE *f,const char *st)
{long flag;
if (f != NULL) /* so we can block warning messages easily */
{
flag = no_interrupt(1);
fprintf(f,"%s",st);
no_interrupt(flag);
}
}
void put_st(const char *st)
{fput_st(stdout,st);}
void grepl_puts(char *st,void (*repl_putss)(char *))
{if (repl_putss == NULL)
{fput_st(fwarn,st);
if (fwarn != NULL) fflush(stdout);}
else
(*repl_putss)(st);}
static void display_backtrace(LISP args)
{
/* Display backtrace information */
LISP l;
int i;
int local_show_backtrace = show_backtrace;
show_backtrace = 0; // so we don't recurse if an error occurs
if (cdr(args) == NIL)
{
printf("BACKTRACE:\n");
for (i=0,l=siod_backtrace; l != NIL; l=cdr(l),i++)
{
fprintf(stdout,"%4d: ",i);
pprintf(stdout,car(l),3,72,2,2);
fprintf(stdout,"\n");
}
}
else if (FLONUMP(car(cdr(args))))
{
printf("BACKTRACE:\n");
int nth = (int)FLONM(car(cdr(args)));
LISP frame = siod_nth(nth,siod_backtrace);
fprintf(stdout,"%4d: ",nth);
pprintf(stdout,frame,3,72,-1,-1);
fprintf(stdout,"\n");
}
show_backtrace = local_show_backtrace;
}
static long repl(struct repl_hooks *h)
{LISP x,cw = 0;
double rt;
gc_kind_copying = 0;
while(1)
{
#if 0
if ((gc_kind_copying == 1) && ((gc_status_flag) || heap >= heap_end))
{rt = myruntime();
gc_stop_and_copy();
sprintf(tkbuffer,
"GC took %g seconds, %ld compressed to %ld, %ld free\n",
myruntime()-rt,old_heap_used,
(long)(heap-heap_org),(long)(heap_end-heap));
grepl_puts(tkbuffer,h->repl_puts);}
/* grepl_puts("> ",h->repl_puts); */
#endif
if (h->repl_read == NULL)
x = lread();
else
x = (*h->repl_read)();
if EQ(x,eof_val) break;
rt = myruntime();
if (gc_kind_copying == 1)
cw = heap;
else
{gc_cells_allocated = 0;
gc_time_taken = 0.0;}
/* Check if its a debugger command */
if ((TYPE(x) == tc_cons) &&
(TYPE(car(x)) == tc_symbol) &&
(streq(":backtrace",get_c_string(car(x)))))
{
display_backtrace(x);
x = NIL;
}
else if ((restricted != NIL) &&
(restricted_function_call(x) == FALSE))
err("Expression contains functions not in restricted list",x);
else
{
siod_backtrace = NIL; /* reset backtrace info */
if (h->repl_eval == NULL)
x = leval(x,NIL);
else
x = (*h->repl_eval)(x);
}
if (gc_kind_copying == 1)
sprintf(tkbuffer,
"Evaluation took %g seconds %ld cons work\n",
myruntime()-rt,
(long)(heap-cw));
else
sprintf(tkbuffer,
"Evaluation took %g seconds (%g in gc) %ld cons work\n",
myruntime()-rt,
gc_time_taken,
gc_cells_allocated);
grepl_puts(tkbuffer,h->repl_puts);
setvar(rintern("!"),x,NIL); /* save value in var called '!' */
if (h->repl_print == NULL)
{
if (siod_interactive)
pprint(x); /* pretty print the result */
}
else
(*h->repl_print)(x);}
return(0);}
void set_fatal_exit_hook(void (*fcn)(void))
{fatal_exit_hook = fcn;}
static LISP err(const char *message, LISP x, const char *s)
{
nointerrupt = 1;
if NNULLP(x)
{
fprintf(stderr,"SIOD ERROR: %s %s: ",
(message) ? message : "?",
(s) ?s : ""
);
lprin1f(x,stderr);
fprintf(stderr,"\n");
fflush(stderr);
}
else
{
fprintf(stderr,"SIOD ERROR: %s %s\n",
(message) ? message : "?",
(s) ? s : ""
);
fflush(stderr);
}
if (show_backtrace == 1)
display_backtrace(NIL);
if (errjmp_ok == 1) {setvar(sym_errobj,x,NIL); longjmp(*est_errjmp,1);}
close_open_files(); /* can give clue to where error is */
fprintf(stderr,"%s: fatal error exiting.\n",siod_prog_name);
if (fatal_exit_hook)
(*fatal_exit_hook)();
else
exit(1);
return(NIL);
}
LISP err(const char *message, LISP x)
{
return err(message, x, NULL);
}
LISP err(const char *message, const char *x)
{
return err(message, NULL, x);
}
LISP errswitch(void)
{return(err("BUG. Reached impossible case",NIL));}
void err_stack(char *ptr)
/* The user could be given an option to continue here */
{(void)ptr;
err("the currently assigned stack limit has been exceeded",NIL);}
LISP stack_limit(LISP amount,LISP silent)
{if NNULLP(amount)
{stack_size = get_c_int(amount);
stack_limit_ptr = STACK_LIMIT(stack_start_ptr,stack_size);}
if NULLP(silent)
{sprintf(tkbuffer,"Stack_size = %ld bytes, [%p,%p]\n",
stack_size,(void *)stack_start_ptr,(void *)stack_limit_ptr);
put_st(tkbuffer);
return(NIL);}
else
return(flocons(stack_size));}
const char *get_c_string(LISP x)
{
if (NULLP(x))
return "nil";
else if TYPEP(x,tc_symbol)
return(PNAME(x));
else if TYPEP(x,tc_flonum)
{
if (FLONMPNAME(x) == NULL)
{
char b[TKBUFFERN];
sprintf(b,"%.8g",FLONM(x));
FLONMPNAME(x) = (char *)must_malloc(strlen(b)+1);
sprintf(FLONMPNAME(x),"%s",b);
}
return FLONMPNAME(x);
}
else if TYPEP(x,tc_string)
return(x->storage_as.string.data);
else
err("not a symbol or string",x);
return(NULL);}
LISP lerr(LISP message, LISP x)
{err(get_c_string(message),x);
return(NIL);}
void gc_fatal_error(void)
{err("ran out of storage",NIL);}
LISP newcell(long type)
{LISP z;
NEWCELL(z,type);
return(z);}
LISP flocons(double x)
{LISP z;
long n=0;
if ((inums_dim > 0) &&
((x - (n = (long)x)) == 0) &&
(x >= 0) &&
(n < inums_dim))
return(inums[n]);
NEWCELL(z,tc_flonum);
FLONMPNAME(z) = NULL;
FLONM(z) = x;
return(z);}
LISP symcons(char *pname,LISP vcell)
{LISP z;
NEWCELL(z,tc_symbol);
PNAME(z) = pname;
VCELL(z) = vcell;
return(z);}
char *must_malloc(unsigned long size)
{char *tmp;
tmp = walloc(char,size);
if (tmp == (char *)NULL) err("failed to allocate storage from system",NIL);
return(tmp);}
LISP gen_intern(char *name,int require_copy)
{LISP l,sym,sl;
const unsigned char *cname;
long hash=0,n,c,flag;
flag = no_interrupt(1);
if (name == NULL)
return NIL;
else if (obarray_dim > 1)
{hash = 0;
n = obarray_dim;
cname = (unsigned char *)name;
while((c = *cname++)) hash = ((hash * 17) ^ c) % n;
sl = obarray[hash];}
else
sl = oblistvar;
for(l=sl;NNULLP(l);l=CDR(l))
if (strcmp(name,PNAME(CAR(l))) == 0)
{no_interrupt(flag);
return(CAR(l));}
/* Need a new symbol */
if (require_copy)
sym = symcons(wstrdup(name),unbound_marker);
else
sym = symcons(name,unbound_marker);
if (obarray_dim > 1) obarray[hash] = cons(sym,sl);
oblistvar = cons(sym,oblistvar);
no_interrupt(flag);
return(sym);}
LISP cintern(const char *name)
{
char *dname = (char *)(void *)name;
return(gen_intern(dname,FALSE));
}
LISP rintern(const char *name)
{
if (name == 0)
return NIL;
char *dname = (char *)(void *)name;
return gen_intern(dname,TRUE);
}
LISP intern(LISP name)
{return(rintern(get_c_string(name)));}
LISP subrcons(long type, const char *name, SUBR_FUNC f)
{LISP z;
NEWCELL(z,type);
(*z).storage_as.subr.name = name;
(*z).storage_as.subr0.f = f;
return(z);}
LISP closure(LISP env,LISP code)
{LISP z;
NEWCELL(z,tc_closure);
(*z).storage_as.closure.env = env;
(*z).storage_as.closure.code = code;
return(z);}
void gc_unprotect(LISP *location)
{
/* allow LISP values in a location top be gc'ed again */
struct gc_protected *reg,*l;
for(l=0,reg = protected_registers; reg; reg = reg->next)
{
if (reg->location == location)
break;
l = reg;
}
if (reg == 0)
{
fprintf(stderr,"Cannot unprotected %lx: never protected\n",
(unsigned long)*location);
fflush(stderr);
}
else if (l==0) /* its the first one in the list that needs to be deleted */
{
reg = protected_registers;
protected_registers = reg->next;
wfree(reg);
}
else
{
reg = l->next;
l->next = reg->next;
wfree(reg);
}
return;
}
void gc_protect(LISP *location)
{
struct gc_protected *reg;
for(reg = protected_registers; reg; reg = reg->next)
{
if (reg->location == location)
return; // already protected
}
// not protected so add it
gc_protect_n(location,1);
}
void gc_protect_n(LISP *location,long n)
{struct gc_protected *reg;
reg = (struct gc_protected *) must_malloc(sizeof(struct gc_protected));
(*reg).location = location;
(*reg).length = n;
(*reg).next = protected_registers;
protected_registers = reg;}
void gc_protect_sym(LISP *location,const char *st)
{*location = cintern(st);
gc_protect(location);}
void scan_registers(void)
{struct gc_protected *reg;
LISP *location;
long j,n;
for(reg = protected_registers; reg; reg = (*reg).next)
{location = (*reg).location;
n = (*reg).length;
for(j=0;j<n;++j)
location[j] = gc_relocate(location[j]);}}
static void init_storage_1(int init_heap_size)
{LISP ptr,next,end;
long j;
tkbuffer = (char *) must_malloc(TKBUFFERN+1);
heap_1 = (LISP) must_malloc(sizeof(struct obj)*init_heap_size);
heap = heap_1;
which_heap = 1;
heap_org = heap;
heap_end = heap + init_heap_size;
if (gc_kind_copying == 1)
heap_2 = (LISP) must_malloc(sizeof(struct obj)*init_heap_size);
else
{ptr = heap_org;
end = heap_end;
while(1)
{(*ptr).type = tc_free_cell;
next = ptr + 1;
if (next < end)
{CDR(ptr) = next;
ptr = next;}
else
{CDR(ptr) = NIL;
break;}}
freelist = heap_org;}
gc_protect(&oblistvar);
gc_protect(&siod_backtrace);
gc_protect(¤t_env);
if (obarray_dim > 1)
{obarray = (LISP *) must_malloc(sizeof(LISP) * obarray_dim);
for(j=0;j<obarray_dim;++j)
obarray[j] = NIL;
gc_protect_n(obarray,obarray_dim);}
unbound_marker = cons(cintern("**unbound-marker**"),NIL);
gc_protect(&unbound_marker);
eof_val = cons(cintern("eof"),NIL);
gc_protect(&eof_val);
gc_protect(&siod_docstrings);
gc_protect_sym(&truth,"t");
setvar(truth,truth,NIL);
setvar(cintern("nil"),NIL,NIL);
setvar(cintern("let"),cintern("let-internal-macro"),NIL);
gc_protect_sym(&sym_errobj,"errobj");
setvar(sym_errobj,NIL,NIL);
gc_protect_sym(&sym_quote,"quote");
gc_protect_sym(&sym_dot,".");
gc_protect(&open_files);
if (inums_dim > 0)
{inums = (LISP *) must_malloc(sizeof(LISP) * inums_dim);
for(j=0;j<inums_dim;++j)
{NEWCELL(ptr,tc_flonum);
FLONM(ptr) = j;
FLONMPNAME(ptr) = NULL;
inums[j] = ptr;}
gc_protect_n(inums,inums_dim);}}
void init_storage(int init_heap_size)
{
init_storage_1(init_heap_size);
LISP stack_start;
stack_start_ptr = &stack_start;
stack_limit_ptr = STACK_LIMIT(stack_start_ptr,stack_size);
}
void init_subr(const char *name, long type, SUBR_FUNC fcn)
{setvar(cintern(name),subrcons(type,name,fcn),NIL);}
void init_subr(const char *name, long type, SUBR_FUNC fcn,const char *doc)
{LISP lname = cintern(name);
setvar(lname,subrcons(type,name,fcn),NIL);
setdoc(lname,cstrcons(doc));}
/* New versions requiring documentation strings */
void init_subr_0(const char *name, LISP (*fcn)(void),const char *doc)
{init_subr(name,tc_subr_0,(SUBR_FUNC)fcn,doc);}
void init_subr_1(const char *name, LISP (*fcn)(LISP),const char *doc)
{init_subr(name,tc_subr_1,(SUBR_FUNC)fcn,doc);}
void init_subr_2(const char *name, LISP (*fcn)(LISP,LISP),const char *doc)
{init_subr(name,tc_subr_2,(SUBR_FUNC)fcn,doc);}
void init_subr_3(const char *name, LISP (*fcn)(LISP,LISP,LISP),const char *doc)
{init_subr(name,tc_subr_3,(SUBR_FUNC)fcn,doc);}
void init_subr_4(const char *name, LISP (*fcn)(LISP,LISP,LISP,LISP),const char *doc)
{init_subr(name,tc_subr_4,(SUBR_FUNC)fcn,doc);}
void init_lsubr(const char *name, LISP (*fcn)(LISP),const char *doc)
{init_subr(name,tc_lsubr,(SUBR_FUNC)fcn,doc);}
void init_fsubr(const char *name, LISP (*fcn)(LISP,LISP),const char *doc)
{init_subr(name,tc_fsubr,(SUBR_FUNC)fcn,doc);}
void init_msubr(const char *name, LISP (*fcn)(LISP *,LISP *),const char *doc)
{init_subr(name,tc_msubr,(SUBR_FUNC)fcn,doc);}
struct user_type_hooks *get_user_type_hooks(long type)
{long n;
if (user_types == NULL)
{n = sizeof(struct user_type_hooks) * tc_table_dim;
user_types = (struct user_type_hooks *) must_malloc(n);
memset(user_types,0,n);}
if ((type >= 0) && (type < tc_table_dim))
return(&user_types[type]);
else
err("type number out of range",NIL);
return(NULL);}
int siod_register_user_type(const char *name)
{
// Register a new object type for LISP
static int siod_user_type = tc_first_user_type;
int new_type = siod_user_type;
struct user_type_hooks *th;
if (new_type == tc_table_dim)
{
cerr << "SIOD: no more new types allowed, tc_table_dim needs increased"
<< endl;
return tc_table_dim-1;
}
else
siod_user_type++;
th=get_user_type_hooks(new_type);
th->name = wstrdup(name);
return new_type;
}
void set_gc_hooks(long type,
int gc_free_once,
LISP (*rel)(LISP),
LISP (*mark)(LISP),
void (*scan)(LISP),
void (*free)(LISP),
void (*clear)(LISP),
long *kind)
{struct user_type_hooks *p;
p = get_user_type_hooks(type);
p->gc_free_once = gc_free_once;
p->gc_relocate = rel;
p->gc_scan = scan;
p->gc_mark = mark;
p->gc_free = free;
p->gc_clear = clear;
*kind = gc_kind_copying;}
LISP gc_relocate(LISP x)
{LISP nw;
struct user_type_hooks *p;
if EQ(x,NIL) return(NIL);
if ((*x).gc_mark == 1) return(CAR(x));
switch TYPE(x)
{case tc_flonum:
if (FLONMPNAME(x) != NULL)
wfree(FLONMPNAME(x)); /* free the print name */
FLONMPNAME(x) = NULL;
case tc_cons:
case tc_symbol:
case tc_closure:
case tc_subr_0:
case tc_subr_1:
case tc_subr_2:
case tc_subr_3:
case tc_subr_4:
case tc_lsubr:
case tc_fsubr:
case tc_msubr:
if ((nw = heap) >= heap_end) gc_fatal_error();
heap = nw+1;
memcpy(nw,x,sizeof(struct obj));
break;
default:
p = get_user_type_hooks(TYPE(x));
if (p->gc_relocate)
nw = (*p->gc_relocate)(x);
else
{if ((nw = heap) >= heap_end) gc_fatal_error();
heap = nw+1;
memcpy(nw,x,sizeof(struct obj));}}
(*x).gc_mark = 1;
CAR(x) = nw;
return(nw);}
LISP get_newspace(void)
{LISP newspace;
if (which_heap == 1)
{newspace = heap_2;
which_heap = 2;}
else
{newspace = heap_1;
which_heap = 1;}
heap = newspace;
heap_org = heap;
heap_end = heap + heap_size;
return(newspace);}
void scan_newspace(LISP newspace)
{LISP ptr;
struct user_type_hooks *p;
for(ptr=newspace; ptr < heap; ++ptr)
{switch TYPE(ptr)
{case tc_cons:
case tc_closure:
CAR(ptr) = gc_relocate(CAR(ptr));
CDR(ptr) = gc_relocate(CDR(ptr));
break;
case tc_symbol:
VCELL(ptr) = gc_relocate(VCELL(ptr));
break;
case tc_flonum:
case tc_subr_0:
case tc_subr_1:
case tc_subr_2:
case tc_subr_3:
case tc_subr_4:
case tc_lsubr:
case tc_fsubr:
case tc_msubr:
break;
default:
p = get_user_type_hooks(TYPE(ptr));
if (p->gc_scan) (*p->gc_scan)(ptr);}}}
void free_oldspace(LISP space,LISP end)
{LISP ptr;
struct user_type_hooks *p;
for(ptr=space; ptr < end; ++ptr)
if (ptr->gc_mark == 0)
switch TYPE(ptr)
{case tc_cons:
case tc_closure:
case tc_symbol:
break;
case tc_flonum:
if (FLONMPNAME(ptr) != NULL)
wfree(FLONMPNAME(ptr)); /* free the print name */
FLONMPNAME(ptr) = NULL;
break;
case tc_string:
wfree(ptr->storage_as.string.data);
break;
case tc_subr_0:
case tc_subr_1:
case tc_subr_2:
case tc_subr_3:
case tc_subr_4:
case tc_lsubr:
case tc_fsubr:
case tc_msubr:
break;
default:
p = get_user_type_hooks(TYPE(ptr));
if (p->gc_free)
(*p->gc_free)(ptr);
}
}
void gc_stop_and_copy(void)
{LISP newspace,oldspace,end;
long flag;
int ej_ok;
flag = no_interrupt(1);
fprintf(stderr,"GC ing \n");
ej_ok = errjmp_ok;
errjmp_ok = 0;
oldspace = heap_org;
end = heap;
old_heap_used = end - oldspace;
newspace = get_newspace();
scan_registers();
scan_newspace(newspace);
free_oldspace(oldspace,end);
errjmp_ok = ej_ok;
no_interrupt(flag);}
void gc_for_newcell(void)
{long flag;
int ej_ok;
/* if (errjmp_ok == 0) gc_fatal_error(); */
flag = no_interrupt(1);
ej_ok = errjmp_ok;
errjmp_ok = 0;
gc_mark_and_sweep();
errjmp_ok = ej_ok;
no_interrupt(flag);
if NULLP(freelist) gc_fatal_error();}
static void gc_mark_and_sweep(void)
{LISP stack_end;
gc_ms_stats_start();
setjmp(save_regs_gc_mark);
mark_locations((LISP *) save_regs_gc_mark,
(LISP *) (((char *) save_regs_gc_mark) + sizeof(save_regs_gc_mark)));
mark_protected_registers();
mark_locations((LISP *) stack_start_ptr,
(LISP *) &stack_end);
#ifdef THINK_C
mark_locations((LISP *) ((char *) stack_start_ptr + 2),
(LISP *) ((char *) &stack_end + 2));
#endif
gc_sweep();
gc_ms_stats_end();}
static void gc_ms_stats_start(void)
{gc_rt = myruntime();
gc_cells_collected = 0;
if (gc_status_flag)
fprintf(stderr,"[starting GC]\n");}
static void gc_ms_stats_end(void)
{gc_rt = myruntime() - gc_rt;
gc_time_taken = gc_time_taken + gc_rt;
if (gc_status_flag)
fprintf(stderr,"[GC took %g cpu seconds, %ld cells collected]\n",
gc_rt,
gc_cells_collected);}
void gc_mark(LISP ptr)
{struct user_type_hooks *p;
gc_mark_loop:
if NULLP(ptr) return;
if ((*ptr).gc_mark) return;
(*ptr).gc_mark = 1;
switch ((*ptr).type)
{case tc_flonum:
break;
case tc_cons:
gc_mark(CAR(ptr));
ptr = CDR(ptr);
goto gc_mark_loop;
case tc_symbol:
ptr = VCELL(ptr);
goto gc_mark_loop;
case tc_closure:
gc_mark((*ptr).storage_as.closure.code);
ptr = (*ptr).storage_as.closure.env;
goto gc_mark_loop;
case tc_subr_0:
case tc_subr_1:
case tc_subr_2:
case tc_subr_3:
case tc_subr_4:
break;
case tc_string:
break;
case tc_lsubr:
case tc_fsubr:
case tc_msubr:
break;
default:
p = get_user_type_hooks(TYPE(ptr));
if (p->gc_mark)
ptr = (*p->gc_mark)(ptr);}}
static void mark_protected_registers(void)
{struct gc_protected *reg;
LISP *location;
long j,n;
for(reg = protected_registers; reg; reg = (*reg).next)
{
location = (*reg).location;
n = (*reg).length;
for(j=0;j<n;++j)
gc_mark(location[j]);}}
static void mark_locations(LISP *start,LISP *end)
{LISP *tmp;
long n;
if (start > end)
{tmp = start;
start = end;
end = tmp;}
n = end - start;
mark_locations_array(start,n);}
static void mark_locations_array(LISP *x,long n)
{int j;
LISP p;
for(j=0;j<n;++j)
{p = x[j];
if ((p >= heap_org) &&
(p < heap_end) &&
(((((char *)p) - ((char *)heap_org)) % sizeof(struct obj)) == 0) &&
NTYPEP(p,tc_free_cell))
gc_mark(p);}}
static void gc_sweep(void)
{LISP ptr,end,nfreelist;
long n;
struct user_type_hooks *p;
end = heap_end;
n = 0;
nfreelist = NIL;
start_rememberring_dead();
for(ptr=heap_org; ptr < end; ++ptr)
if (((*ptr).gc_mark) == 0)
{switch((*ptr).type)
{case tc_flonum:
if (FLONMPNAME(ptr) != NULL)
wfree(FLONMPNAME(ptr)); /* free the print name */
FLONMPNAME(ptr) = NULL;
break;
case tc_string:
wfree(ptr->storage_as.string.data);
break;
case tc_free_cell:
case tc_cons:
case tc_closure:
case tc_symbol:
case tc_subr_0:
case tc_subr_1:
case tc_subr_2:
case tc_subr_3:
case tc_subr_4:
case tc_lsubr:
case tc_fsubr:
case tc_msubr:
break;
default:
p = get_user_type_hooks(TYPE(ptr));
if (p->gc_free)
{
if (p->gc_free_once)
{
if (!is_dead(USERVAL(ptr)))
{
(*p->gc_free)(ptr);
mark_as_dead(USERVAL(ptr));
}
}
else
(*p->gc_free)(ptr);
}
}
++n;
(*ptr).type = tc_free_cell;
CDR(ptr) = nfreelist;
nfreelist = ptr;
}
else
{
(*ptr).gc_mark = 0;
p = get_user_type_hooks(TYPE(ptr));
if (p->gc_clear)
(*p->gc_clear)(ptr);
}
gc_cells_collected = n;
freelist = nfreelist;
}
LISP user_gc(LISP args)
{long old_status_flag,flag;
int ej_ok;
if (gc_kind_copying == 1)
err("implementation cannot GC at will with stop-and-copy\n",
NIL);
flag = no_interrupt(1);
ej_ok = errjmp_ok;
errjmp_ok = 0;
old_status_flag = gc_status_flag;
if NNULLP(args)
{
if NULLP(car(args))
gc_status_flag = 0;
else
gc_status_flag = 1;
}
gc_mark_and_sweep();
gc_status_flag = old_status_flag;
errjmp_ok = ej_ok;
no_interrupt(flag);
return(NIL);}
LISP set_backtrace(LISP n)
{
if (n)
show_backtrace = 1;
else
show_backtrace = 0;
return n;
}
LISP gc_status(LISP args)
{LISP l;
int n;
if NNULLP(args)
{
if NULLP(car(args)) gc_status_flag = 0; else gc_status_flag = 1;
}
if (gc_kind_copying == 1)
{if (gc_status_flag)
fput_st(fwarn,"garbage collection is on\n");
else
fput_st(fwarn,"garbage collection is off\n");
sprintf(tkbuffer,"%ld allocated %ld free\n",
(long)(heap - heap_org),(long)(heap_end - heap));
fput_st(fwarn,tkbuffer);}
else
{if (gc_status_flag)
fput_st(fwarn,"garbage collection verbose\n");
else
fput_st(fwarn,"garbage collection silent\n");
{for(n=0,l=freelist;NNULLP(l); ++n) l = CDR(l);
sprintf(tkbuffer,"%ld allocated %ld free\n",
(long)((heap_end - heap_org) - n),(long)n);
fput_st(fwarn,tkbuffer);}}
return(NIL);}
LISP leval_args(LISP l,LISP env)
{LISP result,v1,v2,tmp;
if NULLP(l) return(NIL);
if NCONSP(l) err("bad syntax argument list",l);
result = cons(leval(CAR(l),env),NIL);
for(v1=result,v2=CDR(l);
CONSP(v2);
v1 = tmp, v2 = CDR(v2))
{tmp = cons(leval(CAR(v2),env),NIL);
CDR(v1) = tmp;}
if NNULLP(v2) err("bad syntax argument list",l);
return(result);}
LISP extend_env(LISP actuals,LISP formals,LISP env)
{
if SYMBOLP(formals)
return(cons(cons(cons(formals,NIL),cons(actuals,NIL)),env));
else
return(cons(cons(formals,actuals),env));
}
#define ENVLOOKUP_TRICK 1
LISP global_var = NIL;
LISP global_env = NIL;
LISP envlookup(LISP var,LISP env)
{LISP frame,al,fl,tmp;
global_var = var;
global_env = env;
for(frame=env;CONSP(frame);frame=CDR(frame))
{tmp = CAR(frame);
if NCONSP(tmp) err("damaged frame",tmp);
for(fl=CAR(tmp),al=CDR(tmp);CONSP(fl);fl=CDR(fl),al=CDR(al))
{if NCONSP(al) err("too few arguments",tmp);
if EQ(CAR(fl),var) return(al);}
/* suggested by a user. It works for reference (although conses)
but doesn't allow for set! to work properly... */
#if (ENVLOOKUP_TRICK)
if (SYMBOLP(fl) && EQ(fl, var)) return(cons(al, NIL));
#endif
}
if NNULLP(frame)
err("damaged env",env);
return(NIL);}
void set_eval_hooks(long type,LISP (*fcn)(LISP, LISP *,LISP *))
{struct user_type_hooks *p;
p = get_user_type_hooks(type);
p->leval = fcn;}
LISP leval(LISP x,LISP qenv)
{LISP tmp,arg1,rval;
LISP env;
struct user_type_hooks *p;
env = qenv;
STACK_CHECK(&x);
siod_backtrace = cons(x,siod_backtrace);
loop:
INTERRUPT_CHECK();
current_env = env;
switch TYPE(x)
{case tc_symbol:
tmp = envlookup(x,env);
if NNULLP(tmp)
{
siod_backtrace = cdr(siod_backtrace);
return(CAR(tmp));
}
tmp = VCELL(x);
if EQ(tmp,unbound_marker) err("unbound variable",x);
siod_backtrace = cdr(siod_backtrace);
return tmp;
case tc_cons:
tmp = CAR(x);
switch TYPE(tmp)
{case tc_symbol:
tmp = envlookup(tmp,env);
if NNULLP(tmp)
{tmp = CAR(tmp);
break;}
tmp = VCELL(CAR(x));
if EQ(tmp,unbound_marker) err("unbound variable",CAR(x));
break;
case tc_cons:
tmp = leval(tmp,env);
break;}
switch TYPE(tmp)
{case tc_subr_0:
rval = SUBR0(tmp)();
siod_backtrace = cdr(siod_backtrace);
return rval;
case tc_subr_1:
rval = SUBR1(tmp)(leval(car(CDR(x)),env));
siod_backtrace = cdr(siod_backtrace);
return rval;
case tc_subr_2:
x = CDR(x);
arg1 = leval(car(x),env);
x = NULLP(x) ? NIL : CDR(x);
rval = SUBR2(tmp)(arg1,leval(car(x),env));
siod_backtrace = cdr(siod_backtrace);
return rval;
case tc_subr_3:
x = CDR(x);
arg1 = leval(car(x),env);
x = NULLP(x) ? NIL : CDR(x);
rval = SUBR3(tmp)(arg1,leval(car(x),env),leval(car(cdr(x)),env));
siod_backtrace = cdr(siod_backtrace);
return rval;
case tc_subr_4:
x = CDR(x);
arg1 = leval(car(x),env);
x = NULLP(x) ? NIL : CDR(x);
rval = SUBR4(tmp)(arg1,leval(car(x),env),
leval(car(cdr(x)),env),
leval(car(cdr(cdr(x))),env));
siod_backtrace = cdr(siod_backtrace);
return rval;
case tc_lsubr:
rval = SUBR1(tmp)(leval_args(CDR(x),env));
siod_backtrace = cdr(siod_backtrace);
return rval;
case tc_fsubr:
rval = SUBR2(tmp)(CDR(x),env);
siod_backtrace = cdr(siod_backtrace);
return rval;
case tc_msubr:
if NULLP(SUBRM(tmp)(&x,&env))
{
siod_backtrace = cdr(siod_backtrace);
return(x);
}
goto loop;
case tc_closure:
env = extend_env(leval_args(CDR(x),env),
car((*tmp).storage_as.closure.code),
(*tmp).storage_as.closure.env);
x = cdr((*tmp).storage_as.closure.code);
goto loop;
case tc_symbol:
x = cons(tmp,cons(cons(sym_quote,cons(x,NIL)),NIL));
x = leval(x,NIL);
goto loop;
default:
p = get_user_type_hooks(TYPE(tmp));
if (p->leval)
{if NULLP((*p->leval)(tmp,&x,&env))
{
siod_backtrace = cdr(siod_backtrace);
return(x);
}
else
goto loop;}
err("bad function",tmp);}
default:
siod_backtrace = cdr(siod_backtrace);
return(x);}}
void set_print_hooks(long type,
void (*prin1)(LISP, FILE *),
void (*print_string)(LISP, char *)
)
{struct user_type_hooks *p;
p = get_user_type_hooks(type);
p->prin1 = prin1;
p->print_string = print_string;
}
void set_io_hooks(long type,
LISP (*fast_print)(LISP,LISP),
LISP (*fast_read)(int,LISP))
{struct user_type_hooks *p;
p = get_user_type_hooks(type);
p->fast_print = fast_print;
p->fast_read = fast_read;
}
void set_type_hooks(long type,
long (*c_sxhash)(LISP,long),
LISP (*equal)(LISP,LISP))
{struct user_type_hooks *p;
p = get_user_type_hooks(type);
p->c_sxhash = c_sxhash;
p->equal = equal;
}
int f_getc(FILE *f)
{long iflag;
int c;
iflag = no_interrupt(1);
c = getc(f);
if ((c == '\n') && (f == stdin) && (siod_interactive))
{
fprintf(stdout,"%s",repl_prompt);
fflush(stdout);
}
no_interrupt(iflag);
return(c);}
void f_ungetc(int c, FILE *f)
{ungetc(c,f);}
#ifdef WIN32
int winsock_unget_buffer;
bool winsock_unget_buffer_unused=true;
bool use_winsock_unget_buffer;
int f_getc_winsock(HANDLE h)
{long iflag,dflag;
char c;
DWORD lpNumberOfBytesRead;
iflag = no_interrupt(1);
if (use_winsock_unget_buffer)
{
use_winsock_unget_buffer = false;
return winsock_unget_buffer;
}
if (SOCKET_ERROR == recv((SOCKET)h,&c,1,0))
{
if (WSAECONNRESET == GetLastError()) // The connection was closed.
c=EOF;
else
cerr << "f_getc_winsock(): error reading from socket\n";
}
winsock_unget_buffer=c;
winsock_unget_buffer_unused = false;
no_interrupt(iflag);
return(c);}
void f_ungetc_winsock(int c, HANDLE h)
{
if (winsock_unget_buffer_unused)
{
cerr << "f_ungetc_winsock: tried to unget before reading socket\n";
}
use_winsock_unget_buffer = true;}
#endif
int flush_ws(struct gen_readio *f,const char *eoferr)
{int c,commentp;
commentp = 0;
while(1)
{c = GETC_FCN(f);
if (c == EOF) { if (eoferr) err(eoferr,NIL); else return(c); }
if (commentp) {if (c == '\n') commentp = 0;}
else if (c == ';') commentp = 1;
else if (!isspace(c)) return(c);}}
LISP lreadf(FILE *f)
{struct gen_readio s;
if ((f == stdin) && (isatty(0)) && (siod_interactive))
{ /* readline (if selected) stuff -- only works with a terminal */
s.getc_fcn = (int (*)(char *))siod_fancy_getc;
s.ungetc_fcn = (void (*)(int, char *))siod_fancy_ungetc;
s.cb_argument = (char *) f;
}
else /* normal stuff */
{
s.getc_fcn = (int (*)(char *))f_getc;
s.ungetc_fcn = (void (*)(int, char *))f_ungetc;
s.cb_argument = (char *) f;
}
return(readtl(&s));}
#ifdef WIN32
LISP lreadwinsock(void)
{
struct gen_readio s;
s.getc_fcn = (int (*)(char *))f_getc_winsock;
s.ungetc_fcn = (void (*)(int, char *))f_ungetc_winsock;
s.cb_argument = (char *) siod_server_socket;
return(readtl(&s));}
#endif
LISP readtl(struct gen_readio *f)
{int c;
c = flush_ws(f,(char *)NULL);
if (c == EOF) return(eof_val);
UNGETC_FCN(c,f);
return(lreadr(f));}
void set_read_hooks(char *all_set,char *end_set,
LISP (*fcn1)(int, struct gen_readio *),
LISP (*fcn2)(char *,long, int *))
{user_ch_readm = all_set;
user_te_readm = end_set;
user_readm = fcn1;
user_readt = fcn2;}
static LISP lreadr(struct gen_readio *f)
{int c,j;
char *p;
const char *pp, *last_prompt;
LISP rval;
STACK_CHECK(&f);
p = tkbuffer;
c = flush_ws(f,"end of file inside read");
switch (c)
{case '(':
last_prompt = repl_prompt;
repl_prompt = siod_secondary_prompt;
rval = lreadparen(f);
repl_prompt = last_prompt;
return rval;
case ')':
err("unexpected close paren",NIL);
case '\'':
return(cons(sym_quote,cons(lreadr(f),NIL)));
case '`':
return(cons(cintern("+internal-backquote"),lreadr(f)));
case ',':
c = GETC_FCN(f);
switch(c)
{case '@':
pp = "+internal-comma-atsign";
break;
case '.':
pp = "+internal-comma-dot";
break;
default:
pp = "+internal-comma";
UNGETC_FCN(c,f);}
return(cons(cintern(pp),lreadr(f)));
case '"':
last_prompt = repl_prompt;
repl_prompt = siod_secondary_prompt;
rval = lreadstring(f);
repl_prompt = last_prompt;
return rval;
default:
if ((user_readm != NULL) && strchr(user_ch_readm,c))
return((*user_readm)(c,f));}
*p++ = c;
for(j = 1; j<TKBUFFERN; ++j)
{c = GETC_FCN(f);
if (c == EOF) return(lreadtk(j));
if (isspace(c)) return(lreadtk(j));
if (strchr("()'`,;\"",c) || strchr(user_te_readm,c))
{UNGETC_FCN(c,f);return(lreadtk(j));}
*p++ = c;}
return(err("symbol larger than maxsize (can you use a string instead?)",NIL));}
#if 0
LISP lreadparen(struct gen_readio *f)
{int c;
LISP tmp;
c = flush_ws(f,"end of file inside list");
if (c == ')') return(NIL);
UNGETC_FCN(c,f);
tmp = lreadr(f);
if EQ(tmp,sym_dot)
{tmp = lreadr(f);
c = flush_ws(f,"end of file inside list");
if (c != ')') err("missing close paren",NIL);
return(tmp);}
return(cons(tmp,lreadparen(f)));}
#endif
/* Iterative version of the above */
static LISP lreadparen(struct gen_readio *f)
{
int c;
LISP tmp,l=NIL;
LISP last=l;
while ((c = flush_ws(f,"end of file inside list")) != ')')
{
UNGETC_FCN(c,f);
tmp = lreadr(f);
if EQ(tmp,sym_dot)
{
tmp = lreadr(f);
c = flush_ws(f,"end of file inside list");
if (c != ')') err("missing close paren",NIL);
if (l == NIL) err("no car for dotted pair",NIL);
CDR(last) = tmp;
break;
}
if (l == NIL)
{
l = cons(tmp,NIL);
last = l;
}
else
{
CDR(last) = cons(tmp,NIL);
last = cdr(last);
}
}
return l;
}
static LISP lreadstring(struct gen_readio *f)
{
int j,c,n;
static int len=TKBUFFERN;
static char *str = 0;
char *q;
LISP qq;
j = 0;
if (str == 0)
str = (char *)must_malloc(len * sizeof(char));
while(((c = GETC_FCN(f)) != '"') && (c != EOF))
{
if (c == '\\')
{c = GETC_FCN(f);
if (c == EOF) err("eof after \\",NIL);
switch(c)
{case 'n':
c = '\n';
break;
case 't':
c = '\t';
break;
case 'r':
c = '\r';
break;
case 'd':
c = 0x04;
break;
case 'N':
c = 0;
break;
case 's':
c = ' ';
break;
case '0':
n = 0;
while(1)
{c = GETC_FCN(f);
if (c == EOF) err("eof after \\0",NIL);
if (isdigit(c))
n = n * 8 + c - '0';
else
{UNGETC_FCN(c,f);
break;}}
c = n;}}
if ((j + 1) >= len)
{
/* EST_String full so double the buffer, copy and continue */
q = (char *)must_malloc(len*2*sizeof(char));
strncpy(q,str,len);
wfree(str);
str = q;
len = len*2;
}
str[j] = c;
++j;
}
str[j] = 0;
qq = strcons(j,str);
return qq;
}
LISP lreadtk(long j)
{int flag;
unsigned char *p;
LISP tmp;
int adigit;
p = (unsigned char *)tkbuffer;
p[j] = 0;
if (user_readt != NULL)
{tmp = (*user_readt)((char *)p,j,&flag);
if (flag) return(tmp);}
if (strcmp("nil",tkbuffer) == 0)
return NIL;
if (*p == '-') p+=1;
adigit = 0;
while((*p < 128) && (isdigit(*p))) {p+=1; adigit=1;}
if (*p=='.')
{p += 1;
while((*p < 128) && (isdigit(*p))) {p+=1; adigit=1;}}
if (!adigit) goto a_symbol;
if (*p=='e')
{p+=1;
if (*p=='-'||*p=='+') p+=1;
if ((!isdigit(*p) || (*p > 127))) goto a_symbol; else p+=1;
while((*p < 128) && (isdigit(*p))) p+=1;}
if (*p) goto a_symbol;
return(flocons(atof(tkbuffer)));
a_symbol:
return(rintern(tkbuffer));}
LISP siod_quit(void)
{open_files = NIL; // will be closed on exit with no warnings
if (errjmp_ok) longjmp(*est_errjmp,2);
else exit(0);
return(NIL);}
LISP l_exit(LISP arg)
{
if (arg == NIL)
exit(0);
else
exit((int)FLONM(arg));
// never happens
return NULL;
}
LISP lfwarning(LISP mode)
{
/* if mode is non-nil switch warnings on */
if (mode == NIL)
fwarn = NULL;
else
fwarn = stdout;
return NIL;
}
LISP closure_code(LISP exp)
{return(exp->storage_as.closure.code);}
LISP closure_env(LISP exp)
{return(exp->storage_as.closure.env);}
int get_c_int(LISP x)
{if NFLONUMP(x) err("not a number",x);
return((int)FLONM(x));}
double get_c_double(LISP x)
{if NFLONUMP(x) err("not a number",x);
return(FLONM(x));}
float get_c_float(LISP x)
{if NFLONUMP(x) err("not a number",x);
return((float)FLONM(x));}
void init_subrs_base(void)
{
init_subr_2("eval",leval,
"(eval DATA)\n\
Evaluate DATA and return result.");
init_lsubr("gc-status",gc_status,
"(gc-status OPTION)\n\
Control summary information during garbage collection. If OPTION is t,\n\
output information at each garbage collection, if nil do gc silently.");
init_lsubr("gc",user_gc,
"(gc)\n\
Collect garbage now, where gc method supports it.");
init_subr_2("error",lerr,
"(error MESSAGE DATA)\n\
Prints MESSAGE about DATA and throws an error.");
init_subr_0("quit",siod_quit,
"(quit)\n\
Exit from program, does not return.");
init_subr_1("exit",l_exit,
"(exit [RCODE])\n\
Exit from program, if RCODE is given it is given as an argument to\n\
the system call exit.");
init_subr_2("env-lookup",envlookup,
"(env-lookup VARNAME ENVIRONMENT)\n\
Return value of VARNAME in ENVIRONMENT.");
init_subr_1("fwarning",lfwarning,
"(fwarning MODE)\n\
For controlling various levels of warning messages. If MODE is nil, or\n\
not specified stop all warning messages from being displayed. If MODE\n\
display warning messages.");
init_subr_2("%%stack-limit",stack_limit,
"(%%stack-limit AMOUNT SILENT)\n\
Set stacksize to AMOUNT, if SILENT is non nil do it silently.");
init_subr_1("intern",intern,
"(intern ATOM)\n\
Intern ATOM on the oblist.");
init_subr_2("%%closure",closure,
"(%%closure ENVIRONMENT CODE)\n\
Make a closure from given environment and code.");
init_subr_1("%%closure-code",closure_code,
"(%%closure-code CLOSURE)\n\
Return code part of closure.");
init_subr_1("%%closure-env",closure_env,
"(%%closure-env CLOSURE)\n\
Return environment part of closure.");
init_subr_1("set_backtrace",set_backtrace,
"(set_backtrace arg)\n\
If arg is non-nil a backtrace will be display automatically after errors\n\
if arg is nil, a backtrace will not automatically be displayed (use\n\
(:backtrace) for display explicitly.");
init_subr_1("set_server_safe_functions",set_restricted,
"(set_server_safe_functions LIST)\n\
Sets restricted list to LIST. When restricted list is non-nil only\n\
functions whose names appear in this list may be executed. This\n\
is used so that clients in server mode may be restricted to a small\n\
number of safe commands. [see Server/client API]");
}
void init_subrs(void)
{
init_subrs_base();
init_subrs_core();
init_subrs_doc();
init_subrs_file();
init_subrs_format();
init_subrs_list();
init_subrs_math();
init_subrs_str();
init_subrs_sys();
init_subrs_xtr(); // arrays and hash tables
}
/* err0,pr,prp are convenient to call from the C-language debugger */
void err0(void)
{err("0",NIL);}
void pr(LISP p)
{if ((p >= heap_org) &&
(p < heap_end) &&
(((((char *)p) - ((char *)heap_org)) % sizeof(struct obj)) == 0))
pprint(p);
else
put_st("invalid\n");}
void prp(LISP *p)
{if (!p) return;
pr(*p);}
LISP siod_make_typed_cell(long type, void *s)
{
LISP ptr;
NEWCELL(ptr,type);
USERVAL(ptr) = s;
return ptr;
}
static LISP set_restricted(LISP l)
{
// Set restricted list
if (restricted == NIL)
gc_protect(&restricted);
restricted = l;
return NIL;
}
static int restricted_function_call(LISP l)
{
// Checks l recursively to ensure all function calls
// are in the restricted list
LISP p;
if (l == NIL)
return TRUE;
else if (!consp(l))
return TRUE;
else if (TYPE(car(l)) == tc_symbol)
{
if (streq("quote",get_c_string(car(l))))
return TRUE;
else if (siod_member_str(get_c_string(car(l)),restricted) == NIL)
return FALSE;
}
else if (restricted_function_call(car(l)) == FALSE)
return FALSE;
// As its some type of list with a valid car, check the cdr
for (p=cdr(l); consp(p); p=cdr(p))
if (restricted_function_call(car(p)) == FALSE)
return FALSE;
return TRUE;
}
|