1 |
106 |
markom |
/* Definitions to make GDB run on a vax under 4.2bsd.
|
2 |
|
|
Copyright 1986, 1987, 1989, 1991, 1993 Free Software Foundation, Inc.
|
3 |
|
|
|
4 |
|
|
This file is part of GDB.
|
5 |
|
|
|
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.
|
10 |
|
|
|
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.
|
15 |
|
|
|
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., 59 Temple Place - Suite 330,
|
19 |
|
|
Boston, MA 02111-1307, USA. */
|
20 |
|
|
|
21 |
|
|
|
22 |
|
|
#define TARGET_BYTE_ORDER LITTLE_ENDIAN
|
23 |
|
|
|
24 |
|
|
/* Offset from address of function to start of its code.
|
25 |
|
|
Zero on most machines. */
|
26 |
|
|
|
27 |
|
|
#define FUNCTION_START_OFFSET 2
|
28 |
|
|
|
29 |
|
|
/* Advance PC across any function entry prologue instructions
|
30 |
|
|
to reach some "real" code. */
|
31 |
|
|
|
32 |
|
|
extern CORE_ADDR vax_skip_prologue PARAMS ((CORE_ADDR));
|
33 |
|
|
#define SKIP_PROLOGUE(pc) (vax_skip_prologue (pc))
|
34 |
|
|
|
35 |
|
|
/* Immediately after a function call, return the saved pc.
|
36 |
|
|
Can't always go through the frames for this because on some machines
|
37 |
|
|
the new frame is not set up until the new function executes
|
38 |
|
|
some instructions. */
|
39 |
|
|
|
40 |
|
|
#define SAVED_PC_AFTER_CALL(frame) FRAME_SAVED_PC(frame)
|
41 |
|
|
|
42 |
|
|
#define TARGET_UPAGES 14
|
43 |
|
|
#define TARGET_NBPG 512
|
44 |
|
|
#define STACK_END_ADDR (0x80000000 - (TARGET_UPAGES * TARGET_NBPG))
|
45 |
|
|
|
46 |
|
|
/* On the VAX, sigtramp is in the u area. Can't check the exact
|
47 |
|
|
addresses because for cross-debugging we don't have VAX include
|
48 |
|
|
files around. This should be close enough. */
|
49 |
|
|
#define SIGTRAMP_START(pc) STACK_END_ADDR
|
50 |
|
|
#define SIGTRAMP_END(pc) 0x80000000
|
51 |
|
|
|
52 |
|
|
/* Stack grows downward. */
|
53 |
|
|
|
54 |
|
|
#define INNER_THAN(lhs,rhs) ((lhs) < (rhs))
|
55 |
|
|
|
56 |
|
|
/* Sequence of bytes for breakpoint instruction. */
|
57 |
|
|
|
58 |
|
|
#define BREAKPOINT {3}
|
59 |
|
|
|
60 |
|
|
/* Amount PC must be decremented by after a breakpoint.
|
61 |
|
|
This is often the number of bytes in BREAKPOINT
|
62 |
|
|
but not always. */
|
63 |
|
|
|
64 |
|
|
#define DECR_PC_AFTER_BREAK 0
|
65 |
|
|
|
66 |
|
|
/* Return 1 if P points to an invalid floating point value.
|
67 |
|
|
LEN is the length in bytes -- not relevant on the Vax. */
|
68 |
|
|
|
69 |
|
|
#define INVALID_FLOAT(p, len) ((*(short *) p & 0xff80) == 0x8000)
|
70 |
|
|
|
71 |
|
|
/* Say how long (ordinary) registers are. This is a piece of bogosity
|
72 |
|
|
used in push_word and a few other places; REGISTER_RAW_SIZE is the
|
73 |
|
|
real way to know how big a register is. */
|
74 |
|
|
|
75 |
|
|
#define REGISTER_SIZE 4
|
76 |
|
|
|
77 |
|
|
/* Number of machine registers */
|
78 |
|
|
|
79 |
|
|
#define NUM_REGS 17
|
80 |
|
|
|
81 |
|
|
/* Initializer for an array of names of registers.
|
82 |
|
|
There should be NUM_REGS strings in this initializer. */
|
83 |
|
|
|
84 |
|
|
#define REGISTER_NAMES {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", "r9", "r10", "r11", "ap", "fp", "sp", "pc", "ps"}
|
85 |
|
|
|
86 |
|
|
/* Register numbers of various important registers.
|
87 |
|
|
Note that some of these values are "real" register numbers,
|
88 |
|
|
and correspond to the general registers of the machine,
|
89 |
|
|
and some are "phony" register numbers which are too large
|
90 |
|
|
to be actual register numbers as far as the user is concerned
|
91 |
|
|
but do serve to get the desired values when passed to read_register. */
|
92 |
|
|
|
93 |
|
|
#define AP_REGNUM 12
|
94 |
|
|
#define FP_REGNUM 13 /* Contains address of executing stack frame */
|
95 |
|
|
#define SP_REGNUM 14 /* Contains address of top of stack */
|
96 |
|
|
#define PC_REGNUM 15 /* Contains program counter */
|
97 |
|
|
#define PS_REGNUM 16 /* Contains processor status */
|
98 |
|
|
|
99 |
|
|
/* Total amount of space needed to store our copies of the machine's
|
100 |
|
|
register state, the array `registers'. */
|
101 |
|
|
#define REGISTER_BYTES (17*4)
|
102 |
|
|
|
103 |
|
|
/* Index within `registers' of the first byte of the space for
|
104 |
|
|
register N. */
|
105 |
|
|
|
106 |
|
|
#define REGISTER_BYTE(N) ((N) * 4)
|
107 |
|
|
|
108 |
|
|
/* Number of bytes of storage in the actual machine representation
|
109 |
|
|
for register N. On the vax, all regs are 4 bytes. */
|
110 |
|
|
|
111 |
|
|
#define REGISTER_RAW_SIZE(N) 4
|
112 |
|
|
|
113 |
|
|
/* Number of bytes of storage in the program's representation
|
114 |
|
|
for register N. On the vax, all regs are 4 bytes. */
|
115 |
|
|
|
116 |
|
|
#define REGISTER_VIRTUAL_SIZE(N) 4
|
117 |
|
|
|
118 |
|
|
/* Largest value REGISTER_RAW_SIZE can have. */
|
119 |
|
|
|
120 |
|
|
#define MAX_REGISTER_RAW_SIZE 4
|
121 |
|
|
|
122 |
|
|
/* Largest value REGISTER_VIRTUAL_SIZE can have. */
|
123 |
|
|
|
124 |
|
|
#define MAX_REGISTER_VIRTUAL_SIZE 4
|
125 |
|
|
|
126 |
|
|
/* Return the GDB type object for the "standard" data type
|
127 |
|
|
of data in register N. */
|
128 |
|
|
|
129 |
|
|
#define REGISTER_VIRTUAL_TYPE(N) builtin_type_int
|
130 |
|
|
|
131 |
|
|
/* Store the address of the place in which to copy the structure the
|
132 |
|
|
subroutine will return. This is called from call_function. */
|
133 |
|
|
|
134 |
|
|
#define STORE_STRUCT_RETURN(ADDR, SP) \
|
135 |
|
|
{ write_register (1, (ADDR)); }
|
136 |
|
|
|
137 |
|
|
/* Extract from an array REGBUF containing the (raw) register state
|
138 |
|
|
a function return value of type TYPE, and copy that, in virtual format,
|
139 |
|
|
into VALBUF. */
|
140 |
|
|
|
141 |
|
|
#define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
|
142 |
|
|
memcpy (VALBUF, REGBUF, TYPE_LENGTH (TYPE))
|
143 |
|
|
|
144 |
|
|
/* Write into appropriate registers a function return value
|
145 |
|
|
of type TYPE, given in virtual format. */
|
146 |
|
|
|
147 |
|
|
#define STORE_RETURN_VALUE(TYPE,VALBUF) \
|
148 |
|
|
write_register_bytes (0, VALBUF, TYPE_LENGTH (TYPE))
|
149 |
|
|
|
150 |
|
|
/* Extract from an array REGBUF containing the (raw) register state
|
151 |
|
|
the address in which a function should return its structure value,
|
152 |
|
|
as a CORE_ADDR (or an expression that can be used as one). */
|
153 |
|
|
|
154 |
|
|
#define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF))
|
155 |
|
|
|
156 |
|
|
|
157 |
|
|
/* Describe the pointer in each stack frame to the previous stack frame
|
158 |
|
|
(its caller). */
|
159 |
|
|
|
160 |
|
|
/* FRAME_CHAIN takes a frame's nominal address
|
161 |
|
|
and produces the frame's chain-pointer. */
|
162 |
|
|
|
163 |
|
|
/* In the case of the Vax, the frame's nominal address is the FP value,
|
164 |
|
|
and 12 bytes later comes the saved previous FP value as a 4-byte word. */
|
165 |
|
|
|
166 |
|
|
#define FRAME_CHAIN(thisframe) \
|
167 |
|
|
(!inside_entry_file ((thisframe)->pc) ? \
|
168 |
|
|
read_memory_integer ((thisframe)->frame + 12, 4) :\
|
169 |
|
|
0)
|
170 |
|
|
|
171 |
|
|
/* Define other aspects of the stack frame. */
|
172 |
|
|
|
173 |
|
|
/* A macro that tells us whether the function invocation represented
|
174 |
|
|
by FI does not have a frame on the stack associated with it. If it
|
175 |
|
|
does not, FRAMELESS is set to 1, else 0. */
|
176 |
|
|
/* On the vax, all functions have frames. */
|
177 |
|
|
#define FRAMELESS_FUNCTION_INVOCATION(FI) (0)
|
178 |
|
|
|
179 |
|
|
/* Saved Pc. Get it from sigcontext if within sigtramp. */
|
180 |
|
|
|
181 |
|
|
/* Offset to saved PC in sigcontext, from <sys/signal.h>. */
|
182 |
|
|
#define SIGCONTEXT_PC_OFFSET 12
|
183 |
|
|
|
184 |
|
|
#define FRAME_SAVED_PC(FRAME) \
|
185 |
|
|
(((FRAME)->signal_handler_caller \
|
186 |
|
|
? sigtramp_saved_pc (FRAME) \
|
187 |
|
|
: read_memory_integer ((FRAME)->frame + 16, 4)) \
|
188 |
|
|
)
|
189 |
|
|
|
190 |
|
|
/* Cannot find the AP register value directly from the FP value. Must
|
191 |
|
|
find it saved in the frame called by this one, or in the AP
|
192 |
|
|
register for the innermost frame. However, there is no way to tell
|
193 |
|
|
the difference between the innermost frame and a frame for which we
|
194 |
|
|
just don't know the frame that it called (e.g. "info frame
|
195 |
|
|
0x7ffec789"). For the sake of argument suppose that the stack is
|
196 |
|
|
somewhat trashed (which is one reason that "info frame" exists).
|
197 |
|
|
So return 0 (indicating we don't know the address of
|
198 |
|
|
the arglist) if we don't know what frame this frame calls. */
|
199 |
|
|
#define FRAME_ARGS_ADDRESS_CORRECT(fi) \
|
200 |
|
|
(((fi)->next \
|
201 |
|
|
? read_memory_integer ((fi)->next->frame + 8, 4) \
|
202 |
|
|
: /* read_register (AP_REGNUM) */ 0))
|
203 |
|
|
|
204 |
|
|
/* In most of GDB, getting the args address is too important to
|
205 |
|
|
just say "I don't know". This is sometimes wrong for functions
|
206 |
|
|
that aren't on top of the stack, but c'est la vie. */
|
207 |
|
|
#define FRAME_ARGS_ADDRESS(fi) \
|
208 |
|
|
(((fi)->next \
|
209 |
|
|
? read_memory_integer ((fi)->next->frame + 8, 4) \
|
210 |
|
|
: read_register (AP_REGNUM) /* 0 */))
|
211 |
|
|
|
212 |
|
|
#define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame)
|
213 |
|
|
|
214 |
|
|
/* Return number of args passed to a frame.
|
215 |
|
|
Can return -1, meaning no way to tell. */
|
216 |
|
|
|
217 |
|
|
extern int vax_frame_num_args PARAMS ((struct frame_info * fi));
|
218 |
|
|
#define FRAME_NUM_ARGS(fi) (vax_frame_num_args ((fi)))
|
219 |
|
|
|
220 |
|
|
/* Return number of bytes at start of arglist that are not really args. */
|
221 |
|
|
|
222 |
|
|
#define FRAME_ARGS_SKIP 4
|
223 |
|
|
|
224 |
|
|
/* Put here the code to store, into a struct frame_saved_regs,
|
225 |
|
|
the addresses of the saved registers of frame described by FRAME_INFO.
|
226 |
|
|
This includes special registers such as pc and fp saved in special
|
227 |
|
|
ways in the stack frame. sp is even more special:
|
228 |
|
|
the address we return for it IS the sp for the next frame. */
|
229 |
|
|
|
230 |
|
|
#define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \
|
231 |
|
|
{ register int regnum; \
|
232 |
|
|
register int regmask = read_memory_integer ((frame_info)->frame+4, 4) >> 16; \
|
233 |
|
|
register CORE_ADDR next_addr; \
|
234 |
|
|
memset (&frame_saved_regs, '\0', sizeof frame_saved_regs); \
|
235 |
|
|
next_addr = (frame_info)->frame + 16; \
|
236 |
|
|
/* Regmask's low bit is for register 0, \
|
237 |
|
|
which is the first one that would be pushed. */ \
|
238 |
|
|
for (regnum = 0; regnum < 12; regnum++, regmask >>= 1) \
|
239 |
|
|
(frame_saved_regs).regs[regnum] = (regmask & 1) ? (next_addr += 4) : 0; \
|
240 |
|
|
(frame_saved_regs).regs[SP_REGNUM] = next_addr + 4; \
|
241 |
|
|
if (read_memory_integer ((frame_info)->frame + 4, 4) & 0x20000000) \
|
242 |
|
|
(frame_saved_regs).regs[SP_REGNUM] += 4 + 4 * read_memory_integer (next_addr + 4, 4); \
|
243 |
|
|
(frame_saved_regs).regs[PC_REGNUM] = (frame_info)->frame + 16; \
|
244 |
|
|
(frame_saved_regs).regs[FP_REGNUM] = (frame_info)->frame + 12; \
|
245 |
|
|
(frame_saved_regs).regs[AP_REGNUM] = (frame_info)->frame + 8; \
|
246 |
|
|
(frame_saved_regs).regs[PS_REGNUM] = (frame_info)->frame + 4; \
|
247 |
|
|
}
|
248 |
|
|
|
249 |
|
|
/* Things needed for making the inferior call functions. */
|
250 |
|
|
|
251 |
|
|
/* Push an empty stack frame, to record the current PC, etc. */
|
252 |
|
|
|
253 |
|
|
#define PUSH_DUMMY_FRAME \
|
254 |
|
|
{ register CORE_ADDR sp = read_register (SP_REGNUM);\
|
255 |
|
|
register int regnum; \
|
256 |
|
|
sp = push_word (sp, 0); /* arglist */ \
|
257 |
|
|
for (regnum = 11; regnum >= 0; regnum--) \
|
258 |
|
|
sp = push_word (sp, read_register (regnum)); \
|
259 |
|
|
sp = push_word (sp, read_register (PC_REGNUM)); \
|
260 |
|
|
sp = push_word (sp, read_register (FP_REGNUM)); \
|
261 |
|
|
sp = push_word (sp, read_register (AP_REGNUM)); \
|
262 |
|
|
sp = push_word (sp, (read_register (PS_REGNUM) & 0xffef) \
|
263 |
|
|
+ 0x2fff0000); \
|
264 |
|
|
sp = push_word (sp, 0); \
|
265 |
|
|
write_register (SP_REGNUM, sp); \
|
266 |
|
|
write_register (FP_REGNUM, sp); \
|
267 |
|
|
write_register (AP_REGNUM, sp + 17 * sizeof (int)); }
|
268 |
|
|
|
269 |
|
|
/* Discard from the stack the innermost frame, restoring all registers. */
|
270 |
|
|
|
271 |
|
|
#define POP_FRAME \
|
272 |
|
|
{ register CORE_ADDR fp = read_register (FP_REGNUM); \
|
273 |
|
|
register int regnum; \
|
274 |
|
|
register int regmask = read_memory_integer (fp + 4, 4); \
|
275 |
|
|
write_register (PS_REGNUM, \
|
276 |
|
|
(regmask & 0xffff) \
|
277 |
|
|
| (read_register (PS_REGNUM) & 0xffff0000)); \
|
278 |
|
|
write_register (PC_REGNUM, read_memory_integer (fp + 16, 4)); \
|
279 |
|
|
write_register (FP_REGNUM, read_memory_integer (fp + 12, 4)); \
|
280 |
|
|
write_register (AP_REGNUM, read_memory_integer (fp + 8, 4)); \
|
281 |
|
|
fp += 16; \
|
282 |
|
|
for (regnum = 0; regnum < 12; regnum++) \
|
283 |
|
|
if (regmask & (0x10000 << regnum)) \
|
284 |
|
|
write_register (regnum, read_memory_integer (fp += 4, 4)); \
|
285 |
|
|
fp = fp + 4 + ((regmask >> 30) & 3); \
|
286 |
|
|
if (regmask & 0x20000000) \
|
287 |
|
|
{ regnum = read_memory_integer (fp, 4); \
|
288 |
|
|
fp += (regnum + 1) * 4; } \
|
289 |
|
|
write_register (SP_REGNUM, fp); \
|
290 |
|
|
flush_cached_frames (); \
|
291 |
|
|
}
|
292 |
|
|
|
293 |
|
|
/* This sequence of words is the instructions
|
294 |
|
|
calls #69, @#32323232
|
295 |
|
|
bpt
|
296 |
|
|
Note this is 8 bytes. */
|
297 |
|
|
|
298 |
|
|
#define CALL_DUMMY {0x329f69fb, 0x03323232}
|
299 |
|
|
|
300 |
|
|
#define CALL_DUMMY_START_OFFSET 0 /* Start execution at beginning of dummy */
|
301 |
|
|
|
302 |
|
|
#define CALL_DUMMY_BREAKPOINT_OFFSET 7
|
303 |
|
|
|
304 |
|
|
/* Insert the specified number of args and function address
|
305 |
|
|
into a call sequence of the above form stored at DUMMYNAME. */
|
306 |
|
|
|
307 |
|
|
#define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, gcc_p) \
|
308 |
|
|
{ *((char *) dummyname + 1) = nargs; \
|
309 |
|
|
*(int *)((char *) dummyname + 3) = fun; }
|
310 |
|
|
|
311 |
|
|
/* If vax pcc says CHAR or SHORT, it provides the correct address. */
|
312 |
|
|
|
313 |
|
|
#define BELIEVE_PCC_PROMOTION 1
|