1 |
/* printf */ |
/* printf, sscanf, fgets, fprintf */ |
2 |
#include <stdio.h> |
#include <stdio.h> |
3 |
/* EXIT_SUCCESS */ |
/* exit, EXIT_SUCCESS, malloc, free */ |
4 |
#include <stdlib.h> |
#include <stdlib.h> |
5 |
/* NULL */ |
/* NULL */ |
6 |
#include <stddef.h> |
#include <stddef.h> |
7 |
/* dlopen, dlsym, dlerror */ |
/* dlopen, dlsym, dlerror */ |
8 |
#include <dlfcn.h> |
#include <dlfcn.h> |
9 |
/* assert */ |
/* strcmp, strcpy, strlen, strcat, strdup */ |
10 |
#include <assert.h> |
#include <string.h> |
11 |
|
|
12 |
#define HASHTBLSIZE 65536 |
#define HASHTBLSIZE 65536 |
13 |
|
|
48 |
typedef struct stackitem_struct |
typedef struct stackitem_struct |
49 |
{ |
{ |
50 |
value *item; /* The value on the stack */ |
value *item; /* The value on the stack */ |
51 |
|
/* (This is never NULL) */ |
52 |
struct stackitem_struct *next; /* Next item */ |
struct stackitem_struct *next; /* Next item */ |
53 |
} stackitem; |
} stackitem; |
54 |
|
|
58 |
stackitem *head; /* Head of the stack */ |
stackitem *head; /* Head of the stack */ |
59 |
hashtbl symbols; /* Hash table of all variable bindings */ |
hashtbl symbols; /* Hash table of all variable bindings */ |
60 |
int err; /* Error flag */ |
int err; /* Error flag */ |
61 |
|
int non_eval_flag; |
62 |
|
char *in_string; /* Input pending to be read */ |
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->in_string= NULL; |
75 |
|
env->err= 0; |
76 |
|
env->non_eval_flag= 0; |
77 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
78 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
79 |
} |
} |
80 |
|
|
81 |
|
void printerr(const char* in_string) { |
82 |
|
fprintf(stderr, "Err: %s\n", in_string); |
83 |
|
} |
84 |
|
|
85 |
|
/* Throw away a value */ |
86 |
|
void free_val(value *val){ |
87 |
|
stackitem *item, *temp; |
88 |
|
|
89 |
|
val->refcount--; /* Decrease the reference count */ |
90 |
|
if(val->refcount == 0){ |
91 |
|
switch (val->type){ /* and free the contents if necessary */ |
92 |
|
case string: |
93 |
|
free(val->content.ptr); |
94 |
|
break; |
95 |
|
case list: /* lists needs to be freed recursively */ |
96 |
|
item=val->content.ptr; |
97 |
|
while(item != NULL) { /* for all stack items */ |
98 |
|
free_val(item->item); /* free the value */ |
99 |
|
temp=item->next; /* save next ptr */ |
100 |
|
free(item); /* free the stackitem */ |
101 |
|
item=temp; /* go to next stackitem */ |
102 |
|
} |
103 |
|
free(val); /* Free the actual list value */ |
104 |
|
break; |
105 |
|
case integer: |
106 |
|
case func: |
107 |
|
case symb: |
108 |
|
break; |
109 |
|
} |
110 |
|
} |
111 |
|
} |
112 |
|
|
113 |
|
/* Discard the top element of the stack. */ |
114 |
|
extern void toss(environment *env) |
115 |
|
{ |
116 |
|
stackitem *temp= env->head; |
117 |
|
|
118 |
|
if((env->head)==NULL) { |
119 |
|
printerr("Too Few Arguments"); |
120 |
|
env->err=1; |
121 |
|
return; |
122 |
|
} |
123 |
|
|
124 |
|
free_val(env->head->item); /* Free the value */ |
125 |
|
env->head= env->head->next; /* Remove the top stack item */ |
126 |
|
free(temp); /* Free the old top stack item */ |
127 |
|
} |
128 |
|
|
129 |
/* 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. */ |
130 |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
131 |
{ |
{ |
132 |
long i= 0; |
int i= 0; |
133 |
unsigned long out_hash= 0; |
unsigned int out_hash= 0; |
134 |
char key= '\0'; |
char key= '\0'; |
135 |
symbol **position; |
symbol **position; |
136 |
|
|
200 |
push(stack_head, new_item); |
push(stack_head, new_item); |
201 |
} |
} |
202 |
|
|
203 |
|
/* Mangle a symbol name to a valid C identifier name */ |
204 |
|
char *mangle_str(const char *old_string){ |
205 |
|
char validchars[] |
206 |
|
="0123456789abcdef"; |
207 |
|
char *new_string, *current; |
208 |
|
|
209 |
|
new_string=malloc((strlen(old_string)*2)+4); |
210 |
|
strcpy(new_string, "sx_"); /* Stack eXternal */ |
211 |
|
current=new_string+3; |
212 |
|
while(old_string[0] != '\0'){ |
213 |
|
current[0]=validchars[(unsigned char)(old_string[0])/16]; |
214 |
|
current[1]=validchars[(unsigned char)(old_string[0])%16]; |
215 |
|
current+=2; |
216 |
|
old_string++; |
217 |
|
} |
218 |
|
current[0]='\0'; |
219 |
|
|
220 |
|
return new_string; /* The caller must free() it */ |
221 |
|
} |
222 |
|
|
223 |
|
extern void mangle(environment *env){ |
224 |
|
value *new_value; |
225 |
|
char *new_string; |
226 |
|
|
227 |
|
if((env->head)==NULL) { |
228 |
|
printerr("Too Few Arguments"); |
229 |
|
env->err=1; |
230 |
|
return; |
231 |
|
} |
232 |
|
|
233 |
|
if(env->head->item->type!=string) { |
234 |
|
printerr("Bad Argument Type"); |
235 |
|
env->err=2; |
236 |
|
return; |
237 |
|
} |
238 |
|
|
239 |
|
new_string= mangle_str((const char *)(env->head->item->content.ptr)); |
240 |
|
|
241 |
|
toss(env); |
242 |
|
if(env->err) return; |
243 |
|
|
244 |
|
new_value= malloc(sizeof(value)); |
245 |
|
new_value->content.ptr= new_string; |
246 |
|
new_value->type= string; |
247 |
|
new_value->refcount=1; |
248 |
|
|
249 |
|
push_val(&(env->head), new_value); |
250 |
|
} |
251 |
|
|
252 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
253 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
254 |
{ |
{ |
263 |
void *funcptr; /* A function pointer */ |
void *funcptr; /* A function pointer */ |
264 |
|
|
265 |
static void *handle= NULL; /* Dynamic linker handle */ |
static void *handle= NULL; /* Dynamic linker handle */ |
266 |
|
const char *dlerr; /* Dynamic linker error */ |
267 |
|
char *mangled; /* Mangled function name */ |
268 |
|
|
269 |
/* Create a new stack item containing a new value */ |
/* Create a new stack item containing a new value */ |
270 |
new_item= malloc(sizeof(stackitem)); |
new_item= malloc(sizeof(stackitem)); |
297 |
handle= dlopen(NULL, RTLD_LAZY); |
handle= dlopen(NULL, RTLD_LAZY); |
298 |
|
|
299 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
300 |
if(dlerror()==NULL) { /* If a function was found */ |
dlerr=dlerror(); |
301 |
|
if(dlerr != NULL) { /* If no function was found */ |
302 |
|
mangled=mangle_str(in_string); |
303 |
|
funcptr= dlsym(handle, mangled); /* try mangling it */ |
304 |
|
free(mangled); |
305 |
|
dlerr=dlerror(); |
306 |
|
} |
307 |
|
if(dlerr==NULL) { /* If a function was found */ |
308 |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
309 |
new_fvalue->type=func; /* The new value is a function pointer */ |
new_fvalue->type=func; /* The new value is a function pointer */ |
310 |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
316 |
push(&(env->head), new_item); |
push(&(env->head), new_item); |
317 |
} |
} |
318 |
|
|
|
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 */ |
|
|
} |
|
|
|
|
319 |
/* Print newline. */ |
/* Print newline. */ |
320 |
extern void nl() |
extern void nl() |
321 |
{ |
{ |
349 |
case list: |
case list: |
350 |
push_sym(env, "list"); |
push_sym(env, "list"); |
351 |
break; |
break; |
|
default: |
|
|
push_sym(env, "unknown"); |
|
|
break; |
|
352 |
} |
} |
353 |
} |
} |
354 |
|
|
360 |
printf("%d", stack_head->item->content.val); |
printf("%d", stack_head->item->content.val); |
361 |
break; |
break; |
362 |
case string: |
case string: |
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)); |
379 |
} |
} |
380 |
printf("]"); |
printf("]"); |
381 |
break; |
break; |
|
default: |
|
|
printf("#<unknown %p>", (stack_head->item->content.ptr)); |
|
|
break; |
|
382 |
} |
} |
383 |
} |
} |
384 |
|
|
409 |
nl(); |
nl(); |
410 |
} |
} |
411 |
|
|
|
|
|
|
|
|
412 |
/* Prints the stack. */ |
/* Prints the stack. */ |
413 |
extern void printstack(environment *env) |
extern void printstack(environment *env) |
414 |
{ |
{ |
424 |
{ |
{ |
425 |
stackitem *temp= env->head; |
stackitem *temp= env->head; |
426 |
|
|
427 |
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) { |
|
428 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
429 |
env->err=1; |
env->err=1; |
430 |
return; |
return; |
435 |
env->head->next= temp; |
env->head->next= temp; |
436 |
} |
} |
437 |
|
|
438 |
stackitem* copy(stackitem* in_item) |
/* Rotate the first three elements on the stack. */ |
439 |
|
extern void rot(environment *env) |
440 |
{ |
{ |
441 |
stackitem *out_item= malloc(sizeof(stackitem)); |
stackitem *temp= env->head; |
442 |
|
|
443 |
memcpy(out_item, in_item, sizeof(stackitem)); |
if(env->head==NULL || env->head->next==NULL |
444 |
out_item->next= NULL; |
|| env->head->next->next==NULL) { |
445 |
|
printerr("Too Few Arguments"); |
446 |
|
env->err=1; |
447 |
|
return; |
448 |
|
} |
449 |
|
|
450 |
return out_item; |
env->head= env->head->next->next; |
451 |
|
temp->next->next= env->head->next; |
452 |
|
env->head->next= temp; |
453 |
} |
} |
454 |
|
|
455 |
/* Recall a value from a symbol, if bound */ |
/* Recall a value from a symbol, if bound */ |
486 |
extern void eval(environment *env) |
extern void eval(environment *env) |
487 |
{ |
{ |
488 |
funcp in_func; |
funcp in_func; |
489 |
|
value* temp_val; |
490 |
|
stackitem* iterator; |
491 |
|
|
492 |
if(env->head==NULL) { |
if(env->head==NULL) { |
493 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
494 |
env->err=1; |
env->err=1; |
495 |
return; |
return; |
496 |
} |
} |
497 |
|
|
498 |
/* if it's a symbol */ |
eval_start: |
|
if(env->head->item->type==symb) { |
|
499 |
|
|
500 |
|
switch(env->head->item->type) { |
501 |
|
/* if it's a symbol */ |
502 |
|
case symb: |
503 |
rcl(env); /* get its contents */ |
rcl(env); /* get its contents */ |
504 |
if(env->err) return; |
if(env->err) return; |
505 |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
506 |
eval(env); /* evaluate the value */ |
goto eval_start; |
|
return; |
|
507 |
} |
} |
508 |
} |
return; |
509 |
|
|
510 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
511 |
if(env->head->item->type==func) { |
case func: |
512 |
in_func= (funcp)(env->head->item->content.ptr); |
in_func= (funcp)(env->head->item->content.ptr); |
513 |
toss(env); |
toss(env); |
514 |
if(env->err) return; |
if(env->err) return; |
515 |
(*in_func)(env); |
return (*in_func)(env); |
516 |
|
|
517 |
|
/* If it's a list */ |
518 |
|
case list: |
519 |
|
temp_val= env->head->item; |
520 |
|
env->head->item->refcount++; |
521 |
|
toss(env); |
522 |
|
if(env->err) return; |
523 |
|
iterator= (stackitem*)temp_val->content.ptr; |
524 |
|
while(iterator!=NULL) { |
525 |
|
push_val(&(env->head), iterator->item); |
526 |
|
if(env->head->item->type==symb |
527 |
|
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
528 |
|
toss(env); |
529 |
|
if(env->err) return; |
530 |
|
if(iterator->next == NULL){ |
531 |
|
free_val(temp_val); |
532 |
|
goto eval_start; |
533 |
|
} |
534 |
|
eval(env); |
535 |
|
if(env->err) return; |
536 |
|
} |
537 |
|
iterator= iterator->next; |
538 |
|
} |
539 |
|
free_val(temp_val); |
540 |
|
return; |
541 |
|
|
542 |
|
default: |
543 |
|
return; |
544 |
} |
} |
545 |
} |
} |
546 |
|
|
547 |
/* Reverse a list */ |
/* Reverse (flip) a list */ |
548 |
extern void rev(environment *env){ |
extern void rev(environment *env){ |
549 |
stackitem *old_head, *new_head, *item; |
stackitem *old_head, *new_head, *item; |
550 |
|
|
614 |
rev(env); |
rev(env); |
615 |
} |
} |
616 |
|
|
|
/* Parse input. */ |
|
|
void stack_read(environment *env, char *in_line) |
|
|
{ |
|
|
char *temp, *rest; |
|
|
int itemp; |
|
|
size_t inlength= strlen(in_line)+1; |
|
|
int convert= 0; |
|
|
static int non_eval_flag= 0; |
|
|
|
|
|
temp= malloc(inlength); |
|
|
rest= malloc(inlength); |
|
|
|
|
|
do { |
|
|
/* If comment */ |
|
|
if((convert= sscanf(in_line, "#%[^\n\r]", rest))) { |
|
|
free(temp); free(rest); |
|
|
return; |
|
|
} |
|
|
|
|
|
/* If string */ |
|
|
if((convert= sscanf(in_line, "\"%[^\"\n\r]\" %[^\n\r]", temp, rest))) { |
|
|
push_cstring(&(env->head), temp); |
|
|
break; |
|
|
} |
|
|
/* If integer */ |
|
|
if((convert= sscanf(in_line, "%d %[^\n\r]", &itemp, rest))) { |
|
|
push_int(&(env->head), itemp); |
|
|
break; |
|
|
} |
|
|
/* Escape ';' with '\' */ |
|
|
if((convert= sscanf(in_line, "\\%c%[^\n\r]", temp, rest))) { |
|
|
temp[1]= '\0'; |
|
|
push_sym(env, temp); |
|
|
break; |
|
|
} |
|
|
/* If symbol */ |
|
|
if((convert= sscanf(in_line, "%[^][ ;\n\r]%[^\n\r]", temp, rest))) { |
|
|
push_sym(env, temp); |
|
|
break; |
|
|
} |
|
|
/* If single char */ |
|
|
if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) { |
|
|
if(*temp==';') { |
|
|
if(!non_eval_flag) { |
|
|
eval(env); /* Evaluate top element */ |
|
|
break; |
|
|
} |
|
|
|
|
|
push_sym(env, ";"); |
|
|
break; |
|
|
} |
|
|
|
|
|
if(*temp==']') { |
|
|
push_sym(env, "["); |
|
|
pack(env); |
|
|
if(non_eval_flag!=0) |
|
|
non_eval_flag--; |
|
|
break; |
|
|
} |
|
|
|
|
|
if(*temp=='[') { |
|
|
push_sym(env, "["); |
|
|
non_eval_flag++; |
|
|
break; |
|
|
} |
|
|
} |
|
|
} while(0); |
|
|
|
|
|
free(temp); |
|
|
|
|
|
if(convert<2) { |
|
|
free(rest); |
|
|
return; |
|
|
} |
|
|
|
|
|
stack_read(env, rest); |
|
|
|
|
|
free(rest); |
|
|
} |
|
|
|
|
617 |
/* Relocate elements of the list on the stack. */ |
/* Relocate elements of the list on the stack. */ |
618 |
extern void expand(environment *env) |
extern void expand(environment *env) |
619 |
{ |
{ |
801 |
push_int(&(env->head), env->err); |
push_int(&(env->head), env->err); |
802 |
} |
} |
803 |
|
|
804 |
|
extern void read(environment*); |
805 |
|
|
806 |
int main() |
int main() |
807 |
{ |
{ |
808 |
environment myenv; |
environment myenv; |
|
char in_string[100]; |
|
809 |
|
|
810 |
init_env(&myenv); |
init_env(&myenv); |
811 |
|
|
812 |
printf("okidok\n "); |
while(1) { |
813 |
|
if(myenv.in_string==NULL) |
814 |
while(fgets(in_string, 100, stdin) != NULL) { |
printstack(&myenv); |
815 |
stack_read(&myenv, in_string); |
read(&myenv); |
816 |
if(myenv.err) { |
if(myenv.err) { |
817 |
printf("(error %d) ", myenv.err); |
printf("(error %d) ", myenv.err); |
818 |
myenv.err=0; |
myenv.err=0; |
819 |
|
} else if(myenv.head!=NULL |
820 |
|
&& myenv.head->item->type==symb |
821 |
|
&& ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') { |
822 |
|
toss(&myenv); /* No error check in main */ |
823 |
|
eval(&myenv); |
824 |
} |
} |
|
printf("okidok\n "); |
|
825 |
} |
} |
826 |
quit(&myenv); |
quit(&myenv); |
827 |
return EXIT_FAILURE; |
return EXIT_FAILURE; |
828 |
} |
} |
829 |
|
|
830 |
|
/* + */ |
831 |
|
extern void sx_2b(environment *env) { |
832 |
|
int a, b; |
833 |
|
size_t len; |
834 |
|
char* new_string; |
835 |
|
value *a_val, *b_val; |
836 |
|
|
837 |
|
if((env->head)==NULL || env->head->next==NULL) { |
838 |
|
printerr("Too Few Arguments"); |
839 |
|
env->err=1; |
840 |
|
return; |
841 |
|
} |
842 |
|
|
843 |
|
if(env->head->item->type==string |
844 |
|
&& env->head->next->item->type==string) { |
845 |
|
a_val= env->head->item; |
846 |
|
b_val= env->head->next->item; |
847 |
|
a_val->refcount++; |
848 |
|
b_val->refcount++; |
849 |
|
toss(env); if(env->err) return; |
850 |
|
toss(env); if(env->err) return; |
851 |
|
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
852 |
|
new_string= malloc(len); |
853 |
|
strcpy(new_string, b_val->content.ptr); |
854 |
|
strcat(new_string, a_val->content.ptr); |
855 |
|
free_val(a_val); free_val(b_val); |
856 |
|
push_cstring(&(env->head), new_string); |
857 |
|
free(new_string); |
858 |
|
return; |
859 |
|
} |
860 |
|
|
861 |
|
if(env->head->item->type!=integer |
862 |
|
|| env->head->next->item->type!=integer) { |
863 |
|
printerr("Bad Argument Type"); |
864 |
|
env->err=2; |
865 |
|
return; |
866 |
|
} |
867 |
|
a=env->head->item->content.val; |
868 |
|
toss(env); |
869 |
|
if(env->err) return; |
870 |
|
if(env->head->item->refcount == 1) |
871 |
|
env->head->item->content.val += a; |
872 |
|
else { |
873 |
|
b=env->head->item->content.val; |
874 |
|
toss(env); |
875 |
|
if(env->err) return; |
876 |
|
push_int(&(env->head), a+b); |
877 |
|
} |
878 |
|
} |
879 |
|
|
880 |
|
/* - */ |
881 |
|
extern void sx_2d(environment *env) { |
882 |
|
int a, b; |
883 |
|
|
884 |
|
if((env->head)==NULL || env->head->next==NULL) { |
885 |
|
printerr("Too Few Arguments"); |
886 |
|
env->err=1; |
887 |
|
return; |
888 |
|
} |
889 |
|
|
890 |
|
if(env->head->item->type!=integer |
891 |
|
|| env->head->next->item->type!=integer) { |
892 |
|
printerr("Bad Argument Type"); |
893 |
|
env->err=2; |
894 |
|
return; |
895 |
|
} |
896 |
|
a=env->head->item->content.val; |
897 |
|
toss(env); |
898 |
|
if(env->err) return; |
899 |
|
if(env->head->item->refcount == 1) |
900 |
|
env->head->item->content.val -= a; |
901 |
|
else { |
902 |
|
b=env->head->item->content.val; |
903 |
|
toss(env); |
904 |
|
if(env->err) return; |
905 |
|
push_int(&(env->head), b-a); |
906 |
|
} |
907 |
|
} |
908 |
|
|
909 |
|
/* > */ |
910 |
|
extern void sx_3e(environment *env) { |
911 |
|
int a, b; |
912 |
|
|
913 |
|
if((env->head)==NULL || env->head->next==NULL) { |
914 |
|
printerr("Too Few Arguments"); |
915 |
|
env->err=1; |
916 |
|
return; |
917 |
|
} |
918 |
|
|
919 |
|
if(env->head->item->type!=integer |
920 |
|
|| env->head->next->item->type!=integer) { |
921 |
|
printerr("Bad Argument Type"); |
922 |
|
env->err=2; |
923 |
|
return; |
924 |
|
} |
925 |
|
a=env->head->item->content.val; |
926 |
|
toss(env); |
927 |
|
if(env->err) return; |
928 |
|
if(env->head->item->refcount == 1) |
929 |
|
env->head->item->content.val = (env->head->item->content.val > a); |
930 |
|
else { |
931 |
|
b=env->head->item->content.val; |
932 |
|
toss(env); |
933 |
|
if(env->err) return; |
934 |
|
push_int(&(env->head), b>a); |
935 |
|
} |
936 |
|
} |
937 |
|
|
938 |
|
/* Return copy of a value */ |
939 |
|
value *copy_val(value *old_value){ |
940 |
|
stackitem *old_item, *new_item, *prev_item; |
941 |
|
|
942 |
|
value *new_value=malloc(sizeof(value)); |
943 |
|
|
944 |
|
new_value->type=old_value->type; |
945 |
|
new_value->refcount=0; /* This is increased if/when this |
946 |
|
value is referenced somewhere, like |
947 |
|
in a stack item or a variable */ |
948 |
|
switch(old_value->type){ |
949 |
|
case integer: |
950 |
|
new_value->content.val=old_value->content.val; |
951 |
|
break; |
952 |
|
case string: |
953 |
|
(char *)(new_value->content.ptr) |
954 |
|
= strdup((char *)(old_value->content.ptr)); |
955 |
|
break; |
956 |
|
case func: |
957 |
|
case symb: |
958 |
|
new_value->content.ptr=old_value->content.ptr; |
959 |
|
break; |
960 |
|
case list: |
961 |
|
new_value->content.ptr=NULL; |
962 |
|
|
963 |
|
prev_item=NULL; |
964 |
|
old_item=(stackitem *)(old_value->content.ptr); |
965 |
|
|
966 |
|
while(old_item != NULL) { /* While list is not empty */ |
967 |
|
new_item= malloc(sizeof(stackitem)); |
968 |
|
new_item->item=copy_val(old_item->item); /* recurse */ |
969 |
|
new_item->next=NULL; |
970 |
|
if(prev_item != NULL) /* If this wasn't the first item */ |
971 |
|
prev_item->next=new_item; /* point the previous item to the |
972 |
|
new item */ |
973 |
|
else |
974 |
|
new_value->content.ptr=new_item; |
975 |
|
old_item=old_item->next; |
976 |
|
prev_item=new_item; |
977 |
|
} |
978 |
|
break; |
979 |
|
} |
980 |
|
return new_value; |
981 |
|
} |
982 |
|
|
983 |
|
/* duplicates an item on the stack */ |
984 |
|
extern void dup(environment *env) { |
985 |
|
if((env->head)==NULL) { |
986 |
|
printerr("Too Few Arguments"); |
987 |
|
env->err=1; |
988 |
|
return; |
989 |
|
} |
990 |
|
push_val(&(env->head), copy_val(env->head->item)); |
991 |
|
} |
992 |
|
|
993 |
|
/* "if", If-Then */ |
994 |
|
extern void sx_6966(environment *env) { |
995 |
|
|
996 |
|
int truth; |
997 |
|
|
998 |
|
if((env->head)==NULL || env->head->next==NULL) { |
999 |
|
printerr("Too Few Arguments"); |
1000 |
|
env->err=1; |
1001 |
|
return; |
1002 |
|
} |
1003 |
|
|
1004 |
|
if(env->head->next->item->type != integer) { |
1005 |
|
printerr("Bad Argument Type"); |
1006 |
|
env->err=2; |
1007 |
|
return; |
1008 |
|
} |
1009 |
|
|
1010 |
|
swap(env); |
1011 |
|
if(env->err) return; |
1012 |
|
|
1013 |
|
truth=env->head->item->content.val; |
1014 |
|
|
1015 |
|
toss(env); |
1016 |
|
if(env->err) return; |
1017 |
|
|
1018 |
|
if(truth) |
1019 |
|
eval(env); |
1020 |
|
else |
1021 |
|
toss(env); |
1022 |
|
} |
1023 |
|
|
1024 |
|
/* If-Then-Else */ |
1025 |
|
extern void ifelse(environment *env) { |
1026 |
|
|
1027 |
|
int truth; |
1028 |
|
|
1029 |
|
if((env->head)==NULL || env->head->next==NULL |
1030 |
|
|| env->head->next->next==NULL) { |
1031 |
|
printerr("Too Few Arguments"); |
1032 |
|
env->err=1; |
1033 |
|
return; |
1034 |
|
} |
1035 |
|
|
1036 |
|
if(env->head->next->next->item->type != integer) { |
1037 |
|
printerr("Bad Argument Type"); |
1038 |
|
env->err=2; |
1039 |
|
return; |
1040 |
|
} |
1041 |
|
|
1042 |
|
rot(env); |
1043 |
|
if(env->err) return; |
1044 |
|
|
1045 |
|
truth=env->head->item->content.val; |
1046 |
|
|
1047 |
|
toss(env); |
1048 |
|
if(env->err) return; |
1049 |
|
|
1050 |
|
if(!truth) |
1051 |
|
swap(env); |
1052 |
|
if(env->err) return; |
1053 |
|
|
1054 |
|
toss(env); |
1055 |
|
if(env->err) return; |
1056 |
|
|
1057 |
|
eval(env); |
1058 |
|
} |
1059 |
|
|
1060 |
|
/* while */ |
1061 |
|
extern void sx_7768696c65(environment *env) { |
1062 |
|
|
1063 |
|
int truth; |
1064 |
|
value *loop, *test; |
1065 |
|
|
1066 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1067 |
|
printerr("Too Few Arguments"); |
1068 |
|
env->err=1; |
1069 |
|
return; |
1070 |
|
} |
1071 |
|
|
1072 |
|
loop= env->head->item; |
1073 |
|
loop->refcount++; |
1074 |
|
toss(env); if(env->err) return; |
1075 |
|
|
1076 |
|
test= env->head->item; |
1077 |
|
test->refcount++; |
1078 |
|
toss(env); if(env->err) return; |
1079 |
|
|
1080 |
|
do { |
1081 |
|
push_val(&(env->head), test); |
1082 |
|
eval(env); |
1083 |
|
|
1084 |
|
if(env->head->item->type != integer) { |
1085 |
|
printerr("Bad Argument Type"); |
1086 |
|
env->err=2; |
1087 |
|
return; |
1088 |
|
} |
1089 |
|
|
1090 |
|
truth= env->head->item->content.val; |
1091 |
|
toss(env); if(env->err) return; |
1092 |
|
|
1093 |
|
if(truth) { |
1094 |
|
push_val(&(env->head), loop); |
1095 |
|
eval(env); |
1096 |
|
} else { |
1097 |
|
toss(env); |
1098 |
|
} |
1099 |
|
|
1100 |
|
} while(truth); |
1101 |
|
|
1102 |
|
free_val(test); |
1103 |
|
free_val(loop); |
1104 |
|
} |
1105 |
|
|
1106 |
|
/* For-loop */ |
1107 |
|
extern void sx_666f72(environment *env) { |
1108 |
|
|
1109 |
|
value *loop, *foo; |
1110 |
|
stackitem *iterator; |
1111 |
|
|
1112 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1113 |
|
printerr("Too Few Arguments"); |
1114 |
|
env->err=1; |
1115 |
|
return; |
1116 |
|
} |
1117 |
|
|
1118 |
|
if(env->head->next->item->type != list) { |
1119 |
|
printerr("Bad Argument Type"); |
1120 |
|
env->err=2; |
1121 |
|
return; |
1122 |
|
} |
1123 |
|
|
1124 |
|
loop= env->head->item; |
1125 |
|
loop->refcount++; |
1126 |
|
toss(env); if(env->err) return; |
1127 |
|
|
1128 |
|
foo= env->head->item; |
1129 |
|
foo->refcount++; |
1130 |
|
toss(env); if(env->err) return; |
1131 |
|
|
1132 |
|
iterator= foo->content.ptr; |
1133 |
|
|
1134 |
|
while(iterator!=NULL) { |
1135 |
|
push_val(&(env->head), iterator->item); |
1136 |
|
push_val(&(env->head), loop); |
1137 |
|
eval(env); if(env->err) return; |
1138 |
|
iterator= iterator->next; |
1139 |
|
} |
1140 |
|
|
1141 |
|
free_val(loop); |
1142 |
|
free_val(foo); |
1143 |
|
} |
1144 |
|
|
1145 |
|
/* 'to' */ |
1146 |
|
extern void to(environment *env) { |
1147 |
|
int i, start, ending; |
1148 |
|
|
1149 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1150 |
|
printerr("Too Few Arguments"); |
1151 |
|
env->err=1; |
1152 |
|
return; |
1153 |
|
} |
1154 |
|
|
1155 |
|
if(env->head->item->type!=integer |
1156 |
|
|| env->head->next->item->type!=integer) { |
1157 |
|
printerr("Bad Argument Type"); |
1158 |
|
env->err=2; |
1159 |
|
return; |
1160 |
|
} |
1161 |
|
|
1162 |
|
ending= env->head->item->content.val; |
1163 |
|
toss(env); if(env->err) return; |
1164 |
|
start= env->head->item->content.val; |
1165 |
|
toss(env); if(env->err) return; |
1166 |
|
|
1167 |
|
push_sym(env, "["); |
1168 |
|
|
1169 |
|
if(ending>=start) { |
1170 |
|
for(i= start; i<=ending; i++) |
1171 |
|
push_int(&(env->head), i); |
1172 |
|
} else { |
1173 |
|
for(i= start; i>=ending; i--) |
1174 |
|
push_int(&(env->head), i); |
1175 |
|
} |
1176 |
|
|
1177 |
|
push_sym(env, "["); |
1178 |
|
pack(env); if(env->err) return; |
1179 |
|
} |
1180 |
|
|
1181 |
|
/* Read a string */ |
1182 |
|
extern void readline(environment *env) { |
1183 |
|
char in_string[101]; |
1184 |
|
|
1185 |
|
fgets(in_string, 100, stdin); |
1186 |
|
push_cstring(&(env->head), in_string); |
1187 |
|
} |
1188 |
|
|
1189 |
|
/* Read a value and place on stack */ |
1190 |
|
extern void read(environment *env) { |
1191 |
|
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%[\001-\377]"; |
1192 |
|
const char strform[]= "\"%[^\"]\"%[\001-\377]"; |
1193 |
|
const char intform[]= "%i%[\001-\377]"; |
1194 |
|
const char blankform[]= "%*[ \t]%[\001-\377]"; |
1195 |
|
const char ebrackform[]= "%*1[]]%[\001-\377]"; |
1196 |
|
const char semicform[]= "%*1[;]%[\001-\377]"; |
1197 |
|
const char bbrackform[]= "%*1[[]%[\001-\377]"; |
1198 |
|
|
1199 |
|
int itemp; |
1200 |
|
static int depth= 0; |
1201 |
|
char *rest, *match; |
1202 |
|
size_t inlength; |
1203 |
|
|
1204 |
|
if(env->in_string==NULL) { |
1205 |
|
readline(env); if(env->err) return; |
1206 |
|
|
1207 |
|
env->in_string= malloc(strlen(env->head->item->content.ptr)+1); |
1208 |
|
strcpy(env->in_string, env->head->item->content.ptr); |
1209 |
|
toss(env); if(env->err) return; |
1210 |
|
} |
1211 |
|
|
1212 |
|
inlength= strlen(env->in_string)+1; |
1213 |
|
match= malloc(inlength); |
1214 |
|
rest= malloc(inlength); |
1215 |
|
|
1216 |
|
if(sscanf(env->in_string, blankform, rest)) { |
1217 |
|
; |
1218 |
|
} else if(sscanf(env->in_string, intform, &itemp, rest) > 0) { |
1219 |
|
push_int(&(env->head), itemp); |
1220 |
|
} else if(sscanf(env->in_string, strform, match, rest) > 0) { |
1221 |
|
push_cstring(&(env->head), match); |
1222 |
|
} else if(sscanf(env->in_string, symbform, match, rest) > 0) { |
1223 |
|
push_sym(env, match); |
1224 |
|
} else if(sscanf(env->in_string, ebrackform, rest) > 0) { |
1225 |
|
push_sym(env, "["); |
1226 |
|
pack(env); if(env->err) return; |
1227 |
|
if(depth!=0) depth--; |
1228 |
|
} else if(sscanf(env->in_string, semicform, rest) > 0) { |
1229 |
|
push_sym(env, ";"); |
1230 |
|
} else if(sscanf(env->in_string, bbrackform, rest) > 0) { |
1231 |
|
push_sym(env, "["); |
1232 |
|
depth++; |
1233 |
|
} else { |
1234 |
|
free(rest); |
1235 |
|
rest= NULL; |
1236 |
|
} |
1237 |
|
|
1238 |
|
free(env->in_string); |
1239 |
|
free(match); |
1240 |
|
|
1241 |
|
env->in_string= rest; |
1242 |
|
|
1243 |
|
if(depth) |
1244 |
|
return read(env); |
1245 |
|
} |