This repository has been archived by the owner on Nov 9, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 11
/
codegen.rkt
1523 lines (1348 loc) · 60.1 KB
/
codegen.rkt
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
#lang typed/racket
(require typed/racket/unsafe)
(require (submod "types.rkt" abstract-machine))
(require (submod "types.rkt" evm-assembly))
(require "types.rkt")
(require "utils.rkt")
(require "ast.rkt")
(require "globals.rkt")
(require racket/list)
(require (submod "typed.rkt" binaryio))
(provide ;codegen
;codegen-list
(all-defined-out)
(all-from-out 'constants)
(all-from-out (submod "types.rkt" evm-assembly)))
#|
-- Registers -> Stack --
The abstract machine uses 6 256-bit virtual registers
* env: &(0 * WORD)
* proc: &(1 * WORD)
* continue: &(2 * WORD)
* argl: &(3 * WORD)
* val: &(4 * WORD)
* stack-size: &(5 * WORD)
Addresses have 8-bit granularity, so we multiply by WORD so they don't overlap.
Arguments to primitive procedures are passed on the stack. The first argument is the first stack entry.
Arguments to compiled procedures are passed in a linked list through the argl register.
-- Runtime Representation --
General Scheme objects must be "boxed" into a pointer.
Unboxed numbers could also be manipulated, but cannot be queried for their type and have no memory address.
In particular, unboxed numbers cannot be returned as the final program result, because RETURN acts on memory.
Boolean values are unboxed, since they are usually immediately consumed. They can be explicitly boxed if necessary.
Boxed values are pointers to a tag. Depending on the tag, additional data follows:
* 0: Fixnum: 1 word - The number's value
* 1: Symbol: 1 word - 32 8-bit ASCII characters
* 2: Compiled Procedure: 2 words - A code pointer, and closure environment pointer
* 3: Primitive Procedure: 1 word - A code pointer
* 4: Pair: 2 words - Pointer to first element, pointer to second element
* 5: Vector: 1 + n words - A size n, followed by n pointers to individual elements
* 6: Null: 0 words - Only the tag is used.
* 7: Continuation: 3 words - continue register, env register, and stack vector
* 8: Frame: 2 words - Pointer to names, pointer to values
* 9: Environment: 2 words - Pointer to frame, pointer to enclosing environment
* 10: Character 1 word - The Unicode codepoint for the character
Additionally, there are derived objects used in the standard library:
* List: Null | (pair X List)
-- Assembly --
Some procedures are written in EVM assembly. To help validate them, they are annotated as follows:
* Arguments are first-to-last on the stack.
* Each line is annotated with the expected stack difference from the method beginning.
* A goto must arrive on a line with the same stack size.
* A branch pops one element, and then arrives on a line with the same stack size.
* The procedure must terminate with a stack size of 0
-- Primitive operations --
There is a standard library of primitive operations.
* Primitive operations are used by the abstract machine code.
* Some primitive operations are inlined. Their linkage is implicitly 'next.
* Others have a single copy placed near the start of the program. It costs 2 additional JUMP instructions.
-- Optimizations --
These optimizations are currently unimplemented:
* Values that are allocated and used within a lexical scope should not have infinite extent. Roll back the allocator pointer.
* Continuations
-- Constants --
* Integers are converted into push instructions.
* Quotes are always variable names. Labels have their own classification in MExpr.
* Quotes are converted into 256-bit integers by treating up to 32 characters as 8-bit ASCII.
* Lists emits a series of (cons) calls corresponding to the elements.
|#
(define-namespace-anchor *asm-anchor*)
; To avoid excessive inlining, a single copy of these is emitted.
(define *label-op-lookup-variable-value* (make-label 'op-lookup-variable-value))
(define *label-op-define-variable!* (make-label 'op-define-variable!))
(define *label-op-set-variable-value!* (make-label 'op-set-variable!))
(define *label-op-return* (make-label 'op-return))
(define *label-op-restore-continuation* (make-label 'op-restore-continuation))
(define *label-op-primitive-procedure?* (make-label 'op-primitive-procedure?))
(define *label-op-compiled-procedure?* (make-label 'op-compiled-procedure?))
(define *label-op-continuation?* (make-label 'op-primitive-procedure?))
(module constants typed/racket
(provide (all-defined-out))
(define TAG-FIXNUM 0)
(define TAG-SYMBOL 1)
(define TAG-COMPILED-PROCEDURE 2)
(define TAG-PRIMITIVE-PROCEDURE 3)
(define TAG-PAIR 4)
(define TAG-VECTOR 5)
(define TAG-NIL 6)
(define TAG-CONTINUATION 7)
(define TAG-FRAME 8)
(define TAG-ENVIRONMENT 9)
(define TAG-CHARACTER 10)
(define MEM-ENV #x00)
(define MEM-PROC #x20)
(define MEM-CONTINUE #x40)
(define MEM-ARGL #x60)
(define MEM-VAL #x80)
(define MEM-STACK-SIZE #xa0)
(define MEM-NIL #xc0)
(define MEM-ALLOCATOR #xe0)
(define MEM-DYNAMIC-START #x100) ; This should be the highest hardcoded memory address.
)
(require 'constants)
(define-syntax (define-generator stx)
(syntax-case stx ()
[(_ (name args ... . rest) body ...)
#'(define (name args ... . rest)
(define sym (quote name))
(parameterize ([ *evm-source-map-stack* (cons sym (*evm-source-map-stack*))])
(let ([ label-source (make-label sym 0 #t)])
(hash-set! (*evm-source-map*) (label-name label-source) (*evm-source-map-stack*))
(append
(list label-source)
body ...))))]))
; Top-level code generator
(: codegen (Generator Instructions))
(define (codegen is)
(*symbol-table* (make-symbol-table))
(*relocation-table* (make-relocation-table))
(*reverse-symbol-table* (make-reverse-symbol-table))
(*asm-namespace*) (namespace-anchor->namespace *asm-anchor*)
(append
(cg-initialize-program)
(cg-define-primops)
(codegen-list is)
(op-return (reg 'val))))
(: codegen-list (Generator Instructions))
(define (codegen-list is)
(apply append (map codegen-one is)))
(: codegen-one (Generator Instruction))
(define (codegen-one i)
(*abstract-offset* (+ 1 (*abstract-offset*)))
(cond ((label? i) (cg-label i))
((symbol? i) (error "Unexpected symbol - codegen-one" i))
((assign? i) (cg-assign i))
((test? i) (cg-test i))
((branch? i) (cg-branch (branch-dest i) stack))
((goto? i) (cg-goto (goto-dest i)))
((save? i) (cg-save i))
((restore? i) (cg-restore i))
((perform? i) (cg-perform i))
((evm? i) (evm-insts i))
(else
(error "Unknown instruction type -- codegen-one:" i))))
(: cg-label (Generator label-definition))
(define (cg-label i) (list i))
(: cg-assign (Generator assign))
(define-generator (cg-assign i)
(let ((value : MExpr (assign-value i))
(target : RegisterName (assign-reg-name i)))
(cg-write-reg (reg target) value)))
(: cg-test (Generator test))
(define-generator (cg-test i)
(cg-mexpr (test-condition i)))
(: cg-save (Generator save))
(define-generator (cg-save i)
(cg-write-stack (save-exp i)))
(: cg-restore (Generator restore))
(define-generator (cg-restore i)
(cg-write-reg (reg (restore-reg-name i)) stack))
(: cg-perform (Generator perform))
(define-generator (cg-perform i)
(cg-mexpr (perform-action i))) ; TODO: Watch the number of stack writes here to pop them.
(: reg-address (-> reg 0..∞))
(define (reg-address r)
(register-address (reg-name r)))
(: register-address (-> RegisterName 0..∞))
(define (register-address r)
(match r
['env MEM-ENV]
['proc MEM-PROC]
['continue MEM-CONTINUE]
['argl MEM-ARGL]
['val MEM-VAL]
['stack-size MEM-STACK-SIZE]
[x (error "reg-address: Unknown register" x)]))
;;; Primitive operations emitted by the abstract compiler
(: op-lookup-variable-value (Generator2 MExpr MExpr))
(define (op-lookup-variable-value name env) (cg-invoke-primop *label-op-lookup-variable-value* name env))
(: op-define-variable! (Generator3 MExpr MExpr MExpr))
(define (op-define-variable! name value env) (cg-invoke-primop *label-op-define-variable!* name value env))
(: op-set-variable-value! (Generator3 MExpr MExpr MExpr))
(define (op-set-variable-value! name value env) (cg-invoke-primop *label-op-set-variable-value!* name value env))
(: op-return (Generator MExpr))
(define (op-return value) (cg-jump-primop *label-op-return* value))
(: op-restore-continuation (Generator MExpr))
(define (op-restore-continuation cont) (cg-jump-primop *label-op-restore-continuation* cont))
(: op-compiled-procedure? (Generator MExpr))
(define (op-compiled-procedure? obj) (cg-invoke-primop *label-op-compiled-procedure?* obj))
(: op-continuation? (Generator MExpr))
(define (op-continuation? obj) (cg-invoke-primop *label-op-continuation?* obj))
(: op-primitive-procedure? (Generator MExpr))
(define (op-primitive-procedure? obj) (cg-invoke-primop *label-op-primitive-procedure?* obj))
(: cg-op-box (Generator MExpr)) ; Creates a boxed integer or symbol.
(define-generator (cg-op-box exp)
(if (const? exp)
(cond ((integer? (const-value exp)) (cg-make-fixnum exp))
((symbol? (const-value exp)) (cg-make-symbol exp))
(else
(error "cg-op-box: Unsupported boxed constant" exp)))
(error "cg-op-box: Can only box constants" exp)))
(: cg-op-extend-environment (Generator3 MExpr MExpr MExpr)) ; Adds a frame to the environment.
(define-generator (cg-op-extend-environment vars vals env)
(cg-intros (list vars vals env)) ; [ vars; vals; env ]
(cg-make-frame stack stack) ; [ frame; env ]
(cg-make-environment stack stack)) ; [ env' ]
(: cg-op-make-compiled-procedure (Generator2 MExpr MExpr)) ; A lambda creates a runtime value from a code pointer & closure.
(define-generator (cg-op-make-compiled-procedure code env)
(cg-make-compiled-procedure code env))
(: cg-op-compiled-procedure-entry (Generator MExpr)) ; The code pointer from a make-compiled-procedure object.
(define-generator (cg-op-compiled-procedure-entry obj)
(cg-read-address-offset obj (const 1)))
(: cg-op-compiled-procedure-env (Generator MExpr)) ; The environment address from a make-compiled-procedure object.
(define-generator (cg-op-compiled-procedure-env obj)
(cg-read-address-offset obj (const 2)))
(: cg-op-compiled-procedure? (Generator MExpr))
(define-generator (cg-op-compiled-procedure? obj)
(cg-tag obj) ; [ tag ]
(cg-eq? (const TAG-COMPILED-PROCEDURE) stack)) ; [ eq? ]
(: cg-op-continuation? (Generator MExpr))
(define-generator (cg-op-continuation? obj)
(cg-tag obj)
(cg-eq? (const TAG-CONTINUATION) stack))
(: cg-op-primitive-procedure? (Generator MExpr)) ; Is the object at an address a primitive procedure?
(define-generator (cg-op-primitive-procedure? obj)
(cg-tag obj)
(cg-eq? (const TAG-PRIMITIVE-PROCEDURE) stack))
(: cg-op-primitive-procedure-entry (Generator MExpr))
(define-generator (cg-op-primitive-procedure-entry obj)
(cg-read-address-offset obj (const 1)))
(: cg-op-apply-primitive-procedure (Generator2 MExpr MExpr)) ; Calls the primitive procedure with a code pointer and argument list.
(define-generator (cg-op-apply-primitive-procedure proc argl)
(let ((after-op (make-label 'after-op)))
(append
(cg-intros (list proc argl after-op))
; Arguments passed as a dynamic list.
(cg-op-primitive-procedure-entry stack) ; [ primop-entry; args; return ]
(asm 'JUMP)
`(,after-op))))
(: cg-op-cons (Generator2 MExpr MExpr))
(define-generator (cg-op-cons a b)
(cg-cons a b))
; Could be implemented in Pyramid, but lookup-variable-value would be needed to lookup that definition.
; PSEUDOCODE:
#|
(define (lookup-variable-value var env)
(define (env-loop env)
(define (scan vars vals)
(if (null? vals)
(env-loop (cdr env))
(if (eq? var (car vars))
(car vals)
(scan (cdr vars) (cdr vals)))))
(if (null? env)
(error "Nonexistent variable:" var)
(let ((frame (car env)))
(scan (car frame)
(cdr frame)))))
(env-loop env))
|#
(: cg-op-lookup-variable-value (Generator2 MExpr MExpr))
(define-generator (cg-op-lookup-variable-value name env)
(let ((env-loop (make-label 'lookup-variable-value-env-loop))
(scan (make-label 'lookup-variable-value-scan))
(scan-else-1 (make-label 'lookup-variable-value-scan-else-1))
(scan-else-2 (make-label 'lookup-variable-value-scan-else-2))
(term (make-label 'lookup-variable-value-term))
(not-found (make-label 'lookup-variable-value-not-found))
)
(append
(cg-intros (list name env))
; Stack: [ var, env ] ; len = 2
`(,env-loop)
(asm 'DUP2) ; [ env; name; env ]
(cg-null? stack) ; [ null?; name; env ]
(cg-branch not-found stack) ; [ name; env ]
(asm 'DUP2) ; [ env; name; env ]
(cg-car stack) ; [ frame; name; env ]
(asm 'DUP1) ; [ frame; frame; name; env ]
(cg-car stack) ; [ fvars; frame; name; env ]
(asm 'SWAP1) ; [ frame; fvars; name; env ]
(cg-cdr stack) ; [ fvals; fvars; name; env ]
; Stack: [ fvals, fvars, var, env ]
`(,scan)
(asm 'DUP1) ; [ fvals; fvals; fvars; name; env ]
(cg-null? stack) ; [ null?; fvals; fvars; name; env ]
(asm 'ISZERO) ; [ !null?; fvals; fvars; name; env ]
(cg-branch scan-else-1 stack) ; [ fvals; fvars; name; env ]
(cg-pop 2) ; [ name; env ]
(asm 'SWAP1) ; [ env; name ]
(cg-cdr stack) ; [ env'; name ]
(asm 'SWAP1) ; [ name; env' ]
(cg-goto env-loop) ; [ name; env' ]
; Stack: [ fvals, fvars, var, env ]
`(,scan-else-1)
(asm 'DUP2) ; [ fvars; fvals; fvars; var; env ]
(cg-car stack) ; [ var'; fvals; fvars; var; env ]
(asm 'DUP4) ; [ var; var'; fvals; fvars; var; env ]
(cg-eq? stack stack) ; [ eq? ; fvals; fvars; var; env ]
(asm 'ISZERO) ; [ !eq?; fvals; fvars; var; env ]
(cg-branch scan-else-2 stack) ; [fvals; fvars; var; env ]
(cg-car stack) ; [ val; fvars; var; env ]
(asm 'SWAP3) ; [ fvars; var; env; val ]
(cg-pop 3) ; [ val ]
(cg-goto term) ; [ val ]
; Stack: [ fvals, fvars, var, env ] ; len = 4
`(,scan-else-2)
(cg-cdr stack) ; [ fvals; fvars; var; env ]
(asm 'SWAP1) ; [ fvars; fvals'; var; env ]
(cg-cdr stack) ; [ fvars'; fvals'; var; env ]
(asm 'SWAP1) ; [ fvals'; fvars'; var; env ]
(cg-goto scan) ; [ fvals'; fvars'; var; env ]
`(,not-found)
(asm 'REVERT)
`(,term))))
#|
(define (set-variable-value! var val env)
(define (env-loop env)
(define (scan vars vals)
(if (null? vals)
(env-loop (cdr env))
(if (eq? var (car vars))
(set-car! vals val)
(scan (cdr vars) (cdr vals)))))
(if (null? env)
(error "Nonexistent variable:" var)
(let ((frame (car env)))
(scan (car frame)
(cdr frame)))))
(env-loop env))
|#
(: cg-op-set-variable-value! (Generator3 MExpr MExpr MExpr))
(define-generator (cg-op-set-variable-value! name value env)
(let ([env-loop (make-label 'set-variable-value-env-loop)]
[scan (make-label 'set-variable-value-scan)]
[scan-else-1 (make-label 'set-variable-value-scan-else-1)]
[scan-else-2 (make-label 'set-variable-value-scan-else-2)]
[term (make-label 'set-variable-value-term)]
[not-found (make-label 'set-variable-value-not-found)]
)
(append
(cg-intros (list name value env))
; Stack: [ var, value, env ]
`(,env-loop)
(asm 'DUP3) ; [ env; name; value; env ]
(cg-null? stack) ; [ null?; name; value; env ]
(cg-branch not-found stack) ; [ name; value; env ]
(asm 'DUP3) ; [ env; name; value; env ]
(cg-car stack) ; [ frame; name; value; env ]
(asm 'DUP1) ; [ frame; frame; name; value; env ]
(cg-car stack) ; [ fvars; frame; name; value; env ]
(asm 'SWAP1) ; [ frame; fvars; name; value; env ]
(cg-cdr stack) ; [ fvals; fvars; name; value; env ]
; Stack: [ fvals, fvars, name, value, env ]
`(,scan)
(asm 'DUP1) ; [ fvals; fvals; fvars; name; value; env ]
(cg-null? stack) ; [ null?; fvals; fvars; name; value; env ]
(asm 'ISZERO) ; [ !null?; fvals; fvars; name; value; env ]
(cg-branch scan-else-1 stack) ; [ fvals; fvars; name; value; env ]
(cg-pop 2) ; [ name; value; env ]
(asm 'SWAP2) ; [ env; value; name ]
(cg-cdr stack) ; [ env'; value; name ]
(asm 'SWAP2) ; [ name; value; env' ]
(cg-goto env-loop) ; [ name; value; env' ]
; Stack: [ fvals, fvars, var, value, env ]
`(,scan-else-1)
(asm 'DUP2) ; [ fvars; fvals; fvars; name; value; env ]
(cg-car stack) ; [ name'; fvals; fvars; name; value; env ]
(asm 'DUP4) ; [ name; name'; fvals; fvars; name; value; env ]
(cg-eq? stack stack) ; [ eq?; fvals; fvars; name; value; env ]
(asm 'ISZERO) ; [ neq?; fvals; fvars; name; value; env ]
(cg-branch scan-else-2 stack) ; [ fvals; fvars; name; value; env ]
(asm 'DUP4) ; [ value; fvals; fvars; name; value; env ]
(cg-swap 1) ; [ fvals; value; fvars; name; fvars; env ]
(cg-set-car! stack stack) ; [ fvars; name; fvars; env ]
(cg-pop 4) ; [ ]
(cg-goto term) ; [ ]
; Stack: [ fvals, fvars, name, value, env ]
`(,scan-else-2)
(cg-cdr stack) ; [ fvals; fvars; name; value; env ]
(asm 'SWAP1) ; [ fvars; fvals'; name; value; env ]
(cg-cdr stack) ; [ fvars'; fvals'; name; value; env ]
(asm 'SWAP1) ; [ fvals'; fvars'; name; value; env ]
(cg-goto scan) ; [ fvals'; fvars'; name; value; env ]
`(,not-found)
(asm 'REVERT)
`(,term)))) ; []
; PSEUDOCODE:
;; (define (cg-op-define-variable! var val env)
;; (let ((frame (car env)))
;; (define (scan vars vals)
;; (if (null? vars)
;; (add-binding-to-frame! var val frame)
;; (if (eq? var (car vars))
;; (set-car! vals val)
;; (scan (cdr vars) (cdr vals)))))))
;; (scan (car frame)
;; (cdr frame))))
(: cg-op-define-variable! (Generator3 MExpr MExpr MExpr))
(define-generator (cg-op-define-variable! name value env)
(let ((scan (make-label 'define-variable!-scan))
(scan-else-1 (make-label 'define-variable!-scan-else-1))
(scan-else-2 (make-label 'define-variable!-scan-else-2))
(term (make-label 'define-variable!-term))
)
(append
(cg-intros (list name value env))
; Stack: [ name; value; env ]
(asm 'DUP3) ; [ env; name; value; env ]
(cg-car stack) ; [ frame; name; value; env ]
; Stack: [ frame; name; value; env ]
(asm 'DUP1) ; [ frame; frame; name; value; env ]
(cg-cdr stack) ; [ fvals; frame; name; value; env ]
(asm 'SWAP1) ; [ frame; fvals; name; value; env ]
(cg-car stack) ; [ fvars; fvals; name; value; env ]
; Stack: [ fvars; fvals; name; value; env ]
`(,scan)
(asm 'DUP1) ; [ fvars; fvars; fvals; name; value; env ]
(cg-null? stack) ; [ null?; fvars; fvals; name; value; env ]
(asm 'ISZERO) ; [ !null?; fvars; fvals; name; value; env ]
(cg-branch scan-else-1 stack) ; [ fvars; fvals; name; value; env ]
(cg-pop 2) ; [ name; value; env ]
(asm 'SWAP2) ; [ env; value; name ]
(cg-car stack) ; [ frame; value; name ]
(asm 'SWAP2) ; [ name; value; frame ]
(cg-add-binding-to-frame stack stack stack) ; [ ]
(cg-goto term) ; []
; Stack: [ fvars; fvals; name; value; env ]
`(,scan-else-1)
(asm 'DUP3) ; [ name; fvars; fvals; name; value; env ]
(asm 'DUP2) ; [ fvars; name; fvars; fvals; name; value; env ]
(cg-car stack) ; [ name'; name; fvars; fvals; name; value; env ]
(cg-eq? stack stack) ; [ eq?; fvars; fvals; name; value; env ]
(asm 'ISZERO) ; [ neq?; fvars; fvals; name; value; env ]
(cg-branch scan-else-2 stack) ; [ fvars; fvals; name; value; env ]
; Stack: [ fvars; fvals; name; value; env ]
(asm 'SWAP1) ; [ fvals; fvars; name; value; env ]
(asm 'DUP4) ; [ value; fvals; fvars; name; value; env ]
(cg-reverse 2) ; [ fvals; value; fvars; name; value; env ]
(cg-set-car! stack stack) ; [ fvars; name; value; env ]
(cg-pop 4) ; [ ]
(cg-goto term) ; [ ]
; Stack [ fvars; fvals; name; value; env ]
`(,scan-else-2)
(cg-cdr stack) ; [ fvars'; fvals; name; value; env ]
(cg-reverse 2) ; [ fvals; fvars'; name; value; env ]
(cg-cdr stack) ; [ fvals'; fvars'; name; value; env ]
(cg-reverse 2) ; [ fvars'; fvals'; name; value; env ]
(cg-goto scan) ; [ fvars'; fvals'; name; value; env ]
`(,term))))
(: cg-op-false? (Generator MExpr)) ; Evaluates to 1 if the expression is 0
(define-generator (cg-op-false? exp)
(cg-mexpr exp)
(asm 'ISZERO))
(: cg-op-list (Generator MExpr)) ; Creates a 1-element vector with the given object.
(define-generator (cg-op-list exp)
(cg-mexpr exp) ; [ x ]
(cg-make-nil) ; [ nil; x ]
(cg-reverse 2) ; [ x; nil ]
(cg-cons stack stack)) ; [ x:nil]
(: cg-mexpr (Generator MExpr))
(define-generator (cg-mexpr exp)
(cond ((reg? exp) (cg-mexpr-reg exp))
((const? exp) (cg-mexpr-const exp))
((boxed-const? exp) (cg-mexpr-boxed-const exp))
((op? exp) (cg-mexpr-op exp))
((label? exp) (cg-mexpr-label exp))
((stack? exp) '())
((evm? exp) (append (debug-label 'cg-mexpr-evm)
(evm-insts exp)))
(else
(error "cg-mexpr: Unknown mexpr" exp (list? exp)))))
(: cg-mexpr-reg (Generator reg))
(define-generator (cg-mexpr-reg dest)
(cg-read-address (const (reg-address dest))))
(: cg-write-reg (Generator2 reg MExpr))
(define-generator (cg-write-reg dest exp)
(cg-write-address (const (reg-address dest)) exp))
(: cg-mexpr-const (Generator const))
(define-generator (cg-mexpr-const exp)
(let ((val (const-value exp)))
(begin
(cond [(symbol? val)
(let ((int (symbol->integer val)))
(list (evm-push (integer-bytes int) int)))]
[(integer? val) (list (evm-push (integer-bytes val) val))]
[(list? val) (cg-make-list (map const val) #f)]
[(boolean? val) (cg-mexpr-const (const (if val 1 0)))]
[(vector? val) (cg-make-vector (const (vector-length val)) (map const (vector->list val)))]
[(char? val) (list (evm-push 'shrink (char->integer val)))]
[else (error "cg-mexpr-const: Unsupported constant" exp)]))))
(: cg-mexpr-boxed-const (Generator boxed-const))
(define-generator (cg-mexpr-boxed-const exp)
(let ([ val (boxed-const-value exp) ])
(cond [(symbol? val)
(let ((int (symbol->integer (cast val Symbol))))
(cg-make-symbol (const (integer-bytes int))))]
[(integer? val) (cg-make-fixnum (const val))]
[(list? val) (cg-make-list (map const val) #t)]
[(vector? val) (cg-make-vector (const (vector-length val)) (map boxed-const (vector->list val)))]
[(char? val) (cg-make-char (const val))]
[else (error "cg-mexpr-boxed-const: Unsupported constant" exp)])))
(unsafe-require/typed "unsafe.rkt"
[ unsafe-apply (-> Procedure (Listof Any) EthInstructions)])
(: cg-mexpr-op (Generator op))
(define-generator (cg-mexpr-op exp)
(let* ([ name (op-name exp)]
[ args (op-args exp)]
[ tbl (*primops*)]
[ primop (find-primop tbl name)]
[ proc (primop-gen primop)]
)
(unless (procedure-arity-includes? proc (length args))
(error "cg-mexpr-op: Attempted to invoke primop with incorrect number of arguments" name (procedure-arity proc) args))
(unsafe-apply proc args)))
(: find-primop (-> PrimopTable Symbol primop))
(define (find-primop tbl name)
(if (hash-has-key? tbl name)
(hash-ref tbl name)
(error "find-op: Unknown primop" name)))
(: cg-mexpr-label (Generator (U label-definition label)))
(define-generator (cg-mexpr-label exp)
(list (evm-push 'shrink exp)))
(: cg-mexpr-stack Generator0)
(define-generator (cg-mexpr-stack) '())
(: cg-write-stack (Generator MExpr))
(define-generator (cg-write-stack exp) (cg-mexpr exp))
(: cg-goto (Generator MExpr))
(define-generator (cg-goto dest)
(cg-mexpr dest)
(asm 'JUMP))
(: cg-branch (Generator2 MExpr MExpr))
(define-generator (cg-branch dest pred)
(cg-intros (list dest pred))
(asm 'JUMPI))
(: cg-reverse (Generator Integer))
(define-generator (cg-reverse size)
(match size
[ 2 (asm 'SWAP1)]
[ 3 ; [ x1; x2; x3 ]
(asm 'SWAP2)] ; [ x3; x2; x1 ]
[ 4 (append ; [ x1; x2; x3; x4 ]
(asm 'SWAP3) ; [ x4; x2; x3; x1 ]
(asm 'SWAP1) ; [ x2; x4; x3; x1 ]
(asm 'SWAP2) ; [ x3; x4; x2; x1 ]
(asm 'SWAP1) ; [ x4; x3; x2; x1 ]
)]
[ _ (error "Unsupported size -- cg-reverse" size)]))
(: cg-pop (Generator (U Integer MExpr)))
(define-generator (cg-pop size)
(if (integer? size)
(for/list : EthInstructions ([ i (in-range size)])
(evm-op 'POP))
(cgm-repeat size
(append
(asm 'SWAP1)
(asm 'POP)))))
(: cg-swap (Generator Integer))
(define-generator (cg-swap size)
(match size
[ 1 (asm 'SWAP1)]
[ 2 (asm 'SWAP2)]
[ 3 (asm 'SWAP3)]
[ 4 (asm 'SWAP4)]
[ 5 (asm 'SWAP5)]
[ 6 (asm 'SWAP6)]
[ 7 (asm 'SWAP7)]
[ 8 (asm 'SWAP8)]
[ 9 (asm 'SWAP9)]
[10 (asm 'SWAP10)]
[11 (asm 'SWAP11)]
[12 (asm 'SWAP12)]
[13 (asm 'SWAP13)]
[14 (asm 'SWAP14)]
[15 (asm 'SWAP15)]
[0 '()]
(else (error "Unknown swap size -- cg-swap" size))))
(: cg-read-address (Generator MExpr))
(define-generator (cg-read-address addr)
(cg-mexpr addr)
(asm 'MLOAD))
(: cg-read-address-offset (Generator2 MExpr MExpr))
(define-generator (cg-read-address-offset addr os)
(cg-intros (list addr os)) ; [ addr; os ]
(cg-reverse 2) ; [ os; addr ]
(cg-mul (const WORD) stack) ; [ os'; addr ]
(cg-add stack stack) ; [ addr' ]
(cg-read-address stack)) ; [ val ]
(: cg-write-address (Generator2 MExpr MExpr))
(define-generator (cg-write-address dest val)
(cg-intros (list dest val))
(asm 'MSTORE))
(: cg-write-address-offset (Generator3 MExpr MExpr MExpr))
(define-generator (cg-write-address-offset dest os val)
(cg-intros (list dest os val)) ; [ addr; os; val ]
(cg-reverse 2) ; [ os; addr; val ]
(cg-mul (const WORD) stack) ; [ os'; addr; val ]
(cg-add stack stack) ; [ addr'; val ]
(cg-write-address stack stack)) ; [ ]
(: asm (-> Symbol EthInstructions))
(define (asm sym) (list (evm-op sym)))
;;; Lists
(: cg-null? (Generator MExpr))
(define-generator (cg-null? exp)
(cg-tag exp)
(cg-eq? (const TAG-NIL) stack))
(: cg-pair? (Generator MExpr))
(define-generator (cg-pair? exp)
(cg-tag exp)
(cg-eq? (const TAG-PAIR) stack))
(: cg-car (Generator MExpr))
(define-generator (cg-car exp)
(cg-read-address-offset exp (const 1)))
(: cg-cdr (Generator MExpr))
(define-generator (cg-cdr exp)
(cg-read-address-offset exp (const 2)))
(: cgm-repeat (Generator2 MExpr EthInstructions))
(define-generator (cgm-repeat size body)
(match size
[(const (? exact-integer? x))
(apply append (for/list : (Listof EthInstructions) ([ i (in-range x)])
body))]
[_ (let ([ label-loop (make-label 'cgm-repeat-loop)]
[ label-term (make-label 'cgm-repeat-term)])
(append
(cg-mexpr size) ; [ size ]
`(,label-loop) ; [ size ]
(asm 'DUP1) ; [ size; size ]
(asm 'ISZERO) ; [ 0?; size ]
(cg-branch label-term stack) ; [ size; ]
body ; [ size ]
(cg-sub stack (const 1)) ; [ size' ]
(cg-goto label-loop) ; [ size' ]
`(,label-term) ;
(asm 'POP) ; [ ]
))]))
(: cg-pop-vector (Generator MExpr))
(define-generator (cg-pop-vector size)
(cg-mexpr size) ; [ size; STACK* ]
(asm 'DUP1) ; [ size; size; STACK* ]
(cg-make-vector stack '()) ; [ ptr; size; STACK* ]
(cg-add stack (const WORD)) ; [ ptr+1; size; STACK* ]
(asm 'SWAP1) ; [ size; ptr+1; STACK* ]
(cgm-repeat stack
(append ; [ size; ptr+1; STACK* ]
(asm 'SWAP2) ; [ x; ptr+1; size; STACK'* ]
(asm 'DUP3) ; [ size; x; ptr+1; size; STACK'* ]
(asm 'DUP3) ; [ ptr+1; size; x; ptr+1; size; STACK'* ]
(cg-write-address-offset stack stack stack) ; [ ptr+1; size; STACK'* ]
(asm 'SWAP1) ; [ size; ptr+1; STACK'* ]
)) ; [ ptr+1 ]
(cg-sub stack (const WORD)) ; [ ptr ]
)
(: cg-push-vector (Generator MExpr))
(define-generator (cg-push-vector vec)
(cg-mexpr vec) ; [ vec ]
(asm 'DUP1) ; [ vec; vec ]
(cg-vector-len stack) ; [ len; vec ]
(asm 'DUP1) ; [ orig-len; len; vec ]
(asm 'SWAP2) ; [ vec; len; orig-len ]
(cg-add stack (const WORD)) ; [ vec+1; len; orig-len]
(asm 'SWAP1) ; [ len; vec+1; orig-len]
(cgm-repeat stack
(append ; [ len; vec; orig-len ]
(asm 'DUP1) ; [ len; len; vec; orig-len ]
(asm 'DUP4) ; [ orig-len; len; len; vec; orig-len ]
(asm 'SUB) ; [ os; len; vec; orig-len ]
(cg-add stack (const 1)) ; [ os'; len; vec; orig-len ]
(asm 'DUP3) ; [ vec; os; len; vec; orig-len ]
(cg-read-address-offset stack stack) ; [ x; len; vec; orig-len ]
(asm 'SWAP3) ; [ orig-len; len; vec; x ]
(asm 'SWAP2) ; [ vec; len; orig-len; x ]
(asm 'SWAP1) ; [ len; vec; orig-len; x ]
)) ; [ vec; orig-len; STACK* ]
(cg-pop 2)) ; [ STACK* ]
(: cg-unbox-vector! (Generator MExpr))
(define-generator (cg-unbox-vector! vec)
(cg-mexpr vec) ; [ vec ]
(asm 'DUP1) ; [ vec; vec ]
(cg-vector-length stack) ; [ len; vec ]
(cgm-repeat stack
(append
(asm 'DUP1) ; [ len; len; vec ]
(cg-add (const 1) stack); [os; len; vec ]
(asm 'DUP1) ; [ os; os; len; vec ]
(asm 'DUP4) ; [ vec; os; os; len; vec ]
(cg-read-address-offset stack stack) ; [ x; os; len; vec ]
(cg-fixnum-value stack) ; [ x'; os; len; vec ]
(asm 'SWAP1) ; [ os; x'; len; vec ]
(asm 'DUP4) ; [ vec; os; x'; len; vec ]
(cg-write-address-offset stack stack stack) ; [ len; vec ]
)))
; PSEUDOCODE
; (define (list->vector list)
; (let ((len (list-length list))
; ((vec (make-vector len '())))
; (define (loop i list)
; (if (eq? i len)
; vec
; (begin
; (vector-write vec i (car list))
; (loop (+ i 1) (cdr list)))))
; (loop 0 list)))
(: cg-list->vector (Generator MExpr))
(define-generator (cg-list->vector exp)
(let ((loop (make-label 'loop))
(term (make-label 'term)))
(append
(cg-mexpr exp) ; [ list ]
; 1. Calculate the length of the list
(asm 'DUP1) ; [ list; list ]
(cg-list-length stack) ; [ len; list ]
(asm 'DUP1) ; [ len; len; list ]
; 2. Allocate a vector of that size
(cg-make-vector stack '()) ; [ vector; len; list ]
(cg-swap 1) ; [ len; vector; list ]
(asm 'DUP2) ; [ vector; len; vector; list ]
(cg-vector-set-length! stack stack) ; [ vector; list ]
; 3. Loop through the list, setting vector elements.
`(,(evm-push 1 0)) ; [ i; vector; list ]
; STACK: [ i; vector; list ]
`(,loop)
; 4. Check if loop should be terminated
(asm 'SWAP2) ; [ list; vector; i ]
(asm 'DUP1) ; [ list; list; vector; i]
(cg-null? stack) ; [ term?; list; vector; i ]
(cg-branch term stack) ; [ list; vector; i ]
(asm 'SWAP2) ; [ i; vector; list ]
; 5. Set vector element, and repeat loop.
(asm 'DUP1) ; [ i; i; vector; list ]
(asm 'DUP4) ; [ list; i; i; vector; list ]
(cg-car stack) ; [ x; i; i; vector; list ]
(asm 'SWAP1) ; [ i; x; i; vector; list ]
(asm 'DUP4) ; [ vector; i; x; i; vector; list ]
(cg-vector-write stack stack stack) ; [ i; vector; list ]
(cg-add stack (const 1)) ; [ i'; vector; list ]
(asm 'SWAP2) ; [ list; vector; i' ]
(cg-cdr stack) ; [ list'; vector; i' ]
(asm 'SWAP2) ; [ i'; vector; list' ]
(cg-goto loop)
; STACK: [ list; vector; i ]
`(,term)
(cg-swap 1) ; [ vector; list; i ]
(cg-swap 2) ; [ i; list; vector ]
(cg-pop 2)))) ; [ vector ]
;; ; PSEUDOCODE
;; ; (define (list->vector list)
;; ; (let ((len (list-length list))
;; ; ((vec (make-vector len '())))
;; ; (define (loop i list)
;; ; (if (eq? i len)
;; ; vec
;; ; (begin
;; ; (vector-write vec i (car list))
;; ; (loop (+ i 1) (cdr list)))))
;; ; (loop 0 list)))
;; (: cg-list->vector (Generator MExpr))
;; (define-generator (cg-list->vector exp)
;; (let ((loop (make-label 'loop))
;; (term (make-label 'term)))
;; (append
;; (cg-mexpr exp) ; [ list ]
;; ; 1. Calculate the length of the list
;; (asm 'DUP1) ; [ list; list ]
;; (cg-list-length stack) ; [ len; list ]
;; (asm 'DUP1) ; [ len; len; list ]
;; ; 2. Allocate a vector of that size
;; (cg-make-vector stack '()) ; [ vector; len; list ]
;; (cg-swap 1) ; [ len; vector; list ]
;; (asm 'DUP1) ; [ len; len; vector; list ]
;; (asm 'DUP3) ; [ vector; len; len; vector; list ]
;; (cg-vector-set-length! stack stack) ; [ len; vector; list ]
;; ; 3. Loop through the list, setting vector elements.
;; `(,(evm-push 1 0)) ; [ i; len; vector; list ]
;; ; STACK: [ i; len; vector; list ]
;; `(,loop)
;; ; 4. Check if loop should be terminated
;; (asm 'SWAP3) ; [ list; len; vector; i ]
;; (asm 'DUP1) ; [ list; list; len; vector; i]
;; (cg-null? stack) ; [ term?; list; len; vector; i ]
;; (cg-branch term stack) ; [ list; len; vector; i ]
;; (asm 'SWAP3) ; [ i; len; vector; list ]
;; ; 5. Set vector element, and repeat loop.
;; (asm 'DUP1) ; [ i; i; len; vector; list ]
;; (asm 'DUP5) ; [ list; i; i; len; vector; list ]
;; (cg-car stack) ; [ x; i; i; len; vector; list ]
;; (asm 'SWAP1) ; [ i; x; i; len; vector; list ]
;; (asm 'DUP4) ; [ len; i; x; i; len; vector; list ]
;; (asm 'SUB) ; [ i'; x; i; len; vector; list ]
;; (asm 'DUP5) ; [ vector; i'; x; i; len; vector; list ]
;; (cg-vector-write stack stack stack) ; [ i; len; vector; list ]
;; (cg-add stack (const 1)) ; [ i'; len; vector; list ]
;; (asm 'SWAP2) ; [ len; vector; i' ]
;; (cg-cdr stack) ; [ list'; vector; i' ]
;; (asm 'SWAP2) ; [ i'; vector; list' ]
;; (cg-goto loop)
;; ; STACK: [ list; vector; i ]
;; `(,term)
;; (cg-swap 1) ; [ vector; list; i ]
;; (cg-swap 2) ; [ i; list; vector ]
;; (cg-pop 2)))) ; [ vector ]
(: cg-set-car! (Generator2 MExpr MExpr))
(define-generator (cg-set-car! addr val)
(cg-write-address-offset addr (const 1) val))
(: cg-set-cdr! (Generator2 MExpr MExpr))
(define-generator (cg-set-cdr! addr val)
(cg-write-address-offset addr (const 2) val))
; PSEUDOCODE
#|
(define (list-length list)
(define (loop len)
(if (pair? list)
(loop (+ 1 len))
len))
(loop 0))
|#
(: cg-list-length (Generator MExpr))
(define-generator (cg-list-length exp)
(let ((loop (make-label 'loop))
(terminate (make-label 'terminate)))
(append
(cg-mexpr exp) ; [ list ]
`(,(evm-push 1 0)) ; [ len; list ]
(cg-swap 1) ; [ list; len ]
`(,loop)
(asm 'DUP1) ; [ list; list; len ]
(cg-pair? exp) ; [ pair?; list; len ]
(asm 'ISZERO) ; [ !pair?; list; len ]
(cg-branch terminate stack) ; [ list; len ]
(asm 'SWAP1) ; [ len; list ]
(cg-add stack (const 1)) ; [ len'; ]
(asm 'SWAP1) ; [ list; len' ]
(cg-cdr stack) ; [ list'; len' ]
(cg-goto loop) ; [ list'; len' ]
; STACK [ list; len ]
`(,terminate)
(cg-pop 1)))) ; [ len ]
;;; Vectors
(: cg-vector-data (Generator MExpr))
(define-generator (cg-vector-data vec)
(cg-add vec (const (* 2 WORD))))
(: cg-vector-len (Generator MExpr))
(define-generator (cg-vector-len vec)
(cg-read-address-offset vec (const 1)))
(define cg-vector-length cg-vector-len)
(: cg-vector-write (Generator3 MExpr MExpr MExpr)) ; vector -> offset -> value
(define-generator (cg-vector-write vec os val)
(cg-intros (list vec os val))
(asm 'SWAP1) ; [ os; vec; val ]
(cg-add (const 2) stack) ; [ os'; vec; val ]
(asm 'SWAP1) ; [ vec; os'; val ]
(cg-write-address-offset stack stack stack)) ; [ ]
(: cg-vector-read (Generator2 MExpr MExpr)) ; vector -> offset
(define-generator (cg-vector-read vec os)
(cg-intros (list vec os))
(asm 'SWAP1) ; [ os; vec ]
(cg-add (const 2) stack) ; [ os'; vec ]
(asm 'SWAP1) ; [ vec; os' ]
(cg-read-address-offset stack stack)) ; [ x ]
(: cg-vector-set-length! (Generator2 MExpr MExpr)) ; vector -> value
(define-generator (cg-vector-set-length! vec len)
(cg-intros (list vec (const 1) len)) ; [ vec; 1; len ]
(cg-write-address-offset stack stack stack) ; [ ]
)
; PSEUDOCODE
#|
(define (vector-unbox vec)
(let loop (len (vector-size vec))
(unless (= len 0)
(let (i (- len 1))
(write-vector vec i (unbox-integer (read-vector vec i)))
(loop i)))))
|#
(: cg-vector-unbox! (Generator MExpr))
(define-generator (cg-vector-unbox! vec)
(let ([ loop (make-label 'cg-vector-unbox-loop) ]
[ term (make-label 'cg-vector-unbox-term) ]
)
(append
(cg-intros (list vec)) ; [ vec ]
(asm 'DUP1) ; [ vec; vec ]
(cg-vector-len stack) ; [ len; vec ]
`(,loop)
(asm 'DUP1) ; [ len; len; vec ]
(cg-eq? (const 0) stack) ; [ 1; len; vec ]
(cg-branch term stack) ; [ len; vec ]
(cg-sub stack (const 1)) ; [ i; vec ]
(asm 'DUP1) ; [ i; i; vec ]
(asm 'DUP3) ; [ vec; i; i; vec ]
(cg-vector-read stack stack) ; [ x; i; vec ]
(cg-unbox-integer stack) ; [ x'; i; vec ]
(asm 'DUP3) ; [ vec; x'; i; vec ]
(asm 'DUP3) ; [ i; vec; x'; i; vec ]
(cg-swap 1) ; [ vec; i; x'; i; vec ]
(cg-vector-write stack stack stack) ; [ i; vec ]
(cg-goto loop)