| 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 2048 |
| 13 |
|
|
| 14 |
/* First, define some types. */ |
/* First, define some types. */ |
| 15 |
|
|
| 18 |
enum { |
enum { |
| 19 |
integer, |
integer, |
| 20 |
string, |
string, |
|
ref, /* Reference (to an element in the |
|
|
hash table) */ |
|
| 21 |
func, /* Function pointer */ |
func, /* Function pointer */ |
| 22 |
symb, |
symb, |
| 23 |
list |
list |
| 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 |
|
|
| 57 |
typedef struct { |
typedef struct { |
| 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 */ |
| 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->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 |
|
|
| 155 |
} |
} |
| 156 |
} |
} |
| 157 |
|
|
|
/* Generic push function. */ |
|
|
int push(stackitem** stack_head, stackitem* in_item) |
|
|
{ |
|
|
in_item->next= *stack_head; |
|
|
*stack_head= in_item; |
|
|
return 1; |
|
|
} |
|
|
|
|
| 158 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
| 159 |
void push_val(stackitem **stack_head, value *val) |
void push_val(environment *env, value *val) |
| 160 |
{ |
{ |
| 161 |
stackitem *new_item= malloc(sizeof(stackitem)); |
stackitem *new_item= malloc(sizeof(stackitem)); |
| 162 |
new_item->item= val; |
new_item->item= val; |
| 163 |
val->refcount++; |
val->refcount++; |
| 164 |
push(stack_head, new_item); |
new_item->next= env->head; |
| 165 |
|
env->head= new_item; |
| 166 |
} |
} |
| 167 |
|
|
| 168 |
/* Push an integer onto the stack. */ |
/* Push an integer onto the stack. */ |
| 169 |
int push_int(stackitem **stack_head, int in_val) |
void push_int(environment *env, int in_val) |
| 170 |
{ |
{ |
| 171 |
value *new_value= malloc(sizeof(value)); |
value *new_value= malloc(sizeof(value)); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item= new_value; |
|
| 172 |
|
|
| 173 |
new_value->content.val= in_val; |
new_value->content.val= in_val; |
| 174 |
new_value->type= integer; |
new_value->type= integer; |
| 175 |
new_value->refcount=1; |
new_value->refcount=1; |
| 176 |
|
|
| 177 |
push(stack_head, new_item); |
push_val(env, new_value); |
|
return 1; |
|
| 178 |
} |
} |
| 179 |
|
|
| 180 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
| 181 |
int push_cstring(stackitem **stack_head, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
| 182 |
{ |
{ |
| 183 |
value *new_value= malloc(sizeof(value)); |
value *new_value= malloc(sizeof(value)); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item=new_value; |
|
| 184 |
|
|
| 185 |
new_value->content.ptr= malloc(strlen(in_string)+1); |
new_value->content.ptr= malloc(strlen(in_string)+1); |
| 186 |
strcpy(new_value->content.ptr, in_string); |
strcpy(new_value->content.ptr, in_string); |
| 187 |
new_value->type= string; |
new_value->type= string; |
| 188 |
new_value->refcount=1; |
new_value->refcount=1; |
| 189 |
|
|
| 190 |
push(stack_head, new_item); |
push_val(env, new_value); |
| 191 |
return 1; |
} |
| 192 |
|
|
| 193 |
|
/* Mangle a symbol name to a valid C identifier name */ |
| 194 |
|
char *mangle_str(const char *old_string){ |
| 195 |
|
char validchars[] |
| 196 |
|
="0123456789abcdef"; |
| 197 |
|
char *new_string, *current; |
| 198 |
|
|
| 199 |
|
new_string=malloc((strlen(old_string)*2)+4); |
| 200 |
|
strcpy(new_string, "sx_"); /* Stack eXternal */ |
| 201 |
|
current=new_string+3; |
| 202 |
|
while(old_string[0] != '\0'){ |
| 203 |
|
current[0]=validchars[(unsigned char)(old_string[0])/16]; |
| 204 |
|
current[1]=validchars[(unsigned char)(old_string[0])%16]; |
| 205 |
|
current+=2; |
| 206 |
|
old_string++; |
| 207 |
|
} |
| 208 |
|
current[0]='\0'; |
| 209 |
|
|
| 210 |
|
return new_string; /* The caller must free() it */ |
| 211 |
|
} |
| 212 |
|
|
| 213 |
|
extern void mangle(environment *env){ |
| 214 |
|
value *new_value; |
| 215 |
|
char *new_string; |
| 216 |
|
|
| 217 |
|
if((env->head)==NULL) { |
| 218 |
|
printerr("Too Few Arguments"); |
| 219 |
|
env->err=1; |
| 220 |
|
return; |
| 221 |
|
} |
| 222 |
|
|
| 223 |
|
if(env->head->item->type!=string) { |
| 224 |
|
printerr("Bad Argument Type"); |
| 225 |
|
env->err=2; |
| 226 |
|
return; |
| 227 |
|
} |
| 228 |
|
|
| 229 |
|
new_string= mangle_str((const char *)(env->head->item->content.ptr)); |
| 230 |
|
|
| 231 |
|
toss(env); |
| 232 |
|
if(env->err) return; |
| 233 |
|
|
| 234 |
|
new_value= malloc(sizeof(value)); |
| 235 |
|
new_value->content.ptr= new_string; |
| 236 |
|
new_value->type= string; |
| 237 |
|
new_value->refcount=1; |
| 238 |
|
|
| 239 |
|
push_val(env, new_value); |
| 240 |
} |
} |
| 241 |
|
|
| 242 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
| 243 |
int push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
| 244 |
{ |
{ |
|
stackitem *new_item; /* The new stack item */ |
|
|
/* ...which will contain... */ |
|
| 245 |
value *new_value; /* A new symbol value */ |
value *new_value; /* A new symbol value */ |
| 246 |
/* ...which might point to... */ |
/* ...which might point to... */ |
| 247 |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
| 251 |
void *funcptr; /* A function pointer */ |
void *funcptr; /* A function pointer */ |
| 252 |
|
|
| 253 |
static void *handle= NULL; /* Dynamic linker handle */ |
static void *handle= NULL; /* Dynamic linker handle */ |
| 254 |
|
const char *dlerr; /* Dynamic linker error */ |
| 255 |
|
char *mangled; /* Mangled function name */ |
| 256 |
|
|
|
/* Create a new stack item containing a new value */ |
|
|
new_item= malloc(sizeof(stackitem)); |
|
| 257 |
new_value= malloc(sizeof(value)); |
new_value= malloc(sizeof(value)); |
|
new_item->item=new_value; |
|
| 258 |
|
|
| 259 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
| 260 |
new_value->type= symb; |
new_value->type= symb; |
| 282 |
handle= dlopen(NULL, RTLD_LAZY); |
handle= dlopen(NULL, RTLD_LAZY); |
| 283 |
|
|
| 284 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
| 285 |
if(dlerror()==NULL) { /* If a function was found */ |
dlerr=dlerror(); |
| 286 |
|
if(dlerr != NULL) { /* If no function was found */ |
| 287 |
|
mangled=mangle_str(in_string); |
| 288 |
|
funcptr= dlsym(handle, mangled); /* try mangling it */ |
| 289 |
|
free(mangled); |
| 290 |
|
dlerr=dlerror(); |
| 291 |
|
} |
| 292 |
|
if(dlerr==NULL) { /* If a function was found */ |
| 293 |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
| 294 |
new_fvalue->type=func; /* The new value is a function pointer */ |
new_fvalue->type=func; /* The new value is a function pointer */ |
| 295 |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
| 298 |
new_fvalue->refcount= 1; |
new_fvalue->refcount= 1; |
| 299 |
} |
} |
| 300 |
} |
} |
| 301 |
push(&(env->head), new_item); |
push_val(env, new_value); |
|
return 1; |
|
|
} |
|
|
|
|
|
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); |
|
|
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("Stack empty"); |
|
|
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 */ |
|
| 302 |
} |
} |
| 303 |
|
|
| 304 |
/* Print newline. */ |
/* Print newline. */ |
| 307 |
printf("\n"); |
printf("\n"); |
| 308 |
} |
} |
| 309 |
|
|
| 310 |
/* Prints the top element of the stack. */ |
/* Gets the type of a value */ |
| 311 |
void print_h(stackitem *stack_head) |
extern void type(environment *env){ |
| 312 |
{ |
int typenum; |
| 313 |
|
|
| 314 |
if(stack_head==NULL) { |
if((env->head)==NULL) { |
| 315 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
| 316 |
|
env->err=1; |
| 317 |
return; |
return; |
| 318 |
} |
} |
| 319 |
|
typenum=env->head->item->type; |
| 320 |
|
toss(env); |
| 321 |
|
switch(typenum){ |
| 322 |
|
case integer: |
| 323 |
|
push_sym(env, "integer"); |
| 324 |
|
break; |
| 325 |
|
case string: |
| 326 |
|
push_sym(env, "string"); |
| 327 |
|
break; |
| 328 |
|
case symb: |
| 329 |
|
push_sym(env, "symbol"); |
| 330 |
|
break; |
| 331 |
|
case func: |
| 332 |
|
push_sym(env, "function"); |
| 333 |
|
break; |
| 334 |
|
case list: |
| 335 |
|
push_sym(env, "list"); |
| 336 |
|
break; |
| 337 |
|
} |
| 338 |
|
} |
| 339 |
|
|
| 340 |
|
/* Prints the top element of the stack. */ |
| 341 |
|
void print_h(stackitem *stack_head) |
| 342 |
|
{ |
| 343 |
switch(stack_head->item->type) { |
switch(stack_head->item->type) { |
| 344 |
case integer: |
case integer: |
| 345 |
printf("%d", stack_head->item->content.val); |
printf("%d", stack_head->item->content.val); |
| 346 |
break; |
break; |
| 347 |
case string: |
case string: |
| 348 |
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
printf("%s", (char*)stack_head->item->content.ptr); |
| 349 |
break; |
break; |
| 350 |
case symb: |
case symb: |
| 351 |
printf("'%s'", ((symbol *)(stack_head->item->content.ptr))->id); |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
| 352 |
break; |
break; |
| 353 |
default: |
case func: |
| 354 |
printf("%p", (funcp)(stack_head->item->content.ptr)); |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
| 355 |
|
break; |
| 356 |
|
case list: |
| 357 |
|
/* A list is just a stack, so make stack_head point to it */ |
| 358 |
|
stack_head=(stackitem *)(stack_head->item->content.ptr); |
| 359 |
|
printf("[ "); |
| 360 |
|
while(stack_head != NULL) { |
| 361 |
|
print_h(stack_head); |
| 362 |
|
printf(" "); |
| 363 |
|
stack_head=stack_head->next; |
| 364 |
|
} |
| 365 |
|
printf("]"); |
| 366 |
break; |
break; |
| 367 |
} |
} |
| 368 |
} |
} |
| 369 |
|
|
| 370 |
extern void print_(environment *env) { |
extern void print_(environment *env) { |
| 371 |
|
if(env->head==NULL) { |
| 372 |
|
printerr("Too Few Arguments"); |
| 373 |
|
env->err=1; |
| 374 |
|
return; |
| 375 |
|
} |
| 376 |
print_h(env->head); |
print_h(env->head); |
| 377 |
} |
} |
| 378 |
|
|
| 380 |
extern void print(environment *env) |
extern void print(environment *env) |
| 381 |
{ |
{ |
| 382 |
print_(env); |
print_(env); |
| 383 |
|
if(env->err) return; |
| 384 |
toss(env); |
toss(env); |
| 385 |
} |
} |
| 386 |
|
|
| 394 |
nl(); |
nl(); |
| 395 |
} |
} |
| 396 |
|
|
|
|
|
|
|
|
| 397 |
/* Prints the stack. */ |
/* Prints the stack. */ |
| 398 |
extern void printstack(environment *env) |
extern void printstack(environment *env) |
| 399 |
{ |
{ |
| 400 |
if(env->head != NULL) { |
if(env->head == NULL) { |
| 401 |
print_st(env->head, 1); |
return; |
|
nl(); |
|
|
} else { |
|
|
printerr("Stack empty"); |
|
| 402 |
} |
} |
| 403 |
|
print_st(env->head, 1); |
| 404 |
|
nl(); |
| 405 |
} |
} |
| 406 |
|
|
| 407 |
/* Swap the two top elements on the stack. */ |
/* Swap the two top elements on the stack. */ |
| 409 |
{ |
{ |
| 410 |
stackitem *temp= env->head; |
stackitem *temp= env->head; |
| 411 |
|
|
| 412 |
if((env->head)==NULL) { |
if(env->head==NULL || env->head->next==NULL) { |
| 413 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
| 414 |
return; |
env->err=1; |
|
} |
|
|
|
|
|
if(env->head->next==NULL) { |
|
|
printerr("Not enough arguments"); |
|
| 415 |
return; |
return; |
| 416 |
} |
} |
| 417 |
|
|
| 420 |
env->head->next= temp; |
env->head->next= temp; |
| 421 |
} |
} |
| 422 |
|
|
| 423 |
stackitem* copy(stackitem* in_item) |
/* Rotate the first three elements on the stack. */ |
| 424 |
|
extern void rot(environment *env) |
| 425 |
{ |
{ |
| 426 |
stackitem *out_item= malloc(sizeof(stackitem)); |
stackitem *temp= env->head; |
| 427 |
|
|
| 428 |
memcpy(out_item, in_item, sizeof(stackitem)); |
if(env->head==NULL || env->head->next==NULL |
| 429 |
out_item->next= NULL; |
|| env->head->next->next==NULL) { |
| 430 |
|
printerr("Too Few Arguments"); |
| 431 |
|
env->err=1; |
| 432 |
|
return; |
| 433 |
|
} |
| 434 |
|
|
| 435 |
return out_item; |
env->head= env->head->next->next; |
| 436 |
|
temp->next->next= env->head->next; |
| 437 |
|
env->head->next= temp; |
| 438 |
} |
} |
| 439 |
|
|
| 440 |
|
/* Recall a value from a symbol, if bound */ |
| 441 |
extern void rcl(environment *env) |
extern void rcl(environment *env) |
| 442 |
{ |
{ |
| 443 |
value *val; |
value *val; |
| 444 |
|
|
| 445 |
if(env->head == NULL) { |
if(env->head == NULL) { |
| 446 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
| 447 |
|
env->err=1; |
| 448 |
return; |
return; |
| 449 |
} |
} |
| 450 |
|
|
| 451 |
if(env->head->item->type!=symb) { |
if(env->head->item->type!=symb) { |
| 452 |
printerr("Not a symbol"); |
printerr("Bad Argument Type"); |
| 453 |
|
env->err=2; |
| 454 |
return; |
return; |
| 455 |
} |
} |
| 456 |
|
|
| 457 |
val=((symbol *)(env->head->item->content.ptr))->val; |
val=((symbol *)(env->head->item->content.ptr))->val; |
| 458 |
|
if(val == NULL){ |
| 459 |
|
printerr("Unbound Variable"); |
| 460 |
|
env->err=3; |
| 461 |
|
return; |
| 462 |
|
} |
| 463 |
toss(env); /* toss the symbol */ |
toss(env); /* toss the symbol */ |
| 464 |
push_val(&(env->head), val); /* Return its bound value */ |
if(env->err) return; |
| 465 |
|
push_val(env, val); /* Return its bound value */ |
| 466 |
} |
} |
| 467 |
|
|
| 468 |
/* 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 |
| 471 |
extern void eval(environment *env) |
extern void eval(environment *env) |
| 472 |
{ |
{ |
| 473 |
funcp in_func; |
funcp in_func; |
| 474 |
value* val; |
value* temp_val; |
| 475 |
|
stackitem* iterator; |
| 476 |
|
|
| 477 |
if(env->head==NULL) { |
if(env->head==NULL) { |
| 478 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
| 479 |
|
env->err=1; |
| 480 |
return; |
return; |
| 481 |
} |
} |
| 482 |
|
|
| 483 |
/* if it's a symbol */ |
eval_start: |
|
if(env->head->item->type==symb) { |
|
| 484 |
|
|
| 485 |
/* If it's not bound to anything */ |
switch(env->head->item->type) { |
| 486 |
if (((symbol *)(env->head->item->content.ptr))->val == NULL) { |
/* if it's a symbol */ |
| 487 |
printerr("Unbound variable"); |
case symb: |
| 488 |
return; |
rcl(env); /* get its contents */ |
| 489 |
} |
if(env->err) return; |
| 490 |
|
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
| 491 |
/* If it contains a function */ |
goto eval_start; |
|
if (((symbol *)(env->head->item->content.ptr))->val->type == func) { |
|
|
in_func= |
|
|
(funcp)(((symbol *)(env->head->item->content.ptr))->val->content.ptr); |
|
|
toss(env); |
|
|
(*in_func)(env); /* Run the function */ |
|
|
return; |
|
|
} else { /* If it's not a function */ |
|
|
val=((symbol *)(env->head->item->content.ptr))->val; |
|
|
toss(env); /* toss the symbol */ |
|
|
push_val(&(env->head), val); /* Return its bound value */ |
|
| 492 |
} |
} |
| 493 |
} |
return; |
| 494 |
|
|
| 495 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
| 496 |
if(env->head->item->type==func) { |
case func: |
| 497 |
in_func= (funcp)(env->head->item->content.ptr); |
in_func= (funcp)(env->head->item->content.ptr); |
| 498 |
toss(env); |
toss(env); |
| 499 |
(*in_func)(env); |
if(env->err) return; |
| 500 |
|
return (*in_func)(env); |
| 501 |
|
|
| 502 |
|
/* If it's a list */ |
| 503 |
|
case list: |
| 504 |
|
temp_val= env->head->item; |
| 505 |
|
env->head->item->refcount++; |
| 506 |
|
toss(env); |
| 507 |
|
if(env->err) return; |
| 508 |
|
iterator= (stackitem*)temp_val->content.ptr; |
| 509 |
|
while(iterator!=NULL) { |
| 510 |
|
push_val(env, iterator->item); |
| 511 |
|
if(env->head->item->type==symb |
| 512 |
|
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
| 513 |
|
toss(env); |
| 514 |
|
if(env->err) return; |
| 515 |
|
if(iterator->next == NULL){ |
| 516 |
|
free_val(temp_val); |
| 517 |
|
goto eval_start; |
| 518 |
|
} |
| 519 |
|
eval(env); |
| 520 |
|
if(env->err) return; |
| 521 |
|
} |
| 522 |
|
iterator= iterator->next; |
| 523 |
|
} |
| 524 |
|
free_val(temp_val); |
| 525 |
|
return; |
| 526 |
|
|
| 527 |
|
default: |
| 528 |
|
return; |
| 529 |
|
} |
| 530 |
|
} |
| 531 |
|
|
| 532 |
|
/* Reverse (flip) a list */ |
| 533 |
|
extern void rev(environment *env){ |
| 534 |
|
stackitem *item, *temp, *prev= NULL; |
| 535 |
|
|
| 536 |
|
if((env->head)==NULL) { |
| 537 |
|
printerr("Too Few Arguments"); |
| 538 |
|
env->err=1; |
| 539 |
|
return; |
| 540 |
|
} |
| 541 |
|
|
| 542 |
|
if(env->head->item->type!=list) { |
| 543 |
|
printerr("Bad Argument Type"); |
| 544 |
|
env->err=2; |
| 545 |
return; |
return; |
| 546 |
} |
} |
| 547 |
|
|
| 548 |
|
item= (stackitem *)(env->head->item->content.ptr); |
| 549 |
|
while(item->next!=NULL){ |
| 550 |
|
temp= item->next; |
| 551 |
|
item->next= prev; |
| 552 |
|
prev= item; |
| 553 |
|
item= temp; |
| 554 |
|
} |
| 555 |
|
item->next= prev; |
| 556 |
|
|
| 557 |
|
env->head->item->content.ptr=item; |
| 558 |
} |
} |
| 559 |
|
|
| 560 |
/* Make a list. */ |
/* Make a list. */ |
| 561 |
extern void pack(environment *env) |
extern void pack(environment *env) |
| 562 |
{ |
{ |
|
void* delimiter; |
|
| 563 |
stackitem *iterator, *temp; |
stackitem *iterator, *temp; |
| 564 |
value *pack; |
value *pack; |
| 565 |
|
|
|
delimiter= env->head->item->content.ptr; /* Get delimiter */ |
|
|
toss(env); |
|
|
|
|
| 566 |
iterator= env->head; |
iterator= env->head; |
| 567 |
|
|
| 568 |
if(iterator==NULL || iterator->item->content.ptr==delimiter) { |
if(iterator==NULL |
| 569 |
|
|| (iterator->item->type==symb |
| 570 |
|
&& ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) { |
| 571 |
temp= NULL; |
temp= NULL; |
| 572 |
toss(env); |
toss(env); |
| 573 |
} else { |
} else { |
| 574 |
/* Search for first delimiter */ |
/* Search for first delimiter */ |
| 575 |
while(iterator->next!=NULL |
while(iterator->next!=NULL |
| 576 |
&& iterator->next->item->content.ptr!=delimiter) |
&& (iterator->next->item->type!=symb |
| 577 |
|
|| ((symbol*)(iterator->next->item->content.ptr))->id[0]!='[')) |
| 578 |
iterator= iterator->next; |
iterator= iterator->next; |
| 579 |
|
|
| 580 |
/* Extract list */ |
/* Extract list */ |
| 592 |
pack->content.ptr= temp; |
pack->content.ptr= temp; |
| 593 |
pack->refcount= 1; |
pack->refcount= 1; |
| 594 |
|
|
| 595 |
temp= malloc(sizeof(stackitem)); |
push_val(env, pack); |
| 596 |
temp->item= pack; |
rev(env); |
|
|
|
|
push(&(env->head), temp); |
|
|
} |
|
|
|
|
|
/* Parse input. */ |
|
|
int 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 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 0; |
|
|
} |
|
|
|
|
|
stack_read(env, rest); |
|
|
|
|
|
free(rest); |
|
|
return 1; |
|
| 597 |
} |
} |
| 598 |
|
|
| 599 |
/* Relocate elements of the list on the stack. */ |
/* Relocate elements of the list on the stack. */ |
| 602 |
stackitem *temp, *new_head; |
stackitem *temp, *new_head; |
| 603 |
|
|
| 604 |
/* Is top element a list? */ |
/* Is top element a list? */ |
| 605 |
if(env->head==NULL || env->head->item->type!=list) { |
if(env->head==NULL) { |
| 606 |
printerr("Stack empty or not a list"); |
printerr("Too Few Arguments"); |
| 607 |
|
env->err=1; |
| 608 |
|
return; |
| 609 |
|
} |
| 610 |
|
if(env->head->item->type!=list) { |
| 611 |
|
printerr("Bad Argument Type"); |
| 612 |
|
env->err=2; |
| 613 |
return; |
return; |
| 614 |
} |
} |
| 615 |
|
|
| 616 |
|
rev(env); |
| 617 |
|
|
| 618 |
|
if(env->err) |
| 619 |
|
return; |
| 620 |
|
|
| 621 |
/* The first list element is the new stack head */ |
/* The first list element is the new stack head */ |
| 622 |
new_head= temp= env->head->item->content.ptr; |
new_head= temp= env->head->item->content.ptr; |
| 623 |
|
|
| 641 |
int result; |
int result; |
| 642 |
|
|
| 643 |
if((env->head)==NULL || env->head->next==NULL) { |
if((env->head)==NULL || env->head->next==NULL) { |
| 644 |
printerr("Not enough elements to compare"); |
printerr("Too Few Arguments"); |
| 645 |
|
env->err=1; |
| 646 |
return; |
return; |
| 647 |
} |
} |
| 648 |
|
|
| 652 |
result= (left==right); |
result= (left==right); |
| 653 |
|
|
| 654 |
toss(env); toss(env); |
toss(env); toss(env); |
| 655 |
push_int(&(env->head), result); |
push_int(env, result); |
| 656 |
} |
} |
| 657 |
|
|
| 658 |
/* Negates the top element on the stack. */ |
/* Negates the top element on the stack. */ |
| 660 |
{ |
{ |
| 661 |
int val; |
int val; |
| 662 |
|
|
| 663 |
if((env->head)==NULL || env->head->item->type!=integer) { |
if((env->head)==NULL) { |
| 664 |
printerr("Stack empty or element is not a integer"); |
printerr("Too Few Arguments"); |
| 665 |
|
env->err=1; |
| 666 |
|
return; |
| 667 |
|
} |
| 668 |
|
|
| 669 |
|
if(env->head->item->type!=integer) { |
| 670 |
|
printerr("Bad Argument Type"); |
| 671 |
|
env->err=2; |
| 672 |
return; |
return; |
| 673 |
} |
} |
| 674 |
|
|
| 675 |
val= env->head->item->content.val; |
val= env->head->item->content.val; |
| 676 |
toss(env); |
toss(env); |
| 677 |
push_int(&(env->head), !val); |
push_int(env, !val); |
| 678 |
} |
} |
| 679 |
|
|
| 680 |
/* Compares the two top elements on the stack and return 0 if they're the |
/* Compares the two top elements on the stack and return 0 if they're the |
| 691 |
symbol *sym; |
symbol *sym; |
| 692 |
|
|
| 693 |
/* 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 */ |
| 694 |
if(env->head==NULL || env->head->next==NULL |
if(env->head==NULL || env->head->next==NULL) { |
| 695 |
|| env->head->item->type!=symb) { |
printerr("Too Few Arguments"); |
| 696 |
printerr("Define what?"); |
env->err=1; |
| 697 |
|
return; |
| 698 |
|
} |
| 699 |
|
|
| 700 |
|
if(env->head->item->type!=symb) { |
| 701 |
|
printerr("Bad Argument Type"); |
| 702 |
|
env->err=2; |
| 703 |
return; |
return; |
| 704 |
} |
} |
| 705 |
|
|
| 717 |
toss(env); toss(env); |
toss(env); toss(env); |
| 718 |
} |
} |
| 719 |
|
|
| 720 |
|
extern void clear(environment *); |
| 721 |
|
void forget_sym(symbol **); |
| 722 |
|
|
| 723 |
/* Quit stack. */ |
/* Quit stack. */ |
| 724 |
extern void quit(environment *env) |
extern void quit(environment *env) |
| 725 |
{ |
{ |
| 726 |
|
long i; |
| 727 |
|
|
| 728 |
|
clear(env); |
| 729 |
|
if (env->err) return; |
| 730 |
|
for(i= 0; i<HASHTBLSIZE; i++) { |
| 731 |
|
if (env->symbols[i]!= NULL) { |
| 732 |
|
forget_sym(&(env->symbols[i])); |
| 733 |
|
env->symbols[i]= NULL; |
| 734 |
|
} |
| 735 |
|
} |
| 736 |
exit(EXIT_SUCCESS); |
exit(EXIT_SUCCESS); |
| 737 |
} |
} |
| 738 |
|
|
| 743 |
toss(env); |
toss(env); |
| 744 |
} |
} |
| 745 |
|
|
| 746 |
|
/* List all defined words */ |
| 747 |
|
extern void words(environment *env) |
| 748 |
|
{ |
| 749 |
|
symbol *temp; |
| 750 |
|
int i; |
| 751 |
|
|
| 752 |
|
for(i= 0; i<HASHTBLSIZE; i++) { |
| 753 |
|
temp= env->symbols[i]; |
| 754 |
|
while(temp!=NULL) { |
| 755 |
|
printf("%s\n", temp->id); |
| 756 |
|
temp= temp->next; |
| 757 |
|
} |
| 758 |
|
} |
| 759 |
|
} |
| 760 |
|
|
| 761 |
|
/* Internal forget function */ |
| 762 |
|
void forget_sym(symbol **hash_entry) { |
| 763 |
|
symbol *temp; |
| 764 |
|
|
| 765 |
|
temp= *hash_entry; |
| 766 |
|
*hash_entry= (*hash_entry)->next; |
| 767 |
|
|
| 768 |
|
if(temp->val!=NULL) { |
| 769 |
|
free_val(temp->val); |
| 770 |
|
} |
| 771 |
|
free(temp->id); |
| 772 |
|
free(temp); |
| 773 |
|
} |
| 774 |
|
|
| 775 |
|
/* Forgets a symbol (remove it from the hash table) */ |
| 776 |
|
extern void forget(environment *env) |
| 777 |
|
{ |
| 778 |
|
char* sym_id; |
| 779 |
|
stackitem *stack_head= env->head; |
| 780 |
|
|
| 781 |
|
if(stack_head==NULL) { |
| 782 |
|
printerr("Too Few Arguments"); |
| 783 |
|
env->err=1; |
| 784 |
|
return; |
| 785 |
|
} |
| 786 |
|
|
| 787 |
|
if(stack_head->item->type!=symb) { |
| 788 |
|
printerr("Bad Argument Type"); |
| 789 |
|
env->err=2; |
| 790 |
|
return; |
| 791 |
|
} |
| 792 |
|
|
| 793 |
|
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
| 794 |
|
toss(env); |
| 795 |
|
|
| 796 |
|
return forget_sym(hash(env->symbols, sym_id)); |
| 797 |
|
} |
| 798 |
|
|
| 799 |
|
/* Returns the current error number to the stack */ |
| 800 |
|
extern void errn(environment *env){ |
| 801 |
|
push_int(env, 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 |
|
printstack(&myenv); |
| 815 |
|
read(&myenv); |
| 816 |
|
if(myenv.err) { |
| 817 |
|
printf("(error %d) ", myenv.err); |
| 818 |
|
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 |
|
} |
| 825 |
|
} |
| 826 |
|
quit(&myenv); |
| 827 |
|
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 |
while(fgets(in_string, 100, stdin) != NULL) { |
if((env->head)==NULL || env->head->next==NULL) { |
| 838 |
stack_read(&myenv, in_string); |
printerr("Too Few Arguments"); |
| 839 |
printf("okidok\n "); |
env->err=1; |
| 840 |
|
return; |
| 841 |
} |
} |
| 842 |
|
|
| 843 |
exit(EXIT_SUCCESS); |
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, 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, 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, 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, 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, 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, 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, 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, iterator->item); |
| 1136 |
|
push_val(env, 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 |
|
stackitem *temp_head; |
| 1149 |
|
value *temp_val; |
| 1150 |
|
|
| 1151 |
|
if((env->head)==NULL || env->head->next==NULL) { |
| 1152 |
|
printerr("Too Few Arguments"); |
| 1153 |
|
env->err=1; |
| 1154 |
|
return; |
| 1155 |
|
} |
| 1156 |
|
|
| 1157 |
|
if(env->head->item->type!=integer |
| 1158 |
|
|| env->head->next->item->type!=integer) { |
| 1159 |
|
printerr("Bad Argument Type"); |
| 1160 |
|
env->err=2; |
| 1161 |
|
return; |
| 1162 |
|
} |
| 1163 |
|
|
| 1164 |
|
ending= env->head->item->content.val; |
| 1165 |
|
toss(env); if(env->err) return; |
| 1166 |
|
start= env->head->item->content.val; |
| 1167 |
|
toss(env); if(env->err) return; |
| 1168 |
|
|
| 1169 |
|
temp_head= env->head; |
| 1170 |
|
env->head= NULL; |
| 1171 |
|
|
| 1172 |
|
if(ending>=start) { |
| 1173 |
|
for(i= ending; i>=start; i--) |
| 1174 |
|
push_int(env, i); |
| 1175 |
|
} else { |
| 1176 |
|
for(i= ending; i<=start; i++) |
| 1177 |
|
push_int(env, i); |
| 1178 |
|
} |
| 1179 |
|
|
| 1180 |
|
temp_val= malloc(sizeof(value)); |
| 1181 |
|
temp_val->content.ptr= env->head; |
| 1182 |
|
temp_val->refcount= 1; |
| 1183 |
|
temp_val->type= list; |
| 1184 |
|
env->head= temp_head; |
| 1185 |
|
push_val(env, temp_val); |
| 1186 |
|
} |
| 1187 |
|
|
| 1188 |
|
/* Read a string */ |
| 1189 |
|
extern void readline(environment *env) { |
| 1190 |
|
char in_string[101]; |
| 1191 |
|
|
| 1192 |
|
fgets(in_string, 100, stdin); |
| 1193 |
|
push_cstring(env, in_string); |
| 1194 |
|
} |
| 1195 |
|
|
| 1196 |
|
/* Read a value and place on stack */ |
| 1197 |
|
extern void read(environment *env) { |
| 1198 |
|
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%[\001-\377]"; |
| 1199 |
|
const char strform[]= "\"%[^\"]\"%[\001-\377]"; |
| 1200 |
|
const char intform[]= "%i%[\001-\377]"; |
| 1201 |
|
const char blankform[]= "%*[ \t]%[\001-\377]"; |
| 1202 |
|
const char ebrackform[]= "%*1[]]%[\001-\377]"; |
| 1203 |
|
const char semicform[]= "%*1[;]%[\001-\377]"; |
| 1204 |
|
const char bbrackform[]= "%*1[[]%[\001-\377]"; |
| 1205 |
|
|
| 1206 |
|
int itemp; |
| 1207 |
|
static int depth= 0; |
| 1208 |
|
char *rest, *match; |
| 1209 |
|
size_t inlength; |
| 1210 |
|
|
| 1211 |
|
if(env->in_string==NULL) { |
| 1212 |
|
readline(env); if(env->err) return; |
| 1213 |
|
|
| 1214 |
|
env->in_string= malloc(strlen(env->head->item->content.ptr)+1); |
| 1215 |
|
strcpy(env->in_string, env->head->item->content.ptr); |
| 1216 |
|
toss(env); if(env->err) return; |
| 1217 |
|
} |
| 1218 |
|
|
| 1219 |
|
inlength= strlen(env->in_string)+1; |
| 1220 |
|
match= malloc(inlength); |
| 1221 |
|
rest= malloc(inlength); |
| 1222 |
|
|
| 1223 |
|
if(sscanf(env->in_string, blankform, rest)) { |
| 1224 |
|
; |
| 1225 |
|
} else if(sscanf(env->in_string, intform, &itemp, rest) > 0) { |
| 1226 |
|
push_int(env, itemp); |
| 1227 |
|
} else if(sscanf(env->in_string, strform, match, rest) > 0) { |
| 1228 |
|
push_cstring(env, match); |
| 1229 |
|
} else if(sscanf(env->in_string, symbform, match, rest) > 0) { |
| 1230 |
|
push_sym(env, match); |
| 1231 |
|
} else if(sscanf(env->in_string, ebrackform, rest) > 0) { |
| 1232 |
|
pack(env); if(env->err) return; |
| 1233 |
|
if(depth!=0) depth--; |
| 1234 |
|
} else if(sscanf(env->in_string, semicform, rest) > 0) { |
| 1235 |
|
push_sym(env, ";"); |
| 1236 |
|
} else if(sscanf(env->in_string, bbrackform, rest) > 0) { |
| 1237 |
|
push_sym(env, "["); |
| 1238 |
|
depth++; |
| 1239 |
|
} else { |
| 1240 |
|
free(rest); |
| 1241 |
|
rest= NULL; |
| 1242 |
|
} |
| 1243 |
|
|
| 1244 |
|
free(env->in_string); |
| 1245 |
|
free(match); |
| 1246 |
|
|
| 1247 |
|
env->in_string= rest; |
| 1248 |
|
|
| 1249 |
|
if(depth) |
| 1250 |
|
return read(env); |
| 1251 |
} |
} |