/[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.136 by masse, Mon Aug 18 14:39:16 2003 UTC
# Line 1  Line 1 
1    /* -*- coding: utf-8; -*- */
2  /*  /*
3      stack - an interactive interpreter for a stack-based language      stack - an interactive interpreter for a stack-based language
4      Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn      Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn
# Line 20  Line 21 
21               Teddy Hogeborn <teddy@fukt.bth.se>               Teddy Hogeborn <teddy@fukt.bth.se>
22  */  */
23    
 /* printf, sscanf, fgets, fprintf, fopen, perror */  
 #include <stdio.h>  
 /* exit, EXIT_SUCCESS, malloc, free */  
 #include <stdlib.h>  
 /* NULL */  
 #include <stddef.h>  
 /* dlopen, dlsym, dlerror */  
 #include <dlfcn.h>  
 /* strcmp, strcpy, strlen, strcat, strdup */  
 #include <string.h>  
 /* getopt, STDIN_FILENO, STDOUT_FILENO, usleep */  
 #include <unistd.h>  
 /* EX_NOINPUT, EX_USAGE */  
 #include <sysexits.h>  
 /* mtrace, muntrace */  
 #include <mcheck.h>  
 /* ioctl */  
 #include <sys/ioctl.h>  
 /* KDMKTONE */  
 #include <linux/kd.h>  
   
24  #include "stack.h"  #include "stack.h"
25    
26    const char* start_message= "Stack version $Revision$\n\
27    Copyright (C) 2002  Mats Alritzson and Teddy Hogeborn\n\
28    Stack comes with ABSOLUTELY NO WARRANTY; for details type 'warranty;'.\n\
29    This is free software, and you are welcome to redistribute it\n\
30    under certain conditions; type 'copying;' for details.";
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)  /* Mark values recursively.
136       Marked values are not collected by the GC. */
137    inline void gc_mark(value *val)
138    {
139      if(val==NULL || val->gc.flag.mark)
140      return;      return;
141    
142    val->gc_garb= 0;    val->gc.flag.mark= 1;
   
   if(val->type==list) {  
     iterator= val->content.ptr;  
143    
144      while(iterator!=NULL) {    if(val->type==tcons) {
145        gc_mark(iterator->item);      gc_mark(CAR(val));
146        iterator= iterator->next;      gc_mark(CDR(val));
     }  
147    }    }
148  }  }
149    
150  extern void gc_init(environment *env) {  
151    stackitem *new_head= NULL, *titem, *iterator= env->gc_ref;  /* Start GC */
152    extern void gc_init(environment *env)
153    {
154      stackitem *new_head= NULL, *titem;
155    symbol *tsymb;    symbol *tsymb;
156    int i;    int i;
157    
158    if(env->gc_count < env->gc_limit)    if(env->interactive)
159      return;      printf("Garbage collecting.");
160    
161    while(iterator!=NULL) {    /* Mark values on stack */
162      iterator->item->gc_garb= 1;    gc_mark(env->head);
     iterator= iterator->next;  
   }  
163    
164    /* Mark */    if(env->interactive)
165    iterator= env->gc_protect;      printf(".");
   while(iterator!=NULL) {  
     gc_mark(iterator->item);  
     iterator= iterator->next;  
   }  
166    
167    iterator= env->head;    /* Mark values in hashtable */
168    while(iterator!=NULL) {    for(i= 0; i<HASHTBLSIZE; i++)
169      gc_mark(iterator->item);      for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next)
170      iterator= iterator->next;        if (tsymb->val != NULL)
171    }          gc_mark(tsymb->val);
172    
173    for(i= 0; i<HASHTBLSIZE; i++) {    if(env->interactive)
174      tsymb= env->symbols[i];      printf(".");
     while(tsymb!=NULL) {  
       gc_mark(tsymb->val);  
       tsymb= tsymb->next;  
     }  
   }  
175    
176    env->gc_count= 0;    env->gc_count= 0;
177    
178    /* Sweep */    while(env->gc_ref!=NULL) {    /* Sweep unused values */
179    while(env->gc_ref!=NULL) {      if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */
180    
181      if(env->gc_ref->item->gc_garb) {        /* Remove content */
182        switch(env->gc_ref->item->type) {        switch(env->gc_ref->item->type){
183        case string:        case string:
184          free(env->gc_ref->item->content.ptr);          free(env->gc_ref->item->content.string);
         break;  
       case integer:  
185          break;          break;
186        case list:        case tcons:
187          while(env->gc_ref->item->content.ptr!=NULL) {          free(env->gc_ref->item->content.c);
           titem= env->gc_ref->item->content.ptr;  
           env->gc_ref->item->content.ptr= titem->next;  
           free(titem);  
         }  
188          break;          break;
189        default:        case port:
190          case empty:
191          case unknown:
192          case integer:
193          case tfloat:
194          case func:
195          case symb:
196            /* Symbol strings are freed when walking the hash table */
197          break;          break;
198        }        }
199        free(env->gc_ref->item);  
200        titem= env->gc_ref->next;        free(env->gc_ref->item);  /* Remove from gc_ref */
       free(env->gc_ref);  
       env->gc_ref= titem;  
     } else {  
201        titem= env->gc_ref->next;        titem= env->gc_ref->next;
202        env->gc_ref->next= new_head;        free(env->gc_ref);        /* Remove value */
       new_head= env->gc_ref;  
203        env->gc_ref= titem;        env->gc_ref= titem;
204        env->gc_count++;        continue;
205        }
206    
207    #ifdef DEBUG
208        printf("Kept value (%p)", env->gc_ref->item);
209        if(env->gc_ref->item->gc.flag.mark)
210          printf(" (marked)");
211        if(env->gc_ref->item->gc.flag.protect)
212          printf(" (protected)");
213        switch(env->gc_ref->item->type){
214        case integer:
215          printf(" integer: %d", env->gc_ref->item->content.i);
216          break;
217        case func:
218          printf(" func: %p", env->gc_ref->item->content.func);
219          break;
220        case symb:
221          printf(" symb: %s", env->gc_ref->item->content.sym->id);
222          break;
223        case tcons:
224          printf(" tcons: %p\t%p", CAR(env->gc_ref->item),
225                 CDR(env->gc_ref->item));
226          break;
227        default:
228          printf(" <unknown %d>", (env->gc_ref->item->type));
229      }      }
230        printf("\n");
231    #endif /* DEBUG */
232    
233        /* Keep values */    
234        env->gc_count += sizeof(value);
235        if(env->gc_ref->item->type==string)
236          env->gc_count += strlen(env->gc_ref->item->content.string)+1;
237        
238        titem= env->gc_ref->next;
239        env->gc_ref->next= new_head;
240        new_head= env->gc_ref;
241        new_head->item->gc.flag.mark= 0;
242        env->gc_ref= titem;
243    }    }
244    
245    env->gc_limit= env->gc_count*2;    if (env->gc_limit < env->gc_count*2)
246        env->gc_limit= env->gc_count*2;
247    
248    env->gc_ref= new_head;    env->gc_ref= new_head;
249    
250      if(env->interactive)
251        printf("done (%d bytes still allocated)\n", env->gc_count);
252    
253  }  }
254    
255  void protect(environment *env, value *val)  
256    inline void gc_maybe(environment *env)
257  {  {
258    stackitem *new_item= malloc(sizeof(stackitem));    if(env->gc_count < env->gc_limit)
259    new_item->item= val;      return;
260    new_item->next= env->gc_protect;    else
261    env->gc_protect= new_item;      return gc_init(env);
262  }  }
263    
264  void unprotect(environment *env)  
265    /* Protect values from GC */
266    void protect(value *val)
267  {  {
268    stackitem *temp= env->gc_protect;    if(val==NULL || val->gc.flag.protect)
269    env->gc_protect= env->gc_protect->next;      return;
270    free(temp);  
271      val->gc.flag.protect= 1;
272    
273      if(val->type==tcons) {
274        protect(CAR(val));
275        protect(CDR(val));
276      }
277  }  }
278    
279    
280    /* Unprotect values from GC */
281    void unprotect(value *val)
282    {
283      if(val==NULL || !(val->gc.flag.protect))
284        return;
285    
286      val->gc.flag.protect= 0;
287    
288      if(val->type==tcons) {
289        unprotect(CAR(val));
290        unprotect(CDR(val));
291      }
292    }
293    
294    
295  /* Push a value onto the stack */  /* Push a value onto the stack */
296  void push_val(environment *env, value *val)  void push_val(environment *env, value *val)
297  {  {
298    stackitem *new_item= malloc(sizeof(stackitem));    value *new_value= new_val(env);
299    new_item->item= val;  
300    new_item->next= env->head;    new_value->content.c= malloc(sizeof(pair));
301    env->head= new_item;    assert(new_value->content.c!=NULL);
302      env->gc_count += sizeof(pair);
303      new_value->type= tcons;
304      CAR(new_value)= val;
305      CDR(new_value)= env->head;
306      env->head= new_value;
307  }  }
308    
309  /* Push an integer onto the stack. */  
310    /* Push an integer onto the stack */
311  void push_int(environment *env, int in_val)  void push_int(environment *env, int in_val)
312  {  {
313    value *new_value= new_val(env);    value *new_value= new_val(env);
314        
315    new_value->content.val= in_val;    new_value->content.i= in_val;
316    new_value->type= integer;    new_value->type= integer;
317    
318    push_val(env, new_value);    push_val(env, new_value);
319  }  }
320    
321    
322    /* Push a floating point number onto the stack */
323    void push_float(environment *env, float in_val)
324    {
325      value *new_value= new_val(env);
326    
327      new_value->content.f= in_val;
328      new_value->type= tfloat;
329    
330      push_val(env, new_value);
331    }
332    
333    
334  /* Copy a string onto the stack. */  /* Copy a string onto the stack. */
335  void push_cstring(environment *env, const char *in_string)  void push_cstring(environment *env, const char *in_string)
336  {  {
337    value *new_value= new_val(env);    value *new_value= new_val(env);
338      int length= strlen(in_string)+1;
339    
340    new_value->content.ptr= malloc(strlen(in_string)+1);    new_value->content.string= malloc(length);
341    strcpy(new_value->content.ptr, in_string);    assert(new_value != NULL);
342      env->gc_count += length;
343      strcpy(new_value->content.string, in_string);
344    new_value->type= string;    new_value->type= string;
345    
346    push_val(env, new_value);    push_val(env, new_value);
347  }  }
348    
349    
350  /* Mangle a symbol name to a valid C identifier name */  /* Mangle a symbol name to a valid C identifier name */
351  char *mangle_str(const char *old_string){  char *mangle_str(const char *old_string)
352    {
353    char validchars[]= "0123456789abcdef";    char validchars[]= "0123456789abcdef";
354    char *new_string, *current;    char *new_string, *current;
355    
356    new_string= malloc((strlen(old_string)*2)+4);    new_string= malloc((strlen(old_string)*2)+4);
357      assert(new_string != NULL);
358    strcpy(new_string, "sx_");    /* Stack eXternal */    strcpy(new_string, "sx_");    /* Stack eXternal */
359    current= new_string+3;    current= new_string+3;
360    
361    while(old_string[0] != '\0'){    while(old_string[0] != '\0'){
362      current[0]= validchars[(unsigned char)(old_string[0])/16];      current[0]= validchars[(unsigned char)(old_string[0])/16];
363      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 369  char *mangle_str(const char *old_string)
369    return new_string;            /* The caller must free() it */    return new_string;            /* The caller must free() it */
370  }  }
371    
 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);  
 }  
372    
373  /* Push a symbol onto the stack. */  /* Push a symbol onto the stack. */
374  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 386  void push_sym(environment *env, const ch
386    char *mangled;                /* Mangled function name */    char *mangled;                /* Mangled function name */
387    
388    new_value= new_val(env);    new_value= new_val(env);
389      new_fvalue= new_val(env);
390    
391    /* The new value is a symbol */    /* The new value is a symbol */
392    new_value->type= symb;    new_value->type= symb;
393    
394    /* Look up the symbol name in the hash table */    /* Look up the symbol name in the hash table */
395    new_symbol= hash(env->symbols, in_string);    new_symbol= hash(env->symbols, in_string);
396    new_value->content.ptr= *new_symbol;    new_value->content.sym= *new_symbol;
397    
398    if(*new_symbol==NULL) { /* If symbol was undefined */    if(*new_symbol==NULL) { /* If symbol was undefined */
399    
400      /* Create a new symbol */      /* Create a new symbol */
401      (*new_symbol)= malloc(sizeof(symbol));      (*new_symbol)= malloc(sizeof(symbol));
402        assert((*new_symbol) != NULL);
403      (*new_symbol)->val= NULL;   /* undefined value */      (*new_symbol)->val= NULL;   /* undefined value */
404      (*new_symbol)->next= NULL;      (*new_symbol)->next= NULL;
405      (*new_symbol)->id= malloc(strlen(in_string)+1);      (*new_symbol)->id= malloc(strlen(in_string)+1);
406        assert((*new_symbol)->id != NULL);
407      strcpy((*new_symbol)->id, in_string);      strcpy((*new_symbol)->id, in_string);
408    
409      /* Intern the new symbol in the hash table */      /* Intern the new symbol in the hash table */
410      new_value->content.ptr= *new_symbol;      new_value->content.sym= *new_symbol;
411    
412      /* 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
413         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 416  void push_sym(environment *env, const ch
416    
417      mangled= mangle_str(in_string); /* mangle the name */      mangled= mangle_str(in_string); /* mangle the name */
418      funcptr= dlsym(handle, mangled); /* and try to find it */      funcptr= dlsym(handle, mangled); /* and try to find it */
419      free(mangled);  
420      dlerr= dlerror();      dlerr= dlerror();
421      if(dlerr != NULL) {         /* If no function was found */      if(dlerr != NULL) {         /* If no function was found */
422        funcptr= dlsym(handle, in_string); /* Get function pointer */        funcptr= dlsym(handle, in_string); /* Get function pointer */
423        dlerr= dlerror();        dlerr= dlerror();
424      }      }
425    
426      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 */  
427        new_fvalue->type= func;   /* The new value is a function pointer */        new_fvalue->type= func;   /* The new value is a function pointer */
428        new_fvalue->content.ptr= funcptr; /* Store function pointer */        new_fvalue->content.func= funcptr; /* Store function pointer */
429        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new        (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new
430                                           function value */                                           function value */
431      }      }
432    
433        free(mangled);
434    }    }
   push_val(env, new_value);  
 }  
435    
436  /* Print newline. */    push_val(env, new_value);
 extern void nl()  
 {  
   printf("\n");  
437  }  }
438    
 /* Gets the type of a value */  
 extern void type(environment *env){  
   int typenum;  
439    
440    if((env->head)==NULL) {  /* Print a value */
441      printerr("Too Few Arguments");  void print_val(environment *env, value *val, int noquote, stackitem *stack,
442      env->err=1;                 FILE *stream)
443      return;  {
444    }    stackitem *titem, *tstack;
445    typenum=env->head->item->type;    int depth;
446    toss(env);  
447    switch(typenum){    switch(val->type) {
448    case integer:    case empty:
449      push_sym(env, "integer");      if(fprintf(stream, "[]") < 0)
450      break;        env->err= 5;
451    case string:      break;
452      push_sym(env, "string");    case unknown:
453      break;      if(fprintf(stream, "UNKNOWN") < 0)
454    case symb:        env->err= 5;
     push_sym(env, "symbol");  
455      break;      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) {  
456    case integer:    case integer:
457      printf("%d", stack_head->item->content.val);      if(fprintf(stream, "%d", val->content.i) < 0)
458          env->err= 5;
459        break;
460      case tfloat:
461        if(fprintf(stream, "%f", val->content.f) < 0)
462          env->err= 5;
463      break;      break;
464    case string:    case string:
465      if(noquote)      if(noquote){
466        printf("%s", (char*)stack_head->item->content.ptr);        if(fprintf(stream, "%s", val->content.string) < 0)
467      else          env->err= 5;
468        printf("\"%s\"", (char*)stack_head->item->content.ptr);      } else {                    /* quote */
469          if(fprintf(stream, "\"%s\"", val->content.string) < 0)
470            env->err= 5;
471        }
472      break;      break;
473    case symb:    case symb:
474      printf("%s", ((symbol *)(stack_head->item->content.ptr))->id);      if(fprintf(stream, "%s", val->content.sym->id) < 0)
475          env->err= 5;
476      break;      break;
477    case func:    case func:
478      printf("#<function %p>", (funcp)(stack_head->item->content.ptr));      if(fprintf(stream, "#<function %p>", val->content.func) < 0)
479          env->err= 5;
480      break;      break;
481    case list:    case port:
482      /* A list is just a stack, so make stack_head point to it */      if(fprintf(stream, "#<port %p>", val->content.p) < 0)
483      stack_head=(stackitem *)(stack_head->item->content.ptr);        env->err= 5;
484      printf("[ ");      break;
485      while(stack_head != NULL) {    case tcons:
486        print_h(stack_head, noquote);      if(fprintf(stream, "[ ") < 0) {
487        printf(" ");        env->err= 5;
488        stack_head=stack_head->next;        return printerr(env);
489      }      }
490      printf("]");      tstack= stack;
491      break;  
492    }      do {
493  }        titem=malloc(sizeof(stackitem));
494          assert(titem != NULL);
495          titem->item=val;
496          titem->next=tstack;
497          tstack=titem;             /* Put it on the stack */
498          /* Search a stack of values being printed to see if we are already
499             printing this value */
500          titem=tstack;
501          depth=0;
502    
503          while(titem != NULL && titem->item != CAR(val)){
504            titem=titem->next;
505            depth++;
506          }
507    
508  extern void print_(environment *env) {        if(titem != NULL){        /* If we found it on the stack, */
509    if(env->head==NULL) {          if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */
510      printerr("Too Few Arguments");            env->err= 5;
511      env->err=1;            free(titem);
512      return;            return printerr(env);
513    }          }
514    print_h(env->head, 0);        } else {
515    nl();          print_val(env, CAR(val), noquote, tstack, stream);
516  }        }
517    
518  /* Prints the top element of the stack and then discards it. */        val= CDR(val);
519  extern void print(environment *env)        switch(val->type){
520  {        case empty:
521    print_(env);          break;
522    if(env->err) return;        case tcons:
523    toss(env);          /* Search a stack of values being printed to see if we are already
524  }             printing this value */
525            titem=tstack;
526            depth=0;
527    
528            while(titem != NULL && titem->item != val){
529              titem=titem->next;
530              depth++;
531            }
532            if(titem != NULL){      /* If we found it on the stack, */
533              if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */
534                env->err= 5;
535                printerr(env);
536                goto printval_end;
537              }
538            } else {
539              if(fprintf(stream, " ") < 0){
540                env->err= 5;
541                printerr(env);
542                goto printval_end;
543              }
544            }
545            break;
546          default:
547            if(fprintf(stream, " . ") < 0){ /* Improper list */
548              env->err= 5;
549              printerr(env);
550              goto printval_end;
551            }
552            print_val(env, val, noquote, tstack, stream);
553          }
554        } while(val->type == tcons && titem == NULL);
555    
556  extern void princ_(environment *env) {    printval_end:
   if(env->head==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
   print_h(env->head, 1);  
 }  
557    
558  /* Prints the top element of the stack and then discards it. */      titem=tstack;
559  extern void princ(environment *env)      while(titem != stack){
560  {        tstack=titem->next;
561    princ_(env);        free(titem);
562    if(env->err) return;        titem=tstack;
563    toss(env);      }
 }  
   
 /* Only to be called by function printstack. */  
 void print_st(stackitem *stack_head, long counter)  
 {  
   if(stack_head->next != NULL)  
     print_st(stack_head->next, counter+1);  
   printf("%ld: ", counter);  
   print_h(stack_head, 0);  
   nl();  
 }  
564    
565  /* Prints the stack. */      if(! (env->err)){
566  extern void printstack(environment *env)        if(fprintf(stream, " ]") < 0){
567  {          env->err= 5;
568    if(env->head == NULL) {        }
569      printf("Stack Empty\n");      }
570      return;      break;
571    }    }
572    print_st(env->head, 1);    
573      if(env->err)
574        return printerr(env);
575  }  }
576    
577    
578  /* Swap the two top elements on the stack. */  /* Swap the two top elements on the stack. */
579  extern void swap(environment *env)  extern void swap(environment *env)
580  {  {
581    stackitem *temp= env->head;    value *temp= env->head;
     
   if(env->head==NULL || env->head->next==NULL) {  
     printerr("Too Few Arguments");  
     env->err=1;  
     return;  
   }  
582    
583    env->head= env->head->next;    if(check_args(env, 2, unknown, unknown))
584    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;  
585        
586    if(env->head==NULL || env->head->next==NULL    env->head= CDR(env->head);
587        || env->head->next->next==NULL) {    CDR(temp)= CDR(env->head);
588      printerr("Too Few Arguments");    CDR(env->head)= temp;
589      env->err=1;  }
     return;  
   }  
590    
   env->head= env->head->next->next;  
   temp->next->next= env->head->next;  
   env->head->next= temp;  
 }  
591    
592  /* Recall a value from a symbol, if bound */  /* Recall a value from a symbol, if bound */
593  extern void rcl(environment *env)  extern void rcl(environment *env)
594  {  {
595    value *val;    value *val;
596    
597    if(env->head == NULL) {    if(check_args(env, 1, symb))
598      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;  
   }  
599    
600    val=((symbol *)(env->head->item->content.ptr))->val;    val= CAR(env->head)->content.sym->val;
601    if(val == NULL){    if(val == NULL){
602      printerr("Unbound Variable");      env->err= 3;
603      env->err=3;      return printerr(env);
     return;  
604    }    }
605    protect(env, val);  
606    toss(env);            /* toss the symbol */    push_val(env, val);           /* Return the symbol's bound value */
607      swap(env);
608    if(env->err) return;    if(env->err) return;
609    push_val(env, val); /* Return its bound value */    env->head= CDR(env->head);
   unprotect(env);  
610  }  }
611    
612    
613  /* 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
614     function value, and if it is, toss the symbol and execute the     function value, and if it is, toss the symbol and execute the
615     function. */     function. */
# Line 566  extern void eval(environment *env) Line 617  extern void eval(environment *env)
617  {  {
618    funcp in_func;    funcp in_func;
619    value* temp_val;    value* temp_val;
620    stackitem* iterator;    value* iterator;
621    
622   eval_start:   eval_start:
623    
624    if(env->head==NULL) {    gc_maybe(env);
625      printerr("Too Few Arguments");  
626      env->err=1;    if(check_args(env, 1, unknown))
627      return;      return printerr(env);
   }  
628    
629    switch(env->head->item->type) {    switch(CAR(env->head)->type) {
630      /* if it's a symbol */      /* if it's a symbol */
631    case symb:    case symb:
632        env->errsymb= CAR(env->head)->content.sym->id;
633      rcl(env);                   /* get its contents */      rcl(env);                   /* get its contents */
634      if(env->err) return;      if(env->err) return;
635      if(env->head->item->type!=symb){ /* don't recurse symbols */      if(CAR(env->head)->type!=symb){ /* don't recurse symbols */
636        goto eval_start;        goto eval_start;
637      }      }
638      return;      return;
639    
640      /* If it's a lone function value, run it */      /* If it's a lone function value, run it */
641    case func:    case func:
642      in_func= (funcp)(env->head->item->content.ptr);      in_func= CAR(env->head)->content.func;
643      toss(env);      env->head= CDR(env->head);
644      if(env->err) return;      return in_func((void*)env);
     return in_func(env);  
645    
646      /* If it's a list */      /* If it's a list */
647    case list:    case tcons:
648      temp_val= env->head->item;      temp_val= CAR(env->head);
649      protect(env, temp_val);      protect(temp_val);
650      toss(env);  
651      if(env->err) return;      env->head= CDR(env->head);
652      iterator= (stackitem*)temp_val->content.ptr;      iterator= temp_val;
     unprotect(env);  
653            
654      while(iterator!=NULL) {      while(iterator->type != empty) {
655        push_val(env, iterator->item);        push_val(env, CAR(iterator));
656                
657        if(env->head->item->type==symb       if(CAR(env->head)->type==symb
658          && strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) {           && CAR(env->head)->content.sym->id[0]==';') {
659          toss(env);          env->head= CDR(env->head);
         if(env->err) return;  
660                    
661          if(iterator->next == NULL){          if(CDR(iterator)->type == empty){
662            goto eval_start;            goto eval_start;
663          }          }
664          eval(env);          eval(env);
665          if(env->err) return;          if(env->err) return;
666        }        }
667        iterator= iterator->next;        if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons)
668            iterator= CDR(iterator);
669          else {
670            env->err= 2; /* Improper list */
671            return printerr(env);
672          }
673      }      }
674        unprotect(temp_val);
675      return;      return;
676    
677    default:    case empty:
678      return;      env->head= CDR(env->head);
679    }    case integer:
680  }    case tfloat:
681      case string:
682  /* Reverse (flip) a list */    case port:
683  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;  
684      return;      return;
685    }    }
   
   /* 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);  
 }  
   
 /* Clear stack */  
 extern void clear(environment *env)  
 {  
   while(env->head!=NULL)  
     toss(env);  
686  }  }
687    
 /* 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;  
     }  
   }  
 }  
688    
689  /* Internal forget function */  /* Internal forget function */
690  void forget_sym(symbol **hash_entry) {  void forget_sym(symbol **hash_entry)
691    {
692    symbol *temp;    symbol *temp;
693    
694    temp= *hash_entry;    temp= *hash_entry;
# Line 864  void forget_sym(symbol **hash_entry) { Line 698  void forget_sym(symbol **hash_entry) {
698    free(temp);    free(temp);
699  }  }
700    
 /* 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);  
 }  
701    
702  int main(int argc, char **argv)  int main(int argc, char **argv)
703  {  {
704    environment myenv;    environment myenv;
   
705    int c;                        /* getopt option character */    int c;                        /* getopt option character */
706    
707    #ifdef __linux__
708    mtrace();    mtrace();
709    #endif
710    
711    init_env(&myenv);    init_env(&myenv);
712    
# Line 913  int main(int argc, char **argv) Line 720  int main(int argc, char **argv)
720          break;          break;
721        case '?':        case '?':
722          fprintf (stderr,          fprintf (stderr,
723                   "Unknown option character `\\x%x'.\n",                   "Unknown option character '\\x%x'.\n",
724                   optopt);                   optopt);
725          return EX_USAGE;          return EX_USAGE;
726        default:        default:
# Line 929  int main(int argc, char **argv) Line 736  int main(int argc, char **argv)
736      }      }
737    }    }
738    
739    if(myenv.interactive) {    if(myenv.interactive)
740      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");  
   }  
741    
742    while(1) {    while(1) {
743      if(myenv.in_string==NULL) {      if(myenv.in_string==NULL) {
744        if (myenv.interactive) {        if (myenv.interactive) {
745          if(myenv.err) {          if(myenv.err) {
746            printf("(error %d)\n", myenv.err);            printf("(error %d)\n", myenv.err);
747              myenv.err= 0;
748          }          }
749          nl();          printf("\n");
750          printstack(&myenv);          printstack(&myenv);
751          printf("> ");          printf("> ");
752        }        }
753        myenv.err=0;        myenv.err=0;
754      }      }
755      sx_72656164(&myenv);      readstream(&myenv, myenv.inputstream);
756      if (myenv.err==4) {      if (myenv.err) {            /* EOF or other error */
757        return EXIT_SUCCESS;      /* EOF */        myenv.err=0;
758      } else if(myenv.head!=NULL        quit(&myenv);
759                && myenv.head->item->type==symb      } else if(myenv.head->type!=empty
760                && ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') {                && CAR(myenv.head)->type==symb
761        toss(&myenv);             /* No error check in main */                && CAR(myenv.head)->content.sym->id[0] == ';') {
762          if(myenv.head->type != empty)
763            myenv.head= CDR(myenv.head);
764        eval(&myenv);        eval(&myenv);
765        } else {
766          gc_maybe(&myenv);
767      }      }
     gc_init(&myenv);  
768    }    }
769    quit(&myenv);    quit(&myenv);
770    return EXIT_FAILURE;    return EXIT_FAILURE;
771  }  }
772    
 /* "+" */  
 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);  
 }  
773    
774  /* Return copy of a value */  /* Return copy of a value */
775  value *copy_val(environment *env, value *old_value){  value *copy_val(environment *env, value *old_value)
776    stackitem *old_item, *new_item, *prev_item;  {
777      value *new_value;
778    
779    value *new_value= new_val(env);    if(old_value==NULL)
780        return NULL;
781    
782    protect(env, old_value);    new_value= new_val(env);
783    new_value->type= old_value->type;    new_value->type= old_value->type;
784    
785    switch(old_value->type){    switch(old_value->type){
786      case tfloat:
787    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;  
788    case func:    case func:
789    case symb:    case symb:
790      new_value->content.ptr= old_value->content.ptr;    case empty:
791      case unknown:
792      case port:
793        new_value->content= old_value->content;
794        break;
795      case string:
796        new_value->content.string= strdup(old_value->content.string);
797      break;      break;
798    case list:    case tcons:
     new_value->content.ptr= NULL;  
799    
800      prev_item= NULL;      new_value->content.c= malloc(sizeof(pair));
801      old_item= (stackitem*)(old_value->content.ptr);      assert(new_value->content.c!=NULL);
802        env->gc_count += sizeof(pair);
803    
804      while(old_item != NULL) {   /* While list is not empty */      CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */
805        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;  
     }      
806      break;      break;
807    }    }
808    
   unprotect(env);  
   
809    return new_value;    return new_value;
810  }  }
811    
 /* "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;  
812    
813    if((env->head)==NULL || env->head->next==NULL) {  /* read a line from a stream; used by readline */
814      printerr("Too Few Arguments");  void readlinestream(environment *env, FILE *stream)
815      env->err= 1;  {
816      return;    char in_string[101];
   }  
817    
818    if(env->head->next->item->type != integer) {    if(fgets(in_string, 100, stream)==NULL) {
819      printerr("Bad Argument Type");      push_cstring(env, "");
820      env->err=2;      if (! feof(stream)){
821      return;        env->err= 5;
822          return printerr(env);
823        }
824      } else {
825        push_cstring(env, in_string);
826    }    }
     
   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);  
827  }  }
828    
 /* 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;  
   }  
829    
830    if(env->head->next->next->item->type != integer) {  /* Reverse (flip) a list */
831      printerr("Bad Argument Type");  extern void rev(environment *env)
832      env->err=2;  {
833      return;    value *old_head, *new_head, *item;
   }  
     
   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;  
   
   eval(env);  
 }  
834    
835  /* "while" */    if(CAR(env->head)->type==empty)
836  extern void sx_7768696c65(environment *env) {      return;                     /* Don't reverse an empty list */
837    
838    int truth;    if(check_args(env, 1, tcons))
839    value *loop, *test;      return printerr(env);
840    
841    if((env->head)==NULL || env->head->next==NULL) {    old_head= CAR(env->head);
842      printerr("Too Few Arguments");    new_head= new_val(env);
843      env->err=1;    while(old_head->type != empty) {
844      return;      item= old_head;
845        old_head= CDR(old_head);
846        CDR(item)= new_head;
847        new_head= item;
848    }    }
849      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);  
850  }  }
851    
852    
853  /* "for"; for-loop */  /* Make a list. */
854  extern void sx_666f72(environment *env) {  extern void pack(environment *env)
855    value *loop;  {
856    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;  
   }  
857    
858    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;  
   }  
859    
860    loop= env->head->item;    iterator= env->head;
861    protect(env, loop);    if(iterator->type == empty
862    toss(env); if(env->err) return;       || (CAR(iterator)->type==symb
863         && CAR(iterator)->content.sym->id[0]=='[')) {
864    foo2= env->head->item->content.val;      temp= ending;
865    toss(env); if(env->err) return;      if(env->head->type != empty)
866          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++;  
     }  
867    } else {    } else {
868      while(foo1>=foo2) {      /* Search for first delimiter */
869        push_int(env, foo1);      while(CDR(iterator)->type != empty
870        push_val(env, loop);            && (CAR(CDR(iterator))->type!=symb
871        eval(env); if(env->err) return;             || CAR(CDR(iterator))->content.sym->id[0]!='['))
872        foo1--;        iterator= CDR(iterator);
873      }      
874    }      /* Extract list */
875    unprotect(env);      temp= env->head;
876  }      env->head= CDR(iterator);
877        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;  
   }  
878    
879    if(env->head->item->type!=integer      if(env->head->type != empty)
880       || env->head->next->item->type!=integer) {        env->head= CDR(env->head);
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
881    }    }
882    
883    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);  
   }  
884    
885    temp_val= new_val(env);    push_val(env, temp);
886    temp_val->content.ptr= env->head;    rev(env);
   temp_val->type= list;  
   env->head= temp_head;  
   push_val(env, temp_val);  
887  }  }
888    
 /* 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);  
 }  
889    
890  /* "read"; Read a value and place on stack */  /* read from a stream; used by "read" and "readport" */
891  extern void sx_72656164(environment *env) {  void readstream(environment *env, FILE *stream)
892    {
893    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";    const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n";
894    const char strform[]= "\"%[^\"]\"%n";    const char strform[]= "\"%[^\"]\"%n";
895    const char intform[]= "%i%n";    const char intform[]= "%i%n";
896      const char fltform[]= "%f%n";
897    const char blankform[]= "%*[ \t]%n";    const char blankform[]= "%*[ \t]%n";
898    const char ebrackform[]= "]%n";    const char ebrackform[]= "]%n";
899    const char semicform[]= ";%n";    const char semicform[]= ";%n";
900    const char bbrackform[]= "[%n";    const char bbrackform[]= "[%n";
901    
902    int itemp, readlength= -1;    int itemp, readlength= -1;
903      int count= -1;
904      float ftemp;
905    static int depth= 0;    static int depth= 0;
906    char *match;    char *match;
907    size_t inlength;    size_t inlength;
# Line 1381  extern void sx_72656164(environment *env Line 910  extern void sx_72656164(environment *env
910      if(depth > 0 && env->interactive) {      if(depth > 0 && env->interactive) {
911        printf("]> ");        printf("]> ");
912      }      }
913      readline(env); if(env->err) return;      readlinestream(env, env->inputstream);
914        if(env->err) return;
915    
916      if(((char *)(env->head->item->content.ptr))[0]=='\0'){      if((CAR(env->head)->content.string)[0]=='\0'){
917        env->err= 4;              /* "" means EOF */        env->err= 4;              /* "" means EOF */
918        return;        return;
919      }      }
920            
921      env->in_string= malloc(strlen(env->head->item->content.ptr)+1);      env->in_string= malloc(strlen(CAR(env->head)->content.string)+1);
922        assert(env->in_string != NULL);
923      env->free_string= env->in_string; /* Save the original pointer */      env->free_string= env->in_string; /* Save the original pointer */
924      strcpy(env->in_string, env->head->item->content.ptr);      strcpy(env->in_string, CAR(env->head)->content.string);
925      toss(env); if(env->err) return;      env->head= CDR(env->head);
926    }    }
927        
928    inlength= strlen(env->in_string)+1;    inlength= strlen(env->in_string)+1;
929    match= malloc(inlength);    match= malloc(inlength);
930      assert(match != NULL);
931    
932    if(sscanf(env->in_string, blankform, &readlength)!=EOF    if(sscanf(env->in_string, blankform, &readlength) != EOF
933       && readlength != -1) {       && readlength != -1) {
934      ;      ;
935    } else if(sscanf(env->in_string, intform, &itemp, &readlength) != EOF    } else if(sscanf(env->in_string, fltform, &ftemp, &readlength) != EOF
936                && readlength != -1) {
937        if(sscanf(env->in_string, intform, &itemp, &count) != EOF
938           && count==readlength) {
939          push_int(env, itemp);
940        } else {
941          push_float(env, ftemp);
942        }
943      } else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF
944              && readlength != -1) {              && readlength != -1) {
945      push_int(env, itemp);      push_cstring(env, "");
946    } else if(sscanf(env->in_string, strform, match, &readlength) != EOF    } else if(sscanf(env->in_string, strform, match, &readlength) != EOF
947              && readlength != -1) {              && readlength != -1) {
948      push_cstring(env, match);      push_cstring(env, match);
# Line 1424  extern void sx_72656164(environment *env Line 964  extern void sx_72656164(environment *env
964      free(env->free_string);      free(env->free_string);
965      env->in_string = env->free_string = NULL;      env->in_string = env->free_string = NULL;
966    }    }
967    if ( env->in_string != NULL) {    if (env->in_string != NULL) {
968      env->in_string += readlength;      env->in_string += readlength;
969    }    }
970    
971    free(match);    free(match);
972    
973    if(depth)    if(depth)
974      return sx_72656164(env);      return readstream(env, env->inputstream);
975  }  }
976    
 extern void beep(environment *env) {  
977    
978    int freq, dur, period, ticks;  int check_args(environment *env, int num_args, ...)
979    {
980    if((env->head)==NULL || env->head->next==NULL) {    va_list ap;
981      printerr("Too Few Arguments");    enum type_enum mytype;
982      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; */  
983    
984    /*  if (ioctl(STDOUT_FILENO, KDMKTONE, (125<<16) + 0x637)==0) */    value *iter= env->head;
985    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();  
   }  
 };  
986    
987  /* "wait" */    va_start(ap, num_args);
988  extern void sx_77616974(environment *env) {    for(i=1; i<=num_args; i++) {
989        mytype= va_arg(ap, enum type_enum);
990        //    fprintf(stderr, "%s\n", env->errsymb);
991    
992    int dur;      if(iter->type==empty || iter==NULL) {
993          errval= 1;
994          break;
995        }
996    
997    if((env->head)==NULL) {      if(mytype!=unknown && CAR(iter)->type!=mytype) {
998      printerr("Too Few Arguments");        errval= 2;
999      env->err=1;        break;
1000      return;      }
   }  
1001    
1002    if(env->head->item->type!=integer) {      iter= CDR(iter);
     printerr("Bad Argument Type");  
     env->err=2;  
     return;  
1003    }    }
1004    
1005    dur=env->head->item->content.val;    va_end(ap);
   toss(env);  
   
   usleep(dur);  
 };  
1006    
1007  extern void copying(environment *env){    env->err= errval;
1008    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");  
1009  }  }
Legend:
Removed from v.1.91  
changed lines
  Added in v.1.136
root@recompile.se
 ViewVC Help
Powered by ViewVC 1.1.26