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

Diff of /stack/stack.c

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

revision 1.101 by teddy, Sun Mar 10 13:00:01 2002 UTC revision 1.132 by masse, Fri Aug 8 14:20:49 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  {  {
# Line 52  void init_env(environment *env) Line 39  void init_env(environment *env)
39    env->gc_count= 0;    env->gc_count= 0;
40    env->gc_ref= NULL;    env->gc_ref= 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 62  void init_env(environment *env) Line 49  void init_env(environment *env)
49    env->interactive= 1;    env->interactive= 1;
50  }  }
51    
52    
53  void printerr(const char* in_string)  void printerr(const char* in_string)
54  {  {
55    fprintf(stderr, "Err: %s\n", in_string);    fprintf(stderr, "Err: %s\n", in_string);
56  }  }
57    
 /* Discard the top element of the stack. */  
 extern void toss(environment *env)  
 {  
   stackitem *temp= env->head;  
   
   if((env->head)==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   env->head= env->head->next;   /* Remove the top stack item */  
   free(temp);                   /* Free the old top stack item */  
 }  
58    
59  /* Returns a pointer to a pointer to an element in the hash table. */  /* Returns a pointer to a pointer to an element in the hash table. */
60  symbol **hash(hashtbl in_hashtbl, const char *in_string)  symbol **hash(hashtbl in_hashtbl, const char *in_string)
# Line 111  symbol **hash(hashtbl in_hashtbl, const Line 85  symbol **hash(hashtbl in_hashtbl, const
85    }    }
86  }  }
87    
88    
89  /* Create new value */  /* Create new value */
90  value* new_val(environment *env)  value* new_val(environment *env)
91  {  {
92    value *nval= malloc(sizeof(value));    value *nval= malloc(sizeof(value));
93    stackitem *nitem= malloc(sizeof(stackitem));    stackitem *nitem= malloc(sizeof(stackitem));
94    
95      assert(nval != NULL);
96      assert(nitem != NULL);
97    
98    nval->content.ptr= NULL;    nval->content.ptr= NULL;
99      nval->type= empty;
100    
101    nitem->item= nval;    nitem->item= nval;
102    nitem->next= env->gc_ref;    nitem->next= env->gc_ref;
103    
104    env->gc_ref= nitem;    env->gc_ref= nitem;
105    
106    env->gc_count += sizeof(value);    env->gc_count += sizeof(value);
# Line 130  value* new_val(environment *env) Line 110  value* new_val(environment *env)
110    return nval;    return nval;
111  }  }
112    
113    
114  /* Mark values recursively.  /* Mark values recursively.
115     Marked values are not collected by the GC. */     Marked values are not collected by the GC. */
116  inline void gc_mark(value *val)  inline void gc_mark(value *val)
117  {  {
118    stackitem *iterator;    if(val==NULL || val->gc.flag.mark)
   
   if(val->gc.flag.mark)  
119      return;      return;
120    
121    val->gc.flag.mark= 1;    val->gc.flag.mark= 1;
122    
123    if(val->type==list) {    if(val->type==tcons) {
124      iterator= val->content.ptr;      gc_mark(CAR(val));
125        gc_mark(CDR(val));
     while(iterator!=NULL) {  
       gc_mark(iterator->item);  
       iterator= iterator->next;  
     }  
126    }    }
127  }  }
128    
 inline void gc_maybe(environment *env)  
 {  
   if(env->gc_count < env->gc_limit)  
     return;  
   else  
     return gc_init(env);  
 }  
129    
130  /* Start GC */  /* Start GC */
131  extern void gc_init(environment *env)  extern void gc_init(environment *env)
132  {  {
133    stackitem *new_head= NULL, *titem, *iterator;    stackitem *new_head= NULL, *titem;
134    symbol *tsymb;    symbol *tsymb;
135    int i;    int i;
136    
137    if(env->interactive){    if(env->interactive)
138      printf("Garbage collecting.");      printf("Garbage collecting.");
   }  
139    
140    /* Mark values on stack */    /* Mark values on stack */
141    iterator= env->head;    gc_mark(env->head);
   while(iterator!=NULL) {  
     gc_mark(iterator->item);  
     iterator= iterator->next;  
   }  
142    
143    if(env->interactive){    if(env->interactive)
144      printf(".");      printf(".");
   }  
145    
146    /* Mark values in hashtable */    /* Mark values in hashtable */
147    for(i= 0; i<HASHTBLSIZE; i++) {    for(i= 0; i<HASHTBLSIZE; i++)
148      tsymb= env->symbols[i];      for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next)
     while(tsymb!=NULL) {  
149        if (tsymb->val != NULL)        if (tsymb->val != NULL)
150          gc_mark(tsymb->val);          gc_mark(tsymb->val);
       tsymb= tsymb->next;  
     }  
   }  
151    
152    if(env->interactive){    if(env->interactive)
153      printf(".");      printf(".");
   }  
154    
155    env->gc_count= 0;    env->gc_count= 0;
156    
157    while(env->gc_ref!=NULL) {    /* Sweep unused values */    while(env->gc_ref!=NULL) {    /* Sweep unused values */
   
158      if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */      if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */
159    
160        switch(env->gc_ref->item->type) { /* Remove content */        /* Remove content */
161          switch(env->gc_ref->item->type){
162        case string:        case string:
163          free(env->gc_ref->item->content.ptr);          free(env->gc_ref->item->content.string);
164            break;
165          case tcons:
166            free(env->gc_ref->item->content.c);
167            break;
168          case port:
169          case empty:
170          case integer:
171          case tfloat:
172          case func:
173          case symb:
174            /* Symbol strings are freed when walking the hash table */
175          break;          break;
       case list:  
         while(env->gc_ref->item->content.ptr!=NULL) {  
           titem= env->gc_ref->item->content.ptr;  
           env->gc_ref->item->content.ptr= titem->next;  
           free(titem);  
         }  
       default:  
176        }        }
177    
178        free(env->gc_ref->item);  /* Remove from gc_ref */        free(env->gc_ref->item);  /* Remove from gc_ref */
179        titem= env->gc_ref->next;        titem= env->gc_ref->next;
180        free(env->gc_ref);        /* Remove value */        free(env->gc_ref);        /* Remove value */
181        env->gc_ref= titem;        env->gc_ref= titem;
182        continue;        continue;
     } else {  
       env->gc_count += sizeof(value);  
       if(env->gc_ref->item->type == string)  
         env->gc_count += strlen(env->gc_ref->item->content.ptr);  
183      }      }
184    
185    #ifdef DEBUG
186        printf("Kept value (%p)", env->gc_ref->item);
187        if(env->gc_ref->item->gc.flag.mark)
188          printf(" (marked)");
189        if(env->gc_ref->item->gc.flag.protect)
190          printf(" (protected)");
191        switch(env->gc_ref->item->type){
192        case integer:
193          printf(" integer: %d", env->gc_ref->item->content.i);
194          break;
195        case func:
196          printf(" func: %p", env->gc_ref->item->content.func);
197          break;
198        case symb:
199          printf(" symb: %s", env->gc_ref->item->content.sym->id);
200          break;
201        case tcons:
202          printf(" tcons: %p\t%p", CAR(env->gc_ref->item),
203                 CDR(env->gc_ref->item));
204          break;
205        default:
206          printf(" <unknown %d>", (env->gc_ref->item->type));
207        }
208        printf("\n");
209    #endif /* DEBUG */
210    
211        /* Keep values */    
212        env->gc_count += sizeof(value);
213        if(env->gc_ref->item->type==string)
214          env->gc_count += strlen(env->gc_ref->item->content.string)+1;
215            
     /* Keep values */  
216      titem= env->gc_ref->next;      titem= env->gc_ref->next;
217      env->gc_ref->next= new_head;      env->gc_ref->next= new_head;
218      new_head= env->gc_ref;      new_head= env->gc_ref;
# Line 237  extern void gc_init(environment *env) Line 225  extern void gc_init(environment *env)
225    
226    env->gc_ref= new_head;    env->gc_ref= new_head;
227    
228    if(env->interactive){    if(env->interactive)
229      printf("done\n");      printf("done (%d bytes still allocated)\n", env->gc_count);
   }  
230    
231  }  }
232    
233    
234    inline void gc_maybe(environment *env)
235    {
236      if(env->gc_count < env->gc_limit)
237        return;
238      else
239        return gc_init(env);
240    }
241    
242    
243  /* Protect values from GC */  /* Protect values from GC */
244  void protect(value *val)  void protect(value *val)
245  {  {
246    stackitem *iterator;    if(val==NULL || val->gc.flag.protect)
   
   if(val->gc.flag.protect)  
247      return;      return;
248    
249    val->gc.flag.protect= 1;    val->gc.flag.protect= 1;
250    
251    if(val->type==list) {    if(val->type==tcons) {
252      iterator= val->content.ptr;      protect(CAR(val));
253        protect(CDR(val));
     while(iterator!=NULL) {  
       protect(iterator->item);  
       iterator= iterator->next;  
     }  
254    }    }
255  }  }
256    
257    
258  /* Unprotect values from GC */  /* Unprotect values from GC */
259  void unprotect(value *val)  void unprotect(value *val)
260  {  {
261    stackitem *iterator;    if(val==NULL || !(val->gc.flag.protect))
   
   if(!(val->gc.flag.protect))  
262      return;      return;
263    
264    val->gc.flag.protect= 0;    val->gc.flag.protect= 0;
265    
266    if(val->type==list) {    if(val->type==tcons) {
267      iterator= val->content.ptr;      unprotect(CAR(val));
268        unprotect(CDR(val));
     while(iterator!=NULL) {  
       unprotect(iterator->item);  
       iterator= iterator->next;  
     }  
269    }    }
270  }  }
271    
272    
273  /* Push a value onto the stack */  /* Push a value onto the stack */
274  void push_val(environment *env, value *val)  void push_val(environment *env, value *val)
275  {  {
276    stackitem *new_item= malloc(sizeof(stackitem));    value *new_value= new_val(env);
277    new_item->item= val;  
278    new_item->next= env->head;    new_value->content.c= malloc(sizeof(pair));
279    env->head= new_item;    assert(new_value->content.c!=NULL);
280      env->gc_count += sizeof(pair);
281      new_value->type= tcons;
282      CAR(new_value)= val;
283      CDR(new_value)= env->head;
284      env->head= new_value;
285  }  }
286    
287    
288  /* Push an integer onto the stack */  /* Push an integer onto the stack */
289  void push_int(environment *env, int in_val)  void push_int(environment *env, int in_val)
290  {  {
# Line 303  void push_int(environment *env, int in_v Line 296  void push_int(environment *env, int in_v
296    push_val(env, new_value);    push_val(env, new_value);
297  }  }
298    
299    
300  /* Push a floating point number onto the stack */  /* Push a floating point number onto the stack */
301  void push_float(environment *env, float in_val)  void push_float(environment *env, float in_val)
302  {  {
# Line 314  void push_float(environment *env, float Line 308  void push_float(environment *env, float
308    push_val(env, new_value);    push_val(env, new_value);
309  }  }
310    
311    
312  /* Copy a string onto the stack. */  /* Copy a string onto the stack. */
313  void push_cstring(environment *env, const char *in_string)  void push_cstring(environment *env, const char *in_string)
314  {  {
315    value *new_value= new_val(env);    value *new_value= new_val(env);
316    int length= strlen(in_string)+1;    int length= strlen(in_string)+1;
317    
318    new_value->content.ptr= malloc(length);    new_value->content.string= malloc(length);
319      assert(new_value != NULL);
320    env->gc_count += length;    env->gc_count += length;
321    strcpy(new_value->content.ptr, in_string);    strcpy(new_value->content.string, in_string);
322    new_value->type= string;    new_value->type= string;
323    
324    push_val(env, new_value);    push_val(env, new_value);
325  }  }
326    
327    
328  /* Mangle a symbol name to a valid C identifier name */  /* Mangle a symbol name to a valid C identifier name */
329  char *mangle_str(const char *old_string)  char *mangle_str(const char *old_string)
330  {  {
# Line 335  char *mangle_str(const char *old_string) Line 332  char *mangle_str(const char *old_string)
332    char *new_string, *current;    char *new_string, *current;
333    
334    new_string= malloc((strlen(old_string)*2)+4);    new_string= malloc((strlen(old_string)*2)+4);
335      assert(new_string != NULL);
336    strcpy(new_string, "sx_");    /* Stack eXternal */    strcpy(new_string, "sx_");    /* Stack eXternal */
337    current= new_string+3;    current= new_string+3;
338    
339    while(old_string[0] != '\0'){    while(old_string[0] != '\0'){
340      current[0]= validchars[(unsigned char)(old_string[0])/16];      current[0]= validchars[(unsigned char)(old_string[0])/16];
341      current[1]= validchars[(unsigned char)(old_string[0])%16];      current[1]= validchars[(unsigned char)(old_string[0])%16];
# Line 348  char *mangle_str(const char *old_string) Line 347  char *mangle_str(const char *old_string)
347    return new_string;            /* The caller must free() it */    return new_string;            /* The caller must free() it */
348  }  }
349    
 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);  
 }  
350    
351  /* Push a symbol onto the stack. */  /* Push a symbol onto the stack. */
352  void push_sym(environment *env, const char *in_string)  void push_sym(environment *env, const char *in_string)
# Line 397  void push_sym(environment *env, const ch Line 373  void push_sym(environment *env, const ch
373    
374    /* Look up the symbol name in the hash table */    /* Look up the symbol name in the hash table */
375    new_symbol= hash(env->symbols, in_string);    new_symbol= hash(env->symbols, in_string);
376    new_value->content.ptr= *new_symbol;    new_value->content.sym= *new_symbol;
377    
378    if(*new_symbol==NULL) { /* If symbol was undefined */    if(*new_symbol==NULL) { /* If symbol was undefined */
379    
380      /* Create a new symbol */      /* Create a new symbol */
381      (*new_symbol)= malloc(sizeof(symbol));      (*new_symbol)= malloc(sizeof(symbol));
382        assert((*new_symbol) != NULL);
383      (*new_symbol)->val= NULL;   /* undefined value */      (*new_symbol)->val= NULL;   /* undefined value */
384      (*new_symbol)->next= NULL;      (*new_symbol)->next= NULL;
385      (*new_symbol)->id= malloc(strlen(in_string)+1);      (*new_symbol)->id= malloc(strlen(in_string)+1);
386        assert((*new_symbol)->id != NULL);
387      strcpy((*new_symbol)->id, in_string);      strcpy((*new_symbol)->id, in_string);
388    
389      /* Intern the new symbol in the hash table */      /* Intern the new symbol in the hash table */
390      new_value->content.ptr= *new_symbol;      new_value->content.sym= *new_symbol;
391    
392      /* 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
393         we should bind the symbol to a new function pointer value */         we should bind the symbol to a new function pointer value */
# Line 427  void push_sym(environment *env, const ch Line 405  void push_sym(environment *env, const ch
405    
406      if(dlerr==NULL) {           /* If a function was found */      if(dlerr==NULL) {           /* If a function was found */
407        new_fvalue->type= func;   /* The new value is a function pointer */        new_fvalue->type= func;   /* The new value is a function pointer */
408        new_fvalue->content.ptr= funcptr; /* Store function pointer */        new_fvalue->content.func= funcptr; /* Store function pointer */
409        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new
410                                           function value */                                           function value */
411      }      }
# Line 439  void push_sym(environment *env, const ch Line 417  void push_sym(environment *env, const ch
417    unprotect(new_value); unprotect(new_fvalue);    unprotect(new_value); unprotect(new_fvalue);
418  }  }
419    
 /* Print newline. */  
 extern void nl()  
 {  
   printf("\n");  
 }  
   
 /* Gets the type of a value */  
 extern void type(environment *env)  
 {  
   int typenum;  
420    
421    if((env->head)==NULL) {  /* Print a value */
422      printerr("Too Few Arguments");  void print_val(environment *env, value *val, int noquote, stackitem *stack,
423      env->err=1;                 FILE *stream)
424      return;  {
425    }    stackitem *titem, *tstack;
426    typenum=env->head->item->type;    int depth;
427    toss(env);  
428    switch(typenum){    switch(val->type) {
429    case integer:    case empty:
430      push_sym(env, "integer");      if(fprintf(stream, "[]") < 0){
431      break;        perror("print_val");
432    case tfloat:        env->err= 5;
433      push_sym(env, "float");        return;
434      break;      }
   case string:  
     push_sym(env, "string");  
     break;  
   case symb:  
     push_sym(env, "symbol");  
     break;  
   case func:  
     push_sym(env, "function");  
     break;  
   case list:  
     push_sym(env, "list");  
435      break;      break;
   }  
 }      
   
 /* Prints the top element of the stack. */  
 void print_h(stackitem *stack_head, int noquote)  
 {  
   switch(stack_head->item->type) {  
436    case integer:    case integer:
437      printf("%d", stack_head->item->content.i);      if(fprintf(stream, "%d", val->content.i) < 0){
438          perror("print_val");
439          env->err= 5;
440          return;
441        }
442      break;      break;
443    case tfloat:    case tfloat:
444      printf("%f", stack_head->item->content.f);      if(fprintf(stream, "%f", val->content.f) < 0){
445          perror("print_val");
446          env->err= 5;
447          return;
448        }
449      break;      break;
450    case string:    case string:
451      if(noquote)      if(noquote){
452        printf("%s", (char*)stack_head->item->content.ptr);        if(fprintf(stream, "%s", val->content.string) < 0){
453      else          perror("print_val");
454        printf("\"%s\"", (char*)stack_head->item->content.ptr);          env->err= 5;
455            return;
456          }
457        } else {                    /* quote */
458          if(fprintf(stream, "\"%s\"", val->content.string) < 0){
459            perror("print_val");
460            env->err= 5;
461            return;
462          }
463        }
464      break;      break;
465    case symb:    case symb:
466      printf("%s", ((symbol *)(stack_head->item->content.ptr))->id);      if(fprintf(stream, "%s", val->content.sym->id) < 0){
467          perror("print_val");
468          env->err= 5;
469          return;
470        }
471      break;      break;
472    case func:    case func:
473      printf("#<function %p>", (funcp)(stack_head->item->content.ptr));      if(fprintf(stream, "#<function %p>", val->content.func) < 0){
474          perror("print_val");
475          env->err= 5;
476          return;
477        }
478      break;      break;
479    case list:    case port:
480      /* A list is just a stack, so make stack_head point to it */      if(fprintf(stream, "#<port %p>", val->content.p) < 0){
481      stack_head=(stackitem *)(stack_head->item->content.ptr);        perror("print_val");
482      printf("[ ");        env->err= 5;
483      while(stack_head != NULL) {        return;
       print_h(stack_head, noquote);  
       printf(" ");  
       stack_head=stack_head->next;  
484      }      }
     printf("]");  
485      break;      break;
486    }    case tcons:
487  }      if(fprintf(stream, "[ ") < 0){
488          perror("print_val");
489          env->err= 5;
490          return;
491        }
492        tstack= stack;
493    
494  extern void print_(environment *env)      do {
495  {        titem=malloc(sizeof(stackitem));
496    if(env->head==NULL) {        assert(titem != NULL);
497      printerr("Too Few Arguments");        titem->item=val;
498      env->err=1;        titem->next=tstack;
499      return;        tstack=titem;             /* Put it on the stack */
500    }        /* Search a stack of values being printed to see if we are already
501    print_h(env->head, 0);           printing this value */
502    nl();        titem=tstack;
503  }        depth=0;
504    
505          while(titem != NULL && titem->item != CAR(val)){
506            titem=titem->next;
507            depth++;
508          }
509    
510  /* Prints the top element of the stack and then discards it. */        if(titem != NULL){        /* If we found it on the stack, */
511  extern void print(environment *env)          if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */
512  {            perror("print_val");
513    print_(env);            env->err= 5;
514    if(env->err) return;            free(titem);
515    toss(env);            return;
516  }          }
517          } else {
518            print_val(env, CAR(val), noquote, tstack, stream);
519          }
520    
521  extern void princ_(environment *env)        val= CDR(val);
522  {        switch(val->type){
523    if(env->head==NULL) {        case empty:
524      printerr("Too Few Arguments");          break;
525      env->err=1;        case tcons:
526      return;          /* Search a stack of values being printed to see if we are already
527    }             printing this value */
528    print_h(env->head, 1);          titem=tstack;
529  }          depth=0;
530    
531            while(titem != NULL && titem->item != val){
532              titem=titem->next;
533              depth++;
534            }
535            if(titem != NULL){      /* If we found it on the stack, */
536              if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */
537                perror("print_val");
538                env->err= 5;
539                goto printval_end;
540              }
541            } else {
542              if(fprintf(stream, " ") < 0){
543                perror("print_val");
544                env->err= 5;
545                goto printval_end;
546              }
547            }
548            break;
549          default:
550            if(fprintf(stream, " . ") < 0){ /* Improper list */
551              perror("print_val");
552              env->err= 5;
553              goto printval_end;
554            }
555            print_val(env, val, noquote, tstack, stream);
556          }
557        } while(val->type == tcons && titem == NULL);
558    
559  /* 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);  
 }  
560    
561  /* Only to be called by function printstack. */      titem=tstack;
562  void print_st(stackitem *stack_head, long counter)      while(titem != stack){
563  {        tstack=titem->next;
564    if(stack_head->next != NULL)        free(titem);
565      print_st(stack_head->next, counter+1);        titem=tstack;
566    printf("%ld: ", counter);      }
   print_h(stack_head, 0);  
   nl();  
 }  
567    
568  /* Prints the stack. */      if(! (env->err)){
569  extern void printstack(environment *env)        if(fprintf(stream, " ]") < 0){
570  {          perror("print_val");
571    if(env->head == NULL) {          env->err= 5;
572      printf("Stack Empty\n");        }
573      return;      }
574        break;
575    }    }
   
   print_st(env->head, 1);  
576  }  }
577    
578    
579  /* Swap the two top elements on the stack. */  /* Swap the two top elements on the stack. */
580  extern void swap(environment *env)  extern void swap(environment *env)
581  {  {
582    stackitem *temp= env->head;    value *temp= env->head;
583        
584    if(env->head==NULL || env->head->next==NULL) {    if(env->head->type == empty || CDR(env->head)->type == empty) {
585      printerr("Too Few Arguments");      printerr("Too Few Arguments");
586      env->err=1;      env->err=1;
587      return;      return;
588    }    }
589    
590    env->head= env->head->next;    env->head= CDR(env->head);
591    temp->next= env->head->next;    CDR(temp)= CDR(env->head);
592    env->head->next= temp;    CDR(env->head)= temp;
593  }  }
594    
 /* Rotate the first three elements on the stack. */  
 extern void rot(environment *env)  
 {  
   stackitem *temp= env->head;  
     
   if(env->head==NULL || env->head->next==NULL  
       || env->head->next->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
   
   env->head= env->head->next->next;  
   temp->next->next= env->head->next;  
   env->head->next= temp;  
 }  
595    
596  /* Recall a value from a symbol, if bound */  /* Recall a value from a symbol, if bound */
597  extern void rcl(environment *env)  extern void rcl(environment *env)
598  {  {
599    value *val;    value *val;
600    
601    if(env->head == NULL) {    if(env->head->type==empty) {
602      printerr("Too Few Arguments");      printerr("Too Few Arguments");
603      env->err=1;      env->err= 1;
604      return;      return;
605    }    }
606    
607    if(env->head->item->type!=symb) {    if(CAR(env->head)->type!=symb) {
608      printerr("Bad Argument Type");      printerr("Bad Argument Type");
609      env->err=2;      env->err= 2;
610      return;      return;
611    }    }
612    
613    val=((symbol *)(env->head->item->content.ptr))->val;    val= CAR(env->head)->content.sym->val;
614    if(val == NULL){    if(val == NULL){
615      printerr("Unbound Variable");      printerr("Unbound Variable");
616      env->err=3;      env->err= 3;
617      return;      return;
618    }    }
619    protect(val);    push_val(env, val);           /* Return the symbol's bound value */
620    toss(env);            /* toss the symbol */    swap(env);
621    if(env->err) return;    if(env->err) return;
622    push_val(env, val); /* Return its bound value */    env->head= CDR(env->head);
   unprotect(val);  
623  }  }
624    
625    
626  /* 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
627     function value, and if it is, toss the symbol and execute the     function value, and if it is, toss the symbol and execute the
628     function. */     function. */
# Line 643  extern void eval(environment *env) Line 630  extern void eval(environment *env)
630  {  {
631    funcp in_func;    funcp in_func;
632    value* temp_val;    value* temp_val;
633    stackitem* iterator;    value* iterator;
634    
635   eval_start:   eval_start:
636    
637    gc_maybe(env);    gc_maybe(env);
638    
639    if(env->head==NULL) {    if(env->head->type==empty) {
640      printerr("Too Few Arguments");      printerr("Too Few Arguments");
641      env->err=1;      env->err= 1;
642      return;      return;
643    }    }
644    
645    switch(env->head->item->type) {    switch(CAR(env->head)->type) {
646      /* if it's a symbol */      /* if it's a symbol */
647    case symb:    case symb:
648      rcl(env);                   /* get its contents */      rcl(env);                   /* get its contents */
649      if(env->err) return;      if(env->err) return;
650      if(env->head->item->type!=symb){ /* don't recurse symbols */      if(CAR(env->head)->type!=symb){ /* don't recurse symbols */
651        goto eval_start;        goto eval_start;
652      }      }
653      return;      return;
654    
655      /* If it's a lone function value, run it */      /* If it's a lone function value, run it */
656    case func:    case func:
657      in_func= (funcp)(env->head->item->content.ptr);      in_func= CAR(env->head)->content.func;
658      toss(env);      env->head= CDR(env->head);
     if(env->err) return;  
659      return in_func(env);      return in_func(env);
660    
661      /* If it's a list */      /* If it's a list */
662    case list:    case tcons:
663      temp_val= env->head->item;      temp_val= CAR(env->head);
664      protect(temp_val);      protect(temp_val);
665    
666      toss(env); if(env->err) return;      env->head= CDR(env->head);
667      iterator= (stackitem*)temp_val->content.ptr;      iterator= temp_val;
668            
669      while(iterator!=NULL) {      while(iterator->type != empty) {
670        push_val(env, iterator->item);        push_val(env, CAR(iterator));
671                
672        if(env->head->item->type==symb       if(CAR(env->head)->type==symb
673           && (((symbol*)(env->head->item->content.ptr))->id[0] == ';')) {           && CAR(env->head)->content.sym->id[0]==';') {
674          toss(env);          env->head= CDR(env->head);
         if(env->err) return;  
675                    
676          if(iterator->next == NULL){          if(CDR(iterator)->type == empty){
677            goto eval_start;            goto eval_start;
678          }          }
679          eval(env);          eval(env);
680          if(env->err) return;          if(env->err) return;
681        }        }
682        iterator= iterator->next;        if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons)
683            iterator= CDR(iterator);
684          else {
685            printerr("Bad Argument Type"); /* Improper list */
686            env->err= 2;
687            return;
688          }
689      }      }
690      unprotect(temp_val);      unprotect(temp_val);
691      return;      return;
692    
693    default:    case empty:
694      return;      env->head= CDR(env->head);
695    }    case integer:
696  }    case tfloat:
697      case string:
698  /* Reverse (flip) a list */    case port:
 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(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(pack);  
 }  
   
 /* 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;  
     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);  
 }  
   
 /* 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==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->item->type!=symb) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
699      return;      return;
700    }    }
   
   /* 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_maybe(env);  
   
   if(env->free_string!=NULL)  
     free(env->free_string);  
     
   muntrace();  
   
   exit(EXIT_SUCCESS);  
701  }  }
702    
 /* 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;  
     }  
   }  
 }  
703    
704  /* Internal forget function */  /* Internal forget function */
705  void forget_sym(symbol **hash_entry)  void forget_sym(symbol **hash_entry)
# Line 949  void forget_sym(symbol **hash_entry) Line 713  void forget_sym(symbol **hash_entry)
713    free(temp);    free(temp);
714  }  }
715    
 /* 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);  
 }  
716    
717  int main(int argc, char **argv)  int main(int argc, char **argv)
718  {  {
719    environment myenv;    environment myenv;
   
720    int c;                        /* getopt option character */    int c;                        /* getopt option character */
721    
722    #ifdef __linux__
723    mtrace();    mtrace();
724    #endif
725    
726    init_env(&myenv);    init_env(&myenv);
727    
# Line 999  int main(int argc, char **argv) Line 735  int main(int argc, char **argv)
735          break;          break;
736        case '?':        case '?':
737          fprintf (stderr,          fprintf (stderr,
738                   "Unknown option character `\\x%x'.\n",                   "Unknown option character '\\x%x'.\n",
739                   optopt);                   optopt);
740          return EX_USAGE;          return EX_USAGE;
741        default:        default:
# Line 1015  int main(int argc, char **argv) Line 751  int main(int argc, char **argv)
751      }      }
752    }    }
753    
754    if(myenv.interactive) {    if(myenv.interactive)
755      printf("Stack version $Revision$\n\      printf(start_message);
 Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn\n\  
 Stack comes with ABSOLUTELY NO WARRANTY; for details type `warranty;'.\n\  
 This is free software, and you are welcome to redistribute it\n\  
 under certain conditions; type `copying;' for details.\n");  
   }  
756    
757    while(1) {    while(1) {
758      if(myenv.in_string==NULL) {      if(myenv.in_string==NULL) {
759        if (myenv.interactive) {        if (myenv.interactive) {
760          if(myenv.err) {          if(myenv.err) {
761            printf("(error %d)\n", myenv.err);            printf("(error %d)\n", myenv.err);
762              myenv.err= 0;
763          }          }
764          nl();          printf("\n");
765          printstack(&myenv);          printstack(&myenv);
766          printf("> ");          printf("> ");
767        }        }
768        myenv.err=0;        myenv.err=0;
769      }      }
770      sx_72656164(&myenv);      readstream(&myenv, myenv.inputstream);
771      if (myenv.err==4) {      if (myenv.err) {            /* EOF or other error */
772        return EXIT_SUCCESS;      /* EOF */        myenv.err=0;
773      } else if(myenv.head!=NULL        quit(&myenv);
774                && myenv.head->item->type==symb      } else if(myenv.head->type!=empty
775                && ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') {                && CAR(myenv.head)->type==symb
776        toss(&myenv);             /* No error check in main */                && CAR(myenv.head)->content.sym->id[0] == ';') {
777          if(myenv.head->type != empty)
778            myenv.head= CDR(myenv.head);
779        eval(&myenv);        eval(&myenv);
780        } else {
781          gc_maybe(&myenv);
782      }      }
     gc_maybe(&myenv);  
783    }    }
784    quit(&myenv);    quit(&myenv);
785    return EXIT_FAILURE;    return EXIT_FAILURE;
786  }  }
787    
 /* "+" */  
 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(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);  
     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(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);  
 }  
788    
789  /* Return copy of a value */  /* Return copy of a value */
790  value *copy_val(environment *env, value *old_value)  value *copy_val(environment *env, value *old_value)
791  {  {
   stackitem *old_item, *new_item, *prev_item;  
792    value *new_value;    value *new_value;
793    
794    protect(old_value);    if(old_value==NULL)
795        return NULL;
796    
797    new_value= new_val(env);    new_value= new_val(env);
   protect(new_value);  
798    new_value->type= old_value->type;    new_value->type= old_value->type;
799    
800    switch(old_value->type){    switch(old_value->type){
# Line 1288  value *copy_val(environment *env, value Line 802  value *copy_val(environment *env, value
802    case integer:    case integer:
803    case func:    case func:
804    case symb:    case symb:
805      case empty:
806      case port:
807      new_value->content= old_value->content;      new_value->content= old_value->content;
808      break;      break;
809    case string:    case string:
810      (char *)(new_value->content.ptr)=      new_value->content.string= strdup(old_value->content.string);
       strdup((char *)(old_value->content.ptr));  
811      break;      break;
812    case list:    case tcons:
     new_value->content.ptr= NULL;  
813    
814      prev_item= NULL;      new_value->content.c= malloc(sizeof(pair));
815      old_item= (stackitem*)(old_value->content.ptr);      assert(new_value->content.c!=NULL);
816        env->gc_count += sizeof(pair);
817    
818      while(old_item != NULL) {   /* While list is not empty */      CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */
819        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;  
     }      
820      break;      break;
821    }    }
822    
   unprotect(old_value); unprotect(new_value);  
   
823    return new_value;    return new_value;
824  }  }
825    
 /* "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;  
   
   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->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;  
826    
827    if(!truth)  /* read a line from a stream; used by readline */
828      swap(env);  void readlinestream(environment *env, FILE *stream)
   if(env->err) return;  
   
   toss(env);  
   if(env->err) return;  
   
   eval(env);  
 }  
   
 /* "while" */  
 extern void sx_7768696c65(environment *env)  
829  {  {
830    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;  
   }  
831    
832    loop= env->head->item;    if(fgets(in_string, 100, stream)==NULL) {
833    protect(loop);      push_cstring(env, "");
834    toss(env); if(env->err) return;      if (! feof(stream)){
835          perror("readline");
836    test= env->head->item;        env->err= 5;
   protect(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);  
837      }      }
838        } else {
839    } while(truth);      push_cstring(env, in_string);
840      }
   unprotect(loop); unprotect(test);  
841  }  }
842    
843    
844  /* "for"; for-loop */  /* Reverse (flip) a list */
845  extern void sx_666f72(environment *env)  extern void rev(environment *env)
846  {  {
847    value *loop;    value *old_head, *new_head, *item;
   int foo1, foo2;  
848    
849    if(env->head==NULL || env->head->next==NULL    if(env->head->type==empty) {
      || env->head->next->next==NULL) {  
850      printerr("Too Few Arguments");      printerr("Too Few Arguments");
851      env->err= 1;      env->err= 1;
852      return;      return;
853    }    }
854    
855    if(env->head->next->item->type!=integer    if(CAR(env->head)->type==empty)
856       || env->head->next->next->item->type!=integer) {      return;                     /* Don't reverse an empty list */
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
857    
858    loop= env->head->item;    if(CAR(env->head)->type!=tcons) {
   protect(loop);  
   toss(env); if(env->err) return;  
   
   foo2= env->head->item->content.i;  
   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++;  
     }  
   } else {  
     while(foo1>=foo2) {  
       push_int(env, foo1);  
       push_val(env, loop);  
       eval(env); if(env->err) return;  
       foo1--;  
     }  
   }  
   unprotect(loop);  
 }  
   
 /* 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) {  
859      printerr("Bad Argument Type");      printerr("Bad Argument Type");
860      env->err= 2;      env->err= 2;
861      return;      return;
862    }    }
863    
864    loop= env->head->item;    old_head= CAR(env->head);
865    protect(loop);    new_head= new_val(env);
866    toss(env); if(env->err) return;    while(old_head->type != empty) {
867        item= old_head;
868    foo= env->head->item;      old_head= CDR(old_head);
869    protect(foo);      CDR(item)= new_head;
870    toss(env); if(env->err) return;      new_head= item;
   
   iterator= foo->content.ptr;  
   
   while(iterator!=NULL) {  
     push_val(env, iterator->item);  
     push_val(env, loop);  
     eval(env); if(env->err) return;  
     iterator= iterator->next;  
871    }    }
872    unprotect(loop); unprotect(foo);    CAR(env->head)= new_head;
873  }  }
874    
 /* "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;  
   }  
875    
876    if(env->head->item->type!=integer  /* Make a list. */
877       || env->head->next->item->type!=integer) {  extern void pack(environment *env)
878      printerr("Bad Argument Type");  {
879      env->err=2;    value *iterator, *temp, *ending;
     return;  
   }  
880    
881    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);  
   }  
882    
883    iterator= env->head;    iterator= env->head;
884    pack= new_val(env);    if(iterator->type == empty
885    protect(pack);       || (CAR(iterator)->type==symb
886         && CAR(iterator)->content.sym->id[0]=='[')) {
887    if(iterator==NULL      temp= ending;
888       || (iterator->item->type==symb      if(env->head->type != empty)
889       && ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) {        env->head= CDR(env->head);
     temp= NULL;  
     toss(env);  
890    } else {    } else {
891      /* Search for first delimiter */      /* Search for first delimiter */
892      while(iterator->next!=NULL      while(CDR(iterator)->type != empty
893            && (iterator->next->item->type!=symb            && (CAR(CDR(iterator))->type!=symb
894            || ((symbol*)(iterator->next->item->content.ptr))->id[0]!='['))             || CAR(CDR(iterator))->content.sym->id[0]!='['))
895        iterator= iterator->next;        iterator= CDR(iterator);
896            
897      /* Extract list */      /* Extract list */
898      temp= env->head;      temp= env->head;
899      env->head= iterator->next;      env->head= CDR(iterator);
900      iterator->next= NULL;      CDR(iterator)= ending;
901    
902      pack->type= list;      if(env->head->type != empty)
903      pack->content.ptr= temp;        env->head= CDR(env->head);
       
     if(env->head!=NULL)  
       toss(env);  
904    }    }
905    
906    /* Push list */    /* Push list */
907    
908    push_val(env, pack);    push_val(env, temp);
909      rev(env);
   unprotect(pack);  
910  }  }
911    
 /* Read a string */  
 extern void readline(environment *env)  
 {  
   char in_string[101];  
   
   if(fgets(in_string, 100, env->inputstream)==NULL)  
     push_cstring(env, "");  
   else  
     push_cstring(env, in_string);  
 }  
912    
913  /* "read"; Read a value and place on stack */  /* read from a stream; used by "read" and "readport" */
914  extern void sx_72656164(environment *env)  void readstream(environment *env, FILE *stream)
915  {  {
916    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";
917    const char strform[]= "\"%[^\"]\"%n";    const char strform[]= "\"%[^\"]\"%n";
# Line 1626  extern void sx_72656164(environment *env Line 926  extern void sx_72656164(environment *env
926    int count= -1;    int count= -1;
927    float ftemp;    float ftemp;
928    static int depth= 0;    static int depth= 0;
929    char *match, *ctemp;    char *match;
930    size_t inlength;    size_t inlength;
931    
932    if(env->in_string==NULL) {    if(env->in_string==NULL) {
933      if(depth > 0 && env->interactive) {      if(depth > 0 && env->interactive) {
934        printf("]> ");        printf("]> ");
935      }      }
936      readline(env); if(env->err) return;      readlinestream(env, env->inputstream);
937        if(env->err) return;
938    
939      if(((char *)(env->head->item->content.ptr))[0]=='\0'){      if((CAR(env->head)->content.string)[0]=='\0'){
940        env->err= 4;              /* "" means EOF */        env->err= 4;              /* "" means EOF */
941        return;        return;
942      }      }
943            
944      env->in_string= malloc(strlen(env->head->item->content.ptr)+1);      env->in_string= malloc(strlen(CAR(env->head)->content.string)+1);
945        assert(env->in_string != NULL);
946      env->free_string= env->in_string; /* Save the original pointer */      env->free_string= env->in_string; /* Save the original pointer */
947      strcpy(env->in_string, env->head->item->content.ptr);      strcpy(env->in_string, CAR(env->head)->content.string);
948      toss(env); if(env->err) return;      env->head= CDR(env->head);
949    }    }
950        
951    inlength= strlen(env->in_string)+1;    inlength= strlen(env->in_string)+1;
952    match= malloc(inlength);    match= malloc(inlength);
953      assert(match != NULL);
954    
955    if(sscanf(env->in_string, blankform, &readlength) != EOF    if(sscanf(env->in_string, blankform, &readlength) != EOF
956       && readlength != -1) {       && readlength != -1) {
# Line 1660  extern void sx_72656164(environment *env Line 963  extern void sx_72656164(environment *env
963      } else {      } else {
964        push_float(env, ftemp);        push_float(env, ftemp);
965      }      }
966      } else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF
967                && readlength != -1) {
968        push_cstring(env, "");
969    } else if(sscanf(env->in_string, strform, match, &readlength) != EOF    } else if(sscanf(env->in_string, strform, match, &readlength) != EOF
970              && readlength != -1) {              && readlength != -1) {
971      push_cstring(env, match);      push_cstring(env, match);
# Line 1688  extern void sx_72656164(environment *env Line 994  extern void sx_72656164(environment *env
994    free(match);    free(match);
995    
996    if(depth)    if(depth)
997      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();  
   }  
 }  
   
 /* "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;  
   }  
   
   dur=env->head->item->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)==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);  
   
     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;  
 }  
   
 /* "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);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err=2;  
 }  
   
 /* "div" */  
 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;  
   }  
   
   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, (int)b/a);  
   
     return;  
   }  
   
   printerr("Bad Argument Type");  
   env->err= 2;  
998  }  }
Legend:
Removed from v.1.101  
changed lines
  Added in v.1.132
root@recompile.se
 ViewVC Help
Powered by ViewVC 1.1.26