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.\n"; |
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 |
|
|
53 |
void printerr(const char* in_string) |
void printerr(const char* in_string) |
54 |
{ |
{ |
55 |
fprintf(stderr, "Err: %s\n", in_string); |
fprintf(stderr, "Err: %s\n", in_string); |
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 |
|
|
89 |
/* Create new value */ |
/* Create new value */ |
90 |
value* new_val(environment *env) |
value* new_val(environment *env) |
91 |
{ |
{ |
143 |
if(env->interactive) |
if(env->interactive) |
144 |
printf("."); |
printf("."); |
145 |
|
|
|
|
|
146 |
/* Mark values in hashtable */ |
/* Mark values in hashtable */ |
147 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
148 |
for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next) |
for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next) |
149 |
if (tsymb->val != NULL) |
if (tsymb->val != NULL) |
150 |
gc_mark(tsymb->val); |
gc_mark(tsymb->val); |
151 |
|
|
|
|
|
152 |
if(env->interactive) |
if(env->interactive) |
153 |
printf("."); |
printf("."); |
154 |
|
|
155 |
env->gc_count= 0; |
env->gc_count= 0; |
156 |
|
|
157 |
while(env->gc_ref!=NULL) { /* Sweep unused values */ |
while(env->gc_ref!=NULL) { /* Sweep unused values */ |
|
|
|
158 |
if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */ |
if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */ |
159 |
|
|
160 |
/* Remove content */ |
/* Remove content */ |
181 |
env->gc_ref= titem; |
env->gc_ref= titem; |
182 |
continue; |
continue; |
183 |
} |
} |
184 |
|
|
185 |
#ifdef DEBUG |
#ifdef DEBUG |
186 |
printf("Kept value (%p)", env->gc_ref->item); |
printf("Kept value (%p)", env->gc_ref->item); |
187 |
if(env->gc_ref->item->gc.flag.mark) |
if(env->gc_ref->item->gc.flag.mark) |
230 |
|
|
231 |
} |
} |
232 |
|
|
233 |
|
|
234 |
inline void gc_maybe(environment *env) |
inline void gc_maybe(environment *env) |
235 |
{ |
{ |
236 |
if(env->gc_count < env->gc_limit) |
if(env->gc_count < env->gc_limit) |
239 |
return gc_init(env); |
return gc_init(env); |
240 |
} |
} |
241 |
|
|
242 |
|
|
243 |
/* Protect values from GC */ |
/* Protect values from GC */ |
244 |
void protect(value *val) |
void protect(value *val) |
245 |
{ |
{ |
254 |
} |
} |
255 |
} |
} |
256 |
|
|
257 |
|
|
258 |
/* Unprotect values from GC */ |
/* Unprotect values from GC */ |
259 |
void unprotect(value *val) |
void unprotect(value *val) |
260 |
{ |
{ |
269 |
} |
} |
270 |
} |
} |
271 |
|
|
272 |
|
|
273 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
274 |
void push_val(environment *env, value *val) |
void push_val(environment *env, value *val) |
275 |
{ |
{ |
284 |
env->head= new_value; |
env->head= new_value; |
285 |
} |
} |
286 |
|
|
287 |
|
|
288 |
/* Push an integer onto the stack */ |
/* Push an integer onto the stack */ |
289 |
void push_int(environment *env, int in_val) |
void push_int(environment *env, int in_val) |
290 |
{ |
{ |
296 |
push_val(env, new_value); |
push_val(env, new_value); |
297 |
} |
} |
298 |
|
|
299 |
|
|
300 |
/* Push a floating point number onto the stack */ |
/* Push a floating point number onto the stack */ |
301 |
void push_float(environment *env, float in_val) |
void push_float(environment *env, float in_val) |
302 |
{ |
{ |
308 |
push_val(env, new_value); |
push_val(env, new_value); |
309 |
} |
} |
310 |
|
|
311 |
|
|
312 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
313 |
void push_cstring(environment *env, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
314 |
{ |
{ |
324 |
push_val(env, new_value); |
push_val(env, new_value); |
325 |
} |
} |
326 |
|
|
327 |
|
|
328 |
/* Mangle a symbol name to a valid C identifier name */ |
/* Mangle a symbol name to a valid C identifier name */ |
329 |
char *mangle_str(const char *old_string) |
char *mangle_str(const char *old_string) |
330 |
{ |
{ |
335 |
assert(new_string != NULL); |
assert(new_string != NULL); |
336 |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
337 |
current= new_string+3; |
current= new_string+3; |
338 |
|
|
339 |
while(old_string[0] != '\0'){ |
while(old_string[0] != '\0'){ |
340 |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
341 |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
347 |
return new_string; /* The caller must free() it */ |
return new_string; /* The caller must free() it */ |
348 |
} |
} |
349 |
|
|
350 |
|
|
351 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
352 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
353 |
{ |
{ |
417 |
unprotect(new_value); unprotect(new_fvalue); |
unprotect(new_value); unprotect(new_fvalue); |
418 |
} |
} |
419 |
|
|
420 |
|
|
421 |
/* Print a value */ |
/* Print a value */ |
422 |
void print_val(environment *env, value *val, int noquote, stackitem *stack, FILE *stream) |
void print_val(environment *env, value *val, int noquote, stackitem *stack, |
423 |
|
FILE *stream) |
424 |
{ |
{ |
425 |
stackitem *titem, *tstack; |
stackitem *titem, *tstack; |
426 |
int depth; |
int depth; |
490 |
return; |
return; |
491 |
} |
} |
492 |
tstack= stack; |
tstack= stack; |
493 |
|
|
494 |
do { |
do { |
495 |
titem=malloc(sizeof(stackitem)); |
titem=malloc(sizeof(stackitem)); |
496 |
assert(titem != NULL); |
assert(titem != NULL); |
501 |
printing this value */ |
printing this value */ |
502 |
titem=tstack; |
titem=tstack; |
503 |
depth=0; |
depth=0; |
504 |
|
|
505 |
while(titem != NULL && titem->item != CAR(val)){ |
while(titem != NULL && titem->item != CAR(val)){ |
506 |
titem=titem->next; |
titem=titem->next; |
507 |
depth++; |
depth++; |
508 |
} |
} |
509 |
|
|
510 |
if(titem != NULL){ /* If we found it on the stack, */ |
if(titem != NULL){ /* If we found it on the stack, */ |
511 |
if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */ |
if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */ |
512 |
perror("print_val"); |
perror("print_val"); |
517 |
} else { |
} else { |
518 |
print_val(env, CAR(val), noquote, tstack, stream); |
print_val(env, CAR(val), noquote, tstack, stream); |
519 |
} |
} |
520 |
|
|
521 |
val= CDR(val); |
val= CDR(val); |
522 |
switch(val->type){ |
switch(val->type){ |
523 |
case empty: |
case empty: |
527 |
printing this value */ |
printing this value */ |
528 |
titem=tstack; |
titem=tstack; |
529 |
depth=0; |
depth=0; |
530 |
|
|
531 |
while(titem != NULL && titem->item != val){ |
while(titem != NULL && titem->item != val){ |
532 |
titem=titem->next; |
titem=titem->next; |
533 |
depth++; |
depth++; |
575 |
} |
} |
576 |
} |
} |
577 |
|
|
578 |
|
|
579 |
/* Swap the two top elements on the stack. */ |
/* Swap the two top elements on the stack. */ |
580 |
extern void swap(environment *env) |
extern void swap(environment *env) |
581 |
{ |
{ |
592 |
CDR(env->head)= temp; |
CDR(env->head)= temp; |
593 |
} |
} |
594 |
|
|
595 |
|
|
596 |
/* Recall a value from a symbol, if bound */ |
/* Recall a value from a symbol, if bound */ |
597 |
extern void rcl(environment *env) |
extern void rcl(environment *env) |
598 |
{ |
{ |
619 |
push_val(env, val); /* Return the symbol's bound value */ |
push_val(env, val); /* Return the symbol's bound value */ |
620 |
swap(env); |
swap(env); |
621 |
if(env->err) return; |
if(env->err) return; |
622 |
toss(env); /* toss the symbol */ |
env->head= CDR(env->head); |
|
if(env->err) return; |
|
623 |
} |
} |
624 |
|
|
625 |
|
|
655 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
656 |
case func: |
case func: |
657 |
in_func= CAR(env->head)->content.func; |
in_func= CAR(env->head)->content.func; |
658 |
toss(env); |
env->head= CDR(env->head); |
|
if(env->err) return; |
|
659 |
return in_func(env); |
return in_func(env); |
660 |
|
|
661 |
/* If it's a list */ |
/* If it's a list */ |
663 |
temp_val= CAR(env->head); |
temp_val= CAR(env->head); |
664 |
protect(temp_val); |
protect(temp_val); |
665 |
|
|
666 |
toss(env); if(env->err) return; |
env->head= CDR(env->head); |
667 |
iterator= temp_val; |
iterator= temp_val; |
668 |
|
|
669 |
while(iterator->type != empty) { |
while(iterator->type != empty) { |
670 |
push_val(env, CAR(iterator)); |
push_val(env, CAR(iterator)); |
671 |
|
|
672 |
if(CAR(env->head)->type==symb |
if(CAR(env->head)->type==symb |
673 |
&& CAR(env->head)->content.sym->id[0]==';') { |
&& CAR(env->head)->content.sym->id[0]==';') { |
674 |
toss(env); |
env->head= CDR(env->head); |
|
if(env->err) return; |
|
675 |
|
|
676 |
if(CDR(iterator)->type == empty){ |
if(CDR(iterator)->type == empty){ |
677 |
goto eval_start; |
goto eval_start; |
691 |
return; |
return; |
692 |
|
|
693 |
case empty: |
case empty: |
694 |
toss(env); |
env->head= CDR(env->head); |
695 |
case integer: |
case integer: |
696 |
case tfloat: |
case tfloat: |
697 |
case string: |
case string: |
700 |
} |
} |
701 |
} |
} |
702 |
|
|
|
/* 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); |
|
|
} |
|
703 |
|
|
704 |
/* Internal forget function */ |
/* Internal forget function */ |
705 |
void forget_sym(symbol **hash_entry) |
void forget_sym(symbol **hash_entry) |
713 |
free(temp); |
free(temp); |
714 |
} |
} |
715 |
|
|
|
/* 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); |
|
|
} |
|
716 |
|
|
717 |
int main(int argc, char **argv) |
int main(int argc, char **argv) |
718 |
{ |
{ |
719 |
environment myenv; |
environment myenv; |
|
|
|
720 |
int c; /* getopt option character */ |
int c; /* getopt option character */ |
721 |
|
|
722 |
#ifdef __linux__ |
#ifdef __linux__ |
751 |
} |
} |
752 |
} |
} |
753 |
|
|
754 |
if(myenv.interactive) { |
if(myenv.interactive) |
755 |
printf("Stack version $Revision$\n\ |
printf(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"); |
|
|
} |
|
756 |
|
|
757 |
while(1) { |
while(1) { |
758 |
if(myenv.in_string==NULL) { |
if(myenv.in_string==NULL) { |
774 |
} else if(myenv.head->type!=empty |
} else if(myenv.head->type!=empty |
775 |
&& CAR(myenv.head)->type==symb |
&& CAR(myenv.head)->type==symb |
776 |
&& CAR(myenv.head)->content.sym->id[0] == ';') { |
&& CAR(myenv.head)->content.sym->id[0] == ';') { |
777 |
toss(&myenv); if(myenv.err) continue; |
if(myenv.head->type != empty) |
778 |
|
myenv.head= CDR(myenv.head); |
779 |
eval(&myenv); |
eval(&myenv); |
780 |
} else { |
} else { |
781 |
gc_maybe(&myenv); |
gc_maybe(&myenv); |
785 |
return EXIT_FAILURE; |
return EXIT_FAILURE; |
786 |
} |
} |
787 |
|
|
788 |
|
|
789 |
/* Return copy of a value */ |
/* Return copy of a value */ |
790 |
value *copy_val(environment *env, value *old_value) |
value *copy_val(environment *env, value *old_value) |
791 |
{ |
{ |
823 |
return new_value; |
return new_value; |
824 |
} |
} |
825 |
|
|
826 |
|
|
827 |
/* read a line from a stream; used by readline */ |
/* read a line from a stream; used by readline */ |
828 |
void readlinestream(environment *env, FILE *stream) |
void readlinestream(environment *env, FILE *stream) |
829 |
{ |
{ |
840 |
} |
} |
841 |
} |
} |
842 |
|
|
843 |
|
|
844 |
/* Reverse (flip) a list */ |
/* Reverse (flip) a list */ |
845 |
extern void rev(environment *env) |
extern void rev(environment *env) |
846 |
{ |
{ |
872 |
CAR(env->head)= new_head; |
CAR(env->head)= new_head; |
873 |
} |
} |
874 |
|
|
875 |
|
|
876 |
/* Make a list. */ |
/* Make a list. */ |
877 |
extern void pack(environment *env) |
extern void pack(environment *env) |
878 |
{ |
{ |
885 |
|| (CAR(iterator)->type==symb |
|| (CAR(iterator)->type==symb |
886 |
&& CAR(iterator)->content.sym->id[0]=='[')) { |
&& CAR(iterator)->content.sym->id[0]=='[')) { |
887 |
temp= ending; |
temp= ending; |
888 |
toss(env); |
if(env->head->type != empty) |
889 |
|
env->head= CDR(env->head); |
890 |
} else { |
} else { |
891 |
/* Search for first delimiter */ |
/* Search for first delimiter */ |
892 |
while(CDR(iterator)->type != empty |
while(CDR(iterator)->type != empty |
900 |
CDR(iterator)= ending; |
CDR(iterator)= ending; |
901 |
|
|
902 |
if(env->head->type != empty) |
if(env->head->type != empty) |
903 |
toss(env); |
env->head= CDR(env->head); |
904 |
} |
} |
905 |
|
|
906 |
/* Push list */ |
/* Push list */ |
909 |
rev(env); |
rev(env); |
910 |
} |
} |
911 |
|
|
912 |
|
|
913 |
/* read from a stream; used by "read" and "readport" */ |
/* read from a stream; used by "read" and "readport" */ |
914 |
void readstream(environment *env, FILE *stream) |
void readstream(environment *env, FILE *stream) |
915 |
{ |
{ |
945 |
assert(env->in_string != NULL); |
assert(env->in_string != NULL); |
946 |
env->free_string= env->in_string; /* Save the original pointer */ |
env->free_string= env->in_string; /* Save the original pointer */ |
947 |
strcpy(env->in_string, CAR(env->head)->content.string); |
strcpy(env->in_string, CAR(env->head)->content.string); |
948 |
toss(env); if(env->err) return; |
env->head= CDR(env->head); |
949 |
} |
} |
950 |
|
|
951 |
inlength= strlen(env->in_string)+1; |
inlength= strlen(env->in_string)+1; |
996 |
if(depth) |
if(depth) |
997 |
return readstream(env, env->inputstream); |
return readstream(env, env->inputstream); |
998 |
} |
} |
|
|
|
|
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"); |
|
|
} |
|
|
|
|
|
/* Discard the top element of the stack. */ |
|
|
extern void toss(environment *env) |
|
|
{ |
|
|
if(env->head->type==empty) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
env->head= CDR(env->head); /* Remove the top stack item */ |
|
|
} |
|
|
|
|