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