1 |
/* printf, sscanf, fgets, fprintf */ |
/* -*- coding: utf-8; -*- */ |
2 |
#include <stdio.h> |
/* |
3 |
/* exit, EXIT_SUCCESS, malloc, free */ |
stack - an interactive interpreter for a stack-based language |
4 |
#include <stdlib.h> |
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn |
5 |
/* NULL */ |
|
6 |
#include <stddef.h> |
This program is free software; you can redistribute it and/or modify |
7 |
/* dlopen, dlsym, dlerror */ |
it under the terms of the GNU General Public License as published by |
8 |
#include <dlfcn.h> |
the Free Software Foundation; either version 2 of the License, or |
9 |
/* strcmp, strcpy, strlen, strcat, strdup */ |
(at your option) any later version. |
10 |
#include <string.h> |
|
11 |
|
This program is distributed in the hope that it will be useful, |
12 |
#define HASHTBLSIZE 65536 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 |
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 |
/* First, define some types. */ |
GNU General Public License for more details. |
15 |
|
|
16 |
/* A value of some type */ |
You should have received a copy of the GNU General Public License |
17 |
typedef struct { |
along with this program; if not, write to the Free Software |
18 |
enum { |
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
19 |
integer, |
|
20 |
string, |
Authors: Mats Alritzson <masse@fukt.bth.se> |
21 |
func, /* Function pointer */ |
Teddy Hogeborn <teddy@fukt.bth.se> |
22 |
symb, |
*/ |
23 |
list |
|
24 |
} type; /* Type of stack element */ |
#include "stack.h" |
25 |
|
|
26 |
union { |
const char* start_message= "Stack version $Revision$\n\ |
27 |
void *ptr; /* Pointer to the content */ |
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn\n\ |
28 |
int val; /* ...or an integer */ |
Stack comes with ABSOLUTELY NO WARRANTY; for details type 'warranty;'.\n\ |
29 |
} content; /* Stores a pointer or an integer */ |
This is free software, and you are welcome to redistribute it\n\ |
30 |
|
under certain conditions; type 'copying;' for details.\n"; |
31 |
int refcount; /* Reference counter */ |
|
|
|
|
|
} value; |
|
|
|
|
|
/* A symbol with a name and possible value */ |
|
|
/* (These do not need reference counters, they are kept unique by |
|
|
hashing.) */ |
|
|
typedef struct symbol_struct { |
|
|
char *id; /* Symbol name */ |
|
|
value *val; /* The value (if any) bound to it */ |
|
|
struct symbol_struct *next; /* In case of hashing conflicts, a */ |
|
|
} symbol; /* symbol is a kind of stack item. */ |
|
|
|
|
|
/* A type for a hash table for symbols */ |
|
|
typedef symbol *hashtbl[HASHTBLSIZE]; /* Hash table declaration */ |
|
|
|
|
|
/* An item (value) on a stack */ |
|
|
typedef struct stackitem_struct |
|
|
{ |
|
|
value *item; /* The value on the stack */ |
|
|
/* (This is never NULL) */ |
|
|
struct stackitem_struct *next; /* Next item */ |
|
|
} stackitem; |
|
|
|
|
|
/* An environment; gives access to the stack and a hash table of |
|
|
defined symbols */ |
|
|
typedef struct { |
|
|
stackitem *head; /* Head of the stack */ |
|
|
hashtbl symbols; /* Hash table of all variable bindings */ |
|
|
int err; /* Error flag */ |
|
|
int non_eval_flag; |
|
|
} environment; |
|
|
|
|
|
/* A type for pointers to external functions */ |
|
|
typedef void (*funcp)(environment *); /* funcp is a pointer to a void |
|
|
function (environment *) */ |
|
32 |
|
|
33 |
/* Initialize a newly created environment */ |
/* Initialize a newly created environment */ |
34 |
void init_env(environment *env) |
void init_env(environment *env) |
35 |
{ |
{ |
36 |
int i; |
int i; |
37 |
|
|
38 |
env->err= 0; |
env->gc_limit= 400000; |
39 |
env->non_eval_flag= 0; |
env->gc_count= 0; |
40 |
|
env->gc_ref= NULL; |
41 |
|
|
42 |
|
env->head= new_val(env); |
43 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
44 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
45 |
|
env->err= 0; |
46 |
|
env->in_string= NULL; |
47 |
|
env->free_string= NULL; |
48 |
|
env->inputstream= stdin; |
49 |
|
env->interactive= 1; |
50 |
} |
} |
51 |
|
|
|
void printerr(const char* in_string) { |
|
|
fprintf(stderr, "Err: %s\n", in_string); |
|
|
} |
|
52 |
|
|
53 |
/* Throw away a value */ |
void printerr(environment *env, const char* in_string) |
|
void free_val(value *val){ |
|
|
stackitem *item, *temp; |
|
|
|
|
|
val->refcount--; /* Decrease the reference count */ |
|
|
if(val->refcount == 0){ |
|
|
switch (val->type){ /* and free the contents if necessary */ |
|
|
case string: |
|
|
free(val->content.ptr); |
|
|
break; |
|
|
case list: /* lists needs to be freed recursively */ |
|
|
item=val->content.ptr; |
|
|
while(item != NULL) { /* for all stack items */ |
|
|
free_val(item->item); /* free the value */ |
|
|
temp=item->next; /* save next ptr */ |
|
|
free(item); /* free the stackitem */ |
|
|
item=temp; /* go to next stackitem */ |
|
|
} |
|
|
free(val); /* Free the actual list value */ |
|
|
break; |
|
|
case integer: |
|
|
case func: |
|
|
case symb: |
|
|
break; |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
/* Discard the top element of the stack. */ |
|
|
extern void toss(environment *env) |
|
54 |
{ |
{ |
55 |
stackitem *temp= env->head; |
fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string); |
|
|
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
free_val(env->head->item); /* Free the value */ |
|
|
env->head= env->head->next; /* Remove the top stack item */ |
|
|
free(temp); /* Free the old top stack item */ |
|
56 |
} |
} |
57 |
|
|
58 |
|
|
59 |
/* Returns a pointer to a pointer to an element in the hash table. */ |
/* Returns a pointer to a pointer to an element in the hash table. */ |
60 |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
61 |
{ |
{ |
85 |
} |
} |
86 |
} |
} |
87 |
|
|
88 |
/* Generic push function. */ |
|
89 |
void push(stackitem** stack_head, stackitem* in_item) |
/* Create new value */ |
90 |
|
value* new_val(environment *env) |
91 |
|
{ |
92 |
|
value *nval= malloc(sizeof(value)); |
93 |
|
stackitem *nitem= malloc(sizeof(stackitem)); |
94 |
|
|
95 |
|
assert(nval != NULL); |
96 |
|
assert(nitem != NULL); |
97 |
|
|
98 |
|
nval->content.ptr= NULL; |
99 |
|
nval->type= empty; |
100 |
|
|
101 |
|
nitem->item= nval; |
102 |
|
nitem->next= env->gc_ref; |
103 |
|
|
104 |
|
env->gc_ref= nitem; |
105 |
|
|
106 |
|
env->gc_count += sizeof(value); |
107 |
|
nval->gc.flag.mark= 0; |
108 |
|
nval->gc.flag.protect= 0; |
109 |
|
|
110 |
|
return nval; |
111 |
|
} |
112 |
|
|
113 |
|
|
114 |
|
/* Mark values recursively. |
115 |
|
Marked values are not collected by the GC. */ |
116 |
|
inline void gc_mark(value *val) |
117 |
|
{ |
118 |
|
if(val==NULL || val->gc.flag.mark) |
119 |
|
return; |
120 |
|
|
121 |
|
val->gc.flag.mark= 1; |
122 |
|
|
123 |
|
if(val->type==tcons) { |
124 |
|
gc_mark(CAR(val)); |
125 |
|
gc_mark(CDR(val)); |
126 |
|
} |
127 |
|
} |
128 |
|
|
129 |
|
|
130 |
|
/* Start GC */ |
131 |
|
extern void gc_init(environment *env) |
132 |
|
{ |
133 |
|
stackitem *new_head= NULL, *titem; |
134 |
|
symbol *tsymb; |
135 |
|
int i; |
136 |
|
|
137 |
|
if(env->interactive) |
138 |
|
printf("Garbage collecting."); |
139 |
|
|
140 |
|
/* Mark values on stack */ |
141 |
|
gc_mark(env->head); |
142 |
|
|
143 |
|
if(env->interactive) |
144 |
|
printf("."); |
145 |
|
|
146 |
|
/* Mark values in hashtable */ |
147 |
|
for(i= 0; i<HASHTBLSIZE; i++) |
148 |
|
for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next) |
149 |
|
if (tsymb->val != NULL) |
150 |
|
gc_mark(tsymb->val); |
151 |
|
|
152 |
|
if(env->interactive) |
153 |
|
printf("."); |
154 |
|
|
155 |
|
env->gc_count= 0; |
156 |
|
|
157 |
|
while(env->gc_ref!=NULL) { /* Sweep unused values */ |
158 |
|
if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */ |
159 |
|
|
160 |
|
/* Remove content */ |
161 |
|
switch(env->gc_ref->item->type){ |
162 |
|
case string: |
163 |
|
free(env->gc_ref->item->content.string); |
164 |
|
break; |
165 |
|
case tcons: |
166 |
|
free(env->gc_ref->item->content.c); |
167 |
|
break; |
168 |
|
case port: |
169 |
|
case empty: |
170 |
|
case unknown: |
171 |
|
case integer: |
172 |
|
case tfloat: |
173 |
|
case func: |
174 |
|
case symb: |
175 |
|
/* Symbol strings are freed when walking the hash table */ |
176 |
|
break; |
177 |
|
} |
178 |
|
|
179 |
|
free(env->gc_ref->item); /* Remove from gc_ref */ |
180 |
|
titem= env->gc_ref->next; |
181 |
|
free(env->gc_ref); /* Remove value */ |
182 |
|
env->gc_ref= titem; |
183 |
|
continue; |
184 |
|
} |
185 |
|
|
186 |
|
#ifdef DEBUG |
187 |
|
printf("Kept value (%p)", env->gc_ref->item); |
188 |
|
if(env->gc_ref->item->gc.flag.mark) |
189 |
|
printf(" (marked)"); |
190 |
|
if(env->gc_ref->item->gc.flag.protect) |
191 |
|
printf(" (protected)"); |
192 |
|
switch(env->gc_ref->item->type){ |
193 |
|
case integer: |
194 |
|
printf(" integer: %d", env->gc_ref->item->content.i); |
195 |
|
break; |
196 |
|
case func: |
197 |
|
printf(" func: %p", env->gc_ref->item->content.func); |
198 |
|
break; |
199 |
|
case symb: |
200 |
|
printf(" symb: %s", env->gc_ref->item->content.sym->id); |
201 |
|
break; |
202 |
|
case tcons: |
203 |
|
printf(" tcons: %p\t%p", CAR(env->gc_ref->item), |
204 |
|
CDR(env->gc_ref->item)); |
205 |
|
break; |
206 |
|
default: |
207 |
|
printf(" <unknown %d>", (env->gc_ref->item->type)); |
208 |
|
} |
209 |
|
printf("\n"); |
210 |
|
#endif /* DEBUG */ |
211 |
|
|
212 |
|
/* Keep values */ |
213 |
|
env->gc_count += sizeof(value); |
214 |
|
if(env->gc_ref->item->type==string) |
215 |
|
env->gc_count += strlen(env->gc_ref->item->content.string)+1; |
216 |
|
|
217 |
|
titem= env->gc_ref->next; |
218 |
|
env->gc_ref->next= new_head; |
219 |
|
new_head= env->gc_ref; |
220 |
|
new_head->item->gc.flag.mark= 0; |
221 |
|
env->gc_ref= titem; |
222 |
|
} |
223 |
|
|
224 |
|
if (env->gc_limit < env->gc_count*2) |
225 |
|
env->gc_limit= env->gc_count*2; |
226 |
|
|
227 |
|
env->gc_ref= new_head; |
228 |
|
|
229 |
|
if(env->interactive) |
230 |
|
printf("done (%d bytes still allocated)\n", env->gc_count); |
231 |
|
|
232 |
|
} |
233 |
|
|
234 |
|
|
235 |
|
inline void gc_maybe(environment *env) |
236 |
{ |
{ |
237 |
in_item->next= *stack_head; |
if(env->gc_count < env->gc_limit) |
238 |
*stack_head= in_item; |
return; |
239 |
|
else |
240 |
|
return gc_init(env); |
241 |
|
} |
242 |
|
|
243 |
|
|
244 |
|
/* Protect values from GC */ |
245 |
|
void protect(value *val) |
246 |
|
{ |
247 |
|
if(val==NULL || val->gc.flag.protect) |
248 |
|
return; |
249 |
|
|
250 |
|
val->gc.flag.protect= 1; |
251 |
|
|
252 |
|
if(val->type==tcons) { |
253 |
|
protect(CAR(val)); |
254 |
|
protect(CDR(val)); |
255 |
|
} |
256 |
|
} |
257 |
|
|
258 |
|
|
259 |
|
/* Unprotect values from GC */ |
260 |
|
void unprotect(value *val) |
261 |
|
{ |
262 |
|
if(val==NULL || !(val->gc.flag.protect)) |
263 |
|
return; |
264 |
|
|
265 |
|
val->gc.flag.protect= 0; |
266 |
|
|
267 |
|
if(val->type==tcons) { |
268 |
|
unprotect(CAR(val)); |
269 |
|
unprotect(CDR(val)); |
270 |
|
} |
271 |
} |
} |
272 |
|
|
273 |
|
|
274 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
275 |
void push_val(stackitem **stack_head, value *val) |
void push_val(environment *env, value *val) |
276 |
{ |
{ |
277 |
stackitem *new_item= malloc(sizeof(stackitem)); |
value *new_value= new_val(env); |
278 |
new_item->item= val; |
|
279 |
val->refcount++; |
new_value->content.c= malloc(sizeof(pair)); |
280 |
push(stack_head, new_item); |
assert(new_value->content.c!=NULL); |
281 |
|
env->gc_count += sizeof(pair); |
282 |
|
new_value->type= tcons; |
283 |
|
CAR(new_value)= val; |
284 |
|
CDR(new_value)= env->head; |
285 |
|
env->head= new_value; |
286 |
} |
} |
287 |
|
|
288 |
/* Push an integer onto the stack. */ |
|
289 |
void push_int(stackitem **stack_head, int in_val) |
/* Push an integer onto the stack */ |
290 |
|
void push_int(environment *env, int in_val) |
291 |
{ |
{ |
292 |
value *new_value= malloc(sizeof(value)); |
value *new_value= new_val(env); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item= new_value; |
|
293 |
|
|
294 |
new_value->content.val= in_val; |
new_value->content.i= in_val; |
295 |
new_value->type= integer; |
new_value->type= integer; |
|
new_value->refcount=1; |
|
296 |
|
|
297 |
push(stack_head, new_item); |
push_val(env, new_value); |
298 |
} |
} |
299 |
|
|
300 |
|
|
301 |
|
/* Push a floating point number onto the stack */ |
302 |
|
void push_float(environment *env, float in_val) |
303 |
|
{ |
304 |
|
value *new_value= new_val(env); |
305 |
|
|
306 |
|
new_value->content.f= in_val; |
307 |
|
new_value->type= tfloat; |
308 |
|
|
309 |
|
push_val(env, new_value); |
310 |
|
} |
311 |
|
|
312 |
|
|
313 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
314 |
void push_cstring(stackitem **stack_head, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
315 |
{ |
{ |
316 |
value *new_value= malloc(sizeof(value)); |
value *new_value= new_val(env); |
317 |
stackitem *new_item= malloc(sizeof(stackitem)); |
int length= strlen(in_string)+1; |
|
new_item->item=new_value; |
|
318 |
|
|
319 |
new_value->content.ptr= malloc(strlen(in_string)+1); |
new_value->content.string= malloc(length); |
320 |
strcpy(new_value->content.ptr, in_string); |
assert(new_value != NULL); |
321 |
|
env->gc_count += length; |
322 |
|
strcpy(new_value->content.string, in_string); |
323 |
new_value->type= string; |
new_value->type= string; |
|
new_value->refcount=1; |
|
324 |
|
|
325 |
push(stack_head, new_item); |
push_val(env, new_value); |
326 |
} |
} |
327 |
|
|
328 |
|
|
329 |
/* Mangle a symbol name to a valid C identifier name */ |
/* Mangle a symbol name to a valid C identifier name */ |
330 |
char *mangle_str(const char *old_string){ |
char *mangle_str(const char *old_string) |
331 |
char validchars[] |
{ |
332 |
="0123456789abcdef"; |
char validchars[]= "0123456789abcdef"; |
333 |
char *new_string, *current; |
char *new_string, *current; |
334 |
|
|
335 |
new_string=malloc((strlen(old_string)*2)+4); |
new_string= malloc((strlen(old_string)*2)+4); |
336 |
|
assert(new_string != NULL); |
337 |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
338 |
current=new_string+3; |
current= new_string+3; |
339 |
|
|
340 |
while(old_string[0] != '\0'){ |
while(old_string[0] != '\0'){ |
341 |
current[0]=validchars[(unsigned char)(old_string[0])/16]; |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
342 |
current[1]=validchars[(unsigned char)(old_string[0])%16]; |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
343 |
current+=2; |
current+= 2; |
344 |
old_string++; |
old_string++; |
345 |
} |
} |
346 |
current[0]='\0'; |
current[0]= '\0'; |
347 |
|
|
348 |
return new_string; /* The caller must free() it */ |
return new_string; /* The caller must free() it */ |
349 |
} |
} |
350 |
|
|
|
extern void mangle(environment *env){ |
|
|
value *new_value; |
|
|
char *new_string; |
|
|
|
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=string) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
|
|
|
new_string= mangle_str((const char *)(env->head->item->content.ptr)); |
|
|
|
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
|
|
|
new_value= malloc(sizeof(value)); |
|
|
new_value->content.ptr= new_string; |
|
|
new_value->type= string; |
|
|
new_value->refcount=1; |
|
|
|
|
|
push_val(&(env->head), new_value); |
|
|
} |
|
351 |
|
|
352 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
353 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
354 |
{ |
{ |
|
stackitem *new_item; /* The new stack item */ |
|
|
/* ...which will contain... */ |
|
355 |
value *new_value; /* A new symbol value */ |
value *new_value; /* A new symbol value */ |
356 |
/* ...which might point to... */ |
/* ...which might point to... */ |
357 |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
364 |
const char *dlerr; /* Dynamic linker error */ |
const char *dlerr; /* Dynamic linker error */ |
365 |
char *mangled; /* Mangled function name */ |
char *mangled; /* Mangled function name */ |
366 |
|
|
367 |
/* Create a new stack item containing a new value */ |
new_value= new_val(env); |
368 |
new_item= malloc(sizeof(stackitem)); |
new_fvalue= new_val(env); |
|
new_value= malloc(sizeof(value)); |
|
|
new_item->item=new_value; |
|
369 |
|
|
370 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
371 |
new_value->type= symb; |
new_value->type= symb; |
|
new_value->refcount= 1; |
|
372 |
|
|
373 |
/* Look up the symbol name in the hash table */ |
/* Look up the symbol name in the hash table */ |
374 |
new_symbol= hash(env->symbols, in_string); |
new_symbol= hash(env->symbols, in_string); |
375 |
new_value->content.ptr= *new_symbol; |
new_value->content.sym= *new_symbol; |
376 |
|
|
377 |
if(*new_symbol==NULL) { /* If symbol was undefined */ |
if(*new_symbol==NULL) { /* If symbol was undefined */ |
378 |
|
|
379 |
/* Create a new symbol */ |
/* Create a new symbol */ |
380 |
(*new_symbol)= malloc(sizeof(symbol)); |
(*new_symbol)= malloc(sizeof(symbol)); |
381 |
|
assert((*new_symbol) != NULL); |
382 |
(*new_symbol)->val= NULL; /* undefined value */ |
(*new_symbol)->val= NULL; /* undefined value */ |
383 |
(*new_symbol)->next= NULL; |
(*new_symbol)->next= NULL; |
384 |
(*new_symbol)->id= malloc(strlen(in_string)+1); |
(*new_symbol)->id= malloc(strlen(in_string)+1); |
385 |
|
assert((*new_symbol)->id != NULL); |
386 |
strcpy((*new_symbol)->id, in_string); |
strcpy((*new_symbol)->id, in_string); |
387 |
|
|
388 |
/* Intern the new symbol in the hash table */ |
/* Intern the new symbol in the hash table */ |
389 |
new_value->content.ptr= *new_symbol; |
new_value->content.sym= *new_symbol; |
390 |
|
|
391 |
/* Try to load the symbol name as an external function, to see if |
/* Try to load the symbol name as an external function, to see if |
392 |
we should bind the symbol to a new function pointer value */ |
we should bind the symbol to a new function pointer value */ |
393 |
if(handle==NULL) /* If no handle */ |
if(handle==NULL) /* If no handle */ |
394 |
handle= dlopen(NULL, RTLD_LAZY); |
handle= dlopen(NULL, RTLD_LAZY); |
395 |
|
|
396 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
mangled= mangle_str(in_string); /* mangle the name */ |
397 |
dlerr=dlerror(); |
funcptr= dlsym(handle, mangled); /* and try to find it */ |
398 |
|
|
399 |
|
dlerr= dlerror(); |
400 |
if(dlerr != NULL) { /* If no function was found */ |
if(dlerr != NULL) { /* If no function was found */ |
401 |
mangled=mangle_str(in_string); |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
402 |
funcptr= dlsym(handle, mangled); /* try mangling it */ |
dlerr= dlerror(); |
|
free(mangled); |
|
|
dlerr=dlerror(); |
|
403 |
} |
} |
404 |
|
|
405 |
if(dlerr==NULL) { /* If a function was found */ |
if(dlerr==NULL) { /* If a function was found */ |
406 |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
new_fvalue->type= func; /* The new value is a function pointer */ |
407 |
new_fvalue->type=func; /* The new value is a function pointer */ |
new_fvalue->content.func= funcptr; /* Store function pointer */ |
|
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
|
408 |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
409 |
function value */ |
function value */ |
|
new_fvalue->refcount= 1; |
|
410 |
} |
} |
411 |
|
|
412 |
|
free(mangled); |
413 |
} |
} |
|
push(&(env->head), new_item); |
|
|
} |
|
414 |
|
|
415 |
/* Print newline. */ |
push_val(env, new_value); |
|
extern void nl() |
|
|
{ |
|
|
printf("\n"); |
|
416 |
} |
} |
417 |
|
|
|
/* Gets the type of a value */ |
|
|
extern void type(environment *env){ |
|
|
int typenum; |
|
418 |
|
|
419 |
if((env->head)==NULL) { |
/* Print a value */ |
420 |
printerr("Too Few Arguments"); |
void print_val(environment *env, value *val, int noquote, stackitem *stack, |
421 |
env->err=1; |
FILE *stream) |
422 |
return; |
{ |
423 |
} |
stackitem *titem, *tstack; |
424 |
typenum=env->head->item->type; |
int depth; |
425 |
toss(env); |
|
426 |
switch(typenum){ |
switch(val->type) { |
427 |
case integer: |
case empty: |
428 |
push_sym(env, "integer"); |
if(fprintf(stream, "[]") < 0){ |
429 |
break; |
perror("print_val"); |
430 |
case string: |
env->err= 5; |
431 |
push_sym(env, "string"); |
return; |
432 |
break; |
} |
|
case symb: |
|
|
push_sym(env, "symbol"); |
|
|
break; |
|
|
case func: |
|
|
push_sym(env, "function"); |
|
433 |
break; |
break; |
434 |
case list: |
case unknown: |
435 |
push_sym(env, "list"); |
if(fprintf(stream, "UNKNOWN") < 0){ |
436 |
|
perror("print_val"); |
437 |
|
env->err= 5; |
438 |
|
return; |
439 |
|
} |
440 |
break; |
break; |
|
} |
|
|
} |
|
|
|
|
|
/* Prints the top element of the stack. */ |
|
|
void print_h(stackitem *stack_head) |
|
|
{ |
|
|
switch(stack_head->item->type) { |
|
441 |
case integer: |
case integer: |
442 |
printf("%d", stack_head->item->content.val); |
if(fprintf(stream, "%d", val->content.i) < 0){ |
443 |
|
perror("print_val"); |
444 |
|
env->err= 5; |
445 |
|
return; |
446 |
|
} |
447 |
|
break; |
448 |
|
case tfloat: |
449 |
|
if(fprintf(stream, "%f", val->content.f) < 0){ |
450 |
|
perror("print_val"); |
451 |
|
env->err= 5; |
452 |
|
return; |
453 |
|
} |
454 |
break; |
break; |
455 |
case string: |
case string: |
456 |
printf("%s", (char*)stack_head->item->content.ptr); |
if(noquote){ |
457 |
|
if(fprintf(stream, "%s", val->content.string) < 0){ |
458 |
|
perror("print_val"); |
459 |
|
env->err= 5; |
460 |
|
return; |
461 |
|
} |
462 |
|
} else { /* quote */ |
463 |
|
if(fprintf(stream, "\"%s\"", val->content.string) < 0){ |
464 |
|
perror("print_val"); |
465 |
|
env->err= 5; |
466 |
|
return; |
467 |
|
} |
468 |
|
} |
469 |
break; |
break; |
470 |
case symb: |
case symb: |
471 |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
if(fprintf(stream, "%s", val->content.sym->id) < 0){ |
472 |
|
perror("print_val"); |
473 |
|
env->err= 5; |
474 |
|
return; |
475 |
|
} |
476 |
break; |
break; |
477 |
case func: |
case func: |
478 |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
if(fprintf(stream, "#<function %p>", val->content.func) < 0){ |
479 |
|
perror("print_val"); |
480 |
|
env->err= 5; |
481 |
|
return; |
482 |
|
} |
483 |
break; |
break; |
484 |
case list: |
case port: |
485 |
/* A list is just a stack, so make stack_head point to it */ |
if(fprintf(stream, "#<port %p>", val->content.p) < 0){ |
486 |
stack_head=(stackitem *)(stack_head->item->content.ptr); |
perror("print_val"); |
487 |
printf("[ "); |
env->err= 5; |
488 |
while(stack_head != NULL) { |
return; |
|
print_h(stack_head); |
|
|
printf(" "); |
|
|
stack_head=stack_head->next; |
|
489 |
} |
} |
|
printf("]"); |
|
490 |
break; |
break; |
491 |
} |
case tcons: |
492 |
} |
if(fprintf(stream, "[ ") < 0){ |
493 |
|
perror("print_val"); |
494 |
|
env->err= 5; |
495 |
|
return; |
496 |
|
} |
497 |
|
tstack= stack; |
498 |
|
|
499 |
extern void print_(environment *env) { |
do { |
500 |
if(env->head==NULL) { |
titem=malloc(sizeof(stackitem)); |
501 |
printerr("Too Few Arguments"); |
assert(titem != NULL); |
502 |
env->err=1; |
titem->item=val; |
503 |
return; |
titem->next=tstack; |
504 |
} |
tstack=titem; /* Put it on the stack */ |
505 |
print_h(env->head); |
/* Search a stack of values being printed to see if we are already |
506 |
} |
printing this value */ |
507 |
|
titem=tstack; |
508 |
|
depth=0; |
509 |
|
|
510 |
|
while(titem != NULL && titem->item != CAR(val)){ |
511 |
|
titem=titem->next; |
512 |
|
depth++; |
513 |
|
} |
514 |
|
|
515 |
/* Prints the top element of the stack and then discards it. */ |
if(titem != NULL){ /* If we found it on the stack, */ |
516 |
extern void print(environment *env) |
if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */ |
517 |
{ |
perror("print_val"); |
518 |
print_(env); |
env->err= 5; |
519 |
if(env->err) return; |
free(titem); |
520 |
toss(env); |
return; |
521 |
} |
} |
522 |
|
} else { |
523 |
|
print_val(env, CAR(val), noquote, tstack, stream); |
524 |
|
} |
525 |
|
|
526 |
/* Only to be called by function printstack. */ |
val= CDR(val); |
527 |
void print_st(stackitem *stack_head, long counter) |
switch(val->type){ |
528 |
{ |
case empty: |
529 |
if(stack_head->next != NULL) |
break; |
530 |
print_st(stack_head->next, counter+1); |
case tcons: |
531 |
printf("%ld: ", counter); |
/* Search a stack of values being printed to see if we are already |
532 |
print_h(stack_head); |
printing this value */ |
533 |
nl(); |
titem=tstack; |
534 |
} |
depth=0; |
535 |
|
|
536 |
|
while(titem != NULL && titem->item != val){ |
537 |
|
titem=titem->next; |
538 |
|
depth++; |
539 |
|
} |
540 |
|
if(titem != NULL){ /* If we found it on the stack, */ |
541 |
|
if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */ |
542 |
|
perror("print_val"); |
543 |
|
env->err= 5; |
544 |
|
goto printval_end; |
545 |
|
} |
546 |
|
} else { |
547 |
|
if(fprintf(stream, " ") < 0){ |
548 |
|
perror("print_val"); |
549 |
|
env->err= 5; |
550 |
|
goto printval_end; |
551 |
|
} |
552 |
|
} |
553 |
|
break; |
554 |
|
default: |
555 |
|
if(fprintf(stream, " . ") < 0){ /* Improper list */ |
556 |
|
perror("print_val"); |
557 |
|
env->err= 5; |
558 |
|
goto printval_end; |
559 |
|
} |
560 |
|
print_val(env, val, noquote, tstack, stream); |
561 |
|
} |
562 |
|
} while(val->type == tcons && titem == NULL); |
563 |
|
|
564 |
/* Prints the stack. */ |
printval_end: |
565 |
extern void printstack(environment *env) |
|
566 |
{ |
titem=tstack; |
567 |
if(env->head == NULL) { |
while(titem != stack){ |
568 |
return; |
tstack=titem->next; |
569 |
|
free(titem); |
570 |
|
titem=tstack; |
571 |
|
} |
572 |
|
|
573 |
|
if(! (env->err)){ |
574 |
|
if(fprintf(stream, " ]") < 0){ |
575 |
|
perror("print_val"); |
576 |
|
env->err= 5; |
577 |
|
} |
578 |
|
} |
579 |
|
break; |
580 |
} |
} |
|
print_st(env->head, 1); |
|
|
nl(); |
|
581 |
} |
} |
582 |
|
|
583 |
|
|
584 |
/* Swap the two top elements on the stack. */ |
/* Swap the two top elements on the stack. */ |
585 |
extern void swap(environment *env) |
extern void swap(environment *env) |
586 |
{ |
{ |
587 |
stackitem *temp= env->head; |
value *temp= env->head; |
|
|
|
|
if(env->head==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
env->head= env->head->next; |
|
|
temp->next= env->head->next; |
|
|
env->head->next= temp; |
|
|
} |
|
588 |
|
|
589 |
/* Rotate the first three elements on the stack. */ |
switch(check_args(env, unknown, unknown, empty)) { |
590 |
extern void rot(environment *env) |
case 1: |
591 |
{ |
printerr(env, "Too Few Arguments"); |
592 |
stackitem *temp= env->head; |
return; |
593 |
|
case 2: |
594 |
if(env->head==NULL || env->head->next==NULL |
printerr(env, "Bad Argument Type"); |
|
|| env->head->next->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
595 |
return; |
return; |
596 |
|
default: |
597 |
|
break; |
598 |
} |
} |
599 |
|
|
600 |
|
env->head= CDR(env->head); |
601 |
|
CDR(temp)= CDR(env->head); |
602 |
|
CDR(env->head)= temp; |
603 |
|
} |
604 |
|
|
|
env->head= env->head->next->next; |
|
|
temp->next->next= env->head->next; |
|
|
env->head->next= temp; |
|
|
} |
|
605 |
|
|
606 |
/* Recall a value from a symbol, if bound */ |
/* Recall a value from a symbol, if bound */ |
607 |
extern void rcl(environment *env) |
extern void rcl(environment *env) |
608 |
{ |
{ |
609 |
value *val; |
value *val; |
610 |
|
|
611 |
if(env->head == NULL) { |
switch(check_args(env, symb, empty)) { |
612 |
printerr("Too Few Arguments"); |
case 1: |
613 |
env->err=1; |
printerr(env, "Too Few Arguments"); |
614 |
return; |
return; |
615 |
} |
case 2: |
616 |
|
printerr(env, "Bad Argument Type"); |
|
if(env->head->item->type!=symb) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
617 |
return; |
return; |
618 |
|
default: |
619 |
|
break; |
620 |
} |
} |
621 |
|
|
622 |
val=((symbol *)(env->head->item->content.ptr))->val; |
val= CAR(env->head)->content.sym->val; |
623 |
if(val == NULL){ |
if(val == NULL){ |
624 |
printerr("Unbound Variable"); |
printerr(env, "Unbound Variable"); |
625 |
env->err=3; |
env->err= 3; |
626 |
return; |
return; |
627 |
} |
} |
628 |
toss(env); /* toss the symbol */ |
push_val(env, val); /* Return the symbol's bound value */ |
629 |
|
swap(env); |
630 |
if(env->err) return; |
if(env->err) return; |
631 |
push_val(&(env->head), val); /* Return its bound value */ |
env->head= CDR(env->head); |
632 |
} |
} |
633 |
|
|
|
void stack_read(environment*, char*); |
|
634 |
|
|
635 |
/* If the top element is a symbol, determine if it's bound to a |
/* If the top element is a symbol, determine if it's bound to a |
636 |
function value, and if it is, toss the symbol and execute the |
function value, and if it is, toss the symbol and execute the |
639 |
{ |
{ |
640 |
funcp in_func; |
funcp in_func; |
641 |
value* temp_val; |
value* temp_val; |
642 |
stackitem* iterator; |
value* iterator; |
643 |
char* temp_string; |
|
644 |
|
eval_start: |
645 |
|
|
646 |
if(env->head==NULL) { |
gc_maybe(env); |
647 |
printerr("Too Few Arguments"); |
|
648 |
env->err=1; |
switch(check_args(env, unknown, empty)) { |
649 |
|
case 1: |
650 |
|
printerr(env, "Too Few Arguments"); |
651 |
|
return; |
652 |
|
case 2: |
653 |
|
printerr(env, "Bad Argument Type"); |
654 |
return; |
return; |
655 |
|
default: |
656 |
|
break; |
657 |
} |
} |
658 |
|
|
659 |
switch(env->head->item->type) { |
switch(CAR(env->head)->type) { |
660 |
/* if it's a symbol */ |
/* if it's a symbol */ |
661 |
case symb: |
case symb: |
662 |
|
env->errsymb= CAR(env->head)->content.sym->id; |
663 |
rcl(env); /* get its contents */ |
rcl(env); /* get its contents */ |
664 |
if(env->err) return; |
if(env->err) return; |
665 |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
if(CAR(env->head)->type!=symb){ /* don't recurse symbols */ |
666 |
return eval(env); /* evaluate the value */ |
goto eval_start; |
667 |
} |
} |
668 |
return; |
return; |
669 |
|
|
670 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
671 |
case func: |
case func: |
672 |
in_func= (funcp)(env->head->item->content.ptr); |
in_func= CAR(env->head)->content.func; |
673 |
toss(env); |
env->head= CDR(env->head); |
674 |
if(env->err) return; |
return in_func(env); |
|
return (*in_func)(env); |
|
675 |
|
|
676 |
/* If it's a list */ |
/* If it's a list */ |
677 |
case list: |
case tcons: |
678 |
temp_val= env->head->item; |
temp_val= CAR(env->head); |
679 |
env->head->item->refcount++; |
protect(temp_val); |
680 |
toss(env); |
|
681 |
if(env->err) return; |
env->head= CDR(env->head); |
682 |
iterator= (stackitem*)temp_val->content.ptr; |
iterator= temp_val; |
683 |
while(iterator!=NULL) { |
|
684 |
push_val(&(env->head), iterator->item); |
while(iterator->type != empty) { |
685 |
if(env->head->item->type==symb |
push_val(env, CAR(iterator)); |
686 |
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
|
687 |
toss(env); |
if(CAR(env->head)->type==symb |
688 |
if(env->err) return; |
&& CAR(env->head)->content.sym->id[0]==';') { |
689 |
if(iterator->next == NULL){ |
env->head= CDR(env->head); |
690 |
free_val(temp_val); |
|
691 |
return eval(env); |
if(CDR(iterator)->type == empty){ |
692 |
|
goto eval_start; |
693 |
} |
} |
694 |
eval(env); |
eval(env); |
695 |
if(env->err) return; |
if(env->err) return; |
696 |
} |
} |
697 |
iterator= iterator->next; |
if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons) |
698 |
|
iterator= CDR(iterator); |
699 |
|
else { |
700 |
|
printerr(env, "Bad Argument Type"); /* Improper list */ |
701 |
|
env->err= 2; |
702 |
|
return; |
703 |
|
} |
704 |
} |
} |
705 |
free_val(temp_val); |
unprotect(temp_val); |
706 |
return; |
return; |
707 |
|
|
708 |
/* If it's a string */ |
case empty: |
709 |
case string: |
env->head= CDR(env->head); |
|
temp_val= env->head->item; |
|
|
env->head->item->refcount++; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
temp_string= malloc(strlen((char*)temp_val->content.ptr)+5); |
|
|
strcpy(temp_string, "[ "); |
|
|
strcpy(temp_string+2, (char*)temp_val->content.ptr); |
|
|
free_val(temp_val); |
|
|
strcat(temp_string, " ]"); |
|
|
stack_read(env, temp_string); |
|
|
free(temp_string); |
|
|
return eval(env); |
|
|
|
|
710 |
case integer: |
case integer: |
711 |
|
case tfloat: |
712 |
|
case string: |
713 |
|
case port: |
714 |
|
case unknown: |
715 |
return; |
return; |
716 |
} |
} |
717 |
} |
} |
718 |
|
|
|
/* Reverse (flip) a list */ |
|
|
extern void rev(environment *env){ |
|
|
stackitem *old_head, *new_head, *item; |
|
|
|
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=list) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
719 |
|
|
720 |
old_head=(stackitem *)(env->head->item->content.ptr); |
/* Internal forget function */ |
721 |
new_head=NULL; |
void forget_sym(symbol **hash_entry) |
|
while(old_head != NULL){ |
|
|
item=old_head; |
|
|
old_head=old_head->next; |
|
|
item->next=new_head; |
|
|
new_head=item; |
|
|
} |
|
|
env->head->item->content.ptr=new_head; |
|
|
} |
|
|
|
|
|
/* Make a list. */ |
|
|
extern void pack(environment *env) |
|
722 |
{ |
{ |
723 |
void* delimiter; |
symbol *temp; |
|
stackitem *iterator, *temp; |
|
|
value *pack; |
|
|
|
|
|
delimiter= env->head->item->content.ptr; /* Get delimiter */ |
|
|
toss(env); |
|
724 |
|
|
725 |
iterator= env->head; |
temp= *hash_entry; |
726 |
|
*hash_entry= (*hash_entry)->next; |
727 |
|
|
728 |
|
free(temp->id); |
729 |
|
free(temp); |
730 |
|
} |
731 |
|
|
|
if(iterator==NULL || iterator->item->content.ptr==delimiter) { |
|
|
temp= NULL; |
|
|
toss(env); |
|
|
} else { |
|
|
/* Search for first delimiter */ |
|
|
while(iterator->next!=NULL |
|
|
&& iterator->next->item->content.ptr!=delimiter) |
|
|
iterator= iterator->next; |
|
|
|
|
|
/* Extract list */ |
|
|
temp= env->head; |
|
|
env->head= iterator->next; |
|
|
iterator->next= NULL; |
|
|
|
|
|
if(env->head!=NULL) |
|
|
toss(env); |
|
|
} |
|
732 |
|
|
733 |
/* Push list */ |
int main(int argc, char **argv) |
734 |
pack= malloc(sizeof(value)); |
{ |
735 |
pack->type= list; |
environment myenv; |
736 |
pack->content.ptr= temp; |
int c; /* getopt option character */ |
|
pack->refcount= 1; |
|
737 |
|
|
738 |
temp= malloc(sizeof(stackitem)); |
#ifdef __linux__ |
739 |
temp->item= pack; |
mtrace(); |
740 |
|
#endif |
741 |
|
|
742 |
push(&(env->head), temp); |
init_env(&myenv); |
|
rev(env); |
|
|
} |
|
743 |
|
|
744 |
/* Parse input. */ |
myenv.interactive = isatty(STDIN_FILENO) && isatty(STDOUT_FILENO); |
|
void stack_read(environment *env, char *in_line) |
|
|
{ |
|
|
char *temp, *rest; |
|
|
int itemp; |
|
|
size_t inlength= strlen(in_line)+1; |
|
|
int convert= 0; |
|
|
|
|
|
temp= malloc(inlength); |
|
|
rest= malloc(inlength); |
|
|
|
|
|
do { |
|
|
/* If comment */ |
|
|
if((convert= sscanf(in_line, "#%[^\n\r]", rest))) { |
|
|
free(temp); free(rest); |
|
|
return; |
|
|
} |
|
745 |
|
|
746 |
/* If string */ |
while ((c = getopt (argc, argv, "i")) != -1) |
747 |
if((convert= sscanf(in_line, "\"%[^\"\n\r]\" %[^\n\r]", temp, rest))) { |
switch (c) |
748 |
push_cstring(&(env->head), temp); |
{ |
749 |
break; |
case 'i': |
750 |
} |
myenv.interactive = 1; |
|
/* If integer */ |
|
|
if((convert= sscanf(in_line, "%d %[^\n\r]", &itemp, rest))) { |
|
|
push_int(&(env->head), itemp); |
|
|
break; |
|
|
} |
|
|
/* Escape ';' with '\' */ |
|
|
if((convert= sscanf(in_line, "\\%c%[^\n\r]", temp, rest))) { |
|
|
temp[1]= '\0'; |
|
|
push_sym(env, temp); |
|
|
break; |
|
|
} |
|
|
/* If symbol */ |
|
|
if((convert= sscanf(in_line, "%[^][ ;\n\r]%[^\n\r]", temp, rest))) { |
|
|
push_sym(env, temp); |
|
|
break; |
|
|
} |
|
|
/* If single char */ |
|
|
if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) { |
|
|
if(*temp==';') { |
|
|
if(!env->non_eval_flag) { |
|
|
eval(env); /* Evaluate top element */ |
|
|
break; |
|
|
} |
|
|
|
|
|
push_sym(env, ";"); |
|
751 |
break; |
break; |
752 |
|
case '?': |
753 |
|
fprintf (stderr, |
754 |
|
"Unknown option character '\\x%x'.\n", |
755 |
|
optopt); |
756 |
|
return EX_USAGE; |
757 |
|
default: |
758 |
|
abort (); |
759 |
} |
} |
760 |
|
|
761 |
|
if (optind < argc) { |
762 |
|
myenv.interactive = 0; |
763 |
|
myenv.inputstream= fopen(argv[optind], "r"); |
764 |
|
if(myenv.inputstream== NULL) { |
765 |
|
perror(argv[0]); |
766 |
|
exit (EX_NOINPUT); |
767 |
|
} |
768 |
|
} |
769 |
|
|
770 |
if(*temp==']') { |
if(myenv.interactive) |
771 |
push_sym(env, "["); |
puts(start_message); |
|
pack(env); |
|
|
if(env->non_eval_flag) |
|
|
env->non_eval_flag--; |
|
|
break; |
|
|
} |
|
772 |
|
|
773 |
if(*temp=='[') { |
while(1) { |
774 |
push_sym(env, "["); |
if(myenv.in_string==NULL) { |
775 |
env->non_eval_flag++; |
if (myenv.interactive) { |
776 |
break; |
if(myenv.err) { |
777 |
|
printf("(error %d)\n", myenv.err); |
778 |
|
myenv.err= 0; |
779 |
|
} |
780 |
|
printf("\n"); |
781 |
|
printstack(&myenv); |
782 |
|
printf("> "); |
783 |
} |
} |
784 |
|
myenv.err=0; |
785 |
|
} |
786 |
|
readstream(&myenv, myenv.inputstream); |
787 |
|
if (myenv.err) { /* EOF or other error */ |
788 |
|
myenv.err=0; |
789 |
|
quit(&myenv); |
790 |
|
} else if(myenv.head->type!=empty |
791 |
|
&& CAR(myenv.head)->type==symb |
792 |
|
&& CAR(myenv.head)->content.sym->id[0] == ';') { |
793 |
|
if(myenv.head->type != empty) |
794 |
|
myenv.head= CDR(myenv.head); |
795 |
|
eval(&myenv); |
796 |
|
} else { |
797 |
|
gc_maybe(&myenv); |
798 |
} |
} |
|
} while(0); |
|
|
|
|
|
free(temp); |
|
|
|
|
|
if(convert<2) { |
|
|
free(rest); |
|
|
return; |
|
799 |
} |
} |
800 |
|
quit(&myenv); |
801 |
stack_read(env, rest); |
return EXIT_FAILURE; |
|
|
|
|
free(rest); |
|
802 |
} |
} |
803 |
|
|
|
/* Relocate elements of the list on the stack. */ |
|
|
extern void expand(environment *env) |
|
|
{ |
|
|
stackitem *temp, *new_head; |
|
|
|
|
|
/* Is top element a list? */ |
|
|
if(env->head==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
if(env->head->item->type!=list) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
|
|
|
rev(env); |
|
|
|
|
|
if(env->err) |
|
|
return; |
|
|
|
|
|
/* The first list element is the new stack head */ |
|
|
new_head= temp= env->head->item->content.ptr; |
|
|
|
|
|
env->head->item->refcount++; |
|
|
toss(env); |
|
|
|
|
|
/* Find the end of the list */ |
|
|
while(temp->next!=NULL) |
|
|
temp= temp->next; |
|
804 |
|
|
805 |
/* Connect the tail of the list with the old stack head */ |
/* Return copy of a value */ |
806 |
temp->next= env->head; |
value *copy_val(environment *env, value *old_value) |
|
env->head= new_head; /* ...and voila! */ |
|
|
|
|
|
} |
|
|
|
|
|
/* Compares two elements by reference. */ |
|
|
extern void eq(environment *env) |
|
807 |
{ |
{ |
808 |
void *left, *right; |
value *new_value; |
|
int result; |
|
809 |
|
|
810 |
if((env->head)==NULL || env->head->next==NULL) { |
if(old_value==NULL) |
811 |
printerr("Too Few Arguments"); |
return NULL; |
|
env->err=1; |
|
|
return; |
|
|
} |
|
812 |
|
|
813 |
left= env->head->item->content.ptr; |
new_value= new_val(env); |
814 |
swap(env); |
new_value->type= old_value->type; |
|
right= env->head->item->content.ptr; |
|
|
result= (left==right); |
|
|
|
|
|
toss(env); toss(env); |
|
|
push_int(&(env->head), result); |
|
|
} |
|
815 |
|
|
816 |
/* Negates the top element on the stack. */ |
switch(old_value->type){ |
817 |
extern void not(environment *env) |
case tfloat: |
818 |
{ |
case integer: |
819 |
int val; |
case func: |
820 |
|
case symb: |
821 |
|
case empty: |
822 |
|
case unknown: |
823 |
|
case port: |
824 |
|
new_value->content= old_value->content; |
825 |
|
break; |
826 |
|
case string: |
827 |
|
new_value->content.string= strdup(old_value->content.string); |
828 |
|
break; |
829 |
|
case tcons: |
830 |
|
|
831 |
if((env->head)==NULL) { |
new_value->content.c= malloc(sizeof(pair)); |
832 |
printerr("Too Few Arguments"); |
assert(new_value->content.c!=NULL); |
833 |
env->err=1; |
env->gc_count += sizeof(pair); |
|
return; |
|
|
} |
|
834 |
|
|
835 |
if(env->head->item->type!=integer) { |
CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */ |
836 |
printerr("Bad Argument Type"); |
CDR(new_value)= copy_val(env, CDR(old_value)); /* recurse */ |
837 |
env->err=2; |
break; |
|
return; |
|
838 |
} |
} |
839 |
|
|
840 |
val= env->head->item->content.val; |
return new_value; |
|
toss(env); |
|
|
push_int(&(env->head), !val); |
|
841 |
} |
} |
842 |
|
|
|
/* Compares the two top elements on the stack and return 0 if they're the |
|
|
same. */ |
|
|
extern void neq(environment *env) |
|
|
{ |
|
|
eq(env); |
|
|
not(env); |
|
|
} |
|
843 |
|
|
844 |
/* Give a symbol some content. */ |
/* read a line from a stream; used by readline */ |
845 |
extern void def(environment *env) |
void readlinestream(environment *env, FILE *stream) |
846 |
{ |
{ |
847 |
symbol *sym; |
char in_string[101]; |
848 |
|
|
849 |
/* Needs two values on the stack, the top one must be a symbol */ |
if(fgets(in_string, 100, stream)==NULL) { |
850 |
if(env->head==NULL || env->head->next==NULL) { |
push_cstring(env, ""); |
851 |
printerr("Too Few Arguments"); |
if (! feof(stream)){ |
852 |
env->err=1; |
perror("readline"); |
853 |
return; |
env->err= 5; |
854 |
} |
} |
855 |
|
} else { |
856 |
if(env->head->item->type!=symb) { |
push_cstring(env, in_string); |
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
857 |
} |
} |
|
|
|
|
/* long names are a pain */ |
|
|
sym=env->head->item->content.ptr; |
|
|
|
|
|
/* if the symbol was bound to something else, throw it away */ |
|
|
if(sym->val != NULL) |
|
|
free_val(sym->val); |
|
|
|
|
|
/* Bind the symbol to the value */ |
|
|
sym->val= env->head->next->item; |
|
|
sym->val->refcount++; /* Increase the reference counter */ |
|
|
|
|
|
toss(env); toss(env); |
|
|
} |
|
|
|
|
|
/* Quit stack. */ |
|
|
extern void quit(environment *env) |
|
|
{ |
|
|
exit(EXIT_SUCCESS); |
|
858 |
} |
} |
859 |
|
|
|
/* Clear stack */ |
|
|
extern void clear(environment *env) |
|
|
{ |
|
|
while(env->head!=NULL) |
|
|
toss(env); |
|
|
} |
|
860 |
|
|
861 |
/* List all defined words */ |
/* Reverse (flip) a list */ |
862 |
extern void words(environment *env) |
extern void rev(environment *env) |
863 |
{ |
{ |
864 |
symbol *temp; |
value *old_head, *new_head, *item; |
|
int i; |
|
|
|
|
|
for(i= 0; i<HASHTBLSIZE; i++) { |
|
|
temp= env->symbols[i]; |
|
|
while(temp!=NULL) { |
|
|
printf("%s\n", temp->id); |
|
|
temp= temp->next; |
|
|
} |
|
|
} |
|
|
} |
|
865 |
|
|
866 |
/* Forgets a symbol (remove it from the hash table) */ |
if(CAR(env->head)->type==empty) |
867 |
extern void forget(environment *env) |
return; /* Don't reverse an empty list */ |
|
{ |
|
|
char* sym_id; |
|
|
stackitem *stack_head= env->head; |
|
|
symbol **hash_entry, *temp; |
|
868 |
|
|
869 |
if(stack_head==NULL) { |
switch(check_args(env, tcons, empty)) { |
870 |
printerr("Too Few Arguments"); |
case 1: |
871 |
env->err=1; |
printerr(env, "Too Few Arguments"); |
872 |
return; |
return; |
873 |
} |
case 2: |
874 |
|
printerr(env, "Bad Argument Type"); |
|
if(stack_head->item->type!=symb) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
875 |
return; |
return; |
876 |
|
default: |
877 |
|
break; |
878 |
} |
} |
879 |
|
|
880 |
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
old_head= CAR(env->head); |
881 |
toss(env); |
new_head= new_val(env); |
882 |
|
while(old_head->type != empty) { |
883 |
hash_entry= hash(env->symbols, sym_id); |
item= old_head; |
884 |
temp= *hash_entry; |
old_head= CDR(old_head); |
885 |
*hash_entry= (*hash_entry)->next; |
CDR(item)= new_head; |
886 |
|
new_head= item; |
|
if(temp->val!=NULL) { |
|
|
free_val(temp->val); |
|
887 |
} |
} |
888 |
free(temp->id); |
CAR(env->head)= new_head; |
|
free(temp); |
|
889 |
} |
} |
890 |
|
|
|
/* Returns the current error number to the stack */ |
|
|
extern void errn(environment *env){ |
|
|
push_int(&(env->head), env->err); |
|
|
} |
|
891 |
|
|
892 |
int main() |
/* Make a list. */ |
893 |
|
extern void pack(environment *env) |
894 |
{ |
{ |
895 |
environment myenv; |
value *iterator, *temp, *ending; |
|
char in_string[100]; |
|
896 |
|
|
897 |
init_env(&myenv); |
ending=new_val(env); |
898 |
|
|
899 |
printf("okidok\n "); |
iterator= env->head; |
900 |
|
if(iterator->type == empty |
901 |
|
|| (CAR(iterator)->type==symb |
902 |
|
&& CAR(iterator)->content.sym->id[0]=='[')) { |
903 |
|
temp= ending; |
904 |
|
if(env->head->type != empty) |
905 |
|
env->head= CDR(env->head); |
906 |
|
} else { |
907 |
|
/* Search for first delimiter */ |
908 |
|
while(CDR(iterator)->type != empty |
909 |
|
&& (CAR(CDR(iterator))->type!=symb |
910 |
|
|| CAR(CDR(iterator))->content.sym->id[0]!='[')) |
911 |
|
iterator= CDR(iterator); |
912 |
|
|
913 |
|
/* Extract list */ |
914 |
|
temp= env->head; |
915 |
|
env->head= CDR(iterator); |
916 |
|
CDR(iterator)= ending; |
917 |
|
|
918 |
while(fgets(in_string, 100, stdin) != NULL) { |
if(env->head->type != empty) |
919 |
stack_read(&myenv, in_string); |
env->head= CDR(env->head); |
|
if(myenv.err) { |
|
|
printf("(error %d) ", myenv.err); |
|
|
myenv.err=0; |
|
|
} |
|
|
printf("okidok\n "); |
|
920 |
} |
} |
|
quit(&myenv); |
|
|
return EXIT_FAILURE; |
|
|
} |
|
921 |
|
|
922 |
/* + */ |
/* Push list */ |
|
extern void sx_2b(environment *env) { |
|
|
int a, b; |
|
|
size_t len; |
|
|
char* new_string; |
|
|
value *a_val, *b_val; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
923 |
|
|
924 |
if(env->head->item->type==string |
push_val(env, temp); |
925 |
&& env->head->next->item->type==string) { |
rev(env); |
|
a_val= env->head->item; |
|
|
b_val= env->head->next->item; |
|
|
a_val->refcount++; |
|
|
b_val->refcount++; |
|
|
toss(env); if(env->err) return; |
|
|
toss(env); if(env->err) return; |
|
|
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
|
|
new_string= malloc(len); |
|
|
strcpy(new_string, b_val->content.ptr); |
|
|
strcat(new_string, a_val->content.ptr); |
|
|
free_val(a_val); free_val(b_val); |
|
|
push_cstring(&(env->head), new_string); |
|
|
free(new_string); |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=integer |
|
|
|| env->head->next->item->type!=integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
a=env->head->item->content.val; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
b=env->head->item->content.val; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
push_int(&(env->head), a+b); |
|
926 |
} |
} |
927 |
|
|
|
/* - */ |
|
|
extern void sx_2d(environment *env) { |
|
|
int a; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=integer |
|
|
|| env->head->next->item->type!=integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
a=env->head->item->content.val; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
env->head->item->content.val -= a; |
|
|
} |
|
928 |
|
|
929 |
/* > */ |
/* read from a stream; used by "read" and "readport" */ |
930 |
extern void sx_3e(environment *env) { |
void readstream(environment *env, FILE *stream) |
931 |
int a; |
{ |
932 |
|
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n"; |
933 |
|
const char strform[]= "\"%[^\"]\"%n"; |
934 |
|
const char intform[]= "%i%n"; |
935 |
|
const char fltform[]= "%f%n"; |
936 |
|
const char blankform[]= "%*[ \t]%n"; |
937 |
|
const char ebrackform[]= "]%n"; |
938 |
|
const char semicform[]= ";%n"; |
939 |
|
const char bbrackform[]= "[%n"; |
940 |
|
|
941 |
|
int itemp, readlength= -1; |
942 |
|
int count= -1; |
943 |
|
float ftemp; |
944 |
|
static int depth= 0; |
945 |
|
char *match; |
946 |
|
size_t inlength; |
947 |
|
|
948 |
|
if(env->in_string==NULL) { |
949 |
|
if(depth > 0 && env->interactive) { |
950 |
|
printf("]> "); |
951 |
|
} |
952 |
|
readlinestream(env, env->inputstream); |
953 |
|
if(env->err) return; |
954 |
|
|
955 |
if((env->head)==NULL || env->head->next==NULL) { |
if((CAR(env->head)->content.string)[0]=='\0'){ |
956 |
printerr("Too Few Arguments"); |
env->err= 4; /* "" means EOF */ |
957 |
env->err=1; |
return; |
958 |
return; |
} |
959 |
|
|
960 |
|
env->in_string= malloc(strlen(CAR(env->head)->content.string)+1); |
961 |
|
assert(env->in_string != NULL); |
962 |
|
env->free_string= env->in_string; /* Save the original pointer */ |
963 |
|
strcpy(env->in_string, CAR(env->head)->content.string); |
964 |
|
env->head= CDR(env->head); |
965 |
} |
} |
966 |
|
|
967 |
if(env->head->item->type!=integer |
inlength= strlen(env->in_string)+1; |
968 |
|| env->head->next->item->type!=integer) { |
match= malloc(inlength); |
969 |
printerr("Bad Argument Type"); |
assert(match != NULL); |
970 |
env->err=2; |
|
971 |
return; |
if(sscanf(env->in_string, blankform, &readlength) != EOF |
972 |
} |
&& readlength != -1) { |
973 |
a=env->head->item->content.val; |
; |
974 |
toss(env); |
} else if(sscanf(env->in_string, fltform, &ftemp, &readlength) != EOF |
975 |
if(env->err) return; |
&& readlength != -1) { |
976 |
env->head->item->content.val = (env->head->item->content.val > a); |
if(sscanf(env->in_string, intform, &itemp, &count) != EOF |
977 |
} |
&& count==readlength) { |
978 |
|
push_int(env, itemp); |
979 |
/* Return copy of a value */ |
} else { |
980 |
value *copy_val(value *old_value){ |
push_float(env, ftemp); |
981 |
stackitem *old_item, *new_item, *prev_item; |
} |
982 |
|
} else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF |
983 |
value *new_value=malloc(sizeof(value)); |
&& readlength != -1) { |
984 |
|
push_cstring(env, ""); |
985 |
new_value->type=old_value->type; |
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
986 |
new_value->refcount=0; /* This is increased if/when this |
&& readlength != -1) { |
987 |
value is referenced somewhere, like |
push_cstring(env, match); |
988 |
in a stack item or a variable */ |
} else if(sscanf(env->in_string, symbform, match, &readlength) != EOF |
989 |
switch(old_value->type){ |
&& readlength != -1) { |
990 |
case integer: |
push_sym(env, match); |
991 |
new_value->content.val=old_value->content.val; |
} else if(sscanf(env->in_string, ebrackform, &readlength) != EOF |
992 |
break; |
&& readlength != -1) { |
993 |
case string: |
pack(env); if(env->err) return; |
994 |
(char *)(new_value->content.ptr) |
if(depth != 0) depth--; |
995 |
= strdup((char *)(old_value->content.ptr)); |
} else if(sscanf(env->in_string, semicform, &readlength) != EOF |
996 |
break; |
&& readlength != -1) { |
997 |
case func: |
push_sym(env, ";"); |
998 |
case symb: |
} else if(sscanf(env->in_string, bbrackform, &readlength) != EOF |
999 |
new_value->content.ptr=old_value->content.ptr; |
&& readlength != -1) { |
1000 |
break; |
push_sym(env, "["); |
1001 |
case list: |
depth++; |
1002 |
new_value->content.ptr=NULL; |
} else { |
1003 |
|
free(env->free_string); |
1004 |
prev_item=NULL; |
env->in_string = env->free_string = NULL; |
|
old_item=(stackitem *)(old_value->content.ptr); |
|
|
|
|
|
while(old_item != NULL) { /* While list is not empty */ |
|
|
new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item=copy_val(old_item->item); /* recurse */ |
|
|
new_item->next=NULL; |
|
|
if(prev_item != NULL) /* If this wasn't the first item */ |
|
|
prev_item->next=new_item; /* point the previous item to the |
|
|
new item */ |
|
|
else |
|
|
new_value->content.ptr=new_item; |
|
|
old_item=old_item->next; |
|
|
prev_item=new_item; |
|
|
} |
|
|
break; |
|
|
} |
|
|
return new_value; |
|
|
} |
|
|
|
|
|
/* duplicates an item on the stack */ |
|
|
extern void dup(environment *env) { |
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
push_val(&(env->head), copy_val(env->head->item)); |
|
|
} |
|
|
|
|
|
/* "if", If-Then */ |
|
|
extern void sx_6966(environment *env) { |
|
|
|
|
|
int truth; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
1005 |
} |
} |
1006 |
|
if (env->in_string != NULL) { |
1007 |
if(env->head->next->item->type != integer) { |
env->in_string += readlength; |
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
1008 |
} |
} |
|
|
|
|
swap(env); |
|
|
if(env->err) return; |
|
|
|
|
|
truth=env->head->item->content.val; |
|
1009 |
|
|
1010 |
toss(env); |
free(match); |
|
if(env->err) return; |
|
1011 |
|
|
1012 |
if(truth) |
if(depth) |
1013 |
eval(env); |
return readstream(env, env->inputstream); |
|
else |
|
|
toss(env); |
|
1014 |
} |
} |
1015 |
|
|
|
/* If-Then-Else */ |
|
|
extern void ifelse(environment *env) { |
|
1016 |
|
|
1017 |
int truth; |
int check_args(environment *env, ...) |
1018 |
|
{ |
1019 |
if((env->head)==NULL || env->head->next==NULL |
va_list ap; |
1020 |
|| env->head->next->next==NULL) { |
enum type_enum mytype; |
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->next->next->item->type != integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
|
|
|
rot(env); |
|
|
if(env->err) return; |
|
|
|
|
|
truth=env->head->item->content.val; |
|
|
|
|
|
toss(env); |
|
|
if(env->err) return; |
|
1021 |
|
|
1022 |
if(!truth) |
value *iter= env->head; |
1023 |
swap(env); |
int errval= 0; |
|
if(env->err) return; |
|
1024 |
|
|
1025 |
toss(env); |
va_start(ap, env); |
1026 |
if(env->err) return; |
while(1) { |
1027 |
|
mytype= va_arg(ap, enum type_enum); |
1028 |
|
// fprintf(stderr, "%s\n", env->errsymb); |
1029 |
|
|
1030 |
eval(env); |
if(mytype==empty) |
1031 |
} |
break; |
1032 |
|
|
1033 |
|
if(iter->type==empty || iter==NULL) { |
1034 |
|
errval= 1; |
1035 |
|
break; |
1036 |
|
} |
1037 |
|
|
1038 |
/* while */ |
if(mytype==unknown) { |
1039 |
extern void sx_7768696c65(environment *env) { |
iter=CDR(iter); |
1040 |
|
continue; |
1041 |
|
} |
1042 |
|
|
1043 |
int truth; |
if(CAR(iter)->type!=mytype) { |
1044 |
|
errval= 2; |
1045 |
|
break; |
1046 |
|
} |
1047 |
|
|
1048 |
if((env->head)==NULL || env->head->next==NULL) { |
iter= CDR(iter); |
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
1049 |
} |
} |
1050 |
|
|
1051 |
do { |
va_end(ap); |
1052 |
swap(env); if(env->err) return; |
|
1053 |
dup(env); if(env->err) return; |
env->err= errval; |
1054 |
eval(env); if(env->err) return; |
return errval; |
|
|
|
|
if(env->head->item->type != integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
|
|
|
truth= env->head->item->content.val; |
|
|
|
|
|
toss(env); if(env->err) return; |
|
|
swap(env); if(env->err) return; |
|
|
|
|
|
if(truth) { |
|
|
dup(env); |
|
|
eval(env); |
|
|
} else { |
|
|
toss(env); |
|
|
toss(env); |
|
|
} |
|
|
|
|
|
} while(truth); |
|
1055 |
} |
} |