[ViewVC] Diff of: cvs/cvsroot/microscheme/scheme.c

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.32 by root, Sat Nov 28 10:56:45 2015 UTC vs.
Revision 1.48 by root, Mon Nov 30 13:07:34 2015 UTC

…		…
16	* (MINISCM) This is a revised and modified version by Akira KIDA.	16	* (MINISCM) This is a revised and modified version by Akira KIDA.
17	* (MINISCM) current version is 0.85k4 (15 May 1994)	17	* (MINISCM) current version is 0.85k4 (15 May 1994)
18	*	18	*
19	*/	19	*/
20		20
		21	#define EXPERIMENT 1
		22
21	#define PAGE_SIZE 4096 /* does not work on sparc/alpha */	23	#define PAGE_SIZE 4096 /* does not work on sparc/alpha */
22	#include "malloc.c"	24	#include "malloc.c"
23		25
24	#define SCHEME_SOURCE	26	#define SCHEME_SOURCE
25	#include "scheme-private.h"	27	#include "scheme-private.h"
…		…
34		36
35	#include <sys/types.h>	37	#include <sys/types.h>
36	#include <sys/stat.h>	38	#include <sys/stat.h>
37	#include <fcntl.h>	39	#include <fcntl.h>
38		40
		41	#if !USE_ERROR_CHECKING
		42	# define NDEBUG
		43	#endif
		44
		45	#include <assert.h>
		46	#include <stdlib.h>
39	#include <string.h>	47	#include <string.h>
40	#include <stdlib.h>
41		48
42	#include <limits.h>	49	#include <limits.h>
43	#include <inttypes.h>	50	#include <inttypes.h>
44	#include <float.h>	51	#include <float.h>
45	//#include <ctype.h>	52	//#include <ctype.h>
		53
		54	#if '1' != '0' + 1 \
		55	\|\| '2' != '0' + 2 \|\| '3' != '0' + 3 \|\| '4' != '0' + 4 \|\| '5' != '0' + 5 \
		56	\|\| '6' != '0' + 6 \|\| '7' != '0' + 7 \|\| '8' != '0' + 8 \|\| '9' != '0' + 9 \
		57	\|\| 'b' != 'a' + 1 \|\| 'c' != 'a' + 2 \|\| 'd' != 'a' + 3 \|\| 'e' != 'a' + 4 \
		58	\|\| 'f' != 'a' + 5
		59	# error "execution character set digits not consecutive"
		60	#endif
46		61
47	enum {	62	enum {
48	TOK_EOF,	63	TOK_EOF,
49	TOK_LPAREN,	64	TOK_LPAREN,
50	TOK_RPAREN,	65	TOK_RPAREN,
51	TOK_DOT,	66	TOK_DOT,
52	TOK_ATOM,	67	TOK_ATOM,
		68	TOK_DOTATOM, /* atom name starting with '.' */
		69	TOK_STRATOM, /* atom name enclosed in \| */
53	TOK_QUOTE,	70	TOK_QUOTE,
54	TOK_DQUOTE,	71	TOK_DQUOTE,
55	TOK_BQUOTE,	72	TOK_BQUOTE,
56	TOK_COMMA,	73	TOK_COMMA,
57	TOK_ATMARK,	74	TOK_ATMARK,
…		…
59	TOK_SHARP_CONST,	76	TOK_SHARP_CONST,
60	TOK_VEC	77	TOK_VEC
61	};	78	};
62		79
63	#define BACKQUOTE '`'	80	#define BACKQUOTE '`'
64	#define DELIMITERS "()\";\f\t\v\n\r "	81	#define WHITESPACE " \t\r\n\v\f"
		82	#define DELIMITERS "()\";" WHITESPACE
65		83
66	#define NIL (&SCHEME_V->xNIL) //TODO: make this 0?	84	#define NIL (&SCHEME_V->xNIL) //TODO: make this 0?
67	#define S_T (&SCHEME_V->xT) //TODO: magic ptr value?	85	#define S_T (&SCHEME_V->xT) //TODO: magic ptr value?
68	#define S_F (&SCHEME_V->xF) //TODO: magic ptr value?	86	#define S_F (&SCHEME_V->xF) //TODO: magic ptr value?
69	#define S_SINK (&SCHEME_V->xsink)	87	#define S_SINK (&SCHEME_V->xsink)
…		…
391	}	409	}
392		410
393	INTERFACE char *	411	INTERFACE char *
394	symname (pointer p)	412	symname (pointer p)
395	{	413	{
396	return strvalue (car (p));	414	return strvalue (p);
397	}	415	}
398		416
399	#if USE_PLIST	417	#if USE_PLIST
		418	#error plists are broken because symbols are no longer pairs
		419	#define symprop(p) cdr(p)
400	SCHEME_EXPORT int	420	SCHEME_EXPORT int
401	hasprop (pointer p)	421	hasprop (pointer p)
402	{	422	{
403	return typeflag (p) & T_SYMBOL;	423	return typeflag (p) & T_SYMBOL;
404	}	424	}
405
406	# define symprop(p) cdr(p)
407	#endif	425	#endif
408		426
409	INTERFACE int	427	INTERFACE int
410	is_syntax (pointer p)	428	is_syntax (pointer p)
411	{	429	{
…		…
425	}	443	}
426		444
427	INTERFACE char *	445	INTERFACE char *
428	syntaxname (pointer p)	446	syntaxname (pointer p)
429	{	447	{
430	return strvalue (car (p));	448	return strvalue (p);
431	}	449	}
432		450
433	#define procnum(p) ivalue_unchecked (p)	451	#define procnum(p) ivalue_unchecked (p)
434	static const char *procname (pointer x);	452	static const char *procname (pointer x);
435		453
…		…
651	#endif	669	#endif
652		670
653	static int file_push (SCHEME_P_ const char *fname);	671	static int file_push (SCHEME_P_ const char *fname);
654	static void file_pop (SCHEME_P);	672	static void file_pop (SCHEME_P);
655	static int file_interactive (SCHEME_P);	673	static int file_interactive (SCHEME_P);
656	ecb_inline int is_one_of (char *s, int c);	674	ecb_inline int is_one_of (const char *s, int c);
657	static int alloc_cellseg (SCHEME_P_ int n);	675	static int alloc_cellseg (SCHEME_P_ int n);
658	ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);	676	ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
659	static void finalize_cell (SCHEME_P_ pointer a);	677	static void finalize_cell (SCHEME_P_ pointer a);
660	static int count_consecutive_cells (pointer x, int needed);	678	static int count_consecutive_cells (pointer x, int needed);
661	static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);	679	static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
…		…
678	static void mark (pointer a);	696	static void mark (pointer a);
679	static void gc (SCHEME_P_ pointer a, pointer b);	697	static void gc (SCHEME_P_ pointer a, pointer b);
680	static int basic_inchar (port *pt);	698	static int basic_inchar (port *pt);
681	static int inchar (SCHEME_P);	699	static int inchar (SCHEME_P);
682	static void backchar (SCHEME_P_ int c);	700	static void backchar (SCHEME_P_ int c);
683	static char readstr_upto (SCHEME_P_ char delim);	701	static char readstr_upto (SCHEME_P_ int skip, const char delim);
684	static pointer readstrexp (SCHEME_P);	702	static pointer readstrexp (SCHEME_P_ char delim);
685	ecb_inline int skipspace (SCHEME_P);	703	ecb_inline int skipspace (SCHEME_P);
686	static int token (SCHEME_P);	704	static int token (SCHEME_P);
687	static void printslashstring (SCHEME_P_ char *s, int len);	705	static void printslashstring (SCHEME_P_ char *s, int len);
688	static void atom2str (SCHEME_P_ pointer l, int f, char *pp, int plen);	706	static void atom2str (SCHEME_P_ pointer l, int f, char *pp, int plen);
689	static void printatom (SCHEME_P_ pointer l, int f);	707	static void printatom (SCHEME_P_ pointer l, int f);
…		…
952	if (SCHEME_V->no_memory && USE_ERROR_CHECKING)	970	if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
953	return S_SINK;	971	return S_SINK;
954		972
955	if (SCHEME_V->free_cell == NIL)	973	if (SCHEME_V->free_cell == NIL)
956	{	974	{
957	const int min_to_be_recovered = SCHEME_V->last_cell_seg < 128 ? 128 * 8 : SCHEME_V->last_cell_seg * 8;	975	const int min_to_be_recovered = SCHEME_V->cell_segsize [SCHEME_V->last_cell_seg] >> 1;
958		976
959	gc (SCHEME_A_ a, b);	977	gc (SCHEME_A_ a, b);
960		978
961	if (SCHEME_V->fcells < min_to_be_recovered \|\| SCHEME_V->free_cell == NIL)	979	if (SCHEME_V->fcells < min_to_be_recovered \|\| SCHEME_V->free_cell == NIL)
962	{	980	{
…		…
1013	}	1031	}
1014		1032
1015	static pointer	1033	static pointer
1016	get_vector_object (SCHEME_P_ uint32_t len, pointer init)	1034	get_vector_object (SCHEME_P_ uint32_t len, pointer init)
1017	{	1035	{
1018	pointer v = get_cell_x (SCHEME_A_ 0, 0);	1036	pointer v = get_cell_x (SCHEME_A_ NIL, NIL);
1019	pointer e = malloc (len sizeof (pointer));	1037	pointer e = malloc (len sizeof (pointer));
1020		1038
1021	if (!e && USE_ERROR_CHECKING)	1039	if (!e && USE_ERROR_CHECKING)
1022	return S_SINK;	1040	return S_SINK;
1023		1041
…		…
1077	set_cdr (x, b);	1095	set_cdr (x, b);
1078		1096
1079	return x;	1097	return x;
1080	}	1098	}
1081		1099
		1100	static pointer
		1101	generate_symbol (SCHEME_P_ const char *name)
		1102	{
		1103	pointer x = mk_string (SCHEME_A_ name);
		1104	setimmutable (x);
		1105	set_typeflag (x, T_SYMBOL \| T_ATOM);
		1106	return x;
		1107	}
		1108
1082	/* ========== oblist implementation ========== */	1109	/* ========== oblist implementation ========== */
1083		1110
1084	#ifndef USE_OBJECT_LIST	1111	#ifndef USE_OBJECT_LIST
1085		1112
		1113	static int
1086	static int hash_fn (const char *key, int table_size);	1114	hash_fn (const char *key, int table_size)
		1115	{
		1116	const unsigned char *p = key;
		1117	uint32_t hash = 2166136261;
		1118
		1119	while (*p)
		1120	hash = (hash ^ p++) 16777619;
		1121
		1122	return hash % table_size;
		1123	}
1087		1124
1088	static pointer	1125	static pointer
1089	oblist_initial_value (SCHEME_P)	1126	oblist_initial_value (SCHEME_P)
1090	{	1127	{
1091	return mk_vector (SCHEME_A_ 461); /* probably should be bigger */	1128	return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
…		…
1093		1130
1094	/* returns the new symbol */	1131	/* returns the new symbol */
1095	static pointer	1132	static pointer
1096	oblist_add_by_name (SCHEME_P_ const char *name)	1133	oblist_add_by_name (SCHEME_P_ const char *name)
1097	{	1134	{
1098	int location;	1135	pointer x = generate_symbol (SCHEME_A_ name);
1099
1100	pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1101	set_typeflag (x, T_SYMBOL);
1102	setimmutable (car (x));
1103
1104	location = hash_fn (name, veclength (SCHEME_V->oblist));	1136	int location = hash_fn (name, veclength (SCHEME_V->oblist));
1105	vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));	1137	vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1106	return x;	1138	return x;
1107	}	1139	}
1108		1140
1109	ecb_inline pointer	1141	ecb_inline pointer
…		…
1169		1201
1170	/* returns the new symbol */	1202	/* returns the new symbol */
1171	static pointer	1203	static pointer
1172	oblist_add_by_name (SCHEME_P_ const char *name)	1204	oblist_add_by_name (SCHEME_P_ const char *name)
1173	{	1205	{
1174	pointer x = mk_string (SCHEME_A_ name);	1206	pointer x = generate_symbol (SCHEME_A_ name);
1175	set_typeflag (x, T_SYMBOL);
1176	setimmutable (x);
1177	SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);	1207	SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1178	return x;	1208	return x;
1179	}	1209	}
1180		1210
1181	static pointer	1211	static pointer
…		…
1202	pointer	1232	pointer
1203	mk_foreign_func (SCHEME_P_ foreign_func f)	1233	mk_foreign_func (SCHEME_P_ foreign_func f)
1204	{	1234	{
1205	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1235	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1206		1236
1207	set_typeflag (x, (T_FOREIGN \| T_ATOM));	1237	set_typeflag (x, T_FOREIGN \| T_ATOM);
1208	x->object.ff = f;	1238	x->object.ff = f;
1209		1239
1210	return x;	1240	return x;
1211	}	1241	}
1212		1242
1213	INTERFACE pointer	1243	INTERFACE pointer
1214	mk_character (SCHEME_P_ int c)	1244	mk_character (SCHEME_P_ int c)
1215	{	1245	{
1216	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1246	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1217		1247
1218	set_typeflag (x, (T_CHARACTER \| T_ATOM));	1248	set_typeflag (x, T_CHARACTER \| T_ATOM);
1219	set_ivalue (x, c & 0xff);	1249	set_ivalue (x, c & 0xff);
1220		1250
1221	return x;	1251	return x;
1222	}	1252	}
1223		1253
1224	/* get number atom (integer) */	1254	/* get number atom (integer) */
1225	INTERFACE pointer	1255	INTERFACE pointer
1226	mk_integer (SCHEME_P_ long n)	1256	mk_integer (SCHEME_P_ long n)
1227	{	1257	{
		1258	pointer p = 0;
		1259	pointer *pp = &p;
		1260
		1261	#if USE_INTCACHE
		1262	if (n >= INTCACHE_MIN && n <= INTCACHE_MAX)
		1263	pp = &SCHEME_V->intcache[n - INTCACHE_MIN];
		1264	#endif
		1265
		1266	if (!*pp)
		1267	{
1228	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1268	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1229		1269
1230	set_typeflag (x, (T_INTEGER \| T_ATOM));	1270	set_typeflag (x, T_INTEGER \| T_ATOM);
		1271	setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */
1231	set_ivalue (x, n);	1272	set_ivalue (x, n);
1232		1273
		1274	*pp = x;
		1275	}
		1276
1233	return x;	1277	return *pp;
1234	}	1278	}
1235		1279
1236	INTERFACE pointer	1280	INTERFACE pointer
1237	mk_real (SCHEME_P_ RVALUE n)	1281	mk_real (SCHEME_P_ RVALUE n)
1238	{	1282	{
1239	#if USE_REAL	1283	#if USE_REAL
1240	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1284	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1241		1285
1242	set_typeflag (x, (T_REAL \| T_ATOM));	1286	set_typeflag (x, T_REAL \| T_ATOM);
1243	set_rvalue (x, n);	1287	set_rvalue (x, n);
1244		1288
1245	return x;	1289	return x;
1246	#else	1290	#else
1247	return mk_integer (SCHEME_A_ n);	1291	return mk_integer (SCHEME_A_ n);
…		…
1271	SCHEME_V->no_memory = 1;	1315	SCHEME_V->no_memory = 1;
1272	return SCHEME_V->strbuff;	1316	return SCHEME_V->strbuff;
1273	}	1317	}
1274		1318
1275	if (str)	1319	if (str)
1276	{	1320	memcpy (q, str , len_str); /* caller must ensure that str has length len_str /
1277	int l = strlen (str);
1278
1279	if (l > len_str)
1280	l = len_str;
1281
1282	memcpy (q, str, l);
1283	q[l] = 0;
1284	}
1285	else	1321	else
1286	{
1287	memset (q, fill, len_str);	1322	memset (q, fill, len_str);
		1323
1288	q[len_str] = 0;	1324	q[len_str] = 0;
1289	}
1290		1325
1291	return q;	1326	return q;
1292	}	1327	}
1293		1328
1294	INTERFACE pointer	1329	INTERFACE pointer
…		…
1308	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1343	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1309		1344
1310	set_typeflag (x, T_STRING \| T_ATOM);	1345	set_typeflag (x, T_STRING \| T_ATOM);
1311	strvalue (x) = store_string (SCHEME_A_ len, str, 0);	1346	strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1312	strlength (x) = len;	1347	strlength (x) = len;
		1348
1313	return x;	1349	return x;
1314	}	1350	}
1315		1351
1316	INTERFACE pointer	1352	INTERFACE pointer
1317	mk_string (SCHEME_P_ const char *str)	1353	mk_string (SCHEME_P_ const char *str)
…		…
1330	{	1366	{
1331	int i;	1367	int i;
1332		1368
1333	for (i = start; i < veclength (vec); i++)	1369	for (i = start; i < veclength (vec); i++)
1334	vecvalue (vec)[i] = obj;	1370	vecvalue (vec)[i] = obj;
		1371	}
		1372
		1373	INTERFACE void
		1374	vector_resize (pointer vec, uint32_t newsize, pointer fill)
		1375	{
		1376	uint32_t oldsize = veclength (vec);
		1377	vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
		1378	veclength (vec) = newsize;
		1379	fill_vector (vec, oldsize, fill);
1335	}	1380	}
1336		1381
1337	INTERFACE pointer	1382	INTERFACE pointer
1338	vector_get (pointer vec, uint32_t ielem)	1383	vector_get (pointer vec, uint32_t ielem)
1339	{	1384	{
…		…
1361		1406
1362	INTERFACE pointer	1407	INTERFACE pointer
1363	gensym (SCHEME_P)	1408	gensym (SCHEME_P)
1364	{	1409	{
1365	pointer x;	1410	pointer x;
1366
1367	for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1368	{
1369	char name[40] = "gensym-";	1411	char name[40] = "gensym-";
1370	xnum (name + 7, SCHEME_V->gensym_cnt);	1412	xnum (name + 7, ++SCHEME_V->gensym_cnt);
1371		1413
1372	/* first check oblist */	1414	return generate_symbol (SCHEME_A_ name);
1373	x = oblist_find_by_name (SCHEME_A_ name);	1415	}
1374		1416
1375	if (x == NIL)	1417	static int
1376	{	1418	is_gensym (SCHEME_P_ pointer x)
1377	x = oblist_add_by_name (SCHEME_A_ name);	1419	{
1378	return x;	1420	return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1379	}
1380	}
1381
1382	return NIL;
1383	}	1421	}
1384		1422
1385	/* make symbol or number atom from string */	1423	/* make symbol or number atom from string */
1386	static pointer	1424	static pointer
1387	mk_atom (SCHEME_P_ char *q)	1425	mk_atom (SCHEME_P_ char *q)
…		…
1622	/* Mark recent objects the interpreter doesn't know about yet. */	1660	/* Mark recent objects the interpreter doesn't know about yet. */
1623	mark (car (S_SINK));	1661	mark (car (S_SINK));
1624	/* Mark any older stuff above nested C calls */	1662	/* Mark any older stuff above nested C calls */
1625	mark (SCHEME_V->c_nest);	1663	mark (SCHEME_V->c_nest);
1626		1664
		1665	#if USE_INTCACHE
		1666	/* mark intcache */
		1667	for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i)
		1668	if (SCHEME_V->intcache[i - INTCACHE_MIN])
		1669	mark (SCHEME_V->intcache[i - INTCACHE_MIN]);
		1670	#endif
		1671
1627	/* mark variables a, b */	1672	/* mark variables a, b */
1628	mark (a);	1673	mark (a);
1629	mark (b);	1674	mark (b);
1630		1675
1631	/* garbage collect */	1676	/* garbage collect */
1632	clrmark (NIL);	1677	clrmark (NIL);
1633	SCHEME_V->fcells = 0;	1678	SCHEME_V->fcells = 0;
1634	SCHEME_V->free_cell = NIL;	1679	SCHEME_V->free_cell = NIL;
1635		1680
1636	/* free-list is kept sorted by address so as to maintain consecutive	1681	if (SCHEME_V->gc_verbose)
1637	ranges, if possible, for use with vectors. Here we scan the cells	1682	xwrstr ("freeing...");
1638	(which are also kept sorted by address) downwards to build the	1683
1639	free-list in sorted order.	1684	uint32_t total = 0;
1640	*/	1685
		1686	/* Here we scan the cells to build the free-list. */
1641	for (i = SCHEME_V->last_cell_seg; i >= 0; i--)	1687	for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1642	{	1688	{
1643	p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];	1689	pointer end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
		1690	total += SCHEME_V->cell_segsize [i];
1644		1691
1645	while (--p >= SCHEME_V->cell_seg[i])	1692	for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1646	{	1693	{
1647	if (is_mark (p))	1694	if (is_mark (p))
1648	clrmark (p);	1695	clrmark (p);
1649	else	1696	else
1650	{	1697	{
…		…
1663	}	1710	}
1664	}	1711	}
1665		1712
1666	if (SCHEME_V->gc_verbose)	1713	if (SCHEME_V->gc_verbose)
1667	{	1714	{
1668	xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n");	1715	xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" out of "); xwrnum (total); xwrstr (" cells were recovered.\n");
1669	}	1716	}
1670	}	1717	}
1671		1718
1672	static void	1719	static void
1673	finalize_cell (SCHEME_P_ pointer a)	1720	finalize_cell (SCHEME_P_ pointer a)
1674	{	1721	{
1675	/* TODO, fast bitmap check? */	1722	/* TODO, fast bitmap check? */
1676	if (is_string (a))	1723	if (is_string (a) \|\| is_symbol (a))
1677	free (strvalue (a));	1724	free (strvalue (a));
1678	else if (is_vector (a))	1725	else if (is_vector (a))
1679	free (vecvalue (a));	1726	free (vecvalue (a));
1680	#if USE_PORTS	1727	#if USE_PORTS
1681	else if (is_port (a))	1728	else if (is_port (a))
…		…
2103	#endif	2150	#endif
2104	}	2151	}
2105		2152
2106	/* read characters up to delimiter, but cater to character constants */	2153	/* read characters up to delimiter, but cater to character constants */
2107	static char *	2154	static char *
2108	readstr_upto (SCHEME_P_ char *delim)	2155	readstr_upto (SCHEME_P_ int skip, const char *delim)
2109	{	2156	{
2110	char *p = SCHEME_V->strbuff;	2157	char *p = SCHEME_V->strbuff + skip;
2111		2158
2112	while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));	2159	while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2113		2160
2114	if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')	2161	if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2115	*p = 0;	2162	*p = 0;
…		…
2122	return SCHEME_V->strbuff;	2169	return SCHEME_V->strbuff;
2123	}	2170	}
2124		2171
2125	/* read string expression "xxx...xxx" */	2172	/* read string expression "xxx...xxx" */
2126	static pointer	2173	static pointer
2127	readstrexp (SCHEME_P)	2174	readstrexp (SCHEME_P_ char delim)
2128	{	2175	{
2129	char *p = SCHEME_V->strbuff;	2176	char *p = SCHEME_V->strbuff;
2130	int c;	2177	int c;
2131	int c1 = 0;	2178	int c1 = 0;
2132	enum
2133	{ st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;	2179	enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2134		2180
2135	for (;;)	2181	for (;;)
2136	{	2182	{
2137	c = inchar (SCHEME_A);	2183	c = inchar (SCHEME_A);
2138		2184
…		…
2140	return S_F;	2186	return S_F;
2141		2187
2142	switch (state)	2188	switch (state)
2143	{	2189	{
2144	case st_ok:	2190	case st_ok:
2145	switch (c)	2191	if (ecb_expect_false (c == delim))
2146	{
2147	case '\\':
2148	state = st_bsl;
2149	break;
2150
2151	case '"':
2152	*p = 0;
2153	return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);	2192	return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2154		2193
2155	default:	2194	if (ecb_expect_false (c == '\\'))
		2195	state = st_bsl;
		2196	else
2156	*p++ = c;	2197	*p++ = c;
2157	break;
2158	}
2159		2198
2160	break;	2199	break;
2161		2200
2162	case st_bsl:	2201	case st_bsl:
2163	switch (c)	2202	switch (c)
…		…
2193	case 'r':	2232	case 'r':
2194	*p++ = '\r';	2233	*p++ = '\r';
2195	state = st_ok;	2234	state = st_ok;
2196	break;	2235	break;
2197		2236
2198	case '"':
2199	*p++ = '"';
2200	state = st_ok;
2201	break;
2202
2203	default:	2237	default:
2204	*p++ = c;	2238	*p++ = c;
2205	state = st_ok;	2239	state = st_ok;
2206	break;	2240	break;
2207	}	2241	}
2208		2242
2209	break;	2243	break;
2210		2244
2211	case st_x1:	2245	case st_x1:
2212	case st_x2:	2246	case st_x2:
2213	c = toupper (c);	2247	c = tolower (c);
2214		2248
2215	if (c >= '0' && c <= 'F')	2249	if (c >= '0' && c <= '9')
2216	{
2217	if (c <= '9')
2218	c1 = (c1 << 4) + c - '0';	2250	c1 = (c1 << 4) + c - '0';
2219	else	2251	else if (c >= 'a' && c <= 'f')
2220	c1 = (c1 << 4) + c - 'A' + 10;	2252	c1 = (c1 << 4) + c - 'a' + 10;
2221
2222	if (state == st_x1)
2223	state = st_x2;
2224	else
2225	{
2226	*p++ = c1;
2227	state = st_ok;
2228	}
2229	}
2230	else	2253	else
2231	return S_F;	2254	return S_F;
		2255
		2256	if (state == st_x1)
		2257	state = st_x2;
		2258	else
		2259	{
		2260	*p++ = c1;
		2261	state = st_ok;
		2262	}
2232		2263
2233	break;	2264	break;
2234		2265
2235	case st_oct1:	2266	case st_oct1:
2236	case st_oct2:	2267	case st_oct2:
…		…
2240	backchar (SCHEME_A_ c);	2271	backchar (SCHEME_A_ c);
2241	state = st_ok;	2272	state = st_ok;
2242	}	2273	}
2243	else	2274	else
2244	{	2275	{
2245	if (state == st_oct2 && c1 >= 32)	2276	if (state == st_oct2 && c1 >= ' ')
2246	return S_F;	2277	return S_F;
2247		2278
2248	c1 = (c1 << 3) + (c - '0');	2279	c1 = (c1 << 3) + (c - '0');
2249		2280
2250	if (state == st_oct1)	2281	if (state == st_oct1)
…		…
2255	state = st_ok;	2286	state = st_ok;
2256	}	2287	}
2257	}	2288	}
2258		2289
2259	break;	2290	break;
2260
2261	}	2291	}
2262	}	2292	}
2263	}	2293	}
2264		2294
2265	/* check c is in chars */	2295	/* check c is in chars */
2266	ecb_inline int	2296	ecb_inline int
2267	is_one_of (char *s, int c)	2297	is_one_of (const char *s, int c)
2268	{	2298	{
2269	if (c == EOF)
2270	return 1;
2271
2272	return !!strchr (s, c);	2299	return c == EOF \|\| !!strchr (s, c);
2273	}	2300	}
2274		2301
2275	/* skip white characters */	2302	/* skip white characters */
2276	ecb_inline int	2303	ecb_inline int
2277	skipspace (SCHEME_P)	2304	skipspace (SCHEME_P)
…		…
2279	int c, curr_line = 0;	2306	int c, curr_line = 0;
2280		2307
2281	do	2308	do
2282	{	2309	{
2283	c = inchar (SCHEME_A);	2310	c = inchar (SCHEME_A);
		2311
2284	#if SHOW_ERROR_LINE	2312	#if SHOW_ERROR_LINE
2285	if (c == '\n')	2313	if (ecb_expect_false (c == '\n'))
2286	curr_line++;	2314	curr_line++;
2287	#endif	2315	#endif
		2316
		2317	if (ecb_expect_false (c == EOF))
		2318	return c;
2288	}	2319	}
2289	while (c == ' ' \|\| c == '\n' \|\| c == '\r' \|\| c == '\t');	2320	while (is_one_of (WHITESPACE, c));
2290		2321
2291	/* record it */	2322	/* record it */
2292	#if SHOW_ERROR_LINE	2323	#if SHOW_ERROR_LINE
2293	if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)	2324	if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)
2294	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;	2325	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;
2295	#endif	2326	#endif
2296		2327
2297	if (c != EOF)
2298	{
2299	backchar (SCHEME_A_ c);	2328	backchar (SCHEME_A_ c);
2300	return 1;	2329	return 1;
2301	}
2302	else
2303	return EOF;
2304	}	2330	}
2305		2331
2306	/* get token */	2332	/* get token */
2307	static int	2333	static int
2308	token (SCHEME_P)	2334	token (SCHEME_P)
…		…
2324	return TOK_RPAREN;	2350	return TOK_RPAREN;
2325		2351
2326	case '.':	2352	case '.':
2327	c = inchar (SCHEME_A);	2353	c = inchar (SCHEME_A);
2328		2354
2329	if (is_one_of (" \n\t", c))	2355	if (is_one_of (WHITESPACE, c))
2330	return TOK_DOT;	2356	return TOK_DOT;
2331	else	2357	else
2332	{	2358	{
2333	//TODO: ungetc twice in a row is not supported in C
2334	backchar (SCHEME_A_ c);	2359	backchar (SCHEME_A_ c);
2335	backchar (SCHEME_A_ '.');
2336	return TOK_ATOM;	2360	return TOK_DOTATOM;
2337	}	2361	}
		2362
		2363	case '\|':
		2364	return TOK_STRATOM;
2338		2365
2339	case '\'':	2366	case '\'':
2340	return TOK_QUOTE;	2367	return TOK_QUOTE;
2341		2368
2342	case ';':	2369	case ';':
…		…
2474	}	2501	}
2475		2502
2476	putcharacter (SCHEME_A_ '"');	2503	putcharacter (SCHEME_A_ '"');
2477	}	2504	}
2478		2505
2479
2480	/* print atoms */	2506	/* print atoms */
2481	static void	2507	static void
2482	printatom (SCHEME_P_ pointer l, int f)	2508	printatom (SCHEME_P_ pointer l, int f)
2483	{	2509	{
2484	char *p;	2510	char *p;
2485	int len;	2511	int len;
2486		2512
2487	atom2str (SCHEME_A_ l, f, &p, &len);	2513	atom2str (SCHEME_A_ l, f, &p, &len);
2488	putchars (SCHEME_A_ p, len);	2514	putchars (SCHEME_A_ p, len);
2489	}	2515	}
2490
2491		2516
2492	/* Uses internal buffer unless string pointer is already available */	2517	/* Uses internal buffer unless string pointer is already available */
2493	static void	2518	static void
2494	atom2str (SCHEME_P_ pointer l, int f, char *pp, int plen)	2519	atom2str (SCHEME_P_ pointer l, int f, char *pp, int plen)
2495	{	2520	{
…		…
2656	#endif	2681	#endif
2657	}	2682	}
2658	else if (is_continuation (l))	2683	else if (is_continuation (l))
2659	p = "#<CONTINUATION>";	2684	p = "#<CONTINUATION>";
2660	else	2685	else
		2686	{
		2687	#if USE_PRINTF
		2688	p = SCHEME_V->strbuff;
		2689	snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l));
		2690	#else
2661	p = "#<ERROR>";	2691	p = "#<ERROR>";
		2692	#endif
		2693	}
2662		2694
2663	*pp = p;	2695	*pp = p;
2664	*plen = strlen (p);	2696	*plen = strlen (p);
2665	}	2697	}
2666		2698
…		…
2810	/* () is #t in R5RS */	2842	/* () is #t in R5RS */
2811	#define is_true(p) ((p) != S_F)	2843	#define is_true(p) ((p) != S_F)
2812	#define is_false(p) ((p) == S_F)	2844	#define is_false(p) ((p) == S_F)
2813		2845
2814	/* ========== Environment implementation ========== */	2846	/* ========== Environment implementation ========== */
2815
2816	#if !defined(USE_ALIST_ENV) \|\| !defined(USE_OBJECT_LIST)
2817
2818	static int
2819	hash_fn (const char *key, int table_size)
2820	{
2821	const unsigned char *p = key;
2822	uint32_t hash = 2166136261;
2823
2824	while (*p)
2825	hash = (hash ^ p++) 16777619;
2826
2827	return hash % table_size;
2828	}
2829	#endif
2830		2847
2831	#ifndef USE_ALIST_ENV	2848	#ifndef USE_ALIST_ENV
2832		2849
2833	/*	2850	/*
2834	* In this implementation, each frame of the environment may be	2851	* In this implementation, each frame of the environment may be
…		…
2857	sym_hash (pointer sym, uint32_t size)	2874	sym_hash (pointer sym, uint32_t size)
2858	{	2875	{
2859	uintptr_t ptr = (uintptr_t)sym;	2876	uintptr_t ptr = (uintptr_t)sym;
2860		2877
2861	#if 0	2878	#if 0
2862	/* tqable size is prime, so why mix */	2879	/* table size is prime, so why mix */
2863	ptr += ptr >> 32;	2880	ptr += ptr >> 32;
2864	ptr += ptr >> 16;	2881	ptr += ptr >> 16;
2865	ptr += ptr >> 8;	2882	ptr += ptr >> 8;
2866	#endif	2883	#endif
2867		2884
…		…
2951	#endif /* USE_ALIST_ENV else */	2968	#endif /* USE_ALIST_ENV else */
2952		2969
2953	ecb_inline void	2970	ecb_inline void
2954	new_slot_in_env (SCHEME_P_ pointer variable, pointer value)	2971	new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2955	{	2972	{
		2973	assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2956	new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);	2974	new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2957	}	2975	}
2958		2976
2959	ecb_inline void	2977	ecb_inline void
2960	set_slot_in_env (SCHEME_P_ pointer slot, pointer value)	2978	set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
…		…
3252		3270
3253	#endif	3271	#endif
3254		3272
3255	#define s_retbool(tf) s_return ((tf) ? S_T : S_F)	3273	#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3256		3274
		3275	#if EXPERIMENT
		3276	static int
		3277	debug (SCHEME_P_ int indent, pointer x)
		3278	{
		3279	int c;
		3280
		3281	if (is_syntax (x))
		3282	{
		3283	printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x));
		3284	return 8 + 8;
		3285	}
		3286
		3287	if (x == NIL)
		3288	{
		3289	printf ("%*sNIL\n", indent, "");
		3290	return 3;
		3291	}
		3292
		3293	switch (type (x))
		3294	{
		3295	case T_INTEGER:
		3296	printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x);
		3297	return 32+8;
		3298
		3299	case T_SYMBOL:
		3300	printf ("%*sS<%s>\n", indent, "", symname (x));
		3301	return 24+8;
		3302
		3303	case T_CLOSURE:
		3304	printf ("%*sS<%s>\n", indent, "", "closure");
		3305	debug (SCHEME_A_ indent + 3, cdr(x));
		3306	return 32 + debug (SCHEME_A_ indent + 3, car (x));
		3307
		3308	case T_PAIR:
		3309	printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
		3310	c = debug (SCHEME_A_ indent + 3, car (x));
		3311	c += debug (SCHEME_A_ indent + 3, cdr (x));
		3312	return c + 1;
		3313
		3314	case T_PORT:
		3315	printf ("%*sS<%s>\n", indent, "", "port");
		3316	return 24+8;
		3317
		3318	case T_VECTOR:
		3319	printf ("%*sS<%s>\n", indent, "", "vector");
		3320	return 24+8;
		3321
		3322	case T_ENVIRONMENT:
		3323	printf ("%*sS<%s>\n", indent, "", "environment");
		3324	return 0 + debug (SCHEME_A_ indent + 3, car (x));
		3325
		3326	default:
		3327	printf ("unhandled type %d\n", type (x));
		3328	break;
		3329	}
		3330	}
		3331	#endif
		3332
3257	static int	3333	static int
3258	opexe_0 (SCHEME_P_ enum scheme_opcodes op)	3334	opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3259	{	3335	{
3260	pointer args = SCHEME_V->args;	3336	pointer args = SCHEME_V->args;
3261	pointer x, y;	3337	pointer x, y;
3262		3338
3263	switch (op)	3339	switch (op)
3264	{	3340	{
		3341	#if EXPERIMENT //D
		3342	case OP_DEBUG:
		3343	printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8);
		3344	printf ("\n");
		3345	s_return (S_T);
		3346	#endif
3265	case OP_LOAD: /* load */	3347	case OP_LOAD: /* load */
3266	if (file_interactive (SCHEME_A))	3348	if (file_interactive (SCHEME_A))
3267	{	3349	{
3268	xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");	3350	xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");
3269	//D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));	3351	//D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
…		…
3392	}	3474	}
3393	else	3475	else
3394	s_return (SCHEME_V->code);	3476	s_return (SCHEME_V->code);
3395		3477
3396	case OP_E0ARGS: /* eval arguments */	3478	case OP_E0ARGS: /* eval arguments */
3397	if (is_macro (SCHEME_V->value)) /* macro expansion */	3479	if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3398	{	3480	{
3399	s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);	3481	s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3400	SCHEME_V->args = cons (SCHEME_V->code, NIL);	3482	SCHEME_V->args = cons (SCHEME_V->code, NIL);
3401	SCHEME_V->code = SCHEME_V->value;	3483	SCHEME_V->code = SCHEME_V->value;
3402	s_goto (OP_APPLY);	3484	s_goto (OP_APPLY);
…		…
3503		3585
3504	case OP_DOMACRO: /* do macro */	3586	case OP_DOMACRO: /* do macro */
3505	SCHEME_V->code = SCHEME_V->value;	3587	SCHEME_V->code = SCHEME_V->value;
3506	s_goto (OP_EVAL);	3588	s_goto (OP_EVAL);
3507		3589
3508	#if 1
3509
3510	case OP_LAMBDA: /* lambda */	3590	case OP_LAMBDA: /* lambda */
3511	/* If the hook is defined, apply it to SCHEME_V->code, otherwise	3591	/* If the hook is defined, apply it to SCHEME_V->code, otherwise
3512	set SCHEME_V->value fall thru */	3592	set SCHEME_V->value fall thru */
3513	{	3593	{
3514	pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);	3594	pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
…		…
3520	SCHEME_V->code = slot_value_in_env (f);	3600	SCHEME_V->code = slot_value_in_env (f);
3521	s_goto (OP_APPLY);	3601	s_goto (OP_APPLY);
3522	}	3602	}
3523		3603
3524	SCHEME_V->value = SCHEME_V->code;	3604	SCHEME_V->value = SCHEME_V->code;
3525	/* Fallthru */
3526	}	3605	}
		3606	/* Fallthru */
3527		3607
3528	case OP_LAMBDA1:	3608	case OP_LAMBDA1:
3529	s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));	3609	s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));
3530
3531	#else
3532
3533	case OP_LAMBDA: /* lambda */
3534	s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3535
3536	#endif
3537		3610
3538	case OP_MKCLOSURE: /* make-closure */	3611	case OP_MKCLOSURE: /* make-closure */
3539	x = car (args);	3612	x = car (args);
3540		3613
3541	if (car (x) == SCHEME_V->LAMBDA)	3614	if (car (x) == SCHEME_V->LAMBDA)
…		…
4137	else	4210	else
4138	Error_0 ("modulo: division by zero");	4211	Error_0 ("modulo: division by zero");
4139		4212
4140	s_return (mk_number (SCHEME_A_ v));	4213	s_return (mk_number (SCHEME_A_ v));
4141		4214
4142	case OP_CAR: /* car */	4215	/* the compiler will optimize this mess... */
4143	s_return (caar (args));	4216	case OP_CAR: op_car: s_return (car (x));
4144		4217	case OP_CDR: op_cdr: s_return (cdr (x));
4145	case OP_CDR: /* cdr */	4218	case OP_CAAR: op_caar: x = car (x); goto op_car;
4146	s_return (cdar (args));	4219	case OP_CADR: op_cadr: x = cdr (x); goto op_car;
		4220	case OP_CDAR: op_cdar: x = car (x); goto op_cdr;
		4221	case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr;
		4222	case OP_CAAAR: op_caaar: x = car (x); goto op_caar;
		4223	case OP_CAADR: op_caadr: x = cdr (x); goto op_caar;
		4224	case OP_CADAR: op_cadar: x = car (x); goto op_cadr;
		4225	case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr;
		4226	case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar;
		4227	case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar;
		4228	case OP_CDDAR: op_cddar: x = car (x); goto op_cddr;
		4229	case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr;
		4230	case OP_CAAAAR: x = car (x); goto op_caaar;
		4231	case OP_CAAADR: x = cdr (x); goto op_caaar;
		4232	case OP_CAADAR: x = car (x); goto op_caadr;
		4233	case OP_CAADDR: x = cdr (x); goto op_caadr;
		4234	case OP_CADAAR: x = car (x); goto op_cadar;
		4235	case OP_CADADR: x = cdr (x); goto op_cadar;
		4236	case OP_CADDAR: x = car (x); goto op_caddr;
		4237	case OP_CADDDR: x = cdr (x); goto op_caddr;
		4238	case OP_CDAAAR: x = car (x); goto op_cdaar;
		4239	case OP_CDAADR: x = cdr (x); goto op_cdaar;
		4240	case OP_CDADAR: x = car (x); goto op_cdadr;
		4241	case OP_CDADDR: x = cdr (x); goto op_cdadr;
		4242	case OP_CDDAAR: x = car (x); goto op_cddar;
		4243	case OP_CDDADR: x = cdr (x); goto op_cddar;
		4244	case OP_CDDDAR: x = car (x); goto op_cdddr;
		4245	case OP_CDDDDR: x = cdr (x); goto op_cdddr;
4147		4246
4148	case OP_CONS: /* cons */	4247	case OP_CONS: /* cons */
4149	set_cdr (args, cadr (args));	4248	set_cdr (args, cadr (args));
4150	s_return (args);	4249	s_return (args);
4151		4250
…		…
4400	}	4499	}
4401		4500
4402	case OP_VECLEN: /* vector-length */	4501	case OP_VECLEN: /* vector-length */
4403	s_return (mk_integer (SCHEME_A_ veclength (x)));	4502	s_return (mk_integer (SCHEME_A_ veclength (x)));
4404		4503
		4504	case OP_VECRESIZE:
		4505	vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
		4506	s_return (x);
		4507
4405	case OP_VECREF: /* vector-ref */	4508	case OP_VECREF: /* vector-ref */
4406	{	4509	{
4407	int index = ivalue_unchecked (cadr (args));	4510	int index = ivalue_unchecked (cadr (args));
4408		4511
4409	if (index >= veclength (car (args)) && USE_ERROR_CHECKING)	4512	if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
…		…
4469	pointer d = cdr (args);	4572	pointer d = cdr (args);
4470	int r;	4573	int r;
4471		4574
4472	switch (op)	4575	switch (op)
4473	{	4576	{
4474	case OP_NOT: /* not */ r = is_false (a) ; break;	4577	case OP_NOT: /* not */ r = is_false (a) ; break;
4475	case OP_BOOLP: /* boolean? */ r = a == S_F \|\| a == S_T; break;	4578	case OP_BOOLP: /* boolean? */ r = a == S_F \|\| a == S_T ; break;
4476	case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;	4579	case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4477	case OP_NULLP: /* null? */ r = a == NIL ; break;	4580	case OP_NULLP: /* null? */ r = a == NIL ; break;
4478	case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;	4581	case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
		4582	case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break;
4479	case OP_NUMBERP: /* number? */ r = is_number (a) ; break;	4583	case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4480	case OP_STRINGP: /* string? */ r = is_string (a) ; break;	4584	case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4481	case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;	4585	case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4482	case OP_REALP: /* real? / r = is_number (a) ; break; / all numbers are real */	4586	case OP_REALP: /* real? / r = is_number (a) ; break; / all numbers are real */
4483	case OP_CHARP: /* char? */ r = is_character (a) ; break;	4587	case OP_CHARP: /* char? */ r = is_character (a) ; break;
4484		4588
4485	#if USE_CHAR_CLASSIFIERS	4589	#if USE_CHAR_CLASSIFIERS
4486	case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;	4590	case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4487	case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;	4591	case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4488	case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;	4592	case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
…		…
4964	s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);	5068	s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
4965	SCHEME_V->tok = token (SCHEME_A);	5069	SCHEME_V->tok = token (SCHEME_A);
4966	s_goto (OP_RDSEXPR);	5070	s_goto (OP_RDSEXPR);
4967		5071
4968	case TOK_ATOM:	5072	case TOK_ATOM:
4969	s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS)));	5073	s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
		5074
		5075	case TOK_DOTATOM:
		5076	SCHEME_V->strbuff[0] = '.';
		5077	s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
		5078
		5079	case TOK_STRATOM:
		5080	x = readstrexp (SCHEME_A_ '\|');
		5081	//TODO: haven't checked whether the garbage collector could interfere
		5082	s_return (mk_atom (SCHEME_A_ strvalue (x)));
4970		5083
4971	case TOK_DQUOTE:	5084	case TOK_DQUOTE:
4972	x = readstrexp (SCHEME_A);	5085	x = readstrexp (SCHEME_A_ '"');
4973		5086
4974	if (x == S_F)	5087	if (x == S_F)
4975	Error_0 ("Error reading string");	5088	Error_0 ("Error reading string");
4976		5089
4977	setimmutable (x);	5090	setimmutable (x);
…		…
4989	s_goto (OP_EVAL);	5102	s_goto (OP_EVAL);
4990	}	5103	}
4991	}	5104	}
4992		5105
4993	case TOK_SHARP_CONST:	5106	case TOK_SHARP_CONST:
4994	if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL)	5107	if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
4995	Error_0 ("undefined sharp expression");	5108	Error_0 ("undefined sharp expression");
4996	else	5109	else
4997	s_return (x);	5110	s_return (x);
4998		5111
4999	default:	5112	default:
…		…
5221		5334
5222	case OP_CLOSUREP: /* closure? */	5335	case OP_CLOSUREP: /* closure? */
5223	/*	5336	/*
5224	* Note, macro object is also a closure.	5337	* Note, macro object is also a closure.
5225	* Therefore, (closure? <#MACRO>) ==> #t	5338	* Therefore, (closure? <#MACRO>) ==> #t
		5339	* (schmorp) well, obviously not, fix? TODO
5226	*/	5340	*/
5227	s_retbool (is_closure (a));	5341	s_retbool (is_closure (a));
5228		5342
5229	case OP_MACROP: /* macro? */	5343	case OP_MACROP: /* macro? */
5230	s_retbool (is_macro (a));	5344	s_retbool (is_macro (a));
…		…
5471		5585
5472	/* Hard-coded for the given keywords. Remember to rewrite if more are added! */	5586	/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5473	static int	5587	static int
5474	syntaxnum (pointer p)	5588	syntaxnum (pointer p)
5475	{	5589	{
5476	const char *s = strvalue (car (p));	5590	const char *s = strvalue (p);
5477		5591
5478	switch (strlength (car (p)))	5592	switch (strlength (p))
5479	{	5593	{
5480	case 2:	5594	case 2:
5481	if (s[0] == 'i')	5595	if (s[0] == 'i')
5482	return OP_IF0; /* if */	5596	return OP_IF0; /* if */
5483	else	5597	else
…		…
5558	ecb_cold int	5672	ecb_cold int
5559	scheme_init (SCHEME_P)	5673	scheme_init (SCHEME_P)
5560	{	5674	{
5561	int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);	5675	int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5562	pointer x;	5676	pointer x;
		5677
		5678	memset (SCHEME_V, 0, sizeof (*SCHEME_V));//TODO !iso c
5563		5679
5564	num_set_fixnum (num_zero, 1);	5680	num_set_fixnum (num_zero, 1);
5565	num_set_ivalue (num_zero, 0);	5681	num_set_ivalue (num_zero, 0);
5566	num_set_fixnum (num_one, 1);	5682	num_set_fixnum (num_one, 1);
5567	num_set_ivalue (num_one, 1);	5683	num_set_ivalue (num_one, 1);
…		…
5919	# endif	6035	# endif
5920	int fin;	6036	int fin;
5921	char *file_name = InitFile;	6037	char *file_name = InitFile;
5922	int retcode;	6038	int retcode;
5923	int isfile = 1;	6039	int isfile = 1;
		6040	system ("ps v $PPID");//D
5924		6041
5925	if (argc == 2 && strcmp (argv[1], "-?") == 0)	6042	if (argc == 2 && strcmp (argv[1], "-?") == 0)
5926	{	6043	{
5927	xwrstr ("Usage: tinyscheme -?\n");	6044	xwrstr ("Usage: tinyscheme -?\n");
5928	xwrstr ("or: tinyscheme [<file1> <file2> ...]\n");	6045	xwrstr ("or: tinyscheme [<file1> <file2> ...]\n");

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing cvsroot/microscheme/scheme.c (file contents): Revision 1.32 by root, Sat Nov 28 10:56:45 2015 UTC vs. Revision 1.48 by root, Mon Nov 30 13:07:34 2015 UTC

Diff Legend

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.32 by root, Sat Nov 28 10:56:45 2015 UTC vs.
Revision 1.48 by root, Mon Nov 30 13:07:34 2015 UTC