-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsforth.fs
More file actions
1300 lines (1045 loc) · 40.6 KB
/
sforth.fs
File metadata and controls
1300 lines (1045 loc) · 40.6 KB
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
: \ 0A scan-until ; IMMEDIATE
: ( 29 scan-until ; IMMEDIATE
\ Stack ========================================================================
: sp+ 48 C, 8D C, 6D C, 08 C, ; \ lea 8(%rbp), %rbp
: sp- 48 C, 8D C, 6D C, F8 C, ; \ lea -8(%rbp), %rbp
\ TODO how is the reg encoded ?
\ : >reg ( off reg ) [ ?? C, 8B C, 45 C, C, ] ; \ mov off(%rbp), reg
\ : reg> ( off reg ) [ ?? C, 89 C, 45 C, C, ] ; \ mov reg, off(%rbp)
\ : >top ; mov xx, %r8
\ : top> ; mov %r8, xx
: DROP ( x -- ) [ 4C C, 8B C, 45 C, 00 C, sp+ ] ; \ mov (%rbp), %r8
: DUP ( x -- x x ) [ sp- 4C C, 89 C, 45 C, 00 C, ] ; \ mov %r8, (%rbp)
: SWAP ( x1 x2 -- x2 x1 ) [ 4C C, 87 C, 45 C, 00 C, ] ; \ xchg %r8, (%rbp)
: NIP ( x1 x2 -- x2 ) [ sp+ ] ;
: PICK ( xu...x1 x0 u -- xu...x1 x0 xu ) [
4E C, 8B C, 44 C, C5 C, 00 C, \ mov (%rbp, %r8, 8), %r8
] ;
: OVER ( x1 x2 -- x1 x2 x1 ) [
sp- 4C C, 89 C, 45 C, 00 C, \ mov %r8, (%rbp)
4C C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %r8
] ;
: TUCK ( x1 x2 -- x2 x1 x2 ) [
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax
4C C, 89 C, 45 C, 00 C, \ mov %r8, (%rbp)
sp-
48 C, 89 C, 45 C, 00 C, \ mov %rax, (%rbp)
] ;
: ROT ( x1 x2 x3 -- x2 x3 x1 ) [
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax
4C C, 89 C, 45 C, 00 C, \ mov %r8, (%rbp)
4C C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %r8
48 C, 89 C, 45 C, 08 C, \ mov %rax, 8(%rbp)
] ;
: -ROT ( x1 x2 x3 -- x3 x1 x2 ) [
48 C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %rax
4C C, 89 C, 45 C, 08 C, \ mov %r8, 8(%rbp)
4C C, 8B C, 45 C, 00 C, \ mov (%rbp), %r8
48 C, 89 C, 45 C, 00 C, \ mov %rax, (%rbp)
] ;
: ?DUP ( x -- 0 | x x ) [
49 C, 83 C, F8 C, 00 C, \ cmp $0x0,%r8
74 C, 08 C, \ je rel+8
sp-
4C C, 89 C, 45 C, 00 C, \ mov %r8,0x0(%rbp)
] ;
: rdrop ( -- ) ( R: x -- ) 48 C, 83 C, C4 C, 08 C, ; IMMEDIATE \ add $8, %rsp
: 2rdrop ( -- ) ( R: x -- ) 48 C, 83 C, C4 C, 10 C, ; IMMEDIATE \ add $16, %rsp
: SP@ ( -- addr ) [
sp- 4C C, 89 C, 45 C, 00 C, \ mov %r8, (%rbp)
4C C, 8D C, 45 C, 08 C, \ lea 8(%rbp), %r8
] ;
: >R ( -- x ) ( R: x -- )
41 C, 50 C, \ push %r8
4C C, 8B C, 45 C, 00 C, \ mov (%rbp), %r8
sp+
; IMMEDIATE
: R> ( -- x ) ( R: x -- )
sp-
4C C, 89 C, 45 C, 00 C, \ mov %r8, (%rbp)
41 C, 58 C, \ pop %r8
; IMMEDIATE
: R@ ( -- x ) ( R: x -- x )
sp-
4C C, 89 C, 45 C, 00 C, \ mov %r8, (%rbp)
4C C, 8B C, 04 C, 24 C, \ mov (%rsp), %r8
; IMMEDIATE
: 2>R ( x1 x2 -- ) ( R: -- x1 x2 )
FF C, 75 C, 00 C, \ push (%rbp)
41 C, 50 C, \ push %r8
4C C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %r8
48 C, 8D C, 6D C, 10 C, \ lea 16(%rbp), %rbp
; IMMEDIATE
: 2R> ( -- x1 x2 ) ( R: x1 x2 -- )
48 C, 8D C, 6D C, F0 C, \ lea -16(%rbp), %rbp
4C C, 89 C, 45 C, 08 C, \ mov %r8, 8(%rbp)
41 C, 58 C, \ pop %r8
8F C, 45 C, 00 C, \ pop (%rbp)
; IMMEDIATE
: 2R@ ( -- x1 x2 ) ( R: x1 x2 -- x1 x2 )
48 C, 8D C, 6D C, F0 C, \ lea -16(%rbp), %rbp
4C C, 89 C, 45 C, 08 C, \ mov %r8, 8(%rbp)
4C C, 8B C, 44 C, 24 C, 08 C, \ mov 8(%rsp), %r8
4C C, 89 C, 45 C, 00 C, \ mov %r8, (%rbp)
4C C, 8B C, 04 C, 24 C, \ mov (%rsp), %r8
; IMMEDIATE
: 2DROP ( x1 x2 -- ) DROP DROP ;
: 2DUP ( x1 x2 -- x1 x2 x1 x2 ) OVER OVER ;
: 2SWAP ( x1 x2 x3 x4 -- x3 x4 x1 x2 ) >R -ROT R> -ROT ;
: 2OVER ( x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2 ) 3 PICK 3 PICK ;
\ Memory =======================================================================
: ALIGNED ( addr -- a-addr ) ; \ Byte aligned
: @ ( addr -- x ) [ 4D C, 8B C, 00 C, ] ; \ movq (%r8), %r8
: ! ( x addr -- ) [
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax # x
49 C, 89 C, 00 C, \ movq %rax, (%r8)
4C C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %r8
48 C, 8D C, 6D C, 10 C, \ lea 16(%rbp), %rbp
] ;
: L! ( x addr -- ) [ \ Store long word (32bits)
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax # x
41 C, 89 C, 00 C, \ movq %rax, (%r8)
4C C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %r8
48 C, 8D C, 6D C, 10 C, \ lea 16(%rbp), %rbp
] ;
: +! ( n addr -- ) [
48 C, 8B C, 45 C, 00 C, \ movq (%rbp), %rax
49 C, 01 C, 00 C, \ addq %rax, (%r8)
4C C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %r8
48 C, 8D C, 6D C, 10 C, \ lea 16(%rbp), %rbp
] ;
: -! ( n addr -- ) [
48 C, 8B C, 45 C, 00 C, \ movq (%rbp), %rax
49 C, 29 C, 00 C, \ subq %rax, (%r8)
4C C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %r8
48 C, 8D C, 6D C, 10 C, \ lea 16(%rbp), %rbp
] ;
: 1+! ( addr -- ) [
49 C, FF C, 00 C, \ incq (%r8)
4C C, 8B C, 45 C, 00 C, \ mov (%rbp), %r8
sp+
] ;
: 1-! ( addr -- ) [
49 C, FF C, 08 C, \ decq (%r8)
4C C, 8B C, 45 C, 00 C, \ mov (%rbp), %r8
sp+
] ;
: C@ ( c addr -- c ) [ 4D C, 0F C, B6 C, 00 C, ] ; \ movzxb (%r8), %r8
: C! ( c addr -- ) [
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax # x
41 C, 88 C, 00 C, \ movb %al (%r8)
4C C, 8B C, 45 C, 08 C, \ mov 8(%rbp), %r8
48 C, 8D C, 6D C, 10 C, \ lea 16(%rbp), %rbp
] ;
: ON ( addr -- ) [
49 C, C7 C, 00 C, FF C, FF C, FF C, FF C, \ mov $-1, (%r8)
4C C, 8B C, 45 C, 00 C, sp+ \ mov (%rbp), %r8
] ;
: OFF ( addr -- ) [
49 C, C7 C, 00 C, 00 C, 00 C, 00 C, 00 C, \ mov $0, (%r8)
4C C, 8B C, 45 C, 00 C, sp+ \ mov (%rbp), %r8
] ;
: CHARS ( n1 -- n2 ) ; \ Do nothing
: CELLS ( n1 -- n2 ) [ 49 C, C1 C, E0 C, 03 C, ] ; \ shl $3, %r8
: CHAR+ ( addr1 -- addr2 ) [ 49 C, FF C, C0 C, ] ; \ incq %r8
: CHAR- ( addr1 -- addr2 ) [ 49 C, FF C, C8 C, ] ; \ dec %r8
: CELL+ ( addr1 -- addr2 ) [ 49 C, 83 C, C0 C, 08 C, ] ; \ add $8, %r8
: 2@ ( addr -- d ) DUP CELL+ @ SWAP @ ;
: 2! ( d addr -- ) SWAP OVER ! CELL+ ! ;
\ Arithmetic ===================================================================
: NEGATE ( n1 -- n2 ) [ 49 C, F7 C, D8 C, ] ; \ neg %r8
: 1+ ( n1 | u1 -- n2 | u2 ) [ 49 C, FF C, C0 C, ] ; \ incq %r8
: 1- ( n1 | u1 -- n2 | u2 ) [ 49 C, FF C, C8 C, ] ; \ dec %r8
: + ( n1 | u1 n2 | u2 -- n3 | u3 ) [
4C C, 03 C, 45 C, 00 C, sp+ \ add (%rbp), %r8
] ;
: D+ ( d1 d2 -- d3 ) [ ( l1:16 h1:8 l2:0 h2:r8 -- l3:16 h3:r8 )
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax l2
48 C, 01 C, 45 C, 10 C, \ addq %rax, 16(%rbp) l1 += l2 -> l3
4C C, 13 C, 45 C, 08 C, \ adcq 8(%rbp), %r8 h2 += h1 -> h3
48 C, 8D C, 6D C, 10 C, \ lea 16(%rbp), %rbp
] ;
: D- ( d1 d2 -- d3 ) [ ( l1:16 h1:8 l2:0 h2:r8 -- l3:16 h3:r8 )
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax l2
48 C, 29 C, 45 C, 10 C, \ subq %rax, 16(%rbp) l1 -= l2 -> l3
4C C, 1B C, 45 C, 08 C, \ sbbq 8(%rbp), %r8 h2 -= h1 -> -h3
49 C, F7 C, D8 C, \ neg %r8 h3
48 C, 8D C, 6D C, 10 C, \ lea 16(%rbp), %rbp
] ;
: - ( n1 | u1 n2 | u2 -- n3 | u3 ) [
4C C, 2B C, 45 C, 00 C, sp+ \ sub (%rbp),%r8
49 C, F7 C, D8 C, \ neg %r8
] ;
: * ( n1 n2 -- n3 ) [
4C C, 0F C, AF C, 45 C, 00 C, \ imul (%rbp), %r8 %r8 := n1 * n2
sp+
] ;
: S>D ( n -- d ) [
sp- 4C C, 89 C, 45 C, 00 C, \ mov %r8, (%rbp)
49 C, C1 C, F8 C, 3F C, \ sar $63, %r8 if r8<0 then -1 else 0
] ;
: D>S ( d -- n ) DROP ; \ Easy on 2's complement machine
: M* ( n1 n2 -- d ) [
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax
49 C, F7 C, E8 C, \ imul %r8
48 C, 89 C, 45 C, 00 C, \ mov %rax, (%rbp)
49 C, 89 C, D0 C, \ mov %rdx, %r8
] ;
: UM* ( u1 u2 -- ud ) [
48 C, 8B C, 45 C, 00 C, \ mov (%rbp), %rax
49 C, F7 C, E0 C, \ mul %r8
48 C, 89 C, 45 C, 00 C, \ mov %rax, (%rbp)
49 C, 89 C, D0 C, \ mov %rdx, %r8
] ;
: /MOD ( n1 n2 -- rem quot ) [
48 C, 8B C, 45 C, 00 C, \ movq (%rbp), %rax n1
48 C, 99 C, \ cqto
49 C, F7 C, F8 C, \ idiv %r8
49 C, 89 C, C0 C, \ movq %rax, %r8 quot
48 C, 89 C, 55 C, 00 C, \ movq %rdx, (%rbp) rem
] ;
: UM/MOD ( ud u -- rem quot ) [
48 C, 8B C, 45 C, 08 C, \ movq 8(%rbp), %rax u_low
48 C, 8B C, 55 C, 00 C, \ movq 0(%rbp), %rdx u_high
49 C, F7 C, F0 C, \ div %r8
49 C, 89 C, C0 C, \ movq %rax, %r8 quot
sp+
48 C, 89 C, 55 C, 00 C, \ movq %rdx, (%rbp) rem
] ;
: SM/REM ( d n -- rem quot ) [
48 C, 8B C, 45 C, 08 C, \ movq 8(%rbp), %rax u_low
48 C, 8B C, 55 C, 00 C, \ movq 0(%rbp), %rdx u_high
49 C, F7 C, F8 C, \ idiv %r8
49 C, 89 C, C0 C, \ movq %rax, %r8 quot
sp+
48 C, 89 C, 55 C, 00 C, \ movq %rdx, (%rbp) rem
] ;
: M+ ( d1 n -- d2 ) S>D D+ ;
: M- ( d1 n -- d2 ) S>D D- ;
: U/MOD ( u1 u2 -- u3 u4 ) 0 SWAP UM/MOD ;
: U* ( u1 u2 -- u3 ) UM* DROP ;
: / ( x1 x2 -- x3 ) /MOD NIP ;
: MOD ( x1 x2 -- x3 ) /MOD DROP ;
: */MOD ( n1 n2 n3 -- n4 n5 ) >R M* R> ( d n3 ) SM/REM ;
: U*/MOD ( u1 u2 u3 -- u4 u5 ) >R UM* R> ( ud u3 ) UM/MOD ;
: */ ( n1 n2 n3 -- n4 ) */MOD NIP ;
: shl-imm, ( u -- ) ( x -- x<<u ) 49 C, C1 C, E0 C, C, ; \ shl $u, %r8
: sar-imm, ( u -- ) ( x -- x<<u ) 49 C, C1 C, F8 C, C, ; \ shr $u, %r8
: 2* ( x1 -- x2 ) [ 1 shl-imm, ] ;
: 4* ( x1 -- x2 ) [ 2 shl-imm, ] ;
: 8* ( x1 -- x2 ) [ 3 shl-imm, ] ;
: 2/ ( x1 -- x2 ) [ 1 sar-imm, ] ;
: 4/ ( x1 -- x2 ) [ 2 sar-imm, ] ;
: 8/ ( x1 -- x2 ) [ 3 sar-imm, ] ;
: D2* ( xd1 -- xd2 ) [
48 C, D1 C, 65 C, 00 C, \ salq (%rbp) Low
49 C, D1 C, D0 C, \ rclq %8 High
] ;
: D2/ ( xd1 -- xd2 ) [
49 C, D1 C, F8 C, \ sarq %r8 High
48 C, D1 C, 5D C, 00 C, \ rclq (%rbp) Low
] ;
: LSHIFT ( x1 u -- x2 ) [
48 C, 8B C, 4D C, 00 C, \ mov (%rbp), %rcx
sp+
49 C, 87 C, C8 C, \ xchg %rcx, %r8
49 C, D3 C, E0 C, \ shl %cl, %r8
] ;
: RSHIFT ( x1 u -- x2 ) [
48 C, 8B C, 4D C, 00 C, \ mov (%rbp), %rcx
sp+
49 C, 87 C, C8 C, \ xchg %rcx, %r8
49 C, D3 C, E8 C, \ shr %cl, %r8
] ;
\ Unsigned double mixed multiplication
\ Double times single -> double product
\
\ Y X
\ 0 Z
\ * ______
\ B A B:A = X Z UM*
\ C 0 C = X Z U*
\ + ______
\ t2 t1 t2 t3 = A B 0 C D+
: UDM* ( ud1 u -- ud2 ) ( X Y Z -- t1 t2 )
TUCK ( X Z Y Z )
U* >R ( X Z ) ( R: C )
UM* ( A B )
R> ( A B C )
+ ( t1 t2 )
;
\ Verion yielding triple product
\
\ Y X
\ 0 Z
\ * _______
\ 0 B A B:A = X Z UM*
\ D C 0 D:C = X Z U*
\ + ________
\ t3 t2 t1 t3:t2:t1 = A B 0 C D+
\
\ : UDM* ( ud1 u -- t ) ( X Y Z -- t1 t2 t3 )
\ TUCK ( X Z Y Z )
\ UM* 2>R ( X Z ) ( R: C D )
\ UM* ( A B )
\ 0 2R> ( A B 0 C D )
\ D+ ( t1 t2 t3 )
\ ;
\ Unsigned double mixed division
\ Double dividend, single divisor, single remainder, double quotient
\ Can be modified for triple over single division
\
\ W Y X | Z
\ Z*Qh |______ \ 1: W:Y = Z*Qh + Rh Divide Y (0 extended) by Z
\ - ____ | Qh Ql
\ Rh X | \ 2: Rh:X = Z*Ql + Rl Divide X (Rh extended) by Z
\ Ql*Z |
\ - _____ |
\ Rl |
: UD/MOD ( t n -- rem dquot ) ( X Y Z -- Rl Ql Qh ) \ Same as in Gforth
TUCK ( X Z Y Z )
U/MOD >R ( X Z Rh ) ( R: Qh ) \ 1
SWAP ( X Rh Z )
UM/MOD R> ( Rl Ql Qh ) \ 2
;
\ Logical ======================================================================
: INVERT ( x1 -- x2 ) [ 49 C, F7 C, D0 C, ] ; \ not %r8
: AND ( x1 x2 -- x3 ) [ 4C C, 23 C, 45 C, 00 C, sp+ ] ; \ and (%rbp), %r8
: OR ( x1 x2 -- x3 ) [ 4C C, 0B C, 45 C, 00 C, sp+ ] ; \ or (%rbp), %r8
: XOR ( x1 x2 -- x3 ) [ 4C C, 33 C, 45 C, 00 C, sp+ ] ; \ xor (%rbp), %r8
\ Comparisons ==================================================================
\ x86 condition codes
: cc-o 0 ; : cc-no 1 ; : cc-b 2 ; : cc-ae 3 ;
: cc-e 4 ; : cc-ne 5 ; : cc-be 6 ; : cc-a 7 ;
: cc-s 8 ; : cc-ns 9 ; : cc-pe A ; : cc-po B ;
: cc-l C ; : cc-ge D ; : cc-le E ; : cc-g F ;
: 0cmp, ( cond -- ) ( n -- flag )
\ Invert cond and dec: if false then -1 (true) else 0 (false)
1 XOR 90 OR
49 C, 83 C, F8 C, 00 C, \ cmp $0, %r8
0F C, C, C0 C, \ setcc %al
FE C, C8 C, \ dec %al
4C C, 0F C, BE C, C0 C, \ movsx %al, %r8 # Sign extend
;
: cmp, ( cond -- ) ( n1 n2 -- flag )
\ Invert cond and dec: if false then -1 (true) else 0 (false)
1 XOR 90 OR
4C C, 39 C, 45 C, 00 C, \ cmp %r8, (%rbp)
0F C, C, C0 C, \ setcc %al
FE C, C8 C, \ dec %al
4C C, 0F C, BE C, C0 C, \ movsx %al, %r8 # Sign extend
sp+
;
: 0= ( n -- flag ) [ cc-e 0cmp, ] ;
: 0<> ( n -- flag ) [ cc-ne 0cmp, ] ;
: 0> ( n -- flag ) [ cc-g 0cmp, ] ;
: 0< ( n -- flag ) [ cc-l 0cmp, ] ; \ TODO SAR $63, %r8
: = ( x1 x2 -- flag ) [ cc-e cmp, ] ;
: <> ( x1 x2 -- flag ) [ cc-ne cmp, ] ;
: > ( x1 x2 -- flag ) [ cc-g cmp, ] ;
: < ( x1 x2 -- flag ) [ cc-l cmp, ] ;
: U> ( x1 x2 -- flag ) [ cc-a cmp, ] ;
: U< ( x1 x2 -- flag ) [ cc-b cmp, ] ;
: U>= ( x1 x2 -- flag ) [ cc-ae cmp, ] ;
: U<= ( x1 x2 -- flag ) [ cc-be cmp, ] ;
: >= ( x1 x2 -- flag ) [ cc-ge cmp, ] ;
: <= ( x1 x2 -- flag ) [ cc-le cmp, ] ;
: 0>= ( n -- flag ) [ cc-ge 0cmp, ] ;
: 0<= ( n -- flag ) [ cc-le 0cmp, ] ;
\ Reference implementation for 2's complement machines
\ (lo < hi and (lo <= x and x < hi))
\ or (lo > hi and (lo <= x or x < hi))
: WITHIN ( x lo hi -- flag ) OVER - ( x lo hi-lo ) >R - R> ( x-lo hi-lo ) U< ;
\ Compilation/utility ==========================================================
: BREAK ( -- SIGTRAP ) CC C, ; IMMEDIATE
: HERE ( -- addr ) CP @ ;
: ALLOT ( n -- ) CP +! ;
: ALIGN ( -- ) CP @ ALIGNED CP ! ;
: PAD ( -- addr ) HERE 200 + ;
: UNUSED ( -- u ) brk @ HERE - ;
: FLAG-IMM 01 ;
: FLAG-HIDDEN 02 ;
: EXECUTE ( i*x xt -- j*x ) [
4C C, 89 C, C0 C, \ mov %r8, %rax
4C C, 8B C, 45 C, 00 C, \ mov (%rbp), %r8
sp+
FF C, D0 C, \ call *%rax
] ;
: EXIT ( -- ) [ 48 C, 83 C, C4 C, 08 C, ] ; \ add $8, %rsp
\ Control flow =================================================================
: <resolve ( C: ori -- ) ( -- ) >R HERE 4 - R@ - R> L! ;
: resolve> ( C: dest ori -- ) ( -- ) >R HERE - R> L! ;
: branch ( C: -- ori ) ( -- ) E9 C, HERE 99 C, 99 C, 99 C, 99 C, ;
: branch0 ( C: -- ori ) ( x -- )
4D C, 85 C, C0 C, \ test %r8, %r8
4C C, 8B C, 45 C, 00 C, \ mov (%rbp), %r8
48 C, 8D C, 6D C, 08 C, \ lea 8(%rbp), %rbp -> We have to lea to keep flags
0F C, 84 C, \ jz rel32
HERE 4 ALLOT \ rel32
;
: AHEAD ( C: -- ori ) ( -- ) branch ; IMMEDIATE
: IF ( C: -- ori ) ( x -- ) branch0 ; IMMEDIATE
: ELSE ( C: ori1 -- ori2 ) ( -- ) >R branch R> <resolve ; IMMEDIATE
: THEN ( C: ori -- ) ( -- ) <resolve ; IMMEDIATE
: BEGIN ( C: -- dest ) ( -- ) HERE ; IMMEDIATE
: AGAIN ( C: dest -- ) ( -- ) branch resolve> ; IMMEDIATE
: UNTIL ( C: dest -- ) ( x -- ) branch0 resolve> ; IMMEDIATE
: WHILE ( C: dest -- ori dest ) ( x -- ) branch0 SWAP ; IMMEDIATE
: REPEAT ( C: ori dest -- ) ( -- ) branch resolve> <resolve ; IMMEDIATE
\ POSTPONE =====================================================================
: BL 20 ;
: PARSE-NAME ( char "<chars>ccc<char>" -- c-addr u ) BL scan-while BL PARSE ;
: ' ( "<spaces>name" -- xt ) PARSE-NAME find IF DROP ELSE 2DROP 0 THEN ;
: POSTPONE ( "<spaces>name" -- )
PARSE-NAME find ( xt flags nt )
0= IF BYE THEN \ TODO handle error
( flags ) FLAG-IMM AND IF \ Compile code that executes xt
COMPILE,
ELSE \ Compile code that compiles xt (default compilation behaviour)
[ ' LITERAL COMPILE, ] \ Compile DPUSH $xt
[ ' COMPILE, LITERAL ] COMPILE, \ Compile COMPILE,
THEN
; IMMEDIATE
: ['] ( C: "<spaces>name" -- ) ( -- xt ) ' POSTPONE LITERAL ; IMMEDIATE
: [COMPILE] ( C: "<spaces>name" -- ) ' COMPILE, ; IMMEDIATE
\ DO loops =====================================================================
\ leave: jump addr to quit the loop (at LOOP just before an UNLOOP)
\ leave-orig: addr of the cell containing leave, written by LOOP at compilation
\ dest: jump addr to loop (after DO)
: UNLOOP ( R: leave lim idx -- )
48 C, 83 C, C4 C, 18 C, \ add $24, %rsp
; IMMEDIATE
: LEAVE ( R: leave lim idx -- ) \ UNLOOP performed after the jump
FF C, 64 C, 24 C, 10 C, \ jmp *16(%rsp)
; IMMEDIATE
\ TODO Refactor DO ?DO and LOOP +LOOP
: DO ( C: -- leave-orig dest ) ( lim idx -- ) ( R: -- leave lim idx )
\ Reserve a cell for the leave address
\ TODO Kinda hacky, similar to S" -> better solution for this kind of storage?
POSTPONE AHEAD HERE >R 0 , POSTPONE THEN
\ At execution, push the value inside the cell, which was set by LOOP
R@ ( leave-orig ) POSTPONE LITERAL POSTPONE @ ( leave ) POSTPONE >R
POSTPONE 2>R \ Also push lim and idx
\ At compilation, pass leave-orig for LOOP to resolve and dest so LOOP can
\ jump back here
R> HERE ( leave-orig dest )
; IMMEDIATE
: ?DO ( C: -- leave-orig dest ) ( lim idx -- ) ( R: -- leave lim idx )
POSTPONE AHEAD HERE >R 99 , POSTPONE THEN
R@ POSTPONE LITERAL POSTPONE @ ( leave ) POSTPONE >R
POSTPONE 2>R
\ Same as DO but LEAVE at execution if lim = idx
POSTPONE 2R@ POSTPONE = POSTPONE IF POSTPONE LEAVE POSTPONE THEN
R> HERE
; IMMEDIATE
\ Implementation of AntonErtl's comment
\ https://forth-standard.org/standard/core/PlusLOOP
: (loop-stop?) ( n -- flag ) ( R: lim i1 ret -- lim i1 ret )
R> 2R@ ( n ret lim i1 ) ROT >R
( n lim i1 )
SWAP - ( n i-l )
[ 1 3F LSHIFT ] LITERAL ( n i-l ) \ MIN-N
+ ( n x )
[ ( n1 n2 -- 0|1 ) \ n1 + n2 overflowed?
4C C, 03 C, 45 C, 00 C, \ add (%rbp), %r8
0F C, 90 C, C0 C, \ seto %al
4C C, 0F C, B6 C, C0 C, \ movzxb %al, %r8
sp+
]
;
: +LOOP ( C: leave-orig dest -- ) ( n -- ) ( R: leave lim i1 -- | leave lim i2 )
POSTPONE DUP POSTPONE (loop-stop?) POSTPONE SWAP ( n flag ) \ Exit cond
POSTPONE R> POSTPONE + POSTPONE >R ( flag ) ( R: lim i2 ) \ Increment
branch0 resolve> \ Resolve dest: 0branch to DO
HERE SWAP ( here leave-orig ) ! \ Resolve leave-orig
POSTPONE UNLOOP
; IMMEDIATE
: LOOP ( C: leave-orig dest -- ) ( -- ) ( R: leave lim i1 -- | lim i2 )
POSTPONE R> POSTPONE 1+ POSTPONE >R ( R: lim i2 )
POSTPONE 2R@ POSTPONE = ( flag )
branch0 resolve> \ Resolve dest: 0branch to DO
HERE SWAP ( here leave-orig ) ! \ Resolve leave-orig
POSTPONE UNLOOP
; IMMEDIATE
: I ( -- idx ) ( R: leave lim idx -- leave lim idx )
sp- 4C C, 89 C, 45 C, 00 C, \ mov r8, (%rbp)
4C C, 8B C, 04 C, 24 C, \ mov (%rsp), %r8
; IMMEDIATE
: J ( -- i1 ) ( R: leave1 lim1 i1 leave2 lim2 i2 -- <same> )
sp- 4C C, 89 C, 45 C, 00 C, \ mov r8, (%rbp)
4C C, 8B C, 44 C, 24 C, 18 C, \ mov 24(%rsp), %r8
; IMMEDIATE
\ CASE =========================================================================
: CASE ( C: -- num ) ( -- ) 0 ; IMMEDIATE \ Initial number of cases
: ENDCASE ( C: ori1 ori2 ... oriu u -- ) ( x -- )
POSTPONE DROP
0 ?DO POSTPONE THEN LOOP
; IMMEDIATE
\ I was about to call it "OF-COND" like "cond" in Lisp but "?of" is in Gforth
: ?OF ( C: u1 -- ori u2 ) ( flag -- ) POSTPONE IF SWAP 1+ ; IMMEDIATE
: OF ( C: u1 -- ori u2 ) ( x1 x2 -- | x1 )
POSTPONE OVER
POSTPONE =
POSTPONE ?OF
POSTPONE DROP
; IMMEDIATE
: ENDOF ( C: ori1 u -- ori2 u ) ( -- ) SWAP POSTPONE ELSE SWAP ; IMMEDIATE
\ Defining words ===============================================================
: >BODY ( xt -- a-addr ) 6 + ;
: >code ( nt -- xt ) 9 + ( len-addr ) DUP C@ ( len-addr len ) + 1+ ;
: docreate ( -- a-addr ) R> 1+ ; \ 1+ to skip the ret
\ NOTE: The ret is never executed and we return to child's caller
: dodoes ( -- ) ( R: ret -- )
R> \ Start of child-code, popping the return address will exit from parent
CP @ >R
LATEST @ >code CP ! COMPILE, \ Redirect child's call
R> CP !
;
: CREATE ( "<spaces>name" -- ) ( -- a-addr )
\ parent: <parent-code> <ret>
\ docreate: Push caller's PFA <ret>
\ <child-header> <call docreate> <data> (call doesn't return)
: POSTPONE docreate POSTPONE ;
;
: DOES> ( -- ) ( R: ret -- )
\ <parent-header> <parent-code> <dodoes> <child-code> <ret>
\ ^
\ +--------------------+
\ |
\ <child-header> <call child-code> <data> (call doesn't return)
POSTPONE dodoes
\ child-code starts here
POSTPONE R> POSTPONE 1+ \ Compile code to get child's PFA
; IMMEDIATE
: CONSTANT ( x "<spaces>name" -- ) ( -- x ) : POSTPONE LITERAL POSTPONE ; ;
: VARIABLE ( "<spaces>name" -- ) ( -- a-addr ) CREATE 0 , ;
: BUFFER: ( u "<spaces>name" -- ) ( -- a-addr ) CREATE ALLOT ;
: 2LITERAL ( C: x1 x2 -- ) ( -- x1 x2 )
SWAP POSTPONE LITERAL POSTPONE LITERAL
; IMMEDIATE
: 2CONSTANT ( xd "<spaces>name" -- ) ( -- xd ) : POSTPONE 2LITERAL POSTPONE ; ;
: 2VARIABLE ( "<spaces>name" -- ) ( -- a-addr ) CREATE 0 , 0 , ;
0 1 - CONSTANT -ONE
0 INVERT CONSTANT TRUE
0 CONSTANT FALSE
-ONE 1 RSHIFT CONSTANT MAX-N
1 3F LSHIFT CONSTANT MIN-N
-ONE CONSTANT MAX-U
-ONE MAX-N 2CONSTANT MAX-D
-ONE -ONE 2CONSTANT MAX-UD
: :NONAME ( -- xt ) ( -- xt )
HERE LATEST DUP @ ( here latest prev-addr ) , \ Set previous field
( here latest ) ! \ Update latest
0 C, 0 C, \ Flags and length (empty name)
] \ Start compiling
HERE \ xt
;
: RECURSE ( -- ) LATEST @ >code COMPILE, ; IMMEDIATE
\ NOTE: For the double ext set, TO has to work with 2VALUE aswell
\ https://forth-standard.org/standard/double/TwoVALUE
: VALUE ( x "<spaces>name" -- ) CREATE , DOES> ( -- x ) @ ; IMMEDIATE
: TO ( x "<spaces>name" -- )
STATE @ IF POSTPONE ['] POSTPONE >BODY POSTPONE ! ELSE ' >BODY ! THEN
; IMMEDIATE
: DEFER ( "<spaces>name" -- ) CREATE 0 , DOES> @ EXECUTE ;
: DEFER@ ( xt1 -- xt2 ) >BODY @ ;
: DEFER! ( xt2 xt1 -- ) >BODY ! ;
: IS
STATE @ IF POSTPONE ['] POSTPONE DEFER! ELSE ' DEFER! THEN
; IMMEDIATE
: ACTION-OF
STATE @ IF POSTPONE ['] POSTPONE DEFER@ ELSE ' DEFER@ THEN
; IMMEDIATE
\ More Arithmetic ==============================================================
\ TODO Redo in machine code (?)
: ABS ( n1 -- u ) DUP 0< IF NEGATE THEN ;
: MIN ( n1 n2-- n1|n2 ) 2DUP < IF DROP ELSE NIP THEN ; \ TODO use CMOVcc
: MAX ( n1 n2-- n1|n2 ) 2DUP > IF DROP ELSE NIP THEN ;
: DINVERT ( xd1 -- xd2 ) SWAP INVERT SWAP INVERT ;
: DNEGATE ( d1 -- d2 ) DINVERT 1 M+ ; \ 2's complement
: D0= ( xd -- flag ) 0= SWAP 0= AND ;
: D0< ( d -- flag ) 0< NIP ;
: D0> ( d -- flag ) 0> NIP ;
: D= ( xd1 xd2 -- flag ) ROT ( l1 l2 h2 h1 ) = >R = R> AND ;
: D< ( d1 d2 -- flag ) D- D0< ;
: D> ( d1 d2 -- flag ) D- D0> ;
: DU< ( ud1 ud2 -- flag ) ROT ( l1 l2 h2 h1 ) 2DUP U> >R D= >R U< R> AND R> OR ;
: 2ROT ( xd1 xd2 xd3 -- xd2 xd3 xd1 ) 2>R 2SWAP 2R> 2SWAP ;
: DABS ( d -- ud ) DUP 0< IF DNEGATE THEN ;
: DMIN ( d1 d2 -- d1|d2 ) 2OVER 2OVER D> IF 2SWAP THEN 2DROP ;
: DMAX ( d1 d2 -- d1|d2 ) 2OVER 2OVER D< IF 2SWAP THEN 2DROP ;
\ Floored division
\ https://www.nimblemachines.com/symmetric-division-considered-harmful/
: FM/MOD ( d n -- rem quot )
DUP >R \ Save divisor
2DUP XOR 63 RSHIFT ( u n 0|1 ) >R \ 1 -> Signs differ ?
SM/REM ( rem quot ) ( R: n signs? )
OVER 0= R> 0= OR IF rdrop EXIT THEN \ rem = 0 or same signs -> No adjust
1- \ Adjust quotient
SWAP R> + SWAP \ Adjust remainder
;
\ More memory operations =======================================================
: CMOVE ( c-addr1 c-addr2 u -- ) [
4C C, 89 C, C1 C, \ mov %r8, %rcx
48 C, 8B C, 7D C, 00 C, \ mov 0(%rbp), %rdi
48 C, 8B C, 75 C, 08 C, \ mov 8(%rbp), %rsi
F3 C, A4 C, \ rep movsb
4C C, 8B C, 45 C, 10 C, \ mov 16(%rbp), %r8
48 C, 8D C, 6D C, 18 C, \ lea 24(%rbp), %rbp
] ;
: FILL ( c-addr u char -- ) [
4C C, 89 C, C0 C, \ mov %r8, %rax
48 C, 8B C, 4D C, 00 C, \ mov 0(%rbp), %rcx
48 C, 8B C, 7D C, 08 C, \ mov 8(%rbp), %rdi
F3 C, AA C, \ rep stosb
4C C, 8B C, 45 C, 10 C, \ mov 16(%rbp), %r8
48 C, 8D C, 6D C, 18 C, \ lea 24(%rbp), %rbp
] ;
: CMOVE> ( c-addr1 c-addr2 u -- )
>R R@ + 1- SWAP R@ + 1- SWAP ( c-addr1+u-1 c-addr2+u-1 )
[ FD C, ] R> CMOVE [ FC C, ] \ opcodes for std and cld (movsb direction)
;
: MOVE ( c-addr1 c-addr2 u -- ) >R 2DUP > IF R> CMOVE ELSE R> CMOVE> THEN ;
: ERASE ( c-addr u -- ) 0 FILL ;
\ TODO Optimized versions that start writing cell by cell until u < 8
\ Something like (~7) AND FILL-CELLS (with rep movsq)
\ followed by 7 AND FILL
: ROLL ( xu xu-1 xu-2 ... x0 u -- xu-1 xu-2 ... x0 x1 ) [
4C C, 89 C, C1 C, \ mov %r8, %rcx u
48 C, 8D C, 7C C, CD C, 00 C, \ lea (%rbp,%rcx,8), %rdi addr of xu
48 C, 8D C, 77 C, F8 C, \ lea -8(%rdi), %rsi addr of xu-1
4C C, 8B C, 07 C, sp+ \ mov (%rdi), %r8 pick u
FD C, F3 C, 48 C, A5 C, FC C, \ std; rep movsq; cld offset stack
] ;
\ OS ===========================================================================
0 CONSTANT sys-read
1 CONSTANT sys-write
0 CONSTANT stdin
1 CONSTANT stdout
2 CONSTANT stderr
: syscall3 ( num arg1 arg2 arg3 -- n ) [
48 C, 8B C, 45 C, 10 C, \ movq 16(%rbp), %rax
48 C, 8B C, 7D C, 08 C, \ movq 8(%rbp), %rdi
48 C, 8B C, 75 C, 00 C, \ movq 0(%rbp), %rsi
4C C, 89 C, C2 C, \ movq %r8, %rdx
0F C, 05 C, \ syscall
49 C, 89 C, C0 C, \ movq %rax, %r8
48 C, 8D C, 6D C, 18 C, \ lea 24(%rbp), %rbp
] ;
VARIABLE key-buf
: KEY ( -- -1|char ) \ -1 on failure
sys-read stdin key-buf 1 syscall3
0<= IF -ONE ELSE key-buf @ THEN
;
VARIABLE emit-buf
: EMIT ( char -- ) emit-buf ! sys-write stdout emit-buf 1 syscall3 DROP ;
: TYPE ( c-addr u -- ) 2>R sys-write stdout 2R> syscall3 DROP ;
\ Strings ======================================================================
00 CONSTANT #nul
07 CONSTANT #bel
08 CONSTANT #bs
09 CONSTANT #ht
0A CONSTANT #lf
0B CONSTANT #vt
0C CONSTANT #ff
0D CONSTANT #cr
1B CONSTANT #esc
7F CONSTANT #del
: SPACE ( -- ) BL EMIT ;
: SPACES ( u -- ) 0 ?DO SPACE LOOP ;
: CR ( -- ) #cr EMIT #lf EMIT ;
: graph? ( char -- flag ) DUP 20 >= SWAP 7E <= AND ;
: COUNT ( c-addr1 -- c-addr2 u ) DUP CHAR+ SWAP C@ ;
\ 100 BUFFER: counted-buf \ 1 + 255 (minimal length in the standard)
: counted-buf HERE ;
: counted ( c-addr1 u -- c-addr2 ) \ String to counted-string (transient region)
FF MIN \ Limit size to 255
DUP counted-buf ( c-addr1 u u buf ) C! \ len
counted-buf 1+ SWAP ( c-addr1 buf+1 u ) CMOVE \ chars
counted-buf
;
: WORD ( char "<chars>ccc<char>" -- c-addr ) DUP scan-while PARSE counted ;
: CHAR ( "<spaces>name" -- char ) PARSE-NAME DROP C@ ;
: [CHAR] ( C: "<spaces>name" -- ) ( -- char ) CHAR POSTPONE LITERAL ; IMMEDIATE
: SLITERAL ( C: c-addr1 u ) ( -- c-addr2 u )
>R
POSTPONE AHEAD \ Skip string data
R@ HERE >R ALLOT \ Allocate string and save it's addr
POSTPONE THEN
R@ POSTPONE LITERAL R> \ Push c-addr2
R@ POSTPONE LITERAL R> \ Push u
( c-addr1 c-addr2 u ) MOVE \ Copy string data
; IMMEDIATE
: S" ( C: "ccc<quote>" -- ) ( -- c-addr u )
[CHAR] " PARSE POSTPONE SLITERAL ; IMMEDIATE
: ." ( C: "ccc<quote>" -- ) ( -- ) POSTPONE S" POSTPONE TYPE ; IMMEDIATE
: .( ( "ccc<quote>" -- ) ( -- ) [CHAR] ) PARSE TYPE ;
: C" ( C: "ccc<quote>" -- ) ( -- c-addr )
[CHAR] " PARSE >R
POSTPONE AHEAD \ Skip string data
R@ HERE >R \ Keep addr of counted string
DUP C, ALLOT \ Store length and allocate chars
POSTPONE THEN
R@ POSTPONE LITERAL \ Push c-addr2
R> CHAR+ R> ( c-addr1 c-addr3 u ) MOVE \ Copy string data
; IMMEDIATE
: /STRING ( c-addr1 u1 n -- c-addr2 u2 ) TUCK - >R CHARS + R> ;
: s= ( c-addr1 u1 c-addr2 u2 -- flag ) \ String equality
2 PICK <> IF DROP 2DROP FALSE EXIT THEN \ <>len -> false
( c-addr1 u c-addr2 )
2 PICK OVER = IF DROP 2DROP TRUE EXIT THEN \ =addr and =len -> true
SWAP ( c-addr1 c-addr2 u ) 0 ?DO \ Compare chars
2DUP C@ SWAP C@ <> IF 2DROP FALSE UNLOOP EXIT THEN
CHAR+ SWAP CHAR+ \ Don't care if addr1 and addr2 are swapped
LOOP
2DROP
TRUE
;
\ Pictured numeric output ======================================================
VARIABLE BASE
: HEX ( -- ) 10 BASE ! ;
: DECIMAL ( -- ) 0A BASE ! ;
HEX
100 CONSTANT #sz
\ #sz BUFFER: #buf
: #buf HERE 100 + ;
VARIABLE #idx
: <# ( -- ) #sz #idx ! ;
: #> ( xd -- c-addr u )
2DROP
#idx @ #buf + ( c-addr )
#sz #idx @ - ( c-addr u )
;
: HOLD ( char -- )
1 #idx -! \ dec idx
#buf #idx @ + ( char c-addr ) C! \ write char
;
: HOLDS ( c-addr u -- )
\ #sz #idx - MIN \ TODO Limit to the remaining space in the buffer
DUP #idx -! \ dec idx
#buf #idx @ + ( c-addr1 u c-addr2 ) SWAP MOVE \ write data
;
: >digit ( u -- char ) DUP 9 > IF [CHAR] A + 0A - ELSE [CHAR] 0 + THEN ;
: # ( ud1 -- ud2 )
BASE @ UD/MOD ( rem ud2 )
ROT >digit HOLD ( ud2 )
;
: #S ( ud1 -- ud2 )
BEGIN # 2DUP D0= UNTIL
;
: SIGN ( n -- ) 0< IF [CHAR] - HOLD THEN ;
: #pad ( n -- ) #sz #idx @ - - BEGIN DUP 0> WHILE BL HOLD 1- REPEAT DROP ;
: U. ( u -- ) 0 <# #S #> TYPE SPACE ;
: . ( u -- ) DUP ABS 0 <# #S ROT SIGN #> TYPE SPACE ;
: U.R ( u w -- ) >R 0 <# #S R> #pad #> TYPE ;
: .R ( n w -- ) >R DUP ABS 0 <# #S ROT SIGN R> #pad #> TYPE ;
: UD. ( ud -- ) <# #S #> TYPE SPACE ;
: UD.R ( ud w -- ) >R <# #S R> #pad #> TYPE SPACE ;
: D. ( d -- ) DUP >R DABS <# #S R> SIGN #> TYPE SPACE ;
: D.R ( d w -- ) >R DUP >R DABS <# #S 2R> SIGN #pad #> TYPE SPACE ;
\ Hex with leading zeros
: .X ( u -- ) BASE @ SWAP HEX 0 <# 10 0 DO # LOOP #> TYPE SPACE BASE ! ;
\ Number parser ================================================================
: digit> ( char -- -1|u )
DUP [CHAR] 0 U< IF DROP -ONE EXIT THEN
DUP [CHAR] 9 U<= IF [CHAR] 0 - EXIT THEN
DUP [CHAR] A U< IF DROP -ONE EXIT THEN
DUP [CHAR] Z U<= IF [ 0A CHAR A - ] LITERAL + EXIT THEN
DUP [CHAR] a U< IF DROP -ONE EXIT THEN
DUP [CHAR] z U<= IF [ 0A CHAR a - ] LITERAL + EXIT THEN
DROP -ONE
;
: >NUMBER ( ud1 c-addr1 u1 -- ud2 c-addr2 u2 ) \ Standard number parsing word
BEGIN DUP WHILE
OVER C@ \ Get char
digit> DUP 0< IF DROP EXIT THEN \ Convert digit to number
DUP BASE @ U>= IF DROP EXIT THEN \ Stop if incompatible with base
-ROT 1 /STRING 2>R ( ud digit ) \ Next char
>R BASE @ UDM* R> M+ \ Mult by base and add digit TODO error on overflow (Using a triple product)
2R> ( ud2 c-addr2 u2 )
REPEAT
;
\ TODO return ( -- ud 2 | u 1 | x 0 ) to allow for the 'xxx.' notation
: number ( c-addr u1 -- u2 flag ) \ Parse unsigned number
DUP 0= IF 2DROP 0 FALSE EXIT THEN
0 0 2SWAP >NUMBER ( ud c-addr u )
0= >R ( ud c-addr ) 2DROP ( u ) R>
;
\ TODO: return ud
: number ( c-addr u -- n flag ) \ Parse signed number
DUP 0= IF 2DROP 0 FALSE EXIT THEN
OVER C@ [CHAR] - = DUP >R \ is-signed flag
IF 1 /STRING THEN \ Next char if signed
number ( u flag ) SWAP R> IF NEGATE THEN SWAP ( n flag )
;
: number ( c-addr u -- n flag ) \ Parse signed number with base
DUP 0= IF 2DROP 0 FALSE EXIT THEN
BASE @ >R
OVER C@ CASE
[CHAR] # OF DECIMAL ENDOF
[CHAR] $ OF HEX ENDOF
[CHAR] % OF 2 BASE ! ENDOF
( default ) >R -ONE /STRING R> \ If not base is present ignore
ENDCASE
1 /STRING number
R> BASE !
;
: charlit ( c-addr u -- -1|char ) \ Check for '<char>' notation
3 <> IF DROP -ONE EXIT THEN
DUP C@ [CHAR] ' <> IF DROP -ONE EXIT THEN
DUP 2 CHARS + C@ [CHAR] ' <> IF DROP -ONE EXIT THEN
CHAR+ C@
;
: number ( c-addr u -- n flag ) \ Parse char literal or signed number with base
2DUP charlit DUP 0> IF NIP NIP TRUE ELSE DROP number THEN
;
\ Escaped string ===============================================================