-
Notifications
You must be signed in to change notification settings - Fork 6
/
comfy-6502.lisp
1648 lines (1431 loc) · 53.8 KB
/
comfy-6502.lisp
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
;;; -*- mode: Lisp; Syntax: ANSI-Common-Lisp; Package: (COMFY-6502 ("6502" "CL")); -*-
;;;
;;; comfy-6502.lisp $Revision: 1.11 $
;;;
;;;
;;; LICENSE: This software is based on source code published by the
;;; Association for Computing Machinery (ACM) in Sigplan Notices.
;;; Therefore it is subject to the ACM Software License Agreement.
;;; This grants to the user a royalty-free, nonexclusive right to
;;; execute, copy, modify, and distribute both the binary and source
;;; code solely for academic, researce noncommercial
;;; uses.
;;;
;;; See ACM-LICENSE.txt for details.
;;;
;;; JAO: attempt to change to emit symbolic 6502 mnemonics so I can
;;; read the generated code without a disassembler.
;;;
;;; Common Lisp version of COMFY-6502
;;; From http://home.pipeline.com/~hbaker1/sigplannotices/CFYCMP1.LSP
;;;
;;; See Henry G. Baker, `The COMFY 6502 Compiler,'
;; Garbage In, Garbage Out, Sigplan Notices,
;;; September 1997
;;; available in TeX format as
;;; http://home.pipeline.com/~hbaker1/sigplannotices/column04.tex.gz
;;;
;;;
;;; todo: figure out what the (seq break return) in the example should
;;; do. Now, it ends up emitting a "nil RTS".
;;; a few Lisp utility functions
(cl:defpackage "COMFY-6502"
(:use "6502" "CL")
(:shadow "COMPILE" "CONSTANTP" "VARIABLEP" "BREAK"
"IF" "+" "-" "1+" "1-" "NOT" "LOOP" ;; "PROG"
"FOR"
;; "WHEN" "UNLESS" ; candidates for control macros
)
(:export "COMPILE" "INIT" "*MEM*" "RELOCATE"
;; "WHEN" "UNLESS"
"EQU"
"A" "S" "I@" "@J" "#" "I" "J"
"X@" "@Y" "X" "Y"
"COMFY-6502-ERROR" "OPCODE-ERROR" "ADDRESS-MODE-ERROR"
"IF-ERROR" "PROBLEM" "ERROR-FORM" "ERROR-OPCODE" "ERROR-MODE"
"WHILE-ERROR"
"COMFY-MACROEXPAND" "DEFINE-CMACRO"
"SEQ" "ALT" "IF" "NOT" "WHILE" "LOOP"
"STAR" ;; "PROG"
"FORI" "FORJ" "MOVE"
"LISP"
"ST" "L" "C" "STJ" "LJ" "CJ" "STI" "LI" "CI"
"+" "-" "1+" "1-"
"I+1" "I-1" "J+1" "J-1"
"LOR" "LAND" "LXOR"
"ASL" "RL" "LSR" "RR"
"?" "NOP"
"C=0" "C=1"
"SEB" "CLB" "V=0"
"=?" "~=?"
"=0?" "ZERO?" "~=0?"
"C=0?" "CARRY?" "C=1?" "LLT" "LGE"
"V=0?" "V=1?" "<?" ">=?" "<0?" ">=0?"
"BINARY" "DECIMAL" "ENABLE" "DISABLE"
"TRAP" "BREAK" "SAVE" "RESTORE"
"PUSH" "POP"
"RETURN" "RESUME"))
(cl:in-package "COMFY-6502")
;;; Basic test instructions.
(setf (get 'c=1? 'test) 'BCS
(get 'carry? 'test) 'BCS) ;;; test carry=1. ; BCS
(setf (get 'c=0? 'test) 'BCC) ;;; test carry=0. ; BCC
(setf (get 'llt 'test) 'BCC) ;;; logically less than. ; BCC
(setf (get 'lge 'test) 'BCS) ;;; logically greater than or equal. ; BCS
(setf (get '=? 'test) 'BEQ) ;;; equal. ; BEQ
(setf (get '~=? 'test) 'BNE) ;;; not equal. ; BNE
(setf (get '=0? 'test) 'BEQ
(get 'zero? 'test) 'BEQ) ;;; equals zero. ; BEQ
(setf (get '~=0? 'test) 'BNE) ;;; not equal to zero. ; BNE
(setf (get 'v=1? 'test) 'BVS) ;;; test overflow=1. ; BVS
(setf (get 'v=0? 'test) 'BVC) ;;; test overflow=0. ; BVC
(setf (get '<? 'test) 'BMI) ;;; test arithmetic less than. ; BMI
(setf (get '>=? 'test) 'BPL) ;;; test arithmetic greater than or equal. ; BPL
(setf (get '<0? 'test) 'BMI) ;;; test arithmetic less than zero. ; BMI
(setf (get '>=0? 'test) 'BPL) ;;; test airthmetic greater than or equal to zero. ; BPL
;;; Group 0.
(setf (get '? 'skeleton) 'BIT
(get 'BIT 'skeleton) 'BIT) ;;; test.
(setf (get 'stj 'skeleton) 'STY
(get 'STY 'skeleton) 'STY) ;;; store j, TYA
(setf (get 'TYA 'skeleton) 'TYA)
(setf (get 'lj 'skeleton) 'LDY
(get 'LDY 'skeleton) 'LDY) ;;; load j, TAY
(setf (get 'TAY 'skeleton) 'TAY)
(setf (get 'cj 'skeleton) 'CPY
(get 'CPY 'skeleton) 'CPY) ;;; compare j
(setf (get 'ci 'skeleton) 'CPX
(get 'CPX 'skeleton) 'CPX) ;;; compare i.
;;; Group 1.
(setf (get 'lor 'skeleton) 'ORA
(get 'ORA 'skeleton) 'ORA) ;;; logical or.
(setf (get 'land 'skeleton) 'AND
(get 'AND 'skeleton) 'AND) ;;; logical and.
(setf (get 'lxor 'skeleton) 'EOR
(get 'EOR 'skeleton) 'EOR) ;;; logical xor.
(setf (get '+ 'skeleton) 'ADC
(get 'ADC 'skeleton) 'ADC) ;;; add with carry.
(setf (get 'st 'skeleton) 'STA
(get 'STA 'skeleton) 'STA) ;;; store accumulator.
(setf (get 'l 'skeleton) 'LDA
(get 'LDA 'skeleton) 'LDA) ;;; load accumulator.
(setf (get 'c 'skeleton) 'CMP
(get 'CMP 'skeleton) 'CMP) ;;; compare accumulator.
(setf (get '- 'skeleton) 'SBC
(get 'SBC 'skeleton) 'SBC) ;;; subtract with borrow.
;;; Group 2.
(setf (get 'asl 'skeleton) 'ASL) ;;; arithmetic shift left.
(setf (get 'rl 'skeleton) 'ROL
(get 'ROL 'skeleton) 'ROL) ;;; rotate left.
(setf (get 'lsr 'skeleton) 'LSR) ;;; logical shift right.
(setf (get 'rr 'skeleton) 'ROR
(get 'ROR 'skeleton) 'ROR) ;;; rotate right.
(setf (get 'sti 'skeleton) 'STX
(get 'STX 'skeleton) 'STX) ;;; store i, TXA, TXS
(setf (get 'TXA 'skeleton) 'TXA)
(setf (get 'TXS 'skeleton) 'TXS)
(setf (get 'li 'skeleton) 'LDX
(get 'LDX 'skeleton) 'LDX) ;;; load i, TAX, TSX
(setf (get 'TAX 'skeleton) 'TAX)
(setf (get 'TSX 'skeleton) 'TSX)
(setf (get '1- 'skeleton) 'DEC
(get 'DEC 'skeleton) 'DEC) ;;; decrement. ;; DEC A not a 6502 opcode.
(setf (get '1+ 'skeleton) 'INC
(get 'INC 'skeleton) 'INC) ;;; increment. ;; INC A not a 6502 opcode.
;;; random instructions.
(setf (get 'trap 'skeleton) 'BRK) ;;; programmed break.
(setf (get 'save 'skeleton) 'PHP
(get 'PHP 'skeleton) 'PHP) ;;; push processor state onto stack
(setf (get 'restore 'skeleton) 'PLP
(get 'PLP 'skeleton) 'PLP) ;;; restore processor state from stack.
(setf (get 'push 'skeleton) 'PHA
(get 'PHA 'skeleton) 'PHA) ;;; push accumulator onto stack.
(setf (get 'pop 'skeleton) 'PLA
(get 'PLA 'skeleton) 'PLA) ;;; pop accumulator from stack.
(setf (get 'c=0 'skeleton) 'CLC
(get 'CLC 'skeleton) 'CLC ;;; clear carry.
(get 'seb 'skeleton) 'CLC) ;;; (== set borrow.)
(setf (get 'c=1 'skeleton) 'SEC ;;; set carry. ; SEC
(get 'SEC 'skeleton) 'SEC
(get 'clb 'skeleton) 'SEC) ;;; (== clear borrow.)
(setf (get 'v=0 'skeleton) 'CLV
(get 'CLV 'skeleton) 'CLV) ;;; clear overflow. ; CLV
(setf (get 'enable 'skeleton) 'CLI
(get 'CLI 'skeleton) 'CLI) ;;; enable interrupts. ; CLI
(setf (get 'disable 'skeleton) 'SEI
(get 'SEI 'skeleton) 'SEI) ;;; disable interrupts. ; SEI
(setf (get 'binary 'skeleton) 'CLD
(get 'CLD 'skeleton) 'CLD) ;;; set binary mode. ; CLD
(setf (get 'decimal 'skeleton) 'SED
(get 'SED 'skeleton) 'SED) ;;; set decimal mode. ; SED
(setf (get 'i+1 'skeleton) 'INX
(get 'INX 'skeleton) 'INX) ;;; increment i. ; INX
(setf (get 'j+1 'skeleton) 'INY
(get 'INY 'skeleton) 'INY) ;;; increment j. ; INY
(setf (get 'i-1 'skeleton) 'DEX
(get 'DEX 'skeleton) 'DEX) ;;; decrement i. ; DEX
(setf (get 'j-1 'skeleton) 'DEY
(get 'DEY 'skeleton) 'DEY) ;;; decrement j. ; DEY
(setf (get 'nop 'skeleton) 'NOP) ;;; no operation. ; NOP
(defvar jmp (6502:make-symbolic-opcode 'JMP :absolute)) ; JMP absolute
(defvar jsr (6502:make-symbolic-opcode 'JSR :absolute)) ; JSR absolute
(defvar break (6502:make-symbolic-opcode 'BRK :implied))
(setf (get 'return 'jump) (6502:make-symbolic-opcode 'RTS :implied))
(setf (get 'RTS 'jump) (get 'return 'jump)) ; RTS
(setf (get 'resume 'jump) (6502:make-symbolic-opcode 'RTI :implied)) ; RTI
(setf (get 'RTI 'jump) (get 'resume 'jump))
;; Condition types.
(defvar *current-form* nil "Form currently being compiled.")
(define-condition comfy-6502-error (error)
((error-form :reader error-form :initarg :error-form
:initform *current-form*))
(:report (lambda (condition stream)
(format stream "COMFY-6502-ERROR compiling form ~A"
(error-form condition)))))
(define-condition opcode-error (comfy-6502-error)
((error-opcode :reader error-opcode :initarg :error-opcode)
(problem :reader problem :initarg :problem))
(:report (lambda (condition stream)
(format stream "COMFY-6502 Opcode ~A ~A in form ~A"
(error-opcode condition)
(problem condition)
(error-form condition)))))
(define-condition address-mode-error (comfy-6502-error)
((error-mode :reader error-mode :initarg :error-mode)
(problem :reader problem :initarg :problem))
(:report (lambda (condition stream)
(format stream "COMFY-6502 Address mode ~A ~A in form ~A"
(error-opcode condition)
(problem condition)
(error-form condition)))))
;; opcode manipulations
(defun inv (c)
;;; invert the condition for a branch.
;;; invert bit 5 (counting from the right).
(cond
((eql c 'BCS) 'BCC)
((eql c 'BCC) 'BCS)
((eql c 'BEQ) 'BNE)
((eql c 'BNE) 'BEQ)
((eql c 'BVS) 'BVC)
((eql c 'BVC) 'BVS)
((eql c 'BMI) 'BPL)
((eql c 'BPL) 'BMI)
(t (error 'opcode-error :error-opcode c
:problem "is not a branch"))))
(defun skeleton (op)
(let ((skel (get op 'skeleton)))
(cl:unless skel
(error 'opcode-error :error-opcode op
:problem "not an implied opcode"))
skel))
;; Accumulator opcode includes a few "puns" from Baker's original
;; (li a) is TAX, (lj a) is TAY
;; (sti a) is TXA, (stj a) is TYA
;; ASL A, LSR A, ROL A, ROR A are the only others in basic
;; 6502
(defun accumulator-op (op)
(let ((skel (skeleton op)))
(cond ((eq skel 'LDX) (make-symbolic-opcode 'TAX :implied))
((eq skel 'LDY) (make-symbolic-opcode 'TAY :implied))
((eq skel 'STX) (make-symbolic-opcode 'TXA :implied))
((eq skel 'STY) (make-symbolic-opcode 'TYA :implied))
((member skel 6502::+shift/rotate-opcodes+)
(make-symbolic-opcode (skeleton op) :ACCUMULATOR))
(t (error 'opcode-error :error-opcode op
:problem "does not support ACCUMULATOR mode")))))
(defun stack-op (op)
(let ((skel (skeleton op)))
(cond ((eq skel 'LDX) (make-symbolic-opcode 'TSX :implied))
((eq skel 'STX) (make-symbolic-opcode 'TXS :implied))
(t (error 'opcode-error :error-opcode op
:problem "does not support STACK mode")))))
;; implied includes also opcodes which can default to "A"
;; mode if no operand is given.
;; ASL A, LSR A, ROL A, ROR A are the only ones in basic 6502
(defun implied-op (op)
(let ((skel (skeleton op)))
(cond
((member skel 6502::+implied-opcodes+)
(make-symbolic-opcode skel :IMPLIED))
((member skel 6502::+shift/rotate-opcodes+)
(make-symbolic-opcode skel :ACCUMULATOR))
(t (error 'opcode-error :error-opcode op
:problem "does not support IMPLIED mode")))))
;; immediate (8-bit constant) operations
(defun immediate-op (op)
(make-symbolic-opcode (skeleton op) :IMMEDIATE))
(defun absolute-op (op)
(make-symbolic-opcode (skeleton op) :ABSOLUTE))
(defun abs-to-zp-marker (marker)
(cond
((eq marker :ABSOLUTE-X) :ZERO-PAGE-X)
((eq marker :ABSOLUTE) :ZERO-PAGE)
(T (error 'address-mode-error
:error-mode marker
:problem " has no zero page equivalent"))))
(defmethod abs-to-zp ((op 6502:symbolic-opcode))
(make-symbolic-opcode (opcode op) (abs-to-zp-marker (address-mode op))))
(defun zp-op (op)
(make-symbolic-opcode (skeleton op) :ZERO-PAGE))
(defun x-indirect-op (op)
(make-symbolic-opcode (skeleton op) :ZP-X-INDIRECT))
(defun indirect-y-op (op)
(make-symbolic-opcode (skeleton op) :ZP-INDIRECT-Y)) ;
(defun absolute-x (op)
(make-symbolic-opcode (skeleton op) :ABSOLUTE-X))
(defun absolute-y (op)
(make-symbolic-opcode (skeleton op) :ABSOLUTE-Y))
;;; process opcode symbols/macro symbols
(defun testp (e)
;;; predicate to tell whether "e" is a test.
(and (symbolp e) (get e 'test)))
(defun actionp (e)
;;; predicate to tell whether "e" is an action.
(and (symbolp e) (cl:not (get e 'test))))
(defun jumpp (e)
;;; predicate to tell whether "e" is a jump-type action.
(and (symbolp e) (get e 'jump)))
(defun macrop (x)
(and (symbolp x) (get x 'cmacro)))
(defvar *mem* nil
"List where the compiled code is placed.
Contains elements of the following types: symbolic opcodes,
constant numbers (which must fit in one byte), or lists
of the following forms
(:BYTE <expr>) : a one-byte number
(:BRANCH <number>) : a one-byte branch, with the destination relative
to the BRANCH byte (off-by-one from 6502 branch value)
(:LONG-BRANCH <number>) : a two-byte branch, destination relative to the
first of the two LONG-BRANCH bytes (6502 absolute
jump will be calculated during relocation)
(:ZERO-PAGE <expr>) : a zero-page address reference.
(:ABSOLUTE <expr>) : a two-byte address reference.")
(defvar *f* 0
"Compiled code length counter. It reflects how many bytes of code have been
emitted into the list.")
(defvar *symbol-table* (make-hash-table))
(defun init ()
(setf *mem* nil)
(setq *f* 0))
(init)
(defun mem-length (obj)
"Given an object that can be in the emitted code list, returns the
size of the object in bytes."
(cond ((numberp obj)
(cl:if (<= -128 obj 255)
1
(error "Exceeds byte range")))
((eq (class-of obj) (find-class '6502:symbolic-opcode))
1)
((consp obj)
(cond ((or (eq (car obj) :BRANCH)
(eq (car obj) :ZERO-PAGE)
(eq (car obj) :BYTE))
1)
((or (eq (car obj) :LONG-BRANCH)
(eq (car obj) :ABSOLUTE)
(eq (car obj) :WORD))
2)))
(t (error "Unknown object."))))
(defun relocate (code-vector org-address)
"Convert a list of compiled elements into a list of byte values,
by resolving branch and address references. ORG-ADDRESS is the
absolute address of the first element of the list. All addresses
must be in numeric form."
(let ((addr org-address)
(linked nil))
(labels ((relocate-branch (br)
(cl:unless (<= -127 (second br) 128)
(error "Illegal short branch"))
(cl:push (cl:+ (second br) 1) linked)
(incf addr))
(relocate-long-branch (br)
(let ((abs (cl:+ (second br) addr)))
(cl:push (ldb (byte 8 0) abs) linked)
(cl:push (ldb (byte 8 8) abs) linked)
(incf addr 2)))
(relocate-zp (zp)
(cl:push (ldb (byte 8 0) (second zp)) linked)
(incf addr))
(relocate-abs (abs)
(cl:push (ldb (byte 8 0) (second abs)) linked)
(cl:push (ldb (byte 8 8) (second abs)) linked)
(incf addr 2)))
(dolist (obj code-vector (nreverse linked))
(cond ((numberp obj) (cl:push obj linked) (incf addr))
((eq (class-of obj) (find-class '6502:symbolic-opcode))
(cl:push obj linked)
(incf addr))
((consp obj)
(case (car obj)
(:BYTE (cl:push (second obj) linked))
(:BRANCH (relocate-branch obj))
(:LONG-BRANCH (relocate-long-branch obj))
(:ZERO-PAGE (relocate-zp obj))
(:ABSOLUTE (relocate-abs obj))))
(t (error "Don't know how to relocate ~S" obj)))))))
(defun memref (f)
"Convert an integer memory position F into the portion of the
*MEM* list beginning at that point. *F* contains the total byte count.
F is measured relative to the first emitted byte, i.e. the last byte
in the list.
F = 0 refers to the last element of the list, F = *F* the first."
(cl:if (> f *f*)
(error "Reference to non-existent location.")
(do ((distance (cl:- *f* f) distance)
(ptr *mem* (cdr ptr)))
((<= distance 0) ptr)
(decf distance (mem-length (car ptr))))))
(defun gen (obj)
;;; place one character "obj" into the stream.
(incf *f*)
(cl:push obj *mem*)
*f*)
(defun update-long-branch (location addr)
"Replace the long-branch address argumnet of the instruction
located at offset LOCATION with the (relative) address ADDR.
LOCATION is the offset of the JMP/JSR instruction itself."
(let* ((ptr (memref location))
(inst (car ptr))
(branch (second ptr)))
(cl:unless (and (eq (class-of inst) (find-class '6502:symbolic-opcode))
(equal (car branch) :LONG-BRANCH))
(error "update-long-branch: not an long branch address"))
(setf (second branch) (cl:- location addr 1))
location))
(defun genbr (win)
;;; generate an unconditional jump to "win".
;;; (genbr NIL) creates a unconditional jump with a NIL destination.
;;;
;;; JMP (:LONG-BRANCH dist) [current *f*] ...
;;; dist = 2 branches to current *f*; win below f increases distance
(let ((distance (cl:if (null win)
nil
(cl:+ 2 (cl:- *f* win)))))
(cl:push (list :LONG-BRANCH distance) *mem*)
(incf *f* 2)
(gen jmp)
*f*))
(defun 8bitp (n)
(let* ((m (logand n -128)))
(or (= 0 m) (= -128 m))))
(defun genbrc (c win lose)
;;; generate an optimized conditional branch
;;; on condition c to "win" with failure to "lose".
;;; JAO: what is the definition of the return value?
;;; JAO: the address to "enter" the branch
;;; JAO: note, that if win=lose this will return win without generating
;;; code.
;;; JAO...dependent on branch range as well as length of instructions
;;;
;;; win/lose are relative to location past end of *mem* = 0
;;; win/lose = *f* are to location at beginning of *mem*
(let* ((w (cl:- *f* win))
(l (cl:- *f* lose))) ;;; Normalize to current point.
(labels ((gen-instruction (cond)
(gen (6502:make-symbolic-opcode cond :branch-relative)))
(gen-branch (loc)
(gen (list :BRANCH loc))))
(cond
;; win and lose equivalent
;; ((= w l) (print "case 1") win)
;; ... no test needed and no instructions to emit
((and (= l 0) (= w 0)) win)
;; win and lose equivalent, but do we need to emit a branch there?
;; three byte absolute jump always shorter than Bwin w+2 Blose l
;; but an 8-bit BRA (as in 65c02) would allow a one-byte savings
;; here for w,l within 8 bit branch
;; ...the BRA change could also go in genbr...
((= w l) win) ;; (genbr win))
;; JAO: lose is falling through, w is a short branch
;; note, 6502 branch values are a "delta" of the PC from the
;; ordinary PC=next-instruction
;; B<win-condition> (:BRANCH w) ...losing instructions...
((and (= l 0) (8bitp w))
(gen-branch (cl:1+ w))
(gen-instruction c))
;; win is falling through, l is a short branch
;; B<lose-condition> (:BRANCH l) ...winning instructions...
((and (= w 0) (8bitp l))
(gen-branch (cl:1+ l))
(gen-instruction (inv c)))
;; note in this case, w+2 because we must reach
;; w relative to freshly emitted two-byte branch
;; B<win-condition> w+2 B<lose-condition> l [l or w bytes skipped] ...
((and (8bitp l) (8bitp (cl:+ w 2)))
(gen-branch (cl:1+ l))
(gen-instruction (inv c))
(gen-branch (cl:+ w 3))
(gen-instruction c))
;; rare case when switching win & lose is just enough to reach w
;; with a short branch.
;; B<lose-condition> l+2 B<win-condition> w [l or w bytes skipped]
;; case 6
((and (8bitp w) (8bitp (cl:+ l 2)))
(gen-branch (cl:1+ w))
(gen-instruction c)
(gen-branch (cl:+ l 3))
(gen-instruction (inv c)))
;; JAO: lose can be reached through short branch, win is long
;; result will be
;; B<lose-condition> <l+3> JMP win-lo win-high <l bytes skipped>
;; ...losing instructions...
;; generated by moving win to front of instruction stream
;; and using the win-is-falling-through, l is short branch case
;; treated above
;; case 7: long branch to win, recurse through case 4
((8bitp (cl:+ l 3))
(genbrc c (genbr win) lose))
;; case 8: long branch to lose, recurse through case 7
;; default: B<lose-condition> 3 JMP win-lo win-hi JMP lose-lo lose-hi
;; but generated by moving lose to front of instruction stream
;; and using lose-is-short-branch, win long branch (previous clause)
(t (genbrc c win (genbr lose)))))))
(defun one-byte-gen (op-code a)
;;; put op code and one-byte argument into stream.
;;; op-code should be the correct addressing mode
(let* ((la (cl:if (numberp a)
(logand a 255)
a)))
(gen la)
(gen op-code)))
(defun zero-page-ref (value original-form)
"Return (:ZERO-PAGE ...) if value is a valid zero-page address,
or something symbolic and asserted to be zero-page by the user.
NIL if value not guaranteed or asserted to be zero-page"
(cond
((numberp value)
(cl:if (<= 0 value 255)
(list :ZERO-PAGE value)
nil))
((symbolp value)
(cl:when (eq value :ZERO-PAGE)
(list :ZERO-PAGE original-form)))
((consp value)
(cl:when (eq (car value) :ZERO-PAGE)
value))
(t nil)))
(defun absolute-ref (value original-form)
"Return (:ABSOLUTE ...) if value is a valid address,
or something symbolic."
(cond
((numberp value)
(cl:if (<= -32768 value 65535)
(list :ABSOLUTE value)
(error "Exceeds address range.")))
((symbolp value)
(cl:when (or (eq value :ABSOLUTE) (eq value :ZERO-PAGE))
(list :ABSOLUTE original-form)))
((consp value)
(cl:when (or (eq (car value) :ZERO-PAGE)
(eq (car value) :ABSOLUTE))
value))
(t nil)))
(defun ogen (op-code a)
;;; put out address and op code into stream.
;;; compact to one byte zero page address, if possible.
;;; op-code should be the absolute addressing mode.
(let* ((argval (eval-address-expression a *symbol-table*))
(zp (zero-page-ref argval a)))
(cl:if zp
(one-byte-gen (abs-to-zp op-code) zp)
(let ((abs (absolute-ref argval a)))
(cl:if abs
(gen-absolute op-code abs)
(error "Invalid address argument ~A" a))))))
(defun gen-zero-page (opcode arg)
(gen (eval-zp-expression arg *symbol-table*))
(gen opcode))
(defun gen-absolute (opcode arg)
(cl:push (eval-absolute-expression arg *symbol-table*) *mem*)
(incf *f* 2)
(gen opcode))
(defun emit-byte (arg)
(gen (list :BYTE (eval-immediate-expression arg *symbol-table*))))
(defun emit (i win)
(let ((*current-form* i))
;;; place the unconditional instruction "i" into the stream with
;;; success continuation "win".
(cond ((cl:not (= win *f*)) (emit i (genbr win)))
;;; atom is a single character instruction.
((symbolp i) (gen (implied-op i)))
;;; no op code indicates a subroutine call.
((null (cdr i)) (gen-absolute jsr (car i)))
;;; "a" indicates the accumulator.
((eq (cadr i) 'a) (gen (accumulator-op (car i))))
;;; "s" indicates the stack.
((eq (cadr i) 's) (gen (stack-op (car i))))
;;; length=2 indicates absolute addressing.
;;; might reduce to zero-page
((= (length i) 2)
(ogen (absolute-op (car i)) (cadr i)))
;;; "i" indicates absolute indexed by i.
;;; could be absolute-x or zero-page-x
((or (eq (cadr i) 'i)
(eq (cadr i) 'x))
(ogen (absolute-x (car i)) (caddr i)))
;;; "j" indicates absolute indexed by j.
;;; this cannot be optimized for page zero addresses.
((or (eq (cadr i) 'j)
(eq (cadr i) 'Y))
(gen-absolute (absolute-y (car i))
(caddr i)))
;;; "\#" indicates immediate operand.
;;; one-byte immediates only
((eq (cadr i) '\#)
(emit-byte (caddr i)) (gen (immediate-op (car i))))
;;; "i@" indicates index by i, then indirect.
;;; zero-page only
((or (eq (cadr i) 'i@)
(eq (cadr i) 'x@))
(gen-zero-page
(x-indirect-op (car i))
(caddr i)))
;;; "@j" indicates indirect, then index by j.
;;; zero-page only
((or (eq (cadr i) '@j)
(eq (cadr i) '@y))
(gen-zero-page
(indirect-y-op (car i))
(caddr i)))
(t (error 'comfy-6502-error)))))
;;; compile routines emit the relevant code; the return
;;; value is the address of the continuation produced.
;;; compilation emits the code starting at the last instruction.
;;; A;B;C;...
;;; each element is executed in sequence, with a common "lose"
;;; and the next element as the "win"
(defun compile-seq (seq-list win lose)
(cl:if (null seq-list)
win
(compile (car seq-list)
(compile-seq (cdr seq-list) win lose)
lose)))
;;; (<number> <form>) with win/lose
;;;
(defun compile-repeat (number form win lose)
(cl:if (zerop number)
win
(compile-repeat (cl:1- number) form
(compile form win lose)
lose)))
;;; if test-form win-test-form lose-test-form
;;; the resulting continuation executes the test-form.
;;; if that test succeeds, the win-test-form is executed (winning or losing)
;;; test fails, the lose-test-form is executed (winning or losing)
(define-condition if-error (comfy-6502-error)
((problem :reader problem :initarg :problem))
(:report (lambda (condition stream)
(format stream "COMFY-6502 ERROR compiling IF form ~A ~A"
(error-form condition)
(problem condition)))))
(defun compile-if (test-form win-form lose-form win lose)
(cl:when (null win-form)
(error 'if-error :problem "lacking win-form"))
(cl:when (null lose-form)
(error 'if-error :problem "lacking lose-form"))
(let ((win-test (compile win-form win lose))
(lose-test (compile lose-form win lose)))
(compile test-form win-test lose-test)))
;;;; while test-form body-form
;;; execute test-form
;;; if the test wins, execute body-form
;;; if body-form wins, loop through again
;;; if body-form loses, the whole while loses
;;; if the test loses, the body-form is not executed, but the
;;; whole while form wins.
(define-condition while-error (comfy-6502-error)
((problem :reader problem :initarg :problem))
(:report (lambda (condition stream)
(format stream "COMFY-6502 ERROR compiling WHILE form ~A ~A"
(error-form condition)
(problem condition)))))
(defun compile-while (test-form win-form win lose)
(cl:when (null test-form)
(error 'while-error :problem "lacking test-form"))
(cl:when (null win-form)
(error 'while-error :problem "lacking win-form"))
(let* ((jump-begin (genbr nil)) ; will fill with branch back to test-form
(while-entry
(compile test-form
(compile win-form jump-begin lose)
win)))
(update-long-branch jump-begin while-entry)
while-entry))
(define-condition loop-error (comfy-6502-error)
((problem :reader problem :initarg :problem))
(:report (lambda (condition stream)
(format stream "COMFY-6502 ERROR compiling LOOP form ~A ~A"
(error-form condition)
(problem condition)))))
(defvar *optimize-loop-branches* T "Enables optimization of loop branches")
(defun optimize-loop (bottom-jump)
"Attempt to optimize LOOP body; branch shorten conditional branches
to the BOTTOM-JUMP location, attempt to remove BOTTOM-JUMP or replace
it with a conditional backward branch.
FOR NOW: only shorten conditional branches."
(let* ((backward-jump (memref bottom-jump))
(backward-branch (cadr backward-jump)))
(unless (and (eq (class-of (car backward-jump))
(find-class 'symbolic-opcode))
(eq (opcode (car backward-jump)) '6502:JMP)
(eq (address-mode (car backward-jump)) :ABSOLUTE))
(error 'loop-error :problem "bad bottom jump"))
(unless (and (consp backward-branch)
(eq (car backward-branch) :LONG-BRANCH)
(numberp (cadr backward-branch)))
(error 'loop-error :problem "bad bottom branch"))
(let ((jump-length (cadr backward-branch)))
;;
;; (format t "optimizing loop: bottom-jump ~D ~
;; backward-branch ~A jump-length ~D~%"
;; bottom-jump backward-branch jump-length)
(do ((code-ptr *mem* (cdr code-ptr))
(obj-addr *f* (cl:- obj-addr (mem-length (car code-ptr)))))
((eq code-ptr backward-jump) *mem*)
(let ((code-obj (car code-ptr)))
(when (and *optimize-loop-branches*
(consp code-obj)
(eq (car code-obj) :BRANCH)
(numberp (cadr code-obj))
;; (not (format t "Branch length ~D obj-addr ~D~%"
;; (cadr code-obj) obj-addr))
(= (cl:- obj-addr (cadr code-obj)) bottom-jump)
;;(not (format t "Branches to absolute jump~%"))
)
(let ((net-length (cl:+ 1 (cadr code-obj) jump-length)))
(when (<= -127 net-length 128)
(setf (cadr code-obj) net-length)))))))))
;;; (loop loop-form)
;;; executes LOOP-FORM repeatedly. If LOOP-FORM ever fails, the
;;; loop fails.
;;;
;;; EXTENSION: "implied seq"
;;; (loop [forms]*) equivalent to (loop (seq [forms]*))
(defun compile-loop (loop-rest win lose)
(declare (ignore win)) ; LOOP can never win
;(unless (null (cdr loop-rest))
; (error "COMFY-6502:LOOP accepts only one form."))
(let* ((l (genbr nil))
(r (compile-seq loop-rest l lose)))
(update-long-branch l r)
(optimize-loop l)
r))
;;; IF, WHILE, LOOP, NOT, SEQ, <number>
(defun compile (e win lose)
;;; compile expression e with success continuation "win" and
;;; failure continuation "lose".
;;; "win" an "lose" are both addresses of stuff higher in memory.
(let ((*current-form* e))
(cond ((numberp e) (gen e)) ; allow constants.
((macrop e) ; symbol macros
(compile (comfy-macroexpand e) win lose))
((jumpp e) (gen (get e 'jump))) ; must be return or resume.
((actionp e) (emit e win)) ; single byte instruction.
((testp e) (genbrc (get e 'test) win lose)) ; test instruction
((eq (car e) 'comfy-6502:not) (compile (cadr e) lose win))
((eq (car e) 'seq) (compile-seq (cdr e) win lose))
((eq (car e) 'comfy-6502:loop) (compile-loop (cdr e) win lose))
((numberp (car e)) ; duplicate n times.
(compile-repeat (car e) (cadr e) win lose))
((eq (car e) 'if) ; if-then-else.
(cl:unless (null (cddddr e))
(error 'if-error :problem "too many forms"))
(compile-if (cadr e)
(caddr e) (cadddr e)
win lose))
((eq (car e) 'while) ; do-while.
(cl:unless (null (cdddr e))
(error 'while-error :problem "too many forms"))
(compile-while (cadr e) (caddr e) win lose))
((macrop (car e))
(compile (comfy-macroexpand e) win lose))
(t (emit e win)))))
;;; a pattern-matching macro definer, following Baker's COMFY macros
;;; interpretively matching patterns
;;; variables are indicated by symbols beginning with the character #\?
;;; e.g ?x, ?VAR, etc.
;;; FIXME: grossly inefficient pattern matcher. Grossness is centered in
;;; apply-expander-or-fail, which compiles a function *every time
;;; the COMFY macro is expanded.*
;;; probably don't need to eval-when these cmacro building functions
;;; to ensure defn before the (define-cmacro
;;; forms are executed. define-cmacro only has to
;;; affect the symbol plists in time for (comfy-6502:compile ...)
(defun match-variable-p (thing)
(and (symbolp thing) (char= (char (symbol-name thing) 0) #\?)))
(defun match-predicate (x)
(and (consp x) (eq (car x) :in)))
;;; Hopefully even better better version of matching.
;;; Uses macros to code up explicit Lisp code to traverse the
;;; expression, pattern matching along the way.
;;;
;;; create-match-function PATTERN VARS-BOUND
;;; given a pattern, and variables expected to be bound outside the pattern,
;;; returns two values:
;;; first, a function taking an EXPRESSION and VAR-BINDINGS returning
;;; two values: a boolean, indicating whether the match succeeded,
;;; and a list of variable-bindings
;;; (including the ones already established)
;;; and second, a list of variables newly bound, NOT including the ones to be
;;; in VARS-BOUND
;;;
;;; VARS-BOUND should simply be a list of the "match variable" names
;;;
(defun bound-value (var bindings)
(let ((pair (assoc var bindings)))
(cl:if pair
(cdr pair)
(error "No binding for variable ~A in bindings ~A." var bindings))))
(defmacro match-expression (pattern vars-bound expression-sym
&optional binding-sym)
"Expands to code returning a two values:
a boolean indicating successful match, and
an association list of bindings created (or NIL if the match failed).
VARS-BOUND is a list of pattern variables assumed to be bound already.
EXPRESSION-SYM is the name of the variable containing the expression.
BINDING-SYM, if non-nil, is a symbol which will refer to a variable
containing those bindings when the match is made."
(if (null binding-sym)
(let ((binding-sym (gensym)))
`(let (,binding-sym)
(match-expression pattern ,vars-bound ,expression-sym ,binding-sym)))
(cond
((null pattern)
`(values (null ,expression-sym) ,binding-sym))
((match-variable-p pattern)
(let ((var pattern))
(cl:if (member var vars-bound)
;; if a variable is already bound, the variable must match
`(values (eql ,expression-sym (bound-value ,var ,binding-sym))
,binding-sym)
;; otherwise, matches anything, creating a new binding
(progn
(push var vars-bound)
`(values t (cons (cons ,var ,expression-sym) ,binding-sym)))))
;;;; NOTE: instead of association list built-up at run time, the
;;;; macro should create variables for each match, recording the
;;;; gensym-d names. I.e., this should be
;;;; something like
;;;; (cl:if (member var vars-bound)
;;;; `(values (eql ,expression-sym ,(lookup-name-of var)) ,binding-sym)
;;;; (progn
;;;; (push (cons var (gensym)) vars-bound) ; add name for var
;;;; `(progn (setf ,(lookup-name-of var) ,expression-sym)
;;;; (push ,binding-sym (cons ,var ,expression-sym))
;;;; (values t ,binding-sym))
((atom pattern)
;; atoms match themselves, or fail; this also would cover NIL
`(values (eql ,expression-sym ,pattern) ,binding-sym))
((eq (car pattern) 'quote)
;; quoted elements in the pattern must be EQ to the expression
`(values (eq (cadr ,expression-sym) ,(cadr pattern)) ,binding-sym))
((match-predicate pattern)
(let ((predicate (cadr pattern))
(var (caddr pattern)))
(cl:if (endp (cddr pattern)) ; no binding
`(values (funcall ,predicate ,expression-sym) ,binding-sym)
(cl:if (member var vars-bound)
`(values
;; strange case: predicate check against already-bound
;; value...perhaps should error here.
;; see NOTE above regarding bound-value lookup
(and (funcall ,predicate ,expression-sym)
(eq ,expression-sym (bound-value ,var
,binding-sym)))
,binding-sym)
;; otherwise, check predicate and create new binding
(progn
(push var vars-bound)
`(progn
;; premature to push binding before checking
;; the predicate, but matches what I did in
;; pattern-lambda version, and might be handy
;; in diagnosing match failures...
(push (cons ,var ,expression-sym)
,binding-sym)
(values (funcall ,predicate ,expression-sym)
,binding-sym)))))))
;;; pattern is a CONS: match recursively
(t
(let ((car-result-sym (gensym))
(car-sym (gensym)))
`(if (consp ,expression-sym)
(let ((,car-sym (car ,expression-sym)))
(multiple-value-bind (,car-result-sym ,binding-sym)
(match-expression ,car-sym vars-bound)
(if (null (cdr pattern)) ; last element of list?
(multiple-value-bind (car-func car-bindings)
(create-match-function (car pattern) vars-bound)
(multiple-value-bind (cdr-func cdr-bindings)
(create-match-function (cdr pattern)
(append car-bindings vars-bound))
;;(format t "pattern: ~A~%vars-bound: ~A~%car-bindings: ~A~%cdr-bindings: ~A~%"
;; pattern vars-bound car-bindings cdr-bindings)
(values
(lambda (expr bindings)