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; |
char *in_string; /* Input pending to be read */ |
62 |
|
char *free_string; /* Free this string when all input is |
63 |
|
read from in_string */ |
64 |
} environment; |
} environment; |
65 |
|
|
66 |
/* A type for pointers to external functions */ |
/* A type for pointers to external functions */ |
72 |
{ |
{ |
73 |
int i; |
int i; |
74 |
|
|
75 |
|
env->in_string= NULL; |
76 |
env->err= 0; |
env->err= 0; |
|
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 |
|
break; |
104 |
|
case integer: |
105 |
|
case func: |
106 |
|
break; |
107 |
|
case symb: |
108 |
|
free(((symbol*)(val->content.ptr))->id); |
109 |
|
if(((symbol*)(val->content.ptr))->val!=NULL) |
110 |
|
free_val(((symbol*)(val->content.ptr))->val); |
111 |
|
free(val->content.ptr); |
112 |
|
break; |
113 |
|
} |
114 |
|
free(val); /* Free the actual list value */ |
115 |
|
} |
116 |
|
} |
117 |
|
|
118 |
|
/* Discard the top element of the stack. */ |
119 |
|
extern void toss(environment *env) |
120 |
|
{ |
121 |
|
stackitem *temp= env->head; |
122 |
|
|
123 |
|
if((env->head)==NULL) { |
124 |
|
printerr("Too Few Arguments"); |
125 |
|
env->err=1; |
126 |
|
return; |
127 |
|
} |
128 |
|
|
129 |
|
free_val(env->head->item); /* Free the value */ |
130 |
|
env->head= env->head->next; /* Remove the top stack item */ |
131 |
|
free(temp); /* Free the old top stack item */ |
132 |
|
} |
133 |
|
|
134 |
/* 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. */ |
135 |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
136 |
{ |
{ |
160 |
} |
} |
161 |
} |
} |
162 |
|
|
|
/* Generic push function. */ |
|
|
void push(stackitem** stack_head, stackitem* in_item) |
|
|
{ |
|
|
in_item->next= *stack_head; |
|
|
*stack_head= in_item; |
|
|
} |
|
|
|
|
163 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
164 |
void push_val(stackitem **stack_head, value *val) |
void push_val(environment *env, value *val) |
165 |
{ |
{ |
166 |
stackitem *new_item= malloc(sizeof(stackitem)); |
stackitem *new_item= malloc(sizeof(stackitem)); |
167 |
new_item->item= val; |
new_item->item= val; |
168 |
val->refcount++; |
val->refcount++; |
169 |
push(stack_head, new_item); |
new_item->next= env->head; |
170 |
|
env->head= new_item; |
171 |
} |
} |
172 |
|
|
173 |
/* Push an integer onto the stack. */ |
/* Push an integer onto the stack. */ |
174 |
void push_int(stackitem **stack_head, int in_val) |
void push_int(environment *env, int in_val) |
175 |
{ |
{ |
176 |
value *new_value= malloc(sizeof(value)); |
value *new_value= malloc(sizeof(value)); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item= new_value; |
|
177 |
|
|
178 |
new_value->content.val= in_val; |
new_value->content.val= in_val; |
179 |
new_value->type= integer; |
new_value->type= integer; |
180 |
new_value->refcount=1; |
new_value->refcount= 1; |
181 |
|
|
182 |
push(stack_head, new_item); |
push_val(env, new_value); |
183 |
} |
} |
184 |
|
|
185 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
186 |
void push_cstring(stackitem **stack_head, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
187 |
{ |
{ |
188 |
value *new_value= malloc(sizeof(value)); |
value *new_value= malloc(sizeof(value)); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item=new_value; |
|
189 |
|
|
190 |
new_value->content.ptr= malloc(strlen(in_string)+1); |
new_value->content.ptr= malloc(strlen(in_string)+1); |
191 |
strcpy(new_value->content.ptr, in_string); |
strcpy(new_value->content.ptr, in_string); |
192 |
new_value->type= string; |
new_value->type= string; |
193 |
new_value->refcount=1; |
new_value->refcount= 1; |
194 |
|
|
195 |
push(stack_head, new_item); |
push_val(env, new_value); |
196 |
|
} |
197 |
|
|
198 |
|
/* Mangle a symbol name to a valid C identifier name */ |
199 |
|
char *mangle_str(const char *old_string){ |
200 |
|
char validchars[] |
201 |
|
="0123456789abcdef"; |
202 |
|
char *new_string, *current; |
203 |
|
|
204 |
|
new_string=malloc((strlen(old_string)*2)+4); |
205 |
|
strcpy(new_string, "sx_"); /* Stack eXternal */ |
206 |
|
current=new_string+3; |
207 |
|
while(old_string[0] != '\0'){ |
208 |
|
current[0]=validchars[(unsigned char)(old_string[0])/16]; |
209 |
|
current[1]=validchars[(unsigned char)(old_string[0])%16]; |
210 |
|
current+=2; |
211 |
|
old_string++; |
212 |
|
} |
213 |
|
current[0]='\0'; |
214 |
|
|
215 |
|
return new_string; /* The caller must free() it */ |
216 |
|
} |
217 |
|
|
218 |
|
extern void mangle(environment *env){ |
219 |
|
char *new_string; |
220 |
|
|
221 |
|
if((env->head)==NULL) { |
222 |
|
printerr("Too Few Arguments"); |
223 |
|
env->err=1; |
224 |
|
return; |
225 |
|
} |
226 |
|
|
227 |
|
if(env->head->item->type!=string) { |
228 |
|
printerr("Bad Argument Type"); |
229 |
|
env->err=2; |
230 |
|
return; |
231 |
|
} |
232 |
|
|
233 |
|
new_string= mangle_str((const char *)(env->head->item->content.ptr)); |
234 |
|
|
235 |
|
toss(env); |
236 |
|
if(env->err) return; |
237 |
|
|
238 |
|
push_cstring(env, new_string); |
239 |
} |
} |
240 |
|
|
241 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
242 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
243 |
{ |
{ |
|
stackitem *new_item; /* The new stack item */ |
|
|
/* ...which will contain... */ |
|
244 |
value *new_value; /* A new symbol value */ |
value *new_value; /* A new symbol value */ |
245 |
/* ...which might point to... */ |
/* ...which might point to... */ |
246 |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
250 |
void *funcptr; /* A function pointer */ |
void *funcptr; /* A function pointer */ |
251 |
|
|
252 |
static void *handle= NULL; /* Dynamic linker handle */ |
static void *handle= NULL; /* Dynamic linker handle */ |
253 |
|
const char *dlerr; /* Dynamic linker error */ |
254 |
|
char *mangled; /* Mangled function name */ |
255 |
|
|
|
/* Create a new stack item containing a new value */ |
|
|
new_item= malloc(sizeof(stackitem)); |
|
256 |
new_value= malloc(sizeof(value)); |
new_value= malloc(sizeof(value)); |
|
new_item->item=new_value; |
|
257 |
|
|
258 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
259 |
new_value->type= symb; |
new_value->type= symb; |
281 |
handle= dlopen(NULL, RTLD_LAZY); |
handle= dlopen(NULL, RTLD_LAZY); |
282 |
|
|
283 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
284 |
if(dlerror()==NULL) { /* If a function was found */ |
dlerr=dlerror(); |
285 |
|
if(dlerr != NULL) { /* If no function was found */ |
286 |
|
mangled=mangle_str(in_string); |
287 |
|
funcptr= dlsym(handle, mangled); /* try mangling it */ |
288 |
|
free(mangled); |
289 |
|
dlerr=dlerror(); |
290 |
|
} |
291 |
|
if(dlerr==NULL) { /* If a function was found */ |
292 |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
293 |
new_fvalue->type=func; /* The new value is a function pointer */ |
new_fvalue->type=func; /* The new value is a function pointer */ |
294 |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
297 |
new_fvalue->refcount= 1; |
new_fvalue->refcount= 1; |
298 |
} |
} |
299 |
} |
} |
300 |
push(&(env->head), new_item); |
push_val(env, new_value); |
|
} |
|
|
|
|
|
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 */ |
|
301 |
} |
} |
302 |
|
|
303 |
/* Print newline. */ |
/* Print newline. */ |
333 |
case list: |
case list: |
334 |
push_sym(env, "list"); |
push_sym(env, "list"); |
335 |
break; |
break; |
|
default: |
|
|
push_sym(env, "unknown"); |
|
|
break; |
|
336 |
} |
} |
337 |
} |
} |
338 |
|
|
339 |
/* Prints the top element of the stack. */ |
/* Prints the top element of the stack. */ |
340 |
void print_h(stackitem *stack_head) |
void print_h(stackitem *stack_head, int noquote) |
341 |
{ |
{ |
342 |
switch(stack_head->item->type) { |
switch(stack_head->item->type) { |
343 |
case integer: |
case integer: |
344 |
printf("%d", stack_head->item->content.val); |
printf("%d", stack_head->item->content.val); |
345 |
break; |
break; |
346 |
case string: |
case string: |
347 |
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
if(noquote) |
348 |
|
printf("%s", (char*)stack_head->item->content.ptr); |
349 |
|
else |
350 |
|
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
351 |
break; |
break; |
352 |
case symb: |
case symb: |
353 |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
360 |
stack_head=(stackitem *)(stack_head->item->content.ptr); |
stack_head=(stackitem *)(stack_head->item->content.ptr); |
361 |
printf("[ "); |
printf("[ "); |
362 |
while(stack_head != NULL) { |
while(stack_head != NULL) { |
363 |
print_h(stack_head); |
print_h(stack_head, noquote); |
364 |
printf(" "); |
printf(" "); |
365 |
stack_head=stack_head->next; |
stack_head=stack_head->next; |
366 |
} |
} |
367 |
printf("]"); |
printf("]"); |
368 |
break; |
break; |
|
default: |
|
|
printf("#<unknown %p>", (stack_head->item->content.ptr)); |
|
|
break; |
|
369 |
} |
} |
370 |
} |
} |
371 |
|
|
375 |
env->err=1; |
env->err=1; |
376 |
return; |
return; |
377 |
} |
} |
378 |
print_h(env->head); |
print_h(env->head, 0); |
379 |
|
nl(); |
380 |
} |
} |
381 |
|
|
382 |
/* Prints the top element of the stack and then discards it. */ |
/* Prints the top element of the stack and then discards it. */ |
387 |
toss(env); |
toss(env); |
388 |
} |
} |
389 |
|
|
390 |
|
extern void princ_(environment *env) { |
391 |
|
if(env->head==NULL) { |
392 |
|
printerr("Too Few Arguments"); |
393 |
|
env->err=1; |
394 |
|
return; |
395 |
|
} |
396 |
|
print_h(env->head, 1); |
397 |
|
} |
398 |
|
|
399 |
|
/* Prints the top element of the stack and then discards it. */ |
400 |
|
extern void princ(environment *env) |
401 |
|
{ |
402 |
|
princ_(env); |
403 |
|
if(env->err) return; |
404 |
|
toss(env); |
405 |
|
} |
406 |
|
|
407 |
/* Only to be called by function printstack. */ |
/* Only to be called by function printstack. */ |
408 |
void print_st(stackitem *stack_head, long counter) |
void print_st(stackitem *stack_head, long counter) |
409 |
{ |
{ |
410 |
if(stack_head->next != NULL) |
if(stack_head->next != NULL) |
411 |
print_st(stack_head->next, counter+1); |
print_st(stack_head->next, counter+1); |
412 |
printf("%ld: ", counter); |
printf("%ld: ", counter); |
413 |
print_h(stack_head); |
print_h(stack_head, 0); |
414 |
nl(); |
nl(); |
415 |
} |
} |
416 |
|
|
418 |
extern void printstack(environment *env) |
extern void printstack(environment *env) |
419 |
{ |
{ |
420 |
if(env->head == NULL) { |
if(env->head == NULL) { |
421 |
|
printf("Stack Empty\n"); |
422 |
return; |
return; |
423 |
} |
} |
424 |
print_st(env->head, 1); |
print_st(env->head, 1); |
|
nl(); |
|
425 |
} |
} |
426 |
|
|
427 |
/* Swap the two top elements on the stack. */ |
/* Swap the two top elements on the stack. */ |
440 |
env->head->next= temp; |
env->head->next= temp; |
441 |
} |
} |
442 |
|
|
443 |
|
/* Rotate the first three elements on the stack. */ |
444 |
|
extern void rot(environment *env) |
445 |
|
{ |
446 |
|
stackitem *temp= env->head; |
447 |
|
|
448 |
|
if(env->head==NULL || env->head->next==NULL |
449 |
|
|| env->head->next->next==NULL) { |
450 |
|
printerr("Too Few Arguments"); |
451 |
|
env->err=1; |
452 |
|
return; |
453 |
|
} |
454 |
|
|
455 |
|
env->head= env->head->next->next; |
456 |
|
temp->next->next= env->head->next; |
457 |
|
env->head->next= temp; |
458 |
|
} |
459 |
|
|
460 |
/* Recall a value from a symbol, if bound */ |
/* Recall a value from a symbol, if bound */ |
461 |
extern void rcl(environment *env) |
extern void rcl(environment *env) |
462 |
{ |
{ |
482 |
} |
} |
483 |
toss(env); /* toss the symbol */ |
toss(env); /* toss the symbol */ |
484 |
if(env->err) return; |
if(env->err) return; |
485 |
push_val(&(env->head), val); /* Return its bound value */ |
push_val(env, val); /* Return its bound value */ |
486 |
} |
} |
487 |
|
|
|
extern void pack(environment*); |
|
|
void stack_read(environment*, char*); |
|
|
|
|
|
|
|
488 |
/* 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 |
489 |
function value, and if it is, toss the symbol and execute the |
function value, and if it is, toss the symbol and execute the |
490 |
function. */ |
function. */ |
494 |
value* temp_val; |
value* temp_val; |
495 |
stackitem* iterator; |
stackitem* iterator; |
496 |
|
|
497 |
|
eval_start: |
498 |
|
|
499 |
if(env->head==NULL) { |
if(env->head==NULL) { |
500 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
501 |
env->err=1; |
env->err=1; |
508 |
rcl(env); /* get its contents */ |
rcl(env); /* get its contents */ |
509 |
if(env->err) return; |
if(env->err) return; |
510 |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
511 |
eval(env); /* evaluate the value */ |
goto eval_start; |
|
return; |
|
512 |
} |
} |
513 |
break; |
return; |
514 |
|
|
515 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
516 |
case func: |
case func: |
517 |
in_func= (funcp)(env->head->item->content.ptr); |
in_func= (funcp)(env->head->item->content.ptr); |
518 |
toss(env); |
toss(env); |
519 |
if(env->err) return; |
if(env->err) return; |
520 |
(*in_func)(env); |
return (*in_func)(env); |
|
break; |
|
521 |
|
|
522 |
/* If it's a list */ |
/* If it's a list */ |
523 |
case list: |
case list: |
526 |
toss(env); |
toss(env); |
527 |
if(env->err) return; |
if(env->err) return; |
528 |
iterator= (stackitem*)temp_val->content.ptr; |
iterator= (stackitem*)temp_val->content.ptr; |
529 |
while(iterator!=NULL && iterator->item!=NULL) { |
while(iterator!=NULL) { |
530 |
push_val(&(env->head), iterator->item); |
push_val(env, iterator->item); |
531 |
if(env->head->item->type==symb |
if(env->head->item->type==symb |
532 |
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
533 |
toss(env); |
toss(env); |
534 |
if(env->err) return; |
if(env->err) return; |
535 |
|
if(iterator->next == NULL){ |
536 |
|
free_val(temp_val); |
537 |
|
goto eval_start; |
538 |
|
} |
539 |
eval(env); |
eval(env); |
540 |
if(env->err) return; |
if(env->err) return; |
541 |
} |
} |
542 |
iterator= iterator->next; |
iterator= iterator->next; |
543 |
} |
} |
544 |
free_val(temp_val); |
free_val(temp_val); |
545 |
break; |
return; |
|
|
|
|
/* If it's a string */ |
|
|
case string: |
|
|
temp_val= env->head->item; |
|
|
env->head->item->refcount++; |
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
push_sym(env, "["); |
|
|
env->non_eval_flag++; |
|
|
stack_read(env, (char*)temp_val->content.ptr); |
|
|
env->non_eval_flag--; |
|
|
push_sym(env, "["); pack(env); |
|
|
if(env->err) return; |
|
|
eval(env); |
|
|
if(env->err) return; |
|
|
free_val(temp_val); |
|
|
break; |
|
546 |
|
|
547 |
default: |
default: |
548 |
|
return; |
549 |
} |
} |
550 |
} |
} |
551 |
|
|
579 |
/* Make a list. */ |
/* Make a list. */ |
580 |
extern void pack(environment *env) |
extern void pack(environment *env) |
581 |
{ |
{ |
|
void* delimiter; |
|
582 |
stackitem *iterator, *temp; |
stackitem *iterator, *temp; |
583 |
value *pack; |
value *pack; |
584 |
|
|
|
delimiter= env->head->item->content.ptr; /* Get delimiter */ |
|
|
toss(env); |
|
|
|
|
585 |
iterator= env->head; |
iterator= env->head; |
586 |
|
|
587 |
if(iterator==NULL || iterator->item->content.ptr==delimiter) { |
if(iterator==NULL |
588 |
|
|| (iterator->item->type==symb |
589 |
|
&& ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) { |
590 |
temp= NULL; |
temp= NULL; |
591 |
toss(env); |
toss(env); |
592 |
} else { |
} else { |
593 |
/* Search for first delimiter */ |
/* Search for first delimiter */ |
594 |
while(iterator->next!=NULL |
while(iterator->next!=NULL |
595 |
&& iterator->next->item->content.ptr!=delimiter) |
&& (iterator->next->item->type!=symb |
596 |
|
|| ((symbol*)(iterator->next->item->content.ptr))->id[0]!='[')) |
597 |
iterator= iterator->next; |
iterator= iterator->next; |
598 |
|
|
599 |
/* Extract list */ |
/* Extract list */ |
611 |
pack->content.ptr= temp; |
pack->content.ptr= temp; |
612 |
pack->refcount= 1; |
pack->refcount= 1; |
613 |
|
|
614 |
temp= malloc(sizeof(stackitem)); |
push_val(env, pack); |
|
temp->item= pack; |
|
|
|
|
|
push(&(env->head), temp); |
|
615 |
rev(env); |
rev(env); |
616 |
} |
} |
617 |
|
|
|
/* 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; |
|
|
|
|
|
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(!env->non_eval_flag) { |
|
|
eval(env); /* Evaluate top element */ |
|
|
break; |
|
|
} |
|
|
|
|
|
push_sym(env, ";"); |
|
|
break; |
|
|
} |
|
|
|
|
|
if(*temp==']') { |
|
|
push_sym(env, "["); |
|
|
pack(env); |
|
|
if(env->non_eval_flag) |
|
|
env->non_eval_flag--; |
|
|
break; |
|
|
} |
|
|
|
|
|
if(*temp=='[') { |
|
|
push_sym(env, "["); |
|
|
env->non_eval_flag++; |
|
|
break; |
|
|
} |
|
|
} |
|
|
} while(0); |
|
|
|
|
|
free(temp); |
|
|
|
|
|
if(convert<2) { |
|
|
free(rest); |
|
|
return; |
|
|
} |
|
|
|
|
|
stack_read(env, rest); |
|
|
|
|
|
free(rest); |
|
|
} |
|
|
|
|
618 |
/* Relocate elements of the list on the stack. */ |
/* Relocate elements of the list on the stack. */ |
619 |
extern void expand(environment *env) |
extern void expand(environment *env) |
620 |
{ |
{ |
671 |
result= (left==right); |
result= (left==right); |
672 |
|
|
673 |
toss(env); toss(env); |
toss(env); toss(env); |
674 |
push_int(&(env->head), result); |
push_int(env, result); |
675 |
} |
} |
676 |
|
|
677 |
/* Negates the top element on the stack. */ |
/* Negates the top element on the stack. */ |
693 |
|
|
694 |
val= env->head->item->content.val; |
val= env->head->item->content.val; |
695 |
toss(env); |
toss(env); |
696 |
push_int(&(env->head), !val); |
push_int(env, !val); |
697 |
} |
} |
698 |
|
|
699 |
/* 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 |
736 |
toss(env); toss(env); |
toss(env); toss(env); |
737 |
} |
} |
738 |
|
|
739 |
|
extern void clear(environment *); |
740 |
|
void forget_sym(symbol **); |
741 |
|
|
742 |
/* Quit stack. */ |
/* Quit stack. */ |
743 |
extern void quit(environment *env) |
extern void quit(environment *env) |
744 |
{ |
{ |
745 |
|
long i; |
746 |
|
|
747 |
|
clear(env); |
748 |
|
if (env->err) return; |
749 |
|
for(i= 0; i<HASHTBLSIZE; i++) { |
750 |
|
while(env->symbols[i]!= NULL) { |
751 |
|
forget_sym(&(env->symbols[i])); |
752 |
|
} |
753 |
|
env->symbols[i]= NULL; |
754 |
|
} |
755 |
exit(EXIT_SUCCESS); |
exit(EXIT_SUCCESS); |
756 |
} |
} |
757 |
|
|
777 |
} |
} |
778 |
} |
} |
779 |
|
|
780 |
|
/* Internal forget function */ |
781 |
|
void forget_sym(symbol **hash_entry) { |
782 |
|
symbol *temp; |
783 |
|
|
784 |
|
temp= *hash_entry; |
785 |
|
*hash_entry= (*hash_entry)->next; |
786 |
|
|
787 |
|
if(temp->val!=NULL) { |
788 |
|
free_val(temp->val); |
789 |
|
} |
790 |
|
free(temp->id); |
791 |
|
free(temp); |
792 |
|
} |
793 |
|
|
794 |
/* Forgets a symbol (remove it from the hash table) */ |
/* Forgets a symbol (remove it from the hash table) */ |
795 |
extern void forget(environment *env) |
extern void forget(environment *env) |
796 |
{ |
{ |
797 |
char* sym_id; |
char* sym_id; |
798 |
stackitem *stack_head= env->head; |
stackitem *stack_head= env->head; |
|
symbol **hash_entry, *temp; |
|
799 |
|
|
800 |
if(stack_head==NULL) { |
if(stack_head==NULL) { |
801 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
812 |
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
813 |
toss(env); |
toss(env); |
814 |
|
|
815 |
hash_entry= hash(env->symbols, sym_id); |
return forget_sym(hash(env->symbols, sym_id)); |
|
temp= *hash_entry; |
|
|
*hash_entry= (*hash_entry)->next; |
|
|
|
|
|
if(temp->val!=NULL) { |
|
|
free_val(temp->val); |
|
|
} |
|
|
free(temp->id); |
|
|
free(temp); |
|
816 |
} |
} |
817 |
|
|
818 |
/* Returns the current error number to the stack */ |
/* Returns the current error number to the stack */ |
819 |
extern void errn(environment *env){ |
extern void errn(environment *env){ |
820 |
push_int(&(env->head), env->err); |
push_int(env, env->err); |
821 |
} |
} |
822 |
|
|
823 |
|
extern void read(environment*); |
824 |
|
|
825 |
int main() |
int main() |
826 |
{ |
{ |
827 |
environment myenv; |
environment myenv; |
|
char in_string[100]; |
|
828 |
|
|
829 |
init_env(&myenv); |
init_env(&myenv); |
830 |
|
|
831 |
printf("okidok\n "); |
while(1) { |
832 |
|
if(myenv.in_string==NULL) { |
833 |
while(fgets(in_string, 100, stdin) != NULL) { |
nl(); |
834 |
stack_read(&myenv, in_string); |
printstack(&myenv); |
835 |
|
printf("> "); |
836 |
|
} |
837 |
|
read(&myenv); |
838 |
if(myenv.err) { |
if(myenv.err) { |
839 |
printf("(error %d) ", myenv.err); |
printf("(error %d) ", myenv.err); |
840 |
myenv.err=0; |
myenv.err=0; |
841 |
|
} else if(myenv.head!=NULL |
842 |
|
&& myenv.head->item->type==symb |
843 |
|
&& ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') { |
844 |
|
toss(&myenv); /* No error check in main */ |
845 |
|
eval(&myenv); |
846 |
} |
} |
|
printf("okidok\n "); |
|
847 |
} |
} |
848 |
quit(&myenv); |
quit(&myenv); |
849 |
return EXIT_FAILURE; |
return EXIT_FAILURE; |
850 |
} |
} |
851 |
|
|
852 |
|
/* + */ |
853 |
|
extern void sx_2b(environment *env) { |
854 |
|
int a, b; |
855 |
|
size_t len; |
856 |
|
char* new_string; |
857 |
|
value *a_val, *b_val; |
858 |
|
|
859 |
|
if((env->head)==NULL || env->head->next==NULL) { |
860 |
|
printerr("Too Few Arguments"); |
861 |
|
env->err=1; |
862 |
|
return; |
863 |
|
} |
864 |
|
|
865 |
|
if(env->head->item->type==string |
866 |
|
&& env->head->next->item->type==string) { |
867 |
|
a_val= env->head->item; |
868 |
|
b_val= env->head->next->item; |
869 |
|
a_val->refcount++; |
870 |
|
b_val->refcount++; |
871 |
|
toss(env); if(env->err) return; |
872 |
|
toss(env); if(env->err) return; |
873 |
|
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
874 |
|
new_string= malloc(len); |
875 |
|
strcpy(new_string, b_val->content.ptr); |
876 |
|
strcat(new_string, a_val->content.ptr); |
877 |
|
free_val(a_val); free_val(b_val); |
878 |
|
push_cstring(env, new_string); |
879 |
|
free(new_string); |
880 |
|
return; |
881 |
|
} |
882 |
|
|
883 |
|
if(env->head->item->type!=integer |
884 |
|
|| env->head->next->item->type!=integer) { |
885 |
|
printerr("Bad Argument Type"); |
886 |
|
env->err=2; |
887 |
|
return; |
888 |
|
} |
889 |
|
a=env->head->item->content.val; |
890 |
|
toss(env); |
891 |
|
if(env->err) return; |
892 |
|
if(env->head->item->refcount == 1) |
893 |
|
env->head->item->content.val += a; |
894 |
|
else { |
895 |
|
b=env->head->item->content.val; |
896 |
|
toss(env); |
897 |
|
if(env->err) return; |
898 |
|
push_int(env, a+b); |
899 |
|
} |
900 |
|
} |
901 |
|
|
902 |
|
/* - */ |
903 |
|
extern void sx_2d(environment *env) { |
904 |
|
int a, b; |
905 |
|
|
906 |
|
if((env->head)==NULL || env->head->next==NULL) { |
907 |
|
printerr("Too Few Arguments"); |
908 |
|
env->err=1; |
909 |
|
return; |
910 |
|
} |
911 |
|
|
912 |
|
if(env->head->item->type!=integer |
913 |
|
|| env->head->next->item->type!=integer) { |
914 |
|
printerr("Bad Argument Type"); |
915 |
|
env->err=2; |
916 |
|
return; |
917 |
|
} |
918 |
|
a=env->head->item->content.val; |
919 |
|
toss(env); |
920 |
|
if(env->err) return; |
921 |
|
if(env->head->item->refcount == 1) |
922 |
|
env->head->item->content.val -= a; |
923 |
|
else { |
924 |
|
b=env->head->item->content.val; |
925 |
|
toss(env); |
926 |
|
if(env->err) return; |
927 |
|
push_int(env, b-a); |
928 |
|
} |
929 |
|
} |
930 |
|
|
931 |
|
/* > */ |
932 |
|
extern void sx_3e(environment *env) { |
933 |
|
int a, b; |
934 |
|
|
935 |
|
if((env->head)==NULL || env->head->next==NULL) { |
936 |
|
printerr("Too Few Arguments"); |
937 |
|
env->err=1; |
938 |
|
return; |
939 |
|
} |
940 |
|
|
941 |
|
if(env->head->item->type!=integer |
942 |
|
|| env->head->next->item->type!=integer) { |
943 |
|
printerr("Bad Argument Type"); |
944 |
|
env->err=2; |
945 |
|
return; |
946 |
|
} |
947 |
|
a=env->head->item->content.val; |
948 |
|
toss(env); |
949 |
|
if(env->err) return; |
950 |
|
if(env->head->item->refcount == 1) |
951 |
|
env->head->item->content.val = (env->head->item->content.val > a); |
952 |
|
else { |
953 |
|
b=env->head->item->content.val; |
954 |
|
toss(env); |
955 |
|
if(env->err) return; |
956 |
|
push_int(env, b>a); |
957 |
|
} |
958 |
|
} |
959 |
|
|
960 |
|
/* Return copy of a value */ |
961 |
|
value *copy_val(value *old_value){ |
962 |
|
stackitem *old_item, *new_item, *prev_item; |
963 |
|
|
964 |
|
value *new_value=malloc(sizeof(value)); |
965 |
|
|
966 |
|
new_value->type=old_value->type; |
967 |
|
new_value->refcount=0; /* This is increased if/when this |
968 |
|
value is referenced somewhere, like |
969 |
|
in a stack item or a variable */ |
970 |
|
switch(old_value->type){ |
971 |
|
case integer: |
972 |
|
new_value->content.val=old_value->content.val; |
973 |
|
break; |
974 |
|
case string: |
975 |
|
(char *)(new_value->content.ptr) |
976 |
|
= strdup((char *)(old_value->content.ptr)); |
977 |
|
break; |
978 |
|
case func: |
979 |
|
case symb: |
980 |
|
new_value->content.ptr=old_value->content.ptr; |
981 |
|
break; |
982 |
|
case list: |
983 |
|
new_value->content.ptr=NULL; |
984 |
|
|
985 |
|
prev_item=NULL; |
986 |
|
old_item=(stackitem *)(old_value->content.ptr); |
987 |
|
|
988 |
|
while(old_item != NULL) { /* While list is not empty */ |
989 |
|
new_item= malloc(sizeof(stackitem)); |
990 |
|
new_item->item=copy_val(old_item->item); /* recurse */ |
991 |
|
new_item->next=NULL; |
992 |
|
if(prev_item != NULL) /* If this wasn't the first item */ |
993 |
|
prev_item->next=new_item; /* point the previous item to the |
994 |
|
new item */ |
995 |
|
else |
996 |
|
new_value->content.ptr=new_item; |
997 |
|
old_item=old_item->next; |
998 |
|
prev_item=new_item; |
999 |
|
} |
1000 |
|
break; |
1001 |
|
} |
1002 |
|
return new_value; |
1003 |
|
} |
1004 |
|
|
1005 |
|
/* duplicates an item on the stack */ |
1006 |
|
extern void dup(environment *env) { |
1007 |
|
if((env->head)==NULL) { |
1008 |
|
printerr("Too Few Arguments"); |
1009 |
|
env->err=1; |
1010 |
|
return; |
1011 |
|
} |
1012 |
|
push_val(env, copy_val(env->head->item)); |
1013 |
|
} |
1014 |
|
|
1015 |
|
/* "if", If-Then */ |
1016 |
|
extern void sx_6966(environment *env) { |
1017 |
|
|
1018 |
|
int truth; |
1019 |
|
|
1020 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1021 |
|
printerr("Too Few Arguments"); |
1022 |
|
env->err=1; |
1023 |
|
return; |
1024 |
|
} |
1025 |
|
|
1026 |
|
if(env->head->next->item->type != integer) { |
1027 |
|
printerr("Bad Argument Type"); |
1028 |
|
env->err=2; |
1029 |
|
return; |
1030 |
|
} |
1031 |
|
|
1032 |
|
swap(env); |
1033 |
|
if(env->err) return; |
1034 |
|
|
1035 |
|
truth=env->head->item->content.val; |
1036 |
|
|
1037 |
|
toss(env); |
1038 |
|
if(env->err) return; |
1039 |
|
|
1040 |
|
if(truth) |
1041 |
|
eval(env); |
1042 |
|
else |
1043 |
|
toss(env); |
1044 |
|
} |
1045 |
|
|
1046 |
|
/* If-Then-Else */ |
1047 |
|
extern void ifelse(environment *env) { |
1048 |
|
|
1049 |
|
int truth; |
1050 |
|
|
1051 |
|
if((env->head)==NULL || env->head->next==NULL |
1052 |
|
|| env->head->next->next==NULL) { |
1053 |
|
printerr("Too Few Arguments"); |
1054 |
|
env->err=1; |
1055 |
|
return; |
1056 |
|
} |
1057 |
|
|
1058 |
|
if(env->head->next->next->item->type != integer) { |
1059 |
|
printerr("Bad Argument Type"); |
1060 |
|
env->err=2; |
1061 |
|
return; |
1062 |
|
} |
1063 |
|
|
1064 |
|
rot(env); |
1065 |
|
if(env->err) return; |
1066 |
|
|
1067 |
|
truth=env->head->item->content.val; |
1068 |
|
|
1069 |
|
toss(env); |
1070 |
|
if(env->err) return; |
1071 |
|
|
1072 |
|
if(!truth) |
1073 |
|
swap(env); |
1074 |
|
if(env->err) return; |
1075 |
|
|
1076 |
|
toss(env); |
1077 |
|
if(env->err) return; |
1078 |
|
|
1079 |
|
eval(env); |
1080 |
|
} |
1081 |
|
|
1082 |
|
/* while */ |
1083 |
|
extern void sx_7768696c65(environment *env) { |
1084 |
|
|
1085 |
|
int truth; |
1086 |
|
value *loop, *test; |
1087 |
|
|
1088 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1089 |
|
printerr("Too Few Arguments"); |
1090 |
|
env->err=1; |
1091 |
|
return; |
1092 |
|
} |
1093 |
|
|
1094 |
|
loop= env->head->item; |
1095 |
|
loop->refcount++; |
1096 |
|
toss(env); if(env->err) return; |
1097 |
|
|
1098 |
|
test= env->head->item; |
1099 |
|
test->refcount++; |
1100 |
|
toss(env); if(env->err) return; |
1101 |
|
|
1102 |
|
do { |
1103 |
|
push_val(env, test); |
1104 |
|
eval(env); |
1105 |
|
|
1106 |
|
if(env->head->item->type != integer) { |
1107 |
|
printerr("Bad Argument Type"); |
1108 |
|
env->err=2; |
1109 |
|
return; |
1110 |
|
} |
1111 |
|
|
1112 |
|
truth= env->head->item->content.val; |
1113 |
|
toss(env); if(env->err) return; |
1114 |
|
|
1115 |
|
if(truth) { |
1116 |
|
push_val(env, loop); |
1117 |
|
eval(env); |
1118 |
|
} else { |
1119 |
|
toss(env); |
1120 |
|
} |
1121 |
|
|
1122 |
|
} while(truth); |
1123 |
|
|
1124 |
|
free_val(test); |
1125 |
|
free_val(loop); |
1126 |
|
} |
1127 |
|
|
1128 |
|
/* For-loop */ |
1129 |
|
extern void sx_666f72(environment *env) { |
1130 |
|
|
1131 |
|
value *loop, *foo; |
1132 |
|
stackitem *iterator; |
1133 |
|
|
1134 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1135 |
|
printerr("Too Few Arguments"); |
1136 |
|
env->err=1; |
1137 |
|
return; |
1138 |
|
} |
1139 |
|
|
1140 |
|
if(env->head->next->item->type != list) { |
1141 |
|
printerr("Bad Argument Type"); |
1142 |
|
env->err=2; |
1143 |
|
return; |
1144 |
|
} |
1145 |
|
|
1146 |
|
loop= env->head->item; |
1147 |
|
loop->refcount++; |
1148 |
|
toss(env); if(env->err) return; |
1149 |
|
|
1150 |
|
foo= env->head->item; |
1151 |
|
foo->refcount++; |
1152 |
|
toss(env); if(env->err) return; |
1153 |
|
|
1154 |
|
iterator= foo->content.ptr; |
1155 |
|
|
1156 |
|
while(iterator!=NULL) { |
1157 |
|
push_val(env, iterator->item); |
1158 |
|
push_val(env, loop); |
1159 |
|
eval(env); if(env->err) return; |
1160 |
|
iterator= iterator->next; |
1161 |
|
} |
1162 |
|
|
1163 |
|
free_val(loop); |
1164 |
|
free_val(foo); |
1165 |
|
} |
1166 |
|
|
1167 |
|
/* 'to' */ |
1168 |
|
extern void to(environment *env) { |
1169 |
|
int i, start, ending; |
1170 |
|
stackitem *temp_head; |
1171 |
|
value *temp_val; |
1172 |
|
|
1173 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1174 |
|
printerr("Too Few Arguments"); |
1175 |
|
env->err=1; |
1176 |
|
return; |
1177 |
|
} |
1178 |
|
|
1179 |
|
if(env->head->item->type!=integer |
1180 |
|
|| env->head->next->item->type!=integer) { |
1181 |
|
printerr("Bad Argument Type"); |
1182 |
|
env->err=2; |
1183 |
|
return; |
1184 |
|
} |
1185 |
|
|
1186 |
|
ending= env->head->item->content.val; |
1187 |
|
toss(env); if(env->err) return; |
1188 |
|
start= env->head->item->content.val; |
1189 |
|
toss(env); if(env->err) return; |
1190 |
|
|
1191 |
|
temp_head= env->head; |
1192 |
|
env->head= NULL; |
1193 |
|
|
1194 |
|
if(ending>=start) { |
1195 |
|
for(i= ending; i>=start; i--) |
1196 |
|
push_int(env, i); |
1197 |
|
} else { |
1198 |
|
for(i= ending; i<=start; i++) |
1199 |
|
push_int(env, i); |
1200 |
|
} |
1201 |
|
|
1202 |
|
temp_val= malloc(sizeof(value)); |
1203 |
|
temp_val->content.ptr= env->head; |
1204 |
|
temp_val->refcount= 1; |
1205 |
|
temp_val->type= list; |
1206 |
|
env->head= temp_head; |
1207 |
|
push_val(env, temp_val); |
1208 |
|
} |
1209 |
|
|
1210 |
|
/* Read a string */ |
1211 |
|
extern void readline(environment *env) { |
1212 |
|
char in_string[101]; |
1213 |
|
|
1214 |
|
fgets(in_string, 100, stdin); |
1215 |
|
push_cstring(env, in_string); |
1216 |
|
} |
1217 |
|
|
1218 |
|
/* Read a value and place on stack */ |
1219 |
|
extern void read(environment *env) { |
1220 |
|
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n"; |
1221 |
|
const char strform[]= "\"%[^\"]\"%n"; |
1222 |
|
const char intform[]= "%i%n"; |
1223 |
|
const char blankform[]= "%*[ \t]%n"; |
1224 |
|
const char ebrackform[]= "%*1[]]%n"; |
1225 |
|
const char semicform[]= "%*1[;]%n"; |
1226 |
|
const char bbrackform[]= "%*1[[]%n"; |
1227 |
|
|
1228 |
|
int itemp, readlength= -1; |
1229 |
|
static int depth= 0; |
1230 |
|
char *rest, *match; |
1231 |
|
size_t inlength; |
1232 |
|
|
1233 |
|
if(env->in_string==NULL) { |
1234 |
|
if(depth > 0) { |
1235 |
|
printf("]> "); |
1236 |
|
} |
1237 |
|
readline(env); if(env->err) return; |
1238 |
|
|
1239 |
|
env->in_string= malloc(strlen(env->head->item->content.ptr)+1); |
1240 |
|
env->free_string= env->in_string; /* Save the original pointer */ |
1241 |
|
strcpy(env->in_string, env->head->item->content.ptr); |
1242 |
|
toss(env); if(env->err) return; |
1243 |
|
} |
1244 |
|
|
1245 |
|
inlength= strlen(env->in_string)+1; |
1246 |
|
match= malloc(inlength); |
1247 |
|
rest= malloc(inlength); |
1248 |
|
|
1249 |
|
if(sscanf(env->in_string, blankform, &readlength)!=EOF |
1250 |
|
&& readlength != -1) { |
1251 |
|
; |
1252 |
|
} else if(sscanf(env->in_string, intform, &itemp, &readlength) != EOF |
1253 |
|
&& readlength != -1) { |
1254 |
|
push_int(env, itemp); |
1255 |
|
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
1256 |
|
&& readlength != -1) { |
1257 |
|
push_cstring(env, match); |
1258 |
|
} else if(sscanf(env->in_string, symbform, match, &readlength) != EOF |
1259 |
|
&& readlength != -1) { |
1260 |
|
push_sym(env, match); |
1261 |
|
} else if(sscanf(env->in_string, ebrackform, &readlength) != EOF |
1262 |
|
&& readlength != -1) { |
1263 |
|
pack(env); if(env->err) return; |
1264 |
|
if(depth != 0) depth--; |
1265 |
|
} else if(sscanf(env->in_string, semicform, &readlength) != EOF |
1266 |
|
&& readlength != -1) { |
1267 |
|
push_sym(env, ";"); |
1268 |
|
} else if(sscanf(env->in_string, bbrackform, &readlength) != EOF |
1269 |
|
&& readlength != -1) { |
1270 |
|
push_sym(env, "["); |
1271 |
|
depth++; |
1272 |
|
} else { |
1273 |
|
free(env->free_string); |
1274 |
|
env->in_string = env->free_string = NULL; |
1275 |
|
free(match); |
1276 |
|
} |
1277 |
|
if ( env->in_string != NULL) { |
1278 |
|
env->in_string += readlength; |
1279 |
|
} |
1280 |
|
|
1281 |
|
if(depth) |
1282 |
|
return read(env); |
1283 |
|
} |