Commit | Line | Data |
---|---|---|
456f8b9d | 1 | /* Target-dependent code for the Fujitsu FR-V, for GDB, the GNU Debugger. |
1e698235 | 2 | Copyright 2002, 2003 Free Software Foundation, Inc. |
456f8b9d DB |
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., 59 Temple Place - Suite 330, | |
19 | Boston, MA 02111-1307, USA. */ | |
20 | ||
21 | #include "defs.h" | |
8baa6f92 | 22 | #include "gdb_string.h" |
456f8b9d DB |
23 | #include "inferior.h" |
24 | #include "symfile.h" /* for entry_point_address */ | |
25 | #include "gdbcore.h" | |
26 | #include "arch-utils.h" | |
27 | #include "regcache.h" | |
8baa6f92 | 28 | #include "frame.h" |
1cb761c7 KB |
29 | #include "frame-unwind.h" |
30 | #include "frame-base.h" | |
8baa6f92 | 31 | #include "trad-frame.h" |
dcc6aaff | 32 | #include "dis-asm.h" |
526eef89 KB |
33 | #include "gdb_assert.h" |
34 | #include "sim-regno.h" | |
35 | #include "gdb/sim-frv.h" | |
36 | #include "opcodes/frv-desc.h" /* for the H_SPR_... enums */ | |
456f8b9d DB |
37 | |
38 | extern void _initialize_frv_tdep (void); | |
39 | ||
40 | static gdbarch_init_ftype frv_gdbarch_init; | |
41 | ||
42 | static gdbarch_register_name_ftype frv_register_name; | |
456f8b9d | 43 | static gdbarch_breakpoint_from_pc_ftype frv_breakpoint_from_pc; |
46a16dba | 44 | static gdbarch_adjust_breakpoint_address_ftype frv_gdbarch_adjust_breakpoint_address; |
456f8b9d | 45 | static gdbarch_skip_prologue_ftype frv_skip_prologue; |
456f8b9d | 46 | static gdbarch_frameless_function_invocation_ftype frv_frameless_function_invocation; |
aed7f26a MS |
47 | static gdbarch_deprecated_push_arguments_ftype frv_push_arguments; |
48 | static gdbarch_deprecated_saved_pc_after_call_ftype frv_saved_pc_after_call; | |
456f8b9d | 49 | |
526eef89 KB |
50 | /* Register numbers. The order in which these appear define the |
51 | remote protocol, so take care in changing them. */ | |
456f8b9d | 52 | enum { |
456f8b9d DB |
53 | /* Register numbers 0 -- 63 are always reserved for general-purpose |
54 | registers. The chip at hand may have less. */ | |
55 | first_gpr_regnum = 0, | |
56 | sp_regnum = 1, | |
57 | fp_regnum = 2, | |
58 | struct_return_regnum = 3, | |
59 | last_gpr_regnum = 63, | |
60 | ||
61 | /* Register numbers 64 -- 127 are always reserved for floating-point | |
62 | registers. The chip at hand may have less. */ | |
63 | first_fpr_regnum = 64, | |
64 | last_fpr_regnum = 127, | |
65 | ||
526eef89 | 66 | /* The PC register. */ |
456f8b9d | 67 | pc_regnum = 128, |
526eef89 KB |
68 | |
69 | /* Register numbers 129 on up are always reserved for special-purpose | |
70 | registers. */ | |
71 | first_spr_regnum = 129, | |
456f8b9d DB |
72 | psr_regnum = 129, |
73 | ccr_regnum = 130, | |
74 | cccr_regnum = 131, | |
75 | tbr_regnum = 135, | |
76 | brr_regnum = 136, | |
77 | dbar0_regnum = 137, | |
78 | dbar1_regnum = 138, | |
79 | dbar2_regnum = 139, | |
80 | dbar3_regnum = 140, | |
81 | lr_regnum = 145, | |
82 | lcr_regnum = 146, | |
526eef89 KB |
83 | iacc0h_regnum = 147, |
84 | iacc0l_regnum = 148, | |
85 | last_spr_regnum = 148, | |
86 | ||
87 | /* The total number of registers we know exist. */ | |
6a748db6 KB |
88 | frv_num_regs = last_spr_regnum + 1, |
89 | ||
90 | /* Pseudo registers */ | |
91 | first_pseudo_regnum = frv_num_regs, | |
92 | ||
93 | /* iacc0 - the 64-bit concatenation of iacc0h and iacc0l. */ | |
94 | iacc0_regnum = first_pseudo_regnum + 0, | |
95 | ||
96 | last_pseudo_regnum = iacc0_regnum, | |
65ed7f0a | 97 | frv_num_pseudo_regs = last_pseudo_regnum - first_pseudo_regnum + 1, |
456f8b9d DB |
98 | }; |
99 | ||
100 | static LONGEST frv_call_dummy_words[] = | |
101 | {0}; | |
102 | ||
103 | ||
1cb761c7 | 104 | struct frv_unwind_cache /* was struct frame_extra_info */ |
456f8b9d | 105 | { |
1cb761c7 KB |
106 | /* The previous frame's inner-most stack address. Used as this |
107 | frame ID's stack_addr. */ | |
108 | CORE_ADDR prev_sp; | |
456f8b9d | 109 | |
1cb761c7 KB |
110 | /* The frame's base, optionally used by the high-level debug info. */ |
111 | CORE_ADDR base; | |
8baa6f92 KB |
112 | |
113 | /* Table indicating the location of each and every register. */ | |
114 | struct trad_frame_saved_reg *saved_regs; | |
456f8b9d DB |
115 | }; |
116 | ||
117 | ||
118 | /* A structure describing a particular variant of the FRV. | |
119 | We allocate and initialize one of these structures when we create | |
120 | the gdbarch object for a variant. | |
121 | ||
122 | At the moment, all the FR variants we support differ only in which | |
123 | registers are present; the portable code of GDB knows that | |
124 | registers whose names are the empty string don't exist, so the | |
125 | `register_names' array captures all the per-variant information we | |
126 | need. | |
127 | ||
128 | in the future, if we need to have per-variant maps for raw size, | |
129 | virtual type, etc., we should replace register_names with an array | |
130 | of structures, each of which gives all the necessary info for one | |
131 | register. Don't stick parallel arrays in here --- that's so | |
132 | Fortran. */ | |
133 | struct gdbarch_tdep | |
134 | { | |
135 | /* How many general-purpose registers does this variant have? */ | |
136 | int num_gprs; | |
137 | ||
138 | /* How many floating-point registers does this variant have? */ | |
139 | int num_fprs; | |
140 | ||
141 | /* How many hardware watchpoints can it support? */ | |
142 | int num_hw_watchpoints; | |
143 | ||
144 | /* How many hardware breakpoints can it support? */ | |
145 | int num_hw_breakpoints; | |
146 | ||
147 | /* Register names. */ | |
148 | char **register_names; | |
149 | }; | |
150 | ||
151 | #define CURRENT_VARIANT (gdbarch_tdep (current_gdbarch)) | |
152 | ||
153 | ||
154 | /* Allocate a new variant structure, and set up default values for all | |
155 | the fields. */ | |
156 | static struct gdbarch_tdep * | |
5ae5f592 | 157 | new_variant (void) |
456f8b9d DB |
158 | { |
159 | struct gdbarch_tdep *var; | |
160 | int r; | |
161 | char buf[20]; | |
162 | ||
163 | var = xmalloc (sizeof (*var)); | |
164 | memset (var, 0, sizeof (*var)); | |
165 | ||
166 | var->num_gprs = 64; | |
167 | var->num_fprs = 64; | |
168 | var->num_hw_watchpoints = 0; | |
169 | var->num_hw_breakpoints = 0; | |
170 | ||
171 | /* By default, don't supply any general-purpose or floating-point | |
172 | register names. */ | |
6a748db6 KB |
173 | var->register_names |
174 | = (char **) xmalloc ((frv_num_regs + frv_num_pseudo_regs) | |
175 | * sizeof (char *)); | |
176 | for (r = 0; r < frv_num_regs + frv_num_pseudo_regs; r++) | |
456f8b9d DB |
177 | var->register_names[r] = ""; |
178 | ||
526eef89 | 179 | /* Do, however, supply default names for the known special-purpose |
456f8b9d | 180 | registers. */ |
456f8b9d DB |
181 | |
182 | var->register_names[pc_regnum] = "pc"; | |
183 | var->register_names[lr_regnum] = "lr"; | |
184 | var->register_names[lcr_regnum] = "lcr"; | |
185 | ||
186 | var->register_names[psr_regnum] = "psr"; | |
187 | var->register_names[ccr_regnum] = "ccr"; | |
188 | var->register_names[cccr_regnum] = "cccr"; | |
189 | var->register_names[tbr_regnum] = "tbr"; | |
190 | ||
191 | /* Debug registers. */ | |
192 | var->register_names[brr_regnum] = "brr"; | |
193 | var->register_names[dbar0_regnum] = "dbar0"; | |
194 | var->register_names[dbar1_regnum] = "dbar1"; | |
195 | var->register_names[dbar2_regnum] = "dbar2"; | |
196 | var->register_names[dbar3_regnum] = "dbar3"; | |
197 | ||
526eef89 KB |
198 | /* iacc0 (Only found on MB93405.) */ |
199 | var->register_names[iacc0h_regnum] = "iacc0h"; | |
200 | var->register_names[iacc0l_regnum] = "iacc0l"; | |
6a748db6 | 201 | var->register_names[iacc0_regnum] = "iacc0"; |
526eef89 | 202 | |
456f8b9d DB |
203 | return var; |
204 | } | |
205 | ||
206 | ||
207 | /* Indicate that the variant VAR has NUM_GPRS general-purpose | |
208 | registers, and fill in the names array appropriately. */ | |
209 | static void | |
210 | set_variant_num_gprs (struct gdbarch_tdep *var, int num_gprs) | |
211 | { | |
212 | int r; | |
213 | ||
214 | var->num_gprs = num_gprs; | |
215 | ||
216 | for (r = 0; r < num_gprs; ++r) | |
217 | { | |
218 | char buf[20]; | |
219 | ||
220 | sprintf (buf, "gr%d", r); | |
221 | var->register_names[first_gpr_regnum + r] = xstrdup (buf); | |
222 | } | |
223 | } | |
224 | ||
225 | ||
226 | /* Indicate that the variant VAR has NUM_FPRS floating-point | |
227 | registers, and fill in the names array appropriately. */ | |
228 | static void | |
229 | set_variant_num_fprs (struct gdbarch_tdep *var, int num_fprs) | |
230 | { | |
231 | int r; | |
232 | ||
233 | var->num_fprs = num_fprs; | |
234 | ||
235 | for (r = 0; r < num_fprs; ++r) | |
236 | { | |
237 | char buf[20]; | |
238 | ||
239 | sprintf (buf, "fr%d", r); | |
240 | var->register_names[first_fpr_regnum + r] = xstrdup (buf); | |
241 | } | |
242 | } | |
243 | ||
244 | ||
245 | static const char * | |
246 | frv_register_name (int reg) | |
247 | { | |
248 | if (reg < 0) | |
249 | return "?toosmall?"; | |
6a748db6 | 250 | if (reg >= frv_num_regs + frv_num_pseudo_regs) |
456f8b9d DB |
251 | return "?toolarge?"; |
252 | ||
253 | return CURRENT_VARIANT->register_names[reg]; | |
254 | } | |
255 | ||
526eef89 | 256 | |
456f8b9d | 257 | static struct type * |
7f398216 | 258 | frv_register_type (struct gdbarch *gdbarch, int reg) |
456f8b9d | 259 | { |
526eef89 | 260 | if (reg >= first_fpr_regnum && reg <= last_fpr_regnum) |
456f8b9d | 261 | return builtin_type_float; |
6a748db6 KB |
262 | else if (reg == iacc0_regnum) |
263 | return builtin_type_int64; | |
456f8b9d | 264 | else |
526eef89 | 265 | return builtin_type_int32; |
456f8b9d DB |
266 | } |
267 | ||
6a748db6 KB |
268 | static void |
269 | frv_pseudo_register_read (struct gdbarch *gdbarch, struct regcache *regcache, | |
270 | int reg, void *buffer) | |
271 | { | |
272 | if (reg == iacc0_regnum) | |
273 | { | |
274 | regcache_raw_read (regcache, iacc0h_regnum, buffer); | |
275 | regcache_raw_read (regcache, iacc0l_regnum, (bfd_byte *) buffer + 4); | |
276 | } | |
277 | } | |
278 | ||
279 | static void | |
280 | frv_pseudo_register_write (struct gdbarch *gdbarch, struct regcache *regcache, | |
281 | int reg, const void *buffer) | |
282 | { | |
283 | if (reg == iacc0_regnum) | |
284 | { | |
285 | regcache_raw_write (regcache, iacc0h_regnum, buffer); | |
286 | regcache_raw_write (regcache, iacc0l_regnum, (bfd_byte *) buffer + 4); | |
287 | } | |
288 | } | |
289 | ||
526eef89 KB |
290 | static int |
291 | frv_register_sim_regno (int reg) | |
292 | { | |
293 | static const int spr_map[] = | |
294 | { | |
295 | H_SPR_PSR, /* psr_regnum */ | |
296 | H_SPR_CCR, /* ccr_regnum */ | |
297 | H_SPR_CCCR, /* cccr_regnum */ | |
298 | -1, /* 132 */ | |
299 | -1, /* 133 */ | |
300 | -1, /* 134 */ | |
301 | H_SPR_TBR, /* tbr_regnum */ | |
302 | H_SPR_BRR, /* brr_regnum */ | |
303 | H_SPR_DBAR0, /* dbar0_regnum */ | |
304 | H_SPR_DBAR1, /* dbar1_regnum */ | |
305 | H_SPR_DBAR2, /* dbar2_regnum */ | |
306 | H_SPR_DBAR3, /* dbar3_regnum */ | |
307 | -1, /* 141 */ | |
308 | -1, /* 142 */ | |
309 | -1, /* 143 */ | |
310 | -1, /* 144 */ | |
311 | H_SPR_LR, /* lr_regnum */ | |
312 | H_SPR_LCR, /* lcr_regnum */ | |
313 | H_SPR_IACC0H, /* iacc0h_regnum */ | |
314 | H_SPR_IACC0L /* iacc0l_regnum */ | |
315 | }; | |
316 | ||
317 | gdb_assert (reg >= 0 && reg < NUM_REGS); | |
318 | ||
319 | if (first_gpr_regnum <= reg && reg <= last_gpr_regnum) | |
320 | return reg - first_gpr_regnum + SIM_FRV_GR0_REGNUM; | |
321 | else if (first_fpr_regnum <= reg && reg <= last_fpr_regnum) | |
322 | return reg - first_fpr_regnum + SIM_FRV_FR0_REGNUM; | |
323 | else if (pc_regnum == reg) | |
324 | return SIM_FRV_PC_REGNUM; | |
325 | else if (reg >= first_spr_regnum | |
326 | && reg < first_spr_regnum + sizeof (spr_map) / sizeof (spr_map[0])) | |
327 | { | |
328 | int spr_reg_offset = spr_map[reg - first_spr_regnum]; | |
329 | ||
330 | if (spr_reg_offset < 0) | |
331 | return SIM_REGNO_DOES_NOT_EXIST; | |
332 | else | |
333 | return SIM_FRV_SPR0_REGNUM + spr_reg_offset; | |
334 | } | |
335 | ||
336 | internal_error (__FILE__, __LINE__, "Bad register number %d", reg); | |
337 | } | |
338 | ||
456f8b9d DB |
339 | static const unsigned char * |
340 | frv_breakpoint_from_pc (CORE_ADDR *pcptr, int *lenp) | |
341 | { | |
342 | static unsigned char breakpoint[] = {0xc0, 0x70, 0x00, 0x01}; | |
343 | *lenp = sizeof (breakpoint); | |
344 | return breakpoint; | |
345 | } | |
346 | ||
46a16dba KB |
347 | /* Define the maximum number of instructions which may be packed into a |
348 | bundle (VLIW instruction). */ | |
349 | static const int max_instrs_per_bundle = 8; | |
350 | ||
351 | /* Define the size (in bytes) of an FR-V instruction. */ | |
352 | static const int frv_instr_size = 4; | |
353 | ||
354 | /* Adjust a breakpoint's address to account for the FR-V architecture's | |
355 | constraint that a break instruction must not appear as any but the | |
356 | first instruction in the bundle. */ | |
357 | static CORE_ADDR | |
358 | frv_gdbarch_adjust_breakpoint_address (struct gdbarch *gdbarch, CORE_ADDR bpaddr) | |
359 | { | |
360 | int count = max_instrs_per_bundle; | |
361 | CORE_ADDR addr = bpaddr - frv_instr_size; | |
362 | CORE_ADDR func_start = get_pc_function_start (bpaddr); | |
363 | ||
364 | /* Find the end of the previous packing sequence. This will be indicated | |
365 | by either attempting to access some inaccessible memory or by finding | |
366 | an instruction word whose packing bit is set to one. */ | |
367 | while (count-- > 0 && addr >= func_start) | |
368 | { | |
369 | char instr[frv_instr_size]; | |
370 | int status; | |
371 | ||
372 | status = read_memory_nobpt (addr, instr, sizeof instr); | |
373 | ||
374 | if (status != 0) | |
375 | break; | |
376 | ||
377 | /* This is a big endian architecture, so byte zero will have most | |
378 | significant byte. The most significant bit of this byte is the | |
379 | packing bit. */ | |
380 | if (instr[0] & 0x80) | |
381 | break; | |
382 | ||
383 | addr -= frv_instr_size; | |
384 | } | |
385 | ||
386 | if (count > 0) | |
387 | bpaddr = addr + frv_instr_size; | |
388 | ||
389 | return bpaddr; | |
390 | } | |
391 | ||
456f8b9d DB |
392 | |
393 | /* Return true if REG is a caller-saves ("scratch") register, | |
394 | false otherwise. */ | |
395 | static int | |
396 | is_caller_saves_reg (int reg) | |
397 | { | |
398 | return ((4 <= reg && reg <= 7) | |
399 | || (14 <= reg && reg <= 15) | |
400 | || (32 <= reg && reg <= 47)); | |
401 | } | |
402 | ||
403 | ||
404 | /* Return true if REG is a callee-saves register, false otherwise. */ | |
405 | static int | |
406 | is_callee_saves_reg (int reg) | |
407 | { | |
408 | return ((16 <= reg && reg <= 31) | |
409 | || (48 <= reg && reg <= 63)); | |
410 | } | |
411 | ||
412 | ||
413 | /* Return true if REG is an argument register, false otherwise. */ | |
414 | static int | |
415 | is_argument_reg (int reg) | |
416 | { | |
417 | return (8 <= reg && reg <= 13); | |
418 | } | |
419 | ||
d40fcd7b KB |
420 | /* Given PC at the function's start address, attempt to find the |
421 | prologue end using SAL information. Return zero if the skip fails. | |
422 | ||
423 | A non-optimized prologue traditionally has one SAL for the function | |
424 | and a second for the function body. A single line function has | |
425 | them both pointing at the same line. | |
426 | ||
427 | An optimized prologue is similar but the prologue may contain | |
428 | instructions (SALs) from the instruction body. Need to skip those | |
429 | while not getting into the function body. | |
430 | ||
431 | The functions end point and an increasing SAL line are used as | |
432 | indicators of the prologue's endpoint. | |
433 | ||
434 | This code is based on the function refine_prologue_limit (versions | |
435 | found in both ia64 and ppc). */ | |
436 | ||
437 | static CORE_ADDR | |
438 | skip_prologue_using_sal (CORE_ADDR func_addr) | |
439 | { | |
440 | struct symtab_and_line prologue_sal; | |
441 | CORE_ADDR start_pc; | |
442 | CORE_ADDR end_pc; | |
443 | ||
444 | /* Get an initial range for the function. */ | |
445 | find_pc_partial_function (func_addr, NULL, &start_pc, &end_pc); | |
446 | start_pc += FUNCTION_START_OFFSET; | |
447 | ||
448 | prologue_sal = find_pc_line (start_pc, 0); | |
449 | if (prologue_sal.line != 0) | |
450 | { | |
451 | while (prologue_sal.end < end_pc) | |
452 | { | |
453 | struct symtab_and_line sal; | |
454 | ||
455 | sal = find_pc_line (prologue_sal.end, 0); | |
456 | if (sal.line == 0) | |
457 | break; | |
458 | /* Assume that a consecutive SAL for the same (or larger) | |
459 | line mark the prologue -> body transition. */ | |
460 | if (sal.line >= prologue_sal.line) | |
461 | break; | |
462 | /* The case in which compiler's optimizer/scheduler has | |
463 | moved instructions into the prologue. We look ahead in | |
464 | the function looking for address ranges whose | |
465 | corresponding line number is less the first one that we | |
466 | found for the function. This is more conservative then | |
467 | refine_prologue_limit which scans a large number of SALs | |
468 | looking for any in the prologue */ | |
469 | prologue_sal = sal; | |
470 | } | |
471 | } | |
472 | return prologue_sal.end; | |
473 | } | |
474 | ||
456f8b9d DB |
475 | |
476 | /* Scan an FR-V prologue, starting at PC, until frame->PC. | |
477 | If FRAME is non-zero, fill in its saved_regs with appropriate addresses. | |
478 | We assume FRAME's saved_regs array has already been allocated and cleared. | |
479 | Return the first PC value after the prologue. | |
480 | ||
481 | Note that, for unoptimized code, we almost don't need this function | |
482 | at all; all arguments and locals live on the stack, so we just need | |
483 | the FP to find everything. The catch: structures passed by value | |
484 | have their addresses living in registers; they're never spilled to | |
485 | the stack. So if you ever want to be able to get to these | |
486 | arguments in any frame but the top, you'll need to do this serious | |
487 | prologue analysis. */ | |
488 | static CORE_ADDR | |
1cb761c7 KB |
489 | frv_analyze_prologue (CORE_ADDR pc, struct frame_info *next_frame, |
490 | struct frv_unwind_cache *info) | |
456f8b9d DB |
491 | { |
492 | /* When writing out instruction bitpatterns, we use the following | |
493 | letters to label instruction fields: | |
494 | P - The parallel bit. We don't use this. | |
495 | J - The register number of GRj in the instruction description. | |
496 | K - The register number of GRk in the instruction description. | |
497 | I - The register number of GRi. | |
498 | S - a signed imediate offset. | |
499 | U - an unsigned immediate offset. | |
500 | ||
501 | The dots below the numbers indicate where hex digit boundaries | |
502 | fall, to make it easier to check the numbers. */ | |
503 | ||
504 | /* Non-zero iff we've seen the instruction that initializes the | |
505 | frame pointer for this function's frame. */ | |
506 | int fp_set = 0; | |
507 | ||
508 | /* If fp_set is non_zero, then this is the distance from | |
509 | the stack pointer to frame pointer: fp = sp + fp_offset. */ | |
510 | int fp_offset = 0; | |
511 | ||
512 | /* Total size of frame prior to any alloca operations. */ | |
513 | int framesize = 0; | |
514 | ||
1cb761c7 KB |
515 | /* Flag indicating if lr has been saved on the stack. */ |
516 | int lr_saved_on_stack = 0; | |
517 | ||
456f8b9d DB |
518 | /* The number of the general-purpose register we saved the return |
519 | address ("link register") in, or -1 if we haven't moved it yet. */ | |
520 | int lr_save_reg = -1; | |
521 | ||
1cb761c7 KB |
522 | /* Offset (from sp) at which lr has been saved on the stack. */ |
523 | ||
524 | int lr_sp_offset = 0; | |
456f8b9d DB |
525 | |
526 | /* If gr_saved[i] is non-zero, then we've noticed that general | |
527 | register i has been saved at gr_sp_offset[i] from the stack | |
528 | pointer. */ | |
529 | char gr_saved[64]; | |
530 | int gr_sp_offset[64]; | |
531 | ||
d40fcd7b KB |
532 | /* The address of the most recently scanned prologue instruction. */ |
533 | CORE_ADDR last_prologue_pc; | |
534 | ||
535 | /* The address of the next instruction. */ | |
536 | CORE_ADDR next_pc; | |
537 | ||
538 | /* The upper bound to of the pc values to scan. */ | |
539 | CORE_ADDR lim_pc; | |
540 | ||
456f8b9d DB |
541 | memset (gr_saved, 0, sizeof (gr_saved)); |
542 | ||
d40fcd7b KB |
543 | last_prologue_pc = pc; |
544 | ||
545 | /* Try to compute an upper limit (on how far to scan) based on the | |
546 | line number info. */ | |
547 | lim_pc = skip_prologue_using_sal (pc); | |
548 | /* If there's no line number info, lim_pc will be 0. In that case, | |
549 | set the limit to be 100 instructions away from pc. Hopefully, this | |
550 | will be far enough away to account for the entire prologue. Don't | |
551 | worry about overshooting the end of the function. The scan loop | |
552 | below contains some checks to avoid scanning unreasonably far. */ | |
553 | if (lim_pc == 0) | |
554 | lim_pc = pc + 400; | |
555 | ||
556 | /* If we have a frame, we don't want to scan past the frame's pc. This | |
557 | will catch those cases where the pc is in the prologue. */ | |
558 | if (next_frame) | |
559 | { | |
560 | CORE_ADDR frame_pc = frame_pc_unwind (next_frame); | |
561 | if (frame_pc < lim_pc) | |
562 | lim_pc = frame_pc; | |
563 | } | |
564 | ||
565 | /* Scan the prologue. */ | |
566 | while (pc < lim_pc) | |
456f8b9d DB |
567 | { |
568 | LONGEST op = read_memory_integer (pc, 4); | |
d40fcd7b | 569 | next_pc = pc + 4; |
456f8b9d DB |
570 | |
571 | /* The tests in this chain of ifs should be in order of | |
572 | decreasing selectivity, so that more particular patterns get | |
573 | to fire before less particular patterns. */ | |
574 | ||
d40fcd7b KB |
575 | /* Some sort of control transfer instruction: stop scanning prologue. |
576 | Integer Conditional Branch: | |
577 | X XXXX XX 0000110 XX XXXXXXXXXXXXXXXX | |
578 | Floating-point / media Conditional Branch: | |
579 | X XXXX XX 0000111 XX XXXXXXXXXXXXXXXX | |
580 | LCR Conditional Branch to LR | |
581 | X XXXX XX 0001110 XX XX 001 X XXXXXXXXXX | |
582 | Integer conditional Branches to LR | |
583 | X XXXX XX 0001110 XX XX 010 X XXXXXXXXXX | |
584 | X XXXX XX 0001110 XX XX 011 X XXXXXXXXXX | |
585 | Floating-point/Media Branches to LR | |
586 | X XXXX XX 0001110 XX XX 110 X XXXXXXXXXX | |
587 | X XXXX XX 0001110 XX XX 111 X XXXXXXXXXX | |
588 | Jump and Link | |
589 | X XXXXX X 0001100 XXXXXX XXXXXX XXXXXX | |
590 | X XXXXX X 0001101 XXXXXX XXXXXX XXXXXX | |
591 | Call | |
592 | X XXXXXX 0001111 XXXXXXXXXXXXXXXXXX | |
593 | Return from Trap | |
594 | X XXXXX X 0000101 XXXXXX XXXXXX XXXXXX | |
595 | Integer Conditional Trap | |
596 | X XXXX XX 0000100 XXXXXX XXXX 00 XXXXXX | |
597 | X XXXX XX 0011100 XXXXXX XXXXXXXXXXXX | |
598 | Floating-point /media Conditional Trap | |
599 | X XXXX XX 0000100 XXXXXX XXXX 01 XXXXXX | |
600 | X XXXX XX 0011101 XXXXXX XXXXXXXXXXXX | |
601 | Break | |
602 | X XXXX XX 0000100 XXXXXX XXXX 11 XXXXXX | |
603 | Media Trap | |
604 | X XXXX XX 0000100 XXXXXX XXXX 10 XXXXXX */ | |
605 | if ((op & 0x01d80000) == 0x00180000 /* Conditional branches and Call */ | |
606 | || (op & 0x01f80000) == 0x00300000 /* Jump and Link */ | |
607 | || (op & 0x01f80000) == 0x00100000 /* Return from Trap, Trap */ | |
608 | || (op & 0x01f80000) == 0x00700000) /* Trap immediate */ | |
609 | { | |
610 | /* Stop scanning; not in prologue any longer. */ | |
611 | break; | |
612 | } | |
613 | ||
614 | /* Loading something from memory into fp probably means that | |
615 | we're in the epilogue. Stop scanning the prologue. | |
616 | ld @(GRi, GRk), fp | |
617 | X 000010 0000010 XXXXXX 000100 XXXXXX | |
618 | ldi @(GRi, d12), fp | |
619 | X 000010 0110010 XXXXXX XXXXXXXXXXXX */ | |
620 | else if ((op & 0x7ffc0fc0) == 0x04080100 | |
621 | || (op & 0x7ffc0000) == 0x04c80000) | |
622 | { | |
623 | break; | |
624 | } | |
625 | ||
456f8b9d DB |
626 | /* Setting the FP from the SP: |
627 | ori sp, 0, fp | |
628 | P 000010 0100010 000001 000000000000 = 0x04881000 | |
629 | 0 111111 1111111 111111 111111111111 = 0x7fffffff | |
630 | . . . . . . . . | |
631 | We treat this as part of the prologue. */ | |
d40fcd7b | 632 | else if ((op & 0x7fffffff) == 0x04881000) |
456f8b9d DB |
633 | { |
634 | fp_set = 1; | |
635 | fp_offset = 0; | |
d40fcd7b | 636 | last_prologue_pc = next_pc; |
456f8b9d DB |
637 | } |
638 | ||
639 | /* Move the link register to the scratch register grJ, before saving: | |
640 | movsg lr, grJ | |
641 | P 000100 0000011 010000 000111 JJJJJJ = 0x080d01c0 | |
642 | 0 111111 1111111 111111 111111 000000 = 0x7fffffc0 | |
643 | . . . . . . . . | |
644 | We treat this as part of the prologue. */ | |
645 | else if ((op & 0x7fffffc0) == 0x080d01c0) | |
646 | { | |
647 | int gr_j = op & 0x3f; | |
648 | ||
649 | /* If we're moving it to a scratch register, that's fine. */ | |
650 | if (is_caller_saves_reg (gr_j)) | |
d40fcd7b KB |
651 | { |
652 | lr_save_reg = gr_j; | |
653 | last_prologue_pc = next_pc; | |
654 | } | |
456f8b9d DB |
655 | } |
656 | ||
657 | /* To save multiple callee-saves registers on the stack, at | |
658 | offset zero: | |
659 | ||
660 | std grK,@(sp,gr0) | |
661 | P KKKKKK 0000011 000001 000011 000000 = 0x000c10c0 | |
662 | 0 000000 1111111 111111 111111 111111 = 0x01ffffff | |
663 | ||
664 | stq grK,@(sp,gr0) | |
665 | P KKKKKK 0000011 000001 000100 000000 = 0x000c1100 | |
666 | 0 000000 1111111 111111 111111 111111 = 0x01ffffff | |
667 | . . . . . . . . | |
668 | We treat this as part of the prologue, and record the register's | |
669 | saved address in the frame structure. */ | |
670 | else if ((op & 0x01ffffff) == 0x000c10c0 | |
671 | || (op & 0x01ffffff) == 0x000c1100) | |
672 | { | |
673 | int gr_k = ((op >> 25) & 0x3f); | |
674 | int ope = ((op >> 6) & 0x3f); | |
675 | int count; | |
676 | int i; | |
677 | ||
678 | /* Is it an std or an stq? */ | |
679 | if (ope == 0x03) | |
680 | count = 2; | |
681 | else | |
682 | count = 4; | |
683 | ||
684 | /* Is it really a callee-saves register? */ | |
685 | if (is_callee_saves_reg (gr_k)) | |
686 | { | |
687 | for (i = 0; i < count; i++) | |
688 | { | |
689 | gr_saved[gr_k + i] = 1; | |
690 | gr_sp_offset[gr_k + i] = 4 * i; | |
691 | } | |
d40fcd7b | 692 | last_prologue_pc = next_pc; |
456f8b9d | 693 | } |
456f8b9d DB |
694 | } |
695 | ||
696 | /* Adjusting the stack pointer. (The stack pointer is GR1.) | |
697 | addi sp, S, sp | |
698 | P 000001 0010000 000001 SSSSSSSSSSSS = 0x02401000 | |
699 | 0 111111 1111111 111111 000000000000 = 0x7ffff000 | |
700 | . . . . . . . . | |
701 | We treat this as part of the prologue. */ | |
702 | else if ((op & 0x7ffff000) == 0x02401000) | |
703 | { | |
d40fcd7b KB |
704 | if (framesize == 0) |
705 | { | |
706 | /* Sign-extend the twelve-bit field. | |
707 | (Isn't there a better way to do this?) */ | |
708 | int s = (((op & 0xfff) - 0x800) & 0xfff) - 0x800; | |
456f8b9d | 709 | |
d40fcd7b KB |
710 | framesize -= s; |
711 | last_prologue_pc = pc; | |
712 | } | |
713 | else | |
714 | { | |
715 | /* If the prologue is being adjusted again, we've | |
716 | likely gone too far; i.e. we're probably in the | |
717 | epilogue. */ | |
718 | break; | |
719 | } | |
456f8b9d DB |
720 | } |
721 | ||
722 | /* Setting the FP to a constant distance from the SP: | |
723 | addi sp, S, fp | |
724 | P 000010 0010000 000001 SSSSSSSSSSSS = 0x04401000 | |
725 | 0 111111 1111111 111111 000000000000 = 0x7ffff000 | |
726 | . . . . . . . . | |
727 | We treat this as part of the prologue. */ | |
728 | else if ((op & 0x7ffff000) == 0x04401000) | |
729 | { | |
730 | /* Sign-extend the twelve-bit field. | |
731 | (Isn't there a better way to do this?) */ | |
732 | int s = (((op & 0xfff) - 0x800) & 0xfff) - 0x800; | |
733 | fp_set = 1; | |
734 | fp_offset = s; | |
d40fcd7b | 735 | last_prologue_pc = pc; |
456f8b9d DB |
736 | } |
737 | ||
738 | /* To spill an argument register to a scratch register: | |
739 | ori GRi, 0, GRk | |
740 | P KKKKKK 0100010 IIIIII 000000000000 = 0x00880000 | |
741 | 0 000000 1111111 000000 111111111111 = 0x01fc0fff | |
742 | . . . . . . . . | |
743 | For the time being, we treat this as a prologue instruction, | |
744 | assuming that GRi is an argument register. This one's kind | |
745 | of suspicious, because it seems like it could be part of a | |
746 | legitimate body instruction. But we only come here when the | |
747 | source info wasn't helpful, so we have to do the best we can. | |
748 | Hopefully once GCC and GDB agree on how to emit line number | |
749 | info for prologues, then this code will never come into play. */ | |
750 | else if ((op & 0x01fc0fff) == 0x00880000) | |
751 | { | |
752 | int gr_i = ((op >> 12) & 0x3f); | |
753 | ||
d40fcd7b KB |
754 | /* Make sure that the source is an arg register; if it is, we'll |
755 | treat it as a prologue instruction. */ | |
756 | if (is_argument_reg (gr_i)) | |
757 | last_prologue_pc = next_pc; | |
456f8b9d DB |
758 | } |
759 | ||
760 | /* To spill 16-bit values to the stack: | |
761 | sthi GRk, @(fp, s) | |
762 | P KKKKKK 1010001 000010 SSSSSSSSSSSS = 0x01442000 | |
763 | 0 000000 1111111 111111 000000000000 = 0x01fff000 | |
764 | . . . . . . . . | |
765 | And for 8-bit values, we use STB instructions. | |
766 | stbi GRk, @(fp, s) | |
767 | P KKKKKK 1010000 000010 SSSSSSSSSSSS = 0x01402000 | |
768 | 0 000000 1111111 111111 000000000000 = 0x01fff000 | |
769 | . . . . . . . . | |
770 | We check that GRk is really an argument register, and treat | |
771 | all such as part of the prologue. */ | |
772 | else if ( (op & 0x01fff000) == 0x01442000 | |
773 | || (op & 0x01fff000) == 0x01402000) | |
774 | { | |
775 | int gr_k = ((op >> 25) & 0x3f); | |
776 | ||
d40fcd7b KB |
777 | /* Make sure that GRk is really an argument register; treat |
778 | it as a prologue instruction if so. */ | |
779 | if (is_argument_reg (gr_k)) | |
780 | last_prologue_pc = next_pc; | |
456f8b9d DB |
781 | } |
782 | ||
783 | /* To save multiple callee-saves register on the stack, at a | |
784 | non-zero offset: | |
785 | ||
786 | stdi GRk, @(sp, s) | |
787 | P KKKKKK 1010011 000001 SSSSSSSSSSSS = 0x014c1000 | |
788 | 0 000000 1111111 111111 000000000000 = 0x01fff000 | |
789 | . . . . . . . . | |
790 | stqi GRk, @(sp, s) | |
791 | P KKKKKK 1010100 000001 SSSSSSSSSSSS = 0x01501000 | |
792 | 0 000000 1111111 111111 000000000000 = 0x01fff000 | |
793 | . . . . . . . . | |
794 | We treat this as part of the prologue, and record the register's | |
795 | saved address in the frame structure. */ | |
796 | else if ((op & 0x01fff000) == 0x014c1000 | |
797 | || (op & 0x01fff000) == 0x01501000) | |
798 | { | |
799 | int gr_k = ((op >> 25) & 0x3f); | |
800 | int count; | |
801 | int i; | |
802 | ||
803 | /* Is it a stdi or a stqi? */ | |
804 | if ((op & 0x01fff000) == 0x014c1000) | |
805 | count = 2; | |
806 | else | |
807 | count = 4; | |
808 | ||
809 | /* Is it really a callee-saves register? */ | |
810 | if (is_callee_saves_reg (gr_k)) | |
811 | { | |
812 | /* Sign-extend the twelve-bit field. | |
813 | (Isn't there a better way to do this?) */ | |
814 | int s = (((op & 0xfff) - 0x800) & 0xfff) - 0x800; | |
815 | ||
816 | for (i = 0; i < count; i++) | |
817 | { | |
818 | gr_saved[gr_k + i] = 1; | |
819 | gr_sp_offset[gr_k + i] = s + (4 * i); | |
820 | } | |
d40fcd7b | 821 | last_prologue_pc = next_pc; |
456f8b9d | 822 | } |
456f8b9d DB |
823 | } |
824 | ||
825 | /* Storing any kind of integer register at any constant offset | |
826 | from any other register. | |
827 | ||
828 | st GRk, @(GRi, gr0) | |
829 | P KKKKKK 0000011 IIIIII 000010 000000 = 0x000c0080 | |
830 | 0 000000 1111111 000000 111111 111111 = 0x01fc0fff | |
831 | . . . . . . . . | |
832 | sti GRk, @(GRi, d12) | |
833 | P KKKKKK 1010010 IIIIII SSSSSSSSSSSS = 0x01480000 | |
834 | 0 000000 1111111 000000 000000000000 = 0x01fc0000 | |
835 | . . . . . . . . | |
836 | These could be almost anything, but a lot of prologue | |
837 | instructions fall into this pattern, so let's decode the | |
838 | instruction once, and then work at a higher level. */ | |
839 | else if (((op & 0x01fc0fff) == 0x000c0080) | |
840 | || ((op & 0x01fc0000) == 0x01480000)) | |
841 | { | |
842 | int gr_k = ((op >> 25) & 0x3f); | |
843 | int gr_i = ((op >> 12) & 0x3f); | |
844 | int offset; | |
845 | ||
846 | /* Are we storing with gr0 as an offset, or using an | |
847 | immediate value? */ | |
848 | if ((op & 0x01fc0fff) == 0x000c0080) | |
849 | offset = 0; | |
850 | else | |
851 | offset = (((op & 0xfff) - 0x800) & 0xfff) - 0x800; | |
852 | ||
853 | /* If the address isn't relative to the SP or FP, it's not a | |
854 | prologue instruction. */ | |
855 | if (gr_i != sp_regnum && gr_i != fp_regnum) | |
d40fcd7b KB |
856 | { |
857 | /* Do nothing; not a prologue instruction. */ | |
858 | } | |
456f8b9d DB |
859 | |
860 | /* Saving the old FP in the new frame (relative to the SP). */ | |
d40fcd7b | 861 | else if (gr_k == fp_regnum && gr_i == sp_regnum) |
1cb761c7 KB |
862 | { |
863 | gr_saved[fp_regnum] = 1; | |
864 | gr_sp_offset[fp_regnum] = offset; | |
d40fcd7b | 865 | last_prologue_pc = next_pc; |
1cb761c7 | 866 | } |
456f8b9d DB |
867 | |
868 | /* Saving callee-saves register(s) on the stack, relative to | |
869 | the SP. */ | |
870 | else if (gr_i == sp_regnum | |
871 | && is_callee_saves_reg (gr_k)) | |
872 | { | |
873 | gr_saved[gr_k] = 1; | |
1cb761c7 KB |
874 | if (gr_i == sp_regnum) |
875 | gr_sp_offset[gr_k] = offset; | |
876 | else | |
877 | gr_sp_offset[gr_k] = offset + fp_offset; | |
d40fcd7b | 878 | last_prologue_pc = next_pc; |
456f8b9d DB |
879 | } |
880 | ||
881 | /* Saving the scratch register holding the return address. */ | |
882 | else if (lr_save_reg != -1 | |
883 | && gr_k == lr_save_reg) | |
1cb761c7 KB |
884 | { |
885 | lr_saved_on_stack = 1; | |
886 | if (gr_i == sp_regnum) | |
887 | lr_sp_offset = offset; | |
888 | else | |
889 | lr_sp_offset = offset + fp_offset; | |
d40fcd7b | 890 | last_prologue_pc = next_pc; |
1cb761c7 | 891 | } |
456f8b9d DB |
892 | |
893 | /* Spilling int-sized arguments to the stack. */ | |
894 | else if (is_argument_reg (gr_k)) | |
d40fcd7b | 895 | last_prologue_pc = next_pc; |
456f8b9d | 896 | } |
d40fcd7b | 897 | pc = next_pc; |
456f8b9d DB |
898 | } |
899 | ||
1cb761c7 | 900 | if (next_frame && info) |
456f8b9d | 901 | { |
1cb761c7 KB |
902 | int i; |
903 | ULONGEST this_base; | |
456f8b9d DB |
904 | |
905 | /* If we know the relationship between the stack and frame | |
906 | pointers, record the addresses of the registers we noticed. | |
907 | Note that we have to do this as a separate step at the end, | |
908 | because instructions may save relative to the SP, but we need | |
909 | their addresses relative to the FP. */ | |
910 | if (fp_set) | |
1cb761c7 KB |
911 | frame_unwind_unsigned_register (next_frame, fp_regnum, &this_base); |
912 | else | |
913 | frame_unwind_unsigned_register (next_frame, sp_regnum, &this_base); | |
456f8b9d | 914 | |
1cb761c7 KB |
915 | for (i = 0; i < 64; i++) |
916 | if (gr_saved[i]) | |
917 | info->saved_regs[i].addr = this_base - fp_offset + gr_sp_offset[i]; | |
456f8b9d | 918 | |
1cb761c7 KB |
919 | info->prev_sp = this_base - fp_offset + framesize; |
920 | info->base = this_base; | |
921 | ||
922 | /* If LR was saved on the stack, record its location. */ | |
923 | if (lr_saved_on_stack) | |
924 | info->saved_regs[lr_regnum].addr = this_base - fp_offset + lr_sp_offset; | |
925 | ||
926 | /* The call instruction moves the caller's PC in the callee's LR. | |
927 | Since this is an unwind, do the reverse. Copy the location of LR | |
928 | into PC (the address / regnum) so that a request for PC will be | |
929 | converted into a request for the LR. */ | |
930 | info->saved_regs[pc_regnum] = info->saved_regs[lr_regnum]; | |
931 | ||
932 | /* Save the previous frame's computed SP value. */ | |
933 | trad_frame_set_value (info->saved_regs, sp_regnum, info->prev_sp); | |
456f8b9d DB |
934 | } |
935 | ||
d40fcd7b | 936 | return last_prologue_pc; |
456f8b9d DB |
937 | } |
938 | ||
939 | ||
940 | static CORE_ADDR | |
941 | frv_skip_prologue (CORE_ADDR pc) | |
942 | { | |
943 | CORE_ADDR func_addr, func_end, new_pc; | |
944 | ||
945 | new_pc = pc; | |
946 | ||
947 | /* If the line table has entry for a line *within* the function | |
948 | (i.e., not in the prologue, and not past the end), then that's | |
949 | our location. */ | |
950 | if (find_pc_partial_function (pc, NULL, &func_addr, &func_end)) | |
951 | { | |
952 | struct symtab_and_line sal; | |
953 | ||
954 | sal = find_pc_line (func_addr, 0); | |
955 | ||
956 | if (sal.line != 0 && sal.end < func_end) | |
957 | { | |
958 | new_pc = sal.end; | |
959 | } | |
960 | } | |
961 | ||
962 | /* The FR-V prologue is at least five instructions long (twenty bytes). | |
963 | If we didn't find a real source location past that, then | |
964 | do a full analysis of the prologue. */ | |
965 | if (new_pc < pc + 20) | |
1cb761c7 | 966 | new_pc = frv_analyze_prologue (pc, 0, 0); |
456f8b9d DB |
967 | |
968 | return new_pc; | |
969 | } | |
970 | ||
1cb761c7 KB |
971 | |
972 | static struct frv_unwind_cache * | |
973 | frv_frame_unwind_cache (struct frame_info *next_frame, | |
974 | void **this_prologue_cache) | |
456f8b9d | 975 | { |
1cb761c7 KB |
976 | struct gdbarch *gdbarch = get_frame_arch (next_frame); |
977 | CORE_ADDR pc; | |
978 | ULONGEST prev_sp; | |
979 | ULONGEST this_base; | |
980 | struct frv_unwind_cache *info; | |
8baa6f92 | 981 | |
1cb761c7 KB |
982 | if ((*this_prologue_cache)) |
983 | return (*this_prologue_cache); | |
456f8b9d | 984 | |
1cb761c7 KB |
985 | info = FRAME_OBSTACK_ZALLOC (struct frv_unwind_cache); |
986 | (*this_prologue_cache) = info; | |
987 | info->saved_regs = trad_frame_alloc_saved_regs (next_frame); | |
456f8b9d | 988 | |
1cb761c7 KB |
989 | /* Prologue analysis does the rest... */ |
990 | frv_analyze_prologue (frame_func_unwind (next_frame), next_frame, info); | |
456f8b9d | 991 | |
1cb761c7 | 992 | return info; |
456f8b9d DB |
993 | } |
994 | ||
456f8b9d | 995 | static void |
cd31fb03 KB |
996 | frv_extract_return_value (struct type *type, struct regcache *regcache, |
997 | void *valbuf) | |
456f8b9d | 998 | { |
cd31fb03 KB |
999 | int len = TYPE_LENGTH (type); |
1000 | ||
1001 | if (len <= 4) | |
1002 | { | |
1003 | ULONGEST gpr8_val; | |
1004 | regcache_cooked_read_unsigned (regcache, 8, &gpr8_val); | |
1005 | store_unsigned_integer (valbuf, len, gpr8_val); | |
1006 | } | |
1007 | else if (len == 8) | |
1008 | { | |
1009 | ULONGEST regval; | |
1010 | regcache_cooked_read_unsigned (regcache, 8, ®val); | |
1011 | store_unsigned_integer (valbuf, 4, regval); | |
1012 | regcache_cooked_read_unsigned (regcache, 9, ®val); | |
1013 | store_unsigned_integer ((bfd_byte *) valbuf + 4, 4, regval); | |
1014 | } | |
1015 | else | |
1016 | internal_error (__FILE__, __LINE__, "Illegal return value length: %d", len); | |
456f8b9d DB |
1017 | } |
1018 | ||
1019 | static CORE_ADDR | |
cd31fb03 | 1020 | frv_extract_struct_value_address (struct regcache *regcache) |
456f8b9d | 1021 | { |
cd31fb03 KB |
1022 | ULONGEST addr; |
1023 | regcache_cooked_read_unsigned (regcache, struct_return_regnum, &addr); | |
1024 | return addr; | |
456f8b9d DB |
1025 | } |
1026 | ||
1027 | static void | |
1028 | frv_store_struct_return (CORE_ADDR addr, CORE_ADDR sp) | |
1029 | { | |
1030 | write_register (struct_return_regnum, addr); | |
1031 | } | |
1032 | ||
1033 | static int | |
1034 | frv_frameless_function_invocation (struct frame_info *frame) | |
1035 | { | |
1036 | return frameless_look_for_prologue (frame); | |
1037 | } | |
1038 | ||
1cb761c7 KB |
1039 | static CORE_ADDR |
1040 | frv_frame_align (struct gdbarch *gdbarch, CORE_ADDR sp) | |
456f8b9d | 1041 | { |
1cb761c7 | 1042 | /* Require dword alignment. */ |
5b03f266 | 1043 | return align_down (sp, 8); |
456f8b9d DB |
1044 | } |
1045 | ||
456f8b9d | 1046 | static CORE_ADDR |
1cb761c7 KB |
1047 | frv_push_dummy_call (struct gdbarch *gdbarch, CORE_ADDR func_addr, |
1048 | struct regcache *regcache, CORE_ADDR bp_addr, | |
1049 | int nargs, struct value **args, CORE_ADDR sp, | |
1050 | int struct_return, CORE_ADDR struct_addr) | |
456f8b9d DB |
1051 | { |
1052 | int argreg; | |
1053 | int argnum; | |
1054 | char *val; | |
1055 | char valbuf[4]; | |
1056 | struct value *arg; | |
1057 | struct type *arg_type; | |
1058 | int len; | |
1059 | enum type_code typecode; | |
1060 | CORE_ADDR regval; | |
1061 | int stack_space; | |
1062 | int stack_offset; | |
1063 | ||
1064 | #if 0 | |
1065 | printf("Push %d args at sp = %x, struct_return=%d (%x)\n", | |
1066 | nargs, (int) sp, struct_return, struct_addr); | |
1067 | #endif | |
1068 | ||
1069 | stack_space = 0; | |
1070 | for (argnum = 0; argnum < nargs; ++argnum) | |
5b03f266 | 1071 | stack_space += align_up (TYPE_LENGTH (VALUE_TYPE (args[argnum])), 4); |
456f8b9d DB |
1072 | |
1073 | stack_space -= (6 * 4); | |
1074 | if (stack_space > 0) | |
1075 | sp -= stack_space; | |
1076 | ||
1077 | /* Make sure stack is dword aligned. */ | |
5b03f266 | 1078 | sp = align_down (sp, 8); |
456f8b9d DB |
1079 | |
1080 | stack_offset = 0; | |
1081 | ||
1082 | argreg = 8; | |
1083 | ||
1084 | if (struct_return) | |
1cb761c7 KB |
1085 | regcache_cooked_write_unsigned (regcache, struct_return_regnum, |
1086 | struct_addr); | |
456f8b9d DB |
1087 | |
1088 | for (argnum = 0; argnum < nargs; ++argnum) | |
1089 | { | |
1090 | arg = args[argnum]; | |
1091 | arg_type = check_typedef (VALUE_TYPE (arg)); | |
1092 | len = TYPE_LENGTH (arg_type); | |
1093 | typecode = TYPE_CODE (arg_type); | |
1094 | ||
1095 | if (typecode == TYPE_CODE_STRUCT || typecode == TYPE_CODE_UNION) | |
1096 | { | |
fbd9dcd3 | 1097 | store_unsigned_integer (valbuf, 4, VALUE_ADDRESS (arg)); |
456f8b9d DB |
1098 | typecode = TYPE_CODE_PTR; |
1099 | len = 4; | |
1100 | val = valbuf; | |
1101 | } | |
1102 | else | |
1103 | { | |
1104 | val = (char *) VALUE_CONTENTS (arg); | |
1105 | } | |
1106 | ||
1107 | while (len > 0) | |
1108 | { | |
1109 | int partial_len = (len < 4 ? len : 4); | |
1110 | ||
1111 | if (argreg < 14) | |
1112 | { | |
7c0b4a20 | 1113 | regval = extract_unsigned_integer (val, partial_len); |
456f8b9d DB |
1114 | #if 0 |
1115 | printf(" Argnum %d data %x -> reg %d\n", | |
1116 | argnum, (int) regval, argreg); | |
1117 | #endif | |
1cb761c7 | 1118 | regcache_cooked_write_unsigned (regcache, argreg, regval); |
456f8b9d DB |
1119 | ++argreg; |
1120 | } | |
1121 | else | |
1122 | { | |
1123 | #if 0 | |
1124 | printf(" Argnum %d data %x -> offset %d (%x)\n", | |
1125 | argnum, *((int *)val), stack_offset, (int) (sp + stack_offset)); | |
1126 | #endif | |
1127 | write_memory (sp + stack_offset, val, partial_len); | |
5b03f266 | 1128 | stack_offset += align_up (partial_len, 4); |
456f8b9d DB |
1129 | } |
1130 | len -= partial_len; | |
1131 | val += partial_len; | |
1132 | } | |
1133 | } | |
456f8b9d | 1134 | |
1cb761c7 KB |
1135 | /* Set the return address. For the frv, the return breakpoint is |
1136 | always at BP_ADDR. */ | |
1137 | regcache_cooked_write_unsigned (regcache, lr_regnum, bp_addr); | |
1138 | ||
1139 | /* Finally, update the SP register. */ | |
1140 | regcache_cooked_write_unsigned (regcache, sp_regnum, sp); | |
1141 | ||
456f8b9d DB |
1142 | return sp; |
1143 | } | |
1144 | ||
1145 | static void | |
cd31fb03 KB |
1146 | frv_store_return_value (struct type *type, struct regcache *regcache, |
1147 | const void *valbuf) | |
456f8b9d | 1148 | { |
cd31fb03 KB |
1149 | int len = TYPE_LENGTH (type); |
1150 | ||
1151 | if (len <= 4) | |
1152 | { | |
1153 | bfd_byte val[4]; | |
1154 | memset (val, 0, sizeof (val)); | |
1155 | memcpy (val + (4 - len), valbuf, len); | |
1156 | regcache_cooked_write (regcache, 8, val); | |
1157 | } | |
1158 | else if (len == 8) | |
1159 | { | |
1160 | regcache_cooked_write (regcache, 8, valbuf); | |
1161 | regcache_cooked_write (regcache, 9, (bfd_byte *) valbuf + 4); | |
1162 | } | |
456f8b9d DB |
1163 | else |
1164 | internal_error (__FILE__, __LINE__, | |
cd31fb03 | 1165 | "Don't know how to return a %d-byte value.", len); |
456f8b9d DB |
1166 | } |
1167 | ||
456f8b9d | 1168 | |
456f8b9d DB |
1169 | /* Hardware watchpoint / breakpoint support for the FR500 |
1170 | and FR400. */ | |
1171 | ||
1172 | int | |
1173 | frv_check_watch_resources (int type, int cnt, int ot) | |
1174 | { | |
1175 | struct gdbarch_tdep *var = CURRENT_VARIANT; | |
1176 | ||
1177 | /* Watchpoints not supported on simulator. */ | |
1178 | if (strcmp (target_shortname, "sim") == 0) | |
1179 | return 0; | |
1180 | ||
1181 | if (type == bp_hardware_breakpoint) | |
1182 | { | |
1183 | if (var->num_hw_breakpoints == 0) | |
1184 | return 0; | |
1185 | else if (cnt <= var->num_hw_breakpoints) | |
1186 | return 1; | |
1187 | } | |
1188 | else | |
1189 | { | |
1190 | if (var->num_hw_watchpoints == 0) | |
1191 | return 0; | |
1192 | else if (ot) | |
1193 | return -1; | |
1194 | else if (cnt <= var->num_hw_watchpoints) | |
1195 | return 1; | |
1196 | } | |
1197 | return -1; | |
1198 | } | |
1199 | ||
1200 | ||
1201 | CORE_ADDR | |
5ae5f592 | 1202 | frv_stopped_data_address (void) |
456f8b9d DB |
1203 | { |
1204 | CORE_ADDR brr, dbar0, dbar1, dbar2, dbar3; | |
1205 | ||
1206 | brr = read_register (brr_regnum); | |
1207 | dbar0 = read_register (dbar0_regnum); | |
1208 | dbar1 = read_register (dbar1_regnum); | |
1209 | dbar2 = read_register (dbar2_regnum); | |
1210 | dbar3 = read_register (dbar3_regnum); | |
1211 | ||
1212 | if (brr & (1<<11)) | |
1213 | return dbar0; | |
1214 | else if (brr & (1<<10)) | |
1215 | return dbar1; | |
1216 | else if (brr & (1<<9)) | |
1217 | return dbar2; | |
1218 | else if (brr & (1<<8)) | |
1219 | return dbar3; | |
1220 | else | |
1221 | return 0; | |
1222 | } | |
1223 | ||
1cb761c7 KB |
1224 | static CORE_ADDR |
1225 | frv_unwind_pc (struct gdbarch *gdbarch, struct frame_info *next_frame) | |
1226 | { | |
1227 | return frame_unwind_register_unsigned (next_frame, pc_regnum); | |
1228 | } | |
1229 | ||
1230 | /* Given a GDB frame, determine the address of the calling function's | |
1231 | frame. This will be used to create a new GDB frame struct. */ | |
1232 | ||
1233 | static void | |
1234 | frv_frame_this_id (struct frame_info *next_frame, | |
1235 | void **this_prologue_cache, struct frame_id *this_id) | |
1236 | { | |
1237 | struct frv_unwind_cache *info | |
1238 | = frv_frame_unwind_cache (next_frame, this_prologue_cache); | |
1239 | CORE_ADDR base; | |
1240 | CORE_ADDR func; | |
1241 | struct minimal_symbol *msym_stack; | |
1242 | struct frame_id id; | |
1243 | ||
1244 | /* The FUNC is easy. */ | |
1245 | func = frame_func_unwind (next_frame); | |
1246 | ||
1cb761c7 KB |
1247 | /* Check if the stack is empty. */ |
1248 | msym_stack = lookup_minimal_symbol ("_stack", NULL, NULL); | |
1249 | if (msym_stack && info->base == SYMBOL_VALUE_ADDRESS (msym_stack)) | |
1250 | return; | |
1251 | ||
1252 | /* Hopefully the prologue analysis either correctly determined the | |
1253 | frame's base (which is the SP from the previous frame), or set | |
1254 | that base to "NULL". */ | |
1255 | base = info->prev_sp; | |
1256 | if (base == 0) | |
1257 | return; | |
1258 | ||
1259 | id = frame_id_build (base, func); | |
1260 | ||
1261 | /* Check that we're not going round in circles with the same frame | |
1262 | ID (but avoid applying the test to sentinel frames which do go | |
1263 | round in circles). Can't use frame_id_eq() as that doesn't yet | |
1264 | compare the frame's PC value. */ | |
1265 | if (frame_relative_level (next_frame) >= 0 | |
1266 | && get_frame_type (next_frame) != DUMMY_FRAME | |
1267 | && frame_id_eq (get_frame_id (next_frame), id)) | |
1268 | return; | |
1269 | ||
1270 | (*this_id) = id; | |
1271 | } | |
1272 | ||
1273 | static void | |
1274 | frv_frame_prev_register (struct frame_info *next_frame, | |
1275 | void **this_prologue_cache, | |
1276 | int regnum, int *optimizedp, | |
1277 | enum lval_type *lvalp, CORE_ADDR *addrp, | |
1278 | int *realnump, void *bufferp) | |
1279 | { | |
1280 | struct frv_unwind_cache *info | |
1281 | = frv_frame_unwind_cache (next_frame, this_prologue_cache); | |
1282 | trad_frame_prev_register (next_frame, info->saved_regs, regnum, | |
1283 | optimizedp, lvalp, addrp, realnump, bufferp); | |
1284 | } | |
1285 | ||
1286 | static const struct frame_unwind frv_frame_unwind = { | |
1287 | NORMAL_FRAME, | |
1288 | frv_frame_this_id, | |
1289 | frv_frame_prev_register | |
1290 | }; | |
1291 | ||
1292 | static const struct frame_unwind * | |
1293 | frv_frame_sniffer (struct frame_info *next_frame) | |
1294 | { | |
1295 | return &frv_frame_unwind; | |
1296 | } | |
1297 | ||
1298 | static CORE_ADDR | |
1299 | frv_frame_base_address (struct frame_info *next_frame, void **this_cache) | |
1300 | { | |
1301 | struct frv_unwind_cache *info | |
1302 | = frv_frame_unwind_cache (next_frame, this_cache); | |
1303 | return info->base; | |
1304 | } | |
1305 | ||
1306 | static const struct frame_base frv_frame_base = { | |
1307 | &frv_frame_unwind, | |
1308 | frv_frame_base_address, | |
1309 | frv_frame_base_address, | |
1310 | frv_frame_base_address | |
1311 | }; | |
1312 | ||
1313 | static CORE_ADDR | |
1314 | frv_unwind_sp (struct gdbarch *gdbarch, struct frame_info *next_frame) | |
1315 | { | |
1316 | return frame_unwind_register_unsigned (next_frame, sp_regnum); | |
1317 | } | |
1318 | ||
1319 | ||
1320 | /* Assuming NEXT_FRAME->prev is a dummy, return the frame ID of that | |
1321 | dummy frame. The frame ID's base needs to match the TOS value | |
1322 | saved by save_dummy_frame_tos(), and the PC match the dummy frame's | |
1323 | breakpoint. */ | |
1324 | ||
1325 | static struct frame_id | |
1326 | frv_unwind_dummy_id (struct gdbarch *gdbarch, struct frame_info *next_frame) | |
1327 | { | |
1328 | return frame_id_build (frv_unwind_sp (gdbarch, next_frame), | |
1329 | frame_pc_unwind (next_frame)); | |
1330 | } | |
1331 | ||
1332 | ||
456f8b9d DB |
1333 | static struct gdbarch * |
1334 | frv_gdbarch_init (struct gdbarch_info info, struct gdbarch_list *arches) | |
1335 | { | |
1336 | struct gdbarch *gdbarch; | |
1337 | struct gdbarch_tdep *var; | |
1338 | ||
1339 | /* Check to see if we've already built an appropriate architecture | |
1340 | object for this executable. */ | |
1341 | arches = gdbarch_list_lookup_by_info (arches, &info); | |
1342 | if (arches) | |
1343 | return arches->gdbarch; | |
1344 | ||
1345 | /* Select the right tdep structure for this variant. */ | |
1346 | var = new_variant (); | |
1347 | switch (info.bfd_arch_info->mach) | |
1348 | { | |
1349 | case bfd_mach_frv: | |
1350 | case bfd_mach_frvsimple: | |
1351 | case bfd_mach_fr500: | |
1352 | case bfd_mach_frvtomcat: | |
251a3ae3 | 1353 | case bfd_mach_fr550: |
456f8b9d DB |
1354 | set_variant_num_gprs (var, 64); |
1355 | set_variant_num_fprs (var, 64); | |
1356 | break; | |
1357 | ||
1358 | case bfd_mach_fr400: | |
1359 | set_variant_num_gprs (var, 32); | |
1360 | set_variant_num_fprs (var, 32); | |
1361 | break; | |
1362 | ||
1363 | default: | |
1364 | /* Never heard of this variant. */ | |
1365 | return 0; | |
1366 | } | |
1367 | ||
1368 | gdbarch = gdbarch_alloc (&info, var); | |
1369 | ||
1370 | set_gdbarch_short_bit (gdbarch, 16); | |
1371 | set_gdbarch_int_bit (gdbarch, 32); | |
1372 | set_gdbarch_long_bit (gdbarch, 32); | |
1373 | set_gdbarch_long_long_bit (gdbarch, 64); | |
1374 | set_gdbarch_float_bit (gdbarch, 32); | |
1375 | set_gdbarch_double_bit (gdbarch, 64); | |
1376 | set_gdbarch_long_double_bit (gdbarch, 64); | |
1377 | set_gdbarch_ptr_bit (gdbarch, 32); | |
1378 | ||
1379 | set_gdbarch_num_regs (gdbarch, frv_num_regs); | |
6a748db6 KB |
1380 | set_gdbarch_num_pseudo_regs (gdbarch, frv_num_pseudo_regs); |
1381 | ||
456f8b9d | 1382 | set_gdbarch_sp_regnum (gdbarch, sp_regnum); |
0ba6dca9 | 1383 | set_gdbarch_deprecated_fp_regnum (gdbarch, fp_regnum); |
456f8b9d DB |
1384 | set_gdbarch_pc_regnum (gdbarch, pc_regnum); |
1385 | ||
1386 | set_gdbarch_register_name (gdbarch, frv_register_name); | |
7f398216 | 1387 | set_gdbarch_register_type (gdbarch, frv_register_type); |
526eef89 | 1388 | set_gdbarch_register_sim_regno (gdbarch, frv_register_sim_regno); |
456f8b9d | 1389 | |
6a748db6 KB |
1390 | set_gdbarch_pseudo_register_read (gdbarch, frv_pseudo_register_read); |
1391 | set_gdbarch_pseudo_register_write (gdbarch, frv_pseudo_register_write); | |
1392 | ||
456f8b9d DB |
1393 | set_gdbarch_skip_prologue (gdbarch, frv_skip_prologue); |
1394 | set_gdbarch_breakpoint_from_pc (gdbarch, frv_breakpoint_from_pc); | |
46a16dba | 1395 | set_gdbarch_adjust_breakpoint_address (gdbarch, frv_gdbarch_adjust_breakpoint_address); |
456f8b9d | 1396 | |
456f8b9d DB |
1397 | set_gdbarch_frame_args_skip (gdbarch, 0); |
1398 | set_gdbarch_frameless_function_invocation (gdbarch, frv_frameless_function_invocation); | |
1399 | ||
1fd35568 | 1400 | set_gdbarch_use_struct_convention (gdbarch, always_use_struct_convention); |
cd31fb03 | 1401 | set_gdbarch_extract_return_value (gdbarch, frv_extract_return_value); |
456f8b9d | 1402 | |
4183d812 | 1403 | set_gdbarch_deprecated_store_struct_return (gdbarch, frv_store_struct_return); |
cd31fb03 KB |
1404 | set_gdbarch_store_return_value (gdbarch, frv_store_return_value); |
1405 | set_gdbarch_extract_struct_value_address (gdbarch, frv_extract_struct_value_address); | |
456f8b9d | 1406 | |
1cb761c7 KB |
1407 | /* Frame stuff. */ |
1408 | set_gdbarch_unwind_pc (gdbarch, frv_unwind_pc); | |
1409 | set_gdbarch_unwind_sp (gdbarch, frv_unwind_sp); | |
1410 | set_gdbarch_frame_align (gdbarch, frv_frame_align); | |
1411 | frame_unwind_append_sniffer (gdbarch, frv_frame_sniffer); | |
1412 | frame_base_set_default (gdbarch, &frv_frame_base); | |
456f8b9d | 1413 | |
1cb761c7 KB |
1414 | /* Settings for calling functions in the inferior. */ |
1415 | set_gdbarch_push_dummy_call (gdbarch, frv_push_dummy_call); | |
1416 | set_gdbarch_unwind_dummy_id (gdbarch, frv_unwind_dummy_id); | |
456f8b9d DB |
1417 | |
1418 | /* Settings that should be unnecessary. */ | |
1419 | set_gdbarch_inner_than (gdbarch, core_addr_lessthan); | |
1420 | ||
456f8b9d | 1421 | set_gdbarch_write_pc (gdbarch, generic_target_write_pc); |
456f8b9d | 1422 | |
456f8b9d | 1423 | set_gdbarch_remote_translate_xfer_address |
aed7f26a | 1424 | (gdbarch, generic_remote_translate_xfer_address); |
456f8b9d DB |
1425 | |
1426 | /* Hardware watchpoint / breakpoint support. */ | |
1427 | switch (info.bfd_arch_info->mach) | |
1428 | { | |
1429 | case bfd_mach_frv: | |
1430 | case bfd_mach_frvsimple: | |
1431 | case bfd_mach_fr500: | |
1432 | case bfd_mach_frvtomcat: | |
1433 | /* fr500-style hardware debugging support. */ | |
1434 | var->num_hw_watchpoints = 4; | |
1435 | var->num_hw_breakpoints = 4; | |
1436 | break; | |
1437 | ||
1438 | case bfd_mach_fr400: | |
1439 | /* fr400-style hardware debugging support. */ | |
1440 | var->num_hw_watchpoints = 2; | |
1441 | var->num_hw_breakpoints = 4; | |
1442 | break; | |
1443 | ||
1444 | default: | |
1445 | /* Otherwise, assume we don't have hardware debugging support. */ | |
1446 | var->num_hw_watchpoints = 0; | |
1447 | var->num_hw_breakpoints = 0; | |
1448 | break; | |
1449 | } | |
1450 | ||
36482093 AC |
1451 | set_gdbarch_print_insn (gdbarch, print_insn_frv); |
1452 | ||
456f8b9d DB |
1453 | return gdbarch; |
1454 | } | |
1455 | ||
1456 | void | |
1457 | _initialize_frv_tdep (void) | |
1458 | { | |
1459 | register_gdbarch_init (bfd_arch_frv, frv_gdbarch_init); | |
456f8b9d | 1460 | } |