1 |
/* printf */ |
/* -*- coding: utf-8; -*- */ |
2 |
#include <stdio.h> |
/* |
3 |
/* EXIT_SUCCESS */ |
stack - an interactive interpreter for a stack-based language |
4 |
#include <stdlib.h> |
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn |
|
/* NULL */ |
|
|
#include <stddef.h> |
|
|
/* dlopen, dlsym, dlerror */ |
|
|
#include <dlfcn.h> |
|
|
/* assert */ |
|
|
#include <assert.h> |
|
|
|
|
|
#define HASHTBLSIZE 65536 |
|
|
|
|
|
typedef struct stack_item |
|
|
{ |
|
|
enum { |
|
|
value, /* Integer */ |
|
|
string, |
|
|
ref, /* Reference (to an element in the |
|
|
hash table) */ |
|
|
func, /* Function pointer */ |
|
|
symbol, |
|
|
list |
|
|
} type; /* Type of stack element */ |
|
|
|
|
|
union { |
|
|
void* ptr; /* Pointer to the content */ |
|
|
int val; /* ...or an integer */ |
|
|
} content; /* Stores a pointer or an integer */ |
|
|
|
|
|
char* id; /* Symbol name */ |
|
|
struct stack_item* next; /* Next element */ |
|
|
} stackitem; |
|
|
|
|
|
|
|
|
typedef stackitem* hashtbl[HASHTBLSIZE]; /* Hash table declaration */ |
|
|
typedef void (*funcp)(stackitem**); /* funcp is a pointer to a |
|
|
void function (stackitem **) */ |
|
5 |
|
|
6 |
/* Initialize a newly created hash table. */ |
This program is free software; you can redistribute it and/or modify |
7 |
void init_hashtbl(hashtbl out_hash) |
it under the terms of the GNU General Public License as published by |
8 |
|
the Free Software Foundation; either version 2 of the License, or |
9 |
|
(at your option) any later version. |
10 |
|
|
11 |
|
This program is distributed in the hope that it will be useful, |
12 |
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 |
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 |
|
GNU General Public License for more details. |
15 |
|
|
16 |
|
You should have received a copy of the GNU General Public License |
17 |
|
along with this program; if not, write to the Free Software |
18 |
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
19 |
|
|
20 |
|
Authors: Mats Alritzson <masse@fukt.bth.se> |
21 |
|
Teddy Hogeborn <teddy@fukt.bth.se> |
22 |
|
*/ |
23 |
|
|
24 |
|
#include "stack.h" |
25 |
|
|
26 |
|
const char* start_message= "Stack version $Revision$\n\ |
27 |
|
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn\n\ |
28 |
|
Stack comes with ABSOLUTELY NO WARRANTY; for details type 'warranty;'.\n\ |
29 |
|
This is free software, and you are welcome to redistribute it\n\ |
30 |
|
under certain conditions; type 'copying;' for details.\n"; |
31 |
|
|
32 |
|
|
33 |
|
/* Initialize a newly created environment */ |
34 |
|
void init_env(environment *env) |
35 |
{ |
{ |
36 |
long i; |
int i; |
37 |
|
|
38 |
|
env->gc_limit= 400000; |
39 |
|
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 |
out_hash[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 |
|
|
52 |
/* Returns a pointer to an element in the hash table. */ |
|
53 |
stackitem** hash(hashtbl in_hashtbl, const char* in_string) |
void printerr(environment *env, const char* in_string) |
54 |
{ |
{ |
55 |
long i= 0; |
fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string); |
56 |
unsigned long out_hash= 0; |
} |
57 |
|
|
58 |
|
|
59 |
|
/* Returns a pointer to a pointer to an element in the hash table. */ |
60 |
|
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
61 |
|
{ |
62 |
|
int i= 0; |
63 |
|
unsigned int out_hash= 0; |
64 |
char key= '\0'; |
char key= '\0'; |
65 |
stackitem** position; |
symbol **position; |
66 |
|
|
67 |
while(1){ /* Hash in_string */ |
while(1){ /* Hash in_string */ |
68 |
key= in_string[i++]; |
key= in_string[i++]; |
74 |
out_hash= out_hash%HASHTBLSIZE; |
out_hash= out_hash%HASHTBLSIZE; |
75 |
position= &(in_hashtbl[out_hash]); |
position= &(in_hashtbl[out_hash]); |
76 |
|
|
77 |
while(position != NULL){ |
while(1){ |
78 |
if(*position==NULL) /* If empty */ |
if(*position==NULL) /* If empty */ |
79 |
return position; |
return position; |
80 |
|
|
83 |
|
|
84 |
position= &((*position)->next); /* Try next */ |
position= &((*position)->next); /* Try next */ |
85 |
} |
} |
|
return NULL; /* end of list reached without finding |
|
|
an empty position */ |
|
86 |
} |
} |
87 |
|
|
88 |
/* Generic push function. */ |
|
89 |
int push(stackitem** stack_head, stackitem* in_item) |
/* Create new value */ |
90 |
|
value* new_val(environment *env) |
91 |
{ |
{ |
92 |
in_item->next= *stack_head; |
value *nval= malloc(sizeof(value)); |
93 |
*stack_head= in_item; |
stackitem *nitem= malloc(sizeof(stackitem)); |
94 |
return 1; |
|
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 |
/* Push a value on the stack. */ |
|
114 |
int push_val(stackitem** stack_head, int in_val) |
/* Mark values recursively. |
115 |
|
Marked values are not collected by the GC. */ |
116 |
|
inline void gc_mark(value *val) |
117 |
{ |
{ |
118 |
stackitem* new_item= malloc(sizeof(stackitem)); |
if(val==NULL || val->gc.flag.mark) |
119 |
assert(new_item != NULL); |
return; |
120 |
new_item->content.val= in_val; |
|
121 |
new_item->type= value; |
val->gc.flag.mark= 1; |
122 |
|
|
123 |
push(stack_head, new_item); |
if(val->type==tcons) { |
124 |
return 1; |
gc_mark(CAR(val)); |
125 |
|
gc_mark(CDR(val)); |
126 |
|
} |
127 |
} |
} |
128 |
|
|
129 |
/* Copy a string onto the stack. */ |
|
130 |
int push_cstring(stackitem** stack_head, const char* in_string) |
/* Start GC */ |
131 |
|
extern void gc_init(environment *env) |
132 |
{ |
{ |
133 |
stackitem* new_item= malloc(sizeof(stackitem)); |
stackitem *new_head= NULL, *titem; |
134 |
new_item->content.ptr= malloc(strlen(in_string)+1); |
symbol *tsymb; |
135 |
strcpy(new_item->content.ptr, in_string); |
int i; |
136 |
new_item->type= string; |
|
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 |
|
|
|
push(stack_head, new_item); |
|
|
return 1; |
|
232 |
} |
} |
233 |
|
|
234 |
/* Create a new hash entry. */ |
|
235 |
int mk_hashentry(hashtbl in_hashtbl, stackitem* in_item, const char* id) |
inline void gc_maybe(environment *env) |
236 |
|
{ |
237 |
|
if(env->gc_count < env->gc_limit) |
238 |
|
return; |
239 |
|
else |
240 |
|
return gc_init(env); |
241 |
|
} |
242 |
|
|
243 |
|
|
244 |
|
/* Protect values from GC */ |
245 |
|
void protect(value *val) |
246 |
{ |
{ |
247 |
in_item->id= malloc(strlen(id)+1); |
if(val==NULL || val->gc.flag.protect) |
248 |
|
return; |
249 |
|
|
250 |
strcpy(in_item->id, id); |
val->gc.flag.protect= 1; |
|
push(hash(in_hashtbl, id), in_item); |
|
251 |
|
|
252 |
return 1; |
if(val->type==tcons) { |
253 |
|
protect(CAR(val)); |
254 |
|
protect(CDR(val)); |
255 |
|
} |
256 |
} |
} |
257 |
|
|
258 |
/* Define a new function in the hash table. */ |
|
259 |
void def_func(hashtbl in_hashtbl, funcp in_func, const char* id) |
/* Unprotect values from GC */ |
260 |
|
void unprotect(value *val) |
261 |
{ |
{ |
262 |
stackitem* temp= malloc(sizeof(stackitem)); |
if(val==NULL || !(val->gc.flag.protect)) |
263 |
|
return; |
264 |
|
|
265 |
temp->type= func; |
val->gc.flag.protect= 0; |
|
temp->content.ptr= in_func; |
|
266 |
|
|
267 |
mk_hashentry(in_hashtbl, temp, id); |
if(val->type==tcons) { |
268 |
|
unprotect(CAR(val)); |
269 |
|
unprotect(CDR(val)); |
270 |
|
} |
271 |
} |
} |
272 |
|
|
273 |
/* Define a new symbol in the hash table. */ |
|
274 |
void def_sym(hashtbl in_hashtbl, const char* id) |
/* Push a value onto the stack */ |
275 |
|
void push_val(environment *env, value *val) |
276 |
{ |
{ |
277 |
stackitem* temp= malloc(sizeof(stackitem)); |
value *new_value= new_val(env); |
278 |
|
|
279 |
temp->type= symbol; |
new_value->content.c= malloc(sizeof(pair)); |
280 |
mk_hashentry(in_hashtbl, temp, id); |
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 a reference to an entry in the hash table onto the stack. */ |
|
289 |
int push_ref(stackitem** stack_head, hashtbl in_hash, const char* in_string) |
/* Push an integer onto the stack */ |
290 |
|
void push_int(environment *env, int in_val) |
291 |
{ |
{ |
292 |
static void* handle= NULL; |
value *new_value= new_val(env); |
293 |
void* symbol; |
|
294 |
|
new_value->content.i= in_val; |
295 |
|
new_value->type= integer; |
296 |
|
|
297 |
stackitem* new_item= malloc(sizeof(stackitem)); |
push_val(env, new_value); |
298 |
new_item->content.ptr= *hash(in_hash, in_string); |
} |
|
new_item->type= ref; |
|
299 |
|
|
|
if(new_item->content.ptr==NULL) { /* If hash entry empty */ |
|
|
if(handle==NULL) /* If no handle */ |
|
|
handle= dlopen(NULL, RTLD_LAZY); |
|
300 |
|
|
301 |
symbol= dlsym(handle, in_string); /* Get function pointer */ |
/* Push a floating point number onto the stack */ |
302 |
if(dlerror()==NULL) /* If existing function pointer */ |
void push_float(environment *env, float in_val) |
303 |
def_func(in_hash, symbol, in_string); /* Store function pointer */ |
{ |
304 |
else |
value *new_value= new_val(env); |
|
def_sym(in_hash, in_string); /* Make symbol */ |
|
|
|
|
|
new_item->content.ptr= *hash(in_hash, in_string); /* XXX */ |
|
|
new_item->type= ref; |
|
|
} |
|
305 |
|
|
306 |
push(stack_head, new_item); |
new_value->content.f= in_val; |
307 |
return 1; |
new_value->type= tfloat; |
308 |
|
|
309 |
|
push_val(env, new_value); |
310 |
} |
} |
311 |
|
|
312 |
void printerr(const char* in_string) { |
|
313 |
fprintf(stderr, "Err: %s\n", in_string); |
/* Copy a string onto the stack. */ |
314 |
|
void push_cstring(environment *env, const char *in_string) |
315 |
|
{ |
316 |
|
value *new_value= new_val(env); |
317 |
|
int length= strlen(in_string)+1; |
318 |
|
|
319 |
|
new_value->content.string= malloc(length); |
320 |
|
assert(new_value != NULL); |
321 |
|
env->gc_count += length; |
322 |
|
strcpy(new_value->content.string, in_string); |
323 |
|
new_value->type= string; |
324 |
|
|
325 |
|
push_val(env, new_value); |
326 |
} |
} |
327 |
|
|
328 |
/* Discard the top element of the stack. */ |
|
329 |
extern void toss(stackitem** stack_head) |
/* Mangle a symbol name to a valid C identifier name */ |
330 |
|
char *mangle_str(const char *old_string) |
331 |
{ |
{ |
332 |
stackitem* temp= *stack_head; |
char validchars[]= "0123456789abcdef"; |
333 |
|
char *new_string, *current; |
334 |
|
|
335 |
if((*stack_head)==NULL) { |
new_string= malloc((strlen(old_string)*2)+4); |
336 |
printerr("Stack empty"); |
assert(new_string != NULL); |
337 |
return; |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
338 |
|
current= new_string+3; |
339 |
|
|
340 |
|
while(old_string[0] != '\0'){ |
341 |
|
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
342 |
|
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
343 |
|
current+= 2; |
344 |
|
old_string++; |
345 |
} |
} |
346 |
|
current[0]= '\0'; |
|
if((*stack_head)->type==string) |
|
|
free((*stack_head)->content.ptr); |
|
347 |
|
|
348 |
*stack_head= (*stack_head)->next; |
return new_string; /* The caller must free() it */ |
|
free(temp); |
|
349 |
} |
} |
350 |
|
|
351 |
/* Print newline. */ |
|
352 |
extern void nl() |
/* Push a symbol onto the stack. */ |
353 |
|
void push_sym(environment *env, const char *in_string) |
354 |
{ |
{ |
355 |
printf("\n"); |
value *new_value; /* A new symbol value */ |
356 |
|
/* ...which might point to... */ |
357 |
|
symbol **new_symbol; /* (if needed) A new actual symbol */ |
358 |
|
/* ...which, if possible, will be bound to... */ |
359 |
|
value *new_fvalue; /* (if needed) A new function value */ |
360 |
|
/* ...which will point to... */ |
361 |
|
void *funcptr; /* A function pointer */ |
362 |
|
|
363 |
|
static void *handle= NULL; /* Dynamic linker handle */ |
364 |
|
const char *dlerr; /* Dynamic linker error */ |
365 |
|
char *mangled; /* Mangled function name */ |
366 |
|
|
367 |
|
new_value= new_val(env); |
368 |
|
new_fvalue= new_val(env); |
369 |
|
|
370 |
|
/* The new value is a symbol */ |
371 |
|
new_value->type= symb; |
372 |
|
|
373 |
|
/* Look up the symbol name in the hash table */ |
374 |
|
new_symbol= hash(env->symbols, in_string); |
375 |
|
new_value->content.sym= *new_symbol; |
376 |
|
|
377 |
|
if(*new_symbol==NULL) { /* If symbol was undefined */ |
378 |
|
|
379 |
|
/* Create a new symbol */ |
380 |
|
(*new_symbol)= malloc(sizeof(symbol)); |
381 |
|
assert((*new_symbol) != NULL); |
382 |
|
(*new_symbol)->val= NULL; /* undefined value */ |
383 |
|
(*new_symbol)->next= NULL; |
384 |
|
(*new_symbol)->id= malloc(strlen(in_string)+1); |
385 |
|
assert((*new_symbol)->id != NULL); |
386 |
|
strcpy((*new_symbol)->id, in_string); |
387 |
|
|
388 |
|
/* Intern the new symbol in the hash table */ |
389 |
|
new_value->content.sym= *new_symbol; |
390 |
|
|
391 |
|
/* 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 */ |
393 |
|
if(handle==NULL) /* If no handle */ |
394 |
|
handle= dlopen(NULL, RTLD_LAZY); |
395 |
|
|
396 |
|
mangled= mangle_str(in_string); /* mangle the name */ |
397 |
|
funcptr= dlsym(handle, mangled); /* and try to find it */ |
398 |
|
|
399 |
|
dlerr= dlerror(); |
400 |
|
if(dlerr != NULL) { /* If no function was found */ |
401 |
|
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
402 |
|
dlerr= dlerror(); |
403 |
|
} |
404 |
|
|
405 |
|
if(dlerr==NULL) { /* If a function was found */ |
406 |
|
new_fvalue->type= func; /* The new value is a function pointer */ |
407 |
|
new_fvalue->content.func= funcptr; /* Store function pointer */ |
408 |
|
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
409 |
|
function value */ |
410 |
|
} |
411 |
|
|
412 |
|
free(mangled); |
413 |
|
} |
414 |
|
|
415 |
|
push_val(env, new_value); |
416 |
} |
} |
417 |
|
|
418 |
/* Prints the top element of the stack. */ |
|
419 |
void print_(stackitem** stack_head) |
/* Print a value */ |
420 |
|
void print_val(environment *env, value *val, int noquote, stackitem *stack, |
421 |
|
FILE *stream) |
422 |
{ |
{ |
423 |
if((*stack_head)==NULL) { |
stackitem *titem, *tstack; |
424 |
printerr("Stack empty"); |
int depth; |
|
return; |
|
|
} |
|
425 |
|
|
426 |
switch((*stack_head)->type) { |
switch(val->type) { |
427 |
case value: |
case empty: |
428 |
printf("%d", (*stack_head)->content.val); |
if(fprintf(stream, "[]") < 0){ |
429 |
|
perror("print_val"); |
430 |
|
env->err= 5; |
431 |
|
return; |
432 |
|
} |
433 |
|
break; |
434 |
|
case unknown: |
435 |
|
if(fprintf(stream, "UNKNOWN") < 0){ |
436 |
|
perror("print_val"); |
437 |
|
env->err= 5; |
438 |
|
return; |
439 |
|
} |
440 |
|
break; |
441 |
|
case integer: |
442 |
|
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)->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 ref: |
case symb: |
471 |
printf("%s", ((stackitem*)(*stack_head)->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 symbol: |
case func: |
478 |
default: |
if(fprintf(stream, "#<function %p>", val->content.func) < 0){ |
479 |
printf("%p", (*stack_head)->content.ptr); |
perror("print_val"); |
480 |
|
env->err= 5; |
481 |
|
return; |
482 |
|
} |
483 |
break; |
break; |
484 |
} |
case port: |
485 |
} |
if(fprintf(stream, "#<port %p>", val->content.p) < 0){ |
486 |
|
perror("print_val"); |
487 |
|
env->err= 5; |
488 |
|
return; |
489 |
|
} |
490 |
|
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 |
/* Prints the top element of the stack and then discards it. */ |
do { |
500 |
extern void print(stackitem** stack_head) |
titem=malloc(sizeof(stackitem)); |
501 |
{ |
assert(titem != NULL); |
502 |
print_(stack_head); |
titem->item=val; |
503 |
toss(stack_head); |
titem->next=tstack; |
504 |
} |
tstack=titem; /* Put it on the stack */ |
505 |
|
/* 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 |
|
if(titem != NULL){ /* If we found it on the stack, */ |
516 |
|
if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */ |
517 |
|
perror("print_val"); |
518 |
|
env->err= 5; |
519 |
|
free(titem); |
520 |
|
return; |
521 |
|
} |
522 |
|
} else { |
523 |
|
print_val(env, CAR(val), noquote, tstack, stream); |
524 |
|
} |
525 |
|
|
526 |
|
val= CDR(val); |
527 |
|
switch(val->type){ |
528 |
|
case empty: |
529 |
|
break; |
530 |
|
case tcons: |
531 |
|
/* Search a stack of values being printed to see if we are already |
532 |
|
printing this value */ |
533 |
|
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 |
/* Only to be called by function printstack. */ |
printval_end: |
|
void print_st(stackitem* stack_head, long counter) |
|
|
{ |
|
|
if(stack_head->next != NULL) |
|
|
print_st(stack_head->next, counter+1); |
|
565 |
|
|
566 |
printf("%ld: ", counter); |
titem=tstack; |
567 |
print_(&stack_head); |
while(titem != stack){ |
568 |
nl(); |
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 |
|
} |
581 |
} |
} |
582 |
|
|
583 |
/* Prints the stack. */ |
|
584 |
extern void printstack(stackitem** stack_head) |
/* Swap the two top elements on the stack. */ |
585 |
|
extern void swap(environment *env) |
586 |
{ |
{ |
587 |
if(*stack_head != NULL) { |
value *temp= env->head; |
588 |
print_st(*stack_head, 1); |
|
589 |
printf("\n"); |
if(env->head->type == empty || CDR(env->head)->type == empty) { |
590 |
} else { |
printerr(env, "Too Few Arguments"); |
591 |
printerr("Stack empty"); |
env->err=1; |
592 |
|
return; |
593 |
} |
} |
|
} |
|
594 |
|
|
595 |
/* If the top element is a reference, determine if it's a reference to a |
env->head= CDR(env->head); |
596 |
function, and if it is, toss the reference and execute the function. */ |
CDR(temp)= CDR(env->head); |
597 |
extern void eval(stackitem** stack_head) |
CDR(env->head)= temp; |
598 |
|
} |
599 |
|
|
600 |
|
|
601 |
|
/* Recall a value from a symbol, if bound */ |
602 |
|
extern void rcl(environment *env) |
603 |
{ |
{ |
604 |
funcp in_func; |
value *val; |
605 |
|
|
606 |
if((*stack_head)==NULL || (*stack_head)->type!=ref) { |
if(env->head->type==empty) { |
607 |
printerr("Stack empty or not a reference"); |
printerr(env, "Too Few Arguments"); |
608 |
|
env->err= 1; |
609 |
return; |
return; |
610 |
} |
} |
611 |
|
|
612 |
if(((stackitem*)(*stack_head)->content.ptr)->type==func) { |
if(CAR(env->head)->type!=symb) { |
613 |
in_func= (funcp)((stackitem*)(*stack_head)->content.ptr)->content.ptr; |
printerr(env, "Bad Argument Type"); |
614 |
toss(stack_head); |
env->err= 2; |
|
(*in_func)(stack_head); |
|
615 |
return; |
return; |
616 |
} else |
} |
617 |
printerr("Not a function"); |
|
618 |
|
val= CAR(env->head)->content.sym->val; |
619 |
|
if(val == NULL){ |
620 |
|
printerr(env, "Unbound Variable"); |
621 |
|
env->err= 3; |
622 |
|
return; |
623 |
|
} |
624 |
|
push_val(env, val); /* Return the symbol's bound value */ |
625 |
|
swap(env); |
626 |
|
if(env->err) return; |
627 |
|
env->head= CDR(env->head); |
628 |
} |
} |
629 |
|
|
630 |
/* Make a list. */ |
|
631 |
extern void pack(stackitem** stack_head) |
/* If the top element is a symbol, determine if it's bound to a |
632 |
|
function value, and if it is, toss the symbol and execute the |
633 |
|
function. */ |
634 |
|
extern void eval(environment *env) |
635 |
{ |
{ |
636 |
void* delimiter; |
funcp in_func; |
637 |
stackitem *iterator, *temp, *pack; |
value* temp_val; |
638 |
|
value* iterator; |
639 |
|
|
640 |
|
eval_start: |
641 |
|
|
642 |
if((*stack_head)==NULL) { |
gc_maybe(env); |
643 |
printerr("Stack empty"); |
|
644 |
|
if(env->head->type==empty) { |
645 |
|
printerr(env, "Too Few Arguments"); |
646 |
|
env->err= 1; |
647 |
return; |
return; |
648 |
} |
} |
649 |
|
|
650 |
delimiter= (*stack_head)->content.ptr; /* Get delimiter */ |
switch(CAR(env->head)->type) { |
651 |
toss(stack_head); |
/* if it's a symbol */ |
652 |
|
case symb: |
653 |
|
env->errsymb= CAR(env->head)->content.sym->id; |
654 |
|
rcl(env); /* get its contents */ |
655 |
|
if(env->err) return; |
656 |
|
if(CAR(env->head)->type!=symb){ /* don't recurse symbols */ |
657 |
|
goto eval_start; |
658 |
|
} |
659 |
|
return; |
660 |
|
|
661 |
|
/* If it's a lone function value, run it */ |
662 |
|
case func: |
663 |
|
in_func= CAR(env->head)->content.func; |
664 |
|
env->head= CDR(env->head); |
665 |
|
return in_func(env); |
666 |
|
|
667 |
|
/* If it's a list */ |
668 |
|
case tcons: |
669 |
|
temp_val= CAR(env->head); |
670 |
|
protect(temp_val); |
671 |
|
|
672 |
iterator= *stack_head; |
env->head= CDR(env->head); |
673 |
|
iterator= temp_val; |
674 |
|
|
675 |
|
while(iterator->type != empty) { |
676 |
|
push_val(env, CAR(iterator)); |
677 |
|
|
678 |
|
if(CAR(env->head)->type==symb |
679 |
|
&& CAR(env->head)->content.sym->id[0]==';') { |
680 |
|
env->head= CDR(env->head); |
681 |
|
|
682 |
|
if(CDR(iterator)->type == empty){ |
683 |
|
goto eval_start; |
684 |
|
} |
685 |
|
eval(env); |
686 |
|
if(env->err) return; |
687 |
|
} |
688 |
|
if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons) |
689 |
|
iterator= CDR(iterator); |
690 |
|
else { |
691 |
|
printerr(env, "Bad Argument Type"); /* Improper list */ |
692 |
|
env->err= 2; |
693 |
|
return; |
694 |
|
} |
695 |
|
} |
696 |
|
unprotect(temp_val); |
697 |
|
return; |
698 |
|
|
699 |
/* Search for first delimiter */ |
case empty: |
700 |
while(iterator->next!=NULL && iterator->next->content.ptr!=delimiter) |
env->head= CDR(env->head); |
701 |
iterator= iterator->next; |
case integer: |
702 |
|
case tfloat: |
703 |
|
case string: |
704 |
|
case port: |
705 |
|
case unknown: |
706 |
|
return; |
707 |
|
} |
708 |
|
} |
709 |
|
|
|
/* Extract list */ |
|
|
temp= *stack_head; |
|
|
*stack_head= iterator->next; |
|
|
iterator->next= NULL; |
|
|
|
|
|
if(*stack_head!=NULL && (*stack_head)->content.ptr==delimiter) |
|
|
toss(stack_head); |
|
710 |
|
|
711 |
/* Push list */ |
/* Internal forget function */ |
712 |
pack= malloc(sizeof(stackitem)); |
void forget_sym(symbol **hash_entry) |
713 |
pack->type= list; |
{ |
714 |
pack->content.ptr= temp; |
symbol *temp; |
715 |
|
|
716 |
push(stack_head, pack); |
temp= *hash_entry; |
717 |
|
*hash_entry= (*hash_entry)->next; |
718 |
|
|
719 |
|
free(temp->id); |
720 |
|
free(temp); |
721 |
} |
} |
722 |
|
|
723 |
/* Parse input. */ |
|
724 |
int stack_read(stackitem** stack_head, hashtbl in_hash, char* in_line) |
int main(int argc, char **argv) |
725 |
{ |
{ |
726 |
char *temp, *rest; |
environment myenv; |
727 |
int itemp; |
int c; /* getopt option character */ |
|
size_t inlength= strlen(in_line)+1; |
|
|
int convert= 0; |
|
|
static int non_eval_flag= 0; |
|
728 |
|
|
729 |
temp= malloc(inlength); |
#ifdef __linux__ |
730 |
rest= malloc(inlength); |
mtrace(); |
731 |
|
#endif |
732 |
|
|
733 |
do { |
init_env(&myenv); |
|
/* If string */ |
|
|
if((convert= sscanf(in_line, "\"%[^\"\n\r]\" %[^\n\r]", temp, rest))) { |
|
|
push_cstring(stack_head, temp); |
|
|
break; |
|
|
} |
|
|
/* If value */ |
|
|
if((convert= sscanf(in_line, "%d %[^\n\r]", &itemp, rest))) { |
|
|
push_val(stack_head, itemp); |
|
|
break; |
|
|
} |
|
|
/* Escape ';' with '\' */ |
|
|
if((convert= sscanf(in_line, "\\%c%[^\n\r]", temp, rest))) { |
|
|
temp[1]= '\0'; |
|
|
push_ref(stack_head, in_hash, temp); |
|
|
break; |
|
|
} |
|
|
/* If symbol */ |
|
|
if((convert= sscanf(in_line, "%[^] ;\n\r]%[^\n\r]", temp, rest))) { |
|
|
push_ref(stack_head, in_hash, temp); |
|
|
break; |
|
|
} |
|
|
/* If single char */ |
|
|
if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) { |
|
|
if(*temp==';') { |
|
|
if(non_eval_flag) { |
|
|
eval(stack_head); /* Evaluate top element */ |
|
|
break; |
|
|
} |
|
|
|
|
|
push_ref(stack_head, in_hash, ";"); |
|
|
break; |
|
|
} |
|
734 |
|
|
735 |
if(*temp==']') { |
myenv.interactive = isatty(STDIN_FILENO) && isatty(STDOUT_FILENO); |
|
push_ref(stack_head, in_hash, "["); |
|
|
pack(stack_head); |
|
|
non_eval_flag--; |
|
|
break; |
|
|
} |
|
736 |
|
|
737 |
if(*temp=='[') { |
while ((c = getopt (argc, argv, "i")) != -1) |
738 |
push_ref(stack_head, in_hash, "["); |
switch (c) |
739 |
non_eval_flag++; |
{ |
740 |
|
case 'i': |
741 |
|
myenv.interactive = 1; |
742 |
break; |
break; |
743 |
|
case '?': |
744 |
|
fprintf (stderr, |
745 |
|
"Unknown option character '\\x%x'.\n", |
746 |
|
optopt); |
747 |
|
return EX_USAGE; |
748 |
|
default: |
749 |
|
abort (); |
750 |
} |
} |
751 |
|
|
752 |
|
if (optind < argc) { |
753 |
|
myenv.interactive = 0; |
754 |
|
myenv.inputstream= fopen(argv[optind], "r"); |
755 |
|
if(myenv.inputstream== NULL) { |
756 |
|
perror(argv[0]); |
757 |
|
exit (EX_NOINPUT); |
758 |
} |
} |
759 |
} while(0); |
} |
|
|
|
760 |
|
|
761 |
free(temp); |
if(myenv.interactive) |
762 |
|
printf(start_message); |
763 |
|
|
764 |
if(convert<2) { |
while(1) { |
765 |
free(rest); |
if(myenv.in_string==NULL) { |
766 |
return 0; |
if (myenv.interactive) { |
767 |
|
if(myenv.err) { |
768 |
|
printf("(error %d)\n", myenv.err); |
769 |
|
myenv.err= 0; |
770 |
|
} |
771 |
|
printf("\n"); |
772 |
|
printstack(&myenv); |
773 |
|
printf("> "); |
774 |
|
} |
775 |
|
myenv.err=0; |
776 |
|
} |
777 |
|
readstream(&myenv, myenv.inputstream); |
778 |
|
if (myenv.err) { /* EOF or other error */ |
779 |
|
myenv.err=0; |
780 |
|
quit(&myenv); |
781 |
|
} else if(myenv.head->type!=empty |
782 |
|
&& CAR(myenv.head)->type==symb |
783 |
|
&& CAR(myenv.head)->content.sym->id[0] == ';') { |
784 |
|
if(myenv.head->type != empty) |
785 |
|
myenv.head= CDR(myenv.head); |
786 |
|
eval(&myenv); |
787 |
|
} else { |
788 |
|
gc_maybe(&myenv); |
789 |
|
} |
790 |
} |
} |
791 |
|
quit(&myenv); |
792 |
stack_read(stack_head, in_hash, rest); |
return EXIT_FAILURE; |
|
|
|
|
free(rest); |
|
|
return 1; |
|
793 |
} |
} |
794 |
|
|
795 |
/* Relocate elements of the list on the stack. */ |
|
796 |
extern void expand(stackitem** stack_head) |
/* Return copy of a value */ |
797 |
|
value *copy_val(environment *env, value *old_value) |
798 |
{ |
{ |
799 |
stackitem *temp, *new_head; |
value *new_value; |
800 |
|
|
801 |
/* Is top element a list? */ |
if(old_value==NULL) |
802 |
if((*stack_head)==NULL || (*stack_head)->type!=list) { |
return NULL; |
|
printerr("Stack empty or not a list"); |
|
|
return; |
|
|
} |
|
803 |
|
|
804 |
/* The first list element is the new stack head */ |
new_value= new_val(env); |
805 |
new_head= temp= (*stack_head)->content.ptr; |
new_value->type= old_value->type; |
|
toss(stack_head); |
|
806 |
|
|
807 |
/* Search the end of the list */ |
switch(old_value->type){ |
808 |
while(temp->next!=NULL) |
case tfloat: |
809 |
temp= temp->next; |
case integer: |
810 |
|
case func: |
811 |
|
case symb: |
812 |
|
case empty: |
813 |
|
case unknown: |
814 |
|
case port: |
815 |
|
new_value->content= old_value->content; |
816 |
|
break; |
817 |
|
case string: |
818 |
|
new_value->content.string= strdup(old_value->content.string); |
819 |
|
break; |
820 |
|
case tcons: |
821 |
|
|
822 |
/* Connect the the tail of the list with the old stack head */ |
new_value->content.c= malloc(sizeof(pair)); |
823 |
temp->next= *stack_head; |
assert(new_value->content.c!=NULL); |
824 |
*stack_head= new_head; /* ...and voila! */ |
env->gc_count += sizeof(pair); |
|
} |
|
825 |
|
|
826 |
/* Swap the two top elements on the stack. */ |
CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */ |
827 |
extern void swap(stackitem** stack_head) |
CDR(new_value)= copy_val(env, CDR(old_value)); /* recurse */ |
828 |
{ |
break; |
|
stackitem* temp= (*stack_head); |
|
|
|
|
|
if((*stack_head)==NULL) { |
|
|
printerr("Stack empty"); |
|
|
return; |
|
829 |
} |
} |
830 |
|
|
831 |
if((*stack_head)->next==NULL) |
return new_value; |
832 |
return; |
} |
833 |
|
|
|
*stack_head= (*stack_head)->next; |
|
|
temp->next= (*stack_head)->next; |
|
|
(*stack_head)->next= temp; |
|
|
} |
|
834 |
|
|
835 |
/* Compares two elements by reference. */ |
/* read a line from a stream; used by readline */ |
836 |
extern void eq(stackitem** stack_head) |
void readlinestream(environment *env, FILE *stream) |
837 |
{ |
{ |
838 |
void *left, *right; |
char in_string[101]; |
|
int result; |
|
839 |
|
|
840 |
if((*stack_head)==NULL || (*stack_head)->next==NULL) { |
if(fgets(in_string, 100, stream)==NULL) { |
841 |
printerr("Not enough elements to compare"); |
push_cstring(env, ""); |
842 |
return; |
if (! feof(stream)){ |
843 |
|
perror("readline"); |
844 |
|
env->err= 5; |
845 |
|
} |
846 |
|
} else { |
847 |
|
push_cstring(env, in_string); |
848 |
} |
} |
|
|
|
|
left= (*stack_head)->content.ptr; |
|
|
swap(stack_head); |
|
|
right= (*stack_head)->content.ptr; |
|
|
result= (left==right); |
|
|
|
|
|
toss(stack_head); toss(stack_head); |
|
|
push_val(stack_head, (left==right)); |
|
849 |
} |
} |
850 |
|
|
851 |
/* Negates the top element on the stack. */ |
|
852 |
extern void not(stackitem** stack_head) |
/* Reverse (flip) a list */ |
853 |
|
extern void rev(environment *env) |
854 |
{ |
{ |
855 |
int value; |
value *old_head, *new_head, *item; |
856 |
|
|
857 |
if((*stack_head)==NULL || (*stack_head)->type!=value) { |
if(env->head->type==empty) { |
858 |
printerr("Stack empty or element is not a value"); |
printerr(env, "Too Few Arguments"); |
859 |
|
env->err= 1; |
860 |
return; |
return; |
861 |
} |
} |
862 |
|
|
863 |
value= (*stack_head)->content.val; |
if(CAR(env->head)->type==empty) |
864 |
toss(stack_head); |
return; /* Don't reverse an empty list */ |
|
push_val(stack_head, !value); |
|
|
} |
|
865 |
|
|
866 |
/* Compares the two top elements on the stack and return 0 if they're the |
if(CAR(env->head)->type!=tcons) { |
867 |
same. */ |
printerr(env, "Bad Argument Type"); |
868 |
extern void neq(stackitem** stack_head) |
env->err= 2; |
869 |
{ |
return; |
870 |
eq(stack_head); |
} |
871 |
not(stack_head); |
|
872 |
|
old_head= CAR(env->head); |
873 |
|
new_head= new_val(env); |
874 |
|
while(old_head->type != empty) { |
875 |
|
item= old_head; |
876 |
|
old_head= CDR(old_head); |
877 |
|
CDR(item)= new_head; |
878 |
|
new_head= item; |
879 |
|
} |
880 |
|
CAR(env->head)= new_head; |
881 |
} |
} |
882 |
|
|
883 |
/* Give a symbol some content. */ |
|
884 |
extern void def(stackitem** stack_head) |
/* Make a list. */ |
885 |
|
extern void pack(environment *env) |
886 |
{ |
{ |
887 |
stackitem *temp, *value; |
value *iterator, *temp, *ending; |
888 |
|
|
889 |
if(*stack_head==NULL || (*stack_head)->next==NULL |
ending=new_val(env); |
890 |
|| (*stack_head)->type!=ref) { |
|
891 |
printerr("Define what?"); |
iterator= env->head; |
892 |
return; |
if(iterator->type == empty |
893 |
|
|| (CAR(iterator)->type==symb |
894 |
|
&& CAR(iterator)->content.sym->id[0]=='[')) { |
895 |
|
temp= ending; |
896 |
|
if(env->head->type != empty) |
897 |
|
env->head= CDR(env->head); |
898 |
|
} else { |
899 |
|
/* Search for first delimiter */ |
900 |
|
while(CDR(iterator)->type != empty |
901 |
|
&& (CAR(CDR(iterator))->type!=symb |
902 |
|
|| CAR(CDR(iterator))->content.sym->id[0]!='[')) |
903 |
|
iterator= CDR(iterator); |
904 |
|
|
905 |
|
/* Extract list */ |
906 |
|
temp= env->head; |
907 |
|
env->head= CDR(iterator); |
908 |
|
CDR(iterator)= ending; |
909 |
|
|
910 |
|
if(env->head->type != empty) |
911 |
|
env->head= CDR(env->head); |
912 |
} |
} |
913 |
|
|
914 |
temp= (*stack_head)->content.ptr; |
/* Push list */ |
|
value= (*stack_head)->next; |
|
|
temp->content= value->content; |
|
|
value->content.ptr=NULL; |
|
|
temp->type= value->type; |
|
915 |
|
|
916 |
toss(stack_head); toss(stack_head); |
push_val(env, temp); |
917 |
} |
rev(env); |
918 |
|
} |
919 |
|
|
920 |
/* Quit stack. */ |
|
921 |
extern void quit() |
/* read from a stream; used by "read" and "readport" */ |
922 |
|
void readstream(environment *env, FILE *stream) |
923 |
{ |
{ |
924 |
exit(EXIT_SUCCESS); |
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n"; |
925 |
|
const char strform[]= "\"%[^\"]\"%n"; |
926 |
|
const char intform[]= "%i%n"; |
927 |
|
const char fltform[]= "%f%n"; |
928 |
|
const char blankform[]= "%*[ \t]%n"; |
929 |
|
const char ebrackform[]= "]%n"; |
930 |
|
const char semicform[]= ";%n"; |
931 |
|
const char bbrackform[]= "[%n"; |
932 |
|
|
933 |
|
int itemp, readlength= -1; |
934 |
|
int count= -1; |
935 |
|
float ftemp; |
936 |
|
static int depth= 0; |
937 |
|
char *match; |
938 |
|
size_t inlength; |
939 |
|
|
940 |
|
if(env->in_string==NULL) { |
941 |
|
if(depth > 0 && env->interactive) { |
942 |
|
printf("]> "); |
943 |
|
} |
944 |
|
readlinestream(env, env->inputstream); |
945 |
|
if(env->err) return; |
946 |
|
|
947 |
|
if((CAR(env->head)->content.string)[0]=='\0'){ |
948 |
|
env->err= 4; /* "" means EOF */ |
949 |
|
return; |
950 |
|
} |
951 |
|
|
952 |
|
env->in_string= malloc(strlen(CAR(env->head)->content.string)+1); |
953 |
|
assert(env->in_string != NULL); |
954 |
|
env->free_string= env->in_string; /* Save the original pointer */ |
955 |
|
strcpy(env->in_string, CAR(env->head)->content.string); |
956 |
|
env->head= CDR(env->head); |
957 |
|
} |
958 |
|
|
959 |
|
inlength= strlen(env->in_string)+1; |
960 |
|
match= malloc(inlength); |
961 |
|
assert(match != NULL); |
962 |
|
|
963 |
|
if(sscanf(env->in_string, blankform, &readlength) != EOF |
964 |
|
&& readlength != -1) { |
965 |
|
; |
966 |
|
} else if(sscanf(env->in_string, fltform, &ftemp, &readlength) != EOF |
967 |
|
&& readlength != -1) { |
968 |
|
if(sscanf(env->in_string, intform, &itemp, &count) != EOF |
969 |
|
&& count==readlength) { |
970 |
|
push_int(env, itemp); |
971 |
|
} else { |
972 |
|
push_float(env, ftemp); |
973 |
|
} |
974 |
|
} else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF |
975 |
|
&& readlength != -1) { |
976 |
|
push_cstring(env, ""); |
977 |
|
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
978 |
|
&& readlength != -1) { |
979 |
|
push_cstring(env, match); |
980 |
|
} else if(sscanf(env->in_string, symbform, match, &readlength) != EOF |
981 |
|
&& readlength != -1) { |
982 |
|
push_sym(env, match); |
983 |
|
} else if(sscanf(env->in_string, ebrackform, &readlength) != EOF |
984 |
|
&& readlength != -1) { |
985 |
|
pack(env); if(env->err) return; |
986 |
|
if(depth != 0) depth--; |
987 |
|
} else if(sscanf(env->in_string, semicform, &readlength) != EOF |
988 |
|
&& readlength != -1) { |
989 |
|
push_sym(env, ";"); |
990 |
|
} else if(sscanf(env->in_string, bbrackform, &readlength) != EOF |
991 |
|
&& readlength != -1) { |
992 |
|
push_sym(env, "["); |
993 |
|
depth++; |
994 |
|
} else { |
995 |
|
free(env->free_string); |
996 |
|
env->in_string = env->free_string = NULL; |
997 |
|
} |
998 |
|
if (env->in_string != NULL) { |
999 |
|
env->in_string += readlength; |
1000 |
|
} |
1001 |
|
|
1002 |
|
free(match); |
1003 |
|
|
1004 |
|
if(depth) |
1005 |
|
return readstream(env, env->inputstream); |
1006 |
} |
} |
1007 |
|
|
1008 |
int main() |
|
1009 |
|
int check_args(environment *env, ...) |
1010 |
{ |
{ |
1011 |
stackitem* s= NULL; |
va_list ap; |
1012 |
hashtbl myhash; |
enum type_enum mytype; |
1013 |
char in_string[100]; |
|
1014 |
|
value *iter= env->head; |
1015 |
|
int errval= 0; |
1016 |
|
|
1017 |
|
va_start(ap, env); |
1018 |
|
while(1) { |
1019 |
|
mytype= va_arg(ap, enum type_enum); |
1020 |
|
// fprintf(stderr, "%s\n", env->errsymb); |
1021 |
|
|
1022 |
|
if(mytype==empty) |
1023 |
|
break; |
1024 |
|
|
1025 |
|
if(iter->type==empty || iter==NULL) { |
1026 |
|
errval= 1; |
1027 |
|
break; |
1028 |
|
} |
1029 |
|
|
1030 |
init_hashtbl(myhash); |
if(mytype==unknown) { |
1031 |
|
iter=CDR(iter); |
1032 |
|
continue; |
1033 |
|
} |
1034 |
|
|
1035 |
printf("okidok\n "); |
if(CAR(iter)->type!=mytype) { |
1036 |
|
errval= 2; |
1037 |
|
break; |
1038 |
|
} |
1039 |
|
|
1040 |
while(fgets(in_string, 100, stdin) != NULL) { |
iter= CDR(iter); |
|
stack_read(&s, myhash, in_string); |
|
|
printf("okidok\n "); |
|
1041 |
} |
} |
1042 |
|
|
1043 |
exit(EXIT_SUCCESS); |
va_end(ap); |
|
} |
|
1044 |
|
|
1045 |
/* Local Variables: */ |
env->err= errval; |
1046 |
/* compile-command:"make CFLAGS=\"-Wall -g -rdynamic -ldl\" stack" */ |
return errval; |
1047 |
/* End: */ |
} |