/[cvs]/stack/stack.c
ViewVC logotype

Diff of /stack/stack.c

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.95 by masse, Sun Mar 10 06:34:01 2002 UTC revision 1.135 by masse, Wed Aug 13 11:58:00 2003 UTC
# Line 1  Line 1 
1    /* -*- coding: utf-8; -*- */
2  /*  /*
3      stack - an interactive interpreter for a stack-based language      stack - an interactive interpreter for a stack-based language
4      Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn      Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn
# Line 20  Line 21 
21               Teddy Hogeborn <teddy@fukt.bth.se>               Teddy Hogeborn <teddy@fukt.bth.se>
22  */  */
23    
 /* printf, sscanf, fgets, fprintf, fopen, perror */  
 #include <stdio.h>  
 /* exit, EXIT_SUCCESS, malloc, free */  
 #include <stdlib.h>  
 /* NULL */  
 #include <stddef.h>  
 /* dlopen, dlsym, dlerror */  
 #include <dlfcn.h>  
 /* strcmp, strcpy, strlen, strcat, strdup */  
 #include <string.h>  
 /* getopt, STDIN_FILENO, STDOUT_FILENO, usleep */  
 #include <unistd.h>  
 /* EX_NOINPUT, EX_USAGE */  
 #include <sysexits.h>  
 /* mtrace, muntrace */  
 #include <mcheck.h>  
 /* ioctl */  
 #include <sys/ioctl.h>  
 /* KDMKTONE */  
 #include <linux/kd.h>  
   
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  {  {
36    int i;    int i;
37    
38    env->gc_limit= 20;    env->gc_limit= 400000;
39    env->gc_count= 0;    env->gc_count= 0;
40    env->gc_ref= NULL;    env->gc_ref= NULL;
   env->gc_protect= NULL;  
41    
42    env->head= NULL;    env->head= new_val(env);
43    for(i= 0; i<HASHTBLSIZE; i++)    for(i= 0; i<HASHTBLSIZE; i++)
44      env->symbols[i]= NULL;      env->symbols[i]= NULL;
45    env->err= 0;    env->err= 0;
# Line 63  void init_env(environment *env) Line 49  void init_env(environment *env)
49    env->interactive= 1;    env->interactive= 1;
50  }  }
51    
 void printerr(const char* in_string)  
 {  
   fprintf(stderr, "Err: %s\n", in_string);  
 }  
52    
53  /* Discard the top element of the stack. */  void printerr(environment *env)
 extern void toss(environment *env)  
54  {  {
55    stackitem *temp= env->head;    char *in_string;
56    
57    if((env->head)==NULL) {    switch(env->err) {
58      printerr("Too Few Arguments");    case 0:
     env->err= 1;  
59      return;      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      default:
70        in_string= "Unknown error";
71        break;
72    }    }
     
   env->head= env->head->next;   /* Remove the top stack item */  
   free(temp);                   /* Free the old top stack item */  
73    
74    env->gc_limit--;    fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string);
   gc_init(env);  
75  }  }
76    
77    
78  /* 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. */
79  symbol **hash(hashtbl in_hashtbl, const char *in_string)  symbol **hash(hashtbl in_hashtbl, const char *in_string)
80  {  {
# Line 115  symbol **hash(hashtbl in_hashtbl, const Line 104  symbol **hash(hashtbl in_hashtbl, const
104    }    }
105  }  }
106    
107    
108  /* Create new value */  /* Create new value */
109  value* new_val(environment *env)  value* new_val(environment *env)
110  {  {
111    value *nval= malloc(sizeof(value));    value *nval= malloc(sizeof(value));
112    stackitem *nitem= malloc(sizeof(stackitem));    stackitem *nitem= malloc(sizeof(stackitem));
113    
114      assert(nval != NULL);
115      assert(nitem != NULL);
116    
117    nval->content.ptr= NULL;    nval->content.ptr= NULL;
118      nval->type= empty;
119    
120    nitem->item= nval;    nitem->item= nval;
121    nitem->next= env->gc_ref;    nitem->next= env->gc_ref;
   env->gc_ref= nitem;  
122    
123    env->gc_count++;    env->gc_ref= nitem;
124    
125    protect(env, nval);    env->gc_count += sizeof(value);
126    gc_init(env);    nval->gc.flag.mark= 0;
127    unprotect(env);    nval->gc.flag.protect= 0;
128    
129    return nval;    return nval;
130  }  }
131    
132    
133  /* Mark values recursively.  /* Mark values recursively.
134     Marked values are not collected by the GC. */     Marked values are not collected by the GC. */
135  void gc_mark(value *val)  inline void gc_mark(value *val)
136  {  {
137    stackitem *iterator;    if(val==NULL || val->gc.flag.mark)
   
   if(val==NULL || val->gc_garb==0)  
138      return;      return;
139    
140    val->gc_garb= 0;    val->gc.flag.mark= 1;
   
   if(val->type==list) {  
     iterator= val->content.ptr;  
141    
142      while(iterator!=NULL) {    if(val->type==tcons) {
143        gc_mark(iterator->item);      gc_mark(CAR(val));
144        iterator= iterator->next;      gc_mark(CDR(val));
     }  
145    }    }
146  }  }
147    
148    
149  /* Start GC */  /* Start GC */
150  extern void gc_init(environment *env)  extern void gc_init(environment *env)
151  {  {
152    stackitem *new_head= NULL, *titem, *iterator;    stackitem *new_head= NULL, *titem;
153    symbol *tsymb;    symbol *tsymb;
154    int i;    int i;
155    
156    if(env->gc_count < env->gc_limit)    if(env->interactive)
157      return;      printf("Garbage collecting.");
   
   /* Garb by default */  
   iterator= env->gc_ref;  
   while(iterator!=NULL) {  
     iterator->item->gc_garb= 1;  
     iterator= iterator->next;  
   }  
   
   /* Mark protected values */  
   iterator= env->gc_protect;  
   while(iterator!=NULL) {  
     gc_mark(iterator->item);  
     iterator= iterator->next;  
   }  
158    
159    /* Mark values on stack */    /* Mark values on stack */
160    iterator= env->head;    gc_mark(env->head);
161    while(iterator!=NULL) {  
162      gc_mark(iterator->item);    if(env->interactive)
163      iterator= iterator->next;      printf(".");
   }  
164    
165    /* Mark values in hashtable */    /* Mark values in hashtable */
166    for(i= 0; i<HASHTBLSIZE; i++) {    for(i= 0; i<HASHTBLSIZE; i++)
167      tsymb= env->symbols[i];      for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next)
168      while(tsymb!=NULL) {        if (tsymb->val != NULL)
169        gc_mark(tsymb->val);          gc_mark(tsymb->val);
170        tsymb= tsymb->next;  
171      }    if(env->interactive)
172    }      printf(".");
173    
174    env->gc_count= 0;    env->gc_count= 0;
175    
176    while(env->gc_ref!=NULL) {    /* Sweep unused values */    while(env->gc_ref!=NULL) {    /* Sweep unused values */
177        if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */
178    
179      if(env->gc_ref->item->gc_garb) {        /* Remove content */
180          switch(env->gc_ref->item->type){
       switch(env->gc_ref->item->type) { /* Remove content */  
181        case string:        case string:
182          free(env->gc_ref->item->content.ptr);          free(env->gc_ref->item->content.string);
183          break;          break;
184        case list:        case tcons:
185          while(env->gc_ref->item->content.ptr!=NULL) {          free(env->gc_ref->item->content.c);
           titem= env->gc_ref->item->content.ptr;  
           env->gc_ref->item->content.ptr= titem->next;  
           free(titem);  
         }  
186          break;          break;
187        default:        case port:
188          case empty:
189          case unknown:
190          case integer:
191          case tfloat:
192          case func:
193          case symb:
194            /* Symbol strings are freed when walking the hash table */
195          break;          break;
196        }        }
197    
198        free(env->gc_ref->item);  /* Remove from gc_ref */        free(env->gc_ref->item);  /* Remove from gc_ref */
199        titem= env->gc_ref->next;        titem= env->gc_ref->next;
200        free(env->gc_ref);        /* Remove value */        free(env->gc_ref);        /* Remove value */
201        env->gc_ref= titem;        env->gc_ref= titem;
202      } else {                    /* Keep values */        continue;
       titem= env->gc_ref->next;  
       env->gc_ref->next= new_head;  
       new_head= env->gc_ref;  
       env->gc_ref= titem;  
       env->gc_count++;  
203      }      }
204    
205    #ifdef DEBUG
206        printf("Kept value (%p)", env->gc_ref->item);
207        if(env->gc_ref->item->gc.flag.mark)
208          printf(" (marked)");
209        if(env->gc_ref->item->gc.flag.protect)
210          printf(" (protected)");
211        switch(env->gc_ref->item->type){
212        case integer:
213          printf(" integer: %d", env->gc_ref->item->content.i);
214          break;
215        case func:
216          printf(" func: %p", env->gc_ref->item->content.func);
217          break;
218        case symb:
219          printf(" symb: %s", env->gc_ref->item->content.sym->id);
220          break;
221        case tcons:
222          printf(" tcons: %p\t%p", CAR(env->gc_ref->item),
223                 CDR(env->gc_ref->item));
224          break;
225        default:
226          printf(" <unknown %d>", (env->gc_ref->item->type));
227        }
228        printf("\n");
229    #endif /* DEBUG */
230    
231        /* Keep values */    
232        env->gc_count += sizeof(value);
233        if(env->gc_ref->item->type==string)
234          env->gc_count += strlen(env->gc_ref->item->content.string)+1;
235        
236        titem= env->gc_ref->next;
237        env->gc_ref->next= new_head;
238        new_head= env->gc_ref;
239        new_head->item->gc.flag.mark= 0;
240        env->gc_ref= titem;
241    }    }
242    
243    env->gc_limit= env->gc_count*2;    if (env->gc_limit < env->gc_count*2)
244        env->gc_limit= env->gc_count*2;
245    
246    env->gc_ref= new_head;    env->gc_ref= new_head;
247    
248      if(env->interactive)
249        printf("done (%d bytes still allocated)\n", env->gc_count);
250    
251  }  }
252    
253    
254    inline void gc_maybe(environment *env)
255    {
256      if(env->gc_count < env->gc_limit)
257        return;
258      else
259        return gc_init(env);
260    }
261    
262    
263  /* Protect values from GC */  /* Protect values from GC */
264  void protect(environment *env, value *val)  void protect(value *val)
265  {  {
266    stackitem *new_item= malloc(sizeof(stackitem));    if(val==NULL || val->gc.flag.protect)
267    new_item->item= val;      return;
268    new_item->next= env->gc_protect;  
269    env->gc_protect= new_item;    val->gc.flag.protect= 1;
270    
271      if(val->type==tcons) {
272        protect(CAR(val));
273        protect(CDR(val));
274      }
275  }  }
276    
277    
278  /* Unprotect values from GC */  /* Unprotect values from GC */
279  void unprotect(environment *env)  void unprotect(value *val)
280  {  {
281    stackitem *temp= env->gc_protect;    if(val==NULL || !(val->gc.flag.protect))
282    env->gc_protect= env->gc_protect->next;      return;
283    free(temp);  
284      val->gc.flag.protect= 0;
285    
286      if(val->type==tcons) {
287        unprotect(CAR(val));
288        unprotect(CDR(val));
289      }
290  }  }
291    
292    
293  /* Push a value onto the stack */  /* Push a value onto the stack */
294  void push_val(environment *env, value *val)  void push_val(environment *env, value *val)
295  {  {
296    stackitem *new_item= malloc(sizeof(stackitem));    value *new_value= new_val(env);
297    new_item->item= val;  
298    new_item->next= env->head;    new_value->content.c= malloc(sizeof(pair));
299    env->head= new_item;    assert(new_value->content.c!=NULL);
300      env->gc_count += sizeof(pair);
301      new_value->type= tcons;
302      CAR(new_value)= val;
303      CDR(new_value)= env->head;
304      env->head= new_value;
305  }  }
306    
307    
308  /* Push an integer onto the stack */  /* Push an integer onto the stack */
309  void push_int(environment *env, int in_val)  void push_int(environment *env, int in_val)
310  {  {
# Line 271  void push_int(environment *env, int in_v Line 316  void push_int(environment *env, int in_v
316    push_val(env, new_value);    push_val(env, new_value);
317  }  }
318    
319    
320  /* Push a floating point number onto the stack */  /* Push a floating point number onto the stack */
321  void push_float(environment *env, float in_val)  void push_float(environment *env, float in_val)
322  {  {
# Line 282  void push_float(environment *env, float Line 328  void push_float(environment *env, float
328    push_val(env, new_value);    push_val(env, new_value);
329  }  }
330    
331    
332  /* Copy a string onto the stack. */  /* Copy a string onto the stack. */
333  void push_cstring(environment *env, const char *in_string)  void push_cstring(environment *env, const char *in_string)
334  {  {
335    value *new_value= new_val(env);    value *new_value= new_val(env);
336      int length= strlen(in_string)+1;
337    
338    new_value->content.ptr= malloc(strlen(in_string)+1);    new_value->content.string= malloc(length);
339    strcpy(new_value->content.ptr, in_string);    assert(new_value != NULL);
340      env->gc_count += length;
341      strcpy(new_value->content.string, in_string);
342    new_value->type= string;    new_value->type= string;
343    
344    push_val(env, new_value);    push_val(env, new_value);
345  }  }
346    
347    
348  /* Mangle a symbol name to a valid C identifier name */  /* Mangle a symbol name to a valid C identifier name */
349  char *mangle_str(const char *old_string)  char *mangle_str(const char *old_string)
350  {  {
# Line 301  char *mangle_str(const char *old_string) Line 352  char *mangle_str(const char *old_string)
352    char *new_string, *current;    char *new_string, *current;
353    
354    new_string= malloc((strlen(old_string)*2)+4);    new_string= malloc((strlen(old_string)*2)+4);
355      assert(new_string != NULL);
356    strcpy(new_string, "sx_");    /* Stack eXternal */    strcpy(new_string, "sx_");    /* Stack eXternal */
357    current= new_string+3;    current= new_string+3;
358    
359    while(old_string[0] != '\0'){    while(old_string[0] != '\0'){
360      current[0]= validchars[(unsigned char)(old_string[0])/16];      current[0]= validchars[(unsigned char)(old_string[0])/16];
361      current[1]= validchars[(unsigned char)(old_string[0])%16];      current[1]= validchars[(unsigned char)(old_string[0])%16];
# Line 314  char *mangle_str(const char *old_string) Line 367  char *mangle_str(const char *old_string)
367    return new_string;            /* The caller must free() it */    return new_string;            /* The caller must free() it */
368  }  }
369    
 extern void mangle(environment *env)  
 {  
   char *new_string;  
   
   if((env->head)==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->item->type!=string) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   new_string= mangle_str((const char *)(env->head->item->content.ptr));  
   
   toss(env);  
   if(env->err) return;  
   
   push_cstring(env, new_string);  
 }  
370    
371  /* Push a symbol onto the stack. */  /* Push a symbol onto the stack. */
372  void push_sym(environment *env, const char *in_string)  void push_sym(environment *env, const char *in_string)
# Line 354  void push_sym(environment *env, const ch Line 384  void push_sym(environment *env, const ch
384    char *mangled;                /* Mangled function name */    char *mangled;                /* Mangled function name */
385    
386    new_value= new_val(env);    new_value= new_val(env);
   protect(env, new_value);  
387    new_fvalue= new_val(env);    new_fvalue= new_val(env);
   protect(env, new_fvalue);  
388    
389    /* The new value is a symbol */    /* The new value is a symbol */
390    new_value->type= symb;    new_value->type= symb;
391    
392    /* Look up the symbol name in the hash table */    /* Look up the symbol name in the hash table */
393    new_symbol= hash(env->symbols, in_string);    new_symbol= hash(env->symbols, in_string);
394    new_value->content.ptr= *new_symbol;    new_value->content.sym= *new_symbol;
395    
396    if(*new_symbol==NULL) { /* If symbol was undefined */    if(*new_symbol==NULL) { /* If symbol was undefined */
397    
398      /* Create a new symbol */      /* Create a new symbol */
399      (*new_symbol)= malloc(sizeof(symbol));      (*new_symbol)= malloc(sizeof(symbol));
400        assert((*new_symbol) != NULL);
401      (*new_symbol)->val= NULL;   /* undefined value */      (*new_symbol)->val= NULL;   /* undefined value */
402      (*new_symbol)->next= NULL;      (*new_symbol)->next= NULL;
403      (*new_symbol)->id= malloc(strlen(in_string)+1);      (*new_symbol)->id= malloc(strlen(in_string)+1);
404        assert((*new_symbol)->id != NULL);
405      strcpy((*new_symbol)->id, in_string);      strcpy((*new_symbol)->id, in_string);
406    
407      /* Intern the new symbol in the hash table */      /* Intern the new symbol in the hash table */
408      new_value->content.ptr= *new_symbol;      new_value->content.sym= *new_symbol;
409    
410      /* 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
411         we should bind the symbol to a new function pointer value */         we should bind the symbol to a new function pointer value */
# Line 393  void push_sym(environment *env, const ch Line 423  void push_sym(environment *env, const ch
423    
424      if(dlerr==NULL) {           /* If a function was found */      if(dlerr==NULL) {           /* If a function was found */
425        new_fvalue->type= func;   /* The new value is a function pointer */        new_fvalue->type= func;   /* The new value is a function pointer */
426        new_fvalue->content.ptr= funcptr; /* Store function pointer */        new_fvalue->content.func= funcptr; /* Store function pointer */
427        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new
428                                           function value */                                           function value */
429      }      }
# Line 402  void push_sym(environment *env, const ch Line 432  void push_sym(environment *env, const ch
432    }    }
433    
434    push_val(env, new_value);    push_val(env, new_value);
   unprotect(env); unprotect(env);  
435  }  }
436    
 /* Print newline. */  
 extern void nl()  
 {  
   printf("\n");  
 }  
437    
438  /* Gets the type of a value */  /* Print a value */
439  extern void type(environment *env)  void print_val(environment *env, value *val, int noquote, stackitem *stack,
440  {                 FILE *stream)
441    int typenum;  {
442      stackitem *titem, *tstack;
443    if((env->head)==NULL) {    int depth;
444      printerr("Too Few Arguments");  
445      env->err=1;    switch(val->type) {
446      return;    case empty:
447    }      if(fprintf(stream, "[]") < 0){
448    typenum=env->head->item->type;        perror("print_val");
449    toss(env);        env->err= 5;
450    switch(typenum){        return;
451    case integer:      }
     push_sym(env, "integer");  
     break;  
   case tfloat:  
     push_sym(env, "float");  
     break;  
   case string:  
     push_sym(env, "string");  
     break;  
   case symb:  
     push_sym(env, "symbol");  
     break;  
   case func:  
     push_sym(env, "function");  
452      break;      break;
453    case list:    case unknown:
454      push_sym(env, "list");      if(fprintf(stream, "UNKNOWN") < 0){
455          perror("print_val");
456          env->err= 5;
457          return;
458        }
459      break;      break;
   }  
 }      
   
 /* Prints the top element of the stack. */  
 void print_h(stackitem *stack_head, int noquote)  
 {  
   switch(stack_head->item->type) {  
460    case integer:    case integer:
461      printf("%d", stack_head->item->content.i);      if(fprintf(stream, "%d", val->content.i) < 0){
462          perror("print_val");
463          env->err= 5;
464          return;
465        }
466      break;      break;
467    case tfloat:    case tfloat:
468      printf("%f", stack_head->item->content.f);      if(fprintf(stream, "%f", val->content.f) < 0){
469          perror("print_val");
470          env->err= 5;
471          return;
472        }
473      break;      break;
474    case string:    case string:
475      if(noquote)      if(noquote){
476        printf("%s", (char*)stack_head->item->content.ptr);        if(fprintf(stream, "%s", val->content.string) < 0){
477      else          perror("print_val");
478        printf("\"%s\"", (char*)stack_head->item->content.ptr);          env->err= 5;
479            return;
480          }
481        } else {                    /* quote */
482          if(fprintf(stream, "\"%s\"", val->content.string) < 0){
483            perror("print_val");
484            env->err= 5;
485            return;
486          }
487        }
488      break;      break;
489    case symb:    case symb:
490      printf("%s", ((symbol *)(stack_head->item->content.ptr))->id);      if(fprintf(stream, "%s", val->content.sym->id) < 0){
491          perror("print_val");
492          env->err= 5;
493          return;
494        }
495      break;      break;
496    case func:    case func:
497      printf("#<function %p>", (funcp)(stack_head->item->content.ptr));      if(fprintf(stream, "#<function %p>", val->content.func) < 0){
498          perror("print_val");
499          env->err= 5;
500          return;
501        }
502      break;      break;
503    case list:    case port:
504      /* A list is just a stack, so make stack_head point to it */      if(fprintf(stream, "#<port %p>", val->content.p) < 0){
505      stack_head=(stackitem *)(stack_head->item->content.ptr);        perror("print_val");
506      printf("[ ");        env->err= 5;
507      while(stack_head != NULL) {        return;
       print_h(stack_head, noquote);  
       printf(" ");  
       stack_head=stack_head->next;  
508      }      }
     printf("]");  
509      break;      break;
510    }    case tcons:
511  }      if(fprintf(stream, "[ ") < 0){
512          perror("print_val");
513          env->err= 5;
514          return;
515        }
516        tstack= stack;
517    
518  extern void print_(environment *env)      do {
519  {        titem=malloc(sizeof(stackitem));
520    if(env->head==NULL) {        assert(titem != NULL);
521      printerr("Too Few Arguments");        titem->item=val;
522      env->err=1;        titem->next=tstack;
523      return;        tstack=titem;             /* Put it on the stack */
524    }        /* Search a stack of values being printed to see if we are already
525    print_h(env->head, 0);           printing this value */
526    nl();        titem=tstack;
527  }        depth=0;
528    
529          while(titem != NULL && titem->item != CAR(val)){
530            titem=titem->next;
531            depth++;
532          }
533    
534  /* Prints the top element of the stack and then discards it. */        if(titem != NULL){        /* If we found it on the stack, */
535  extern void print(environment *env)          if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */
536  {            perror("print_val");
537    print_(env);            env->err= 5;
538    if(env->err) return;            free(titem);
539    toss(env);            return;
540  }          }
541          } else {
542            print_val(env, CAR(val), noquote, tstack, stream);
543          }
544    
545  extern void princ_(environment *env)        val= CDR(val);
546  {        switch(val->type){
547    if(env->head==NULL) {        case empty:
548      printerr("Too Few Arguments");          break;
549      env->err=1;        case tcons:
550      return;          /* Search a stack of values being printed to see if we are already
551    }             printing this value */
552    print_h(env->head, 1);          titem=tstack;
553  }          depth=0;
554    
555            while(titem != NULL && titem->item != val){
556              titem=titem->next;
557              depth++;
558            }
559            if(titem != NULL){      /* If we found it on the stack, */
560              if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */
561                perror("print_val");
562                env->err= 5;
563                goto printval_end;
564              }
565            } else {
566              if(fprintf(stream, " ") < 0){
567                perror("print_val");
568                env->err= 5;
569                goto printval_end;
570              }
571            }
572            break;
573          default:
574            if(fprintf(stream, " . ") < 0){ /* Improper list */
575              perror("print_val");
576              env->err= 5;
577              goto printval_end;
578            }
579            print_val(env, val, noquote, tstack, stream);
580          }
581        } while(val->type == tcons && titem == NULL);
582    
583  /* Prints the top element of the stack and then discards it. */    printval_end:
 extern void princ(environment *env)  
 {  
   princ_(env);  
   if(env->err) return;  
   toss(env);  
 }  
584    
585  /* Only to be called by function printstack. */      titem=tstack;
586  void print_st(stackitem *stack_head, long counter)      while(titem != stack){
587  {        tstack=titem->next;
588    if(stack_head->next != NULL)        free(titem);
589      print_st(stack_head->next, counter+1);        titem=tstack;
590    printf("%ld: ", counter);      }
   print_h(stack_head, 0);  
   nl();  
 }  
591    
592  /* Prints the stack. */      if(! (env->err)){
593  extern void printstack(environment *env)        if(fprintf(stream, " ]") < 0){
594  {          perror("print_val");
595    if(env->head == NULL) {          env->err= 5;
596      printf("Stack Empty\n");        }
597      return;      }
598        break;
599    }    }
   
   print_st(env->head, 1);  
600  }  }
601    
602    
603  /* Swap the two top elements on the stack. */  /* Swap the two top elements on the stack. */
604  extern void swap(environment *env)  extern void swap(environment *env)
605  {  {
606    stackitem *temp= env->head;    value *temp= env->head;
     
   if(env->head==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
   
   env->head= env->head->next;  
   temp->next= env->head->next;  
   env->head->next= temp;  
 }  
607    
608  /* Rotate the first three elements on the stack. */    if(check_args(env, unknown, unknown, empty))
609  extern void rot(environment *env)      return printerr(env);
 {  
   stackitem *temp= env->head;  
610        
611    if(env->head==NULL || env->head->next==NULL    env->head= CDR(env->head);
612        || env->head->next->next==NULL) {    CDR(temp)= CDR(env->head);
613      printerr("Too Few Arguments");    CDR(env->head)= temp;
614      env->err=1;  }
     return;  
   }  
615    
   env->head= env->head->next->next;  
   temp->next->next= env->head->next;  
   env->head->next= temp;  
 }  
616    
617  /* Recall a value from a symbol, if bound */  /* Recall a value from a symbol, if bound */
618  extern void rcl(environment *env)  extern void rcl(environment *env)
619  {  {
620    value *val;    value *val;
621    
622    if(env->head == NULL) {    if(check_args(env, symb, empty))
623      printerr("Too Few Arguments");      return printerr(env);
     env->err=1;  
     return;  
   }  
   
   if(env->head->item->type!=symb) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
624    
625    val=((symbol *)(env->head->item->content.ptr))->val;    val= CAR(env->head)->content.sym->val;
626    if(val == NULL){    if(val == NULL){
627      printerr("Unbound Variable");      env->err= 3;
628      env->err=3;      return printerr(env);
     return;  
629    }    }
630    protect(env, val);  
631    toss(env);            /* toss the symbol */    push_val(env, val);           /* Return the symbol's bound value */
632      swap(env);
633    if(env->err) return;    if(env->err) return;
634    push_val(env, val); /* Return its bound value */    env->head= CDR(env->head);
   unprotect(env);  
635  }  }
636    
637    
638  /* If the top element is a symbol, determine if it's bound to a  /* If the top element is a symbol, determine if it's bound to a
639     function value, and if it is, toss the symbol and execute the     function value, and if it is, toss the symbol and execute the
640     function. */     function. */
# Line 609  extern void eval(environment *env) Line 642  extern void eval(environment *env)
642  {  {
643    funcp in_func;    funcp in_func;
644    value* temp_val;    value* temp_val;
645    stackitem* iterator;    value* iterator;
646    
647   eval_start:   eval_start:
648    
649    if(env->head==NULL) {    gc_maybe(env);
650      printerr("Too Few Arguments");  
651      env->err=1;    if(check_args(env, unknown, empty))
652      return;      return printerr(env);
   }  
653    
654    switch(env->head->item->type) {    switch(CAR(env->head)->type) {
655      /* if it's a symbol */      /* if it's a symbol */
656    case symb:    case symb:
657        env->errsymb= CAR(env->head)->content.sym->id;
658      rcl(env);                   /* get its contents */      rcl(env);                   /* get its contents */
659      if(env->err) return;      if(env->err) return;
660      if(env->head->item->type!=symb){ /* don't recurse symbols */      if(CAR(env->head)->type!=symb){ /* don't recurse symbols */
661        goto eval_start;        goto eval_start;
662      }      }
663      return;      return;
664    
665      /* If it's a lone function value, run it */      /* If it's a lone function value, run it */
666    case func:    case func:
667      in_func= (funcp)(env->head->item->content.ptr);      in_func= CAR(env->head)->content.func;
668      toss(env);      env->head= CDR(env->head);
669      if(env->err) return;      return in_func((void*)env);
     return in_func(env);  
670    
671      /* If it's a list */      /* If it's a list */
672    case list:    case tcons:
673      temp_val= env->head->item;      temp_val= CAR(env->head);
674      protect(env, temp_val);      protect(temp_val);
675    
676      toss(env); if(env->err) return;      env->head= CDR(env->head);
677      iterator= (stackitem*)temp_val->content.ptr;      iterator= temp_val;
678            
679      while(iterator!=NULL) {      while(iterator->type != empty) {
680        push_val(env, iterator->item);        push_val(env, CAR(iterator));
681                
682        if(env->head->item->type==symb       if(CAR(env->head)->type==symb
683          && strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) {           && CAR(env->head)->content.sym->id[0]==';') {
684          toss(env);          env->head= CDR(env->head);
         if(env->err) return;  
685                    
686          if(iterator->next == NULL){          if(CDR(iterator)->type == empty){
687            goto eval_start;            goto eval_start;
688          }          }
689          eval(env);          eval(env);
690          if(env->err) return;          if(env->err) return;
691        }        }
692        iterator= iterator->next;        if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons)
693            iterator= CDR(iterator);
694          else {
695            env->err= 2; /* Improper list */
696            return printerr(env);
697          }
698      }      }
699      unprotect(env);      unprotect(temp_val);
     return;  
   
   default:  
     return;  
   }  
 }  
   
 /* Reverse (flip) a list */  
 extern void rev(environment *env)  
 {  
   stackitem *old_head, *new_head, *item;  
   
   if((env->head)==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->item->type!=list) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   old_head= (stackitem *)(env->head->item->content.ptr);  
   new_head= NULL;  
   while(old_head != NULL){  
     item= old_head;  
     old_head= old_head->next;  
     item->next= new_head;  
     new_head= item;  
   }  
   env->head->item->content.ptr= new_head;  
 }  
   
 /* Make a list. */  
 extern void pack(environment *env)  
 {  
   stackitem *iterator, *temp;  
   value *pack;  
   
   iterator= env->head;  
   pack= new_val(env);  
   protect(env, pack);  
   
   if(iterator==NULL  
      || (iterator->item->type==symb  
      && ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) {  
     temp= NULL;  
     toss(env);  
   } else {  
     /* Search for first delimiter */  
     while(iterator->next!=NULL  
           && (iterator->next->item->type!=symb  
           || ((symbol*)(iterator->next->item->content.ptr))->id[0]!='['))  
       iterator= iterator->next;  
       
     /* Extract list */  
     temp= env->head;  
     env->head= iterator->next;  
     iterator->next= NULL;  
   
     pack->type= list;  
     pack->content.ptr= temp;  
       
     if(env->head!=NULL)  
       toss(env);  
   }  
   
   /* Push list */  
   
   push_val(env, pack);  
   rev(env);  
   
   unprotect(env);  
 }  
   
 /* Relocate elements of the list on the stack. */  
 extern void expand(environment *env)  
 {  
   stackitem *temp, *new_head;  
   
   /* Is top element a list? */  
   if(env->head==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   if(env->head->item->type!=list) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   rev(env);  
   
   if(env->err)  
     return;  
   
   /* The first list element is the new stack head */  
   new_head= temp= env->head->item->content.ptr;  
   
   toss(env);  
   
   /* Find the end of the list */  
   while(temp->next!=NULL)  
     temp= temp->next;  
   
   /* Connect the tail of the list with the old stack head */  
   temp->next= env->head;  
   env->head= new_head;          /* ...and voila! */  
   
 }  
   
 /* Compares two elements by reference. */  
 extern void eq(environment *env)  
 {  
   void *left, *right;  
   int result;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   left= env->head->item->content.ptr;  
   swap(env);  
   right= env->head->item->content.ptr;  
   result= (left==right);  
     
   toss(env); toss(env);  
   push_int(env, result);  
 }  
   
 /* Negates the top element on the stack. */  
 extern void not(environment *env)  
 {  
   int val;  
   
   if((env->head)==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->item->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
700      return;      return;
   }  
   
   val= env->head->item->content.i;  
   toss(env);  
   push_int(env, !val);  
 }  
   
 /* Compares the two top elements on the stack and return 0 if they're the  
    same. */  
 extern void neq(environment *env)  
 {  
   eq(env);  
   not(env);  
 }  
701    
702  /* Give a symbol some content. */    case empty:
703  extern void def(environment *env)      env->head= CDR(env->head);
704  {    case integer:
705    symbol *sym;    case tfloat:
706      case string:
707    /* Needs two values on the stack, the top one must be a symbol */    case port:
708    if(env->head==NULL || env->head->next==NULL) {    case unknown:
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->item->type!=symb) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
709      return;      return;
710    }    }
   
   /* long names are a pain */  
   sym= env->head->item->content.ptr;  
   
   /* Bind the symbol to the value */  
   sym->val= env->head->next->item;  
   
   toss(env); toss(env);  
 }  
   
 /* Quit stack. */  
 extern void quit(environment *env)  
 {  
   int i;  
   
   clear(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_init(env);  
   
   if(env->free_string!=NULL)  
     free(env->free_string);  
     
   muntrace();  
   
   exit(EXIT_SUCCESS);  
711  }  }
712    
 /* Clear stack */  
 extern void clear(environment *env)  
 {  
   while(env->head!=NULL)  
     toss(env);  
 }  
   
 /* 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) {  
       printf("%s\n", temp->id);  
       temp= temp->next;  
     }  
   }  
 }  
713    
714  /* Internal forget function */  /* Internal forget function */
715  void forget_sym(symbol **hash_entry)  void forget_sym(symbol **hash_entry)
# Line 913  void forget_sym(symbol **hash_entry) Line 723  void forget_sym(symbol **hash_entry)
723    free(temp);    free(temp);
724  }  }
725    
 /* Forgets a symbol (remove it from the hash table) */  
 extern void forget(environment *env)  
 {  
   char* sym_id;  
   stackitem *stack_head= env->head;  
   
   if(stack_head==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
     
   if(stack_head->item->type!=symb) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
   
   sym_id= ((symbol*)(stack_head->item->content.ptr))->id;  
   toss(env);  
   
   return forget_sym(hash(env->symbols, sym_id));  
 }  
   
 /* Returns the current error number to the stack */  
 extern void errn(environment *env)  
 {  
   push_int(env, env->err);  
 }  
726    
727  int main(int argc, char **argv)  int main(int argc, char **argv)
728  {  {
729    environment myenv;    environment myenv;
   
730    int c;                        /* getopt option character */    int c;                        /* getopt option character */
731    
732    #ifdef __linux__
733    mtrace();    mtrace();
734    #endif
735    
736    init_env(&myenv);    init_env(&myenv);
737    
# Line 963  int main(int argc, char **argv) Line 745  int main(int argc, char **argv)
745          break;          break;
746        case '?':        case '?':
747          fprintf (stderr,          fprintf (stderr,
748                   "Unknown option character `\\x%x'.\n",                   "Unknown option character '\\x%x'.\n",
749                   optopt);                   optopt);
750          return EX_USAGE;          return EX_USAGE;
751        default:        default:
# Line 979  int main(int argc, char **argv) Line 761  int main(int argc, char **argv)
761      }      }
762    }    }
763    
764    if(myenv.interactive) {    if(myenv.interactive)
765      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");  
   }  
766    
767    while(1) {    while(1) {
768      if(myenv.in_string==NULL) {      if(myenv.in_string==NULL) {
769        if (myenv.interactive) {        if (myenv.interactive) {
770          if(myenv.err) {          if(myenv.err) {
771            printf("(error %d)\n", myenv.err);            printf("(error %d)\n", myenv.err);
772              myenv.err= 0;
773          }          }
774          nl();          printf("\n");
775          printstack(&myenv);          printstack(&myenv);
776          printf("> ");          printf("> ");
777        }        }
778        myenv.err=0;        myenv.err=0;
779      }      }
780      sx_72656164(&myenv);      readstream(&myenv, myenv.inputstream);
781      if (myenv.err==4) {      if (myenv.err) {            /* EOF or other error */
782        return EXIT_SUCCESS;      /* EOF */        myenv.err=0;
783      } else if(myenv.head!=NULL        quit(&myenv);
784                && myenv.head->item->type==symb      } else if(myenv.head->type!=empty
785                && ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') {                && CAR(myenv.head)->type==symb
786        toss(&myenv);             /* No error check in main */                && CAR(myenv.head)->content.sym->id[0] == ';') {
787          if(myenv.head->type != empty)
788            myenv.head= CDR(myenv.head);
789        eval(&myenv);        eval(&myenv);
790        } else {
791          gc_maybe(&myenv);
792      }      }
     gc_init(&myenv);  
793    }    }
794    quit(&myenv);    quit(&myenv);
795    return EXIT_FAILURE;    return EXIT_FAILURE;
796  }  }
797    
 /* "+" */  
 extern void sx_2b(environment *env)  
 {  
   int a, b;  
   float fa, fb;  
   size_t len;  
   char* new_string;  
   value *a_val, *b_val;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->item->type==string  
      && env->head->next->item->type==string) {  
     a_val= env->head->item;  
     b_val= env->head->next->item;  
     protect(env, a_val); protect(env, b_val);  
     toss(env); if(env->err) return;  
     toss(env); if(env->err) return;  
     len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1;  
     new_string= malloc(len);  
     strcpy(new_string, b_val->content.ptr);  
     strcat(new_string, a_val->content.ptr);  
     push_cstring(env, new_string);  
     unprotect(env); unprotect(env);  
     free(new_string);  
       
     return;  
   }  
     
   if(env->head->item->type==integer  
      && env->head->next->item->type==integer) {  
     a=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     b=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b+a);  
   
     return;  
   }  
   
   if(env->head->item->type==tfloat  
      && env->head->next->item->type==tfloat) {  
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb+fa);  
       
     return;  
   }  
   
   if(env->head->item->type==tfloat  
      && env->head->next->item->type==integer) {  
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     b= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b+fa);  
       
     return;  
   }  
   
   if(env->head->item->type==integer  
      && env->head->next->item->type==tfloat) {  
     a= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb+a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err=2;  
 }  
   
 /* "-" */  
 extern void sx_2d(environment *env)  
 {  
   int a, b;  
   float fa, fb;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
     
   if(env->head->item->type==integer  
      && env->head->next->item->type==integer) {  
     a=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     b=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b-a);  
   
     return;  
   }  
   
   if(env->head->item->type==tfloat  
      && env->head->next->item->type==tfloat) {  
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb-fa);  
       
     return;  
   }  
   
   if(env->head->item->type==tfloat  
      && env->head->next->item->type==integer) {  
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     b= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b-fa);  
       
     return;  
   }  
   
   if(env->head->item->type==integer  
      && env->head->next->item->type==tfloat) {  
     a= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb-a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err=2;  
 }  
   
 /* ">" */  
 extern void sx_3e(environment *env)  
 {  
   int a, b;  
   float fa, fb;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
     
   if(env->head->item->type==integer  
      && env->head->next->item->type==integer) {  
     a=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     b=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b>a);  
   
     return;  
   }  
   
   if(env->head->item->type==tfloat  
      && env->head->next->item->type==tfloat) {  
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_int(env, fb>fa);  
       
     return;  
   }  
   
   if(env->head->item->type==tfloat  
      && env->head->next->item->type==integer) {  
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     b= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b>fa);  
       
     return;  
   }  
   
   if(env->head->item->type==integer  
      && env->head->next->item->type==tfloat) {  
     a= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_int(env, fb>a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err=2;  
 }  
   
 /* "<" */  
 extern void sx_3c(environment *env)  
 {  
   swap(env); if(env->err) return;  
   sx_3e(env);  
 }  
   
 /* "<=" */  
 extern void sx_3c3d(environment *env)  
 {  
   sx_3e(env); if(env->err) return;  
   not(env);  
 }  
   
 /* ">=" */  
 extern void sx_3e3d(environment *env)  
 {  
   sx_3c(env); if(env->err) return;  
   not(env);  
 }  
798    
799  /* Return copy of a value */  /* Return copy of a value */
800  value *copy_val(environment *env, value *old_value)  value *copy_val(environment *env, value *old_value)
801  {  {
   stackitem *old_item, *new_item, *prev_item;  
802    value *new_value;    value *new_value;
803    
804    protect(env, old_value);    if(old_value==NULL)
805        return NULL;
806    
807    new_value= new_val(env);    new_value= new_val(env);
   protect(env, new_value);  
808    new_value->type= old_value->type;    new_value->type= old_value->type;
809    
810    switch(old_value->type){    switch(old_value->type){
# Line 1252  value *copy_val(environment *env, value Line 812  value *copy_val(environment *env, value
812    case integer:    case integer:
813    case func:    case func:
814    case symb:    case symb:
815      case empty:
816      case unknown:
817      case port:
818      new_value->content= old_value->content;      new_value->content= old_value->content;
819      break;      break;
820    case string:    case string:
821      (char *)(new_value->content.ptr)=      new_value->content.string= strdup(old_value->content.string);
       strdup((char *)(old_value->content.ptr));  
822      break;      break;
823    case list:    case tcons:
     new_value->content.ptr= NULL;  
824    
825      prev_item= NULL;      new_value->content.c= malloc(sizeof(pair));
826      old_item= (stackitem*)(old_value->content.ptr);      assert(new_value->content.c!=NULL);
827        env->gc_count += sizeof(pair);
828    
829      while(old_item != NULL) {   /* While list is not empty */      CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */
830        new_item= malloc(sizeof(stackitem));      CDR(new_value)= copy_val(env, CDR(old_value)); /* recurse */
       new_item->item= copy_val(env, old_item->item); /* recurse */  
       new_item->next= NULL;  
       if(prev_item != NULL)     /* If this wasn't the first item */  
         prev_item->next= new_item; /* point the previous item to the  
                                      new item */  
       else  
         new_value->content.ptr= new_item;  
       old_item= old_item->next;  
       prev_item= new_item;  
     }      
831      break;      break;
832    }    }
833    
   unprotect(env); unprotect(env);  
   
834    return new_value;    return new_value;
835  }  }
836    
 /* "dup"; duplicates an item on the stack */  
 extern void sx_647570(environment *env)  
 {  
   if((env->head)==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   push_val(env, copy_val(env, env->head->item));  
 }  
   
 /* "if", If-Then */  
 extern void sx_6966(environment *env)  
 {  
   int truth;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->next->item->type != integer) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
     
   swap(env);  
   if(env->err) return;  
     
   truth=env->head->item->content.i;  
   
   toss(env);  
   if(env->err) return;  
   
   if(truth)  
     eval(env);  
   else  
     toss(env);  
 }  
   
 /* If-Then-Else */  
 extern void ifelse(environment *env)  
 {  
   int truth;  
837    
838    if((env->head)==NULL || env->head->next==NULL  /* read a line from a stream; used by readline */
839       || env->head->next->next==NULL) {  void readlinestream(environment *env, FILE *stream)
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
   
   if(env->head->next->next->item->type != integer) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
     
   rot(env);  
   if(env->err) return;  
     
   truth=env->head->item->content.i;  
   
   toss(env);  
   if(env->err) return;  
   
   if(!truth)  
     swap(env);  
   if(env->err) return;  
   
   toss(env);  
   if(env->err) return;  
   
   eval(env);  
 }  
   
 /* "while" */  
 extern void sx_7768696c65(environment *env)  
840  {  {
841    int truth;    char in_string[101];
   value *loop, *test;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
   
   loop= env->head->item;  
   protect(env, loop);  
   toss(env); if(env->err) return;  
   
   test= env->head->item;  
   protect(env, test);  
   toss(env); if(env->err) return;  
   
   do {  
     push_val(env, test);  
     eval(env);  
       
     if(env->head->item->type != integer) {  
       printerr("Bad Argument Type");  
       env->err= 2;  
       return;  
     }  
       
     truth= env->head->item->content.i;  
     toss(env); if(env->err) return;  
       
     if(truth) {  
       push_val(env, loop);  
       eval(env);  
     } else {  
       toss(env);  
     }  
     
   } while(truth);  
   
   unprotect(env); unprotect(env);  
 }  
   
   
 /* "for"; for-loop */  
 extern void sx_666f72(environment *env)  
 {  
   value *loop;  
   int foo1, foo2;  
   
   if(env->head==NULL || env->head->next==NULL  
      || env->head->next->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->next->item->type!=integer  
      || env->head->next->next->item->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
842    
843    loop= env->head->item;    if(fgets(in_string, 100, stream)==NULL) {
844    protect(env, loop);      push_cstring(env, "");
845    toss(env); if(env->err) return;      if (! feof(stream)){
846          perror("readline");
847    foo2= env->head->item->content.i;        env->err= 5;
   toss(env); if(env->err) return;  
   
   foo1= env->head->item->content.i;  
   toss(env); if(env->err) return;  
   
   if(foo1<=foo2) {  
     while(foo1<=foo2) {  
       push_int(env, foo1);  
       push_val(env, loop);  
       eval(env); if(env->err) return;  
       foo1++;  
848      }      }
849    } else {    } else {
850      while(foo1>=foo2) {      push_cstring(env, in_string);
       push_int(env, foo1);  
       push_val(env, loop);  
       eval(env); if(env->err) return;  
       foo1--;  
     }  
851    }    }
   unprotect(env);  
852  }  }
853    
 /* Variant of for-loop */  
 extern void foreach(environment *env)  
 {    
   value *loop, *foo;  
   stackitem *iterator;  
     
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->next->item->type != list) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
854    
855    loop= env->head->item;  /* Reverse (flip) a list */
856    protect(env, loop);  extern void rev(environment *env)
857    toss(env); if(env->err) return;  {
858      value *old_head, *new_head, *item;
859    
860    foo= env->head->item;    if(CAR(env->head)->type==empty)
861    protect(env, foo);      return;                     /* Don't reverse an empty list */
   toss(env); if(env->err) return;  
862    
863    iterator= foo->content.ptr;    if(check_args(env, tcons, empty))
864        return printerr(env);
865    
866    while(iterator!=NULL) {    old_head= CAR(env->head);
867      push_val(env, iterator->item);    new_head= new_val(env);
868      push_val(env, loop);    while(old_head->type != empty) {
869      eval(env); if(env->err) return;      item= old_head;
870      iterator= iterator->next;      old_head= CDR(old_head);
871        CDR(item)= new_head;
872        new_head= item;
873    }    }
874    unprotect(env); unprotect(env);    CAR(env->head)= new_head;
875  }  }
876    
 /* "to" */  
 extern void to(environment *env)  
 {  
   int ending, start, i;  
   stackitem *iterator, *temp;  
   value *pack;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
877    
878    if(env->head->item->type!=integer  /* Make a list. */
879       || env->head->next->item->type!=integer) {  extern void pack(environment *env)
880      printerr("Bad Argument Type");  {
881      env->err=2;    value *iterator, *temp, *ending;
     return;  
   }  
882    
883    ending= env->head->item->content.i;    ending=new_val(env);
   toss(env); if(env->err) return;  
   start= env->head->item->content.i;  
   toss(env); if(env->err) return;  
   
   push_sym(env, "[");  
   
   if(ending>=start) {  
     for(i= ending; i>=start; i--)  
       push_int(env, i);  
   } else {  
     for(i= ending; i<=start; i++)  
       push_int(env, i);  
   }  
884    
885    iterator= env->head;    iterator= env->head;
886    pack= new_val(env);    if(iterator->type == empty
887    protect(env, pack);       || (CAR(iterator)->type==symb
888         && CAR(iterator)->content.sym->id[0]=='[')) {
889    if(iterator==NULL      temp= ending;
890       || (iterator->item->type==symb      if(env->head->type != empty)
891       && ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) {        env->head= CDR(env->head);
     temp= NULL;  
     toss(env);  
892    } else {    } else {
893      /* Search for first delimiter */      /* Search for first delimiter */
894      while(iterator->next!=NULL      while(CDR(iterator)->type != empty
895            && (iterator->next->item->type!=symb            && (CAR(CDR(iterator))->type!=symb
896            || ((symbol*)(iterator->next->item->content.ptr))->id[0]!='['))             || CAR(CDR(iterator))->content.sym->id[0]!='['))
897        iterator= iterator->next;        iterator= CDR(iterator);
898            
899      /* Extract list */      /* Extract list */
900      temp= env->head;      temp= env->head;
901      env->head= iterator->next;      env->head= CDR(iterator);
902      iterator->next= NULL;      CDR(iterator)= ending;
903    
904      pack->type= list;      if(env->head->type != empty)
905      pack->content.ptr= temp;        env->head= CDR(env->head);
       
     if(env->head!=NULL)  
       toss(env);  
906    }    }
907    
908    /* Push list */    /* Push list */
909    
910    push_val(env, pack);    push_val(env, temp);
911      rev(env);
   unprotect(env);  
912  }  }
913    
 /* Read a string */  
 extern void readline(environment *env)  
 {  
   char in_string[101];  
914    
915    if(fgets(in_string, 100, env->inputstream)==NULL)  /* read from a stream; used by "read" and "readport" */
916      push_cstring(env, "");  void readstream(environment *env, FILE *stream)
   else  
     push_cstring(env, in_string);  
 }  
   
 /* "read"; Read a value and place on stack */  
 extern void sx_72656164(environment *env)  
917  {  {
918    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";
919    const char strform[]= "\"%[^\"]\"%n";    const char strform[]= "\"%[^\"]\"%n";
# Line 1590  extern void sx_72656164(environment *env Line 928  extern void sx_72656164(environment *env
928    int count= -1;    int count= -1;
929    float ftemp;    float ftemp;
930    static int depth= 0;    static int depth= 0;
931    char *match, *ctemp;    char *match;
932    size_t inlength;    size_t inlength;
933    
934    if(env->in_string==NULL) {    if(env->in_string==NULL) {
935      if(depth > 0 && env->interactive) {      if(depth > 0 && env->interactive) {
936        printf("]> ");        printf("]> ");
937      }      }
938      readline(env); if(env->err) return;      readlinestream(env, env->inputstream);
939        if(env->err) return;
940    
941      if(((char *)(env->head->item->content.ptr))[0]=='\0'){      if((CAR(env->head)->content.string)[0]=='\0'){
942        env->err= 4;              /* "" means EOF */        env->err= 4;              /* "" means EOF */
943        return;        return;
944      }      }
945            
946      env->in_string= malloc(strlen(env->head->item->content.ptr)+1);      env->in_string= malloc(strlen(CAR(env->head)->content.string)+1);
947        assert(env->in_string != NULL);
948      env->free_string= env->in_string; /* Save the original pointer */      env->free_string= env->in_string; /* Save the original pointer */
949      strcpy(env->in_string, env->head->item->content.ptr);      strcpy(env->in_string, CAR(env->head)->content.string);
950      toss(env); if(env->err) return;      env->head= CDR(env->head);
951    }    }
952        
953    inlength= strlen(env->in_string)+1;    inlength= strlen(env->in_string)+1;
954    match= malloc(inlength);    match= malloc(inlength);
955      assert(match != NULL);
956    
957    if(sscanf(env->in_string, blankform, &readlength) != EOF    if(sscanf(env->in_string, blankform, &readlength) != EOF
958       && readlength != -1) {       && readlength != -1) {
# Line 1624  extern void sx_72656164(environment *env Line 965  extern void sx_72656164(environment *env
965      } else {      } else {
966        push_float(env, ftemp);        push_float(env, ftemp);
967      }      }
968      } else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF
969                && readlength != -1) {
970        push_cstring(env, "");
971    } else if(sscanf(env->in_string, strform, match, &readlength) != EOF    } else if(sscanf(env->in_string, strform, match, &readlength) != EOF
972              && readlength != -1) {              && readlength != -1) {
973      push_cstring(env, match);      push_cstring(env, match);
# Line 1652  extern void sx_72656164(environment *env Line 996  extern void sx_72656164(environment *env
996    free(match);    free(match);
997    
998    if(depth)    if(depth)
999      return sx_72656164(env);      return readstream(env, env->inputstream);
 }  
   
 extern void beep(environment *env)  
 {  
   int freq, dur, period, ticks;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
   
   if(env->head->item->type!=integer  
      || env->head->next->item->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
   
   dur=env->head->item->content.i;  
   toss(env);  
   freq=env->head->item->content.i;  
   toss(env);  
   
   period=1193180/freq;          /* convert freq from Hz to period  
                                    length */  
   ticks=dur*.001193180;         /* convert duration from µseconds to  
                                    timer ticks */  
   
 /*    ticks=dur/1000; */  
   
   /*  if (ioctl(STDOUT_FILENO, KDMKTONE, (125<<16) + 0x637)==0) */  
   switch (ioctl(STDOUT_FILENO, KDMKTONE, (ticks<<16) | period)){  
   case 0:  
     usleep(dur);  
     return;  
   case -1:  
     perror("beep");  
     env->err=5;  
     return;  
   default:  
     abort();  
   }  
1000  }  }
1001    
 /* "wait" */  
 extern void sx_77616974(environment *env)  
 {  
   int dur;  
   
   if((env->head)==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
   
   if(env->head->item->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
1002    
1003    dur=env->head->item->content.i;  int check_args(environment *env, ...)
   toss(env);  
   
   usleep(dur);  
 }  
   
 extern void copying(environment *env)  
1004  {  {
1005    printf("GNU GENERAL PUBLIC LICENSE\n\    va_list ap;
1006                         Version 2, June 1991\n\    enum type_enum mytype;
 \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");  
 }  
   
 /* "*" */  
 extern void sx_2a(environment *env)  
 {  
   int a, b;  
   float fa, fb;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
     
   if(env->head->item->type==integer  
      && env->head->next->item->type==integer) {  
     a=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     b=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b*a);  
   
     return;  
   }  
   
   if(env->head->item->type==tfloat  
      && env->head->next->item->type==tfloat) {  
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb*fa);  
       
     return;  
   }  
   
   if(env->head->item->type==tfloat  
      && env->head->next->item->type==integer) {  
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     b= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b*fa);  
       
     return;  
   }  
   
   if(env->head->item->type==integer  
      && env->head->next->item->type==tfloat) {  
     a= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb*a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err=2;  
 }  
   
 /* "/" */  
 extern void sx_2f(environment *env)  
 {  
   int a, b;  
   float fa, fb;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
     
   if(env->head->item->type==integer  
      && env->head->next->item->type==integer) {  
     a=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     b=env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b/a);  
1007    
1008      return;    value *iter= env->head;
1009    }    int errval= 0;
1010    
1011    if(env->head->item->type==tfloat    va_start(ap, env);
1012       && env->head->next->item->type==tfloat) {    while(1) {
1013      fa= env->head->item->content.f;      mytype= va_arg(ap, enum type_enum);
1014      toss(env); if(env->err) return;      //    fprintf(stderr, "%s\n", env->errsymb);
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb/fa);  
       
     return;  
   }  
1015    
1016    if(env->head->item->type==tfloat      if(mytype==empty)
1017       && env->head->next->item->type==integer) {        break;
     fa= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     b= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b/fa);  
1018            
1019      return;      if(iter->type==empty || iter==NULL) {
1020    }        errval= 1;
1021          break;
1022    if(env->head->item->type==integer      }
      && env->head->next->item->type==tfloat) {  
     a= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     fb= env->head->item->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb/a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err=2;  
 }  
   
 /* "mod" */  
 extern void mod(environment *env)  
 {  
   int a, b;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   if(env->head->item->type==integer  
      && env->head->next->item->type==integer) {  
     a= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     b= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b%a);  
1023    
1024      return;      if(mytype==unknown) {
1025    }        iter=CDR(iter);
1026          continue;
1027        }
1028    
1029    printerr("Bad Argument Type");      if(CAR(iter)->type!=mytype) {
1030    env->err=2;        errval= 2;
1031  }        break;
1032        }
1033    
1034  /* "div" */      iter= CDR(iter);
 extern void sx_646976(environment *env)  
 {  
   int a, b;  
     
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
1035    }    }
1036    
1037    if(env->head->item->type==integer    va_end(ap);
      && env->head->next->item->type==integer) {  
     a= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     b= env->head->item->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, (int)b/a);  
   
     return;  
   }  
1038    
1039    printerr("Bad Argument Type");    env->err= errval;
1040    env->err= 2;    return errval;
1041  }  }
Legend:
Removed from v.1.95  
changed lines
  Added in v.1.135
root@recompile.se
 ViewVC Help
Powered by ViewVC 1.1.26