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

Diff of /stack/stack.c

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

revision 1.123 by masse, Wed Mar 27 19:53:01 2002 UTC revision 1.137 by masse, Thu Feb 19 15:35:38 2004 UTC
# Line 21  Line 21 
21               Teddy Hogeborn <teddy@fukt.bth.se>               Teddy Hogeborn <teddy@fukt.bth.se>
22  */  */
23    
24  #define CAR(X) ((X)->content.c->car)  #include "stack.h"
 #define CDR(X) ((X)->content.c->cdr)  
   
 /* 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>  
 /* assert */  
 #include <assert.h>  
25    
26  #ifdef __linux__  const char* start_message= "Stack version $Revision$\n\
27  /* mtrace, muntrace */  Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn\n\
28  #include <mcheck.h>  Stack comes with ABSOLUTELY NO WARRANTY; for details type 'warranty;'.\n\
29  /* ioctl */  This is free software, and you are welcome to redistribute it\n\
30  #include <sys/ioctl.h>  under certain conditions; type 'copying;' for details.";
 /* KDMKTONE */  
 #include <linux/kd.h>  
 #endif /* __linux__ */  
31    
 #include "stack.h"  
32    
33  /* Initialize a newly created environment */  /* Initialize a newly created environment */
34  void init_env(environment *env)  void init_env(environment *env)
# Line 71  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    if(env->head->type==empty) {    char *in_string;
56      printerr("Too Few Arguments");  
57      env->err= 1;    switch(env->err) {
58      case 0:
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      case 5:
70        return perror(env->errsymb);
71      default:
72        in_string= "Unknown error";
73        break;
74    }    }
75      
76    env->head= CDR(env->head); /* Remove the top stack item */    fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string);
77  }  }
78    
79    
80  /* Returns a pointer to a pointer to an element in the hash table. */  /* Returns a pointer to a pointer to an element in the hash table. */
81  symbol **hash(hashtbl in_hashtbl, const char *in_string)  symbol **hash(hashtbl in_hashtbl, const char *in_string)
82  {  {
# Line 117  symbol **hash(hashtbl in_hashtbl, const Line 106  symbol **hash(hashtbl in_hashtbl, const
106    }    }
107  }  }
108    
109    
110  /* Create new value */  /* Create new value */
111  value* new_val(environment *env)  value* new_val(environment *env)
112  {  {
# Line 141  value* new_val(environment *env) Line 131  value* new_val(environment *env)
131    return nval;    return nval;
132  }  }
133    
 /* Mark values recursively.  
    Marked values are not collected by the GC. */  
 inline void gc_mark(value *val)  
 {  
   if(val==NULL || val->gc.flag.mark)  
     return;  
   
   val->gc.flag.mark= 1;  
   
   if(val->type==tcons) {  
     gc_mark(CAR(val));  
     gc_mark(CDR(val));  
   }  
 }  
   
 inline void gc_maybe(environment *env)  
 {  
   if(env->gc_count < env->gc_limit)  
     return;  
   else  
     return gc_init(env);  
 }  
   
 /* Start GC */  
 extern void gc_init(environment *env)  
 {  
   stackitem *new_head= NULL, *titem;  
   symbol *tsymb;  
   int i;  
   
   if(env->interactive)  
     printf("Garbage collecting.");  
   
   /* Mark values on stack */  
   gc_mark(env->head);  
   
   if(env->interactive)  
     printf(".");  
   
   
   /* Mark values in hashtable */  
   for(i= 0; i<HASHTBLSIZE; i++)  
     for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next)  
       if (tsymb->val != NULL)  
         gc_mark(tsymb->val);  
   
   
   if(env->interactive)  
     printf(".");  
   
   env->gc_count= 0;  
   
   while(env->gc_ref!=NULL) {    /* Sweep unused values */  
   
     if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */  
   
       /* Remove content */  
       switch(env->gc_ref->item->type){  
       case string:  
         free(env->gc_ref->item->content.ptr);  
         break;  
       case tcons:  
         free(env->gc_ref->item->content.c);  
         break;  
       case empty:  
       case integer:  
       case tfloat:  
       case func:  
       case symb:  
         /* Symbol strings are freed when walking the hash table */  
       }  
   
       free(env->gc_ref->item);  /* Remove from gc_ref */  
       titem= env->gc_ref->next;  
       free(env->gc_ref);        /* Remove value */  
       env->gc_ref= titem;  
       continue;  
     }  
 #ifdef DEBUG  
     printf("Kept value (%p)", env->gc_ref->item);  
     if(env->gc_ref->item->gc.flag.mark)  
       printf(" (marked)");  
     if(env->gc_ref->item->gc.flag.protect)  
       printf(" (protected)");  
     switch(env->gc_ref->item->type){  
     case integer:  
       printf(" integer: %d", env->gc_ref->item->content.i);  
       break;  
     case func:  
       printf(" func: %p", env->gc_ref->item->content.ptr);  
       break;  
     case symb:  
       printf(" symb: %s", env->gc_ref->item->content.sym->id);  
       break;  
     case tcons:  
       printf(" tcons: %p\t%p", env->gc_ref->item->content.c->car,  
              env->gc_ref->item->content.c->cdr);  
       break;  
     default:  
       printf(" <unknown %d>", (env->gc_ref->item->type));  
     }  
     printf("\n");  
 #endif /* DEBUG */  
   
     /* Keep values */      
     env->gc_count += sizeof(value);  
     if(env->gc_ref->item->type==string)  
       env->gc_count += strlen(env->gc_ref->item->content.ptr)+1;  
       
     titem= env->gc_ref->next;  
     env->gc_ref->next= new_head;  
     new_head= env->gc_ref;  
     new_head->item->gc.flag.mark= 0;  
     env->gc_ref= titem;  
   }  
   
   if (env->gc_limit < env->gc_count*2)  
     env->gc_limit= env->gc_count*2;  
   
   env->gc_ref= new_head;  
   
   if(env->interactive)  
     printf("done (%d bytes still allocated)\n", env->gc_count);  
   
 }  
   
 /* Protect values from GC */  
 void protect(value *val)  
 {  
   if(val==NULL || val->gc.flag.protect)  
     return;  
   
   val->gc.flag.protect= 1;  
   
   if(val->type==tcons) {  
     protect(CAR(val));  
     protect(CDR(val));  
   }  
 }  
   
 /* Unprotect values from GC */  
 void unprotect(value *val)  
 {  
   if(val==NULL || !(val->gc.flag.protect))  
     return;  
   
   val->gc.flag.protect= 0;  
   
   if(val->type==tcons) {  
     unprotect(CAR(val));  
     unprotect(CDR(val));  
   }  
 }  
134    
135  /* Push a value onto the stack */  /* Push a value onto the stack */
136  void push_val(environment *env, value *val)  void push_val(environment *env, value *val)
# Line 309  void push_val(environment *env, value *v Line 146  void push_val(environment *env, value *v
146    env->head= new_value;    env->head= new_value;
147  }  }
148    
149    
150  /* Push an integer onto the stack */  /* Push an integer onto the stack */
151  void push_int(environment *env, int in_val)  void push_int(environment *env, int in_val)
152  {  {
# Line 320  void push_int(environment *env, int in_v Line 158  void push_int(environment *env, int in_v
158    push_val(env, new_value);    push_val(env, new_value);
159  }  }
160    
161    
162  /* Push a floating point number onto the stack */  /* Push a floating point number onto the stack */
163  void push_float(environment *env, float in_val)  void push_float(environment *env, float in_val)
164  {  {
# Line 331  void push_float(environment *env, float Line 170  void push_float(environment *env, float
170    push_val(env, new_value);    push_val(env, new_value);
171  }  }
172    
173    
174  /* Copy a string onto the stack. */  /* Copy a string onto the stack. */
175  void push_cstring(environment *env, const char *in_string)  void push_cstring(environment *env, const char *in_string)
176  {  {
177    value *new_value= new_val(env);    value *new_value= new_val(env);
178    int length= strlen(in_string)+1;    int length= strlen(in_string)+1;
179    
180    new_value->content.ptr= malloc(length);    new_value->content.string= malloc(length);
181    assert(new_value != NULL);    assert(new_value != NULL);
182    env->gc_count += length;    env->gc_count += length;
183    strcpy(new_value->content.ptr, in_string);    strcpy(new_value->content.string, in_string);
184    new_value->type= string;    new_value->type= string;
185    
186    push_val(env, new_value);    push_val(env, new_value);
187  }  }
188    
189    
190  /* Mangle a symbol name to a valid C identifier name */  /* Mangle a symbol name to a valid C identifier name */
191  char *mangle_str(const char *old_string)  char *mangle_str(const char *old_string)
192  {  {
# Line 356  char *mangle_str(const char *old_string) Line 197  char *mangle_str(const char *old_string)
197    assert(new_string != NULL);    assert(new_string != NULL);
198    strcpy(new_string, "sx_");    /* Stack eXternal */    strcpy(new_string, "sx_");    /* Stack eXternal */
199    current= new_string+3;    current= new_string+3;
200    
201    while(old_string[0] != '\0'){    while(old_string[0] != '\0'){
202      current[0]= validchars[(unsigned char)(old_string[0])/16];      current[0]= validchars[(unsigned char)(old_string[0])/16];
203      current[1]= validchars[(unsigned char)(old_string[0])%16];      current[1]= validchars[(unsigned char)(old_string[0])%16];
# Line 367  char *mangle_str(const char *old_string) Line 209  char *mangle_str(const char *old_string)
209    return new_string;            /* The caller must free() it */    return new_string;            /* The caller must free() it */
210  }  }
211    
 extern void mangle(environment *env)  
 {  
   char *new_string;  
   
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=string) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   new_string=  
     mangle_str((const char *)(CAR(env->head)->content.ptr));  
   
   toss(env);  
   if(env->err) return;  
   
   push_cstring(env, new_string);  
 }  
212    
213  /* Push a symbol onto the stack. */  /* Push a symbol onto the stack. */
214  void push_sym(environment *env, const char *in_string)  void push_sym(environment *env, const char *in_string)
# Line 408  void push_sym(environment *env, const ch Line 226  void push_sym(environment *env, const ch
226    char *mangled;                /* Mangled function name */    char *mangled;                /* Mangled function name */
227    
228    new_value= new_val(env);    new_value= new_val(env);
   protect(new_value);  
229    new_fvalue= new_val(env);    new_fvalue= new_val(env);
   protect(new_fvalue);  
230    
231    /* The new value is a symbol */    /* The new value is a symbol */
232    new_value->type= symb;    new_value->type= symb;
233    
234    /* Look up the symbol name in the hash table */    /* Look up the symbol name in the hash table */
235    new_symbol= hash(env->symbols, in_string);    new_symbol= hash(env->symbols, in_string);
236    new_value->content.ptr= *new_symbol;    new_value->content.sym= *new_symbol;
237    
238    if(*new_symbol==NULL) { /* If symbol was undefined */    if(*new_symbol==NULL) { /* If symbol was undefined */
239    
# Line 431  void push_sym(environment *env, const ch Line 247  void push_sym(environment *env, const ch
247      strcpy((*new_symbol)->id, in_string);      strcpy((*new_symbol)->id, in_string);
248    
249      /* Intern the new symbol in the hash table */      /* Intern the new symbol in the hash table */
250      new_value->content.ptr= *new_symbol;      new_value->content.sym= *new_symbol;
251    
252      /* 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
253         we should bind the symbol to a new function pointer value */         we should bind the symbol to a new function pointer value */
# Line 449  void push_sym(environment *env, const ch Line 265  void push_sym(environment *env, const ch
265    
266      if(dlerr==NULL) {           /* If a function was found */      if(dlerr==NULL) {           /* If a function was found */
267        new_fvalue->type= func;   /* The new value is a function pointer */        new_fvalue->type= func;   /* The new value is a function pointer */
268        new_fvalue->content.ptr= funcptr; /* Store function pointer */        new_fvalue->content.func= funcptr; /* Store function pointer */
269        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new
270                                           function value */                                           function value */
271      }      }
# Line 458  void push_sym(environment *env, const ch Line 274  void push_sym(environment *env, const ch
274    }    }
275    
276    push_val(env, new_value);    push_val(env, new_value);
   unprotect(new_value); unprotect(new_fvalue);  
 }  
   
 /* Print newline. */  
 extern void nl()  
 {  
   printf("\n");  
277  }  }
278    
 /* Gets the type of a value */  
 extern void type(environment *env)  
 {  
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   switch(CAR(env->head)->type){  
   case empty:  
     push_sym(env, "empty");  
     break;  
   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");  
     break;  
   case tcons:  
     push_sym(env, "pair");  
     break;  
   }  
   swap(env);  
   if (env->err) return;  
   toss(env);  
 }      
279    
280  /* Print a value */  /* Print a value */
281  void print_val(value *val, int noquote, stackitem *stack)  void print_val(environment *env, value *val, int noquote, stackitem *stack,
282                   FILE *stream)
283  {  {
284    stackitem *titem, *tstack;    stackitem *titem, *tstack;
285    int depth;    int depth;
286    
287    switch(val->type) {    switch(val->type) {
288    case empty:    case empty:
289      printf("[]");      if(fprintf(stream, "[]") < 0)
290          env->err= 5;
291        break;
292      case unknown:
293        if(fprintf(stream, "UNKNOWN") < 0)
294          env->err= 5;
295      break;      break;
296    case integer:    case integer:
297      printf("%d", val->content.i);      if(fprintf(stream, "%d", val->content.i) < 0)
298          env->err= 5;
299      break;      break;
300    case tfloat:    case tfloat:
301      printf("%f", val->content.f);      if(fprintf(stream, "%f", val->content.f) < 0)
302          env->err= 5;
303      break;      break;
304    case string:    case string:
305      if(noquote)      if(noquote){
306        printf("%s", (char*)(val->content.ptr));        if(fprintf(stream, "%s", val->content.string) < 0)
307      else          env->err= 5;
308        printf("\"%s\"", (char*)(val->content.ptr));      } else {                    /* quote */
309          if(fprintf(stream, "\"%s\"", val->content.string) < 0)
310            env->err= 5;
311        }
312      break;      break;
313    case symb:    case symb:
314      printf("%s", val->content.sym->id);      if(fprintf(stream, "%s", val->content.sym->id) < 0)
315          env->err= 5;
316      break;      break;
317    case func:    case func:
318      printf("#<function %p>", (funcp)(val->content.ptr));      if(fprintf(stream, "#<function %p>", val->content.func) < 0)
319          env->err= 5;
320        break;
321      case port:
322        if(fprintf(stream, "#<port %p>", val->content.p) < 0)
323          env->err= 5;
324      break;      break;
325    case tcons:    case tcons:
326      printf("[ ");      if(fprintf(stream, "[ ") < 0) {
327          env->err= 5;
328          return printerr(env);
329        }
330      tstack= stack;      tstack= stack;
331    
332      do {      do {
333        titem=malloc(sizeof(stackitem));        titem=malloc(sizeof(stackitem));
334        assert(titem != NULL);        assert(titem != NULL);
# Line 545  void print_val(value *val, int noquote, Line 339  void print_val(value *val, int noquote,
339           printing this value */           printing this value */
340        titem=tstack;        titem=tstack;
341        depth=0;        depth=0;
342    
343        while(titem != NULL && titem->item != CAR(val)){        while(titem != NULL && titem->item != CAR(val)){
344          titem=titem->next;          titem=titem->next;
345          depth++;          depth++;
346        }        }
347    
348        if(titem != NULL){        /* If we found it on the stack, */        if(titem != NULL){        /* If we found it on the stack, */
349          printf("#%d#", depth);  /* print a depth reference */          if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */
350              env->err= 5;
351              free(titem);
352              return printerr(env);
353            }
354        } else {        } else {
355          print_val(CAR(val), noquote, tstack);          print_val(env, CAR(val), noquote, tstack, stream);
356        }        }
357    
358        val= CDR(val);        val= CDR(val);
359        switch(val->type){        switch(val->type){
360        case empty:        case empty:
# Line 563  void print_val(value *val, int noquote, Line 364  void print_val(value *val, int noquote,
364             printing this value */             printing this value */
365          titem=tstack;          titem=tstack;
366          depth=0;          depth=0;
367    
368          while(titem != NULL && titem->item != val){          while(titem != NULL && titem->item != val){
369            titem=titem->next;            titem=titem->next;
370            depth++;            depth++;
371          }          }
372          if(titem != NULL){      /* If we found it on the stack, */          if(titem != NULL){      /* If we found it on the stack, */
373            printf(" . #%d#", depth); /* print a depth reference */            if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */
374                env->err= 5;
375                printerr(env);
376                goto printval_end;
377              }
378          } else {          } else {
379            printf(" ");            if(fprintf(stream, " ") < 0){
380                env->err= 5;
381                printerr(env);
382                goto printval_end;
383              }
384          }          }
385          break;          break;
386        default:        default:
387          printf(" . ");          /* Improper list */          if(fprintf(stream, " . ") < 0){ /* Improper list */
388          print_val(val, noquote, tstack);            env->err= 5;
389              printerr(env);
390              goto printval_end;
391            }
392            print_val(env, val, noquote, tstack, stream);
393        }        }
394      } while(val->type == tcons && titem == NULL);      } while(val->type == tcons && titem == NULL);
395    
396      printval_end:
397    
398      titem=tstack;      titem=tstack;
399      while(titem != stack){      while(titem != stack){
400        tstack=titem->next;        tstack=titem->next;
401        free(titem);        free(titem);
402        titem=tstack;        titem=tstack;
403      }      }
     printf(" ]");  
     break;  
   }  
 }  
   
 extern void print_(environment *env)  
 {  
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   print_val(CAR(env->head), 0, NULL);  
   nl();  
 }  
   
 /* Prints the top element of the stack and then discards it. */  
 extern void print(environment *env)  
 {  
   print_(env);  
   if(env->err) return;  
   toss(env);  
 }  
404    
405  extern void princ_(environment *env)      if(! (env->err)){
406  {        if(fprintf(stream, " ]") < 0){
407    if(env->head->type==empty) {          env->err= 5;
408      printerr("Too Few Arguments");        }
409      env->err= 1;      }
410      return;      break;
411    }    }
412    print_val(CAR(env->head), 1, NULL);    
413  }    if(env->err)
414        return printerr(env);
 /* Prints the top element of the stack and then discards it. */  
 extern void princ(environment *env)  
 {  
   princ_(env);  
   if(env->err) return;  
   toss(env);  
 }  
   
 /* Only to be called by function printstack. */  
 void print_st(value *stack_head, long counter)  
 {  
   if(CDR(stack_head)->type != empty)  
     print_st(CDR(stack_head), counter+1);  
   printf("%ld: ", counter);  
   print_val(CAR(stack_head), 0, NULL);  
   nl();  
415  }  }
416    
 /* Prints the stack. */  
 extern void printstack(environment *env)  
 {  
   if(env->head->type == empty) {  
     printf("Stack Empty\n");  
     return;  
   }  
   
   print_st(env->head, 1);  
 }  
417    
418  /* Swap the two top elements on the stack. */  /* Swap the two top elements on the stack. */
419  extern void swap(environment *env)  extern void swap(environment *env)
420  {  {
421    value *temp= env->head;    value *temp= env->head;
     
   if(env->head->type == empty || CDR(env->head)->type == empty) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
422    
423      if(check_args(env, 2, unknown, unknown))
424        return printerr(env);
425      
426    env->head= CDR(env->head);    env->head= CDR(env->head);
427    CDR(temp)= CDR(env->head);    CDR(temp)= CDR(env->head);
428    CDR(env->head)= temp;    CDR(env->head)= temp;
429  }  }
430    
 /* Rotate the first three elements on the stack. */  
 extern void rot(environment *env)  
 {  
   value *temp= env->head;  
     
   if(env->head->type == empty || CDR(env->head)->type == empty  
      || CDR(CDR(env->head))->type == empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   env->head= CDR(CDR(env->head));  
   CDR(CDR(temp))= CDR(env->head);  
   CDR(env->head)= temp;  
 }  
431    
432  /* Recall a value from a symbol, if bound */  /* Recall a value from a symbol, if bound */
433  extern void rcl(environment *env)  extern void rcl(environment *env)
434  {  {
435    value *val;    value *val;
436    
437    if(env->head->type==empty) {    if(check_args(env, 1, symb))
438      printerr("Too Few Arguments");      return printerr(env);
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=symb) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
439    
440    val= CAR(env->head)->content.sym->val;    val= CAR(env->head)->content.sym->val;
441    if(val == NULL){    if(val == NULL){
     printerr("Unbound Variable");  
442      env->err= 3;      env->err= 3;
443      return;      return printerr(env);
444    }    }
445    
446    push_val(env, val);           /* Return the symbol's bound value */    push_val(env, val);           /* Return the symbol's bound value */
447    swap(env);    swap(env);
448    if(env->err) return;    if(env->err) return;
449    toss(env);                    /* toss the symbol */    env->head= CDR(env->head);
   if(env->err) return;  
450  }  }
451    
452    
453  /* 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
454     function value, and if it is, toss the symbol and execute the     function value, and if it is, toss the symbol and execute the
455     function. */     function. */
# Line 723  extern void eval(environment *env) Line 463  extern void eval(environment *env)
463    
464    gc_maybe(env);    gc_maybe(env);
465    
466    if(env->head->type==empty) {    if(check_args(env, 1, unknown))
467      printerr("Too Few Arguments");      return printerr(env);
     env->err= 1;  
     return;  
   }  
468    
469    switch(CAR(env->head)->type) {    switch(CAR(env->head)->type) {
470      /* if it's a symbol */      /* if it's a symbol */
471    case symb:    case symb:
472        env->errsymb= CAR(env->head)->content.sym->id;
473      rcl(env);                   /* get its contents */      rcl(env);                   /* get its contents */
474      if(env->err) return;      if(env->err) return;
475      if(CAR(env->head)->type!=symb){ /* don't recurse symbols */      if(CAR(env->head)->type!=symb){ /* don't recurse symbols */
# Line 741  extern void eval(environment *env) Line 479  extern void eval(environment *env)
479    
480      /* If it's a lone function value, run it */      /* If it's a lone function value, run it */
481    case func:    case func:
482      in_func= (funcp)(CAR(env->head)->content.ptr);      in_func= CAR(env->head)->content.func;
483      toss(env);      env->head= CDR(env->head);
484      if(env->err) return;      return in_func((void*)env);
     return in_func(env);  
485    
486      /* If it's a list */      /* If it's a list */
487    case tcons:    case tcons:
488      temp_val= CAR(env->head);      temp_val= CAR(env->head);
489      protect(temp_val);      protect(temp_val);
490    
491      toss(env); if(env->err) return;      env->head= CDR(env->head);
492      iterator= temp_val;      iterator= temp_val;
493            
494      while(iterator->type != empty) {      while(iterator->type != empty) {
495        push_val(env, CAR(iterator));        push_val(env, CAR(iterator));
496                
497        if(CAR(env->head)->type==symb       if(CAR(env->head)->type==symb
498           && CAR(env->head)->content.sym->id[0]==';') {           && CAR(env->head)->content.sym->id[0]==';') {
499          toss(env);          env->head= CDR(env->head);
         if(env->err) return;  
500                    
501          if(CDR(iterator)->type == empty){          if(CDR(iterator)->type == empty){
502            goto eval_start;            goto eval_start;
# Line 771  extern void eval(environment *env) Line 507  extern void eval(environment *env)
507        if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons)        if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons)
508          iterator= CDR(iterator);          iterator= CDR(iterator);
509        else {        else {
510          printerr("Bad Argument Type"); /* Improper list */          env->err= 2; /* Improper list */
511          env->err= 2;          return printerr(env);
         return;  
512        }        }
513      }      }
514      unprotect(temp_val);      unprotect(temp_val);
515      return;      return;
516    
517    case empty:    case empty:
518        env->head= CDR(env->head);
519    case integer:    case integer:
520    case tfloat:    case tfloat:
521    case string:    case string:
522      case port:
523      case unknown:
524      return;      return;
525    }    }
526  }  }
527    
 /* Reverse (flip) a list */  
 extern void rev(environment *env)  
 {  
   value *old_head, *new_head, *item;  
   
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type==empty)  
     return;                     /* Don't reverse an empty list */  
   
   if(CAR(env->head)->type!=tcons) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   old_head= CAR(env->head);  
   new_head= new_val(env);  
   while(old_head->type != empty) {  
     item= old_head;  
     old_head= CDR(old_head);  
     CDR(item)= new_head;  
     new_head= item;  
   }  
   CAR(env->head)= new_head;  
 }  
   
 /* Make a list. */  
 extern void pack(environment *env)  
 {  
   value *iterator, *temp, *ending;  
   
   ending=new_val(env);  
   
   iterator= env->head;  
   if(iterator->type == empty  
      || (CAR(iterator)->type==symb  
      && CAR(iterator)->content.sym->id[0]=='[')) {  
     temp= ending;  
     toss(env);  
   } else {  
     /* Search for first delimiter */  
     while(CDR(iterator)->type != empty  
           && (CAR(CDR(iterator))->type!=symb  
            || CAR(CDR(iterator))->content.sym->id[0]!='['))  
       iterator= CDR(iterator);  
       
     /* Extract list */  
     temp= env->head;  
     env->head= CDR(iterator);  
     CDR(iterator)= ending;  
   
     if(env->head->type != empty)  
       toss(env);  
   }  
   
   /* Push list */  
   
   push_val(env, temp);  
   rev(env);  
 }  
   
 /* Relocate elements of the list on the stack. */  
 extern void expand(environment *env)  
 {  
   value *temp, *new_head;  
   
   /* Is top element a list? */  
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=tcons) {  
     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= CAR(env->head);  
   
   toss(env);  
   
   /* Find the end of the list */  
   while(CDR(temp)->type != empty) {  
     if (CDR(temp)->type == tcons)  
       temp= CDR(temp);  
     else {  
       printerr("Bad Argument Type"); /* Improper list */  
       env->err= 2;  
       return;  
     }  
   }  
   
   /* Connect the tail of the list with the old stack head */  
   CDR(temp)= env->head;  
   env->head= new_head;          /* ...and voila! */  
   
 }  
   
 /* Compares two elements by reference. */  
 extern void eq(environment *env)  
 {  
   void *left, *right;  
   
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   left= CAR(env->head)->content.ptr;  
   right= CAR(CDR(env->head))->content.ptr;  
   toss(env); toss(env);  
   
   push_int(env, left==right);  
 }  
   
 /* Negates the top element on the stack. */  
 extern void not(environment *env)  
 {  
   int val;  
   
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   val= CAR(env->head)->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);  
 }  
   
 /* Give a symbol some content. */  
 extern void def(environment *env)  
 {  
   symbol *sym;  
   
   /* Needs two values on the stack, the top one must be a symbol */  
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=symb) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   /* long names are a pain */  
   sym= CAR(env->head)->content.ptr;  
   
   /* Bind the symbol to the value */  
   sym->val= CAR(CDR(env->head));  
   
   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_maybe(env);  
   
   words(env);  
   
   if(env->free_string!=NULL)  
     free(env->free_string);  
     
 #ifdef __linux__  
   muntrace();  
 #endif  
   
   exit(EXIT_SUCCESS);  
 }  
   
 /* Clear stack */  
 extern void clear(environment *env)  
 {  
   while(env->head->type != empty)  
     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) {  
 #ifdef DEBUG  
       if (temp->val != NULL && temp->val->gc.flag.protect)  
         printf("(protected) ");  
 #endif /* DEBUG */  
       printf("%s\n", temp->id);  
       temp= temp->next;  
     }  
   }  
 }  
528    
529  /* Internal forget function */  /* Internal forget function */
530  void forget_sym(symbol **hash_entry)  void forget_sym(symbol **hash_entry)
# Line 1041  void forget_sym(symbol **hash_entry) Line 538  void forget_sym(symbol **hash_entry)
538    free(temp);    free(temp);
539  }  }
540    
 /* Forgets a symbol (remove it from the hash table) */  
 extern void forget(environment *env)  
 {  
   char* sym_id;  
   
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   if(CAR(env->head)->type!=symb) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   sym_id= CAR(env->head)->content.sym->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);  
 }  
541    
542  int main(int argc, char **argv)  int main(int argc, char **argv)
543  {  {
544    environment myenv;    environment myenv;
   
545    int c;                        /* getopt option character */    int c;                        /* getopt option character */
546    
547  #ifdef __linux__  #ifdef __linux__
# Line 1108  int main(int argc, char **argv) Line 576  int main(int argc, char **argv)
576      }      }
577    }    }
578    
579    if(myenv.interactive) {    if(myenv.interactive)
580      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");  
   }  
581    
582    while(1) {    while(1) {
583      if(myenv.in_string==NULL) {      if(myenv.in_string==NULL) {
584        if (myenv.interactive) {        if (myenv.interactive) {
585          if(myenv.err) {          if(myenv.err) {
586            printf("(error %d)\n", myenv.err);            printf("(error %d)\n", myenv.err);
587              myenv.err= 0;
588          }          }
589          nl();          printf("\n");
590          printstack(&myenv);          printstack(&myenv);
591          printf("> ");          printf("> ");
592        }        }
593        myenv.err=0;        myenv.err=0;
594      }      }
595      sx_72656164(&myenv);        /* "read" */      readstream(&myenv, myenv.inputstream);
596      if (myenv.err==4) {         /* EOF */      if (myenv.err) {            /* EOF or other error */
597        myenv.err=0;        myenv.err=0;
598        quit(&myenv);        quit(&myenv);
599      } else if(myenv.head->type!=empty      } else if(myenv.head->type!=empty
600                && CAR(myenv.head)->type==symb                && CAR(myenv.head)->type==symb
601                && CAR(myenv.head)->content.sym->id[0]                && CAR(myenv.head)->content.sym->id[0] == ';') {
602                ==';') {        if(myenv.head->type != empty)
603        toss(&myenv);             /* No error check in main */          myenv.head= CDR(myenv.head);
604        eval(&myenv);        eval(&myenv);
605        } else {
606          gc_maybe(&myenv);
607      }      }
     gc_maybe(&myenv);  
608    }    }
609    quit(&myenv);    quit(&myenv);
610    return EXIT_FAILURE;    return EXIT_FAILURE;
611  }  }
612    
 /* "+" */  
 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->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type==string  
      && CAR(CDR(env->head))->type==string) {  
     a_val= CAR(env->head);  
     b_val= CAR(CDR(env->head));  
     protect(a_val); protect(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);  
     assert(new_string != NULL);  
     strcpy(new_string, b_val->content.ptr);  
     strcat(new_string, a_val->content.ptr);  
     push_cstring(env, new_string);  
     unprotect(a_val); unprotect(b_val);  
     free(new_string);  
       
     return;  
   }  
     
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==integer) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b+a);  
   
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==tfloat) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb+fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==integer) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b+fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==tfloat) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->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->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
     
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==integer) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b-a);  
   
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==tfloat) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb-fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==integer) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b-fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==tfloat) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->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->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==integer) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b>a);  
   
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==tfloat) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     push_int(env, fb>fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==integer) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b>fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==tfloat) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->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);  
 }  
613    
614  /* Return copy of a value */  /* Return copy of a value */
615  value *copy_val(environment *env, value *old_value)  value *copy_val(environment *env, value *old_value)
# Line 1376  value *copy_val(environment *env, value Line 619  value *copy_val(environment *env, value
619    if(old_value==NULL)    if(old_value==NULL)
620      return NULL;      return NULL;
621    
   protect(old_value);  
622    new_value= new_val(env);    new_value= new_val(env);
623    new_value->type= old_value->type;    new_value->type= old_value->type;
624    
# Line 1386  value *copy_val(environment *env, value Line 628  value *copy_val(environment *env, value
628    case func:    case func:
629    case symb:    case symb:
630    case empty:    case empty:
631      case unknown:
632      case port:
633      new_value->content= old_value->content;      new_value->content= old_value->content;
634      break;      break;
635    case string:    case string:
636      (char *)(new_value->content.ptr)=      new_value->content.string= strdup(old_value->content.string);
       strdup((char *)(old_value->content.ptr));  
637      break;      break;
638    case tcons:    case tcons:
639    
# Line 1403  value *copy_val(environment *env, value Line 646  value *copy_val(environment *env, value
646      break;      break;
647    }    }
648    
   unprotect(old_value);  
   
649    return new_value;    return new_value;
650  }  }
651    
 /* "dup"; duplicates an item on the stack */  
 extern void sx_647570(environment *env)  
 {  
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   push_val(env, copy_val(env, CAR(env->head)));  
 }  
   
 /* "if", If-Then */  
 extern void sx_6966(environment *env)  
 {  
   int truth;  
   
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(CDR(env->head))->type != integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
     
   swap(env);  
   if(env->err) return;  
     
   truth= CAR(env->head)->content.i;  
652    
653    toss(env);  /* read a line from a stream; used by readline */
654    if(env->err) return;  void readlinestream(environment *env, FILE *stream)
   
   if(truth)  
     eval(env);  
   else  
     toss(env);  
 }  
   
 /* If-Then-Else */  
 extern void ifelse(environment *env)  
655  {  {
656    int truth;    char in_string[101];
   
   if(env->head->type==empty || CDR(env->head)->type==empty  
      || CDR(CDR(env->head))->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(CDR(CDR(env->head)))->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
     
   rot(env);  
   if(env->err) return;  
     
   truth= CAR(env->head)->content.i;  
   
   toss(env);  
   if(env->err) return;  
   
   if(!truth)  
     swap(env);  
   if(env->err) return;  
   
   toss(env);  
   if(env->err) return;  
   
   eval(env);  
 }  
   
 extern void sx_656c7365(environment *env)  
 {  
   if(env->head->type==empty || CDR(env->head)->type==empty  
      || CDR(CDR(env->head))->type==empty || CDR(CDR(CDR(env->head)))->type==empty  
      || CDR(CDR(CDR(CDR(env->head))))->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(CDR(env->head))->type!=symb  
      || strcmp(CAR(CDR(env->head))->content.sym->id, "then")!=0  
      || CAR(CDR(CDR(CDR(env->head))))->type!=symb  
      || strcmp(CAR(CDR(CDR(CDR(env->head))))->content.sym->id, "if")!=0) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   swap(env); toss(env); rot(env); toss(env);  
   ifelse(env);  
 }  
   
 extern void then(environment *env)  
 {  
   if(env->head->type==empty || CDR(env->head)->type==empty  
      || CDR(CDR(env->head))->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(CDR(env->head))->type!=symb  
      || strcmp(CAR(CDR(env->head))->content.sym->id, "if")!=0) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   swap(env); toss(env);  
   sx_6966(env);  
 }  
   
 /* "while" */  
 extern void sx_7768696c65(environment *env)  
 {  
   int truth;  
   value *loop, *test;  
   
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
657    
658    loop= CAR(env->head);    if(fgets(in_string, 100, stream)==NULL) {
659    protect(loop);      push_cstring(env, "");
660    toss(env); if(env->err) return;      if (! feof(stream)){
661          env->err= 5;
662    test= CAR(env->head);        return printerr(env);
   protect(test);  
   toss(env); if(env->err) return;  
   
   do {  
     push_val(env, test);  
     eval(env);  
       
     if(CAR(env->head)->type != integer) {  
       printerr("Bad Argument Type");  
       env->err= 2;  
       return;  
     }  
       
     truth= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
       
     if(truth) {  
       push_val(env, loop);  
       eval(env);  
     } else {  
       toss(env);  
663      }      }
664        } else {
665    } while(truth);      push_cstring(env, in_string);
666      }
   unprotect(loop); unprotect(test);  
667  }  }
668    
669    
670  /* "for"; for-loop */  /* Reverse (flip) a list */
671  extern void sx_666f72(environment *env)  extern void rev(environment *env)
672  {  {
673    value *loop;    value *old_head, *new_head, *item;
   int foo1, foo2;  
674    
675    if(env->head->type==empty || CDR(env->head)->type==empty    if(CAR(env->head)->type==empty)
676       || CDR(CDR(env->head))->type==empty) {      return;                     /* Don't reverse an empty list */
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
677    
678    if(CAR(CDR(env->head))->type!=integer    if(check_args(env, 1, tcons))
679       || CAR(CDR(CDR(env->head)))->type!=integer) {      return printerr(env);
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
680    
681    loop= CAR(env->head);    old_head= CAR(env->head);
682    protect(loop);    new_head= new_val(env);
683    toss(env); if(env->err) return;    while(old_head->type != empty) {
684        item= old_head;
685    foo2= CAR(env->head)->content.i;      old_head= CDR(old_head);
686    toss(env); if(env->err) return;      CDR(item)= new_head;
687        new_head= item;
   foo1= CAR(env->head)->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++;  
     }  
   } else {  
     while(foo1>=foo2) {  
       push_int(env, foo1);  
       push_val(env, loop);  
       eval(env); if(env->err) return;  
       foo1--;  
     }  
688    }    }
689    unprotect(loop);    CAR(env->head)= new_head;
690  }  }
691    
 /* Variant of for-loop */  
 extern void foreach(environment *env)  
 {    
   value *loop, *foo;  
   value *iterator;  
     
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(CDR(env->head))->type!=tcons) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
692    
693    loop= CAR(env->head);  /* Make a list. */
694    protect(loop);  extern void pack(environment *env)
   toss(env); if(env->err) return;  
   
   foo= CAR(env->head);  
   protect(foo);  
   toss(env); if(env->err) return;  
   
   iterator= foo;  
   
   while(iterator->type!=empty) {  
     push_val(env, CAR(iterator));  
     push_val(env, loop);  
     eval(env); if(env->err) return;  
     if (iterator->type == tcons){  
       iterator= CDR(iterator);  
     } else {  
       printerr("Bad Argument Type"); /* Improper list */  
       env->err= 2;  
       break;  
     }  
   }  
   unprotect(loop); unprotect(foo);  
 }  
   
 /* "to" */  
 extern void to(environment *env)  
695  {  {
696    int ending, start, i;    value *iterator, *temp, *ending;
   value *iterator, *temp, *end;  
   
   end= new_val(env);  
   
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=integer  
      || CAR(CDR(env->head))->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
697    
698    ending= CAR(env->head)->content.i;    ending=new_val(env);
   toss(env); if(env->err) return;  
   start= CAR(env->head)->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);  
   }  
699    
700    iterator= env->head;    iterator= env->head;
701      if(iterator->type == empty
   if(iterator->type==empty  
702       || (CAR(iterator)->type==symb       || (CAR(iterator)->type==symb
703           && CAR(iterator)->content.sym->id[0]=='[')) {       && CAR(iterator)->content.sym->id[0]=='[')) {
704      temp= end;      temp= ending;
705      toss(env);      if(env->head->type != empty)
706          env->head= CDR(env->head);
707    } else {    } else {
708      /* Search for first delimiter */      /* Search for first delimiter */
709      while(CDR(iterator)->type!=empty      while(CDR(iterator)->type != empty
710            && (CAR(CDR(iterator))->type!=symb            && (CAR(CDR(iterator))->type!=symb
711                || CAR(CDR(iterator))->content.sym->id[0]!='['))             || CAR(CDR(iterator))->content.sym->id[0]!='['))
712        iterator= CDR(iterator);        iterator= CDR(iterator);
713            
714      /* Extract list */      /* Extract list */
715      temp= env->head;      temp= env->head;
716      env->head= CDR(iterator);      env->head= CDR(iterator);
717      CDR(iterator)= end;      CDR(iterator)= ending;
718    
719      if(env->head->type!=empty)      if(env->head->type != empty)
720        toss(env);        env->head= CDR(env->head);
721    }    }
722    
723    /* Push list */    /* Push list */
724    
725    push_val(env, temp);    push_val(env, temp);
726      rev(env);
727  }  }
728    
 /* Read a string */  
 extern void readline(environment *env)  
 {  
   char in_string[101];  
729    
730    if(fgets(in_string, 100, env->inputstream)==NULL)  /* read from a stream; used by "read" and "readport" */
731      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)  
732  {  {
733    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";
734    const char strform[]= "\"%[^\"]\"%n";    const char strform[]= "\"%[^\"]\"%n";
# Line 1763  extern void sx_72656164(environment *env Line 750  extern void sx_72656164(environment *env
750      if(depth > 0 && env->interactive) {      if(depth > 0 && env->interactive) {
751        printf("]> ");        printf("]> ");
752      }      }
753      readline(env); if(env->err) return;      readlinestream(env, env->inputstream);
754        if(env->err) return;
755    
756      if(((char *)(CAR(env->head)->content.ptr))[0]=='\0'){      if((CAR(env->head)->content.string)[0]=='\0'){
757        env->err= 4;              /* "" means EOF */        env->err= 4;              /* "" means EOF */
758        return;        return;
759      }      }
760            
761      env->in_string= malloc(strlen(CAR(env->head)->content.ptr)+1);      env->in_string= malloc(strlen(CAR(env->head)->content.string)+1);
762      assert(env->in_string != NULL);      assert(env->in_string != NULL);
763      env->free_string= env->in_string; /* Save the original pointer */      env->free_string= env->in_string; /* Save the original pointer */
764      strcpy(env->in_string, CAR(env->head)->content.ptr);      strcpy(env->in_string, CAR(env->head)->content.string);
765      toss(env); if(env->err) return;      env->head= CDR(env->head);
766    }    }
767        
768    inlength= strlen(env->in_string)+1;    inlength= strlen(env->in_string)+1;
# Line 1823  extern void sx_72656164(environment *env Line 811  extern void sx_72656164(environment *env
811    free(match);    free(match);
812    
813    if(depth)    if(depth)
814      return sx_72656164(env);      return readstream(env, env->inputstream);
 }  
   
 #ifdef __linux__  
 extern void beep(environment *env)  
 {  
   int freq, dur, period, ticks;  
   
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=integer  
      || CAR(CDR(env->head))->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   dur= CAR(env->head)->content.i;  
   toss(env);  
   freq= CAR(env->head)->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();  
   }  
 }  
 #endif /* __linux__ */  
   
 /* "wait" */  
 extern void sx_77616974(environment *env)  
 {  
   int dur;  
   
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   dur= CAR(env->head)->content.i;  
   toss(env);  
   
   usleep(dur);  
 }  
   
 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");  
 }  
   
 /* "*" */  
 extern void sx_2a(environment *env)  
 {  
   int a, b;  
   float fa, fb;  
   
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==integer) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b*a);  
   
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==tfloat) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb*fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==integer) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b*fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==tfloat) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb*a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err= 2;  
815  }  }
816    
 /* "/" */  
 extern void sx_2f(environment *env)  
 {  
   int a, b;  
   float fa, fb;  
   
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==integer) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b/a);  
   
     return;  
   }  
817    
818    if(CAR(env->head)->type==tfloat  int check_args(environment *env, int num_args, ...)
      && CAR(CDR(env->head))->type==tfloat) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     push_float(env, fb/fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==tfloat  
      && CAR(CDR(env->head))->type==integer) {  
     fa= CAR(env->head)->content.f;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_float(env, b/fa);  
       
     return;  
   }  
   
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==tfloat) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     fb= CAR(env->head)->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)  
819  {  {
820    int a, b;    va_list ap;
821      enum type_enum mytype;
822    if(env->head->type==empty || CDR(env->head)->type==empty) {    int i;
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==integer) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, b%a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err= 2;  
 }  
   
 /* "div" */  
 extern void sx_646976(environment *env)  
 {  
   int a, b;  
     
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type==integer  
      && CAR(CDR(env->head))->type==integer) {  
     a= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     b= CAR(env->head)->content.i;  
     toss(env); if(env->err) return;  
     push_int(env, (int)b/a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err= 2;  
 }  
   
 extern void setcar(environment *env)  
 {  
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CDR(env->head)->type!=tcons) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   CAR(CAR(CDR(env->head)))=CAR(env->head);  
   toss(env);  
 }  
   
 extern void setcdr(environment *env)  
 {  
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CDR(env->head)->type!=tcons) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   CDR(CAR(CDR(env->head)))=CAR(env->head);  
   toss(env);  
 }  
   
 extern void car(environment *env)  
 {  
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=tcons) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   CAR(env->head)=CAR(CAR(env->head));  
 }  
   
 extern void cdr(environment *env)  
 {  
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=tcons) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   CAR(env->head)=CDR(CAR(env->head));  
 }  
   
 extern void cons(environment *env)  
 {  
   value *val;  
   
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   val=new_val(env);  
   val->content.c= malloc(sizeof(pair));  
   assert(val->content.c!=NULL);  
   
   env->gc_count += sizeof(pair);  
   val->type=tcons;  
   
   CAR(val)= CAR(CDR(env->head));  
   CDR(val)= CAR(env->head);  
   
   push_val(env, val);  
   
   swap(env); if(env->err) return;  
   toss(env); if(env->err) return;  
   swap(env); if(env->err) return;  
   toss(env); if(env->err) return;  
 }  
   
 /*  2: 3                        =>                */  
 /*  1: [ [ 1 . 2 ] [ 3 . 4 ] ]  =>  1: [ 3 . 4 ]  */  
 extern void assq(environment *env)  
 {  
   assocgen(env, eq);  
 }  
   
   
 /* General assoc function */  
 void assocgen(environment *env, funcp eqfunc)  
 {  
   value *key, *item;  
   
   /* Needs two values on the stack, the top one must be an association  
      list */  
   if(env->head->type==empty || CDR(env->head)->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(CAR(env->head)->type!=tcons) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
823    
824    key=CAR(CDR(env->head));    value *iter= env->head;
825    item=CAR(env->head);    int errval= 0;
826    
827    while(item->type == tcons){    va_start(ap, num_args);
828      if(CAR(item)->type != tcons){    for(i=1; i<=num_args; i++) {
829        printerr("Bad Argument Type");      mytype= va_arg(ap, enum type_enum);
830        env->err= 2;      //    fprintf(stderr, "%s\n", env->errsymb);
       return;  
     }  
     push_val(env, key);  
     push_val(env, CAR(CAR(item)));  
     eqfunc(env); if(env->err) return;  
   
     /* Check the result of 'eqfunc' */  
     if(env->head->type==empty) {  
       printerr("Too Few Arguments");  
       env->err= 1;  
     return;  
     }  
     if(CAR(env->head)->type!=integer) {  
       printerr("Bad Argument Type");  
       env->err= 2;  
       return;  
     }  
831    
832      if(CAR(env->head)->content.i){      if(iter->type==empty || iter==NULL) {
833        toss(env); if(env->err) return;        errval= 1;
834        break;        break;
835      }      }
     toss(env); if(env->err) return;  
836    
837      if(item->type!=tcons) {      if(mytype!=unknown && CAR(iter)->type!=mytype) {
838        printerr("Bad Argument Type");        errval= 2;
839        env->err= 2;        break;
       return;  
840      }      }
841    
842      item=CDR(item);      iter= CDR(iter);
843    }    }
844    
845    if(item->type == tcons){      /* A match was found */    va_end(ap);
     push_val(env, CAR(item));  
   } else {  
     push_int(env, 0);  
   }  
   swap(env); if(env->err) return;  
   toss(env); if(env->err) return;  
   swap(env); if(env->err) return;  
   toss(env);  
 }  
846    
847  extern void sx_646f(environment *env)    env->err= errval;
848  {    return errval;
   swap(env); if(env->err) return;  
   eval(env);  
849  }  }
Legend:
Removed from v.1.123  
changed lines
  Added in v.1.137
root@recompile.se
 ViewVC Help
Powered by ViewVC 1.1.26