-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtests.c
2220 lines (1872 loc) · 59 KB
/
tests.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/****************************************************************************
*
* The Unit Test backend
* Copyright (C) 2023 Sean Conner
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Comments, questions and criticisms can be sent to: sean@conman.org
*
****************************************************************************/
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include <setjmp.h>
#include <errno.h>
#include <time.h>
#include <mc6809.h>
#include <mc6809dis.h>
#include "a09.h"
#if defined(__clang__)
# pragma clang diagnostic ignored "-Wmissing-noreturn"
# pragma clang diagnostic ignored "-Wswitch-enum"
#endif
#if defined(__GNUC__) && __GNUC__ >= 11
# pragma GCC diagnostic ignored "-Wenum-conversion"
#endif
/**************************************************************************/
#define MAX_PROG 64
enum vmops
{
VM_WORD, /* why yes, these do match enum operator */
VM_LOR,
VM_LAND,
VM_GT,
VM_GE,
VM_EQ,
VM_LE,
VM_LT,
VM_NE,
VM_BOR,
VM_BEOR,
VM_BAND,
VM_SHR,
VM_SHL,
VM_SUB,
VM_ADD,
VM_MUL,
VM_DIV,
VM_MOD,
VM_EXP,
VM_NEG, /* and now new operators */
VM_NOT,
VM_LIT,
VM_AT8,
VM_AT16,
VM_CPUCC,
VM_CPUCCc,
VM_CPUCCv,
VM_CPUCCz,
VM_CPUCCn,
VM_CPUCCi,
VM_CPUCCh,
VM_CPUCCf,
VM_CPUCCe,
VM_CPUA,
VM_CPUB,
VM_CPUDP,
VM_CPUD,
VM_CPUX,
VM_CPUY,
VM_CPUU,
VM_CPUS,
VM_CPUPC,
VM_IDX, /* "/offset,x" == "(/x + offset)" */
VM_IDY,
VM_IDS,
VM_IDU,
VM_SCMP,
VM_SEX,
VM_TIMEON,
VM_TIMEOFF,
VM_FALSE,
VM_TRUE,
VM_TO8,
VM_TO16,
VM_PROT,
VM_EXIT,
};
enum
{
XC00 = 1 / ((int)VM_WORD == (int)OP_WORD),
XC01 = 1 / ((int)VM_LOR == (int)OP_LOR),
XC02 = 1 / ((int)VM_LAND == (int)OP_LAND),
XC03 = 1 / ((int)VM_GT == (int)OP_GT),
XC04 = 1 / ((int)VM_GE == (int)OP_GE),
XC05 = 1 / ((int)VM_EQ == (int)OP_EQ),
XC06 = 1 / ((int)VM_LE == (int)OP_LE),
XC07 = 1 / ((int)VM_LT == (int)OP_LT),
XC08 = 1 / ((int)VM_NE == (int)OP_NE),
XC09 = 1 / ((int)VM_BOR == (int)OP_BOR),
XC10 = 1 / ((int)VM_BEOR == (int)OP_BEOR),
XC11 = 1 / ((int)VM_BAND == (int)OP_BAND),
XC12 = 1 / ((int)VM_SHR == (int)OP_SHR),
XC13 = 1 / ((int)VM_SHL == (int)OP_SHL),
XC14 = 1 / ((int)VM_SUB == (int)OP_SUB),
XC15 = 1 / ((int)VM_ADD == (int)OP_ADD),
XC16 = 1 / ((int)VM_MUL == (int)OP_MUL),
XC17 = 1 / ((int)VM_DIV == (int)OP_DIV),
XC18 = 1 / ((int)VM_MOD == (int)OP_MOD),
XV19 = 1 / ((int)VM_EXP == (int)OP_EXP),
};
enum
{
TEST_FAILED = MC6809_FAULT_user,
TEST_NON_READ_MEM,
TEST_WEEDS,
TEST_NON_WRITE_MEM,
TEST_max,
};
struct memprot
{
bool read : 1;
bool write : 1;
bool exec : 1;
bool tron : 1;
bool check : 1;
};
struct unittest
{
uint16_t addr;
char const *filename;
size_t line;
struct buffer name;
};
struct vmcode
{
size_t line;
enum vmops prog[MAX_PROG];
char tag[133];
};
struct Assert
{
tree__s tree;
uint16_t here;
size_t cnt;
struct vmcode *Asserts;
};
struct testdata
{
struct a09 *a09;
bool (*fmtwrite)(struct format *,struct opcdata *,void const *,size_t,bool);
bool (*fmtrmb) (struct format *,struct opcdata *);
bool (*fmtorg) (struct format *,struct opcdata *);
bool (*fmtalign)(struct format *,struct opcdata *);
tree__s *Asserts;
struct unittest *units;
size_t nunits;
unsigned long icount;
mc6809__t cpu;
mc6809dis__t dis;
uint16_t addr;
uint16_t sp;
uint16_t stacksize;
uint16_t inittestpc;
uint16_t testpc;
uint16_t resumepc;
uint8_t fill;
bool tron;
bool timing;
bool intest;
char errbuf[128];
mc6809byte__t memory[65536u];
struct memprot prot [65536u];
};
struct labeltable
{
label label;
enum vmops op;
};
static bool ft_expr(enum vmops [],size_t,size_t *,struct testdata *,struct a09 *,struct buffer *,int);
/**************************************************************************/
static inline struct Assert *tree2Assert(tree__s *tree)
{
assert(tree != NULL);
#if defined(__clang__)
# pragma clang diagnostic push "-Wcast-align"
# pragma clang diagnostic ignored "-Wcast-align"
#endif
return (struct Assert *)((char *)tree - offsetof(struct Assert,tree));
#if defined(__clang__)
# pragma clang diagnostic pop "-Wcast-align"
#endif
}
/**************************************************************************/
static struct vmcode *new_program(struct Assert *Assert)
{
assert(Assert != NULL);
struct vmcode *new = realloc(Assert->Asserts,(Assert->cnt + 1) * sizeof(struct vmcode));
if (new != NULL)
{
Assert->Asserts = new;
new = &Assert->Asserts[Assert->cnt++];
new->line = 0;
new->prog[0] = VM_EXIT;
new->tag[0] = '\0';
}
return new;
}
/**************************************************************************/
static int Assertaddrcmp(void const *restrict needle,void const *restrict haystack)
{
uint16_t const *key = needle;
struct Assert const *value = haystack;
if (*key < value->here)
return -1;
else if (*key > value->here)
return 1;
else
return 0;
}
/**************************************************************************/
static int Asserttreecmp(void const *restrict needle,void const *restrict haystack)
{
struct Assert const *key = needle;
struct Assert const *value = haystack;
if (key->here < value->here)
return -1;
else if (key->here > value->here)
return 1;
else
return 0;
}
/**************************************************************************/
static struct Assert *get_Assert(struct a09 *a09,struct testdata *data,uint16_t here)
{
assert(a09 != NULL);
assert(data != NULL);
struct Assert *Assert;
tree__s *tree = tree_find(data->Asserts,&here,Assertaddrcmp);
if (tree == NULL)
{
Assert = malloc(sizeof(struct Assert));
if (Assert == NULL)
{
message(a09,MSG_ERROR,"E0046: out of memory");
return NULL;
}
Assert->tree.left = NULL;
Assert->tree.right = NULL;
Assert->tree.height = 0;
Assert->here = here;
Assert->cnt = 0;
Assert->Asserts = NULL;
data->Asserts = tree_insert(data->Asserts,&Assert->tree,Asserttreecmp);
}
else
Assert = tree2Assert(tree);
return Assert;
}
/**************************************************************************/
static bool runvm(struct a09 *a09,mc6809__t *cpu,struct vmcode *test)
{
assert(a09 != NULL);
assert(cpu != NULL);
assert(test != NULL);
struct testdata *data = cpu->user;
struct memprot prot;
uint16_t stack[15];
uint16_t result;
uint16_t value;
uint16_t addr;
size_t sp = sizeof(stack) / sizeof(stack[0]);
size_t ip = 0;
int rc;
/*--------------------------------------------------------------
; I control the code generation, so I can skip checks that would
; otherwise have to be made.
;---------------------------------------------------------------*/
while(true)
{
a09->lnum = test->line;
switch(test->prog[ip++])
{
case VM_WORD:
result = value_lsb(a09,stack[sp + 1],2) * 256
+ value_lsb(a09,stack[sp ],2);
stack[++sp] = result;
break;
case VM_LOR:
result = stack[sp + 1] || stack[sp];
stack[++sp] = result;
break;
case VM_LAND:
result = stack[sp + 1] && stack[sp];
stack[++sp] = result;
break;
case VM_GT:
result = stack[sp + 1] > stack[sp];
stack[++sp] = result;
break;
case VM_GE:
result = stack[sp + 1] >= stack[sp];
stack[++sp] = result;
break;
case VM_EQ:
result = stack[sp + 1] == stack[sp];
stack[++sp] = result;
break;
case VM_LE:
result = stack[sp + 1] <= stack[sp];
stack[++sp] = result;
break;
case VM_LT:
result = stack[sp + 1] < stack[sp];
stack[++sp] = result;
break;
case VM_NE:
result = stack[sp + 1] != stack[sp];
stack[++sp] = result;
break;
case VM_BOR:
result = stack[sp + 1] | stack[sp];
stack[++sp] = result;
break;
case VM_BEOR:
result = stack[sp + 1] ^ stack[sp];
stack[++sp] = result;
break;
case VM_BAND:
result = stack[sp + 1] & stack[sp];
stack[++sp] = result;
break;
case VM_SHR:
result = stack[sp + 1] >> stack[sp];
stack[++sp] = result;
break;
case VM_SHL:
result = stack[sp + 1] << stack[sp];
stack[++sp] = result;
break;
case VM_SUB:
result = stack[sp + 1] - stack[sp];
stack[++sp] = result;
break;
case VM_ADD:
result = stack[sp + 1] + stack[sp];
stack[++sp] = result;
break;
case VM_MUL:
result = stack[sp + 1] * stack[sp];
stack[++sp] = result;
break;
case VM_DIV:
if (stack[sp] == 0)
return message(a09,MSG_ERROR,"E0008: divide by 0 error");
result = stack[sp + 1] / stack[sp];
stack[++sp] = result;
break;
case VM_MOD:
if (stack[sp] == 0)
return message(a09,MSG_ERROR,"E0008: divide by 0 error");
result = stack[sp + 1] % stack[sp];
stack[++sp] = result;
break;
case VM_EXP:
if (stack[sp] > 0x7FFF)
return message(a09,MSG_ERROR,"E0091: negative exponents for integers not supported");
else if (stack[sp] == 0)
stack[++sp] = 1;
else
{
while(--stack[sp])
stack[sp+1] = stack[sp+1] * stack[sp+1];
result = stack[sp + 1];
stack[++sp] = result;
}
break;
case VM_NEG:
stack[sp] = -stack[sp];
break;
case VM_NOT:
stack[sp] = ~stack[sp];
break;
case VM_LIT:
stack[--sp] = test->prog[ip++];
break;
case VM_AT8:
addr = stack[sp];
stack[sp] = data->memory[addr];
break;
case VM_AT16:
addr = stack[sp];
stack[sp] = (data->memory[addr] << 8) | data->memory[addr + 1];
break;
case VM_CPUCC:
stack[--sp] = mc6809_cctobyte(cpu);
break;
case VM_CPUCCc:
stack[--sp] = cpu->cc.c;
break;
case VM_CPUCCv:
stack[--sp] = cpu->cc.v;
break;
case VM_CPUCCz:
stack[--sp] = cpu->cc.z;
break;
case VM_CPUCCn:
stack[--sp] = cpu->cc.n;
break;
case VM_CPUCCi:
stack[--sp] = cpu->cc.i;
break;
case VM_CPUCCh:
stack[--sp] = cpu->cc.h;
break;
case VM_CPUCCf:
stack[--sp] = cpu->cc.f;
break;
case VM_CPUCCe:
stack[--sp] = cpu->cc.e;
break;
case VM_CPUA:
stack[--sp] = cpu->A;
break;
case VM_CPUB:
stack[--sp] = cpu->B;
break;
case VM_CPUDP:
stack[--sp] = cpu->dp;
break;
case VM_CPUD:
stack[--sp] = cpu->d.w;
break;
case VM_CPUX:
stack[--sp] = cpu->X.w;
break;
case VM_CPUY:
stack[--sp] = cpu->Y.w;
break;
case VM_CPUU:
stack[--sp] = cpu->U.w;
break;
case VM_CPUS:
stack[--sp] = cpu->S.w;
break;
case VM_CPUPC:
stack[--sp] = cpu->pc.w;
break;
case VM_IDX:
stack[sp] += cpu->X.w;
break;
case VM_IDY:
stack[sp] += cpu->Y.w;
break;
case VM_IDS:
stack[sp] += cpu->S.w;
break;
case VM_IDU:
stack[sp] += cpu->U.w;
break;
case VM_SCMP:
{
uint16_t len = stack[sp++];
uint16_t dst = stack[sp++];
uint16_t src = stack[sp++];
rc = memcmp(&data->memory[src],&data->memory[dst],len);
stack[--sp] = 0;
if (rc < 0)
stack[--sp] = -1;
else if (rc > 0)
stack[--sp] = 1;
else
stack[--sp] = 0;
}
break;
case VM_SEX:
if (stack[sp] >= 0x80)
stack[sp] |= 0xFF00;
break;
case VM_TIMEON:
cpu->cycles = 0;
data->icount = 0;
break;
case VM_TIMEOFF:
if (a09->tapout)
printf("# ");
printf("%s: cycles=%lu instructions=%lu cpi=%.2f\n",test->tag,cpu->cycles,data->icount,(double)cpu->cycles/(double)data->icount);
break;
case VM_FALSE:
stack[--sp] = false;
break;
case VM_TRUE:
stack[--sp] = true;
break;
case VM_TO8:
addr = stack[sp++];
value = stack[sp++];
data->memory[addr] = value & 255;
break;
case VM_TO16:
addr = stack[sp++];
value = stack[sp++];
data->memory[addr] = value >> 8;
data->memory[addr + 1] = value & 255;
break;
case VM_PROT:
assert(sizeof(struct memprot) <= sizeof(enum vmops));
addr = stack[sp++];
value = stack[sp++];
memcpy(&prot,&stack[sp++],sizeof(prot));
for (size_t a = addr ; a <= value ; a++)
data->prot[a] = prot;
break;
case VM_EXIT:
assert(sp == (sizeof(stack) / sizeof(stack[0]) - 1));
return stack[sp] != 0;
}
}
}
/**************************************************************************/
static mc6809byte__t ft_cpu_read(mc6809__t *cpu,mc6809addr__t addr,bool inst)
{
assert(cpu != NULL);
assert(cpu->user != NULL);
(void)inst;
struct testdata *data = cpu->user;
if (!data->prot[addr].read)
{
snprintf(data->errbuf,sizeof(data->errbuf),"PC=%04X addr=%04X",cpu->instpc,addr);
longjmp(cpu->err,TEST_NON_READ_MEM);
}
if (inst && !data->prot[addr].exec)
{
snprintf(data->errbuf,sizeof(data->errbuf),"PC=%04X addr=%04X",cpu->instpc,addr);
longjmp(cpu->err,TEST_WEEDS);
}
return data->memory[addr];
}
/**************************************************************************/
static void ft_cpu_write(mc6809__t *cpu,mc6809addr__t addr,mc6809byte__t byte)
{
assert(cpu != NULL);
assert(cpu->user != NULL);
struct testdata *data = cpu->user;
if (!data->prot[addr].write)
{
snprintf(data->errbuf,sizeof(data->errbuf),"PC=%04X addr=%04X",cpu->instpc,addr);
longjmp(cpu->err,TEST_NON_WRITE_MEM);
}
if (data->prot[addr].exec)
message(data->a09,MSG_WARNING,"W0014: possible self-modifying code @ %04X",cpu->instpc);
if (data->prot[addr].tron)
message(data->a09,MSG_WARNING,"W0016: memory write of %02X to %04X @ %04X",byte,addr,cpu->instpc);
data->memory[addr] = byte;
}
/**************************************************************************/
static void ft_cpu_fault(mc6809__t *cpu,mc6809fault__t fault)
{
assert(cpu != NULL);
assert(cpu->user != NULL);
struct testdata *data = cpu->user;
snprintf(data->errbuf,sizeof(data->errbuf),"PC=%04X",cpu->instpc);
longjmp(cpu->err,fault);
}
/**************************************************************************/
static mc6809byte__t ft_dis_read(mc6809dis__t *dis,mc6809addr__t addr)
{
assert(dis != NULL);
assert(dis->user != NULL);
struct testdata *data = dis->user;
return data->memory[addr];
}
/**************************************************************************/
static void ft_dis_fault(mc6809dis__t *dis,mc6809fault__t fault)
{
assert(dis != NULL);
longjmp(dis->err,fault);
}
/**************************************************************************/
static int regsearch(void const *needle,void const *haystack)
{
label const *key = needle;
struct labeltable const *value = haystack;
int rc = memcmp(key->text,value->label.text,min(key->s,value->label.s));
if (rc == 0)
{
if (key->s < value->label.s)
rc = -1;
else if (key->s > value->label.s)
rc = 1;
}
return rc;
}
/**************************************************************************/
static struct labeltable const mregisters[] =
{
{ .label = { .text = "A" , .s = 1 } , .op = VM_CPUA } ,
{ .label = { .text = "B" , .s = 1 } , .op = VM_CPUB } ,
{ .label = { .text = "CC" , .s = 2 } , .op = VM_CPUCC } ,
{ .label = { .text = "CC.C" , .s = 4 } , .op = VM_CPUCCc } ,
{ .label = { .text = "CC.E" , .s = 4 } , .op = VM_CPUCCe } ,
{ .label = { .text = "CC.F" , .s = 4 } , .op = VM_CPUCCf } ,
{ .label = { .text = "CC.H" , .s = 4 } , .op = VM_CPUCCh } ,
{ .label = { .text = "CC.I" , .s = 4 } , .op = VM_CPUCCi } ,
{ .label = { .text = "CC.N" , .s = 4 } , .op = VM_CPUCCn } ,
{ .label = { .text = "CC.V" , .s = 4 } , .op = VM_CPUCCv } ,
{ .label = { .text = "CC.Z" , .s = 4 } , .op = VM_CPUCCz } ,
{ .label = { .text = "D" , .s = 1 } , .op = VM_CPUD } ,
{ .label = { .text = "DP" , .s = 2 } , .op = VM_CPUDP } ,
{ .label = { .text = "PC" , .s = 2 } , .op = VM_CPUPC } ,
{ .label = { .text = "S" , .s = 1 } , .op = VM_CPUS } ,
{ .label = { .text = "U" , .s = 1 } , .op = VM_CPUU } ,
{ .label = { .text = "X" , .s = 1 } , .op = VM_CPUX } ,
{ .label = { .text = "Y" , .s = 1 } , .op = VM_CPUY } ,
};
/**************************************************************************/
static bool ft_index_register(
enum vmops prog[static MAX_PROG],
size_t max,
size_t *pvip,
struct a09 *a09,
struct buffer *buffer,
int pass
)
{
assert(prog != NULL);
assert(max == MAX_PROG);
assert(pvip != NULL);
assert(*pvip < max);
assert(a09 != NULL);
assert(buffer != NULL);
assert(pass == 2);
struct labeltable const *vmreg;
label reg;
if (*pvip == max)
return message(a09,MSG_ERROR,"E0066: expression too complex");
skip_space(buffer);
buffer->ridx--;
if (!parse_label(®,buffer,a09,pass))
return false;
upper_label(®);
vmreg = bsearch(
®,
mregisters,
sizeof(mregisters)/sizeof(mregisters[0]),
sizeof(mregisters[0]),
regsearch
);
if (vmreg == NULL)
return message(a09,MSG_ERROR,"E0073: bad register");
switch(vmreg->op)
{
case VM_CPUX: prog[(*pvip)++] = VM_IDX; break;
case VM_CPUY: prog[(*pvip)++] = VM_IDY; break;
case VM_CPUS: prog[(*pvip)++] = VM_IDS; break;
case VM_CPUU: prog[(*pvip)++] = VM_IDU; break;
default: return message(a09,MSG_ERROR,"E0080: not an index register");
}
return true;
}
/**************************************************************************/
static bool ft_register(
enum vmops prog[static MAX_PROG],
size_t max,
size_t *pvip,
struct testdata *data,
struct a09 *a09,
struct buffer *buffer,
int pass
)
{
assert(prog != NULL);
assert(max == MAX_PROG);
assert(pvip != NULL);
assert(*pvip < max);
assert(a09 != NULL);
assert(buffer != NULL);
assert(pass == 2);
struct labeltable const *vmreg;
label reg;
char c;
bool earlycomma = false;
/*--------------------------------------------------
; handle "/,x" as if it was "/x", because it is.
;---------------------------------------------------*/
if (buffer->buf[buffer->ridx] == ',')
{
earlycomma = true;
buffer->ridx++;
}
if (parse_label(®,buffer,a09,pass))
{
upper_label(®);
vmreg = bsearch(
®,
mregisters,
sizeof(mregisters)/sizeof(mregisters[0]),
sizeof(mregisters[0]),
regsearch
);
/*----------------------------------------------------------------
; No register, so assume an expression, and then look for a comma,
; and then an index register.
;-----------------------------------------------------------------*/
if (vmreg == NULL)
{
if (!ft_expr(prog,max,pvip,data,a09,buffer,pass))
return false;
c = skip_space(buffer);
if (c != ',')
{
return earlycomma
? message(a09,MSG_ERROR,"E0082: missing index register")
: message(a09,MSG_ERROR,"E0023: missing expected comma")
;
}
return ft_index_register(prog,max,pvip,a09,buffer,pass);
}
/*---------------------------------------------------------------------
; We might have just a regiser, or the accum,index mode. Choose here.
; In either case, we compile a VM_CPUaccum op here.
;---------------------------------------------------------------------*/
if (*pvip == max)
return message(a09,MSG_ERROR,"E0066: expression too complex");
prog[(*pvip)++] = vmreg->op;
c = skip_space(buffer);
if (c == ',')
{
/*------------------------------------------------------------------
; If the label didn't specify 'A', 'B', or 'D', here, it's an error.
; If it's A or B, we need to sign extend it, so yet another VM op.
;-------------------------------------------------------------------*/
switch(vmreg->op)
{
case VM_CPUA:
case VM_CPUB:
if (*pvip == max)
return message(a09,MSG_ERROR,"E0066: expression too complex");
prog[(*pvip)++] = VM_SEX;
break;
case VM_CPUD:
break;
default: return message(a09,MSG_ERROR,"E0081: missing A, B, or D register");
}
return ft_index_register(prog,max,pvip,a09,buffer,pass);
}
else
buffer->ridx--;
}
else
{
if (!ft_expr(prog,max,pvip,data,a09,buffer,pass))
return false;
c = skip_space(buffer);
if (c != ',')
{
return earlycomma
? message(a09,MSG_ERROR,"E0082: missing index register")
: message(a09,MSG_ERROR,"E0023: missing expected comma")
;
}
return ft_index_register(prog,max,pvip,a09,buffer,pass);
}
return true;
}
/**************************************************************************/
static bool ft_value(
enum vmops prog[static MAX_PROG],
size_t max,
size_t *pvip,
struct testdata *data,
struct a09 *a09,
struct buffer *buffer,
int pass
)
{
assert(prog != NULL);
assert(max == MAX_PROG);
assert(pvip != NULL);
assert(*pvip < max);
assert(data != NULL);
assert(a09 != NULL);
assert(buffer != NULL);
assert(pass == 2);
uint16_t v;
bool neg = false;
bool not = false;
bool rc = true;
char c = skip_space(buffer);
if (c == '/')
return ft_register(prog,max,pvip,data,a09,buffer,pass);
if (*pvip >= max - 2)
return message(a09,MSG_ERROR,"E0074: not enough space for expression");
if (c == '-')
{
neg = true;
c = buffer->buf[buffer->ridx++];
}
else if (c == '~')
{
not = true;
c = buffer->buf[buffer->ridx++];
}
else if (c == '+')
c = buffer->buf[buffer->ridx++];
if (c == '$')
rc = s2num(a09,&v,buffer,16);
else if (c == '&')
rc = s2num(a09,&v,buffer,8);
else if (c == '%')
rc = s2num(a09,&v,buffer,2);
else if (isdigit(c))
{
buffer->ridx--;
rc = s2num(a09,&v,buffer,10);
}
else if ((c == '.') || (c == '.') || isalpha(c))
{
struct symbol *sym;
label label;
buffer->ridx--;
if (!parse_label(&label,buffer,a09,pass))
return false;
sym = symbol_find(a09,&label);
if (sym == NULL)
return message(a09,MSG_ERROR,"E0004: unknown symbol '%.*s'",label.s,label.text);
v = sym->value;
sym->refs++;
}
else if ((c == '"') || (c == '\''))
{
struct buffer text;
if (neg || not)
return message(a09,MSG_ERROR,"E0075: can't negate or complement a string");
if (!collect_esc_string(a09,&text,buffer,c))