gdb/bfin-tdep.c

   1 /* Target-dependent code for Analog Devices Blackfin processor, for GDB.
   2
   3    Copyright (C) 2005-2016 Free Software Foundation, Inc.
   4
   5    Contributed by Analog Devices, Inc.
   6
   7    This file is part of GDB.
   8
   9    This program is free software; you can redistribute it and/or modify
  10    it under the terms of the GNU General Public License as published by
  11    the Free Software Foundation; either version 3 of the License, or
  12    (at your option) any later version.
  13
  14    This program is distributed in the hope that it will be useful,
  15    but WITHOUT ANY WARRANTY; without even the implied warranty of
  16    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17    GNU General Public License for more details.
  18
  19    You should have received a copy of the GNU General Public License
  20    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
  21
  22 #include "defs.h"
  23 #include "inferior.h"
  24 #include "gdbcore.h"
  25 #include "arch-utils.h"
  26 #include "regcache.h"
  27 #include "frame.h"
  28 #include "frame-unwind.h"
  29 #include "frame-base.h"
  30 #include "trad-frame.h"
  31 #include "dis-asm.h"
  32 #include "sim-regno.h"
  33 #include "gdb/sim-bfin.h"
  34 #include "dwarf2-frame.h"
  35 #include "symtab.h"
  36 #include "elf-bfd.h"
  37 #include "elf/bfin.h"
  38 #include "osabi.h"
  39 #include "infcall.h"
  40 #include "xml-syscall.h"
  41 #include "bfin-tdep.h"
  42
  43 /* Macros used by prologue functions.  */
  44 #define P_LINKAGE                       0xE800
  45 #define P_MINUS_SP1                     0x0140
  46 #define P_MINUS_SP2                     0x05C0
  47 #define P_MINUS_SP3                     0x0540
  48 #define P_MINUS_SP4                     0x04C0
  49 #define P_SP_PLUS                       0x6C06
  50 #define P_P2_LOW                        0xE10A
  51 #define P_P2_HIGH                       0XE14A
  52 #define P_SP_EQ_SP_PLUS_P2              0X5BB2
  53 #define P_SP_EQ_P2_PLUS_SP              0x5B96
  54 #define P_MINUS_MINUS_SP_EQ_RETS        0x0167
  55
  56 /* Macros used for program flow control.  */
  57 /* 16 bit instruction, max  */
  58 #define P_16_BIT_INSR_MAX               0xBFFF
  59 /* 32 bit instruction, min  */
  60 #define P_32_BIT_INSR_MIN               0xC000
  61 /* 32 bit instruction, max  */
  62 #define P_32_BIT_INSR_MAX               0xE801
  63 /* jump (preg), 16-bit, min  */
  64 #define P_JUMP_PREG_MIN                 0x0050
  65 /* jump (preg), 16-bit, max  */
  66 #define P_JUMP_PREG_MAX                 0x0057
  67 /* jump (pc+preg), 16-bit, min  */
  68 #define P_JUMP_PC_PLUS_PREG_MIN         0x0080
  69 /* jump (pc+preg), 16-bit, max  */
  70 #define P_JUMP_PC_PLUS_PREG_MAX         0x0087
  71 /* jump.s pcrel13m2, 16-bit, min  */
  72 #define P_JUMP_S_MIN                    0x2000
  73 /* jump.s pcrel13m2, 16-bit, max  */
  74 #define P_JUMP_S_MAX                    0x2FFF
  75 /* jump.l pcrel25m2, 32-bit, min  */
  76 #define P_JUMP_L_MIN                    0xE200
  77 /* jump.l pcrel25m2, 32-bit, max  */
  78 #define P_JUMP_L_MAX                    0xE2FF
  79 /* conditional jump pcrel11m2, 16-bit, min  */
  80 #define P_IF_CC_JUMP_MIN                0x1800
  81 /* conditional jump pcrel11m2, 16-bit, max  */
  82 #define P_IF_CC_JUMP_MAX                0x1BFF
  83 /* conditional jump(bp) pcrel11m2, 16-bit, min  */
  84 #define P_IF_CC_JUMP_BP_MIN             0x1C00
  85 /* conditional jump(bp) pcrel11m2, 16-bit, max  */
  86 #define P_IF_CC_JUMP_BP_MAX             0x1FFF
  87 /* conditional !jump pcrel11m2, 16-bit, min  */
  88 #define P_IF_NOT_CC_JUMP_MIN            0x1000
  89 /* conditional !jump pcrel11m2, 16-bit, max  */
  90 #define P_IF_NOT_CC_JUMP_MAX            0x13FF
  91 /* conditional jump(bp) pcrel11m2, 16-bit, min  */
  92 #define P_IF_NOT_CC_JUMP_BP_MIN         0x1400
  93 /* conditional jump(bp) pcrel11m2, 16-bit, max  */
  94 #define P_IF_NOT_CC_JUMP_BP_MAX         0x17FF
  95 /* call (preg), 16-bit, min  */
  96 #define P_CALL_PREG_MIN                 0x0060
  97 /* call (preg), 16-bit, max  */
  98 #define P_CALL_PREG_MAX                 0x0067
  99 /* call (pc+preg), 16-bit, min  */
 100 #define P_CALL_PC_PLUS_PREG_MIN         0x0070
 101 /* call (pc+preg), 16-bit, max  */
 102 #define P_CALL_PC_PLUS_PREG_MAX         0x0077
 103 /* call pcrel25m2, 32-bit, min  */
 104 #define P_CALL_MIN                      0xE300
 105 /* call pcrel25m2, 32-bit, max  */
 106 #define P_CALL_MAX                      0xE3FF
 107 /* RTS  */
 108 #define P_RTS                           0x0010
 109 /* MNOP  */
 110 #define P_MNOP                          0xC803
 111 /* EXCPT, 16-bit, min  */
 112 #define P_EXCPT_MIN                     0x00A0
 113 /* EXCPT, 16-bit, max  */
 114 #define P_EXCPT_MAX                     0x00AF
 115 /* multi instruction mask 1, 16-bit  */
 116 #define P_BIT_MULTI_INS_1               0xC000
 117 /* multi instruction mask 2, 16-bit  */
 118 #define P_BIT_MULTI_INS_2               0x0800
 119
 120 /* The maximum bytes we search to skip the prologue.  */
 121 #define UPPER_LIMIT                     40
 122
 123 /* ASTAT bits  */
 124 #define ASTAT_CC_POS                    5
 125 #define ASTAT_CC                        (1 << ASTAT_CC_POS)
 126
 127 /* Initial value: Register names used in BFIN's ISA documentation.  */
 128
 129 static const char * const bfin_register_name_strings[] =
 130 {
 131   "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7",
 132   "p0", "p1", "p2", "p3", "p4", "p5", "sp", "fp",
 133   "i0", "i1", "i2", "i3", "m0", "m1", "m2", "m3",
 134   "b0", "b1", "b2", "b3", "l0", "l1", "l2", "l3",
 135   "a0x", "a0w", "a1x", "a1w", "astat", "rets",
 136   "lc0", "lt0", "lb0", "lc1", "lt1", "lb1", "cycles", "cycles2",
 137   "usp", "seqstat", "syscfg", "reti", "retx", "retn", "rete",
 138   "pc", "cc",
 139 };
 140
 141 #define NUM_BFIN_REGNAMES ARRAY_SIZE (bfin_register_name_strings)
 142
 143
 144 /* In this diagram successive memory locations increase downwards or the
 145    stack grows upwards with negative indices.  (PUSH analogy for stack.)
 146
 147    The top frame is the "frame" of the current function being executed.
 148
 149      +--------------+ SP    -
 150      |  local vars  |       ^
 151      +--------------+       |
 152      |  save regs   |       |
 153      +--------------+ FP    |
 154      |   old FP    -|--    top
 155      +--------------+  |  frame
 156      |    RETS      |  |    |
 157      +--------------+  |    |
 158      |   param 1    |  |    |
 159      |   param 2    |  |    |
 160      |    ...       |  |    V
 161      +--------------+  |    -
 162      |  local vars  |  |    ^
 163      +--------------+  |    |
 164      |  save regs   |  |    |
 165      +--------------+<-     |
 166      |   old FP    -|--   next
 167      +--------------+  |  frame
 168      |    RETS      |  |    |
 169      +--------------+  |    |
 170      |   param 1    |  |    |
 171      |   param 2    |  |    |
 172      |    ...       |  |    V
 173      +--------------+  |    -
 174      |  local vars  |  |    ^
 175      +--------------+  |    |
 176      |  save regs   |  |    |
 177      +--------------+<-  next frame
 178      |   old FP     |       |
 179      +--------------+       |
 180      |    RETS      |       V
 181      +--------------+       -
 182
 183    The frame chain is formed as following:
 184
 185      FP has the topmost frame.
 186      FP + 4 has the previous FP and so on.  */
 187
 188
 189 /* Map from DWARF2 register number to GDB register number.  */
 190
 191 static const int map_gcc_gdb[] =
 192 {
 193   BFIN_R0_REGNUM,
 194   BFIN_R1_REGNUM,
 195   BFIN_R2_REGNUM,
 196   BFIN_R3_REGNUM,
 197   BFIN_R4_REGNUM,
 198   BFIN_R5_REGNUM,
 199   BFIN_R6_REGNUM,
 200   BFIN_R7_REGNUM,
 201   BFIN_P0_REGNUM,
 202   BFIN_P1_REGNUM,
 203   BFIN_P2_REGNUM,
 204   BFIN_P3_REGNUM,
 205   BFIN_P4_REGNUM,
 206   BFIN_P5_REGNUM,
 207   BFIN_SP_REGNUM,
 208   BFIN_FP_REGNUM,
 209   BFIN_I0_REGNUM,
 210   BFIN_I1_REGNUM,
 211   BFIN_I2_REGNUM,
 212   BFIN_I3_REGNUM,
 213   BFIN_B0_REGNUM,
 214   BFIN_B1_REGNUM,
 215   BFIN_B2_REGNUM,
 216   BFIN_B3_REGNUM,
 217   BFIN_L0_REGNUM,
 218   BFIN_L1_REGNUM,
 219   BFIN_L2_REGNUM,
 220   BFIN_L3_REGNUM,
 221   BFIN_M0_REGNUM,
 222   BFIN_M1_REGNUM,
 223   BFIN_M2_REGNUM,
 224   BFIN_M3_REGNUM,
 225   BFIN_A0_DOT_X_REGNUM,
 226   BFIN_A1_DOT_X_REGNUM,
 227   BFIN_CC_REGNUM,
 228   BFIN_RETS_REGNUM,
 229   BFIN_RETI_REGNUM,
 230   BFIN_RETX_REGNUM,
 231   BFIN_RETN_REGNUM,
 232   BFIN_RETE_REGNUM,
 233   BFIN_ASTAT_REGNUM,
 234   BFIN_SEQSTAT_REGNUM,
 235   BFIN_USP_REGNUM,
 236   BFIN_LT0_REGNUM,
 237   BFIN_LT1_REGNUM,
 238   BFIN_LC0_REGNUM,
 239   BFIN_LC1_REGNUM,
 240   BFIN_LB0_REGNUM,
 241   BFIN_LB1_REGNUM
 242 };
 243
 244
 245 struct bfin_frame_cache
 246 {
 247   /* Base address.  */
 248   CORE_ADDR base;
 249   CORE_ADDR sp_offset;
 250   CORE_ADDR pc;
 251   int frameless_pc_value;
 252
 253   /* Saved registers.  */
 254   CORE_ADDR saved_regs[BFIN_NUM_REGS];
 255   CORE_ADDR saved_sp;
 256
 257   /* Stack space reserved for local variables.  */
 258   long locals;
 259 };
 260
 261 /* Allocate and initialize a frame cache.  */
 262
 263 static struct bfin_frame_cache *
 264 bfin_alloc_frame_cache (void)
 265 {
 266   struct bfin_frame_cache *cache;
 267   int i;
 268
 269   cache = FRAME_OBSTACK_ZALLOC (struct bfin_frame_cache);
 270
 271   /* Base address.  */
 272   cache->base = 0;
 273   cache->sp_offset = -4;
 274   cache->pc = 0;
 275   cache->frameless_pc_value = 0;
 276
 277   /* Saved registers.  We initialize these to -1 since zero is a valid
 278      offset (that's where fp is supposed to be stored).  */
 279   for (i = 0; i < BFIN_NUM_REGS; i++)
 280     cache->saved_regs[i] = -1;
 281
 282   /* Frameless until proven otherwise.  */
 283   cache->locals = -1;
 284
 285   return cache;
 286 }
 287
 288 static struct bfin_frame_cache *
 289 bfin_frame_cache (struct frame_info *this_frame, void **this_cache)
 290 {
 291   struct bfin_frame_cache *cache;
 292   int i;
 293
 294   if (*this_cache)
 295     return (struct bfin_frame_cache *) *this_cache;
 296
 297   cache = bfin_alloc_frame_cache ();
 298   *this_cache = cache;
 299
 300   cache->base = get_frame_register_unsigned (this_frame, BFIN_FP_REGNUM);
 301   if (cache->base == 0)
 302     return cache;
 303
 304   /* For normal frames, PC is stored at [FP + 4].  */
 305   cache->saved_regs[BFIN_PC_REGNUM] = 4;
 306   cache->saved_regs[BFIN_FP_REGNUM] = 0;
 307
 308   /* Adjust all the saved registers such that they contain addresses
 309      instead of offsets.  */
 310   for (i = 0; i < BFIN_NUM_REGS; i++)
 311     if (cache->saved_regs[i] != -1)
 312       cache->saved_regs[i] += cache->base;
 313
 314   cache->pc = get_frame_func (this_frame) ;
 315   if (cache->pc == 0 || cache->pc == get_frame_pc (this_frame))
 316     {
 317       /* Either there is no prologue (frameless function) or we are at
 318          the start of a function.  In short we do not have a frame.
 319          PC is stored in rets register.  FP points to previous frame.  */
 320
 321       cache->saved_regs[BFIN_PC_REGNUM] =
 322         get_frame_register_unsigned (this_frame, BFIN_RETS_REGNUM);
 323       cache->frameless_pc_value = 1;
 324       cache->base = get_frame_register_unsigned (this_frame, BFIN_FP_REGNUM);
 325       cache->saved_regs[BFIN_FP_REGNUM] = cache->base;
 326       cache->saved_sp = cache->base;
 327     }
 328   else
 329     {
 330       cache->frameless_pc_value = 0;
 331
 332       /* Now that we have the base address for the stack frame we can
 333          calculate the value of SP in the calling frame.  */
 334       cache->saved_sp = cache->base + 8;
 335     }
 336
 337   return cache;
 338 }
 339
 340 static void
 341 bfin_frame_this_id (struct frame_info *this_frame,
 342                     void **this_cache,
 343                     struct frame_id *this_id)
 344 {
 345   struct bfin_frame_cache *cache = bfin_frame_cache (this_frame, this_cache);
 346
 347   /* This marks the outermost frame.  */
 348   if (cache->base == 0)
 349     return;
 350
 351   /* See the end of bfin_push_dummy_call.  */
 352   *this_id = frame_id_build (cache->base + 8, cache->pc);
 353 }
 354
 355 static struct value *
 356 bfin_frame_prev_register (struct frame_info *this_frame,
 357                           void **this_cache,
 358                           int regnum)
 359 {
 360   struct gdbarch *gdbarch = get_frame_arch (this_frame);
 361   struct bfin_frame_cache *cache = bfin_frame_cache (this_frame, this_cache);
 362
 363   if (regnum == gdbarch_sp_regnum (gdbarch) && cache->saved_sp)
 364     return frame_unwind_got_constant (this_frame, regnum, cache->saved_sp);
 365
 366   if (regnum < BFIN_NUM_REGS && cache->saved_regs[regnum] != -1)
 367     return frame_unwind_got_memory (this_frame, regnum,
 368                                     cache->saved_regs[regnum]);
 369
 370   return frame_unwind_got_register (this_frame, regnum, regnum);
 371 }
 372
 373 static const struct frame_unwind bfin_frame_unwind =
 374 {
 375   NORMAL_FRAME,
 376   default_frame_unwind_stop_reason,
 377   bfin_frame_this_id,
 378   bfin_frame_prev_register,
 379   NULL,
 380   default_frame_sniffer
 381 };
 382
 383 /* Check for "[--SP] = <reg>;" insns.  These are appear in function
 384    prologues to save misc registers onto the stack.  */
 385
 386 static int
 387 is_minus_minus_sp (int op)
 388 {
 389   op &= 0xFFC0;
 390
 391   if ((op == P_MINUS_SP1) || (op == P_MINUS_SP2)
 392       || (op == P_MINUS_SP3) || (op == P_MINUS_SP4))
 393     return 1;
 394
 395   return 0;
 396 }
 397
 398 /* Skip all the insns that appear in generated function prologues.  */
 399
 400 static CORE_ADDR
 401 bfin_skip_prologue (struct gdbarch *gdbarch, CORE_ADDR pc)
 402 {
 403   enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
 404   int op = read_memory_unsigned_integer (pc, 2, byte_order);
 405   CORE_ADDR orig_pc = pc;
 406   int done = 0;
 407
 408   /* The new gcc prologue generates the register saves BEFORE the link
 409      or RETS saving instruction.
 410      So, our job is to stop either at those instructions or some upper
 411      limit saying there is no frame!  */
 412
 413   while (!done)
 414     {
 415       if (is_minus_minus_sp (op))
 416         {
 417           while (is_minus_minus_sp (op))
 418             {
 419               pc += 2;
 420               op = read_memory_unsigned_integer (pc, 2, byte_order);
 421             }
 422
 423           if (op == P_LINKAGE)
 424             pc += 4;
 425
 426           done = 1;
 427         }
 428       else if (op == P_LINKAGE)
 429         {
 430           pc += 4;
 431           done = 1;
 432         }
 433       else if (op == P_MINUS_MINUS_SP_EQ_RETS)
 434         {
 435           pc += 2;
 436           done = 1;
 437         }
 438       else if (op == P_RTS)
 439         {
 440           done = 1;
 441         }
 442       else if ((op >= P_JUMP_PREG_MIN && op <= P_JUMP_PREG_MAX)
 443                || (op >= P_JUMP_PC_PLUS_PREG_MIN
 444                    && op <= P_JUMP_PC_PLUS_PREG_MAX)
 445                || (op == P_JUMP_S_MIN && op <= P_JUMP_S_MAX))
 446         {
 447           done = 1;
 448         }
 449       else if (pc - orig_pc >= UPPER_LIMIT)
 450         {
 451           warning (_("Function Prologue not recognised; "
 452                      "pc will point to ENTRY_POINT of the function"));
 453           pc = orig_pc + 2;
 454           done = 1;
 455         }
 456       else
 457         {
 458           pc += 2; /* Not a terminating instruction go on.  */
 459           op = read_memory_unsigned_integer (pc, 2, byte_order);
 460         }
 461     }
 462
 463    /* TODO:
 464       Dwarf2 uses entry point value AFTER some register initializations.
 465       We should perhaps skip such asssignments as well (R6 = R1, ...).  */
 466
 467   return pc;
 468 }
 469
 470 /* Return the GDB type object for the "standard" data type of data in
 471    register N.  This should be void pointer for P0-P5, SP, FP;
 472    void pointer to function for PC; int otherwise.  */
 473
 474 static struct type *
 475 bfin_register_type (struct gdbarch *gdbarch, int regnum)
 476 {
 477   if ((regnum >= BFIN_P0_REGNUM && regnum <= BFIN_FP_REGNUM)
 478       || regnum == BFIN_USP_REGNUM)
 479     return builtin_type (gdbarch)->builtin_data_ptr;
 480
 481   if (regnum == BFIN_PC_REGNUM || regnum == BFIN_RETS_REGNUM
 482       || regnum == BFIN_RETI_REGNUM || regnum == BFIN_RETX_REGNUM
 483       || regnum == BFIN_RETN_REGNUM || regnum == BFIN_RETE_REGNUM
 484       || regnum == BFIN_LT0_REGNUM || regnum == BFIN_LB0_REGNUM
 485       || regnum == BFIN_LT1_REGNUM || regnum == BFIN_LB1_REGNUM)
 486     return builtin_type (gdbarch)->builtin_func_ptr;
 487
 488   return builtin_type (gdbarch)->builtin_int32;
 489 }
 490
 491 static CORE_ADDR
 492 bfin_push_dummy_call (struct gdbarch *gdbarch,
 493                       struct value *function,
 494                       struct regcache *regcache,
 495                       CORE_ADDR bp_addr,
 496                       int nargs,
 497                       struct value **args,
 498                       CORE_ADDR sp,
 499                       int struct_return,
 500                       CORE_ADDR struct_addr)
 501 {
 502   enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
 503   int i;
 504   long reg_r0, reg_r1, reg_r2;
 505   int total_len = 0;
 506
 507   for (i = nargs - 1; i >= 0; i--)
 508     {
 509       struct type *value_type = value_enclosing_type (args[i]);
 510
 511       total_len += (TYPE_LENGTH (value_type) + 3) & ~3;
 512     }
 513
 514   /* At least twelve bytes of stack space must be allocated for the function's
 515      arguments, even for functions that have less than 12 bytes of argument
 516      data.  */
 517
 518   if (total_len < 12)
 519     sp -= 12 - total_len;
 520
 521   /* Push arguments in reverse order.  */
 522
 523   for (i = nargs - 1; i >= 0; i--)
 524     {
 525       struct type *value_type = value_enclosing_type (args[i]);
 526       struct type *arg_type = check_typedef (value_type);
 527       int container_len = (TYPE_LENGTH (value_type) + 3) & ~3;
 528
 529       sp -= container_len;
 530       write_memory (sp, value_contents (args[i]), container_len);
 531     }
 532
 533   /* Initialize R0, R1, and R2 to the first 3 words of parameters.  */
 534
 535   reg_r0 = read_memory_integer (sp, 4, byte_order);
 536   regcache_cooked_write_unsigned (regcache, BFIN_R0_REGNUM, reg_r0);
 537   reg_r1 = read_memory_integer (sp + 4, 4, byte_order);
 538   regcache_cooked_write_unsigned (regcache, BFIN_R1_REGNUM, reg_r1);
 539   reg_r2 = read_memory_integer (sp + 8, 4, byte_order);
 540   regcache_cooked_write_unsigned (regcache, BFIN_R2_REGNUM, reg_r2);
 541
 542   /* Store struct value address.  */
 543
 544   if (struct_return)
 545     regcache_cooked_write_unsigned (regcache, BFIN_P0_REGNUM, struct_addr);
 546
 547   /* Set the dummy return value to bp_addr.
 548      A dummy breakpoint will be setup to execute the call.  */
 549
 550   regcache_cooked_write_unsigned (regcache, BFIN_RETS_REGNUM, bp_addr);
 551
 552   /* Finally, update the stack pointer.  */
 553
 554   regcache_cooked_write_unsigned (regcache, BFIN_SP_REGNUM, sp);
 555
 556   return sp;
 557 }
 558
 559 /* Convert DWARF2 register number REG to the appropriate register number
 560    used by GDB.  */
 561
 562 static int
 563 bfin_reg_to_regnum (struct gdbarch *gdbarch, int reg)
 564 {
 565   if (reg < 0 || reg >= ARRAY_SIZE (map_gcc_gdb))
 566     return -1;
 567
 568   return map_gcc_gdb[reg];
 569 }
 570
 571 /* Implement the breakpoint_kind_from_pc gdbarch method.  */
 572
 573 static int
 574 bfin_breakpoint_kind_from_pc (struct gdbarch *gdbarch, CORE_ADDR *pcptr)
 575 {
 576   enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
 577   unsigned short iw;
 578
 579   iw = read_memory_unsigned_integer (*pcptr, 2, byte_order);
 580
 581   if ((iw & 0xf000) >= 0xc000)
 582     /* 32-bit instruction.  */
 583     return 4;
 584   else
 585     return 2;
 586 }
 587
 588 /* Implement the sw_breakpoint_from_kind gdbarch method.  */
 589
 590 static const gdb_byte *
 591 bfin_sw_breakpoint_from_kind (struct gdbarch *gdbarch, int kind, int *size)
 592 {
 593   static unsigned char bfin_breakpoint[] = {0xa1, 0x00, 0x00, 0x00};
 594   static unsigned char bfin_sim_breakpoint[] = {0x25, 0x00, 0x00, 0x00};
 595
 596   *size = kind;
 597
 598   if (strcmp (target_shortname, "sim") == 0)
 599     return bfin_sim_breakpoint;
 600   else
 601     return bfin_breakpoint;
 602 }
 603
 604 /* This function implements the 'breakpoint_from_pc' gdbarch method.
 605    It returns a pointer to a string of bytes that encode a breakpoint
 606    instruction, stores the length of the string to *lenptr, and
 607    adjusts the program counter (if necessary) to point to the actual
 608    memory location where the breakpoint should be inserted.  */
 609
 610 GDBARCH_BREAKPOINT_FROM_PC (bfin)
 611
 612 static void
 613 bfin_extract_return_value (struct type *type,
 614                            struct regcache *regs,
 615                            gdb_byte *dst)
 616 {
 617   struct gdbarch *gdbarch = get_regcache_arch (regs);
 618   enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
 619   bfd_byte *valbuf = dst;
 620   int len = TYPE_LENGTH (type);
 621   ULONGEST tmp;
 622   int regno = BFIN_R0_REGNUM;
 623
 624   gdb_assert (len <= 8);
 625
 626   while (len > 0)
 627     {
 628       regcache_cooked_read_unsigned (regs, regno++, &tmp);
 629       store_unsigned_integer (valbuf, (len > 4 ? 4 : len), byte_order, tmp);
 630       len -= 4;
 631       valbuf += 4;
 632     }
 633 }
 634
 635 /* Write into appropriate registers a function return value of type
 636    TYPE, given in virtual format.  */
 637
 638 static void
 639 bfin_store_return_value (struct type *type,
 640                          struct regcache *regs,
 641                          const gdb_byte *src)
 642 {
 643   const bfd_byte *valbuf = src;
 644
 645   /* Integral values greater than one word are stored in consecutive
 646      registers starting with R0.  This will always be a multiple of
 647      the register size.  */
 648
 649   int len = TYPE_LENGTH (type);
 650   int regno = BFIN_R0_REGNUM;
 651
 652   gdb_assert (len <= 8);
 653
 654   while (len > 0)
 655     {
 656       regcache_cooked_write (regs, regno++, valbuf);
 657       len -= 4;
 658       valbuf += 4;
 659     }
 660 }
 661
 662 /* Determine, for architecture GDBARCH, how a return value of TYPE
 663    should be returned.  If it is supposed to be returned in registers,
 664    and READBUF is nonzero, read the appropriate value from REGCACHE,
 665    and copy it into READBUF.  If WRITEBUF is nonzero, write the value
 666    from WRITEBUF into REGCACHE.  */
 667
 668 static enum return_value_convention
 669 bfin_return_value (struct gdbarch *gdbarch,
 670                    struct value *function,
 671                    struct type *type,
 672                    struct regcache *regcache,
 673                    gdb_byte *readbuf,
 674                    const gdb_byte *writebuf)
 675 {
 676   if (TYPE_LENGTH (type) > 8)
 677     return RETURN_VALUE_STRUCT_CONVENTION;
 678
 679   if (readbuf)
 680     bfin_extract_return_value (type, regcache, readbuf);
 681
 682   if (writebuf)
 683     bfin_store_return_value (type, regcache, writebuf);
 684
 685   return RETURN_VALUE_REGISTER_CONVENTION;
 686 }
 687
 688 /* Return the BFIN register name corresponding to register I.  */
 689
 690 static const char *
 691 bfin_register_name (struct gdbarch *gdbarch, int i)
 692 {
 693   return bfin_register_name_strings[i];
 694 }
 695
 696 static enum register_status
 697 bfin_pseudo_register_read (struct gdbarch *gdbarch, struct regcache *regcache,
 698                            int regnum, gdb_byte *buffer)
 699 {
 700   gdb_byte *buf = (gdb_byte *) alloca (MAX_REGISTER_SIZE);
 701   enum register_status status;
 702
 703   if (regnum != BFIN_CC_REGNUM)
 704     internal_error (__FILE__, __LINE__,
 705                     _("invalid register number %d"), regnum);
 706
 707   /* Extract the CC bit from the ASTAT register.  */
 708   status = regcache_raw_read (regcache, BFIN_ASTAT_REGNUM, buf);
 709   if (status == REG_VALID)
 710     {
 711       buffer[1] = buffer[2] = buffer[3] = 0;
 712       buffer[0] = !!(buf[0] & ASTAT_CC);
 713     }
 714   return status;
 715 }
 716
 717 static void
 718 bfin_pseudo_register_write (struct gdbarch *gdbarch, struct regcache *regcache,
 719                             int regnum, const gdb_byte *buffer)
 720 {
 721   gdb_byte *buf = (gdb_byte *) alloca (MAX_REGISTER_SIZE);
 722
 723   if (regnum != BFIN_CC_REGNUM)
 724     internal_error (__FILE__, __LINE__,
 725                     _("invalid register number %d"), regnum);
 726
 727   /* Overlay the CC bit in the ASTAT register.  */
 728   regcache_raw_read (regcache, BFIN_ASTAT_REGNUM, buf);
 729   buf[0] = (buf[0] & ~ASTAT_CC) | ((buffer[0] & 1) << ASTAT_CC_POS);
 730   regcache_raw_write (regcache, BFIN_ASTAT_REGNUM, buf);
 731 }
 732
 733 static CORE_ADDR
 734 bfin_frame_base_address (struct frame_info *this_frame, void **this_cache)
 735 {
 736   struct bfin_frame_cache *cache = bfin_frame_cache (this_frame, this_cache);
 737
 738   return cache->base;
 739 }
 740
 741 static CORE_ADDR
 742 bfin_frame_local_address (struct frame_info *this_frame, void **this_cache)
 743 {
 744   struct bfin_frame_cache *cache = bfin_frame_cache (this_frame, this_cache);
 745
 746   return cache->base - 4;
 747 }
 748
 749 static CORE_ADDR
 750 bfin_frame_args_address (struct frame_info *this_frame, void **this_cache)
 751 {
 752   struct bfin_frame_cache *cache = bfin_frame_cache (this_frame, this_cache);
 753
 754   return cache->base + 8;
 755 }
 756
 757 static const struct frame_base bfin_frame_base =
 758 {
 759   &bfin_frame_unwind,
 760   bfin_frame_base_address,
 761   bfin_frame_local_address,
 762   bfin_frame_args_address
 763 };
 764
 765 static struct frame_id
 766 bfin_dummy_id (struct gdbarch *gdbarch, struct frame_info *this_frame)
 767 {
 768   CORE_ADDR sp;
 769
 770   sp = get_frame_register_unsigned (this_frame, BFIN_SP_REGNUM);
 771
 772   return frame_id_build (sp, get_frame_pc (this_frame));
 773 }
 774
 775 static CORE_ADDR
 776 bfin_unwind_pc (struct gdbarch *gdbarch, struct frame_info *next_frame)
 777 {
 778   return frame_unwind_register_unsigned (next_frame, BFIN_PC_REGNUM);
 779 }
 780
 781 static CORE_ADDR
 782 bfin_frame_align (struct gdbarch *gdbarch, CORE_ADDR address)
 783 {
 784   return (address & ~0x3);
 785 }
 786
 787 enum bfin_abi
 788 bfin_abi (struct gdbarch *gdbarch)
 789 {
 790   return gdbarch_tdep (gdbarch)->bfin_abi;
 791 }
 792
 793 /* Initialize the current architecture based on INFO.  If possible,
 794    re-use an architecture from ARCHES, which is a list of
 795    architectures already created during this debugging session.
 796
 797    Called e.g. at program startup, when reading a core file, and when
 798    reading a binary file.  */
 799
 800 static struct gdbarch *
 801 bfin_gdbarch_init (struct gdbarch_info info, struct gdbarch_list *arches)
 802 {
 803   struct gdbarch_tdep *tdep;
 804   struct gdbarch *gdbarch;
 805   enum bfin_abi abi;
 806
 807   abi = BFIN_ABI_FLAT;
 808
 809   /* If there is already a candidate, use it.  */
 810
 811   for (arches = gdbarch_list_lookup_by_info (arches, &info);
 812        arches != NULL;
 813        arches = gdbarch_list_lookup_by_info (arches->next, &info))
 814     {
 815       if (gdbarch_tdep (arches->gdbarch)->bfin_abi != abi)
 816         continue;
 817       return arches->gdbarch;
 818     }
 819
 820   tdep = XNEW (struct gdbarch_tdep);
 821   gdbarch = gdbarch_alloc (&info, tdep);
 822
 823   tdep->bfin_abi = abi;
 824
 825   set_gdbarch_num_regs (gdbarch, BFIN_NUM_REGS);
 826   set_gdbarch_pseudo_register_read (gdbarch, bfin_pseudo_register_read);
 827   set_gdbarch_pseudo_register_write (gdbarch, bfin_pseudo_register_write);
 828   set_gdbarch_num_pseudo_regs (gdbarch, BFIN_NUM_PSEUDO_REGS);
 829   set_gdbarch_sp_regnum (gdbarch, BFIN_SP_REGNUM);
 830   set_gdbarch_pc_regnum (gdbarch, BFIN_PC_REGNUM);
 831   set_gdbarch_ps_regnum (gdbarch, BFIN_ASTAT_REGNUM);
 832   set_gdbarch_dwarf2_reg_to_regnum (gdbarch, bfin_reg_to_regnum);
 833   set_gdbarch_register_name (gdbarch, bfin_register_name);
 834   set_gdbarch_register_type (gdbarch, bfin_register_type);
 835   set_gdbarch_dummy_id (gdbarch, bfin_dummy_id);
 836   set_gdbarch_push_dummy_call (gdbarch, bfin_push_dummy_call);
 837   set_gdbarch_believe_pcc_promotion (gdbarch, 1);
 838   set_gdbarch_return_value (gdbarch, bfin_return_value);
 839   set_gdbarch_skip_prologue (gdbarch, bfin_skip_prologue);
 840   set_gdbarch_inner_than (gdbarch, core_addr_lessthan);
 841   SET_GDBARCH_BREAKPOINT_MANIPULATION (bfin);
 842   set_gdbarch_decr_pc_after_break (gdbarch, 2);
 843   set_gdbarch_frame_args_skip (gdbarch, 8);
 844   set_gdbarch_unwind_pc (gdbarch, bfin_unwind_pc);
 845   set_gdbarch_frame_align (gdbarch, bfin_frame_align);
 846   set_gdbarch_print_insn (gdbarch, print_insn_bfin);
 847
 848   /* Hook in ABI-specific overrides, if they have been registered.  */
 849   gdbarch_init_osabi (info, gdbarch);
 850
 851   dwarf2_append_unwinders (gdbarch);
 852
 853   frame_base_set_default (gdbarch, &bfin_frame_base);
 854
 855   frame_unwind_append_unwinder (gdbarch, &bfin_frame_unwind);
 856
 857   return gdbarch;
 858 }
 859
 860 /* Provide a prototype to silence -Wmissing-prototypes.  */
 861 extern initialize_file_ftype _initialize_bfin_tdep;
 862
 863 void
 864 _initialize_bfin_tdep (void)
 865 {
 866   register_gdbarch_init (bfd_arch_bfin, bfin_gdbarch_init);
 867 }