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 |
|
|
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 |
|
char *free_string; /* Free this string when all input is |
64 |
|
read from in_string */ |
65 |
} environment; |
} environment; |
66 |
|
|
67 |
/* A type for pointers to external functions */ |
/* A type for pointers to external functions */ |
71 |
/* Initialize a newly created environment */ |
/* Initialize a newly created environment */ |
72 |
void init_env(environment *env) |
void init_env(environment *env) |
73 |
{ |
{ |
74 |
long i; |
int i; |
75 |
|
|
76 |
env->err=0; |
env->in_string= NULL; |
77 |
|
env->err= 0; |
78 |
|
env->non_eval_flag= 0; |
79 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
80 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
81 |
} |
} |
82 |
|
|
83 |
|
void printerr(const char* in_string) { |
84 |
|
fprintf(stderr, "Err: %s\n", in_string); |
85 |
|
} |
86 |
|
|
87 |
|
/* Throw away a value */ |
88 |
|
void free_val(value *val){ |
89 |
|
stackitem *item, *temp; |
90 |
|
|
91 |
|
val->refcount--; /* Decrease the reference count */ |
92 |
|
if(val->refcount == 0){ |
93 |
|
switch (val->type){ /* and free the contents if necessary */ |
94 |
|
case string: |
95 |
|
free(val->content.ptr); |
96 |
|
break; |
97 |
|
case list: /* lists needs to be freed recursively */ |
98 |
|
item=val->content.ptr; |
99 |
|
while(item != NULL) { /* for all stack items */ |
100 |
|
free_val(item->item); /* free the value */ |
101 |
|
temp=item->next; /* save next ptr */ |
102 |
|
free(item); /* free the stackitem */ |
103 |
|
item=temp; /* go to next stackitem */ |
104 |
|
} |
105 |
|
free(val); /* Free the actual list value */ |
106 |
|
break; |
107 |
|
case integer: |
108 |
|
case func: |
109 |
|
case symb: |
110 |
|
break; |
111 |
|
} |
112 |
|
} |
113 |
|
} |
114 |
|
|
115 |
|
/* Discard the top element of the stack. */ |
116 |
|
extern void toss(environment *env) |
117 |
|
{ |
118 |
|
stackitem *temp= env->head; |
119 |
|
|
120 |
|
if((env->head)==NULL) { |
121 |
|
printerr("Too Few Arguments"); |
122 |
|
env->err=1; |
123 |
|
return; |
124 |
|
} |
125 |
|
|
126 |
|
free_val(env->head->item); /* Free the value */ |
127 |
|
env->head= env->head->next; /* Remove the top stack item */ |
128 |
|
free(temp); /* Free the old top stack item */ |
129 |
|
} |
130 |
|
|
131 |
/* 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. */ |
132 |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
133 |
{ |
{ |
134 |
long i= 0; |
int i= 0; |
135 |
unsigned long out_hash= 0; |
unsigned int out_hash= 0; |
136 |
char key= '\0'; |
char key= '\0'; |
137 |
symbol **position; |
symbol **position; |
138 |
|
|
157 |
} |
} |
158 |
} |
} |
159 |
|
|
|
/* Generic push function. */ |
|
|
void push(stackitem** stack_head, stackitem* in_item) |
|
|
{ |
|
|
in_item->next= *stack_head; |
|
|
*stack_head= in_item; |
|
|
} |
|
|
|
|
160 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
161 |
void push_val(stackitem **stack_head, value *val) |
void push_val(environment *env, value *val) |
162 |
{ |
{ |
163 |
stackitem *new_item= malloc(sizeof(stackitem)); |
stackitem *new_item= malloc(sizeof(stackitem)); |
164 |
new_item->item= val; |
new_item->item= val; |
165 |
val->refcount++; |
val->refcount++; |
166 |
push(stack_head, new_item); |
new_item->next= env->head; |
167 |
|
env->head= new_item; |
168 |
} |
} |
169 |
|
|
170 |
/* Push an integer onto the stack. */ |
/* Push an integer onto the stack. */ |
171 |
void push_int(stackitem **stack_head, int in_val) |
void push_int(environment *env, int in_val) |
172 |
{ |
{ |
173 |
value *new_value= malloc(sizeof(value)); |
value *new_value= malloc(sizeof(value)); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item= new_value; |
|
174 |
|
|
175 |
new_value->content.val= in_val; |
new_value->content.val= in_val; |
176 |
new_value->type= integer; |
new_value->type= integer; |
177 |
new_value->refcount=1; |
new_value->refcount=1; |
178 |
|
|
179 |
push(stack_head, new_item); |
push_val(env, new_value); |
180 |
} |
} |
181 |
|
|
182 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
183 |
void push_cstring(stackitem **stack_head, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
184 |
{ |
{ |
185 |
value *new_value= malloc(sizeof(value)); |
value *new_value= malloc(sizeof(value)); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item=new_value; |
|
186 |
|
|
187 |
new_value->content.ptr= malloc(strlen(in_string)+1); |
new_value->content.ptr= malloc(strlen(in_string)+1); |
188 |
strcpy(new_value->content.ptr, in_string); |
strcpy(new_value->content.ptr, in_string); |
189 |
new_value->type= string; |
new_value->type= string; |
190 |
new_value->refcount=1; |
new_value->refcount=1; |
191 |
|
|
192 |
push(stack_head, new_item); |
push_val(env, new_value); |
193 |
|
} |
194 |
|
|
195 |
|
/* Mangle a symbol name to a valid C identifier name */ |
196 |
|
char *mangle_str(const char *old_string){ |
197 |
|
char validchars[] |
198 |
|
="0123456789abcdef"; |
199 |
|
char *new_string, *current; |
200 |
|
|
201 |
|
new_string=malloc((strlen(old_string)*2)+4); |
202 |
|
strcpy(new_string, "sx_"); /* Stack eXternal */ |
203 |
|
current=new_string+3; |
204 |
|
while(old_string[0] != '\0'){ |
205 |
|
current[0]=validchars[(unsigned char)(old_string[0])/16]; |
206 |
|
current[1]=validchars[(unsigned char)(old_string[0])%16]; |
207 |
|
current+=2; |
208 |
|
old_string++; |
209 |
|
} |
210 |
|
current[0]='\0'; |
211 |
|
|
212 |
|
return new_string; /* The caller must free() it */ |
213 |
|
} |
214 |
|
|
215 |
|
extern void mangle(environment *env){ |
216 |
|
value *new_value; |
217 |
|
char *new_string; |
218 |
|
|
219 |
|
if((env->head)==NULL) { |
220 |
|
printerr("Too Few Arguments"); |
221 |
|
env->err=1; |
222 |
|
return; |
223 |
|
} |
224 |
|
|
225 |
|
if(env->head->item->type!=string) { |
226 |
|
printerr("Bad Argument Type"); |
227 |
|
env->err=2; |
228 |
|
return; |
229 |
|
} |
230 |
|
|
231 |
|
new_string= mangle_str((const char *)(env->head->item->content.ptr)); |
232 |
|
|
233 |
|
toss(env); |
234 |
|
if(env->err) return; |
235 |
|
|
236 |
|
new_value= malloc(sizeof(value)); |
237 |
|
new_value->content.ptr= new_string; |
238 |
|
new_value->type= string; |
239 |
|
new_value->refcount=1; |
240 |
|
|
241 |
|
push_val(env, new_value); |
242 |
} |
} |
243 |
|
|
244 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
245 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
246 |
{ |
{ |
|
stackitem *new_item; /* The new stack item */ |
|
|
/* ...which will contain... */ |
|
247 |
value *new_value; /* A new symbol value */ |
value *new_value; /* A new symbol value */ |
248 |
/* ...which might point to... */ |
/* ...which might point to... */ |
249 |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
253 |
void *funcptr; /* A function pointer */ |
void *funcptr; /* A function pointer */ |
254 |
|
|
255 |
static void *handle= NULL; /* Dynamic linker handle */ |
static void *handle= NULL; /* Dynamic linker handle */ |
256 |
|
const char *dlerr; /* Dynamic linker error */ |
257 |
|
char *mangled; /* Mangled function name */ |
258 |
|
|
|
/* Create a new stack item containing a new value */ |
|
|
new_item= malloc(sizeof(stackitem)); |
|
259 |
new_value= malloc(sizeof(value)); |
new_value= malloc(sizeof(value)); |
|
new_item->item=new_value; |
|
260 |
|
|
261 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
262 |
new_value->type= symb; |
new_value->type= symb; |
284 |
handle= dlopen(NULL, RTLD_LAZY); |
handle= dlopen(NULL, RTLD_LAZY); |
285 |
|
|
286 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
287 |
if(dlerror()==NULL) { /* If a function was found */ |
dlerr=dlerror(); |
288 |
|
if(dlerr != NULL) { /* If no function was found */ |
289 |
|
mangled=mangle_str(in_string); |
290 |
|
funcptr= dlsym(handle, mangled); /* try mangling it */ |
291 |
|
free(mangled); |
292 |
|
dlerr=dlerror(); |
293 |
|
} |
294 |
|
if(dlerr==NULL) { /* If a function was found */ |
295 |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
296 |
new_fvalue->type=func; /* The new value is a function pointer */ |
new_fvalue->type=func; /* The new value is a function pointer */ |
297 |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
300 |
new_fvalue->refcount= 1; |
new_fvalue->refcount= 1; |
301 |
} |
} |
302 |
} |
} |
303 |
push(&(env->head), new_item); |
push_val(env, new_value); |
|
} |
|
|
|
|
|
void printerr(const char* in_string) { |
|
|
fprintf(stderr, "Err: %s\n", in_string); |
|
304 |
} |
} |
305 |
|
|
306 |
/* Throw away a value */ |
/* Print newline. */ |
307 |
void free_val(value *val){ |
extern void nl() |
308 |
stackitem *item, *temp; |
{ |
309 |
|
printf("\n"); |
|
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; |
|
|
} |
|
|
} |
|
310 |
} |
} |
311 |
|
|
312 |
/* Discard the top element of the stack. */ |
/* Gets the type of a value */ |
313 |
extern void toss(environment *env) |
extern void type(environment *env){ |
314 |
{ |
int typenum; |
|
stackitem *temp= env->head; |
|
315 |
|
|
316 |
if((env->head)==NULL) { |
if((env->head)==NULL) { |
317 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
318 |
env->err=1; |
env->err=1; |
319 |
return; |
return; |
320 |
} |
} |
321 |
|
typenum=env->head->item->type; |
322 |
free_val(env->head->item); /* Free the value */ |
toss(env); |
323 |
env->head= env->head->next; /* Remove the top stack item */ |
switch(typenum){ |
324 |
free(temp); /* Free the old top stack item */ |
case integer: |
325 |
} |
push_sym(env, "integer"); |
326 |
|
break; |
327 |
/* Print newline. */ |
case string: |
328 |
extern void nl() |
push_sym(env, "string"); |
329 |
{ |
break; |
330 |
printf("\n"); |
case symb: |
331 |
} |
push_sym(env, "symbol"); |
332 |
|
break; |
333 |
|
case func: |
334 |
|
push_sym(env, "function"); |
335 |
|
break; |
336 |
|
case list: |
337 |
|
push_sym(env, "list"); |
338 |
|
break; |
339 |
|
} |
340 |
|
} |
341 |
|
|
342 |
/* Prints the top element of the stack. */ |
/* Prints the top element of the stack. */ |
343 |
void print_h(stackitem *stack_head) |
void print_h(stackitem *stack_head, int noquote) |
344 |
{ |
{ |
345 |
switch(stack_head->item->type) { |
switch(stack_head->item->type) { |
346 |
case integer: |
case integer: |
347 |
printf("%d", stack_head->item->content.val); |
printf("%d", stack_head->item->content.val); |
348 |
break; |
break; |
349 |
case string: |
case string: |
350 |
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
if(noquote) |
351 |
|
printf("%s", (char*)stack_head->item->content.ptr); |
352 |
|
else |
353 |
|
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
354 |
break; |
break; |
355 |
case symb: |
case symb: |
356 |
printf("'%s'", ((symbol *)(stack_head->item->content.ptr))->id); |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
357 |
break; |
break; |
358 |
case func: |
case func: |
359 |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
360 |
break; |
break; |
361 |
case list: |
case list: |
362 |
printf("#<list %p>", (funcp)(stack_head->item->content.ptr)); |
/* A list is just a stack, so make stack_head point to it */ |
363 |
break; |
stack_head=(stackitem *)(stack_head->item->content.ptr); |
364 |
default: |
printf("[ "); |
365 |
printf("#<unknown %p>", (funcp)(stack_head->item->content.ptr)); |
while(stack_head != NULL) { |
366 |
|
print_h(stack_head, noquote); |
367 |
|
printf(" "); |
368 |
|
stack_head=stack_head->next; |
369 |
|
} |
370 |
|
printf("]"); |
371 |
break; |
break; |
372 |
} |
} |
373 |
} |
} |
374 |
|
|
375 |
extern void print_(environment *env) { |
extern void print_(environment *env) { |
376 |
if(env->head==NULL) { |
if(env->head==NULL) { |
377 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
378 |
env->err=1; |
env->err=1; |
379 |
return; |
return; |
380 |
} |
} |
381 |
print_h(env->head); |
print_h(env->head, 0); |
382 |
|
nl(); |
383 |
} |
} |
384 |
|
|
385 |
/* Prints the top element of the stack and then discards it. */ |
/* Prints the top element of the stack and then discards it. */ |
390 |
toss(env); |
toss(env); |
391 |
} |
} |
392 |
|
|
393 |
|
extern void princ_(environment *env) { |
394 |
|
if(env->head==NULL) { |
395 |
|
printerr("Too Few Arguments"); |
396 |
|
env->err=1; |
397 |
|
return; |
398 |
|
} |
399 |
|
print_h(env->head, 1); |
400 |
|
} |
401 |
|
|
402 |
|
/* Prints the top element of the stack and then discards it. */ |
403 |
|
extern void princ(environment *env) |
404 |
|
{ |
405 |
|
princ_(env); |
406 |
|
if(env->err) return; |
407 |
|
toss(env); |
408 |
|
} |
409 |
|
|
410 |
/* Only to be called by function printstack. */ |
/* Only to be called by function printstack. */ |
411 |
void print_st(stackitem *stack_head, long counter) |
void print_st(stackitem *stack_head, long counter) |
412 |
{ |
{ |
413 |
if(stack_head->next != NULL) |
if(stack_head->next != NULL) |
414 |
print_st(stack_head->next, counter+1); |
print_st(stack_head->next, counter+1); |
415 |
printf("%ld: ", counter); |
printf("%ld: ", counter); |
416 |
print_h(stack_head); |
print_h(stack_head, 0); |
417 |
nl(); |
nl(); |
418 |
} |
} |
419 |
|
|
|
|
|
|
|
|
420 |
/* Prints the stack. */ |
/* Prints the stack. */ |
421 |
extern void printstack(environment *env) |
extern void printstack(environment *env) |
422 |
{ |
{ |
423 |
if(env->head == NULL) { |
if(env->head == NULL) { |
424 |
printerr("Stack empty"); |
printf("Stack Empty\n"); |
|
env->err=1; |
|
425 |
return; |
return; |
426 |
} |
} |
427 |
print_st(env->head, 1); |
print_st(env->head, 1); |
|
nl(); |
|
428 |
} |
} |
429 |
|
|
430 |
/* Swap the two top elements on the stack. */ |
/* Swap the two top elements on the stack. */ |
432 |
{ |
{ |
433 |
stackitem *temp= env->head; |
stackitem *temp= env->head; |
434 |
|
|
435 |
if((env->head)==NULL) { |
if(env->head==NULL || env->head->next==NULL) { |
436 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->next==NULL) { |
|
|
printerr("Not enough arguments"); |
|
437 |
env->err=1; |
env->err=1; |
438 |
return; |
return; |
439 |
} |
} |
443 |
env->head->next= temp; |
env->head->next= temp; |
444 |
} |
} |
445 |
|
|
446 |
stackitem* copy(stackitem* in_item) |
/* Rotate the first three elements on the stack. */ |
447 |
|
extern void rot(environment *env) |
448 |
{ |
{ |
449 |
stackitem *out_item= malloc(sizeof(stackitem)); |
stackitem *temp= env->head; |
450 |
|
|
451 |
memcpy(out_item, in_item, sizeof(stackitem)); |
if(env->head==NULL || env->head->next==NULL |
452 |
out_item->next= NULL; |
|| env->head->next->next==NULL) { |
453 |
|
printerr("Too Few Arguments"); |
454 |
|
env->err=1; |
455 |
|
return; |
456 |
|
} |
457 |
|
|
458 |
return out_item; |
env->head= env->head->next->next; |
459 |
|
temp->next->next= env->head->next; |
460 |
|
env->head->next= temp; |
461 |
} |
} |
462 |
|
|
463 |
/* Recall a value from a symbol, if bound */ |
/* Recall a value from a symbol, if bound */ |
466 |
value *val; |
value *val; |
467 |
|
|
468 |
if(env->head == NULL) { |
if(env->head == NULL) { |
469 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
470 |
env->err=1; |
env->err=1; |
471 |
return; |
return; |
472 |
} |
} |
473 |
|
|
474 |
if(env->head->item->type!=symb) { |
if(env->head->item->type!=symb) { |
475 |
printerr("Not a symbol"); |
printerr("Bad Argument Type"); |
476 |
env->err=1; |
env->err=2; |
477 |
return; |
return; |
478 |
} |
} |
479 |
|
|
480 |
val=((symbol *)(env->head->item->content.ptr))->val; |
val=((symbol *)(env->head->item->content.ptr))->val; |
481 |
if(val == NULL){ |
if(val == NULL){ |
482 |
printerr("Unbound variable"); |
printerr("Unbound Variable"); |
483 |
env->err=1; |
env->err=3; |
484 |
return; |
return; |
485 |
} |
} |
486 |
toss(env); /* toss the symbol */ |
toss(env); /* toss the symbol */ |
487 |
if(env->err) return; |
if(env->err) return; |
488 |
push_val(&(env->head), val); /* Return its bound value */ |
push_val(env, val); /* Return its bound value */ |
489 |
} |
} |
490 |
|
|
491 |
/* 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 |
494 |
extern void eval(environment *env) |
extern void eval(environment *env) |
495 |
{ |
{ |
496 |
funcp in_func; |
funcp in_func; |
497 |
|
value* temp_val; |
498 |
|
stackitem* iterator; |
499 |
|
|
500 |
|
eval_start: |
501 |
|
|
502 |
if(env->head==NULL) { |
if(env->head==NULL) { |
503 |
printerr("Stack empty"); |
printerr("Too Few Arguments"); |
504 |
env->err=1; |
env->err=1; |
505 |
return; |
return; |
506 |
} |
} |
507 |
|
|
508 |
/* if it's a symbol */ |
switch(env->head->item->type) { |
509 |
if(env->head->item->type==symb) { |
/* if it's a symbol */ |
510 |
|
case symb: |
511 |
rcl(env); /* get its contents */ |
rcl(env); /* get its contents */ |
512 |
if(env->err) return; |
if(env->err) return; |
513 |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
514 |
eval(env); /* evaluate the value */ |
goto eval_start; |
|
return; |
|
515 |
} |
} |
516 |
} |
return; |
517 |
|
|
518 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
519 |
if(env->head->item->type==func) { |
case func: |
520 |
in_func= (funcp)(env->head->item->content.ptr); |
in_func= (funcp)(env->head->item->content.ptr); |
521 |
toss(env); |
toss(env); |
522 |
if(env->err) return; |
if(env->err) return; |
523 |
(*in_func)(env); |
return (*in_func)(env); |
524 |
|
|
525 |
|
/* If it's a list */ |
526 |
|
case list: |
527 |
|
temp_val= env->head->item; |
528 |
|
env->head->item->refcount++; |
529 |
|
toss(env); |
530 |
|
if(env->err) return; |
531 |
|
iterator= (stackitem*)temp_val->content.ptr; |
532 |
|
while(iterator!=NULL) { |
533 |
|
push_val(env, iterator->item); |
534 |
|
if(env->head->item->type==symb |
535 |
|
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
536 |
|
toss(env); |
537 |
|
if(env->err) return; |
538 |
|
if(iterator->next == NULL){ |
539 |
|
free_val(temp_val); |
540 |
|
goto eval_start; |
541 |
|
} |
542 |
|
eval(env); |
543 |
|
if(env->err) return; |
544 |
|
} |
545 |
|
iterator= iterator->next; |
546 |
|
} |
547 |
|
free_val(temp_val); |
548 |
|
return; |
549 |
|
|
550 |
|
default: |
551 |
|
return; |
552 |
|
} |
553 |
|
} |
554 |
|
|
555 |
|
/* Reverse (flip) a list */ |
556 |
|
extern void rev(environment *env){ |
557 |
|
stackitem *old_head, *new_head, *item; |
558 |
|
|
559 |
|
if((env->head)==NULL) { |
560 |
|
printerr("Too Few Arguments"); |
561 |
|
env->err=1; |
562 |
|
return; |
563 |
|
} |
564 |
|
|
565 |
|
if(env->head->item->type!=list) { |
566 |
|
printerr("Bad Argument Type"); |
567 |
|
env->err=2; |
568 |
|
return; |
569 |
|
} |
570 |
|
|
571 |
|
old_head=(stackitem *)(env->head->item->content.ptr); |
572 |
|
new_head=NULL; |
573 |
|
while(old_head != NULL){ |
574 |
|
item=old_head; |
575 |
|
old_head=old_head->next; |
576 |
|
item->next=new_head; |
577 |
|
new_head=item; |
578 |
} |
} |
579 |
|
env->head->item->content.ptr=new_head; |
580 |
} |
} |
581 |
|
|
582 |
/* Make a list. */ |
/* Make a list. */ |
583 |
extern void pack(environment *env) |
extern void pack(environment *env) |
584 |
{ |
{ |
|
void* delimiter; |
|
585 |
stackitem *iterator, *temp; |
stackitem *iterator, *temp; |
586 |
value *pack; |
value *pack; |
587 |
|
|
|
delimiter= env->head->item->content.ptr; /* Get delimiter */ |
|
|
toss(env); |
|
|
|
|
588 |
iterator= env->head; |
iterator= env->head; |
589 |
|
|
590 |
if(iterator==NULL || iterator->item->content.ptr==delimiter) { |
if(iterator==NULL |
591 |
|
|| (iterator->item->type==symb |
592 |
|
&& ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) { |
593 |
temp= NULL; |
temp= NULL; |
594 |
toss(env); |
toss(env); |
595 |
} else { |
} else { |
596 |
/* Search for first delimiter */ |
/* Search for first delimiter */ |
597 |
while(iterator->next!=NULL |
while(iterator->next!=NULL |
598 |
&& iterator->next->item->content.ptr!=delimiter) |
&& (iterator->next->item->type!=symb |
599 |
|
|| ((symbol*)(iterator->next->item->content.ptr))->id[0]!='[')) |
600 |
iterator= iterator->next; |
iterator= iterator->next; |
601 |
|
|
602 |
/* Extract list */ |
/* Extract list */ |
614 |
pack->content.ptr= temp; |
pack->content.ptr= temp; |
615 |
pack->refcount= 1; |
pack->refcount= 1; |
616 |
|
|
617 |
temp= malloc(sizeof(stackitem)); |
push_val(env, pack); |
618 |
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; |
|
619 |
} |
} |
620 |
|
|
621 |
/* Relocate elements of the list on the stack. */ |
/* Relocate elements of the list on the stack. */ |
624 |
stackitem *temp, *new_head; |
stackitem *temp, *new_head; |
625 |
|
|
626 |
/* Is top element a list? */ |
/* Is top element a list? */ |
627 |
if(env->head==NULL || env->head->item->type!=list) { |
if(env->head==NULL) { |
628 |
printerr("Stack empty or not a list"); |
printerr("Too Few Arguments"); |
629 |
env->err=1; |
env->err=1; |
630 |
return; |
return; |
631 |
} |
} |
632 |
|
if(env->head->item->type!=list) { |
633 |
|
printerr("Bad Argument Type"); |
634 |
|
env->err=2; |
635 |
|
return; |
636 |
|
} |
637 |
|
|
638 |
|
rev(env); |
639 |
|
|
640 |
|
if(env->err) |
641 |
|
return; |
642 |
|
|
643 |
/* The first list element is the new stack head */ |
/* The first list element is the new stack head */ |
644 |
new_head= temp= env->head->item->content.ptr; |
new_head= temp= env->head->item->content.ptr; |
663 |
int result; |
int result; |
664 |
|
|
665 |
if((env->head)==NULL || env->head->next==NULL) { |
if((env->head)==NULL || env->head->next==NULL) { |
666 |
printerr("Not enough elements to compare"); |
printerr("Too Few Arguments"); |
667 |
env->err=1; |
env->err=1; |
668 |
return; |
return; |
669 |
} |
} |
674 |
result= (left==right); |
result= (left==right); |
675 |
|
|
676 |
toss(env); toss(env); |
toss(env); toss(env); |
677 |
push_int(&(env->head), result); |
push_int(env, result); |
678 |
} |
} |
679 |
|
|
680 |
/* Negates the top element on the stack. */ |
/* Negates the top element on the stack. */ |
682 |
{ |
{ |
683 |
int val; |
int val; |
684 |
|
|
685 |
if((env->head)==NULL || env->head->item->type!=integer) { |
if((env->head)==NULL) { |
686 |
printerr("Stack empty or element is not a integer"); |
printerr("Too Few Arguments"); |
687 |
env->err=1; |
env->err=1; |
688 |
return; |
return; |
689 |
} |
} |
690 |
|
|
691 |
|
if(env->head->item->type!=integer) { |
692 |
|
printerr("Bad Argument Type"); |
693 |
|
env->err=2; |
694 |
|
return; |
695 |
|
} |
696 |
|
|
697 |
val= env->head->item->content.val; |
val= env->head->item->content.val; |
698 |
toss(env); |
toss(env); |
699 |
push_int(&(env->head), !val); |
push_int(env, !val); |
700 |
} |
} |
701 |
|
|
702 |
/* 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 |
713 |
symbol *sym; |
symbol *sym; |
714 |
|
|
715 |
/* 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 */ |
716 |
if(env->head==NULL || env->head->next==NULL |
if(env->head==NULL || env->head->next==NULL) { |
717 |
|| env->head->item->type!=symb) { |
printerr("Too Few Arguments"); |
|
printerr("Define what?"); |
|
718 |
env->err=1; |
env->err=1; |
719 |
return; |
return; |
720 |
} |
} |
721 |
|
|
722 |
|
if(env->head->item->type!=symb) { |
723 |
|
printerr("Bad Argument Type"); |
724 |
|
env->err=2; |
725 |
|
return; |
726 |
|
} |
727 |
|
|
728 |
/* long names are a pain */ |
/* long names are a pain */ |
729 |
sym=env->head->item->content.ptr; |
sym=env->head->item->content.ptr; |
730 |
|
|
739 |
toss(env); toss(env); |
toss(env); toss(env); |
740 |
} |
} |
741 |
|
|
742 |
|
extern void clear(environment *); |
743 |
|
void forget_sym(symbol **); |
744 |
|
|
745 |
/* Quit stack. */ |
/* Quit stack. */ |
746 |
extern void quit(environment *env) |
extern void quit(environment *env) |
747 |
{ |
{ |
748 |
|
long i; |
749 |
|
|
750 |
|
clear(env); |
751 |
|
if (env->err) return; |
752 |
|
for(i= 0; i<HASHTBLSIZE; i++) { |
753 |
|
while(env->symbols[i]!= NULL) { |
754 |
|
forget_sym(&(env->symbols[i])); |
755 |
|
} |
756 |
|
env->symbols[i]= NULL; |
757 |
|
} |
758 |
exit(EXIT_SUCCESS); |
exit(EXIT_SUCCESS); |
759 |
} |
} |
760 |
|
|
780 |
} |
} |
781 |
} |
} |
782 |
|
|
783 |
|
/* Internal forget function */ |
784 |
|
void forget_sym(symbol **hash_entry) { |
785 |
|
symbol *temp; |
786 |
|
|
787 |
|
temp= *hash_entry; |
788 |
|
*hash_entry= (*hash_entry)->next; |
789 |
|
|
790 |
|
if(temp->val!=NULL) { |
791 |
|
free_val(temp->val); |
792 |
|
} |
793 |
|
free(temp->id); |
794 |
|
free(temp); |
795 |
|
} |
796 |
|
|
797 |
/* Forgets a symbol (remove it from the hash table) */ |
/* Forgets a symbol (remove it from the hash table) */ |
798 |
extern void forget(environment *env) |
extern void forget(environment *env) |
799 |
{ |
{ |
800 |
char* sym_id; |
char* sym_id; |
801 |
stackitem *stack_head= env->head; |
stackitem *stack_head= env->head; |
|
symbol **hash_entry, *temp; |
|
802 |
|
|
803 |
if(stack_head==NULL || stack_head->item->type!=symb) { |
if(stack_head==NULL) { |
804 |
printerr("Stack empty or not a symbol"); |
printerr("Too Few Arguments"); |
805 |
|
env->err=1; |
806 |
|
return; |
807 |
|
} |
808 |
|
|
809 |
|
if(stack_head->item->type!=symb) { |
810 |
|
printerr("Bad Argument Type"); |
811 |
|
env->err=2; |
812 |
return; |
return; |
813 |
} |
} |
814 |
|
|
815 |
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
816 |
toss(env); |
toss(env); |
817 |
|
|
818 |
hash_entry= hash(env->symbols, sym_id); |
return forget_sym(hash(env->symbols, sym_id)); |
819 |
temp= *hash_entry; |
} |
820 |
*hash_entry= (*hash_entry)->next; |
|
821 |
|
/* Returns the current error number to the stack */ |
822 |
if(temp->val!=NULL) { |
extern void errn(environment *env){ |
823 |
free_val(temp->val); |
push_int(env, env->err); |
824 |
} |
} |
825 |
free(temp->id); |
|
826 |
free(temp); |
extern void read(environment*); |
|
} |
|
827 |
|
|
828 |
int main() |
int main() |
829 |
{ |
{ |
830 |
environment myenv; |
environment myenv; |
|
char in_string[100]; |
|
831 |
|
|
832 |
init_env(&myenv); |
init_env(&myenv); |
833 |
|
|
834 |
printf("okidok\n "); |
while(1) { |
835 |
|
if(myenv.in_string==NULL) { |
836 |
while(fgets(in_string, 100, stdin) != NULL) { |
nl(); |
837 |
stack_read(&myenv, in_string); |
printstack(&myenv); |
838 |
|
printf("> "); |
839 |
|
} |
840 |
|
read(&myenv); |
841 |
if(myenv.err) { |
if(myenv.err) { |
842 |
printf("(error %d) ", myenv.err); |
printf("(error %d) ", myenv.err); |
843 |
myenv.err=0; |
myenv.err=0; |
844 |
|
} else if(myenv.head!=NULL |
845 |
|
&& myenv.head->item->type==symb |
846 |
|
&& ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') { |
847 |
|
toss(&myenv); /* No error check in main */ |
848 |
|
eval(&myenv); |
849 |
} |
} |
|
printf("okidok\n "); |
|
850 |
} |
} |
851 |
|
quit(&myenv); |
852 |
|
return EXIT_FAILURE; |
853 |
|
} |
854 |
|
|
855 |
exit(EXIT_SUCCESS); |
/* + */ |
856 |
|
extern void sx_2b(environment *env) { |
857 |
|
int a, b; |
858 |
|
size_t len; |
859 |
|
char* new_string; |
860 |
|
value *a_val, *b_val; |
861 |
|
|
862 |
|
if((env->head)==NULL || env->head->next==NULL) { |
863 |
|
printerr("Too Few Arguments"); |
864 |
|
env->err=1; |
865 |
|
return; |
866 |
|
} |
867 |
|
|
868 |
|
if(env->head->item->type==string |
869 |
|
&& env->head->next->item->type==string) { |
870 |
|
a_val= env->head->item; |
871 |
|
b_val= env->head->next->item; |
872 |
|
a_val->refcount++; |
873 |
|
b_val->refcount++; |
874 |
|
toss(env); if(env->err) return; |
875 |
|
toss(env); if(env->err) return; |
876 |
|
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
877 |
|
new_string= malloc(len); |
878 |
|
strcpy(new_string, b_val->content.ptr); |
879 |
|
strcat(new_string, a_val->content.ptr); |
880 |
|
free_val(a_val); free_val(b_val); |
881 |
|
push_cstring(env, new_string); |
882 |
|
free(new_string); |
883 |
|
return; |
884 |
|
} |
885 |
|
|
886 |
|
if(env->head->item->type!=integer |
887 |
|
|| env->head->next->item->type!=integer) { |
888 |
|
printerr("Bad Argument Type"); |
889 |
|
env->err=2; |
890 |
|
return; |
891 |
|
} |
892 |
|
a=env->head->item->content.val; |
893 |
|
toss(env); |
894 |
|
if(env->err) return; |
895 |
|
if(env->head->item->refcount == 1) |
896 |
|
env->head->item->content.val += a; |
897 |
|
else { |
898 |
|
b=env->head->item->content.val; |
899 |
|
toss(env); |
900 |
|
if(env->err) return; |
901 |
|
push_int(env, a+b); |
902 |
|
} |
903 |
|
} |
904 |
|
|
905 |
|
/* - */ |
906 |
|
extern void sx_2d(environment *env) { |
907 |
|
int a, b; |
908 |
|
|
909 |
|
if((env->head)==NULL || env->head->next==NULL) { |
910 |
|
printerr("Too Few Arguments"); |
911 |
|
env->err=1; |
912 |
|
return; |
913 |
|
} |
914 |
|
|
915 |
|
if(env->head->item->type!=integer |
916 |
|
|| env->head->next->item->type!=integer) { |
917 |
|
printerr("Bad Argument Type"); |
918 |
|
env->err=2; |
919 |
|
return; |
920 |
|
} |
921 |
|
a=env->head->item->content.val; |
922 |
|
toss(env); |
923 |
|
if(env->err) return; |
924 |
|
if(env->head->item->refcount == 1) |
925 |
|
env->head->item->content.val -= a; |
926 |
|
else { |
927 |
|
b=env->head->item->content.val; |
928 |
|
toss(env); |
929 |
|
if(env->err) return; |
930 |
|
push_int(env, b-a); |
931 |
|
} |
932 |
|
} |
933 |
|
|
934 |
|
/* > */ |
935 |
|
extern void sx_3e(environment *env) { |
936 |
|
int a, b; |
937 |
|
|
938 |
|
if((env->head)==NULL || env->head->next==NULL) { |
939 |
|
printerr("Too Few Arguments"); |
940 |
|
env->err=1; |
941 |
|
return; |
942 |
|
} |
943 |
|
|
944 |
|
if(env->head->item->type!=integer |
945 |
|
|| env->head->next->item->type!=integer) { |
946 |
|
printerr("Bad Argument Type"); |
947 |
|
env->err=2; |
948 |
|
return; |
949 |
|
} |
950 |
|
a=env->head->item->content.val; |
951 |
|
toss(env); |
952 |
|
if(env->err) return; |
953 |
|
if(env->head->item->refcount == 1) |
954 |
|
env->head->item->content.val = (env->head->item->content.val > a); |
955 |
|
else { |
956 |
|
b=env->head->item->content.val; |
957 |
|
toss(env); |
958 |
|
if(env->err) return; |
959 |
|
push_int(env, b>a); |
960 |
|
} |
961 |
|
} |
962 |
|
|
963 |
|
/* Return copy of a value */ |
964 |
|
value *copy_val(value *old_value){ |
965 |
|
stackitem *old_item, *new_item, *prev_item; |
966 |
|
|
967 |
|
value *new_value=malloc(sizeof(value)); |
968 |
|
|
969 |
|
new_value->type=old_value->type; |
970 |
|
new_value->refcount=0; /* This is increased if/when this |
971 |
|
value is referenced somewhere, like |
972 |
|
in a stack item or a variable */ |
973 |
|
switch(old_value->type){ |
974 |
|
case integer: |
975 |
|
new_value->content.val=old_value->content.val; |
976 |
|
break; |
977 |
|
case string: |
978 |
|
(char *)(new_value->content.ptr) |
979 |
|
= strdup((char *)(old_value->content.ptr)); |
980 |
|
break; |
981 |
|
case func: |
982 |
|
case symb: |
983 |
|
new_value->content.ptr=old_value->content.ptr; |
984 |
|
break; |
985 |
|
case list: |
986 |
|
new_value->content.ptr=NULL; |
987 |
|
|
988 |
|
prev_item=NULL; |
989 |
|
old_item=(stackitem *)(old_value->content.ptr); |
990 |
|
|
991 |
|
while(old_item != NULL) { /* While list is not empty */ |
992 |
|
new_item= malloc(sizeof(stackitem)); |
993 |
|
new_item->item=copy_val(old_item->item); /* recurse */ |
994 |
|
new_item->next=NULL; |
995 |
|
if(prev_item != NULL) /* If this wasn't the first item */ |
996 |
|
prev_item->next=new_item; /* point the previous item to the |
997 |
|
new item */ |
998 |
|
else |
999 |
|
new_value->content.ptr=new_item; |
1000 |
|
old_item=old_item->next; |
1001 |
|
prev_item=new_item; |
1002 |
|
} |
1003 |
|
break; |
1004 |
|
} |
1005 |
|
return new_value; |
1006 |
|
} |
1007 |
|
|
1008 |
|
/* duplicates an item on the stack */ |
1009 |
|
extern void dup(environment *env) { |
1010 |
|
if((env->head)==NULL) { |
1011 |
|
printerr("Too Few Arguments"); |
1012 |
|
env->err=1; |
1013 |
|
return; |
1014 |
|
} |
1015 |
|
push_val(env, copy_val(env->head->item)); |
1016 |
|
} |
1017 |
|
|
1018 |
|
/* "if", If-Then */ |
1019 |
|
extern void sx_6966(environment *env) { |
1020 |
|
|
1021 |
|
int truth; |
1022 |
|
|
1023 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1024 |
|
printerr("Too Few Arguments"); |
1025 |
|
env->err=1; |
1026 |
|
return; |
1027 |
|
} |
1028 |
|
|
1029 |
|
if(env->head->next->item->type != integer) { |
1030 |
|
printerr("Bad Argument Type"); |
1031 |
|
env->err=2; |
1032 |
|
return; |
1033 |
|
} |
1034 |
|
|
1035 |
|
swap(env); |
1036 |
|
if(env->err) return; |
1037 |
|
|
1038 |
|
truth=env->head->item->content.val; |
1039 |
|
|
1040 |
|
toss(env); |
1041 |
|
if(env->err) return; |
1042 |
|
|
1043 |
|
if(truth) |
1044 |
|
eval(env); |
1045 |
|
else |
1046 |
|
toss(env); |
1047 |
|
} |
1048 |
|
|
1049 |
|
/* If-Then-Else */ |
1050 |
|
extern void ifelse(environment *env) { |
1051 |
|
|
1052 |
|
int truth; |
1053 |
|
|
1054 |
|
if((env->head)==NULL || env->head->next==NULL |
1055 |
|
|| env->head->next->next==NULL) { |
1056 |
|
printerr("Too Few Arguments"); |
1057 |
|
env->err=1; |
1058 |
|
return; |
1059 |
|
} |
1060 |
|
|
1061 |
|
if(env->head->next->next->item->type != integer) { |
1062 |
|
printerr("Bad Argument Type"); |
1063 |
|
env->err=2; |
1064 |
|
return; |
1065 |
|
} |
1066 |
|
|
1067 |
|
rot(env); |
1068 |
|
if(env->err) return; |
1069 |
|
|
1070 |
|
truth=env->head->item->content.val; |
1071 |
|
|
1072 |
|
toss(env); |
1073 |
|
if(env->err) return; |
1074 |
|
|
1075 |
|
if(!truth) |
1076 |
|
swap(env); |
1077 |
|
if(env->err) return; |
1078 |
|
|
1079 |
|
toss(env); |
1080 |
|
if(env->err) return; |
1081 |
|
|
1082 |
|
eval(env); |
1083 |
|
} |
1084 |
|
|
1085 |
|
/* while */ |
1086 |
|
extern void sx_7768696c65(environment *env) { |
1087 |
|
|
1088 |
|
int truth; |
1089 |
|
value *loop, *test; |
1090 |
|
|
1091 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1092 |
|
printerr("Too Few Arguments"); |
1093 |
|
env->err=1; |
1094 |
|
return; |
1095 |
|
} |
1096 |
|
|
1097 |
|
loop= env->head->item; |
1098 |
|
loop->refcount++; |
1099 |
|
toss(env); if(env->err) return; |
1100 |
|
|
1101 |
|
test= env->head->item; |
1102 |
|
test->refcount++; |
1103 |
|
toss(env); if(env->err) return; |
1104 |
|
|
1105 |
|
do { |
1106 |
|
push_val(env, test); |
1107 |
|
eval(env); |
1108 |
|
|
1109 |
|
if(env->head->item->type != integer) { |
1110 |
|
printerr("Bad Argument Type"); |
1111 |
|
env->err=2; |
1112 |
|
return; |
1113 |
|
} |
1114 |
|
|
1115 |
|
truth= env->head->item->content.val; |
1116 |
|
toss(env); if(env->err) return; |
1117 |
|
|
1118 |
|
if(truth) { |
1119 |
|
push_val(env, loop); |
1120 |
|
eval(env); |
1121 |
|
} else { |
1122 |
|
toss(env); |
1123 |
|
} |
1124 |
|
|
1125 |
|
} while(truth); |
1126 |
|
|
1127 |
|
free_val(test); |
1128 |
|
free_val(loop); |
1129 |
|
} |
1130 |
|
|
1131 |
|
/* For-loop */ |
1132 |
|
extern void sx_666f72(environment *env) { |
1133 |
|
|
1134 |
|
value *loop, *foo; |
1135 |
|
stackitem *iterator; |
1136 |
|
|
1137 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1138 |
|
printerr("Too Few Arguments"); |
1139 |
|
env->err=1; |
1140 |
|
return; |
1141 |
|
} |
1142 |
|
|
1143 |
|
if(env->head->next->item->type != list) { |
1144 |
|
printerr("Bad Argument Type"); |
1145 |
|
env->err=2; |
1146 |
|
return; |
1147 |
|
} |
1148 |
|
|
1149 |
|
loop= env->head->item; |
1150 |
|
loop->refcount++; |
1151 |
|
toss(env); if(env->err) return; |
1152 |
|
|
1153 |
|
foo= env->head->item; |
1154 |
|
foo->refcount++; |
1155 |
|
toss(env); if(env->err) return; |
1156 |
|
|
1157 |
|
iterator= foo->content.ptr; |
1158 |
|
|
1159 |
|
while(iterator!=NULL) { |
1160 |
|
push_val(env, iterator->item); |
1161 |
|
push_val(env, loop); |
1162 |
|
eval(env); if(env->err) return; |
1163 |
|
iterator= iterator->next; |
1164 |
|
} |
1165 |
|
|
1166 |
|
free_val(loop); |
1167 |
|
free_val(foo); |
1168 |
|
} |
1169 |
|
|
1170 |
|
/* 'to' */ |
1171 |
|
extern void to(environment *env) { |
1172 |
|
int i, start, ending; |
1173 |
|
stackitem *temp_head; |
1174 |
|
value *temp_val; |
1175 |
|
|
1176 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1177 |
|
printerr("Too Few Arguments"); |
1178 |
|
env->err=1; |
1179 |
|
return; |
1180 |
|
} |
1181 |
|
|
1182 |
|
if(env->head->item->type!=integer |
1183 |
|
|| env->head->next->item->type!=integer) { |
1184 |
|
printerr("Bad Argument Type"); |
1185 |
|
env->err=2; |
1186 |
|
return; |
1187 |
|
} |
1188 |
|
|
1189 |
|
ending= env->head->item->content.val; |
1190 |
|
toss(env); if(env->err) return; |
1191 |
|
start= env->head->item->content.val; |
1192 |
|
toss(env); if(env->err) return; |
1193 |
|
|
1194 |
|
temp_head= env->head; |
1195 |
|
env->head= NULL; |
1196 |
|
|
1197 |
|
if(ending>=start) { |
1198 |
|
for(i= ending; i>=start; i--) |
1199 |
|
push_int(env, i); |
1200 |
|
} else { |
1201 |
|
for(i= ending; i<=start; i++) |
1202 |
|
push_int(env, i); |
1203 |
|
} |
1204 |
|
|
1205 |
|
temp_val= malloc(sizeof(value)); |
1206 |
|
temp_val->content.ptr= env->head; |
1207 |
|
temp_val->refcount= 1; |
1208 |
|
temp_val->type= list; |
1209 |
|
env->head= temp_head; |
1210 |
|
push_val(env, temp_val); |
1211 |
|
} |
1212 |
|
|
1213 |
|
/* Read a string */ |
1214 |
|
extern void readline(environment *env) { |
1215 |
|
char in_string[101]; |
1216 |
|
|
1217 |
|
fgets(in_string, 100, stdin); |
1218 |
|
push_cstring(env, in_string); |
1219 |
|
} |
1220 |
|
|
1221 |
|
/* Read a value and place on stack */ |
1222 |
|
extern void read(environment *env) { |
1223 |
|
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n"; |
1224 |
|
const char strform[]= "\"%[^\"]\"%n"; |
1225 |
|
const char intform[]= "%i%n"; |
1226 |
|
const char blankform[]= "%*[ \t]%n"; |
1227 |
|
const char ebrackform[]= "%*1[]]%n"; |
1228 |
|
const char semicform[]= "%*1[;]%n"; |
1229 |
|
const char bbrackform[]= "%*1[[]%n"; |
1230 |
|
|
1231 |
|
int itemp, readlength= -1; |
1232 |
|
static int depth= 0; |
1233 |
|
char *rest, *match; |
1234 |
|
size_t inlength; |
1235 |
|
|
1236 |
|
if(env->in_string==NULL) { |
1237 |
|
if(depth > 0) { |
1238 |
|
printf("]> "); |
1239 |
|
} |
1240 |
|
readline(env); if(env->err) return; |
1241 |
|
|
1242 |
|
env->in_string= malloc(strlen(env->head->item->content.ptr)+1); |
1243 |
|
env->free_string= env->in_string; /* Save the original pointer */ |
1244 |
|
strcpy(env->in_string, env->head->item->content.ptr); |
1245 |
|
toss(env); if(env->err) return; |
1246 |
|
} |
1247 |
|
|
1248 |
|
inlength= strlen(env->in_string)+1; |
1249 |
|
match= malloc(inlength); |
1250 |
|
rest= malloc(inlength); |
1251 |
|
|
1252 |
|
if(sscanf(env->in_string, blankform, &readlength)!=EOF |
1253 |
|
&& readlength != -1) { |
1254 |
|
; |
1255 |
|
} else if(sscanf(env->in_string, intform, &itemp, &readlength) != EOF |
1256 |
|
&& readlength != -1) { |
1257 |
|
push_int(env, itemp); |
1258 |
|
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
1259 |
|
&& readlength != -1) { |
1260 |
|
push_cstring(env, match); |
1261 |
|
} else if(sscanf(env->in_string, symbform, match, &readlength) != EOF |
1262 |
|
&& readlength != -1) { |
1263 |
|
push_sym(env, match); |
1264 |
|
} else if(sscanf(env->in_string, ebrackform, &readlength) != EOF |
1265 |
|
&& readlength != -1) { |
1266 |
|
pack(env); if(env->err) return; |
1267 |
|
if(depth != 0) depth--; |
1268 |
|
} else if(sscanf(env->in_string, semicform, &readlength) != EOF |
1269 |
|
&& readlength != -1) { |
1270 |
|
push_sym(env, ";"); |
1271 |
|
} else if(sscanf(env->in_string, bbrackform, &readlength) != EOF |
1272 |
|
&& readlength != -1) { |
1273 |
|
push_sym(env, "["); |
1274 |
|
depth++; |
1275 |
|
} else { |
1276 |
|
free(env->free_string); |
1277 |
|
env->in_string = env->free_string = NULL; |
1278 |
|
free(match); |
1279 |
|
} |
1280 |
|
if ( env->in_string != NULL) { |
1281 |
|
env->in_string += readlength; |
1282 |
|
} |
1283 |
|
|
1284 |
|
if(depth) |
1285 |
|
return read(env); |
1286 |
} |
} |