Commit | Line | Data |
---|---|---|
dd3b648e | 1 | /* Definitions to target GDB to a merlin under utek 2.1 |
58dbaabd | 2 | Copyright 1986, 1987, 1989, 1991, 1993 Free Software Foundation, Inc. |
dd3b648e RP |
3 | |
4 | This file is part of GDB. | |
5 | ||
99a7de40 | 6 | This program is free software; you can redistribute it and/or modify |
dd3b648e | 7 | it under the terms of the GNU General Public License as published by |
99a7de40 JG |
8 | the Free Software Foundation; either version 2 of the License, or |
9 | (at your option) any later version. | |
dd3b648e | 10 | |
99a7de40 | 11 | This program is distributed in the hope that it will be useful, |
dd3b648e RP |
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 | |
99a7de40 JG |
17 | along with this program; if not, write to the Free Software |
18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
dd3b648e RP |
19 | |
20 | #define TARGET_BYTE_ORDER LITTLE_ENDIAN | |
21 | ||
dd3b648e RP |
22 | /* Offset from address of function to start of its code. |
23 | Zero on most machines. */ | |
24 | ||
25 | #define FUNCTION_START_OFFSET 0 | |
26 | ||
27 | /* Advance PC across any function entry prologue instructions | |
28 | to reach some "real" code. */ | |
29 | ||
30 | #define SKIP_PROLOGUE(pc) \ | |
31 | { register int op = read_memory_integer (pc, 1); \ | |
32 | if (op == 0x82) \ | |
33 | { op = read_memory_integer (pc+2,1); \ | |
34 | if ((op & 0x80) == 0) pc += 3; \ | |
35 | else if ((op & 0xc0) == 0x80) pc += 4; \ | |
36 | else pc += 6; \ | |
37 | }} | |
38 | ||
39 | /* Immediately after a function call, return the saved pc. | |
40 | Can't always go through the frames for this because on some machines | |
41 | the new frame is not set up until the new function executes | |
42 | some instructions. */ | |
43 | ||
44 | #define SAVED_PC_AFTER_CALL(frame) \ | |
45 | read_memory_integer (read_register (SP_REGNUM), 4) | |
46 | ||
47 | /* Address of end of stack space. */ | |
48 | ||
49 | #define STACK_END_ADDR (0x800000) | |
50 | ||
51 | /* Stack grows downward. */ | |
52 | ||
53 | #define INNER_THAN < | |
54 | ||
55 | /* Sequence of bytes for breakpoint instruction. */ | |
56 | ||
57 | #define BREAKPOINT {0xf2} | |
58 | ||
59 | /* Amount PC must be decremented by after a breakpoint. | |
60 | This is often the number of bytes in BREAKPOINT | |
61 | but not always. */ | |
62 | ||
63 | #define DECR_PC_AFTER_BREAK 0 | |
64 | ||
65 | /* Nonzero if instruction at PC is a return instruction. */ | |
66 | ||
67 | #define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 1) == 0x12) | |
68 | ||
69 | /* Return 1 if P points to an invalid floating point value. */ | |
70 | ||
71 | #define INVALID_FLOAT(p, len) 0 | |
72 | ||
73 | /* Define this to say that the "svc" insn is followed by | |
74 | codes in memory saying which kind of system call it is. */ | |
75 | ||
76 | #define NS32K_SVC_IMMED_OPERANDS | |
77 | ||
78 | /* Say how long (ordinary) registers are. */ | |
79 | ||
80 | #define REGISTER_TYPE long | |
81 | ||
82 | /* Number of machine registers */ | |
83 | ||
84 | #define NUM_REGS 25 | |
85 | ||
86 | #define NUM_GENERAL_REGS 8 | |
87 | ||
88 | /* Initializer for an array of names of registers. | |
89 | There should be NUM_REGS strings in this initializer. */ | |
90 | ||
91 | #define REGISTER_NAMES {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", \ | |
92 | "pc", "sp", "fp", "ps", \ | |
93 | "fsr", \ | |
94 | "f0", "f1", "f2", "f3", "f4", "f5", "f6", "f7", \ | |
95 | "l0", "l1", "l2", "l3", "l4", \ | |
96 | } | |
97 | ||
98 | /* Register numbers of various important registers. | |
99 | Note that some of these values are "real" register numbers, | |
100 | and correspond to the general registers of the machine, | |
101 | and some are "phony" register numbers which are too large | |
102 | to be actual register numbers as far as the user is concerned | |
103 | but do serve to get the desired values when passed to read_register. */ | |
104 | ||
105 | #define AP_REGNUM FP_REGNUM | |
106 | #define FP_REGNUM 10 /* Contains address of executing stack frame */ | |
107 | #define SP_REGNUM 9 /* Contains address of top of stack */ | |
108 | #define PC_REGNUM 8 /* Contains program counter */ | |
109 | #define PS_REGNUM 11 /* Contains processor status */ | |
110 | #define FPS_REGNUM 12 /* Floating point status register */ | |
111 | #define FP0_REGNUM 13 /* Floating point register 0 */ | |
112 | #define LP0_REGNUM 21 /* Double register 0 (same as FP0) */ | |
113 | ||
114 | /* Total amount of space needed to store our copies of the machine's | |
115 | register state, the array `registers'. */ | |
116 | #define REGISTER_BYTES ((NUM_REGS - 4) * sizeof (int) + 4 * sizeof (double)) | |
117 | ||
118 | /* Index within `registers' of the first byte of the space for | |
119 | register N. */ | |
120 | ||
121 | #define REGISTER_BYTE(N) ((N) >= LP0_REGNUM ? \ | |
122 | LP0_REGNUM * 4 + ((N) - LP0_REGNUM) * 8 : (N) * 4) | |
123 | ||
124 | /* Number of bytes of storage in the actual machine representation | |
125 | for register N. On the 32000, all regs are 4 bytes | |
126 | except for the doubled floating registers. */ | |
127 | ||
128 | #define REGISTER_RAW_SIZE(N) ((N) >= LP0_REGNUM ? 8 : 4) | |
129 | ||
130 | /* Number of bytes of storage in the program's representation | |
131 | for register N. On the 32000, all regs are 4 bytes | |
132 | except for the doubled floating registers. */ | |
133 | ||
134 | #define REGISTER_VIRTUAL_SIZE(N) ((N) >= LP0_REGNUM ? 8 : 4) | |
135 | ||
136 | /* Largest value REGISTER_RAW_SIZE can have. */ | |
137 | ||
138 | #define MAX_REGISTER_RAW_SIZE 8 | |
139 | ||
140 | /* Largest value REGISTER_VIRTUAL_SIZE can have. */ | |
141 | ||
142 | #define MAX_REGISTER_VIRTUAL_SIZE 8 | |
143 | ||
144 | /* Nonzero if register N requires conversion | |
145 | from raw format to virtual format. */ | |
146 | ||
147 | #define REGISTER_CONVERTIBLE(N) 0 | |
148 | ||
149 | /* Convert data from raw format for register REGNUM | |
150 | to virtual format for register REGNUM. */ | |
151 | ||
152 | #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) \ | |
153 | bcopy ((FROM), (TO), REGISTER_VIRTUAL_SIZE(REGNUM)); | |
154 | ||
155 | /* Convert data from virtual format for register REGNUM | |
156 | to raw format for register REGNUM. */ | |
157 | ||
158 | #define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) \ | |
159 | bcopy ((FROM), (TO), REGISTER_VIRTUAL_SIZE(REGNUM)); | |
160 | ||
161 | /* Return the GDB type object for the "standard" data type | |
162 | of data in register N. */ | |
163 | ||
164 | #define REGISTER_VIRTUAL_TYPE(N) \ | |
165 | ((N) >= FP0_REGNUM ? \ | |
166 | ((N) >= LP0_REGNUM ? \ | |
167 | builtin_type_double \ | |
168 | : builtin_type_float) \ | |
169 | : builtin_type_int) | |
170 | ||
171 | /* Store the address of the place in which to copy the structure the | |
172 | subroutine will return. This is called from call_function. | |
173 | ||
174 | On this machine this is a no-op, as gcc doesn't run on it yet. | |
175 | This calling convention is not used. */ | |
176 | ||
177 | #define STORE_STRUCT_RETURN(ADDR, SP) | |
178 | ||
179 | /* Extract from an array REGBUF containing the (raw) register state | |
180 | a function return value of type TYPE, and copy that, in virtual format, | |
181 | into VALBUF. */ | |
182 | ||
183 | #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \ | |
184 | bcopy (REGBUF, VALBUF, TYPE_LENGTH (TYPE)) | |
185 | ||
186 | /* Write into appropriate registers a function return value | |
187 | of type TYPE, given in virtual format. */ | |
188 | ||
189 | #define STORE_RETURN_VALUE(TYPE,VALBUF) \ | |
190 | write_register_bytes (0, VALBUF, TYPE_LENGTH (TYPE)) | |
191 | ||
192 | /* Extract from an array REGBUF containing the (raw) register state | |
193 | the address in which a function should return its structure value, | |
194 | as a CORE_ADDR (or an expression that can be used as one). */ | |
195 | ||
196 | #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF)) | |
197 | \f | |
198 | /* Describe the pointer in each stack frame to the previous stack frame | |
199 | (its caller). */ | |
200 | ||
201 | /* FRAME_CHAIN takes a frame's nominal address | |
5e2e79f8 | 202 | and produces the frame's chain-pointer. */ |
dd3b648e RP |
203 | |
204 | /* In the case of the Merlin, the frame's nominal address is the FP value, | |
205 | and at that address is saved previous FP value as a 4-byte word. */ | |
206 | ||
207 | #define FRAME_CHAIN(thisframe) \ | |
5e2e79f8 | 208 | (!inside_entry_file ((thisframe)->pc) ? \ |
dd3b648e RP |
209 | read_memory_integer ((thisframe)->frame, 4) :\ |
210 | 0) | |
211 | ||
dd3b648e RP |
212 | /* Define other aspects of the stack frame. */ |
213 | ||
214 | #define FRAME_SAVED_PC(FRAME) (read_memory_integer ((FRAME)->frame + 4, 4)) | |
215 | ||
216 | /* compute base of arguments */ | |
217 | #define FRAME_ARGS_ADDRESS(fi) ((fi)->frame) | |
218 | ||
219 | #define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame) | |
220 | ||
221 | /* Return number of args passed to a frame. | |
222 | Can return -1, meaning no way to tell. */ | |
223 | ||
224 | #define FRAME_NUM_ARGS(numargs, fi) \ | |
225 | { CORE_ADDR pc; \ | |
226 | int insn; \ | |
227 | int addr_mode; \ | |
228 | int width; \ | |
229 | \ | |
230 | pc = FRAME_SAVED_PC (fi); \ | |
231 | insn = read_memory_integer (pc,2); \ | |
232 | addr_mode = (insn >> 11) & 0x1f; \ | |
233 | insn = insn & 0x7ff; \ | |
234 | if ((insn & 0x7fc) == 0x57c \ | |
235 | && addr_mode == 0x14) /* immediate */ \ | |
236 | { if (insn == 0x57c) /* adjspb */ \ | |
237 | width = 1; \ | |
238 | else if (insn == 0x57d) /* adjspw */ \ | |
239 | width = 2; \ | |
240 | else if (insn == 0x57f) /* adjspd */ \ | |
241 | width = 4; \ | |
242 | numargs = read_memory_integer (pc+2,width); \ | |
243 | if (width > 1) \ | |
244 | flip_bytes (&numargs, width); \ | |
245 | numargs = - sign_extend (numargs, width*8) / 4; } \ | |
246 | else numargs = -1; \ | |
247 | } | |
248 | ||
249 | /* Return number of bytes at start of arglist that are not really args. */ | |
250 | ||
251 | #define FRAME_ARGS_SKIP 8 | |
252 | ||
253 | /* Put here the code to store, into a struct frame_saved_regs, | |
254 | the addresses of the saved registers of frame described by FRAME_INFO. | |
255 | This includes special registers such as pc and fp saved in special | |
256 | ways in the stack frame. sp is even more special: | |
257 | the address we return for it IS the sp for the next frame. */ | |
258 | ||
259 | #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \ | |
260 | { int regmask,regnum; \ | |
261 | int localcount; \ | |
262 | CORE_ADDR enter_addr; \ | |
263 | CORE_ADDR next_addr; \ | |
264 | \ | |
265 | enter_addr = get_pc_function_start ((frame_info)->pc); \ | |
266 | regmask = read_memory_integer (enter_addr+1, 1); \ | |
267 | localcount = ns32k_localcount (enter_addr); \ | |
268 | next_addr = (frame_info)->frame + localcount; \ | |
269 | for (regnum = 0; regnum < 8; regnum++, regmask >>= 1) \ | |
270 | (frame_saved_regs).regs[regnum] \ | |
271 | = (regmask & 1) ? (next_addr -= 4) : 0; \ | |
272 | (frame_saved_regs).regs[SP_REGNUM] = (frame_info)->frame + 4; \ | |
273 | (frame_saved_regs).regs[PC_REGNUM] = (frame_info)->frame + 4; \ | |
274 | (frame_saved_regs).regs[FP_REGNUM] \ | |
275 | = read_memory_integer ((frame_info)->frame, 4); } | |
276 | ||
277 | \f | |
278 | /* Things needed for making the inferior call functions. */ | |
279 | ||
280 | /* Push an empty stack frame, to record the current PC, etc. */ | |
281 | ||
282 | #define PUSH_DUMMY_FRAME \ | |
283 | { register CORE_ADDR sp = read_register (SP_REGNUM); \ | |
284 | register int regnum; \ | |
285 | sp = push_word (sp, read_register (PC_REGNUM)); \ | |
286 | sp = push_word (sp, read_register (FP_REGNUM)); \ | |
287 | write_register (FP_REGNUM, sp); \ | |
288 | for (regnum = 0; regnum < 8; regnum++) \ | |
289 | sp = push_word (sp, read_register (regnum)); \ | |
290 | write_register (SP_REGNUM, sp); \ | |
291 | } | |
292 | ||
293 | /* Discard from the stack the innermost frame, restoring all registers. */ | |
294 | ||
295 | #define POP_FRAME \ | |
296 | { register FRAME frame = get_current_frame (); \ | |
297 | register CORE_ADDR fp; \ | |
298 | register int regnum; \ | |
299 | struct frame_saved_regs fsr; \ | |
300 | struct frame_info *fi; \ | |
301 | fi = get_frame_info (frame); \ | |
302 | fp = fi->frame; \ | |
303 | get_frame_saved_regs (fi, &fsr); \ | |
304 | for (regnum = 0; regnum < 8; regnum++) \ | |
305 | if (fsr.regs[regnum]) \ | |
306 | write_register (regnum, read_memory_integer (fsr.regs[regnum], 4)); \ | |
307 | write_register (FP_REGNUM, read_memory_integer (fp, 4)); \ | |
308 | write_register (PC_REGNUM, read_memory_integer (fp + 4, 4)); \ | |
309 | write_register (SP_REGNUM, fp + 8); \ | |
310 | flush_cached_frames (); \ | |
311 | set_current_frame (create_new_frame (read_register (FP_REGNUM),\ | |
312 | read_pc ())); \ | |
313 | } | |
314 | ||
315 | /* This sequence of words is the instructions | |
316 | enter 0xff,0 82 ff 00 | |
317 | jsr @0x00010203 7f ae c0 01 02 03 | |
318 | adjspd 0x69696969 7f a5 01 02 03 04 | |
319 | bpt f2 | |
320 | Note this is 16 bytes. */ | |
321 | ||
322 | #define CALL_DUMMY { 0x7f00ff82, 0x0201c0ae, 0x01a57f03, 0xf2040302 } | |
323 | ||
324 | #define CALL_DUMMY_START_OFFSET 3 | |
325 | #define CALL_DUMMY_LENGTH 16 | |
326 | #define CALL_DUMMY_ADDR 5 | |
327 | #define CALL_DUMMY_NARGS 11 | |
328 | ||
329 | /* Insert the specified number of args and function address | |
330 | into a call sequence of the above form stored at DUMMYNAME. */ | |
331 | ||
332 | #define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, gcc_p) \ | |
333 | { int flipped = fun | 0xc0000000; \ | |
334 | flip_bytes (&flipped, 4); \ | |
335 | *((int *) (((char *) dummyname)+CALL_DUMMY_ADDR)) = flipped; \ | |
336 | flipped = - nargs * 4; \ | |
337 | flip_bytes (&flipped, 4); \ | |
338 | *((int *) (((char *) dummyname)+CALL_DUMMY_NARGS)) = flipped; \ | |
339 | } |