* configure.in (mips-big-* target): Same as Sony News.
[deliverable/binutils-gdb.git] / gdb / tm-mips.h
CommitLineData
dd3b648e 1/* Definitions to make GDB run on a mips box under 4.3bsd.
30875e1c 2 Copyright (C) 1986, 1987, 1989, 1991, 1992 Free Software Foundation, Inc.
fbcb5095
JG
3 Contributed by Per Bothner (bothner@cs.wisc.edu) at U.Wisconsin
4 and by Alessandro Forin (af@cs.cmu.edu) at CMU.
dd3b648e
RP
5
6This file is part of GDB.
7
99a7de40 8This program is free software; you can redistribute it and/or modify
dd3b648e 9it under the terms of the GNU General Public License as published by
99a7de40
JG
10the Free Software Foundation; either version 2 of the License, or
11(at your option) any later version.
dd3b648e 12
99a7de40 13This program is distributed in the hope that it will be useful,
dd3b648e
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
99a7de40
JG
19along with this program; if not, write to the Free Software
20Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
dd3b648e
RP
21
22#if !defined (TARGET_BYTE_ORDER)
23#define TARGET_BYTE_ORDER LITTLE_ENDIAN
24#endif
25
26/* Floating point is IEEE compliant */
27#define IEEE_FLOAT
28
29/* Define this if the C compiler puts an underscore at the front
30 of external names before giving them to the linker. */
31
32/*#define NAMES_HAVE_UNDERSCORE*/
33
34/* Debugger information will be in mips' format */
35
36#define READ_MIPS_FORMAT
37
38/* File format is coff, but with additions */
39
40#define COFF_FORMAT
41
42/* Offset from address of function to start of its code.
43 Zero on most machines. */
44
45#define FUNCTION_START_OFFSET 0
46
47/* Advance PC across any function entry prologue instructions
48 to reach some "real" code. */
49
50#define SKIP_PROLOGUE(pc) pc = mips_skip_prologue(pc)
51
52/* Immediately after a function call, return the saved pc.
53 Can't always go through the frames for this because on some machines
54 the new frame is not set up until the new function executes
55 some instructions. */
56
57#define SAVED_PC_AFTER_CALL(frame) read_register(RA_REGNUM)
58
59/* Are we currently handling a signal */
60
61#define IN_SIGTRAMP(pc, name) in_sigtramp(pc, name)
62
63/* Address of end of stack space. */
64
65#define STACK_END_ADDR (0x7ffff000)
66
67/* Stack grows downward. */
68
69#define INNER_THAN <
70
71#define BIG_ENDIAN 4321
72#if TARGET_BYTE_ORDER == BIG_ENDIAN
73#define BREAKPOINT {0, 0x5, 0, 0xd}
74#else
75#define BREAKPOINT {0xd, 0, 0x5, 0}
76#endif
77
78/* Amount PC must be decremented by after a breakpoint.
79 This is often the number of bytes in BREAKPOINT
80 but not always. */
81
82#define DECR_PC_AFTER_BREAK 0
83
84/* Nonzero if instruction at PC is a return instruction. "j ra" on mips. */
85
86#define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 4) == 0x3e00008)
87
88/* Return 1 if P points to an invalid floating point value. */
89
90#define INVALID_FLOAT(p,l) isa_NAN(p,l)
91
92/* Say how long (all) registers are. */
93
94#define REGISTER_TYPE long
95
96/* Number of machine registers */
97
98#define NUM_REGS 73
99
100/* Initializer for an array of names of registers.
101 There should be NUM_REGS strings in this initializer. */
102
103#define REGISTER_NAMES \
104 { "zero", "at", "v0", "v1", "a0", "a1", "a2", "a3", \
105 "t0", "t1", "t2", "t3", "t4", "t5", "t6", "t7", \
106 "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", \
107 "t8", "t9", "k0", "k1", "gp", "sp", "s8", "ra", \
108 "sr", "lo", "hi", "bad", "cause","pc", \
109 "f0", "f1", "f2", "f3", "f4", "f5", "f6", "f7", \
110 "f8", "f9", "f10", "f11", "f12", "f13", "f14", "f15", \
111 "f16", "f17", "f18", "f19", "f20", "f21", "f22", "f23",\
112 "f24", "f25", "f26", "f27", "f28", "f29", "f30", "f31",\
113 "fsr", "fir", "fp" \
114 }
115
116/* Register numbers of various important registers.
117 Note that some of these values are "real" register numbers,
118 and correspond to the general registers of the machine,
119 and some are "phony" register numbers which are too large
120 to be actual register numbers as far as the user is concerned
121 but do serve to get the desired values when passed to read_register. */
122
abefb1f1 123#define ZERO_REGNUM 0 /* read-only register, always 0 */
30875e1c 124#define A0_REGNUM 4 /* Lo of first arg during a subr call */
dd3b648e 125#define SP_REGNUM 29 /* Contains address of top of stack */
dd3b648e
RP
126#define RA_REGNUM 31 /* Contains return address value */
127#define PS_REGNUM 32 /* Contains processor status */
128#define HI_REGNUM 34 /* Multiple/divide temp */
129#define LO_REGNUM 33 /* ... */
abefb1f1
PB
130#define BADVADDR_REGNUM 35 /* bad vaddr for addressing exception */
131#define CAUSE_REGNUM 36 /* describes last exception */
132#define PC_REGNUM 37 /* Contains program counter */
dd3b648e
RP
133#define FP0_REGNUM 38 /* Floating point register 0 (single float) */
134#define FCRCS_REGNUM 70 /* FP control/status */
135#define FCRIR_REGNUM 71 /* FP implementation/revision */
136#define FP_REGNUM 72 /* Pseudo register that contains true address of executing stack frame */
137
138/* Define DO_REGISTERS_INFO() to do machine-specific formatting
139 of register dumps. */
140
361bf6ee 141#define DO_REGISTERS_INFO(_regnum, fp) mips_do_registers_info(_regnum, fp)
dd3b648e 142
dd3b648e
RP
143/* Total amount of space needed to store our copies of the machine's
144 register state, the array `registers'. */
145#define REGISTER_BYTES (NUM_REGS*4)
146
147/* Index within `registers' of the first byte of the space for
148 register N. */
149
150#define REGISTER_BYTE(N) ((N) * 4)
151
152/* Number of bytes of storage in the actual machine representation
153 for register N. On mips, all regs are 4 bytes. */
154
155#define REGISTER_RAW_SIZE(N) 4
156
157/* Number of bytes of storage in the program's representation
158 for register N. On mips, all regs are 4 bytes. */
159
160#define REGISTER_VIRTUAL_SIZE(N) 4
161
162/* Largest value REGISTER_RAW_SIZE can have. */
163
164#define MAX_REGISTER_RAW_SIZE 4
165
166/* Largest value REGISTER_VIRTUAL_SIZE can have. */
167
168#define MAX_REGISTER_VIRTUAL_SIZE 4
169
170/* Nonzero if register N requires conversion
171 from raw format to virtual format. */
172
173#define REGISTER_CONVERTIBLE(N) 0
174
175/* Convert data from raw format for register REGNUM
176 to virtual format for register REGNUM. */
177
178#define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) \
179 bcopy ((FROM), (TO), 4);
180
181/* Convert data from virtual format for register REGNUM
182 to raw format for register REGNUM. */
183
184#define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) \
185 bcopy ((FROM), (TO), 4);
186
187/* Return the GDB type object for the "standard" data type
188 of data in register N. */
189
190#define REGISTER_VIRTUAL_TYPE(N) builtin_type_int
191/* Store the address of the place in which to copy the structure the
192 subroutine will return. This is called from call_function. */
193
194#define STORE_STRUCT_RETURN(addr, sp) \
195 { sp = push_word(sp, addr);}
196
197/* Extract from an array REGBUF containing the (raw) register state
198 a function return value of type TYPE, and copy that, in virtual format,
199 into VALBUF. XXX floats */
200
201#define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
202 bcopy (REGBUF+REGISTER_BYTE (TYPE_CODE (TYPE) == TYPE_CODE_FLT ? FP0_REGNUM : 2), VALBUF, TYPE_LENGTH (TYPE))
203
204/* Write into appropriate registers a function return value
205 of type TYPE, given in virtual format. */
206
207#define STORE_RETURN_VALUE(TYPE,VALBUF) \
208 write_register_bytes (REGISTER_BYTE (TYPE_CODE (TYPE) == TYPE_CODE_FLT ? FP0_REGNUM : 2), VALBUF, TYPE_LENGTH (TYPE))
209
210/* Extract from an array REGBUF containing the (raw) register state
211 the address in which a function should return its structure value,
212 as a CORE_ADDR (or an expression that can be used as one). */
213
214#define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF+16))
215
216/* Structures are returned by ref in extra arg0 */
217#define USE_STRUCT_CONVENTION(gcc_p, type) 1
218
219\f
220/* Describe the pointer in each stack frame to the previous stack frame
221 (its caller). */
222
223/* FRAME_CHAIN takes a frame's nominal address
224 and produces the frame's chain-pointer.
225
dd3b648e 226 However, if FRAME_CHAIN_VALID returns zero,
e140f1da 227 it means the given frame is the outermost one and has no caller. */
dd3b648e
RP
228
229#define FRAME_CHAIN(thisframe) (FRAME_ADDR)mips_frame_chain(thisframe)
230
231#define FRAME_CHAIN_VALID(chain, thisframe) \
232 (chain != 0 && (outside_startup_file (FRAME_SAVED_PC (thisframe))))
233
dd3b648e
RP
234/* Define other aspects of the stack frame. */
235
236
237/* A macro that tells us whether the function invocation represented
238 by FI does not have a frame on the stack associated with it. If it
239 does not, FRAMELESS is set to 1, else 0. */
240/* We handle this differently for mips, and maybe we should not */
241
242#define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) {(FRAMELESS) = 0;}
243
244/* Saved Pc. */
245
246#define FRAME_SAVED_PC(FRAME) (mips_frame_saved_pc(FRAME))
247
248#define FRAME_ARGS_ADDRESS(fi) (fi)->frame
249
250#define FRAME_LOCALS_ADDRESS(fi) (fi)->frame
251
252/* Return number of args passed to a frame.
253 Can return -1, meaning no way to tell. */
254
255#define FRAME_NUM_ARGS(num, fi) (num = mips_frame_num_args(fi))
256
257/* Return number of bytes at start of arglist that are not really args. */
258
259#define FRAME_ARGS_SKIP 0
260
261/* Put here the code to store, into a struct frame_saved_regs,
262 the addresses of the saved registers of frame described by FRAME_INFO.
263 This includes special registers such as pc and fp saved in special
264 ways in the stack frame. sp is even more special:
265 the address we return for it IS the sp for the next frame. */
266
267#define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) ( \
268 (frame_saved_regs) = *(frame_info)->saved_regs, \
269 (frame_saved_regs).regs[SP_REGNUM] = (frame_info)->frame)
270
271\f
272/* Things needed for making the inferior call functions. */
273
274/* Stack has strict alignment. However, use PUSH_ARGUMENTS
275 to take care of it. */
276/*#define STACK_ALIGN(addr) (((addr)+3)&~3)*/
277
278#define PUSH_ARGUMENTS(nargs, args, sp, struct_return, struct_addr) \
279 sp = mips_push_arguments(nargs, args, sp, struct_return, struct_addr)
280
281/* Push an empty stack frame, to record the current PC, etc. */
282
283#define PUSH_DUMMY_FRAME mips_push_dummy_frame()
284
285/* Discard from the stack the innermost frame, restoring all registers. */
286
287#define POP_FRAME mips_pop_frame()
288
289#define MK_OP(op,rs,rt,offset) (((op)<<26)|((rs)<<21)|((rt)<<16)|(offset))
290#define CALL_DUMMY_SIZE (16*4)
291#define Dest_Reg 2
292#define CALL_DUMMY {\
293 MK_OP(0,RA_REGNUM,0,8), /* jr $ra # Fake ABOUT_TO_RETURN ...*/\
294 0, /* nop # ... to stop raw backtrace*/\
295 0x27bd0000, /* addu sp,?0 # Pseudo prologue */\
296/* Start here: */\
297 MK_OP(061,SP_REGNUM,12,0), /* lwc1 $f12,0(sp) # Reload first 4 args*/\
298 MK_OP(061,SP_REGNUM,13,4), /* lwc1 $f13,4(sp) */\
299 MK_OP(061,SP_REGNUM,14,8), /* lwc1 $f14,8(sp) */\
300 MK_OP(061,SP_REGNUM,15,12), /* lwc1 $f15,12(sp) */\
301 MK_OP(043,SP_REGNUM,4,0), /* lw $r4,0(sp) # Re-load FP regs*/\
302 MK_OP(043,SP_REGNUM,5,4), /* lw $r5,4(sp) */\
303 MK_OP(043,SP_REGNUM,6,8), /* lw $r6,8(sp) */\
304 MK_OP(043,SP_REGNUM,7,12), /* lw $r7,12(sp) */\
305 (017<<26)| (Dest_Reg << 16), /* lui $r31,<target upper 16 bits>*/\
306 MK_OP(13,Dest_Reg,Dest_Reg,0), /* ori $r31,$r31,<lower 16 bits>*/ \
307 (Dest_Reg<<21) | (31<<11) | 9, /* jalr $r31 */\
308 MK_OP(043,SP_REGNUM,7,12), /* lw $r7,12(sp) */\
309 0x5000d, /* bpt */\
310}
311
312#define CALL_DUMMY_START_OFFSET 12
313
314/* Insert the specified number of args and function address
315 into a call sequence of the above form stored at DUMMYNAME. */
316
317#define FIX_CALL_DUMMY(dummyname, start_sp, fun, nargs, args, rettype, gcc_p)\
318 (((int*)dummyname)[11] |= (((unsigned long)(fun)) >> 16), \
319 ((int*)dummyname)[12] |= (unsigned short)(fun))
320
321/* Specific information about a procedure.
322 This overlays the MIPS's PDR records,
323 mipsread.c (ab)uses this to save memory */
324
325typedef struct mips_extra_func_info {
326 unsigned long adr; /* memory address of start of procedure */
327 long isym; /* pointer to procedure symbol */
328 long pad2; /* iline: start of line number entries*/
329 long regmask; /* save register mask */
330 long regoffset; /* save register offset */
331 long numargs; /* number of args to procedure (was iopt) */
332 long fregmask; /* save floating point register mask */
333 long fregoffset; /* save floating point register offset */
334 long framesize; /* frameoffset: frame size */
335 short framereg; /* frame pointer register */
336 short pcreg; /* offset or reg of return pc */
337 long lnLow; /* lowest line in the procedure */
338 long lnHigh; /* highest line in the procedure */
339 long pad3; /* cbLineOffset: byte offset for this procedure from the fd base */
340} *mips_extra_func_info_t;
341
342#define EXTRA_FRAME_INFO \
343 char *proc_desc; /* actually, a mips_extra_func_info_t */\
344 int num_args;\
345 struct frame_saved_regs *saved_regs;
346
a23075bc 347#define INIT_EXTRA_FRAME_INFO(fromleaf, fci) init_extra_frame_info(fci)
bd49ef36
PB
348
349#define STAB_REG_TO_REGNUM(num) ((num) < 32 ? (num) : (num)+FP0_REGNUM-32)
30875e1c
SG
350
351/* Size of elements in jmpbuf */
352
353#define JB_ELEMENT_SIZE 4
354
355/* Figure out where the longjmp will land. We expect that we have just entered
356 longjmp and haven't yet setup the stack frame, so the args are still in the
357 argument regs. a0 (CALL_ARG0) points at the jmp_buf structure from which we
358 extract the pc (JB_PC) that we will land at. The pc is copied into ADDR.
359 This routine returns true on success */
360
361/* Note that caller must #include <setjmp.h> in order to get def of JB_* */
362#define GET_LONGJMP_TARGET(ADDR) get_longjmp_target(ADDR)
This page took 0.064531 seconds and 4 git commands to generate.