| 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 |
|
|
| 28 |
env->head= NULL; |
env->head= NULL; |
| 29 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
| 30 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
| 39 |
fprintf(stderr, "Err: %s\n", in_string); |
fprintf(stderr, "Err: %s\n", in_string); |
| 40 |
} |
} |
| 41 |
|
|
|
/* 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 */ |
|
|
} |
|
|
} |
|
|
|
|
| 42 |
/* Discard the top element of the stack. */ |
/* Discard the top element of the stack. */ |
| 43 |
extern void toss(environment *env) |
extern void toss(environment *env) |
| 44 |
{ |
{ |
| 50 |
return; |
return; |
| 51 |
} |
} |
| 52 |
|
|
|
free_val(env->head->item); /* Free the value */ |
|
| 53 |
env->head= env->head->next; /* Remove the top stack item */ |
env->head= env->head->next; /* Remove the top stack item */ |
| 54 |
free(temp); /* Free the old top stack item */ |
free(temp); /* Free the old top stack item */ |
| 55 |
} |
} |
| 83 |
} |
} |
| 84 |
} |
} |
| 85 |
|
|
| 86 |
|
value* new_val(environment *env) { |
| 87 |
|
value *nval= malloc(sizeof(value)); |
| 88 |
|
stackitem *nitem= malloc(sizeof(stackitem)); |
| 89 |
|
|
| 90 |
|
if(env->gc_count >= env->gc_limit) |
| 91 |
|
gc_init(env); |
| 92 |
|
|
| 93 |
|
nval->content.ptr= NULL; |
| 94 |
|
|
| 95 |
|
nitem->item= nval; |
| 96 |
|
nitem->next= env->gc_ref; |
| 97 |
|
env->gc_ref= nitem; |
| 98 |
|
|
| 99 |
|
env->gc_count++; |
| 100 |
|
|
| 101 |
|
return nval; |
| 102 |
|
} |
| 103 |
|
|
| 104 |
|
void gc_mark(value *val) { |
| 105 |
|
stackitem *iterator; |
| 106 |
|
|
| 107 |
|
if(val==NULL || val->gc_garb==0) |
| 108 |
|
return; |
| 109 |
|
|
| 110 |
|
val->gc_garb= 0; |
| 111 |
|
|
| 112 |
|
if(val->type==list) { |
| 113 |
|
iterator= val->content.ptr; |
| 114 |
|
|
| 115 |
|
while(iterator!=NULL) { |
| 116 |
|
gc_mark(iterator->item); |
| 117 |
|
iterator= iterator->next; |
| 118 |
|
} |
| 119 |
|
} |
| 120 |
|
} |
| 121 |
|
|
| 122 |
|
extern void gc_init(environment *env) { |
| 123 |
|
stackitem *new_head= NULL, *titem, *iterator= env->gc_ref; |
| 124 |
|
symbol *tsymb; |
| 125 |
|
int i; |
| 126 |
|
|
| 127 |
|
while(iterator!=NULL) { |
| 128 |
|
iterator->item->gc_garb= 1; |
| 129 |
|
iterator= iterator->next; |
| 130 |
|
} |
| 131 |
|
|
| 132 |
|
/* Mark */ |
| 133 |
|
iterator= env->head; |
| 134 |
|
while(iterator!=NULL) { |
| 135 |
|
gc_mark(iterator->item); |
| 136 |
|
iterator= iterator->next; |
| 137 |
|
} |
| 138 |
|
|
| 139 |
|
for(i= 0; i<HASHTBLSIZE; i++) { |
| 140 |
|
tsymb= env->symbols[i]; |
| 141 |
|
while(tsymb!=NULL) { |
| 142 |
|
gc_mark(tsymb->val); |
| 143 |
|
tsymb= tsymb->next; |
| 144 |
|
} |
| 145 |
|
} |
| 146 |
|
|
| 147 |
|
env->gc_count= 0; |
| 148 |
|
|
| 149 |
|
/* Sweep */ |
| 150 |
|
while(env->gc_ref!=NULL) { |
| 151 |
|
if(env->gc_ref->item->gc_garb) { |
| 152 |
|
switch(env->gc_ref->item->type) { |
| 153 |
|
case string: |
| 154 |
|
free(env->gc_ref->item->content.ptr); |
| 155 |
|
break; |
| 156 |
|
case integer: |
| 157 |
|
break; |
| 158 |
|
case list: |
| 159 |
|
while(env->gc_ref->item->content.ptr!=NULL) { |
| 160 |
|
titem= env->gc_ref->item->content.ptr; |
| 161 |
|
env->gc_ref->item->content.ptr= titem->next; |
| 162 |
|
free(titem); |
| 163 |
|
} |
| 164 |
|
break; |
| 165 |
|
default: |
| 166 |
|
break; |
| 167 |
|
} |
| 168 |
|
free(env->gc_ref->item); |
| 169 |
|
titem= env->gc_ref->next; |
| 170 |
|
free(env->gc_ref); |
| 171 |
|
env->gc_ref= titem; |
| 172 |
|
} else { |
| 173 |
|
titem= env->gc_ref->next; |
| 174 |
|
env->gc_ref->next= new_head; |
| 175 |
|
new_head= env->gc_ref; |
| 176 |
|
env->gc_ref= titem; |
| 177 |
|
env->gc_count++; |
| 178 |
|
} |
| 179 |
|
} |
| 180 |
|
|
| 181 |
|
env->gc_limit= env->gc_count+20; |
| 182 |
|
env->gc_ref= new_head; |
| 183 |
|
} |
| 184 |
|
|
| 185 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
| 186 |
void push_val(environment *env, value *val) |
void push_val(environment *env, value *val) |
| 187 |
{ |
{ |
| 188 |
stackitem *new_item= malloc(sizeof(stackitem)); |
stackitem *new_item= malloc(sizeof(stackitem)); |
| 189 |
new_item->item= val; |
new_item->item= val; |
|
val->refcount++; |
|
| 190 |
new_item->next= env->head; |
new_item->next= env->head; |
| 191 |
env->head= new_item; |
env->head= new_item; |
| 192 |
} |
} |
| 194 |
/* Push an integer onto the stack. */ |
/* Push an integer onto the stack. */ |
| 195 |
void push_int(environment *env, int in_val) |
void push_int(environment *env, int in_val) |
| 196 |
{ |
{ |
| 197 |
value *new_value= malloc(sizeof(value)); |
value *new_value= new_val(env); |
| 198 |
|
|
| 199 |
new_value->content.val= in_val; |
new_value->content.val= in_val; |
| 200 |
new_value->type= integer; |
new_value->type= integer; |
|
new_value->refcount= 0; |
|
| 201 |
|
|
| 202 |
push_val(env, new_value); |
push_val(env, new_value); |
| 203 |
} |
} |
| 205 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
| 206 |
void push_cstring(environment *env, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
| 207 |
{ |
{ |
| 208 |
value *new_value= malloc(sizeof(value)); |
value *new_value= new_val(env); |
| 209 |
|
|
| 210 |
new_value->content.ptr= malloc(strlen(in_string)+1); |
new_value->content.ptr= malloc(strlen(in_string)+1); |
| 211 |
strcpy(new_value->content.ptr, in_string); |
strcpy(new_value->content.ptr, in_string); |
| 212 |
new_value->type= string; |
new_value->type= string; |
|
new_value->refcount= 0; |
|
| 213 |
|
|
| 214 |
push_val(env, new_value); |
push_val(env, new_value); |
| 215 |
} |
} |
| 272 |
const char *dlerr; /* Dynamic linker error */ |
const char *dlerr; /* Dynamic linker error */ |
| 273 |
char *mangled; /* Mangled function name */ |
char *mangled; /* Mangled function name */ |
| 274 |
|
|
| 275 |
new_value= malloc(sizeof(value)); |
new_value= new_val(env); |
| 276 |
|
|
| 277 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
| 278 |
new_value->type= symb; |
new_value->type= symb; |
|
new_value->refcount= 1; |
|
| 279 |
|
|
| 280 |
/* Look up the symbol name in the hash table */ |
/* Look up the symbol name in the hash table */ |
| 281 |
new_symbol= hash(env->symbols, in_string); |
new_symbol= hash(env->symbols, in_string); |
| 298 |
if(handle==NULL) /* If no handle */ |
if(handle==NULL) /* If no handle */ |
| 299 |
handle= dlopen(NULL, RTLD_LAZY); |
handle= dlopen(NULL, RTLD_LAZY); |
| 300 |
|
|
| 301 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
mangled=mangle_str(in_string); /* mangle the name */ |
| 302 |
|
funcptr= dlsym(handle, mangled); /* and try to find it */ |
| 303 |
|
free(mangled); |
| 304 |
dlerr=dlerror(); |
dlerr=dlerror(); |
| 305 |
if(dlerr != NULL) { /* If no function was found */ |
if(dlerr != NULL) { /* If no function was found */ |
| 306 |
mangled=mangle_str(in_string); |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
|
funcptr= dlsym(handle, mangled); /* try mangling it */ |
|
|
free(mangled); |
|
| 307 |
dlerr=dlerror(); |
dlerr=dlerror(); |
| 308 |
} |
} |
| 309 |
if(dlerr==NULL) { /* If a function was found */ |
if(dlerr==NULL) { /* If a function was found */ |
| 310 |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
new_fvalue= new_val(env); /* Create a new value */ |
| 311 |
new_fvalue->type=func; /* The new value is a function pointer */ |
new_fvalue->type=func; /* The new value is a function pointer */ |
| 312 |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
| 313 |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
| 314 |
function value */ |
function value */ |
|
new_fvalue->refcount= 1; |
|
| 315 |
} |
} |
| 316 |
} |
} |
| 317 |
push_val(env, new_value); |
push_val(env, new_value); |
| 539 |
/* If it's a list */ |
/* If it's a list */ |
| 540 |
case list: |
case list: |
| 541 |
temp_val= env->head->item; |
temp_val= env->head->item; |
|
env->head->item->refcount++; |
|
| 542 |
toss(env); |
toss(env); |
| 543 |
if(env->err) return; |
if(env->err) return; |
| 544 |
iterator= (stackitem*)temp_val->content.ptr; |
iterator= (stackitem*)temp_val->content.ptr; |
| 549 |
toss(env); |
toss(env); |
| 550 |
if(env->err) return; |
if(env->err) return; |
| 551 |
if(iterator->next == NULL){ |
if(iterator->next == NULL){ |
|
free_val(temp_val); |
|
| 552 |
goto eval_start; |
goto eval_start; |
| 553 |
} |
} |
| 554 |
eval(env); |
eval(env); |
| 556 |
} |
} |
| 557 |
iterator= iterator->next; |
iterator= iterator->next; |
| 558 |
} |
} |
|
free_val(temp_val); |
|
| 559 |
return; |
return; |
| 560 |
|
|
| 561 |
default: |
default: |
| 620 |
} |
} |
| 621 |
|
|
| 622 |
/* Push list */ |
/* Push list */ |
| 623 |
pack= malloc(sizeof(value)); |
pack= new_val(env); |
| 624 |
pack->type= list; |
pack->type= list; |
| 625 |
pack->content.ptr= temp; |
pack->content.ptr= temp; |
|
pack->refcount= 0; |
|
| 626 |
|
|
| 627 |
push_val(env, pack); |
push_val(env, pack); |
| 628 |
rev(env); |
rev(env); |
| 653 |
/* The first list element is the new stack head */ |
/* The first list element is the new stack head */ |
| 654 |
new_head= temp= env->head->item->content.ptr; |
new_head= temp= env->head->item->content.ptr; |
| 655 |
|
|
|
env->head->item->refcount++; |
|
| 656 |
toss(env); |
toss(env); |
| 657 |
|
|
| 658 |
/* Find the end of the list */ |
/* Find the end of the list */ |
| 738 |
sym=env->head->item->content.ptr; |
sym=env->head->item->content.ptr; |
| 739 |
|
|
| 740 |
/* if the symbol was bound to something else, throw it away */ |
/* if the symbol was bound to something else, throw it away */ |
|
if(sym->val != NULL) |
|
|
free_val(sym->val); |
|
| 741 |
|
|
| 742 |
/* Bind the symbol to the value */ |
/* Bind the symbol to the value */ |
| 743 |
sym->val= env->head->next->item; |
sym->val= env->head->next->item; |
|
sym->val->refcount++; /* Increase the reference counter */ |
|
| 744 |
|
|
| 745 |
toss(env); toss(env); |
toss(env); toss(env); |
| 746 |
} |
} |
| 747 |
|
|
|
extern void clear(environment *); |
|
|
void forget_sym(symbol **); |
|
|
extern void words(environment *); |
|
|
|
|
| 748 |
/* Quit stack. */ |
/* Quit stack. */ |
| 749 |
extern void quit(environment *env) |
extern void quit(environment *env) |
| 750 |
{ |
{ |
| 760 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
| 761 |
} |
} |
| 762 |
|
|
| 763 |
|
gc_init(env); |
| 764 |
|
|
| 765 |
if(env->free_string!=NULL) |
if(env->free_string!=NULL) |
| 766 |
free(env->free_string); |
free(env->free_string); |
| 767 |
|
|
| 799 |
temp= *hash_entry; |
temp= *hash_entry; |
| 800 |
*hash_entry= (*hash_entry)->next; |
*hash_entry= (*hash_entry)->next; |
| 801 |
|
|
|
if(temp->val!=NULL) { |
|
|
free_val(temp->val); |
|
|
} |
|
| 802 |
free(temp->id); |
free(temp->id); |
| 803 |
free(temp); |
free(temp); |
| 804 |
} |
} |
| 832 |
push_int(env, env->err); |
push_int(env, env->err); |
| 833 |
} |
} |
| 834 |
|
|
|
extern void sx_72656164(environment*); |
|
|
|
|
| 835 |
int main(int argc, char **argv) |
int main(int argc, char **argv) |
| 836 |
{ |
{ |
| 837 |
environment myenv; |
environment myenv; |
| 869 |
} |
} |
| 870 |
|
|
| 871 |
while(1) { |
while(1) { |
| 872 |
if(myenv.in_string==NULL && myenv.interactive) { |
if(myenv.in_string==NULL) { |
| 873 |
nl(); |
if (myenv.interactive) { |
| 874 |
printstack(&myenv); |
if(myenv.err) { |
| 875 |
printf("> "); |
printf("(error %d)\n", myenv.err); |
| 876 |
|
} |
| 877 |
|
nl(); |
| 878 |
|
printstack(&myenv); |
| 879 |
|
printf("> "); |
| 880 |
|
} |
| 881 |
|
myenv.err=0; |
| 882 |
} |
} |
| 883 |
sx_72656164(&myenv); |
sx_72656164(&myenv); |
| 884 |
if(myenv.err) { |
if (myenv.err==4) { |
| 885 |
printf("(error %d) ", myenv.err); |
return EX_NOINPUT; |
|
if (myenv.err==4) |
|
|
return EX_NOINPUT; |
|
|
myenv.err=0; |
|
| 886 |
} else if(myenv.head!=NULL |
} else if(myenv.head!=NULL |
| 887 |
&& myenv.head->item->type==symb |
&& myenv.head->item->type==symb |
| 888 |
&& ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') { |
&& ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') { |
| 894 |
return EXIT_FAILURE; |
return EXIT_FAILURE; |
| 895 |
} |
} |
| 896 |
|
|
| 897 |
/* + */ |
/* "+" */ |
| 898 |
extern void sx_2b(environment *env) { |
extern void sx_2b(environment *env) { |
| 899 |
int a, b; |
int a, b; |
| 900 |
size_t len; |
size_t len; |
| 911 |
&& env->head->next->item->type==string) { |
&& env->head->next->item->type==string) { |
| 912 |
a_val= env->head->item; |
a_val= env->head->item; |
| 913 |
b_val= env->head->next->item; |
b_val= env->head->next->item; |
|
a_val->refcount++; |
|
|
b_val->refcount++; |
|
| 914 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 915 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 916 |
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
| 917 |
new_string= malloc(len); |
new_string= malloc(len); |
| 918 |
strcpy(new_string, b_val->content.ptr); |
strcpy(new_string, b_val->content.ptr); |
| 919 |
strcat(new_string, a_val->content.ptr); |
strcat(new_string, a_val->content.ptr); |
|
free_val(a_val); free_val(b_val); |
|
| 920 |
push_cstring(env, new_string); |
push_cstring(env, new_string); |
| 921 |
free(new_string); |
free(new_string); |
| 922 |
return; |
return; |
| 929 |
return; |
return; |
| 930 |
} |
} |
| 931 |
a=env->head->item->content.val; |
a=env->head->item->content.val; |
| 932 |
toss(env); |
toss(env); if(env->err) return; |
| 933 |
if(env->err) return; |
|
| 934 |
if(env->head->item->refcount == 1) |
b=env->head->item->content.val; |
| 935 |
env->head->item->content.val += a; |
toss(env); if(env->err) return; |
| 936 |
else { |
push_int(env, a+b); |
|
b=env->head->item->content.val; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
push_int(env, a+b); |
|
|
} |
|
| 937 |
} |
} |
| 938 |
|
|
| 939 |
/* - */ |
/* "-" */ |
| 940 |
extern void sx_2d(environment *env) { |
extern void sx_2d(environment *env) { |
| 941 |
int a, b; |
int a, b; |
| 942 |
|
|
| 953 |
return; |
return; |
| 954 |
} |
} |
| 955 |
a=env->head->item->content.val; |
a=env->head->item->content.val; |
| 956 |
toss(env); |
toss(env); if(env->err) return; |
| 957 |
if(env->err) return; |
b=env->head->item->content.val; |
| 958 |
if(env->head->item->refcount == 1) |
toss(env); if(env->err) return; |
| 959 |
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); |
|
|
} |
|
| 960 |
} |
} |
| 961 |
|
|
| 962 |
/* > */ |
/* ">" */ |
| 963 |
extern void sx_3e(environment *env) { |
extern void sx_3e(environment *env) { |
| 964 |
int a, b; |
int a, b; |
| 965 |
|
|
| 976 |
return; |
return; |
| 977 |
} |
} |
| 978 |
a=env->head->item->content.val; |
a=env->head->item->content.val; |
| 979 |
toss(env); |
toss(env); if(env->err) return; |
| 980 |
if(env->err) return; |
b=env->head->item->content.val; |
| 981 |
if(env->head->item->refcount == 1) |
toss(env); if(env->err) return; |
| 982 |
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); |
|
|
} |
|
| 983 |
} |
} |
| 984 |
|
|
| 985 |
/* Return copy of a value */ |
/* Return copy of a value */ |
| 986 |
value *copy_val(value *old_value){ |
value *copy_val(environment *env, value *old_value){ |
| 987 |
stackitem *old_item, *new_item, *prev_item; |
stackitem *old_item, *new_item, *prev_item; |
| 988 |
|
|
| 989 |
value *new_value=malloc(sizeof(value)); |
value *new_value=new_val(env); |
| 990 |
|
|
| 991 |
new_value->type=old_value->type; |
new_value->type=old_value->type; |
| 992 |
new_value->refcount=0; /* This is increased if/when this |
|
|
value is referenced somewhere, like |
|
|
in a stack item or a variable */ |
|
| 993 |
switch(old_value->type){ |
switch(old_value->type){ |
| 994 |
case integer: |
case integer: |
| 995 |
new_value->content.val=old_value->content.val; |
new_value->content.val=old_value->content.val; |
| 1010 |
|
|
| 1011 |
while(old_item != NULL) { /* While list is not empty */ |
while(old_item != NULL) { /* While list is not empty */ |
| 1012 |
new_item= malloc(sizeof(stackitem)); |
new_item= malloc(sizeof(stackitem)); |
| 1013 |
new_item->item=copy_val(old_item->item); /* recurse */ |
new_item->item=copy_val(env, old_item->item); /* recurse */ |
| 1014 |
new_item->next=NULL; |
new_item->next=NULL; |
| 1015 |
if(prev_item != NULL) /* If this wasn't the first item */ |
if(prev_item != NULL) /* If this wasn't the first item */ |
| 1016 |
prev_item->next=new_item; /* point the previous item to the |
prev_item->next=new_item; /* point the previous item to the |
| 1032 |
env->err=1; |
env->err=1; |
| 1033 |
return; |
return; |
| 1034 |
} |
} |
| 1035 |
push_val(env, copy_val(env->head->item)); |
push_val(env, copy_val(env, env->head->item)); |
| 1036 |
} |
} |
| 1037 |
|
|
| 1038 |
/* "if", If-Then */ |
/* "if", If-Then */ |
| 1102 |
eval(env); |
eval(env); |
| 1103 |
} |
} |
| 1104 |
|
|
| 1105 |
/* while */ |
/* "while" */ |
| 1106 |
extern void sx_7768696c65(environment *env) { |
extern void sx_7768696c65(environment *env) { |
| 1107 |
|
|
| 1108 |
int truth; |
int truth; |
| 1115 |
} |
} |
| 1116 |
|
|
| 1117 |
loop= env->head->item; |
loop= env->head->item; |
|
loop->refcount++; |
|
| 1118 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 1119 |
|
|
| 1120 |
test= env->head->item; |
test= env->head->item; |
|
test->refcount++; |
|
| 1121 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 1122 |
|
|
| 1123 |
do { |
do { |
| 1141 |
} |
} |
| 1142 |
|
|
| 1143 |
} while(truth); |
} while(truth); |
|
|
|
|
free_val(test); |
|
|
free_val(loop); |
|
| 1144 |
} |
} |
| 1145 |
|
|
| 1146 |
/* "for"; For-loop */ |
/* "for"; For-loop */ |
| 1162 |
} |
} |
| 1163 |
|
|
| 1164 |
loop= env->head->item; |
loop= env->head->item; |
|
loop->refcount++; |
|
| 1165 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 1166 |
|
|
| 1167 |
foo= env->head->item; |
foo= env->head->item; |
|
foo->refcount++; |
|
| 1168 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
| 1169 |
|
|
| 1170 |
iterator= foo->content.ptr; |
iterator= foo->content.ptr; |
| 1175 |
eval(env); if(env->err) return; |
eval(env); if(env->err) return; |
| 1176 |
iterator= iterator->next; |
iterator= iterator->next; |
| 1177 |
} |
} |
|
|
|
|
free_val(loop); |
|
|
free_val(foo); |
|
| 1178 |
} |
} |
| 1179 |
|
|
| 1180 |
/* 'to' */ |
/* "to" */ |
| 1181 |
extern void to(environment *env) { |
extern void to(environment *env) { |
| 1182 |
int i, start, ending; |
int i, start, ending; |
| 1183 |
stackitem *temp_head; |
stackitem *temp_head; |
| 1212 |
push_int(env, i); |
push_int(env, i); |
| 1213 |
} |
} |
| 1214 |
|
|
| 1215 |
temp_val= malloc(sizeof(value)); |
temp_val= new_val(env); |
| 1216 |
temp_val->content.ptr= env->head; |
temp_val->content.ptr= env->head; |
|
temp_val->refcount= 0; |
|
| 1217 |
temp_val->type= list; |
temp_val->type= list; |
| 1218 |
env->head= temp_head; |
env->head= temp_head; |
| 1219 |
push_val(env, temp_val); |
push_val(env, temp_val); |
| 1251 |
readline(env); if(env->err) return; |
readline(env); if(env->err) return; |
| 1252 |
|
|
| 1253 |
if(((char *)(env->head->item->content.ptr))[0]=='\0'){ |
if(((char *)(env->head->item->content.ptr))[0]=='\0'){ |
| 1254 |
env->err= 4; /* EOF */ |
env->err= 4; /* "" means EOF */ |
| 1255 |
return; |
return; |
| 1256 |
} |
} |
| 1257 |
|
|