| 15 |
/* mtrace, muntrace */ |
/* mtrace, muntrace */ |
| 16 |
#include <mcheck.h> |
#include <mcheck.h> |
| 17 |
|
|
| 18 |
#define HASHTBLSIZE 2048 |
#include "stack.h" |
|
|
|
|
/* First, define some types. */ |
|
|
|
|
|
/* A value of some type */ |
|
|
typedef struct { |
|
|
enum { |
|
|
integer, |
|
|
string, |
|
|
func, /* Function pointer */ |
|
|
symb, |
|
|
list |
|
|
} type; /* Type of stack element */ |
|
|
|
|
|
union { |
|
|
void *ptr; /* Pointer to the content */ |
|
|
int val; /* ...or an integer */ |
|
|
} content; /* Stores a pointer or an integer */ |
|
|
|
|
|
int refcount; /* Reference counter */ |
|
|
|
|
|
} value; |
|
|
|
|
|
/* A symbol with a name and possible value */ |
|
|
/* (These do not need reference counters, they are kept unique by |
|
|
hashing.) */ |
|
|
typedef struct symbol_struct { |
|
|
char *id; /* Symbol name */ |
|
|
value *val; /* The value (if any) bound to it */ |
|
|
struct symbol_struct *next; /* In case of hashing conflicts, a */ |
|
|
} symbol; /* symbol is a kind of stack item. */ |
|
|
|
|
|
/* A type for a hash table for symbols */ |
|
|
typedef symbol *hashtbl[HASHTBLSIZE]; /* Hash table declaration */ |
|
|
|
|
|
/* An item (value) on a stack */ |
|
|
typedef struct stackitem_struct |
|
|
{ |
|
|
value *item; /* The value on the stack */ |
|
|
/* (This is never NULL) */ |
|
|
struct stackitem_struct *next; /* Next item */ |
|
|
} stackitem; |
|
|
|
|
|
/* An environment; gives access to the stack and a hash table of |
|
|
defined symbols */ |
|
|
typedef struct { |
|
|
stackitem *head; /* Head of the stack */ |
|
|
hashtbl symbols; /* Hash table of all variable bindings */ |
|
|
int err; /* Error flag */ |
|
|
char *in_string; /* Input pending to be read */ |
|
|
char *free_string; /* Free this string when all input is |
|
|
read from in_string */ |
|
|
FILE *inputstream; /* stdin or a file, most likely */ |
|
|
int interactive; /* print prompts, stack, etc */ |
|
|
} environment; |
|
|
|
|
|
/* A type for pointers to external functions */ |
|
|
typedef void (*funcp)(environment *); /* funcp is a pointer to a void |
|
|
function (environment *) */ |
|
| 19 |
|
|
| 20 |
/* Initialize a newly created environment */ |
/* Initialize a newly created environment */ |
| 21 |
void init_env(environment *env) |
void init_env(environment *env) |
| 22 |
{ |
{ |
| 23 |
int i; |
int i; |
| 24 |
|
|
| 25 |
|
env->gc_limit= 20; |
| 26 |
|
env->gc_count= 0; |
| 27 |
|
env->gc_ref= NULL; |
| 28 |
|
env->gc_protect= NULL; |
| 29 |
|
|
| 30 |
env->head= NULL; |
env->head= NULL; |
| 31 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
| 32 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
| 41 |
fprintf(stderr, "Err: %s\n", in_string); |
fprintf(stderr, "Err: %s\n", in_string); |
| 42 |
} |
} |
| 43 |
|
|
|
/* Throw away a value */ |
|
|
void free_val(value *val){ |
|
|
stackitem *item, *temp; |
|
|
|
|
|
val->refcount--; /* Decrease the reference count */ |
|
|
if(val->refcount == 0){ |
|
|
switch (val->type){ /* and free the contents if necessary */ |
|
|
case string: |
|
|
free(val->content.ptr); |
|
|
break; |
|
|
case list: /* lists needs to be freed recursively */ |
|
|
item=val->content.ptr; |
|
|
while(item != NULL) { /* for all stack items */ |
|
|
free_val(item->item); /* free the value */ |
|
|
temp=item->next; /* save next ptr */ |
|
|
free(item); /* free the stackitem */ |
|
|
item=temp; /* go to next stackitem */ |
|
|
} |
|
|
break; |
|
|
case integer: |
|
|
case func: |
|
|
break; |
|
|
case symb: |
|
|
free(((symbol*)(val->content.ptr))->id); |
|
|
if(((symbol*)(val->content.ptr))->val!=NULL) |
|
|
free_val(((symbol*)(val->content.ptr))->val); |
|
|
free(val->content.ptr); |
|
|
break; |
|
|
} |
|
|
free(val); /* Free the actual value structure */ |
|
|
} |
|
|
} |
|
|
|
|
| 44 |
/* Discard the top element of the stack. */ |
/* Discard the top element of the stack. */ |
| 45 |
extern void toss(environment *env) |
extern void toss(environment *env) |
| 46 |
{ |
{ |
| 48 |
|
|
| 49 |
if((env->head)==NULL) { |
if((env->head)==NULL) { |
| 50 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 51 |
env->err=1; |
env->err= 1; |
| 52 |
return; |
return; |
| 53 |
} |
} |
| 54 |
|
|
|
free_val(env->head->item); /* Free the value */ |
|
| 55 |
env->head= env->head->next; /* Remove the top stack item */ |
env->head= env->head->next; /* Remove the top stack item */ |
| 56 |
free(temp); /* Free the old top stack item */ |
free(temp); /* Free the old top stack item */ |
| 57 |
|
|
| 58 |
|
gc_init(env); |
| 59 |
} |
} |
| 60 |
|
|
| 61 |
/* 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. */ |
| 87 |
} |
} |
| 88 |
} |
} |
| 89 |
|
|
| 90 |
|
value* new_val(environment *env) { |
| 91 |
|
value *nval= malloc(sizeof(value)); |
| 92 |
|
stackitem *nitem= malloc(sizeof(stackitem)); |
| 93 |
|
|
| 94 |
|
nval->content.ptr= NULL; |
| 95 |
|
protect(env, nval); |
| 96 |
|
|
| 97 |
|
gc_init(env); |
| 98 |
|
|
| 99 |
|
nitem->item= nval; |
| 100 |
|
nitem->next= env->gc_ref; |
| 101 |
|
env->gc_ref= nitem; |
| 102 |
|
|
| 103 |
|
env->gc_count++; |
| 104 |
|
unprotect(env); |
| 105 |
|
|
| 106 |
|
return nval; |
| 107 |
|
} |
| 108 |
|
|
| 109 |
|
void gc_mark(value *val) { |
| 110 |
|
stackitem *iterator; |
| 111 |
|
|
| 112 |
|
if(val==NULL || val->gc_garb==0) |
| 113 |
|
return; |
| 114 |
|
|
| 115 |
|
val->gc_garb= 0; |
| 116 |
|
|
| 117 |
|
if(val->type==list) { |
| 118 |
|
iterator= val->content.ptr; |
| 119 |
|
|
| 120 |
|
while(iterator!=NULL) { |
| 121 |
|
gc_mark(iterator->item); |
| 122 |
|
iterator= iterator->next; |
| 123 |
|
} |
| 124 |
|
} |
| 125 |
|
} |
| 126 |
|
|
| 127 |
|
extern void gc_init(environment *env) { |
| 128 |
|
stackitem *new_head= NULL, *titem, *iterator= env->gc_ref; |
| 129 |
|
symbol *tsymb; |
| 130 |
|
int i; |
| 131 |
|
|
| 132 |
|
if(env->gc_count < env->gc_limit) |
| 133 |
|
return; |
| 134 |
|
|
| 135 |
|
while(iterator!=NULL) { |
| 136 |
|
iterator->item->gc_garb= 1; |
| 137 |
|
iterator= iterator->next; |
| 138 |
|
} |
| 139 |
|
|
| 140 |
|
/* Mark */ |
| 141 |
|
iterator= env->gc_protect; |
| 142 |
|
while(iterator!=NULL) { |
| 143 |
|
gc_mark(iterator->item); |
| 144 |
|
iterator= iterator->next; |
| 145 |
|
} |
| 146 |
|
|
| 147 |
|
iterator= env->head; |
| 148 |
|
while(iterator!=NULL) { |
| 149 |
|
gc_mark(iterator->item); |
| 150 |
|
iterator= iterator->next; |
| 151 |
|
} |
| 152 |
|
|
| 153 |
|
for(i= 0; i<HASHTBLSIZE; i++) { |
| 154 |
|
tsymb= env->symbols[i]; |
| 155 |
|
while(tsymb!=NULL) { |
| 156 |
|
gc_mark(tsymb->val); |
| 157 |
|
tsymb= tsymb->next; |
| 158 |
|
} |
| 159 |
|
} |
| 160 |
|
|
| 161 |
|
env->gc_count= 0; |
| 162 |
|
|
| 163 |
|
/* Sweep */ |
| 164 |
|
while(env->gc_ref!=NULL) { |
| 165 |
|
|
| 166 |
|
if(env->gc_ref->item->gc_garb) { |
| 167 |
|
switch(env->gc_ref->item->type) { |
| 168 |
|
case string: |
| 169 |
|
free(env->gc_ref->item->content.ptr); |
| 170 |
|
break; |
| 171 |
|
case integer: |
| 172 |
|
break; |
| 173 |
|
case list: |
| 174 |
|
while(env->gc_ref->item->content.ptr!=NULL) { |
| 175 |
|
titem= env->gc_ref->item->content.ptr; |
| 176 |
|
env->gc_ref->item->content.ptr= titem->next; |
| 177 |
|
free(titem); |
| 178 |
|
} |
| 179 |
|
break; |
| 180 |
|
default: |
| 181 |
|
break; |
| 182 |
|
} |
| 183 |
|
free(env->gc_ref->item); |
| 184 |
|
titem= env->gc_ref->next; |
| 185 |
|
free(env->gc_ref); |
| 186 |
|
env->gc_ref= titem; |
| 187 |
|
} else { |
| 188 |
|
titem= env->gc_ref->next; |
| 189 |
|
env->gc_ref->next= new_head; |
| 190 |
|
new_head= env->gc_ref; |
| 191 |
|
env->gc_ref= titem; |
| 192 |
|
env->gc_count++; |
| 193 |
|
} |
| 194 |
|
} |
| 195 |
|
|
| 196 |
|
env->gc_limit= env->gc_count*2; |
| 197 |
|
env->gc_ref= new_head; |
| 198 |
|
} |
| 199 |
|
|
| 200 |
|
void protect(environment *env, value *val) |
| 201 |
|
{ |
| 202 |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
| 203 |
|
new_item->item= val; |
| 204 |
|
new_item->next= env->gc_protect; |
| 205 |
|
env->gc_protect= new_item; |
| 206 |
|
} |
| 207 |
|
|
| 208 |
|
void unprotect(environment *env) |
| 209 |
|
{ |
| 210 |
|
stackitem *temp= env->gc_protect; |
| 211 |
|
env->gc_protect= env->gc_protect->next; |
| 212 |
|
free(temp); |
| 213 |
|
} |
| 214 |
|
|
| 215 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
| 216 |
void push_val(environment *env, value *val) |
void push_val(environment *env, value *val) |
| 217 |
{ |
{ |
| 218 |
stackitem *new_item= malloc(sizeof(stackitem)); |
stackitem *new_item= malloc(sizeof(stackitem)); |
| 219 |
new_item->item= val; |
new_item->item= val; |
|
val->refcount++; |
|
| 220 |
new_item->next= env->head; |
new_item->next= env->head; |
| 221 |
env->head= new_item; |
env->head= new_item; |
| 222 |
} |
} |
| 224 |
/* Push an integer onto the stack. */ |
/* Push an integer onto the stack. */ |
| 225 |
void push_int(environment *env, int in_val) |
void push_int(environment *env, int in_val) |
| 226 |
{ |
{ |
| 227 |
value *new_value= malloc(sizeof(value)); |
value *new_value= new_val(env); |
| 228 |
|
|
| 229 |
new_value->content.val= in_val; |
new_value->content.val= in_val; |
| 230 |
new_value->type= integer; |
new_value->type= integer; |
|
new_value->refcount= 0; |
|
| 231 |
|
|
| 232 |
push_val(env, new_value); |
push_val(env, new_value); |
| 233 |
} |
} |
| 235 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
| 236 |
void push_cstring(environment *env, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
| 237 |
{ |
{ |
| 238 |
value *new_value= malloc(sizeof(value)); |
value *new_value= new_val(env); |
| 239 |
|
|
| 240 |
new_value->content.ptr= malloc(strlen(in_string)+1); |
new_value->content.ptr= malloc(strlen(in_string)+1); |
| 241 |
strcpy(new_value->content.ptr, in_string); |
strcpy(new_value->content.ptr, in_string); |
| 242 |
new_value->type= string; |
new_value->type= string; |
|
new_value->refcount= 0; |
|
| 243 |
|
|
| 244 |
push_val(env, new_value); |
push_val(env, new_value); |
| 245 |
} |
} |
| 246 |
|
|
| 247 |
/* Mangle a symbol name to a valid C identifier name */ |
/* Mangle a symbol name to a valid C identifier name */ |
| 248 |
char *mangle_str(const char *old_string){ |
char *mangle_str(const char *old_string){ |
| 249 |
char validchars[] |
char validchars[]= "0123456789abcdef"; |
|
="0123456789abcdef"; |
|
| 250 |
char *new_string, *current; |
char *new_string, *current; |
| 251 |
|
|
| 252 |
new_string=malloc((strlen(old_string)*2)+4); |
new_string= malloc((strlen(old_string)*2)+4); |
| 253 |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
| 254 |
current=new_string+3; |
current= new_string+3; |
| 255 |
while(old_string[0] != '\0'){ |
while(old_string[0] != '\0'){ |
| 256 |
current[0]=validchars[(unsigned char)(old_string[0])/16]; |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
| 257 |
current[1]=validchars[(unsigned char)(old_string[0])%16]; |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
| 258 |
current+=2; |
current+= 2; |
| 259 |
old_string++; |
old_string++; |
| 260 |
} |
} |
| 261 |
current[0]='\0'; |
current[0]= '\0'; |
| 262 |
|
|
| 263 |
return new_string; /* The caller must free() it */ |
return new_string; /* The caller must free() it */ |
| 264 |
} |
} |
| 268 |
|
|
| 269 |
if((env->head)==NULL) { |
if((env->head)==NULL) { |
| 270 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 271 |
env->err=1; |
env->err= 1; |
| 272 |
return; |
return; |
| 273 |
} |
} |
| 274 |
|
|
| 275 |
if(env->head->item->type!=string) { |
if(env->head->item->type!=string) { |
| 276 |
printerr("Bad Argument Type"); |
printerr("Bad Argument Type"); |
| 277 |
env->err=2; |
env->err= 2; |
| 278 |
return; |
return; |
| 279 |
} |
} |
| 280 |
|
|
| 301 |
const char *dlerr; /* Dynamic linker error */ |
const char *dlerr; /* Dynamic linker error */ |
| 302 |
char *mangled; /* Mangled function name */ |
char *mangled; /* Mangled function name */ |
| 303 |
|
|
| 304 |
new_value= malloc(sizeof(value)); |
new_value= new_val(env); |
| 305 |
|
|
| 306 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
| 307 |
new_value->type= symb; |
new_value->type= symb; |
|
new_value->refcount= 1; |
|
| 308 |
|
|
| 309 |
/* Look up the symbol name in the hash table */ |
/* Look up the symbol name in the hash table */ |
| 310 |
new_symbol= hash(env->symbols, in_string); |
new_symbol= hash(env->symbols, in_string); |
| 327 |
if(handle==NULL) /* If no handle */ |
if(handle==NULL) /* If no handle */ |
| 328 |
handle= dlopen(NULL, RTLD_LAZY); |
handle= dlopen(NULL, RTLD_LAZY); |
| 329 |
|
|
| 330 |
mangled=mangle_str(in_string); /* mangle the name */ |
mangled= mangle_str(in_string); /* mangle the name */ |
| 331 |
funcptr= dlsym(handle, mangled); /* and try to find it */ |
funcptr= dlsym(handle, mangled); /* and try to find it */ |
| 332 |
free(mangled); |
free(mangled); |
| 333 |
dlerr=dlerror(); |
dlerr= dlerror(); |
| 334 |
if(dlerr != NULL) { /* If no function was found */ |
if(dlerr != NULL) { /* If no function was found */ |
| 335 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
| 336 |
dlerr=dlerror(); |
dlerr= dlerror(); |
| 337 |
} |
} |
| 338 |
if(dlerr==NULL) { /* If a function was found */ |
if(dlerr==NULL) { /* If a function was found */ |
| 339 |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
new_fvalue= new_val(env); /* Create a new value */ |
| 340 |
new_fvalue->type=func; /* The new value is a function pointer */ |
new_fvalue->type= func; /* The new value is a function pointer */ |
| 341 |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
new_fvalue->content.ptr= funcptr; /* Store function pointer */ |
| 342 |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
| 343 |
function value */ |
function value */ |
|
new_fvalue->refcount= 1; |
|
| 344 |
} |
} |
| 345 |
} |
} |
| 346 |
push_val(env, new_value); |
push_val(env, new_value); |
| 526 |
env->err=3; |
env->err=3; |
| 527 |
return; |
return; |
| 528 |
} |
} |
| 529 |
|
protect(env, val); |
| 530 |
toss(env); /* toss the symbol */ |
toss(env); /* toss the symbol */ |
| 531 |
if(env->err) return; |
if(env->err) return; |
| 532 |
push_val(env, val); /* Return its bound value */ |
push_val(env, val); /* Return its bound value */ |
| 533 |
|
unprotect(env); |
| 534 |
} |
} |
| 535 |
|
|
| 536 |
/* 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 |
| 565 |
in_func= (funcp)(env->head->item->content.ptr); |
in_func= (funcp)(env->head->item->content.ptr); |
| 566 |
toss(env); |
toss(env); |
| 567 |
if(env->err) return; |
if(env->err) return; |
| 568 |
return (*in_func)(env); |
return in_func(env); |
| 569 |
|
|
| 570 |
/* If it's a list */ |
/* If it's a list */ |
| 571 |
case list: |
case list: |
| 572 |
temp_val= env->head->item; |
temp_val= env->head->item; |
| 573 |
env->head->item->refcount++; |
protect(env, temp_val); |
| 574 |
toss(env); |
toss(env); |
| 575 |
if(env->err) return; |
if(env->err) return; |
| 576 |
iterator= (stackitem*)temp_val->content.ptr; |
iterator= (stackitem*)temp_val->content.ptr; |
| 577 |
|
unprotect(env); |
| 578 |
|
|
| 579 |
while(iterator!=NULL) { |
while(iterator!=NULL) { |
| 580 |
push_val(env, iterator->item); |
push_val(env, iterator->item); |
| 581 |
|
|
| 582 |
if(env->head->item->type==symb |
if(env->head->item->type==symb |
| 583 |
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
| 584 |
toss(env); |
toss(env); |
| 585 |
if(env->err) return; |
if(env->err) return; |
| 586 |
|
|
| 587 |
if(iterator->next == NULL){ |
if(iterator->next == NULL){ |
|
free_val(temp_val); |
|
| 588 |
goto eval_start; |
goto eval_start; |
| 589 |
} |
} |
| 590 |
eval(env); |
eval(env); |
| 592 |
} |
} |
| 593 |
iterator= iterator->next; |
iterator= iterator->next; |
| 594 |
} |
} |
|
free_val(temp_val); |
|
| 595 |
return; |
return; |
| 596 |
|
|
| 597 |
default: |
default: |
| 605 |
|
|
| 606 |
if((env->head)==NULL) { |
if((env->head)==NULL) { |
| 607 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 608 |
env->err=1; |
env->err= 1; |
| 609 |
return; |
return; |
| 610 |
} |
} |
| 611 |
|
|
| 612 |
if(env->head->item->type!=list) { |
if(env->head->item->type!=list) { |
| 613 |
printerr("Bad Argument Type"); |
printerr("Bad Argument Type"); |
| 614 |
env->err=2; |
env->err= 2; |
| 615 |
return; |
return; |
| 616 |
} |
} |
| 617 |
|
|
| 618 |
old_head=(stackitem *)(env->head->item->content.ptr); |
old_head= (stackitem *)(env->head->item->content.ptr); |
| 619 |
new_head=NULL; |
new_head= NULL; |
| 620 |
while(old_head != NULL){ |
while(old_head != NULL){ |
| 621 |
item=old_head; |
item= old_head; |
| 622 |
old_head=old_head->next; |
old_head= old_head->next; |
| 623 |
item->next=new_head; |
item->next= new_head; |
| 624 |
new_head=item; |
new_head= item; |
| 625 |
} |
} |
| 626 |
env->head->item->content.ptr=new_head; |
env->head->item->content.ptr= new_head; |
| 627 |
} |
} |
| 628 |
|
|
| 629 |
/* Make a list. */ |
/* Make a list. */ |
| 656 |
} |
} |
| 657 |
|
|
| 658 |
/* Push list */ |
/* Push list */ |
| 659 |
pack= malloc(sizeof(value)); |
pack= new_val(env); |
| 660 |
pack->type= list; |
pack->type= list; |
| 661 |
pack->content.ptr= temp; |
pack->content.ptr= temp; |
|
pack->refcount= 0; |
|
| 662 |
|
|
| 663 |
push_val(env, pack); |
push_val(env, pack); |
| 664 |
rev(env); |
rev(env); |
| 672 |
/* Is top element a list? */ |
/* Is top element a list? */ |
| 673 |
if(env->head==NULL) { |
if(env->head==NULL) { |
| 674 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 675 |
env->err=1; |
env->err= 1; |
| 676 |
return; |
return; |
| 677 |
} |
} |
| 678 |
if(env->head->item->type!=list) { |
if(env->head->item->type!=list) { |
| 679 |
printerr("Bad Argument Type"); |
printerr("Bad Argument Type"); |
| 680 |
env->err=2; |
env->err= 2; |
| 681 |
return; |
return; |
| 682 |
} |
} |
| 683 |
|
|
| 689 |
/* The first list element is the new stack head */ |
/* The first list element is the new stack head */ |
| 690 |
new_head= temp= env->head->item->content.ptr; |
new_head= temp= env->head->item->content.ptr; |
| 691 |
|
|
|
env->head->item->refcount++; |
|
| 692 |
toss(env); |
toss(env); |
| 693 |
|
|
| 694 |
/* Find the end of the list */ |
/* Find the end of the list */ |
| 709 |
|
|
| 710 |
if((env->head)==NULL || env->head->next==NULL) { |
if((env->head)==NULL || env->head->next==NULL) { |
| 711 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 712 |
env->err=1; |
env->err= 1; |
| 713 |
return; |
return; |
| 714 |
} |
} |
| 715 |
|
|
| 729 |
|
|
| 730 |
if((env->head)==NULL) { |
if((env->head)==NULL) { |
| 731 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 732 |
env->err=1; |
env->err= 1; |
| 733 |
return; |
return; |
| 734 |
} |
} |
| 735 |
|
|
| 736 |
if(env->head->item->type!=integer) { |
if(env->head->item->type!=integer) { |
| 737 |
printerr("Bad Argument Type"); |
printerr("Bad Argument Type"); |
| 738 |
env->err=2; |
env->err= 2; |
| 739 |
return; |
return; |
| 740 |
} |
} |
| 741 |
|
|
| 760 |
/* Needs two values on the stack, the top one must be a symbol */ |
/* Needs two values on the stack, the top one must be a symbol */ |
| 761 |
if(env->head==NULL || env->head->next==NULL) { |
if(env->head==NULL || env->head->next==NULL) { |
| 762 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 763 |
env->err=1; |
env->err= 1; |
| 764 |
return; |
return; |
| 765 |
} |
} |
| 766 |
|
|
| 767 |
if(env->head->item->type!=symb) { |
if(env->head->item->type!=symb) { |
| 768 |
printerr("Bad Argument Type"); |
printerr("Bad Argument Type"); |
| 769 |
env->err=2; |
env->err= 2; |
| 770 |
return; |
return; |
| 771 |
} |
} |
| 772 |
|
|
| 773 |
/* long names are a pain */ |
/* long names are a pain */ |
| 774 |
sym=env->head->item->content.ptr; |
sym= env->head->item->content.ptr; |
|
|
|
|
/* if the symbol was bound to something else, throw it away */ |
|
|
if(sym->val != NULL) |
|
|
free_val(sym->val); |
|
| 775 |
|
|
| 776 |
/* Bind the symbol to the value */ |
/* Bind the symbol to the value */ |
| 777 |
sym->val= env->head->next->item; |
sym->val= env->head->next->item; |
|
sym->val->refcount++; /* Increase the reference counter */ |
|
| 778 |
|
|
| 779 |
toss(env); toss(env); |
toss(env); toss(env); |
| 780 |
} |
} |
| 781 |
|
|
|
extern void clear(environment *); |
|
|
void forget_sym(symbol **); |
|
|
extern void words(environment *); |
|
|
|
|
| 782 |
/* Quit stack. */ |
/* Quit stack. */ |
| 783 |
extern void quit(environment *env) |
extern void quit(environment *env) |
| 784 |
{ |
{ |
| 794 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
| 795 |
} |
} |
| 796 |
|
|
| 797 |
|
env->gc_limit= 0; |
| 798 |
|
gc_init(env); |
| 799 |
|
|
| 800 |
if(env->free_string!=NULL) |
if(env->free_string!=NULL) |
| 801 |
free(env->free_string); |
free(env->free_string); |
| 802 |
|
|
| 834 |
temp= *hash_entry; |
temp= *hash_entry; |
| 835 |
*hash_entry= (*hash_entry)->next; |
*hash_entry= (*hash_entry)->next; |
| 836 |
|
|
|
if(temp->val!=NULL) { |
|
|
free_val(temp->val); |
|
|
} |
|
| 837 |
free(temp->id); |
free(temp->id); |
| 838 |
free(temp); |
free(temp); |
| 839 |
} |
} |
| 867 |
push_int(env, env->err); |
push_int(env, env->err); |
| 868 |
} |
} |
| 869 |
|
|
|
extern void sx_72656164(environment*); |
|
|
|
|
| 870 |
int main(int argc, char **argv) |
int main(int argc, char **argv) |
| 871 |
{ |
{ |
| 872 |
environment myenv; |
environment myenv; |
| 924 |
toss(&myenv); /* No error check in main */ |
toss(&myenv); /* No error check in main */ |
| 925 |
eval(&myenv); |
eval(&myenv); |
| 926 |
} |
} |
| 927 |
|
gc_init(&myenv); |
| 928 |
} |
} |
| 929 |
quit(&myenv); |
quit(&myenv); |
| 930 |
return EXIT_FAILURE; |
return EXIT_FAILURE; |
| 939 |
|
|
| 940 |
if((env->head)==NULL || env->head->next==NULL) { |
if((env->head)==NULL || env->head->next==NULL) { |
| 941 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 942 |
env->err=1; |
env->err= 1; |
| 943 |
return; |
return; |
| 944 |
} |
} |
| 945 |
|
|
| 947 |
&& env->head->next->item->type==string) { |
&& env->head->next->item->type==string) { |
| 948 |
a_val= env->head->item; |
a_val= env->head->item; |
| 949 |
b_val= env->head->next->item; |
b_val= env->head->next->item; |
| 950 |
a_val->refcount++; |
protect(env, a_val); protect(env, b_val); |
|
b_val->refcount++; |
|
| 951 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 952 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 953 |
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
| 954 |
new_string= malloc(len); |
new_string= malloc(len); |
| 955 |
strcpy(new_string, b_val->content.ptr); |
strcpy(new_string, b_val->content.ptr); |
| 956 |
strcat(new_string, a_val->content.ptr); |
strcat(new_string, a_val->content.ptr); |
|
free_val(a_val); free_val(b_val); |
|
| 957 |
push_cstring(env, new_string); |
push_cstring(env, new_string); |
| 958 |
|
unprotect(env); unprotect(env); |
| 959 |
free(new_string); |
free(new_string); |
| 960 |
return; |
return; |
| 961 |
} |
} |
| 966 |
env->err=2; |
env->err=2; |
| 967 |
return; |
return; |
| 968 |
} |
} |
| 969 |
a=env->head->item->content.val; |
a= env->head->item->content.val; |
| 970 |
toss(env); |
toss(env); if(env->err) return; |
| 971 |
if(env->err) return; |
|
| 972 |
if(env->head->item->refcount == 1) |
b= env->head->item->content.val; |
| 973 |
env->head->item->content.val += a; |
toss(env); if(env->err) return; |
| 974 |
else { |
push_int(env, a+b); |
|
b=env->head->item->content.val; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
push_int(env, a+b); |
|
|
} |
|
| 975 |
} |
} |
| 976 |
|
|
| 977 |
/* "-" */ |
/* "-" */ |
| 990 |
env->err=2; |
env->err=2; |
| 991 |
return; |
return; |
| 992 |
} |
} |
| 993 |
|
|
| 994 |
a=env->head->item->content.val; |
a=env->head->item->content.val; |
| 995 |
toss(env); |
toss(env); if(env->err) return; |
| 996 |
if(env->err) return; |
b=env->head->item->content.val; |
| 997 |
if(env->head->item->refcount == 1) |
toss(env); if(env->err) return; |
| 998 |
env->head->item->content.val -= a; |
push_int(env, b-a); |
|
else { |
|
|
b=env->head->item->content.val; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
push_int(env, b-a); |
|
|
} |
|
| 999 |
} |
} |
| 1000 |
|
|
| 1001 |
/* ">" */ |
/* ">" */ |
| 1014 |
env->err=2; |
env->err=2; |
| 1015 |
return; |
return; |
| 1016 |
} |
} |
| 1017 |
|
|
| 1018 |
a=env->head->item->content.val; |
a=env->head->item->content.val; |
| 1019 |
toss(env); |
toss(env); if(env->err) return; |
| 1020 |
if(env->err) return; |
b=env->head->item->content.val; |
| 1021 |
if(env->head->item->refcount == 1) |
toss(env); if(env->err) return; |
| 1022 |
env->head->item->content.val = (env->head->item->content.val > a); |
push_int(env, b>a); |
|
else { |
|
|
b=env->head->item->content.val; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
push_int(env, b>a); |
|
|
} |
|
| 1023 |
} |
} |
| 1024 |
|
|
| 1025 |
/* Return copy of a value */ |
/* Return copy of a value */ |
| 1026 |
value *copy_val(value *old_value){ |
value *copy_val(environment *env, value *old_value){ |
| 1027 |
stackitem *old_item, *new_item, *prev_item; |
stackitem *old_item, *new_item, *prev_item; |
| 1028 |
|
|
| 1029 |
value *new_value=malloc(sizeof(value)); |
value *new_value= new_val(env); |
| 1030 |
|
|
| 1031 |
|
protect(env, old_value); |
| 1032 |
|
new_value->type= old_value->type; |
| 1033 |
|
|
|
new_value->type=old_value->type; |
|
|
new_value->refcount=0; /* This is increased if/when this |
|
|
value is referenced somewhere, like |
|
|
in a stack item or a variable */ |
|
| 1034 |
switch(old_value->type){ |
switch(old_value->type){ |
| 1035 |
case integer: |
case integer: |
| 1036 |
new_value->content.val=old_value->content.val; |
new_value->content.val= old_value->content.val; |
| 1037 |
break; |
break; |
| 1038 |
case string: |
case string: |
| 1039 |
(char *)(new_value->content.ptr) |
(char *)(new_value->content.ptr)= |
| 1040 |
= strdup((char *)(old_value->content.ptr)); |
strdup((char *)(old_value->content.ptr)); |
| 1041 |
break; |
break; |
| 1042 |
case func: |
case func: |
| 1043 |
case symb: |
case symb: |
| 1044 |
new_value->content.ptr=old_value->content.ptr; |
new_value->content.ptr= old_value->content.ptr; |
| 1045 |
break; |
break; |
| 1046 |
case list: |
case list: |
| 1047 |
new_value->content.ptr=NULL; |
new_value->content.ptr= NULL; |
| 1048 |
|
|
| 1049 |
prev_item=NULL; |
prev_item= NULL; |
| 1050 |
old_item=(stackitem *)(old_value->content.ptr); |
old_item= (stackitem*)(old_value->content.ptr); |
| 1051 |
|
|
| 1052 |
while(old_item != NULL) { /* While list is not empty */ |
while(old_item != NULL) { /* While list is not empty */ |
| 1053 |
new_item= malloc(sizeof(stackitem)); |
new_item= malloc(sizeof(stackitem)); |
| 1054 |
new_item->item=copy_val(old_item->item); /* recurse */ |
new_item->item= copy_val(env, old_item->item); /* recurse */ |
| 1055 |
new_item->next=NULL; |
new_item->next= NULL; |
| 1056 |
if(prev_item != NULL) /* If this wasn't the first item */ |
if(prev_item != NULL) /* If this wasn't the first item */ |
| 1057 |
prev_item->next=new_item; /* point the previous item to the |
prev_item->next= new_item; /* point the previous item to the |
| 1058 |
new item */ |
new item */ |
| 1059 |
else |
else |
| 1060 |
new_value->content.ptr=new_item; |
new_value->content.ptr= new_item; |
| 1061 |
old_item=old_item->next; |
old_item= old_item->next; |
| 1062 |
prev_item=new_item; |
prev_item= new_item; |
| 1063 |
} |
} |
| 1064 |
break; |
break; |
| 1065 |
} |
} |
| 1066 |
|
|
| 1067 |
|
unprotect(env); |
| 1068 |
|
|
| 1069 |
return new_value; |
return new_value; |
| 1070 |
} |
} |
| 1071 |
|
|
| 1073 |
extern void sx_647570(environment *env) { |
extern void sx_647570(environment *env) { |
| 1074 |
if((env->head)==NULL) { |
if((env->head)==NULL) { |
| 1075 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 1076 |
env->err=1; |
env->err= 1; |
| 1077 |
return; |
return; |
| 1078 |
} |
} |
| 1079 |
push_val(env, copy_val(env->head->item)); |
push_val(env, copy_val(env, env->head->item)); |
| 1080 |
} |
} |
| 1081 |
|
|
| 1082 |
/* "if", If-Then */ |
/* "if", If-Then */ |
| 1086 |
|
|
| 1087 |
if((env->head)==NULL || env->head->next==NULL) { |
if((env->head)==NULL || env->head->next==NULL) { |
| 1088 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 1089 |
env->err=1; |
env->err= 1; |
| 1090 |
return; |
return; |
| 1091 |
} |
} |
| 1092 |
|
|
| 1159 |
} |
} |
| 1160 |
|
|
| 1161 |
loop= env->head->item; |
loop= env->head->item; |
| 1162 |
loop->refcount++; |
protect(env, loop); |
| 1163 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 1164 |
|
|
| 1165 |
test= env->head->item; |
test= env->head->item; |
| 1166 |
test->refcount++; |
protect(env, test); |
| 1167 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 1168 |
|
|
| 1169 |
do { |
do { |
| 1172 |
|
|
| 1173 |
if(env->head->item->type != integer) { |
if(env->head->item->type != integer) { |
| 1174 |
printerr("Bad Argument Type"); |
printerr("Bad Argument Type"); |
| 1175 |
env->err=2; |
env->err= 2; |
| 1176 |
return; |
return; |
| 1177 |
} |
} |
| 1178 |
|
|
| 1188 |
|
|
| 1189 |
} while(truth); |
} while(truth); |
| 1190 |
|
|
| 1191 |
free_val(test); |
unprotect(env); unprotect(env); |
|
free_val(loop); |
|
| 1192 |
} |
} |
| 1193 |
|
|
| 1194 |
/* "for"; For-loop */ |
|
| 1195 |
|
/* "for"; for-loop */ |
| 1196 |
extern void sx_666f72(environment *env) { |
extern void sx_666f72(environment *env) { |
| 1197 |
|
value *loop; |
| 1198 |
|
int foo1, foo2; |
| 1199 |
|
|
| 1200 |
|
if(env->head==NULL || env->head->next==NULL |
| 1201 |
|
|| env->head->next->next==NULL) { |
| 1202 |
|
printerr("Too Few Arguments"); |
| 1203 |
|
env->err= 1; |
| 1204 |
|
return; |
| 1205 |
|
} |
| 1206 |
|
|
| 1207 |
|
if(env->head->next->item->type!=integer |
| 1208 |
|
|| env->head->next->next->item->type!=integer) { |
| 1209 |
|
printerr("Bad Argument Type"); |
| 1210 |
|
env->err= 2; |
| 1211 |
|
return; |
| 1212 |
|
} |
| 1213 |
|
|
| 1214 |
|
loop= env->head->item; |
| 1215 |
|
protect(env, loop); |
| 1216 |
|
toss(env); if(env->err) return; |
| 1217 |
|
|
| 1218 |
|
foo2= env->head->item->content.val; |
| 1219 |
|
toss(env); if(env->err) return; |
| 1220 |
|
|
| 1221 |
|
foo1= env->head->item->content.val; |
| 1222 |
|
toss(env); if(env->err) return; |
| 1223 |
|
|
| 1224 |
|
if(foo1<=foo2) { |
| 1225 |
|
while(foo1<=foo2) { |
| 1226 |
|
push_int(env, foo1); |
| 1227 |
|
push_val(env, loop); |
| 1228 |
|
eval(env); if(env->err) return; |
| 1229 |
|
foo1++; |
| 1230 |
|
} |
| 1231 |
|
} else { |
| 1232 |
|
while(foo1>=foo2) { |
| 1233 |
|
push_int(env, foo1); |
| 1234 |
|
push_val(env, loop); |
| 1235 |
|
eval(env); if(env->err) return; |
| 1236 |
|
foo1--; |
| 1237 |
|
} |
| 1238 |
|
} |
| 1239 |
|
unprotect(env); |
| 1240 |
|
} |
| 1241 |
|
|
| 1242 |
|
/* Variant of for-loop */ |
| 1243 |
|
extern void foreach(environment *env) { |
| 1244 |
|
|
| 1245 |
value *loop, *foo; |
value *loop, *foo; |
| 1246 |
stackitem *iterator; |
stackitem *iterator; |
| 1247 |
|
|
| 1248 |
if((env->head)==NULL || env->head->next==NULL) { |
if((env->head)==NULL || env->head->next==NULL) { |
| 1249 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 1250 |
env->err=1; |
env->err= 1; |
| 1251 |
return; |
return; |
| 1252 |
} |
} |
| 1253 |
|
|
| 1254 |
if(env->head->next->item->type != list) { |
if(env->head->next->item->type != list) { |
| 1255 |
printerr("Bad Argument Type"); |
printerr("Bad Argument Type"); |
| 1256 |
env->err=2; |
env->err= 2; |
| 1257 |
return; |
return; |
| 1258 |
} |
} |
| 1259 |
|
|
| 1260 |
loop= env->head->item; |
loop= env->head->item; |
| 1261 |
loop->refcount++; |
protect(env, loop); |
| 1262 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 1263 |
|
|
| 1264 |
foo= env->head->item; |
foo= env->head->item; |
| 1265 |
foo->refcount++; |
protect(env, foo); |
| 1266 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 1267 |
|
|
| 1268 |
iterator= foo->content.ptr; |
iterator= foo->content.ptr; |
| 1273 |
eval(env); if(env->err) return; |
eval(env); if(env->err) return; |
| 1274 |
iterator= iterator->next; |
iterator= iterator->next; |
| 1275 |
} |
} |
| 1276 |
|
unprotect(env); unprotect(env); |
|
free_val(loop); |
|
|
free_val(foo); |
|
| 1277 |
} |
} |
| 1278 |
|
|
| 1279 |
/* "to" */ |
/* "to" */ |
| 1311 |
push_int(env, i); |
push_int(env, i); |
| 1312 |
} |
} |
| 1313 |
|
|
| 1314 |
temp_val= malloc(sizeof(value)); |
temp_val= new_val(env); |
| 1315 |
temp_val->content.ptr= env->head; |
temp_val->content.ptr= env->head; |
|
temp_val->refcount= 0; |
|
| 1316 |
temp_val->type= list; |
temp_val->type= list; |
| 1317 |
env->head= temp_head; |
env->head= temp_head; |
| 1318 |
push_val(env, temp_val); |
push_val(env, temp_val); |
| 1334 |
const char strform[]= "\"%[^\"]\"%n"; |
const char strform[]= "\"%[^\"]\"%n"; |
| 1335 |
const char intform[]= "%i%n"; |
const char intform[]= "%i%n"; |
| 1336 |
const char blankform[]= "%*[ \t]%n"; |
const char blankform[]= "%*[ \t]%n"; |
| 1337 |
const char ebrackform[]= "%*1[]]%n"; |
const char ebrackform[]= "]%n"; |
| 1338 |
const char semicform[]= "%*1[;]%n"; |
const char semicform[]= ";%n"; |
| 1339 |
const char bbrackform[]= "%*1[[]%n"; |
const char bbrackform[]= "[%n"; |
| 1340 |
|
|
| 1341 |
int itemp, readlength= -1; |
int itemp, readlength= -1; |
| 1342 |
static int depth= 0; |
static int depth= 0; |