1 |
/* printf */ |
/* -*- coding: utf-8; -*- */ |
2 |
#include <stdio.h> |
/* |
3 |
/* EXIT_SUCCESS */ |
stack - an interactive interpreter for a stack-based language |
4 |
#include <stdlib.h> |
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn |
|
/* NULL */ |
|
|
#include <stddef.h> |
|
|
/* dlopen, dlsym, dlerror */ |
|
|
#include <dlfcn.h> |
|
|
/* assert */ |
|
|
#include <assert.h> |
|
|
|
|
|
#define HASHTBLSIZE 65536 |
|
|
|
|
|
typedef struct stack_item |
|
|
{ |
|
|
enum { |
|
|
value, /* Integer */ |
|
|
string, |
|
|
ref, /* Reference (to an element in the |
|
|
hash table) */ |
|
|
func, /* Function pointer */ |
|
|
symbol, |
|
|
list |
|
|
} type; /* Type of stack element */ |
|
|
|
|
|
union { |
|
|
void* ptr; /* Pointer to the content */ |
|
|
int val; /* ...or an integer */ |
|
|
} content; /* Stores a pointer or an integer */ |
|
|
|
|
|
char* id; /* Symbol name */ |
|
|
struct stack_item* next; /* Next element */ |
|
|
} stackitem; |
|
|
|
|
|
|
|
|
typedef stackitem* hashtbl[HASHTBLSIZE]; /* Hash table declaration */ |
|
|
typedef void (*funcp)(stackitem**); /* funcp is a pointer to a |
|
|
void function (stackitem **) */ |
|
5 |
|
|
6 |
/* Initialize a newly created hash table. */ |
This program is free software; you can redistribute it and/or modify |
7 |
void init_hashtbl(hashtbl out_hash) |
it under the terms of the GNU General Public License as published by |
8 |
|
the Free Software Foundation; either version 2 of the License, or |
9 |
|
(at your option) any later version. |
10 |
|
|
11 |
|
This program is distributed in the hope that it will be useful, |
12 |
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 |
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 |
|
GNU General Public License for more details. |
15 |
|
|
16 |
|
You should have received a copy of the GNU General Public License |
17 |
|
along with this program; if not, write to the Free Software |
18 |
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
19 |
|
|
20 |
|
Authors: Mats Alritzson <masse@fukt.bth.se> |
21 |
|
Teddy Hogeborn <teddy@fukt.bth.se> |
22 |
|
*/ |
23 |
|
|
24 |
|
#include "stack.h" |
25 |
|
|
26 |
|
const char* start_message= "Stack version $Revision$\n\ |
27 |
|
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn\n\ |
28 |
|
Stack comes with ABSOLUTELY NO WARRANTY; for details type 'warranty;'.\n\ |
29 |
|
This is free software, and you are welcome to redistribute it\n\ |
30 |
|
under certain conditions; type 'copying;' for details."; |
31 |
|
|
32 |
|
|
33 |
|
/* Initialize a newly created environment */ |
34 |
|
void init_env(environment *env) |
35 |
{ |
{ |
36 |
long i; |
int i; |
37 |
|
|
38 |
|
env->gc_limit= 400000; |
39 |
|
env->gc_count= 0; |
40 |
|
env->gc_ref= NULL; |
41 |
|
|
42 |
|
env->head= new_val(env); |
43 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
44 |
out_hash[i]= NULL; |
env->symbols[i]= NULL; |
45 |
|
env->err= 0; |
46 |
|
env->in_string= NULL; |
47 |
|
env->free_string= NULL; |
48 |
|
env->inputstream= stdin; |
49 |
|
env->interactive= 1; |
50 |
|
} |
51 |
|
|
52 |
|
|
53 |
|
void printerr(environment *env) |
54 |
|
{ |
55 |
|
char *in_string; |
56 |
|
|
57 |
|
switch(env->err) { |
58 |
|
case 0: |
59 |
|
return; |
60 |
|
case 1: |
61 |
|
in_string= "Too Few Arguments"; |
62 |
|
break; |
63 |
|
case 2: |
64 |
|
in_string= "Bad Argument Type"; |
65 |
|
break; |
66 |
|
case 3: |
67 |
|
in_string= "Unbound Variable"; |
68 |
|
break; |
69 |
|
case 5: |
70 |
|
return perror(env->errsymb); |
71 |
|
default: |
72 |
|
in_string= "Unknown error"; |
73 |
|
break; |
74 |
|
} |
75 |
|
|
76 |
|
fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string); |
77 |
} |
} |
78 |
|
|
79 |
/* Returns a pointer to an element in the hash table. */ |
|
80 |
stackitem** hash(hashtbl in_hashtbl, const char* in_string) |
/* Returns a pointer to a pointer to an element in the hash table. */ |
81 |
|
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
82 |
{ |
{ |
83 |
long i= 0; |
int i= 0; |
84 |
unsigned long out_hash= 0; |
unsigned int out_hash= 0; |
85 |
char key= '\0'; |
char key= '\0'; |
86 |
stackitem** position; |
symbol **position; |
87 |
|
|
88 |
while(1){ /* Hash in_string */ |
while(1){ /* Hash in_string */ |
89 |
key= in_string[i++]; |
key= in_string[i++]; |
95 |
out_hash= out_hash%HASHTBLSIZE; |
out_hash= out_hash%HASHTBLSIZE; |
96 |
position= &(in_hashtbl[out_hash]); |
position= &(in_hashtbl[out_hash]); |
97 |
|
|
98 |
while(position != NULL){ |
while(1){ |
99 |
if(*position==NULL) /* If empty */ |
if(*position==NULL) /* If empty */ |
100 |
return position; |
return position; |
101 |
|
|
104 |
|
|
105 |
position= &((*position)->next); /* Try next */ |
position= &((*position)->next); /* Try next */ |
106 |
} |
} |
|
return NULL; /* end of list reached without finding |
|
|
an empty position */ |
|
107 |
} |
} |
108 |
|
|
109 |
/* Generic push function. */ |
|
110 |
int push(stackitem** stack_head, stackitem* in_item) |
/* Create new value */ |
111 |
|
value* new_val(environment *env) |
112 |
{ |
{ |
113 |
in_item->next= *stack_head; |
value *nval= malloc(sizeof(value)); |
114 |
*stack_head= in_item; |
stackitem *nitem= malloc(sizeof(stackitem)); |
115 |
return 1; |
|
116 |
|
assert(nval != NULL); |
117 |
|
assert(nitem != NULL); |
118 |
|
|
119 |
|
nval->content.ptr= NULL; |
120 |
|
nval->type= empty; |
121 |
|
|
122 |
|
nitem->item= nval; |
123 |
|
nitem->next= env->gc_ref; |
124 |
|
|
125 |
|
env->gc_ref= nitem; |
126 |
|
|
127 |
|
env->gc_count += sizeof(value); |
128 |
|
nval->gc.flag.mark= 0; |
129 |
|
nval->gc.flag.protect= 0; |
130 |
|
|
131 |
|
return nval; |
132 |
} |
} |
133 |
|
|
134 |
/* Push a value on the stack. */ |
|
135 |
int push_val(stackitem** stack_head, int in_val) |
/* Push a value onto the stack */ |
136 |
|
void push_val(environment *env, value *val) |
137 |
{ |
{ |
138 |
stackitem* new_item= malloc(sizeof(stackitem)); |
value *new_value= new_val(env); |
|
assert(new_item != NULL); |
|
|
new_item->content.val= in_val; |
|
|
new_item->type= value; |
|
139 |
|
|
140 |
push(stack_head, new_item); |
new_value->content.c= malloc(sizeof(pair)); |
141 |
return 1; |
assert(new_value->content.c!=NULL); |
142 |
|
env->gc_count += sizeof(pair); |
143 |
|
new_value->type= tcons; |
144 |
|
CAR(new_value)= val; |
145 |
|
CDR(new_value)= env->head; |
146 |
|
env->head= new_value; |
147 |
} |
} |
148 |
|
|
149 |
/* Copy a string onto the stack. */ |
|
150 |
int push_cstring(stackitem** stack_head, const char* in_string) |
/* Push an integer onto the stack */ |
151 |
|
void push_int(environment *env, int in_val) |
152 |
{ |
{ |
153 |
stackitem* new_item= malloc(sizeof(stackitem)); |
value *new_value= new_val(env); |
154 |
new_item->content.ptr= malloc(strlen(in_string)+1); |
|
155 |
strcpy(new_item->content.ptr, in_string); |
new_value->content.i= in_val; |
156 |
new_item->type= string; |
new_value->type= integer; |
157 |
|
|
158 |
push(stack_head, new_item); |
push_val(env, new_value); |
|
return 1; |
|
159 |
} |
} |
160 |
|
|
161 |
/* Create a new hash entry. */ |
|
162 |
int mk_hashentry(hashtbl in_hashtbl, stackitem* in_item, const char* id) |
/* Push a floating point number onto the stack */ |
163 |
|
void push_float(environment *env, float in_val) |
164 |
{ |
{ |
165 |
in_item->id= malloc(strlen(id)+1); |
value *new_value= new_val(env); |
166 |
|
|
167 |
strcpy(in_item->id, id); |
new_value->content.f= in_val; |
168 |
push(hash(in_hashtbl, id), in_item); |
new_value->type= tfloat; |
169 |
|
|
170 |
return 1; |
push_val(env, new_value); |
171 |
} |
} |
172 |
|
|
173 |
/* Define a new function in the hash table. */ |
|
174 |
void def_func(hashtbl in_hashtbl, funcp in_func, const char* id) |
/* Copy a string onto the stack. */ |
175 |
|
void push_cstring(environment *env, const char *in_string) |
176 |
{ |
{ |
177 |
stackitem* temp= malloc(sizeof(stackitem)); |
value *new_value= new_val(env); |
178 |
|
int length= strlen(in_string)+1; |
179 |
|
|
180 |
temp->type= func; |
new_value->content.string= malloc(length); |
181 |
temp->content.ptr= in_func; |
assert(new_value != NULL); |
182 |
|
env->gc_count += length; |
183 |
|
strcpy(new_value->content.string, in_string); |
184 |
|
new_value->type= string; |
185 |
|
|
186 |
mk_hashentry(in_hashtbl, temp, id); |
push_val(env, new_value); |
187 |
} |
} |
188 |
|
|
|
/* Define a new symbol in the hash table. */ |
|
|
void def_sym(hashtbl in_hashtbl, const char* id) |
|
|
{ |
|
|
stackitem* temp= malloc(sizeof(stackitem)); |
|
|
|
|
|
temp->type= symbol; |
|
|
mk_hashentry(in_hashtbl, temp, id); |
|
|
} |
|
189 |
|
|
190 |
/* Push a reference to an entry in the hash table onto the stack. */ |
/* Mangle a symbol name to a valid C identifier name */ |
191 |
int push_ref(stackitem** stack_head, hashtbl in_hash, const char* in_string) |
char *mangle_str(const char *old_string) |
192 |
{ |
{ |
193 |
static void* handle= NULL; |
char validchars[]= "0123456789abcdef"; |
194 |
void* symbol; |
char *new_string, *current; |
195 |
|
|
196 |
stackitem* new_item= malloc(sizeof(stackitem)); |
new_string= malloc((strlen(old_string)*2)+4); |
197 |
new_item->content.ptr= *hash(in_hash, in_string); |
assert(new_string != NULL); |
198 |
new_item->type= ref; |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
199 |
|
current= new_string+3; |
200 |
|
|
201 |
if(new_item->content.ptr==NULL) { /* If hash entry empty */ |
while(old_string[0] != '\0'){ |
202 |
if(handle==NULL) /* If no handle */ |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
203 |
handle= dlopen(NULL, RTLD_LAZY); |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
204 |
|
current+= 2; |
205 |
symbol= dlsym(handle, in_string); /* Get function pointer */ |
old_string++; |
|
if(dlerror()==NULL) /* If existing function pointer */ |
|
|
def_func(in_hash, symbol, in_string); /* Store function pointer */ |
|
|
else |
|
|
def_sym(in_hash, in_string); /* Make symbol */ |
|
|
|
|
|
new_item->content.ptr= *hash(in_hash, in_string); /* The new reference |
|
|
shouldn't point at |
|
|
NULL */ |
|
|
new_item->type= ref; |
|
206 |
} |
} |
207 |
|
current[0]= '\0'; |
208 |
|
|
209 |
push(stack_head, new_item); |
return new_string; /* The caller must free() it */ |
|
return 1; |
|
210 |
} |
} |
211 |
|
|
|
void printerr(const char* in_string) { |
|
|
fprintf(stderr, "Err: %s\n", in_string); |
|
|
} |
|
212 |
|
|
213 |
/* Discard the top element of the stack. */ |
/* Push a symbol onto the stack. */ |
214 |
extern void toss(stackitem** stack_head) |
void push_sym(environment *env, const char *in_string) |
215 |
{ |
{ |
216 |
stackitem* temp= *stack_head; |
value *new_value; /* A new symbol value */ |
217 |
|
/* ...which might point to... */ |
218 |
|
symbol **new_symbol; /* (if needed) A new actual symbol */ |
219 |
|
/* ...which, if possible, will be bound to... */ |
220 |
|
value *new_fvalue; /* (if needed) A new function value */ |
221 |
|
/* ...which will point to... */ |
222 |
|
void *funcptr; /* A function pointer */ |
223 |
|
|
224 |
if((*stack_head)==NULL) { |
static void *handle= NULL; /* Dynamic linker handle */ |
225 |
printerr("Stack empty"); |
const char *dlerr; /* Dynamic linker error */ |
226 |
return; |
char *mangled; /* Mangled function name */ |
|
} |
|
|
|
|
|
if((*stack_head)->type==string) |
|
|
free((*stack_head)->content.ptr); |
|
227 |
|
|
228 |
*stack_head= (*stack_head)->next; |
new_value= new_val(env); |
229 |
free(temp); |
new_fvalue= new_val(env); |
|
} |
|
230 |
|
|
231 |
/* Print newline. */ |
/* The new value is a symbol */ |
232 |
extern void nl() |
new_value->type= symb; |
|
{ |
|
|
printf("\n"); |
|
|
} |
|
233 |
|
|
234 |
/* Prints the top element of the stack. */ |
/* Look up the symbol name in the hash table */ |
235 |
extern void print_(stackitem** stack_head) |
new_symbol= hash(env->symbols, in_string); |
236 |
{ |
new_value->content.sym= *new_symbol; |
|
stackitem* temp= *stack_head; |
|
237 |
|
|
238 |
if(temp==NULL) { |
if(*new_symbol==NULL) { /* If symbol was undefined */ |
239 |
printerr("Stack empty"); |
|
240 |
return; |
/* Create a new symbol */ |
241 |
|
(*new_symbol)= malloc(sizeof(symbol)); |
242 |
|
assert((*new_symbol) != NULL); |
243 |
|
(*new_symbol)->val= NULL; /* undefined value */ |
244 |
|
(*new_symbol)->next= NULL; |
245 |
|
(*new_symbol)->id= malloc(strlen(in_string)+1); |
246 |
|
assert((*new_symbol)->id != NULL); |
247 |
|
strcpy((*new_symbol)->id, in_string); |
248 |
|
|
249 |
|
/* Intern the new symbol in the hash table */ |
250 |
|
new_value->content.sym= *new_symbol; |
251 |
|
|
252 |
|
/* Try to load the symbol name as an external function, to see if |
253 |
|
we should bind the symbol to a new function pointer value */ |
254 |
|
if(handle==NULL) /* If no handle */ |
255 |
|
handle= dlopen(NULL, RTLD_LAZY); |
256 |
|
|
257 |
|
mangled= mangle_str(in_string); /* mangle the name */ |
258 |
|
funcptr= dlsym(handle, mangled); /* and try to find it */ |
259 |
|
|
260 |
|
dlerr= dlerror(); |
261 |
|
if(dlerr != NULL) { /* If no function was found */ |
262 |
|
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
263 |
|
dlerr= dlerror(); |
264 |
|
} |
265 |
|
|
266 |
|
if(dlerr==NULL) { /* If a function was found */ |
267 |
|
new_fvalue->type= func; /* The new value is a function pointer */ |
268 |
|
new_fvalue->content.func= funcptr; /* Store function pointer */ |
269 |
|
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
270 |
|
function value */ |
271 |
|
} |
272 |
|
|
273 |
|
free(mangled); |
274 |
} |
} |
275 |
|
|
276 |
while(temp->type==ref) |
push_val(env, new_value); |
277 |
temp= temp->content.ptr; |
} |
278 |
|
|
279 |
|
|
280 |
|
/* Print a value */ |
281 |
|
void print_val(environment *env, value *val, int noquote, stackitem *stack, |
282 |
|
FILE *stream) |
283 |
|
{ |
284 |
|
stackitem *titem, *tstack; |
285 |
|
int depth; |
286 |
|
|
287 |
switch(temp->type) { |
switch(val->type) { |
288 |
case value: |
case empty: |
289 |
printf("%d", temp->content.val); |
if(fprintf(stream, "[]") < 0) |
290 |
|
env->err= 5; |
291 |
|
break; |
292 |
|
case unknown: |
293 |
|
if(fprintf(stream, "UNKNOWN") < 0) |
294 |
|
env->err= 5; |
295 |
|
break; |
296 |
|
case integer: |
297 |
|
if(fprintf(stream, "%d", val->content.i) < 0) |
298 |
|
env->err= 5; |
299 |
|
break; |
300 |
|
case tfloat: |
301 |
|
if(fprintf(stream, "%f", val->content.f) < 0) |
302 |
|
env->err= 5; |
303 |
break; |
break; |
304 |
case string: |
case string: |
305 |
printf("\"%s\"", (char*)temp->content.ptr); |
if(noquote){ |
306 |
|
if(fprintf(stream, "%s", val->content.string) < 0) |
307 |
|
env->err= 5; |
308 |
|
} else { /* quote */ |
309 |
|
if(fprintf(stream, "\"%s\"", val->content.string) < 0) |
310 |
|
env->err= 5; |
311 |
|
} |
312 |
break; |
break; |
313 |
case symbol: |
case symb: |
314 |
printf("%s", temp->id); |
if(fprintf(stream, "%s", val->content.sym->id) < 0) |
315 |
|
env->err= 5; |
316 |
break; |
break; |
317 |
default: |
case func: |
318 |
printf("%p", temp->content.ptr); |
if(fprintf(stream, "#<function %p>", val->content.func) < 0) |
319 |
|
env->err= 5; |
320 |
|
break; |
321 |
|
case port: |
322 |
|
if(fprintf(stream, "#<port %p>", val->content.p) < 0) |
323 |
|
env->err= 5; |
324 |
|
break; |
325 |
|
case tcons: |
326 |
|
if(fprintf(stream, "[ ") < 0) { |
327 |
|
env->err= 5; |
328 |
|
return printerr(env); |
329 |
|
} |
330 |
|
tstack= stack; |
331 |
|
|
332 |
|
do { |
333 |
|
titem=malloc(sizeof(stackitem)); |
334 |
|
assert(titem != NULL); |
335 |
|
titem->item=val; |
336 |
|
titem->next=tstack; |
337 |
|
tstack=titem; /* Put it on the stack */ |
338 |
|
/* Search a stack of values being printed to see if we are already |
339 |
|
printing this value */ |
340 |
|
titem=tstack; |
341 |
|
depth=0; |
342 |
|
|
343 |
|
while(titem != NULL && titem->item != CAR(val)){ |
344 |
|
titem=titem->next; |
345 |
|
depth++; |
346 |
|
} |
347 |
|
|
348 |
|
if(titem != NULL){ /* If we found it on the stack, */ |
349 |
|
if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */ |
350 |
|
env->err= 5; |
351 |
|
free(titem); |
352 |
|
return printerr(env); |
353 |
|
} |
354 |
|
} else { |
355 |
|
print_val(env, CAR(val), noquote, tstack, stream); |
356 |
|
} |
357 |
|
|
358 |
|
val= CDR(val); |
359 |
|
switch(val->type){ |
360 |
|
case empty: |
361 |
|
break; |
362 |
|
case tcons: |
363 |
|
/* Search a stack of values being printed to see if we are already |
364 |
|
printing this value */ |
365 |
|
titem=tstack; |
366 |
|
depth=0; |
367 |
|
|
368 |
|
while(titem != NULL && titem->item != val){ |
369 |
|
titem=titem->next; |
370 |
|
depth++; |
371 |
|
} |
372 |
|
if(titem != NULL){ /* If we found it on the stack, */ |
373 |
|
if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */ |
374 |
|
env->err= 5; |
375 |
|
printerr(env); |
376 |
|
goto printval_end; |
377 |
|
} |
378 |
|
} else { |
379 |
|
if(fprintf(stream, " ") < 0){ |
380 |
|
env->err= 5; |
381 |
|
printerr(env); |
382 |
|
goto printval_end; |
383 |
|
} |
384 |
|
} |
385 |
|
break; |
386 |
|
default: |
387 |
|
if(fprintf(stream, " . ") < 0){ /* Improper list */ |
388 |
|
env->err= 5; |
389 |
|
printerr(env); |
390 |
|
goto printval_end; |
391 |
|
} |
392 |
|
print_val(env, val, noquote, tstack, stream); |
393 |
|
} |
394 |
|
} while(val->type == tcons && titem == NULL); |
395 |
|
|
396 |
|
printval_end: |
397 |
|
|
398 |
|
titem=tstack; |
399 |
|
while(titem != stack){ |
400 |
|
tstack=titem->next; |
401 |
|
free(titem); |
402 |
|
titem=tstack; |
403 |
|
} |
404 |
|
|
405 |
|
if(! (env->err)){ |
406 |
|
if(fprintf(stream, " ]") < 0){ |
407 |
|
env->err= 5; |
408 |
|
} |
409 |
|
} |
410 |
break; |
break; |
411 |
} |
} |
412 |
|
|
413 |
|
if(env->err) |
414 |
|
return printerr(env); |
415 |
} |
} |
416 |
|
|
417 |
/* Prints the top element of the stack and then discards it. */ |
|
418 |
extern void print(stackitem** stack_head) |
/* Swap the two top elements on the stack. */ |
419 |
|
extern void swap(environment *env) |
420 |
{ |
{ |
421 |
print_(stack_head); |
value *temp= env->head; |
|
toss(stack_head); |
|
|
} |
|
422 |
|
|
423 |
/* Only to be called by function printstack. */ |
if(check_args(env, 2, unknown, unknown)) |
424 |
void print_st(stackitem* stack_head, long counter) |
return printerr(env); |
425 |
{ |
|
426 |
if(stack_head->next != NULL) |
env->head= CDR(env->head); |
427 |
print_st(stack_head->next, counter+1); |
CDR(temp)= CDR(env->head); |
428 |
|
CDR(env->head)= temp; |
429 |
|
} |
430 |
|
|
|
printf("%ld: ", counter); |
|
|
print_(&stack_head); |
|
|
nl(); |
|
|
} |
|
431 |
|
|
432 |
/* Prints the stack. */ |
/* Recall a value from a symbol, if bound */ |
433 |
extern void printstack(stackitem** stack_head) |
extern void rcl(environment *env) |
434 |
{ |
{ |
435 |
if(*stack_head != NULL) { |
value *val; |
436 |
print_st(*stack_head, 1); |
|
437 |
nl(); |
if(check_args(env, 1, symb)) |
438 |
} else { |
return printerr(env); |
439 |
printerr("Stack empty"); |
|
440 |
|
val= CAR(env->head)->content.sym->val; |
441 |
|
if(val == NULL){ |
442 |
|
env->err= 3; |
443 |
|
return printerr(env); |
444 |
} |
} |
445 |
|
|
446 |
|
push_val(env, val); /* Return the symbol's bound value */ |
447 |
|
swap(env); |
448 |
|
if(env->err) return; |
449 |
|
env->head= CDR(env->head); |
450 |
} |
} |
451 |
|
|
452 |
/* If the top element is a reference, determine if it's a reference to a |
|
453 |
function, and if it is, toss the reference and execute the function. */ |
/* If the top element is a symbol, determine if it's bound to a |
454 |
extern void eval(stackitem** stack_head) |
function value, and if it is, toss the symbol and execute the |
455 |
|
function. */ |
456 |
|
extern void eval(environment *env) |
457 |
{ |
{ |
458 |
funcp in_func; |
funcp in_func; |
459 |
stackitem* temp= *stack_head; |
value* temp_val; |
460 |
|
value* iterator; |
461 |
|
|
462 |
if(temp==NULL) { |
eval_start: |
|
printerr("Stack empty"); |
|
|
return; |
|
|
} |
|
463 |
|
|
464 |
while(temp->type==ref) |
gc_maybe(env); |
|
temp= temp->content.ptr; |
|
465 |
|
|
466 |
if(temp->type==func) { |
if(check_args(env, 1, unknown)) |
467 |
in_func= (funcp)(temp->content.ptr); |
return printerr(env); |
468 |
toss(stack_head); |
|
469 |
(*in_func)(stack_head); |
switch(CAR(env->head)->type) { |
470 |
|
/* if it's a symbol */ |
471 |
|
case symb: |
472 |
|
env->errsymb= CAR(env->head)->content.sym->id; |
473 |
|
rcl(env); /* get its contents */ |
474 |
|
if(env->err) return; |
475 |
|
if(CAR(env->head)->type!=symb){ /* don't recurse symbols */ |
476 |
|
goto eval_start; |
477 |
|
} |
478 |
return; |
return; |
|
} |
|
|
|
|
|
printerr("Couldn't evaluate"); |
|
|
} |
|
479 |
|
|
480 |
/* Make a list. */ |
/* If it's a lone function value, run it */ |
481 |
extern void pack(stackitem** stack_head) |
case func: |
482 |
{ |
in_func= CAR(env->head)->content.func; |
483 |
void* delimiter; |
env->head= CDR(env->head); |
484 |
stackitem *iterator, *temp, *pack; |
return in_func((void*)env); |
485 |
|
|
486 |
|
/* If it's a list */ |
487 |
|
case tcons: |
488 |
|
temp_val= CAR(env->head); |
489 |
|
protect(temp_val); |
490 |
|
|
491 |
|
env->head= CDR(env->head); |
492 |
|
iterator= temp_val; |
493 |
|
|
494 |
|
while(iterator->type != empty) { |
495 |
|
push_val(env, CAR(iterator)); |
496 |
|
|
497 |
|
if(CAR(env->head)->type==symb |
498 |
|
&& CAR(env->head)->content.sym->id[0]==';') { |
499 |
|
env->head= CDR(env->head); |
500 |
|
|
501 |
|
if(CDR(iterator)->type == empty){ |
502 |
|
goto eval_start; |
503 |
|
} |
504 |
|
eval(env); |
505 |
|
if(env->err) return; |
506 |
|
} |
507 |
|
if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons) |
508 |
|
iterator= CDR(iterator); |
509 |
|
else { |
510 |
|
env->err= 2; /* Improper list */ |
511 |
|
return printerr(env); |
512 |
|
} |
513 |
|
} |
514 |
|
unprotect(temp_val); |
515 |
|
return; |
516 |
|
|
517 |
if((*stack_head)==NULL) { |
case empty: |
518 |
printerr("Stack empty"); |
env->head= CDR(env->head); |
519 |
|
case integer: |
520 |
|
case tfloat: |
521 |
|
case string: |
522 |
|
case port: |
523 |
|
case unknown: |
524 |
return; |
return; |
525 |
} |
} |
526 |
|
} |
527 |
|
|
|
delimiter= (*stack_head)->content.ptr; /* Get delimiter */ |
|
|
toss(stack_head); |
|
528 |
|
|
529 |
iterator= *stack_head; |
/* Internal forget function */ |
530 |
|
void forget_sym(symbol **hash_entry) |
531 |
|
{ |
532 |
|
symbol *temp; |
533 |
|
|
534 |
/* Search for first delimiter */ |
temp= *hash_entry; |
535 |
while(iterator->next!=NULL && iterator->next->content.ptr!=delimiter) |
*hash_entry= (*hash_entry)->next; |
|
iterator= iterator->next; |
|
|
|
|
|
/* Extract list */ |
|
|
temp= *stack_head; |
|
|
*stack_head= iterator->next; |
|
|
iterator->next= NULL; |
|
536 |
|
|
537 |
if(*stack_head!=NULL && (*stack_head)->content.ptr==delimiter) |
free(temp->id); |
538 |
toss(stack_head); |
free(temp); |
|
|
|
|
/* Push list */ |
|
|
pack= malloc(sizeof(stackitem)); |
|
|
pack->type= list; |
|
|
pack->content.ptr= temp; |
|
|
|
|
|
push(stack_head, pack); |
|
539 |
} |
} |
540 |
|
|
541 |
/* Parse input. */ |
|
542 |
int stack_read(stackitem** stack_head, hashtbl in_hash, char* in_line) |
int main(int argc, char **argv) |
543 |
{ |
{ |
544 |
char *temp, *rest; |
environment myenv; |
545 |
int itemp; |
int c; /* getopt option character */ |
|
size_t inlength= strlen(in_line)+1; |
|
|
int convert= 0; |
|
|
static int non_eval_flag= 0; |
|
546 |
|
|
547 |
temp= malloc(inlength); |
#ifdef __linux__ |
548 |
rest= malloc(inlength); |
mtrace(); |
549 |
|
#endif |
550 |
|
|
551 |
do { |
init_env(&myenv); |
|
/* If string */ |
|
|
if((convert= sscanf(in_line, "\"%[^\"\n\r]\" %[^\n\r]", temp, rest))) { |
|
|
push_cstring(stack_head, temp); |
|
|
break; |
|
|
} |
|
|
/* If value */ |
|
|
if((convert= sscanf(in_line, "%d %[^\n\r]", &itemp, rest))) { |
|
|
push_val(stack_head, itemp); |
|
|
break; |
|
|
} |
|
|
/* Escape ';' with '\' */ |
|
|
if((convert= sscanf(in_line, "\\%c%[^\n\r]", temp, rest))) { |
|
|
temp[1]= '\0'; |
|
|
push_ref(stack_head, in_hash, temp); |
|
|
break; |
|
|
} |
|
|
/* If symbol */ |
|
|
if((convert= sscanf(in_line, "%[^][ ;\n\r]%[^\n\r]", temp, rest))) { |
|
|
push_ref(stack_head, in_hash, temp); |
|
|
break; |
|
|
} |
|
|
/* If single char */ |
|
|
if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) { |
|
|
if(*temp==';') { |
|
|
if(!non_eval_flag) { |
|
|
eval(stack_head); /* Evaluate top element */ |
|
|
break; |
|
|
} |
|
|
|
|
|
push_ref(stack_head, in_hash, ";"); |
|
|
break; |
|
|
} |
|
552 |
|
|
553 |
if(*temp==']') { |
myenv.interactive = isatty(STDIN_FILENO) && isatty(STDOUT_FILENO); |
|
push_ref(stack_head, in_hash, "["); |
|
|
pack(stack_head); |
|
|
if(non_eval_flag!=0) |
|
|
non_eval_flag--; |
|
|
break; |
|
|
} |
|
554 |
|
|
555 |
if(*temp=='[') { |
while ((c = getopt (argc, argv, "i")) != -1) |
556 |
push_ref(stack_head, in_hash, "["); |
switch (c) |
557 |
non_eval_flag++; |
{ |
558 |
|
case 'i': |
559 |
|
myenv.interactive = 1; |
560 |
break; |
break; |
561 |
|
case '?': |
562 |
|
fprintf (stderr, |
563 |
|
"Unknown option character '\\x%x'.\n", |
564 |
|
optopt); |
565 |
|
return EX_USAGE; |
566 |
|
default: |
567 |
|
abort (); |
568 |
} |
} |
569 |
|
|
570 |
|
if (optind < argc) { |
571 |
|
myenv.interactive = 0; |
572 |
|
myenv.inputstream= fopen(argv[optind], "r"); |
573 |
|
if(myenv.inputstream== NULL) { |
574 |
|
perror(argv[0]); |
575 |
|
exit (EX_NOINPUT); |
576 |
} |
} |
577 |
} while(0); |
} |
|
|
|
578 |
|
|
579 |
free(temp); |
if(myenv.interactive) |
580 |
|
puts(start_message); |
581 |
|
|
582 |
if(convert<2) { |
while(1) { |
583 |
free(rest); |
if(myenv.in_string==NULL) { |
584 |
return 0; |
if (myenv.interactive) { |
585 |
|
if(myenv.err) { |
586 |
|
printf("(error %d)\n", myenv.err); |
587 |
|
myenv.err= 0; |
588 |
|
} |
589 |
|
printf("\n"); |
590 |
|
printstack(&myenv); |
591 |
|
printf("> "); |
592 |
|
} |
593 |
|
myenv.err=0; |
594 |
|
} |
595 |
|
readstream(&myenv, myenv.inputstream); |
596 |
|
if (myenv.err) { /* EOF or other error */ |
597 |
|
myenv.err=0; |
598 |
|
quit(&myenv); |
599 |
|
} else if(myenv.head->type!=empty |
600 |
|
&& CAR(myenv.head)->type==symb |
601 |
|
&& CAR(myenv.head)->content.sym->id[0] == ';') { |
602 |
|
if(myenv.head->type != empty) |
603 |
|
myenv.head= CDR(myenv.head); |
604 |
|
eval(&myenv); |
605 |
|
} else { |
606 |
|
gc_maybe(&myenv); |
607 |
|
} |
608 |
} |
} |
609 |
|
quit(&myenv); |
610 |
stack_read(stack_head, in_hash, rest); |
return EXIT_FAILURE; |
|
|
|
|
free(rest); |
|
|
return 1; |
|
611 |
} |
} |
612 |
|
|
613 |
/* Relocate elements of the list on the stack. */ |
|
614 |
extern void expand(stackitem** stack_head) |
/* Return copy of a value */ |
615 |
|
value *copy_val(environment *env, value *old_value) |
616 |
{ |
{ |
617 |
stackitem *temp, *new_head; |
value *new_value; |
618 |
|
|
619 |
/* Is top element a list? */ |
if(old_value==NULL) |
620 |
if((*stack_head)==NULL || (*stack_head)->type!=list) { |
return NULL; |
621 |
printerr("Stack empty or not a list"); |
|
622 |
return; |
new_value= new_val(env); |
623 |
|
new_value->type= old_value->type; |
624 |
|
|
625 |
|
switch(old_value->type){ |
626 |
|
case tfloat: |
627 |
|
case integer: |
628 |
|
case func: |
629 |
|
case symb: |
630 |
|
case empty: |
631 |
|
case unknown: |
632 |
|
case port: |
633 |
|
new_value->content= old_value->content; |
634 |
|
break; |
635 |
|
case string: |
636 |
|
new_value->content.string= strdup(old_value->content.string); |
637 |
|
break; |
638 |
|
case tcons: |
639 |
|
|
640 |
|
new_value->content.c= malloc(sizeof(pair)); |
641 |
|
assert(new_value->content.c!=NULL); |
642 |
|
env->gc_count += sizeof(pair); |
643 |
|
|
644 |
|
CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */ |
645 |
|
CDR(new_value)= copy_val(env, CDR(old_value)); /* recurse */ |
646 |
|
break; |
647 |
} |
} |
648 |
|
|
649 |
/* The first list element is the new stack head */ |
return new_value; |
|
new_head= temp= (*stack_head)->content.ptr; |
|
|
toss(stack_head); |
|
|
|
|
|
/* Search the end of the list */ |
|
|
while(temp->next!=NULL) |
|
|
temp= temp->next; |
|
|
|
|
|
/* Connect the the tail of the list with the old stack head */ |
|
|
temp->next= *stack_head; |
|
|
*stack_head= new_head; /* ...and voila! */ |
|
650 |
} |
} |
651 |
|
|
652 |
/* Swap the two top elements on the stack. */ |
|
653 |
extern void swap(stackitem** stack_head) |
/* read a line from a stream; used by readline */ |
654 |
|
void readlinestream(environment *env, FILE *stream) |
655 |
{ |
{ |
656 |
stackitem* temp= (*stack_head); |
char in_string[101]; |
|
|
|
|
if((*stack_head)==NULL) { |
|
|
printerr("Stack empty"); |
|
|
return; |
|
|
} |
|
657 |
|
|
658 |
if((*stack_head)->next==NULL) |
if(fgets(in_string, 100, stream)==NULL) { |
659 |
return; |
push_cstring(env, ""); |
660 |
|
if (! feof(stream)){ |
661 |
|
env->err= 5; |
662 |
|
return printerr(env); |
663 |
|
} |
664 |
|
} else { |
665 |
|
push_cstring(env, in_string); |
666 |
|
} |
667 |
|
} |
668 |
|
|
|
*stack_head= (*stack_head)->next; |
|
|
temp->next= (*stack_head)->next; |
|
|
(*stack_head)->next= temp; |
|
|
} |
|
669 |
|
|
670 |
/* Compares two elements by reference. */ |
/* Reverse (flip) a list */ |
671 |
extern void eq(stackitem** stack_head) |
extern void rev(environment *env) |
672 |
{ |
{ |
673 |
void *left, *right; |
value *old_head, *new_head, *item; |
|
int result; |
|
674 |
|
|
675 |
if((*stack_head)==NULL || (*stack_head)->next==NULL) { |
if(CAR(env->head)->type==empty) |
676 |
printerr("Not enough elements to compare"); |
return; /* Don't reverse an empty list */ |
|
return; |
|
|
} |
|
677 |
|
|
678 |
left= (*stack_head)->content.ptr; |
if(check_args(env, 1, tcons)) |
679 |
swap(stack_head); |
return printerr(env); |
680 |
right= (*stack_head)->content.ptr; |
|
681 |
result= (left==right); |
old_head= CAR(env->head); |
682 |
|
new_head= new_val(env); |
683 |
toss(stack_head); toss(stack_head); |
while(old_head->type != empty) { |
684 |
push_val(stack_head, (left==right)); |
item= old_head; |
685 |
|
old_head= CDR(old_head); |
686 |
|
CDR(item)= new_head; |
687 |
|
new_head= item; |
688 |
|
} |
689 |
|
CAR(env->head)= new_head; |
690 |
} |
} |
691 |
|
|
692 |
/* Negates the top element on the stack. */ |
|
693 |
extern void not(stackitem** stack_head) |
/* Make a list. */ |
694 |
|
extern void pack(environment *env) |
695 |
{ |
{ |
696 |
int value; |
value *iterator, *temp, *ending; |
697 |
|
|
698 |
if((*stack_head)==NULL || (*stack_head)->type!=value) { |
ending=new_val(env); |
699 |
printerr("Stack empty or element is not a value"); |
|
700 |
return; |
iterator= env->head; |
701 |
|
if(iterator->type == empty |
702 |
|
|| (CAR(iterator)->type==symb |
703 |
|
&& CAR(iterator)->content.sym->id[0]=='[')) { |
704 |
|
temp= ending; |
705 |
|
if(env->head->type != empty) |
706 |
|
env->head= CDR(env->head); |
707 |
|
} else { |
708 |
|
/* Search for first delimiter */ |
709 |
|
while(CDR(iterator)->type != empty |
710 |
|
&& (CAR(CDR(iterator))->type!=symb |
711 |
|
|| CAR(CDR(iterator))->content.sym->id[0]!='[')) |
712 |
|
iterator= CDR(iterator); |
713 |
|
|
714 |
|
/* Extract list */ |
715 |
|
temp= env->head; |
716 |
|
env->head= CDR(iterator); |
717 |
|
CDR(iterator)= ending; |
718 |
|
|
719 |
|
if(env->head->type != empty) |
720 |
|
env->head= CDR(env->head); |
721 |
} |
} |
722 |
|
|
723 |
value= (*stack_head)->content.val; |
/* Push list */ |
|
toss(stack_head); |
|
|
push_val(stack_head, !value); |
|
|
} |
|
724 |
|
|
725 |
/* Compares the two top elements on the stack and return 0 if they're the |
push_val(env, temp); |
726 |
same. */ |
rev(env); |
|
extern void neq(stackitem** stack_head) |
|
|
{ |
|
|
eq(stack_head); |
|
|
not(stack_head); |
|
727 |
} |
} |
728 |
|
|
729 |
/* Give a symbol some content. */ |
|
730 |
extern void def(stackitem** stack_head) |
/* read from a stream; used by "read" and "readport" */ |
731 |
|
void readstream(environment *env, FILE *stream) |
732 |
{ |
{ |
733 |
stackitem *temp, *value; |
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n"; |
734 |
|
const char strform[]= "\"%[^\"]\"%n"; |
735 |
|
const char intform[]= "%i%n"; |
736 |
|
const char fltform[]= "%f%n"; |
737 |
|
const char blankform[]= "%*[ \t]%n"; |
738 |
|
const char ebrackform[]= "]%n"; |
739 |
|
const char semicform[]= ";%n"; |
740 |
|
const char bbrackform[]= "[%n"; |
741 |
|
|
742 |
|
int itemp, readlength= -1; |
743 |
|
int count= -1; |
744 |
|
float ftemp; |
745 |
|
static int depth= 0; |
746 |
|
char *match; |
747 |
|
size_t inlength; |
748 |
|
|
749 |
|
if(env->in_string==NULL) { |
750 |
|
if(depth > 0 && env->interactive) { |
751 |
|
printf("]> "); |
752 |
|
} |
753 |
|
readlinestream(env, env->inputstream); |
754 |
|
if(env->err) return; |
755 |
|
|
756 |
if(*stack_head==NULL || (*stack_head)->next==NULL |
if((CAR(env->head)->content.string)[0]=='\0'){ |
757 |
|| (*stack_head)->type!=ref) { |
env->err= 4; /* "" means EOF */ |
758 |
printerr("Define what?"); |
return; |
759 |
return; |
} |
760 |
|
|
761 |
|
env->in_string= malloc(strlen(CAR(env->head)->content.string)+1); |
762 |
|
assert(env->in_string != NULL); |
763 |
|
env->free_string= env->in_string; /* Save the original pointer */ |
764 |
|
strcpy(env->in_string, CAR(env->head)->content.string); |
765 |
|
env->head= CDR(env->head); |
766 |
|
} |
767 |
|
|
768 |
|
inlength= strlen(env->in_string)+1; |
769 |
|
match= malloc(inlength); |
770 |
|
assert(match != NULL); |
771 |
|
|
772 |
|
if(sscanf(env->in_string, blankform, &readlength) != EOF |
773 |
|
&& readlength != -1) { |
774 |
|
; |
775 |
|
} else if(sscanf(env->in_string, fltform, &ftemp, &readlength) != EOF |
776 |
|
&& readlength != -1) { |
777 |
|
if(sscanf(env->in_string, intform, &itemp, &count) != EOF |
778 |
|
&& count==readlength) { |
779 |
|
push_int(env, itemp); |
780 |
|
} else { |
781 |
|
push_float(env, ftemp); |
782 |
|
} |
783 |
|
} else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF |
784 |
|
&& readlength != -1) { |
785 |
|
push_cstring(env, ""); |
786 |
|
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
787 |
|
&& readlength != -1) { |
788 |
|
push_cstring(env, match); |
789 |
|
} else if(sscanf(env->in_string, symbform, match, &readlength) != EOF |
790 |
|
&& readlength != -1) { |
791 |
|
push_sym(env, match); |
792 |
|
} else if(sscanf(env->in_string, ebrackform, &readlength) != EOF |
793 |
|
&& readlength != -1) { |
794 |
|
pack(env); if(env->err) return; |
795 |
|
if(depth != 0) depth--; |
796 |
|
} else if(sscanf(env->in_string, semicform, &readlength) != EOF |
797 |
|
&& readlength != -1) { |
798 |
|
push_sym(env, ";"); |
799 |
|
} else if(sscanf(env->in_string, bbrackform, &readlength) != EOF |
800 |
|
&& readlength != -1) { |
801 |
|
push_sym(env, "["); |
802 |
|
depth++; |
803 |
|
} else { |
804 |
|
free(env->free_string); |
805 |
|
env->in_string = env->free_string = NULL; |
806 |
|
} |
807 |
|
if (env->in_string != NULL) { |
808 |
|
env->in_string += readlength; |
809 |
} |
} |
810 |
|
|
811 |
temp= (*stack_head)->content.ptr; |
free(match); |
|
value= (*stack_head)->next; |
|
|
temp->content= value->content; |
|
|
value->content.ptr=NULL; |
|
|
temp->type= value->type; |
|
|
|
|
|
toss(stack_head); toss(stack_head); |
|
|
} |
|
812 |
|
|
813 |
/* Quit stack. */ |
if(depth) |
814 |
extern void quit() |
return readstream(env, env->inputstream); |
|
{ |
|
|
exit(EXIT_SUCCESS); |
|
815 |
} |
} |
816 |
|
|
817 |
int main() |
|
818 |
|
int check_args(environment *env, int num_args, ...) |
819 |
{ |
{ |
820 |
stackitem* s= NULL; |
va_list ap; |
821 |
hashtbl myhash; |
enum type_enum mytype; |
822 |
char in_string[100]; |
int i; |
823 |
|
|
824 |
|
value *iter= env->head; |
825 |
|
int errval= 0; |
826 |
|
|
827 |
|
va_start(ap, num_args); |
828 |
|
for(i=1; i<=num_args; i++) { |
829 |
|
mytype= va_arg(ap, enum type_enum); |
830 |
|
// fprintf(stderr, "%s\n", env->errsymb); |
831 |
|
|
832 |
init_hashtbl(myhash); |
if(iter->type==empty || iter==NULL) { |
833 |
|
errval= 1; |
834 |
|
break; |
835 |
|
} |
836 |
|
|
837 |
printf("okidok\n "); |
if(mytype!=unknown && CAR(iter)->type!=mytype) { |
838 |
|
errval= 2; |
839 |
|
break; |
840 |
|
} |
841 |
|
|
842 |
while(fgets(in_string, 100, stdin) != NULL) { |
iter= CDR(iter); |
|
stack_read(&s, myhash, in_string); |
|
|
printf("okidok\n "); |
|
843 |
} |
} |
844 |
|
|
845 |
exit(EXIT_SUCCESS); |
va_end(ap); |
|
} |
|
846 |
|
|
847 |
/* Local Variables: */ |
env->err= errval; |
848 |
/* compile-command:"make CFLAGS=\"-Wall -g -rdynamic -ldl\" stack" */ |
return errval; |
849 |
/* End: */ |
} |