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

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.47 by root, Mon Nov 30 09:25:19 2015 UTC vs.
Revision 1.57 by root, Tue Dec 1 04:57:49 2015 UTC

…		…
18	*	18	*
19	*/	19	*/
20		20
21	#define EXPERIMENT 1	21	#define EXPERIMENT 1
22		22
		23	#if 1
23	#define PAGE_SIZE 4096 /* does not work on sparc/alpha */	24	#define PAGE_SIZE 4096 /* does not work on sparc/alpha */
24	#include "malloc.c"	25	#include "malloc.c"
		26	#endif
25		27
26	#define SCHEME_SOURCE	28	#define SCHEME_SOURCE
27	#include "scheme-private.h"	29	#include "scheme-private.h"
28	#ifndef WIN32	30	#ifndef WIN32
29	# include <unistd.h>	31	# include <unistd.h>
…		…
79		81
80	#define BACKQUOTE '`'	82	#define BACKQUOTE '`'
81	#define WHITESPACE " \t\r\n\v\f"	83	#define WHITESPACE " \t\r\n\v\f"
82	#define DELIMITERS "()\";" WHITESPACE	84	#define DELIMITERS "()\";" WHITESPACE
83		85
84	#define NIL (&SCHEME_V->xNIL) //TODO: make this 0?	86	#define NIL POINTER (&SCHEME_V->xNIL)
85	#define S_T (&SCHEME_V->xT) //TODO: magic ptr value?	87	#define S_T POINTER (&SCHEME_V->xT)
86	#define S_F (&SCHEME_V->xF) //TODO: magic ptr value?	88	#define S_F POINTER (&SCHEME_V->xF)
87	#define S_SINK (&SCHEME_V->xsink)	89	#define S_SINK POINTER (&SCHEME_V->xsink)
88	#define S_EOF (&SCHEME_V->xEOF_OBJ)	90	#define S_EOF POINTER (&SCHEME_V->xEOF_OBJ)
89		91
90	#if !USE_MULTIPLICITY	92	#if !USE_MULTIPLICITY
91	static scheme sc;	93	static scheme sc;
92	#endif	94	#endif
93		95
…		…
101	}	103	}
102		104
103	char *p = s;	105	char *p = s;
104		106
105	do {	107	do {
106	*p++ = '0' + n % base;	108	*p++ = "0123456789abcdef"[n % base];
107	n /= base;	109	n /= base;
108	} while (n);	110	} while (n);
109		111
110	*p-- = 0;	112	*p-- = 0;
111		113
…		…
121	{	123	{
122	xbase (s, n, 10);	124	xbase (s, n, 10);
123	}	125	}
124		126
125	static void	127	static void
126	xwrstr (const char *s)	128	putnum (SCHEME_P_ long n)
127	{
128	write (1, s, strlen (s));
129	}
130
131	static void
132	xwrnum (long n)
133	{	129	{
134	char buf[64];	130	char buf[64];
135		131
136	xnum (buf, n);	132	xnum (buf, n);
137	xwrstr (buf);	133	putstr (SCHEME_A_ buf);
138	}	134	}
139		135
140	static char	136	static char
141	xtoupper (char c)	137	xtoupper (char c)
142	{	138	{
…		…
192	# define prompt "ts> "	188	# define prompt "ts> "
193	#endif	189	#endif
194		190
195	#ifndef InitFile	191	#ifndef InitFile
196	# define InitFile "init.scm"	192	# define InitFile "init.scm"
197	#endif
198
199	#ifndef FIRST_CELLSEGS
200	# define FIRST_CELLSEGS 3
201	#endif	193	#endif
202		194
203	enum scheme_types	195	enum scheme_types
204	{	196	{
205	T_INTEGER,	197	T_INTEGER,
…		…
258	static num num_op (enum num_op op, num a, num b);	250	static num num_op (enum num_op op, num a, num b);
259	static num num_intdiv (num a, num b);	251	static num num_intdiv (num a, num b);
260	static num num_rem (num a, num b);	252	static num num_rem (num a, num b);
261	static num num_mod (num a, num b);	253	static num num_mod (num a, num b);
262		254
263	#if USE_MATH
264	static double round_per_R5RS (double x);
265	#endif
266	static int is_zero_rvalue (RVALUE x);	255	static int is_zero_rvalue (RVALUE x);
267		256
268	static num num_zero;	257	static num num_zero;
269	static num num_one;	258	static num num_one;
270		259
		260	/* convert "pointer" to cell* / cell* to pointer */
		261	#define CELL(p) ((struct cell *)(p) + 0)
		262	#define POINTER(c) ((void *)((c) - 0))
		263
271	/* macros for cell operations */	264	/* macros for cell operations */
272	#define typeflag(p) ((p)->flag + 0)	265	#define typeflag(p) (CELL(p)->flag + 0)
273	#define set_typeflag(p,v) ((p)->flag = (v))	266	#define set_typeflag(p,v) (CELL(p)->flag = (v))
274	#define type(p) (typeflag (p) & T_MASKTYPE)	267	#define type(p) (typeflag (p) & T_MASKTYPE)
275		268
276	INTERFACE int	269	INTERFACE int
277	is_string (pointer p)	270	is_string (pointer p)
278	{	271	{
279	return type (p) == T_STRING;	272	return type (p) == T_STRING;
280	}	273	}
281		274
282	#define strvalue(p) ((p)->object.string.svalue)	275	#define strvalue(p) (CELL(p)->object.string.svalue)
283	#define strlength(p) ((p)->object.string.length)	276	#define strlength(p) (CELL(p)->object.string.length)
284		277
285	INTERFACE int	278	INTERFACE int
286	is_vector (pointer p)	279	is_vector (pointer p)
287	{	280	{
288	return type (p) == T_VECTOR;	281	return type (p) == T_VECTOR;
289	}	282	}
290		283
291	#define vecvalue(p) ((p)->object.vector.vvalue)	284	#define vecvalue(p) (CELL(p)->object.vector.vvalue)
292	#define veclength(p) ((p)->object.vector.length)	285	#define veclength(p) (CELL(p)->object.vector.length)
293	INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);	286	INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
294	INTERFACE pointer vector_get (pointer vec, uint32_t ielem);	287	INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
295	INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);	288	INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
296		289
297	INTERFACE int	290	INTERFACE int
…		…
323	string_value (pointer p)	316	string_value (pointer p)
324	{	317	{
325	return strvalue (p);	318	return strvalue (p);
326	}	319	}
327		320
328	#define ivalue_unchecked(p) (p)->object.ivalue	321	#define ivalue_unchecked(p) CELL(p)->object.ivalue
329	#define set_ivalue(p,v) (p)->object.ivalue = (v)	322	#define set_ivalue(p,v) CELL(p)->object.ivalue = (v)
330		323
331	#if USE_REAL	324	#if USE_REAL
332	#define rvalue_unchecked(p) (p)->object.rvalue	325	#define rvalue_unchecked(p) CELL(p)->object.rvalue
333	#define set_rvalue(p,v) (p)->object.rvalue = (v)	326	#define set_rvalue(p,v) CELL(p)->object.rvalue = (v)
334	#else	327	#else
335	#define rvalue_unchecked(p) (p)->object.ivalue	328	#define rvalue_unchecked(p) CELL(p)->object.ivalue
336	#define set_rvalue(p,v) (p)->object.ivalue = (v)	329	#define set_rvalue(p,v) CELL(p)->object.ivalue = (v)
337	#endif	330	#endif
338		331
339	INTERFACE long	332	INTERFACE long
340	charvalue (pointer p)	333	charvalue (pointer p)
341	{	334	{
342	return ivalue_unchecked (p);	335	return ivalue_unchecked (p);
343	}	336	}
344		337
		338	#define port(p) CELL(p)->object.port
		339	#define set_port(p,v) port(p) = (v)
345	INTERFACE int	340	INTERFACE int
346	is_port (pointer p)	341	is_port (pointer p)
347	{	342	{
348	return type (p) == T_PORT;	343	return type (p) == T_PORT;
349	}	344	}
350		345
351	INTERFACE int	346	INTERFACE int
352	is_inport (pointer p)	347	is_inport (pointer p)
353	{	348	{
354	return is_port (p) && p->object.port->kind & port_input;	349	return is_port (p) && port (p)->kind & port_input;
355	}	350	}
356		351
357	INTERFACE int	352	INTERFACE int
358	is_outport (pointer p)	353	is_outport (pointer p)
359	{	354	{
360	return is_port (p) && p->object.port->kind & port_output;	355	return is_port (p) && port (p)->kind & port_output;
361	}	356	}
362		357
363	INTERFACE int	358	INTERFACE int
364	is_pair (pointer p)	359	is_pair (pointer p)
365	{	360	{
366	return type (p) == T_PAIR;	361	return type (p) == T_PAIR;
367	}	362	}
368		363
369	#define car(p) ((p)->object.cons.car + 0)	364	#define car(p) (POINTER (CELL(p)->object.cons.car))
370	#define cdr(p) ((p)->object.cons.cdr + 0)	365	#define cdr(p) (POINTER (CELL(p)->object.cons.cdr))
371		366
372	static pointer caar (pointer p) { return car (car (p)); }	367	static pointer caar (pointer p) { return car (car (p)); }
373	static pointer cadr (pointer p) { return car (cdr (p)); }	368	static pointer cadr (pointer p) { return car (cdr (p)); }
374	static pointer cdar (pointer p) { return cdr (car (p)); }	369	static pointer cdar (pointer p) { return cdr (car (p)); }
375	static pointer cddr (pointer p) { return cdr (cdr (p)); }	370	static pointer cddr (pointer p) { return cdr (cdr (p)); }
…		…
379	static pointer cdaar (pointer p) { return cdr (car (car (p))); }	374	static pointer cdaar (pointer p) { return cdr (car (car (p))); }
380		375
381	INTERFACE void	376	INTERFACE void
382	set_car (pointer p, pointer q)	377	set_car (pointer p, pointer q)
383	{	378	{
384	p->object.cons.car = q;	379	CELL(p)->object.cons.car = CELL (q);
385	}	380	}
386		381
387	INTERFACE void	382	INTERFACE void
388	set_cdr (pointer p, pointer q)	383	set_cdr (pointer p, pointer q)
389	{	384	{
390	p->object.cons.cdr = q;	385	CELL(p)->object.cons.cdr = CELL (q);
391	}	386	}
392		387
393	INTERFACE pointer	388	INTERFACE pointer
394	pair_car (pointer p)	389	pair_car (pointer p)
395	{	390	{
…		…
670		665
671	static int file_push (SCHEME_P_ const char *fname);	666	static int file_push (SCHEME_P_ const char *fname);
672	static void file_pop (SCHEME_P);	667	static void file_pop (SCHEME_P);
673	static int file_interactive (SCHEME_P);	668	static int file_interactive (SCHEME_P);
674	ecb_inline int is_one_of (const char *s, int c);	669	ecb_inline int is_one_of (const char *s, int c);
675	static int alloc_cellseg (SCHEME_P_ int n);	670	static int alloc_cellseg (SCHEME_P);
676	ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);	671	ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
677	static void finalize_cell (SCHEME_P_ pointer a);	672	static void finalize_cell (SCHEME_P_ pointer a);
678	static int count_consecutive_cells (pointer x, int needed);	673	static int count_consecutive_cells (pointer x, int needed);
679	static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);	674	static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
680	static pointer mk_number (SCHEME_P_ const num n);	675	static pointer mk_number (SCHEME_P_ const num n);
…		…
874	}	869	}
875		870
876	return ret;	871	return ret;
877	}	872	}
878		873
879	#if USE_MATH
880
881	/* Round to nearest. Round to even if midway */
882	static double
883	round_per_R5RS (double x)
884	{
885	double fl = floor (x);
886	double ce = ceil (x);
887	double dfl = x - fl;
888	double dce = ce - x;
889
890	if (dfl > dce)
891	return ce;
892	else if (dfl < dce)
893	return fl;
894	else
895	{
896	if (fmod (fl, 2) == 0) /* I imagine this holds */
897	return fl;
898	else
899	return ce;
900	}
901	}
902	#endif
903
904	static int	874	static int
905	is_zero_rvalue (RVALUE x)	875	is_zero_rvalue (RVALUE x)
906	{	876	{
907	return x == 0;	877	return x == 0;
908	#if 0	878	#if 0
…		…
914	#endif	884	#endif
915	}	885	}
916		886
917	/* allocate new cell segment */	887	/* allocate new cell segment */
918	static int	888	static int
919	alloc_cellseg (SCHEME_P_ int n)	889	alloc_cellseg (SCHEME_P)
920	{	890	{
921	pointer newp;	891	struct cell *newp;
922	pointer last;	892	struct cell *last;
923	pointer p;	893	struct cell *p;
924	char *cp;	894	char *cp;
925	long i;	895	long i;
926	int k;	896	int k;
927		897
928	static int segsize = CELL_SEGSIZE >> 1;	898	static int segsize = CELL_SEGSIZE >> 1;
929	segsize <<= 1;	899	segsize <<= 1;
930		900
931	for (k = 0; k < n; k++)
932	{
933	if (SCHEME_V->last_cell_seg >= CELL_NSEGMENT - 1)
934	return k;
935
936	cp = malloc (segsize * sizeof (struct cell));	901	cp = malloc (segsize * sizeof (struct cell));
937		902
938	if (!cp && USE_ERROR_CHECKING)	903	if (!cp && USE_ERROR_CHECKING)
939	return k;	904	return k;
940		905
941	i = ++SCHEME_V->last_cell_seg;	906	i = ++SCHEME_V->last_cell_seg;
942	SCHEME_V->alloc_seg[i] = cp;	907	SCHEME_V->alloc_seg[i] = cp;
943		908
944	newp = (pointer)cp;	909	newp = (struct cell *)cp;
945	SCHEME_V->cell_seg[i] = newp;	910	SCHEME_V->cell_seg[i] = newp;
946	SCHEME_V->cell_segsize[i] = segsize;	911	SCHEME_V->cell_segsize[i] = segsize;
947	SCHEME_V->fcells += segsize;	912	SCHEME_V->fcells += segsize;
948	last = newp + segsize - 1;	913	last = newp + segsize - 1;
949		914
950	for (p = newp; p <= last; p++)	915	for (p = newp; p <= last; p++)
951	{	916	{
		917	pointer cp = POINTER (p);
952	set_typeflag (p, T_PAIR);	918	set_typeflag (cp, T_PAIR);
953	set_car (p, NIL);	919	set_car (cp, NIL);
954	set_cdr (p, p + 1);	920	set_cdr (cp, POINTER (p + 1));
955	}	921	}
956		922
957	set_cdr (last, SCHEME_V->free_cell);	923	set_cdr (POINTER (last), SCHEME_V->free_cell);
958	SCHEME_V->free_cell = newp;	924	SCHEME_V->free_cell = POINTER (newp);
959	}
960		925
961	return n;	926	return 1;
962	}	927	}
963		928
964	/* get new cell. parameter a, b is marked by gc. */	929	/* get new cell. parameter a, b is marked by gc. */
965	ecb_inline pointer	930	ecb_inline pointer
966	get_cell_x (SCHEME_P_ pointer a, pointer b)	931	get_cell_x (SCHEME_P_ pointer a, pointer b)
…		…
977	gc (SCHEME_A_ a, b);	942	gc (SCHEME_A_ a, b);
978		943
979	if (SCHEME_V->fcells < min_to_be_recovered \|\| SCHEME_V->free_cell == NIL)	944	if (SCHEME_V->fcells < min_to_be_recovered \|\| SCHEME_V->free_cell == NIL)
980	{	945	{
981	/* if only a few recovered, get more to avoid fruitless gc's */	946	/* if only a few recovered, get more to avoid fruitless gc's */
982	if (!alloc_cellseg (SCHEME_A_ 1) && SCHEME_V->free_cell == NIL)	947	if (!alloc_cellseg (SCHEME_A) && SCHEME_V->free_cell == NIL)
983	{	948	{
984	#if USE_ERROR_CHECKING	949	#if USE_ERROR_CHECKING
985	SCHEME_V->no_memory = 1;	950	SCHEME_V->no_memory = 1;
986	return S_SINK;	951	return S_SINK;
987	#endif	952	#endif
…		…
999	}	964	}
1000	}	965	}
1001		966
1002	/* To retain recent allocs before interpreter knows about them -	967	/* To retain recent allocs before interpreter knows about them -
1003	Tehom */	968	Tehom */
1004
1005	static void	969	static void
1006	push_recent_alloc (SCHEME_P_ pointer recent, pointer extra)	970	push_recent_alloc (SCHEME_P_ pointer recent, pointer extra)
1007	{	971	{
1008	pointer holder = get_cell_x (SCHEME_A_ recent, extra);	972	pointer holder = get_cell_x (SCHEME_A_ recent, extra);
1009		973
…		…
1040	return S_SINK;	1004	return S_SINK;
1041		1005
1042	/* Record it as a vector so that gc understands it. */	1006	/* Record it as a vector so that gc understands it. */
1043	set_typeflag (v, T_VECTOR \| T_ATOM);	1007	set_typeflag (v, T_VECTOR \| T_ATOM);
1044		1008
1045	v->object.vector.vvalue = e;	1009	CELL(v)->object.vector.vvalue = e;
1046	v->object.vector.length = len;	1010	CELL(v)->object.vector.length = len;
1047	fill_vector (v, 0, init);	1011	fill_vector (v, 0, init);
1048	push_recent_alloc (SCHEME_A_ v, NIL);	1012	push_recent_alloc (SCHEME_A_ v, NIL);
1049		1013
1050	return v;	1014	return v;
1051	}	1015	}
…		…
1060	static void	1024	static void
1061	check_cell_alloced (pointer p, int expect_alloced)	1025	check_cell_alloced (pointer p, int expect_alloced)
1062	{	1026	{
1063	/* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */	1027	/* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */
1064	if (typeflag (p) & !expect_alloced)	1028	if (typeflag (p) & !expect_alloced)
1065	xwrstr ("Cell is already allocated!\n");	1029	putstr (SCHEME_A_ "Cell is already allocated!\n");
1066		1030
1067	if (!(typeflag (p)) & expect_alloced)	1031	if (!(typeflag (p)) & expect_alloced)
1068	xwrstr ("Cell is not allocated!\n");	1032	putstr (SCHEME_A_ "Cell is not allocated!\n");
1069	}	1033	}
1070		1034
1071	static void	1035	static void
1072	check_range_alloced (pointer p, int n, int expect_alloced)	1036	check_range_alloced (pointer p, int n, int expect_alloced)
1073	{	1037	{
…		…
1201		1165
1202	/* returns the new symbol */	1166	/* returns the new symbol */
1203	static pointer	1167	static pointer
1204	oblist_add_by_name (SCHEME_P_ const char *name)	1168	oblist_add_by_name (SCHEME_P_ const char *name)
1205	{	1169	{
1206	pointer x = mk_string (SCHEME_A_ name);	1170	pointer x = generate_symbol (SCHEME_A_ name);
1207	set_typeflag (x, T_SYMBOL);
1208	setimmutable (x);
1209	SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);	1171	SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1210	return x;	1172	return x;
1211	}	1173	}
1212		1174
1213	static pointer	1175	static pointer
…		…
1223	mk_port (SCHEME_P_ port *p)	1185	mk_port (SCHEME_P_ port *p)
1224	{	1186	{
1225	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1187	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1226		1188
1227	set_typeflag (x, T_PORT \| T_ATOM);	1189	set_typeflag (x, T_PORT \| T_ATOM);
1228	x->object.port = p;	1190	set_port (x, p);
1229		1191
1230	return x;	1192	return x;
1231	}	1193	}
1232	#endif	1194	#endif
1233		1195
1234	pointer	1196	pointer
1235	mk_foreign_func (SCHEME_P_ foreign_func f)	1197	mk_foreign_func (SCHEME_P_ foreign_func f)
1236	{	1198	{
1237	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1199	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1238		1200
1239	set_typeflag (x, (T_FOREIGN \| T_ATOM));	1201	set_typeflag (x, T_FOREIGN \| T_ATOM);
1240	x->object.ff = f;	1202	CELL(x)->object.ff = f;
1241		1203
1242	return x;	1204	return x;
1243	}	1205	}
1244		1206
1245	INTERFACE pointer	1207	INTERFACE pointer
1246	mk_character (SCHEME_P_ int c)	1208	mk_character (SCHEME_P_ int c)
1247	{	1209	{
1248	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1210	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1249		1211
1250	set_typeflag (x, (T_CHARACTER \| T_ATOM));	1212	set_typeflag (x, T_CHARACTER \| T_ATOM);
1251	set_ivalue (x, c & 0xff);	1213	set_ivalue (x, c & 0xff);
1252		1214
1253	return x;	1215	return x;
1254	}	1216	}
1255		1217
1256	/* get number atom (integer) */	1218	/* get number atom (integer) */
1257	INTERFACE pointer	1219	INTERFACE pointer
1258	mk_integer (SCHEME_P_ long n)	1220	mk_integer (SCHEME_P_ long n)
1259	{	1221	{
		1222	pointer p = 0;
		1223	pointer *pp = &p;
		1224
		1225	#if USE_INTCACHE
		1226	if (n >= INTCACHE_MIN && n <= INTCACHE_MAX)
		1227	pp = &SCHEME_V->intcache[n - INTCACHE_MIN];
		1228	#endif
		1229
		1230	if (!*pp)
		1231	{
1260	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1232	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1261		1233
1262	set_typeflag (x, (T_INTEGER \| T_ATOM));	1234	set_typeflag (x, T_INTEGER \| T_ATOM);
		1235	setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */
1263	set_ivalue (x, n);	1236	set_ivalue (x, n);
1264		1237
		1238	*pp = x;
		1239	}
		1240
1265	return x;	1241	return *pp;
1266	}	1242	}
1267		1243
1268	INTERFACE pointer	1244	INTERFACE pointer
1269	mk_real (SCHEME_P_ RVALUE n)	1245	mk_real (SCHEME_P_ RVALUE n)
1270	{	1246	{
1271	#if USE_REAL	1247	#if USE_REAL
1272	pointer x = get_cell (SCHEME_A_ NIL, NIL);	1248	pointer x = get_cell (SCHEME_A_ NIL, NIL);
1273		1249
1274	set_typeflag (x, (T_REAL \| T_ATOM));	1250	set_typeflag (x, T_REAL \| T_ATOM);
1275	set_rvalue (x, n);	1251	set_rvalue (x, n);
1276		1252
1277	return x;	1253	return x;
1278	#else	1254	#else
1279	return mk_integer (SCHEME_A_ n);	1255	return mk_integer (SCHEME_A_ n);
…		…
1499	return S_F;	1475	return S_F;
1500	else if (name == '\\') / #\w (character) */	1476	else if (name == '\\') / #\w (character) */
1501	{	1477	{
1502	int c;	1478	int c;
1503		1479
		1480	// TODO: optimise
1504	if (stricmp (name + 1, "space") == 0)	1481	if (stricmp (name + 1, "space") == 0)
1505	c = ' ';	1482	c = ' ';
1506	else if (stricmp (name + 1, "newline") == 0)	1483	else if (stricmp (name + 1, "newline") == 0)
1507	c = '\n';	1484	c = '\n';
1508	else if (stricmp (name + 1, "return") == 0)	1485	else if (stricmp (name + 1, "return") == 0)
1509	c = '\r';	1486	c = '\r';
1510	else if (stricmp (name + 1, "tab") == 0)	1487	else if (stricmp (name + 1, "tab") == 0)
1511	c = '\t';	1488	c = '\t';
		1489	else if (stricmp (name + 1, "alarm") == 0)
		1490	c = 0x07;
		1491	else if (stricmp (name + 1, "backspace") == 0)
		1492	c = 0x08;
		1493	else if (stricmp (name + 1, "escape") == 0)
		1494	c = 0x1b;
		1495	else if (stricmp (name + 1, "delete") == 0)
		1496	c = 0x7f;
		1497	else if (stricmp (name + 1, "null") == 0)
		1498	c = 0;
1512	else if (name[1] == 'x' && name[2] != 0)	1499	else if (name[1] == 'x' && name[2] != 0)
1513	{	1500	{
1514	long c1 = strtol (name + 2, 0, 16);	1501	long c1 = strtol (name + 2, 0, 16);
1515		1502
1516	if (0 <= c1 && c1 <= UCHAR_MAX)	1503	if (0 <= c1 && c1 <= UCHAR_MAX)
…		…
1622		1609
1623	/* garbage collection. parameter a, b is marked. */	1610	/* garbage collection. parameter a, b is marked. */
1624	static void	1611	static void
1625	gc (SCHEME_P_ pointer a, pointer b)	1612	gc (SCHEME_P_ pointer a, pointer b)
1626	{	1613	{
1627	pointer p;
1628	int i;	1614	int i;
1629		1615
1630	if (SCHEME_V->gc_verbose)	1616	if (SCHEME_V->gc_verbose)
1631	putstr (SCHEME_A_ "gc...");	1617	putstr (SCHEME_A_ "gc...");
1632		1618
…		…
1648	/* Mark recent objects the interpreter doesn't know about yet. */	1634	/* Mark recent objects the interpreter doesn't know about yet. */
1649	mark (car (S_SINK));	1635	mark (car (S_SINK));
1650	/* Mark any older stuff above nested C calls */	1636	/* Mark any older stuff above nested C calls */
1651	mark (SCHEME_V->c_nest);	1637	mark (SCHEME_V->c_nest);
1652		1638
		1639	#if USE_INTCACHE
		1640	/* mark intcache */
		1641	for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i)
		1642	if (SCHEME_V->intcache[i - INTCACHE_MIN])
		1643	mark (SCHEME_V->intcache[i - INTCACHE_MIN]);
		1644	#endif
		1645
1653	/* mark variables a, b */	1646	/* mark variables a, b */
1654	mark (a);	1647	mark (a);
1655	mark (b);	1648	mark (b);
1656		1649
1657	/* garbage collect */	1650	/* garbage collect */
1658	clrmark (NIL);	1651	clrmark (NIL);
1659	SCHEME_V->fcells = 0;	1652	SCHEME_V->fcells = 0;
1660	SCHEME_V->free_cell = NIL;	1653	SCHEME_V->free_cell = NIL;
1661		1654
1662	if (SCHEME_V->gc_verbose)	1655	if (SCHEME_V->gc_verbose)
1663	xwrstr ("freeing...");	1656	putstr (SCHEME_A_ "freeing...");
1664		1657
1665	uint32_t total = 0;	1658	uint32_t total = 0;
1666		1659
1667	/* Here we scan the cells to build the free-list. */	1660	/* Here we scan the cells to build the free-list. */
1668	for (i = SCHEME_V->last_cell_seg; i >= 0; i--)	1661	for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1669	{	1662	{
1670	pointer end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];	1663	struct cell *end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
		1664	struct cell *p;
1671	total += SCHEME_V->cell_segsize [i];	1665	total += SCHEME_V->cell_segsize [i];
1672		1666
1673	for (p = SCHEME_V->cell_seg[i]; p < end; ++p)	1667	for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1674	{	1668	{
		1669	pointer c = POINTER (p);
		1670
1675	if (is_mark (p))	1671	if (is_mark (c))
1676	clrmark (p);	1672	clrmark (c);
1677	else	1673	else
1678	{	1674	{
1679	/* reclaim cell */	1675	/* reclaim cell */
1680	if (typeflag (p) != T_PAIR)	1676	if (typeflag (c) != T_PAIR)
1681	{	1677	{
1682	finalize_cell (SCHEME_A_ p);	1678	finalize_cell (SCHEME_A_ c);
1683	set_typeflag (p, T_PAIR);	1679	set_typeflag (c, T_PAIR);
1684	set_car (p, NIL);	1680	set_car (c, NIL);
1685	}	1681	}
1686		1682
1687	++SCHEME_V->fcells;	1683	++SCHEME_V->fcells;
1688	set_cdr (p, SCHEME_V->free_cell);	1684	set_cdr (c, SCHEME_V->free_cell);
1689	SCHEME_V->free_cell = p;	1685	SCHEME_V->free_cell = c;
1690	}	1686	}
1691	}	1687	}
1692	}	1688	}
1693		1689
1694	if (SCHEME_V->gc_verbose)	1690	if (SCHEME_V->gc_verbose)
1695	{	1691	{
1696	xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" out of "); xwrnum (total); xwrstr (" cells were recovered.\n");	1692	putstr (SCHEME_A_ "done: "); putnum (SCHEME_A_ SCHEME_V->fcells); putstr (SCHEME_A_ " out of "); putnum (SCHEME_A_ total); putstr (SCHEME_A_ " cells were recovered.\n");
1697	}	1693	}
1698	}	1694	}
1699		1695
1700	static void	1696	static void
1701	finalize_cell (SCHEME_P_ pointer a)	1697	finalize_cell (SCHEME_P_ pointer a)
…		…
1706	else if (is_vector (a))	1702	else if (is_vector (a))
1707	free (vecvalue (a));	1703	free (vecvalue (a));
1708	#if USE_PORTS	1704	#if USE_PORTS
1709	else if (is_port (a))	1705	else if (is_port (a))
1710	{	1706	{
1711	if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit)	1707	if (port(a)->kind & port_file && port (a)->rep.stdio.closeit)
1712	port_close (SCHEME_A_ a, port_input \| port_output);	1708	port_close (SCHEME_A_ a, port_input \| port_output);
1713		1709
1714	free (a->object.port);	1710	free (port (a));
1715	}	1711	}
1716	#endif	1712	#endif
1717	}	1713	}
1718		1714
1719	/* ========== Routines for Reading ========== */	1715	/* ========== Routines for Reading ========== */
…		…
1735	SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1;	1731	SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1;
1736	SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file \| port_input;	1732	SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file \| port_input;
1737	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin;	1733	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin;
1738	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1;	1734	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1;
1739	SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0;	1735	SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0;
1740	SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i;	1736	set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i);
1741		1737
1742	#if SHOW_ERROR_LINE	1738	#if SHOW_ERROR_LINE
1743	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0;	1739	SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0;
1744		1740
1745	if (fname)	1741	if (fname)
…		…
1762	SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i];	1758	SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i];
1763	#if USE_PORTS	1759	#if USE_PORTS
1764	port_close (SCHEME_A_ SCHEME_V->loadport, port_input);	1760	port_close (SCHEME_A_ SCHEME_V->loadport, port_input);
1765	#endif	1761	#endif
1766	SCHEME_V->file_i--;	1762	SCHEME_V->file_i--;
1767	SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i;	1763	set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i);
1768	}	1764	}
1769	}	1765	}
1770		1766
1771	static int	1767	static int
1772	file_interactive (SCHEME_P)	1768	file_interactive (SCHEME_P)
1773	{	1769	{
1774	#if USE_PORTS	1770	#if USE_PORTS
1775	return SCHEME_V->file_i == 0	1771	return SCHEME_V->file_i == 0
1776	&& SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO	1772	&& SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO
1777	&& (SCHEME_V->inport->object.port->kind & port_file);	1773	&& (port (SCHEME_V->inport)->kind & port_file);
1778	#else	1774	#else
1779	return 0;	1775	return 0;
1780	#endif	1776	#endif
1781	}	1777	}
1782		1778
…		…
1916	}	1912	}
1917		1913
1918	static void	1914	static void
1919	port_close (SCHEME_P_ pointer p, int flag)	1915	port_close (SCHEME_P_ pointer p, int flag)
1920	{	1916	{
1921	port *pt = p->object.port;	1917	port *pt = port (p);
1922		1918
1923	pt->kind &= ~flag;	1919	pt->kind &= ~flag;
1924		1920
1925	if ((pt->kind & (port_input \| port_output)) == 0)	1921	if ((pt->kind & (port_input \| port_output)) == 0)
1926	{	1922	{
…		…
1947	/* get new character from input file */	1943	/* get new character from input file */
1948	static int	1944	static int
1949	inchar (SCHEME_P)	1945	inchar (SCHEME_P)
1950	{	1946	{
1951	int c;	1947	int c;
1952	port *pt;	1948	port *pt = port (SCHEME_V->inport);
1953
1954	pt = SCHEME_V->inport->object.port;
1955		1949
1956	if (pt->kind & port_saw_EOF)	1950	if (pt->kind & port_saw_EOF)
1957	return EOF;	1951	return EOF;
1958		1952
1959	c = basic_inchar (pt);	1953	c = basic_inchar (pt);
…		…
2026	port *pt;	2020	port *pt;
2027		2021
2028	if (c == EOF)	2022	if (c == EOF)
2029	return;	2023	return;
2030		2024
2031	pt = SCHEME_V->inport->object.port;	2025	pt = port (SCHEME_V->inport);
2032	pt->unget = c;	2026	pt->unget = c;
2033	#else	2027	#else
2034	if (c == EOF)	2028	if (c == EOF)
2035	return;	2029	return;
2036		2030
…		…
2064		2058
2065	INTERFACE void	2059	INTERFACE void
2066	putstr (SCHEME_P_ const char *s)	2060	putstr (SCHEME_P_ const char *s)
2067	{	2061	{
2068	#if USE_PORTS	2062	#if USE_PORTS
2069	port *pt = SCHEME_V->outport->object.port;	2063	port *pt = port (SCHEME_V->outport);
2070		2064
2071	if (pt->kind & port_file)	2065	if (pt->kind & port_file)
2072	write (pt->rep.stdio.file, s, strlen (s));	2066	write (pt->rep.stdio.file, s, strlen (s));
2073	else	2067	else
2074	for (; *s; s++)	2068	for (; *s; s++)
…		…
2076	pt->rep.string.curr++ = s;	2070	pt->rep.string.curr++ = s;
2077	else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))	2071	else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))
2078	pt->rep.string.curr++ = s;	2072	pt->rep.string.curr++ = s;
2079		2073
2080	#else	2074	#else
2081	xwrstr (s);	2075	write (pt->rep.stdio.file, s, strlen (s));
2082	#endif	2076	#endif
2083	}	2077	}
2084		2078
2085	static void	2079	static void
2086	putchars (SCHEME_P_ const char *s, int len)	2080	putchars (SCHEME_P_ const char *s, int len)
2087	{	2081	{
2088	#if USE_PORTS	2082	#if USE_PORTS
2089	port *pt = SCHEME_V->outport->object.port;	2083	port *pt = port (SCHEME_V->outport);
2090		2084
2091	if (pt->kind & port_file)	2085	if (pt->kind & port_file)
2092	write (pt->rep.stdio.file, s, len);	2086	write (pt->rep.stdio.file, s, len);
2093	else	2087	else
2094	{	2088	{
…		…
2108		2102
2109	INTERFACE void	2103	INTERFACE void
2110	putcharacter (SCHEME_P_ int c)	2104	putcharacter (SCHEME_P_ int c)
2111	{	2105	{
2112	#if USE_PORTS	2106	#if USE_PORTS
2113	port *pt = SCHEME_V->outport->object.port;	2107	port *pt = port (SCHEME_V->outport);
2114		2108
2115	if (pt->kind & port_file)	2109	if (pt->kind & port_file)
2116	{	2110	{
2117	char cc = c;	2111	char cc = c;
2118	write (pt->rep.stdio.file, &cc, 1);	2112	write (pt->rep.stdio.file, &cc, 1);
…		…
2192	case '7':	2186	case '7':
2193	state = st_oct1;	2187	state = st_oct1;
2194	c1 = c - '0';	2188	c1 = c - '0';
2195	break;	2189	break;
2196		2190
		2191	case 'a': *p++ = '\a'; state = st_ok; break;
		2192	case 'n': *p++ = '\n'; state = st_ok; break;
		2193	case 'r': *p++ = '\r'; state = st_ok; break;
		2194	case 't': *p++ = '\t'; state = st_ok; break;
		2195
		2196	//TODO: \whitespace eol whitespace
		2197
		2198	//TODO: x should end in ;, not two-digit hex
2197	case 'x':	2199	case 'x':
2198	case 'X':	2200	case 'X':
2199	state = st_x1;	2201	state = st_x1;
2200	c1 = 0;	2202	c1 = 0;
2201	break;
2202
2203	case 'n':
2204	*p++ = '\n';
2205	state = st_ok;
2206	break;
2207
2208	case 't':
2209	*p++ = '\t';
2210	state = st_ok;
2211	break;
2212
2213	case 'r':
2214	*p++ = '\r';
2215	state = st_ok;
2216	break;	2203	break;
2217		2204
2218	default:	2205	default:
2219	*p++ = c;	2206	*p++ = c;
2220	state = st_ok;	2207	state = st_ok;
…		…
3060	{	3047	{
3061	int nframes = (uintptr_t)SCHEME_V->dump;	3048	int nframes = (uintptr_t)SCHEME_V->dump;
3062	struct dump_stack_frame *next_frame;	3049	struct dump_stack_frame *next_frame;
3063		3050
3064	/* enough room for the next frame? */	3051	/* enough room for the next frame? */
3065	if (nframes >= SCHEME_V->dump_size)	3052	if (ecb_expect_false (nframes >= SCHEME_V->dump_size))
3066	{	3053	{
3067	SCHEME_V->dump_size += STACK_GROWTH;	3054	SCHEME_V->dump_size += STACK_GROWTH;
3068	SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size);	3055	SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size);
3069	}	3056	}
3070		3057
…		…
3326	s_return (S_T);	3313	s_return (S_T);
3327	#endif	3314	#endif
3328	case OP_LOAD: /* load */	3315	case OP_LOAD: /* load */
3329	if (file_interactive (SCHEME_A))	3316	if (file_interactive (SCHEME_A))
3330	{	3317	{
3331	xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");	3318	putstr (SCHEME_A_ "Loading "); putstr (SCHEME_A_ strvalue (car (args))); putstr (SCHEME_A_ "\n");
3332	//D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));	3319	//D fprintf (port (SCHEME_V->outport)->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
3333	}	3320	}
3334		3321
3335	if (!file_push (SCHEME_A_ strvalue (car (args))))	3322	if (!file_push (SCHEME_A_ strvalue (car (args))))
3336	Error_1 ("unable to open", car (args));	3323	Error_1 ("unable to open", car (args));
3337	else	3324	else
…		…
3341	}	3328	}
3342		3329
3343	case OP_T0LVL: /* top level */	3330	case OP_T0LVL: /* top level */
3344		3331
3345	/* If we reached the end of file, this loop is done. */	3332	/* If we reached the end of file, this loop is done. */
3346	if (SCHEME_V->loadport->object.port->kind & port_saw_EOF)	3333	if (port (SCHEME_V->loadport)->kind & port_saw_EOF)
3347	{	3334	{
3348	if (SCHEME_V->file_i == 0)	3335	if (SCHEME_V->file_i == 0)
3349	{	3336	{
3350	SCHEME_V->args = NIL;	3337	SCHEME_V->args = NIL;
3351	s_goto (OP_QUIT);	3338	s_goto (OP_QUIT);
…		…
3429	#endif	3416	#endif
3430	if (is_symbol (SCHEME_V->code)) /* symbol */	3417	if (is_symbol (SCHEME_V->code)) /* symbol */
3431	{	3418	{
3432	x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1);	3419	x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1);
3433		3420
3434	if (x != NIL)	3421	if (x == NIL)
3435	s_return (slot_value_in_env (x));
3436	else
3437	Error_1 ("eval: unbound variable:", SCHEME_V->code);	3422	Error_1 ("eval: unbound variable:", SCHEME_V->code);
		3423
		3424	s_return (slot_value_in_env (x));
3438	}	3425	}
3439	else if (is_pair (SCHEME_V->code))	3426	else if (is_pair (SCHEME_V->code))
3440	{	3427	{
3441	x = car (SCHEME_V->code);	3428	x = car (SCHEME_V->code);
3442		3429
…		…
3519	s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */	3506	s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3520	else if (is_foreign (SCHEME_V->code))	3507	else if (is_foreign (SCHEME_V->code))
3521	{	3508	{
3522	/* Keep nested calls from GC'ing the arglist */	3509	/* Keep nested calls from GC'ing the arglist */
3523	push_recent_alloc (SCHEME_A_ args, NIL);	3510	push_recent_alloc (SCHEME_A_ args, NIL);
3524	x = SCHEME_V->code->object.ff (SCHEME_A_ args);	3511	x = CELL(SCHEME_V->code)->object.ff (SCHEME_A_ args);
3525		3512
3526	s_return (x);	3513	s_return (x);
3527	}	3514	}
3528	else if (is_closure (SCHEME_V->code) \|\| is_macro (SCHEME_V->code) \|\| is_promise (SCHEME_V->code)) /* CLOSURE */	3515	else if (is_closure (SCHEME_V->code) \|\| is_macro (SCHEME_V->code) \|\| is_promise (SCHEME_V->code)) /* CLOSURE */
3529	{	3516	{
…		…
3566		3553
3567	case OP_DOMACRO: /* do macro */	3554	case OP_DOMACRO: /* do macro */
3568	SCHEME_V->code = SCHEME_V->value;	3555	SCHEME_V->code = SCHEME_V->value;
3569	s_goto (OP_EVAL);	3556	s_goto (OP_EVAL);
3570		3557
3571	#if 1
3572
3573	case OP_LAMBDA: /* lambda */	3558	case OP_LAMBDA: /* lambda */
3574	/* If the hook is defined, apply it to SCHEME_V->code, otherwise	3559	/* If the hook is defined, apply it to SCHEME_V->code, otherwise
3575	set SCHEME_V->value fall thru */	3560	set SCHEME_V->value fall thru */
3576	{	3561	{
3577	pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);	3562	pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
…		…
3583	SCHEME_V->code = slot_value_in_env (f);	3568	SCHEME_V->code = slot_value_in_env (f);
3584	s_goto (OP_APPLY);	3569	s_goto (OP_APPLY);
3585	}	3570	}
3586		3571
3587	SCHEME_V->value = SCHEME_V->code;	3572	SCHEME_V->value = SCHEME_V->code;
3588	/* Fallthru */
3589	}	3573	}
		3574	/* Fallthru */
3590		3575
3591	case OP_LAMBDA1:	3576	case OP_LAMBDA1:
3592	s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));	3577	s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));
3593
3594	#else
3595
3596	case OP_LAMBDA: /* lambda */
3597	s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3598
3599	#endif
3600		3578
3601	case OP_MKCLOSURE: /* make-closure */	3579	case OP_MKCLOSURE: /* make-closure */
3602	x = car (args);	3580	x = car (args);
3603		3581
3604	if (car (x) == SCHEME_V->LAMBDA)	3582	if (car (x) == SCHEME_V->LAMBDA)
…		…
4025		4003
4026	switch (op)	4004	switch (op)
4027	{	4005	{
4028	#if USE_MATH	4006	#if USE_MATH
4029	case OP_INEX2EX: /* inexact->exact */	4007	case OP_INEX2EX: /* inexact->exact */
4030	{
4031	if (is_integer (x))	4008	if (!is_integer (x))
4032	s_return (x);	4009	{
4033
4034	RVALUE r = rvalue_unchecked (x);	4010	RVALUE r = rvalue_unchecked (x);
4035		4011
4036	if (r == (RVALUE)(IVALUE)r)	4012	if (r == (RVALUE)(IVALUE)r)
4037	s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));	4013	x = mk_integer (SCHEME_A_ rvalue_unchecked (x));
4038	else	4014	else
4039	Error_1 ("inexact->exact: not integral:", x);	4015	Error_1 ("inexact->exact: not integral:", x);
4040	}	4016	}
4041		4017
		4018	s_return (x);
		4019
		4020	case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
		4021	case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
		4022	case OP_TRUNCATE: s_return (mk_real (SCHEME_A_ trunc (rvalue (x))));
		4023	case OP_ROUND: s_return (mk_real (SCHEME_A_ nearbyint (rvalue (x))));
		4024
		4025	case OP_SQRT: s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4042	case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));	4026	case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
4043	case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))));	4027	case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))
		4028	/ (cadr (args) == NIL ? 1 : log (rvalue (cadr (args))))));
4044	case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));	4029	case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
4045	case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));	4030	case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
4046	case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));	4031	case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
4047	case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));	4032	case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
4048	case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));	4033	case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4049		4034
4050	case OP_ATAN:	4035	case OP_ATAN:
		4036	s_return (mk_real (SCHEME_A_
4051	if (cdr (args) == NIL)	4037	cdr (args) == NIL
4052	s_return (mk_real (SCHEME_A_ atan (rvalue (x))));	4038	? atan (rvalue (x))
4053	else	4039	: atan2 (rvalue (x), rvalue (cadr (args)))));
4054	{
4055	pointer y = cadr (args);
4056	s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4057	}
4058
4059	case OP_SQRT:
4060	s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4061		4040
4062	case OP_EXPT:	4041	case OP_EXPT:
4063	{	4042	{
4064	RVALUE result;	4043	RVALUE result;
4065	int real_result = 1;	4044	int real_result = 1;
…		…
4088	if (real_result)	4067	if (real_result)
4089	s_return (mk_real (SCHEME_A_ result));	4068	s_return (mk_real (SCHEME_A_ result));
4090	else	4069	else
4091	s_return (mk_integer (SCHEME_A_ result));	4070	s_return (mk_integer (SCHEME_A_ result));
4092	}	4071	}
4093
4094	case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4095	case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4096
4097	case OP_TRUNCATE:
4098	{
4099	RVALUE n = rvalue (x);
4100	s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n)));
4101	}
4102
4103	case OP_ROUND:
4104	if (is_integer (x))
4105	s_return (x);
4106
4107	s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4108	#endif	4072	#endif
4109		4073
4110	case OP_ADD: /* + */	4074	case OP_ADD: /* + */
4111	v = num_zero;	4075	v = num_zero;
4112		4076
…		…
4414	memcpy (pos, strvalue (car (x)), strlength (car (x)));	4378	memcpy (pos, strvalue (car (x)), strlength (car (x)));
4415		4379
4416	s_return (newstr);	4380	s_return (newstr);
4417	}	4381	}
4418		4382
4419	case OP_SUBSTR: /* substring */	4383	case OP_STRING_COPY: /* substring/string-copy */
4420	{	4384	{
4421	char *str = strvalue (x);	4385	char *str = strvalue (x);
4422	int index0 = ivalue_unchecked (cadr (args));	4386	int index0 = cadr (args) == NIL ? 0 : ivalue_unchecked (cadr (args));
4423	int index1;	4387	int index1;
4424	int len;	4388	int len;
4425		4389
4426	if (index0 > strlength (x))	4390	if (index0 > strlength (x))
4427	Error_1 ("substring: start out of bounds:", cadr (args));	4391	Error_1 ("string->copy: start out of bounds:", cadr (args));
4428		4392
4429	if (cddr (args) != NIL)	4393	if (cddr (args) != NIL)
4430	{	4394	{
4431	index1 = ivalue_unchecked (caddr (args));	4395	index1 = ivalue_unchecked (caddr (args));
4432		4396
4433	if (index1 > strlength (x) \|\| index1 < index0)	4397	if (index1 > strlength (x) \|\| index1 < index0)
4434	Error_1 ("substring: end out of bounds:", caddr (args));	4398	Error_1 ("string->copy: end out of bounds:", caddr (args));
4435	}	4399	}
4436	else	4400	else
4437	index1 = strlength (x);	4401	index1 = strlength (x);
4438		4402
4439	len = index1 - index0;	4403	len = index1 - index0;
4440	x = mk_empty_string (SCHEME_A_ len, ' ');	4404	x = mk_counted_string (SCHEME_A_ str + index0, len);
4441	memcpy (strvalue (x), str + index0, len);
4442	strvalue (x)[len] = 0;
4443		4405
4444	s_return (x);	4406	s_return (x);
4445	}	4407	}
4446		4408
4447	case OP_VECTOR: /* vector */	4409	case OP_VECTOR: /* vector */
…		…
4632	}	4594	}
4633	else	4595	else
4634	s_return (SCHEME_V->code);	4596	s_return (SCHEME_V->code);
4635		4597
4636	case OP_SAVE_FORCED: /* Save forced value replacing promise */	4598	case OP_SAVE_FORCED: /* Save forced value replacing promise */
4637	memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell));	4599	CELL (SCHEME_V->code) = CELL (SCHEME_V->value);
4638	s_return (SCHEME_V->value);	4600	s_return (SCHEME_V->value);
4639		4601
4640	#if USE_PORTS	4602	#if USE_PORTS
4641		4603
4642	case OP_WRITE: /* write */	4604	case OP_WRITE: /* write */
…		…
4787	SCHEME_V->gc_verbose = (a != S_F);	4749	SCHEME_V->gc_verbose = (a != S_F);
4788	s_retbool (was);	4750	s_retbool (was);
4789	}	4751	}
4790		4752
4791	case OP_NEWSEGMENT: /* new-segment */	4753	case OP_NEWSEGMENT: /* new-segment */
		4754	#if 0
4792	if (!is_pair (args) \|\| !is_number (a))	4755	if (!is_pair (args) \|\| !is_number (a))
4793	Error_0 ("new-segment: argument must be a number");	4756	Error_0 ("new-segment: argument must be a number");
4794		4757	#endif
4795	alloc_cellseg (SCHEME_A_ ivalue (a));	4758	s_retbool (alloc_cellseg (SCHEME_A));
4796
4797	s_return (S_T);
4798		4759
4799	case OP_OBLIST: /* oblist */	4760	case OP_OBLIST: /* oblist */
4800	s_return (oblist_all_symbols (SCHEME_A));	4761	s_return (oblist_all_symbols (SCHEME_A));
4801		4762
4802	#if USE_PORTS	4763	#if USE_PORTS
…		…
4872	s_return (p == NIL ? S_F : p);	4833	s_return (p == NIL ? S_F : p);
4873	}	4834	}
4874		4835
4875	case OP_GET_OUTSTRING: /* get-output-string */	4836	case OP_GET_OUTSTRING: /* get-output-string */
4876	{	4837	{
4877	port *p;	4838	port *p = port (a);
4878		4839
4879	if ((p = a->object.port)->kind & port_string)	4840	if (p->kind & port_string)
4880	{	4841	{
4881	off_t size;	4842	off_t size;
4882	char *str;	4843	char *str;
4883		4844
4884	size = p->rep.string.curr - p->rep.string.start + 1;	4845	size = p->rep.string.curr - p->rep.string.start + 1;
…		…
4989	int res;	4950	int res;
4990		4951
4991	if (is_pair (args))	4952	if (is_pair (args))
4992	p = car (args);	4953	p = car (args);
4993		4954
4994	res = p->object.port->kind & port_string;	4955	res = port (p)->kind & port_string;
4995		4956
4996	s_retbool (res);	4957	s_retbool (res);
4997	}	4958	}
4998		4959
4999	case OP_SET_INPORT: /* set-input-port */	4960	case OP_SET_INPORT: /* set-input-port */
…		…
5539	if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))	5500	if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5540	return;	5501	return;
5541		5502
5542	if (SCHEME_V->no_memory && USE_ERROR_CHECKING)	5503	if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5543	{	5504	{
5544	xwrstr ("No memory!\n");	5505	putstr (SCHEME_A_ "No memory!\n");
5545	return;	5506	return;
5546	}	5507	}
5547	}	5508	}
5548	}	5509	}
5549		5510
…		…
5662	ecb_cold int	5623	ecb_cold int
5663	scheme_init (SCHEME_P)	5624	scheme_init (SCHEME_P)
5664	{	5625	{
5665	int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);	5626	int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5666	pointer x;	5627	pointer x;
		5628
		5629	/* this memset is not strictly correct, as we assume (intcache)
		5630	* that memset 0 will also set pointers to 0, but memset does
		5631	* of course not guarantee that. screw such systems.
		5632	*/
		5633	memset (SCHEME_V, 0, sizeof (*SCHEME_V));
5667		5634
5668	num_set_fixnum (num_zero, 1);	5635	num_set_fixnum (num_zero, 1);
5669	num_set_ivalue (num_zero, 0);	5636	num_set_ivalue (num_zero, 0);
5670	num_set_fixnum (num_one, 1);	5637	num_set_fixnum (num_one, 1);
5671	num_set_ivalue (num_one, 1);	5638	num_set_ivalue (num_one, 1);
…		…
5683	SCHEME_V->save_inport = NIL;	5650	SCHEME_V->save_inport = NIL;
5684	SCHEME_V->loadport = NIL;	5651	SCHEME_V->loadport = NIL;
5685	SCHEME_V->nesting = 0;	5652	SCHEME_V->nesting = 0;
5686	SCHEME_V->interactive_repl = 0;	5653	SCHEME_V->interactive_repl = 0;
5687		5654
5688	if (alloc_cellseg (SCHEME_A_ FIRST_CELLSEGS) != FIRST_CELLSEGS)	5655	if (!alloc_cellseg (SCHEME_A))
5689	{	5656	{
5690	#if USE_ERROR_CHECKING	5657	#if USE_ERROR_CHECKING
5691	SCHEME_V->no_memory = 1;	5658	SCHEME_V->no_memory = 1;
5692	return 0;	5659	return 0;
5693	#endif	5660	#endif
…		…
6027	int isfile = 1;	5994	int isfile = 1;
6028	system ("ps v $PPID");//D	5995	system ("ps v $PPID");//D
6029		5996
6030	if (argc == 2 && strcmp (argv[1], "-?") == 0)	5997	if (argc == 2 && strcmp (argv[1], "-?") == 0)
6031	{	5998	{
6032	xwrstr ("Usage: tinyscheme -?\n");	5999	putstr (SCHEME_A_ "Usage: tinyscheme -?\n");
6033	xwrstr ("or: tinyscheme [<file1> <file2> ...]\n");	6000	putstr (SCHEME_A_ "or: tinyscheme [<file1> <file2> ...]\n");
6034	xwrstr ("followed by\n");	6001	putstr (SCHEME_A_ "followed by\n");
6035	xwrstr (" -1 <file> [<arg1> <arg2> ...]\n");	6002	putstr (SCHEME_A_ " -1 <file> [<arg1> <arg2> ...]\n");
6036	xwrstr (" -c <Scheme commands> [<arg1> <arg2> ...]\n");	6003	putstr (SCHEME_A_ " -c <Scheme commands> [<arg1> <arg2> ...]\n");
6037	xwrstr ("assuming that the executable is named tinyscheme.\n");	6004	putstr (SCHEME_A_ "assuming that the executable is named tinyscheme.\n");
6038	xwrstr ("Use - as filename for stdin.\n");	6005	putstr (SCHEME_A_ "Use - as filename for stdin.\n");
6039	return 1;	6006	return 1;
6040	}	6007	}
6041		6008
6042	if (!scheme_init (SCHEME_A))	6009	if (!scheme_init (SCHEME_A))
6043	{	6010	{
6044	xwrstr ("Could not initialize!\n");	6011	putstr (SCHEME_A_ "Could not initialize!\n");
6045	return 2;	6012	return 2;
6046	}	6013	}
6047		6014
6048	# if USE_PORTS	6015	# if USE_PORTS
6049	scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO);	6016	scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO);
…		…
6094	fin = open (file_name, O_RDONLY);	6061	fin = open (file_name, O_RDONLY);
6095	#endif	6062	#endif
6096		6063
6097	if (isfile && fin < 0)	6064	if (isfile && fin < 0)
6098	{	6065	{
6099	xwrstr ("Could not open file "); xwrstr (file_name); xwrstr ("\n");	6066	putstr (SCHEME_A_ "Could not open file "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n");
6100	}	6067	}
6101	else	6068	else
6102	{	6069	{
6103	if (isfile)	6070	if (isfile)
6104	scheme_load_named_file (SCHEME_A_ fin, file_name);	6071	scheme_load_named_file (SCHEME_A_ fin, file_name);
…		…
6108	#if USE_PORTS	6075	#if USE_PORTS
6109	if (!isfile \|\| fin != STDIN_FILENO)	6076	if (!isfile \|\| fin != STDIN_FILENO)
6110	{	6077	{
6111	if (SCHEME_V->retcode != 0)	6078	if (SCHEME_V->retcode != 0)
6112	{	6079	{
6113	xwrstr ("Errors encountered reading "); xwrstr (file_name); xwrstr ("\n");	6080	putstr (SCHEME_A_ "Errors encountered reading "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n");
6114	}	6081	}
6115		6082
6116	if (isfile)	6083	if (isfile)
6117	close (fin);	6084	close (fin);
6118	}	6085	}

Diff Legend

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

Comparing cvsroot/microscheme/scheme.c (file contents): Revision 1.47 by root, Mon Nov 30 09:25:19 2015 UTC vs. Revision 1.57 by root, Tue Dec 1 04:57:49 2015 UTC

Diff Legend

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.47 by root, Mon Nov 30 09:25:19 2015 UTC vs.
Revision 1.57 by root, Tue Dec 1 04:57:49 2015 UTC