* mips-tdep.c: include symfile.h and objfiles.h to fix
[deliverable/binutils-gdb.git] / gdb / mips-tdep.c
1 /* Target-dependent code for the MIPS architecture, for GDB, the GNU Debugger.
2 Copyright 1988, 1989, 1990, 1991, 1992 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.
5
6 This file is part of GDB.
7
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.
12
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.
17
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. */
21
22 #include "defs.h"
23 #include "frame.h"
24 #include "inferior.h"
25 #include "symtab.h"
26 #include "value.h"
27 #include "gdbcmd.h"
28 #include "language.h"
29
30 #ifdef USG
31 #include <sys/types.h>
32 #endif
33
34 #include <sys/param.h>
35 #include <sys/dir.h>
36 #include <signal.h>
37 #include <sys/ioctl.h>
38
39 #ifdef sgi
40 /* Must do it this way only for SGIs, as other mips platforms get their
41 JB_ symbols from machine/pcb.h (included via sys/user.h). */
42 #include <setjmp.h>
43 #endif
44
45 #include "gdbcore.h"
46 #include "symfile.h"
47 #include "objfiles.h"
48
49 #ifndef MIPSMAGIC
50 #ifdef MIPSEL
51 #define MIPSMAGIC MIPSELMAGIC
52 #else
53 #define MIPSMAGIC MIPSEBMAGIC
54 #endif
55 #endif
56
57 #define VM_MIN_ADDRESS (unsigned)0x400000
58
59 #include <sys/user.h> /* After a.out.h */
60 #include <sys/file.h>
61 #include <sys/stat.h>
62
63 \f
64 #define PROC_LOW_ADDR(proc) ((proc)->adr) /* least address */
65 #define PROC_HIGH_ADDR(proc) ((proc)->pad2) /* upper address bound */
66 #define PROC_FRAME_OFFSET(proc) ((proc)->framesize)
67 #define PROC_FRAME_REG(proc) ((proc)->framereg)
68 #define PROC_REG_MASK(proc) ((proc)->regmask)
69 #define PROC_FREG_MASK(proc) ((proc)->fregmask)
70 #define PROC_REG_OFFSET(proc) ((proc)->regoffset)
71 #define PROC_FREG_OFFSET(proc) ((proc)->fregoffset)
72 #define PROC_PC_REG(proc) ((proc)->pcreg)
73 #define PROC_SYMBOL(proc) (*(struct symbol**)&(proc)->isym)
74 #define _PROC_MAGIC_ 0x0F0F0F0F
75 #define PROC_DESC_IS_DUMMY(proc) ((proc)->isym == _PROC_MAGIC_)
76 #define SET_PROC_DESC_IS_DUMMY(proc) ((proc)->isym = _PROC_MAGIC_)
77
78 struct linked_proc_info
79 {
80 struct mips_extra_func_info info;
81 struct linked_proc_info *next;
82 } * linked_proc_desc_table = NULL;
83
84 \f
85 #define READ_FRAME_REG(fi, regno) read_next_frame_reg((fi)->next, regno)
86
87 int
88 read_next_frame_reg(fi, regno)
89 FRAME fi;
90 int regno;
91 {
92 #define SIGFRAME_BASE sizeof(struct sigcontext)
93 #define SIGFRAME_PC_OFF (-SIGFRAME_BASE+ 2*sizeof(int))
94 #define SIGFRAME_SP_OFF (-SIGFRAME_BASE+32*sizeof(int))
95 #define SIGFRAME_RA_OFF (-SIGFRAME_BASE+34*sizeof(int))
96 for (; fi; fi = fi->next)
97 if (in_sigtramp(fi->pc, 0)) {
98 /* No idea if this code works. --PB. */
99 int offset;
100 if (regno == PC_REGNUM) offset = SIGFRAME_PC_OFF;
101 else if (regno == RA_REGNUM) offset = SIGFRAME_RA_OFF;
102 else if (regno == SP_REGNUM) offset = SIGFRAME_SP_OFF;
103 else return 0;
104 return read_memory_integer(fi->frame + offset, 4);
105 }
106 else if (regno == SP_REGNUM) return fi->frame;
107 else if (fi->saved_regs->regs[regno])
108 return read_memory_integer(fi->saved_regs->regs[regno], 4);
109 return read_register(regno);
110 }
111
112 int
113 mips_frame_saved_pc(frame)
114 FRAME frame;
115 {
116 mips_extra_func_info_t proc_desc = (mips_extra_func_info_t)frame->proc_desc;
117 int pcreg = proc_desc ? PROC_PC_REG(proc_desc) : RA_REGNUM;
118 if (proc_desc && PROC_DESC_IS_DUMMY(proc_desc))
119 return read_memory_integer(frame->frame - 4, 4);
120 #if 0
121 /* If in the procedure prologue, RA_REGNUM might not have been saved yet.
122 * Assume non-leaf functions start with:
123 * addiu $sp,$sp,-frame_size
124 * sw $ra,ra_offset($sp)
125 * This if the pc is pointing at either of these instructions,
126 * then $ra hasn't been trashed.
127 * If the pc has advanced beyond these two instructions,
128 * then $ra has been saved.
129 * critical, and much more complex. Handling $ra is enough to get
130 * a stack trace, but some register values with be wrong.
131 */
132 if (frame->proc_desc && frame->pc < PROC_LOW_ADDR(proc_desc) + 8)
133 return read_register(pcreg);
134 #endif
135 return read_next_frame_reg(frame, pcreg);
136 }
137
138 static struct mips_extra_func_info temp_proc_desc;
139 static struct frame_saved_regs temp_saved_regs;
140
141 CORE_ADDR heuristic_proc_start(pc)
142 CORE_ADDR pc;
143 {
144
145 CORE_ADDR start_pc = pc;
146 CORE_ADDR fence = start_pc - 200;
147 if (fence < VM_MIN_ADDRESS) fence = VM_MIN_ADDRESS;
148 /* search back for previous return */
149 for (start_pc -= 4; ; start_pc -= 4)
150 if (start_pc < fence) return 0;
151 else if (ABOUT_TO_RETURN(start_pc))
152 break;
153
154 start_pc += 8; /* skip return, and its delay slot */
155 #if 0
156 /* skip nops (usually 1) 0 - is this */
157 while (start_pc < pc && read_memory_integer (start_pc, 4) == 0)
158 start_pc += 4;
159 #endif
160 return start_pc;
161 }
162
163 mips_extra_func_info_t
164 heuristic_proc_desc(start_pc, limit_pc, next_frame)
165 CORE_ADDR start_pc, limit_pc;
166 FRAME next_frame;
167 {
168 CORE_ADDR sp = next_frame ? next_frame->frame : read_register (SP_REGNUM);
169 CORE_ADDR cur_pc;
170 int frame_size;
171 int has_frame_reg = 0;
172 int reg30; /* Value of $r30. Used by gcc for frame-pointer */
173 unsigned long reg_mask = 0;
174
175 if (start_pc == 0) return NULL;
176 bzero(&temp_proc_desc, sizeof(temp_proc_desc));
177 bzero(&temp_saved_regs, sizeof(struct frame_saved_regs));
178 if (start_pc + 200 < limit_pc) limit_pc = start_pc + 200;
179 restart:
180 frame_size = 0;
181 for (cur_pc = start_pc; cur_pc < limit_pc; cur_pc += 4) {
182 unsigned long word;
183 int status;
184
185 status = read_memory_nobpt (cur_pc, &word, 4);
186 if (status) memory_error (status, cur_pc);
187 SWAP_TARGET_AND_HOST (&word, sizeof (word));
188 if ((word & 0xFFFF0000) == 0x27bd0000) /* addiu $sp,$sp,-i */
189 frame_size += (-word) & 0xFFFF;
190 else if ((word & 0xFFFF0000) == 0x23bd0000) /* addu $sp,$sp,-i */
191 frame_size += (-word) & 0xFFFF;
192 else if ((word & 0xFFE00000) == 0xafa00000) { /* sw reg,offset($sp) */
193 int reg = (word & 0x001F0000) >> 16;
194 reg_mask |= 1 << reg;
195 temp_saved_regs.regs[reg] = sp + (short)word;
196 }
197 else if ((word & 0xFFFF0000) == 0x27be0000) { /* addiu $30,$sp,size */
198 if ((unsigned short)word != frame_size)
199 reg30 = sp + (unsigned short)word;
200 else if (!has_frame_reg) {
201 int alloca_adjust;
202 has_frame_reg = 1;
203 reg30 = read_next_frame_reg(next_frame, 30);
204 alloca_adjust = reg30 - (sp + (unsigned short)word);
205 if (alloca_adjust > 0) {
206 /* FP > SP + frame_size. This may be because
207 /* of an alloca or somethings similar.
208 * Fix sp to "pre-alloca" value, and try again.
209 */
210 sp += alloca_adjust;
211 goto restart;
212 }
213 }
214 }
215 else if ((word & 0xFFE00000) == 0xafc00000) { /* sw reg,offset($30) */
216 int reg = (word & 0x001F0000) >> 16;
217 reg_mask |= 1 << reg;
218 temp_saved_regs.regs[reg] = reg30 + (short)word;
219 }
220 }
221 if (has_frame_reg) {
222 PROC_FRAME_REG(&temp_proc_desc) = 30;
223 PROC_FRAME_OFFSET(&temp_proc_desc) = 0;
224 }
225 else {
226 PROC_FRAME_REG(&temp_proc_desc) = SP_REGNUM;
227 PROC_FRAME_OFFSET(&temp_proc_desc) = frame_size;
228 }
229 PROC_REG_MASK(&temp_proc_desc) = reg_mask;
230 PROC_PC_REG(&temp_proc_desc) = RA_REGNUM;
231 return &temp_proc_desc;
232 }
233
234 mips_extra_func_info_t
235 find_proc_desc(pc, next_frame)
236 CORE_ADDR pc;
237 FRAME next_frame;
238 {
239 mips_extra_func_info_t proc_desc;
240 extern struct block *block_for_pc();
241 struct block *b = block_for_pc(pc);
242
243 struct symbol *sym =
244 b ? lookup_symbol(".gdbinfo.", b, LABEL_NAMESPACE, 0, NULL) : NULL;
245 if (sym != NULL)
246 {
247 /* IF this is the topmost frame AND
248 * (this proc does not have debugging information OR
249 * the PC is in the procedure prologue)
250 * THEN create a "hueristic" proc_desc (by analyzing
251 * the actual code) to replace the "official" proc_desc.
252 */
253 proc_desc = (struct mips_extra_func_info *)sym->value.value;
254 if (next_frame == NULL) {
255 struct symtab_and_line val;
256 struct symbol *proc_symbol =
257 PROC_DESC_IS_DUMMY(proc_desc) ? 0 : PROC_SYMBOL(proc_desc);
258 if (proc_symbol) {
259 val = find_pc_line (BLOCK_START
260 (SYMBOL_BLOCK_VALUE(proc_symbol)),
261 0);
262 val.pc = val.end ? val.end : pc;
263 }
264 if (!proc_symbol || pc < val.pc) {
265 mips_extra_func_info_t found_heuristic =
266 heuristic_proc_desc(PROC_LOW_ADDR(proc_desc),
267 pc, next_frame);
268 if (found_heuristic) proc_desc = found_heuristic;
269 }
270 }
271 }
272 else
273 {
274 register struct linked_proc_info *link;
275 for (link = linked_proc_desc_table; link; link = link->next)
276 if (PROC_LOW_ADDR(&link->info) <= pc
277 && PROC_HIGH_ADDR(&link->info) > pc)
278 return &link->info;
279 proc_desc =
280 heuristic_proc_desc(heuristic_proc_start(pc), pc, next_frame);
281 }
282 return proc_desc;
283 }
284
285 mips_extra_func_info_t cached_proc_desc;
286
287 FRAME_ADDR mips_frame_chain(frame)
288 FRAME frame;
289 {
290 mips_extra_func_info_t proc_desc;
291 CORE_ADDR saved_pc = FRAME_SAVED_PC(frame);
292 if (current_objfile->ei.entry_file_lowpc)
293 { /* has at least the __start symbol */
294 if (saved_pc == 0 || inside_entry_file (saved_pc)) return 0;
295 }
296 else
297 { /* This hack depends on the internals of __start. */
298 /* We also assume the breakpoints are *not* inserted */
299 if (saved_pc == 0
300 || read_memory_integer (saved_pc + 8, 4) & 0xFC00003F == 0xD)
301 return 0; /* break */
302 }
303 proc_desc = find_proc_desc(saved_pc, frame);
304 if (!proc_desc) return 0;
305 cached_proc_desc = proc_desc;
306 return read_next_frame_reg(frame, PROC_FRAME_REG(proc_desc))
307 + PROC_FRAME_OFFSET(proc_desc);
308 }
309
310 void
311 init_extra_frame_info(fci)
312 struct frame_info *fci;
313 {
314 extern struct obstack frame_cache_obstack;
315 /* Use proc_desc calculated in frame_chain */
316 mips_extra_func_info_t proc_desc = fci->next ? cached_proc_desc :
317 find_proc_desc(fci->pc, fci->next);
318 fci->saved_regs = (struct frame_saved_regs*)
319 obstack_alloc (&frame_cache_obstack, sizeof(struct frame_saved_regs));
320 bzero(fci->saved_regs, sizeof(struct frame_saved_regs));
321 fci->proc_desc =
322 proc_desc == &temp_proc_desc ? (char*)NULL : (char*)proc_desc;
323 if (proc_desc)
324 {
325 int ireg;
326 CORE_ADDR reg_position;
327 unsigned long mask;
328 /* r0 bit means kernel trap */
329 int kernel_trap = PROC_REG_MASK(proc_desc) & 1;
330
331 /* Fixup frame-pointer - only needed for top frame */
332 /* This may not be quite right, if procedure has a real frame register */
333 if (fci->pc == PROC_LOW_ADDR(proc_desc))
334 fci->frame = read_register (SP_REGNUM);
335 else
336 fci->frame = READ_FRAME_REG(fci, PROC_FRAME_REG(proc_desc))
337 + PROC_FRAME_OFFSET(proc_desc);
338
339 if (proc_desc == &temp_proc_desc)
340 *fci->saved_regs = temp_saved_regs;
341 else
342 {
343 /* find which general-purpose registers were saved */
344 reg_position = fci->frame + PROC_REG_OFFSET(proc_desc);
345 mask = kernel_trap ? 0xFFFFFFFF : PROC_REG_MASK(proc_desc);
346 for (ireg= 31; mask; --ireg, mask <<= 1)
347 if (mask & 0x80000000)
348 {
349 fci->saved_regs->regs[ireg] = reg_position;
350 reg_position -= 4;
351 }
352 /* find which floating-point registers were saved */
353 reg_position = fci->frame + PROC_FREG_OFFSET(proc_desc);
354 /* The freg_offset points to where the first *double* register is saved.
355 * So skip to the high-order word. */
356 reg_position += 4;
357 mask = kernel_trap ? 0xFFFFFFFF : PROC_FREG_MASK(proc_desc);
358 for (ireg = 31; mask; --ireg, mask <<= 1)
359 if (mask & 0x80000000)
360 {
361 fci->saved_regs->regs[FP0_REGNUM+ireg] = reg_position;
362 reg_position -= 4;
363 }
364 }
365
366 /* hack: if argument regs are saved, guess these contain args */
367 if ((PROC_REG_MASK(proc_desc) & 0xF0) == 0) fci->num_args = -1;
368 else if ((PROC_REG_MASK(proc_desc) & 0x80) == 0) fci->num_args = 4;
369 else if ((PROC_REG_MASK(proc_desc) & 0x40) == 0) fci->num_args = 3;
370 else if ((PROC_REG_MASK(proc_desc) & 0x20) == 0) fci->num_args = 2;
371 else if ((PROC_REG_MASK(proc_desc) & 0x10) == 0) fci->num_args = 1;
372
373 fci->saved_regs->regs[PC_REGNUM] = fci->saved_regs->regs[RA_REGNUM];
374 }
375 if (fci->next == 0)
376 supply_register(FP_REGNUM, &fci->frame);
377 }
378
379
380 CORE_ADDR mips_push_arguments(nargs, args, sp, struct_return, struct_addr)
381 int nargs;
382 value *args;
383 CORE_ADDR sp;
384 int struct_return;
385 CORE_ADDR struct_addr;
386 {
387 CORE_ADDR buf;
388 register i;
389 int accumulate_size = struct_return ? 4 : 0;
390 struct mips_arg { char *contents; int len; int offset; };
391 struct mips_arg *mips_args =
392 (struct mips_arg*)alloca(nargs * sizeof(struct mips_arg));
393 register struct mips_arg *m_arg;
394 for (i = 0, m_arg = mips_args; i < nargs; i++, m_arg++) {
395 extern value value_arg_coerce();
396 value arg = value_arg_coerce (args[i]);
397 m_arg->len = TYPE_LENGTH (VALUE_TYPE (arg));
398 /* This entire mips-specific routine is because doubles must be aligned
399 * on 8-byte boundaries. It still isn't quite right, because MIPS decided
400 * to align 'struct {int a, b}' on 4-byte boundaries (even though this
401 * breaks their varargs implementation...). A correct solution
402 * requires an simulation of gcc's 'alignof' (and use of 'alignof'
403 * in stdarg.h/varargs.h).
404 */
405 if (m_arg->len > 4) accumulate_size = (accumulate_size + 7) & -8;
406 m_arg->offset = accumulate_size;
407 accumulate_size = (accumulate_size + m_arg->len + 3) & -4;
408 m_arg->contents = VALUE_CONTENTS(arg);
409 }
410 accumulate_size = (accumulate_size + 7) & (-8);
411 if (accumulate_size < 16) accumulate_size = 16;
412 sp -= accumulate_size;
413 for (i = nargs; m_arg--, --i >= 0; )
414 write_memory(sp + m_arg->offset, m_arg->contents, m_arg->len);
415 if (struct_return) {
416 buf = struct_addr;
417 write_memory(sp, &buf, sizeof(CORE_ADDR));
418 }
419 return sp;
420 }
421
422 /* MASK(i,j) == (1<<i) + (1<<(i+1)) + ... + (1<<j)). Assume i<=j<31. */
423 #define MASK(i,j) ((1 << (j)+1)-1 ^ (1 << (i))-1)
424
425 void
426 mips_push_dummy_frame()
427 {
428 int ireg;
429 struct linked_proc_info *link = (struct linked_proc_info*)
430 xmalloc(sizeof(struct linked_proc_info));
431 mips_extra_func_info_t proc_desc = &link->info;
432 CORE_ADDR sp = read_register (SP_REGNUM);
433 CORE_ADDR save_address;
434 REGISTER_TYPE buffer;
435 link->next = linked_proc_desc_table;
436 linked_proc_desc_table = link;
437 #define PUSH_FP_REGNUM 16 /* must be a register preserved across calls */
438 #define GEN_REG_SAVE_MASK MASK(1,16)|MASK(24,28)|(1<<31)
439 #define GEN_REG_SAVE_COUNT 22
440 #define FLOAT_REG_SAVE_MASK MASK(0,19)
441 #define FLOAT_REG_SAVE_COUNT 20
442 #define SPECIAL_REG_SAVE_COUNT 4
443 /*
444 * The registers we must save are all those not preserved across
445 * procedure calls. Dest_Reg (see tm-mips.h) must also be saved.
446 * In addition, we must save the PC, and PUSH_FP_REGNUM.
447 * (Ideally, we should also save MDLO/-HI and FP Control/Status reg.)
448 *
449 * Dummy frame layout:
450 * (high memory)
451 * Saved PC
452 * Saved MMHI, MMLO, FPC_CSR
453 * Saved R31
454 * Saved R28
455 * ...
456 * Saved R1
457 * Saved D18 (i.e. F19, F18)
458 * ...
459 * Saved D0 (i.e. F1, F0)
460 * CALL_DUMMY (subroutine stub; see m-mips.h)
461 * Parameter build area (not yet implemented)
462 * (low memory)
463 */
464 PROC_REG_MASK(proc_desc) = GEN_REG_SAVE_MASK;
465 PROC_FREG_MASK(proc_desc) = FLOAT_REG_SAVE_MASK;
466 PROC_REG_OFFSET(proc_desc) = /* offset of (Saved R31) from FP */
467 -sizeof(long) - 4 * SPECIAL_REG_SAVE_COUNT;
468 PROC_FREG_OFFSET(proc_desc) = /* offset of (Saved D18) from FP */
469 -sizeof(double) - 4 * (SPECIAL_REG_SAVE_COUNT + GEN_REG_SAVE_COUNT);
470 /* save general registers */
471 save_address = sp + PROC_REG_OFFSET(proc_desc);
472 for (ireg = 32; --ireg >= 0; )
473 if (PROC_REG_MASK(proc_desc) & (1 << ireg))
474 {
475 buffer = read_register (ireg);
476 write_memory (save_address, &buffer, sizeof(REGISTER_TYPE));
477 save_address -= 4;
478 }
479 /* save floating-points registers */
480 save_address = sp + PROC_FREG_OFFSET(proc_desc);
481 for (ireg = 32; --ireg >= 0; )
482 if (PROC_FREG_MASK(proc_desc) & (1 << ireg))
483 {
484 buffer = read_register (ireg + FP0_REGNUM);
485 write_memory (save_address, &buffer, 4);
486 save_address -= 4;
487 }
488 write_register (PUSH_FP_REGNUM, sp);
489 PROC_FRAME_REG(proc_desc) = PUSH_FP_REGNUM;
490 PROC_FRAME_OFFSET(proc_desc) = 0;
491 buffer = read_register (PC_REGNUM);
492 write_memory (sp - 4, &buffer, sizeof(REGISTER_TYPE));
493 buffer = read_register (HI_REGNUM);
494 write_memory (sp - 8, &buffer, sizeof(REGISTER_TYPE));
495 buffer = read_register (LO_REGNUM);
496 write_memory (sp - 12, &buffer, sizeof(REGISTER_TYPE));
497 buffer = read_register (FCRCS_REGNUM);
498 write_memory (sp - 16, &buffer, sizeof(REGISTER_TYPE));
499 sp -= 4 * (GEN_REG_SAVE_COUNT+FLOAT_REG_SAVE_COUNT+SPECIAL_REG_SAVE_COUNT);
500 write_register (SP_REGNUM, sp);
501 PROC_LOW_ADDR(proc_desc) = sp - CALL_DUMMY_SIZE + CALL_DUMMY_START_OFFSET;
502 PROC_HIGH_ADDR(proc_desc) = sp;
503 SET_PROC_DESC_IS_DUMMY(proc_desc);
504 PROC_PC_REG(proc_desc) = RA_REGNUM;
505 }
506
507 void
508 mips_pop_frame()
509 { register int regnum;
510 FRAME frame = get_current_frame ();
511 CORE_ADDR new_sp = frame->frame;
512 mips_extra_func_info_t proc_desc = (mips_extra_func_info_t)frame->proc_desc;
513 if (PROC_DESC_IS_DUMMY(proc_desc))
514 {
515 struct linked_proc_info **ptr = &linked_proc_desc_table;;
516 for (; &ptr[0]->info != proc_desc; ptr = &ptr[0]->next )
517 if (ptr[0] == NULL) abort();
518 *ptr = ptr[0]->next;
519 free (ptr[0]);
520 write_register (HI_REGNUM, read_memory_integer(new_sp - 8, 4));
521 write_register (LO_REGNUM, read_memory_integer(new_sp - 12, 4));
522 write_register (FCRCS_REGNUM, read_memory_integer(new_sp - 16, 4));
523 }
524 write_register (PC_REGNUM, FRAME_SAVED_PC(frame));
525 if (frame->proc_desc) {
526 for (regnum = 32; --regnum >= 0; )
527 if (PROC_REG_MASK(proc_desc) & (1 << regnum))
528 write_register (regnum,
529 read_memory_integer (frame->saved_regs->regs[regnum], 4));
530 for (regnum = 32; --regnum >= 0; )
531 if (PROC_FREG_MASK(proc_desc) & (1 << regnum))
532 write_register (regnum + FP0_REGNUM,
533 read_memory_integer (frame->saved_regs->regs[regnum + FP0_REGNUM], 4));
534 }
535 write_register (SP_REGNUM, new_sp);
536 flush_cached_frames ();
537 set_current_frame (create_new_frame (new_sp, read_pc ()));
538 }
539
540 static
541 mips_print_register(regnum, all)
542 int regnum, all;
543 {
544 unsigned char raw_buffer[MAX_REGISTER_RAW_SIZE];
545 REGISTER_TYPE val;
546
547 /* Get the data in raw format. */
548 if (read_relative_register_raw_bytes (regnum, raw_buffer))
549 {
550 printf_filtered ("%s: [Invalid]", reg_names[regnum]);
551 return;
552 }
553
554 /* If an even floating pointer register, also print as double. */
555 if (regnum >= FP0_REGNUM && regnum < FP0_REGNUM+32
556 && !((regnum-FP0_REGNUM) & 1)) {
557 read_relative_register_raw_bytes (regnum+1, raw_buffer+4);
558 printf_filtered ("(d%d: ", regnum-FP0_REGNUM);
559 val_print (builtin_type_double, raw_buffer, 0,
560 stdout, 0, 1, 0, Val_pretty_default);
561 printf_filtered ("); ");
562 }
563 fputs_filtered (reg_names[regnum], stdout);
564 #ifndef NUMERIC_REG_NAMES
565 if (regnum < 32)
566 printf_filtered ("(r%d): ", regnum);
567 else
568 #endif
569 printf_filtered (": ");
570
571 /* If virtual format is floating, print it that way. */
572 if (TYPE_CODE (REGISTER_VIRTUAL_TYPE (regnum)) == TYPE_CODE_FLT
573 && ! INVALID_FLOAT (raw_buffer, REGISTER_VIRTUAL_SIZE(regnum))) {
574 val_print (REGISTER_VIRTUAL_TYPE (regnum), raw_buffer, 0,
575 stdout, 0, 1, 0, Val_pretty_default);
576 }
577 /* Else print as integer in hex. */
578 else
579 {
580 long val;
581
582 bcopy (raw_buffer, &val, sizeof (long));
583 SWAP_TARGET_AND_HOST ((char *)&val, sizeof (long));
584 if (val == 0)
585 printf_filtered ("0");
586 else if (all)
587 printf_filtered (local_hex_format(), val);
588 else
589 printf_filtered ("%s=%d", local_hex_string(val), val);
590 }
591 }
592
593 /* Replacement for generic do_registers_info. */
594 mips_do_registers_info (regnum, fpregs)
595 int regnum;
596 int fpregs;
597 {
598 if (regnum != -1) {
599 mips_print_register (regnum, 0);
600 printf_filtered ("\n");
601 }
602 else {
603 for (regnum = 0; regnum < NUM_REGS; ) {
604 if ((!fpregs) && regnum >= FP0_REGNUM && regnum <= FCRIR_REGNUM) {
605 regnum++;
606 continue;
607 }
608 mips_print_register (regnum, 1);
609 regnum++;
610 if ((regnum & 3) == 0 || regnum == NUM_REGS)
611 printf_filtered (";\n");
612 else
613 printf_filtered ("; ");
614 }
615 }
616 }
617 /* Return number of args passed to a frame. described by FIP.
618 Can return -1, meaning no way to tell. */
619
620 mips_frame_num_args(fip)
621 FRAME fip;
622 {
623 #if 0
624 struct chain_info_t *p;
625
626 p = mips_find_cached_frame(FRAME_FP(fip));
627 if (p->valid)
628 return p->the_info.numargs;
629 #endif
630 return -1;
631 }
632
633 \f
634 /* Bad floats: Returns 0 if P points to a valid IEEE floating point number,
635 1 if P points to a denormalized number or a NaN. LEN says whether this is
636 a single-precision or double-precision float */
637 #define SINGLE_EXP_BITS 8
638 #define DOUBLE_EXP_BITS 11
639 int
640 isa_NAN(p, len)
641 int *p, len;
642 {
643 int exponent;
644 if (len == 4)
645 {
646 exponent = *p;
647 exponent = exponent << 1 >> (32 - SINGLE_EXP_BITS - 1);
648 return ((exponent == -1) || (! exponent && *p));
649 }
650 else if (len == 8)
651 {
652 exponent = *(p+1);
653 exponent = exponent << 1 >> (32 - DOUBLE_EXP_BITS - 1);
654 return ((exponent == -1) || (! exponent && *p * *(p+1)));
655 }
656 else return 1;
657 }
658 \f
659 /*
660 * Implemented for Irix 4.x by Garrett A. Wollman
661 */
662 #ifdef USE_PROC_FS /* Target-dependent /proc support */
663
664 #include <sys/time.h>
665 #include <sys/procfs.h>
666
667 typedef unsigned int greg_t; /* why isn't this defined? */
668
669 /*
670 * See the comment in m68k-tdep.c regarding the utility of these functions.
671 */
672
673 void
674 supply_gregset (gregsetp)
675 gregset_t *gregsetp;
676 {
677 register int regno;
678 register greg_t *regp = (greg_t *)(gregsetp->gp_regs);
679
680 /* FIXME: somewhere, there should be a #define for the meaning
681 of this magic number 32; we should use that. */
682 for(regno = 0; regno < 32; regno++)
683 supply_register (regno, (char *)(regp + regno));
684
685 supply_register (PC_REGNUM, (char *)&(gregsetp->gp_pc));
686 supply_register (HI_REGNUM, (char *)&(gregsetp->gp_mdhi));
687 supply_register (LO_REGNUM, (char *)&(gregsetp->gp_mdlo));
688 supply_register (PS_REGNUM, (char *)&(gregsetp->gp_cause));
689 }
690
691 void
692 fill_gregset (gregsetp, regno)
693 gregset_t *gregsetp;
694 int regno;
695 {
696 int regi;
697 register greg_t *regp = (greg_t *)(gregsetp->gp_regs);
698 extern char registers[];
699
700 /* same FIXME as above wrt 32*/
701 for (regi = 0; regi < 32; regi++)
702 if ((regno == -1) || (regno == regi))
703 *(regp + regno) = *(greg_t *) &registers[REGISTER_BYTE (regi)];
704
705 if ((regno == -1) || (regno == PC_REGNUM))
706 gregsetp->gp_pc = *(greg_t *) &registers[REGISTER_BYTE (PC_REGNUM)];
707
708 if ((regno == -1) || (regno == PS_REGNUM))
709 gregsetp->gp_cause = *(greg_t *) &registers[REGISTER_BYTE (PS_REGNUM)];
710
711 if ((regno == -1) || (regno == HI_REGNUM))
712 gregsetp->gp_mdhi = *(greg_t *) &registers[REGISTER_BYTE (HI_REGNUM)];
713
714 if ((regno == -1) || (regno == LO_REGNUM))
715 gregsetp->gp_mdlo = *(greg_t *) &registers[REGISTER_BYTE (LO_REGNUM)];
716 }
717
718 /*
719 * Now we do the same thing for floating-point registers.
720 * We don't bother to condition on FP0_REGNUM since any
721 * reasonable MIPS configuration has an R3010 in it.
722 *
723 * Again, see the comments in m68k-tdep.c.
724 */
725
726 void
727 supply_fpregset (fpregsetp)
728 fpregset_t *fpregsetp;
729 {
730 register int regno;
731
732 for (regno = 0; regno < 32; regno++)
733 supply_register (FP0_REGNUM + regno,
734 (char *)&fpregsetp->fp_r.fp_regs[regno]);
735
736 supply_register (FCRCS_REGNUM, (char *)&fpregsetp->fp_csr);
737
738 /* FIXME: how can we supply FCRIR_REGNUM? SGI doesn't tell us. */
739 }
740
741 void
742 fill_fpregset (fpregsetp, regno)
743 fpregset_t *fpregsetp;
744 int regno;
745 {
746 int regi;
747 char *from, *to;
748 extern char registers[];
749
750 for (regi = FP0_REGNUM; regi < FP0_REGNUM + 32; regi++)
751 {
752 if ((regno == -1) || (regno == regi))
753 {
754 from = (char *) &registers[REGISTER_BYTE (regi)];
755 to = (char *) &(fpregsetp->fp_r.fp_regs[regi]);
756 bcopy(from, to, REGISTER_RAW_SIZE (regno));
757 }
758 }
759
760 if ((regno == -1) || (regno == FCRCS_REGNUM))
761 fpregsetp->fp_csr = *(unsigned *) &registers[REGISTER_BYTE(FCRCS_REGNUM)];
762 }
763
764 #endif /* USE_PROC_FS */
765 \f
766 /* To skip prologues, I use this predicate. Returns either PC
767 itself if the code at PC does not look like a function prologue,
768 PC+4 if it does (our caller does not need anything more fancy). */
769
770 CORE_ADDR mips_skip_prologue(pc)
771 CORE_ADDR pc;
772 {
773 struct symbol *f;
774 struct block *b;
775 unsigned long inst;
776 int offset;
777
778 /* For -g modules and most functions anyways the
779 first instruction adjusts the stack.
780 But we allow some number of stores before the stack adjustment.
781 (These are emitted by varags functions compiled by gcc-2.0. */
782 for (offset = 0; offset < 100; offset += 4) {
783 inst = read_memory_integer(pc + offset, 4);
784 if ((inst & 0xffff0000) == 0x27bd0000) /* addiu $sp,$sp,offset */
785 return pc + offset + 4;
786 if ((inst & 0xFFE00000) != 0xAFA00000) /* sw reg,n($sp) */
787 break;
788 }
789
790 /* Well, it looks like a frameless. Let's make sure.
791 Note that we are not called on the current PC,
792 but on the function`s start PC, and I have definitely
793 seen optimized code that adjusts the SP quite later */
794 b = block_for_pc(pc);
795 if (!b) return pc;
796
797 f = lookup_symbol(".gdbinfo.", b, LABEL_NAMESPACE, 0, NULL);
798 if (!f) return pc;
799 /* Ideally, I would like to use the adjusted info
800 from mips_frame_info(), but for all practical
801 purposes it will not matter (and it would require
802 a different definition of SKIP_PROLOGUE())
803
804 Actually, it would not hurt to skip the storing
805 of arguments on the stack as well. */
806 if (((struct mips_extra_func_info *)f->value.value)->framesize)
807 return pc + 4;
808
809 return pc;
810 }
811
812 /* Figure out where the longjmp will land.
813 We expect the first arg to be a pointer to the jmp_buf structure from which
814 we extract the pc (JB_PC) that we will land at. The pc is copied into PC.
815 This routine returns true on success. */
816
817 int
818 get_longjmp_target(pc)
819 CORE_ADDR *pc;
820 {
821 CORE_ADDR jb_addr;
822
823 jb_addr = read_register(A0_REGNUM);
824
825 if (target_read_memory(jb_addr + JB_PC * JB_ELEMENT_SIZE, pc,
826 sizeof(CORE_ADDR)))
827 return 0;
828
829 SWAP_TARGET_AND_HOST(pc, sizeof(CORE_ADDR));
830
831 return 1;
832 }
This page took 0.050458 seconds and 5 git commands to generate.