6 |
#include <stddef.h> |
#include <stddef.h> |
7 |
/* dlopen, dlsym, dlerror */ |
/* dlopen, dlsym, dlerror */ |
8 |
#include <dlfcn.h> |
#include <dlfcn.h> |
9 |
|
/* assert */ |
10 |
|
#include <assert.h> |
11 |
|
|
12 |
#define HASHTBLSIZE 65536 |
#define HASHTBLSIZE 65536 |
13 |
|
|
15 |
{ |
{ |
16 |
enum { |
enum { |
17 |
value, /* Integer */ |
value, /* Integer */ |
18 |
string, |
string, |
19 |
ref, /* Reference (to an element in the hash table) */ |
ref, /* Reference (to an element in the |
20 |
|
hash table) */ |
21 |
func, /* Function pointer */ |
func, /* Function pointer */ |
22 |
symbol, |
symbol, |
23 |
list |
list |
24 |
} type; /* Tells what kind of stack element */ |
} type; /* Type of stack element */ |
25 |
|
|
26 |
union { |
union { |
27 |
void* ptr; /* Pointer to the content */ |
void* ptr; /* Pointer to the content */ |
28 |
int val; /* ...or an integer */ |
int val; /* ...or an integer */ |
34 |
|
|
35 |
|
|
36 |
typedef stackitem* hashtbl[HASHTBLSIZE]; /* Hash table declaration */ |
typedef stackitem* hashtbl[HASHTBLSIZE]; /* Hash table declaration */ |
37 |
typedef void (*funcp)(stackitem**); /* Function pointer declaration */ |
typedef void (*funcp)(stackitem**); /* funcp is a pointer to a |
38 |
|
void function (stackitem **) */ |
39 |
|
|
40 |
/* Initiates a newly created hash table. */ |
/* Initialize a newly created hash table. */ |
41 |
void init_hashtbl(hashtbl out_hash) |
void init_hashtbl(hashtbl out_hash) |
42 |
{ |
{ |
43 |
long i; |
long i; |
51 |
{ |
{ |
52 |
long i= 0; |
long i= 0; |
53 |
unsigned long out_hash= 0; |
unsigned long out_hash= 0; |
54 |
char key= 0; |
char key= '\0'; |
55 |
stackitem** position; |
stackitem** position; |
56 |
|
|
57 |
while(1){ /* Hash in_string */ |
while(1){ /* Hash in_string */ |
64 |
out_hash= out_hash%HASHTBLSIZE; |
out_hash= out_hash%HASHTBLSIZE; |
65 |
position= &(in_hashtbl[out_hash]); |
position= &(in_hashtbl[out_hash]); |
66 |
|
|
67 |
while(1){ /* Return position if empty */ |
while(position != NULL){ |
68 |
if(*position==NULL) |
if(*position==NULL) /* If empty */ |
69 |
return position; |
return position; |
70 |
|
|
71 |
if(strcmp(in_string, (*position)->id)==0) /* Return position if match */ |
if(strcmp(in_string, (*position)->id)==0) /* If match */ |
72 |
return position; |
return position; |
73 |
|
|
74 |
position= &((*position)->next); /* Try next */ |
position= &((*position)->next); /* Try next */ |
75 |
} |
} |
76 |
|
return NULL; /* end of list reached without finding |
77 |
|
an empty position */ |
78 |
} |
} |
79 |
|
|
80 |
/* Generic push function. */ |
/* Generic push function. */ |
89 |
int push_val(stackitem** stack_head, int in_val) |
int push_val(stackitem** stack_head, int in_val) |
90 |
{ |
{ |
91 |
stackitem* new_item= malloc(sizeof(stackitem)); |
stackitem* new_item= malloc(sizeof(stackitem)); |
92 |
|
assert(new_item != NULL); |
93 |
new_item->content.val= in_val; |
new_item->content.val= in_val; |
94 |
new_item->type= value; |
new_item->type= value; |
95 |
|
|
120 |
return 1; |
return 1; |
121 |
} |
} |
122 |
|
|
123 |
/* Define a function a new function in the hash table. */ |
/* Define a new function in the hash table. */ |
124 |
void def_func(hashtbl in_hashtbl, funcp in_func, const char* id) |
void def_func(hashtbl in_hashtbl, funcp in_func, const char* id) |
125 |
{ |
{ |
126 |
stackitem* temp= malloc(sizeof(stackitem)); |
stackitem* temp= malloc(sizeof(stackitem)); |
269 |
printerr("Not a function"); |
printerr("Not a function"); |
270 |
} |
} |
271 |
|
|
272 |
|
/* Make a list. */ |
273 |
|
extern void pack(stackitem** stack_head) |
274 |
|
{ |
275 |
|
void* delimiter; |
276 |
|
stackitem *iterator, *temp, *pack; |
277 |
|
|
278 |
|
if((*stack_head)==NULL) { |
279 |
|
printerr("Stack empty"); |
280 |
|
return; |
281 |
|
} |
282 |
|
|
283 |
|
delimiter= (*stack_head)->content.ptr; /* Get delimiter */ |
284 |
|
toss(stack_head); |
285 |
|
|
286 |
|
iterator= *stack_head; |
287 |
|
|
288 |
|
/* Search for first delimiter */ |
289 |
|
while(iterator->next!=NULL && iterator->next->content.ptr!=delimiter) |
290 |
|
iterator= iterator->next; |
291 |
|
|
292 |
|
/* Extract list */ |
293 |
|
temp= *stack_head; |
294 |
|
*stack_head= iterator->next; |
295 |
|
iterator->next= NULL; |
296 |
|
|
297 |
|
if(*stack_head!=NULL && (*stack_head)->content.ptr==delimiter) |
298 |
|
toss(stack_head); |
299 |
|
|
300 |
|
/* Push list */ |
301 |
|
pack= malloc(sizeof(stackitem)); |
302 |
|
pack->type= list; |
303 |
|
pack->content.ptr= temp; |
304 |
|
|
305 |
|
push(stack_head, pack); |
306 |
|
} |
307 |
|
|
308 |
/* Parse input. */ |
/* Parse input. */ |
309 |
int stack_read(stackitem** stack_head, hashtbl in_hash, char* in_line) |
int stack_read(stackitem** stack_head, hashtbl in_hash, char* in_line) |
310 |
{ |
{ |
312 |
int itemp; |
int itemp; |
313 |
size_t inlength= strlen(in_line)+1; |
size_t inlength= strlen(in_line)+1; |
314 |
int convert= 0; |
int convert= 0; |
315 |
|
static int non_eval_flag= 0; |
316 |
|
|
317 |
temp= malloc(inlength); |
temp= malloc(inlength); |
318 |
rest= malloc(inlength); |
rest= malloc(inlength); |
335 |
break; |
break; |
336 |
} |
} |
337 |
/* If symbol */ |
/* If symbol */ |
338 |
if((convert= sscanf(in_line, "%[^ ;\n\r]%[^\n\r]", temp, rest))) { |
if((convert= sscanf(in_line, "%[^] ;\n\r]%[^\n\r]", temp, rest))) { |
339 |
push_ref(stack_head, in_hash, temp); |
push_ref(stack_head, in_hash, temp); |
340 |
break; |
break; |
341 |
} |
} |
342 |
/* If ';' */ |
/* If single char */ |
343 |
if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest)) && *temp==';') { |
if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) { |
344 |
eval(stack_head); /* Evaluate top element */ |
if(*temp==';') { |
345 |
break; |
if(non_eval_flag) { |
346 |
|
eval(stack_head); /* Evaluate top element */ |
347 |
|
break; |
348 |
|
} |
349 |
|
|
350 |
|
push_ref(stack_head, in_hash, ";"); |
351 |
|
break; |
352 |
|
} |
353 |
|
|
354 |
|
if(*temp==']') { |
355 |
|
push_ref(stack_head, in_hash, "["); |
356 |
|
pack(stack_head); |
357 |
|
non_eval_flag--; |
358 |
|
break; |
359 |
|
} |
360 |
|
|
361 |
|
if(*temp=='[') { |
362 |
|
push_ref(stack_head, in_hash, "["); |
363 |
|
non_eval_flag++; |
364 |
|
break; |
365 |
|
} |
366 |
} |
} |
367 |
} while(0); |
} while(0); |
368 |
|
|
380 |
return 1; |
return 1; |
381 |
} |
} |
382 |
|
|
|
/* Make a list. */ |
|
|
extern void pack(stackitem** stack_head) |
|
|
{ |
|
|
void* delimiter; |
|
|
stackitem *iterator, *temp, *pack; |
|
|
|
|
|
if((*stack_head)==NULL) { |
|
|
printerr("Stack empty"); |
|
|
return; |
|
|
} |
|
|
|
|
|
delimiter= (*stack_head)->content.ptr; /* Get delimiter */ |
|
|
toss(stack_head); |
|
|
|
|
|
iterator= *stack_head; |
|
|
|
|
|
/* Search for first delimiter */ |
|
|
while(iterator->next!=NULL && iterator->next->content.ptr!=delimiter) |
|
|
iterator= iterator->next; |
|
|
|
|
|
/* Extract list */ |
|
|
temp= *stack_head; |
|
|
*stack_head= iterator->next; |
|
|
iterator->next= NULL; |
|
|
|
|
|
if(*stack_head!=NULL && (*stack_head)->content.ptr==delimiter) |
|
|
toss(stack_head); |
|
|
|
|
|
/* Push list */ |
|
|
pack= malloc(sizeof(stackitem)); |
|
|
pack->type= list; |
|
|
pack->content.ptr= temp; |
|
|
|
|
|
push(stack_head, pack); |
|
|
} |
|
|
|
|
383 |
/* Relocate elements of the list on the stack. */ |
/* Relocate elements of the list on the stack. */ |
384 |
extern void expand(stackitem** stack_head) |
extern void expand(stackitem** stack_head) |
385 |
{ |
{ |