1 /* Target-dependent code for the MIPS architecture, for GDB, the GNU Debugger.
2 Copyright 1988, 1989, 1990, 1991, 1992, 1993 Free Software Foundation, Inc.
3 Contributed by Alessandro Forin(af@cs.cmu.edu) at CMU
4 and by Per Bothner(bothner@cs.wisc.edu) at U.Wisconsin.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
33 #include "opcode/mips.h"
35 #define VM_MIN_ADDRESS (unsigned)0x400000
37 static int mips_in_lenient_prologue PARAMS ((CORE_ADDR, CORE_ADDR));
39 /* Some MIPS boards don't support floating point, so we permit the
40 user to turn it off. */
43 /* Heuristic_proc_start may hunt through the text section for a long
44 time across a 2400 baud serial line. Allows the user to limit this
46 static unsigned int heuristic_fence_post = 0;
48 #define PROC_LOW_ADDR(proc) ((proc)->pdr.adr) /* least address */
49 #define PROC_HIGH_ADDR(proc) ((proc)->pdr.iline) /* upper address bound */
50 #define PROC_FRAME_OFFSET(proc) ((proc)->pdr.frameoffset)
51 #define PROC_FRAME_REG(proc) ((proc)->pdr.framereg)
52 #define PROC_REG_MASK(proc) ((proc)->pdr.regmask)
53 #define PROC_FREG_MASK(proc) ((proc)->pdr.fregmask)
54 #define PROC_REG_OFFSET(proc) ((proc)->pdr.regoffset)
55 #define PROC_FREG_OFFSET(proc) ((proc)->pdr.fregoffset)
56 #define PROC_PC_REG(proc) ((proc)->pdr.pcreg)
57 #define PROC_SYMBOL(proc) (*(struct symbol**)&(proc)->pdr.isym)
58 #define _PROC_MAGIC_ 0x0F0F0F0F
59 #define PROC_DESC_IS_DUMMY(proc) ((proc)->pdr.isym == _PROC_MAGIC_)
60 #define SET_PROC_DESC_IS_DUMMY(proc) ((proc)->pdr.isym = _PROC_MAGIC_)
62 struct linked_proc_info
64 struct mips_extra_func_info info;
65 struct linked_proc_info *next;
66 } *linked_proc_desc_table = NULL;
69 #define READ_FRAME_REG(fi, regno) read_next_frame_reg((fi)->next, regno)
72 read_next_frame_reg(fi, regno)
76 /* If it is the frame for sigtramp we have a complete sigcontext
77 immediately below the frame and we get the saved registers from there.
78 If the stack layout for sigtramp changes we might have to change these
79 constants and the companion fixup_sigtramp in mipsread.c */
81 #define SIGFRAME_BASE 0x12c /* sizeof(sigcontext) */
82 #define SIGFRAME_PC_OFF (-SIGFRAME_BASE + 2 * 4)
83 #define SIGFRAME_REGSAVE_OFF (-SIGFRAME_BASE + 3 * 4)
85 for (; fi; fi = fi->next)
86 if (in_sigtramp(fi->pc, 0)) {
88 if (regno == PC_REGNUM) offset = SIGFRAME_PC_OFF;
89 else if (regno < 32) offset = SIGFRAME_REGSAVE_OFF + regno * 4;
91 return read_memory_integer(fi->frame + offset, 4);
93 else if (regno == SP_REGNUM) return fi->frame;
94 else if (fi->saved_regs->regs[regno])
95 return read_memory_integer(fi->saved_regs->regs[regno], 4);
96 return read_register(regno);
100 mips_frame_saved_pc(frame)
103 mips_extra_func_info_t proc_desc = frame->proc_desc;
104 int pcreg = proc_desc ? PROC_PC_REG(proc_desc) : RA_REGNUM;
106 if (proc_desc && PROC_DESC_IS_DUMMY(proc_desc))
107 return read_memory_integer(frame->frame - 4, 4);
109 return read_next_frame_reg(frame, pcreg);
112 static struct mips_extra_func_info temp_proc_desc;
113 static struct frame_saved_regs temp_saved_regs;
115 /* This fencepost looks highly suspicious to me. Removing it also
116 seems suspicious as it could affect remote debugging across serial
120 heuristic_proc_start(pc)
123 CORE_ADDR start_pc = pc;
124 CORE_ADDR fence = start_pc - heuristic_fence_post;
126 if (start_pc == 0) return 0;
128 if (heuristic_fence_post == UINT_MAX
129 || fence < VM_MIN_ADDRESS)
130 fence = VM_MIN_ADDRESS;
132 /* search back for previous return */
133 for (start_pc -= 4; ; start_pc -= 4)
134 if (start_pc < fence)
136 /* It's not clear to me why we reach this point when
137 stop_soon_quietly, but with this test, at least we
138 don't print out warnings for every child forked (eg, on
139 decstation). 22apr93 rich@cygnus.com. */
140 if (!stop_soon_quietly)
142 static int blurb_printed = 0;
144 if (fence == VM_MIN_ADDRESS)
145 warning("Hit beginning of text section without finding");
147 warning("Hit heuristic-fence-post without finding");
149 warning("enclosing function for address 0x%x", pc);
153 This warning occurs if you are debugging a function without any symbols\n\
154 (for example, in a stripped executable). In that case, you may wish to\n\
155 increase the size of the search with the `set heuristic-fence-post' command.\n\
157 Otherwise, you told GDB there was a function where there isn't one, or\n\
158 (more likely) you have encountered a bug in GDB.\n");
165 else if (ABOUT_TO_RETURN(start_pc))
168 start_pc += 8; /* skip return, and its delay slot */
170 /* skip nops (usually 1) 0 - is this */
171 while (start_pc < pc && read_memory_integer (start_pc, 4) == 0)
177 static mips_extra_func_info_t
178 heuristic_proc_desc(start_pc, limit_pc, next_frame)
179 CORE_ADDR start_pc, limit_pc;
182 CORE_ADDR sp = next_frame ? next_frame->frame : read_register (SP_REGNUM);
185 int has_frame_reg = 0;
186 int reg30; /* Value of $r30. Used by gcc for frame-pointer */
187 unsigned long reg_mask = 0;
189 if (start_pc == 0) return NULL;
190 bzero(&temp_proc_desc, sizeof(temp_proc_desc));
191 bzero(&temp_saved_regs, sizeof(struct frame_saved_regs));
192 PROC_LOW_ADDR(&temp_proc_desc) = start_pc;
194 if (start_pc + 200 < limit_pc) limit_pc = start_pc + 200;
197 for (cur_pc = start_pc; cur_pc < limit_pc; cur_pc += 4) {
202 status = read_memory_nobpt (cur_pc, buf, 4);
203 if (status) memory_error (status, cur_pc);
204 word = extract_unsigned_integer (buf, 4);
206 if ((word & 0xFFFF0000) == 0x27bd0000) /* addiu $sp,$sp,-i */
207 frame_size += (-word) & 0xFFFF;
208 else if ((word & 0xFFFF0000) == 0x23bd0000) /* addu $sp,$sp,-i */
209 frame_size += (-word) & 0xFFFF;
210 else if ((word & 0xFFE00000) == 0xafa00000) { /* sw reg,offset($sp) */
211 int reg = (word & 0x001F0000) >> 16;
212 reg_mask |= 1 << reg;
213 temp_saved_regs.regs[reg] = sp + (short)word;
215 else if ((word & 0xFFFF0000) == 0x27be0000) { /* addiu $30,$sp,size */
216 if ((unsigned short)word != frame_size)
217 reg30 = sp + (unsigned short)word;
218 else if (!has_frame_reg) {
221 reg30 = read_next_frame_reg(next_frame, 30);
222 alloca_adjust = reg30 - (sp + (unsigned short)word);
223 if (alloca_adjust > 0) {
224 /* FP > SP + frame_size. This may be because
225 /* of an alloca or somethings similar.
226 * Fix sp to "pre-alloca" value, and try again.
233 else if ((word & 0xFFE00000) == 0xafc00000) { /* sw reg,offset($30) */
234 int reg = (word & 0x001F0000) >> 16;
235 reg_mask |= 1 << reg;
236 temp_saved_regs.regs[reg] = reg30 + (short)word;
240 PROC_FRAME_REG(&temp_proc_desc) = 30;
241 PROC_FRAME_OFFSET(&temp_proc_desc) = 0;
244 PROC_FRAME_REG(&temp_proc_desc) = SP_REGNUM;
245 PROC_FRAME_OFFSET(&temp_proc_desc) = frame_size;
247 PROC_REG_MASK(&temp_proc_desc) = reg_mask;
248 PROC_PC_REG(&temp_proc_desc) = RA_REGNUM;
249 return &temp_proc_desc;
252 static mips_extra_func_info_t
253 find_proc_desc(pc, next_frame)
257 mips_extra_func_info_t proc_desc;
258 struct block *b = block_for_pc(pc);
260 b ? lookup_symbol(MIPS_EFI_SYMBOL_NAME, b, LABEL_NAMESPACE, 0, NULL) : NULL;
264 /* IF this is the topmost frame AND
265 * (this proc does not have debugging information OR
266 * the PC is in the procedure prologue)
267 * THEN create a "heuristic" proc_desc (by analyzing
268 * the actual code) to replace the "official" proc_desc.
270 proc_desc = (mips_extra_func_info_t)SYMBOL_VALUE(sym);
271 if (next_frame == NULL) {
272 struct symtab_and_line val;
273 struct symbol *proc_symbol =
274 PROC_DESC_IS_DUMMY(proc_desc) ? 0 : PROC_SYMBOL(proc_desc);
277 val = find_pc_line (BLOCK_START
278 (SYMBOL_BLOCK_VALUE(proc_symbol)),
280 val.pc = val.end ? val.end : pc;
282 if (!proc_symbol || pc < val.pc) {
283 mips_extra_func_info_t found_heuristic =
284 heuristic_proc_desc(PROC_LOW_ADDR(proc_desc),
286 if (found_heuristic) proc_desc = found_heuristic;
292 /* Is linked_proc_desc_table really necessary? It only seems to be used
293 by procedure call dummys. However, the procedures being called ought
294 to have their own proc_descs, and even if they don't,
295 heuristic_proc_desc knows how to create them! */
297 register struct linked_proc_info *link;
298 for (link = linked_proc_desc_table; link; link = link->next)
299 if (PROC_LOW_ADDR(&link->info) <= pc
300 && PROC_HIGH_ADDR(&link->info) > pc)
304 heuristic_proc_desc (heuristic_proc_start (pc), pc, next_frame);
309 mips_extra_func_info_t cached_proc_desc;
312 mips_frame_chain(frame)
315 mips_extra_func_info_t proc_desc;
316 CORE_ADDR saved_pc = FRAME_SAVED_PC(frame);
318 if (saved_pc == 0 || inside_entry_file (saved_pc))
321 proc_desc = find_proc_desc(saved_pc, frame);
325 cached_proc_desc = proc_desc;
326 return read_next_frame_reg(frame, PROC_FRAME_REG(proc_desc))
327 + PROC_FRAME_OFFSET(proc_desc);
331 init_extra_frame_info(fci)
332 struct frame_info *fci;
334 extern struct obstack frame_cache_obstack;
335 /* Use proc_desc calculated in frame_chain */
336 mips_extra_func_info_t proc_desc =
337 fci->next ? cached_proc_desc : find_proc_desc(fci->pc, fci->next);
339 fci->saved_regs = (struct frame_saved_regs*)
340 obstack_alloc (&frame_cache_obstack, sizeof(struct frame_saved_regs));
341 memset (fci->saved_regs, 0, sizeof (struct frame_saved_regs));
343 proc_desc == &temp_proc_desc ? 0 : proc_desc;
347 CORE_ADDR reg_position;
349 /* r0 bit means kernel trap */
350 int kernel_trap = PROC_REG_MASK(proc_desc) & 1;
352 /* Fixup frame-pointer - only needed for top frame */
353 /* This may not be quite right, if proc has a real frame register */
354 if (fci->pc == PROC_LOW_ADDR(proc_desc) && !PROC_DESC_IS_DUMMY(proc_desc))
355 fci->frame = read_register (SP_REGNUM);
357 fci->frame = READ_FRAME_REG(fci, PROC_FRAME_REG(proc_desc))
358 + PROC_FRAME_OFFSET(proc_desc);
360 /* If this is the innermost frame, and we are still in the
361 prologue (loosely defined), then the registers may not have
362 been saved yet. But they haven't been clobbered either, so
363 it's fine to say they have not been saved. */
364 if (fci->next == NULL
365 && mips_in_lenient_prologue (PROC_LOW_ADDR (proc_desc), fci->pc))
366 /* We already zeroed the saved regs. */
368 else if (proc_desc == &temp_proc_desc)
369 *fci->saved_regs = temp_saved_regs;
372 /* find which general-purpose registers were saved */
373 reg_position = fci->frame + PROC_REG_OFFSET(proc_desc);
374 mask = kernel_trap ? 0xFFFFFFFF : PROC_REG_MASK(proc_desc);
375 for (ireg= 31; mask; --ireg, mask <<= 1)
376 if (mask & 0x80000000)
378 fci->saved_regs->regs[ireg] = reg_position;
381 /* find which floating-point registers were saved */
382 reg_position = fci->frame + PROC_FREG_OFFSET(proc_desc);
384 /* The freg_offset points to where the first *double* register
385 is saved. So skip to the high-order word. */
387 mask = kernel_trap ? 0xFFFFFFFF : PROC_FREG_MASK(proc_desc);
388 for (ireg = 31; mask; --ireg, mask <<= 1)
389 if (mask & 0x80000000)
391 fci->saved_regs->regs[FP0_REGNUM+ireg] = reg_position;
396 /* hack: if argument regs are saved, guess these contain args */
397 if ((PROC_REG_MASK(proc_desc) & 0xF0) == 0) fci->num_args = -1;
398 else if ((PROC_REG_MASK(proc_desc) & 0x80) == 0) fci->num_args = 4;
399 else if ((PROC_REG_MASK(proc_desc) & 0x40) == 0) fci->num_args = 3;
400 else if ((PROC_REG_MASK(proc_desc) & 0x20) == 0) fci->num_args = 2;
401 else if ((PROC_REG_MASK(proc_desc) & 0x10) == 0) fci->num_args = 1;
403 fci->saved_regs->regs[PC_REGNUM] = fci->saved_regs->regs[RA_REGNUM];
407 /* MIPS stack frames are almost impenetrable. When execution stops,
408 we basically have to look at symbol information for the function
409 that we stopped in, which tells us *which* register (if any) is
410 the base of the frame pointer, and what offset from that register
411 the frame itself is at.
413 This presents a problem when trying to examine a stack in memory
414 (that isn't executing at the moment), using the "frame" command. We
415 don't have a PC, nor do we have any registers except SP.
417 This routine takes two arguments, SP and PC, and tries to make the
418 cached frames look as if these two arguments defined a frame on the
419 cache. This allows the rest of info frame to extract the important
420 arguments without difficulty. */
423 setup_arbitrary_frame (argc, argv)
428 error ("MIPS frame specifications require two arguments: sp and pc");
430 return create_new_frame (argv[0], argv[1]);
435 mips_push_arguments(nargs, args, sp, struct_return, struct_addr)
440 CORE_ADDR struct_addr;
444 int accumulate_size = struct_return ? 4 : 0;
445 struct mips_arg { char *contents; int len; int offset; };
446 struct mips_arg *mips_args =
447 (struct mips_arg*)alloca(nargs * sizeof(struct mips_arg));
448 register struct mips_arg *m_arg;
449 for (i = 0, m_arg = mips_args; i < nargs; i++, m_arg++) {
450 extern value value_arg_coerce();
451 value arg = value_arg_coerce (args[i]);
452 m_arg->len = TYPE_LENGTH (VALUE_TYPE (arg));
453 /* This entire mips-specific routine is because doubles must be aligned
454 * on 8-byte boundaries. It still isn't quite right, because MIPS decided
455 * to align 'struct {int a, b}' on 4-byte boundaries (even though this
456 * breaks their varargs implementation...). A correct solution
457 * requires an simulation of gcc's 'alignof' (and use of 'alignof'
458 * in stdarg.h/varargs.h).
460 if (m_arg->len > 4) accumulate_size = (accumulate_size + 7) & -8;
461 m_arg->offset = accumulate_size;
462 accumulate_size = (accumulate_size + m_arg->len + 3) & -4;
463 m_arg->contents = VALUE_CONTENTS(arg);
465 accumulate_size = (accumulate_size + 7) & (-8);
466 if (accumulate_size < 16) accumulate_size = 16;
467 sp -= accumulate_size;
468 for (i = nargs; m_arg--, --i >= 0; )
469 write_memory(sp + m_arg->offset, m_arg->contents, m_arg->len);
472 write_memory(sp, (char *)&buf, sizeof(CORE_ADDR));
477 /* MASK(i,j) == (1<<i) + (1<<(i+1)) + ... + (1<<j)). Assume i<=j<31. */
478 #define MASK(i,j) ((1 << (j)+1)-1 ^ (1 << (i))-1)
481 mips_push_dummy_frame()
484 struct linked_proc_info *link = (struct linked_proc_info*)
485 xmalloc(sizeof(struct linked_proc_info));
486 mips_extra_func_info_t proc_desc = &link->info;
487 CORE_ADDR sp = read_register (SP_REGNUM);
488 CORE_ADDR save_address;
489 REGISTER_TYPE buffer;
490 link->next = linked_proc_desc_table;
491 linked_proc_desc_table = link;
492 #define PUSH_FP_REGNUM 16 /* must be a register preserved across calls */
493 #define GEN_REG_SAVE_MASK MASK(1,16)|MASK(24,28)|(1<<31)
494 #define GEN_REG_SAVE_COUNT 22
495 #define FLOAT_REG_SAVE_MASK MASK(0,19)
496 #define FLOAT_REG_SAVE_COUNT 20
497 #define SPECIAL_REG_SAVE_COUNT 4
499 * The registers we must save are all those not preserved across
500 * procedure calls. Dest_Reg (see tm-mips.h) must also be saved.
501 * In addition, we must save the PC, and PUSH_FP_REGNUM.
502 * (Ideally, we should also save MDLO/-HI and FP Control/Status reg.)
504 * Dummy frame layout:
507 * Saved MMHI, MMLO, FPC_CSR
512 * Saved D18 (i.e. F19, F18)
514 * Saved D0 (i.e. F1, F0)
515 * CALL_DUMMY (subroutine stub; see tm-mips.h)
516 * Parameter build area (not yet implemented)
519 PROC_REG_MASK(proc_desc) = GEN_REG_SAVE_MASK;
520 PROC_FREG_MASK(proc_desc) = mips_fpu ? FLOAT_REG_SAVE_MASK : 0;
521 PROC_REG_OFFSET(proc_desc) = /* offset of (Saved R31) from FP */
522 -sizeof(long) - 4 * SPECIAL_REG_SAVE_COUNT;
523 PROC_FREG_OFFSET(proc_desc) = /* offset of (Saved D18) from FP */
524 -sizeof(double) - 4 * (SPECIAL_REG_SAVE_COUNT + GEN_REG_SAVE_COUNT);
525 /* save general registers */
526 save_address = sp + PROC_REG_OFFSET(proc_desc);
527 for (ireg = 32; --ireg >= 0; )
528 if (PROC_REG_MASK(proc_desc) & (1 << ireg))
530 buffer = read_register (ireg);
531 write_memory (save_address, (char *)&buffer, sizeof(REGISTER_TYPE));
534 /* save floating-points registers starting with high order word */
535 save_address = sp + PROC_FREG_OFFSET(proc_desc) + 4;
536 for (ireg = 32; --ireg >= 0; )
537 if (PROC_FREG_MASK(proc_desc) & (1 << ireg))
539 buffer = read_register (ireg + FP0_REGNUM);
540 write_memory (save_address, (char *)&buffer, 4);
543 write_register (PUSH_FP_REGNUM, sp);
544 PROC_FRAME_REG(proc_desc) = PUSH_FP_REGNUM;
545 PROC_FRAME_OFFSET(proc_desc) = 0;
546 buffer = read_register (PC_REGNUM);
547 write_memory (sp - 4, (char *)&buffer, sizeof(REGISTER_TYPE));
548 buffer = read_register (HI_REGNUM);
549 write_memory (sp - 8, (char *)&buffer, sizeof(REGISTER_TYPE));
550 buffer = read_register (LO_REGNUM);
551 write_memory (sp - 12, (char *)&buffer, sizeof(REGISTER_TYPE));
552 buffer = read_register (mips_fpu ? FCRCS_REGNUM : ZERO_REGNUM);
553 write_memory (sp - 16, (char *)&buffer, sizeof(REGISTER_TYPE));
554 sp -= 4 * (GEN_REG_SAVE_COUNT
555 + (mips_fpu ? FLOAT_REG_SAVE_COUNT : 0)
556 + SPECIAL_REG_SAVE_COUNT);
557 write_register (SP_REGNUM, sp);
558 PROC_LOW_ADDR(proc_desc) = sp - CALL_DUMMY_SIZE + CALL_DUMMY_START_OFFSET;
559 PROC_HIGH_ADDR(proc_desc) = sp;
560 SET_PROC_DESC_IS_DUMMY(proc_desc);
561 PROC_PC_REG(proc_desc) = RA_REGNUM;
568 FRAME frame = get_current_frame ();
569 CORE_ADDR new_sp = frame->frame;
571 mips_extra_func_info_t proc_desc = frame->proc_desc;
573 write_register (PC_REGNUM, FRAME_SAVED_PC(frame));
576 for (regnum = 32; --regnum >= 0; )
577 if (PROC_REG_MASK(proc_desc) & (1 << regnum))
578 write_register (regnum,
579 read_memory_integer (frame->saved_regs->regs[regnum],
581 for (regnum = 32; --regnum >= 0; )
582 if (PROC_FREG_MASK(proc_desc) & (1 << regnum))
583 write_register (regnum + FP0_REGNUM,
584 read_memory_integer (frame->saved_regs->regs[regnum + FP0_REGNUM], 4));
586 write_register (SP_REGNUM, new_sp);
587 flush_cached_frames ();
588 /* We let mips_init_extra_frame_info figure out the frame pointer */
589 set_current_frame (create_new_frame (0, read_pc ()));
591 if (PROC_DESC_IS_DUMMY(proc_desc))
593 struct linked_proc_info *pi_ptr, *prev_ptr;
595 for (pi_ptr = linked_proc_desc_table, prev_ptr = NULL;
597 prev_ptr = pi_ptr, pi_ptr = pi_ptr->next)
599 if (&pi_ptr->info == proc_desc)
604 error ("Can't locate dummy extra frame info\n");
606 if (prev_ptr != NULL)
607 prev_ptr->next = pi_ptr->next;
609 linked_proc_desc_table = pi_ptr->next;
613 write_register (HI_REGNUM, read_memory_integer(new_sp - 8, 4));
614 write_register (LO_REGNUM, read_memory_integer(new_sp - 12, 4));
616 write_register (FCRCS_REGNUM, read_memory_integer(new_sp - 16, 4));
621 mips_print_register (regnum, all)
624 unsigned char raw_buffer[MAX_REGISTER_RAW_SIZE];
627 /* Get the data in raw format. */
628 if (read_relative_register_raw_bytes (regnum, raw_buffer))
630 printf_filtered ("%s: [Invalid]", reg_names[regnum]);
634 /* If an even floating pointer register, also print as double. */
635 if (regnum >= FP0_REGNUM && regnum < FP0_REGNUM+32
636 && !((regnum-FP0_REGNUM) & 1)) {
637 char dbuffer[MAX_REGISTER_RAW_SIZE];
639 read_relative_register_raw_bytes (regnum, dbuffer);
640 read_relative_register_raw_bytes (regnum+1, dbuffer+4);
641 #ifdef REGISTER_CONVERT_TO_TYPE
642 REGISTER_CONVERT_TO_TYPE(regnum, builtin_type_double, dbuffer);
644 printf_filtered ("(d%d: ", regnum-FP0_REGNUM);
645 val_print (builtin_type_double, dbuffer, 0,
646 stdout, 0, 1, 0, Val_pretty_default);
647 printf_filtered ("); ");
649 fputs_filtered (reg_names[regnum], stdout);
650 #ifndef NUMERIC_REG_NAMES
652 printf_filtered ("(r%d): ", regnum);
655 printf_filtered (": ");
657 /* If virtual format is floating, print it that way. */
658 if (TYPE_CODE (REGISTER_VIRTUAL_TYPE (regnum)) == TYPE_CODE_FLT
659 && ! INVALID_FLOAT (raw_buffer, REGISTER_VIRTUAL_SIZE(regnum))) {
660 val_print (REGISTER_VIRTUAL_TYPE (regnum), raw_buffer, 0,
661 stdout, 0, 1, 0, Val_pretty_default);
663 /* Else print as integer in hex. */
668 val = extract_signed_integer (raw_buffer,
669 REGISTER_RAW_SIZE (regnum));
672 printf_filtered ("0");
674 printf_filtered (local_hex_format(), val);
676 printf_filtered ("%s=%d", local_hex_string(val), val);
680 /* Replacement for generic do_registers_info. */
682 mips_do_registers_info (regnum, fpregs)
687 mips_print_register (regnum, 0);
688 printf_filtered ("\n");
691 for (regnum = 0; regnum < NUM_REGS; ) {
692 if ((!fpregs) && regnum >= FP0_REGNUM && regnum <= FCRIR_REGNUM) {
696 mips_print_register (regnum, 1);
698 if ((regnum & 3) == 0 || regnum == NUM_REGS)
699 printf_filtered (";\n");
701 printf_filtered ("; ");
705 /* Return number of args passed to a frame. described by FIP.
706 Can return -1, meaning no way to tell. */
709 mips_frame_num_args(fip)
713 struct chain_info_t *p;
715 p = mips_find_cached_frame(FRAME_FP(fip));
717 return p->the_info.numargs;
722 /* Does this instruction involve use of a delay slot? */
728 for (i = 0; i < NUMOPCODES; ++i)
729 if (mips_opcodes[i].pinfo != INSN_MACRO
730 && (insn & mips_opcodes[i].mask) == mips_opcodes[i].match)
732 return i < NUMOPCODES && (mips_opcodes[i].pinfo & ANY_DELAY);
735 /* To skip prologues, I use this predicate. Returns either PC itself
736 if the code at PC does not look like a function prologue; otherwise
737 returns an address that (if we're lucky) follows the prologue. If
738 LENIENT, then we must skip everything which is involved in setting
739 up the frame (it's OK to skip more, just so long as we don't skip
740 anything which might clobber the registers which are being saved.
741 We must skip more in the case where part of the prologue is in the
742 delay slot of a non-prologue instruction). */
745 mips_skip_prologue (pc, lenient)
753 int seen_sp_adjust = 0;
755 /* Skip the typical prologue instructions. These are the stack adjustment
756 instruction and the instructions that save registers on the stack
757 or in the gcc frame. */
758 for (offset = 0; offset < 100; offset += 4)
763 status = read_memory_nobpt (pc + offset, buf, 4);
765 memory_error (status, pc + offset);
766 inst = extract_unsigned_integer (buf, 4);
768 if (lenient && is_delayed (inst))
771 if ((inst & 0xffff0000) == 0x27bd0000) /* addiu $sp,$sp,offset */
773 else if ((inst & 0xFFE00000) == 0xAFA00000 && (inst & 0x001F0000))
774 continue; /* sw reg,n($sp) */
776 else if ((inst & 0xFFE00000) == 0xE7A00000) /* swc1 freg,n($sp) */
778 else if ((inst & 0xF3E00000) == 0xA3C00000 && (inst & 0x001F0000))
780 continue; /* reg != $zero */
781 else if (inst == 0x03A0F021) /* move $s8,$sp */
783 else if ((inst & 0xFF9F07FF) == 0x00800021) /* move reg,$a0-$a3 */
790 /* FIXME schauer. The following code seems no longer necessary if we
791 always skip the typical prologue instructions. */
797 /* Well, it looks like a frameless. Let's make sure.
798 Note that we are not called on the current PC,
799 but on the function`s start PC, and I have definitely
800 seen optimized code that adjusts the SP quite later */
801 b = block_for_pc(pc);
804 f = lookup_symbol(MIPS_EFI_SYMBOL_NAME, b, LABEL_NAMESPACE, 0, NULL);
806 /* Ideally, I would like to use the adjusted info
807 from mips_frame_info(), but for all practical
808 purposes it will not matter (and it would require
809 a different definition of SKIP_PROLOGUE())
811 Actually, it would not hurt to skip the storing
812 of arguments on the stack as well. */
813 if (((mips_extra_func_info_t)SYMBOL_VALUE(f))->pdr.frameoffset)
820 /* Is address PC in the prologue (loosely defined) for function at
824 mips_in_lenient_prologue (startaddr, pc)
828 CORE_ADDR end_prologue = mips_skip_prologue (startaddr, 1);
829 return pc >= startaddr && pc < end_prologue;
832 /* Given a return value in `regbuf' with a type `valtype',
833 extract and copy its value into `valbuf'. */
835 mips_extract_return_value (valtype, regbuf, valbuf)
836 struct type *valtype;
837 char regbuf[REGISTER_BYTES];
842 regnum = TYPE_CODE (valtype) == TYPE_CODE_FLT && mips_fpu ? FP0_REGNUM : 2;
844 memcpy (valbuf, regbuf + REGISTER_BYTE (regnum), TYPE_LENGTH (valtype));
845 #ifdef REGISTER_CONVERT_TO_TYPE
846 REGISTER_CONVERT_TO_TYPE(regnum, valtype, valbuf);
850 /* Given a return value in `regbuf' with a type `valtype',
851 write it's value into the appropriate register. */
853 mips_store_return_value (valtype, valbuf)
854 struct type *valtype;
858 char raw_buffer[MAX_REGISTER_RAW_SIZE];
860 regnum = TYPE_CODE (valtype) == TYPE_CODE_FLT && mips_fpu ? FP0_REGNUM : 2;
861 memcpy(raw_buffer, valbuf, TYPE_LENGTH (valtype));
863 #ifdef REGISTER_CONVERT_FROM_TYPE
864 REGISTER_CONVERT_FROM_TYPE(regnum, valtype, raw_buffer);
867 write_register_bytes(REGISTER_BYTE (regnum), raw_buffer, TYPE_LENGTH (valtype));
870 /* Let the user turn off floating point and set the fence post for
871 heuristic_proc_start. */
874 _initialize_mips_tdep ()
877 (add_set_cmd ("mipsfpu", class_support, var_boolean,
879 "Set use of floating point coprocessor.\n\
880 Turn off to avoid using floating point instructions when calling functions\n\
881 or dealing with return values.", &setlist),
885 (add_set_cmd ("heuristic-fence-post", class_support, var_uinteger,
886 (char *) &heuristic_fence_post,
888 Set the distance searched for the start of a function.\n\
889 If you are debugging a stripped executable, GDB needs to search through the\n\
890 program for the start of a function. This command sets the distance of the\n\
891 search. The only need to set it is when debugging a stripped executable.",