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
|
;;; Guile VM assembler
;; Copyright (C) 2001, 2009, 2010, 2011 Free Software Foundation, Inc.
;;;; This library is free software; you can redistribute it and/or
;;;; modify it under the terms of the GNU Lesser General Public
;;;; License as published by the Free Software Foundation; either
;;;; version 3 of the License, or (at your option) any later version.
;;;;
;;;; This library 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
;;;; Lesser General Public License for more details.
;;;;
;;;; You should have received a copy of the GNU Lesser General Public
;;;; License along with this library; if not, write to the Free Software
;;;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
;;; Code:
(define-module (language glil compile-assembly)
#:use-module (system base syntax)
#:use-module (system base pmatch)
#:use-module (language glil)
#:use-module (language assembly)
#:use-module (system vm instruction)
#:use-module ((system vm program) #:select (make-binding))
#:use-module (ice-9 receive)
#:use-module (ice-9 vlist)
#:use-module ((srfi srfi-1) #:select (fold))
#:use-module (rnrs bytevectors)
#:export (compile-assembly))
;; Traversal helpers
;;
(define (vhash-fold-right2 proc vhash s0 s1)
(let lp ((i (vlist-length vhash)) (s0 s0) (s1 s1))
(if (zero? i)
(values s0 s1)
(receive (s0 s1) (let ((pair (vlist-ref vhash (1- i))))
(proc (car pair) (cdr pair) s0 s1))
(lp (1- i) s0 s1)))))
(define (fold2 proc ls s0 s1)
(let lp ((ls ls) (s0 s0) (s1 s1))
(if (null? ls)
(values s0 s1)
(receive (s0 s1) (proc (car ls) s0 s1)
(lp (cdr ls) s0 s1)))))
(define (vector-fold2 proc vect s0 s1)
(let ((len (vector-length vect)))
(let lp ((i 0) (s0 s0) (s1 s1))
(if (< i len)
(receive (s0 s1) (proc (vector-ref vect i) s0 s1)
(lp (1+ i) s0 s1))
(values s0 s1)))))
;; Variable cache cells go in the object table, and serialize as their
;; keys. The reason we wrap the keys in these records is so they don't
;; compare as `equal?' to other objects in the object table.
;;
;; `key' is either a symbol or the list (MODNAME SYM PUBLIC?)
(define-record <variable-cache-cell> key)
(define (limn-sources sources)
(let lp ((in sources) (out '()) (filename #f))
(if (null? in)
(reverse! out)
(let ((addr (caar in))
(new-filename (assq-ref (cdar in ) 'filename))
(line (assq-ref (cdar in) 'line))
(column (assq-ref (cdar in) 'column)))
(cond
((not (equal? new-filename filename))
(lp (cdr in)
`((,addr . (,line . ,column))
(filename . ,new-filename)
. ,out)
new-filename))
((or (null? out) (not (equal? (cdar out) `(,line . ,column))))
(lp (cdr in)
`((,addr . (,line . ,column))
. ,out)
filename))
(else
(lp (cdr in) out filename)))))))
;; Avoid going through the compiler so as to avoid adding to the
;; constant store.
(define (make-meta bindings sources arities tail)
(let ((body `(,@(dump-object `(,bindings ,sources ,arities ,@tail) 0)
(return))))
`(load-program ()
,(addr+ 0 body)
#f
,@body)))
;; If this is true, the object doesn't need to go in a constant table.
;;
(define (immediate? x)
(object->assembly x))
;; This tests for a proper scheme list whose last cdr is '(), not #nil.
;;
(define (scheme-list? x)
(and (list? x)
(or (eq? x '())
(let ((p (last-pair x)))
(and (pair? p)
(eq? (cdr p) '()))))))
;; Note: in all of these procedures that build up constant tables, the
;; first (zeroth) index is reserved. At runtime it is replaced with the
;; procedure's module. Hence all of this 1+ length business.
;; Build up a vhash of constant -> index, allowing us to build up a
;; constant table for a whole compilation unit.
;;
(define (build-constant-store x)
(define (add-to-store store x)
(define (add-to-end store x)
(vhash-cons x (1+ (vlist-length store)) store))
(cond
((vhash-assoc x store)
;; Already in the store.
store)
((immediate? x)
;; Immediates don't need to go in the constant table.
store)
((or (number? x)
(string? x)
(symbol? x)
(keyword? x))
;; Atoms.
(add-to-end store x))
((variable-cache-cell? x)
;; Variable cache cells (see below).
(add-to-end (add-to-store store (variable-cache-cell-key x))
x))
((list? x)
;; Add the elements to the store, then the list itself. We could
;; try hashing the cdrs as well, but that seems a bit overkill, and
;; this way we do compress the bytecode a bit by allowing the use of
;; the `list' opcode.
(let ((store (fold (lambda (x store)
(add-to-store store x))
store
x)))
(add-to-end store x)))
((pair? x)
;; Non-lists get caching on both fields.
(let ((store (add-to-store (add-to-store store (car x))
(cdr x))))
(add-to-end store x)))
((and (vector? x)
(equal? (array-shape x) (list (list 0 (1- (vector-length x))))))
;; Likewise, add the elements to the store, then the vector itself.
;; Important for the vectors produced by the psyntax expansion
;; process.
(let ((store (fold (lambda (x store)
(add-to-store store x))
store
(vector->list x))))
(add-to-end store x)))
((array? x)
;; Naive assumption that if folks are using arrays, that perhaps
;; there's not much more duplication.
(add-to-end store x))
(else
(error "build-constant-store: unrecognized object" x))))
(let walk ((x x) (store vlist-null))
(record-case x
((<glil-program> meta body)
(fold walk store body))
((<glil-const> obj)
(add-to-store store obj))
((<glil-kw-prelude> kw)
(add-to-store store kw))
((<glil-toplevel> op name)
;; We don't add toplevel variable cache cells to the global
;; constant table, because they are sensitive to changes in
;; modules as the toplevel expressions are evaluated. So we just
;; add the name.
(add-to-store store name))
((<glil-module> op mod name public?)
;; However, it is fine add module variable cache cells to the
;; global table, as their bindings are not dependent on the
;; current module.
(add-to-store store
(make-variable-cache-cell (list mod name public?))))
(else store))))
;; Analyze one <glil-program> to determine its object table. Produces a
;; vhash of constant to index.
;;
(define (build-object-table x)
(define (add store x)
(if (vhash-assoc x store)
store
(vhash-cons x (1+ (vlist-length store)) store)))
(record-case x
((<glil-program> meta body)
(fold (lambda (x table)
(record-case x
((<glil-program> meta body)
;; Add the GLIL itself to the table.
(add table x))
((<glil-const> obj)
(if (immediate? obj)
table
(add table obj)))
((<glil-kw-prelude> kw)
(add table kw))
((<glil-toplevel> op name)
(add table (make-variable-cache-cell name)))
((<glil-module> op mod name public?)
(add table (make-variable-cache-cell (list mod name public?))))
(else table)))
vlist-null
body))))
;; A functional stack of names of live variables.
(define (make-open-binding name boxed? index)
(list name boxed? index))
(define (make-closed-binding open-binding start end)
(make-binding (car open-binding) (cadr open-binding)
(caddr open-binding) start end))
(define (open-binding bindings vars start)
(cons
(acons start
(map
(lambda (v)
(pmatch v
((,name ,boxed? ,i)
(make-open-binding name boxed? i))
(else (error "unknown binding type" v))))
vars)
(car bindings))
(cdr bindings)))
(define (close-binding bindings end)
(pmatch bindings
((((,start . ,closing) . ,open) . ,closed)
(cons open
(fold (lambda (o tail)
;; the cons is for dsu sort
(acons start (make-closed-binding o start end)
tail))
closed
closing)))
(else (error "broken bindings" bindings))))
(define (close-all-bindings bindings end)
(if (null? (car bindings))
(map cdr
(stable-sort (reverse (cdr bindings))
(lambda (x y) (< (car x) (car y)))))
(close-all-bindings (close-binding bindings end) end)))
;; A functional arities thingamajiggy.
;; arities := ((ip nreq [[nopt] [[rest] [kw]]]]) ...)
(define (open-arity addr nreq nopt rest kw arities)
(cons
(cond
(kw (list addr nreq nopt rest kw))
(rest (list addr nreq nopt rest))
(nopt (list addr nreq nopt))
(nreq (list addr nreq))
(else (list addr)))
arities))
(define (close-arity addr arities)
(pmatch arities
(() '())
(((,start . ,tail) . ,rest)
`((,start ,addr . ,tail) . ,rest))
(else (error "bad arities" arities))))
(define (begin-arity end start nreq nopt rest kw arities)
(open-arity start nreq nopt rest kw (close-arity end arities)))
(define (compile-assembly glil)
(let* ((all-constants (build-constant-store glil))
(prog (compile-program glil all-constants))
(len (byte-length prog)))
;; The top objcode thunk. We're going to wrap this thunk in
;; a thunk -- yo dawgs -- with the goal being to lift all
;; constants up to the top level. The store forms a DAG, so
;; we can actually build up later elements in terms of
;; earlier ones.
;;
(cond
((vlist-null? all-constants)
;; No constants: just emit the inner thunk.
prog)
(else
;; We have an object store, so write it out, attach it
;; to the inner thunk, and tail call.
(receive (tablecode addr) (dump-constants all-constants)
(let ((prog (align-program prog addr)))
;; Outer thunk.
`(load-program ()
,(+ (addr+ addr prog)
2 ; for (tail-call 0)
)
#f
;; Load the table, build the inner
;; thunk, then tail call.
,@tablecode
,@prog
(tail-call 0))))))))
(define (compile-program glil constants)
(record-case glil
((<glil-program> meta body)
(let lp ((body body) (code '()) (bindings '(())) (source-alist '())
(label-alist '()) (arities '()) (addr 0))
(cond
((null? body)
(let ((code (fold append '() code))
(bindings (close-all-bindings bindings addr))
(sources (limn-sources (reverse! source-alist)))
(labels (reverse label-alist))
(arities (reverse (close-arity addr arities)))
(len addr))
(let* ((meta (make-meta bindings sources arities meta))
(meta-pad (if meta (modulo (- 8 (modulo len 8)) 8) 0)))
`(load-program ,labels
,(+ len meta-pad)
,meta
,@code
,@(if meta
(make-list meta-pad '(nop))
'())))))
(else
(receive (subcode bindings source-alist label-alist arities)
(glil->assembly (car body) bindings
source-alist label-alist
constants arities addr)
(lp (cdr body) (cons subcode code)
bindings source-alist label-alist arities
(addr+ addr subcode)))))))))
(define (compile-objtable constants table addr)
(define (load-constant idx)
(if (< idx 256)
(values `((object-ref ,idx))
2)
(values `((long-object-ref
,(quotient idx 256) ,(modulo idx 256)))
3)))
(cond
((vlist-null? table)
;; Empty table; just return #f.
(values '((make-false))
(1+ addr)))
(else
(call-with-values
(lambda ()
(vhash-fold-right2
(lambda (obj idx codes addr)
(cond
((vhash-assoc obj constants)
=> (lambda (pair)
(receive (load len) (load-constant (cdr pair))
(values (cons load codes)
(+ addr len)))))
((variable-cache-cell? obj)
(cond
((vhash-assoc (variable-cache-cell-key obj) constants)
=> (lambda (pair)
(receive (load len) (load-constant (cdr pair))
(values (cons load codes)
(+ addr len)))))
(else (error "vcache cell key not in table" obj))))
((glil-program? obj)
;; Programs are not cached in the global constants
;; table because when a program is loaded, its module
;; is bound, and we want to do that only after any
;; preceding effectful statements.
(let* ((table (build-object-table obj))
(prog (compile-program obj table)))
(receive (tablecode addr)
(compile-objtable constants table addr)
(let ((prog (align-program prog addr)))
(values (cons `(,@tablecode ,@prog)
codes)
(addr+ addr prog))))))
(else
(error "unrecognized constant" obj))))
table
'(((make-false))) (1+ addr)))
(lambda (elts addr)
(let ((len (1+ (vlist-length table))))
(values
(fold append
`((vector ,(quotient len 256) ,(modulo len 256)))
elts)
(+ addr 3))))))))
(define (glil->assembly glil bindings source-alist label-alist
constants arities addr)
(define (emit-code x)
(values x bindings source-alist label-alist arities))
(define (emit-object-ref i)
(values (if (< i 256)
`((object-ref ,i))
`((long-object-ref ,(quotient i 256) ,(modulo i 256))))
bindings source-alist label-alist arities))
(define (emit-code/arity x nreq nopt rest kw)
(values x bindings source-alist label-alist
(begin-arity addr (addr+ addr x) nreq nopt rest kw arities)))
(record-case glil
((<glil-program> meta body)
(cond
((vhash-assoc glil constants)
;; We are cached in someone's objtable; just emit a load.
=> (lambda (pair)
(emit-object-ref (cdr pair))))
(else
;; Otherwise, build an objtable for the program, compile it, and
;; emit a load-program.
(let* ((table (build-object-table glil))
(prog (compile-program glil table)))
(receive (tablecode addr) (compile-objtable constants table addr)
(emit-code `(,@tablecode ,@(align-program prog addr))))))))
((<glil-std-prelude> nreq nlocs else-label)
(emit-code/arity
(if (and (< nreq 8) (< nlocs (+ nreq 32)) (not else-label))
`((assert-nargs-ee/locals ,(logior nreq (ash (- nlocs nreq) 3))))
`(,(if else-label
`(br-if-nargs-ne ,(quotient nreq 256)
,(modulo nreq 256)
,else-label)
`(assert-nargs-ee ,(quotient nreq 256)
,(modulo nreq 256)))
(reserve-locals ,(quotient nlocs 256)
,(modulo nlocs 256))))
nreq #f #f #f))
((<glil-opt-prelude> nreq nopt rest nlocs else-label)
(let ((bind-required
(if else-label
`((br-if-nargs-lt ,(quotient nreq 256)
,(modulo nreq 256)
,else-label))
`((assert-nargs-ge ,(quotient nreq 256)
,(modulo nreq 256)))))
(bind-optionals
(if (zero? nopt)
'()
`((bind-optionals ,(quotient (+ nopt nreq) 256)
,(modulo (+ nreq nopt) 256)))))
(bind-rest
(cond
(rest
`((push-rest ,(quotient (+ nreq nopt) 256)
,(modulo (+ nreq nopt) 256))))
(else
(if else-label
`((br-if-nargs-gt ,(quotient (+ nreq nopt) 256)
,(modulo (+ nreq nopt) 256)
,else-label))
`((assert-nargs-ee ,(quotient (+ nreq nopt) 256)
,(modulo (+ nreq nopt) 256))))))))
(emit-code/arity
`(,@bind-required
,@bind-optionals
,@bind-rest
(reserve-locals ,(quotient nlocs 256)
,(modulo nlocs 256)))
nreq nopt rest #f)))
((<glil-kw-prelude> nreq nopt rest kw allow-other-keys? nlocs else-label)
(let* ((kw-idx (or (and=> (vhash-assoc kw constants) cdr)
(error "kw not in objtable")))
(bind-required
(if else-label
`((br-if-nargs-lt ,(quotient nreq 256)
,(modulo nreq 256)
,else-label))
`((assert-nargs-ge ,(quotient nreq 256)
,(modulo nreq 256)))))
(ntotal (apply max (+ nreq nopt) (map 1+ (map cdr kw))))
(bind-optionals-and-shuffle
`((bind-optionals/shuffle
,(quotient nreq 256)
,(modulo nreq 256)
,(quotient (+ nreq nopt) 256)
,(modulo (+ nreq nopt) 256)
,(quotient ntotal 256)
,(modulo ntotal 256))))
(bind-kw
;; when this code gets called, all optionals are filled
;; in, space has been made for kwargs, and the kwargs
;; themselves have been shuffled above the slots for all
;; req/opt/kwargs locals.
`((bind-kwargs
,(quotient kw-idx 256)
,(modulo kw-idx 256)
,(quotient ntotal 256)
,(modulo ntotal 256)
,(logior (if rest 2 0)
(if allow-other-keys? 1 0)))))
(bind-rest
(if rest
`((bind-rest ,(quotient ntotal 256)
,(modulo ntotal 256)
,(quotient rest 256)
,(modulo rest 256)))
'())))
(let ((code `(,@bind-required
,@bind-optionals-and-shuffle
,@bind-kw
,@bind-rest
(reserve-locals ,(quotient nlocs 256)
,(modulo nlocs 256)))))
(values code bindings source-alist label-alist
(begin-arity addr (addr+ addr code) nreq nopt rest
(and kw (cons allow-other-keys? kw))
arities)))))
((<glil-bind> vars)
(values '()
(open-binding bindings vars addr)
source-alist
label-alist
arities))
((<glil-mv-bind> vars rest)
(if (integer? vars)
(values `((truncate-values ,vars ,(if rest 1 0)))
bindings
source-alist
label-alist
arities)
(values `((truncate-values ,(length vars) ,(if rest 1 0)))
(open-binding bindings vars addr)
source-alist
label-alist
arities)))
((<glil-unbind>)
(values '()
(close-binding bindings addr)
source-alist
label-alist
arities))
((<glil-source> props)
(values '()
bindings
(acons addr props source-alist)
label-alist
arities))
((<glil-void>)
(emit-code '((void))))
((<glil-const> obj)
(cond
((object->assembly obj)
=> (lambda (code)
(emit-code (list code))))
((vhash-assoc obj constants)
=> (lambda (pair)
(emit-object-ref (cdr pair))))
(else (error "const not in table" obj))))
((<glil-lexical> local? boxed? op index)
(emit-code
(if local?
(if (< index 256)
(case op
((ref) (if boxed?
`((local-boxed-ref ,index))
`((local-ref ,index))))
((set) (if boxed?
`((local-boxed-set ,index))
`((local-set ,index))))
((box) `((box ,index)))
((empty-box) `((empty-box ,index)))
((fix) `((fix-closure 0 ,index)))
((bound?) (if boxed?
`((local-ref ,index)
(variable-bound?))
`((local-bound? ,index))))
(else (error "what" op)))
(let ((a (quotient index 256))
(b (modulo index 256)))
`((,(case op
((ref)
(if boxed?
`((long-local-ref ,a ,b)
(variable-ref))
`((long-local-ref ,a ,b))))
((set)
(if boxed?
`((long-local-ref ,a ,b)
(variable-set))
`((long-local-set ,a ,b))))
((box)
`((make-variable)
(variable-set)
(long-local-set ,a ,b)))
((empty-box)
`((make-variable)
(long-local-set ,a ,b)))
((fix)
`((fix-closure ,a ,b)))
((bound?)
(if boxed?
`((long-local-ref ,a ,b)
(variable-bound?))
`((long-local-bound? ,a ,b))))
(else (error "what" op)))
,index))))
`((,(case op
((ref) (if boxed? 'free-boxed-ref 'free-ref))
((set) (if boxed? 'free-boxed-set (error "what." glil)))
(else (error "what" op)))
,index)))))
((<glil-toplevel> op name)
(case op
((ref set)
(cond
((and=> (vhash-assoc (make-variable-cache-cell name) constants)
cdr)
=> (lambda (i)
(emit-code (if (< i 256)
`((,(case op
((ref) 'toplevel-ref)
((set) 'toplevel-set))
,i))
`((,(case op
((ref) 'long-toplevel-ref)
((set) 'long-toplevel-set))
,(quotient i 256)
,(modulo i 256)))))))
(else
(let ((i (or (and=> (vhash-assoc name constants) cdr)
(error "toplevel name not in objtable" name))))
(emit-code `(,(if (< i 256)
`(object-ref ,i)
`(long-object-ref ,(quotient i 256)
,(modulo i 256)))
(link-now)
,(case op
((ref) '(variable-ref))
((set) '(variable-set)))))))))
((define)
(let ((i (or (and=> (vhash-assoc name constants) cdr)
(error "toplevel name not in objtable" name))))
(emit-code `(,(if (< i 256)
`(object-ref ,i)
`(long-object-ref ,(quotient i 256)
,(modulo i 256)))
(define)))))
(else
(error "unknown toplevel var kind" op name))))
((<glil-module> op mod name public?)
(let ((key (list mod name public?)))
(case op
((ref set)
(let ((i (or (and=> (vhash-assoc (make-variable-cache-cell key)
constants) cdr)
(error "module vcache not in objtable" key))))
(emit-code (if (< i 256)
`((,(case op
((ref) 'toplevel-ref)
((set) 'toplevel-set))
,i))
`((,(case op
((ref) 'long-toplevel-ref)
((set) 'long-toplevel-set))
,(quotient i 256)
,(modulo i 256)))))))
(else
(error "unknown module var kind" op key)))))
((<glil-label> label)
(let ((code (align-block addr)))
(values code
bindings
source-alist
(acons label (addr+ addr code) label-alist)
arities)))
((<glil-branch> inst label)
(emit-code `((,inst ,label))))
;; nargs is number of stack args to insn. probably should rename.
((<glil-call> inst nargs)
(if (not (instruction? inst))
(error "Unknown instruction:" inst))
(let ((pops (instruction-pops inst)))
(cond ((< pops 0)
(case (instruction-length inst)
((1) (emit-code `((,inst ,nargs))))
((2) (emit-code `((,inst ,(quotient nargs 256)
,(modulo nargs 256)))))
(else (error "Unknown length for variable-arg instruction:"
inst (instruction-length inst)))))
((= pops nargs)
(emit-code `((,inst))))
(else
(error "Wrong number of stack arguments to instruction:" inst nargs)))))
((<glil-mv-call> nargs ra)
(emit-code `((mv-call ,nargs ,ra))))
((<glil-prompt> label escape-only?)
(emit-code `((prompt ,(if escape-only? 1 0) ,label))))))
(define (dump-object x addr)
(define (too-long x)
(error (string-append x " too long")))
(cond
((object->assembly x) => list)
((variable-cache-cell? x) (dump-object (variable-cache-cell-key x) addr))
((number? x)
`((load-number ,(number->string x))))
((string? x)
(case (string-bytes-per-char x)
((1) `((load-string ,x)))
((4) (align-code `(load-wide-string ,x) addr 4 4))
(else (error "bad string bytes per char" x))))
((symbol? x)
(let ((str (symbol->string x)))
(case (string-bytes-per-char str)
((1) `((load-symbol ,str)))
((4) `(,@(dump-object str addr)
(make-symbol)))
(else (error "bad string bytes per char" str)))))
((keyword? x)
`(,@(dump-object (keyword->symbol x) addr)
(make-keyword)))
((scheme-list? x)
(let ((tail (let ((len (length x)))
(if (>= len 65536) (too-long "list"))
`((list ,(quotient len 256) ,(modulo len 256))))))
(let dump-objects ((objects x) (codes '()) (addr addr))
(if (null? objects)
(fold append tail codes)
(let ((code (dump-object (car objects) addr)))
(dump-objects (cdr objects) (cons code codes)
(addr+ addr code)))))))
((pair? x)
(let ((kar (dump-object (car x) addr)))
`(,@kar
,@(dump-object (cdr x) (addr+ addr kar))
(cons))))
((and (vector? x)
(equal? (array-shape x) (list (list 0 (1- (vector-length x))))))
(let* ((len (vector-length x))
(tail (if (>= len 65536)
(too-long "vector")
`((vector ,(quotient len 256) ,(modulo len 256))))))
(let dump-objects ((i 0) (codes '()) (addr addr))
(if (>= i len)
(fold append tail codes)
(let ((code (dump-object (vector-ref x i) addr)))
(dump-objects (1+ i) (cons code codes)
(addr+ addr code)))))))
((and (array? x) (symbol? (array-type x)))
(let* ((type (dump-object (array-type x) addr))
(shape (dump-object (array-shape x) (addr+ addr type))))
`(,@type
,@shape
,@(align-code
`(load-array ,(uniform-array->bytevector x))
(addr+ (addr+ addr type) shape)
8
4))))
((array? x)
;; an array of generic scheme values
(let* ((contents (array-contents x))
(len (vector-length contents)))
(let dump-objects ((i 0) (codes '()) (addr addr))
(if (< i len)
(let ((code (dump-object (vector-ref contents i) addr)))
(dump-objects (1+ i) (cons code codes)
(addr+ addr code)))
(fold append
`(,@(dump-object (array-shape x) addr)
(make-array ,(quotient (ash len -16) 256)
,(logand #xff (ash len -8))
,(logand #xff len)))
codes)))))
(else
(error "dump-object: unrecognized object" x))))
(define (dump-constants constants)
(define (ref-or-dump x i addr)
(let ((pair (vhash-assoc x constants)))
(if (and pair (< (cdr pair) i))
(let ((idx (cdr pair)))
(if (< idx 256)
(values `((object-ref ,idx))
(+ addr 2))
(values `((long-object-ref ,(quotient idx 256)
,(modulo idx 256)))
(+ addr 3))))
(dump1 x i addr))))
(define (dump1 x i addr)
(cond
((object->assembly x)
=> (lambda (code)
(values (list code)
(+ (byte-length code) addr))))
((or (number? x)
(string? x)
(symbol? x)
(keyword? x))
;; Atoms.
(let ((code (dump-object x addr)))
(values code (addr+ addr code))))
((variable-cache-cell? x)
(dump1 (variable-cache-cell-key x) i addr))
((scheme-list? x)
(receive (codes addr)
(fold2 (lambda (x codes addr)
(receive (subcode addr) (ref-or-dump x i addr)
(values (cons subcode codes) addr)))
x '() addr)
(values (fold append
(let ((len (length x)))
`((list ,(quotient len 256) ,(modulo len 256))))
codes)
(+ addr 3))))
((pair? x)
(receive (car-code addr) (ref-or-dump (car x) i addr)
(receive (cdr-code addr) (ref-or-dump (cdr x) i addr)
(values `(,@car-code ,@cdr-code (cons))
(1+ addr)))))
((and (vector? x)
(equal? (array-shape x) (list (list 0 (1- (vector-length x))))))
(receive (codes addr)
(vector-fold2 (lambda (x codes addr)
(receive (subcode addr) (ref-or-dump x i addr)
(values (cons subcode codes) addr)))
x '() addr)
(values (fold append
(let ((len (vector-length x)))
`((vector ,(quotient len 256) ,(modulo len 256))))
codes)
(+ addr 3))))
((and (array? x) (symbol? (array-type x)))
(receive (type addr) (ref-or-dump (array-type x) i addr)
(receive (shape addr) (ref-or-dump (array-shape x) i addr)
(let ((bv (align-code `(load-array ,(uniform-array->bytevector x))
addr 8 4)))
(values `(,@type ,@shape ,@bv)
(addr+ addr bv))))))
((array? x)
(let ((contents (array-contents x)))
(receive (codes addr)
(vector-fold2 (lambda (x codes addr)
(receive (subcode addr) (ref-or-dump x i addr)
(values (cons subcode codes) addr)))
contents '() addr)
(receive (shape addr) (ref-or-dump (array-shape x) i addr)
(values (fold append
(let ((len (vector-length contents)))
`(,@shape
(make-array ,(quotient (ash len -16) 256)
,(logand #xff (ash len -8))
,(logand #xff len))))
codes)
(+ addr 4))))))
(else
(error "write-table: unrecognized object" x))))
(receive (codes addr)
(vhash-fold-right2 (lambda (obj idx code addr)
;; The vector is on the stack. Dup it, push
;; the index, push the val, then vector-set.
(let ((pre `((dup)
,(object->assembly idx))))
(receive (valcode addr) (dump1 obj idx
(addr+ addr pre))
(values (cons* '((vector-set))
valcode
pre
code)
(1+ addr)))))
constants
'(((assert-nargs-ee/locals 1)
;; Push the vector.
(local-ref 0)))
4)
(let* ((len (1+ (vlist-length constants)))
(pre-prog-addr (+ 2 ; reserve-locals
len 3 ; empty vector
2 ; local-set
1 ; new-frame
2 ; local-ref
))
(prog (align-program
`(load-program ()
,(+ addr 1)
#f
;; The `return' will be at the tail of the
;; program. The vector is already pushed
;; on the stack.
. ,(fold append '((return)) codes))
pre-prog-addr)))
(values `(;; Reserve storage for the vector.
(assert-nargs-ee/locals ,(logior 0 (ash 1 3)))
;; Push the vector, and store it in slot 0.
,@(make-list len '(make-false))
(vector ,(quotient len 256) ,(modulo len 256))
(local-set 0)
;; Now we open the call frame.
;;
(new-frame)
;; Now build a thunk to init the constants. It will
;; have the unfinished constant table both as its
;; argument and as its objtable. The former allows it
;; to update the objtable, with vector-set!, and the
;; latter allows init code to refer to previously set
;; values.
;;
;; Grab the vector, to be the objtable.
(local-ref 0)
;; Now the load-program, properly aligned. Pops the vector.
,@prog
;; Grab the vector, as an argument this time.
(local-ref 0)
;; Call the init thunk with the vector as an arg.
(call 1)
;; The thunk also returns the vector. Leave it on the
;; stack for compile-assembly to use.
)
;; The byte length of the init code, which we can
;; determine without folding over the code again.
(+ (addr+ pre-prog-addr prog) ; aligned program
2 ; local-ref
2 ; call
)))))
|