[deliverable/binutils-gdb.git] / opcodes / h8300-dis.c

/* Disassemble h8300 instructions.
   Copyright (C) 1993, 1998, 2000 Free Software Foundation, Inc.

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 2 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, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */

#define DEFINE_TABLE

#include "sysdep.h"
#define h8_opcodes h8ops
#include "opcode/h8300.h"
#include "dis-asm.h"
#include "opintl.h"

/* Run through the opcodes and sort them into order to make them easy
   to disassemble.  */
static void
bfd_h8_disassemble_init ()
{
  unsigned int i;
  struct h8_opcode *p;

  for (p = h8_opcodes; p->name; p++)
    {
      int n1 = 0;
      int n2 = 0;

      if ((int) p->data.nib[0] < 16)
	n1 = (int) p->data.nib[0];
      else
	n1 = 0;

      if ((int) p->data.nib[1] < 16)
	n2 = (int) p->data.nib[1];
      else
	n2 = 0;

      /* Just make sure there are an even number of nibbles in it, and
	 that the count is the same as the length.  */
      for (i = 0; p->data.nib[i] != E; i++)
	;

      if (i & 1)
	abort ();

      p->length = i / 2;
    }
}

unsigned int
bfd_h8_disassemble (addr, info, mode)
     bfd_vma addr;
     disassemble_info *info;
     int mode;
{
  /* Find the first entry in the table for this opcode.  */
  static CONST char *regnames[] =
    {
      "r0h", "r1h", "r2h", "r3h", "r4h", "r5h", "r6h", "r7h",
      "r0l", "r1l", "r2l", "r3l", "r4l", "r5l", "r6l", "r7l"
    };
  static CONST char *wregnames[] =
    {
      "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7",
      "e0", "e1", "e2", "e3", "e4", "e5", "e6", "e7"
    };
  static CONST char *lregnames[] =
    {
      "er0", "er1", "er2", "er3", "er4", "er5", "er6", "er7",
      "er0", "er1", "er2", "er3", "er4", "er5", "er6", "er7"
    };
  int rs = 0;
  int rd = 0;
  int rdisp = 0;
  int abs = 0;
  int bit = 0;
  int plen = 0;
  static boolean init = 0;
  struct h8_opcode *q = h8_opcodes;
  char CONST **pregnames = mode != 0 ? lregnames : wregnames;
  int status;
  int l;
  unsigned char data[20];
  void *stream = info->stream;
  fprintf_ftype fprintf = info->fprintf_func;

  if (!init)
    {
      bfd_h8_disassemble_init ();
      init = 1;
    }

  status = info->read_memory_func (addr, data, 2, info);
  if (status != 0)
    {
      info->memory_error_func (status, addr, info);
      return -1;
    }

  for (l = 2; status == 0 && l < 10; l += 2)
    status = info->read_memory_func (addr + l, data + l, 2, info);

  /* Find the exact opcode/arg combo.  */
  while (q->name)
    {
      op_type *nib;
      unsigned int len = 0;

      nib = q->data.nib;

      while (1)
	{
	  op_type looking_for = *nib;
	  int thisnib = data[len >> 1];

	  thisnib = (len & 1) ? (thisnib & 0xf) : ((thisnib >> 4) & 0xf);

	  if (looking_for < 16 && looking_for >= 0)
	    {
	      if (looking_for != thisnib)
		goto fail;
	    }
	  else
	    {
	      if ((int) looking_for & (int) B31)
		{
		  if (!(((int) thisnib & 0x8) != 0))
		    goto fail;

		  looking_for = (op_type) ((int) looking_for & ~(int) B31);
		}

	      if ((int) looking_for & (int) B30)
		{
		  if (!(((int) thisnib & 0x8) == 0))
		    goto fail;

		  looking_for = (op_type) ((int) looking_for & ~(int) B30);
		}

	      if (looking_for & DBIT)
		{
		  /* Exclude adds/subs by looking at bit 0 and 2, and
                     make sure the operand size, either w or l,
                     matches by looking at bit 1.  */
		  if ((looking_for & 7) != (thisnib & 7))
		    goto fail;

		  abs = (thisnib & 0x8) ? 2 : 1;
		}
	      else if (looking_for & (REG | IND | INC | DEC))
		{
		  if (looking_for & SRC)
		    rs = thisnib;
		  else
		    rd = thisnib;
		}
	      else if (looking_for & L_16)
		{
		  abs = (data[len >> 1]) * 256 + data[(len + 2) >> 1];
		  plen = 16;
		}
	      else if (looking_for & ABSJMP)
		{
		  abs = (data[1] << 16) | (data[2] << 8) | (data[3]);
		}
	      else if (looking_for & MEMIND)
		{
		  abs = data[1];
		}
	      else if (looking_for & L_32)
		{
		  int i = len >> 1;

		  abs = (data[i] << 24)
		    | (data[i + 1] << 16)
		    | (data[i + 2] << 8)
		    | (data[i + 3]);

		  plen = 32;
		}
	      else if (looking_for & L_24)
		{
		  int i = len >> 1;

		  abs = (data[i] << 16) | (data[i + 1] << 8) | (data[i + 2]);
		  plen = 24;
		}
	      else if (looking_for & IGNORE)
		{
		  ;
		}
	      else if (looking_for & DISPREG)
		{
		  rdisp = thisnib;
		}
	      else if (looking_for & KBIT)
		{
		  switch (thisnib)
		    {
		    case 9:
		      abs = 4;
		      break;
		    case 8:
		      abs = 2;
		      break;
		    case 0:
		      abs = 1;
		      break;
		    default:
		      goto fail;
		    }
		}
	      else if (looking_for & L_8)
		{
		  plen = 8;
		  abs = data[len >> 1];
		}
	      else if (looking_for & L_3)
		{
		  bit = thisnib & 0x7;
		}
	      else if (looking_for & L_2)
		{
		  plen = 2;
		  abs = thisnib & 0x3;
		}
	      else if (looking_for & MACREG)
		{
		  abs = (thisnib == 3);
		}
	      else if (looking_for == E)
		{
		  int i;

		  for (i = 0; i < q->length; i++)
		    fprintf (stream, "%02x ", data[i]);

		  for (; i < 6; i++)
		    fprintf (stream, "   ");

		  fprintf (stream, "%s\t", q->name);

		  /* Gross.  Disgusting.  */
		  if (strcmp (q->name, "ldm.l") == 0)
		    {
		      int count, high;

		      count = (data[1] >> 4) & 0x3;
		      high = data[3] & 0x7;

		      fprintf (stream, "@sp+,er%d-er%d", high - count, high);
		      return q->length;
		    }

		  if (strcmp (q->name, "stm.l") == 0)
		    {
		      int count, low;

		      count = (data[1] >> 4) & 0x3;
		      low = data[3] & 0x7;

		      fprintf (stream, "er%d-er%d,@-sp", low, low + count);
		      return q->length;
		    }

		  /* Fill in the args.  */
		  {
		    op_type *args = q->args.nib;
		    int hadone = 0;

		    while (*args != E)
		      {
			int x = *args;

			if (hadone)
			  fprintf (stream, ",");

			if (x & L_3)
			  {
			    fprintf (stream, "#0x%x", (unsigned) bit);
			  }
			else if (x & (IMM | KBIT | DBIT))
			  {
			    /* Bletch.  For shal #2,er0 and friends.  */
			    if (*(args + 1) & SRC_IN_DST)
			      abs = 2;

			    fprintf (stream, "#0x%x", (unsigned) abs);
			  }
			else if (x & REG)
			  {
			    int rn = (x & DST) ? rd : rs;

			    switch (x & SIZE)
			      {
			      case L_8:
				fprintf (stream, "%s", regnames[rn]);
				break;
			      case L_16:
				fprintf (stream, "%s", wregnames[rn]);
				break;
			      case L_P:
			      case L_32:
				fprintf (stream, "%s", lregnames[rn]);
				break;
			      }
			  }
			else if (x & MACREG)
			  {
			    fprintf (stream, "mac%c", abs ? 'l' : 'h');
			  }
			else if (x & INC)
			  {
			    fprintf (stream, "@%s+", pregnames[rs]);
			  }
			else if (x & DEC)
			  {
			    fprintf (stream, "@-%s", pregnames[rd]);
			  }
			else if (x & IND)
			  {
			    int rn = (x & DST) ? rd : rs;
			    fprintf (stream, "@%s", pregnames[rn]);
			  }
			else if (x & ABS8MEM)
			  {
			    fprintf (stream, "@0x%x:8", (unsigned) abs);
			  }
			else if (x & (ABS | ABSJMP))
			  {
			    fprintf (stream, "@0x%x:%d", (unsigned) abs, plen);
			  }
			else if (x & MEMIND)
			  {
			    fprintf (stream, "@@%d (%x)", abs, abs);
			  }
			else if (x & PCREL)
			  {
			    if (x & L_16)
			      {
				abs += 2;
				fprintf (stream,
					 ".%s%d (%x)",
					 (short) abs > 0 ? "+" : "",
					 (short) abs, addr + (short) abs + 2);
			      }
			    else
			      {
				fprintf (stream,
					 ".%s%d (%x)",
					 (char) abs > 0 ? "+" : "",
					 (char) abs, addr + (char) abs + 2);
			      }
			  }
			else if (x & DISP)
			  {
			    fprintf (stream, "@(0x%x:%d,%s)",
				     abs, plen, pregnames[rdisp]);
			  }
			else if (x & CCR)
			  {
			    fprintf (stream, "ccr");
			  }
			else if (x & EXR)
			  {
			    fprintf (stream, "exr");
			  }
			else
			  /* xgettext:c-format */
			  fprintf (stream, _("Hmmmm %x"), x);

			hadone = 1;
			args++;
		      }
		  }

		  return q->length;
		}
	      else
		/* xgettext:c-format */
		fprintf (stream, _("Don't understand %x \n"), looking_for);
	    }

	  len++;
	  nib++;
	}

    fail:
      q++;
    }

  /* Fell off the end.  */
  fprintf (stream, "%02x %02x        .word\tH'%x,H'%x",
	   data[0], data[1],
	   data[0], data[1]);
  return 2;
}

int
print_insn_h8300 (addr, info)
     bfd_vma addr;
     disassemble_info *info;
{
  return bfd_h8_disassemble (addr, info, 0);
}

int
print_insn_h8300h (addr, info)
     bfd_vma addr;
     disassemble_info *info;
{
  return bfd_h8_disassemble (addr, info, 1);
}

int
print_insn_h8300s (addr, info)
     bfd_vma addr;
     disassemble_info *info;
{
  return bfd_h8_disassemble (addr, info, 2);
}
Commit	Line	Data
	1	/* Disassemble h8300 instructions.
	2	Copyright (C) 1993, 1998, 2000 Free Software Foundation, Inc.
	3
	4	This program is free software; you can redistribute it and/or modify
	5	it under the terms of the GNU General Public License as published by
	6	the Free Software Foundation; either version 2 of the License, or
	7	(at your option) any later version.
	8
	9	This program is distributed in the hope that it will be useful,
	10	but WITHOUT ANY WARRANTY; without even the implied warranty of
	11	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	12	GNU General Public License for more details.
	13
	14	You should have received a copy of the GNU General Public License
	15	along with this program; if not, write to the Free Software
	16	Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
	17
	18	#define DEFINE_TABLE
	19
	20	#include "sysdep.h"
	21	#define h8_opcodes h8ops
	22	#include "opcode/h8300.h"
	23	#include "dis-asm.h"
	24	#include "opintl.h"
	25
	26	/* Run through the opcodes and sort them into order to make them easy
	27	to disassemble. */
	28	static void
	29	bfd_h8_disassemble_init ()
	30	{
	31	unsigned int i;
	32	struct h8_opcode *p;
	33
	34	for (p = h8_opcodes; p->name; p++)
	35	{
	36	int n1 = 0;
	37	int n2 = 0;
	38
	39	if ((int) p->data.nib[0] < 16)
	40	n1 = (int) p->data.nib[0];
	41	else
	42	n1 = 0;
	43
	44	if ((int) p->data.nib[1] < 16)
	45	n2 = (int) p->data.nib[1];
	46	else
	47	n2 = 0;
	48
	49	/* Just make sure there are an even number of nibbles in it, and
	50	that the count is the same as the length. */
	51	for (i = 0; p->data.nib[i] != E; i++)
	52	;
	53
	54	if (i & 1)
	55	abort ();
	56
	57	p->length = i / 2;
	58	}
	59	}
	60
	61	unsigned int
	62	bfd_h8_disassemble (addr, info, mode)
	63	bfd_vma addr;
	64	disassemble_info *info;
	65	int mode;
	66	{
	67	/* Find the first entry in the table for this opcode. */
	68	static CONST char *regnames[] =
	69	{
	70	"r0h", "r1h", "r2h", "r3h", "r4h", "r5h", "r6h", "r7h",
	71	"r0l", "r1l", "r2l", "r3l", "r4l", "r5l", "r6l", "r7l"
	72	};
	73	static CONST char *wregnames[] =
	74	{
	75	"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7",
	76	"e0", "e1", "e2", "e3", "e4", "e5", "e6", "e7"
	77	};
	78	static CONST char *lregnames[] =
	79	{
	80	"er0", "er1", "er2", "er3", "er4", "er5", "er6", "er7",
	81	"er0", "er1", "er2", "er3", "er4", "er5", "er6", "er7"
	82	};
	83	int rs = 0;
	84	int rd = 0;
	85	int rdisp = 0;
	86	int abs = 0;
	87	int bit = 0;
	88	int plen = 0;
	89	static boolean init = 0;
	90	struct h8_opcode *q = h8_opcodes;
	91	char CONST **pregnames = mode != 0 ? lregnames : wregnames;
	92	int status;
	93	int l;
	94	unsigned char data[20];
	95	void *stream = info->stream;
	96	fprintf_ftype fprintf = info->fprintf_func;
	97
	98	if (!init)
	99	{
	100	bfd_h8_disassemble_init ();
	101	init = 1;
	102	}
	103
	104	status = info->read_memory_func (addr, data, 2, info);
	105	if (status != 0)
	106	{
	107	info->memory_error_func (status, addr, info);
	108	return -1;
	109	}
	110
	111	for (l = 2; status == 0 && l < 10; l += 2)
	112	status = info->read_memory_func (addr + l, data + l, 2, info);
	113
	114	/* Find the exact opcode/arg combo. */
	115	while (q->name)
	116	{
	117	op_type *nib;
	118	unsigned int len = 0;
	119
	120	nib = q->data.nib;
	121
	122	while (1)
	123	{
	124	op_type looking_for = *nib;
	125	int thisnib = data[len >> 1];
	126
	127	thisnib = (len & 1) ? (thisnib & 0xf) : ((thisnib >> 4) & 0xf);
	128
	129	if (looking_for < 16 && looking_for >= 0)
	130	{
	131	if (looking_for != thisnib)
	132	goto fail;
	133	}
	134	else
	135	{
	136	if ((int) looking_for & (int) B31)
	137	{
	138	if (!(((int) thisnib & 0x8) != 0))
	139	goto fail;
	140
	141	looking_for = (op_type) ((int) looking_for & ~(int) B31);
	142	}
	143
	144	if ((int) looking_for & (int) B30)
	145	{
	146	if (!(((int) thisnib & 0x8) == 0))
	147	goto fail;
	148
	149	looking_for = (op_type) ((int) looking_for & ~(int) B30);
	150	}
	151
	152	if (looking_for & DBIT)
	153	{
	154	/* Exclude adds/subs by looking at bit 0 and 2, and
	155	make sure the operand size, either w or l,
	156	matches by looking at bit 1. */
	157	if ((looking_for & 7) != (thisnib & 7))
	158	goto fail;
	159
	160	abs = (thisnib & 0x8) ? 2 : 1;
	161	}
	162	else if (looking_for & (REG \| IND \| INC \| DEC))
	163	{
	164	if (looking_for & SRC)
	165	rs = thisnib;
	166	else
	167	rd = thisnib;
	168	}
	169	else if (looking_for & L_16)
	170	{
	171	abs = (data[len >> 1]) * 256 + data[(len + 2) >> 1];
	172	plen = 16;
	173	}
	174	else if (looking_for & ABSJMP)
	175	{
	176	abs = (data[1] << 16) \| (data[2] << 8) \| (data[3]);
	177	}
	178	else if (looking_for & MEMIND)
	179	{
	180	abs = data[1];
	181	}
	182	else if (looking_for & L_32)
	183	{
	184	int i = len >> 1;
	185
	186	abs = (data[i] << 24)
	187	\| (data[i + 1] << 16)
	188	\| (data[i + 2] << 8)
	189	\| (data[i + 3]);
	190
	191	plen = 32;
	192	}
	193	else if (looking_for & L_24)
	194	{
	195	int i = len >> 1;
	196
	197	abs = (data[i] << 16) \| (data[i + 1] << 8) \| (data[i + 2]);
	198	plen = 24;
	199	}
	200	else if (looking_for & IGNORE)
	201	{
	202	;
	203	}
	204	else if (looking_for & DISPREG)
	205	{
	206	rdisp = thisnib;
	207	}
	208	else if (looking_for & KBIT)
	209	{
	210	switch (thisnib)
	211	{
	212	case 9:
	213	abs = 4;
	214	break;
	215	case 8:
	216	abs = 2;
	217	break;
	218	case 0:
	219	abs = 1;
	220	break;
	221	default:
	222	goto fail;
	223	}
	224	}
	225	else if (looking_for & L_8)
	226	{
	227	plen = 8;
	228	abs = data[len >> 1];
	229	}
	230	else if (looking_for & L_3)
	231	{
	232	bit = thisnib & 0x7;
	233	}
	234	else if (looking_for & L_2)
	235	{
	236	plen = 2;
	237	abs = thisnib & 0x3;
	238	}
	239	else if (looking_for & MACREG)
	240	{
	241	abs = (thisnib == 3);
	242	}
	243	else if (looking_for == E)
	244	{
	245	int i;
	246
	247	for (i = 0; i < q->length; i++)
	248	fprintf (stream, "%02x ", data[i]);
	249
	250	for (; i < 6; i++)
	251	fprintf (stream, " ");
	252
	253	fprintf (stream, "%s\t", q->name);
	254
	255	/* Gross. Disgusting. */
	256	if (strcmp (q->name, "ldm.l") == 0)
	257	{
	258	int count, high;
	259
	260	count = (data[1] >> 4) & 0x3;
	261	high = data[3] & 0x7;
	262
	263	fprintf (stream, "@sp+,er%d-er%d", high - count, high);
	264	return q->length;
	265	}
	266
	267	if (strcmp (q->name, "stm.l") == 0)
	268	{
	269	int count, low;
	270
	271	count = (data[1] >> 4) & 0x3;
	272	low = data[3] & 0x7;
	273
	274	fprintf (stream, "er%d-er%d,@-sp", low, low + count);
	275	return q->length;
	276	}
	277
	278	/* Fill in the args. */
	279	{
	280	op_type *args = q->args.nib;
	281	int hadone = 0;
	282
	283	while (*args != E)
	284	{
	285	int x = *args;
	286
	287	if (hadone)
	288	fprintf (stream, ",");
	289
	290	if (x & L_3)
	291	{
	292	fprintf (stream, "#0x%x", (unsigned) bit);
	293	}
	294	else if (x & (IMM \| KBIT \| DBIT))
	295	{
	296	/* Bletch. For shal #2,er0 and friends. */
	297	if (*(args + 1) & SRC_IN_DST)
	298	abs = 2;
	299
	300	fprintf (stream, "#0x%x", (unsigned) abs);
	301	}
	302	else if (x & REG)
	303	{
	304	int rn = (x & DST) ? rd : rs;
	305
	306	switch (x & SIZE)
	307	{
	308	case L_8:
	309	fprintf (stream, "%s", regnames[rn]);
	310	break;
	311	case L_16:
	312	fprintf (stream, "%s", wregnames[rn]);
	313	break;
	314	case L_P:
	315	case L_32:
	316	fprintf (stream, "%s", lregnames[rn]);
	317	break;
	318	}
	319	}
	320	else if (x & MACREG)
	321	{
	322	fprintf (stream, "mac%c", abs ? 'l' : 'h');
	323	}
	324	else if (x & INC)
	325	{
	326	fprintf (stream, "@%s+", pregnames[rs]);
	327	}
	328	else if (x & DEC)
	329	{
	330	fprintf (stream, "@-%s", pregnames[rd]);
	331	}
	332	else if (x & IND)
	333	{
	334	int rn = (x & DST) ? rd : rs;
	335	fprintf (stream, "@%s", pregnames[rn]);
	336	}
	337	else if (x & ABS8MEM)
	338	{
	339	fprintf (stream, "@0x%x:8", (unsigned) abs);
	340	}
	341	else if (x & (ABS \| ABSJMP))
	342	{
	343	fprintf (stream, "@0x%x:%d", (unsigned) abs, plen);
	344	}
	345	else if (x & MEMIND)
	346	{
	347	fprintf (stream, "@@%d (%x)", abs, abs);
	348	}
	349	else if (x & PCREL)
	350	{
	351	if (x & L_16)
	352	{
	353	abs += 2;
	354	fprintf (stream,
	355	".%s%d (%x)",
	356	(short) abs > 0 ? "+" : "",
	357	(short) abs, addr + (short) abs + 2);
	358	}
	359	else
	360	{
	361	fprintf (stream,
	362	".%s%d (%x)",
	363	(char) abs > 0 ? "+" : "",
	364	(char) abs, addr + (char) abs + 2);
	365	}
	366	}
	367	else if (x & DISP)
	368	{
	369	fprintf (stream, "@(0x%x:%d,%s)",
	370	abs, plen, pregnames[rdisp]);
	371	}
	372	else if (x & CCR)
	373	{
	374	fprintf (stream, "ccr");
	375	}
	376	else if (x & EXR)
	377	{
	378	fprintf (stream, "exr");
	379	}
	380	else
	381	/* xgettext:c-format */
	382	fprintf (stream, _("Hmmmm %x"), x);
	383
	384	hadone = 1;
	385	args++;
	386	}
	387	}
	388
	389	return q->length;
	390	}
	391	else
	392	/* xgettext:c-format */
	393	fprintf (stream, _("Don't understand %x \n"), looking_for);
	394	}
	395
	396	len++;
	397	nib++;
	398	}
	399
	400	fail:
	401	q++;
	402	}
	403
	404	/* Fell off the end. */
	405	fprintf (stream, "%02x %02x .word\tH'%x,H'%x",
	406	data[0], data[1],
	407	data[0], data[1]);
	408	return 2;
	409	}
	410
	411	int
	412	print_insn_h8300 (addr, info)
	413	bfd_vma addr;
	414	disassemble_info *info;
	415	{
	416	return bfd_h8_disassemble (addr, info, 0);
	417	}
	418
	419	int
	420	print_insn_h8300h (addr, info)
	421	bfd_vma addr;
	422	disassemble_info *info;
	423	{
	424	return bfd_h8_disassemble (addr, info, 1);
	425	}
	426
	427	int
	428	print_insn_h8300s (addr, info)
	429	bfd_vma addr;
	430	disassemble_info *info;
	431	{
	432	return bfd_h8_disassemble (addr, info, 2);
	433	}