Lint
[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 "heuristic" 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
293 if (symfile_objfile->ei.entry_file_lowpc)
294 { /* has at least the __start symbol */
295 if (saved_pc == 0 || inside_entry_file (saved_pc)) return 0;
296 }
297 else
298 { /* This hack depends on the internals of __start. */
299 /* We also assume the breakpoints are *not* inserted */
300 if (saved_pc == 0
301 || read_memory_integer (saved_pc + 8, 4) & 0xFC00003F == 0xD)
302 return 0; /* break */
303 }
304 proc_desc = find_proc_desc(saved_pc, frame);
305 if (!proc_desc) return 0;
306 cached_proc_desc = proc_desc;
307 return read_next_frame_reg(frame, PROC_FRAME_REG(proc_desc))
308 + PROC_FRAME_OFFSET(proc_desc);
309 }
310
311 void
312 init_extra_frame_info(fci)
313 struct frame_info *fci;
314 {
315 extern struct obstack frame_cache_obstack;
316 /* Use proc_desc calculated in frame_chain */
317 mips_extra_func_info_t proc_desc = fci->next ? cached_proc_desc :
318 find_proc_desc(fci->pc, fci->next);
319 fci->saved_regs = (struct frame_saved_regs*)
320 obstack_alloc (&frame_cache_obstack, sizeof(struct frame_saved_regs));
321 bzero(fci->saved_regs, sizeof(struct frame_saved_regs));
322 fci->proc_desc =
323 proc_desc == &temp_proc_desc ? (char*)NULL : (char*)proc_desc;
324 if (proc_desc)
325 {
326 int ireg;
327 CORE_ADDR reg_position;
328 unsigned long mask;
329 /* r0 bit means kernel trap */
330 int kernel_trap = PROC_REG_MASK(proc_desc) & 1;
331
332 /* Fixup frame-pointer - only needed for top frame */
333 /* This may not be quite right, if procedure has a real frame register */
334 if (fci->pc == PROC_LOW_ADDR(proc_desc))
335 fci->frame = read_register (SP_REGNUM);
336 else
337 fci->frame = READ_FRAME_REG(fci, PROC_FRAME_REG(proc_desc))
338 + PROC_FRAME_OFFSET(proc_desc);
339
340 if (proc_desc == &temp_proc_desc)
341 *fci->saved_regs = temp_saved_regs;
342 else
343 {
344 /* find which general-purpose registers were saved */
345 reg_position = fci->frame + PROC_REG_OFFSET(proc_desc);
346 mask = kernel_trap ? 0xFFFFFFFF : PROC_REG_MASK(proc_desc);
347 for (ireg= 31; mask; --ireg, mask <<= 1)
348 if (mask & 0x80000000)
349 {
350 fci->saved_regs->regs[ireg] = reg_position;
351 reg_position -= 4;
352 }
353 /* find which floating-point registers were saved */
354 reg_position = fci->frame + PROC_FREG_OFFSET(proc_desc);
355 /* The freg_offset points to where the first *double* register is saved.
356 * So skip to the high-order word. */
357 reg_position += 4;
358 mask = kernel_trap ? 0xFFFFFFFF : PROC_FREG_MASK(proc_desc);
359 for (ireg = 31; mask; --ireg, mask <<= 1)
360 if (mask & 0x80000000)
361 {
362 fci->saved_regs->regs[FP0_REGNUM+ireg] = reg_position;
363 reg_position -= 4;
364 }
365 }
366
367 /* hack: if argument regs are saved, guess these contain args */
368 if ((PROC_REG_MASK(proc_desc) & 0xF0) == 0) fci->num_args = -1;
369 else if ((PROC_REG_MASK(proc_desc) & 0x80) == 0) fci->num_args = 4;
370 else if ((PROC_REG_MASK(proc_desc) & 0x40) == 0) fci->num_args = 3;
371 else if ((PROC_REG_MASK(proc_desc) & 0x20) == 0) fci->num_args = 2;
372 else if ((PROC_REG_MASK(proc_desc) & 0x10) == 0) fci->num_args = 1;
373
374 fci->saved_regs->regs[PC_REGNUM] = fci->saved_regs->regs[RA_REGNUM];
375 }
376 if (fci->next == 0)
377 supply_register(FP_REGNUM, &fci->frame);
378 }
379
380
381 CORE_ADDR mips_push_arguments(nargs, args, sp, struct_return, struct_addr)
382 int nargs;
383 value *args;
384 CORE_ADDR sp;
385 int struct_return;
386 CORE_ADDR struct_addr;
387 {
388 CORE_ADDR buf;
389 register i;
390 int accumulate_size = struct_return ? 4 : 0;
391 struct mips_arg { char *contents; int len; int offset; };
392 struct mips_arg *mips_args =
393 (struct mips_arg*)alloca(nargs * sizeof(struct mips_arg));
394 register struct mips_arg *m_arg;
395 for (i = 0, m_arg = mips_args; i < nargs; i++, m_arg++) {
396 extern value value_arg_coerce();
397 value arg = value_arg_coerce (args[i]);
398 m_arg->len = TYPE_LENGTH (VALUE_TYPE (arg));
399 /* This entire mips-specific routine is because doubles must be aligned
400 * on 8-byte boundaries. It still isn't quite right, because MIPS decided
401 * to align 'struct {int a, b}' on 4-byte boundaries (even though this
402 * breaks their varargs implementation...). A correct solution
403 * requires an simulation of gcc's 'alignof' (and use of 'alignof'
404 * in stdarg.h/varargs.h).
405 */
406 if (m_arg->len > 4) accumulate_size = (accumulate_size + 7) & -8;
407 m_arg->offset = accumulate_size;
408 accumulate_size = (accumulate_size + m_arg->len + 3) & -4;
409 m_arg->contents = VALUE_CONTENTS(arg);
410 }
411 accumulate_size = (accumulate_size + 7) & (-8);
412 if (accumulate_size < 16) accumulate_size = 16;
413 sp -= accumulate_size;
414 for (i = nargs; m_arg--, --i >= 0; )
415 write_memory(sp + m_arg->offset, m_arg->contents, m_arg->len);
416 if (struct_return) {
417 buf = struct_addr;
418 write_memory(sp, &buf, sizeof(CORE_ADDR));
419 }
420 return sp;
421 }
422
423 /* MASK(i,j) == (1<<i) + (1<<(i+1)) + ... + (1<<j)). Assume i<=j<31. */
424 #define MASK(i,j) ((1 << (j)+1)-1 ^ (1 << (i))-1)
425
426 void
427 mips_push_dummy_frame()
428 {
429 int ireg;
430 struct linked_proc_info *link = (struct linked_proc_info*)
431 xmalloc(sizeof(struct linked_proc_info));
432 mips_extra_func_info_t proc_desc = &link->info;
433 CORE_ADDR sp = read_register (SP_REGNUM);
434 CORE_ADDR save_address;
435 REGISTER_TYPE buffer;
436 link->next = linked_proc_desc_table;
437 linked_proc_desc_table = link;
438 #define PUSH_FP_REGNUM 16 /* must be a register preserved across calls */
439 #define GEN_REG_SAVE_MASK MASK(1,16)|MASK(24,28)|(1<<31)
440 #define GEN_REG_SAVE_COUNT 22
441 #define FLOAT_REG_SAVE_MASK MASK(0,19)
442 #define FLOAT_REG_SAVE_COUNT 20
443 #define SPECIAL_REG_SAVE_COUNT 4
444 /*
445 * The registers we must save are all those not preserved across
446 * procedure calls. Dest_Reg (see tm-mips.h) must also be saved.
447 * In addition, we must save the PC, and PUSH_FP_REGNUM.
448 * (Ideally, we should also save MDLO/-HI and FP Control/Status reg.)
449 *
450 * Dummy frame layout:
451 * (high memory)
452 * Saved PC
453 * Saved MMHI, MMLO, FPC_CSR
454 * Saved R31
455 * Saved R28
456 * ...
457 * Saved R1
458 * Saved D18 (i.e. F19, F18)
459 * ...
460 * Saved D0 (i.e. F1, F0)
461 * CALL_DUMMY (subroutine stub; see m-mips.h)
462 * Parameter build area (not yet implemented)
463 * (low memory)
464 */
465 PROC_REG_MASK(proc_desc) = GEN_REG_SAVE_MASK;
466 PROC_FREG_MASK(proc_desc) = FLOAT_REG_SAVE_MASK;
467 PROC_REG_OFFSET(proc_desc) = /* offset of (Saved R31) from FP */
468 -sizeof(long) - 4 * SPECIAL_REG_SAVE_COUNT;
469 PROC_FREG_OFFSET(proc_desc) = /* offset of (Saved D18) from FP */
470 -sizeof(double) - 4 * (SPECIAL_REG_SAVE_COUNT + GEN_REG_SAVE_COUNT);
471 /* save general registers */
472 save_address = sp + PROC_REG_OFFSET(proc_desc);
473 for (ireg = 32; --ireg >= 0; )
474 if (PROC_REG_MASK(proc_desc) & (1 << ireg))
475 {
476 buffer = read_register (ireg);
477 write_memory (save_address, &buffer, sizeof(REGISTER_TYPE));
478 save_address -= 4;
479 }
480 /* save floating-points registers */
481 save_address = sp + PROC_FREG_OFFSET(proc_desc);
482 for (ireg = 32; --ireg >= 0; )
483 if (PROC_FREG_MASK(proc_desc) & (1 << ireg))
484 {
485 buffer = read_register (ireg + FP0_REGNUM);
486 write_memory (save_address, &buffer, 4);
487 save_address -= 4;
488 }
489 write_register (PUSH_FP_REGNUM, sp);
490 PROC_FRAME_REG(proc_desc) = PUSH_FP_REGNUM;
491 PROC_FRAME_OFFSET(proc_desc) = 0;
492 buffer = read_register (PC_REGNUM);
493 write_memory (sp - 4, &buffer, sizeof(REGISTER_TYPE));
494 buffer = read_register (HI_REGNUM);
495 write_memory (sp - 8, &buffer, sizeof(REGISTER_TYPE));
496 buffer = read_register (LO_REGNUM);
497 write_memory (sp - 12, &buffer, sizeof(REGISTER_TYPE));
498 buffer = read_register (FCRCS_REGNUM);
499 write_memory (sp - 16, &buffer, sizeof(REGISTER_TYPE));
500 sp -= 4 * (GEN_REG_SAVE_COUNT+FLOAT_REG_SAVE_COUNT+SPECIAL_REG_SAVE_COUNT);
501 write_register (SP_REGNUM, sp);
502 PROC_LOW_ADDR(proc_desc) = sp - CALL_DUMMY_SIZE + CALL_DUMMY_START_OFFSET;
503 PROC_HIGH_ADDR(proc_desc) = sp;
504 SET_PROC_DESC_IS_DUMMY(proc_desc);
505 PROC_PC_REG(proc_desc) = RA_REGNUM;
506 }
507
508 void
509 mips_pop_frame()
510 { register int regnum;
511 FRAME frame = get_current_frame ();
512 CORE_ADDR new_sp = frame->frame;
513 mips_extra_func_info_t proc_desc = (mips_extra_func_info_t)frame->proc_desc;
514 if (PROC_DESC_IS_DUMMY(proc_desc))
515 {
516 struct linked_proc_info **ptr = &linked_proc_desc_table;;
517 for (; &ptr[0]->info != proc_desc; ptr = &ptr[0]->next )
518 if (ptr[0] == NULL) abort();
519 *ptr = ptr[0]->next;
520 free (ptr[0]);
521 write_register (HI_REGNUM, read_memory_integer(new_sp - 8, 4));
522 write_register (LO_REGNUM, read_memory_integer(new_sp - 12, 4));
523 write_register (FCRCS_REGNUM, read_memory_integer(new_sp - 16, 4));
524 }
525 write_register (PC_REGNUM, FRAME_SAVED_PC(frame));
526 if (frame->proc_desc) {
527 for (regnum = 32; --regnum >= 0; )
528 if (PROC_REG_MASK(proc_desc) & (1 << regnum))
529 write_register (regnum,
530 read_memory_integer (frame->saved_regs->regs[regnum], 4));
531 for (regnum = 32; --regnum >= 0; )
532 if (PROC_FREG_MASK(proc_desc) & (1 << regnum))
533 write_register (regnum + FP0_REGNUM,
534 read_memory_integer (frame->saved_regs->regs[regnum + FP0_REGNUM], 4));
535 }
536 write_register (SP_REGNUM, new_sp);
537 flush_cached_frames ();
538 set_current_frame (create_new_frame (new_sp, read_pc ()));
539 }
540
541 static
542 mips_print_register(regnum, all)
543 int regnum, all;
544 {
545 unsigned char raw_buffer[MAX_REGISTER_RAW_SIZE];
546 REGISTER_TYPE val;
547
548 /* Get the data in raw format. */
549 if (read_relative_register_raw_bytes (regnum, raw_buffer))
550 {
551 printf_filtered ("%s: [Invalid]", reg_names[regnum]);
552 return;
553 }
554
555 /* If an even floating pointer register, also print as double. */
556 if (regnum >= FP0_REGNUM && regnum < FP0_REGNUM+32
557 && !((regnum-FP0_REGNUM) & 1)) {
558 read_relative_register_raw_bytes (regnum+1, raw_buffer+4);
559 printf_filtered ("(d%d: ", regnum-FP0_REGNUM);
560 val_print (builtin_type_double, raw_buffer, 0,
561 stdout, 0, 1, 0, Val_pretty_default);
562 printf_filtered ("); ");
563 }
564 fputs_filtered (reg_names[regnum], stdout);
565 #ifndef NUMERIC_REG_NAMES
566 if (regnum < 32)
567 printf_filtered ("(r%d): ", regnum);
568 else
569 #endif
570 printf_filtered (": ");
571
572 /* If virtual format is floating, print it that way. */
573 if (TYPE_CODE (REGISTER_VIRTUAL_TYPE (regnum)) == TYPE_CODE_FLT
574 && ! INVALID_FLOAT (raw_buffer, REGISTER_VIRTUAL_SIZE(regnum))) {
575 val_print (REGISTER_VIRTUAL_TYPE (regnum), raw_buffer, 0,
576 stdout, 0, 1, 0, Val_pretty_default);
577 }
578 /* Else print as integer in hex. */
579 else
580 {
581 long val;
582
583 bcopy (raw_buffer, &val, sizeof (long));
584 SWAP_TARGET_AND_HOST ((char *)&val, sizeof (long));
585 if (val == 0)
586 printf_filtered ("0");
587 else if (all)
588 printf_filtered (local_hex_format(), val);
589 else
590 printf_filtered ("%s=%d", local_hex_string(val), val);
591 }
592 }
593
594 /* Replacement for generic do_registers_info. */
595 mips_do_registers_info (regnum, fpregs)
596 int regnum;
597 int fpregs;
598 {
599 if (regnum != -1) {
600 mips_print_register (regnum, 0);
601 printf_filtered ("\n");
602 }
603 else {
604 for (regnum = 0; regnum < NUM_REGS; ) {
605 if ((!fpregs) && regnum >= FP0_REGNUM && regnum <= FCRIR_REGNUM) {
606 regnum++;
607 continue;
608 }
609 mips_print_register (regnum, 1);
610 regnum++;
611 if ((regnum & 3) == 0 || regnum == NUM_REGS)
612 printf_filtered (";\n");
613 else
614 printf_filtered ("; ");
615 }
616 }
617 }
618 /* Return number of args passed to a frame. described by FIP.
619 Can return -1, meaning no way to tell. */
620
621 mips_frame_num_args(fip)
622 FRAME fip;
623 {
624 #if 0
625 struct chain_info_t *p;
626
627 p = mips_find_cached_frame(FRAME_FP(fip));
628 if (p->valid)
629 return p->the_info.numargs;
630 #endif
631 return -1;
632 }
633
634 \f
635 /* Bad floats: Returns 0 if P points to a valid IEEE floating point number,
636 1 if P points to a denormalized number or a NaN. LEN says whether this is
637 a single-precision or double-precision float */
638 #define SINGLE_EXP_BITS 8
639 #define DOUBLE_EXP_BITS 11
640 int
641 isa_NAN(p, len)
642 int *p, len;
643 {
644 int exponent;
645 if (len == 4)
646 {
647 exponent = *p;
648 exponent = exponent << 1 >> (32 - SINGLE_EXP_BITS - 1);
649 return ((exponent == -1) || (! exponent && *p));
650 }
651 else if (len == 8)
652 {
653 exponent = *(p+1);
654 exponent = exponent << 1 >> (32 - DOUBLE_EXP_BITS - 1);
655 return ((exponent == -1) || (! exponent && *p * *(p+1)));
656 }
657 else return 1;
658 }
659 \f
660 /*
661 * Implemented for Irix 4.x by Garrett A. Wollman
662 */
663 #ifdef USE_PROC_FS /* Target-dependent /proc support */
664
665 #include <sys/time.h>
666 #include <sys/procfs.h>
667
668 typedef unsigned int greg_t; /* why isn't this defined? */
669
670 /*
671 * See the comment in m68k-tdep.c regarding the utility of these functions.
672 */
673
674 void
675 supply_gregset (gregsetp)
676 gregset_t *gregsetp;
677 {
678 register int regno;
679 register greg_t *regp = (greg_t *)(gregsetp->gp_regs);
680
681 /* FIXME: somewhere, there should be a #define for the meaning
682 of this magic number 32; we should use that. */
683 for(regno = 0; regno < 32; regno++)
684 supply_register (regno, (char *)(regp + regno));
685
686 supply_register (PC_REGNUM, (char *)&(gregsetp->gp_pc));
687 supply_register (HI_REGNUM, (char *)&(gregsetp->gp_mdhi));
688 supply_register (LO_REGNUM, (char *)&(gregsetp->gp_mdlo));
689 supply_register (PS_REGNUM, (char *)&(gregsetp->gp_cause));
690 }
691
692 void
693 fill_gregset (gregsetp, regno)
694 gregset_t *gregsetp;
695 int regno;
696 {
697 int regi;
698 register greg_t *regp = (greg_t *)(gregsetp->gp_regs);
699 extern char registers[];
700
701 /* same FIXME as above wrt 32*/
702 for (regi = 0; regi < 32; regi++)
703 if ((regno == -1) || (regno == regi))
704 *(regp + regno) = *(greg_t *) &registers[REGISTER_BYTE (regi)];
705
706 if ((regno == -1) || (regno == PC_REGNUM))
707 gregsetp->gp_pc = *(greg_t *) &registers[REGISTER_BYTE (PC_REGNUM)];
708
709 if ((regno == -1) || (regno == PS_REGNUM))
710 gregsetp->gp_cause = *(greg_t *) &registers[REGISTER_BYTE (PS_REGNUM)];
711
712 if ((regno == -1) || (regno == HI_REGNUM))
713 gregsetp->gp_mdhi = *(greg_t *) &registers[REGISTER_BYTE (HI_REGNUM)];
714
715 if ((regno == -1) || (regno == LO_REGNUM))
716 gregsetp->gp_mdlo = *(greg_t *) &registers[REGISTER_BYTE (LO_REGNUM)];
717 }
718
719 /*
720 * Now we do the same thing for floating-point registers.
721 * We don't bother to condition on FP0_REGNUM since any
722 * reasonable MIPS configuration has an R3010 in it.
723 *
724 * Again, see the comments in m68k-tdep.c.
725 */
726
727 void
728 supply_fpregset (fpregsetp)
729 fpregset_t *fpregsetp;
730 {
731 register int regno;
732
733 for (regno = 0; regno < 32; regno++)
734 supply_register (FP0_REGNUM + regno,
735 (char *)&fpregsetp->fp_r.fp_regs[regno]);
736
737 supply_register (FCRCS_REGNUM, (char *)&fpregsetp->fp_csr);
738
739 /* FIXME: how can we supply FCRIR_REGNUM? SGI doesn't tell us. */
740 }
741
742 void
743 fill_fpregset (fpregsetp, regno)
744 fpregset_t *fpregsetp;
745 int regno;
746 {
747 int regi;
748 char *from, *to;
749 extern char registers[];
750
751 for (regi = FP0_REGNUM; regi < FP0_REGNUM + 32; regi++)
752 {
753 if ((regno == -1) || (regno == regi))
754 {
755 from = (char *) &registers[REGISTER_BYTE (regi)];
756 to = (char *) &(fpregsetp->fp_r.fp_regs[regi]);
757 bcopy(from, to, REGISTER_RAW_SIZE (regno));
758 }
759 }
760
761 if ((regno == -1) || (regno == FCRCS_REGNUM))
762 fpregsetp->fp_csr = *(unsigned *) &registers[REGISTER_BYTE(FCRCS_REGNUM)];
763 }
764
765 #endif /* USE_PROC_FS */
766 \f
767 /* To skip prologues, I use this predicate. Returns either PC
768 itself if the code at PC does not look like a function prologue,
769 PC+4 if it does (our caller does not need anything more fancy). */
770
771 CORE_ADDR
772 mips_skip_prologue(pc)
773 CORE_ADDR pc;
774 {
775 struct symbol *f;
776 struct block *b;
777 unsigned long inst;
778 int offset;
779
780 /* For -g modules and most functions anyways the
781 first instruction adjusts the stack.
782 But we allow some number of stores before the stack adjustment.
783 (These are emitted by varags functions compiled by gcc-2.0. */
784 for (offset = 0; offset < 100; offset += 4) {
785 inst = read_memory_integer(pc + offset, 4);
786 if ((inst & 0xffff0000) == 0x27bd0000) /* addiu $sp,$sp,offset */
787 return pc + offset + 4;
788 if ((inst & 0xFFE00000) != 0xAFA00000) /* sw reg,n($sp) */
789 break;
790 }
791
792 /* Well, it looks like a frameless. Let's make sure.
793 Note that we are not called on the current PC,
794 but on the function`s start PC, and I have definitely
795 seen optimized code that adjusts the SP quite later */
796 b = block_for_pc(pc);
797 if (!b) return pc;
798
799 f = lookup_symbol(".gdbinfo.", b, LABEL_NAMESPACE, 0, NULL);
800 if (!f) return pc;
801 /* Ideally, I would like to use the adjusted info
802 from mips_frame_info(), but for all practical
803 purposes it will not matter (and it would require
804 a different definition of SKIP_PROLOGUE())
805
806 Actually, it would not hurt to skip the storing
807 of arguments on the stack as well. */
808 if (((struct mips_extra_func_info *)f->value.value)->framesize)
809 return pc + 4;
810
811 return pc;
812 }
813
814 /* Figure out where the longjmp will land.
815 We expect the first arg to be a pointer to the jmp_buf structure from which
816 we extract the pc (JB_PC) that we will land at. The pc is copied into PC.
817 This routine returns true on success. */
818
819 int
820 get_longjmp_target(pc)
821 CORE_ADDR *pc;
822 {
823 CORE_ADDR jb_addr;
824
825 jb_addr = read_register(A0_REGNUM);
826
827 if (target_read_memory(jb_addr + JB_PC * JB_ELEMENT_SIZE, pc,
828 sizeof(CORE_ADDR)))
829 return 0;
830
831 SWAP_TARGET_AND_HOST(pc, sizeof(CORE_ADDR));
832
833 return 1;
834 }
This page took 0.086865 seconds and 5 git commands to generate.