| 1 | /* Print Motorola 68k instructions for GDB, the GNU debugger. |
| 2 | Copyright 1986, 1987, 1989, 1991, 1992 Free Software Foundation, Inc. |
| 3 | |
| 4 | This file is part of GDB. |
| 5 | |
| 6 | This program is free software; you can redistribute it and/or modify |
| 7 | it under the terms of the GNU General Public License as published by |
| 8 | the Free Software Foundation; either version 2 of the License, or |
| 9 | (at your option) any later version. |
| 10 | |
| 11 | This program is distributed in the hope that it will be useful, |
| 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 | GNU General Public License for more details. |
| 15 | |
| 16 | You should have received a copy of the GNU General Public License |
| 17 | along with this program; if not, write to the Free Software |
| 18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ |
| 19 | |
| 20 | #include "defs.h" |
| 21 | #include "symtab.h" |
| 22 | #include "opcode/m68k.h" |
| 23 | #include "gdbcore.h" |
| 24 | #include "ieee-float.h" |
| 25 | |
| 26 | /* Local function prototypes */ |
| 27 | |
| 28 | static int |
| 29 | fetch_arg PARAMS ((unsigned char *, int, int)); |
| 30 | |
| 31 | static void |
| 32 | print_base PARAMS ((int, int, FILE *)); |
| 33 | |
| 34 | static unsigned char * |
| 35 | print_indexed PARAMS ((int, unsigned char *, CORE_ADDR, FILE *)); |
| 36 | |
| 37 | static unsigned char * |
| 38 | print_insn_arg PARAMS ((char *, unsigned char *, unsigned char *, CORE_ADDR, |
| 39 | FILE *)); |
| 40 | |
| 41 | /* 68k instructions are never longer than this many bytes. */ |
| 42 | #define MAXLEN 22 |
| 43 | |
| 44 | /* Number of elements in the opcode table. */ |
| 45 | #define NOPCODES (sizeof m68k_opcodes / sizeof m68k_opcodes[0]) |
| 46 | |
| 47 | const char * const fpcr_names[] = { |
| 48 | "", "fpiar", "fpsr", "fpiar/fpsr", "fpcr", |
| 49 | "fpiar/fpcr", "fpsr/fpcr", "fpiar/fpsr/fpcr"}; |
| 50 | |
| 51 | /* Define accessors for 68K's 1, 2, and 4-byte signed quantities. |
| 52 | The _SHIFT values move the quantity to the high order end of an |
| 53 | `int' value, so it will sign-extend. Probably a few more casts |
| 54 | are needed to make it compile without warnings on finicky systems. */ |
| 55 | #define BITS_PER_BYTE 8 |
| 56 | #define BYTE_SHIFT (BITS_PER_BYTE * ((sizeof (int)) - 1)) |
| 57 | #define WORD_SHIFT (BITS_PER_BYTE * ((sizeof (int)) - 2)) |
| 58 | #define LONG_SHIFT (BITS_PER_BYTE * ((sizeof (int)) - 4)) |
| 59 | |
| 60 | #define NEXTBYTE(p) (p += 2, ((int)(p[-1]) << BYTE_SHIFT) >> BYTE_SHIFT) |
| 61 | |
| 62 | #define NEXTWORD(p) \ |
| 63 | (p += 2, (((int)((p[-2] << 8) + p[-1])) << WORD_SHIFT) >> WORD_SHIFT) |
| 64 | |
| 65 | #define NEXTLONG(p) \ |
| 66 | (p += 4, (((int)((((((p[-4] << 8) + p[-3]) << 8) + p[-2]) << 8) + p[-1])) \ |
| 67 | << LONG_SHIFT) >> LONG_SHIFT) |
| 68 | |
| 69 | /* Ecch -- assumes host == target float formats. FIXME. */ |
| 70 | #define NEXTSINGLE(p) \ |
| 71 | (p += 4, *((float *)(p - 4))) |
| 72 | |
| 73 | #define NEXTDOUBLE(p) \ |
| 74 | (p += 8, *((double *)(p - 8))) |
| 75 | \f |
| 76 | /* Print the m68k instruction at address MEMADDR in debugged memory, |
| 77 | on STREAM. Returns length of the instruction, in bytes. */ |
| 78 | |
| 79 | int |
| 80 | print_insn (memaddr, stream) |
| 81 | CORE_ADDR memaddr; |
| 82 | FILE *stream; |
| 83 | { |
| 84 | unsigned char buffer[MAXLEN]; |
| 85 | register int i; |
| 86 | register unsigned char *p; |
| 87 | register char *d; |
| 88 | register int bestmask; |
| 89 | int best; |
| 90 | |
| 91 | read_memory (memaddr, (char *) buffer, MAXLEN); |
| 92 | |
| 93 | bestmask = 0; |
| 94 | best = -1; |
| 95 | for (i = 0; i < NOPCODES; i++) |
| 96 | { |
| 97 | register unsigned int opcode = m68k_opcodes[i].opcode; |
| 98 | register unsigned int match = m68k_opcodes[i].match; |
| 99 | if (((0xff & buffer[0] & (match >> 24)) == (0xff & (opcode >> 24))) |
| 100 | && ((0xff & buffer[1] & (match >> 16)) == (0xff & (opcode >> 16))) |
| 101 | && ((0xff & buffer[2] & (match >> 8)) == (0xff & (opcode >> 8))) |
| 102 | && ((0xff & buffer[3] & match) == (0xff & opcode))) |
| 103 | { |
| 104 | /* Don't use for printout the variants of divul and divsl |
| 105 | that have the same register number in two places. |
| 106 | The more general variants will match instead. */ |
| 107 | for (d = m68k_opcodes[i].args; *d; d += 2) |
| 108 | if (d[1] == 'D') |
| 109 | break; |
| 110 | |
| 111 | /* Don't use for printout the variants of most floating |
| 112 | point coprocessor instructions which use the same |
| 113 | register number in two places, as above. */ |
| 114 | if (*d == 0) |
| 115 | for (d = m68k_opcodes[i].args; *d; d += 2) |
| 116 | if (d[1] == 't') |
| 117 | break; |
| 118 | |
| 119 | if (*d == 0 && match > bestmask) |
| 120 | { |
| 121 | best = i; |
| 122 | bestmask = match; |
| 123 | } |
| 124 | } |
| 125 | } |
| 126 | |
| 127 | /* Handle undefined instructions. */ |
| 128 | if (best < 0) |
| 129 | { |
| 130 | fprintf_filtered (stream, "0%o", (buffer[0] << 8) + buffer[1]); |
| 131 | return 2; |
| 132 | } |
| 133 | |
| 134 | fprintf_filtered (stream, "%s", m68k_opcodes[best].name); |
| 135 | |
| 136 | /* Point at first word of argument data, |
| 137 | and at descriptor for first argument. */ |
| 138 | p = buffer + 2; |
| 139 | |
| 140 | /* Why do this this way? -MelloN */ |
| 141 | for (d = m68k_opcodes[best].args; *d; d += 2) |
| 142 | { |
| 143 | if (d[0] == '#') |
| 144 | { |
| 145 | if (d[1] == 'l' && p - buffer < 6) |
| 146 | p = buffer + 6; |
| 147 | else if (p - buffer < 4 && d[1] != 'C' && d[1] != '8' ) |
| 148 | p = buffer + 4; |
| 149 | } |
| 150 | if (d[1] >= '1' && d[1] <= '3' && p - buffer < 4) |
| 151 | p = buffer + 4; |
| 152 | if (d[1] >= '4' && d[1] <= '6' && p - buffer < 6) |
| 153 | p = buffer + 6; |
| 154 | if ((d[0] == 'L' || d[0] == 'l') && d[1] == 'w' && p - buffer < 4) |
| 155 | p = buffer + 4; |
| 156 | } |
| 157 | |
| 158 | d = m68k_opcodes[best].args; |
| 159 | |
| 160 | if (*d) |
| 161 | fputs_filtered (" ", stream); |
| 162 | |
| 163 | while (*d) |
| 164 | { |
| 165 | p = print_insn_arg (d, buffer, p, memaddr + p - buffer, stream); |
| 166 | d += 2; |
| 167 | if (*d && *(d - 2) != 'I' && *d != 'k') |
| 168 | fputs_filtered (",", stream); |
| 169 | } |
| 170 | return p - buffer; |
| 171 | } |
| 172 | |
| 173 | static unsigned char * |
| 174 | print_insn_arg (d, buffer, p, addr, stream) |
| 175 | char *d; |
| 176 | unsigned char *buffer; |
| 177 | register unsigned char *p; |
| 178 | CORE_ADDR addr; /* PC for this arg to be relative to */ |
| 179 | FILE *stream; |
| 180 | { |
| 181 | register int val; |
| 182 | register int place = d[1]; |
| 183 | int regno; |
| 184 | register const char *regname; |
| 185 | register unsigned char *p1; |
| 186 | double flval; |
| 187 | int flt_p; |
| 188 | |
| 189 | switch (*d) |
| 190 | { |
| 191 | case 'C': |
| 192 | fprintf_filtered (stream, "ccr"); |
| 193 | break; |
| 194 | |
| 195 | case 'S': |
| 196 | fprintf_filtered (stream, "sr"); |
| 197 | break; |
| 198 | |
| 199 | case 'U': |
| 200 | fprintf_filtered (stream, "usp"); |
| 201 | break; |
| 202 | |
| 203 | case 'J': |
| 204 | { |
| 205 | static struct { char *name; int value; } names[] |
| 206 | = {{"sfc", 0x000}, {"dfc", 0x001}, {"cacr", 0x002}, |
| 207 | {"usp", 0x800}, {"vbr", 0x801}, {"caar", 0x802}, |
| 208 | {"msp", 0x803}, {"isp", 0x804}}; |
| 209 | |
| 210 | val = fetch_arg (buffer, place, 12); |
| 211 | for (regno = sizeof names / sizeof names[0] - 1; regno >= 0; regno--) |
| 212 | if (names[regno].value == val) |
| 213 | { |
| 214 | fprintf_filtered (stream, names[regno].name); |
| 215 | break; |
| 216 | } |
| 217 | if (regno < 0) |
| 218 | fprintf_filtered (stream, "%d", val); |
| 219 | } |
| 220 | break; |
| 221 | |
| 222 | case 'Q': |
| 223 | val = fetch_arg (buffer, place, 3); |
| 224 | /* 0 means 8, except for the bkpt instruction... */ |
| 225 | if (val == 0 && d[1] != 's') |
| 226 | val = 8; |
| 227 | fprintf_filtered (stream, "#%d", val); |
| 228 | break; |
| 229 | |
| 230 | case 'M': |
| 231 | val = fetch_arg (buffer, place, 8); |
| 232 | if (val & 0x80) |
| 233 | val = val - 0x100; |
| 234 | fprintf_filtered (stream, "#%d", val); |
| 235 | break; |
| 236 | |
| 237 | case 'T': |
| 238 | val = fetch_arg (buffer, place, 4); |
| 239 | fprintf_filtered (stream, "#%d", val); |
| 240 | break; |
| 241 | |
| 242 | case 'D': |
| 243 | fprintf_filtered (stream, "%s", reg_names[fetch_arg (buffer, place, 3)]); |
| 244 | break; |
| 245 | |
| 246 | case 'A': |
| 247 | fprintf_filtered (stream, "%s", |
| 248 | reg_names[fetch_arg (buffer, place, 3) + 010]); |
| 249 | break; |
| 250 | |
| 251 | case 'R': |
| 252 | fprintf_filtered (stream, "%s", reg_names[fetch_arg (buffer, place, 4)]); |
| 253 | break; |
| 254 | |
| 255 | case 'r': |
| 256 | fprintf_filtered (stream, "%s@", reg_names[fetch_arg (buffer, place, 4)]); |
| 257 | break; |
| 258 | |
| 259 | case 'F': |
| 260 | fprintf_filtered (stream, "fp%d", fetch_arg (buffer, place, 3)); |
| 261 | break; |
| 262 | |
| 263 | case 'O': |
| 264 | val = fetch_arg (buffer, place, 6); |
| 265 | if (val & 0x20) |
| 266 | fprintf_filtered (stream, "%s", reg_names [val & 7]); |
| 267 | else |
| 268 | fprintf_filtered (stream, "%d", val); |
| 269 | break; |
| 270 | |
| 271 | case '+': |
| 272 | fprintf_filtered (stream, "%s@+", |
| 273 | reg_names[fetch_arg (buffer, place, 3) + 8]); |
| 274 | break; |
| 275 | |
| 276 | case '-': |
| 277 | fprintf_filtered (stream, "%s@-", |
| 278 | reg_names[fetch_arg (buffer, place, 3) + 8]); |
| 279 | break; |
| 280 | |
| 281 | case 'k': |
| 282 | if (place == 'k') |
| 283 | fprintf_filtered (stream, "{%s}", reg_names[fetch_arg (buffer, place, 3)]); |
| 284 | else if (place == 'C') |
| 285 | { |
| 286 | val = fetch_arg (buffer, place, 7); |
| 287 | if ( val > 63 ) /* This is a signed constant. */ |
| 288 | val -= 128; |
| 289 | fprintf_filtered (stream, "{#%d}", val); |
| 290 | } |
| 291 | else |
| 292 | error ("Invalid arg format in opcode table: \"%c%c\".", |
| 293 | *d, place); |
| 294 | break; |
| 295 | |
| 296 | case '#': |
| 297 | case '^': |
| 298 | p1 = buffer + (*d == '#' ? 2 : 4); |
| 299 | if (place == 's') |
| 300 | val = fetch_arg (buffer, place, 4); |
| 301 | else if (place == 'C') |
| 302 | val = fetch_arg (buffer, place, 7); |
| 303 | else if (place == '8') |
| 304 | val = fetch_arg (buffer, place, 3); |
| 305 | else if (place == '3') |
| 306 | val = fetch_arg (buffer, place, 8); |
| 307 | else if (place == 'b') |
| 308 | val = NEXTBYTE (p1); |
| 309 | else if (place == 'w') |
| 310 | val = NEXTWORD (p1); |
| 311 | else if (place == 'l') |
| 312 | val = NEXTLONG (p1); |
| 313 | else |
| 314 | error ("Invalid arg format in opcode table: \"%c%c\".", |
| 315 | *d, place); |
| 316 | fprintf_filtered (stream, "#%d", val); |
| 317 | break; |
| 318 | |
| 319 | case 'B': |
| 320 | if (place == 'b') |
| 321 | val = NEXTBYTE (p); |
| 322 | else if (place == 'B') |
| 323 | val = NEXTBYTE (buffer); /* from the opcode word */ |
| 324 | else if (place == 'w' || place == 'W') |
| 325 | val = NEXTWORD (p); |
| 326 | else if (place == 'l' || place == 'L') |
| 327 | val = NEXTLONG (p); |
| 328 | else if (place == 'g') |
| 329 | { |
| 330 | val = NEXTBYTE (buffer); |
| 331 | if (val == 0) |
| 332 | val = NEXTWORD (p); |
| 333 | else if (val == -1) |
| 334 | val = NEXTLONG (p); |
| 335 | } |
| 336 | else if (place == 'c') |
| 337 | { |
| 338 | if (buffer[1] & 0x40) /* If bit six is one, long offset */ |
| 339 | val = NEXTLONG (p); |
| 340 | else |
| 341 | val = NEXTWORD (p); |
| 342 | } |
| 343 | else |
| 344 | error ("Invalid arg format in opcode table: \"%c%c\".", |
| 345 | *d, place); |
| 346 | |
| 347 | print_address (addr + val, stream); |
| 348 | break; |
| 349 | |
| 350 | case 'd': |
| 351 | val = NEXTWORD (p); |
| 352 | fprintf_filtered (stream, "%s@(%d)", |
| 353 | reg_names[fetch_arg (buffer, place, 3)], val); |
| 354 | break; |
| 355 | |
| 356 | case 's': |
| 357 | fprintf_filtered (stream, "%s", |
| 358 | fpcr_names[fetch_arg (buffer, place, 3)]); |
| 359 | break; |
| 360 | |
| 361 | case 'I': |
| 362 | val = fetch_arg (buffer, 'd', 3); /* Get coprocessor ID... */ |
| 363 | if (val != 1) /* Unusual coprocessor ID? */ |
| 364 | fprintf_filtered (stream, "(cpid=%d) ", val); |
| 365 | if (place == 'i') |
| 366 | p += 2; /* Skip coprocessor extended operands */ |
| 367 | break; |
| 368 | |
| 369 | case '*': |
| 370 | case '~': |
| 371 | case '%': |
| 372 | case ';': |
| 373 | case '@': |
| 374 | case '!': |
| 375 | case '$': |
| 376 | case '?': |
| 377 | case '/': |
| 378 | case '&': |
| 379 | |
| 380 | if (place == 'd') |
| 381 | { |
| 382 | val = fetch_arg (buffer, 'x', 6); |
| 383 | val = ((val & 7) << 3) + ((val >> 3) & 7); |
| 384 | } |
| 385 | else |
| 386 | val = fetch_arg (buffer, 's', 6); |
| 387 | |
| 388 | /* Get register number assuming address register. */ |
| 389 | regno = (val & 7) + 8; |
| 390 | regname = reg_names[regno]; |
| 391 | switch (val >> 3) |
| 392 | { |
| 393 | case 0: |
| 394 | fprintf_filtered (stream, "%s", reg_names[val]); |
| 395 | break; |
| 396 | |
| 397 | case 1: |
| 398 | fprintf_filtered (stream, "%s", regname); |
| 399 | break; |
| 400 | |
| 401 | case 2: |
| 402 | fprintf_filtered (stream, "%s@", regname); |
| 403 | break; |
| 404 | |
| 405 | case 3: |
| 406 | fprintf_filtered (stream, "%s@+", regname); |
| 407 | break; |
| 408 | |
| 409 | case 4: |
| 410 | fprintf_filtered (stream, "%s@-", regname); |
| 411 | break; |
| 412 | |
| 413 | case 5: |
| 414 | val = NEXTWORD (p); |
| 415 | fprintf_filtered (stream, "%s@(%d)", regname, val); |
| 416 | break; |
| 417 | |
| 418 | case 6: |
| 419 | p = print_indexed (regno, p, addr, stream); |
| 420 | break; |
| 421 | |
| 422 | case 7: |
| 423 | switch (val & 7) |
| 424 | { |
| 425 | case 0: |
| 426 | val = NEXTWORD (p); |
| 427 | fprintf_filtered (stream, "@#"); |
| 428 | print_address (val, stream); |
| 429 | break; |
| 430 | |
| 431 | case 1: |
| 432 | val = NEXTLONG (p); |
| 433 | fprintf_filtered (stream, "@#"); |
| 434 | print_address (val, stream); |
| 435 | break; |
| 436 | |
| 437 | case 2: |
| 438 | val = NEXTWORD (p); |
| 439 | print_address (addr + val, stream); |
| 440 | break; |
| 441 | |
| 442 | case 3: |
| 443 | p = print_indexed (-1, p, addr, stream); |
| 444 | break; |
| 445 | |
| 446 | case 4: |
| 447 | flt_p = 1; /* Assume it's a float... */ |
| 448 | switch( place ) |
| 449 | { |
| 450 | case 'b': |
| 451 | val = NEXTBYTE (p); |
| 452 | flt_p = 0; |
| 453 | break; |
| 454 | |
| 455 | case 'w': |
| 456 | val = NEXTWORD (p); |
| 457 | flt_p = 0; |
| 458 | break; |
| 459 | |
| 460 | case 'l': |
| 461 | val = NEXTLONG (p); |
| 462 | flt_p = 0; |
| 463 | break; |
| 464 | |
| 465 | case 'f': |
| 466 | flval = NEXTSINGLE(p); |
| 467 | break; |
| 468 | |
| 469 | case 'F': |
| 470 | flval = NEXTDOUBLE(p); |
| 471 | break; |
| 472 | |
| 473 | #ifdef HAVE_68881 |
| 474 | case 'x': |
| 475 | ieee_extended_to_double (&ext_format_68881, p, &flval); |
| 476 | p += 12; |
| 477 | break; |
| 478 | #endif |
| 479 | |
| 480 | case 'p': |
| 481 | p += 12; |
| 482 | flval = 0; /* FIXME, handle packed decimal someday. */ |
| 483 | break; |
| 484 | |
| 485 | default: |
| 486 | error ("Invalid arg format in opcode table: \"%c%c\".", |
| 487 | *d, place); |
| 488 | } |
| 489 | if ( flt_p ) /* Print a float? */ |
| 490 | fprintf_filtered (stream, "#%g", flval); |
| 491 | else |
| 492 | fprintf_filtered (stream, "#%d", val); |
| 493 | break; |
| 494 | |
| 495 | default: |
| 496 | fprintf_filtered (stream, "<invalid address mode 0%o>", val); |
| 497 | } |
| 498 | } |
| 499 | break; |
| 500 | |
| 501 | case 'L': |
| 502 | case 'l': |
| 503 | if (place == 'w') |
| 504 | { |
| 505 | char doneany; |
| 506 | p1 = buffer + 2; |
| 507 | val = NEXTWORD (p1); |
| 508 | /* Move the pointer ahead if this point is farther ahead |
| 509 | than the last. */ |
| 510 | p = p1 > p ? p1 : p; |
| 511 | if (val == 0) |
| 512 | { |
| 513 | fputs_filtered ("#0", stream); |
| 514 | break; |
| 515 | } |
| 516 | if (*d == 'l') |
| 517 | { |
| 518 | register int newval = 0; |
| 519 | for (regno = 0; regno < 16; ++regno) |
| 520 | if (val & (0x8000 >> regno)) |
| 521 | newval |= 1 << regno; |
| 522 | val = newval; |
| 523 | } |
| 524 | val &= 0xffff; |
| 525 | doneany = 0; |
| 526 | for (regno = 0; regno < 16; ++regno) |
| 527 | if (val & (1 << regno)) |
| 528 | { |
| 529 | int first_regno; |
| 530 | if (doneany) |
| 531 | fputs_filtered ("/", stream); |
| 532 | doneany = 1; |
| 533 | fprintf_filtered (stream, "%s", reg_names[regno]); |
| 534 | first_regno = regno; |
| 535 | while (val & (1 << (regno + 1))) |
| 536 | ++regno; |
| 537 | if (regno > first_regno) |
| 538 | fprintf_filtered (stream, "-%s", reg_names[regno]); |
| 539 | } |
| 540 | } |
| 541 | else if (place == '3') |
| 542 | { |
| 543 | /* `fmovem' insn. */ |
| 544 | char doneany; |
| 545 | val = fetch_arg (buffer, place, 8); |
| 546 | if (val == 0) |
| 547 | { |
| 548 | fputs_filtered ("#0", stream); |
| 549 | break; |
| 550 | } |
| 551 | if (*d == 'l') |
| 552 | { |
| 553 | register int newval = 0; |
| 554 | for (regno = 0; regno < 8; ++regno) |
| 555 | if (val & (0x80 >> regno)) |
| 556 | newval |= 1 << regno; |
| 557 | val = newval; |
| 558 | } |
| 559 | val &= 0xff; |
| 560 | doneany = 0; |
| 561 | for (regno = 0; regno < 8; ++regno) |
| 562 | if (val & (1 << regno)) |
| 563 | { |
| 564 | int first_regno; |
| 565 | if (doneany) |
| 566 | fputs_filtered ("/", stream); |
| 567 | doneany = 1; |
| 568 | fprintf_filtered (stream, "fp%d", regno); |
| 569 | first_regno = regno; |
| 570 | while (val & (1 << (regno + 1))) |
| 571 | ++regno; |
| 572 | if (regno > first_regno) |
| 573 | fprintf_filtered (stream, "-fp%d", regno); |
| 574 | } |
| 575 | } |
| 576 | else |
| 577 | goto de_fault; |
| 578 | break; |
| 579 | |
| 580 | default: de_fault: |
| 581 | error ("Invalid arg format in opcode table: \"%c\".", *d); |
| 582 | } |
| 583 | |
| 584 | return (unsigned char *) p; |
| 585 | } |
| 586 | |
| 587 | /* Fetch BITS bits from a position in the instruction specified by CODE. |
| 588 | CODE is a "place to put an argument", or 'x' for a destination |
| 589 | that is a general address (mode and register). |
| 590 | BUFFER contains the instruction. */ |
| 591 | |
| 592 | static int |
| 593 | fetch_arg (buffer, code, bits) |
| 594 | unsigned char *buffer; |
| 595 | int code; |
| 596 | int bits; |
| 597 | { |
| 598 | register int val; |
| 599 | switch (code) |
| 600 | { |
| 601 | case 's': |
| 602 | val = buffer[1]; |
| 603 | break; |
| 604 | |
| 605 | case 'd': /* Destination, for register or quick. */ |
| 606 | val = (buffer[0] << 8) + buffer[1]; |
| 607 | val >>= 9; |
| 608 | break; |
| 609 | |
| 610 | case 'x': /* Destination, for general arg */ |
| 611 | val = (buffer[0] << 8) + buffer[1]; |
| 612 | val >>= 6; |
| 613 | break; |
| 614 | |
| 615 | case 'k': |
| 616 | val = (buffer[3] >> 4); |
| 617 | break; |
| 618 | |
| 619 | case 'C': |
| 620 | val = buffer[3]; |
| 621 | break; |
| 622 | |
| 623 | case '1': |
| 624 | val = (buffer[2] << 8) + buffer[3]; |
| 625 | val >>= 12; |
| 626 | break; |
| 627 | |
| 628 | case '2': |
| 629 | val = (buffer[2] << 8) + buffer[3]; |
| 630 | val >>= 6; |
| 631 | break; |
| 632 | |
| 633 | case '3': |
| 634 | case 'j': |
| 635 | val = (buffer[2] << 8) + buffer[3]; |
| 636 | break; |
| 637 | |
| 638 | case '4': |
| 639 | val = (buffer[4] << 8) + buffer[5]; |
| 640 | val >>= 12; |
| 641 | break; |
| 642 | |
| 643 | case '5': |
| 644 | val = (buffer[4] << 8) + buffer[5]; |
| 645 | val >>= 6; |
| 646 | break; |
| 647 | |
| 648 | case '6': |
| 649 | val = (buffer[4] << 8) + buffer[5]; |
| 650 | break; |
| 651 | |
| 652 | case '7': |
| 653 | val = (buffer[2] << 8) + buffer[3]; |
| 654 | val >>= 7; |
| 655 | break; |
| 656 | |
| 657 | case '8': |
| 658 | val = (buffer[2] << 8) + buffer[3]; |
| 659 | val >>= 10; |
| 660 | break; |
| 661 | |
| 662 | default: |
| 663 | abort (); |
| 664 | } |
| 665 | |
| 666 | switch (bits) |
| 667 | { |
| 668 | case 3: |
| 669 | return val & 7; |
| 670 | case 4: |
| 671 | return val & 017; |
| 672 | case 5: |
| 673 | return val & 037; |
| 674 | case 6: |
| 675 | return val & 077; |
| 676 | case 7: |
| 677 | return val & 0177; |
| 678 | case 8: |
| 679 | return val & 0377; |
| 680 | case 12: |
| 681 | return val & 07777; |
| 682 | default: |
| 683 | abort (); |
| 684 | } |
| 685 | } |
| 686 | |
| 687 | /* Print an indexed argument. The base register is BASEREG (-1 for pc). |
| 688 | P points to extension word, in buffer. |
| 689 | ADDR is the nominal core address of that extension word. */ |
| 690 | |
| 691 | static unsigned char * |
| 692 | print_indexed (basereg, p, addr, stream) |
| 693 | int basereg; |
| 694 | unsigned char *p; |
| 695 | CORE_ADDR addr; |
| 696 | FILE *stream; |
| 697 | { |
| 698 | register int word; |
| 699 | static char *scales[] = {"", "*2", "*4", "*8"}; |
| 700 | register int base_disp; |
| 701 | register int outer_disp; |
| 702 | char buf[40]; |
| 703 | |
| 704 | word = NEXTWORD (p); |
| 705 | |
| 706 | /* Generate the text for the index register. |
| 707 | Where this will be output is not yet determined. */ |
| 708 | sprintf (buf, "[%s.%c%s]", |
| 709 | reg_names[(word >> 12) & 0xf], |
| 710 | (word & 0x800) ? 'l' : 'w', |
| 711 | scales[(word >> 9) & 3]); |
| 712 | |
| 713 | /* Handle the 68000 style of indexing. */ |
| 714 | |
| 715 | if ((word & 0x100) == 0) |
| 716 | { |
| 717 | print_base (basereg, |
| 718 | ((word & 0x80) ? word | 0xff00 : word & 0xff) |
| 719 | + ((basereg == -1) ? addr : 0), |
| 720 | stream); |
| 721 | fputs_filtered (buf, stream); |
| 722 | return p; |
| 723 | } |
| 724 | |
| 725 | /* Handle the generalized kind. */ |
| 726 | /* First, compute the displacement to add to the base register. */ |
| 727 | |
| 728 | if (word & 0200) |
| 729 | basereg = -2; |
| 730 | if (word & 0100) |
| 731 | buf[0] = 0; |
| 732 | base_disp = 0; |
| 733 | switch ((word >> 4) & 3) |
| 734 | { |
| 735 | case 2: |
| 736 | base_disp = NEXTWORD (p); |
| 737 | break; |
| 738 | case 3: |
| 739 | base_disp = NEXTLONG (p); |
| 740 | } |
| 741 | if (basereg == -1) |
| 742 | base_disp += addr; |
| 743 | |
| 744 | /* Handle single-level case (not indirect) */ |
| 745 | |
| 746 | if ((word & 7) == 0) |
| 747 | { |
| 748 | print_base (basereg, base_disp, stream); |
| 749 | fputs_filtered (buf, stream); |
| 750 | return p; |
| 751 | } |
| 752 | |
| 753 | /* Two level. Compute displacement to add after indirection. */ |
| 754 | |
| 755 | outer_disp = 0; |
| 756 | switch (word & 3) |
| 757 | { |
| 758 | case 2: |
| 759 | outer_disp = NEXTWORD (p); |
| 760 | break; |
| 761 | case 3: |
| 762 | outer_disp = NEXTLONG (p); |
| 763 | } |
| 764 | |
| 765 | fprintf_filtered (stream, "%d(", outer_disp); |
| 766 | print_base (basereg, base_disp, stream); |
| 767 | |
| 768 | /* If postindexed, print the closeparen before the index. */ |
| 769 | if (word & 4) |
| 770 | fprintf_filtered (stream, ")%s", buf); |
| 771 | /* If preindexed, print the closeparen after the index. */ |
| 772 | else |
| 773 | fprintf_filtered (stream, "%s)", buf); |
| 774 | |
| 775 | return p; |
| 776 | } |
| 777 | |
| 778 | /* Print a base register REGNO and displacement DISP, on STREAM. |
| 779 | REGNO = -1 for pc, -2 for none (suppressed). */ |
| 780 | |
| 781 | static void |
| 782 | print_base (regno, disp, stream) |
| 783 | int regno; |
| 784 | int disp; |
| 785 | FILE *stream; |
| 786 | { |
| 787 | if (regno == -2) |
| 788 | fprintf_filtered (stream, "%d", disp); |
| 789 | else if (regno == -1) |
| 790 | fprintf_filtered (stream, "0x%x", disp); |
| 791 | else |
| 792 | fprintf_filtered (stream, "%d(%s)", disp, reg_names[regno]); |
| 793 | } |