1 /* Target machine description for SGI Iris under Irix, for GDB.
2 Copyright 1990, 1991, 1992 Free Software Foundation, Inc.
4 This file is part of GDB.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
26 #define TARGET_BYTE_ORDER BIG_ENDIAN
28 /* Floating point is IEEE compliant */
31 /* Define this if the C compiler puts an underscore at the front
32 of external names before giving them to the linker. */
34 /*#define NAMES_HAVE_UNDERSCORE*/
36 /* Offset from address of function to start of its code.
37 Zero on most machines. */
39 #define FUNCTION_START_OFFSET 0
41 /* Advance PC across any function entry prologue instructions
42 to reach some "real" code. */
44 #define SKIP_PROLOGUE(pc) pc = mips_skip_prologue(pc)
46 /* Immediately after a function call, return the saved pc.
47 Can't always go through the frames for this because on some machines
48 the new frame is not set up until the new function executes
51 #define SAVED_PC_AFTER_CALL(frame) read_register(RA_REGNUM)
53 /* Are we currently handling a signal */
55 #define IN_SIGTRAMP(pc, name) in_sigtramp(pc, name)
57 /* Address of end of stack space. */
59 #define STACK_END_ADDR (0x7ffff000)
61 /* Stack grows downward. */
65 #define BREAKPOINT {0, 0x5, 0, 0xd}
67 /* Amount PC must be decremented by after a breakpoint.
68 This is often the number of bytes in BREAKPOINT
71 #define DECR_PC_AFTER_BREAK 0
73 /* Nonzero if instruction at PC is a return instruction. "j ra" on mips. */
75 #define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 4) == 0x3e00008)
77 /* Return 1 if P points to an invalid floating point value. */
79 #define INVALID_FLOAT(p,l) isa_NAN(p,l)
81 /* Say how long (all) registers are. */
83 #define REGISTER_TYPE long
85 /* Number of machine registers */
89 /* Initializer for an array of names of registers.
90 There should be NUM_REGS strings in this initializer. */
92 #define REGISTER_NAMES \
93 { "zero", "at", "v0", "v1", "a0", "a1", "a2", "a3", \
94 "t0", "t1", "t2", "t3", "t4", "t5", "t6", "t7", \
95 "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", \
96 "t8", "t9", "k0", "k1", "gp", "sp", "fp", "ra", \
97 "f0", "f1", "f2", "f3", "f4", "f5", "f6", "f7", \
98 "f8", "f9", "f10", "f11", "f12", "f13", "f14", "f15", \
99 "f16", "f17", "f18", "f19", "f20", "f21", "f22", "f23",\
100 "f24", "f25", "f26", "f27", "f28", "f29", "f30", "f31",\
101 "pc", "cause", "bad", "hi", "lo", "fsr", "fir" \
104 /* Register numbers of various important registers.
105 Note that some of these values are "real" register numbers,
106 and correspond to the general registers of the machine,
107 and some are "phony" register numbers which are too large
108 to be actual register numbers as far as the user is concerned
109 but do serve to get the desired values when passed to read_register. */
111 #define A0_REGNUM 4 /* Loc of first arg during a subr call */
112 #define SP_REGNUM 29 /* Contains address of top of stack */
113 #define FP_REGNUM 30 /* Pseudo register that contains true address of executing stack frame */
114 #define RA_REGNUM 31 /* Contains return address value */
115 #define FP0_REGNUM 32 /* Floating point register 0 (single float) */
116 #define PC_REGNUM 64 /* Contains program counter */
117 #define PS_REGNUM 65 /* Contains processor status */
118 #define HI_REGNUM 67 /* Multiple/divide temp */
119 #define LO_REGNUM 68 /* ... */
120 #define FCRCS_REGNUM 69 /* FP control/status */
121 #define FCRIR_REGNUM 70 /* FP implementation/revision */
123 /* Define DO_REGISTERS_INFO() to do machine-specific formatting
124 of register dumps. */
126 #define DO_REGISTERS_INFO(_regnum, fp) mips_do_registers_info(_regnum, fp)
128 /* Total amount of space needed to store our copies of the machine's
129 register state, the array `registers'. */
130 #define REGISTER_BYTES (NUM_REGS*4)
132 /* Index within `registers' of the first byte of the space for
135 #define REGISTER_BYTE(N) ((N) * 4)
137 /* Number of bytes of storage in the actual machine representation
138 for register N. On mips, all regs are 4 bytes. */
140 #define REGISTER_RAW_SIZE(N) 4
142 /* Number of bytes of storage in the program's representation
143 for register N. On mips, all regs are 4 bytes. */
145 #define REGISTER_VIRTUAL_SIZE(N) 4
147 /* Largest value REGISTER_RAW_SIZE can have. */
149 #define MAX_REGISTER_RAW_SIZE 4
151 /* Largest value REGISTER_VIRTUAL_SIZE can have. */
153 #define MAX_REGISTER_VIRTUAL_SIZE 4
155 /* Nonzero if register N requires conversion
156 from raw format to virtual format. */
158 #define REGISTER_CONVERTIBLE(N) 0
160 /* Convert data from raw format for register REGNUM
161 to virtual format for register REGNUM. */
163 #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) \
164 bcopy ((FROM), (TO), 4);
166 /* Convert data from virtual format for register REGNUM
167 to raw format for register REGNUM. */
169 #define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) \
170 bcopy ((FROM), (TO), 4);
172 /* Return the GDB type object for the "standard" data type
173 of data in register N. */
175 #define REGISTER_VIRTUAL_TYPE(N) builtin_type_int
176 /* Store the address of the place in which to copy the structure the
177 subroutine will return. This is called from call_function. */
179 #define STORE_STRUCT_RETURN(addr, sp) \
180 { sp = push_word(sp, addr);}
182 /* Extract from an array REGBUF containing the (raw) register state
183 a function return value of type TYPE, and copy that, in virtual format,
184 into VALBUF. XXX floats */
186 #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
187 bcopy (REGBUF+REGISTER_BYTE (TYPE_CODE (TYPE) == TYPE_CODE_FLT ? FP0_REGNUM : 2), VALBUF, TYPE_LENGTH (TYPE))
189 /* Write into appropriate registers a function return value
190 of type TYPE, given in virtual format. */
192 #define STORE_RETURN_VALUE(TYPE,VALBUF) \
193 write_register_bytes (REGISTER_BYTE (TYPE_CODE (TYPE) == TYPE_CODE_FLT ? FP0_REGNUM : 2), VALBUF, TYPE_LENGTH (TYPE))
195 /* Extract from an array REGBUF containing the (raw) register state
196 the address in which a function should return its structure value,
197 as a CORE_ADDR (or an expression that can be used as one). */
199 #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF+16))
201 /* Structures are returned by ref in extra arg0 */
202 #define USE_STRUCT_CONVENTION(gcc_p, type) 1
205 /* Describe the pointer in each stack frame to the previous stack frame
208 /* FRAME_CHAIN takes a frame's nominal address
209 and produces the frame's chain-pointer. */
211 #define FRAME_CHAIN(thisframe) (FRAME_ADDR)mips_frame_chain(thisframe)
213 /* Define other aspects of the stack frame. */
216 /* A macro that tells us whether the function invocation represented
217 by FI does not have a frame on the stack associated with it. If it
218 does not, FRAMELESS is set to 1, else 0. */
219 /* We handle this differently for mips, and maybe we should not */
221 #define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) {(FRAMELESS) = 0;}
225 #define FRAME_SAVED_PC(FRAME) (mips_frame_saved_pc(FRAME))
227 #define FRAME_ARGS_ADDRESS(fi) (fi)->frame
229 #define FRAME_LOCALS_ADDRESS(fi) (fi)->frame
231 /* Return number of args passed to a frame.
232 Can return -1, meaning no way to tell. */
234 #define FRAME_NUM_ARGS(num, fi) (num = mips_frame_num_args(fi))
236 /* Return number of bytes at start of arglist that are not really args. */
238 #define FRAME_ARGS_SKIP 0
240 /* Put here the code to store, into a struct frame_saved_regs,
241 the addresses of the saved registers of frame described by FRAME_INFO.
242 This includes special registers such as pc and fp saved in special
243 ways in the stack frame. sp is even more special:
244 the address we return for it IS the sp for the next frame. */
246 #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) ( \
247 (frame_saved_regs) = *(frame_info)->saved_regs, \
248 (frame_saved_regs).regs[SP_REGNUM] = (frame_info)->frame)
251 /* Things needed for making the inferior call functions. */
253 /* Stack has strict alignment. However, use PUSH_ARGUMENTS
254 to take care of it. */
255 /*#define STACK_ALIGN(addr) (((addr)+3)&~3)*/
257 #define PUSH_ARGUMENTS(nargs, args, sp, struct_return, struct_addr) \
258 sp = mips_push_arguments(nargs, args, sp, struct_return, struct_addr)
260 /* Push an empty stack frame, to record the current PC, etc. */
262 #define PUSH_DUMMY_FRAME mips_push_dummy_frame()
264 /* Discard from the stack the innermost frame, restoring all registers. */
266 #define POP_FRAME mips_pop_frame()
268 #define MK_OP(op,rs,rt,offset) (((op)<<26)|((rs)<<21)|((rt)<<16)|(offset))
269 #define CALL_DUMMY_SIZE (16*4)
271 #define CALL_DUMMY {\
272 MK_OP(0,RA_REGNUM,0,8), /* jr $ra # Fake ABOUT_TO_RETURN ...*/\
273 0, /* nop # ... to stop raw backtrace*/\
274 0x27bd0000, /* addu sp,?0 # Pseudo prologue */\
276 MK_OP(061,SP_REGNUM,12,0), /* lwc1 $f12,0(sp) # Reload first 4 args*/\
277 MK_OP(061,SP_REGNUM,13,4), /* lwc1 $f13,4(sp) */\
278 MK_OP(061,SP_REGNUM,14,8), /* lwc1 $f14,8(sp) */\
279 MK_OP(061,SP_REGNUM,15,12), /* lwc1 $f15,12(sp) */\
280 MK_OP(043,SP_REGNUM,4,0), /* lw $r4,0(sp) # Re-load FP regs*/\
281 MK_OP(043,SP_REGNUM,5,4), /* lw $r5,4(sp) */\
282 MK_OP(043,SP_REGNUM,6,8), /* lw $r6,8(sp) */\
283 MK_OP(043,SP_REGNUM,7,12), /* lw $r7,12(sp) */\
284 (017<<26)| (Dest_Reg << 16), /* lui $r31,<target upper 16 bits>*/\
285 MK_OP(13,Dest_Reg,Dest_Reg,0), /* ori $r31,$r31,<lower 16 bits>*/ \
286 (Dest_Reg<<21) | (31<<11) | 9, /* jalr $r31 */\
287 MK_OP(043,SP_REGNUM,7,12), /* lw $r7,12(sp) */\
291 #define CALL_DUMMY_START_OFFSET 12
293 /* Insert the specified number of args and function address
294 into a call sequence of the above form stored at DUMMYNAME. */
296 #define FIX_CALL_DUMMY(dummyname, start_sp, fun, nargs, args, rettype, gcc_p)\
297 (((int*)dummyname)[11] |= (((unsigned long)(fun)) >> 16), \
298 ((int*)dummyname)[12] |= (unsigned short)(fun))
300 /* Specific information about a procedure.
301 This overlays the MIPS's PDR records,
302 mipsread.c (ab)uses this to save memory */
304 typedef struct mips_extra_func_info
{
305 long numargs
; /* number of args to procedure (was iopt) */
306 PDR pdr
; /* Procedure descriptor record */
307 } *mips_extra_func_info_t
;
309 #define EXTRA_FRAME_INFO \
310 char *proc_desc; /* actually, a mips_extra_func_info_t */\
312 struct frame_saved_regs *saved_regs;
314 #define INIT_EXTRA_FRAME_INFO(fromleaf, fci) init_extra_frame_info(fci)
316 /* Size of elements in jmpbuf */
318 #define JB_ELEMENT_SIZE 4
320 /* Figure out where the longjmp will land. We expect that we have just entered
321 longjmp and haven't yet setup the stack frame, so the args are still in the
322 argument regs. a0 (CALL_ARG0) points at the jmp_buf structure from which we
323 extract the pc (JB_PC) that we will land at. The pc is copied into ADDR.
324 This routine returns true on success */
326 /* Note that caller must #include <setjmp.h> in order to get def of JB_* */
327 #define GET_LONGJMP_TARGET(ADDR) get_longjmp_target(ADDR)
This page took 0.043286 seconds and 4 git commands to generate.