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 |
|
/* strcmp, strcpy, strlen, strcat, strdup */ |
10 |
|
#include <string.h> |
11 |
|
|
12 |
#define HASHTBLSIZE 65536 |
#define HASHTBLSIZE 2048 |
13 |
|
|
14 |
|
/* First, define some types. */ |
15 |
|
|
16 |
|
/* A value of some type */ |
17 |
|
typedef struct { |
18 |
|
enum { |
19 |
|
integer, |
20 |
|
string, |
21 |
|
func, /* Function pointer */ |
22 |
|
symb, |
23 |
|
list |
24 |
|
} type; /* Type of stack element */ |
25 |
|
|
|
typedef struct stack_item |
|
|
{ |
|
|
enum {value, string, ref, func, symbol} type; |
|
26 |
union { |
union { |
27 |
void* ptr; |
void *ptr; /* Pointer to the content */ |
28 |
int val; |
int val; /* ...or an integer */ |
29 |
} content; |
} content; /* Stores a pointer or an integer */ |
30 |
|
|
31 |
|
int refcount; /* Reference counter */ |
32 |
|
|
33 |
|
} value; |
34 |
|
|
35 |
|
/* A symbol with a name and possible value */ |
36 |
|
/* (These do not need reference counters, they are kept unique by |
37 |
|
hashing.) */ |
38 |
|
typedef struct symbol_struct { |
39 |
|
char *id; /* Symbol name */ |
40 |
|
value *val; /* The value (if any) bound to it */ |
41 |
|
struct symbol_struct *next; /* In case of hashing conflicts, a */ |
42 |
|
} symbol; /* symbol is a kind of stack item. */ |
43 |
|
|
44 |
char* id; |
/* A type for a hash table for symbols */ |
45 |
struct stack_item* next; |
typedef symbol *hashtbl[HASHTBLSIZE]; /* Hash table declaration */ |
|
} stackitem; |
|
46 |
|
|
47 |
|
/* An item (value) on a stack */ |
48 |
|
typedef struct stackitem_struct |
49 |
|
{ |
50 |
|
value *item; /* The value on the stack */ |
51 |
|
/* (This is never NULL) */ |
52 |
|
struct stackitem_struct *next; /* Next item */ |
53 |
|
} stackitem; |
54 |
|
|
55 |
typedef stackitem* hashtbl[HASHTBLSIZE]; |
/* An environment; gives access to the stack and a hash table of |
56 |
typedef void (*funcp)(stackitem**); |
defined symbols */ |
57 |
|
typedef struct { |
58 |
|
stackitem *head; /* Head of the stack */ |
59 |
|
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; |
64 |
|
|
65 |
|
/* A type for pointers to external functions */ |
66 |
|
typedef void (*funcp)(environment *); /* funcp is a pointer to a void |
67 |
|
function (environment *) */ |
68 |
|
|
69 |
void init_hashtbl(hashtbl out_hash) |
/* Initialize a newly created environment */ |
70 |
|
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 |
out_hash[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 |
stackitem** hash(hashtbl in_hashtbl, const char* in_string) |
/* 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 |
long i= 0; |
stackitem *temp= env->head; |
117 |
unsigned long out_hash= 0; |
|
118 |
char key= 0; |
if((env->head)==NULL) { |
119 |
stackitem** position; |
printerr("Too Few Arguments"); |
120 |
|
env->err=1; |
121 |
|
return; |
122 |
|
} |
123 |
|
|
124 |
while(1){ |
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. */ |
130 |
|
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
131 |
|
{ |
132 |
|
int i= 0; |
133 |
|
unsigned int out_hash= 0; |
134 |
|
char key= '\0'; |
135 |
|
symbol **position; |
136 |
|
|
137 |
|
while(1){ /* Hash in_string */ |
138 |
key= in_string[i++]; |
key= in_string[i++]; |
139 |
if(key=='\0') |
if(key=='\0') |
140 |
break; |
break; |
145 |
position= &(in_hashtbl[out_hash]); |
position= &(in_hashtbl[out_hash]); |
146 |
|
|
147 |
while(1){ |
while(1){ |
148 |
if(*position==NULL) |
if(*position==NULL) /* If empty */ |
149 |
return position; |
return position; |
150 |
|
|
151 |
if(strcmp(in_string, (*position)->id)==0) |
if(strcmp(in_string, (*position)->id)==0) /* If match */ |
152 |
return position; |
return position; |
153 |
|
|
154 |
position= &((*position)->next); |
position= &((*position)->next); /* Try next */ |
155 |
} |
} |
156 |
} |
} |
157 |
|
|
158 |
|
/* Generic push function. */ |
159 |
|
void push(environment *env, stackitem* in_item) |
160 |
|
{ |
161 |
|
in_item->next= env->head; |
162 |
|
env->head= in_item; |
163 |
|
} |
164 |
|
|
165 |
int push(stackitem** stack_head, stackitem* in_item) |
/* Push a value onto the stack */ |
166 |
|
void push_val(environment *env, value *val) |
167 |
{ |
{ |
168 |
in_item->next= *stack_head; |
stackitem *new_item= malloc(sizeof(stackitem)); |
169 |
*stack_head= in_item; |
new_item->item= val; |
170 |
return 1; |
val->refcount++; |
171 |
|
push(env, new_item); |
172 |
} |
} |
173 |
|
|
174 |
int push_val(stackitem** stack_head, int in_val) |
/* Push an integer onto the stack. */ |
175 |
|
void push_int(environment *env, int in_val) |
176 |
{ |
{ |
177 |
stackitem* new_item= malloc(sizeof(stackitem)); |
value *new_value= malloc(sizeof(value)); |
178 |
new_item->content.val= in_val; |
stackitem *new_item= malloc(sizeof(stackitem)); |
179 |
new_item->type= value; |
new_item->item= new_value; |
180 |
|
|
181 |
|
new_value->content.val= in_val; |
182 |
|
new_value->type= integer; |
183 |
|
new_value->refcount=1; |
184 |
|
|
185 |
push(stack_head, new_item); |
push(env, new_item); |
|
return 1; |
|
186 |
} |
} |
187 |
|
|
188 |
int push_cstring(stackitem** stack_head, const char* in_string) |
/* Copy a string onto the stack. */ |
189 |
|
void push_cstring(environment *env, const char *in_string) |
190 |
{ |
{ |
191 |
stackitem* new_item= malloc(sizeof(stackitem)); |
value *new_value= malloc(sizeof(value)); |
192 |
new_item->content.ptr= malloc(strlen(in_string)+1); |
stackitem *new_item= malloc(sizeof(stackitem)); |
193 |
strcpy(new_item->content.ptr, in_string); |
new_item->item=new_value; |
194 |
new_item->type= string; |
|
195 |
|
new_value->content.ptr= malloc(strlen(in_string)+1); |
196 |
|
strcpy(new_value->content.ptr, in_string); |
197 |
|
new_value->type= string; |
198 |
|
new_value->refcount=1; |
199 |
|
|
200 |
|
push(env, new_item); |
201 |
|
} |
202 |
|
|
203 |
|
/* Mangle a symbol name to a valid C identifier name */ |
204 |
|
char *mangle_str(const char *old_string){ |
205 |
|
char validchars[] |
206 |
|
="0123456789abcdef"; |
207 |
|
char *new_string, *current; |
208 |
|
|
209 |
|
new_string=malloc((strlen(old_string)*2)+4); |
210 |
|
strcpy(new_string, "sx_"); /* Stack eXternal */ |
211 |
|
current=new_string+3; |
212 |
|
while(old_string[0] != '\0'){ |
213 |
|
current[0]=validchars[(unsigned char)(old_string[0])/16]; |
214 |
|
current[1]=validchars[(unsigned char)(old_string[0])%16]; |
215 |
|
current+=2; |
216 |
|
old_string++; |
217 |
|
} |
218 |
|
current[0]='\0'; |
219 |
|
|
220 |
|
return new_string; /* The caller must free() it */ |
221 |
|
} |
222 |
|
|
223 |
|
extern void mangle(environment *env){ |
224 |
|
value *new_value; |
225 |
|
char *new_string; |
226 |
|
|
227 |
|
if((env->head)==NULL) { |
228 |
|
printerr("Too Few Arguments"); |
229 |
|
env->err=1; |
230 |
|
return; |
231 |
|
} |
232 |
|
|
233 |
|
if(env->head->item->type!=string) { |
234 |
|
printerr("Bad Argument Type"); |
235 |
|
env->err=2; |
236 |
|
return; |
237 |
|
} |
238 |
|
|
239 |
|
new_string= mangle_str((const char *)(env->head->item->content.ptr)); |
240 |
|
|
241 |
push(stack_head, new_item); |
toss(env); |
242 |
return 1; |
if(env->err) return; |
243 |
|
|
244 |
|
new_value= malloc(sizeof(value)); |
245 |
|
new_value->content.ptr= new_string; |
246 |
|
new_value->type= string; |
247 |
|
new_value->refcount=1; |
248 |
|
|
249 |
|
push_val(env, new_value); |
250 |
|
} |
251 |
|
|
252 |
|
/* Push a symbol onto the stack. */ |
253 |
|
void push_sym(environment *env, const char *in_string) |
254 |
|
{ |
255 |
|
stackitem *new_item; /* The new stack item */ |
256 |
|
/* ...which will contain... */ |
257 |
|
value *new_value; /* A new symbol value */ |
258 |
|
/* ...which might point to... */ |
259 |
|
symbol **new_symbol; /* (if needed) A new actual symbol */ |
260 |
|
/* ...which, if possible, will be bound to... */ |
261 |
|
value *new_fvalue; /* (if needed) A new function value */ |
262 |
|
/* ...which will point to... */ |
263 |
|
void *funcptr; /* A function pointer */ |
264 |
|
|
265 |
|
static void *handle= NULL; /* Dynamic linker handle */ |
266 |
|
const char *dlerr; /* Dynamic linker error */ |
267 |
|
char *mangled; /* Mangled function name */ |
268 |
|
|
269 |
|
/* Create a new stack item containing a new value */ |
270 |
|
new_item= malloc(sizeof(stackitem)); |
271 |
|
new_value= malloc(sizeof(value)); |
272 |
|
new_item->item=new_value; |
273 |
|
|
274 |
|
/* The new value is a symbol */ |
275 |
|
new_value->type= symb; |
276 |
|
new_value->refcount= 1; |
277 |
|
|
278 |
|
/* Look up the symbol name in the hash table */ |
279 |
|
new_symbol= hash(env->symbols, in_string); |
280 |
|
new_value->content.ptr= *new_symbol; |
281 |
|
|
282 |
|
if(*new_symbol==NULL) { /* If symbol was undefined */ |
283 |
|
|
284 |
|
/* Create a new symbol */ |
285 |
|
(*new_symbol)= malloc(sizeof(symbol)); |
286 |
|
(*new_symbol)->val= NULL; /* undefined value */ |
287 |
|
(*new_symbol)->next= NULL; |
288 |
|
(*new_symbol)->id= malloc(strlen(in_string)+1); |
289 |
|
strcpy((*new_symbol)->id, in_string); |
290 |
|
|
291 |
|
/* Intern the new symbol in the hash table */ |
292 |
|
new_value->content.ptr= *new_symbol; |
293 |
|
|
294 |
|
/* Try to load the symbol name as an external function, to see if |
295 |
|
we should bind the symbol to a new function pointer value */ |
296 |
|
if(handle==NULL) /* If no handle */ |
297 |
|
handle= dlopen(NULL, RTLD_LAZY); |
298 |
|
|
299 |
|
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
300 |
|
dlerr=dlerror(); |
301 |
|
if(dlerr != NULL) { /* If no function was found */ |
302 |
|
mangled=mangle_str(in_string); |
303 |
|
funcptr= dlsym(handle, mangled); /* try mangling it */ |
304 |
|
free(mangled); |
305 |
|
dlerr=dlerror(); |
306 |
|
} |
307 |
|
if(dlerr==NULL) { /* If a function was found */ |
308 |
|
new_fvalue= malloc(sizeof(value)); /* Create a new value */ |
309 |
|
new_fvalue->type=func; /* The new value is a function pointer */ |
310 |
|
new_fvalue->content.ptr=funcptr; /* Store function pointer */ |
311 |
|
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
312 |
|
function value */ |
313 |
|
new_fvalue->refcount= 1; |
314 |
|
} |
315 |
|
} |
316 |
|
push(env, new_item); |
317 |
} |
} |
318 |
|
|
319 |
int mk_hashentry(hashtbl in_hashtbl, stackitem* in_item, const char* id) |
/* Print newline. */ |
320 |
|
extern void nl() |
321 |
{ |
{ |
322 |
in_item->id= malloc(strlen(id)+1); |
printf("\n"); |
323 |
|
} |
324 |
|
|
325 |
|
/* Gets the type of a value */ |
326 |
|
extern void type(environment *env){ |
327 |
|
int typenum; |
328 |
|
|
329 |
|
if((env->head)==NULL) { |
330 |
|
printerr("Too Few Arguments"); |
331 |
|
env->err=1; |
332 |
|
return; |
333 |
|
} |
334 |
|
typenum=env->head->item->type; |
335 |
|
toss(env); |
336 |
|
switch(typenum){ |
337 |
|
case integer: |
338 |
|
push_sym(env, "integer"); |
339 |
|
break; |
340 |
|
case string: |
341 |
|
push_sym(env, "string"); |
342 |
|
break; |
343 |
|
case symb: |
344 |
|
push_sym(env, "symbol"); |
345 |
|
break; |
346 |
|
case func: |
347 |
|
push_sym(env, "function"); |
348 |
|
break; |
349 |
|
case list: |
350 |
|
push_sym(env, "list"); |
351 |
|
break; |
352 |
|
} |
353 |
|
} |
354 |
|
|
355 |
strcpy(in_item->id, id); |
/* Prints the top element of the stack. */ |
356 |
push(hash(in_hashtbl, id), in_item); |
void print_h(stackitem *stack_head) |
357 |
|
{ |
358 |
|
switch(stack_head->item->type) { |
359 |
|
case integer: |
360 |
|
printf("%d", stack_head->item->content.val); |
361 |
|
break; |
362 |
|
case string: |
363 |
|
printf("%s", (char*)stack_head->item->content.ptr); |
364 |
|
break; |
365 |
|
case symb: |
366 |
|
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
367 |
|
break; |
368 |
|
case func: |
369 |
|
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
370 |
|
break; |
371 |
|
case list: |
372 |
|
/* A list is just a stack, so make stack_head point to it */ |
373 |
|
stack_head=(stackitem *)(stack_head->item->content.ptr); |
374 |
|
printf("[ "); |
375 |
|
while(stack_head != NULL) { |
376 |
|
print_h(stack_head); |
377 |
|
printf(" "); |
378 |
|
stack_head=stack_head->next; |
379 |
|
} |
380 |
|
printf("]"); |
381 |
|
break; |
382 |
|
} |
383 |
|
} |
384 |
|
|
385 |
return 1; |
extern void print_(environment *env) { |
386 |
|
if(env->head==NULL) { |
387 |
|
printerr("Too Few Arguments"); |
388 |
|
env->err=1; |
389 |
|
return; |
390 |
|
} |
391 |
|
print_h(env->head); |
392 |
} |
} |
393 |
|
|
394 |
void def_func(hashtbl in_hashtbl, funcp in_func, const char* id) |
/* Prints the top element of the stack and then discards it. */ |
395 |
|
extern void print(environment *env) |
396 |
{ |
{ |
397 |
stackitem* temp= malloc(sizeof(stackitem)); |
print_(env); |
398 |
|
if(env->err) return; |
399 |
|
toss(env); |
400 |
|
} |
401 |
|
|
402 |
temp->type= func; |
/* Only to be called by function printstack. */ |
403 |
temp->content.ptr= in_func; |
void print_st(stackitem *stack_head, long counter) |
404 |
|
{ |
405 |
|
if(stack_head->next != NULL) |
406 |
|
print_st(stack_head->next, counter+1); |
407 |
|
printf("%ld: ", counter); |
408 |
|
print_h(stack_head); |
409 |
|
nl(); |
410 |
|
} |
411 |
|
|
412 |
mk_hashentry(in_hashtbl, temp, id); |
/* Prints the stack. */ |
413 |
|
extern void printstack(environment *env) |
414 |
|
{ |
415 |
|
if(env->head == NULL) { |
416 |
|
return; |
417 |
|
} |
418 |
|
print_st(env->head, 1); |
419 |
|
nl(); |
420 |
} |
} |
421 |
|
|
422 |
void def_sym(hashtbl in_hashtbl, const char* id) |
/* Swap the two top elements on the stack. */ |
423 |
|
extern void swap(environment *env) |
424 |
|
{ |
425 |
|
stackitem *temp= env->head; |
426 |
|
|
427 |
|
if(env->head==NULL || env->head->next==NULL) { |
428 |
|
printerr("Too Few Arguments"); |
429 |
|
env->err=1; |
430 |
|
return; |
431 |
|
} |
432 |
|
|
433 |
|
env->head= env->head->next; |
434 |
|
temp->next= env->head->next; |
435 |
|
env->head->next= temp; |
436 |
|
} |
437 |
|
|
438 |
|
/* Rotate the first three elements on the stack. */ |
439 |
|
extern void rot(environment *env) |
440 |
{ |
{ |
441 |
stackitem* temp= malloc(sizeof(stackitem)); |
stackitem *temp= env->head; |
442 |
|
|
443 |
temp->type= symbol; |
if(env->head==NULL || env->head->next==NULL |
444 |
|
|| env->head->next->next==NULL) { |
445 |
|
printerr("Too Few Arguments"); |
446 |
|
env->err=1; |
447 |
|
return; |
448 |
|
} |
449 |
|
|
450 |
|
env->head= env->head->next->next; |
451 |
|
temp->next->next= env->head->next; |
452 |
|
env->head->next= temp; |
453 |
|
} |
454 |
|
|
455 |
|
/* Recall a value from a symbol, if bound */ |
456 |
|
extern void rcl(environment *env) |
457 |
|
{ |
458 |
|
value *val; |
459 |
|
|
460 |
|
if(env->head == NULL) { |
461 |
|
printerr("Too Few Arguments"); |
462 |
|
env->err=1; |
463 |
|
return; |
464 |
|
} |
465 |
|
|
466 |
|
if(env->head->item->type!=symb) { |
467 |
|
printerr("Bad Argument Type"); |
468 |
|
env->err=2; |
469 |
|
return; |
470 |
|
} |
471 |
|
|
472 |
|
val=((symbol *)(env->head->item->content.ptr))->val; |
473 |
|
if(val == NULL){ |
474 |
|
printerr("Unbound Variable"); |
475 |
|
env->err=3; |
476 |
|
return; |
477 |
|
} |
478 |
|
toss(env); /* toss the symbol */ |
479 |
|
if(env->err) return; |
480 |
|
push_val(env, val); /* Return its bound value */ |
481 |
|
} |
482 |
|
|
483 |
|
/* If the top element is a symbol, determine if it's bound to a |
484 |
|
function value, and if it is, toss the symbol and execute the |
485 |
|
function. */ |
486 |
|
extern void eval(environment *env) |
487 |
|
{ |
488 |
|
funcp in_func; |
489 |
|
value* temp_val; |
490 |
|
stackitem* iterator; |
491 |
|
|
492 |
|
if(env->head==NULL) { |
493 |
|
printerr("Too Few Arguments"); |
494 |
|
env->err=1; |
495 |
|
return; |
496 |
|
} |
497 |
|
|
498 |
|
eval_start: |
499 |
|
|
500 |
|
switch(env->head->item->type) { |
501 |
|
/* if it's a symbol */ |
502 |
|
case symb: |
503 |
|
rcl(env); /* get its contents */ |
504 |
|
if(env->err) return; |
505 |
|
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
506 |
|
goto eval_start; |
507 |
|
} |
508 |
|
return; |
509 |
|
|
510 |
|
/* If it's a lone function value, run it */ |
511 |
|
case func: |
512 |
|
in_func= (funcp)(env->head->item->content.ptr); |
513 |
|
toss(env); |
514 |
|
if(env->err) return; |
515 |
|
return (*in_func)(env); |
516 |
|
|
517 |
|
/* If it's a list */ |
518 |
|
case list: |
519 |
|
temp_val= env->head->item; |
520 |
|
env->head->item->refcount++; |
521 |
|
toss(env); |
522 |
|
if(env->err) return; |
523 |
|
iterator= (stackitem*)temp_val->content.ptr; |
524 |
|
while(iterator!=NULL) { |
525 |
|
push_val(env, iterator->item); |
526 |
|
if(env->head->item->type==symb |
527 |
|
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
528 |
|
toss(env); |
529 |
|
if(env->err) return; |
530 |
|
if(iterator->next == NULL){ |
531 |
|
free_val(temp_val); |
532 |
|
goto eval_start; |
533 |
|
} |
534 |
|
eval(env); |
535 |
|
if(env->err) return; |
536 |
|
} |
537 |
|
iterator= iterator->next; |
538 |
|
} |
539 |
|
free_val(temp_val); |
540 |
|
return; |
541 |
|
|
542 |
|
default: |
543 |
|
return; |
544 |
|
} |
545 |
|
} |
546 |
|
|
547 |
|
/* Reverse (flip) a list */ |
548 |
|
extern void rev(environment *env){ |
549 |
|
stackitem *old_head, *new_head, *item; |
550 |
|
|
551 |
|
if((env->head)==NULL) { |
552 |
|
printerr("Too Few Arguments"); |
553 |
|
env->err=1; |
554 |
|
return; |
555 |
|
} |
556 |
|
|
557 |
|
if(env->head->item->type!=list) { |
558 |
|
printerr("Bad Argument Type"); |
559 |
|
env->err=2; |
560 |
|
return; |
561 |
|
} |
562 |
|
|
563 |
|
old_head=(stackitem *)(env->head->item->content.ptr); |
564 |
|
new_head=NULL; |
565 |
|
while(old_head != NULL){ |
566 |
|
item=old_head; |
567 |
|
old_head=old_head->next; |
568 |
|
item->next=new_head; |
569 |
|
new_head=item; |
570 |
|
} |
571 |
|
env->head->item->content.ptr=new_head; |
572 |
|
} |
573 |
|
|
574 |
|
/* Make a list. */ |
575 |
|
extern void pack(environment *env) |
576 |
|
{ |
577 |
|
stackitem *iterator, *temp; |
578 |
|
value *pack; |
579 |
|
|
580 |
|
iterator= env->head; |
581 |
|
|
582 |
|
if(iterator==NULL |
583 |
|
|| (iterator->item->type==symb |
584 |
|
&& ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) { |
585 |
|
temp= NULL; |
586 |
|
toss(env); |
587 |
|
} else { |
588 |
|
/* Search for first delimiter */ |
589 |
|
while(iterator->next!=NULL |
590 |
|
&& (iterator->next->item->type!=symb |
591 |
|
|| ((symbol*)(iterator->next->item->content.ptr))->id[0]!='[')) |
592 |
|
iterator= iterator->next; |
593 |
|
|
594 |
|
/* Extract list */ |
595 |
|
temp= env->head; |
596 |
|
env->head= iterator->next; |
597 |
|
iterator->next= NULL; |
598 |
|
|
599 |
|
if(env->head!=NULL) |
600 |
|
toss(env); |
601 |
|
} |
602 |
|
|
603 |
|
/* Push list */ |
604 |
|
pack= malloc(sizeof(value)); |
605 |
|
pack->type= list; |
606 |
|
pack->content.ptr= temp; |
607 |
|
pack->refcount= 1; |
608 |
|
|
609 |
mk_hashentry(in_hashtbl, temp, id); |
temp= malloc(sizeof(stackitem)); |
610 |
|
temp->item= pack; |
611 |
|
|
612 |
|
push(env, temp); |
613 |
|
rev(env); |
614 |
} |
} |
615 |
|
|
616 |
int push_ref(stackitem** stack_head, hashtbl in_hash, const char* in_string) |
/* Relocate elements of the list on the stack. */ |
617 |
|
extern void expand(environment *env) |
618 |
{ |
{ |
619 |
void* handle; |
stackitem *temp, *new_head; |
620 |
void* symbol; |
|
621 |
|
/* Is top element a list? */ |
622 |
|
if(env->head==NULL) { |
623 |
|
printerr("Too Few Arguments"); |
624 |
|
env->err=1; |
625 |
|
return; |
626 |
|
} |
627 |
|
if(env->head->item->type!=list) { |
628 |
|
printerr("Bad Argument Type"); |
629 |
|
env->err=2; |
630 |
|
return; |
631 |
|
} |
632 |
|
|
633 |
|
rev(env); |
634 |
|
|
635 |
|
if(env->err) |
636 |
|
return; |
637 |
|
|
638 |
|
/* The first list element is the new stack head */ |
639 |
|
new_head= temp= env->head->item->content.ptr; |
640 |
|
|
641 |
|
env->head->item->refcount++; |
642 |
|
toss(env); |
643 |
|
|
644 |
|
/* Find the end of the list */ |
645 |
|
while(temp->next!=NULL) |
646 |
|
temp= temp->next; |
647 |
|
|
648 |
|
/* Connect the tail of the list with the old stack head */ |
649 |
|
temp->next= env->head; |
650 |
|
env->head= new_head; /* ...and voila! */ |
651 |
|
|
652 |
|
} |
653 |
|
|
654 |
|
/* Compares two elements by reference. */ |
655 |
|
extern void eq(environment *env) |
656 |
|
{ |
657 |
|
void *left, *right; |
658 |
|
int result; |
659 |
|
|
660 |
|
if((env->head)==NULL || env->head->next==NULL) { |
661 |
|
printerr("Too Few Arguments"); |
662 |
|
env->err=1; |
663 |
|
return; |
664 |
|
} |
665 |
|
|
666 |
|
left= env->head->item->content.ptr; |
667 |
|
swap(env); |
668 |
|
right= env->head->item->content.ptr; |
669 |
|
result= (left==right); |
670 |
|
|
671 |
stackitem* new_item= malloc(sizeof(stackitem)); |
toss(env); toss(env); |
672 |
new_item->content.ptr= *hash(in_hash, in_string); |
push_int(env, result); |
673 |
new_item->type= ref; |
} |
674 |
|
|
675 |
if(new_item->content.ptr==NULL) { |
/* Negates the top element on the stack. */ |
676 |
handle= dlopen(NULL, RTLD_LAZY); |
extern void not(environment *env) |
677 |
symbol= dlsym(handle, in_string); |
{ |
678 |
if(dlerror()==NULL) |
int val; |
679 |
def_func(in_hash, symbol, in_string); |
|
680 |
else |
if((env->head)==NULL) { |
681 |
def_sym(in_hash, in_string); |
printerr("Too Few Arguments"); |
682 |
|
env->err=1; |
683 |
new_item->content.ptr= *hash(in_hash, in_string); |
return; |
684 |
new_item->type= ref; |
} |
685 |
|
|
686 |
|
if(env->head->item->type!=integer) { |
687 |
|
printerr("Bad Argument Type"); |
688 |
|
env->err=2; |
689 |
|
return; |
690 |
|
} |
691 |
|
|
692 |
|
val= env->head->item->content.val; |
693 |
|
toss(env); |
694 |
|
push_int(env, !val); |
695 |
|
} |
696 |
|
|
697 |
|
/* Compares the two top elements on the stack and return 0 if they're the |
698 |
|
same. */ |
699 |
|
extern void neq(environment *env) |
700 |
|
{ |
701 |
|
eq(env); |
702 |
|
not(env); |
703 |
|
} |
704 |
|
|
705 |
|
/* Give a symbol some content. */ |
706 |
|
extern void def(environment *env) |
707 |
|
{ |
708 |
|
symbol *sym; |
709 |
|
|
710 |
|
/* Needs two values on the stack, the top one must be a symbol */ |
711 |
|
if(env->head==NULL || env->head->next==NULL) { |
712 |
|
printerr("Too Few Arguments"); |
713 |
|
env->err=1; |
714 |
|
return; |
715 |
} |
} |
716 |
|
|
717 |
push(stack_head, new_item); |
if(env->head->item->type!=symb) { |
718 |
return 1; |
printerr("Bad Argument Type"); |
719 |
|
env->err=2; |
720 |
|
return; |
721 |
|
} |
722 |
|
|
723 |
|
/* long names are a pain */ |
724 |
|
sym=env->head->item->content.ptr; |
725 |
|
|
726 |
|
/* if the symbol was bound to something else, throw it away */ |
727 |
|
if(sym->val != NULL) |
728 |
|
free_val(sym->val); |
729 |
|
|
730 |
|
/* Bind the symbol to the value */ |
731 |
|
sym->val= env->head->next->item; |
732 |
|
sym->val->refcount++; /* Increase the reference counter */ |
733 |
|
|
734 |
|
toss(env); toss(env); |
735 |
|
} |
736 |
|
|
737 |
|
/* Quit stack. */ |
738 |
|
extern void quit(environment *env) |
739 |
|
{ |
740 |
|
exit(EXIT_SUCCESS); |
741 |
|
} |
742 |
|
|
743 |
|
/* Clear stack */ |
744 |
|
extern void clear(environment *env) |
745 |
|
{ |
746 |
|
while(env->head!=NULL) |
747 |
|
toss(env); |
748 |
} |
} |
749 |
|
|
750 |
extern void toss(stackitem** stack_head) |
/* List all defined words */ |
751 |
|
extern void words(environment *env) |
752 |
{ |
{ |
753 |
stackitem* temp= *stack_head; |
symbol *temp; |
754 |
|
int i; |
755 |
|
|
756 |
|
for(i= 0; i<HASHTBLSIZE; i++) { |
757 |
|
temp= env->symbols[i]; |
758 |
|
while(temp!=NULL) { |
759 |
|
printf("%s\n", temp->id); |
760 |
|
temp= temp->next; |
761 |
|
} |
762 |
|
} |
763 |
|
} |
764 |
|
|
765 |
|
/* Forgets a symbol (remove it from the hash table) */ |
766 |
|
extern void forget(environment *env) |
767 |
|
{ |
768 |
|
char* sym_id; |
769 |
|
stackitem *stack_head= env->head; |
770 |
|
symbol **hash_entry, *temp; |
771 |
|
|
772 |
|
if(stack_head==NULL) { |
773 |
|
printerr("Too Few Arguments"); |
774 |
|
env->err=1; |
775 |
|
return; |
776 |
|
} |
777 |
|
|
778 |
|
if(stack_head->item->type!=symb) { |
779 |
|
printerr("Bad Argument Type"); |
780 |
|
env->err=2; |
781 |
|
return; |
782 |
|
} |
783 |
|
|
784 |
|
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
785 |
|
toss(env); |
786 |
|
|
787 |
*stack_head= (*stack_head)->next; |
hash_entry= hash(env->symbols, sym_id); |
788 |
|
temp= *hash_entry; |
789 |
|
*hash_entry= (*hash_entry)->next; |
790 |
|
|
791 |
|
if(temp->val!=NULL) { |
792 |
|
free_val(temp->val); |
793 |
|
} |
794 |
|
free(temp->id); |
795 |
free(temp); |
free(temp); |
796 |
} |
} |
797 |
|
|
798 |
|
/* Returns the current error number to the stack */ |
799 |
|
extern void errn(environment *env){ |
800 |
|
push_int(env, env->err); |
801 |
|
} |
802 |
|
|
803 |
|
extern void read(environment*); |
804 |
|
|
805 |
/* print_stack(stack); */ |
int main() |
806 |
void print_st(stackitem* stack_head, long counter) |
{ |
807 |
{ |
environment myenv; |
808 |
if(stack_head->next != NULL) |
|
809 |
print_st(stack_head->next, counter+1); |
init_env(&myenv); |
810 |
|
|
811 |
|
while(1) { |
812 |
|
if(myenv.in_string==NULL) |
813 |
|
printstack(&myenv); |
814 |
|
read(&myenv); |
815 |
|
if(myenv.err) { |
816 |
|
printf("(error %d) ", myenv.err); |
817 |
|
myenv.err=0; |
818 |
|
} else if(myenv.head!=NULL |
819 |
|
&& myenv.head->item->type==symb |
820 |
|
&& ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') { |
821 |
|
toss(&myenv); /* No error check in main */ |
822 |
|
eval(&myenv); |
823 |
|
} |
824 |
|
} |
825 |
|
quit(&myenv); |
826 |
|
return EXIT_FAILURE; |
827 |
|
} |
828 |
|
|
829 |
|
/* + */ |
830 |
|
extern void sx_2b(environment *env) { |
831 |
|
int a, b; |
832 |
|
size_t len; |
833 |
|
char* new_string; |
834 |
|
value *a_val, *b_val; |
835 |
|
|
836 |
|
if((env->head)==NULL || env->head->next==NULL) { |
837 |
|
printerr("Too Few Arguments"); |
838 |
|
env->err=1; |
839 |
|
return; |
840 |
|
} |
841 |
|
|
842 |
|
if(env->head->item->type==string |
843 |
|
&& env->head->next->item->type==string) { |
844 |
|
a_val= env->head->item; |
845 |
|
b_val= env->head->next->item; |
846 |
|
a_val->refcount++; |
847 |
|
b_val->refcount++; |
848 |
|
toss(env); if(env->err) return; |
849 |
|
toss(env); if(env->err) return; |
850 |
|
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
851 |
|
new_string= malloc(len); |
852 |
|
strcpy(new_string, b_val->content.ptr); |
853 |
|
strcat(new_string, a_val->content.ptr); |
854 |
|
free_val(a_val); free_val(b_val); |
855 |
|
push_cstring(env, new_string); |
856 |
|
free(new_string); |
857 |
|
return; |
858 |
|
} |
859 |
|
|
860 |
|
if(env->head->item->type!=integer |
861 |
|
|| env->head->next->item->type!=integer) { |
862 |
|
printerr("Bad Argument Type"); |
863 |
|
env->err=2; |
864 |
|
return; |
865 |
|
} |
866 |
|
a=env->head->item->content.val; |
867 |
|
toss(env); |
868 |
|
if(env->err) return; |
869 |
|
if(env->head->item->refcount == 1) |
870 |
|
env->head->item->content.val += a; |
871 |
|
else { |
872 |
|
b=env->head->item->content.val; |
873 |
|
toss(env); |
874 |
|
if(env->err) return; |
875 |
|
push_int(env, a+b); |
876 |
|
} |
877 |
|
} |
878 |
|
|
879 |
switch(stack_head->type){ |
/* - */ |
880 |
case value: |
extern void sx_2d(environment *env) { |
881 |
printf("%ld: %d\n", counter, (int)stack_head->content.val); |
int a, b; |
882 |
|
|
883 |
|
if((env->head)==NULL || env->head->next==NULL) { |
884 |
|
printerr("Too Few Arguments"); |
885 |
|
env->err=1; |
886 |
|
return; |
887 |
|
} |
888 |
|
|
889 |
|
if(env->head->item->type!=integer |
890 |
|
|| env->head->next->item->type!=integer) { |
891 |
|
printerr("Bad Argument Type"); |
892 |
|
env->err=2; |
893 |
|
return; |
894 |
|
} |
895 |
|
a=env->head->item->content.val; |
896 |
|
toss(env); |
897 |
|
if(env->err) return; |
898 |
|
if(env->head->item->refcount == 1) |
899 |
|
env->head->item->content.val -= a; |
900 |
|
else { |
901 |
|
b=env->head->item->content.val; |
902 |
|
toss(env); |
903 |
|
if(env->err) return; |
904 |
|
push_int(env, b-a); |
905 |
|
} |
906 |
|
} |
907 |
|
|
908 |
|
/* > */ |
909 |
|
extern void sx_3e(environment *env) { |
910 |
|
int a, b; |
911 |
|
|
912 |
|
if((env->head)==NULL || env->head->next==NULL) { |
913 |
|
printerr("Too Few Arguments"); |
914 |
|
env->err=1; |
915 |
|
return; |
916 |
|
} |
917 |
|
|
918 |
|
if(env->head->item->type!=integer |
919 |
|
|| env->head->next->item->type!=integer) { |
920 |
|
printerr("Bad Argument Type"); |
921 |
|
env->err=2; |
922 |
|
return; |
923 |
|
} |
924 |
|
a=env->head->item->content.val; |
925 |
|
toss(env); |
926 |
|
if(env->err) return; |
927 |
|
if(env->head->item->refcount == 1) |
928 |
|
env->head->item->content.val = (env->head->item->content.val > a); |
929 |
|
else { |
930 |
|
b=env->head->item->content.val; |
931 |
|
toss(env); |
932 |
|
if(env->err) return; |
933 |
|
push_int(env, b>a); |
934 |
|
} |
935 |
|
} |
936 |
|
|
937 |
|
/* Return copy of a value */ |
938 |
|
value *copy_val(value *old_value){ |
939 |
|
stackitem *old_item, *new_item, *prev_item; |
940 |
|
|
941 |
|
value *new_value=malloc(sizeof(value)); |
942 |
|
|
943 |
|
new_value->type=old_value->type; |
944 |
|
new_value->refcount=0; /* This is increased if/when this |
945 |
|
value is referenced somewhere, like |
946 |
|
in a stack item or a variable */ |
947 |
|
switch(old_value->type){ |
948 |
|
case integer: |
949 |
|
new_value->content.val=old_value->content.val; |
950 |
break; |
break; |
951 |
case string: |
case string: |
952 |
printf("%ld: \"%s\"\n", counter, (char*)stack_head->content.ptr); |
(char *)(new_value->content.ptr) |
953 |
|
= strdup((char *)(old_value->content.ptr)); |
954 |
break; |
break; |
|
case ref: |
|
955 |
case func: |
case func: |
956 |
case symbol: |
case symb: |
957 |
printf("%ld: %p\n", counter, stack_head->content.ptr); |
new_value->content.ptr=old_value->content.ptr; |
958 |
|
break; |
959 |
|
case list: |
960 |
|
new_value->content.ptr=NULL; |
961 |
|
|
962 |
|
prev_item=NULL; |
963 |
|
old_item=(stackitem *)(old_value->content.ptr); |
964 |
|
|
965 |
|
while(old_item != NULL) { /* While list is not empty */ |
966 |
|
new_item= malloc(sizeof(stackitem)); |
967 |
|
new_item->item=copy_val(old_item->item); /* recurse */ |
968 |
|
new_item->next=NULL; |
969 |
|
if(prev_item != NULL) /* If this wasn't the first item */ |
970 |
|
prev_item->next=new_item; /* point the previous item to the |
971 |
|
new item */ |
972 |
|
else |
973 |
|
new_value->content.ptr=new_item; |
974 |
|
old_item=old_item->next; |
975 |
|
prev_item=new_item; |
976 |
|
} |
977 |
break; |
break; |
978 |
} |
} |
979 |
|
return new_value; |
980 |
} |
} |
981 |
|
|
982 |
extern void printstack(stackitem** stack_head) |
/* duplicates an item on the stack */ |
983 |
{ |
extern void dup(environment *env) { |
984 |
if(*stack_head != NULL) { |
if((env->head)==NULL) { |
985 |
print_st(*stack_head, 1); |
printerr("Too Few Arguments"); |
986 |
printf("\n"); |
env->err=1; |
987 |
|
return; |
988 |
} |
} |
989 |
|
push_val(env, copy_val(env->head->item)); |
990 |
} |
} |
991 |
|
|
992 |
|
/* "if", If-Then */ |
993 |
|
extern void sx_6966(environment *env) { |
994 |
|
|
995 |
extern void eval(stackitem** stack_head) |
int truth; |
|
{ |
|
|
funcp in_func; |
|
996 |
|
|
997 |
if((*stack_head)==NULL || (*stack_head)->type!=ref) |
if((env->head)==NULL || env->head->next==NULL) { |
998 |
|
printerr("Too Few Arguments"); |
999 |
|
env->err=1; |
1000 |
return; |
return; |
1001 |
|
} |
1002 |
|
|
1003 |
if(((stackitem*)(*stack_head)->content.ptr)->type==func) { |
if(env->head->next->item->type != integer) { |
1004 |
in_func= (funcp)((stackitem*)(*stack_head)->content.ptr)->content.ptr; |
printerr("Bad Argument Type"); |
1005 |
toss(stack_head); |
env->err=2; |
|
(*in_func)(stack_head); |
|
1006 |
return; |
return; |
1007 |
} |
} |
1008 |
|
|
1009 |
|
swap(env); |
1010 |
|
if(env->err) return; |
1011 |
|
|
1012 |
|
truth=env->head->item->content.val; |
1013 |
|
|
1014 |
|
toss(env); |
1015 |
|
if(env->err) return; |
1016 |
|
|
1017 |
|
if(truth) |
1018 |
|
eval(env); |
1019 |
|
else |
1020 |
|
toss(env); |
1021 |
} |
} |
1022 |
|
|
1023 |
int stack_read(stackitem** stack_head, hashtbl in_hash, char* in_line) |
/* If-Then-Else */ |
1024 |
{ |
extern void ifelse(environment *env) { |
|
char *temp, *rest; |
|
|
int itemp; |
|
|
size_t inlength= strlen(in_line)+1; |
|
|
int convert= 0; |
|
1025 |
|
|
1026 |
temp= malloc(inlength); |
int truth; |
|
rest= malloc(inlength); |
|
1027 |
|
|
1028 |
if((convert= sscanf(in_line, "\"%[^\"\n\r]\" %[^\n\r]", temp, rest)) >= 1) |
if((env->head)==NULL || env->head->next==NULL |
1029 |
push_cstring(stack_head, temp); |
|| env->head->next->next==NULL) { |
1030 |
else if((convert= sscanf(in_line, "%d %[^\n\r]", &itemp, rest)) >= 1) |
printerr("Too Few Arguments"); |
1031 |
push_val(stack_head, itemp); |
env->err=1; |
1032 |
else if((convert= sscanf(in_line, "%[^ ;\n\r]%[^\n\r]", temp, rest)) >= 1) |
return; |
1033 |
push_ref(stack_head, in_hash, temp); |
} |
|
else if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest)) >= 1) |
|
|
if(*temp==';') |
|
|
eval(stack_head); |
|
1034 |
|
|
1035 |
free(temp); |
if(env->head->next->next->item->type != integer) { |
1036 |
|
printerr("Bad Argument Type"); |
1037 |
|
env->err=2; |
1038 |
|
return; |
1039 |
|
} |
1040 |
|
|
1041 |
|
rot(env); |
1042 |
|
if(env->err) return; |
1043 |
|
|
1044 |
|
truth=env->head->item->content.val; |
1045 |
|
|
1046 |
if(convert<2) { |
toss(env); |
1047 |
free(rest); |
if(env->err) return; |
1048 |
return 0; |
|
1049 |
|
if(!truth) |
1050 |
|
swap(env); |
1051 |
|
if(env->err) return; |
1052 |
|
|
1053 |
|
toss(env); |
1054 |
|
if(env->err) return; |
1055 |
|
|
1056 |
|
eval(env); |
1057 |
|
} |
1058 |
|
|
1059 |
|
/* while */ |
1060 |
|
extern void sx_7768696c65(environment *env) { |
1061 |
|
|
1062 |
|
int truth; |
1063 |
|
value *loop, *test; |
1064 |
|
|
1065 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1066 |
|
printerr("Too Few Arguments"); |
1067 |
|
env->err=1; |
1068 |
|
return; |
1069 |
} |
} |
1070 |
|
|
1071 |
stack_read(stack_head, in_hash, rest); |
loop= env->head->item; |
1072 |
|
loop->refcount++; |
1073 |
|
toss(env); if(env->err) return; |
1074 |
|
|
1075 |
|
test= env->head->item; |
1076 |
|
test->refcount++; |
1077 |
|
toss(env); if(env->err) return; |
1078 |
|
|
1079 |
|
do { |
1080 |
|
push_val(env, test); |
1081 |
|
eval(env); |
1082 |
|
|
1083 |
|
if(env->head->item->type != integer) { |
1084 |
|
printerr("Bad Argument Type"); |
1085 |
|
env->err=2; |
1086 |
|
return; |
1087 |
|
} |
1088 |
|
|
1089 |
|
truth= env->head->item->content.val; |
1090 |
|
toss(env); if(env->err) return; |
1091 |
|
|
1092 |
|
if(truth) { |
1093 |
|
push_val(env, loop); |
1094 |
|
eval(env); |
1095 |
|
} else { |
1096 |
|
toss(env); |
1097 |
|
} |
1098 |
|
|
1099 |
free(rest); |
} while(truth); |
1100 |
return 1; |
|
1101 |
|
free_val(test); |
1102 |
|
free_val(loop); |
1103 |
} |
} |
1104 |
|
|
1105 |
extern void print(stackitem** stack_head) |
/* For-loop */ |
1106 |
{ |
extern void sx_666f72(environment *env) { |
1107 |
if((*stack_head)==NULL) |
|
1108 |
|
value *loop, *foo; |
1109 |
|
stackitem *iterator; |
1110 |
|
|
1111 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1112 |
|
printerr("Too Few Arguments"); |
1113 |
|
env->err=1; |
1114 |
return; |
return; |
1115 |
|
} |
1116 |
|
|
1117 |
if((*stack_head)->type==value) |
if(env->head->next->item->type != list) { |
1118 |
printf("%d", (*stack_head)->content.val); |
printerr("Bad Argument Type"); |
1119 |
else if((*stack_head)->type==string) |
env->err=2; |
1120 |
printf("%s", (char*)(*stack_head)->content.ptr); |
return; |
1121 |
else |
} |
|
printf("%p", (*stack_head)->content.ptr); |
|
1122 |
|
|
1123 |
toss(stack_head); |
loop= env->head->item; |
1124 |
|
loop->refcount++; |
1125 |
|
toss(env); if(env->err) return; |
1126 |
|
|
1127 |
|
foo= env->head->item; |
1128 |
|
foo->refcount++; |
1129 |
|
toss(env); if(env->err) return; |
1130 |
|
|
1131 |
|
iterator= foo->content.ptr; |
1132 |
|
|
1133 |
|
while(iterator!=NULL) { |
1134 |
|
push_val(env, iterator->item); |
1135 |
|
push_val(env, loop); |
1136 |
|
eval(env); if(env->err) return; |
1137 |
|
iterator= iterator->next; |
1138 |
|
} |
1139 |
|
|
1140 |
|
free_val(loop); |
1141 |
|
free_val(foo); |
1142 |
} |
} |
1143 |
|
|
1144 |
extern void nl() |
/* 'to' */ |
1145 |
{ |
extern void to(environment *env) { |
1146 |
printf("\n"); |
int i, start, ending; |
1147 |
|
|
1148 |
|
if((env->head)==NULL || env->head->next==NULL) { |
1149 |
|
printerr("Too Few Arguments"); |
1150 |
|
env->err=1; |
1151 |
|
return; |
1152 |
|
} |
1153 |
|
|
1154 |
|
if(env->head->item->type!=integer |
1155 |
|
|| env->head->next->item->type!=integer) { |
1156 |
|
printerr("Bad Argument Type"); |
1157 |
|
env->err=2; |
1158 |
|
return; |
1159 |
|
} |
1160 |
|
|
1161 |
|
ending= env->head->item->content.val; |
1162 |
|
toss(env); if(env->err) return; |
1163 |
|
start= env->head->item->content.val; |
1164 |
|
toss(env); if(env->err) return; |
1165 |
|
|
1166 |
|
push_sym(env, "["); |
1167 |
|
|
1168 |
|
if(ending>=start) { |
1169 |
|
for(i= start; i<=ending; i++) |
1170 |
|
push_int(env, i); |
1171 |
|
} else { |
1172 |
|
for(i= start; i>=ending; i--) |
1173 |
|
push_int(env, i); |
1174 |
|
} |
1175 |
|
|
1176 |
|
pack(env); if(env->err) return; |
1177 |
} |
} |
1178 |
|
|
1179 |
int main() |
/* Read a string */ |
1180 |
{ |
extern void readline(environment *env) { |
1181 |
stackitem* s= NULL; |
char in_string[101]; |
1182 |
hashtbl myhash; |
|
1183 |
char in_string[100]; |
fgets(in_string, 100, stdin); |
1184 |
|
push_cstring(env, in_string); |
1185 |
|
} |
1186 |
|
|
1187 |
init_hashtbl(myhash); |
/* Read a value and place on stack */ |
1188 |
|
extern void read(environment *env) { |
1189 |
|
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%[\001-\377]"; |
1190 |
|
const char strform[]= "\"%[^\"]\"%[\001-\377]"; |
1191 |
|
const char intform[]= "%i%[\001-\377]"; |
1192 |
|
const char blankform[]= "%*[ \t]%[\001-\377]"; |
1193 |
|
const char ebrackform[]= "%*1[]]%[\001-\377]"; |
1194 |
|
const char semicform[]= "%*1[;]%[\001-\377]"; |
1195 |
|
const char bbrackform[]= "%*1[[]%[\001-\377]"; |
1196 |
|
|
1197 |
printf("okidok\n "); |
int itemp; |
1198 |
|
static int depth= 0; |
1199 |
|
char *rest, *match; |
1200 |
|
size_t inlength; |
1201 |
|
|
1202 |
while(fgets(in_string, 100, stdin) != NULL) { |
if(env->in_string==NULL) { |
1203 |
stack_read(&s, myhash, in_string); |
readline(env); if(env->err) return; |
1204 |
printf("okidok\n "); |
|
1205 |
|
env->in_string= malloc(strlen(env->head->item->content.ptr)+1); |
1206 |
|
strcpy(env->in_string, env->head->item->content.ptr); |
1207 |
|
toss(env); if(env->err) return; |
1208 |
} |
} |
1209 |
|
|
1210 |
|
inlength= strlen(env->in_string)+1; |
1211 |
|
match= malloc(inlength); |
1212 |
|
rest= malloc(inlength); |
1213 |
|
|
1214 |
|
if(sscanf(env->in_string, blankform, rest)) { |
1215 |
|
; |
1216 |
|
} else if(sscanf(env->in_string, intform, &itemp, rest) > 0) { |
1217 |
|
push_int(env, itemp); |
1218 |
|
} else if(sscanf(env->in_string, strform, match, rest) > 0) { |
1219 |
|
push_cstring(env, match); |
1220 |
|
} else if(sscanf(env->in_string, symbform, match, rest) > 0) { |
1221 |
|
push_sym(env, match); |
1222 |
|
} else if(sscanf(env->in_string, ebrackform, rest) > 0) { |
1223 |
|
pack(env); if(env->err) return; |
1224 |
|
if(depth!=0) depth--; |
1225 |
|
} else if(sscanf(env->in_string, semicform, rest) > 0) { |
1226 |
|
push_sym(env, ";"); |
1227 |
|
} else if(sscanf(env->in_string, bbrackform, rest) > 0) { |
1228 |
|
push_sym(env, "["); |
1229 |
|
depth++; |
1230 |
|
} else { |
1231 |
|
free(rest); |
1232 |
|
rest= NULL; |
1233 |
|
} |
1234 |
|
|
1235 |
|
free(env->in_string); |
1236 |
|
free(match); |
1237 |
|
|
1238 |
return EXIT_SUCCESS; |
env->in_string= rest; |
|
} |
|
1239 |
|
|
1240 |
/* Local Variables: */ |
if(depth) |
1241 |
/* compile-command:"make CFLAGS=\"-Wall -g -rdynamic -ldl\" stack" */ |
return read(env); |
1242 |
/* End: */ |
} |