OpenE2K
/
binutils-gdb
12
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
binutils-gdb/gdb/rs6000-pinsn.c

383 lines
7.7 KiB
C
Raw Blame History

/* Print IBM RS/6000 instructions for GNU software.
Copyright 1991 Free Software Foundation, Inc.
Contributed by IBM Corporation.
This file is part of GDB and the GNU binutils.
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., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <stdio.h>
#include "defs.h"
#include "rs6k-opcode.h"
/* Print the rs6k instruction at address MEMADDR in debugged memory,
on STREAM. Returns length of the instruction, in bytes. */
int
print_insn (memaddr, stream)
CORE_ADDR memaddr;
FILE *stream;
{
int pop, eop; /* primary and extended opcodes */
int min, max;
int best = -1; /* found best opcode index */
int oldbest = -1;
unsigned int the_insn;
read_memory (memaddr, &the_insn, sizeof (the_insn));
pop = (unsigned)(the_insn >> 26);
eop = ((the_insn) >> 1) & 0x3ff;
min = 0, max = NOPCODES-1;
while (min < max) {
best = (min + max) / 2;
/* see if we are running in loops */
if (best == oldbest)
goto not_found;
oldbest = best;
if (pop < rs6k_ops [best].p_opcode)
max = best;
else if (pop > rs6k_ops [best].p_opcode)
min = best;
else {
/* opcode matched, check extended opcode. */
if (rs6k_ops [best].e_opcode == -1) {
/* there is no valid extended opcode, what we've got is
just fine. */
goto insn_found;
}
else if (eop < rs6k_ops [best].e_opcode) {
while (pop == rs6k_ops [best].p_opcode) {
if (eop == rs6k_ops [best].e_opcode) /* found it! */
goto insn_found;
--best;
}
goto not_found;
}
else if (eop > rs6k_ops [best].e_opcode) {
while (pop == rs6k_ops [best].p_opcode) {
if (eop == rs6k_ops [best].e_opcode) /* found it! */
goto insn_found;
++best;
}
goto not_found;
}
else /* eop == rs6k_ops [best].e_opcode */
goto insn_found;
}
}
best = min;
if (pop == rs6k_ops [best].p_opcode &&
(rs6k_ops [best].e_opcode == -1 || rs6k_ops [best].e_opcode == eop))
goto insn_found;
else
goto not_found;
insn_found:
print_operator (stream, memaddr, the_insn, best);
return 4;
not_found:
fprintf (stream, "0x%08x", the_insn);
return 4;
}
/* condition code names */
static char *cond_code [] = {
"lt", "gt", "eq", "so", "ge", "le", "ne", "ns", "nl", "ng", "z", "nz" };
print_operator (stream, memaddr, insn_word, insn_no)
FILE *stream;
long memaddr;
long insn_word;
int insn_no;
{
char buf [BUFSIZ];
char *qq = buf;
char *pp = rs6k_ops[insn_no].opr_ext;
int tmp;
int nocomma = 0; /* true if no comma needed */
*qq = '\0';
if (pp) {
while (*pp) {
switch ( *pp ) {
case '.':
if (insn_word & 0x1)
*qq++ = '.';
break;
case 'l':
if (insn_word & 0x1)
*qq++ = 'l';
break;
case 't':
if ((insn_word & 0x03e00000) == 0x01800000)
*qq++ = 't';
break;
case 'f':
if ((insn_word & 0x03e00000) == 0x00800000)
*qq++ = 'f';
break;
case 'a':
if (insn_word & 0x2)
*qq++ = 'a';
break;
case 'o':
if (insn_word & 0x4000)
*qq++ = 'o';
break;
case '1': /* exception #1 for bb/bc ambiguity */
tmp = (insn_word >> 21) & 0x1f; /* extract BO */
if (tmp != 0xc && tmp != 0x4) {
/* you can't use `bb' now. switch to `bc' */
*(qq-1) = 'c';
++insn_no;
pp = rs6k_ops[insn_no].opr_ext;
continue;
}
break;
default:
abort ();
}
++pp;
}
}
/* tab between operator and operand */
*qq++ = '\t';
/* parse the operand now. */
pp = rs6k_ops[insn_no].oprnd_format;
while (1) {
switch (*pp) {
case TO :
sprintf (qq, "%d", (insn_word >> 21) & 0x1f);
break;
case RT :
case RS :
sprintf (qq, "r%d", (insn_word >> 21) & 0x1f);
break;
case LI :
tmp = (insn_word >> 16) & 0x1f;
if (tmp > 11) {
fprintf (stderr, "Internal error: unknown cond code: 0x%x\n", insn_word);
tmp = 0;
}
sprintf (qq, "%s", cond_code [tmp]);
break;
case A2 :
case TA14 :
tmp = (insn_word & 0xfffc);
if (tmp & 0x8000) /* fix sign extension */
tmp -= 0x10000;
if ((insn_word & 0x2) == 0) /* if AA not set */
tmp += memaddr;
sprintf (qq, "0x%x", tmp);
break;
case TA24 :
tmp = insn_word & 0x03fffffc;
if (tmp & 0x2000000)
tmp -= 0x4000000;
if ((insn_word & 0x2) == 0) /* if no AA bit set */
tmp += memaddr;
sprintf (qq, "0x%x", tmp);
break;
case LEV : /* for svc only */
if (insn_word & 0x2) { /* SA is set */
nocomma = 1;
*qq = '\0';
}
else
sprintf (qq, "%d", (insn_word >> 5) & 0x7f);
break;
case FL1 : /* for svc only */
if (insn_word & 0x2) { /* SA is set */
nocomma = 1;
*qq = '\0';
}
else
sprintf (qq, "%d", (insn_word >> 12) & 0xf);
break;
case FL2 : /* for svc only */
nocomma = 0;
if (insn_word & 0x2) /* SA is set */
sprintf (qq, "%d", (insn_word >> 2) & 0x3fff);
else
sprintf (qq, "%d", (insn_word >> 2) & 0x7);
break;
case RA :
if (nocomma) {
sprintf (qq, "r%d)", (insn_word >> 16) & 0x1f);
nocomma = 0;
}
else
sprintf (qq, "r%d", (insn_word >> 16) & 0x1f);
break;
case RB :
sprintf (qq, "r%d", (insn_word >> 11) & 0x1f);
break;
case SI :
tmp = insn_word & 0xffff;
if (tmp & 0x8000)
tmp -= 0x10000;
sprintf (qq, "%d", tmp);
break;
case UI :
sprintf (qq, "%d", insn_word & 0xffff);
break;
case BF :
sprintf (qq, "%d", (insn_word >> 23) & 0x7);
break;
case BFA :
sprintf (qq, "%d", (insn_word >> 18) & 0x7);
break;
case BT :
sprintf (qq, "%d", (insn_word >> 21) & 0x1f);
break;
case BA :
sprintf (qq, "%d", (insn_word >> 16) & 0x1f);
break;
case BB :
sprintf (qq, "%d", (insn_word >> 11) & 0x1f);
break;
case BO :
sprintf (qq, "%d", (insn_word >> 21) & 0x1f);
break;
case BI :
sprintf (qq, "%d", (insn_word >> 16) & 0x1f);
break;
case SH :
sprintf (qq, "%d", (insn_word >> 11) & 0x1f);
break;
case MB :
sprintf (qq, "0x%x", (insn_word >> 6) & 0x1f);
break;
case ME :
sprintf (qq, "0x%x", (insn_word >> 1) & 0x1f);
break;
case SPR :
sprintf (qq, "%d", (insn_word >> 16) & 0x1f);
break;
case DIS :
nocomma = 1;
tmp = insn_word & 0xffff;
if (tmp & 0x8000)
tmp -= 0x10000;
sprintf (qq, "%d(", tmp);
break;
case FXM :
sprintf (qq, "0x%x", (insn_word >> 12) & 0xff);
break;
case FRT :
case FRS :
sprintf (qq, "f%d", (insn_word >> 21) & 0x1f);
break;
case FRA :
sprintf (qq, "f%d", (insn_word >> 16) & 0x1f);
break;
case FRB :
sprintf (qq, "f%d", (insn_word >> 11) & 0x1f);
break;
case FRC :
sprintf (qq, "f%d", (insn_word >> 6) & 0x1f);
break;
case FLM :
sprintf (qq, "0x%x", (insn_word >> 17) & 0xff);
break;
case NB :
sprintf (qq, "%d", (insn_word >> 11) & 0x1f);
break;
case I :
sprintf (qq, "%d", (insn_word >> 12) & 0xf);
break;
default :
sprintf (qq, "Unknown operand format identifier %d????", *pp);
abort ();
}
while (*qq) ++qq; /* Walk to end of string printed so far. */
++pp;
if (*pp == '\0')
break;
else if (!nocomma)
*qq++ = ',';
}
*qq = '\0';
fprintf (stream, "0x%08x\t%s%s",
insn_word, rs6k_ops[insn_no].operator, buf);
}
Reference in New Issue View Git Blame Copy Permalink