-
Notifications
You must be signed in to change notification settings - Fork 3
/
quartet.c
1721 lines (1589 loc) · 54.4 KB
/
quartet.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
/*
* quartet.c -- Hosted imperative stack-oriented actor machine
* Copyright 2014-2022 Dale Schumacher, Tristan Slominski
*/
/**
Program source is provided as a stream of _words_
(whitespace separated in text format).
If the word parses as a _number_
the value is pushed on the data _stack_.
Otherwise the word is looked up in the current _dictionary_.
If the associated value is a _block_ it is executed,
otherwise the value is pushed on the data _stack_.
The data _stack_ holds parameters for executing blocks
and their return values.
Some blocks also consume words from the source stream.
An actor's behavior is described with a _block_.
The message received by the actor is the contents of the data stack.
The `SEND` primitive sends the current stack contents,
clearing the stack.
Values may be saved in the dictionary
by binding them to a word.
All dictionary changes are local to the executing behavior.
See further [https://github.com/organix/mycelia/blob/master/quartet.md]
**/
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <stdint.h> // for intptr_t, uintptr_t, uint8_t, uint16_t, etc.
#include <inttypes.h> // for PRIiPTR, PRIuPTR, PRIXPTR, etc.
#include <ctype.h>
#define DEBUG(x) // include/exclude debug instrumentation
#define XDEBUG(x) x // include/exclude extra debugging
#define INT_T_32B 0 // universal Integer is 32 bits wide
#define INT_T_64B 1 // universal Integer is 64 bits wide
#define ALLOW_DMA 1 // define words for direct memory access
// universal Integer type (32/64-bit signed 2's-complement)
typedef intptr_t int_t;
#define INT(n) ((int_t)(n))
// universal Natural type (32/64-bit unsigned 2's-complement)
typedef uintptr_t nat_t;
#define NAT(n) ((nat_t)(n))
// universal Data Pointer type (32/64-bit machine address)
typedef void * ptr_t;
#define PTR(n) ((ptr_t)(n))
// Procedure declaration
#define PROC_DECL(name) int_t name(int_t self)
// tagged types
#define TAG_MASK INT(3)
#define TAG_NUM INT(0)
#define TAG_WORD INT(1)
#define TAG_BLOCK INT(2)
#define TAG_PROC INT(3)
// tagged type predicates
#define IS_NUM(x) (((x) & TAG_MASK) == TAG_NUM)
#define IS_WORD(x) (((x) & TAG_MASK) == TAG_WORD)
#define IS_BLOCK(x) (((x) & TAG_MASK) == TAG_BLOCK)
#define IS_PROC(x) (((x) & TAG_MASK) == TAG_PROC)
// tagged type constructors
#define MK_NUM(x) INT(NAT(x) << 2)
#define MK_WORD(x) INT(NAT(x) | TAG_WORD)
#define MK_BLOCK(x) INT(NAT(x) | TAG_BLOCK)
#define MK_PROC(x) INT(PTR(x) + TAG_PROC)
// tagged type conversions
#define TO_INT(x) (INT(x) >> 2)
#define TO_NAT(x) (NAT(x) >> 2)
#define TO_PTR(x) PTR(NAT(x) & ~TAG_MASK)
// universal Boolean constants
#define TRUE MK_NUM(-1)
#define FALSE MK_NUM(0)
#define MK_BOOL(x) ((x) ? TRUE : FALSE)
// universal Infinity
#define INF MK_NUM(TO_INT(~(NAT(-1)>>1)))
#define NEG(n) MK_NUM(-TO_INT(n))
#define ADD(n,m) ((n)+(m))
#define SUB(n,m) ((n)-(m))
#define MUL(n,m) MK_NUM(TO_INT(n)*TO_INT(m))
#define CMP(n,m) ((n)-(m))
#define LTZ(n) (((n)<0)?TRUE:FALSE)
#define EQZ(n) (((n)==0)?TRUE:FALSE)
#define GTZ(n) (((n)>0)?TRUE:FALSE)
#define NOT(n) MK_NUM(~TO_NAT(n))
#define AND(n,m) ((n)&(m))
#define IOR(n,m) ((n)|(m))
#define XOR(n,m) ((n)^(m))
#define LSL(n,m) ((NAT(n)<<TO_INT(m)) & ~TAG_MASK)
#define LSR(n,m) ((NAT(n)>>TO_INT(m)) & ~TAG_MASK)
#define ASR(n,m) ((INT(n)>>TO_INT(m)) & ~TAG_MASK)
typedef struct block {
int_t proc; // execution behavior
nat_t len; // number of int_t in data[]
int_t data[]; // addressable memory
} block_t;
typedef struct env {
int_t proc; // execution behavior
int_t value; // .data[0] = bound value
int_t word; // .data[1] = variable name
struct env *env; // .data[2] = parent environment
} env_t;
typedef struct closure {
int_t proc; // execution behavior
nat_t cnt; // .data[0] = number of words
int_t *ptr; // .data[1] = word address in block
env_t *env; // .data[2] = parent environment
} closure_t;
typedef struct context {
int_t proc; // execution behavior
nat_t cnt; // .data[0] = next_value_cnt
int_t *ptr; // .data[1] = next_value_ptr
env_t *env; // .data[2] = dynamic environment
} context_t;
#define MAX_NAME_SZ (4 * sizeof(int_t)) // word buffer size
typedef struct word {
int_t proc; // execution behavior
int_t value; // .data[0] = bound value
int_t word; // .data[1] = variable name
env_t *env; // .data[2] = parent environment
char name[MAX_NAME_SZ]; // NUL-terminated string
} word_t;
#define CACHE_LINE_SZ (sizeof(word_t)) // bytes per idealized cache line
#define VMEM_PAGE_SZ ((size_t)1 << 12) // bytes per idealized memory page
typedef struct actor {
int_t proc; // execution behavior
int_t beh; // .data[0] = behavior (block/closure)
//int_t *ptr; // .data[1] = word address in block
//env_t *env; // .data[2] = parent environment
} actor_t;
/*
* error handling
*/
int_t panic(char *reason) {
fprintf(stderr, "\nPANIC! %s\n", reason);
exit(-1);
return FALSE; // not reached, but typed for easy swap with error()
}
int_t error(char *reason) {
fprintf(stderr, "\nERROR! %s\n", reason);
return FALSE;
}
/*
* printing utilities
*/
PROC_DECL(prim_Block); // FORWARD DECLARATION
PROC_DECL(prim_Closure); // FORWARD DECLARATION
PROC_DECL(prim_Actor); // FORWARD DECLARATION
PROC_DECL(prim_Environment) { return panic("Environment can not be executed"); }
PROC_DECL(prim_Context) { return panic("Context can not be executed"); }
#define IS_ACTOR(x) (IS_BLOCK(x) && (((block_t *)TO_PTR(x))->proc == MK_PROC(prim_Actor)))
PROC_DECL(prim_Undefined) { return error("undefined procedure"); }
#define UNDEFINED MK_PROC(prim_Undefined)
void print_ascii(int_t code) {
if ((code & 0x7F) == code) { // code is in ascii range
putchar(code);
}
}
void print_block(nat_t len, int_t *data); // FORWARD DECLARATION
void print_closure(closure_t *scope); // FORWARD DECLARATION
void print_actor(actor_t *act); // FORWARD DECLARATION
void print_value(int_t value) {
if (IS_NUM(value)) {
if (value == INF) {
printf("INF");
} else {
printf("%"PRIdPTR, TO_INT(value));
}
} else if (IS_WORD(value)) {
word_t *w = TO_PTR(value);
printf("%s", w->name);
} else if (IS_BLOCK(value)) {
block_t *blk = TO_PTR(value);
if (blk->proc == MK_PROC(prim_Block)) {
print_block(blk->len, blk->data);
} else if (blk->proc == MK_PROC(prim_Closure)) {
print_closure(TO_PTR(value));
} else if (blk->proc == MK_PROC(prim_Actor)) {
print_actor(TO_PTR(value));
} else {
printf("^[%p]", TO_PTR(blk->proc));
}
} else if (value == UNDEFINED) {
printf("(UNDEFINED)");
} else {
printf("%p", TO_PTR(value));
}
//print_ascii(' ');
//print_ascii('\n');
fflush(stdout);
}
static char *tag_label[] = { "NUM", "WORD", "BLOCK", "PROC" };
static void debug_value(char *label, int_t value) {
fprintf(stderr, "%s:", label);
fprintf(stderr, " %"PRIXPTR"", value);
fprintf(stderr, " t=%s", tag_label[value & TAG_MASK]);
fprintf(stderr, " i=%"PRIdPTR"", TO_INT(value));
//fprintf(stderr, " n=%"PRIuPTR"", TO_NAT(value));
//fprintf(stderr, " p=%p", TO_PTR(value));
if (IS_WORD(value)) {
word_t *w = TO_PTR(value);
fprintf(stderr, " s=\"%s\"", w->name);
//fprintf(stderr, " v=%"PRIXPTR"", w->value);
}
if (IS_BLOCK(value)) {
block_t *blk = TO_PTR(value);
if (blk->proc == MK_PROC(prim_Block)) {
fprintf(stderr, " [%"PRIuPTR"]", blk->len);
} else if (blk->proc == MK_PROC(prim_Closure)) {
closure_t *scope = TO_PTR(value);
fprintf(stderr, " [%"PRIuPTR"] env=%p", scope->cnt, scope->env);
} else if (blk->proc == MK_PROC(prim_Actor)) {
actor_t *act = TO_PTR(value);
fflush(stderr);
printf(" beh=");
print_value(act->beh);
fflush(stdout);
} else {
fprintf(stderr, " [...]");
}
}
fprintf(stderr, "\n");
fflush(stderr);
}
#if INT_T_32B
static void hexdump(char *label, int_t *addr, size_t cnt) {
fprintf(stderr, "%s: %04"PRIxPTR"..", label, (NAT(addr) >> 16));
for (nat_t n = 0; n < cnt; ++n) {
if ((n & 0x7) == 0x0) {
fprintf(stderr, "\n..%04"PRIxPTR":", (NAT(addr) & 0xFFFF));
}
fprintf(stderr, " %08"PRIXPTR"", NAT(*addr++) & 0xFFFFFFFF);
}
fprintf(stderr, "\n");
}
#endif // INT_T_32B
#if INT_T_64B
static void hexdump(char *label, int_t *addr, size_t cnt) {
fprintf(stderr, "%s: %08"PRIxPTR"..", label, (NAT(addr) >> 32));
for (nat_t n = 0; n < cnt; ++n) {
if ((n & 0x3) == 0x0) {
fprintf(stderr, "\n..%08"PRIxPTR":", (NAT(addr) & 0xFFFFFFFF));
}
fprintf(stderr, " %016"PRIXPTR"", NAT(*addr++));
}
fprintf(stderr, "\n");
}
#endif // INT_T_64B
/*
* parsing utilities
*/
int_t read_token(char *buf, size_t buf_sz) {
DEBUG(fprintf(stderr, "> read_token\n"));
char *p = buf;
char *q = p + buf_sz;
DEBUG(fprintf(stderr, " read_token: skip leading whitespace\n"));
int c = getchar();
while ((c <= ' ') || (c == '#') || (c >= 0x7F)) {
if (c == '#') { // comment extends to end of line
DEBUG(fprintf(stderr, " read_token: skip comment to EOL\n"));
while ((c != EOF) && (c != '\n')) {
c = getchar();
}
}
if (c == EOF) {
DEBUG(fprintf(stderr, "< read_token = FALSE (eof)\n"));
return FALSE; // end of file
}
c = getchar();
}
DEBUG(fprintf(stderr, " read_token: gather token characters\n"));
while ((c != EOF) && (c > ' ') && (c < 0x7F)) {
*p++ = c;
if (p >= q) {
return panic("token buffer overflow");
}
c = getchar();
}
*p = '\0'; // NUL-terminate string
DEBUG(fprintf(stderr, "< read_token = TRUE \"%s\"\n", buf));
return TRUE;
}
static char *base36digit = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int_t token_to_number(int_t *value_out, char *s) {
DEBUG(fprintf(stderr, "> token_to_number\n"));
// attempt to parse token as a number
int_t neg = FALSE;
int_t got_base = FALSE;
int_t got_digit = FALSE;
uintptr_t base = 10;
DEBUG(fprintf(stderr, " token_to_number: s=\"%s\"\n", s));
uintptr_t n = 0;
char c = *s++;
if (c == '-') { // remember leading minus
neg = TRUE;
c = *s++;
} else if (c == '+') { // skip leading plus
c = *s++;
}
while (c) {
if (c == '_') { // skip separator
c = *s++;
}
if (!got_base && got_digit && (c == '#')) {
base = n;
if ((base < 2) || (base > 36)) {
DEBUG(fprintf(stderr, "< token_to_number = FALSE (base range)\n"));
return FALSE; // number base out of range
}
got_base = TRUE;
got_digit = FALSE;
n = 0;
c = *s++;
}
char *p = strchr(base36digit, toupper(c));
if (p == NULL) {
DEBUG(fprintf(stderr, "< token_to_number = FALSE (non-digit)\n"));
return FALSE; // non-digit character
}
uintptr_t digit = NAT(p - base36digit);
if (digit >= base) {
DEBUG(fprintf(stderr, "< token_to_number = FALSE (digit range)\n"));
return FALSE; // digit out of range for base
}
n *= base;
n += digit;
got_digit = TRUE;
c = *s++;
}
if (!got_digit) {
DEBUG(fprintf(stderr, "< token_to_number = FALSE (need digits)\n"));
return FALSE; // need at least one digit
}
*value_out = (neg ? -INT(n) : INT(n));
DEBUG(fprintf(stderr, "< token_to_number = TRUE\n"));
return TRUE;
}
/*
* data stack
*/
#define MAX_STACK ((size_t)(128))
int_t data_stack[MAX_STACK];
size_t data_top = 0;
void print_stack() {
for (size_t i = 0; i < data_top; ++i) {
print_value(data_stack[i]);
print_ascii(' ');
}
}
static int_t stack_overflow() { return panic("stack overflow"); }
static int_t stack_underflow() { return error("empty stack"); }
static int_t index_out_of_bounds() { return panic("index out of bounds"); }
int_t data_push(int_t value) {
if (data_top < MAX_STACK) {
data_stack[data_top++] = value;
return TRUE;
}
return stack_overflow();
}
int_t data_pop(int_t *value_out) {
if (data_top > 0) {
*value_out = data_stack[--data_top];
return TRUE;
}
return stack_underflow();
}
int_t data_peek(int_t *value_out) {
if (data_top > 0) {
*value_out = data_stack[data_top - 1];
return TRUE;
}
return stack_underflow();
}
int_t data_pick(int_t *value_out, int n) {
if ((n < 1) || (n > data_top)) {
return index_out_of_bounds();
}
*value_out = data_stack[data_top - n];
return TRUE;
}
int_t data_roll(int n) {
if (n == 0) return TRUE; // no-op
if (n > 0) {
if (n > data_top) {
return index_out_of_bounds();
}
int_t *p = &data_stack[data_top - n];
int_t x = p[0];
while (--n > 0) {
p[0] = p[1];
++p;
}
p[0] = x;
} else { // reverse rotate
n = -n;
if (n > data_top) {
return index_out_of_bounds();
}
int_t *p = &data_stack[data_top - 1];
int_t x = p[0];
while (--n > 0) {
p[0] = p[-1];
--p;
}
p[0] = x;
}
return TRUE;
}
/*
* word dictionary
*/
static int_t undefined_word(int_t word) {
// error on undefined word
print_value(word);
fflush(stdout);
return error("undefined word");
}
PROC_DECL(prim_CREATE);
PROC_DECL(prim_SEND);
PROC_DECL(prim_BECOME);
PROC_DECL(prim_SELF);
PROC_DECL(prim_FAIL);
PROC_DECL(prim_STEP);
PROC_DECL(prim_RUN);
PROC_DECL(prim_Bind);
PROC_DECL(prim_Literal);
PROC_DECL(prim_Lookup);
PROC_DECL(prim_OpenQuote);
PROC_DECL(prim_CloseQuote);
PROC_DECL(prim_OpenUnquote);
PROC_DECL(prim_CloseUnquote);
//PROC_DECL(prim_TRUE);
//PROC_DECL(prim_FALSE);
//PROC_DECL(prim_ZEROP);
PROC_DECL(prim_IF);
PROC_DECL(prim_IF_ELSE);
PROC_DECL(prim_WHILE);
PROC_DECL(prim_DROP);
PROC_DECL(prim_DUP);
PROC_DECL(prim_SWAP);
PROC_DECL(prim_PICK);
PROC_DECL(prim_ROLL);
PROC_DECL(prim_DEPTH);
//PROC_DECL(prim_INF);
PROC_DECL(prim_NEG);
PROC_DECL(prim_ADD);
PROC_DECL(prim_SUB);
PROC_DECL(prim_MUL);
PROC_DECL(prim_DIVMOD);
PROC_DECL(prim_FMA);
PROC_DECL(prim_CMP);
PROC_DECL(prim_LTZ);
PROC_DECL(prim_EQZ);
PROC_DECL(prim_GTZ);
PROC_DECL(prim_NOT);
PROC_DECL(prim_AND);
PROC_DECL(prim_IOR);
PROC_DECL(prim_XOR);
PROC_DECL(prim_LSL);
PROC_DECL(prim_LSR);
PROC_DECL(prim_ASR);
#if ALLOW_DMA
PROC_DECL(prim_Load);
PROC_DECL(prim_Store);
PROC_DECL(prim_LoadAtomic);
PROC_DECL(prim_StoreAtomic);
PROC_DECL(prim_DUMP);
#endif
PROC_DECL(prim_WORDS);
PROC_DECL(prim_USAGE);
PROC_DECL(prim_EMIT);
PROC_DECL(prim_PrintStack);
PROC_DECL(prim_PrintDebug);
PROC_DECL(prim_Print);
#define MAX_WORDS ((size_t)(128))
word_t word_list[MAX_WORDS] = {
{ .value = MK_PROC(prim_CREATE), .name = "CREATE" },
{ .value = MK_PROC(prim_SEND), .name = "SEND" },
{ .value = MK_PROC(prim_BECOME), .name = "BECOME" },
{ .value = MK_PROC(prim_SELF), .name = "SELF" },
{ .value = MK_PROC(prim_FAIL), .name = "FAIL" },
{ .value = MK_PROC(prim_STEP), .name = "STEP" },
{ .value = MK_PROC(prim_RUN), .name = "RUN" },
{ .value = MK_PROC(prim_Bind), .name = "=" },
{ .value = MK_PROC(prim_Literal), .name = "'" },
{ .value = MK_PROC(prim_Lookup), .name = "@" },
{ .value = MK_PROC(prim_OpenQuote), .name = "[" },
{ .value = MK_PROC(prim_CloseQuote), .name = "]" },
{ .value = MK_PROC(prim_OpenUnquote), .name = "(" },
{ .value = MK_PROC(prim_CloseUnquote), .name = ")" },
{ .value = TRUE, .name = "TRUE" },
{ .value = FALSE, .name = "FALSE" },
{ .value = MK_PROC(prim_EQZ), .name = "ZERO?" },
{ .value = MK_PROC(prim_IF), .name = "IF" },
{ .value = MK_PROC(prim_IF_ELSE), .name = "IF-ELSE" },
{ .value = MK_PROC(prim_WHILE), .name = "WHILE" },
{ .value = MK_PROC(prim_DROP), .name = "DROP" },
{ .value = MK_PROC(prim_DUP), .name = "DUP" },
{ .value = MK_PROC(prim_SWAP), .name = "SWAP" },
{ .value = MK_PROC(prim_PICK), .name = "PICK" },
{ .value = MK_PROC(prim_ROLL), .name = "ROLL" },
{ .value = MK_PROC(prim_DEPTH), .name = "DEPTH" },
{ .value = INF, .name = "INF" },
{ .value = MK_PROC(prim_NEG), .name = "NEG" },
{ .value = MK_PROC(prim_ADD), .name = "ADD" },
{ .value = MK_PROC(prim_SUB), .name = "SUB" },
{ .value = MK_PROC(prim_MUL), .name = "MUL" },
{ .value = MK_PROC(prim_DIVMOD), .name = "DIVMOD" },
{ .value = MK_PROC(prim_FMA), .name = "FMA" },
{ .value = MK_PROC(prim_SUB), .name = "COMPARE" },
{ .value = MK_PROC(prim_LTZ), .name = "LT?" },
{ .value = MK_PROC(prim_EQZ), .name = "EQ?" },
{ .value = MK_PROC(prim_GTZ), .name = "GT?" },
{ .value = MK_PROC(prim_NOT), .name = "NOT" },
{ .value = MK_PROC(prim_AND), .name = "AND" },
{ .value = MK_PROC(prim_IOR), .name = "OR" },
{ .value = MK_PROC(prim_XOR), .name = "XOR" },
{ .value = MK_PROC(prim_LSL), .name = "LSL" },
{ .value = MK_PROC(prim_LSR), .name = "LSR" },
{ .value = MK_PROC(prim_ASR), .name = "ASR" },
#if ALLOW_DMA
{ .value = MK_PROC(prim_Load), .name = "?" },
{ .value = MK_PROC(prim_Store), .name = "!" },
{ .value = MK_PROC(prim_LoadAtomic), .name = "??" },
{ .value = MK_PROC(prim_StoreAtomic), .name = "!!" },
{ .value = MK_PROC(prim_DUMP), .name = "DUMP" },
#endif
{ .value = MK_PROC(prim_WORDS), .name = "WORDS" },
{ .value = MK_PROC(prim_USAGE), .name = "USAGE" },
{ .value = MK_PROC(prim_EMIT), .name = "EMIT" },
{ .value = MK_PROC(prim_PrintStack), .name = "..." },
{ .value = MK_PROC(prim_PrintDebug), .name = ".?" },
{ .value = MK_PROC(prim_Print), .name = "." },
};
#if ALLOW_DMA
size_t ro_words = 55; // limit of read-only words
size_t rw_words = 55; // limit of read/write words
#else
size_t ro_words = 50; // limit of read-only words
size_t rw_words = 50; // limit of read/write words
#endif
static void debug_word(char *label, int_t word) {
word_t *w = TO_PTR(word);
fprintf(stderr, "%s:", label);
fprintf(stderr, " %p", PTR(w));
fprintf(stderr, " value=%"PRIXPTR"", w->value);
fprintf(stderr, " s=\"%s\"", w->name);
fprintf(stderr, "\n");
fflush(stderr);
}
#if 0
/* this code is an example a range check implemented by a single comparison */
int_t is_word(int_t value) {
// if (NAT(value - INT(word_list)) < sizeof(word_list)) {
if (NAT(value - INT(word_list)) <= (rw_words * sizeof(word_t))) {
return TRUE;
}
return FALSE;
}
#endif
int_t parse_value(int_t *value_out) {
// read token into next available word buffer
word_t *w = &word_list[rw_words];
w->value = UNDEFINED;
char *word_buf = w->name;
if (!read_token(word_buf, MAX_NAME_SZ)) return FALSE;
// attempt to parse token as a number
int_t num = TO_INT(INF);
if (token_to_number(&num, word_buf)) {
*value_out = MK_NUM(num);
} else {
*value_out = MK_WORD(w);
}
DEBUG(debug_value(" parse_value", *value_out));
return TRUE;
}
context_t *next_context = PTR(0);
int_t next_value(int_t *value_out) {
if (next_context) {
DEBUG(fprintf(stderr, " next_value cnt=%"PRIuPTR" ptr=%p env=%p\n",
next_context->cnt, next_context->ptr, next_context->env));
// read from block data
if (next_context->cnt) {
--next_context->cnt;
*value_out = *next_context->ptr++;
DEBUG(debug_value(" next_value", *value_out));
return TRUE;
}
next_context->ptr = PTR(0);
return FALSE; // no more words (in block)
}
// read from input stream
return parse_value(value_out);
}
// convert latest token into new word
int_t create_word(int_t *word_out, int_t word) {
word_t *w = TO_PTR(word);
if (rw_words >= MAX_WORDS) return panic("too many words");
if (w != &word_list[rw_words]) return panic("must create from latest token");
++rw_words; // extend r/w dictionary
word = MK_WORD(w);
DEBUG(debug_word(" create_word", word));
*word_out = word;
return TRUE;
}
// lookup word in entire dictionary, fail if not found.
int_t find_ro_word(int_t *word_out, int_t word) {
word_t *w = TO_PTR(word);
for (size_t n = rw_words; (n-- > 0); ) { // search from _end_ of dictionary
word_t *m = &word_list[n];
if (strcmp(w->name, m->name) == 0) {
word = MK_WORD(m);
DEBUG(debug_word(" ro_word", word));
*word_out = word;
return TRUE;
}
}
return FALSE;
}
// lookup word in entire dictionary, create if not found.
int_t get_ro_word(int_t *word_out, int_t word) {
if (find_ro_word(word_out, word)) return TRUE; // word already exists
return create_word(word_out, word);
}
// lookup word in writable dictionary, fail if not found.
int_t find_rw_word(int_t *word_out, int_t word) {
word_t *w = TO_PTR(word);
for (size_t n = rw_words; (n-- > ro_words); ) { // search from _end_ of dictionary
word_t *m = &word_list[n];
if (strcmp(w->name, m->name) == 0) {
word = MK_WORD(m);
DEBUG(debug_word(" rw_word", word));
*word_out = word;
return TRUE;
}
}
return FALSE;
}
// lookup word in writable dictionary, create if not found.
int_t get_rw_word(int_t *word_out, int_t word) {
if (find_rw_word(word_out, word)) return TRUE; // word already exists
return create_word(word_out, word);
}
// get currently-bound value for word
int_t get_word_value(int_t *value_out, int_t word) {
// find word in current dictionary
DEBUG(debug_word(" get_word_value (word)", word));
int_t norm;
if (!find_ro_word(&norm, word)) return undefined_word(word);
if (norm != word) {
if (next_context) {
XDEBUG(debug_word(" get_word_value (NORM)", norm)); // FIXME: should not happen!
} else {
DEBUG(debug_word(" get_word_value (norm)", norm));
}
word = norm; // use normalized word
}
// find value bound to word
if (next_context) {
DEBUG(fprintf(stderr, " get_word_value cnt=%"PRIuPTR" ptr=%p env=%p\n",
next_context->cnt, next_context->ptr, next_context->env));
// from local dictionary
env_t *env = next_context->env;
while (env) {
if (env->word == word) {
*value_out = env->value;
DEBUG(debug_value(" get_word_value (local)", *value_out));
return TRUE;
}
env = env->env; // follow environment chain
}
}
// from global dictionary
word_t *w = TO_PTR(word);
*value_out = w->value;
DEBUG(debug_value(" get_word_value (global)", *value_out));
return TRUE;
}
int_t new_block(int_t *block_out, nat_t len); // FORWARD
// set currently-bound value for word
int_t set_word_value(int_t word, int_t value) {
// find word in current dictionary
if (!get_rw_word(&word, word)) return undefined_word(word);
DEBUG(debug_word(" set_word_value (word)", word));
if (next_context) {
// bind word in local dictionary
DEBUG(fprintf(stderr, " set_word_value cnt=%"PRIuPTR" ptr=%p env=%p\n",
next_context->cnt, next_context->ptr, next_context->env));
// create local binding
int_t block;
if (!new_block(&block, 4)) return FALSE;
env_t *env = TO_PTR(block);
env->proc = MK_PROC(prim_Environment);
env->word = word;
env->value = value;
// chain environments
env->env = next_context->env;
next_context->env = env;
DEBUG(debug_value(" set_word_value (local)", value));
} else {
// bind word in global dictionary
word_t *w = TO_PTR(word);
w->value = value;
DEBUG(debug_value(" set_word_value (global)", value));
}
return TRUE;
}
/*
* primitive word definitions
*/
#define POP1ARG(arg1) \
int_t arg1; \
if (!data_pop(&arg1)) return FALSE;
#define POP2ARG(arg1, arg2) \
int_t arg1, arg2; \
if (!data_pop(&arg2)) return FALSE; \
if (!data_pop(&arg1)) return FALSE;
#define POP1PUSH1(arg, oper) \
if (data_top < 1) return stack_underflow(); \
int_t arg = data_stack[data_top-1]; \
data_stack[data_top-1] = oper(arg); \
return TRUE;
#define POP2PUSH1(arg1, arg2, oper) \
if (data_top < 2) return stack_underflow(); \
int_t arg1 = data_stack[data_top-2]; \
int_t arg2 = data_stack[data_top-1]; \
--data_top; \
data_stack[data_top-1] = oper(arg1, arg2); \
return TRUE;
#define GET_BLOCK(block) \
int_t block; \
if (!next_value(&block)) return FALSE; \
if (!get_block(block)) return FALSE; \
block = data_stack[--data_top];
int_t interpret(); // FORWARD DECLARATION
int_t compile(); // FORWARD DECLARATION
int_t get_block(int_t value); // FORWARD DECLARATION
int_t exec_value(int_t value); // FORWARD DECLARATION
//PROC_DECL(prim_CREATE) { return error("unimplemented CREATE"); }
//PROC_DECL(prim_SEND) { return error("unimplemented SEND"); }
//PROC_DECL(prim_BECOME) { return error("unimplemented BECOME"); }
//PROC_DECL(prim_SELF) { return error("unimplemented SELF"); }
PROC_DECL(prim_FAIL) { return error("FAIL"); }
//PROC_DECL(prim_STEP) { return error("unimplemented STEP"); }
//PROC_DECL(prim_RUN) { return error("unimplemented RUN"); }
PROC_DECL(prim_Bind) {
POP1ARG(value);
int_t word;
if (!next_value(&word)) return FALSE;
if (!IS_WORD(word)) return error("WORD required");
return set_word_value(word, value);
}
PROC_DECL(prim_Literal) {
int_t word;
if (!next_value(&word)) return FALSE;
if (IS_WORD(word)) {
if (!get_ro_word(&word, word)) return FALSE;
}
return data_push(word);
}
PROC_DECL(prim_Lookup) {
int_t word;
if (!next_value(&word)) return FALSE;
if (!IS_WORD(word)) return error("WORD required");
int_t value;
if (!get_word_value(&value, word)) return FALSE;
return data_push(value);
}
PROC_DECL(prim_OpenQuote) { return error("unexpected ["); }
PROC_DECL(prim_CloseQuote) { return error("unexpected ]"); }
PROC_DECL(prim_OpenUnquote) { return error("unexpected ("); }
PROC_DECL(prim_CloseUnquote) { return error("unexpected )"); }
//PROC_DECL(prim_TRUE) { return data_push(TRUE); }
//PROC_DECL(prim_FALSE) { return data_push(FALSE); }
PROC_DECL(prim_IF) {
POP1ARG(cond);
DEBUG(debug_value(" prim_IF (cond)", cond));
GET_BLOCK(block);
DEBUG(debug_value(" prim_IF (block)", block));
if (cond) {
if (!exec_value(block)) return FALSE;
}
return TRUE;
}
// [ DUP EQ? IF-ELSE [ DROP ' = . ] [ DUP LT? IF [ ' < . ] GT? IF [ ' > . ] ] ] = CMP # n CMP --
PROC_DECL(prim_IF_ELSE) {
POP1ARG(cond);
DEBUG(debug_value(" prim_IF_ELSE (cond)", cond));
GET_BLOCK(cnsq);
DEBUG(debug_value(" prim_IF_ELSE (cnsq)", cnsq));
GET_BLOCK(altn);
DEBUG(debug_value(" prim_IF_ELSE (altn)", altn));
return exec_value(cond ? cnsq : altn);
}
// 5 DUP GT? WHILE [ DUP . 1 SUB DUP GT? ] DROP
PROC_DECL(prim_WHILE) {
POP1ARG(cond);
DEBUG(debug_value(" prim_WHILE (cond)", cond));
GET_BLOCK(block);
DEBUG(debug_value(" prim_WHILE (block)", block));
while (cond) {
if (!exec_value(block)) return FALSE;
if (data_top < 1) return stack_underflow();
cond = data_stack[--data_top]; // pop condition from stack
DEBUG(debug_value(" prim_WHILE (cond...)", cond));
}
return TRUE;
}
PROC_DECL(prim_DROP) {
if (data_top < 1) return stack_underflow();
--data_top;
return TRUE;
}
PROC_DECL(prim_DUP) {
int_t v;
if (!data_pick(&v, 1)) return FALSE;
return data_push(v);
}
PROC_DECL(prim_SWAP) {
POP2ARG(v_2, v_1);
if (!data_push(v_1)) return FALSE;
return data_push(v_2);
}
PROC_DECL(prim_PICK) {
int_t v_n;
POP1ARG(n);
if (!data_pick(&v_n, TO_INT(n))) return FALSE;
return data_push(v_n);
}
PROC_DECL(prim_ROLL) { POP1ARG(n); return data_roll(TO_INT(n)); }
PROC_DECL(prim_DEPTH) { return data_push(MK_NUM(data_top)); }
// [ DEPTH GT? WHILE [ DROP DEPTH GT? ] ] = CLEAR # clear the stack
//PROC_DECL(prim_INF) { return data_push(INF); }
PROC_DECL(prim_NEG) { POP1PUSH1(n, NEG); }
// [ DUP LT? IF [ NEG ] ] = ABS # absolute value
PROC_DECL(prim_ADD) { POP2PUSH1(n, m, ADD); }
PROC_DECL(prim_SUB) { POP2PUSH1(n, m, SUB); }
PROC_DECL(prim_MUL) { POP2PUSH1(n, m, MUL); }
PROC_DECL(prim_DIVMOD) { // n = (m * q) + r
POP2ARG(n, m);
n = TO_INT(n);
m = TO_INT(m);
int_t i = TO_INT(INF);
int_t q = i;
int_t r = n;
if ((n == i) && (m == -1)) {
q = i;
r = 0;
} else if (m != 0) {
q = n / m;
r = n % m;
// FIXME: map to Euclidean Division
// -7 3 DIVMOD -- 2 -3 # now: -1 -2
// -7 -3 DIVMOD -- 2 3 # now: -1 2
// [https://en.wikipedia.org/wiki/Modulo_operation]
}
q = MK_NUM(q);
r = MK_NUM(r);
if (!data_push(r)) return FALSE;
return data_push(q);
}
// n m DIVMOD m FMA -- n # Check Euclidean Division
PROC_DECL(prim_FMA) {
POP1ARG(a);
POP1ARG(b);
POP1ARG(c);
int_t x = TO_INT(a) * TO_INT(b) + TO_INT(c);
return data_push(MK_NUM(x));
}
PROC_DECL(prim_CMP) { POP2PUSH1(n, m, CMP); }
PROC_DECL(prim_LTZ) { POP1PUSH1(n, LTZ); }
PROC_DECL(prim_EQZ) { POP1PUSH1(n, EQZ); }
PROC_DECL(prim_GTZ) { POP1PUSH1(n, GTZ); }
PROC_DECL(prim_NOT) { POP1PUSH1(n, NOT); }
PROC_DECL(prim_AND) { POP2PUSH1(n, m, AND); }
PROC_DECL(prim_IOR) { POP2PUSH1(n, m, IOR); }
PROC_DECL(prim_XOR) { POP2PUSH1(n, m, XOR); }
PROC_DECL(prim_LSL) { POP2PUSH1(n, m, LSL); }
PROC_DECL(prim_LSR) { POP2PUSH1(n, m, LSR); }
PROC_DECL(prim_ASR) { POP2PUSH1(n, m, ASR); }
// direct memory access
#if ALLOW_DMA
PROC_DECL(prim_Load) {
POP1ARG(addr);
int_t *ptr = TO_PTR(TO_INT(addr));
return data_push(MK_NUM(*ptr));
}
PROC_DECL(prim_Store) {
POP2ARG(value, addr);
int_t *ptr = TO_PTR(TO_INT(addr));
*ptr = TO_INT(value);
return TRUE;
}
PROC_DECL(prim_LoadAtomic) { return prim_Load(self); }
PROC_DECL(prim_StoreAtomic) { return prim_Store(self); }
PROC_DECL(prim_DUMP) {
POP2ARG(addr, cnt);
hexdump("hexdump", TO_PTR(TO_INT(addr)), TO_NAT(cnt));
return TRUE;
}
#endif
// interactive extentions
PROC_DECL(prim_WORDS) {
size_t i;
printf("ro:");
for (i = 0; i < ro_words; ++i) {
print_ascii(' ');
print_value(MK_WORD(&word_list[i]));
}
print_ascii('\n');
if (ro_words < rw_words) {
printf("rw:");
for (i = ro_words; i < rw_words; ++i) {
print_ascii(' ');
print_value(MK_WORD(&word_list[i]));
}
print_ascii('\n');
}
fflush(stdout);
return TRUE;
}
PROC_DECL(prim_EMIT) {
POP1ARG(code);
print_ascii(TO_INT(code));
return TRUE;
}
PROC_DECL(prim_PrintStack) {
print_stack();
fflush(stdout);
return TRUE;
}
PROC_DECL(prim_PrintDebug) {