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

Diff of /stack/stack.c

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

revision 1.91 by teddy, Thu Mar 7 03:28:29 2002 UTC revision 1.137 by masse, Thu Feb 19 15:35:38 2004 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.";
31    
32    
33  /* Initialize a newly created environment */  /* Initialize a newly created environment */
34  void init_env(environment *env)  void init_env(environment *env)
35  {  {
36    int i;    int i;
37    
38    env->gc_limit= 20;    env->gc_limit= 400000;
39    env->gc_count= 0;    env->gc_count= 0;
40    env->gc_ref= NULL;    env->gc_ref= NULL;
   env->gc_protect= NULL;  
41    
42    env->head= NULL;    env->head= new_val(env);
43    for(i= 0; i<HASHTBLSIZE; i++)    for(i= 0; i<HASHTBLSIZE; i++)
44      env->symbols[i]= NULL;      env->symbols[i]= NULL;
45    env->err= 0;    env->err= 0;
# Line 63  void init_env(environment *env) Line 49  void init_env(environment *env)
49    env->interactive= 1;    env->interactive= 1;
50  }  }
51    
 void printerr(const char* in_string) {  
   fprintf(stderr, "Err: %s\n", in_string);  
 }  
52    
53  /* Discard the top element of the stack. */  void printerr(environment *env)
 extern void toss(environment *env)  
54  {  {
55    stackitem *temp= env->head;    char *in_string;
56    
57    if((env->head)==NULL) {    switch(env->err) {
58      printerr("Too Few Arguments");    case 0:
     env->err= 1;  
59      return;      return;
60      case 1:
61        in_string= "Too Few Arguments";
62        break;
63      case 2:
64        in_string= "Bad Argument Type";
65        break;
66      case 3:
67        in_string= "Unbound Variable";
68        break;
69      case 5:
70        return perror(env->errsymb);
71      default:
72        in_string= "Unknown error";
73        break;
74    }    }
     
   env->head= env->head->next;   /* Remove the top stack item */  
   free(temp);                   /* Free the old top stack item */  
75    
76    gc_init(env);    fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string);
77  }  }
78    
79    
80  /* Returns a pointer to a pointer to an element in the hash table. */  /* Returns a pointer to a pointer to an element in the hash table. */
81  symbol **hash(hashtbl in_hashtbl, const char *in_string)  symbol **hash(hashtbl in_hashtbl, const char *in_string)
82  {  {
# Line 113  symbol **hash(hashtbl in_hashtbl, const Line 106  symbol **hash(hashtbl in_hashtbl, const
106    }    }
107  }  }
108    
109  value* new_val(environment *env) {  
110    /* Create new value */
111    value* new_val(environment *env)
112    {
113    value *nval= malloc(sizeof(value));    value *nval= malloc(sizeof(value));
114    stackitem *nitem= malloc(sizeof(stackitem));    stackitem *nitem= malloc(sizeof(stackitem));
115    
116    nval->content.ptr= NULL;    assert(nval != NULL);
117    protect(env, nval);    assert(nitem != NULL);
118    
119    gc_init(env);    nval->content.ptr= NULL;
120      nval->type= empty;
121    
122    nitem->item= nval;    nitem->item= nval;
123    nitem->next= env->gc_ref;    nitem->next= env->gc_ref;
124    
125    env->gc_ref= nitem;    env->gc_ref= nitem;
126    
127    env->gc_count++;    env->gc_count += sizeof(value);
128    unprotect(env);    nval->gc.flag.mark= 0;
129      nval->gc.flag.protect= 0;
130    
131    return nval;    return nval;
132  }  }
133    
 void gc_mark(value *val) {  
   stackitem *iterator;  
134    
135    if(val==NULL || val->gc_garb==0)  /* Push a value onto the stack */
136      return;  void push_val(environment *env, value *val)
137    {
138    val->gc_garb= 0;    value *new_value= new_val(env);
   
   if(val->type==list) {  
     iterator= val->content.ptr;  
139    
140      while(iterator!=NULL) {    new_value->content.c= malloc(sizeof(pair));
141        gc_mark(iterator->item);    assert(new_value->content.c!=NULL);
142        iterator= iterator->next;    env->gc_count += sizeof(pair);
143      }    new_value->type= tcons;
144    }    CAR(new_value)= val;
145      CDR(new_value)= env->head;
146      env->head= new_value;
147  }  }
148    
 extern void gc_init(environment *env) {  
   stackitem *new_head= NULL, *titem, *iterator= env->gc_ref;  
   symbol *tsymb;  
   int i;  
149    
150    if(env->gc_count < env->gc_limit)  /* Push an integer onto the stack */
151      return;  void push_int(environment *env, int in_val)
   
   while(iterator!=NULL) {  
     iterator->item->gc_garb= 1;  
     iterator= iterator->next;  
   }  
   
   /* Mark */  
   iterator= env->gc_protect;  
   while(iterator!=NULL) {  
     gc_mark(iterator->item);  
     iterator= iterator->next;  
   }  
   
   iterator= env->head;  
   while(iterator!=NULL) {  
     gc_mark(iterator->item);  
     iterator= iterator->next;  
   }  
   
   for(i= 0; i<HASHTBLSIZE; i++) {  
     tsymb= env->symbols[i];  
     while(tsymb!=NULL) {  
       gc_mark(tsymb->val);  
       tsymb= tsymb->next;  
     }  
   }  
   
   env->gc_count= 0;  
   
   /* Sweep */  
   while(env->gc_ref!=NULL) {  
   
     if(env->gc_ref->item->gc_garb) {  
       switch(env->gc_ref->item->type) {  
       case string:  
         free(env->gc_ref->item->content.ptr);  
         break;  
       case integer:  
         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);  
         }  
         break;  
       default:  
         break;  
       }  
       free(env->gc_ref->item);  
       titem= env->gc_ref->next;  
       free(env->gc_ref);  
       env->gc_ref= titem;  
     } else {  
       titem= env->gc_ref->next;  
       env->gc_ref->next= new_head;  
       new_head= env->gc_ref;  
       env->gc_ref= titem;  
       env->gc_count++;  
     }  
   }  
   
   env->gc_limit= env->gc_count*2;  
   env->gc_ref= new_head;  
 }  
   
 void protect(environment *env, value *val)  
152  {  {
153    stackitem *new_item= malloc(sizeof(stackitem));    value *new_value= new_val(env);
154    new_item->item= val;    
155    new_item->next= env->gc_protect;    new_value->content.i= in_val;
156    env->gc_protect= new_item;    new_value->type= integer;
 }  
157    
158  void unprotect(environment *env)    push_val(env, new_value);
 {  
   stackitem *temp= env->gc_protect;  
   env->gc_protect= env->gc_protect->next;  
   free(temp);  
159  }  }
160    
 /* Push a value onto the stack */  
 void push_val(environment *env, value *val)  
 {  
   stackitem *new_item= malloc(sizeof(stackitem));  
   new_item->item= val;  
   new_item->next= env->head;  
   env->head= new_item;  
 }  
161    
162  /* Push an integer onto the stack. */  /* Push a floating point number onto the stack */
163  void push_int(environment *env, int in_val)  void push_float(environment *env, float in_val)
164  {  {
165    value *new_value= new_val(env);    value *new_value= new_val(env);
166      
167    new_value->content.val= in_val;    new_value->content.f= in_val;
168    new_value->type= integer;    new_value->type= tfloat;
169    
170    push_val(env, new_value);    push_val(env, new_value);
171  }  }
172    
173    
174  /* Copy a string onto the stack. */  /* Copy a string onto the stack. */
175  void push_cstring(environment *env, const char *in_string)  void push_cstring(environment *env, const char *in_string)
176  {  {
177    value *new_value= new_val(env);    value *new_value= new_val(env);
178      int length= strlen(in_string)+1;
179    
180    new_value->content.ptr= malloc(strlen(in_string)+1);    new_value->content.string= malloc(length);
181    strcpy(new_value->content.ptr, in_string);    assert(new_value != NULL);
182      env->gc_count += length;
183      strcpy(new_value->content.string, in_string);
184    new_value->type= string;    new_value->type= string;
185    
186    push_val(env, new_value);    push_val(env, new_value);
187  }  }
188    
189    
190  /* Mangle a symbol name to a valid C identifier name */  /* Mangle a symbol name to a valid C identifier name */
191  char *mangle_str(const char *old_string){  char *mangle_str(const char *old_string)
192    {
193    char validchars[]= "0123456789abcdef";    char validchars[]= "0123456789abcdef";
194    char *new_string, *current;    char *new_string, *current;
195    
196    new_string= malloc((strlen(old_string)*2)+4);    new_string= malloc((strlen(old_string)*2)+4);
197      assert(new_string != NULL);
198    strcpy(new_string, "sx_");    /* Stack eXternal */    strcpy(new_string, "sx_");    /* Stack eXternal */
199    current= new_string+3;    current= new_string+3;
200    
201    while(old_string[0] != '\0'){    while(old_string[0] != '\0'){
202      current[0]= validchars[(unsigned char)(old_string[0])/16];      current[0]= validchars[(unsigned char)(old_string[0])/16];
203      current[1]= validchars[(unsigned char)(old_string[0])%16];      current[1]= validchars[(unsigned char)(old_string[0])%16];
# Line 289  char *mangle_str(const char *old_string) Line 209  char *mangle_str(const char *old_string)
209    return new_string;            /* The caller must free() it */    return new_string;            /* The caller must free() it */
210  }  }
211    
 extern void mangle(environment *env){  
   char *new_string;  
   
   if((env->head)==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);  
 }  
212    
213  /* Push a symbol onto the stack. */  /* Push a symbol onto the stack. */
214  void push_sym(environment *env, const char *in_string)  void push_sym(environment *env, const char *in_string)
# Line 328  void push_sym(environment *env, const ch Line 226  void push_sym(environment *env, const ch
226    char *mangled;                /* Mangled function name */    char *mangled;                /* Mangled function name */
227    
228    new_value= new_val(env);    new_value= new_val(env);
229      new_fvalue= new_val(env);
230    
231    /* The new value is a symbol */    /* The new value is a symbol */
232    new_value->type= symb;    new_value->type= symb;
233    
234    /* Look up the symbol name in the hash table */    /* Look up the symbol name in the hash table */
235    new_symbol= hash(env->symbols, in_string);    new_symbol= hash(env->symbols, in_string);
236    new_value->content.ptr= *new_symbol;    new_value->content.sym= *new_symbol;
237    
238    if(*new_symbol==NULL) { /* If symbol was undefined */    if(*new_symbol==NULL) { /* If symbol was undefined */
239    
240      /* Create a new symbol */      /* Create a new symbol */
241      (*new_symbol)= malloc(sizeof(symbol));      (*new_symbol)= malloc(sizeof(symbol));
242        assert((*new_symbol) != NULL);
243      (*new_symbol)->val= NULL;   /* undefined value */      (*new_symbol)->val= NULL;   /* undefined value */
244      (*new_symbol)->next= NULL;      (*new_symbol)->next= NULL;
245      (*new_symbol)->id= malloc(strlen(in_string)+1);      (*new_symbol)->id= malloc(strlen(in_string)+1);
246        assert((*new_symbol)->id != NULL);
247      strcpy((*new_symbol)->id, in_string);      strcpy((*new_symbol)->id, in_string);
248    
249      /* Intern the new symbol in the hash table */      /* Intern the new symbol in the hash table */
250      new_value->content.ptr= *new_symbol;      new_value->content.sym= *new_symbol;
251    
252      /* Try to load the symbol name as an external function, to see if      /* Try to load the symbol name as an external function, to see if
253         we should bind the symbol to a new function pointer value */         we should bind the symbol to a new function pointer value */
# Line 355  void push_sym(environment *env, const ch Line 256  void push_sym(environment *env, const ch
256    
257      mangled= mangle_str(in_string); /* mangle the name */      mangled= mangle_str(in_string); /* mangle the name */
258      funcptr= dlsym(handle, mangled); /* and try to find it */      funcptr= dlsym(handle, mangled); /* and try to find it */
259      free(mangled);  
260      dlerr= dlerror();      dlerr= dlerror();
261      if(dlerr != NULL) {         /* If no function was found */      if(dlerr != NULL) {         /* If no function was found */
262        funcptr= dlsym(handle, in_string); /* Get function pointer */        funcptr= dlsym(handle, in_string); /* Get function pointer */
263        dlerr= dlerror();        dlerr= dlerror();
264      }      }
265    
266      if(dlerr==NULL) {           /* If a function was found */      if(dlerr==NULL) {           /* If a function was found */
       new_fvalue= new_val(env); /* Create a new value */  
267        new_fvalue->type= func;   /* The new value is a function pointer */        new_fvalue->type= func;   /* The new value is a function pointer */
268        new_fvalue->content.ptr= funcptr; /* Store function pointer */        new_fvalue->content.func= funcptr; /* Store function pointer */
269        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new
270                                           function value */                                           function value */
271      }      }
272    
273        free(mangled);
274    }    }
   push_val(env, new_value);  
 }  
275    
276  /* Print newline. */    push_val(env, new_value);
 extern void nl()  
 {  
   printf("\n");  
277  }  }
278    
 /* Gets the type of a value */  
 extern void type(environment *env){  
   int typenum;  
279    
280    if((env->head)==NULL) {  /* Print a value */
281      printerr("Too Few Arguments");  void print_val(environment *env, value *val, int noquote, stackitem *stack,
282      env->err=1;                 FILE *stream)
283      return;  {
284    }    stackitem *titem, *tstack;
285    typenum=env->head->item->type;    int depth;
286    toss(env);  
287    switch(typenum){    switch(val->type) {
288    case integer:    case empty:
289      push_sym(env, "integer");      if(fprintf(stream, "[]") < 0)
290      break;        env->err= 5;
291    case string:      break;
292      push_sym(env, "string");    case unknown:
293        if(fprintf(stream, "UNKNOWN") < 0)
294          env->err= 5;
295      break;      break;
   case symb:  
     push_sym(env, "symbol");  
     break;  
   case func:  
     push_sym(env, "function");  
     break;  
   case list:  
     push_sym(env, "list");  
     break;  
   }  
 }      
   
 /* Prints the top element of the stack. */  
 void print_h(stackitem *stack_head, int noquote)  
 {  
   switch(stack_head->item->type) {  
296    case integer:    case integer:
297      printf("%d", stack_head->item->content.val);      if(fprintf(stream, "%d", val->content.i) < 0)
298          env->err= 5;
299        break;
300      case tfloat:
301        if(fprintf(stream, "%f", val->content.f) < 0)
302          env->err= 5;
303      break;      break;
304    case string:    case string:
305      if(noquote)      if(noquote){
306        printf("%s", (char*)stack_head->item->content.ptr);        if(fprintf(stream, "%s", val->content.string) < 0)
307      else          env->err= 5;
308        printf("\"%s\"", (char*)stack_head->item->content.ptr);      } else {                    /* quote */
309          if(fprintf(stream, "\"%s\"", val->content.string) < 0)
310            env->err= 5;
311        }
312      break;      break;
313    case symb:    case symb:
314      printf("%s", ((symbol *)(stack_head->item->content.ptr))->id);      if(fprintf(stream, "%s", val->content.sym->id) < 0)
315          env->err= 5;
316      break;      break;
317    case func:    case func:
318      printf("#<function %p>", (funcp)(stack_head->item->content.ptr));      if(fprintf(stream, "#<function %p>", val->content.func) < 0)
319          env->err= 5;
320      break;      break;
321    case list:    case port:
322      /* A list is just a stack, so make stack_head point to it */      if(fprintf(stream, "#<port %p>", val->content.p) < 0)
323      stack_head=(stackitem *)(stack_head->item->content.ptr);        env->err= 5;
324      printf("[ ");      break;
325      while(stack_head != NULL) {    case tcons:
326        print_h(stack_head, noquote);      if(fprintf(stream, "[ ") < 0) {
327        printf(" ");        env->err= 5;
328        stack_head=stack_head->next;        return printerr(env);
329      }      }
330      printf("]");      tstack= stack;
331      break;  
332    }      do {
333  }        titem=malloc(sizeof(stackitem));
334          assert(titem != NULL);
335  extern void print_(environment *env) {        titem->item=val;
336    if(env->head==NULL) {        titem->next=tstack;
337      printerr("Too Few Arguments");        tstack=titem;             /* Put it on the stack */
338      env->err=1;        /* Search a stack of values being printed to see if we are already
339      return;           printing this value */
340    }        titem=tstack;
341    print_h(env->head, 0);        depth=0;
342    nl();  
343  }        while(titem != NULL && titem->item != CAR(val)){
344            titem=titem->next;
345            depth++;
346          }
347    
348  /* Prints the top element of the stack and then discards it. */        if(titem != NULL){        /* If we found it on the stack, */
349  extern void print(environment *env)          if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */
350  {            env->err= 5;
351    print_(env);            free(titem);
352    if(env->err) return;            return printerr(env);
353    toss(env);          }
354  }        } else {
355            print_val(env, CAR(val), noquote, tstack, stream);
356          }
357    
358  extern void princ_(environment *env) {        val= CDR(val);
359    if(env->head==NULL) {        switch(val->type){
360      printerr("Too Few Arguments");        case empty:
361      env->err=1;          break;
362      return;        case tcons:
363    }          /* Search a stack of values being printed to see if we are already
364    print_h(env->head, 1);             printing this value */
365  }          titem=tstack;
366            depth=0;
367    
368            while(titem != NULL && titem->item != val){
369              titem=titem->next;
370              depth++;
371            }
372            if(titem != NULL){      /* If we found it on the stack, */
373              if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */
374                env->err= 5;
375                printerr(env);
376                goto printval_end;
377              }
378            } else {
379              if(fprintf(stream, " ") < 0){
380                env->err= 5;
381                printerr(env);
382                goto printval_end;
383              }
384            }
385            break;
386          default:
387            if(fprintf(stream, " . ") < 0){ /* Improper list */
388              env->err= 5;
389              printerr(env);
390              goto printval_end;
391            }
392            print_val(env, val, noquote, tstack, stream);
393          }
394        } while(val->type == tcons && titem == NULL);
395    
396  /* 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);  
 }  
397    
398  /* Only to be called by function printstack. */      titem=tstack;
399  void print_st(stackitem *stack_head, long counter)      while(titem != stack){
400  {        tstack=titem->next;
401    if(stack_head->next != NULL)        free(titem);
402      print_st(stack_head->next, counter+1);        titem=tstack;
403    printf("%ld: ", counter);      }
   print_h(stack_head, 0);  
   nl();  
 }  
404    
405  /* Prints the stack. */      if(! (env->err)){
406  extern void printstack(environment *env)        if(fprintf(stream, " ]") < 0){
407  {          env->err= 5;
408    if(env->head == NULL) {        }
409      printf("Stack Empty\n");      }
410      return;      break;
411    }    }
412    print_st(env->head, 1);    
413      if(env->err)
414        return printerr(env);
415  }  }
416    
417    
418  /* Swap the two top elements on the stack. */  /* Swap the two top elements on the stack. */
419  extern void swap(environment *env)  extern void swap(environment *env)
420  {  {
421    stackitem *temp= env->head;    value *temp= env->head;
     
   if(env->head==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
422    
423    env->head= env->head->next;    if(check_args(env, 2, unknown, unknown))
424    temp->next= env->head->next;      return printerr(env);
   env->head->next= temp;  
 }  
   
 /* Rotate the first three elements on the stack. */  
 extern void rot(environment *env)  
 {  
   stackitem *temp= env->head;  
425        
426    if(env->head==NULL || env->head->next==NULL    env->head= CDR(env->head);
427        || env->head->next->next==NULL) {    CDR(temp)= CDR(env->head);
428      printerr("Too Few Arguments");    CDR(env->head)= temp;
429      env->err=1;  }
     return;  
   }  
430    
   env->head= env->head->next->next;  
   temp->next->next= env->head->next;  
   env->head->next= temp;  
 }  
431    
432  /* Recall a value from a symbol, if bound */  /* Recall a value from a symbol, if bound */
433  extern void rcl(environment *env)  extern void rcl(environment *env)
434  {  {
435    value *val;    value *val;
436    
437    if(env->head == NULL) {    if(check_args(env, 1, symb))
438      printerr("Too Few Arguments");      return printerr(env);
     env->err=1;  
     return;  
   }  
   
   if(env->head->item->type!=symb) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
439    
440    val=((symbol *)(env->head->item->content.ptr))->val;    val= CAR(env->head)->content.sym->val;
441    if(val == NULL){    if(val == NULL){
442      printerr("Unbound Variable");      env->err= 3;
443      env->err=3;      return printerr(env);
     return;  
444    }    }
445    protect(env, val);  
446    toss(env);            /* toss the symbol */    push_val(env, val);           /* Return the symbol's bound value */
447      swap(env);
448    if(env->err) return;    if(env->err) return;
449    push_val(env, val); /* Return its bound value */    env->head= CDR(env->head);
   unprotect(env);  
450  }  }
451    
452    
453  /* If the top element is a symbol, determine if it's bound to a  /* If the top element is a symbol, determine if it's bound to a
454     function value, and if it is, toss the symbol and execute the     function value, and if it is, toss the symbol and execute the
455     function. */     function. */
# Line 566  extern void eval(environment *env) Line 457  extern void eval(environment *env)
457  {  {
458    funcp in_func;    funcp in_func;
459    value* temp_val;    value* temp_val;
460    stackitem* iterator;    value* iterator;
461    
462   eval_start:   eval_start:
463    
464    if(env->head==NULL) {    gc_maybe(env);
465      printerr("Too Few Arguments");  
466      env->err=1;    if(check_args(env, 1, unknown))
467      return;      return printerr(env);
   }  
468    
469    switch(env->head->item->type) {    switch(CAR(env->head)->type) {
470      /* if it's a symbol */      /* if it's a symbol */
471    case symb:    case symb:
472        env->errsymb= CAR(env->head)->content.sym->id;
473      rcl(env);                   /* get its contents */      rcl(env);                   /* get its contents */
474      if(env->err) return;      if(env->err) return;
475      if(env->head->item->type!=symb){ /* don't recurse symbols */      if(CAR(env->head)->type!=symb){ /* don't recurse symbols */
476        goto eval_start;        goto eval_start;
477      }      }
478      return;      return;
479    
480      /* If it's a lone function value, run it */      /* If it's a lone function value, run it */
481    case func:    case func:
482      in_func= (funcp)(env->head->item->content.ptr);      in_func= CAR(env->head)->content.func;
483      toss(env);      env->head= CDR(env->head);
484      if(env->err) return;      return in_func((void*)env);
     return in_func(env);  
485    
486      /* If it's a list */      /* If it's a list */
487    case list:    case tcons:
488      temp_val= env->head->item;      temp_val= CAR(env->head);
489      protect(env, temp_val);      protect(temp_val);
490      toss(env);  
491      if(env->err) return;      env->head= CDR(env->head);
492      iterator= (stackitem*)temp_val->content.ptr;      iterator= temp_val;
     unprotect(env);  
493            
494      while(iterator!=NULL) {      while(iterator->type != empty) {
495        push_val(env, iterator->item);        push_val(env, CAR(iterator));
496                
497        if(env->head->item->type==symb       if(CAR(env->head)->type==symb
498          && strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) {           && CAR(env->head)->content.sym->id[0]==';') {
499          toss(env);          env->head= CDR(env->head);
         if(env->err) return;  
500                    
501          if(iterator->next == NULL){          if(CDR(iterator)->type == empty){
502            goto eval_start;            goto eval_start;
503          }          }
504          eval(env);          eval(env);
505          if(env->err) return;          if(env->err) return;
506        }        }
507        iterator= iterator->next;        if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons)
508            iterator= CDR(iterator);
509          else {
510            env->err= 2; /* Improper list */
511            return printerr(env);
512          }
513      }      }
514        unprotect(temp_val);
515      return;      return;
516    
517    default:    case empty:
518      return;      env->head= CDR(env->head);
519    }    case integer:
520  }    case tfloat:
521      case string:
522  /* Reverse (flip) a list */    case port:
523  extern void rev(environment *env){    case unknown:
   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;  
   
   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;  
       
     if(env->head!=NULL)  
       toss(env);  
   }  
   
   /* Push list */  
   pack= new_val(env);  
   pack->type= list;  
   pack->content.ptr= temp;  
   
   push_val(env, pack);  
   rev(env);  
 }  
   
 /* Relocate elements of the list on the stack. */  
 extern void expand(environment *env)  
 {  
   stackitem *temp, *new_head;  
   
   /* Is top element a list? */  
   if(env->head==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   if(env->head->item->type!=list) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   rev(env);  
   
   if(env->err)  
     return;  
   
   /* The first list element is the new stack head */  
   new_head= temp= env->head->item->content.ptr;  
   
   toss(env);  
   
   /* Find the end of the list */  
   while(temp->next!=NULL)  
     temp= temp->next;  
   
   /* Connect the tail of the list with the old stack head */  
   temp->next= env->head;  
   env->head= new_head;          /* ...and voila! */  
   
 }  
   
 /* Compares two elements by reference. */  
 extern void eq(environment *env)  
 {  
   void *left, *right;  
   int result;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   left= env->head->item->content.ptr;  
   swap(env);  
   right= env->head->item->content.ptr;  
   result= (left==right);  
     
   toss(env); toss(env);  
   push_int(env, result);  
 }  
   
 /* Negates the top element on the stack. */  
 extern void not(environment *env)  
 {  
   int val;  
   
   if((env->head)==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->item->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   val= env->head->item->content.val;  
   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;  
524      return;      return;
525    }    }
   
   /* 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)  
 {  
   long i;  
   
   clear(env);  
   
   if (env->err) return;  
   for(i= 0; i<HASHTBLSIZE; i++) {  
     while(env->symbols[i]!= NULL) {  
       forget_sym(&(env->symbols[i]));  
     }  
     env->symbols[i]= NULL;  
   }  
   
   env->gc_limit= 0;  
   gc_init(env);  
   
   if(env->free_string!=NULL)  
     free(env->free_string);  
     
   muntrace();  
   
   exit(EXIT_SUCCESS);  
526  }  }
527    
 /* 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;  
     }  
   }  
 }  
528    
529  /* Internal forget function */  /* Internal forget function */
530  void forget_sym(symbol **hash_entry) {  void forget_sym(symbol **hash_entry)
531    {
532    symbol *temp;    symbol *temp;
533    
534    temp= *hash_entry;    temp= *hash_entry;
# Line 864  void forget_sym(symbol **hash_entry) { Line 538  void forget_sym(symbol **hash_entry) {
538    free(temp);    free(temp);
539  }  }
540    
 /* Forgets a symbol (remove it from the hash table) */  
 extern void forget(environment *env)  
 {  
   char* sym_id;  
   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);  
 }  
541    
542  int main(int argc, char **argv)  int main(int argc, char **argv)
543  {  {
544    environment myenv;    environment myenv;
   
545    int c;                        /* getopt option character */    int c;                        /* getopt option character */
546    
547    #ifdef __linux__
548    mtrace();    mtrace();
549    #endif
550    
551    init_env(&myenv);    init_env(&myenv);
552    
# Line 913  int main(int argc, char **argv) Line 560  int main(int argc, char **argv)
560          break;          break;
561        case '?':        case '?':
562          fprintf (stderr,          fprintf (stderr,
563                   "Unknown option character `\\x%x'.\n",                   "Unknown option character '\\x%x'.\n",
564                   optopt);                   optopt);
565          return EX_USAGE;          return EX_USAGE;
566        default:        default:
# Line 929  int main(int argc, char **argv) Line 576  int main(int argc, char **argv)
576      }      }
577    }    }
578    
579    if(myenv.interactive) {    if(myenv.interactive)
580      printf("Stack version $Revision$\n\      puts(start_message);
 Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn\n\  
 Stack comes with ABSOLUTELY NO WARRANTY; for details type `warranty;'.\n\  
 This is free software, and you are welcome to redistribute it\n\  
 under certain conditions; type `copying;' for details.\n");  
   }  
581    
582    while(1) {    while(1) {
583      if(myenv.in_string==NULL) {      if(myenv.in_string==NULL) {
584        if (myenv.interactive) {        if (myenv.interactive) {
585          if(myenv.err) {          if(myenv.err) {
586            printf("(error %d)\n", myenv.err);            printf("(error %d)\n", myenv.err);
587              myenv.err= 0;
588          }          }
589          nl();          printf("\n");
590          printstack(&myenv);          printstack(&myenv);
591          printf("> ");          printf("> ");
592        }        }
593        myenv.err=0;        myenv.err=0;
594      }      }
595      sx_72656164(&myenv);      readstream(&myenv, myenv.inputstream);
596      if (myenv.err==4) {      if (myenv.err) {            /* EOF or other error */
597        return EXIT_SUCCESS;      /* EOF */        myenv.err=0;
598      } else if(myenv.head!=NULL        quit(&myenv);
599                && myenv.head->item->type==symb      } else if(myenv.head->type!=empty
600                && ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') {                && CAR(myenv.head)->type==symb
601        toss(&myenv);             /* No error check in main */                && CAR(myenv.head)->content.sym->id[0] == ';') {
602          if(myenv.head->type != empty)
603            myenv.head= CDR(myenv.head);
604        eval(&myenv);        eval(&myenv);
605        } else {
606          gc_maybe(&myenv);
607      }      }
     gc_init(&myenv);  
608    }    }
609    quit(&myenv);    quit(&myenv);
610    return EXIT_FAILURE;    return EXIT_FAILURE;
611  }  }
612    
 /* "+" */  
 extern void sx_2b(environment *env) {  
   int a, b;  
   size_t len;  
   char* new_string;  
   value *a_val, *b_val;  
   
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->item->type==string  
      && env->head->next->item->type==string) {  
     a_val= env->head->item;  
     b_val= env->head->next->item;  
     protect(env, a_val); protect(env, b_val);  
     toss(env); if(env->err) return;  
     toss(env); if(env->err) return;  
     len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1;  
     new_string= malloc(len);  
     strcpy(new_string, b_val->content.ptr);  
     strcat(new_string, a_val->content.ptr);  
     push_cstring(env, new_string);  
     unprotect(env); unprotect(env);  
     free(new_string);  
     return;  
   }  
     
   if(env->head->item->type!=integer  
      || env->head->next->item->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
   a= env->head->item->content.val;  
   toss(env); if(env->err) return;  
     
   b= env->head->item->content.val;  
   toss(env); if(env->err) return;  
   push_int(env, a+b);  
 }  
   
 /* "-" */  
 extern void sx_2d(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) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
   
   a=env->head->item->content.val;  
   toss(env); if(env->err) return;  
   b=env->head->item->content.val;  
   toss(env); if(env->err) return;  
   push_int(env, b-a);  
 }  
   
 /* ">" */  
 extern void sx_3e(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) {  
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
   }  
   
   a=env->head->item->content.val;  
   toss(env); if(env->err) return;  
   b=env->head->item->content.val;  
   toss(env); if(env->err) return;  
   push_int(env, b>a);  
 }  
613    
614  /* Return copy of a value */  /* Return copy of a value */
615  value *copy_val(environment *env, value *old_value){  value *copy_val(environment *env, value *old_value)
616    stackitem *old_item, *new_item, *prev_item;  {
617      value *new_value;
618    
619    value *new_value= new_val(env);    if(old_value==NULL)
620        return NULL;
621    
622    protect(env, old_value);    new_value= new_val(env);
623    new_value->type= old_value->type;    new_value->type= old_value->type;
624    
625    switch(old_value->type){    switch(old_value->type){
626      case tfloat:
627    case integer:    case integer:
     new_value->content.val= old_value->content.val;  
     break;  
   case string:  
     (char *)(new_value->content.ptr)=  
       strdup((char *)(old_value->content.ptr));  
     break;  
628    case func:    case func:
629    case symb:    case symb:
630      new_value->content.ptr= old_value->content.ptr;    case empty:
631      case unknown:
632      case port:
633        new_value->content= old_value->content;
634      break;      break;
635    case list:    case string:
636      new_value->content.ptr= NULL;      new_value->content.string= strdup(old_value->content.string);
637        break;
638      case tcons:
639    
640      prev_item= NULL;      new_value->content.c= malloc(sizeof(pair));
641      old_item= (stackitem*)(old_value->content.ptr);      assert(new_value->content.c!=NULL);
642        env->gc_count += sizeof(pair);
643    
644      while(old_item != NULL) {   /* While list is not empty */      CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */
645        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;  
     }      
646      break;      break;
647    }    }
648    
   unprotect(env);  
   
649    return new_value;    return new_value;
650  }  }
651    
 /* "dup"; duplicates an item on the stack */  
 extern void sx_647570(environment *env) {  
   if((env->head)==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;  
652    
653    if((env->head)==NULL || env->head->next==NULL) {  /* read a line from a stream; used by readline */
654      printerr("Too Few Arguments");  void readlinestream(environment *env, FILE *stream)
655      env->err= 1;  {
656      return;    char in_string[101];
   }  
657    
658    if(env->head->next->item->type != integer) {    if(fgets(in_string, 100, stream)==NULL) {
659      printerr("Bad Argument Type");      push_cstring(env, "");
660      env->err=2;      if (! feof(stream)){
661      return;        env->err= 5;
662          return printerr(env);
663        }
664      } else {
665        push_cstring(env, in_string);
666    }    }
     
   swap(env);  
   if(env->err) return;  
     
   truth=env->head->item->content.val;  
   
   toss(env);  
   if(env->err) return;  
   
   if(truth)  
     eval(env);  
   else  
     toss(env);  
667  }  }
668    
 /* 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.val;  
   
   toss(env);  
   if(env->err) return;  
   
   if(!truth)  
     swap(env);  
   if(env->err) return;  
   
   toss(env);  
   if(env->err) return;  
669    
670    eval(env);  /* Reverse (flip) a list */
671  }  extern void rev(environment *env)
672    {
673      value *old_head, *new_head, *item;
674    
675  /* "while" */    if(CAR(env->head)->type==empty)
676  extern void sx_7768696c65(environment *env) {      return;                     /* Don't reverse an empty list */
677    
678    int truth;    if(check_args(env, 1, tcons))
679    value *loop, *test;      return printerr(env);
680    
681    if((env->head)==NULL || env->head->next==NULL) {    old_head= CAR(env->head);
682      printerr("Too Few Arguments");    new_head= new_val(env);
683      env->err=1;    while(old_head->type != empty) {
684      return;      item= old_head;
685        old_head= CDR(old_head);
686        CDR(item)= new_head;
687        new_head= item;
688    }    }
689      CAR(env->head)= new_head;
   loop= env->head->item;  
   protect(env, loop);  
   toss(env); if(env->err) return;  
   
   test= env->head->item;  
   protect(env, test);  
   toss(env); if(env->err) return;  
   
   do {  
     push_val(env, test);  
     eval(env);  
       
     if(env->head->item->type != integer) {  
       printerr("Bad Argument Type");  
       env->err= 2;  
       return;  
     }  
       
     truth= env->head->item->content.val;  
     toss(env); if(env->err) return;  
       
     if(truth) {  
       push_val(env, loop);  
       eval(env);  
     } else {  
       toss(env);  
     }  
     
   } while(truth);  
   
   unprotect(env); unprotect(env);  
690  }  }
691    
692    
693  /* "for"; for-loop */  /* Make a list. */
694  extern void sx_666f72(environment *env) {  extern void pack(environment *env)
695    value *loop;  {
696    int foo1, foo2;    value *iterator, *temp, *ending;
   
   if(env->head==NULL || env->head->next==NULL  
      || env->head->next->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
697    
698    if(env->head->next->item->type!=integer    ending=new_val(env);
      || env->head->next->next->item->type!=integer) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
699    
700    loop= env->head->item;    iterator= env->head;
701    protect(env, loop);    if(iterator->type == empty
702    toss(env); if(env->err) return;       || (CAR(iterator)->type==symb
703         && CAR(iterator)->content.sym->id[0]=='[')) {
704    foo2= env->head->item->content.val;      temp= ending;
705    toss(env); if(env->err) return;      if(env->head->type != empty)
706          env->head= CDR(env->head);
   foo1= env->head->item->content.val;  
   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++;  
     }  
707    } else {    } else {
708      while(foo1>=foo2) {      /* Search for first delimiter */
709        push_int(env, foo1);      while(CDR(iterator)->type != empty
710        push_val(env, loop);            && (CAR(CDR(iterator))->type!=symb
711        eval(env); if(env->err) return;             || CAR(CDR(iterator))->content.sym->id[0]!='['))
712        foo1--;        iterator= CDR(iterator);
713      }      
714    }      /* Extract list */
715    unprotect(env);      temp= env->head;
716  }      env->head= CDR(iterator);
717        CDR(iterator)= ending;
 /* Variant of for-loop */  
 extern void foreach(environment *env) {  
     
   value *loop, *foo;  
   stackitem *iterator;  
     
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err= 1;  
     return;  
   }  
   
   if(env->head->next->item->type != list) {  
     printerr("Bad Argument Type");  
     env->err= 2;  
     return;  
   }  
   
   loop= env->head->item;  
   protect(env, loop);  
   toss(env); if(env->err) return;  
   
   foo= env->head->item;  
   protect(env, foo);  
   toss(env); if(env->err) return;  
   
   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;  
   }  
   unprotect(env); unprotect(env);  
 }  
   
 /* "to" */  
 extern void to(environment *env) {  
   int i, start, ending;  
   stackitem *temp_head;  
   value *temp_val;  
     
   if((env->head)==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
718    
719    if(env->head->item->type!=integer      if(env->head->type != empty)
720       || env->head->next->item->type!=integer) {        env->head= CDR(env->head);
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
721    }    }
722    
723    ending= env->head->item->content.val;    /* Push list */
   toss(env); if(env->err) return;  
   start= env->head->item->content.val;  
   toss(env); if(env->err) return;  
   
   temp_head= env->head;  
   env->head= NULL;  
   
   if(ending>=start) {  
     for(i= ending; i>=start; i--)  
       push_int(env, i);  
   } else {  
     for(i= ending; i<=start; i++)  
       push_int(env, i);  
   }  
724    
725    temp_val= new_val(env);    push_val(env, temp);
726    temp_val->content.ptr= env->head;    rev(env);
   temp_val->type= list;  
   env->head= temp_head;  
   push_val(env, temp_val);  
727  }  }
728    
 /* 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);  
 }  
729    
730  /* "read"; Read a value and place on stack */  /* read from a stream; used by "read" and "readport" */
731  extern void sx_72656164(environment *env) {  void readstream(environment *env, FILE *stream)
732    {
733    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";
734    const char strform[]= "\"%[^\"]\"%n";    const char strform[]= "\"%[^\"]\"%n";
735    const char intform[]= "%i%n";    const char intform[]= "%i%n";
736      const char fltform[]= "%f%n";
737    const char blankform[]= "%*[ \t]%n";    const char blankform[]= "%*[ \t]%n";
738    const char ebrackform[]= "]%n";    const char ebrackform[]= "]%n";
739    const char semicform[]= ";%n";    const char semicform[]= ";%n";
740    const char bbrackform[]= "[%n";    const char bbrackform[]= "[%n";
741    
742    int itemp, readlength= -1;    int itemp, readlength= -1;
743      int count= -1;
744      float ftemp;
745    static int depth= 0;    static int depth= 0;
746    char *match;    char *match;
747    size_t inlength;    size_t inlength;
# Line 1381  extern void sx_72656164(environment *env Line 750  extern void sx_72656164(environment *env
750      if(depth > 0 && env->interactive) {      if(depth > 0 && env->interactive) {
751        printf("]> ");        printf("]> ");
752      }      }
753      readline(env); if(env->err) return;      readlinestream(env, env->inputstream);
754        if(env->err) return;
755    
756      if(((char *)(env->head->item->content.ptr))[0]=='\0'){      if((CAR(env->head)->content.string)[0]=='\0'){
757        env->err= 4;              /* "" means EOF */        env->err= 4;              /* "" means EOF */
758        return;        return;
759      }      }
760            
761      env->in_string= malloc(strlen(env->head->item->content.ptr)+1);      env->in_string= malloc(strlen(CAR(env->head)->content.string)+1);
762        assert(env->in_string != NULL);
763      env->free_string= env->in_string; /* Save the original pointer */      env->free_string= env->in_string; /* Save the original pointer */
764      strcpy(env->in_string, env->head->item->content.ptr);      strcpy(env->in_string, CAR(env->head)->content.string);
765      toss(env); if(env->err) return;      env->head= CDR(env->head);
766    }    }
767        
768    inlength= strlen(env->in_string)+1;    inlength= strlen(env->in_string)+1;
769    match= malloc(inlength);    match= malloc(inlength);
770      assert(match != NULL);
771    
772    if(sscanf(env->in_string, blankform, &readlength)!=EOF    if(sscanf(env->in_string, blankform, &readlength) != EOF
773       && readlength != -1) {       && readlength != -1) {
774      ;      ;
775    } else if(sscanf(env->in_string, intform, &itemp, &readlength) != EOF    } else if(sscanf(env->in_string, fltform, &ftemp, &readlength) != EOF
776                && readlength != -1) {
777        if(sscanf(env->in_string, intform, &itemp, &count) != EOF
778           && count==readlength) {
779          push_int(env, itemp);
780        } else {
781          push_float(env, ftemp);
782        }
783      } else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF
784              && readlength != -1) {              && readlength != -1) {
785      push_int(env, itemp);      push_cstring(env, "");
786    } else if(sscanf(env->in_string, strform, match, &readlength) != EOF    } else if(sscanf(env->in_string, strform, match, &readlength) != EOF
787              && readlength != -1) {              && readlength != -1) {
788      push_cstring(env, match);      push_cstring(env, match);
# Line 1424  extern void sx_72656164(environment *env Line 804  extern void sx_72656164(environment *env
804      free(env->free_string);      free(env->free_string);
805      env->in_string = env->free_string = NULL;      env->in_string = env->free_string = NULL;
806    }    }
807    if ( env->in_string != NULL) {    if (env->in_string != NULL) {
808      env->in_string += readlength;      env->in_string += readlength;
809    }    }
810    
811    free(match);    free(match);
812    
813    if(depth)    if(depth)
814      return sx_72656164(env);      return readstream(env, env->inputstream);
815  }  }
816    
 extern void beep(environment *env) {  
817    
818    int freq, dur, period, ticks;  int check_args(environment *env, int num_args, ...)
819    {
820    if((env->head)==NULL || env->head->next==NULL) {    va_list ap;
821      printerr("Too Few Arguments");    enum type_enum mytype;
822      env->err=1;    int i;
     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.val;  
   toss(env);  
   freq=env->head->item->content.val;  
   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; */  
823    
824    /*  if (ioctl(STDOUT_FILENO, KDMKTONE, (125<<16) + 0x637)==0) */    value *iter= env->head;
825    switch (ioctl(STDOUT_FILENO, KDMKTONE, (ticks<<16) | period)){    int errval= 0;
   case 0:  
     usleep(dur);  
     return;  
   case -1:  
     perror("beep");  
     env->err=5;  
     return;  
   default:  
     abort();  
   }  
 };  
826    
827  /* "wait" */    va_start(ap, num_args);
828  extern void sx_77616974(environment *env) {    for(i=1; i<=num_args; i++) {
829        mytype= va_arg(ap, enum type_enum);
830        //    fprintf(stderr, "%s\n", env->errsymb);
831    
832    int dur;      if(iter->type==empty || iter==NULL) {
833          errval= 1;
834          break;
835        }
836    
837    if((env->head)==NULL) {      if(mytype!=unknown && CAR(iter)->type!=mytype) {
838      printerr("Too Few Arguments");        errval= 2;
839      env->err=1;        break;
840      return;      }
   }  
841    
842    if(env->head->item->type!=integer) {      iter= CDR(iter);
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
843    }    }
844    
845    dur=env->head->item->content.val;    va_end(ap);
   toss(env);  
   
   usleep(dur);  
 };  
846    
847  extern void copying(environment *env){    env->err= errval;
848    printf("GNU GENERAL PUBLIC LICENSE\n\    return errval;
                        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");  
849  }  }
Legend:
Removed from v.1.91  
changed lines
  Added in v.1.137
root@recompile.se
 ViewVC Help
Powered by ViewVC 1.1.26