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
|
/* Print National Semiconductor 32000 instructions.
Copyright (C) 1986-2020 Free Software Foundation, Inc.
This file is part of the GNU opcodes library.
This library 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, or (at your option)
any later version.
It 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, write to the Free Software
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
MA 02110-1301, USA. */
#include "sysdep.h"
#include "bfd.h"
#include "disassemble.h"
#if !defined(const) && !defined(__STDC__)
#define const
#endif
#include "opcode/ns32k.h"
#include "opintl.h"
static disassemble_info *dis_info;
/* Hacks to get it to compile <= READ THESE AS FIXES NEEDED. */
#define INVALID_FLOAT(val, size) invalid_float ((bfd_byte *) val, size)
static long
read_memory_integer (unsigned char * addr, int nr)
{
long val;
int i;
for (val = 0, i = nr - 1; i >= 0; i--)
{
val = (val << 8);
val |= (0xff & *(addr + i));
}
return val;
}
/* 32000 instructions are never longer than this. */
#define MAXLEN 62
#include <setjmp.h>
struct private
{
/* Points to first byte not fetched. */
bfd_byte *max_fetched;
bfd_byte the_buffer[MAXLEN];
bfd_vma insn_start;
OPCODES_SIGJMP_BUF bailout;
};
/* Make sure that bytes from INFO->PRIVATE_DATA->BUFFER (inclusive)
to ADDR (exclusive) are valid. Returns 1 for success, longjmps
on error. */
#define FETCH_DATA(info, addr) \
((addr) <= ((struct private *)(info->private_data))->max_fetched \
? 1 : fetch_data ((info), (addr)))
static int
fetch_data (struct disassemble_info *info, bfd_byte *addr)
{
int status;
struct private *priv = (struct private *) info->private_data;
bfd_vma start = priv->insn_start + (priv->max_fetched - priv->the_buffer);
status = (*info->read_memory_func) (start,
priv->max_fetched,
addr - priv->max_fetched,
info);
if (status != 0)
{
(*info->memory_error_func) (status, start, info);
OPCODES_SIGLONGJMP (priv->bailout, 1);
}
else
priv->max_fetched = addr;
return 1;
}
/* Number of elements in the opcode table. */
#define NOPCODES (sizeof ns32k_opcodes / sizeof ns32k_opcodes[0])
#define NEXT_IS_ADDR '|'
struct ns32k_option
{
char *pattern; /* The option itself. */
unsigned long value; /* Binary value of the option. */
unsigned long match; /* These bits must match. */
};
static const struct ns32k_option opt_u[]= /* Restore, exit. */
{
{ "r0", 0x80, 0x80 },
{ "r1", 0x40, 0x40 },
{ "r2", 0x20, 0x20 },
{ "r3", 0x10, 0x10 },
{ "r4", 0x08, 0x08 },
{ "r5", 0x04, 0x04 },
{ "r6", 0x02, 0x02 },
{ "r7", 0x01, 0x01 },
{ 0 , 0x00, 0x00 }
};
static const struct ns32k_option opt_U[]= /* Save, enter. */
{
{ "r0", 0x01, 0x01 },
{ "r1", 0x02, 0x02 },
{ "r2", 0x04, 0x04 },
{ "r3", 0x08, 0x08 },
{ "r4", 0x10, 0x10 },
{ "r5", 0x20, 0x20 },
{ "r6", 0x40, 0x40 },
{ "r7", 0x80, 0x80 },
{ 0 , 0x00, 0x00 }
};
static const struct ns32k_option opt_O[]= /* Setcfg. */
{
{ "c", 0x8, 0x8 },
{ "m", 0x4, 0x4 },
{ "f", 0x2, 0x2 },
{ "i", 0x1, 0x1 },
{ 0 , 0x0, 0x0 }
};
static const struct ns32k_option opt_C[]= /* Cinv. */
{
{ "a", 0x4, 0x4 },
{ "i", 0x2, 0x2 },
{ "d", 0x1, 0x1 },
{ 0 , 0x0, 0x0 }
};
static const struct ns32k_option opt_S[]= /* String inst. */
{
{ "b", 0x1, 0x1 },
{ "u", 0x6, 0x6 },
{ "w", 0x2, 0x2 },
{ 0 , 0x0, 0x0 }
};
static const struct ns32k_option list_P532[]= /* Lpr spr. */
{
{ "us", 0x0, 0xf },
{ "dcr", 0x1, 0xf },
{ "bpc", 0x2, 0xf },
{ "dsr", 0x3, 0xf },
{ "car", 0x4, 0xf },
{ "fp", 0x8, 0xf },
{ "sp", 0x9, 0xf },
{ "sb", 0xa, 0xf },
{ "usp", 0xb, 0xf },
{ "cfg", 0xc, 0xf },
{ "psr", 0xd, 0xf },
{ "intbase", 0xe, 0xf },
{ "mod", 0xf, 0xf },
{ 0 , 0x00, 0xf }
};
static const struct ns32k_option list_M532[]= /* Lmr smr. */
{
{ "mcr", 0x9, 0xf },
{ "msr", 0xa, 0xf },
{ "tear", 0xb, 0xf },
{ "ptb0", 0xc, 0xf },
{ "ptb1", 0xd, 0xf },
{ "ivar0", 0xe, 0xf },
{ "ivar1", 0xf, 0xf },
{ 0 , 0x0, 0xf }
};
static const struct ns32k_option list_P032[]= /* Lpr spr. */
{
{ "upsr", 0x0, 0xf },
{ "fp", 0x8, 0xf },
{ "sp", 0x9, 0xf },
{ "sb", 0xa, 0xf },
{ "psr", 0xb, 0xf },
{ "intbase", 0xe, 0xf },
{ "mod", 0xf, 0xf },
{ 0 , 0x0, 0xf }
};
static const struct ns32k_option list_M032[]= /* Lmr smr. */
{
{ "bpr0", 0x0, 0xf },
{ "bpr1", 0x1, 0xf },
{ "pf0", 0x4, 0xf },
{ "pf1", 0x5, 0xf },
{ "sc", 0x8, 0xf },
{ "msr", 0xa, 0xf },
{ "bcnt", 0xb, 0xf },
{ "ptb0", 0xc, 0xf },
{ "ptb1", 0xd, 0xf },
{ "eia", 0xf, 0xf },
{ 0 , 0x0, 0xf }
};
/* Figure out which options are present. */
static void
optlist (int options, const struct ns32k_option * optionP, char * result)
{
if (options == 0)
{
sprintf (result, "[]");
return;
}
sprintf (result, "[");
for (; (options != 0) && optionP->pattern; optionP++)
{
if ((options & optionP->match) == optionP->value)
{
/* We found a match, update result and options. */
strcat (result, optionP->pattern);
options &= ~optionP->value;
if (options != 0) /* More options to come. */
strcat (result, ",");
}
}
if (options != 0)
strcat (result, "undefined");
strcat (result, "]");
}
static void
list_search (int reg_value, const struct ns32k_option *optionP, char *result)
{
for (; optionP->pattern; optionP++)
{
if ((reg_value & optionP->match) == optionP->value)
{
sprintf (result, "%s", optionP->pattern);
return;
}
}
sprintf (result, "undefined");
}
/* Extract "count" bits starting "offset" bits into buffer. */
static int
bit_extract (bfd_byte *buffer, int offset, int count)
{
unsigned int result;
unsigned int bit;
if (offset < 0 || count < 0)
return 0;
buffer += offset >> 3;
offset &= 7;
bit = 1;
result = 0;
while (count--)
{
FETCH_DATA (dis_info, buffer + 1);
if ((*buffer & (1 << offset)))
result |= bit;
if (++offset == 8)
{
offset = 0;
buffer++;
}
bit <<= 1;
}
return result;
}
/* Like bit extract but the buffer is valid and doen't need to be fetched. */
static int
bit_extract_simple (bfd_byte *buffer, int offset, int count)
{
unsigned int result;
unsigned int bit;
if (offset < 0 || count < 0)
return 0;
buffer += offset >> 3;
offset &= 7;
bit = 1;
result = 0;
while (count--)
{
if ((*buffer & (1 << offset)))
result |= bit;
if (++offset == 8)
{
offset = 0;
buffer++;
}
bit <<= 1;
}
return result;
}
static void
bit_copy (bfd_byte *buffer, int offset, int count, char *to)
{
if (offset < 0 || count < 0)
return;
for (; count > 8; count -= 8, to++, offset += 8)
*to = bit_extract (buffer, offset, 8);
*to = bit_extract (buffer, offset, count);
}
static int
sign_extend (unsigned int value, unsigned int bits)
{
unsigned int sign = 1u << (bits - 1);
return ((value & (sign + sign - 1)) ^ sign) - sign;
}
static void
flip_bytes (char *ptr, int count)
{
char tmp;
while (count > 0)
{
tmp = ptr[0];
ptr[0] = ptr[count - 1];
ptr[count - 1] = tmp;
ptr++;
count -= 2;
}
}
/* Given a character C, does it represent a general addressing mode? */
#define Is_gen(c) (strchr ("FLBWDAIZf", (c)) != NULL)
/* Adressing modes. */
#define Adrmod_index_byte 0x1c
#define Adrmod_index_word 0x1d
#define Adrmod_index_doubleword 0x1e
#define Adrmod_index_quadword 0x1f
/* Is MODE an indexed addressing mode? */
#define Adrmod_is_index(mode) \
( mode == Adrmod_index_byte \
|| mode == Adrmod_index_word \
|| mode == Adrmod_index_doubleword \
|| mode == Adrmod_index_quadword)
static int
get_displacement (bfd_byte *buffer, int *aoffsetp)
{
int Ivalue;
short Ivalue2;
Ivalue = bit_extract (buffer, *aoffsetp, 8);
switch (Ivalue & 0xc0)
{
case 0x00:
case 0x40:
Ivalue = sign_extend (Ivalue, 7);
*aoffsetp += 8;
break;
case 0x80:
Ivalue2 = bit_extract (buffer, *aoffsetp, 16);
flip_bytes ((char *) & Ivalue2, 2);
Ivalue = sign_extend (Ivalue2, 14);
*aoffsetp += 16;
break;
case 0xc0:
Ivalue = bit_extract (buffer, *aoffsetp, 32);
flip_bytes ((char *) & Ivalue, 4);
Ivalue = sign_extend (Ivalue, 30);
*aoffsetp += 32;
break;
}
return Ivalue;
}
#if 1 /* A version that should work on ns32k f's&d's on any machine. */
static int
invalid_float (bfd_byte *p, int len)
{
int val;
if (len == 4)
val = (bit_extract_simple (p, 23, 8)/*exponent*/ == 0xff
|| (bit_extract_simple (p, 23, 8)/*exponent*/ == 0
&& bit_extract_simple (p, 0, 23)/*mantisa*/ != 0));
else if (len == 8)
val = (bit_extract_simple (p, 52, 11)/*exponent*/ == 0x7ff
|| (bit_extract_simple (p, 52, 11)/*exponent*/ == 0
&& (bit_extract_simple (p, 0, 32)/*low mantisa*/ != 0
|| bit_extract_simple (p, 32, 20)/*high mantisa*/ != 0)));
else
val = 1;
return (val);
}
#else
/* Assumes the bytes have been swapped to local order. */
typedef union
{
double d;
float f;
struct { unsigned m:23, e:8, :1;} sf;
struct { unsigned lm; unsigned m:20, e:11, :1;} sd;
} float_type_u;
static int
invalid_float (float_type_u *p, int len)
{
int val;
if (len == sizeof (float))
val = (p->sf.e == 0xff
|| (p->sf.e == 0 && p->sf.m != 0));
else if (len == sizeof (double))
val = (p->sd.e == 0x7ff
|| (p->sd.e == 0 && (p->sd.m != 0 || p->sd.lm != 0)));
else
val = 1;
return val;
}
#endif
/* Print an instruction operand of category given by d. IOFFSET is
the bit position below which small (<1 byte) parts of the operand can
be found (usually in the basic instruction, but for indexed
addressing it can be in the index byte). AOFFSETP is a pointer to the
bit position of the addressing extension. BUFFER contains the
instruction. ADDR is where BUFFER was read from. Put the disassembled
version of the operand in RESULT. INDEX_OFFSET is the bit position
of the index byte (it contains -1 if this operand is not a
general operand using scaled indexed addressing mode). */
static int
print_insn_arg (int d,
int ioffset,
int *aoffsetp,
bfd_byte *buffer,
bfd_vma addr,
char *result,
int index_offset)
{
union
{
float f;
double d;
int i[2];
} value;
int Ivalue;
int addr_mode;
int disp1, disp2;
int size;
switch (d)
{
case 'f':
/* A "gen" operand but 5 bits from the end of instruction. */
ioffset -= 5;
/* Fall through. */
case 'Z':
case 'F':
case 'L':
case 'I':
case 'B':
case 'W':
case 'D':
case 'A':
addr_mode = bit_extract (buffer, ioffset - 5, 5);
ioffset -= 5;
switch (addr_mode)
{
case 0x0: case 0x1: case 0x2: case 0x3:
case 0x4: case 0x5: case 0x6: case 0x7:
/* Register mode R0 -- R7. */
switch (d)
{
case 'F':
case 'L':
case 'Z':
sprintf (result, "f%d", addr_mode);
break;
default:
sprintf (result, "r%d", addr_mode);
}
break;
case 0x8: case 0x9: case 0xa: case 0xb:
case 0xc: case 0xd: case 0xe: case 0xf:
/* Register relative disp(R0 -- R7). */
disp1 = get_displacement (buffer, aoffsetp);
sprintf (result, "%d(r%d)", disp1, addr_mode & 7);
break;
case 0x10:
case 0x11:
case 0x12:
/* Memory relative disp2(disp1(FP, SP, SB)). */
disp1 = get_displacement (buffer, aoffsetp);
disp2 = get_displacement (buffer, aoffsetp);
sprintf (result, "%d(%d(%s))", disp2, disp1,
addr_mode == 0x10 ? "fp" : addr_mode == 0x11 ? "sp" : "sb");
break;
case 0x13:
/* Reserved. */
sprintf (result, "reserved");
break;
case 0x14:
/* Immediate. */
switch (d)
{
case 'I':
case 'Z':
case 'A':
/* I and Z are output operands and can`t be immediate
A is an address and we can`t have the address of
an immediate either. We don't know how much to increase
aoffsetp by since whatever generated this is broken
anyway! */
sprintf (result, _("$<undefined>"));
break;
case 'B':
Ivalue = bit_extract (buffer, *aoffsetp, 8);
Ivalue = sign_extend (Ivalue, 8);
*aoffsetp += 8;
sprintf (result, "$%d", Ivalue);
break;
case 'W':
Ivalue = bit_extract (buffer, *aoffsetp, 16);
flip_bytes ((char *) & Ivalue, 2);
*aoffsetp += 16;
Ivalue = sign_extend (Ivalue, 16);
sprintf (result, "$%d", Ivalue);
break;
case 'D':
Ivalue = bit_extract (buffer, *aoffsetp, 32);
flip_bytes ((char *) & Ivalue, 4);
*aoffsetp += 32;
sprintf (result, "$%d", Ivalue);
break;
case 'F':
bit_copy (buffer, *aoffsetp, 32, (char *) &value.f);
flip_bytes ((char *) &value.f, 4);
*aoffsetp += 32;
if (INVALID_FLOAT (&value.f, 4))
sprintf (result, "<<invalid float 0x%.8x>>", value.i[0]);
else /* Assume host has ieee float. */
sprintf (result, "$%g", value.f);
break;
case 'L':
bit_copy (buffer, *aoffsetp, 64, (char *) &value.d);
flip_bytes ((char *) &value.d, 8);
*aoffsetp += 64;
if (INVALID_FLOAT (&value.d, 8))
sprintf (result, "<<invalid double 0x%.8x%.8x>>",
value.i[1], value.i[0]);
else /* Assume host has ieee float. */
sprintf (result, "$%g", value.d);
break;
}
break;
case 0x15:
/* Absolute @disp. */
disp1 = get_displacement (buffer, aoffsetp);
sprintf (result, "@|%d|", disp1);
break;
case 0x16:
/* External EXT(disp1) + disp2 (Mod table stuff). */
disp1 = get_displacement (buffer, aoffsetp);
disp2 = get_displacement (buffer, aoffsetp);
sprintf (result, "EXT(%d) + %d", disp1, disp2);
break;
case 0x17:
/* Top of stack tos. */
sprintf (result, "tos");
break;
case 0x18:
/* Memory space disp(FP). */
disp1 = get_displacement (buffer, aoffsetp);
sprintf (result, "%d(fp)", disp1);
break;
case 0x19:
/* Memory space disp(SP). */
disp1 = get_displacement (buffer, aoffsetp);
sprintf (result, "%d(sp)", disp1);
break;
case 0x1a:
/* Memory space disp(SB). */
disp1 = get_displacement (buffer, aoffsetp);
sprintf (result, "%d(sb)", disp1);
break;
case 0x1b:
/* Memory space disp(PC). */
disp1 = get_displacement (buffer, aoffsetp);
*result++ = NEXT_IS_ADDR;
sprintf_vma (result, addr + disp1);
result += strlen (result);
*result++ = NEXT_IS_ADDR;
*result = '\0';
break;
case 0x1c:
case 0x1d:
case 0x1e:
case 0x1f:
{
int bit_index;
static const char *ind = "bwdq";
char *off;
/* Scaled index basemode[R0 -- R7:B,W,D,Q]. */
bit_index = bit_extract (buffer, index_offset - 8, 3);
print_insn_arg (d, index_offset, aoffsetp, buffer, addr,
result, 0);
off = result + strlen (result);
sprintf (off, "[r%d:%c]", bit_index, ind[addr_mode & 3]);
}
break;
}
break;
case 'H':
case 'q':
Ivalue = bit_extract (buffer, ioffset-4, 4);
Ivalue = sign_extend (Ivalue, 4);
sprintf (result, "%d", Ivalue);
ioffset -= 4;
break;
case 'r':
Ivalue = bit_extract (buffer, ioffset-3, 3);
sprintf (result, "r%d", Ivalue&7);
ioffset -= 3;
break;
case 'd':
sprintf (result, "%d", get_displacement (buffer, aoffsetp));
break;
case 'b':
Ivalue = get_displacement (buffer, aoffsetp);
/* Warning!! HACK ALERT!
Operand type 'b' is only used by the cmp{b,w,d} and
movm{b,w,d} instructions; we need to know whether
it's a `b' or `w' or `d' instruction; and for both
cmpm and movm it's stored at the same place so we
just grab two bits of the opcode and look at it... */
size = bit_extract(buffer, ioffset-6, 2);
if (size == 0) /* 00 => b. */
size = 1;
else if (size == 1) /* 01 => w. */
size = 2;
else
size = 4; /* 11 => d. */
sprintf (result, "%d", (Ivalue / size) + 1);
break;
case 'p':
*result++ = NEXT_IS_ADDR;
sprintf_vma (result, addr + get_displacement (buffer, aoffsetp));
result += strlen (result);
*result++ = NEXT_IS_ADDR;
*result = '\0';
break;
case 'i':
Ivalue = bit_extract (buffer, *aoffsetp, 8);
*aoffsetp += 8;
sprintf (result, "0x%x", Ivalue);
break;
case 'u':
Ivalue = bit_extract (buffer, *aoffsetp, 8);
optlist (Ivalue, opt_u, result);
*aoffsetp += 8;
break;
case 'U':
Ivalue = bit_extract (buffer, *aoffsetp, 8);
optlist (Ivalue, opt_U, result);
*aoffsetp += 8;
break;
case 'O':
Ivalue = bit_extract (buffer, ioffset - 9, 9);
optlist (Ivalue, opt_O, result);
ioffset -= 9;
break;
case 'C':
Ivalue = bit_extract (buffer, ioffset - 4, 4);
optlist (Ivalue, opt_C, result);
ioffset -= 4;
break;
case 'S':
Ivalue = bit_extract (buffer, ioffset - 8, 8);
optlist (Ivalue, opt_S, result);
ioffset -= 8;
break;
case 'M':
Ivalue = bit_extract (buffer, ioffset - 4, 4);
list_search (Ivalue, 0 ? list_M032 : list_M532, result);
ioffset -= 4;
break;
case 'P':
Ivalue = bit_extract (buffer, ioffset - 4, 4);
list_search (Ivalue, 0 ? list_P032 : list_P532, result);
ioffset -= 4;
break;
case 'g':
Ivalue = bit_extract (buffer, *aoffsetp, 3);
sprintf (result, "%d", Ivalue);
*aoffsetp += 3;
break;
case 'G':
Ivalue = bit_extract(buffer, *aoffsetp, 5);
sprintf (result, "%d", Ivalue + 1);
*aoffsetp += 5;
break;
}
return ioffset;
}
/* Print the 32000 instruction at address MEMADDR in debugged memory,
on STREAM. Returns length of the instruction, in bytes. */
int
print_insn_ns32k (bfd_vma memaddr, disassemble_info *info)
{
unsigned int i;
const char *d;
unsigned short first_word;
int ioffset; /* Bits into instruction. */
int aoffset; /* Bits into arguments. */
char arg_bufs[MAX_ARGS+1][ARG_LEN];
int argnum;
int maxarg;
struct private priv;
bfd_byte *buffer = priv.the_buffer;
dis_info = info;
info->private_data = & priv;
priv.max_fetched = priv.the_buffer;
priv.insn_start = memaddr;
if (OPCODES_SIGSETJMP (priv.bailout) != 0)
/* Error return. */
return -1;
/* Look for 8bit opcodes first. Other wise, fetching two bytes could take
us over the end of accessible data unnecessarilly. */
FETCH_DATA (info, buffer + 1);
for (i = 0; i < NOPCODES; i++)
if (ns32k_opcodes[i].opcode_id_size <= 8
&& ((buffer[0]
& (((unsigned long) 1 << ns32k_opcodes[i].opcode_id_size) - 1))
== ns32k_opcodes[i].opcode_seed))
break;
if (i == NOPCODES)
{
/* Maybe it is 9 to 16 bits big. */
FETCH_DATA (info, buffer + 2);
first_word = read_memory_integer(buffer, 2);
for (i = 0; i < NOPCODES; i++)
if ((first_word
& (((unsigned long) 1 << ns32k_opcodes[i].opcode_id_size) - 1))
== ns32k_opcodes[i].opcode_seed)
break;
/* Handle undefined instructions. */
if (i == NOPCODES)
{
(*dis_info->fprintf_func)(dis_info->stream, "0%o", buffer[0]);
return 1;
}
}
(*dis_info->fprintf_func)(dis_info->stream, "%s", ns32k_opcodes[i].name);
ioffset = ns32k_opcodes[i].opcode_size;
aoffset = ns32k_opcodes[i].opcode_size;
d = ns32k_opcodes[i].operands;
if (*d)
{
/* Offset in bits of the first thing beyond each index byte.
Element 0 is for operand A and element 1 is for operand B. */
int index_offset[2];
/* 0 for operand A, 1 for operand B, greater for other args. */
int whicharg = 0;
(*dis_info->fprintf_func)(dis_info->stream, "\t");
maxarg = 0;
/* First we have to find and keep track of the index bytes,
if we are using scaled indexed addressing mode, since the index
bytes occur right after the basic instruction, not as part
of the addressing extension. */
index_offset[0] = -1;
index_offset[1] = -1;
if (Is_gen (d[1]))
{
int bitoff = d[1] == 'f' ? 10 : 5;
int addr_mode = bit_extract (buffer, ioffset - bitoff, 5);
if (Adrmod_is_index (addr_mode))
{
aoffset += 8;
index_offset[0] = aoffset;
}
}
if (d[2] && Is_gen (d[3]))
{
int addr_mode = bit_extract (buffer, ioffset - 10, 5);
if (Adrmod_is_index (addr_mode))
{
aoffset += 8;
index_offset[1] = aoffset;
}
}
while (*d)
{
argnum = *d - '1';
if (argnum >= MAX_ARGS)
abort ();
d++;
if (argnum > maxarg)
maxarg = argnum;
ioffset = print_insn_arg (*d, ioffset, &aoffset, buffer,
memaddr, arg_bufs[argnum],
whicharg > 1 ? -1 : index_offset[whicharg]);
d++;
whicharg++;
}
for (argnum = 0; argnum <= maxarg; argnum++)
{
bfd_vma addr;
char *ch;
for (ch = arg_bufs[argnum]; *ch;)
{
if (*ch == NEXT_IS_ADDR)
{
++ch;
addr = bfd_scan_vma (ch, NULL, 16);
(*dis_info->print_address_func) (addr, dis_info);
while (*ch && *ch != NEXT_IS_ADDR)
++ch;
if (*ch)
++ch;
}
else
(*dis_info->fprintf_func)(dis_info->stream, "%c", *ch++);
}
if (argnum < maxarg)
(*dis_info->fprintf_func)(dis_info->stream, ", ");
}
}
return aoffset / 8;
}
|