1 |
|
/* -*- coding: utf-8; -*- */ |
2 |
/* |
/* |
3 |
stack - an interactive interpreter for a stack-based language |
stack - an interactive interpreter for a stack-based language |
4 |
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn |
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn |
21 |
Teddy Hogeborn <teddy@fukt.bth.se> |
Teddy Hogeborn <teddy@fukt.bth.se> |
22 |
*/ |
*/ |
23 |
|
|
|
/* printf, sscanf, fgets, fprintf, fopen, perror */ |
|
|
#include <stdio.h> |
|
|
/* exit, EXIT_SUCCESS, malloc, free */ |
|
|
#include <stdlib.h> |
|
|
/* NULL */ |
|
|
#include <stddef.h> |
|
|
/* dlopen, dlsym, dlerror */ |
|
|
#include <dlfcn.h> |
|
|
/* strcmp, strcpy, strlen, strcat, strdup */ |
|
|
#include <string.h> |
|
|
/* getopt, STDIN_FILENO, STDOUT_FILENO, usleep */ |
|
|
#include <unistd.h> |
|
|
/* EX_NOINPUT, EX_USAGE */ |
|
|
#include <sysexits.h> |
|
|
/* mtrace, muntrace */ |
|
|
#include <mcheck.h> |
|
|
/* ioctl */ |
|
|
#include <sys/ioctl.h> |
|
|
/* KDMKTONE */ |
|
|
#include <linux/kd.h> |
|
|
|
|
24 |
#include "stack.h" |
#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.\n"; |
31 |
|
|
32 |
|
|
33 |
/* Initialize a newly created environment */ |
/* Initialize a newly created environment */ |
34 |
void init_env(environment *env) |
void init_env(environment *env) |
35 |
{ |
{ |
36 |
int i; |
int i; |
37 |
|
|
38 |
env->gc_limit= 20; |
env->gc_limit= 400000; |
39 |
env->gc_count= 0; |
env->gc_count= 0; |
40 |
env->gc_ref= NULL; |
env->gc_ref= NULL; |
|
env->gc_protect= NULL; |
|
41 |
|
|
42 |
env->head= NULL; |
env->head= new_val(env); |
43 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
44 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
45 |
env->err= 0; |
env->err= 0; |
49 |
env->interactive= 1; |
env->interactive= 1; |
50 |
} |
} |
51 |
|
|
|
void printerr(const char* in_string) { |
|
|
fprintf(stderr, "Err: %s\n", in_string); |
|
|
} |
|
52 |
|
|
53 |
/* Discard the top element of the stack. */ |
void printerr(environment *env, const char* in_string) |
|
extern void toss(environment *env) |
|
54 |
{ |
{ |
55 |
stackitem *temp= env->head; |
fprintf(stderr, "\"%s\":\nErr: %s\n", env->errsymb, in_string); |
|
|
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
env->head= env->head->next; /* Remove the top stack item */ |
|
|
free(temp); /* Free the old top stack item */ |
|
|
|
|
|
gc_init(env); |
|
56 |
} |
} |
57 |
|
|
58 |
|
|
59 |
/* 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. */ |
60 |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
symbol **hash(hashtbl in_hashtbl, const char *in_string) |
61 |
{ |
{ |
85 |
} |
} |
86 |
} |
} |
87 |
|
|
88 |
value* new_val(environment *env) { |
|
89 |
|
/* Create new value */ |
90 |
|
value* new_val(environment *env) |
91 |
|
{ |
92 |
value *nval= malloc(sizeof(value)); |
value *nval= malloc(sizeof(value)); |
93 |
stackitem *nitem= malloc(sizeof(stackitem)); |
stackitem *nitem= malloc(sizeof(stackitem)); |
94 |
|
|
95 |
nval->content.ptr= NULL; |
assert(nval != NULL); |
96 |
protect(env, nval); |
assert(nitem != NULL); |
97 |
|
|
98 |
gc_init(env); |
nval->content.ptr= NULL; |
99 |
|
nval->type= empty; |
100 |
|
|
101 |
nitem->item= nval; |
nitem->item= nval; |
102 |
nitem->next= env->gc_ref; |
nitem->next= env->gc_ref; |
103 |
|
|
104 |
env->gc_ref= nitem; |
env->gc_ref= nitem; |
105 |
|
|
106 |
env->gc_count++; |
env->gc_count += sizeof(value); |
107 |
unprotect(env); |
nval->gc.flag.mark= 0; |
108 |
|
nval->gc.flag.protect= 0; |
109 |
|
|
110 |
return nval; |
return nval; |
111 |
} |
} |
112 |
|
|
|
void gc_mark(value *val) { |
|
|
stackitem *iterator; |
|
113 |
|
|
114 |
if(val==NULL || val->gc_garb==0) |
/* Mark values recursively. |
115 |
|
Marked values are not collected by the GC. */ |
116 |
|
inline void gc_mark(value *val) |
117 |
|
{ |
118 |
|
if(val==NULL || val->gc.flag.mark) |
119 |
return; |
return; |
120 |
|
|
121 |
val->gc_garb= 0; |
val->gc.flag.mark= 1; |
122 |
|
|
123 |
if(val->type==list) { |
if(val->type==tcons) { |
124 |
iterator= val->content.ptr; |
gc_mark(CAR(val)); |
125 |
|
gc_mark(CDR(val)); |
|
while(iterator!=NULL) { |
|
|
gc_mark(iterator->item); |
|
|
iterator= iterator->next; |
|
|
} |
|
126 |
} |
} |
127 |
} |
} |
128 |
|
|
129 |
extern void gc_init(environment *env) { |
|
130 |
stackitem *new_head= NULL, *titem, *iterator= env->gc_ref; |
/* Start GC */ |
131 |
|
extern void gc_init(environment *env) |
132 |
|
{ |
133 |
|
stackitem *new_head= NULL, *titem; |
134 |
symbol *tsymb; |
symbol *tsymb; |
135 |
int i; |
int i; |
136 |
|
|
137 |
if(env->gc_count < env->gc_limit) |
if(env->interactive) |
138 |
return; |
printf("Garbage collecting."); |
139 |
|
|
140 |
while(iterator!=NULL) { |
/* Mark values on stack */ |
141 |
iterator->item->gc_garb= 1; |
gc_mark(env->head); |
|
iterator= iterator->next; |
|
|
} |
|
142 |
|
|
143 |
/* Mark */ |
if(env->interactive) |
144 |
iterator= env->gc_protect; |
printf("."); |
|
while(iterator!=NULL) { |
|
|
gc_mark(iterator->item); |
|
|
iterator= iterator->next; |
|
|
} |
|
145 |
|
|
146 |
iterator= env->head; |
/* Mark values in hashtable */ |
147 |
while(iterator!=NULL) { |
for(i= 0; i<HASHTBLSIZE; i++) |
148 |
gc_mark(iterator->item); |
for(tsymb= env->symbols[i]; tsymb!=NULL; tsymb= tsymb->next) |
149 |
iterator= iterator->next; |
if (tsymb->val != NULL) |
150 |
} |
gc_mark(tsymb->val); |
151 |
|
|
152 |
for(i= 0; i<HASHTBLSIZE; i++) { |
if(env->interactive) |
153 |
tsymb= env->symbols[i]; |
printf("."); |
|
while(tsymb!=NULL) { |
|
|
gc_mark(tsymb->val); |
|
|
tsymb= tsymb->next; |
|
|
} |
|
|
} |
|
154 |
|
|
155 |
env->gc_count= 0; |
env->gc_count= 0; |
156 |
|
|
157 |
/* Sweep */ |
while(env->gc_ref!=NULL) { /* Sweep unused values */ |
158 |
while(env->gc_ref!=NULL) { |
if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */ |
159 |
|
|
160 |
if(env->gc_ref->item->gc_garb) { |
/* Remove content */ |
161 |
switch(env->gc_ref->item->type) { |
switch(env->gc_ref->item->type){ |
162 |
case string: |
case string: |
163 |
free(env->gc_ref->item->content.ptr); |
free(env->gc_ref->item->content.string); |
164 |
break; |
break; |
165 |
case integer: |
case tcons: |
166 |
break; |
free(env->gc_ref->item->content.c); |
|
case list: |
|
|
while(env->gc_ref->item->content.ptr!=NULL) { |
|
|
titem= env->gc_ref->item->content.ptr; |
|
|
env->gc_ref->item->content.ptr= titem->next; |
|
|
free(titem); |
|
|
} |
|
167 |
break; |
break; |
168 |
default: |
case port: |
169 |
|
case empty: |
170 |
|
case unknown: |
171 |
|
case integer: |
172 |
|
case tfloat: |
173 |
|
case func: |
174 |
|
case symb: |
175 |
|
/* Symbol strings are freed when walking the hash table */ |
176 |
break; |
break; |
177 |
} |
} |
178 |
free(env->gc_ref->item); |
|
179 |
titem= env->gc_ref->next; |
free(env->gc_ref->item); /* Remove from gc_ref */ |
|
free(env->gc_ref); |
|
|
env->gc_ref= titem; |
|
|
} else { |
|
180 |
titem= env->gc_ref->next; |
titem= env->gc_ref->next; |
181 |
env->gc_ref->next= new_head; |
free(env->gc_ref); /* Remove value */ |
|
new_head= env->gc_ref; |
|
182 |
env->gc_ref= titem; |
env->gc_ref= titem; |
183 |
env->gc_count++; |
continue; |
184 |
|
} |
185 |
|
|
186 |
|
#ifdef DEBUG |
187 |
|
printf("Kept value (%p)", env->gc_ref->item); |
188 |
|
if(env->gc_ref->item->gc.flag.mark) |
189 |
|
printf(" (marked)"); |
190 |
|
if(env->gc_ref->item->gc.flag.protect) |
191 |
|
printf(" (protected)"); |
192 |
|
switch(env->gc_ref->item->type){ |
193 |
|
case integer: |
194 |
|
printf(" integer: %d", env->gc_ref->item->content.i); |
195 |
|
break; |
196 |
|
case func: |
197 |
|
printf(" func: %p", env->gc_ref->item->content.func); |
198 |
|
break; |
199 |
|
case symb: |
200 |
|
printf(" symb: %s", env->gc_ref->item->content.sym->id); |
201 |
|
break; |
202 |
|
case tcons: |
203 |
|
printf(" tcons: %p\t%p", CAR(env->gc_ref->item), |
204 |
|
CDR(env->gc_ref->item)); |
205 |
|
break; |
206 |
|
default: |
207 |
|
printf(" <unknown %d>", (env->gc_ref->item->type)); |
208 |
} |
} |
209 |
|
printf("\n"); |
210 |
|
#endif /* DEBUG */ |
211 |
|
|
212 |
|
/* Keep values */ |
213 |
|
env->gc_count += sizeof(value); |
214 |
|
if(env->gc_ref->item->type==string) |
215 |
|
env->gc_count += strlen(env->gc_ref->item->content.string)+1; |
216 |
|
|
217 |
|
titem= env->gc_ref->next; |
218 |
|
env->gc_ref->next= new_head; |
219 |
|
new_head= env->gc_ref; |
220 |
|
new_head->item->gc.flag.mark= 0; |
221 |
|
env->gc_ref= titem; |
222 |
} |
} |
223 |
|
|
224 |
env->gc_limit= env->gc_count*2; |
if (env->gc_limit < env->gc_count*2) |
225 |
|
env->gc_limit= env->gc_count*2; |
226 |
|
|
227 |
env->gc_ref= new_head; |
env->gc_ref= new_head; |
228 |
|
|
229 |
|
if(env->interactive) |
230 |
|
printf("done (%d bytes still allocated)\n", env->gc_count); |
231 |
|
|
232 |
} |
} |
233 |
|
|
234 |
void protect(environment *env, value *val) |
|
235 |
|
inline void gc_maybe(environment *env) |
236 |
{ |
{ |
237 |
stackitem *new_item= malloc(sizeof(stackitem)); |
if(env->gc_count < env->gc_limit) |
238 |
new_item->item= val; |
return; |
239 |
new_item->next= env->gc_protect; |
else |
240 |
env->gc_protect= new_item; |
return gc_init(env); |
241 |
} |
} |
242 |
|
|
243 |
void unprotect(environment *env) |
|
244 |
|
/* Protect values from GC */ |
245 |
|
void protect(value *val) |
246 |
{ |
{ |
247 |
stackitem *temp= env->gc_protect; |
if(val==NULL || val->gc.flag.protect) |
248 |
env->gc_protect= env->gc_protect->next; |
return; |
249 |
free(temp); |
|
250 |
|
val->gc.flag.protect= 1; |
251 |
|
|
252 |
|
if(val->type==tcons) { |
253 |
|
protect(CAR(val)); |
254 |
|
protect(CDR(val)); |
255 |
|
} |
256 |
} |
} |
257 |
|
|
258 |
|
|
259 |
|
/* Unprotect values from GC */ |
260 |
|
void unprotect(value *val) |
261 |
|
{ |
262 |
|
if(val==NULL || !(val->gc.flag.protect)) |
263 |
|
return; |
264 |
|
|
265 |
|
val->gc.flag.protect= 0; |
266 |
|
|
267 |
|
if(val->type==tcons) { |
268 |
|
unprotect(CAR(val)); |
269 |
|
unprotect(CDR(val)); |
270 |
|
} |
271 |
|
} |
272 |
|
|
273 |
|
|
274 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
275 |
void push_val(environment *env, value *val) |
void push_val(environment *env, value *val) |
276 |
{ |
{ |
277 |
stackitem *new_item= malloc(sizeof(stackitem)); |
value *new_value= new_val(env); |
278 |
new_item->item= val; |
|
279 |
new_item->next= env->head; |
new_value->content.c= malloc(sizeof(pair)); |
280 |
env->head= new_item; |
assert(new_value->content.c!=NULL); |
281 |
|
env->gc_count += sizeof(pair); |
282 |
|
new_value->type= tcons; |
283 |
|
CAR(new_value)= val; |
284 |
|
CDR(new_value)= env->head; |
285 |
|
env->head= new_value; |
286 |
} |
} |
287 |
|
|
288 |
/* Push an integer onto the stack. */ |
|
289 |
|
/* Push an integer onto the stack */ |
290 |
void push_int(environment *env, int in_val) |
void push_int(environment *env, int in_val) |
291 |
{ |
{ |
292 |
value *new_value= new_val(env); |
value *new_value= new_val(env); |
293 |
|
|
294 |
new_value->content.val= in_val; |
new_value->content.i= in_val; |
295 |
new_value->type= integer; |
new_value->type= integer; |
296 |
|
|
297 |
push_val(env, new_value); |
push_val(env, new_value); |
298 |
} |
} |
299 |
|
|
300 |
|
|
301 |
|
/* Push a floating point number onto the stack */ |
302 |
|
void push_float(environment *env, float in_val) |
303 |
|
{ |
304 |
|
value *new_value= new_val(env); |
305 |
|
|
306 |
|
new_value->content.f= in_val; |
307 |
|
new_value->type= tfloat; |
308 |
|
|
309 |
|
push_val(env, new_value); |
310 |
|
} |
311 |
|
|
312 |
|
|
313 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
314 |
void push_cstring(environment *env, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
315 |
{ |
{ |
316 |
value *new_value= new_val(env); |
value *new_value= new_val(env); |
317 |
|
int length= strlen(in_string)+1; |
318 |
|
|
319 |
new_value->content.ptr= malloc(strlen(in_string)+1); |
new_value->content.string= malloc(length); |
320 |
strcpy(new_value->content.ptr, in_string); |
assert(new_value != NULL); |
321 |
|
env->gc_count += length; |
322 |
|
strcpy(new_value->content.string, in_string); |
323 |
new_value->type= string; |
new_value->type= string; |
324 |
|
|
325 |
push_val(env, new_value); |
push_val(env, new_value); |
326 |
} |
} |
327 |
|
|
328 |
|
|
329 |
/* Mangle a symbol name to a valid C identifier name */ |
/* Mangle a symbol name to a valid C identifier name */ |
330 |
char *mangle_str(const char *old_string){ |
char *mangle_str(const char *old_string) |
331 |
|
{ |
332 |
char validchars[]= "0123456789abcdef"; |
char validchars[]= "0123456789abcdef"; |
333 |
char *new_string, *current; |
char *new_string, *current; |
334 |
|
|
335 |
new_string= malloc((strlen(old_string)*2)+4); |
new_string= malloc((strlen(old_string)*2)+4); |
336 |
|
assert(new_string != NULL); |
337 |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
338 |
current= new_string+3; |
current= new_string+3; |
339 |
|
|
340 |
while(old_string[0] != '\0'){ |
while(old_string[0] != '\0'){ |
341 |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
current[0]= validchars[(unsigned char)(old_string[0])/16]; |
342 |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
current[1]= validchars[(unsigned char)(old_string[0])%16]; |
348 |
return new_string; /* The caller must free() it */ |
return new_string; /* The caller must free() it */ |
349 |
} |
} |
350 |
|
|
|
extern void mangle(environment *env){ |
|
|
char *new_string; |
|
|
|
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=string) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
|
|
|
|
new_string= mangle_str((const char *)(env->head->item->content.ptr)); |
|
|
|
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
|
|
|
push_cstring(env, new_string); |
|
|
} |
|
351 |
|
|
352 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
353 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
365 |
char *mangled; /* Mangled function name */ |
char *mangled; /* Mangled function name */ |
366 |
|
|
367 |
new_value= new_val(env); |
new_value= new_val(env); |
368 |
|
new_fvalue= new_val(env); |
369 |
|
|
370 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
371 |
new_value->type= symb; |
new_value->type= symb; |
372 |
|
|
373 |
/* Look up the symbol name in the hash table */ |
/* Look up the symbol name in the hash table */ |
374 |
new_symbol= hash(env->symbols, in_string); |
new_symbol= hash(env->symbols, in_string); |
375 |
new_value->content.ptr= *new_symbol; |
new_value->content.sym= *new_symbol; |
376 |
|
|
377 |
if(*new_symbol==NULL) { /* If symbol was undefined */ |
if(*new_symbol==NULL) { /* If symbol was undefined */ |
378 |
|
|
379 |
/* Create a new symbol */ |
/* Create a new symbol */ |
380 |
(*new_symbol)= malloc(sizeof(symbol)); |
(*new_symbol)= malloc(sizeof(symbol)); |
381 |
|
assert((*new_symbol) != NULL); |
382 |
(*new_symbol)->val= NULL; /* undefined value */ |
(*new_symbol)->val= NULL; /* undefined value */ |
383 |
(*new_symbol)->next= NULL; |
(*new_symbol)->next= NULL; |
384 |
(*new_symbol)->id= malloc(strlen(in_string)+1); |
(*new_symbol)->id= malloc(strlen(in_string)+1); |
385 |
|
assert((*new_symbol)->id != NULL); |
386 |
strcpy((*new_symbol)->id, in_string); |
strcpy((*new_symbol)->id, in_string); |
387 |
|
|
388 |
/* Intern the new symbol in the hash table */ |
/* Intern the new symbol in the hash table */ |
389 |
new_value->content.ptr= *new_symbol; |
new_value->content.sym= *new_symbol; |
390 |
|
|
391 |
/* Try to load the symbol name as an external function, to see if |
/* Try to load the symbol name as an external function, to see if |
392 |
we should bind the symbol to a new function pointer value */ |
we should bind the symbol to a new function pointer value */ |
395 |
|
|
396 |
mangled= mangle_str(in_string); /* mangle the name */ |
mangled= mangle_str(in_string); /* mangle the name */ |
397 |
funcptr= dlsym(handle, mangled); /* and try to find it */ |
funcptr= dlsym(handle, mangled); /* and try to find it */ |
398 |
free(mangled); |
|
399 |
dlerr= dlerror(); |
dlerr= dlerror(); |
400 |
if(dlerr != NULL) { /* If no function was found */ |
if(dlerr != NULL) { /* If no function was found */ |
401 |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
funcptr= dlsym(handle, in_string); /* Get function pointer */ |
402 |
dlerr= dlerror(); |
dlerr= dlerror(); |
403 |
} |
} |
404 |
|
|
405 |
if(dlerr==NULL) { /* If a function was found */ |
if(dlerr==NULL) { /* If a function was found */ |
|
new_fvalue= new_val(env); /* Create a new value */ |
|
406 |
new_fvalue->type= func; /* The new value is a function pointer */ |
new_fvalue->type= func; /* The new value is a function pointer */ |
407 |
new_fvalue->content.ptr= funcptr; /* Store function pointer */ |
new_fvalue->content.func= funcptr; /* Store function pointer */ |
408 |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
(*new_symbol)->val= new_fvalue; /* Bind the symbol to the new |
409 |
function value */ |
function value */ |
410 |
} |
} |
411 |
|
|
412 |
|
free(mangled); |
413 |
} |
} |
|
push_val(env, new_value); |
|
|
} |
|
414 |
|
|
415 |
/* Print newline. */ |
push_val(env, new_value); |
|
extern void nl() |
|
|
{ |
|
|
printf("\n"); |
|
416 |
} |
} |
417 |
|
|
|
/* Gets the type of a value */ |
|
|
extern void type(environment *env){ |
|
|
int typenum; |
|
418 |
|
|
419 |
if((env->head)==NULL) { |
/* Print a value */ |
420 |
printerr("Too Few Arguments"); |
void print_val(environment *env, value *val, int noquote, stackitem *stack, |
421 |
env->err=1; |
FILE *stream) |
422 |
return; |
{ |
423 |
} |
stackitem *titem, *tstack; |
424 |
typenum=env->head->item->type; |
int depth; |
425 |
toss(env); |
|
426 |
switch(typenum){ |
switch(val->type) { |
427 |
case integer: |
case empty: |
428 |
push_sym(env, "integer"); |
if(fprintf(stream, "[]") < 0){ |
429 |
break; |
perror("print_val"); |
430 |
case string: |
env->err= 5; |
431 |
push_sym(env, "string"); |
return; |
432 |
break; |
} |
|
case symb: |
|
|
push_sym(env, "symbol"); |
|
|
break; |
|
|
case func: |
|
|
push_sym(env, "function"); |
|
433 |
break; |
break; |
434 |
case list: |
case unknown: |
435 |
push_sym(env, "list"); |
if(fprintf(stream, "UNKNOWN") < 0){ |
436 |
|
perror("print_val"); |
437 |
|
env->err= 5; |
438 |
|
return; |
439 |
|
} |
440 |
break; |
break; |
|
} |
|
|
} |
|
|
|
|
|
/* Prints the top element of the stack. */ |
|
|
void print_h(stackitem *stack_head, int noquote) |
|
|
{ |
|
|
switch(stack_head->item->type) { |
|
441 |
case integer: |
case integer: |
442 |
printf("%d", stack_head->item->content.val); |
if(fprintf(stream, "%d", val->content.i) < 0){ |
443 |
|
perror("print_val"); |
444 |
|
env->err= 5; |
445 |
|
return; |
446 |
|
} |
447 |
|
break; |
448 |
|
case tfloat: |
449 |
|
if(fprintf(stream, "%f", val->content.f) < 0){ |
450 |
|
perror("print_val"); |
451 |
|
env->err= 5; |
452 |
|
return; |
453 |
|
} |
454 |
break; |
break; |
455 |
case string: |
case string: |
456 |
if(noquote) |
if(noquote){ |
457 |
printf("%s", (char*)stack_head->item->content.ptr); |
if(fprintf(stream, "%s", val->content.string) < 0){ |
458 |
else |
perror("print_val"); |
459 |
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
env->err= 5; |
460 |
|
return; |
461 |
|
} |
462 |
|
} else { /* quote */ |
463 |
|
if(fprintf(stream, "\"%s\"", val->content.string) < 0){ |
464 |
|
perror("print_val"); |
465 |
|
env->err= 5; |
466 |
|
return; |
467 |
|
} |
468 |
|
} |
469 |
break; |
break; |
470 |
case symb: |
case symb: |
471 |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
if(fprintf(stream, "%s", val->content.sym->id) < 0){ |
472 |
|
perror("print_val"); |
473 |
|
env->err= 5; |
474 |
|
return; |
475 |
|
} |
476 |
break; |
break; |
477 |
case func: |
case func: |
478 |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
if(fprintf(stream, "#<function %p>", val->content.func) < 0){ |
479 |
|
perror("print_val"); |
480 |
|
env->err= 5; |
481 |
|
return; |
482 |
|
} |
483 |
break; |
break; |
484 |
case list: |
case port: |
485 |
/* A list is just a stack, so make stack_head point to it */ |
if(fprintf(stream, "#<port %p>", val->content.p) < 0){ |
486 |
stack_head=(stackitem *)(stack_head->item->content.ptr); |
perror("print_val"); |
487 |
printf("[ "); |
env->err= 5; |
488 |
while(stack_head != NULL) { |
return; |
|
print_h(stack_head, noquote); |
|
|
printf(" "); |
|
|
stack_head=stack_head->next; |
|
489 |
} |
} |
|
printf("]"); |
|
490 |
break; |
break; |
491 |
} |
case tcons: |
492 |
} |
if(fprintf(stream, "[ ") < 0){ |
493 |
|
perror("print_val"); |
494 |
|
env->err= 5; |
495 |
|
return; |
496 |
|
} |
497 |
|
tstack= stack; |
498 |
|
|
499 |
extern void print_(environment *env) { |
do { |
500 |
if(env->head==NULL) { |
titem=malloc(sizeof(stackitem)); |
501 |
printerr("Too Few Arguments"); |
assert(titem != NULL); |
502 |
env->err=1; |
titem->item=val; |
503 |
return; |
titem->next=tstack; |
504 |
} |
tstack=titem; /* Put it on the stack */ |
505 |
print_h(env->head, 0); |
/* Search a stack of values being printed to see if we are already |
506 |
nl(); |
printing this value */ |
507 |
} |
titem=tstack; |
508 |
|
depth=0; |
509 |
|
|
510 |
|
while(titem != NULL && titem->item != CAR(val)){ |
511 |
|
titem=titem->next; |
512 |
|
depth++; |
513 |
|
} |
514 |
|
|
515 |
/* Prints the top element of the stack and then discards it. */ |
if(titem != NULL){ /* If we found it on the stack, */ |
516 |
extern void print(environment *env) |
if(fprintf(stream, "#%d#", depth) < 0){ /* print a depth reference */ |
517 |
{ |
perror("print_val"); |
518 |
print_(env); |
env->err= 5; |
519 |
if(env->err) return; |
free(titem); |
520 |
toss(env); |
return; |
521 |
} |
} |
522 |
|
} else { |
523 |
|
print_val(env, CAR(val), noquote, tstack, stream); |
524 |
|
} |
525 |
|
|
526 |
extern void princ_(environment *env) { |
val= CDR(val); |
527 |
if(env->head==NULL) { |
switch(val->type){ |
528 |
printerr("Too Few Arguments"); |
case empty: |
529 |
env->err=1; |
break; |
530 |
return; |
case tcons: |
531 |
} |
/* Search a stack of values being printed to see if we are already |
532 |
print_h(env->head, 1); |
printing this value */ |
533 |
} |
titem=tstack; |
534 |
|
depth=0; |
535 |
|
|
536 |
|
while(titem != NULL && titem->item != val){ |
537 |
|
titem=titem->next; |
538 |
|
depth++; |
539 |
|
} |
540 |
|
if(titem != NULL){ /* If we found it on the stack, */ |
541 |
|
if(fprintf(stream, " . #%d#", depth) < 0){ /* print a depth reference */ |
542 |
|
perror("print_val"); |
543 |
|
env->err= 5; |
544 |
|
goto printval_end; |
545 |
|
} |
546 |
|
} else { |
547 |
|
if(fprintf(stream, " ") < 0){ |
548 |
|
perror("print_val"); |
549 |
|
env->err= 5; |
550 |
|
goto printval_end; |
551 |
|
} |
552 |
|
} |
553 |
|
break; |
554 |
|
default: |
555 |
|
if(fprintf(stream, " . ") < 0){ /* Improper list */ |
556 |
|
perror("print_val"); |
557 |
|
env->err= 5; |
558 |
|
goto printval_end; |
559 |
|
} |
560 |
|
print_val(env, val, noquote, tstack, stream); |
561 |
|
} |
562 |
|
} while(val->type == tcons && titem == NULL); |
563 |
|
|
564 |
/* Prints the top element of the stack and then discards it. */ |
printval_end: |
|
extern void princ(environment *env) |
|
|
{ |
|
|
princ_(env); |
|
|
if(env->err) return; |
|
|
toss(env); |
|
|
} |
|
565 |
|
|
566 |
/* Only to be called by function printstack. */ |
titem=tstack; |
567 |
void print_st(stackitem *stack_head, long counter) |
while(titem != stack){ |
568 |
{ |
tstack=titem->next; |
569 |
if(stack_head->next != NULL) |
free(titem); |
570 |
print_st(stack_head->next, counter+1); |
titem=tstack; |
571 |
printf("%ld: ", counter); |
} |
|
print_h(stack_head, 0); |
|
|
nl(); |
|
|
} |
|
572 |
|
|
573 |
/* Prints the stack. */ |
if(! (env->err)){ |
574 |
extern void printstack(environment *env) |
if(fprintf(stream, " ]") < 0){ |
575 |
{ |
perror("print_val"); |
576 |
if(env->head == NULL) { |
env->err= 5; |
577 |
printf("Stack Empty\n"); |
} |
578 |
return; |
} |
579 |
|
break; |
580 |
} |
} |
|
print_st(env->head, 1); |
|
581 |
} |
} |
582 |
|
|
583 |
|
|
584 |
/* Swap the two top elements on the stack. */ |
/* Swap the two top elements on the stack. */ |
585 |
extern void swap(environment *env) |
extern void swap(environment *env) |
586 |
{ |
{ |
587 |
stackitem *temp= env->head; |
value *temp= env->head; |
|
|
|
|
if(env->head==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
env->head= env->head->next; |
|
|
temp->next= env->head->next; |
|
|
env->head->next= temp; |
|
|
} |
|
588 |
|
|
589 |
/* Rotate the first three elements on the stack. */ |
switch(check_args(env, unknown, unknown, empty)) { |
590 |
extern void rot(environment *env) |
case 1: |
591 |
{ |
printerr(env, "Too Few Arguments"); |
592 |
stackitem *temp= env->head; |
return; |
593 |
|
case 2: |
594 |
if(env->head==NULL || env->head->next==NULL |
printerr(env, "Bad Argument Type"); |
|
|| env->head->next->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
595 |
return; |
return; |
596 |
|
default: |
597 |
|
break; |
598 |
} |
} |
599 |
|
|
600 |
|
env->head= CDR(env->head); |
601 |
|
CDR(temp)= CDR(env->head); |
602 |
|
CDR(env->head)= temp; |
603 |
|
} |
604 |
|
|
|
env->head= env->head->next->next; |
|
|
temp->next->next= env->head->next; |
|
|
env->head->next= temp; |
|
|
} |
|
605 |
|
|
606 |
/* Recall a value from a symbol, if bound */ |
/* Recall a value from a symbol, if bound */ |
607 |
extern void rcl(environment *env) |
extern void rcl(environment *env) |
608 |
{ |
{ |
609 |
value *val; |
value *val; |
610 |
|
|
611 |
if(env->head == NULL) { |
switch(check_args(env, symb, empty)) { |
612 |
printerr("Too Few Arguments"); |
case 1: |
613 |
env->err=1; |
printerr(env, "Too Few Arguments"); |
614 |
return; |
return; |
615 |
} |
case 2: |
616 |
|
printerr(env, "Bad Argument Type"); |
|
if(env->head->item->type!=symb) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
617 |
return; |
return; |
618 |
|
default: |
619 |
|
break; |
620 |
} |
} |
621 |
|
|
622 |
val=((symbol *)(env->head->item->content.ptr))->val; |
val= CAR(env->head)->content.sym->val; |
623 |
if(val == NULL){ |
if(val == NULL){ |
624 |
printerr("Unbound Variable"); |
printerr(env, "Unbound Variable"); |
625 |
env->err=3; |
env->err= 3; |
626 |
return; |
return; |
627 |
} |
} |
628 |
protect(env, val); |
push_val(env, val); /* Return the symbol's bound value */ |
629 |
toss(env); /* toss the symbol */ |
swap(env); |
630 |
if(env->err) return; |
if(env->err) return; |
631 |
push_val(env, val); /* Return its bound value */ |
env->head= CDR(env->head); |
|
unprotect(env); |
|
632 |
} |
} |
633 |
|
|
634 |
|
|
635 |
/* 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 |
636 |
function value, and if it is, toss the symbol and execute the |
function value, and if it is, toss the symbol and execute the |
637 |
function. */ |
function. */ |
639 |
{ |
{ |
640 |
funcp in_func; |
funcp in_func; |
641 |
value* temp_val; |
value* temp_val; |
642 |
stackitem* iterator; |
value* iterator; |
643 |
|
|
644 |
eval_start: |
eval_start: |
645 |
|
|
646 |
if(env->head==NULL) { |
gc_maybe(env); |
647 |
printerr("Too Few Arguments"); |
|
648 |
env->err=1; |
switch(check_args(env, unknown, empty)) { |
649 |
|
case 1: |
650 |
|
printerr(env, "Too Few Arguments"); |
651 |
|
return; |
652 |
|
case 2: |
653 |
|
printerr(env, "Bad Argument Type"); |
654 |
return; |
return; |
655 |
|
default: |
656 |
|
break; |
657 |
} |
} |
658 |
|
|
659 |
switch(env->head->item->type) { |
switch(CAR(env->head)->type) { |
660 |
/* if it's a symbol */ |
/* if it's a symbol */ |
661 |
case symb: |
case symb: |
662 |
|
env->errsymb= CAR(env->head)->content.sym->id; |
663 |
rcl(env); /* get its contents */ |
rcl(env); /* get its contents */ |
664 |
if(env->err) return; |
if(env->err) return; |
665 |
if(env->head->item->type!=symb){ /* don't recurse symbols */ |
if(CAR(env->head)->type!=symb){ /* don't recurse symbols */ |
666 |
goto eval_start; |
goto eval_start; |
667 |
} |
} |
668 |
return; |
return; |
669 |
|
|
670 |
/* If it's a lone function value, run it */ |
/* If it's a lone function value, run it */ |
671 |
case func: |
case func: |
672 |
in_func= (funcp)(env->head->item->content.ptr); |
in_func= CAR(env->head)->content.func; |
673 |
toss(env); |
env->head= CDR(env->head); |
|
if(env->err) return; |
|
674 |
return in_func(env); |
return in_func(env); |
675 |
|
|
676 |
/* If it's a list */ |
/* If it's a list */ |
677 |
case list: |
case tcons: |
678 |
temp_val= env->head->item; |
temp_val= CAR(env->head); |
679 |
protect(env, temp_val); |
protect(temp_val); |
680 |
toss(env); |
|
681 |
if(env->err) return; |
env->head= CDR(env->head); |
682 |
iterator= (stackitem*)temp_val->content.ptr; |
iterator= temp_val; |
|
unprotect(env); |
|
683 |
|
|
684 |
while(iterator!=NULL) { |
while(iterator->type != empty) { |
685 |
push_val(env, iterator->item); |
push_val(env, CAR(iterator)); |
686 |
|
|
687 |
if(env->head->item->type==symb |
if(CAR(env->head)->type==symb |
688 |
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
&& CAR(env->head)->content.sym->id[0]==';') { |
689 |
toss(env); |
env->head= CDR(env->head); |
|
if(env->err) return; |
|
690 |
|
|
691 |
if(iterator->next == NULL){ |
if(CDR(iterator)->type == empty){ |
692 |
goto eval_start; |
goto eval_start; |
693 |
} |
} |
694 |
eval(env); |
eval(env); |
695 |
if(env->err) return; |
if(env->err) return; |
696 |
} |
} |
697 |
iterator= iterator->next; |
if (CDR(iterator)->type == empty || CDR(iterator)->type == tcons) |
698 |
|
iterator= CDR(iterator); |
699 |
|
else { |
700 |
|
printerr(env, "Bad Argument Type"); /* Improper list */ |
701 |
|
env->err= 2; |
702 |
|
return; |
703 |
|
} |
704 |
} |
} |
705 |
|
unprotect(temp_val); |
706 |
return; |
return; |
707 |
|
|
708 |
default: |
case empty: |
709 |
return; |
env->head= CDR(env->head); |
710 |
} |
case integer: |
711 |
} |
case tfloat: |
712 |
|
case string: |
713 |
/* Reverse (flip) a list */ |
case port: |
714 |
extern void rev(environment *env){ |
case unknown: |
|
stackitem *old_head, *new_head, *item; |
|
|
|
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=list) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
|
|
|
|
old_head= (stackitem *)(env->head->item->content.ptr); |
|
|
new_head= NULL; |
|
|
while(old_head != NULL){ |
|
|
item= old_head; |
|
|
old_head= old_head->next; |
|
|
item->next= new_head; |
|
|
new_head= item; |
|
|
} |
|
|
env->head->item->content.ptr= new_head; |
|
|
} |
|
|
|
|
|
/* Make a list. */ |
|
|
extern void pack(environment *env) |
|
|
{ |
|
|
stackitem *iterator, *temp; |
|
|
value *pack; |
|
|
|
|
|
iterator= env->head; |
|
|
|
|
|
if(iterator==NULL |
|
|
|| (iterator->item->type==symb |
|
|
&& ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) { |
|
|
temp= NULL; |
|
|
toss(env); |
|
|
} else { |
|
|
/* Search for first delimiter */ |
|
|
while(iterator->next!=NULL |
|
|
&& (iterator->next->item->type!=symb |
|
|
|| ((symbol*)(iterator->next->item->content.ptr))->id[0]!='[')) |
|
|
iterator= iterator->next; |
|
|
|
|
|
/* Extract list */ |
|
|
temp= env->head; |
|
|
env->head= iterator->next; |
|
|
iterator->next= NULL; |
|
|
|
|
|
if(env->head!=NULL) |
|
|
toss(env); |
|
|
} |
|
|
|
|
|
/* Push list */ |
|
|
pack= new_val(env); |
|
|
pack->type= list; |
|
|
pack->content.ptr= temp; |
|
|
|
|
|
push_val(env, pack); |
|
|
rev(env); |
|
|
} |
|
|
|
|
|
/* Relocate elements of the list on the stack. */ |
|
|
extern void expand(environment *env) |
|
|
{ |
|
|
stackitem *temp, *new_head; |
|
|
|
|
|
/* Is top element a list? */ |
|
|
if(env->head==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
if(env->head->item->type!=list) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
|
|
|
|
rev(env); |
|
|
|
|
|
if(env->err) |
|
|
return; |
|
|
|
|
|
/* The first list element is the new stack head */ |
|
|
new_head= temp= env->head->item->content.ptr; |
|
|
|
|
|
toss(env); |
|
|
|
|
|
/* Find the end of the list */ |
|
|
while(temp->next!=NULL) |
|
|
temp= temp->next; |
|
|
|
|
|
/* Connect the tail of the list with the old stack head */ |
|
|
temp->next= env->head; |
|
|
env->head= new_head; /* ...and voila! */ |
|
|
|
|
|
} |
|
|
|
|
|
/* Compares two elements by reference. */ |
|
|
extern void eq(environment *env) |
|
|
{ |
|
|
void *left, *right; |
|
|
int result; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
left= env->head->item->content.ptr; |
|
|
swap(env); |
|
|
right= env->head->item->content.ptr; |
|
|
result= (left==right); |
|
|
|
|
|
toss(env); toss(env); |
|
|
push_int(env, result); |
|
|
} |
|
|
|
|
|
/* Negates the top element on the stack. */ |
|
|
extern void not(environment *env) |
|
|
{ |
|
|
int val; |
|
|
|
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
|
|
|
|
val= env->head->item->content.val; |
|
|
toss(env); |
|
|
push_int(env, !val); |
|
|
} |
|
|
|
|
|
/* Compares the two top elements on the stack and return 0 if they're the |
|
|
same. */ |
|
|
extern void neq(environment *env) |
|
|
{ |
|
|
eq(env); |
|
|
not(env); |
|
|
} |
|
|
|
|
|
/* Give a symbol some content. */ |
|
|
extern void def(environment *env) |
|
|
{ |
|
|
symbol *sym; |
|
|
|
|
|
/* Needs two values on the stack, the top one must be a symbol */ |
|
|
if(env->head==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=symb) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
715 |
return; |
return; |
716 |
} |
} |
|
|
|
|
/* long names are a pain */ |
|
|
sym= env->head->item->content.ptr; |
|
|
|
|
|
/* Bind the symbol to the value */ |
|
|
sym->val= env->head->next->item; |
|
|
|
|
|
toss(env); toss(env); |
|
|
} |
|
|
|
|
|
/* Quit stack. */ |
|
|
extern void quit(environment *env) |
|
|
{ |
|
|
long i; |
|
|
|
|
|
clear(env); |
|
|
|
|
|
if (env->err) return; |
|
|
for(i= 0; i<HASHTBLSIZE; i++) { |
|
|
while(env->symbols[i]!= NULL) { |
|
|
forget_sym(&(env->symbols[i])); |
|
|
} |
|
|
env->symbols[i]= NULL; |
|
|
} |
|
|
|
|
|
env->gc_limit= 0; |
|
|
gc_init(env); |
|
|
|
|
|
if(env->free_string!=NULL) |
|
|
free(env->free_string); |
|
|
|
|
|
muntrace(); |
|
|
|
|
|
exit(EXIT_SUCCESS); |
|
717 |
} |
} |
718 |
|
|
|
/* Clear stack */ |
|
|
extern void clear(environment *env) |
|
|
{ |
|
|
while(env->head!=NULL) |
|
|
toss(env); |
|
|
} |
|
|
|
|
|
/* List all defined words */ |
|
|
extern void words(environment *env) |
|
|
{ |
|
|
symbol *temp; |
|
|
int i; |
|
|
|
|
|
for(i= 0; i<HASHTBLSIZE; i++) { |
|
|
temp= env->symbols[i]; |
|
|
while(temp!=NULL) { |
|
|
printf("%s\n", temp->id); |
|
|
temp= temp->next; |
|
|
} |
|
|
} |
|
|
} |
|
719 |
|
|
720 |
/* Internal forget function */ |
/* Internal forget function */ |
721 |
void forget_sym(symbol **hash_entry) { |
void forget_sym(symbol **hash_entry) |
722 |
|
{ |
723 |
symbol *temp; |
symbol *temp; |
724 |
|
|
725 |
temp= *hash_entry; |
temp= *hash_entry; |
729 |
free(temp); |
free(temp); |
730 |
} |
} |
731 |
|
|
|
/* Forgets a symbol (remove it from the hash table) */ |
|
|
extern void forget(environment *env) |
|
|
{ |
|
|
char* sym_id; |
|
|
stackitem *stack_head= env->head; |
|
|
|
|
|
if(stack_head==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(stack_head->item->type!=symb) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
|
|
|
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
|
|
toss(env); |
|
|
|
|
|
return forget_sym(hash(env->symbols, sym_id)); |
|
|
} |
|
|
|
|
|
/* Returns the current error number to the stack */ |
|
|
extern void errn(environment *env){ |
|
|
push_int(env, env->err); |
|
|
} |
|
732 |
|
|
733 |
int main(int argc, char **argv) |
int main(int argc, char **argv) |
734 |
{ |
{ |
735 |
environment myenv; |
environment myenv; |
|
|
|
736 |
int c; /* getopt option character */ |
int c; /* getopt option character */ |
737 |
|
|
738 |
|
#ifdef __linux__ |
739 |
mtrace(); |
mtrace(); |
740 |
|
#endif |
741 |
|
|
742 |
init_env(&myenv); |
init_env(&myenv); |
743 |
|
|
751 |
break; |
break; |
752 |
case '?': |
case '?': |
753 |
fprintf (stderr, |
fprintf (stderr, |
754 |
"Unknown option character `\\x%x'.\n", |
"Unknown option character '\\x%x'.\n", |
755 |
optopt); |
optopt); |
756 |
return EX_USAGE; |
return EX_USAGE; |
757 |
default: |
default: |
767 |
} |
} |
768 |
} |
} |
769 |
|
|
770 |
if(myenv.interactive) { |
if(myenv.interactive) |
771 |
printf("Stack version $Revision$\n\ |
puts(start_message); |
|
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn\n\ |
|
|
Stack comes with ABSOLUTELY NO WARRANTY; for details type `warranty;'.\n\ |
|
|
This is free software, and you are welcome to redistribute it\n\ |
|
|
under certain conditions; type `copying;' for details.\n"); |
|
|
} |
|
772 |
|
|
773 |
while(1) { |
while(1) { |
774 |
if(myenv.in_string==NULL) { |
if(myenv.in_string==NULL) { |
775 |
if (myenv.interactive) { |
if (myenv.interactive) { |
776 |
if(myenv.err) { |
if(myenv.err) { |
777 |
printf("(error %d)\n", myenv.err); |
printf("(error %d)\n", myenv.err); |
778 |
|
myenv.err= 0; |
779 |
} |
} |
780 |
nl(); |
printf("\n"); |
781 |
printstack(&myenv); |
printstack(&myenv); |
782 |
printf("> "); |
printf("> "); |
783 |
} |
} |
784 |
myenv.err=0; |
myenv.err=0; |
785 |
} |
} |
786 |
sx_72656164(&myenv); |
readstream(&myenv, myenv.inputstream); |
787 |
if (myenv.err==4) { |
if (myenv.err) { /* EOF or other error */ |
788 |
return EXIT_SUCCESS; /* EOF */ |
myenv.err=0; |
789 |
} else if(myenv.head!=NULL |
quit(&myenv); |
790 |
&& myenv.head->item->type==symb |
} else if(myenv.head->type!=empty |
791 |
&& ((symbol*)(myenv.head->item->content.ptr))->id[0]==';') { |
&& CAR(myenv.head)->type==symb |
792 |
toss(&myenv); /* No error check in main */ |
&& CAR(myenv.head)->content.sym->id[0] == ';') { |
793 |
|
if(myenv.head->type != empty) |
794 |
|
myenv.head= CDR(myenv.head); |
795 |
eval(&myenv); |
eval(&myenv); |
796 |
|
} else { |
797 |
|
gc_maybe(&myenv); |
798 |
} |
} |
|
gc_init(&myenv); |
|
799 |
} |
} |
800 |
quit(&myenv); |
quit(&myenv); |
801 |
return EXIT_FAILURE; |
return EXIT_FAILURE; |
802 |
} |
} |
803 |
|
|
|
/* "+" */ |
|
|
extern void sx_2b(environment *env) { |
|
|
int a, b; |
|
|
size_t len; |
|
|
char* new_string; |
|
|
value *a_val, *b_val; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type==string |
|
|
&& env->head->next->item->type==string) { |
|
|
a_val= env->head->item; |
|
|
b_val= env->head->next->item; |
|
|
protect(env, a_val); protect(env, b_val); |
|
|
toss(env); if(env->err) return; |
|
|
toss(env); if(env->err) return; |
|
|
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
|
|
new_string= malloc(len); |
|
|
strcpy(new_string, b_val->content.ptr); |
|
|
strcat(new_string, a_val->content.ptr); |
|
|
push_cstring(env, new_string); |
|
|
unprotect(env); unprotect(env); |
|
|
free(new_string); |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=integer |
|
|
|| env->head->next->item->type!=integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
a= env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
|
|
|
b= env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
push_int(env, a+b); |
|
|
} |
|
|
|
|
|
/* "-" */ |
|
|
extern void sx_2d(environment *env) { |
|
|
int a, b; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=integer |
|
|
|| env->head->next->item->type!=integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
|
|
|
a=env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
b=env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
push_int(env, b-a); |
|
|
} |
|
|
|
|
|
/* ">" */ |
|
|
extern void sx_3e(environment *env) { |
|
|
int a, b; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->item->type!=integer |
|
|
|| env->head->next->item->type!=integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
|
} |
|
|
|
|
|
a=env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
b=env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
push_int(env, b>a); |
|
|
} |
|
804 |
|
|
805 |
/* Return copy of a value */ |
/* Return copy of a value */ |
806 |
value *copy_val(environment *env, value *old_value){ |
value *copy_val(environment *env, value *old_value) |
807 |
stackitem *old_item, *new_item, *prev_item; |
{ |
808 |
|
value *new_value; |
809 |
|
|
810 |
value *new_value= new_val(env); |
if(old_value==NULL) |
811 |
|
return NULL; |
812 |
|
|
813 |
protect(env, old_value); |
new_value= new_val(env); |
814 |
new_value->type= old_value->type; |
new_value->type= old_value->type; |
815 |
|
|
816 |
switch(old_value->type){ |
switch(old_value->type){ |
817 |
|
case tfloat: |
818 |
case integer: |
case integer: |
|
new_value->content.val= old_value->content.val; |
|
|
break; |
|
|
case string: |
|
|
(char *)(new_value->content.ptr)= |
|
|
strdup((char *)(old_value->content.ptr)); |
|
|
break; |
|
819 |
case func: |
case func: |
820 |
case symb: |
case symb: |
821 |
new_value->content.ptr= old_value->content.ptr; |
case empty: |
822 |
|
case unknown: |
823 |
|
case port: |
824 |
|
new_value->content= old_value->content; |
825 |
|
break; |
826 |
|
case string: |
827 |
|
new_value->content.string= strdup(old_value->content.string); |
828 |
break; |
break; |
829 |
case list: |
case tcons: |
|
new_value->content.ptr= NULL; |
|
830 |
|
|
831 |
prev_item= NULL; |
new_value->content.c= malloc(sizeof(pair)); |
832 |
old_item= (stackitem*)(old_value->content.ptr); |
assert(new_value->content.c!=NULL); |
833 |
|
env->gc_count += sizeof(pair); |
834 |
|
|
835 |
while(old_item != NULL) { /* While list is not empty */ |
CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */ |
836 |
new_item= malloc(sizeof(stackitem)); |
CDR(new_value)= copy_val(env, CDR(old_value)); /* recurse */ |
|
new_item->item= copy_val(env, old_item->item); /* recurse */ |
|
|
new_item->next= NULL; |
|
|
if(prev_item != NULL) /* If this wasn't the first item */ |
|
|
prev_item->next= new_item; /* point the previous item to the |
|
|
new item */ |
|
|
else |
|
|
new_value->content.ptr= new_item; |
|
|
old_item= old_item->next; |
|
|
prev_item= new_item; |
|
|
} |
|
837 |
break; |
break; |
838 |
} |
} |
839 |
|
|
|
unprotect(env); |
|
|
|
|
840 |
return new_value; |
return new_value; |
841 |
} |
} |
842 |
|
|
|
/* "dup"; duplicates an item on the stack */ |
|
|
extern void sx_647570(environment *env) { |
|
|
if((env->head)==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
push_val(env, copy_val(env, env->head->item)); |
|
|
} |
|
843 |
|
|
844 |
/* "if", If-Then */ |
/* read a line from a stream; used by readline */ |
845 |
extern void sx_6966(environment *env) { |
void readlinestream(environment *env, FILE *stream) |
846 |
|
{ |
847 |
int truth; |
char in_string[101]; |
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
848 |
|
|
849 |
if(env->head->next->item->type != integer) { |
if(fgets(in_string, 100, stream)==NULL) { |
850 |
printerr("Bad Argument Type"); |
push_cstring(env, ""); |
851 |
env->err=2; |
if (! feof(stream)){ |
852 |
return; |
perror("readline"); |
853 |
|
env->err= 5; |
854 |
|
} |
855 |
|
} else { |
856 |
|
push_cstring(env, in_string); |
857 |
} |
} |
|
|
|
|
swap(env); |
|
|
if(env->err) return; |
|
|
|
|
|
truth=env->head->item->content.val; |
|
|
|
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
|
|
|
if(truth) |
|
|
eval(env); |
|
|
else |
|
|
toss(env); |
|
858 |
} |
} |
859 |
|
|
|
/* If-Then-Else */ |
|
|
extern void ifelse(environment *env) { |
|
860 |
|
|
861 |
int truth; |
/* Reverse (flip) a list */ |
862 |
|
extern void rev(environment *env) |
863 |
|
{ |
864 |
|
value *old_head, *new_head, *item; |
865 |
|
|
866 |
if((env->head)==NULL || env->head->next==NULL |
if(CAR(env->head)->type==empty) |
867 |
|| env->head->next->next==NULL) { |
return; /* Don't reverse an empty list */ |
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
868 |
|
|
869 |
if(env->head->next->next->item->type != integer) { |
switch(check_args(env, tcons, empty)) { |
870 |
printerr("Bad Argument Type"); |
case 1: |
871 |
env->err=2; |
printerr(env, "Too Few Arguments"); |
872 |
return; |
return; |
873 |
} |
case 2: |
874 |
|
printerr(env, "Bad Argument Type"); |
|
rot(env); |
|
|
if(env->err) return; |
|
|
|
|
|
truth=env->head->item->content.val; |
|
|
|
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
|
|
|
if(!truth) |
|
|
swap(env); |
|
|
if(env->err) return; |
|
|
|
|
|
toss(env); |
|
|
if(env->err) return; |
|
|
|
|
|
eval(env); |
|
|
} |
|
|
|
|
|
/* "while" */ |
|
|
extern void sx_7768696c65(environment *env) { |
|
|
|
|
|
int truth; |
|
|
value *loop, *test; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
875 |
return; |
return; |
876 |
|
default: |
877 |
|
break; |
878 |
} |
} |
879 |
|
|
880 |
loop= env->head->item; |
old_head= CAR(env->head); |
881 |
protect(env, loop); |
new_head= new_val(env); |
882 |
toss(env); if(env->err) return; |
while(old_head->type != empty) { |
883 |
|
item= old_head; |
884 |
test= env->head->item; |
old_head= CDR(old_head); |
885 |
protect(env, test); |
CDR(item)= new_head; |
886 |
toss(env); if(env->err) return; |
new_head= item; |
887 |
|
} |
888 |
do { |
CAR(env->head)= new_head; |
|
push_val(env, test); |
|
|
eval(env); |
|
|
|
|
|
if(env->head->item->type != integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
|
|
|
|
truth= env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
|
|
|
if(truth) { |
|
|
push_val(env, loop); |
|
|
eval(env); |
|
|
} else { |
|
|
toss(env); |
|
|
} |
|
|
|
|
|
} while(truth); |
|
|
|
|
|
unprotect(env); unprotect(env); |
|
889 |
} |
} |
890 |
|
|
891 |
|
|
892 |
/* "for"; for-loop */ |
/* Make a list. */ |
893 |
extern void sx_666f72(environment *env) { |
extern void pack(environment *env) |
894 |
value *loop; |
{ |
895 |
int foo1, foo2; |
value *iterator, *temp, *ending; |
|
|
|
|
if(env->head==NULL || env->head->next==NULL |
|
|
|| env->head->next->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
896 |
|
|
897 |
if(env->head->next->item->type!=integer |
ending=new_val(env); |
|
|| env->head->next->next->item->type!=integer) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
898 |
|
|
899 |
loop= env->head->item; |
iterator= env->head; |
900 |
protect(env, loop); |
if(iterator->type == empty |
901 |
toss(env); if(env->err) return; |
|| (CAR(iterator)->type==symb |
902 |
|
&& CAR(iterator)->content.sym->id[0]=='[')) { |
903 |
foo2= env->head->item->content.val; |
temp= ending; |
904 |
toss(env); if(env->err) return; |
if(env->head->type != empty) |
905 |
|
env->head= CDR(env->head); |
|
foo1= env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
|
|
|
if(foo1<=foo2) { |
|
|
while(foo1<=foo2) { |
|
|
push_int(env, foo1); |
|
|
push_val(env, loop); |
|
|
eval(env); if(env->err) return; |
|
|
foo1++; |
|
|
} |
|
906 |
} else { |
} else { |
907 |
while(foo1>=foo2) { |
/* Search for first delimiter */ |
908 |
push_int(env, foo1); |
while(CDR(iterator)->type != empty |
909 |
push_val(env, loop); |
&& (CAR(CDR(iterator))->type!=symb |
910 |
eval(env); if(env->err) return; |
|| CAR(CDR(iterator))->content.sym->id[0]!='[')) |
911 |
foo1--; |
iterator= CDR(iterator); |
912 |
} |
|
913 |
} |
/* Extract list */ |
914 |
unprotect(env); |
temp= env->head; |
915 |
} |
env->head= CDR(iterator); |
916 |
|
CDR(iterator)= ending; |
|
/* Variant of for-loop */ |
|
|
extern void foreach(environment *env) { |
|
|
|
|
|
value *loop, *foo; |
|
|
stackitem *iterator; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err= 1; |
|
|
return; |
|
|
} |
|
|
|
|
|
if(env->head->next->item->type != list) { |
|
|
printerr("Bad Argument Type"); |
|
|
env->err= 2; |
|
|
return; |
|
|
} |
|
|
|
|
|
loop= env->head->item; |
|
|
protect(env, loop); |
|
|
toss(env); if(env->err) return; |
|
|
|
|
|
foo= env->head->item; |
|
|
protect(env, foo); |
|
|
toss(env); if(env->err) return; |
|
|
|
|
|
iterator= foo->content.ptr; |
|
|
|
|
|
while(iterator!=NULL) { |
|
|
push_val(env, iterator->item); |
|
|
push_val(env, loop); |
|
|
eval(env); if(env->err) return; |
|
|
iterator= iterator->next; |
|
|
} |
|
|
unprotect(env); unprotect(env); |
|
|
} |
|
|
|
|
|
/* "to" */ |
|
|
extern void to(environment *env) { |
|
|
int i, start, ending; |
|
|
stackitem *temp_head; |
|
|
value *temp_val; |
|
|
|
|
|
if((env->head)==NULL || env->head->next==NULL) { |
|
|
printerr("Too Few Arguments"); |
|
|
env->err=1; |
|
|
return; |
|
|
} |
|
917 |
|
|
918 |
if(env->head->item->type!=integer |
if(env->head->type != empty) |
919 |
|| env->head->next->item->type!=integer) { |
env->head= CDR(env->head); |
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
920 |
} |
} |
921 |
|
|
922 |
ending= env->head->item->content.val; |
/* Push list */ |
|
toss(env); if(env->err) return; |
|
|
start= env->head->item->content.val; |
|
|
toss(env); if(env->err) return; |
|
|
|
|
|
temp_head= env->head; |
|
|
env->head= NULL; |
|
|
|
|
|
if(ending>=start) { |
|
|
for(i= ending; i>=start; i--) |
|
|
push_int(env, i); |
|
|
} else { |
|
|
for(i= ending; i<=start; i++) |
|
|
push_int(env, i); |
|
|
} |
|
923 |
|
|
924 |
temp_val= new_val(env); |
push_val(env, temp); |
925 |
temp_val->content.ptr= env->head; |
rev(env); |
|
temp_val->type= list; |
|
|
env->head= temp_head; |
|
|
push_val(env, temp_val); |
|
926 |
} |
} |
927 |
|
|
|
/* Read a string */ |
|
|
extern void readline(environment *env) { |
|
|
char in_string[101]; |
|
|
|
|
|
if(fgets(in_string, 100, env->inputstream)==NULL) |
|
|
push_cstring(env, ""); |
|
|
else |
|
|
push_cstring(env, in_string); |
|
|
} |
|
928 |
|
|
929 |
/* "read"; Read a value and place on stack */ |
/* read from a stream; used by "read" and "readport" */ |
930 |
extern void sx_72656164(environment *env) { |
void readstream(environment *env, FILE *stream) |
931 |
|
{ |
932 |
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n"; |
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n"; |
933 |
const char strform[]= "\"%[^\"]\"%n"; |
const char strform[]= "\"%[^\"]\"%n"; |
934 |
const char intform[]= "%i%n"; |
const char intform[]= "%i%n"; |
935 |
|
const char fltform[]= "%f%n"; |
936 |
const char blankform[]= "%*[ \t]%n"; |
const char blankform[]= "%*[ \t]%n"; |
937 |
const char ebrackform[]= "]%n"; |
const char ebrackform[]= "]%n"; |
938 |
const char semicform[]= ";%n"; |
const char semicform[]= ";%n"; |
939 |
const char bbrackform[]= "[%n"; |
const char bbrackform[]= "[%n"; |
940 |
|
|
941 |
int itemp, readlength= -1; |
int itemp, readlength= -1; |
942 |
|
int count= -1; |
943 |
|
float ftemp; |
944 |
static int depth= 0; |
static int depth= 0; |
945 |
char *match; |
char *match; |
946 |
size_t inlength; |
size_t inlength; |
949 |
if(depth > 0 && env->interactive) { |
if(depth > 0 && env->interactive) { |
950 |
printf("]> "); |
printf("]> "); |
951 |
} |
} |
952 |
readline(env); if(env->err) return; |
readlinestream(env, env->inputstream); |
953 |
|
if(env->err) return; |
954 |
|
|
955 |
if(((char *)(env->head->item->content.ptr))[0]=='\0'){ |
if((CAR(env->head)->content.string)[0]=='\0'){ |
956 |
env->err= 4; /* "" means EOF */ |
env->err= 4; /* "" means EOF */ |
957 |
return; |
return; |
958 |
} |
} |
959 |
|
|
960 |
env->in_string= malloc(strlen(env->head->item->content.ptr)+1); |
env->in_string= malloc(strlen(CAR(env->head)->content.string)+1); |
961 |
|
assert(env->in_string != NULL); |
962 |
env->free_string= env->in_string; /* Save the original pointer */ |
env->free_string= env->in_string; /* Save the original pointer */ |
963 |
strcpy(env->in_string, env->head->item->content.ptr); |
strcpy(env->in_string, CAR(env->head)->content.string); |
964 |
toss(env); if(env->err) return; |
env->head= CDR(env->head); |
965 |
} |
} |
966 |
|
|
967 |
inlength= strlen(env->in_string)+1; |
inlength= strlen(env->in_string)+1; |
968 |
match= malloc(inlength); |
match= malloc(inlength); |
969 |
|
assert(match != NULL); |
970 |
|
|
971 |
if(sscanf(env->in_string, blankform, &readlength)!=EOF |
if(sscanf(env->in_string, blankform, &readlength) != EOF |
972 |
&& readlength != -1) { |
&& readlength != -1) { |
973 |
; |
; |
974 |
} else if(sscanf(env->in_string, intform, &itemp, &readlength) != EOF |
} else if(sscanf(env->in_string, fltform, &ftemp, &readlength) != EOF |
975 |
&& readlength != -1) { |
&& readlength != -1) { |
976 |
push_int(env, itemp); |
if(sscanf(env->in_string, intform, &itemp, &count) != EOF |
977 |
|
&& count==readlength) { |
978 |
|
push_int(env, itemp); |
979 |
|
} else { |
980 |
|
push_float(env, ftemp); |
981 |
|
} |
982 |
|
} else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF |
983 |
|
&& readlength != -1) { |
984 |
|
push_cstring(env, ""); |
985 |
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
986 |
&& readlength != -1) { |
&& readlength != -1) { |
987 |
push_cstring(env, match); |
push_cstring(env, match); |
1003 |
free(env->free_string); |
free(env->free_string); |
1004 |
env->in_string = env->free_string = NULL; |
env->in_string = env->free_string = NULL; |
1005 |
} |
} |
1006 |
if ( env->in_string != NULL) { |
if (env->in_string != NULL) { |
1007 |
env->in_string += readlength; |
env->in_string += readlength; |
1008 |
} |
} |
1009 |
|
|
1010 |
free(match); |
free(match); |
1011 |
|
|
1012 |
if(depth) |
if(depth) |
1013 |
return sx_72656164(env); |
return readstream(env, env->inputstream); |
1014 |
} |
} |
1015 |
|
|
|
extern void beep(environment *env) { |
|
1016 |
|
|
1017 |
int freq, dur, period, ticks; |
int check_args(environment *env, ...) |
1018 |
|
{ |
1019 |
|
va_list ap; |
1020 |
|
enum type_enum mytype; |
1021 |
|
|
1022 |
if((env->head)==NULL || env->head->next==NULL) { |
value *iter= env->head; |
1023 |
printerr("Too Few Arguments"); |
int errval= 0; |
|
env->err=1; |
|
|
return; |
|
|
} |
|
1024 |
|
|
1025 |
if(env->head->item->type!=integer |
va_start(ap, env); |
1026 |
|| env->head->next->item->type!=integer) { |
while(1) { |
1027 |
printerr("Bad Argument Type"); |
mytype= va_arg(ap, enum type_enum); |
1028 |
env->err=2; |
// fprintf(stderr, "%s\n", env->errsymb); |
|
return; |
|
|
} |
|
|
|
|
|
dur=env->head->item->content.val; |
|
|
toss(env); |
|
|
freq=env->head->item->content.val; |
|
|
toss(env); |
|
|
|
|
|
period=1193180/freq; /* convert freq from Hz to period |
|
|
length */ |
|
|
ticks=dur*.001193180; /* convert duration from µseconds to |
|
|
timer ticks */ |
|
|
|
|
|
/* ticks=dur/1000; */ |
|
|
|
|
|
/* if (ioctl(STDOUT_FILENO, KDMKTONE, (125<<16) + 0x637)==0) */ |
|
|
switch (ioctl(STDOUT_FILENO, KDMKTONE, (ticks<<16) | period)){ |
|
|
case 0: |
|
|
usleep(dur); |
|
|
return; |
|
|
case -1: |
|
|
perror("beep"); |
|
|
env->err=5; |
|
|
return; |
|
|
default: |
|
|
abort(); |
|
|
} |
|
|
}; |
|
1029 |
|
|
1030 |
/* "wait" */ |
if(mytype==empty) |
1031 |
extern void sx_77616974(environment *env) { |
break; |
1032 |
|
|
1033 |
|
if(iter->type==empty || iter==NULL) { |
1034 |
|
errval= 1; |
1035 |
|
break; |
1036 |
|
} |
1037 |
|
|
1038 |
int dur; |
if(mytype==unknown) { |
1039 |
|
iter=CDR(iter); |
1040 |
|
continue; |
1041 |
|
} |
1042 |
|
|
1043 |
if((env->head)==NULL) { |
if(CAR(iter)->type!=mytype) { |
1044 |
printerr("Too Few Arguments"); |
errval= 2; |
1045 |
env->err=1; |
break; |
1046 |
return; |
} |
|
} |
|
1047 |
|
|
1048 |
if(env->head->item->type!=integer) { |
iter= CDR(iter); |
|
printerr("Bad Argument Type"); |
|
|
env->err=2; |
|
|
return; |
|
1049 |
} |
} |
1050 |
|
|
1051 |
dur=env->head->item->content.val; |
va_end(ap); |
|
toss(env); |
|
|
|
|
|
usleep(dur); |
|
|
}; |
|
1052 |
|
|
1053 |
extern void copying(environment *env){ |
env->err= errval; |
1054 |
printf("GNU GENERAL PUBLIC LICENSE\n\ |
return errval; |
|
Version 2, June 1991\n\ |
|
|
\n\ |
|
|
Copyright (C) 1989, 1991 Free Software Foundation, Inc.\n\ |
|
|
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\ |
|
|
Everyone is permitted to copy and distribute verbatim copies\n\ |
|
|
of this license document, but changing it is not allowed.\n\ |
|
|
\n\ |
|
|
Preamble\n\ |
|
|
\n\ |
|
|
The licenses for most software are designed to take away your\n\ |
|
|
freedom to share and change it. By contrast, the GNU General Public\n\ |
|
|
License is intended to guarantee your freedom to share and change free\n\ |
|
|
software--to make sure the software is free for all its users. This\n\ |
|
|
General Public License applies to most of the Free Software\n\ |
|
|
Foundation's software and to any other program whose authors commit to\n\ |
|
|
using it. (Some other Free Software Foundation software is covered by\n\ |
|
|
the GNU Library General Public License instead.) You can apply it to\n\ |
|
|
your programs, too.\n\ |
|
|
\n\ |
|
|
When we speak of free software, we are referring to freedom, not\n\ |
|
|
price. Our General Public Licenses are designed to make sure that you\n\ |
|
|
have the freedom to distribute copies of free software (and charge for\n\ |
|
|
this service if you wish), that you receive source code or can get it\n\ |
|
|
if you want it, that you can change the software or use pieces of it\n\ |
|
|
in new free programs; and that you know you can do these things.\n\ |
|
|
\n\ |
|
|
To protect your rights, we need to make restrictions that forbid\n\ |
|
|
anyone to deny you these rights or to ask you to surrender the rights.\n\ |
|
|
These restrictions translate to certain responsibilities for you if you\n\ |
|
|
distribute copies of the software, or if you modify it.\n\ |
|
|
\n\ |
|
|
For example, if you distribute copies of such a program, whether\n\ |
|
|
gratis or for a fee, you must give the recipients all the rights that\n\ |
|
|
you have. You must make sure that they, too, receive or can get the\n\ |
|
|
source code. And you must show them these terms so they know their\n\ |
|
|
rights.\n\ |
|
|
\n\ |
|
|
We protect your rights with two steps: (1) copyright the software, and\n\ |
|
|
(2) offer you this license which gives you legal permission to copy,\n\ |
|
|
distribute and/or modify the software.\n\ |
|
|
\n\ |
|
|
Also, for each author's protection and ours, we want to make certain\n\ |
|
|
that everyone understands that there is no warranty for this free\n\ |
|
|
software. If the software is modified by someone else and passed on, we\n\ |
|
|
want its recipients to know that what they have is not the original, so\n\ |
|
|
that any problems introduced by others will not reflect on the original\n\ |
|
|
authors' reputations.\n\ |
|
|
\n\ |
|
|
Finally, any free program is threatened constantly by software\n\ |
|
|
patents. We wish to avoid the danger that redistributors of a free\n\ |
|
|
program will individually obtain patent licenses, in effect making the\n\ |
|
|
program proprietary. To prevent this, we have made it clear that any\n\ |
|
|
patent must be licensed for everyone's free use or not licensed at all.\n\ |
|
|
\n\ |
|
|
The precise terms and conditions for copying, distribution and\n\ |
|
|
modification follow.\n\ |
|
|
\n\ |
|
|
GNU GENERAL PUBLIC LICENSE\n\ |
|
|
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\n\ |
|
|
\n\ |
|
|
0. This License applies to any program or other work which contains\n\ |
|
|
a notice placed by the copyright holder saying it may be distributed\n\ |
|
|
under the terms of this General Public License. The \"Program\", below,\n\ |
|
|
refers to any such program or work, and a \"work based on the Program\"\n\ |
|
|
means either the Program or any derivative work under copyright law:\n\ |
|
|
that is to say, a work containing the Program or a portion of it,\n\ |
|
|
either verbatim or with modifications and/or translated into another\n\ |
|
|
language. (Hereinafter, translation is included without limitation in\n\ |
|
|
the term \"modification\".) Each licensee is addressed as \"you\".\n\ |
|
|
\n\ |
|
|
Activities other than copying, distribution and modification are not\n\ |
|
|
covered by this License; they are outside its scope. The act of\n\ |
|
|
running the Program is not restricted, and the output from the Program\n\ |
|
|
is covered only if its contents constitute a work based on the\n\ |
|
|
Program (independent of having been made by running the Program).\n\ |
|
|
Whether that is true depends on what the Program does.\n\ |
|
|
\n\ |
|
|
1. You may copy and distribute verbatim copies of the Program's\n\ |
|
|
source code as you receive it, in any medium, provided that you\n\ |
|
|
conspicuously and appropriately publish on each copy an appropriate\n\ |
|
|
copyright notice and disclaimer of warranty; keep intact all the\n\ |
|
|
notices that refer to this License and to the absence of any warranty;\n\ |
|
|
and give any other recipients of the Program a copy of this License\n\ |
|
|
along with the Program.\n\ |
|
|
\n\ |
|
|
You may charge a fee for the physical act of transferring a copy, and\n\ |
|
|
you may at your option offer warranty protection in exchange for a fee.\n\ |
|
|
\n\ |
|
|
2. You may modify your copy or copies of the Program or any portion\n\ |
|
|
of it, thus forming a work based on the Program, and copy and\n\ |
|
|
distribute such modifications or work under the terms of Section 1\n\ |
|
|
above, provided that you also meet all of these conditions:\n\ |
|
|
\n\ |
|
|
a) You must cause the modified files to carry prominent notices\n\ |
|
|
stating that you changed the files and the date of any change.\n\ |
|
|
\n\ |
|
|
b) You must cause any work that you distribute or publish, that in\n\ |
|
|
whole or in part contains or is derived from the Program or any\n\ |
|
|
part thereof, to be licensed as a whole at no charge to all third\n\ |
|
|
parties under the terms of this License.\n\ |
|
|
\n\ |
|
|
c) If the modified program normally reads commands interactively\n\ |
|
|
when run, you must cause it, when started running for such\n\ |
|
|
interactive use in the most ordinary way, to print or display an\n\ |
|
|
announcement including an appropriate copyright notice and a\n\ |
|
|
notice that there is no warranty (or else, saying that you provide\n\ |
|
|
a warranty) and that users may redistribute the program under\n\ |
|
|
these conditions, and telling the user how to view a copy of this\n\ |
|
|
License. (Exception: if the Program itself is interactive but\n\ |
|
|
does not normally print such an announcement, your work based on\n\ |
|
|
the Program is not required to print an announcement.)\n\ |
|
|
\n\ |
|
|
These requirements apply to the modified work as a whole. If\n\ |
|
|
identifiable sections of that work are not derived from the Program,\n\ |
|
|
and can be reasonably considered independent and separate works in\n\ |
|
|
themselves, then this License, and its terms, do not apply to those\n\ |
|
|
sections when you distribute them as separate works. But when you\n\ |
|
|
distribute the same sections as part of a whole which is a work based\n\ |
|
|
on the Program, the distribution of the whole must be on the terms of\n\ |
|
|
this License, whose permissions for other licensees extend to the\n\ |
|
|
entire whole, and thus to each and every part regardless of who wrote it.\n\ |
|
|
\n\ |
|
|
Thus, it is not the intent of this section to claim rights or contest\n\ |
|
|
your rights to work written entirely by you; rather, the intent is to\n\ |
|
|
exercise the right to control the distribution of derivative or\n\ |
|
|
collective works based on the Program.\n\ |
|
|
\n\ |
|
|
In addition, mere aggregation of another work not based on the Program\n\ |
|
|
with the Program (or with a work based on the Program) on a volume of\n\ |
|
|
a storage or distribution medium does not bring the other work under\n\ |
|
|
the scope of this License.\n\ |
|
|
\n\ |
|
|
3. You may copy and distribute the Program (or a work based on it,\n\ |
|
|
under Section 2) in object code or executable form under the terms of\n\ |
|
|
Sections 1 and 2 above provided that you also do one of the following:\n\ |
|
|
\n\ |
|
|
a) Accompany it with the complete corresponding machine-readable\n\ |
|
|
source code, which must be distributed under the terms of Sections\n\ |
|
|
1 and 2 above on a medium customarily used for software interchange; or,\n\ |
|
|
\n\ |
|
|
b) Accompany it with a written offer, valid for at least three\n\ |
|
|
years, to give any third party, for a charge no more than your\n\ |
|
|
cost of physically performing source distribution, a complete\n\ |
|
|
machine-readable copy of the corresponding source code, to be\n\ |
|
|
distributed under the terms of Sections 1 and 2 above on a medium\n\ |
|
|
customarily used for software interchange; or,\n\ |
|
|
\n\ |
|
|
c) Accompany it with the information you received as to the offer\n\ |
|
|
to distribute corresponding source code. (This alternative is\n\ |
|
|
allowed only for noncommercial distribution and only if you\n\ |
|
|
received the program in object code or executable form with such\n\ |
|
|
an offer, in accord with Subsection b above.)\n\ |
|
|
\n\ |
|
|
The source code for a work means the preferred form of the work for\n\ |
|
|
making modifications to it. For an executable work, complete source\n\ |
|
|
code means all the source code for all modules it contains, plus any\n\ |
|
|
associated interface definition files, plus the scripts used to\n\ |
|
|
control compilation and installation of the executable. However, as a\n\ |
|
|
special exception, the source code distributed need not include\n\ |
|
|
anything that is normally distributed (in either source or binary\n\ |
|
|
form) with the major components (compiler, kernel, and so on) of the\n\ |
|
|
operating system on which the executable runs, unless that component\n\ |
|
|
itself accompanies the executable.\n\ |
|
|
\n\ |
|
|
If distribution of executable or object code is made by offering\n\ |
|
|
access to copy from a designated place, then offering equivalent\n\ |
|
|
access to copy the source code from the same place counts as\n\ |
|
|
distribution of the source code, even though third parties are not\n\ |
|
|
compelled to copy the source along with the object code.\n\ |
|
|
\n\ |
|
|
4. You may not copy, modify, sublicense, or distribute the Program\n\ |
|
|
except as expressly provided under this License. Any attempt\n\ |
|
|
otherwise to copy, modify, sublicense or distribute the Program is\n\ |
|
|
void, and will automatically terminate your rights under this License.\n\ |
|
|
However, parties who have received copies, or rights, from you under\n\ |
|
|
this License will not have their licenses terminated so long as such\n\ |
|
|
parties remain in full compliance.\n\ |
|
|
\n\ |
|
|
5. You are not required to accept this License, since you have not\n\ |
|
|
signed it. However, nothing else grants you permission to modify or\n\ |
|
|
distribute the Program or its derivative works. These actions are\n\ |
|
|
prohibited by law if you do not accept this License. Therefore, by\n\ |
|
|
modifying or distributing the Program (or any work based on the\n\ |
|
|
Program), you indicate your acceptance of this License to do so, and\n\ |
|
|
all its terms and conditions for copying, distributing or modifying\n\ |
|
|
the Program or works based on it.\n\ |
|
|
\n\ |
|
|
6. Each time you redistribute the Program (or any work based on the\n\ |
|
|
Program), the recipient automatically receives a license from the\n\ |
|
|
original licensor to copy, distribute or modify the Program subject to\n\ |
|
|
these terms and conditions. You may not impose any further\n\ |
|
|
restrictions on the recipients' exercise of the rights granted herein.\n\ |
|
|
You are not responsible for enforcing compliance by third parties to\n\ |
|
|
this License.\n\ |
|
|
\n\ |
|
|
7. If, as a consequence of a court judgment or allegation of patent\n\ |
|
|
infringement or for any other reason (not limited to patent issues),\n\ |
|
|
conditions are imposed on you (whether by court order, agreement or\n\ |
|
|
otherwise) that contradict the conditions of this License, they do not\n\ |
|
|
excuse you from the conditions of this License. If you cannot\n\ |
|
|
distribute so as to satisfy simultaneously your obligations under this\n\ |
|
|
License and any other pertinent obligations, then as a consequence you\n\ |
|
|
may not distribute the Program at all. For example, if a patent\n\ |
|
|
license would not permit royalty-free redistribution of the Program by\n\ |
|
|
all those who receive copies directly or indirectly through you, then\n\ |
|
|
the only way you could satisfy both it and this License would be to\n\ |
|
|
refrain entirely from distribution of the Program.\n\ |
|
|
\n\ |
|
|
If any portion of this section is held invalid or unenforceable under\n\ |
|
|
any particular circumstance, the balance of the section is intended to\n\ |
|
|
apply and the section as a whole is intended to apply in other\n\ |
|
|
circumstances.\n\ |
|
|
\n\ |
|
|
It is not the purpose of this section to induce you to infringe any\n\ |
|
|
patents or other property right claims or to contest validity of any\n\ |
|
|
such claims; this section has the sole purpose of protecting the\n\ |
|
|
integrity of the free software distribution system, which is\n\ |
|
|
implemented by public license practices. Many people have made\n\ |
|
|
generous contributions to the wide range of software distributed\n\ |
|
|
through that system in reliance on consistent application of that\n\ |
|
|
system; it is up to the author/donor to decide if he or she is willing\n\ |
|
|
to distribute software through any other system and a licensee cannot\n\ |
|
|
impose that choice.\n\ |
|
|
\n\ |
|
|
This section is intended to make thoroughly clear what is believed to\n\ |
|
|
be a consequence of the rest of this License.\n\ |
|
|
\n\ |
|
|
8. If the distribution and/or use of the Program is restricted in\n\ |
|
|
certain countries either by patents or by copyrighted interfaces, the\n\ |
|
|
original copyright holder who places the Program under this License\n\ |
|
|
may add an explicit geographical distribution limitation excluding\n\ |
|
|
those countries, so that distribution is permitted only in or among\n\ |
|
|
countries not thus excluded. In such case, this License incorporates\n\ |
|
|
the limitation as if written in the body of this License.\n\ |
|
|
\n\ |
|
|
9. The Free Software Foundation may publish revised and/or new versions\n\ |
|
|
of the General Public License from time to time. Such new versions will\n\ |
|
|
be similar in spirit to the present version, but may differ in detail to\n\ |
|
|
address new problems or concerns.\n\ |
|
|
\n\ |
|
|
Each version is given a distinguishing version number. If the Program\n\ |
|
|
specifies a version number of this License which applies to it and \"any\n\ |
|
|
later version\", you have the option of following the terms and conditions\n\ |
|
|
either of that version or of any later version published by the Free\n\ |
|
|
Software Foundation. If the Program does not specify a version number of\n\ |
|
|
this License, you may choose any version ever published by the Free Software\n\ |
|
|
Foundation.\n\ |
|
|
\n\ |
|
|
10. If you wish to incorporate parts of the Program into other free\n\ |
|
|
programs whose distribution conditions are different, write to the author\n\ |
|
|
to ask for permission. For software which is copyrighted by the Free\n\ |
|
|
Software Foundation, write to the Free Software Foundation; we sometimes\n\ |
|
|
make exceptions for this. Our decision will be guided by the two goals\n\ |
|
|
of preserving the free status of all derivatives of our free software and\n\ |
|
|
of promoting the sharing and reuse of software generally.\n"); |
|
|
} |
|
|
|
|
|
extern void warranty(environment *env){ |
|
|
printf(" NO WARRANTY\n\ |
|
|
\n\ |
|
|
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY\n\ |
|
|
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN\n\ |
|
|
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES\n\ |
|
|
PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED\n\ |
|
|
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\ |
|
|
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS\n\ |
|
|
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE\n\ |
|
|
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,\n\ |
|
|
REPAIR OR CORRECTION.\n\ |
|
|
\n\ |
|
|
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\n\ |
|
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR\n\ |
|
|
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,\n\ |
|
|
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING\n\ |
|
|
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED\n\ |
|
|
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY\n\ |
|
|
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER\n\ |
|
|
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE\n\ |
|
|
POSSIBILITY OF SUCH DAMAGES.\n"); |
|
1055 |
} |
} |