1999-05-03 09:29:11 +02:00
|
|
|
|
/* Print National Semiconductor 32000 instructions.
|
2020-01-01 08:57:01 +01:00
|
|
|
|
Copyright (C) 1986-2020 Free Software Foundation, Inc.
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2007-07-05 11:49:03 +02:00
|
|
|
|
This file is part of the GNU opcodes library.
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2007-07-05 11:49:03 +02:00
|
|
|
|
This library is free software; you can redistribute it and/or modify
|
2005-07-01 13:16:33 +02:00
|
|
|
|
it under the terms of the GNU General Public License as published by
|
2007-07-05 11:49:03 +02:00
|
|
|
|
the Free Software Foundation; either version 3, or (at your option)
|
|
|
|
|
any later version.
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2007-07-05 11:49:03 +02:00
|
|
|
|
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.
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
|
|
#include "sysdep.h"
|
2007-04-26 16:47:00 +02:00
|
|
|
|
#include "bfd.h"
|
Move print_insn_XXX to an opcodes internal header
With the changes done in previous patches, print_insn_XXX functions
don't have to be external visible out of opcodes, because both gdb
and objdump select disassemblers through a single interface.
This patch moves these print_insn_XXX declarations from
include/dis-asm.h to opcodes/disassemble.h, which is a new header
added by this patch.
include:
2017-05-24 Yao Qi <yao.qi@linaro.org>
* dis-asm.h: Move some function declarations to
opcodes/disassemble.h.
opcodes:
2017-05-24 Yao Qi <yao.qi@linaro.org>
* alpha-dis.c: Include disassemble.h, don't include
dis-asm.h.
* avr-dis.c, bfin-dis.c, cr16-dis.c: Likewise.
* crx-dis.c, d10v-dis.c, d30v-dis.c: Likewise.
* disassemble.c, dlx-dis.c, epiphany-dis.c: Likewise.
* fr30-dis.c, ft32-dis.c, h8300-dis.c, h8500-dis.c: Likewise.
* hppa-dis.c, i370-dis.c, i386-dis.c: Likewise.
* i860-dis.c, i960-dis.c, ip2k-dis.c: Likewise.
* iq2000-dis.c, lm32-dis.c, m10200-dis.c: Likewise.
* m10300-dis.c, m32r-dis.c, m68hc11-dis.c: Likewise.
* m68k-dis.c, m88k-dis.c, mcore-dis.c: Likewise.
* metag-dis.c, microblaze-dis.c, mmix-dis.c: Likewise.
* moxie-dis.c, msp430-dis.c, mt-dis.c:
* nds32-dis.c, nios2-dis.c, ns32k-dis.c: Likewise.
* or1k-dis.c, pdp11-dis.c, pj-dis.c: Likewise.
* ppc-dis.c, pru-dis.c, riscv-dis.c: Likewise.
* rl78-dis.c, s390-dis.c, score-dis.c: Likewise.
* sh-dis.c, sh64-dis.c, tic30-dis.c: Likewise.
* tic4x-dis.c, tic54x-dis.c, tic6x-dis.c: Likewise.
* tic80-dis.c, tilegx-dis.c, tilepro-dis.c: Likewise.
* v850-dis.c, vax-dis.c, visium-dis.c: Likewise.
* w65-dis.c, wasm32-dis.c, xc16x-dis.c: Likewise.
* xgate-dis.c, xstormy16-dis.c, xtensa-dis.c: Likewise.
* z80-dis.c, z8k-dis.c: Likewise.
* disassemble.h: New file.
2017-05-24 18:23:52 +02:00
|
|
|
|
#include "disassemble.h"
|
1999-05-03 09:29:11 +02:00
|
|
|
|
#if !defined(const) && !defined(__STDC__)
|
|
|
|
|
#define const
|
|
|
|
|
#endif
|
|
|
|
|
#include "opcode/ns32k.h"
|
|
|
|
|
#include "opintl.h"
|
|
|
|
|
|
|
|
|
|
static disassemble_info *dis_info;
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* 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)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
long val;
|
|
|
|
|
int i;
|
2005-07-01 13:16:33 +02:00
|
|
|
|
|
|
|
|
|
for (val = 0, i = nr - 1; i >= 0; i--)
|
|
|
|
|
{
|
|
|
|
|
val = (val << 8);
|
|
|
|
|
val |= (0xff & *(addr + i));
|
|
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
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;
|
2014-05-02 17:27:16 +02:00
|
|
|
|
OPCODES_SIGJMP_BUF bailout;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* 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
|
2005-07-01 13:16:33 +02:00
|
|
|
|
fetch_data (struct disassemble_info *info, bfd_byte *addr)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
int status;
|
2005-07-01 13:16:33 +02:00
|
|
|
|
struct private *priv = (struct private *) info->private_data;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
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);
|
2014-05-02 17:27:16 +02:00
|
|
|
|
OPCODES_SIGLONGJMP (priv->bailout, 1);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
priv->max_fetched = addr;
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
2005-07-01 13:16:33 +02:00
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
|
/* Number of elements in the opcode table. */
|
|
|
|
|
#define NOPCODES (sizeof ns32k_opcodes / sizeof ns32k_opcodes[0])
|
|
|
|
|
|
|
|
|
|
#define NEXT_IS_ADDR '|'
|
|
|
|
|
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
struct ns32k_option
|
|
|
|
|
{
|
|
|
|
|
char *pattern; /* The option itself. */
|
|
|
|
|
unsigned long value; /* Binary value of the option. */
|
|
|
|
|
unsigned long match; /* These bits must match. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option opt_u[]= /* Restore, exit. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "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 }
|
|
|
|
|
};
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option opt_U[]= /* Save, enter. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "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 }
|
|
|
|
|
};
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option opt_O[]= /* Setcfg. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "c", 0x8, 0x8 },
|
|
|
|
|
{ "m", 0x4, 0x4 },
|
|
|
|
|
{ "f", 0x2, 0x2 },
|
|
|
|
|
{ "i", 0x1, 0x1 },
|
|
|
|
|
{ 0 , 0x0, 0x0 }
|
|
|
|
|
};
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option opt_C[]= /* Cinv. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "a", 0x4, 0x4 },
|
|
|
|
|
{ "i", 0x2, 0x2 },
|
|
|
|
|
{ "d", 0x1, 0x1 },
|
|
|
|
|
{ 0 , 0x0, 0x0 }
|
|
|
|
|
};
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option opt_S[]= /* String inst. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "b", 0x1, 0x1 },
|
|
|
|
|
{ "u", 0x6, 0x6 },
|
|
|
|
|
{ "w", 0x2, 0x2 },
|
|
|
|
|
{ 0 , 0x0, 0x0 }
|
|
|
|
|
};
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option list_P532[]= /* Lpr spr. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "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 }
|
|
|
|
|
};
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option list_M532[]= /* Lmr smr. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "mcr", 0x9, 0xf },
|
|
|
|
|
{ "msr", 0xa, 0xf },
|
|
|
|
|
{ "tear", 0xb, 0xf },
|
|
|
|
|
{ "ptb0", 0xc, 0xf },
|
|
|
|
|
{ "ptb1", 0xd, 0xf },
|
|
|
|
|
{ "ivar0", 0xe, 0xf },
|
|
|
|
|
{ "ivar1", 0xf, 0xf },
|
|
|
|
|
{ 0 , 0x0, 0xf }
|
|
|
|
|
};
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option list_P032[]= /* Lpr spr. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "upsr", 0x0, 0xf },
|
|
|
|
|
{ "fp", 0x8, 0xf },
|
|
|
|
|
{ "sp", 0x9, 0xf },
|
|
|
|
|
{ "sb", 0xa, 0xf },
|
|
|
|
|
{ "psr", 0xb, 0xf },
|
|
|
|
|
{ "intbase", 0xe, 0xf },
|
|
|
|
|
{ "mod", 0xf, 0xf },
|
|
|
|
|
{ 0 , 0x0, 0xf }
|
|
|
|
|
};
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static const struct ns32k_option list_M032[]= /* Lmr smr. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
{ "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 }
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Figure out which options are present. */
|
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
|
static void
|
2005-07-01 13:16:33 +02:00
|
|
|
|
optlist (int options, const struct ns32k_option * optionP, char * result)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
if (options == 0)
|
|
|
|
|
{
|
|
|
|
|
sprintf (result, "[]");
|
|
|
|
|
return;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
2005-07-01 13:16:33 +02:00
|
|
|
|
|
|
|
|
|
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, ",");
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
if (options != 0)
|
|
|
|
|
strcat (result, "undefined");
|
|
|
|
|
|
|
|
|
|
strcat (result, "]");
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2005-07-01 13:16:33 +02:00
|
|
|
|
list_search (int reg_value, const struct ns32k_option *optionP, char *result)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
for (; optionP->pattern; optionP++)
|
|
|
|
|
{
|
|
|
|
|
if ((reg_value & optionP->match) == optionP->value)
|
|
|
|
|
{
|
|
|
|
|
sprintf (result, "%s", optionP->pattern);
|
|
|
|
|
return;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
2005-07-01 13:16:33 +02:00
|
|
|
|
sprintf (result, "undefined");
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Extract "count" bits starting "offset" bits into buffer. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
|
|
static int
|
2005-07-01 13:16:33 +02:00
|
|
|
|
bit_extract (bfd_byte *buffer, int offset, int count)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2019-12-10 23:04:57 +01:00
|
|
|
|
unsigned int result;
|
|
|
|
|
unsigned int bit;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2019-10-28 16:44:23 +01:00
|
|
|
|
if (offset < 0 || count < 0)
|
|
|
|
|
return 0;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
buffer += offset >> 3;
|
|
|
|
|
offset &= 7;
|
|
|
|
|
bit = 1;
|
|
|
|
|
result = 0;
|
|
|
|
|
while (count--)
|
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
FETCH_DATA (dis_info, buffer + 1);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
if ((*buffer & (1 << offset)))
|
|
|
|
|
result |= bit;
|
|
|
|
|
if (++offset == 8)
|
|
|
|
|
{
|
|
|
|
|
offset = 0;
|
|
|
|
|
buffer++;
|
|
|
|
|
}
|
|
|
|
|
bit <<= 1;
|
|
|
|
|
}
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Like bit extract but the buffer is valid and doen't need to be fetched. */
|
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
|
static int
|
2005-07-01 13:16:33 +02:00
|
|
|
|
bit_extract_simple (bfd_byte *buffer, int offset, int count)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2019-12-10 23:04:57 +01:00
|
|
|
|
unsigned int result;
|
|
|
|
|
unsigned int bit;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2019-10-28 16:44:23 +01:00
|
|
|
|
if (offset < 0 || count < 0)
|
|
|
|
|
return 0;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
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
|
2005-07-01 13:16:33 +02:00
|
|
|
|
bit_copy (bfd_byte *buffer, int offset, int count, char *to)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2019-10-28 16:44:23 +01:00
|
|
|
|
if (offset < 0 || count < 0)
|
|
|
|
|
return;
|
2005-07-01 13:16:33 +02:00
|
|
|
|
for (; count > 8; count -= 8, to++, offset += 8)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*to = bit_extract (buffer, offset, 8);
|
|
|
|
|
*to = bit_extract (buffer, offset, count);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int
|
2019-12-10 23:04:57 +01:00
|
|
|
|
sign_extend (unsigned int value, unsigned int bits)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2019-12-11 03:41:07 +01:00
|
|
|
|
unsigned int sign = 1u << (bits - 1);
|
|
|
|
|
return ((value & (sign + sign - 1)) ^ sign) - sign;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2005-07-01 13:16:33 +02:00
|
|
|
|
flip_bytes (char *ptr, int count)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
char tmp;
|
|
|
|
|
|
|
|
|
|
while (count > 0)
|
|
|
|
|
{
|
|
|
|
|
tmp = ptr[0];
|
2005-07-01 13:16:33 +02:00
|
|
|
|
ptr[0] = ptr[count - 1];
|
|
|
|
|
ptr[count - 1] = tmp;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
ptr++;
|
|
|
|
|
count -= 2;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Given a character C, does it represent a general addressing mode? */
|
2020-01-13 08:28:02 +01:00
|
|
|
|
#define Is_gen(c) (strchr ("FLBWDAIZf", (c)) != NULL)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
|
|
/* Adressing modes. */
|
2005-07-01 13:16:33 +02:00
|
|
|
|
#define Adrmod_index_byte 0x1c
|
|
|
|
|
#define Adrmod_index_word 0x1d
|
|
|
|
|
#define Adrmod_index_doubleword 0x1e
|
|
|
|
|
#define Adrmod_index_quadword 0x1f
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
|
|
/* Is MODE an indexed addressing mode? */
|
|
|
|
|
#define Adrmod_is_index(mode) \
|
2005-07-01 13:16:33 +02:00
|
|
|
|
( mode == Adrmod_index_byte \
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|| mode == Adrmod_index_word \
|
|
|
|
|
|| mode == Adrmod_index_doubleword \
|
|
|
|
|
|| mode == Adrmod_index_quadword)
|
|
|
|
|
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static int
|
|
|
|
|
get_displacement (bfd_byte *buffer, int *aoffsetp)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
int Ivalue;
|
|
|
|
|
short Ivalue2;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
Ivalue = bit_extract (buffer, *aoffsetp, 8);
|
|
|
|
|
switch (Ivalue & 0xc0)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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;
|
|
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
#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
|
2015-08-12 13:45:07 +02:00
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
static int
|
|
|
|
|
invalid_float (float_type_u *p, int len)
|
|
|
|
|
{
|
|
|
|
|
int val;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
2005-07-01 13:16:33 +02:00
|
|
|
|
#endif
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
|
|
/* 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 garbage if this operand is not a
|
|
|
|
|
general operand using scaled indexed addressing mode). */
|
|
|
|
|
|
|
|
|
|
static int
|
2005-07-01 13:16:33 +02:00
|
|
|
|
print_insn_arg (int d,
|
|
|
|
|
int ioffset,
|
|
|
|
|
int *aoffsetp,
|
|
|
|
|
bfd_byte *buffer,
|
|
|
|
|
bfd_vma addr,
|
|
|
|
|
char *result,
|
|
|
|
|
int index_offset)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
union
|
|
|
|
|
{
|
2002-12-02 14:13:37 +01:00
|
|
|
|
float f;
|
|
|
|
|
double d;
|
|
|
|
|
int i[2];
|
|
|
|
|
} value;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
int Ivalue;
|
2002-12-02 14:13:37 +01:00
|
|
|
|
int addr_mode;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
int disp1, disp2;
|
|
|
|
|
int size;
|
|
|
|
|
|
|
|
|
|
switch (d)
|
|
|
|
|
{
|
|
|
|
|
case 'f':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* A "gen" operand but 5 bits from the end of instruction. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
ioffset -= 5;
|
2016-10-05 09:47:02 +02:00
|
|
|
|
/* Fall through. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
case 'Z':
|
|
|
|
|
case 'F':
|
|
|
|
|
case 'L':
|
|
|
|
|
case 'I':
|
|
|
|
|
case 'B':
|
|
|
|
|
case 'W':
|
|
|
|
|
case 'D':
|
|
|
|
|
case 'A':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
addr_mode = bit_extract (buffer, ioffset - 5, 5);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
ioffset -= 5;
|
|
|
|
|
switch (addr_mode)
|
|
|
|
|
{
|
|
|
|
|
case 0x0: case 0x1: case 0x2: case 0x3:
|
|
|
|
|
case 0x4: case 0x5: case 0x6: case 0x7:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Register mode R0 -- R7. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
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:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Register relative disp(R0 -- R7). */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
disp1 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
sprintf (result, "%d(r%d)", disp1, addr_mode & 7);
|
|
|
|
|
break;
|
|
|
|
|
case 0x10:
|
|
|
|
|
case 0x11:
|
|
|
|
|
case 0x12:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Memory relative disp2(disp1(FP, SP, SB)). */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
disp1 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
disp2 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
sprintf (result, "%d(%d(%s))", disp2, disp1,
|
2005-07-01 13:16:33 +02:00
|
|
|
|
addr_mode == 0x10 ? "fp" : addr_mode == 0x11 ? "sp" : "sb");
|
1999-05-03 09:29:11 +02:00
|
|
|
|
break;
|
|
|
|
|
case 0x13:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Reserved. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
sprintf (result, "reserved");
|
|
|
|
|
break;
|
|
|
|
|
case 0x14:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Immediate. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
switch (d)
|
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
case 'I':
|
|
|
|
|
case 'Z':
|
|
|
|
|
case 'A':
|
1999-05-03 09:29:11 +02:00
|
|
|
|
/* I and Z are output operands and can`t be immediate
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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! */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
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);
|
2001-09-20 17:28:25 +02:00
|
|
|
|
flip_bytes ((char *) & Ivalue, 2);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*aoffsetp += 16;
|
|
|
|
|
Ivalue = sign_extend (Ivalue, 16);
|
|
|
|
|
sprintf (result, "$%d", Ivalue);
|
|
|
|
|
break;
|
|
|
|
|
case 'D':
|
|
|
|
|
Ivalue = bit_extract (buffer, *aoffsetp, 32);
|
2001-09-20 17:28:25 +02:00
|
|
|
|
flip_bytes ((char *) & Ivalue, 4);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*aoffsetp += 32;
|
|
|
|
|
sprintf (result, "$%d", Ivalue);
|
|
|
|
|
break;
|
|
|
|
|
case 'F':
|
2002-12-02 14:13:37 +01:00
|
|
|
|
bit_copy (buffer, *aoffsetp, 32, (char *) &value.f);
|
|
|
|
|
flip_bytes ((char *) &value.f, 4);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*aoffsetp += 32;
|
2002-12-02 14:13:37 +01:00
|
|
|
|
if (INVALID_FLOAT (&value.f, 4))
|
|
|
|
|
sprintf (result, "<<invalid float 0x%.8x>>", value.i[0]);
|
2005-07-01 13:16:33 +02:00
|
|
|
|
else /* Assume host has ieee float. */
|
2002-12-02 14:13:37 +01:00
|
|
|
|
sprintf (result, "$%g", value.f);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
break;
|
|
|
|
|
case 'L':
|
2002-12-02 14:13:37 +01:00
|
|
|
|
bit_copy (buffer, *aoffsetp, 64, (char *) &value.d);
|
|
|
|
|
flip_bytes ((char *) &value.d, 8);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*aoffsetp += 64;
|
2002-12-02 14:13:37 +01:00
|
|
|
|
if (INVALID_FLOAT (&value.d, 8))
|
|
|
|
|
sprintf (result, "<<invalid double 0x%.8x%.8x>>",
|
|
|
|
|
value.i[1], value.i[0]);
|
2005-07-01 13:16:33 +02:00
|
|
|
|
else /* Assume host has ieee float. */
|
2002-12-02 14:13:37 +01:00
|
|
|
|
sprintf (result, "$%g", value.d);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
case 0x15:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Absolute @disp. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
disp1 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
sprintf (result, "@|%d|", disp1);
|
|
|
|
|
break;
|
|
|
|
|
case 0x16:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* External EXT(disp1) + disp2 (Mod table stuff). */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
disp1 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
disp2 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
sprintf (result, "EXT(%d) + %d", disp1, disp2);
|
|
|
|
|
break;
|
|
|
|
|
case 0x17:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Top of stack tos. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
sprintf (result, "tos");
|
|
|
|
|
break;
|
|
|
|
|
case 0x18:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Memory space disp(FP). */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
disp1 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
sprintf (result, "%d(fp)", disp1);
|
|
|
|
|
break;
|
|
|
|
|
case 0x19:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Memory space disp(SP). */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
disp1 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
sprintf (result, "%d(sp)", disp1);
|
|
|
|
|
break;
|
|
|
|
|
case 0x1a:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Memory space disp(SB). */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
disp1 = get_displacement (buffer, aoffsetp);
|
|
|
|
|
sprintf (result, "%d(sb)", disp1);
|
|
|
|
|
break;
|
|
|
|
|
case 0x1b:
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* Memory space disp(PC). */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
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:
|
|
|
|
|
{
|
2009-12-11 14:42:17 +01:00
|
|
|
|
int bit_index;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
static const char *ind = "bwdq";
|
|
|
|
|
char *off;
|
2015-08-12 13:45:07 +02:00
|
|
|
|
|
2009-12-11 14:42:17 +01:00
|
|
|
|
/* 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);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
off = result + strlen (result);
|
2009-12-11 14:42:17 +01:00
|
|
|
|
sprintf (off, "[r%d:%c]", bit_index, ind[addr_mode & 3]);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
|
|
|
|
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);
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* 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... */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
size = bit_extract(buffer, ioffset-6, 2);
|
2005-07-01 13:16:33 +02:00
|
|
|
|
if (size == 0) /* 00 => b. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
size = 1;
|
2005-07-01 13:16:33 +02:00
|
|
|
|
else if (size == 1) /* 01 => w. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
size = 2;
|
|
|
|
|
else
|
2005-07-01 13:16:33 +02:00
|
|
|
|
size = 4; /* 11 => d. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
|
|
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);
|
2005-07-01 13:16:33 +02:00
|
|
|
|
optlist (Ivalue, opt_u, result);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*aoffsetp += 8;
|
|
|
|
|
break;
|
|
|
|
|
case 'U':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
Ivalue = bit_extract (buffer, *aoffsetp, 8);
|
|
|
|
|
optlist (Ivalue, opt_U, result);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*aoffsetp += 8;
|
|
|
|
|
break;
|
|
|
|
|
case 'O':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
Ivalue = bit_extract (buffer, ioffset - 9, 9);
|
|
|
|
|
optlist (Ivalue, opt_O, result);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
ioffset -= 9;
|
|
|
|
|
break;
|
|
|
|
|
case 'C':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
Ivalue = bit_extract (buffer, ioffset - 4, 4);
|
|
|
|
|
optlist (Ivalue, opt_C, result);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
ioffset -= 4;
|
|
|
|
|
break;
|
|
|
|
|
case 'S':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
Ivalue = bit_extract (buffer, ioffset - 8, 8);
|
|
|
|
|
optlist (Ivalue, opt_S, result);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
ioffset -= 8;
|
|
|
|
|
break;
|
|
|
|
|
case 'M':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
Ivalue = bit_extract (buffer, ioffset - 4, 4);
|
|
|
|
|
list_search (Ivalue, 0 ? list_M032 : list_M532, result);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
ioffset -= 4;
|
|
|
|
|
break;
|
|
|
|
|
case 'P':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
Ivalue = bit_extract (buffer, ioffset - 4, 4);
|
|
|
|
|
list_search (Ivalue, 0 ? list_P032 : list_P532, result);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
ioffset -= 4;
|
|
|
|
|
break;
|
|
|
|
|
case 'g':
|
2005-07-01 13:16:33 +02:00
|
|
|
|
Ivalue = bit_extract (buffer, *aoffsetp, 3);
|
|
|
|
|
sprintf (result, "%d", Ivalue);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*aoffsetp += 3;
|
|
|
|
|
break;
|
|
|
|
|
case 'G':
|
|
|
|
|
Ivalue = bit_extract(buffer, *aoffsetp, 5);
|
2005-07-01 13:16:33 +02:00
|
|
|
|
sprintf (result, "%d", Ivalue + 1);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
*aoffsetp += 5;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
return ioffset;
|
|
|
|
|
}
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
|
|
|
|
|
/* 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)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
info->private_data = & priv;
|
|
|
|
|
priv.max_fetched = priv.the_buffer;
|
|
|
|
|
priv.insn_start = memaddr;
|
2014-05-02 17:27:16 +02:00
|
|
|
|
if (OPCODES_SIGSETJMP (priv.bailout) != 0)
|
2005-07-01 13:16:33 +02:00
|
|
|
|
/* 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))
|
1999-05-03 09:29:11 +02:00
|
|
|
|
break;
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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;
|
|
|
|
|
}
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
(*dis_info->fprintf_func)(dis_info->stream, "%s", ns32k_opcodes[i].name);
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
ioffset = ns32k_opcodes[i].opcode_size;
|
|
|
|
|
aoffset = ns32k_opcodes[i].opcode_size;
|
|
|
|
|
d = ns32k_opcodes[i].operands;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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.
|
|
|
|
|
The rest are irrelevant, but we put them here so we don't
|
|
|
|
|
index outside the array. */
|
|
|
|
|
int index_offset[MAX_ARGS];
|
|
|
|
|
|
|
|
|
|
/* 0 for operand A, 1 for operand B, greater for other args. */
|
|
|
|
|
int whicharg = 0;
|
2015-08-12 13:45:07 +02:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
(*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. */
|
2020-01-13 08:28:02 +01:00
|
|
|
|
if (Is_gen (d[1]))
|
2005-07-01 13:16:33 +02:00
|
|
|
|
{
|
2020-01-13 08:28:02 +01:00
|
|
|
|
int bitoff = d[1] == 'f' ? 10 : 5;
|
|
|
|
|
int addr_mode = bit_extract (buffer, ioffset - bitoff, 5);
|
2005-07-01 13:16:33 +02:00
|
|
|
|
|
|
|
|
|
if (Adrmod_is_index (addr_mode))
|
|
|
|
|
{
|
|
|
|
|
aoffset += 8;
|
|
|
|
|
index_offset[0] = aoffset;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2020-01-13 08:28:02 +01:00
|
|
|
|
if (d[2] && Is_gen (d[3]))
|
2005-07-01 13:16:33 +02:00
|
|
|
|
{
|
|
|
|
|
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';
|
|
|
|
|
d++;
|
|
|
|
|
if (argnum > maxarg && argnum < MAX_ARGS)
|
|
|
|
|
maxarg = argnum;
|
|
|
|
|
ioffset = print_insn_arg (*d, ioffset, &aoffset, buffer,
|
|
|
|
|
memaddr, arg_bufs[argnum],
|
|
|
|
|
index_offset[whicharg]);
|
|
|
|
|
d++;
|
2019-10-28 16:44:23 +01:00
|
|
|
|
if (whicharg++ >= 1)
|
|
|
|
|
break;
|
2005-07-01 13:16:33 +02:00
|
|
|
|
}
|
2019-10-28 16:44:23 +01:00
|
|
|
|
|
2005-07-01 13:16:33 +02:00
|
|
|
|
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;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
}
|