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

Diff of /stack/stack.c

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

revision 1.128 by masse, Mon Aug 4 13:50:53 2003 UTC revision 1.133 by masse, Mon Aug 11 14:31:48 2003 UTC
# Line 23  Line 23 
23    
24  #include "stack.h"  #include "stack.h"
25    
26    const char* start_message= "Stack version $Revision$\n\
27    Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn\n\
28    Stack comes with ABSOLUTELY NO WARRANTY; for details type 'warranty;'.\n\
29    This is free software, and you are welcome to redistribute it\n\
30    under certain conditions; type 'copying;' for details.\n";
31    
32    
33  /* Initialize a newly created environment */  /* Initialize a newly created environment */
34  void init_env(environment *env)  void init_env(environment *env)
35  {  {
# Line 42  void init_env(environment *env) Line 49  void init_env(environment *env)
49    env->interactive= 1;    env->interactive= 1;
50  }  }
51    
52  void printerr(const char* in_string)  
53    void printerr(environment *env, const char* in_string)
54  {  {
55    fprintf(stderr, "Err: %s\n", in_string);    fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string);
56  }  }
57    
58    
59  /* Returns a pointer to a pointer to an element in the hash table. */  /* Returns a pointer to a pointer to an element in the hash table. */
60  symbol **hash(hashtbl in_hashtbl, const char *in_string)  symbol **hash(hashtbl in_hashtbl, const char *in_string)
61  {  {
# Line 76  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  {  {
# Line 133  extern void gc_init(environment *env) Line 143  extern void gc_init(environment *env)
143    if(env->interactive)    if(env->interactive)
144      printf(".");      printf(".");
145    
   
146    /* Mark values in hashtable */    /* Mark values in hashtable */
147    for(i= 0; i<HASHTBLSIZE; i++)    for(i= 0; i<HASHTBLSIZE; i++)
148      for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next)      for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next)
149        if (tsymb->val != NULL)        if (tsymb->val != NULL)
150          gc_mark(tsymb->val);          gc_mark(tsymb->val);
151    
   
152    if(env->interactive)    if(env->interactive)
153      printf(".");      printf(".");
154    
155    env->gc_count= 0;    env->gc_count= 0;
156    
157    while(env->gc_ref!=NULL) {    /* Sweep unused values */    while(env->gc_ref!=NULL) {    /* Sweep unused values */
   
158      if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */      if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */
159    
160        /* Remove content */        /* Remove content */
161        switch(env->gc_ref->item->type){        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;          break;
165        case tcons:        case tcons:
166          free(env->gc_ref->item->content.c);          free(env->gc_ref->item->content.c);
167          break;          break;
168        case port:        case port:
169        case empty:        case empty:
170          case unknown:
171        case integer:        case integer:
172        case tfloat:        case tfloat:
173        case func:        case func:
# Line 174  extern void gc_init(environment *env) Line 182  extern void gc_init(environment *env)
182        env->gc_ref= titem;        env->gc_ref= titem;
183        continue;        continue;
184      }      }
185    
186  #ifdef DEBUG  #ifdef DEBUG
187      printf("Kept value (%p)", env->gc_ref->item);      printf("Kept value (%p)", env->gc_ref->item);
188      if(env->gc_ref->item->gc.flag.mark)      if(env->gc_ref->item->gc.flag.mark)
# Line 222  extern void gc_init(environment *env) Line 231  extern void gc_init(environment *env)
231    
232  }  }
233    
234    
235  inline void gc_maybe(environment *env)  inline void gc_maybe(environment *env)
236  {  {
237    if(env->gc_count < env->gc_limit)    if(env->gc_count < env->gc_limit)
# Line 230  inline void gc_maybe(environment *env) Line 240  inline void gc_maybe(environment *env)
240      return gc_init(env);      return gc_init(env);
241  }  }
242    
243    
244  /* Protect values from GC */  /* Protect values from GC */
245  void protect(value *val)  void protect(value *val)
246  {  {
# Line 244  void protect(value *val) Line 255  void protect(value *val)
255    }    }
256  }  }
257    
258    
259  /* Unprotect values from GC */  /* Unprotect values from GC */
260  void unprotect(value *val)  void unprotect(value *val)
261  {  {
# Line 258  void unprotect(value *val) Line 270  void unprotect(value *val)
270    }    }
271  }  }
272    
273    
274  /* Push a value onto the stack */  /* Push a value onto the stack */
275  void push_val(environment *env, value *val)  void push_val(environment *env, value *val)
276  {  {
# Line 272  void push_val(environment *env, value *v Line 285  void push_val(environment *env, value *v
285    env->head= new_value;    env->head= new_value;
286  }  }
287    
288    
289  /* Push an integer onto the stack */  /* Push an integer onto the stack */
290  void push_int(environment *env, int in_val)  void push_int(environment *env, int in_val)
291  {  {
# Line 283  void push_int(environment *env, int in_v Line 297  void push_int(environment *env, int in_v
297    push_val(env, new_value);    push_val(env, new_value);
298  }  }
299    
300    
301  /* Push a floating point number onto the stack */  /* Push a floating point number onto the stack */
302  void push_float(environment *env, float in_val)  void push_float(environment *env, float in_val)
303  {  {
# Line 294  void push_float(environment *env, float Line 309  void push_float(environment *env, float
309    push_val(env, new_value);    push_val(env, new_value);
310  }  }
311    
312    
313  /* Copy a string onto the stack. */  /* Copy a string onto the stack. */
314  void push_cstring(environment *env, const char *in_string)  void push_cstring(environment *env, const char *in_string)
315  {  {
# Line 309  void push_cstring(environment *env, cons Line 325  void push_cstring(environment *env, cons
325    push_val(env, new_value);    push_val(env, new_value);
326  }  }
327    
328    
329  /* Mangle a symbol name to a valid C identifier name */  /* Mangle a symbol name to a valid C identifier name */
330  char *mangle_str(const char *old_string)  char *mangle_str(const char *old_string)
331  {  {
# Line 319  char *mangle_str(const char *old_string) Line 336  char *mangle_str(const char *old_string)
336    assert(new_string != NULL);    assert(new_string != NULL);
337    strcpy(new_string, "sx_");    /* Stack eXternal */    strcpy(new_string, "sx_");    /* Stack eXternal */
338    current= new_string+3;    current= new_string+3;
339    
340    while(old_string[0] != '\0'){    while(old_string[0] != '\0'){
341      current[0]= validchars[(unsigned char)(old_string[0])/16];      current[0]= validchars[(unsigned char)(old_string[0])/16];
342      current[1]= validchars[(unsigned char)(old_string[0])%16];      current[1]= validchars[(unsigned char)(old_string[0])%16];
# Line 330  char *mangle_str(const char *old_string) Line 348  char *mangle_str(const char *old_string)
348    return new_string;            /* The caller must free() it */    return new_string;            /* The caller must free() it */
349  }  }
350    
 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(CAR(env->head)->content.string);  
   
   toss(env);  
   if(env->err) return;  
   
   push_cstring(env, new_string);  
 }  
351    
352  /* Push a symbol onto the stack. */  /* Push a symbol onto the stack. */
353  void push_sym(environment *env, const char *in_string)  void push_sym(environment *env, const char *in_string)
# Line 370  void push_sym(environment *env, const ch Line 365  void push_sym(environment *env, const ch
365    char *mangled;                /* Mangled function name */    char *mangled;                /* Mangled function name */
366    
367    new_value= new_val(env);    new_value= new_val(env);
   protect(new_value);  
368    new_fvalue= new_val(env);    new_fvalue= new_val(env);
   protect(new_fvalue);  
369    
370    /* The new value is a symbol */    /* The new value is a symbol */
371    new_value->type= symb;    new_value->type= symb;
372    
373    /* Look up the symbol name in the hash table */    /* Look up the symbol name in the hash table */
374    new_symbol= hash(env->symbols, in_string);    new_symbol= hash(env->symbols, in_string);
375    new_value->content.ptr= *new_symbol;    new_value->content.sym= *new_symbol;
376    
377    if(*new_symbol==NULL) { /* If symbol was undefined */    if(*new_symbol==NULL) { /* If symbol was undefined */
378    
# Line 393  void push_sym(environment *env, const ch Line 386  void push_sym(environment *env, const ch
386      strcpy((*new_symbol)->id, in_string);      strcpy((*new_symbol)->id, in_string);
387    
388      /* Intern the new symbol in the hash table */      /* Intern the new symbol in the hash table */
389      new_value->content.ptr= *new_symbol;      new_value->content.sym= *new_symbol;
390    
391      /* 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
392         we should bind the symbol to a new function pointer value */         we should bind the symbol to a new function pointer value */
# Line 420  void push_sym(environment *env, const ch Line 413  void push_sym(environment *env, const ch
413    }    }
414    
415    push_val(env, new_value);    push_val(env, new_value);
   unprotect(new_value); unprotect(new_fvalue);  
416  }  }
417    
418    
419  /* Print a value */  /* Print a value */
420  void print_val(environment *env, value *val, int noquote, stackitem *stack, FILE *stream)  void print_val(environment *env, value *val, int noquote, stackitem *stack,
421                   FILE *stream)
422  {  {
423    stackitem *titem, *tstack;    stackitem *titem, *tstack;
424    int depth;    int depth;
# Line 437  void print_val(environment *env, value * Line 431  void print_val(environment *env, value *
431        return;        return;
432      }      }
433      break;      break;
434      case unknown:
435        if(fprintf(stream, "UNKNOWN") < 0){
436          perror("print_val");
437          env->err= 5;
438          return;
439        }
440        break;
441    case integer:    case integer:
442      if(fprintf(stream, "%d", val->content.i) < 0){      if(fprintf(stream, "%d", val->content.i) < 0){
443        perror("print_val");        perror("print_val");
# Line 494  void print_val(environment *env, value * Line 495  void print_val(environment *env, value *
495        return;        return;
496      }      }
497      tstack= stack;      tstack= stack;
498    
499      do {      do {
500        titem=malloc(sizeof(stackitem));        titem=malloc(sizeof(stackitem));
501        assert(titem != NULL);        assert(titem != NULL);
# Line 504  void print_val(environment *env, value * Line 506  void print_val(environment *env, value *
506           printing this value */           printing this value */
507        titem=tstack;        titem=tstack;
508        depth=0;        depth=0;
509    
510        while(titem != NULL && titem->item != CAR(val)){        while(titem != NULL && titem->item != CAR(val)){
511          titem=titem->next;          titem=titem->next;
512          depth++;          depth++;
513        }        }
514    
515        if(titem != NULL){        /* If we found it on the stack, */        if(titem != NULL){        /* If we found it on the stack, */
516          if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */          if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */
517            perror("print_val");            perror("print_val");
# Line 518  void print_val(environment *env, value * Line 522  void print_val(environment *env, value *
522        } else {        } else {
523          print_val(env, CAR(val), noquote, tstack, stream);          print_val(env, CAR(val), noquote, tstack, stream);
524        }        }
525    
526        val= CDR(val);        val= CDR(val);
527        switch(val->type){        switch(val->type){
528        case empty:        case empty:
# Line 527  void print_val(environment *env, value * Line 532  void print_val(environment *env, value *
532             printing this value */             printing this value */
533          titem=tstack;          titem=tstack;
534          depth=0;          depth=0;
535    
536          while(titem != NULL && titem->item != val){          while(titem != NULL && titem->item != val){
537            titem=titem->next;            titem=titem->next;
538            depth++;            depth++;
# Line 574  void print_val(environment *env, value * Line 580  void print_val(environment *env, value *
580    }    }
581  }  }
582    
583    
584  /* Swap the two top elements on the stack. */  /* Swap the two top elements on the stack. */
585  extern void swap(environment *env)  extern void swap(environment *env)
586  {  {
587    value *temp= env->head;    value *temp= env->head;
588        
589    if(env->head->type == empty || CDR(env->head)->type == empty) {    if(env->head->type == empty || CDR(env->head)->type == empty) {
590      printerr("Too Few Arguments");      printerr(env, "Too Few Arguments");
591      env->err=1;      env->err=1;
592      return;      return;
593    }    }
# Line 590  extern void swap(environment *env) Line 597  extern void swap(environment *env)
597    CDR(env->head)= temp;    CDR(env->head)= temp;
598  }  }
599    
600    
601  /* Recall a value from a symbol, if bound */  /* Recall a value from a symbol, if bound */
602  extern void rcl(environment *env)  extern void rcl(environment *env)
603  {  {
604    value *val;    value *val;
605    
606    if(env->head->type==empty) {    if(env->head->type==empty) {
607      printerr("Too Few Arguments");      printerr(env, "Too Few Arguments");
608      env->err= 1;      env->err= 1;
609      return;      return;
610    }    }
611    
612    if(CAR(env->head)->type!=symb) {    if(CAR(env->head)->type!=symb) {
613      printerr("Bad Argument Type");      printerr(env, "Bad Argument Type");
614      env->err= 2;      env->err= 2;
615      return;      return;
616    }    }
617    
618    val= CAR(env->head)->content.sym->val;    val= CAR(env->head)->content.sym->val;
619    if(val == NULL){    if(val == NULL){
620      printerr("Unbound Variable");      printerr(env, "Unbound Variable");
621      env->err= 3;      env->err= 3;
622      return;      return;
623    }    }
624    push_val(env, val);           /* Return the symbol's bound value */    push_val(env, val);           /* Return the symbol's bound value */
625    swap(env);    swap(env);
626    if(env->err) return;    if(env->err) return;
627    toss(env);                    /* toss the symbol */    env->head= CDR(env->head);
   if(env->err) return;  
628  }  }
629    
630    
# Line 635  extern void eval(environment *env) Line 642  extern void eval(environment *env)
642    gc_maybe(env);    gc_maybe(env);
643    
644    if(env->head->type==empty) {    if(env->head->type==empty) {
645      printerr("Too Few Arguments");      printerr(env, "Too Few Arguments");
646      env->err= 1;      env->err= 1;
647      return;      return;
648    }    }
# Line 643  extern void eval(environment *env) Line 650  extern void eval(environment *env)
650    switch(CAR(env->head)->type) {    switch(CAR(env->head)->type) {
651      /* if it's a symbol */      /* if it's a symbol */
652    case symb:    case symb:
653        env->errsymb= CAR(env->head)->content.sym->id;
654      rcl(env);                   /* get its contents */      rcl(env);                   /* get its contents */
655      if(env->err) return;      if(env->err) return;
656      if(CAR(env->head)->type!=symb){ /* don't recurse symbols */      if(CAR(env->head)->type!=symb){ /* don't recurse symbols */
# Line 653  extern void eval(environment *env) Line 661  extern void eval(environment *env)
661      /* If it's a lone function value, run it */      /* If it's a lone function value, run it */
662    case func:    case func:
663      in_func= CAR(env->head)->content.func;      in_func= CAR(env->head)->content.func;
664      toss(env);      env->head= CDR(env->head);
     if(env->err) return;  
665      return in_func(env);      return in_func(env);
666    
667      /* If it's a list */      /* If it's a list */
# Line 662  extern void eval(environment *env) Line 669  extern void eval(environment *env)
669      temp_val= CAR(env->head);      temp_val= CAR(env->head);
670      protect(temp_val);      protect(temp_val);
671    
672      toss(env); if(env->err) return;      env->head= CDR(env->head);
673      iterator= temp_val;      iterator= temp_val;
674            
675      while(iterator->type != empty) {      while(iterator->type != empty) {
676        push_val(env, CAR(iterator));        push_val(env, CAR(iterator));
677                
678        if(CAR(env->head)->type==symb       if(CAR(env->head)->type==symb
679           && CAR(env->head)->content.sym->id[0]==';') {           && CAR(env->head)->content.sym->id[0]==';') {
680          toss(env);          env->head= CDR(env->head);
         if(env->err) return;  
681                    
682          if(CDR(iterator)->type == empty){          if(CDR(iterator)->type == empty){
683            goto eval_start;            goto eval_start;
# Line 682  extern void eval(environment *env) Line 688  extern void eval(environment *env)
688        if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons)        if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons)
689          iterator= CDR(iterator);          iterator= CDR(iterator);
690        else {        else {
691          printerr("Bad Argument Type"); /* Improper list */          printerr(env, "Bad Argument Type"); /* Improper list */
692          env->err= 2;          env->err= 2;
693          return;          return;
694        }        }
# Line 691  extern void eval(environment *env) Line 697  extern void eval(environment *env)
697      return;      return;
698    
699    case empty:    case empty:
700      toss(env);      env->head= CDR(env->head);
701    case integer:    case integer:
702    case tfloat:    case tfloat:
703    case string:    case string:
704    case port:    case port:
705      case unknown:
706      return;      return;
707    }    }
708  }  }
709    
 /* List all defined words */  
 extern void words(environment *env)  
 {  
   symbol *temp;  
   int i;  
     
   for(i= 0; i<HASHTBLSIZE; i++) {  
     temp= env->symbols[i];  
     while(temp!=NULL) {  
 #ifdef DEBUG  
       if (temp->val != NULL && temp->val->gc.flag.protect)  
         printf("(protected) ");  
 #endif /* DEBUG */  
       printf("%s ", temp->id);  
       temp= temp->next;  
     }  
   }  
 }  
   
 /* Quit stack. */  
 extern void quit(environment *env)  
 {  
   int i;  
   
   while(env->head->type != empty)  
     toss(env);  
   
   if (env->err) return;  
   for(i= 0; i<HASHTBLSIZE; i++) {  
     while(env->symbols[i]!= NULL) {  
       forget_sym(&(env->symbols[i]));  
     }  
     env->symbols[i]= NULL;  
   }  
   
   env->gc_limit= 0;  
   gc_maybe(env);  
   
   words(env);  
   
   if(env->free_string!=NULL)  
     free(env->free_string);  
     
 #ifdef __linux__  
   muntrace();  
 #endif  
   
   exit(EXIT_SUCCESS);  
 }  
710    
711  /* Internal forget function */  /* Internal forget function */
712  void forget_sym(symbol **hash_entry)  void forget_sym(symbol **hash_entry)
# Line 762  void forget_sym(symbol **hash_entry) Line 720  void forget_sym(symbol **hash_entry)
720    free(temp);    free(temp);
721  }  }
722    
 /* Only to be called by itself function printstack. */  
 void print_st(environment *env, value *stack_head, long counter)  
 {  
   if(CDR(stack_head)->type != empty)  
     print_st(env, CDR(stack_head), counter+1);  
   printf("%ld: ", counter);  
   print_val(env, CAR(stack_head), 0, NULL, stdout);  
   printf("\n");  
 }  
   
 /* Prints the stack. */  
 extern void printstack(environment *env)  
 {  
   if(env->head->type == empty) {  
     printf("Stack Empty\n");  
     return;  
   }  
   
   print_st(env, env->head, 1);  
 }  
723    
724  int main(int argc, char **argv)  int main(int argc, char **argv)
725  {  {
726    environment myenv;    environment myenv;
   
727    int c;                        /* getopt option character */    int c;                        /* getopt option character */
728    
729  #ifdef __linux__  #ifdef __linux__
# Line 821  int main(int argc, char **argv) Line 758  int main(int argc, char **argv)
758      }      }
759    }    }
760    
761    if(myenv.interactive) {    if(myenv.interactive)
762      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");  
   }  
763    
764    while(1) {    while(1) {
765      if(myenv.in_string==NULL) {      if(myenv.in_string==NULL) {
# Line 849  under certain conditions; type 'copying; Line 781  under certain conditions; type 'copying;
781      } else if(myenv.head->type!=empty      } else if(myenv.head->type!=empty
782                && CAR(myenv.head)->type==symb                && CAR(myenv.head)->type==symb
783                && CAR(myenv.head)->content.sym->id[0] == ';') {                && CAR(myenv.head)->content.sym->id[0] == ';') {
784        toss(&myenv); if(myenv.err) continue;        if(myenv.head->type != empty)
785            myenv.head= CDR(myenv.head);
786        eval(&myenv);        eval(&myenv);
787      } else {      } else {
788        gc_maybe(&myenv);        gc_maybe(&myenv);
# Line 859  under certain conditions; type 'copying; Line 792  under certain conditions; type 'copying;
792    return EXIT_FAILURE;    return EXIT_FAILURE;
793  }  }
794    
795    
796  /* Return copy of a value */  /* Return copy of a value */
797  value *copy_val(environment *env, value *old_value)  value *copy_val(environment *env, value *old_value)
798  {  {
# Line 876  value *copy_val(environment *env, value Line 810  value *copy_val(environment *env, value
810    case func:    case func:
811    case symb:    case symb:
812    case empty:    case empty:
813      case unknown:
814    case port:    case port:
815      new_value->content= old_value->content;      new_value->content= old_value->content;
816      break;      break;
# Line 896  value *copy_val(environment *env, value Line 831  value *copy_val(environment *env, value
831    return new_value;    return new_value;
832  }  }
833    
834    
835  /* read a line from a stream; used by readline */  /* read a line from a stream; used by readline */
836  void readlinestream(environment *env, FILE *stream)  void readlinestream(environment *env, FILE *stream)
837  {  {
# Line 912  void readlinestream(environment *env, FI Line 848  void readlinestream(environment *env, FI
848    }    }
849  }  }
850    
851    
852  /* Reverse (flip) a list */  /* Reverse (flip) a list */
853  extern void rev(environment *env)  extern void rev(environment *env)
854  {  {
855    value *old_head, *new_head, *item;    value *old_head, *new_head, *item;
856    
857    if(env->head->type==empty) {    if(env->head->type==empty) {
858      printerr("Too Few Arguments");      printerr(env, "Too Few Arguments");
859      env->err= 1;      env->err= 1;
860      return;      return;
861    }    }
# Line 927  extern void rev(environment *env) Line 864  extern void rev(environment *env)
864      return;                     /* Don't reverse an empty list */      return;                     /* Don't reverse an empty list */
865    
866    if(CAR(env->head)->type!=tcons) {    if(CAR(env->head)->type!=tcons) {
867      printerr("Bad Argument Type");      printerr(env, "Bad Argument Type");
868      env->err= 2;      env->err= 2;
869      return;      return;
870    }    }
# Line 943  extern void rev(environment *env) Line 880  extern void rev(environment *env)
880    CAR(env->head)= new_head;    CAR(env->head)= new_head;
881  }  }
882    
883    
884  /* Make a list. */  /* Make a list. */
885  extern void pack(environment *env)  extern void pack(environment *env)
886  {  {
# Line 955  extern void pack(environment *env) Line 893  extern void pack(environment *env)
893       || (CAR(iterator)->type==symb       || (CAR(iterator)->type==symb
894       && CAR(iterator)->content.sym->id[0]=='[')) {       && CAR(iterator)->content.sym->id[0]=='[')) {
895      temp= ending;      temp= ending;
896      toss(env);      if(env->head->type != empty)
897          env->head= CDR(env->head);
898    } else {    } else {
899      /* Search for first delimiter */      /* Search for first delimiter */
900      while(CDR(iterator)->type != empty      while(CDR(iterator)->type != empty
# Line 969  extern void pack(environment *env) Line 908  extern void pack(environment *env)
908      CDR(iterator)= ending;      CDR(iterator)= ending;
909    
910      if(env->head->type != empty)      if(env->head->type != empty)
911        toss(env);        env->head= CDR(env->head);
912    }    }
913    
914    /* Push list */    /* Push list */
# Line 978  extern void pack(environment *env) Line 917  extern void pack(environment *env)
917    rev(env);    rev(env);
918  }  }
919    
920    
921  /* read from a stream; used by "read" and "readport" */  /* read from a stream; used by "read" and "readport" */
922  void readstream(environment *env, FILE *stream)  void readstream(environment *env, FILE *stream)
923  {  {
# Line 1013  void readstream(environment *env, FILE * Line 953  void readstream(environment *env, FILE *
953      assert(env->in_string != NULL);      assert(env->in_string != NULL);
954      env->free_string= env->in_string; /* Save the original pointer */      env->free_string= env->in_string; /* Save the original pointer */
955      strcpy(env->in_string, CAR(env->head)->content.string);      strcpy(env->in_string, CAR(env->head)->content.string);
956      toss(env); if(env->err) return;      env->head= CDR(env->head);
957    }    }
958        
959    inlength= strlen(env->in_string)+1;    inlength= strlen(env->in_string)+1;
# Line 1065  void readstream(environment *env, FILE * Line 1005  void readstream(environment *env, FILE *
1005      return readstream(env, env->inputstream);      return readstream(env, env->inputstream);
1006  }  }
1007    
1008  extern void copying(environment *env)  
1009    int check_args(environment *env, ...)
1010  {  {
1011    printf("                  GNU GENERAL PUBLIC LICENSE\n\    va_list ap;
1012                         Version 2, June 1991\n\    enum type_enum mytype;
 \n\  
  Copyright (C) 1989, 1991 Free Software Foundation, Inc.\n\  
      59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\  
  Everyone is permitted to copy and distribute verbatim copies\n\  
  of this license document, but changing it is not allowed.\n\  
 \n\  
                             Preamble\n\  
 \n\  
   The licenses for most software are designed to take away your\n\  
 freedom to share and change it.  By contrast, the GNU General Public\n\  
 License is intended to guarantee your freedom to share and change free\n\  
 software--to make sure the software is free for all its users.  This\n\  
 General Public License applies to most of the Free Software\n\  
 Foundation's software and to any other program whose authors commit to\n\  
 using it.  (Some other Free Software Foundation software is covered by\n\  
 the GNU Library General Public License instead.)  You can apply it to\n\  
 your programs, too.\n\  
 \n\  
   When we speak of free software, we are referring to freedom, not\n\  
 price.  Our General Public Licenses are designed to make sure that you\n\  
 have the freedom to distribute copies of free software (and charge for\n\  
 this service if you wish), that you receive source code or can get it\n\  
 if you want it, that you can change the software or use pieces of it\n\  
 in new free programs; and that you know you can do these things.\n\  
 \n\  
   To protect your rights, we need to make restrictions that forbid\n\  
 anyone to deny you these rights or to ask you to surrender the rights.\n\  
 These restrictions translate to certain responsibilities for you if you\n\  
 distribute copies of the software, or if you modify it.\n\  
 \n\  
   For example, if you distribute copies of such a program, whether\n\  
 gratis or for a fee, you must give the recipients all the rights that\n\  
 you have.  You must make sure that they, too, receive or can get the\n\  
 source code.  And you must show them these terms so they know their\n\  
 rights.\n\  
 \n\  
   We protect your rights with two steps: (1) copyright the software, and\n\  
 (2) offer you this license which gives you legal permission to copy,\n\  
 distribute and/or modify the software.\n\  
 \n\  
   Also, for each author's protection and ours, we want to make certain\n\  
 that everyone understands that there is no warranty for this free\n\  
 software.  If the software is modified by someone else and passed on, we\n\  
 want its recipients to know that what they have is not the original, so\n\  
 that any problems introduced by others will not reflect on the original\n\  
 authors' reputations.\n\  
 \n\  
   Finally, any free program is threatened constantly by software\n\  
 patents.  We wish to avoid the danger that redistributors of a free\n\  
 program will individually obtain patent licenses, in effect making the\n\  
 program proprietary.  To prevent this, we have made it clear that any\n\  
 patent must be licensed for everyone's free use or not licensed at all.\n\  
 \n\  
   The precise terms and conditions for copying, distribution and\n\  
 modification follow.\n\  
 \n\  
                     GNU GENERAL PUBLIC LICENSE\n\  
    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\n\  
 \n\  
   0. This License applies to any program or other work which contains\n\  
 a notice placed by the copyright holder saying it may be distributed\n\  
 under the terms of this General Public License.  The \"Program\", below,\n\  
 refers to any such program or work, and a \"work based on the Program\"\n\  
 means either the Program or any derivative work under copyright law:\n\  
 that is to say, a work containing the Program or a portion of it,\n\  
 either verbatim or with modifications and/or translated into another\n\  
 language.  (Hereinafter, translation is included without limitation in\n\  
 the term \"modification\".)  Each licensee is addressed as \"you\".\n\  
 \n\  
 Activities other than copying, distribution and modification are not\n\  
 covered by this License; they are outside its scope.  The act of\n\  
 running the Program is not restricted, and the output from the Program\n\  
 is covered only if its contents constitute a work based on the\n\  
 Program (independent of having been made by running the Program).\n\  
 Whether that is true depends on what the Program does.\n\  
 \n\  
   1. You may copy and distribute verbatim copies of the Program's\n\  
 source code as you receive it, in any medium, provided that you\n\  
 conspicuously and appropriately publish on each copy an appropriate\n\  
 copyright notice and disclaimer of warranty; keep intact all the\n\  
 notices that refer to this License and to the absence of any warranty;\n\  
 and give any other recipients of the Program a copy of this License\n\  
 along with the Program.\n\  
 \n\  
 You may charge a fee for the physical act of transferring a copy, and\n\  
 you may at your option offer warranty protection in exchange for a fee.\n\  
 \n\  
   2. You may modify your copy or copies of the Program or any portion\n\  
 of it, thus forming a work based on the Program, and copy and\n\  
 distribute such modifications or work under the terms of Section 1\n\  
 above, provided that you also meet all of these conditions:\n\  
 \n\  
     a) You must cause the modified files to carry prominent notices\n\  
     stating that you changed the files and the date of any change.\n\  
 \n\  
     b) You must cause any work that you distribute or publish, that in\n\  
     whole or in part contains or is derived from the Program or any\n\  
     part thereof, to be licensed as a whole at no charge to all third\n\  
     parties under the terms of this License.\n\  
 \n\  
     c) If the modified program normally reads commands interactively\n\  
     when run, you must cause it, when started running for such\n\  
     interactive use in the most ordinary way, to print or display an\n\  
     announcement including an appropriate copyright notice and a\n\  
     notice that there is no warranty (or else, saying that you provide\n\  
     a warranty) and that users may redistribute the program under\n\  
     these conditions, and telling the user how to view a copy of this\n\  
     License.  (Exception: if the Program itself is interactive but\n\  
     does not normally print such an announcement, your work based on\n\  
     the Program is not required to print an announcement.)\n\  
 \n\  
 These requirements apply to the modified work as a whole.  If\n\  
 identifiable sections of that work are not derived from the Program,\n\  
 and can be reasonably considered independent and separate works in\n\  
 themselves, then this License, and its terms, do not apply to those\n\  
 sections when you distribute them as separate works.  But when you\n\  
 distribute the same sections as part of a whole which is a work based\n\  
 on the Program, the distribution of the whole must be on the terms of\n\  
 this License, whose permissions for other licensees extend to the\n\  
 entire whole, and thus to each and every part regardless of who wrote it.\n\  
 \n\  
 Thus, it is not the intent of this section to claim rights or contest\n\  
 your rights to work written entirely by you; rather, the intent is to\n\  
 exercise the right to control the distribution of derivative or\n\  
 collective works based on the Program.\n\  
 \n\  
 In addition, mere aggregation of another work not based on the Program\n\  
 with the Program (or with a work based on the Program) on a volume of\n\  
 a storage or distribution medium does not bring the other work under\n\  
 the scope of this License.\n\  
 \n\  
   3. You may copy and distribute the Program (or a work based on it,\n\  
 under Section 2) in object code or executable form under the terms of\n\  
 Sections 1 and 2 above provided that you also do one of the following:\n\  
 \n\  
     a) Accompany it with the complete corresponding machine-readable\n\  
     source code, which must be distributed under the terms of Sections\n\  
     1 and 2 above on a medium customarily used for software interchange; or,\n\  
 \n\  
     b) Accompany it with a written offer, valid for at least three\n\  
     years, to give any third party, for a charge no more than your\n\  
     cost of physically performing source distribution, a complete\n\  
     machine-readable copy of the corresponding source code, to be\n\  
     distributed under the terms of Sections 1 and 2 above on a medium\n\  
     customarily used for software interchange; or,\n\  
 \n\  
     c) Accompany it with the information you received as to the offer\n\  
     to distribute corresponding source code.  (This alternative is\n\  
     allowed only for noncommercial distribution and only if you\n\  
     received the program in object code or executable form with such\n\  
     an offer, in accord with Subsection b above.)\n\  
 \n\  
 The source code for a work means the preferred form of the work for\n\  
 making modifications to it.  For an executable work, complete source\n\  
 code means all the source code for all modules it contains, plus any\n\  
 associated interface definition files, plus the scripts used to\n\  
 control compilation and installation of the executable.  However, as a\n\  
 special exception, the source code distributed need not include\n\  
 anything that is normally distributed (in either source or binary\n\  
 form) with the major components (compiler, kernel, and so on) of the\n\  
 operating system on which the executable runs, unless that component\n\  
 itself accompanies the executable.\n\  
 \n\  
 If distribution of executable or object code is made by offering\n\  
 access to copy from a designated place, then offering equivalent\n\  
 access to copy the source code from the same place counts as\n\  
 distribution of the source code, even though third parties are not\n\  
 compelled to copy the source along with the object code.\n\  
 \n\  
   4. You may not copy, modify, sublicense, or distribute the Program\n\  
 except as expressly provided under this License.  Any attempt\n\  
 otherwise to copy, modify, sublicense or distribute the Program is\n\  
 void, and will automatically terminate your rights under this License.\n\  
 However, parties who have received copies, or rights, from you under\n\  
 this License will not have their licenses terminated so long as such\n\  
 parties remain in full compliance.\n\  
 \n\  
   5. You are not required to accept this License, since you have not\n\  
 signed it.  However, nothing else grants you permission to modify or\n\  
 distribute the Program or its derivative works.  These actions are\n\  
 prohibited by law if you do not accept this License.  Therefore, by\n\  
 modifying or distributing the Program (or any work based on the\n\  
 Program), you indicate your acceptance of this License to do so, and\n\  
 all its terms and conditions for copying, distributing or modifying\n\  
 the Program or works based on it.\n\  
 \n\  
   6. Each time you redistribute the Program (or any work based on the\n\  
 Program), the recipient automatically receives a license from the\n\  
 original licensor to copy, distribute or modify the Program subject to\n\  
 these terms and conditions.  You may not impose any further\n\  
 restrictions on the recipients' exercise of the rights granted herein.\n\  
 You are not responsible for enforcing compliance by third parties to\n\  
 this License.\n\  
 \n\  
   7. If, as a consequence of a court judgment or allegation of patent\n\  
 infringement or for any other reason (not limited to patent issues),\n\  
 conditions are imposed on you (whether by court order, agreement or\n\  
 otherwise) that contradict the conditions of this License, they do not\n\  
 excuse you from the conditions of this License.  If you cannot\n\  
 distribute so as to satisfy simultaneously your obligations under this\n\  
 License and any other pertinent obligations, then as a consequence you\n\  
 may not distribute the Program at all.  For example, if a patent\n\  
 license would not permit royalty-free redistribution of the Program by\n\  
 all those who receive copies directly or indirectly through you, then\n\  
 the only way you could satisfy both it and this License would be to\n\  
 refrain entirely from distribution of the Program.\n\  
 \n\  
 If any portion of this section is held invalid or unenforceable under\n\  
 any particular circumstance, the balance of the section is intended to\n\  
 apply and the section as a whole is intended to apply in other\n\  
 circumstances.\n\  
 \n\  
 It is not the purpose of this section to induce you to infringe any\n\  
 patents or other property right claims or to contest validity of any\n\  
 such claims; this section has the sole purpose of protecting the\n\  
 integrity of the free software distribution system, which is\n\  
 implemented by public license practices.  Many people have made\n\  
 generous contributions to the wide range of software distributed\n\  
 through that system in reliance on consistent application of that\n\  
 system; it is up to the author/donor to decide if he or she is willing\n\  
 to distribute software through any other system and a licensee cannot\n\  
 impose that choice.\n\  
 \n\  
 This section is intended to make thoroughly clear what is believed to\n\  
 be a consequence of the rest of this License.\n\  
 \n\  
   8. If the distribution and/or use of the Program is restricted in\n\  
 certain countries either by patents or by copyrighted interfaces, the\n\  
 original copyright holder who places the Program under this License\n\  
 may add an explicit geographical distribution limitation excluding\n\  
 those countries, so that distribution is permitted only in or among\n\  
 countries not thus excluded.  In such case, this License incorporates\n\  
 the limitation as if written in the body of this License.\n\  
 \n\  
   9. The Free Software Foundation may publish revised and/or new versions\n\  
 of the General Public License from time to time.  Such new versions will\n\  
 be similar in spirit to the present version, but may differ in detail to\n\  
 address new problems or concerns.\n\  
 \n\  
 Each version is given a distinguishing version number.  If the Program\n\  
 specifies a version number of this License which applies to it and \"any\n\  
 later version\", you have the option of following the terms and conditions\n\  
 either of that version or of any later version published by the Free\n\  
 Software Foundation.  If the Program does not specify a version number of\n\  
 this License, you may choose any version ever published by the Free Software\n\  
 Foundation.\n\  
 \n\  
   10. If you wish to incorporate parts of the Program into other free\n\  
 programs whose distribution conditions are different, write to the author\n\  
 to ask for permission.  For software which is copyrighted by the Free\n\  
 Software Foundation, write to the Free Software Foundation; we sometimes\n\  
 make exceptions for this.  Our decision will be guided by the two goals\n\  
 of preserving the free status of all derivatives of our free software and\n\  
 of promoting the sharing and reuse of software generally.\n");  
 }  
   
 extern void warranty(environment *env)  
 {  
   printf("                          NO WARRANTY\n\  
 \n\  
   11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY\n\  
 FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN\n\  
 OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES\n\  
 PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED\n\  
 OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\  
 MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS\n\  
 TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE\n\  
 PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,\n\  
 REPAIR OR CORRECTION.\n\  
 \n\  
   12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\n\  
 WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR\n\  
 REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,\n\  
 INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING\n\  
 OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED\n\  
 TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY\n\  
 YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER\n\  
 PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE\n\  
 POSSIBILITY OF SUCH DAMAGES.\n");  
 }  
   
 /* 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;  
   }  
1013    
1014    if(CAR(env->head)->type!=tcons) {    value *iter= env->head;
1015      printerr("Bad Argument Type");    int errval= 0;
     env->err= 2;  
     return;  
   }  
1016    
1017    key=CAR(CDR(env->head));    va_start(ap, env);
1018    item=CAR(env->head);    while(1) {
1019        mytype= va_arg(ap, enum type_enum);
1020        //    fprintf(stderr, "%s\n", env->errsymb);
1021    
1022    while(item->type == tcons){      if(mytype==empty)
1023      if(CAR(item)->type != tcons){        break;
1024        printerr("Bad Argument Type");      
1025        env->err= 2;      if(iter->type==empty || iter==NULL) {
1026        return;        errval= 1;
1027      }        break;
     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;  
1028      }      }
1029    
1030      if(CAR(env->head)->content.i){      if(mytype==unknown) {
1031        toss(env); if(env->err) return;        iter=CDR(iter);
1032        break;        continue;
1033      }      }
     toss(env); if(env->err) return;  
1034    
1035      if(item->type!=tcons) {      if(CAR(iter)->type!=mytype) {
1036        printerr("Bad Argument Type");        errval= 2;
1037        env->err= 2;        break;
       return;  
1038      }      }
1039    
1040      item=CDR(item);      iter= CDR(iter);
1041    }    }
1042    
1043    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);  
 }  
1044    
1045  /* Discard the top element of the stack. */    env->err= errval;
1046  extern void toss(environment *env)    return errval;
 {  
   if(env->head->type==empty) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
     
   env->head= CDR(env->head); /* Remove the top stack item */  
1047  }  }
   
Legend:
Removed from v.1.128  
changed lines
  Added in v.1.133
root@recompile.se
 ViewVC Help
Powered by ViewVC 1.1.26