| 8 |
#include <dlfcn.h> |
#include <dlfcn.h> |
| 9 |
/* assert */ |
/* assert */ |
| 10 |
#include <assert.h> |
#include <assert.h> |
| 11 |
|
/* strcat */ |
| 12 |
|
#include <string.h> |
| 13 |
|
|
| 14 |
#define HASHTBLSIZE 65536 |
#define HASHTBLSIZE 65536 |
| 15 |
|
|
| 59 |
stackitem *head; /* Head of the stack */ |
stackitem *head; /* Head of the stack */ |
| 60 |
hashtbl symbols; /* Hash table of all variable bindings */ |
hashtbl symbols; /* Hash table of all variable bindings */ |
| 61 |
int err; /* Error flag */ |
int err; /* Error flag */ |
| 62 |
|
int non_eval_flag; |
| 63 |
} environment; |
} environment; |
| 64 |
|
|
| 65 |
/* A type for pointers to external functions */ |
/* A type for pointers to external functions */ |
| 69 |
/* Initialize a newly created environment */ |
/* Initialize a newly created environment */ |
| 70 |
void init_env(environment *env) |
void init_env(environment *env) |
| 71 |
{ |
{ |
| 72 |
long i; |
int i; |
| 73 |
|
|
| 74 |
env->err=0; |
env->err= 0; |
| 75 |
|
env->non_eval_flag= 0; |
| 76 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
| 77 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
| 78 |
} |
} |
| 79 |
|
|
| 80 |
|
void printerr(const char* in_string) { |
| 81 |
|
fprintf(stderr, "Err: %s\n", in_string); |
| 82 |
|
} |
| 83 |
|
|
| 84 |
|
/* Throw away a value */ |
| 85 |
|
void free_val(value *val){ |
| 86 |
|
stackitem *item, *temp; |
| 87 |
|
|
| 88 |
|
val->refcount--; /* Decrease the reference count */ |
| 89 |
|
if(val->refcount == 0){ |
| 90 |
|
switch (val->type){ /* and free the contents if necessary */ |
| 91 |
|
case string: |
| 92 |
|
free(val->content.ptr); |
| 93 |
|
break; |
| 94 |
|
case list: /* lists needs to be freed recursively */ |
| 95 |
|
item=val->content.ptr; |
| 96 |
|
while(item != NULL) { /* for all stack items */ |
| 97 |
|
free_val(item->item); /* free the value */ |
| 98 |
|
temp=item->next; /* save next ptr */ |
| 99 |
|
free(item); /* free the stackitem */ |
| 100 |
|
item=temp; /* go to next stackitem */ |
| 101 |
|
} |
| 102 |
|
free(val); /* Free the actual list value */ |
| 103 |
|
break; |
| 104 |
|
default: |
| 105 |
|
break; |
| 106 |
|
} |
| 107 |
|
} |
| 108 |
|
} |
| 109 |
|
|
| 110 |
|
/* Discard the top element of the stack. */ |
| 111 |
|
extern void toss(environment *env) |
| 112 |
|
{ |
| 113 |
|
stackitem *temp= env->head; |
| 114 |
|
|
| 115 |
|
if((env->head)==NULL) { |
| 116 |
|
printerr("Too Few Arguments"); |
| 117 |
|
env->err=1; |
| 118 |
|
return; |
| 119 |
|
} |
| 120 |
|
|
| 121 |
|
free_val(env->head->item); /* Free the value */ |
| 122 |
|
env->head= env->head->next; /* Remove the top stack item */ |
| 123 |
|
free(temp); /* Free the old top stack item */ |
| 124 |
|
} |
| 125 |
|
|
| 126 |
/* 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. */ |
| 127 |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
| 128 |
{ |
{ |
| 129 |
long i= 0; |
int i= 0; |
| 130 |
unsigned long out_hash= 0; |
unsigned int out_hash= 0; |
| 131 |
char key= '\0'; |
char key= '\0'; |
| 132 |
symbol **position; |
symbol **position; |
| 133 |
|
|
| 197 |
push(stack_head, new_item); |
push(stack_head, new_item); |
| 198 |
} |
} |
| 199 |
|
|
| 200 |
|
/* Mangle a symbol name to a valid C identifier name */ |
| 201 |
|
char *mangle_(const char *old_string){ |
| 202 |
|
char validchars[] |
| 203 |
|
="0123456789abcdef"; |
| 204 |
|
char *new_string, *current; |
| 205 |
|
|
| 206 |
|
new_string=malloc((strlen(old_string)*2)+4); |
| 207 |
|
strcpy(new_string, "sx_"); /* Stack eXternal */ |
| 208 |
|
current=new_string+3; |
| 209 |
|
while(old_string[0] != '\0'){ |
| 210 |
|
current[0]=validchars[old_string[0]/16]; |
| 211 |
|
current[1]=validchars[old_string[0]%16]; |
| 212 |
|
current+=2; |
| 213 |
|
old_string++; |
| 214 |
|
} |
| 215 |
|
current[0]='\0'; |
| 216 |
|
|
| 217 |
|
return new_string; /* The caller must free() it */ |
| 218 |
|
} |
| 219 |
|
|
| 220 |
|
extern void mangle(environment *env){ |
| 221 |
|
value *new_value; |
| 222 |
|
char *new_string; |
| 223 |
|
|
| 224 |
|
if((env->head)==NULL) { |
| 225 |
|
printerr("Too Few Arguments"); |
| 226 |
|
env->err=1; |
| 227 |
|
return; |
| 228 |
|
} |
| 229 |
|
|
| 230 |
|
if(env->head->item->type!=string) { |
| 231 |
|
printerr("Bad Argument Type"); |
| 232 |
|
env->err=2; |
| 233 |
|
return; |
| 234 |
|
} |
| 235 |
|
|
| 236 |
|
new_string= mangle_((const char *)(env->head->item->content.ptr)); |
| 237 |
|
|
| 238 |
|
toss(env); |
| 239 |
|
if(env->err) return; |
| 240 |
|
|
| 241 |
|
new_value= malloc(sizeof(value)); |
| 242 |
|
new_value->content.ptr= new_string; |
| 243 |
|
new_value->type= string; |
| 244 |
|
new_value->refcount=1; |
| 245 |
|
|
| 246 |
|
push_val(&(env->head), new_value); |
| 247 |
|
} |
| 248 |
|
|
| 249 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
| 250 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
| 251 |
{ |
{ |
| 260 |
void *funcptr; /* A function pointer */ |
void *funcptr; /* A function pointer */ |
| 261 |
|
|
| 262 |
static void *handle= NULL; /* Dynamic linker handle */ |
static void *handle= NULL; /* Dynamic linker handle */ |
| 263 |
|
const char *dlerr; /* Dynamic linker error */ |
| 264 |
|
char *mangled; /* Mangled function name */ |
| 265 |
|
|
| 266 |
/* Create a new stack item containing a new value */ |
/* Create a new stack item containing a new value */ |
| 267 |
new_item= malloc(sizeof(stackitem)); |
new_item= malloc(sizeof(stackitem)); |
| 294 |
handle= dlopen(NULL, RTLD_LAZY); |
handle= dlopen(NULL, RTLD_LAZY); |
| 295 |
|
|
| 296 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
| 297 |
if(dlerror()==NULL) { /* If a function was found */ |
dlerr=dlerror(); |
| 298 |
|
if(dlerr != NULL) { /* If no function was found */ |
| 299 |
|
mangled=mangle_(in_string); |
| 300 |
|
funcptr= dlsym(handle, mangled); /* try mangling it */ |
| 301 |
|
free(mangled); |
| 302 |
|
dlerr=dlerror(); |
| 303 |
|
} |
| 304 |
|
if(dlerr==NULL) { /* If a function was found */ |
| 305 |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
| 306 |
new_fvalue->type=func; /* The new value is a function pointer */ |
new_fvalue->type=func; /* The new value is a function pointer */ |
| 307 |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
| 313 |
push(&(env->head), new_item); |
push(&(env->head), new_item); |
| 314 |
} |
} |
| 315 |
|
|
|
void printerr(const char* in_string) { |
|
|
fprintf(stderr, "Err: %s\n", in_string); |
|
|
} |
|
|
|
|
|
/* 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 */ |
|
|
} |
|
|
free(val); /* Free the actual list value */ |
|
|
break; |
|
|
default: |
|
|
break; |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
/* Discard the top element of the stack. */ |
|
|
extern void toss(environment *env) |
|
|
{ |
|
|
stackitem *temp= env->head; |
|
|
|
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
free_val(env->head->item); /* Free the value */ |
|
|
env->head= env->head->next; /* Remove the top stack item */ |
|
|
free(temp); /* Free the old top stack item */ |
|
|
} |
|
|
|
|
| 316 |
/* Print newline. */ |
/* Print newline. */ |
| 317 |
extern void nl() |
extern void nl() |
| 318 |
{ |
{ |
| 363 |
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
| 364 |
break; |
break; |
| 365 |
case symb: |
case symb: |
| 366 |
printf("'%s'", ((symbol *)(stack_head->item->content.ptr))->id); |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
| 367 |
break; |
break; |
| 368 |
case func: |
case func: |
| 369 |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
| 412 |
nl(); |
nl(); |
| 413 |
} |
} |
| 414 |
|
|
|
|
|
|
|
|
| 415 |
/* Prints the stack. */ |
/* Prints the stack. */ |
| 416 |
extern void printstack(environment *env) |
extern void printstack(environment *env) |
| 417 |
{ |
{ |
| 427 |
{ |
{ |
| 428 |
stackitem *temp= env->head; |
stackitem *temp= env->head; |
| 429 |
|
|
| 430 |
if((env->head)==NULL) { |
if(env->head==NULL || env->head->next==NULL) { |
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->next==NULL) { |
|
| 431 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 432 |
env->err=1; |
env->err=1; |
| 433 |
return; |
return; |
| 438 |
env->head->next= temp; |
env->head->next= temp; |
| 439 |
} |
} |
| 440 |
|
|
|
stackitem* copy(stackitem* in_item) |
|
|
{ |
|
|
stackitem *out_item= malloc(sizeof(stackitem)); |
|
|
|
|
|
memcpy(out_item, in_item, sizeof(stackitem)); |
|
|
out_item->next= NULL; |
|
|
|
|
|
return out_item; |
|
|
} |
|
|
|
|
| 441 |
/* Recall a value from a symbol, if bound */ |
/* Recall a value from a symbol, if bound */ |
| 442 |
extern void rcl(environment *env) |
extern void rcl(environment *env) |
| 443 |
{ |
{ |
| 466 |
push_val(&(env->head), val); /* Return its bound value */ |
push_val(&(env->head), val); /* Return its bound value */ |
| 467 |
} |
} |
| 468 |
|
|
| 469 |
|
void stack_read(environment*, char*); |
| 470 |
|
|
| 471 |
/* 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 |
| 472 |
function value, and if it is, toss the symbol and execute the |
function value, and if it is, toss the symbol and execute the |
| 473 |
function. */ |
function. */ |
| 474 |
extern void eval(environment *env) |
extern void eval(environment *env) |
| 475 |
{ |
{ |
| 476 |
funcp in_func; |
funcp in_func; |
| 477 |
|
value* temp_val; |
| 478 |
|
stackitem* iterator; |
| 479 |
|
char* temp_string; |
| 480 |
|
|
| 481 |
if(env->head==NULL) { |
if(env->head==NULL) { |
| 482 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
| 483 |
env->err=1; |
env->err=1; |
| 484 |
return; |
return; |
| 485 |
} |
} |
| 486 |
|
|
| 487 |
/* if it's a symbol */ |
switch(env->head->item->type) { |
| 488 |
if(env->head->item->type==symb) { |
/* if it's a symbol */ |
| 489 |
|
case symb: |
| 490 |
rcl(env); /* get its contents */ |
rcl(env); /* get its contents */ |
| 491 |
if(env->err) return; |
if(env->err) return; |
| 492 |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
| 493 |
eval(env); /* evaluate the value */ |
eval(env); /* evaluate the value */ |
| 494 |
return; |
return; |
| 495 |
} |
} |
| 496 |
} |
break; |
| 497 |
|
|
| 498 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
| 499 |
if(env->head->item->type==func) { |
case func: |
| 500 |
in_func= (funcp)(env->head->item->content.ptr); |
in_func= (funcp)(env->head->item->content.ptr); |
| 501 |
toss(env); |
toss(env); |
| 502 |
if(env->err) return; |
if(env->err) return; |
| 503 |
(*in_func)(env); |
(*in_func)(env); |
| 504 |
|
break; |
| 505 |
|
|
| 506 |
|
/* If it's a list */ |
| 507 |
|
case list: |
| 508 |
|
temp_val= env->head->item; |
| 509 |
|
env->head->item->refcount++; |
| 510 |
|
toss(env); |
| 511 |
|
if(env->err) return; |
| 512 |
|
iterator= (stackitem*)temp_val->content.ptr; |
| 513 |
|
while(iterator!=NULL && iterator->item!=NULL) { |
| 514 |
|
push_val(&(env->head), iterator->item); |
| 515 |
|
if(env->head->item->type==symb |
| 516 |
|
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
| 517 |
|
toss(env); |
| 518 |
|
if(env->err) return; |
| 519 |
|
eval(env); |
| 520 |
|
if(env->err) return; |
| 521 |
|
} |
| 522 |
|
iterator= iterator->next; |
| 523 |
|
} |
| 524 |
|
free_val(temp_val); |
| 525 |
|
break; |
| 526 |
|
|
| 527 |
|
/* If it's a string */ |
| 528 |
|
case string: |
| 529 |
|
temp_val= env->head->item; |
| 530 |
|
env->head->item->refcount++; |
| 531 |
|
toss(env); |
| 532 |
|
if(env->err) return; |
| 533 |
|
temp_string= malloc(strlen((char*)temp_val->content.ptr)+5); |
| 534 |
|
strcpy(temp_string, "[ "); |
| 535 |
|
strcat(temp_string, (char*)temp_val->content.ptr); |
| 536 |
|
strcat(temp_string, " ]"); |
| 537 |
|
stack_read(env, temp_string); |
| 538 |
|
eval(env); |
| 539 |
|
if(env->err) return; |
| 540 |
|
free_val(temp_val); |
| 541 |
|
free(temp_string); |
| 542 |
|
break; |
| 543 |
|
|
| 544 |
|
default: |
| 545 |
} |
} |
| 546 |
} |
} |
| 547 |
|
|
| 548 |
/* Reverse a list */ |
/* Reverse (flip) a list */ |
| 549 |
extern void rev(environment *env){ |
extern void rev(environment *env){ |
| 550 |
stackitem *old_head, *new_head, *item; |
stackitem *old_head, *new_head, *item; |
| 551 |
|
|
| 622 |
int itemp; |
int itemp; |
| 623 |
size_t inlength= strlen(in_line)+1; |
size_t inlength= strlen(in_line)+1; |
| 624 |
int convert= 0; |
int convert= 0; |
|
static int non_eval_flag= 0; |
|
| 625 |
|
|
| 626 |
temp= malloc(inlength); |
temp= malloc(inlength); |
| 627 |
rest= malloc(inlength); |
rest= malloc(inlength); |
| 657 |
/* If single char */ |
/* If single char */ |
| 658 |
if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) { |
if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) { |
| 659 |
if(*temp==';') { |
if(*temp==';') { |
| 660 |
if(!non_eval_flag) { |
if(!env->non_eval_flag) { |
| 661 |
eval(env); /* Evaluate top element */ |
eval(env); /* Evaluate top element */ |
| 662 |
break; |
break; |
| 663 |
} |
} |
| 669 |
if(*temp==']') { |
if(*temp==']') { |
| 670 |
push_sym(env, "["); |
push_sym(env, "["); |
| 671 |
pack(env); |
pack(env); |
| 672 |
if(non_eval_flag!=0) |
if(env->non_eval_flag) |
| 673 |
non_eval_flag--; |
env->non_eval_flag--; |
| 674 |
break; |
break; |
| 675 |
} |
} |
| 676 |
|
|
| 677 |
if(*temp=='[') { |
if(*temp=='[') { |
| 678 |
push_sym(env, "["); |
push_sym(env, "["); |
| 679 |
non_eval_flag++; |
env->non_eval_flag++; |
| 680 |
break; |
break; |
| 681 |
} |
} |
| 682 |
} |
} |
| 901 |
quit(&myenv); |
quit(&myenv); |
| 902 |
return EXIT_FAILURE; |
return EXIT_FAILURE; |
| 903 |
} |
} |
| 904 |
|
|
| 905 |
|
/* + */ |
| 906 |
|
extern void sx_2b(environment *env) { |
| 907 |
|
int a, b; |
| 908 |
|
size_t len; |
| 909 |
|
char* new_string; |
| 910 |
|
value *a_val, *b_val; |
| 911 |
|
|
| 912 |
|
if((env->head)==NULL || env->head->next==NULL) { |
| 913 |
|
printerr("Too Few Arguments"); |
| 914 |
|
env->err=1; |
| 915 |
|
return; |
| 916 |
|
} |
| 917 |
|
|
| 918 |
|
if(env->head->item->type==string |
| 919 |
|
&& env->head->next->item->type==string) { |
| 920 |
|
a_val= env->head->item; |
| 921 |
|
b_val= env->head->next->item; |
| 922 |
|
a_val->refcount++; |
| 923 |
|
b_val->refcount++; |
| 924 |
|
toss(env); if(env->err) return; |
| 925 |
|
toss(env); if(env->err) return; |
| 926 |
|
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
| 927 |
|
new_string= malloc(len); |
| 928 |
|
strcpy(new_string, b_val->content.ptr); |
| 929 |
|
strcat(new_string, a_val->content.ptr); |
| 930 |
|
free_val(a_val); free_val(b_val); |
| 931 |
|
push_cstring(&(env->head), new_string); |
| 932 |
|
free(new_string); |
| 933 |
|
return; |
| 934 |
|
} |
| 935 |
|
|
| 936 |
|
if(env->head->item->type!=integer |
| 937 |
|
|| env->head->next->item->type!=integer) { |
| 938 |
|
printerr("Bad Argument Type"); |
| 939 |
|
env->err=2; |
| 940 |
|
return; |
| 941 |
|
} |
| 942 |
|
a=env->head->item->content.val; |
| 943 |
|
toss(env); |
| 944 |
|
if(env->err) return; |
| 945 |
|
b=env->head->item->content.val; |
| 946 |
|
toss(env); |
| 947 |
|
if(env->err) return; |
| 948 |
|
push_int(&(env->head), a+b); |
| 949 |
|
} |