23 |
|
|
24 |
#include "stack.h" |
#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."; |
31 |
|
|
32 |
|
|
33 |
/* Initialize a newly created environment */ |
/* Initialize a newly created environment */ |
34 |
void init_env(environment *env) |
void init_env(environment *env) |
35 |
{ |
{ |
49 |
env->interactive= 1; |
env->interactive= 1; |
50 |
} |
} |
51 |
|
|
52 |
void printerr(const char* in_string) |
|
53 |
|
void printerr(environment *env) |
54 |
{ |
{ |
55 |
fprintf(stderr, "Err: %s\n", in_string); |
char *in_string; |
56 |
|
|
57 |
|
switch(env->err) { |
58 |
|
case 0: |
59 |
|
return; |
60 |
|
case 1: |
61 |
|
in_string= "Too Few Arguments"; |
62 |
|
break; |
63 |
|
case 2: |
64 |
|
in_string= "Bad Argument Type"; |
65 |
|
break; |
66 |
|
case 3: |
67 |
|
in_string= "Unbound Variable"; |
68 |
|
break; |
69 |
|
case 5: |
70 |
|
return perror(env->errsymb); |
71 |
|
default: |
72 |
|
in_string= "Unknown error"; |
73 |
|
break; |
74 |
|
} |
75 |
|
|
76 |
|
fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string); |
77 |
} |
} |
78 |
|
|
79 |
|
|
80 |
/* 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. */ |
81 |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
82 |
{ |
{ |
106 |
} |
} |
107 |
} |
} |
108 |
|
|
109 |
|
|
110 |
/* Create new value */ |
/* Create new value */ |
111 |
value* new_val(environment *env) |
value* new_val(environment *env) |
112 |
{ |
{ |
164 |
if(env->interactive) |
if(env->interactive) |
165 |
printf("."); |
printf("."); |
166 |
|
|
|
|
|
167 |
/* Mark values in hashtable */ |
/* Mark values in hashtable */ |
168 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
169 |
for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next) |
for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next) |
170 |
if (tsymb->val != NULL) |
if (tsymb->val != NULL) |
171 |
gc_mark(tsymb->val); |
gc_mark(tsymb->val); |
172 |
|
|
|
|
|
173 |
if(env->interactive) |
if(env->interactive) |
174 |
printf("."); |
printf("."); |
175 |
|
|
176 |
env->gc_count= 0; |
env->gc_count= 0; |
177 |
|
|
178 |
while(env->gc_ref!=NULL) { /* Sweep unused values */ |
while(env->gc_ref!=NULL) { /* Sweep unused values */ |
|
|
|
179 |
if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */ |
if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */ |
180 |
|
|
181 |
/* Remove content */ |
/* Remove content */ |
182 |
switch(env->gc_ref->item->type){ |
switch(env->gc_ref->item->type){ |
183 |
case string: |
case string: |
184 |
free(env->gc_ref->item->content.ptr); |
free(env->gc_ref->item->content.string); |
185 |
break; |
break; |
186 |
case tcons: |
case tcons: |
187 |
free(env->gc_ref->item->content.c); |
free(env->gc_ref->item->content.c); |
188 |
break; |
break; |
189 |
case port: |
case port: |
190 |
case empty: |
case empty: |
191 |
|
case unknown: |
192 |
case integer: |
case integer: |
193 |
case tfloat: |
case tfloat: |
194 |
case func: |
case func: |
203 |
env->gc_ref= titem; |
env->gc_ref= titem; |
204 |
continue; |
continue; |
205 |
} |
} |
206 |
|
|
207 |
#ifdef DEBUG |
#ifdef DEBUG |
208 |
printf("Kept value (%p)", env->gc_ref->item); |
printf("Kept value (%p)", env->gc_ref->item); |
209 |
if(env->gc_ref->item->gc.flag.mark) |
if(env->gc_ref->item->gc.flag.mark) |
215 |
printf(" integer: %d", env->gc_ref->item->content.i); |
printf(" integer: %d", env->gc_ref->item->content.i); |
216 |
break; |
break; |
217 |
case func: |
case func: |
218 |
printf(" func: %p", env->gc_ref->item->content.ptr); |
printf(" func: %p", env->gc_ref->item->content.func); |
219 |
break; |
break; |
220 |
case symb: |
case symb: |
221 |
printf(" symb: %s", env->gc_ref->item->content.sym->id); |
printf(" symb: %s", env->gc_ref->item->content.sym->id); |
233 |
/* Keep values */ |
/* Keep values */ |
234 |
env->gc_count += sizeof(value); |
env->gc_count += sizeof(value); |
235 |
if(env->gc_ref->item->type==string) |
if(env->gc_ref->item->type==string) |
236 |
env->gc_count += strlen(env->gc_ref->item->content.ptr)+1; |
env->gc_count += strlen(env->gc_ref->item->content.string)+1; |
237 |
|
|
238 |
titem= env->gc_ref->next; |
titem= env->gc_ref->next; |
239 |
env->gc_ref->next= new_head; |
env->gc_ref->next= new_head; |
252 |
|
|
253 |
} |
} |
254 |
|
|
255 |
|
|
256 |
inline void gc_maybe(environment *env) |
inline void gc_maybe(environment *env) |
257 |
{ |
{ |
258 |
if(env->gc_count < env->gc_limit) |
if(env->gc_count < env->gc_limit) |
261 |
return gc_init(env); |
return gc_init(env); |
262 |
} |
} |
263 |
|
|
264 |
|
|
265 |
/* Protect values from GC */ |
/* Protect values from GC */ |
266 |
void protect(value *val) |
void protect(value *val) |
267 |
{ |
{ |
276 |
} |
} |
277 |
} |
} |
278 |
|
|
279 |
|
|
280 |
/* Unprotect values from GC */ |
/* Unprotect values from GC */ |
281 |
void unprotect(value *val) |
void unprotect(value *val) |
282 |
{ |
{ |
291 |
} |
} |
292 |
} |
} |
293 |
|
|
294 |
|
|
295 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
296 |
void push_val(environment *env, value *val) |
void push_val(environment *env, value *val) |
297 |
{ |
{ |
306 |
env->head= new_value; |
env->head= new_value; |
307 |
} |
} |
308 |
|
|
309 |
|
|
310 |
/* Push an integer onto the stack */ |
/* Push an integer onto the stack */ |
311 |
void push_int(environment *env, int in_val) |
void push_int(environment *env, int in_val) |
312 |
{ |
{ |
318 |
push_val(env, new_value); |
push_val(env, new_value); |
319 |
} |
} |
320 |
|
|
321 |
|
|
322 |
/* Push a floating point number onto the stack */ |
/* Push a floating point number onto the stack */ |
323 |
void push_float(environment *env, float in_val) |
void push_float(environment *env, float in_val) |
324 |
{ |
{ |
330 |
push_val(env, new_value); |
push_val(env, new_value); |
331 |
} |
} |
332 |
|
|
333 |
|
|
334 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
335 |
void push_cstring(environment *env, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
336 |
{ |
{ |
337 |
value *new_value= new_val(env); |
value *new_value= new_val(env); |
338 |
int length= strlen(in_string)+1; |
int length= strlen(in_string)+1; |
339 |
|
|
340 |
new_value->content.ptr= malloc(length); |
new_value->content.string= malloc(length); |
341 |
assert(new_value != NULL); |
assert(new_value != NULL); |
342 |
env->gc_count += length; |
env->gc_count += length; |
343 |
strcpy(new_value->content.ptr, in_string); |
strcpy(new_value->content.string, in_string); |
344 |
new_value->type= string; |
new_value->type= string; |
345 |
|
|
346 |
push_val(env, new_value); |
push_val(env, new_value); |
347 |
} |
} |
348 |
|
|
349 |
|
|
350 |
/* Mangle a symbol name to a valid C identifier name */ |
/* Mangle a symbol name to a valid C identifier name */ |
351 |
char *mangle_str(const char *old_string) |
char *mangle_str(const char *old_string) |
352 |
{ |
{ |
357 |
assert(new_string != NULL); |
assert(new_string != NULL); |
358 |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
359 |
current= new_string+3; |
current= new_string+3; |
360 |
|
|
361 |
while(old_string[0] != '\0'){ |
while(old_string[0] != '\0'){ |
362 |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
363 |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
369 |
return new_string; /* The caller must free() it */ |
return new_string; /* The caller must free() it */ |
370 |
} |
} |
371 |
|
|
|
extern void mangle(environment *env) |
|
|
{ |
|
|
char *new_string; |
|
|
|
|
|
if(env->head->type==empty) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(CAR(env->head)->type!=string) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
|
|
|
|
new_string= |
|
|
mangle_str((const char *)(CAR(env->head)->content.ptr)); |
|
|
|
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
|
|
|
push_cstring(env, new_string); |
|
|
} |
|
372 |
|
|
373 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
374 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
386 |
char *mangled; /* Mangled function name */ |
char *mangled; /* Mangled function name */ |
387 |
|
|
388 |
new_value= new_val(env); |
new_value= new_val(env); |
|
protect(new_value); |
|
389 |
new_fvalue= new_val(env); |
new_fvalue= new_val(env); |
|
protect(new_fvalue); |
|
390 |
|
|
391 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
392 |
new_value->type= symb; |
new_value->type= symb; |
393 |
|
|
394 |
/* Look up the symbol name in the hash table */ |
/* Look up the symbol name in the hash table */ |
395 |
new_symbol= hash(env->symbols, in_string); |
new_symbol= hash(env->symbols, in_string); |
396 |
new_value->content.ptr= *new_symbol; |
new_value->content.sym= *new_symbol; |
397 |
|
|
398 |
if(*new_symbol==NULL) { /* If symbol was undefined */ |
if(*new_symbol==NULL) { /* If symbol was undefined */ |
399 |
|
|
407 |
strcpy((*new_symbol)->id, in_string); |
strcpy((*new_symbol)->id, in_string); |
408 |
|
|
409 |
/* Intern the new symbol in the hash table */ |
/* Intern the new symbol in the hash table */ |
410 |
new_value->content.ptr= *new_symbol; |
new_value->content.sym= *new_symbol; |
411 |
|
|
412 |
/* 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 |
413 |
we should bind the symbol to a new function pointer value */ |
we should bind the symbol to a new function pointer value */ |
425 |
|
|
426 |
if(dlerr==NULL) { /* If a function was found */ |
if(dlerr==NULL) { /* If a function was found */ |
427 |
new_fvalue->type= func; /* The new value is a function pointer */ |
new_fvalue->type= func; /* The new value is a function pointer */ |
428 |
new_fvalue->content.ptr= funcptr; /* Store function pointer */ |
new_fvalue->content.func= funcptr; /* Store function pointer */ |
429 |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
430 |
function value */ |
function value */ |
431 |
} |
} |
434 |
} |
} |
435 |
|
|
436 |
push_val(env, new_value); |
push_val(env, new_value); |
|
unprotect(new_value); unprotect(new_fvalue); |
|
437 |
} |
} |
438 |
|
|
439 |
|
|
440 |
/* Print a value */ |
/* Print a value */ |
441 |
void print_val(environment *env, value *val, int noquote, stackitem *stack, FILE *stream) |
void print_val(environment *env, value *val, int noquote, stackitem *stack, |
442 |
|
FILE *stream) |
443 |
{ |
{ |
444 |
stackitem *titem, *tstack; |
stackitem *titem, *tstack; |
445 |
int depth; |
int depth; |
446 |
|
|
447 |
switch(val->type) { |
switch(val->type) { |
448 |
case empty: |
case empty: |
449 |
if(fprintf(stream, "[]") < 0){ |
if(fprintf(stream, "[]") < 0) |
450 |
perror("print_val"); |
env->err= 5; |
451 |
|
break; |
452 |
|
case unknown: |
453 |
|
if(fprintf(stream, "UNKNOWN") < 0) |
454 |
env->err= 5; |
env->err= 5; |
|
return; |
|
|
} |
|
455 |
break; |
break; |
456 |
case integer: |
case integer: |
457 |
if(fprintf(stream, "%d", val->content.i) < 0){ |
if(fprintf(stream, "%d", val->content.i) < 0) |
|
perror("print_val"); |
|
458 |
env->err= 5; |
env->err= 5; |
|
return; |
|
|
} |
|
459 |
break; |
break; |
460 |
case tfloat: |
case tfloat: |
461 |
if(fprintf(stream, "%f", val->content.f) < 0){ |
if(fprintf(stream, "%f", val->content.f) < 0) |
|
perror("print_val"); |
|
462 |
env->err= 5; |
env->err= 5; |
|
return; |
|
|
} |
|
463 |
break; |
break; |
464 |
case string: |
case string: |
465 |
if(noquote){ |
if(noquote){ |
466 |
if(fprintf(stream, "%s", (char*)(val->content.ptr)) < 0){ |
if(fprintf(stream, "%s", val->content.string) < 0) |
|
perror("print_val"); |
|
467 |
env->err= 5; |
env->err= 5; |
|
return; |
|
|
} |
|
468 |
} else { /* quote */ |
} else { /* quote */ |
469 |
if(fprintf(stream, "\"%s\"", (char*)(val->content.ptr)) < 0){ |
if(fprintf(stream, "\"%s\"", val->content.string) < 0) |
|
perror("print_val"); |
|
470 |
env->err= 5; |
env->err= 5; |
|
return; |
|
|
} |
|
471 |
} |
} |
472 |
break; |
break; |
473 |
case symb: |
case symb: |
474 |
if(fprintf(stream, "%s", val->content.sym->id) < 0){ |
if(fprintf(stream, "%s", val->content.sym->id) < 0) |
|
perror("print_val"); |
|
475 |
env->err= 5; |
env->err= 5; |
|
return; |
|
|
} |
|
476 |
break; |
break; |
477 |
case func: |
case func: |
478 |
if(fprintf(stream, "#<function %p>", (funcp)(val->content.ptr)) < 0){ |
if(fprintf(stream, "#<function %p>", val->content.func) < 0) |
|
perror("print_val"); |
|
479 |
env->err= 5; |
env->err= 5; |
|
return; |
|
|
} |
|
480 |
break; |
break; |
481 |
case port: |
case port: |
482 |
if(fprintf(stream, "#<port %p>", (funcp)(val->content.p)) < 0){ |
if(fprintf(stream, "#<port %p>", val->content.p) < 0) |
|
perror("print_val"); |
|
483 |
env->err= 5; |
env->err= 5; |
|
return; |
|
|
} |
|
484 |
break; |
break; |
485 |
case tcons: |
case tcons: |
486 |
if(fprintf(stream, "[ ") < 0){ |
if(fprintf(stream, "[ ") < 0) { |
|
perror("print_val"); |
|
487 |
env->err= 5; |
env->err= 5; |
488 |
return; |
return printerr(env); |
489 |
} |
} |
490 |
tstack= stack; |
tstack= stack; |
491 |
|
|
492 |
do { |
do { |
493 |
titem=malloc(sizeof(stackitem)); |
titem=malloc(sizeof(stackitem)); |
494 |
assert(titem != NULL); |
assert(titem != NULL); |
499 |
printing this value */ |
printing this value */ |
500 |
titem=tstack; |
titem=tstack; |
501 |
depth=0; |
depth=0; |
502 |
|
|
503 |
while(titem != NULL && titem->item != CAR(val)){ |
while(titem != NULL && titem->item != CAR(val)){ |
504 |
titem=titem->next; |
titem=titem->next; |
505 |
depth++; |
depth++; |
506 |
} |
} |
507 |
|
|
508 |
if(titem != NULL){ /* If we found it on the stack, */ |
if(titem != NULL){ /* If we found it on the stack, */ |
509 |
if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */ |
if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */ |
|
perror("print_val"); |
|
510 |
env->err= 5; |
env->err= 5; |
511 |
free(titem); |
free(titem); |
512 |
return; |
return printerr(env); |
513 |
} |
} |
514 |
} else { |
} else { |
515 |
print_val(env, CAR(val), noquote, tstack, stream); |
print_val(env, CAR(val), noquote, tstack, stream); |
516 |
} |
} |
517 |
|
|
518 |
val= CDR(val); |
val= CDR(val); |
519 |
switch(val->type){ |
switch(val->type){ |
520 |
case empty: |
case empty: |
524 |
printing this value */ |
printing this value */ |
525 |
titem=tstack; |
titem=tstack; |
526 |
depth=0; |
depth=0; |
527 |
|
|
528 |
while(titem != NULL && titem->item != val){ |
while(titem != NULL && titem->item != val){ |
529 |
titem=titem->next; |
titem=titem->next; |
530 |
depth++; |
depth++; |
531 |
} |
} |
532 |
if(titem != NULL){ /* If we found it on the stack, */ |
if(titem != NULL){ /* If we found it on the stack, */ |
533 |
if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */ |
if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */ |
|
perror("print_val"); |
|
534 |
env->err= 5; |
env->err= 5; |
535 |
|
printerr(env); |
536 |
goto printval_end; |
goto printval_end; |
537 |
} |
} |
538 |
} else { |
} else { |
539 |
if(fprintf(stream, " ") < 0){ |
if(fprintf(stream, " ") < 0){ |
|
perror("print_val"); |
|
540 |
env->err= 5; |
env->err= 5; |
541 |
|
printerr(env); |
542 |
goto printval_end; |
goto printval_end; |
543 |
} |
} |
544 |
} |
} |
545 |
break; |
break; |
546 |
default: |
default: |
547 |
if(fprintf(stream, " . ") < 0){ /* Improper list */ |
if(fprintf(stream, " . ") < 0){ /* Improper list */ |
|
perror("print_val"); |
|
548 |
env->err= 5; |
env->err= 5; |
549 |
|
printerr(env); |
550 |
goto printval_end; |
goto printval_end; |
551 |
} |
} |
552 |
print_val(env, val, noquote, tstack, stream); |
print_val(env, val, noquote, tstack, stream); |
564 |
|
|
565 |
if(! (env->err)){ |
if(! (env->err)){ |
566 |
if(fprintf(stream, " ]") < 0){ |
if(fprintf(stream, " ]") < 0){ |
|
perror("print_val"); |
|
567 |
env->err= 5; |
env->err= 5; |
568 |
} |
} |
569 |
} |
} |
570 |
break; |
break; |
571 |
} |
} |
572 |
|
|
573 |
|
if(env->err) |
574 |
|
return printerr(env); |
575 |
} |
} |
576 |
|
|
577 |
|
|
578 |
/* Swap the two top elements on the stack. */ |
/* Swap the two top elements on the stack. */ |
579 |
extern void swap(environment *env) |
extern void swap(environment *env) |
580 |
{ |
{ |
581 |
value *temp= env->head; |
value *temp= env->head; |
|
|
|
|
if(env->head->type == empty || CDR(env->head)->type == empty) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
582 |
|
|
583 |
|
if(check_args(env, 2, unknown, unknown)) |
584 |
|
return printerr(env); |
585 |
|
|
586 |
env->head= CDR(env->head); |
env->head= CDR(env->head); |
587 |
CDR(temp)= CDR(env->head); |
CDR(temp)= CDR(env->head); |
588 |
CDR(env->head)= temp; |
CDR(env->head)= temp; |
589 |
} |
} |
590 |
|
|
591 |
|
|
592 |
/* Recall a value from a symbol, if bound */ |
/* Recall a value from a symbol, if bound */ |
593 |
extern void rcl(environment *env) |
extern void rcl(environment *env) |
594 |
{ |
{ |
595 |
value *val; |
value *val; |
596 |
|
|
597 |
if(env->head->type==empty) { |
if(check_args(env, 1, symb)) |
598 |
printerr("Too Few Arguments"); |
return printerr(env); |
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(CAR(env->head)->type!=symb) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
599 |
|
|
600 |
val= CAR(env->head)->content.sym->val; |
val= CAR(env->head)->content.sym->val; |
601 |
if(val == NULL){ |
if(val == NULL){ |
|
printerr("Unbound Variable"); |
|
602 |
env->err= 3; |
env->err= 3; |
603 |
return; |
return printerr(env); |
604 |
} |
} |
605 |
|
|
606 |
push_val(env, val); /* Return the symbol's bound value */ |
push_val(env, val); /* Return the symbol's bound value */ |
607 |
swap(env); |
swap(env); |
608 |
if(env->err) return; |
if(env->err) return; |
609 |
toss(env); /* toss the symbol */ |
env->head= CDR(env->head); |
|
if(env->err) return; |
|
610 |
} |
} |
611 |
|
|
612 |
|
|
623 |
|
|
624 |
gc_maybe(env); |
gc_maybe(env); |
625 |
|
|
626 |
if(env->head->type==empty) { |
if(check_args(env, 1, unknown)) |
627 |
printerr("Too Few Arguments"); |
return printerr(env); |
|
env->err= 1; |
|
|
return; |
|
|
} |
|
628 |
|
|
629 |
switch(CAR(env->head)->type) { |
switch(CAR(env->head)->type) { |
630 |
/* if it's a symbol */ |
/* if it's a symbol */ |
631 |
case symb: |
case symb: |
632 |
|
env->errsymb= CAR(env->head)->content.sym->id; |
633 |
rcl(env); /* get its contents */ |
rcl(env); /* get its contents */ |
634 |
if(env->err) return; |
if(env->err) return; |
635 |
if(CAR(env->head)->type!=symb){ /* don't recurse symbols */ |
if(CAR(env->head)->type!=symb){ /* don't recurse symbols */ |
639 |
|
|
640 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
641 |
case func: |
case func: |
642 |
in_func= (funcp)(CAR(env->head)->content.ptr); |
in_func= CAR(env->head)->content.func; |
643 |
toss(env); |
env->head= CDR(env->head); |
644 |
if(env->err) return; |
return in_func((void*)env); |
|
return in_func(env); |
|
645 |
|
|
646 |
/* If it's a list */ |
/* If it's a list */ |
647 |
case tcons: |
case tcons: |
648 |
temp_val= CAR(env->head); |
temp_val= CAR(env->head); |
649 |
protect(temp_val); |
protect(temp_val); |
650 |
|
|
651 |
toss(env); if(env->err) return; |
env->head= CDR(env->head); |
652 |
iterator= temp_val; |
iterator= temp_val; |
653 |
|
|
654 |
while(iterator->type != empty) { |
while(iterator->type != empty) { |
655 |
push_val(env, CAR(iterator)); |
push_val(env, CAR(iterator)); |
656 |
|
|
657 |
if(CAR(env->head)->type==symb |
if(CAR(env->head)->type==symb |
658 |
&& CAR(env->head)->content.sym->id[0]==';') { |
&& CAR(env->head)->content.sym->id[0]==';') { |
659 |
toss(env); |
env->head= CDR(env->head); |
|
if(env->err) return; |
|
660 |
|
|
661 |
if(CDR(iterator)->type == empty){ |
if(CDR(iterator)->type == empty){ |
662 |
goto eval_start; |
goto eval_start; |
667 |
if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons) |
if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons) |
668 |
iterator= CDR(iterator); |
iterator= CDR(iterator); |
669 |
else { |
else { |
670 |
printerr("Bad Argument Type"); /* Improper list */ |
env->err= 2; /* Improper list */ |
671 |
env->err= 2; |
return printerr(env); |
|
return; |
|
672 |
} |
} |
673 |
} |
} |
674 |
unprotect(temp_val); |
unprotect(temp_val); |
675 |
return; |
return; |
676 |
|
|
677 |
case empty: |
case empty: |
678 |
toss(env); |
env->head= CDR(env->head); |
679 |
case integer: |
case integer: |
680 |
case tfloat: |
case tfloat: |
681 |
case string: |
case string: |
682 |
case port: |
case port: |
683 |
|
case unknown: |
684 |
return; |
return; |
685 |
} |
} |
686 |
} |
} |
687 |
|
|
|
/* List all defined words */ |
|
|
extern void words(environment *env) |
|
|
{ |
|
|
symbol *temp; |
|
|
int i; |
|
|
|
|
|
for(i= 0; i<HASHTBLSIZE; i++) { |
|
|
temp= env->symbols[i]; |
|
|
while(temp!=NULL) { |
|
|
#ifdef DEBUG |
|
|
if (temp->val != NULL && temp->val->gc.flag.protect) |
|
|
printf("(protected) "); |
|
|
#endif /* DEBUG */ |
|
|
printf("%s ", temp->id); |
|
|
temp= temp->next; |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
/* Quit stack. */ |
|
|
extern void quit(environment *env) |
|
|
{ |
|
|
int i; |
|
|
|
|
|
while(env->head->type != empty) |
|
|
toss(env); |
|
|
|
|
|
if (env->err) return; |
|
|
for(i= 0; i<HASHTBLSIZE; i++) { |
|
|
while(env->symbols[i]!= NULL) { |
|
|
forget_sym(&(env->symbols[i])); |
|
|
} |
|
|
env->symbols[i]= NULL; |
|
|
} |
|
|
|
|
|
env->gc_limit= 0; |
|
|
gc_maybe(env); |
|
|
|
|
|
words(env); |
|
|
|
|
|
if(env->free_string!=NULL) |
|
|
free(env->free_string); |
|
|
|
|
|
#ifdef __linux__ |
|
|
muntrace(); |
|
|
#endif |
|
|
|
|
|
exit(EXIT_SUCCESS); |
|
|
} |
|
688 |
|
|
689 |
/* Internal forget function */ |
/* Internal forget function */ |
690 |
void forget_sym(symbol **hash_entry) |
void forget_sym(symbol **hash_entry) |
698 |
free(temp); |
free(temp); |
699 |
} |
} |
700 |
|
|
|
/* Only to be called by itself function printstack. */ |
|
|
void print_st(environment *env, value *stack_head, long counter) |
|
|
{ |
|
|
if(CDR(stack_head)->type != empty) |
|
|
print_st(env, CDR(stack_head), counter+1); |
|
|
printf("%ld: ", counter); |
|
|
print_val(env, CAR(stack_head), 0, NULL, stdout); |
|
|
printf("\n"); |
|
|
} |
|
|
|
|
|
/* Prints the stack. */ |
|
|
extern void printstack(environment *env) |
|
|
{ |
|
|
if(env->head->type == empty) { |
|
|
printf("Stack Empty\n"); |
|
|
return; |
|
|
} |
|
|
|
|
|
print_st(env, env->head, 1); |
|
|
} |
|
701 |
|
|
702 |
int main(int argc, char **argv) |
int main(int argc, char **argv) |
703 |
{ |
{ |
704 |
environment myenv; |
environment myenv; |
|
|
|
705 |
int c; /* getopt option character */ |
int c; /* getopt option character */ |
706 |
|
|
707 |
#ifdef __linux__ |
#ifdef __linux__ |
736 |
} |
} |
737 |
} |
} |
738 |
|
|
739 |
if(myenv.interactive) { |
if(myenv.interactive) |
740 |
printf("Stack version $Revision$\n\ |
puts(start_message); |
|
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn\n\ |
|
|
Stack comes with ABSOLUTELY NO WARRANTY; for details type 'warranty;'.\n\ |
|
|
This is free software, and you are welcome to redistribute it\n\ |
|
|
under certain conditions; type 'copying;' for details.\n"); |
|
|
} |
|
741 |
|
|
742 |
while(1) { |
while(1) { |
743 |
if(myenv.in_string==NULL) { |
if(myenv.in_string==NULL) { |
759 |
} else if(myenv.head->type!=empty |
} else if(myenv.head->type!=empty |
760 |
&& CAR(myenv.head)->type==symb |
&& CAR(myenv.head)->type==symb |
761 |
&& CAR(myenv.head)->content.sym->id[0] == ';') { |
&& CAR(myenv.head)->content.sym->id[0] == ';') { |
762 |
toss(&myenv); if(myenv.err) continue; |
if(myenv.head->type != empty) |
763 |
|
myenv.head= CDR(myenv.head); |
764 |
eval(&myenv); |
eval(&myenv); |
765 |
} else { |
} else { |
766 |
gc_maybe(&myenv); |
gc_maybe(&myenv); |
770 |
return EXIT_FAILURE; |
return EXIT_FAILURE; |
771 |
} |
} |
772 |
|
|
773 |
|
|
774 |
/* Return copy of a value */ |
/* Return copy of a value */ |
775 |
value *copy_val(environment *env, value *old_value) |
value *copy_val(environment *env, value *old_value) |
776 |
{ |
{ |
788 |
case func: |
case func: |
789 |
case symb: |
case symb: |
790 |
case empty: |
case empty: |
791 |
|
case unknown: |
792 |
case port: |
case port: |
793 |
new_value->content= old_value->content; |
new_value->content= old_value->content; |
794 |
break; |
break; |
795 |
case string: |
case string: |
796 |
(char *)(new_value->content.ptr)= |
new_value->content.string= strdup(old_value->content.string); |
|
strdup((char *)(old_value->content.ptr)); |
|
797 |
break; |
break; |
798 |
case tcons: |
case tcons: |
799 |
|
|
809 |
return new_value; |
return new_value; |
810 |
} |
} |
811 |
|
|
812 |
|
|
813 |
/* read a line from a stream; used by readline */ |
/* read a line from a stream; used by readline */ |
814 |
void readlinestream(environment *env, FILE *stream) |
void readlinestream(environment *env, FILE *stream) |
815 |
{ |
{ |
818 |
if(fgets(in_string, 100, stream)==NULL) { |
if(fgets(in_string, 100, stream)==NULL) { |
819 |
push_cstring(env, ""); |
push_cstring(env, ""); |
820 |
if (! feof(stream)){ |
if (! feof(stream)){ |
|
perror("readline"); |
|
821 |
env->err= 5; |
env->err= 5; |
822 |
|
return printerr(env); |
823 |
} |
} |
824 |
} else { |
} else { |
825 |
push_cstring(env, in_string); |
push_cstring(env, in_string); |
826 |
} |
} |
827 |
} |
} |
828 |
|
|
829 |
|
|
830 |
/* Reverse (flip) a list */ |
/* Reverse (flip) a list */ |
831 |
extern void rev(environment *env) |
extern void rev(environment *env) |
832 |
{ |
{ |
833 |
value *old_head, *new_head, *item; |
value *old_head, *new_head, *item; |
834 |
|
|
|
if(env->head->type==empty) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
835 |
if(CAR(env->head)->type==empty) |
if(CAR(env->head)->type==empty) |
836 |
return; /* Don't reverse an empty list */ |
return; /* Don't reverse an empty list */ |
837 |
|
|
838 |
if(CAR(env->head)->type!=tcons) { |
if(check_args(env, 1, tcons)) |
839 |
printerr("Bad Argument Type"); |
return printerr(env); |
|
env->err= 2; |
|
|
return; |
|
|
} |
|
840 |
|
|
841 |
old_head= CAR(env->head); |
old_head= CAR(env->head); |
842 |
new_head= new_val(env); |
new_head= new_val(env); |
849 |
CAR(env->head)= new_head; |
CAR(env->head)= new_head; |
850 |
} |
} |
851 |
|
|
852 |
|
|
853 |
/* Make a list. */ |
/* Make a list. */ |
854 |
extern void pack(environment *env) |
extern void pack(environment *env) |
855 |
{ |
{ |
862 |
|| (CAR(iterator)->type==symb |
|| (CAR(iterator)->type==symb |
863 |
&& CAR(iterator)->content.sym->id[0]=='[')) { |
&& CAR(iterator)->content.sym->id[0]=='[')) { |
864 |
temp= ending; |
temp= ending; |
865 |
toss(env); |
if(env->head->type != empty) |
866 |
|
env->head= CDR(env->head); |
867 |
} else { |
} else { |
868 |
/* Search for first delimiter */ |
/* Search for first delimiter */ |
869 |
while(CDR(iterator)->type != empty |
while(CDR(iterator)->type != empty |
877 |
CDR(iterator)= ending; |
CDR(iterator)= ending; |
878 |
|
|
879 |
if(env->head->type != empty) |
if(env->head->type != empty) |
880 |
toss(env); |
env->head= CDR(env->head); |
881 |
} |
} |
882 |
|
|
883 |
/* Push list */ |
/* Push list */ |
886 |
rev(env); |
rev(env); |
887 |
} |
} |
888 |
|
|
889 |
|
|
890 |
/* read from a stream; used by "read" and "readport" */ |
/* read from a stream; used by "read" and "readport" */ |
891 |
void readstream(environment *env, FILE *stream) |
void readstream(environment *env, FILE *stream) |
892 |
{ |
{ |
913 |
readlinestream(env, env->inputstream); |
readlinestream(env, env->inputstream); |
914 |
if(env->err) return; |
if(env->err) return; |
915 |
|
|
916 |
if(((char *)(CAR(env->head)->content.ptr))[0]=='\0'){ |
if((CAR(env->head)->content.string)[0]=='\0'){ |
917 |
env->err= 4; /* "" means EOF */ |
env->err= 4; /* "" means EOF */ |
918 |
return; |
return; |
919 |
} |
} |
920 |
|
|
921 |
env->in_string= malloc(strlen(CAR(env->head)->content.ptr)+1); |
env->in_string= malloc(strlen(CAR(env->head)->content.string)+1); |
922 |
assert(env->in_string != NULL); |
assert(env->in_string != NULL); |
923 |
env->free_string= env->in_string; /* Save the original pointer */ |
env->free_string= env->in_string; /* Save the original pointer */ |
924 |
strcpy(env->in_string, CAR(env->head)->content.ptr); |
strcpy(env->in_string, CAR(env->head)->content.string); |
925 |
toss(env); if(env->err) return; |
env->head= CDR(env->head); |
926 |
} |
} |
927 |
|
|
928 |
inlength= strlen(env->in_string)+1; |
inlength= strlen(env->in_string)+1; |
974 |
return readstream(env, env->inputstream); |
return readstream(env, env->inputstream); |
975 |
} |
} |
976 |
|
|
|
extern void copying(environment *env) |
|
|
{ |
|
|
printf(" GNU GENERAL PUBLIC LICENSE\n\ |
|
|
Version 2, June 1991\n\ |
|
|
\n\ |
|
|
Copyright (C) 1989, 1991 Free Software Foundation, Inc.\n\ |
|
|
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\ |
|
|
Everyone is permitted to copy and distribute verbatim copies\n\ |
|
|
of this license document, but changing it is not allowed.\n\ |
|
|
\n\ |
|
|
Preamble\n\ |
|
|
\n\ |
|
|
The licenses for most software are designed to take away your\n\ |
|
|
freedom to share and change it. By contrast, the GNU General Public\n\ |
|
|
License is intended to guarantee your freedom to share and change free\n\ |
|
|
software--to make sure the software is free for all its users. This\n\ |
|
|
General Public License applies to most of the Free Software\n\ |
|
|
Foundation's software and to any other program whose authors commit to\n\ |
|
|
using it. (Some other Free Software Foundation software is covered by\n\ |
|
|
the GNU Library General Public License instead.) You can apply it to\n\ |
|
|
your programs, too.\n\ |
|
|
\n\ |
|
|
When we speak of free software, we are referring to freedom, not\n\ |
|
|
price. Our General Public Licenses are designed to make sure that you\n\ |
|
|
have the freedom to distribute copies of free software (and charge for\n\ |
|
|
this service if you wish), that you receive source code or can get it\n\ |
|
|
if you want it, that you can change the software or use pieces of it\n\ |
|
|
in new free programs; and that you know you can do these things.\n\ |
|
|
\n\ |
|
|
To protect your rights, we need to make restrictions that forbid\n\ |
|
|
anyone to deny you these rights or to ask you to surrender the rights.\n\ |
|
|
These restrictions translate to certain responsibilities for you if you\n\ |
|
|
distribute copies of the software, or if you modify it.\n\ |
|
|
\n\ |
|
|
For example, if you distribute copies of such a program, whether\n\ |
|
|
gratis or for a fee, you must give the recipients all the rights that\n\ |
|
|
you have. You must make sure that they, too, receive or can get the\n\ |
|
|
source code. And you must show them these terms so they know their\n\ |
|
|
rights.\n\ |
|
|
\n\ |
|
|
We protect your rights with two steps: (1) copyright the software, and\n\ |
|
|
(2) offer you this license which gives you legal permission to copy,\n\ |
|
|
distribute and/or modify the software.\n\ |
|
|
\n\ |
|
|
Also, for each author's protection and ours, we want to make certain\n\ |
|
|
that everyone understands that there is no warranty for this free\n\ |
|
|
software. If the software is modified by someone else and passed on, we\n\ |
|
|
want its recipients to know that what they have is not the original, so\n\ |
|
|
that any problems introduced by others will not reflect on the original\n\ |
|
|
authors' reputations.\n\ |
|
|
\n\ |
|
|
Finally, any free program is threatened constantly by software\n\ |
|
|
patents. We wish to avoid the danger that redistributors of a free\n\ |
|
|
program will individually obtain patent licenses, in effect making the\n\ |
|
|
program proprietary. To prevent this, we have made it clear that any\n\ |
|
|
patent must be licensed for everyone's free use or not licensed at all.\n\ |
|
|
\n\ |
|
|
The precise terms and conditions for copying, distribution and\n\ |
|
|
modification follow.\n\ |
|
|
\n\ |
|
|
GNU GENERAL PUBLIC LICENSE\n\ |
|
|
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\n\ |
|
|
\n\ |
|
|
0. This License applies to any program or other work which contains\n\ |
|
|
a notice placed by the copyright holder saying it may be distributed\n\ |
|
|
under the terms of this General Public License. The \"Program\", below,\n\ |
|
|
refers to any such program or work, and a \"work based on the Program\"\n\ |
|
|
means either the Program or any derivative work under copyright law:\n\ |
|
|
that is to say, a work containing the Program or a portion of it,\n\ |
|
|
either verbatim or with modifications and/or translated into another\n\ |
|
|
language. (Hereinafter, translation is included without limitation in\n\ |
|
|
the term \"modification\".) Each licensee is addressed as \"you\".\n\ |
|
|
\n\ |
|
|
Activities other than copying, distribution and modification are not\n\ |
|
|
covered by this License; they are outside its scope. The act of\n\ |
|
|
running the Program is not restricted, and the output from the Program\n\ |
|
|
is covered only if its contents constitute a work based on the\n\ |
|
|
Program (independent of having been made by running the Program).\n\ |
|
|
Whether that is true depends on what the Program does.\n\ |
|
|
\n\ |
|
|
1. You may copy and distribute verbatim copies of the Program's\n\ |
|
|
source code as you receive it, in any medium, provided that you\n\ |
|
|
conspicuously and appropriately publish on each copy an appropriate\n\ |
|
|
copyright notice and disclaimer of warranty; keep intact all the\n\ |
|
|
notices that refer to this License and to the absence of any warranty;\n\ |
|
|
and give any other recipients of the Program a copy of this License\n\ |
|
|
along with the Program.\n\ |
|
|
\n\ |
|
|
You may charge a fee for the physical act of transferring a copy, and\n\ |
|
|
you may at your option offer warranty protection in exchange for a fee.\n\ |
|
|
\n\ |
|
|
2. You may modify your copy or copies of the Program or any portion\n\ |
|
|
of it, thus forming a work based on the Program, and copy and\n\ |
|
|
distribute such modifications or work under the terms of Section 1\n\ |
|
|
above, provided that you also meet all of these conditions:\n\ |
|
|
\n\ |
|
|
a) You must cause the modified files to carry prominent notices\n\ |
|
|
stating that you changed the files and the date of any change.\n\ |
|
|
\n\ |
|
|
b) You must cause any work that you distribute or publish, that in\n\ |
|
|
whole or in part contains or is derived from the Program or any\n\ |
|
|
part thereof, to be licensed as a whole at no charge to all third\n\ |
|
|
parties under the terms of this License.\n\ |
|
|
\n\ |
|
|
c) If the modified program normally reads commands interactively\n\ |
|
|
when run, you must cause it, when started running for such\n\ |
|
|
interactive use in the most ordinary way, to print or display an\n\ |
|
|
announcement including an appropriate copyright notice and a\n\ |
|
|
notice that there is no warranty (or else, saying that you provide\n\ |
|
|
a warranty) and that users may redistribute the program under\n\ |
|
|
these conditions, and telling the user how to view a copy of this\n\ |
|
|
License. (Exception: if the Program itself is interactive but\n\ |
|
|
does not normally print such an announcement, your work based on\n\ |
|
|
the Program is not required to print an announcement.)\n\ |
|
|
\n\ |
|
|
These requirements apply to the modified work as a whole. If\n\ |
|
|
identifiable sections of that work are not derived from the Program,\n\ |
|
|
and can be reasonably considered independent and separate works in\n\ |
|
|
themselves, then this License, and its terms, do not apply to those\n\ |
|
|
sections when you distribute them as separate works. But when you\n\ |
|
|
distribute the same sections as part of a whole which is a work based\n\ |
|
|
on the Program, the distribution of the whole must be on the terms of\n\ |
|
|
this License, whose permissions for other licensees extend to the\n\ |
|
|
entire whole, and thus to each and every part regardless of who wrote it.\n\ |
|
|
\n\ |
|
|
Thus, it is not the intent of this section to claim rights or contest\n\ |
|
|
your rights to work written entirely by you; rather, the intent is to\n\ |
|
|
exercise the right to control the distribution of derivative or\n\ |
|
|
collective works based on the Program.\n\ |
|
|
\n\ |
|
|
In addition, mere aggregation of another work not based on the Program\n\ |
|
|
with the Program (or with a work based on the Program) on a volume of\n\ |
|
|
a storage or distribution medium does not bring the other work under\n\ |
|
|
the scope of this License.\n\ |
|
|
\n\ |
|
|
3. You may copy and distribute the Program (or a work based on it,\n\ |
|
|
under Section 2) in object code or executable form under the terms of\n\ |
|
|
Sections 1 and 2 above provided that you also do one of the following:\n\ |
|
|
\n\ |
|
|
a) Accompany it with the complete corresponding machine-readable\n\ |
|
|
source code, which must be distributed under the terms of Sections\n\ |
|
|
1 and 2 above on a medium customarily used for software interchange; or,\n\ |
|
|
\n\ |
|
|
b) Accompany it with a written offer, valid for at least three\n\ |
|
|
years, to give any third party, for a charge no more than your\n\ |
|
|
cost of physically performing source distribution, a complete\n\ |
|
|
machine-readable copy of the corresponding source code, to be\n\ |
|
|
distributed under the terms of Sections 1 and 2 above on a medium\n\ |
|
|
customarily used for software interchange; or,\n\ |
|
|
\n\ |
|
|
c) Accompany it with the information you received as to the offer\n\ |
|
|
to distribute corresponding source code. (This alternative is\n\ |
|
|
allowed only for noncommercial distribution and only if you\n\ |
|
|
received the program in object code or executable form with such\n\ |
|
|
an offer, in accord with Subsection b above.)\n\ |
|
|
\n\ |
|
|
The source code for a work means the preferred form of the work for\n\ |
|
|
making modifications to it. For an executable work, complete source\n\ |
|
|
code means all the source code for all modules it contains, plus any\n\ |
|
|
associated interface definition files, plus the scripts used to\n\ |
|
|
control compilation and installation of the executable. However, as a\n\ |
|
|
special exception, the source code distributed need not include\n\ |
|
|
anything that is normally distributed (in either source or binary\n\ |
|
|
form) with the major components (compiler, kernel, and so on) of the\n\ |
|
|
operating system on which the executable runs, unless that component\n\ |
|
|
itself accompanies the executable.\n\ |
|
|
\n\ |
|
|
If distribution of executable or object code is made by offering\n\ |
|
|
access to copy from a designated place, then offering equivalent\n\ |
|
|
access to copy the source code from the same place counts as\n\ |
|
|
distribution of the source code, even though third parties are not\n\ |
|
|
compelled to copy the source along with the object code.\n\ |
|
|
\n\ |
|
|
4. You may not copy, modify, sublicense, or distribute the Program\n\ |
|
|
except as expressly provided under this License. Any attempt\n\ |
|
|
otherwise to copy, modify, sublicense or distribute the Program is\n\ |
|
|
void, and will automatically terminate your rights under this License.\n\ |
|
|
However, parties who have received copies, or rights, from you under\n\ |
|
|
this License will not have their licenses terminated so long as such\n\ |
|
|
parties remain in full compliance.\n\ |
|
|
\n\ |
|
|
5. You are not required to accept this License, since you have not\n\ |
|
|
signed it. However, nothing else grants you permission to modify or\n\ |
|
|
distribute the Program or its derivative works. These actions are\n\ |
|
|
prohibited by law if you do not accept this License. Therefore, by\n\ |
|
|
modifying or distributing the Program (or any work based on the\n\ |
|
|
Program), you indicate your acceptance of this License to do so, and\n\ |
|
|
all its terms and conditions for copying, distributing or modifying\n\ |
|
|
the Program or works based on it.\n\ |
|
|
\n\ |
|
|
6. Each time you redistribute the Program (or any work based on the\n\ |
|
|
Program), the recipient automatically receives a license from the\n\ |
|
|
original licensor to copy, distribute or modify the Program subject to\n\ |
|
|
these terms and conditions. You may not impose any further\n\ |
|
|
restrictions on the recipients' exercise of the rights granted herein.\n\ |
|
|
You are not responsible for enforcing compliance by third parties to\n\ |
|
|
this License.\n\ |
|
|
\n\ |
|
|
7. If, as a consequence of a court judgment or allegation of patent\n\ |
|
|
infringement or for any other reason (not limited to patent issues),\n\ |
|
|
conditions are imposed on you (whether by court order, agreement or\n\ |
|
|
otherwise) that contradict the conditions of this License, they do not\n\ |
|
|
excuse you from the conditions of this License. If you cannot\n\ |
|
|
distribute so as to satisfy simultaneously your obligations under this\n\ |
|
|
License and any other pertinent obligations, then as a consequence you\n\ |
|
|
may not distribute the Program at all. For example, if a patent\n\ |
|
|
license would not permit royalty-free redistribution of the Program by\n\ |
|
|
all those who receive copies directly or indirectly through you, then\n\ |
|
|
the only way you could satisfy both it and this License would be to\n\ |
|
|
refrain entirely from distribution of the Program.\n\ |
|
|
\n\ |
|
|
If any portion of this section is held invalid or unenforceable under\n\ |
|
|
any particular circumstance, the balance of the section is intended to\n\ |
|
|
apply and the section as a whole is intended to apply in other\n\ |
|
|
circumstances.\n\ |
|
|
\n\ |
|
|
It is not the purpose of this section to induce you to infringe any\n\ |
|
|
patents or other property right claims or to contest validity of any\n\ |
|
|
such claims; this section has the sole purpose of protecting the\n\ |
|
|
integrity of the free software distribution system, which is\n\ |
|
|
implemented by public license practices. Many people have made\n\ |
|
|
generous contributions to the wide range of software distributed\n\ |
|
|
through that system in reliance on consistent application of that\n\ |
|
|
system; it is up to the author/donor to decide if he or she is willing\n\ |
|
|
to distribute software through any other system and a licensee cannot\n\ |
|
|
impose that choice.\n\ |
|
|
\n\ |
|
|
This section is intended to make thoroughly clear what is believed to\n\ |
|
|
be a consequence of the rest of this License.\n\ |
|
|
\n\ |
|
|
8. If the distribution and/or use of the Program is restricted in\n\ |
|
|
certain countries either by patents or by copyrighted interfaces, the\n\ |
|
|
original copyright holder who places the Program under this License\n\ |
|
|
may add an explicit geographical distribution limitation excluding\n\ |
|
|
those countries, so that distribution is permitted only in or among\n\ |
|
|
countries not thus excluded. In such case, this License incorporates\n\ |
|
|
the limitation as if written in the body of this License.\n\ |
|
|
\n\ |
|
|
9. The Free Software Foundation may publish revised and/or new versions\n\ |
|
|
of the General Public License from time to time. Such new versions will\n\ |
|
|
be similar in spirit to the present version, but may differ in detail to\n\ |
|
|
address new problems or concerns.\n\ |
|
|
\n\ |
|
|
Each version is given a distinguishing version number. If the Program\n\ |
|
|
specifies a version number of this License which applies to it and \"any\n\ |
|
|
later version\", you have the option of following the terms and conditions\n\ |
|
|
either of that version or of any later version published by the Free\n\ |
|
|
Software Foundation. If the Program does not specify a version number of\n\ |
|
|
this License, you may choose any version ever published by the Free Software\n\ |
|
|
Foundation.\n\ |
|
|
\n\ |
|
|
10. If you wish to incorporate parts of the Program into other free\n\ |
|
|
programs whose distribution conditions are different, write to the author\n\ |
|
|
to ask for permission. For software which is copyrighted by the Free\n\ |
|
|
Software Foundation, write to the Free Software Foundation; we sometimes\n\ |
|
|
make exceptions for this. Our decision will be guided by the two goals\n\ |
|
|
of preserving the free status of all derivatives of our free software and\n\ |
|
|
of promoting the sharing and reuse of software generally.\n"); |
|
|
} |
|
|
|
|
|
extern void warranty(environment *env) |
|
|
{ |
|
|
printf(" NO WARRANTY\n\ |
|
|
\n\ |
|
|
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY\n\ |
|
|
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN\n\ |
|
|
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES\n\ |
|
|
PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED\n\ |
|
|
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\ |
|
|
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS\n\ |
|
|
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE\n\ |
|
|
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,\n\ |
|
|
REPAIR OR CORRECTION.\n\ |
|
|
\n\ |
|
|
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\n\ |
|
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR\n\ |
|
|
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,\n\ |
|
|
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING\n\ |
|
|
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED\n\ |
|
|
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY\n\ |
|
|
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER\n\ |
|
|
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE\n\ |
|
|
POSSIBILITY OF SUCH DAMAGES.\n"); |
|
|
} |
|
|
|
|
|
/* General assoc function */ |
|
|
void assocgen(environment *env, funcp eqfunc) |
|
|
{ |
|
|
value *key, *item; |
|
|
|
|
|
/* Needs two values on the stack, the top one must be an association |
|
|
list */ |
|
|
if(env->head->type==empty || CDR(env->head)->type==empty) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
977 |
|
|
978 |
if(CAR(env->head)->type!=tcons) { |
int check_args(environment *env, int num_args, ...) |
979 |
printerr("Bad Argument Type"); |
{ |
980 |
env->err= 2; |
va_list ap; |
981 |
return; |
enum type_enum mytype; |
982 |
} |
int i; |
983 |
|
|
984 |
key=CAR(CDR(env->head)); |
value *iter= env->head; |
985 |
item=CAR(env->head); |
int errval= 0; |
986 |
|
|
987 |
while(item->type == tcons){ |
va_start(ap, num_args); |
988 |
if(CAR(item)->type != tcons){ |
for(i=1; i<=num_args; i++) { |
989 |
printerr("Bad Argument Type"); |
mytype= va_arg(ap, enum type_enum); |
990 |
env->err= 2; |
// fprintf(stderr, "%s\n", env->errsymb); |
|
return; |
|
|
} |
|
|
push_val(env, key); |
|
|
push_val(env, CAR(CAR(item))); |
|
|
eqfunc(env); if(env->err) return; |
|
|
|
|
|
/* Check the result of 'eqfunc' */ |
|
|
if(env->head->type==empty) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
if(CAR(env->head)->type!=integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
991 |
|
|
992 |
if(CAR(env->head)->content.i){ |
if(iter->type==empty || iter==NULL) { |
993 |
toss(env); if(env->err) return; |
errval= 1; |
994 |
break; |
break; |
995 |
} |
} |
|
toss(env); if(env->err) return; |
|
996 |
|
|
997 |
if(item->type!=tcons) { |
if(mytype!=unknown && CAR(iter)->type!=mytype) { |
998 |
printerr("Bad Argument Type"); |
errval= 2; |
999 |
env->err= 2; |
break; |
|
return; |
|
1000 |
} |
} |
1001 |
|
|
1002 |
item=CDR(item); |
iter= CDR(iter); |
1003 |
} |
} |
1004 |
|
|
1005 |
if(item->type == tcons){ /* A match was found */ |
va_end(ap); |
|
push_val(env, CAR(item)); |
|
|
} else { |
|
|
push_int(env, 0); |
|
|
} |
|
|
swap(env); if(env->err) return; |
|
|
toss(env); if(env->err) return; |
|
|
swap(env); if(env->err) return; |
|
|
toss(env); |
|
|
} |
|
1006 |
|
|
1007 |
/* Discard the top element of the stack. */ |
env->err= errval; |
1008 |
extern void toss(environment *env) |
return errval; |
|
{ |
|
|
if(env->head->type==empty) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
env->head= CDR(env->head); /* Remove the top stack item */ |
|
1009 |
} |
} |
|
|
|