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

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.29 by root, Sat Nov 28 10:31:06 2015 UTC vs.
Revision 1.44 by root, Mon Nov 30 06:49:11 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	#define symprop(p) cdr(p)
400	SCHEME_EXPORT int	419	SCHEME_EXPORT int
401	hasprop (pointer p)	420	hasprop (pointer p)
402	{	421	{
403	return typeflag (p) & T_SYMBOL;	422	return typeflag (p) & T_SYMBOL;
404	}	423	}
405
406	# define symprop(p) cdr(p)
407	#endif	424	#endif
408		425
409	INTERFACE int	426	INTERFACE int
410	is_syntax (pointer p)	427	is_syntax (pointer p)
411	{	428	{
…		…
425	}	442	}
426		443
427	INTERFACE char *	444	INTERFACE char *
428	syntaxname (pointer p)	445	syntaxname (pointer p)
429	{	446	{
430	return strvalue (car (p));	447	return strvalue (p);
431	}	448	}
432		449
433	#define procnum(p) ivalue_unchecked (p)	450	#define procnum(p) ivalue_unchecked (p)
434	static const char *procname (pointer x);	451	static const char *procname (pointer x);
435		452
…		…
651	#endif	668	#endif
652		669
653	static int file_push (SCHEME_P_ const char *fname);	670	static int file_push (SCHEME_P_ const char *fname);
654	static void file_pop (SCHEME_P);	671	static void file_pop (SCHEME_P);
655	static int file_interactive (SCHEME_P);	672	static int file_interactive (SCHEME_P);
656	ecb_inline int is_one_of (char *s, int c);	673	ecb_inline int is_one_of (const char *s, int c);
657	static int alloc_cellseg (SCHEME_P_ int n);	674	static int alloc_cellseg (SCHEME_P_ int n);
658	ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);	675	ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
659	static void finalize_cell (SCHEME_P_ pointer a);	676	static void finalize_cell (SCHEME_P_ pointer a);
660	static int count_consecutive_cells (pointer x, int needed);	677	static int count_consecutive_cells (pointer x, int needed);
661	static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);	678	static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
…		…
678	static void mark (pointer a);	695	static void mark (pointer a);
679	static void gc (SCHEME_P_ pointer a, pointer b);	696	static void gc (SCHEME_P_ pointer a, pointer b);
680	static int basic_inchar (port *pt);	697	static int basic_inchar (port *pt);
681	static int inchar (SCHEME_P);	698	static int inchar (SCHEME_P);
682	static void backchar (SCHEME_P_ int c);	699	static void backchar (SCHEME_P_ int c);
683	static char readstr_upto (SCHEME_P_ char delim);	700	static char readstr_upto (SCHEME_P_ int skip, const char delim);
684	static pointer readstrexp (SCHEME_P);	701	static pointer readstrexp (SCHEME_P_ char delim);
685	ecb_inline int skipspace (SCHEME_P);	702	ecb_inline int skipspace (SCHEME_P);
686	static int token (SCHEME_P);	703	static int token (SCHEME_P);
687	static void printslashstring (SCHEME_P_ char *s, int len);	704	static void printslashstring (SCHEME_P_ char *s, int len);
688	static void atom2str (SCHEME_P_ pointer l, int f, char *pp, int plen);	705	static void atom2str (SCHEME_P_ pointer l, int f, char *pp, int plen);
689	static void printatom (SCHEME_P_ pointer l, int f);	706	static void printatom (SCHEME_P_ pointer l, int f);
…		…
1077	set_cdr (x, b);	1094	set_cdr (x, b);
1078		1095
1079	return x;	1096	return x;
1080	}	1097	}
1081		1098
		1099	static pointer
		1100	generate_symbol (SCHEME_P_ const char *name)
		1101	{
		1102	pointer x = mk_string (SCHEME_A_ name);
		1103	setimmutable (x);
		1104	set_typeflag (x, T_SYMBOL \| T_ATOM);
		1105	return x;
		1106	}
		1107
1082	/* ========== oblist implementation ========== */	1108	/* ========== oblist implementation ========== */
1083		1109
1084	#ifndef USE_OBJECT_LIST	1110	#ifndef USE_OBJECT_LIST
1085		1111
		1112	static int
1086	static int hash_fn (const char *key, int table_size);	1113	hash_fn (const char *key, int table_size)
		1114	{
		1115	const unsigned char *p = key;
		1116	uint32_t hash = 2166136261;
		1117
		1118	while (*p)
		1119	hash = (hash ^ p++) 16777619;
		1120
		1121	return hash % table_size;
		1122	}
1087		1123
1088	static pointer	1124	static pointer
1089	oblist_initial_value (SCHEME_P)	1125	oblist_initial_value (SCHEME_P)
1090	{	1126	{
1091	return mk_vector (SCHEME_A_ 461); /* probably should be bigger */	1127	return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
…		…
1093		1129
1094	/* returns the new symbol */	1130	/* returns the new symbol */
1095	static pointer	1131	static pointer
1096	oblist_add_by_name (SCHEME_P_ const char *name)	1132	oblist_add_by_name (SCHEME_P_ const char *name)
1097	{	1133	{
1098	int location;	1134	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));	1135	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)));	1136	vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1106	return x;	1137	return x;
1107	}	1138	}
1108		1139
1109	ecb_inline pointer	1140	ecb_inline pointer
…		…
1169		1200
1170	/* returns the new symbol */	1201	/* returns the new symbol */
1171	static pointer	1202	static pointer
1172	oblist_add_by_name (SCHEME_P_ const char *name)	1203	oblist_add_by_name (SCHEME_P_ const char *name)
1173	{	1204	{
1174	pointer x;	1205	pointer x = mk_string (SCHEME_A_ name);
1175
1176	x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1177	set_typeflag (x, T_SYMBOL);	1206	set_typeflag (x, T_SYMBOL);
1178	setimmutable (car (x));	1207	setimmutable (x);
1179	SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);	1208	SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1180	return x;	1209	return x;
1181	}	1210	}
1182		1211
1183	static pointer	1212	static pointer
…		…
1273	SCHEME_V->no_memory = 1;	1302	SCHEME_V->no_memory = 1;
1274	return SCHEME_V->strbuff;	1303	return SCHEME_V->strbuff;
1275	}	1304	}
1276		1305
1277	if (str)	1306	if (str)
1278	{	1307	memcpy (q, str , len_str); /* caller must ensure that str has length len_str /
1279	int l = strlen (str);
1280
1281	if (l > len_str)
1282	l = len_str;
1283
1284	memcpy (q, str, l);
1285	q[l] = 0;
1286	}
1287	else	1308	else
1288	{
1289	memset (q, fill, len_str);	1309	memset (q, fill, len_str);
		1310
1290	q[len_str] = 0;	1311	q[len_str] = 0;
1291	}
1292		1312
1293	return q;	1313	return q;
1294	}	1314	}
1295		1315
1296	INTERFACE pointer	1316	INTERFACE pointer
…		…
1310	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1330	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1311		1331
1312	set_typeflag (x, T_STRING \| T_ATOM);	1332	set_typeflag (x, T_STRING \| T_ATOM);
1313	strvalue (x) = store_string (SCHEME_A_ len, str, 0);	1333	strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1314	strlength (x) = len;	1334	strlength (x) = len;
		1335
1315	return x;	1336	return x;
1316	}	1337	}
1317		1338
1318	INTERFACE pointer	1339	INTERFACE pointer
1319	mk_string (SCHEME_P_ const char *str)	1340	mk_string (SCHEME_P_ const char *str)
…		…
1332	{	1353	{
1333	int i;	1354	int i;
1334		1355
1335	for (i = start; i < veclength (vec); i++)	1356	for (i = start; i < veclength (vec); i++)
1336	vecvalue (vec)[i] = obj;	1357	vecvalue (vec)[i] = obj;
		1358	}
		1359
		1360	INTERFACE void
		1361	vector_resize (pointer vec, uint32_t newsize, pointer fill)
		1362	{
		1363	uint32_t oldsize = veclength (vec);
		1364	vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
		1365	veclength (vec) = newsize;
		1366	fill_vector (vec, oldsize, fill);
1337	}	1367	}
1338		1368
1339	INTERFACE pointer	1369	INTERFACE pointer
1340	vector_get (pointer vec, uint32_t ielem)	1370	vector_get (pointer vec, uint32_t ielem)
1341	{	1371	{
…		…
1363		1393
1364	INTERFACE pointer	1394	INTERFACE pointer
1365	gensym (SCHEME_P)	1395	gensym (SCHEME_P)
1366	{	1396	{
1367	pointer x;	1397	pointer x;
1368
1369	for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1370	{
1371	char name[40] = "gensym-";	1398	char name[40] = "gensym-";
1372	xnum (name + 7, SCHEME_V->gensym_cnt);	1399	xnum (name + 7, ++SCHEME_V->gensym_cnt);
1373		1400
1374	/* first check oblist */	1401	return generate_symbol (SCHEME_A_ name);
1375	x = oblist_find_by_name (SCHEME_A_ name);	1402	}
1376		1403
1377	if (x == NIL)	1404	static int
1378	{	1405	is_gensym (SCHEME_P_ pointer x)
1379	x = oblist_add_by_name (SCHEME_A_ name);	1406	{
1380	return x;	1407	return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1381	}
1382	}
1383
1384	return NIL;
1385	}	1408	}
1386		1409
1387	/* make symbol or number atom from string */	1410	/* make symbol or number atom from string */
1388	static pointer	1411	static pointer
1389	mk_atom (SCHEME_P_ char *q)	1412	mk_atom (SCHEME_P_ char *q)
…		…
1633	/* garbage collect */	1656	/* garbage collect */
1634	clrmark (NIL);	1657	clrmark (NIL);
1635	SCHEME_V->fcells = 0;	1658	SCHEME_V->fcells = 0;
1636	SCHEME_V->free_cell = NIL;	1659	SCHEME_V->free_cell = NIL;
1637		1660
1638	/* free-list is kept sorted by address so as to maintain consecutive	1661	uint32_t total = 0;
1639	ranges, if possible, for use with vectors. Here we scan the cells	1662
1640	(which are also kept sorted by address) downwards to build the	1663	/* Here we scan the cells to build the free-list. */
1641	free-list in sorted order.
1642	*/
1643	for (i = SCHEME_V->last_cell_seg; i >= 0; i--)	1664	for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1644	{	1665	{
1645	p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];	1666	pointer end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
		1667	total += SCHEME_V->cell_segsize [i];
1646		1668
1647	while (--p >= SCHEME_V->cell_seg[i])	1669	for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1648	{	1670	{
1649	if (is_mark (p))	1671	if (is_mark (p))
1650	clrmark (p);	1672	clrmark (p);
1651	else	1673	else
1652	{	1674	{
…		…
1665	}	1687	}
1666	}	1688	}
1667		1689
1668	if (SCHEME_V->gc_verbose)	1690	if (SCHEME_V->gc_verbose)
1669	{	1691	{
1670	xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n");	1692	xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" out of "); xwrnum (total); xwrstr (" cells were recovered.\n");
1671	}	1693	}
1672	}	1694	}
1673		1695
1674	static void	1696	static void
1675	finalize_cell (SCHEME_P_ pointer a)	1697	finalize_cell (SCHEME_P_ pointer a)
1676	{	1698	{
1677	/* TODO, fast bitmap check? */	1699	/* TODO, fast bitmap check? */
1678	if (is_string (a))	1700	if (is_string (a) \|\| is_symbol (a))
1679	free (strvalue (a));	1701	free (strvalue (a));
1680	else if (is_vector (a))	1702	else if (is_vector (a))
1681	free (vecvalue (a));	1703	free (vecvalue (a));
1682	#if USE_PORTS	1704	#if USE_PORTS
1683	else if (is_port (a))	1705	else if (is_port (a))
…		…
2105	#endif	2127	#endif
2106	}	2128	}
2107		2129
2108	/* read characters up to delimiter, but cater to character constants */	2130	/* read characters up to delimiter, but cater to character constants */
2109	static char *	2131	static char *
2110	readstr_upto (SCHEME_P_ char *delim)	2132	readstr_upto (SCHEME_P_ int skip, const char *delim)
2111	{	2133	{
2112	char *p = SCHEME_V->strbuff;	2134	char *p = SCHEME_V->strbuff + skip;
2113		2135
2114	while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));	2136	while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2115		2137
2116	if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')	2138	if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2117	*p = 0;	2139	*p = 0;
…		…
2124	return SCHEME_V->strbuff;	2146	return SCHEME_V->strbuff;
2125	}	2147	}
2126		2148
2127	/* read string expression "xxx...xxx" */	2149	/* read string expression "xxx...xxx" */
2128	static pointer	2150	static pointer
2129	readstrexp (SCHEME_P)	2151	readstrexp (SCHEME_P_ char delim)
2130	{	2152	{
2131	char *p = SCHEME_V->strbuff;	2153	char *p = SCHEME_V->strbuff;
2132	int c;	2154	int c;
2133	int c1 = 0;	2155	int c1 = 0;
2134	enum
2135	{ st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;	2156	enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2136		2157
2137	for (;;)	2158	for (;;)
2138	{	2159	{
2139	c = inchar (SCHEME_A);	2160	c = inchar (SCHEME_A);
2140		2161
…		…
2142	return S_F;	2163	return S_F;
2143		2164
2144	switch (state)	2165	switch (state)
2145	{	2166	{
2146	case st_ok:	2167	case st_ok:
2147	switch (c)	2168	if (ecb_expect_false (c == delim))
2148	{
2149	case '\\':
2150	state = st_bsl;
2151	break;
2152
2153	case '"':
2154	*p = 0;
2155	return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);	2169	return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2156		2170
2157	default:	2171	if (ecb_expect_false (c == '\\'))
		2172	state = st_bsl;
		2173	else
2158	*p++ = c;	2174	*p++ = c;
2159	break;
2160	}
2161		2175
2162	break;	2176	break;
2163		2177
2164	case st_bsl:	2178	case st_bsl:
2165	switch (c)	2179	switch (c)
…		…
2195	case 'r':	2209	case 'r':
2196	*p++ = '\r';	2210	*p++ = '\r';
2197	state = st_ok;	2211	state = st_ok;
2198	break;	2212	break;
2199		2213
2200	case '"':
2201	*p++ = '"';
2202	state = st_ok;
2203	break;
2204
2205	default:	2214	default:
2206	*p++ = c;	2215	*p++ = c;
2207	state = st_ok;	2216	state = st_ok;
2208	break;	2217	break;
2209	}	2218	}
2210		2219
2211	break;	2220	break;
2212		2221
2213	case st_x1:	2222	case st_x1:
2214	case st_x2:	2223	case st_x2:
2215	c = toupper (c);	2224	c = tolower (c);
2216		2225
2217	if (c >= '0' && c <= 'F')	2226	if (c >= '0' && c <= '9')
2218	{
2219	if (c <= '9')
2220	c1 = (c1 << 4) + c - '0';	2227	c1 = (c1 << 4) + c - '0';
2221	else	2228	else if (c >= 'a' && c <= 'f')
2222	c1 = (c1 << 4) + c - 'A' + 10;	2229	c1 = (c1 << 4) + c - 'a' + 10;
2223
2224	if (state == st_x1)
2225	state = st_x2;
2226	else
2227	{
2228	*p++ = c1;
2229	state = st_ok;
2230	}
2231	}
2232	else	2230	else
2233	return S_F;	2231	return S_F;
		2232
		2233	if (state == st_x1)
		2234	state = st_x2;
		2235	else
		2236	{
		2237	*p++ = c1;
		2238	state = st_ok;
		2239	}
2234		2240
2235	break;	2241	break;
2236		2242
2237	case st_oct1:	2243	case st_oct1:
2238	case st_oct2:	2244	case st_oct2:
…		…
2242	backchar (SCHEME_A_ c);	2248	backchar (SCHEME_A_ c);
2243	state = st_ok;	2249	state = st_ok;
2244	}	2250	}
2245	else	2251	else
2246	{	2252	{
2247	if (state == st_oct2 && c1 >= 32)	2253	if (state == st_oct2 && c1 >= ' ')
2248	return S_F;	2254	return S_F;
2249		2255
2250	c1 = (c1 << 3) + (c - '0');	2256	c1 = (c1 << 3) + (c - '0');
2251		2257
2252	if (state == st_oct1)	2258	if (state == st_oct1)
…		…
2257	state = st_ok;	2263	state = st_ok;
2258	}	2264	}
2259	}	2265	}
2260		2266
2261	break;	2267	break;
2262
2263	}	2268	}
2264	}	2269	}
2265	}	2270	}
2266		2271
2267	/* check c is in chars */	2272	/* check c is in chars */
2268	ecb_inline int	2273	ecb_inline int
2269	is_one_of (char *s, int c)	2274	is_one_of (const char *s, int c)
2270	{	2275	{
2271	if (c == EOF)
2272	return 1;
2273
2274	return !!strchr (s, c);	2276	return c == EOF \|\| !!strchr (s, c);
2275	}	2277	}
2276		2278
2277	/* skip white characters */	2279	/* skip white characters */
2278	ecb_inline int	2280	ecb_inline int
2279	skipspace (SCHEME_P)	2281	skipspace (SCHEME_P)
…		…
2281	int c, curr_line = 0;	2283	int c, curr_line = 0;
2282		2284
2283	do	2285	do
2284	{	2286	{
2285	c = inchar (SCHEME_A);	2287	c = inchar (SCHEME_A);
		2288
2286	#if SHOW_ERROR_LINE	2289	#if SHOW_ERROR_LINE
2287	if (c == '\n')	2290	if (ecb_expect_false (c == '\n'))
2288	curr_line++;	2291	curr_line++;
2289	#endif	2292	#endif
		2293
		2294	if (ecb_expect_false (c == EOF))
		2295	return c;
2290	}	2296	}
2291	while (c == ' ' \|\| c == '\n' \|\| c == '\r' \|\| c == '\t');	2297	while (is_one_of (WHITESPACE, c));
2292		2298
2293	/* record it */	2299	/* record it */
2294	#if SHOW_ERROR_LINE	2300	#if SHOW_ERROR_LINE
2295	if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)	2301	if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)
2296	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;	2302	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;
2297	#endif	2303	#endif
2298		2304
2299	if (c != EOF)
2300	{
2301	backchar (SCHEME_A_ c);	2305	backchar (SCHEME_A_ c);
2302	return 1;	2306	return 1;
2303	}
2304	else
2305	return EOF;
2306	}	2307	}
2307		2308
2308	/* get token */	2309	/* get token */
2309	static int	2310	static int
2310	token (SCHEME_P)	2311	token (SCHEME_P)
…		…
2326	return TOK_RPAREN;	2327	return TOK_RPAREN;
2327		2328
2328	case '.':	2329	case '.':
2329	c = inchar (SCHEME_A);	2330	c = inchar (SCHEME_A);
2330		2331
2331	if (is_one_of (" \n\t", c))	2332	if (is_one_of (WHITESPACE, c))
2332	return TOK_DOT;	2333	return TOK_DOT;
2333	else	2334	else
2334	{	2335	{
2335	//TODO: ungetc twice in a row is not supported in C
2336	backchar (SCHEME_A_ c);	2336	backchar (SCHEME_A_ c);
2337	backchar (SCHEME_A_ '.');
2338	return TOK_ATOM;	2337	return TOK_DOTATOM;
2339	}	2338	}
		2339
		2340	case '\|':
		2341	return TOK_STRATOM;
2340		2342
2341	case '\'':	2343	case '\'':
2342	return TOK_QUOTE;	2344	return TOK_QUOTE;
2343		2345
2344	case ';':	2346	case ';':
…		…
2476	}	2478	}
2477		2479
2478	putcharacter (SCHEME_A_ '"');	2480	putcharacter (SCHEME_A_ '"');
2479	}	2481	}
2480		2482
2481
2482	/* print atoms */	2483	/* print atoms */
2483	static void	2484	static void
2484	printatom (SCHEME_P_ pointer l, int f)	2485	printatom (SCHEME_P_ pointer l, int f)
2485	{	2486	{
2486	char *p;	2487	char *p;
2487	int len;	2488	int len;
2488		2489
2489	atom2str (SCHEME_A_ l, f, &p, &len);	2490	atom2str (SCHEME_A_ l, f, &p, &len);
2490	putchars (SCHEME_A_ p, len);	2491	putchars (SCHEME_A_ p, len);
2491	}	2492	}
2492
2493		2493
2494	/* Uses internal buffer unless string pointer is already available */	2494	/* Uses internal buffer unless string pointer is already available */
2495	static void	2495	static void
2496	atom2str (SCHEME_P_ pointer l, int f, char *pp, int plen)	2496	atom2str (SCHEME_P_ pointer l, int f, char *pp, int plen)
2497	{	2497	{
…		…
2658	#endif	2658	#endif
2659	}	2659	}
2660	else if (is_continuation (l))	2660	else if (is_continuation (l))
2661	p = "#<CONTINUATION>";	2661	p = "#<CONTINUATION>";
2662	else	2662	else
		2663	{
		2664	#if USE_PRINTF
		2665	p = SCHEME_V->strbuff;
		2666	snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l));
		2667	#else
2663	p = "#<ERROR>";	2668	p = "#<ERROR>";
		2669	#endif
		2670	}
2664		2671
2665	*pp = p;	2672	*pp = p;
2666	*plen = strlen (p);	2673	*plen = strlen (p);
2667	}	2674	}
2668		2675
…		…
2812	/* () is #t in R5RS */	2819	/* () is #t in R5RS */
2813	#define is_true(p) ((p) != S_F)	2820	#define is_true(p) ((p) != S_F)
2814	#define is_false(p) ((p) == S_F)	2821	#define is_false(p) ((p) == S_F)
2815		2822
2816	/* ========== Environment implementation ========== */	2823	/* ========== Environment implementation ========== */
2817
2818	#if !defined(USE_ALIST_ENV) \|\| !defined(USE_OBJECT_LIST)
2819
2820	static int
2821	hash_fn (const char *key, int table_size)
2822	{
2823	const unsigned char *p = key;
2824	uint32_t hash = 2166136261;
2825
2826	while (*p)
2827	hash = (hash ^ p++) 16777619;
2828
2829	return hash % table_size;
2830	}
2831	#endif
2832		2824
2833	#ifndef USE_ALIST_ENV	2825	#ifndef USE_ALIST_ENV
2834		2826
2835	/*	2827	/*
2836	* In this implementation, each frame of the environment may be	2828	* In this implementation, each frame of the environment may be
…		…
2853		2845
2854	SCHEME_V->envir = immutable_cons (new_frame, old_env);	2846	SCHEME_V->envir = immutable_cons (new_frame, old_env);
2855	setenvironment (SCHEME_V->envir);	2847	setenvironment (SCHEME_V->envir);
2856	}	2848	}
2857		2849
		2850	static uint32_t
		2851	sym_hash (pointer sym, uint32_t size)
		2852	{
		2853	uintptr_t ptr = (uintptr_t)sym;
		2854
		2855	#if 0
		2856	/* table size is prime, so why mix */
		2857	ptr += ptr >> 32;
		2858	ptr += ptr >> 16;
		2859	ptr += ptr >> 8;
		2860	#endif
		2861
		2862	return ptr % size;
		2863	}
		2864
2858	ecb_inline void	2865	ecb_inline void
2859	new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)	2866	new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2860	{	2867	{
2861	pointer slot = immutable_cons (variable, value);	2868	pointer slot = immutable_cons (variable, value);
2862		2869
2863	if (is_vector (car (env)))	2870	if (is_vector (car (env)))
2864	{	2871	{
2865	int location = hash_fn (symname (variable), veclength (car (env)));	2872	int location = sym_hash (variable, veclength (car (env)));
2866
2867	vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));	2873	vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2868	}	2874	}
2869	else	2875	else
2870	set_car (env, immutable_cons (slot, car (env)));	2876	set_car (env, immutable_cons (slot, car (env)));
2871	}	2877	}
2872		2878
2873	static pointer	2879	static pointer
2874	find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)	2880	find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2875	{	2881	{
2876	pointer x, y;	2882	pointer x, y;
2877	int location;
2878		2883
2879	for (x = env; x != NIL; x = cdr (x))	2884	for (x = env; x != NIL; x = cdr (x))
2880	{	2885	{
2881	if (is_vector (car (x)))	2886	if (is_vector (car (x)))
2882	{	2887	{
2883	location = hash_fn (symname (hdl), veclength (car (x)));	2888	int location = sym_hash (hdl, veclength (car (x)));
2884	y = vector_get (car (x), location);	2889	y = vector_get (car (x), location);
2885	}	2890	}
2886	else	2891	else
2887	y = car (x);	2892	y = car (x);
2888		2893
…		…
2925	for (y = car (x); y != NIL; y = cdr (y))	2930	for (y = car (x); y != NIL; y = cdr (y))
2926	if (caar (y) == hdl)	2931	if (caar (y) == hdl)
2927	break;	2932	break;
2928		2933
2929	if (y != NIL)	2934	if (y != NIL)
		2935	return car (y);
2930	break;	2936	break;
2931		2937
2932	if (!all)	2938	if (!all)
2933	return NIL;	2939	break;
2934	}	2940	}
2935
2936	if (x != NIL)
2937	return car (y);
2938		2941
2939	return NIL;	2942	return NIL;
2940	}	2943	}
2941		2944
2942	#endif /* USE_ALIST_ENV else */	2945	#endif /* USE_ALIST_ENV else */
2943		2946
2944	ecb_inline void	2947	ecb_inline void
2945	new_slot_in_env (SCHEME_P_ pointer variable, pointer value)	2948	new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2946	{	2949	{
		2950	assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2947	new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);	2951	new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2948	}	2952	}
2949		2953
2950	ecb_inline void	2954	ecb_inline void
2951	set_slot_in_env (SCHEME_P_ pointer slot, pointer value)	2955	set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
…		…
3243		3247
3244	#endif	3248	#endif
3245		3249
3246	#define s_retbool(tf) s_return ((tf) ? S_T : S_F)	3250	#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3247		3251
		3252	#if EXPERIMENT
		3253	static int
		3254	debug (SCHEME_P_ int indent, pointer x)
		3255	{
		3256	int c;
		3257
		3258	if (is_syntax (x))
		3259	{
		3260	printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x));
		3261	return 8 + 8;
		3262	}
		3263
		3264	if (x == NIL)
		3265	{
		3266	printf ("%*sNIL\n", indent, "");
		3267	return 3;
		3268	}
		3269
		3270	switch (type (x))
		3271	{
		3272	case T_INTEGER:
		3273	printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x);
		3274	return 32+8;
		3275
		3276	case T_SYMBOL:
		3277	printf ("%*sS<%s>\n", indent, "", symname (x));
		3278	return 24+8;
		3279
		3280	case T_CLOSURE:
		3281	printf ("%*sS<%s>\n", indent, "", "closure");
		3282	debug (SCHEME_A_ indent + 3, cdr(x));
		3283	return 32 + debug (SCHEME_A_ indent + 3, car (x));
		3284
		3285	case T_PAIR:
		3286	printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
		3287	c = debug (SCHEME_A_ indent + 3, car (x));
		3288	c += debug (SCHEME_A_ indent + 3, cdr (x));
		3289	return c + 1;
		3290
		3291	case T_PORT:
		3292	printf ("%*sS<%s>\n", indent, "", "port");
		3293	return 24+8;
		3294
		3295	case T_VECTOR:
		3296	printf ("%*sS<%s>\n", indent, "", "vector");
		3297	return 24+8;
		3298
		3299	case T_ENVIRONMENT:
		3300	printf ("%*sS<%s>\n", indent, "", "environment");
		3301	return 0 + debug (SCHEME_A_ indent + 3, car (x));
		3302
		3303	default:
		3304	printf ("unhandled type %d\n", type (x));
		3305	break;
		3306	}
		3307	}
		3308	#endif
		3309
3248	static int	3310	static int
3249	opexe_0 (SCHEME_P_ enum scheme_opcodes op)	3311	opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3250	{	3312	{
3251	pointer args = SCHEME_V->args;	3313	pointer args = SCHEME_V->args;
3252	pointer x, y;	3314	pointer x, y;
3253		3315
3254	switch (op)	3316	switch (op)
3255	{	3317	{
		3318	#if EXPERIMENT //D
		3319	case OP_DEBUG:
		3320	printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8);
		3321	printf ("\n");
		3322	s_return (S_T);
		3323	#endif
3256	case OP_LOAD: /* load */	3324	case OP_LOAD: /* load */
3257	if (file_interactive (SCHEME_A))	3325	if (file_interactive (SCHEME_A))
3258	{	3326	{
3259	xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");	3327	xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");
3260	//D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));	3328	//D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
…		…
3383	}	3451	}
3384	else	3452	else
3385	s_return (SCHEME_V->code);	3453	s_return (SCHEME_V->code);
3386		3454
3387	case OP_E0ARGS: /* eval arguments */	3455	case OP_E0ARGS: /* eval arguments */
3388	if (is_macro (SCHEME_V->value)) /* macro expansion */	3456	if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3389	{	3457	{
3390	s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);	3458	s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3391	SCHEME_V->args = cons (SCHEME_V->code, NIL);	3459	SCHEME_V->args = cons (SCHEME_V->code, NIL);
3392	SCHEME_V->code = SCHEME_V->value;	3460	SCHEME_V->code = SCHEME_V->value;
3393	s_goto (OP_APPLY);	3461	s_goto (OP_APPLY);
…		…
4391	}	4459	}
4392		4460
4393	case OP_VECLEN: /* vector-length */	4461	case OP_VECLEN: /* vector-length */
4394	s_return (mk_integer (SCHEME_A_ veclength (x)));	4462	s_return (mk_integer (SCHEME_A_ veclength (x)));
4395		4463
		4464	case OP_VECRESIZE:
		4465	vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
		4466	s_return (x);
		4467
4396	case OP_VECREF: /* vector-ref */	4468	case OP_VECREF: /* vector-ref */
4397	{	4469	{
4398	int index = ivalue_unchecked (cadr (args));	4470	int index = ivalue_unchecked (cadr (args));
4399		4471
4400	if (index >= veclength (car (args)) && USE_ERROR_CHECKING)	4472	if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
…		…
4460	pointer d = cdr (args);	4532	pointer d = cdr (args);
4461	int r;	4533	int r;
4462		4534
4463	switch (op)	4535	switch (op)
4464	{	4536	{
4465	case OP_NOT: /* not */ r = is_false (a) ; break;	4537	case OP_NOT: /* not */ r = is_false (a) ; break;
4466	case OP_BOOLP: /* boolean? */ r = a == S_F \|\| a == S_T; break;	4538	case OP_BOOLP: /* boolean? */ r = a == S_F \|\| a == S_T ; break;
4467	case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;	4539	case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4468	case OP_NULLP: /* null? */ r = a == NIL ; break;	4540	case OP_NULLP: /* null? */ r = a == NIL ; break;
4469	case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;	4541	case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
		4542	case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break;
4470	case OP_NUMBERP: /* number? */ r = is_number (a) ; break;	4543	case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4471	case OP_STRINGP: /* string? */ r = is_string (a) ; break;	4544	case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4472	case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;	4545	case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4473	case OP_REALP: /* real? / r = is_number (a) ; break; / all numbers are real */	4546	case OP_REALP: /* real? / r = is_number (a) ; break; / all numbers are real */
4474	case OP_CHARP: /* char? */ r = is_character (a) ; break;	4547	case OP_CHARP: /* char? */ r = is_character (a) ; break;
4475		4548
4476	#if USE_CHAR_CLASSIFIERS	4549	#if USE_CHAR_CLASSIFIERS
4477	case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;	4550	case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4478	case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;	4551	case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4479	case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;	4552	case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
…		…
4955	s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);	5028	s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
4956	SCHEME_V->tok = token (SCHEME_A);	5029	SCHEME_V->tok = token (SCHEME_A);
4957	s_goto (OP_RDSEXPR);	5030	s_goto (OP_RDSEXPR);
4958		5031
4959	case TOK_ATOM:	5032	case TOK_ATOM:
4960	s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS)));	5033	s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
		5034
		5035	case TOK_DOTATOM:
		5036	SCHEME_V->strbuff[0] = '.';
		5037	s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
		5038
		5039	case TOK_STRATOM:
		5040	x = readstrexp (SCHEME_A_ '\|');
		5041	//TODO: haven't checked whether the garbage collector could interfere
		5042	s_return (mk_atom (SCHEME_A_ strvalue (x)));
4961		5043
4962	case TOK_DQUOTE:	5044	case TOK_DQUOTE:
4963	x = readstrexp (SCHEME_A);	5045	x = readstrexp (SCHEME_A_ '"');
4964		5046
4965	if (x == S_F)	5047	if (x == S_F)
4966	Error_0 ("Error reading string");	5048	Error_0 ("Error reading string");
4967		5049
4968	setimmutable (x);	5050	setimmutable (x);
…		…
4980	s_goto (OP_EVAL);	5062	s_goto (OP_EVAL);
4981	}	5063	}
4982	}	5064	}
4983		5065
4984	case TOK_SHARP_CONST:	5066	case TOK_SHARP_CONST:
4985	if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL)	5067	if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
4986	Error_0 ("undefined sharp expression");	5068	Error_0 ("undefined sharp expression");
4987	else	5069	else
4988	s_return (x);	5070	s_return (x);
4989		5071
4990	default:	5072	default:
…		…
5212		5294
5213	case OP_CLOSUREP: /* closure? */	5295	case OP_CLOSUREP: /* closure? */
5214	/*	5296	/*
5215	* Note, macro object is also a closure.	5297	* Note, macro object is also a closure.
5216	* Therefore, (closure? <#MACRO>) ==> #t	5298	* Therefore, (closure? <#MACRO>) ==> #t
		5299	* (schmorp) well, obviously not, fix? TODO
5217	*/	5300	*/
5218	s_retbool (is_closure (a));	5301	s_retbool (is_closure (a));
5219		5302
5220	case OP_MACROP: /* macro? */	5303	case OP_MACROP: /* macro? */
5221	s_retbool (is_macro (a));	5304	s_retbool (is_macro (a));
…		…
5462		5545
5463	/* Hard-coded for the given keywords. Remember to rewrite if more are added! */	5546	/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5464	static int	5547	static int
5465	syntaxnum (pointer p)	5548	syntaxnum (pointer p)
5466	{	5549	{
5467	const char *s = strvalue (car (p));	5550	const char *s = strvalue (p);
5468		5551
5469	switch (strlength (car (p)))	5552	switch (strlength (p))
5470	{	5553	{
5471	case 2:	5554	case 2:
5472	if (s[0] == 'i')	5555	if (s[0] == 'i')
5473	return OP_IF0; /* if */	5556	return OP_IF0; /* if */
5474	else	5557	else
…		…
5910	# endif	5993	# endif
5911	int fin;	5994	int fin;
5912	char *file_name = InitFile;	5995	char *file_name = InitFile;
5913	int retcode;	5996	int retcode;
5914	int isfile = 1;	5997	int isfile = 1;
		5998	system ("ps v $PPID");//D
5915		5999
5916	if (argc == 2 && strcmp (argv[1], "-?") == 0)	6000	if (argc == 2 && strcmp (argv[1], "-?") == 0)
5917	{	6001	{
5918	xwrstr ("Usage: tinyscheme -?\n");	6002	xwrstr ("Usage: tinyscheme -?\n");
5919	xwrstr ("or: tinyscheme [<file1> <file2> ...]\n");	6003	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.29 by root, Sat Nov 28 10:31:06 2015 UTC vs. Revision 1.44 by root, Mon Nov 30 06:49:11 2015 UTC

Diff Legend

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.29 by root, Sat Nov 28 10:31:06 2015 UTC vs.
Revision 1.44 by root, Mon Nov 30 06:49:11 2015 UTC