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

/* Disassemble h8300 instructions.
   Copyright (C) 1993 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

#define h8_opcodes h8ops
#include "opcode/h8300.h"
#include "dis-asm.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 s the length */
      for (i = 0; p->data.nib[i] != E; i++)
	/*EMPTY*/ ;
      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)
		{
		  if ((looking_for & 5) != (thisnib &5)) 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;
		    }
		}
	      else if (looking_for & L_8)
		{
		  plen = 8;		  
		  abs = data[len >> 1];
		}
	      else if (looking_for & L_3)
		{
		  plen = 3;
		  bit = thisnib;
		}
	      else if (looking_for & L_2)
		{
		  plen = 2;
		  abs = thisnib;
		}
	      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);
		  /* 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))
			  {
			    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 & 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
			  fprintf (stream, "Hmmmm %x", x);
			hadone = 1;
			args++;
		      }
		  }
		  return q->length;
		}

      
	      else
		{
		  fprintf (stream, "Dont understand %x \n", looking_for);
		}
	    }
	  
	  len++;
	  nib++;
	}
      
    fail:
      q++;
    }

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