-
Notifications
You must be signed in to change notification settings - Fork 35
/
Copy patheval.c
1548 lines (1445 loc) · 41.8 KB
/
eval.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* eval.c logo eval/apply module dko
*
* Copyright (C) 1993 by the Regents of the University of California
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#define WANT_EVAL_REGS 1
#include "eval.h"
#include "logo.h"
#include "globals.h"
/* evaluator registers that need saving around evals */
struct registers regs;
NODE *Regs_Node;
int num_saved_nodes;
int inside_evaluator = 0;
NODE *eval_buttonact = NIL;
/* node-value registers that don't need saving */
NODE *expresn = NIL, /* the current expression */
*val = NIL, /* the value of the last expression */
*stack = NIL, /* register stack */
*numstack = NIL,/* stack whose elements aren't objects */
*parm = NIL, /* the current formal */
*catch_tag = NIL,
*arg = NIL; /* the current actual */
NODE
*var_stack = NIL, /* the stack of variables and their bindings */
*last_call = NIL, /* the last proc called */
*output_node = NIL, /* the output of the current function */
*output_unode = NIL; /* the unode in which we saw the output */
#if defined(__GNUC__) && !defined(__clang__)
#define USE_GCC_DISPATCH 1
#endif
/* Hint:
make "redefp "true
to get lots of output after defining DEBUGGING 1
*/
#define DEBUGGING 0
#if DEBUGGING
#define DEB_STACK 0 /* set to 1 to log save/restore */
#define DEB_CONT 0 /* set to 1 to log newcont/fetch_cont */
#define do_debug(x) \
x(expresn) x(unev) x(val) x(didnt_get_output) x(didnt_output_name) x(fun) \
x(proc)
#define deb_enum(x) \
ndprintf(stdout, #x " = %s, ", x);
void vs_print() {
FIXNUM vs = val_status;
int i;
static char *vnames[] = {"VALUE_OK", "NO_VALUE_OK", "OUTPUT_OK",
"STOP_OK", "OUTPUT_TAIL", "STOP_TAIL"};
static char *names[] = {"RUN", "STOP", "OUTPUT", "THROWING",
"MACRO_RETURN"};
if (!varTrue(Redefp)) return;
ndprintf(stdout, "Val_status = ");
for (i=0; i<6; i++) {
if (vs&1) {
ndprintf(stdout, vnames[i]);
vs >>= 1;
if (vs != 0) ndprintf(stdout, "|");
} else vs >>= 1;
if (vs == 0) break;
}
if (vs != 0) ndprintf(stdout, "0%o", vs<<6);
ndprintf(stdout, ", stopping_flag = %t\n", names[stopping_flag]);
}
void debprintline(int line, char *name) {
if (!varTrue(Redefp)) return;
ndprintf(stdout, "%d %t:\n", line, name);
do_debug(deb_enum)
vs_print();
ndprintf(stdout, "current_unode=0x%x, output_unode=0x%x\n\n",current_unode,
output_unode);
}
#define debprint(name) debprintline(__LINE__, name)
#define debprint2(a,b) if (varTrue(Redefp)) ndprintf(stdout,a,b)
#else
#define debprint(name)
#define debprint2(a,b)
#define DEB_STACK 0
#define DEB_CONT 0
#endif
#ifdef HAVE_TERMIO_H
#ifdef HAVE_WX
#include <termios.h>
#else
#include <termio.h>
#endif
#else
#ifdef HAVE_SGTTY_H
#include <sgtty.h>
#endif
#endif
#if DEB_STACK
NODE *restname, *restline;
#define save(register) ( debprint2("saving " #register " = %s ", register), \
push(register, stack), \
push(make_intnode(__LINE__), stack), \
debprint2(" at line %s\n", car(stack)), \
push(make_static_strnode(#register), stack) )
#define restore(register) ( restname = car(stack), pop(stack), \
restline = car(stack), pop(stack), \
register = car(stack), pop(stack), \
( (strcmp(getstrptr(restname), #register)) ? (\
debprint2("*** Restoring " #register " but saved %s",\
restname), \
debprint2(" at line %s! ***\n", restline) \
) : 0), \
debprint2("restoring " #register " = %s ", register), \
debprint2(" at line %s\n", make_intnode(__LINE__)) )
#define save2(reg1,reg2) ( save(reg1), save(reg2) )
#define restore2(reg1,reg2) ( restore(reg2), restore(reg1) )
#else
#define save(register) push(register, stack)
#define restore(register) (register = car(stack), pop(stack))
#define save2(reg1,reg2) (push(reg1,stack),stack->n_obj=reg2)
#define restore2(reg1,reg2) (reg2 = getobject(stack), \
reg1 = car(stack), pop(stack))
#endif
/* saving and restoring FIXNUMs rather than NODEs */
#define numsave(register) numpush(register,&numstack)
#define numrestore(register) (register=(FIXNUM)car(numstack), numstack=cdr(numstack))
#define num2save(reg1,reg2) (numpush(reg1,&numstack),numstack->n_obj=(NODE *)reg2)
#define num2restore(reg1,reg2) (reg2=(FIXNUM)getobject(numstack), \
reg1=(FIXNUM)car(numstack), numstack=cdr(numstack))
#if DEB_CONT
#define newcont(tag) debprint("Newcont = " #tag); \
numsave(cont); cont = (FIXNUM)tag
#else
#define newcont(tag) (numsave(cont), cont = (FIXNUM)tag)
#endif
/* These variables are all externed in globals.h */
CTRLTYPE stopping_flag = RUN;
char *logolib, *helpfiles, *csls;
FIXNUM dont_fix_ift = 0;
/* These variables are local to this file. */
static int trace_level = 0; /* indentation level when tracing */
/* These first few functions are externed in globals.h */
void numpush(FIXNUM obj, NODE **stack) {
NODE *temp = newnode(CONT); /*GC*/
temp->n_car = (NODE *)obj;
temp->n_cdr = *stack;
*stack = temp;
}
/* forward declaration */
NODE *evaluator(NODE *list, enum labels where);
/* Evaluate a line of input. */
void eval_driver(NODE *line) {
evaluator(line, begin_line);
}
/* Evaluate a sequence of expressions until we get a value to return.
* (Called from erract.)
*/
NODE *err_eval_driver(NODE *seq, BOOLEAN recoverable) {
val_status = (recoverable ? VALUE_OK : NO_VALUE_OK) |
(val_status & (OUTPUT_OK|STOP_OK));
return evaluator(seq, begin_seq);
}
/* The logo word APPLY. */
NODE *lapply(NODE *args) {
return make_cont(begin_apply, args);
}
/* The logo word ? <question-mark>. */
NODE *lqm(NODE *args) {
FIXNUM argnum = 1, i;
NODE *np = qm_list;
if (args != NIL) argnum = getint(pos_int_arg(args));
if (stopping_flag == THROWING) return(UNBOUND);
i = argnum;
while (--i > 0 && np != NIL) np = cdr(np);
if (np == NIL)
return(err_logo(BAD_DATA_UNREC,make_intnode(argnum)));
return(car(np));
}
/* The rest of the functions are local to this file. */
/* Warn the user if a local variable shadows a global one. */
void tell_shadow(NODE *arg) {
if (flag__caseobj(arg, VAL_STEPPED))
err_logo(SHADOW_WARN, arg);
}
/* Check if a local variable is already in this frame */
int not_local(NODE *name, NODE *sp) {
for ( ; sp != var; sp = cdr(sp)) {
if (compare_node(car(sp),name,TRUE) == 0) {
return FALSE;
}
}
return TRUE;
}
/* reverse a list destructively */
NODE *reverse(NODE *list) {
NODE *ret = NIL, *temp;
while (list != NIL) {
temp = list;
list = cdr(list);
setcdr(temp, ret);
ret = temp;
}
return ret;
}
/* nondestructive append */
NODE *append(NODE *a, NODE *b) {
if (a == NIL) return b;
return cons(car(a), append(cdr(a), b));
}
/* nondestructive flatten */
NODE *flatten(NODE *a) {
if (a == NIL) return NIL;
return append(car(a), flatten(cdr(a)));
}
/* Reset the var stack to the previous place holder.
*/
void reset_args(NODE *old_stack) {
for (; var_stack != old_stack; pop(var_stack)) {
if (nodetype(var_stack) & NT_LOCAL)
setflag__caseobj(car(var_stack), IS_LOCAL_VALUE);
else
clearflag__caseobj(car(var_stack), IS_LOCAL_VALUE);
setvalnode__caseobj(car(var_stack), getobject(var_stack));
}
}
NODE *bf3(NODE *name) {
NODE *string = cnv_node_to_strnode(name);
return make_strnode(getstrptr(string)+3, getstrhead(string),
getstrlen(string)-3, nodetype(string), strcpy);
}
NODE *deep_copy(NODE *expresn) {
NODE *val, **p, **q;
FIXNUM arridx;
if (expresn == NIL) return NIL;
else if (is_list(expresn)) {
val = cons(deep_copy(car(expresn)), deep_copy(cdr(expresn)));
val->n_obj = deep_copy(expresn->n_obj);
settype(val, nodetype(expresn));
} else if (nodetype(expresn) == ARRAY) {
val = make_array(getarrdim(expresn));
setarrorg(val, getarrorg(expresn));
for (p = getarrptr(expresn), q = getarrptr(val), arridx=0;
arridx < getarrdim(expresn); arridx++, p++)
*q++ = deep_copy(*p);
} else val = expresn;
return val;
}
int in_eval_save = 0;
void eval_save() {
push(NIL, stack);
int_during_gc = 0;
in_eval_save = 1;
settype(stack, STACK);
stack->n_car = (NODE *)malloc(sizeof(regs));
if (car(stack) == NULL) {
err_logo(OUT_OF_MEM_UNREC, NIL);
} else {
memcpy(car(stack), ®s, sizeof(regs));
}
in_eval_save = 0;
if (int_during_gc != 0) {
delayed_int();
}
}
void eval_restore() {
int_during_gc = 0;
in_eval_save = 1;
memcpy(®s, car(stack), sizeof(regs));
pop(stack);
in_eval_save = 0;
if (int_during_gc != 0) {
delayed_int();
}
}
/*
#ifdef OBJECTS
NODE *val_eval_driver(NODE *seq) {
val_status = VALUE_OK;
return evaluator(seq, begin_seq);
}
#endif
*/
/* An explicit control evaluator, taken almost directly from SICP, section
* 5.2. list is a flat list of expressions to evaluate. where is a label to
* begin at. Return value depends on where.
*/
NODE *evaluator(NODE *list, enum labels where) {
FIXNUM cont = 0; /* where to go next */
int i;
BOOLEAN tracing = FALSE; /* are we tracing the current procedure? */
inside_evaluator++;
eval_save();
var = var_stack;
newcont(all_done);
newcont(where);
goto fetch_cont;
all_done:
reset_args(var);
eval_restore();
if (dont_fix_ift) {
ift_iff_flag = dont_fix_ift-1;
dont_fix_ift = 0;
}
inside_evaluator--;
return(val);
begin_line:
this_line = list;
val_status = NO_VALUE_OK;
newcont(end_line);
begin_seq:
debprint("begin_seq");
make_tree(list);
if (!is_tree(list)) {
val = UNBOUND;
goto fetch_cont;
}
unev = tree__tree(list);
goto eval_sequence;
end_line:
if (val != UNBOUND) {
if (NOT_THROWING) err_logo(DK_WHAT, val);
}
/* val = NIL; */
goto fetch_cont;
/* ----------------- EVAL ---------------------------------- */
/* Get here for actual argument, from eval_sequence (non-tail), or
from tail call. */
tail_eval_dispatch:
tailcall = 1;
eval_dispatch:
debprint("eval_dispatch");
switch (nodetype(expresn)) {
case QUOTE: /* quoted literal */
val = /* deep_copy */ (node__quote(expresn));
goto fetch_cont;
case COLON: /* variable */
#ifdef OBJECTS
val = varValue(node__colon(expresn));
#else
val = valnode__colon(expresn);
#endif
while (val == UNBOUND && NOT_THROWING)
val = err_logo(NO_VALUE, node__colon(expresn));
goto fetch_cont;
case CONS: /* procedure application */
if (tailcall == 1 && is_macro(car(expresn)) &&
(is_list(procnode__caseobj(car(expresn)))
|| isName(car(expresn), Name_goto))) {
/* tail call to user-defined macro must be treated as non-tail
* because the expression returned by the macro
* remains to be evaluated in the caller's context */
unev = NIL;
goto non_tail_eval;
}
fun = car(expresn);
if (fun == Not_Enough_Node) {
err_logo(TOO_MUCH, NIL); /* When does this happen? */
val = UNBOUND;
goto fetch_cont;
}
if (flag__caseobj(fun, PROC_SPECFORM)) {
argl = cdr(expresn);
goto apply_dispatch;
}
if (cdr(expresn) != NIL)
goto ev_application;
else
goto ev_no_args;
case ARRAY: /* array must be copied */
val = deep_copy(expresn);
goto fetch_cont;
default:
val = expresn; /* self-evaluating */
goto fetch_cont;
}
ev_no_args:
/* Evaluate an application of a procedure with no arguments. */
argl = NIL;
goto apply_dispatch; /* apply the procedure */
ev_application:
/* Evaluate an application of a procedure with arguments. */
unev = cdr(expresn);
argl = NIL;
eval_arg_loop:
debprint("eval_arg_loop");
if (unev == NIL) goto eval_args_done;
expresn = car(unev);
if (expresn == Not_Enough_Node) {
if (NOT_THROWING)
err_logo(NOT_ENOUGH, NIL);
goto eval_args_done;
}
arg_from_macro:
if (nodetype(expresn) != CONS) { /* Don't bother saving registers */
newcont(after_const_arg); /* if the expresn isn't a proc call */
goto eval_dispatch;
}
eval_save();
save(current_unode);
var = var_stack;
tailcall = -1;
didnt_output_name = NIL;
didnt_get_output = cons_list(0, fun, ufun, this_line, END_OF_LIST);
val_status = VALUE_OK;
/* in case of apply or catch */
newcont(accumulate_arg);
goto eval_dispatch; /* evaluate the current argument */
accumulate_arg:
debprint("accumulate_arg");
/* Put the evaluated argument into the argl list. */
reset_args(var);
restore(current_unode);
last_call = fun;
if (current_unode != output_unode) {
if (STOPPING || RUNNING) output_node = UNBOUND;
if (stopping_flag == OUTPUT || STOPPING) {
stopping_flag = RUN;
val = output_node;
}
}
if (stopping_flag == OUTPUT || STOPPING) {
didnt_output_name = NIL;
err_logo(DIDNT_OUTPUT, fun);
}
while (NOT_THROWING && val == UNBOUND) {
val = err_logo(DIDNT_OUTPUT, NIL);
}
eval_restore();
if (stopping_flag == MACRO_RETURN) {
if (val == NIL || val == UNBOUND || cdr(val) != NIL) {
if (NOT_THROWING) {
if (tree_dk_how != NIL && tree_dk_how != UNBOUND)
err_logo(DK_HOW_UNREC, tree_dk_how);
else
err_logo((val!=NIL && val!=UNBOUND) ?
RUNNABLE_ARG : ERR_MACRO, val);
}
goto eval_args_done;
}
expresn = car(val);
stopping_flag = RUN;
goto arg_from_macro;
}
after_const_arg:
if (stopping_flag == THROWING) goto eval_args_done;
push(val, argl);
pop(unev);
goto eval_arg_loop;
eval_args_done:
if (stopping_flag == THROWING) {
val = UNBOUND;
goto fetch_cont;
}
argl = reverse(argl);
/* --------------------- APPLY ---------------------------- */
apply_dispatch:
debprint("apply_dispatch");
/* Load in the procedure's definition and decide whether it's a compound
* procedure or a primitive procedure.
*/
#ifdef OBJECTS
extern NODE* procValueWithParent(NODE*, NODE*, NODE**);
NODE* parent = (NODE*)0;
if (NIL == usual_parent)
usual_parent = current_object;
#ifdef DEB_USUAL_PARENT
dbUsual("evalProcValue BEFORE");
#endif
proc = procValueWithParent(fun,
usual_parent,
&parent);
if (proc != UNDEFINED && parent != 0){
usual_parent = parent;
#ifdef DEB_USUAL_PARENT
dbUsual("evalProcValue AFTER");
#endif
}
#else
proc = procnode__caseobj(fun);
#endif
if (is_macro(fun)) {
num2save(val_status,tailcall);
save2(didnt_get_output,current_unode);
didnt_get_output = the_generation; /* (cons nil nil) */
/* We want a value, but not as actual arg */
newcont(macro_return);
}
#ifdef OBJECTS
if (proc == UNDEFINED) { /* for usual.foo support */
/* The function(fun) may be of the form usual.foo, in which case
* "usual." should be stripped away, and "foo" should be
* resolved in the parent(s) of the current object
*/
extern NODE *parent_list(NODE *obj);
NODE *string = cnv_node_to_strnode(fun);
// first rule out all words shorter than 8 chars
if (getstrlen(string) > 6) {
// check to see if name begins with "usual."
if (!low_strncmp(getstrptr(string), "usual.", 6)){
usual_caller = current_object;
NODE* parent = NIL;
#ifdef DEB_USUAL_PARENT
dbUsual("eval BEFORE");
#endif
proc = getInheritedProcWithParentList(intern(
make_strnode(getstrptr(string) + 6,
getstrhead(string),
getstrlen(string) - 6,
nodetype(string),
strnzcpy)),
usual_parent,
&parent);
// if a proc was found, usual_parent needs to be updated
// to avoid infinite loops when usual is called multiple times
if (proc != UNDEFINED) {
usual_parent = parent;
#ifdef DEB_USUAL_PARENT
dbUsual("eval AFTER");
#endif
}
}
}
}
#endif
if (proc == UNDEFINED) { /* 5.0 punctuationless variables */
if (!varTrue(AllowGetSet)) { /* No getter/setter allowed, punt */
val = err_logo(DK_HOW, fun);
goto fetch_cont;
} else if (argl == NIL) { /* possible var getter */
val = valnode__caseobj(fun);
if (val == UNBOUND && NOT_THROWING)
val = err_logo(DK_HOW, fun);
else if (val != UNBOUND) {
(void)ldefine(cons(fun, cons(
cons(NIL,cons(cons(theName(Name_output),
cons(make_colon(fun),NIL)),
NIL)),
NIL))); /* make real proc so no disk load next time */
setflag__caseobj(fun,PROC_BURIED);
}
goto fetch_cont;
} else { /* var setter */
NODE *name = intern(bf3(fun));
if (valnode__caseobj(name) == UNBOUND &&
!(flag__caseobj(name, (HAS_GLOBAL_VALUE|IS_LOCAL_VALUE)))) {
val = err_logo(DK_HOW, fun);
goto fetch_cont;
}
(void)ldefine(cons(fun, cons(
cons(Listvalue,
cons(cons(Make,
cons(make_quote(bf3(fun)),
cons(Dotsvalue,NIL))),
NIL))
,NIL)));
setflag__caseobj(fun,PROC_BURIED);
argl = cons(bf3(fun), argl);
if (NOT_THROWING)
val = lmake(argl);
goto fetch_cont;
}
}
if (is_list(proc)) goto compound_apply;
/* primitive_apply */
debprint("primitive_apply");
if (NOT_THROWING) {
if ((tracing = flag__caseobj(fun, PROC_TRACED))) {
for (i = 0; i < trace_level; i++) {
print_space(stdout);
}
ndprintf(stdout, "( %s ", fun);
if (argl != NIL) {
arg = argl;
while (arg != NIL) {
print_node(stdout, maybe_quote(car(arg)));
print_space(stdout);
arg = cdr(arg);
}
}
print_char(stdout, ')');
new_line(stdout);
}
val = (*getprimfun(proc))(argl);
if (tracing && NOT_THROWING) {
for (i = 0; i < trace_level; i++) {
print_space(stdout);
}
print_node(stdout, fun);
if (val == UNBOUND)
ndprintf(stdout, " %t\n", message_texts[TRACE_STOPS]);
else {
ndprintf(stdout, " %t %s\n", message_texts[TRACE_OUTPUTS],
maybe_quote(val));
}
}
} else
val = UNBOUND;
/* falls into fetch_cont */
#if DEB_CONT
#define do_case(x) case x: debprint("Fetch_cont = " #x); goto x;
#else
#define do_case(x) case x: goto x;
#endif
fetch_cont:
{
#ifdef USE_GCC_DISPATCH
#define do_label(x) &&x,
static void *dispatch[] = {
do_list(do_label)
0
};
#endif
enum labels x = (enum labels)cont;
cont = (FIXNUM)car(numstack);
numstack=cdr(numstack);
#ifdef USE_GCC_DISPATCH
if (x >= NUM_TOKENS)
abort();
goto *dispatch[x];
#else
switch (x) {
do_list(do_case)
default: abort();
}
#endif
}
/* ----------------- COMPOUND_APPLY ---------------------------------- */
compound_apply:
debprint("compound_apply");
#ifdef mac
check_mac_stop();
#endif
#ifdef ibm
check_ibm_stop();
#endif
#ifdef HAVE_WX
check_wx_stop(0, 0);
#endif
if ((tracing = flag__caseobj(fun, PROC_TRACED))) {
for (i = 0; i < trace_level; i++) print_space(writestream);
trace_level++;
ndprintf(writestream, "( %s ", fun);
}
/* Bind the actuals to the formals */
lambda_apply:
vsp = var_stack; /* remember where we came in */
for (formals = formals__procnode(proc);
formals != NIL;
formals = cdr(formals)) {
parm = car(formals);
if (nodetype(parm) == INT) break; /* default # args */
if (argl != NIL) {
arg = car(argl);
if (tracing) {
print_node(writestream, maybe_quote(arg));
print_space(writestream);
}
} else
arg = UNBOUND;
if (nodetype(parm) == CASEOBJ) {
if (not_local(parm,vsp)) {
push(parm, var_stack);
if (flag__caseobj(parm, IS_LOCAL_VALUE))
settype(var_stack, LOCALSAVE);
var_stack->n_obj = valnode__caseobj(parm);
setflag__caseobj(parm, IS_LOCAL_VALUE);
}
tell_shadow(parm);
setvalnode__caseobj(parm, arg);
if (arg == UNBOUND)
err_logo(NOT_ENOUGH, fun);
} else if (nodetype(parm) == CONS) {
/* parm is optional or rest */
if (not_local(car(parm),vsp)) {
push(car(parm), var_stack);
if (flag__caseobj(car(parm), IS_LOCAL_VALUE))
settype(var_stack, LOCALSAVE);
var_stack->n_obj = valnode__caseobj(car(parm));
setflag__caseobj(car(parm), IS_LOCAL_VALUE);
}
tell_shadow(car(parm));
if (cdr(parm) == NIL) { /* parm is rest */
setvalnode__caseobj(car(parm), argl);
if (tracing) {
if (argl != NIL) pop(argl);
while (argl != NIL) {
arg = car(argl);
print_node(writestream, maybe_quote(arg));
print_space(writestream);
pop(argl);
}
} else argl = NIL;
break;
}
if (arg == UNBOUND) { /* use default */
eval_save();
save(current_unode);
var = var_stack;
tailcall = -1;
list = cdr(parm);
didnt_get_output = cons_list(0, fun, ufun,
list, END_OF_LIST);
didnt_output_name = NIL;
if (NOT_THROWING)
make_tree(list);
else
list = NIL;
if (!is_tree(list)) {
val = UNBOUND;
goto set_args_continue;
}
unev = tree__tree(list);
val = UNBOUND;
expresn = car(unev);
pop(unev);
if (unev != NIL) {
err_logo(BAD_DEFAULT, parm);
val = UNBOUND;
goto set_args_continue;
}
newcont(set_args_continue);
goto eval_dispatch;
set_args_continue:
if (stopping_flag == MACRO_RETURN) {
if (val == NIL || val == UNBOUND || cdr(val) != NIL) {
if (NOT_THROWING)
err_logo((val!=NIL && val!=UNBOUND) ?
RUNNABLE_ARG : ERR_MACRO, val);
} else {
reset_args(var);
expresn = car(val);
stopping_flag = RUN;
didnt_get_output = cons_list(0, fun, ufun,
list, END_OF_LIST);
didnt_output_name = NIL;
tailcall = -1;
newcont(set_args_continue);
goto eval_dispatch;
}
}
restore(current_unode);
last_call = fun;
if (current_unode != output_unode) {
if (STOPPING || RUNNING) output_node = UNBOUND;
if (stopping_flag == OUTPUT || STOPPING) {
stopping_flag = RUN;
val = output_node;
}
}
if (stopping_flag == OUTPUT || STOPPING) {
didnt_output_name = NIL;
err_logo(DIDNT_OUTPUT, fun);
}
while (NOT_THROWING && val == UNBOUND) {
val = err_logo(DIDNT_OUTPUT, NIL);
}
reset_args(var);
eval_restore();
parm = car(formals);
if (stopping_flag == THROWING) {
val = UNBOUND;
goto fetch_cont;
}
arg = val;
}
setvalnode__caseobj(car(parm), arg);
}
if (argl != NIL) pop(argl);
}
if (argl != NIL) {
err_logo(TOO_MUCH, fun);
}
if (check_throwing) {
val = UNBOUND;
goto fetch_cont;
}
vsp = NIL;
if ((tracing = !is_list(fun) && flag__caseobj(fun, PROC_TRACED))) {
if (NOT_THROWING) print_char(writestream, ')');
new_line(writestream);
save(fun);
newcont(compound_apply_continue);
}
last_ufun = ufun;
if (!is_list(fun)) ufun = fun;
last_line = this_line;
this_line = NIL;
/* proc = (is_list(fun) ? anonymous_function(fun) : procnode__caseobj(fun)); */
/* If that's uncommented, begin_apply must get proc from fun, not expresn */
list = bodylist__procnode(proc); /* get the body ... */
make_tree_from_body(list);
if (!is_tree(list) || treepair__tree(list)==NIL) {
val = UNBOUND;
goto fetch_cont;
}
debprint("treeified body");
/* printf("list = 0x%x = ",list); dbprint(list); */
unev = tree__tree(list);
if (NOT_THROWING) stopping_flag = RUN;
output_node = UNBOUND;
if (didnt_get_output == UNBOUND)
val_status = NO_VALUE_OK | STOP_OK | STOP_TAIL;
else if (didnt_get_output == NIL)
val_status = NO_VALUE_OK | STOP_OK | STOP_TAIL |
OUTPUT_OK | OUTPUT_TAIL;
else val_status = OUTPUT_OK | OUTPUT_TAIL;
if (didnt_output_name == NIL) didnt_output_name = fun;
current_unode = cons(NIL,NIL); /* a marker for this proc call */
/* ----------------- EVAL_SEQUENCE ---------------------------------- */
/* Fall through from proc body, call from start or fsubr argument */
eval_sequence:
debprint("eval_sequence");
/* Evaluate each expression in the sequence.
Most of the complexity is in recognizing tail calls.
*/
if (eval_buttonact != NIL) {
make_tree(eval_buttonact);
if (NOT_THROWING) {
if (is_tree(eval_buttonact)) {
unev = append(tree__tree(eval_buttonact), unev);
eval_buttonact = NIL;
}
}
}
if (!RUNNING) goto fetch_cont;
if (nodetype(unev) == LINE) {
if (the_generation != (generation__line(unev))) {
/* something redefined while we're running */
int linenum = 0;
this_line = tree__tree(bodylist__procnode(proc));
while (this_line != unev) {
/* If redef isn't end of line, don't try to fix,
but don't blow up either. (Maybe not called from here.) */
if (this_line == NULL) goto nofix;
if (nodetype(this_line) == LINE) linenum++;
this_line = cdr(this_line);
}
untreeify_proc(proc);
make_tree_from_body(bodylist__procnode(proc));
unev = tree__tree(bodylist__procnode(proc));
while (--linenum >= 0) {
do pop(unev);
while (unev != NIL && nodetype(unev) != LINE);
}
}
nofix: this_line = unparsed__line(unev);
if (ufun != NIL && flag__caseobj(ufun, PROC_STEPPED)) {
if (tracing) {
int i = 1;
while (i++ < trace_level) print_space(stdout);
}
print_node(stdout, this_line);
(void)reader(stdin, " >>> ");
}
}
expresn = car(unev);
pop(unev);
if (expresn != NIL &&
is_list(expresn) && (is_tailform(procnode__caseobj(car(expresn))))) {
i = (int)getprimpri(procnode__caseobj(car(expresn)));
if (i == OUTPUT_PRIORITY) {
if (cadr(expresn) == Not_Enough_Node) {
err_logo(NOT_ENOUGH,car(expresn));
val = UNBOUND;
goto fetch_cont;
}
didnt_output_name = NIL;
if (val_status & OUTPUT_TAIL) {
didnt_get_output = cons_list(0,car(expresn),ufun,this_line,
END_OF_LIST);
fun = car(expresn);
expresn = cadr(expresn);
val_status = VALUE_OK;
goto tail_eval_dispatch;
} else if (val_status & OUTPUT_OK) {
goto tail_eval_dispatch;
} else if (ufun == NIL) {
err_logo(AT_TOPLEVEL,car(expresn));
val = UNBOUND;
goto fetch_cont;
} else if (val_status & STOP_OK) {
didnt_get_output = cons_list(0,car(expresn),ufun,this_line,
END_OF_LIST);
val_status = VALUE_OK;
expresn = cadr(expresn);
newcont(op_want_stop);
goto eval_dispatch;
op_want_stop:
if (NOT_THROWING) err_logo(DK_WHAT_UP, val);
goto fetch_cont;
} else if (val_status & VALUE_OK) {
/* pr apply [output ?] [3] */
debprint("Op with VALUE_OK");
didnt_output_name = fun;
goto tail_eval_dispatch;
} else {
debprint("Op with none of the above");
goto tail_eval_dispatch;
}
} else if (i == STOP_PRIORITY) {
if (ufun == NIL) {
err_logo(AT_TOPLEVEL,car(expresn));
} else if (val_status & STOP_TAIL) {
} else if (val_status & STOP_OK) {
stopping_flag = STOP;
output_unode = current_unode;
} else if (val_status & OUTPUT_OK) {
if (NOT_THROWING) {
if (didnt_get_output == NIL || didnt_get_output == UNBOUND) {
/* actually can happen: PRINT FOREACH ...