Commit | Line | Data |
---|---|---|
be8dbfe2 WJ |
1 | /* Macro defintions for i386. |
2 | Copyright (C) 1986, 1987, 1989 Free Software Foundation, Inc. | |
3 | ||
4 | This file is part of GDB. | |
5 | ||
6 | GDB 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 1, or (at your option) | |
9 | any later version. | |
10 | ||
11 | GDB 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 GDB; see the file COPYING. If not, write to | |
18 | the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
19 | ||
20 | /* Define the bit, byte, and word ordering of the machine. */ | |
21 | /* #define BITS_BIG_ENDIAN */ | |
22 | /* #define BYTES_BIG_ENDIAN */ | |
23 | /* #define WORDS_BIG_ENDIAN */ | |
24 | ||
25 | /* | |
26 | * Changes for 80386 by Pace Willisson (pace@prep.ai.mit.edu) | |
27 | * July 1988 | |
28 | */ | |
29 | ||
30 | ||
31 | #ifndef i386 | |
32 | #define i386 | |
33 | #endif | |
34 | ||
35 | /* I'm running gdb 3.4 under 386/ix 2.0.2, which is a derivative of AT&T's | |
36 | Sys V/386 3.2. | |
37 | ||
38 | On some machines, gdb crashes when it's starting up while calling the | |
39 | vendor's termio tgetent() routine. It always works when run under | |
40 | itself (actually, under 3.2, it's not an infinitely recursive bug.) | |
41 | After some poking around, it appears that depending on the environment | |
42 | size, or whether you're running YP, or the phase of the moon or something, | |
43 | the stack is not always long-aligned when main() is called, and tgetent() | |
44 | takes strong offense at that. On some machines this bug never appears, but | |
45 | on those where it does, it occurs quite reliably. */ | |
46 | #define ALIGN_STACK_ON_STARTUP | |
47 | ||
48 | /* define USG if you are using sys5 /usr/include's */ | |
49 | #define USG | |
50 | ||
51 | /* USG systems need these */ | |
52 | #define vfork() fork() | |
53 | #define MAXPATHLEN 500 | |
54 | ||
55 | /* define this if you don't have the extension to coff that allows | |
56 | * file names to appear in the string table | |
57 | * (aux.x_file.x_foff) | |
58 | */ | |
59 | #define COFF_NO_LONG_FILE_NAMES | |
60 | ||
61 | /* turn this on when rest of gdb is ready */ | |
62 | /* #define IEEE_FLOAT */ | |
63 | ||
64 | #define NBPG NBPC | |
65 | #define UPAGES USIZE | |
66 | ||
67 | #define HAVE_TERMIO | |
68 | ||
69 | /* Get rid of any system-imposed stack limit if possible. */ | |
70 | ||
71 | /* #define SET_STACK_LIMIT_HUGE not in sys5 */ | |
72 | ||
73 | /* Define this if the C compiler puts an underscore at the front | |
74 | of external names before giving them to the linker. */ | |
75 | ||
76 | /* #define NAMES_HAVE_UNDERSCORE */ | |
77 | ||
78 | /* Specify debugger information format. */ | |
79 | ||
80 | /* #define READ_DBX_FORMAT */ | |
81 | #define COFF_FORMAT | |
82 | ||
83 | /* number of traps that happen between exec'ing the shell | |
84 | * to run an inferior, and when we finally get to | |
85 | * the inferior code. This is 2 on most implementations. | |
86 | */ | |
87 | #define START_INFERIOR_TRAPS_EXPECTED 4 | |
88 | ||
89 | /* Offset from address of function to start of its code. | |
90 | Zero on most machines. */ | |
91 | ||
92 | #define FUNCTION_START_OFFSET 0 | |
93 | ||
94 | /* Advance PC across any function entry prologue instructions | |
95 | to reach some "real" code. */ | |
96 | ||
97 | #define SKIP_PROLOGUE(frompc) {(frompc) = i386_skip_prologue((frompc));} | |
98 | ||
99 | /* Immediately after a function call, return the saved pc. | |
100 | Can't always go through the frames for this because on some machines | |
101 | the new frame is not set up until the new function executes | |
102 | some instructions. */ | |
103 | ||
104 | #define SAVED_PC_AFTER_CALL(frame) \ | |
105 | (read_memory_integer (read_register (SP_REGNUM), 4)) | |
106 | ||
107 | /* This is the amount to subtract from u.u_ar0 | |
108 | to get the offset in the core file of the register values. */ | |
109 | ||
110 | #define KERNEL_U_ADDR 0xe0000000 | |
111 | ||
112 | /* Address of end of stack space. */ | |
113 | ||
114 | #define STACK_END_ADDR 0x80000000 | |
115 | ||
116 | /* Stack grows downward. */ | |
117 | ||
118 | #define INNER_THAN < | |
119 | ||
120 | /* Sequence of bytes for breakpoint instruction. */ | |
121 | ||
122 | #define BREAKPOINT {0xcc} | |
123 | ||
124 | /* Amount PC must be decremented by after a breakpoint. | |
125 | This is often the number of bytes in BREAKPOINT | |
126 | but not always. */ | |
127 | ||
128 | #define DECR_PC_AFTER_BREAK 1 | |
129 | ||
130 | /* Nonzero if instruction at PC is a return instruction. */ | |
131 | ||
132 | #define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 1) == 0xc3) | |
133 | ||
134 | /* Return 1 if P points to an invalid floating point value. | |
135 | LEN is the length in bytes -- not relevant on the 386. */ | |
136 | ||
137 | #define INVALID_FLOAT(p, len) (0) | |
138 | ||
139 | /* code to execute to print interesting information about the | |
140 | * floating point processor (if any) | |
141 | * No need to define if there is nothing to do. | |
142 | */ | |
143 | #define FLOAT_INFO { i386_float_info (); } | |
144 | ||
145 | ||
146 | /* Largest integer type */ | |
147 | #define LONGEST long | |
148 | ||
149 | /* Name of the builtin type for the LONGEST type above. */ | |
150 | #define BUILTIN_TYPE_LONGEST builtin_type_long | |
151 | ||
152 | /* Say how long (ordinary) registers are. */ | |
153 | ||
154 | #define REGISTER_TYPE long | |
155 | ||
156 | /* Number of machine registers */ | |
157 | ||
158 | #define NUM_REGS 16 | |
159 | ||
160 | /* Initializer for an array of names of registers. | |
161 | There should be NUM_REGS strings in this initializer. */ | |
162 | ||
163 | /* the order of the first 8 registers must match the compiler's | |
164 | * numbering scheme (which is the same as the 386 scheme) | |
165 | * also, this table must match regmap in i386-pinsn.c. | |
166 | */ | |
167 | #define REGISTER_NAMES { "eax", "ecx", "edx", "ebx", \ | |
168 | "esp", "ebp", "esi", "edi", \ | |
169 | "eip", "ps", "cs", "ss", \ | |
170 | "ds", "es", "fs", "gs", \ | |
171 | } | |
172 | ||
173 | /* Register numbers of various important registers. | |
174 | Note that some of these values are "real" register numbers, | |
175 | and correspond to the general registers of the machine, | |
176 | and some are "phony" register numbers which are too large | |
177 | to be actual register numbers as far as the user is concerned | |
178 | but do serve to get the desired values when passed to read_register. */ | |
179 | ||
180 | #define FP_REGNUM 5 /* Contains address of executing stack frame */ | |
181 | #define SP_REGNUM 4 /* Contains address of top of stack */ | |
182 | ||
183 | #define PC_REGNUM 8 | |
184 | #define PS_REGNUM 9 | |
185 | ||
186 | #define REGISTER_U_ADDR(addr, blockend, regno) \ | |
187 | (addr) = i386_register_u_addr ((blockend),(regno)); | |
188 | ||
189 | /* Total amount of space needed to store our copies of the machine's | |
190 | register state, the array `registers'. */ | |
191 | #define REGISTER_BYTES (NUM_REGS * 4) | |
192 | ||
193 | /* Index within `registers' of the first byte of the space for | |
194 | register N. */ | |
195 | ||
196 | #define REGISTER_BYTE(N) ((N)*4) | |
197 | ||
198 | /* Number of bytes of storage in the actual machine representation | |
199 | for register N. */ | |
200 | ||
201 | #define REGISTER_RAW_SIZE(N) (4) | |
202 | ||
203 | /* Number of bytes of storage in the program's representation | |
204 | for register N. */ | |
205 | ||
206 | #define REGISTER_VIRTUAL_SIZE(N) (4) | |
207 | ||
208 | /* Largest value REGISTER_RAW_SIZE can have. */ | |
209 | ||
210 | #define MAX_REGISTER_RAW_SIZE 4 | |
211 | ||
212 | /* Largest value REGISTER_VIRTUAL_SIZE can have. */ | |
213 | ||
214 | #define MAX_REGISTER_VIRTUAL_SIZE 4 | |
215 | ||
216 | /* Nonzero if register N requires conversion | |
217 | from raw format to virtual format. */ | |
218 | ||
219 | #define REGISTER_CONVERTIBLE(N) (0) | |
220 | ||
221 | /* Convert data from raw format for register REGNUM | |
222 | to virtual format for register REGNUM. */ | |
223 | ||
224 | #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) {bcopy ((FROM), (TO), 4);} | |
225 | ||
226 | /* Convert data from virtual format for register REGNUM | |
227 | to raw format for register REGNUM. */ | |
228 | ||
229 | #define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) {bcopy ((FROM), (TO), 4);} | |
230 | ||
231 | /* Return the GDB type object for the "standard" data type | |
232 | of data in register N. */ | |
233 | ||
234 | #define REGISTER_VIRTUAL_TYPE(N) (builtin_type_int) | |
235 | ||
236 | /* Store the address of the place in which to copy the structure the | |
237 | subroutine will return. This is called from call_function. */ | |
238 | ||
239 | #define STORE_STRUCT_RETURN(ADDR, SP) \ | |
240 | { (SP) -= sizeof (ADDR); \ | |
241 | write_memory ((SP), &(ADDR), sizeof (ADDR)); } | |
242 | ||
243 | /* Extract from an array REGBUF containing the (raw) register state | |
244 | a function return value of type TYPE, and copy that, in virtual format, | |
245 | into VALBUF. */ | |
246 | ||
247 | #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \ | |
248 | bcopy (REGBUF, VALBUF, TYPE_LENGTH (TYPE)) | |
249 | ||
250 | /* Write into appropriate registers a function return value | |
251 | of type TYPE, given in virtual format. */ | |
252 | ||
253 | #define STORE_RETURN_VALUE(TYPE,VALBUF) \ | |
254 | write_register_bytes (0, VALBUF, TYPE_LENGTH (TYPE)) | |
255 | ||
256 | /* Extract from an array REGBUF containing the (raw) register state | |
257 | the address in which a function should return its structure value, | |
258 | as a CORE_ADDR (or an expression that can be used as one). */ | |
259 | ||
260 | #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF)) | |
261 | ||
262 | \f | |
263 | /* Describe the pointer in each stack frame to the previous stack frame | |
264 | (its caller). */ | |
265 | ||
266 | /* FRAME_CHAIN takes a frame's nominal address | |
267 | and produces the frame's chain-pointer. | |
268 | ||
269 | FRAME_CHAIN_COMBINE takes the chain pointer and the frame's nominal address | |
270 | and produces the nominal address of the caller frame. | |
271 | ||
272 | However, if FRAME_CHAIN_VALID returns zero, | |
273 | it means the given frame is the outermost one and has no caller. | |
274 | In that case, FRAME_CHAIN_COMBINE is not used. */ | |
275 | ||
276 | #define FRAME_CHAIN(thisframe) \ | |
277 | (outside_startup_file ((thisframe)->pc) ? \ | |
278 | read_memory_integer ((thisframe)->frame, 4) :\ | |
279 | 0) | |
280 | ||
281 | #define FRAME_CHAIN_VALID(chain, thisframe) \ | |
282 | (chain != 0 && (outside_startup_file (FRAME_SAVED_PC (thisframe)))) | |
283 | ||
284 | #define FRAME_CHAIN_COMBINE(chain, thisframe) (chain) | |
285 | ||
286 | /* Define other aspects of the stack frame. */ | |
287 | ||
288 | /* A macro that tells us whether the function invocation represented | |
289 | by FI does not have a frame on the stack associated with it. If it | |
290 | does not, FRAMELESS is set to 1, else 0. */ | |
291 | #define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \ | |
292 | FRAMELESS_LOOK_FOR_PROLOGUE(FI, FRAMELESS) | |
293 | ||
294 | #define FRAME_SAVED_PC(FRAME) (read_memory_integer ((FRAME)->frame + 4, 4)) | |
295 | ||
296 | #define FRAME_ARGS_ADDRESS(fi) ((fi)->frame) | |
297 | ||
298 | #define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame) | |
299 | ||
300 | /* Return number of args passed to a frame. | |
301 | Can return -1, meaning no way to tell. */ | |
302 | ||
303 | #define FRAME_NUM_ARGS(numargs, fi) (numargs) = i386_frame_num_args(fi) | |
304 | ||
305 | /* Return number of bytes at start of arglist that are not really args. */ | |
306 | ||
307 | #define FRAME_ARGS_SKIP 8 | |
308 | ||
309 | /* Put here the code to store, into a struct frame_saved_regs, | |
310 | the addresses of the saved registers of frame described by FRAME_INFO. | |
311 | This includes special registers such as pc and fp saved in special | |
312 | ways in the stack frame. sp is even more special: | |
313 | the address we return for it IS the sp for the next frame. */ | |
314 | ||
315 | #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \ | |
316 | { i386_frame_find_saved_regs ((frame_info), &(frame_saved_regs)); } | |
317 | ||
318 | \f | |
319 | /* Things needed for making the inferior call functions. */ | |
320 | ||
321 | /* Push an empty stack frame, to record the current PC, etc. */ | |
322 | ||
323 | #define PUSH_DUMMY_FRAME { i386_push_dummy_frame (); } | |
324 | ||
325 | /* Discard from the stack the innermost frame, restoring all registers. */ | |
326 | ||
327 | #define POP_FRAME { i386_pop_frame (); } | |
328 | ||
329 | /* this is | |
330 | * call 11223344 (32 bit relative) | |
331 | * int3 | |
332 | */ | |
333 | ||
334 | #define CALL_DUMMY { 0x223344e8, 0xcc11 } | |
335 | ||
336 | #define CALL_DUMMY_LENGTH 8 | |
337 | ||
338 | #define CALL_DUMMY_START_OFFSET 0 /* Start execution at beginning of dummy */ | |
339 | ||
340 | /* Insert the specified number of args and function address | |
341 | into a call sequence of the above form stored at DUMMYNAME. */ | |
342 | ||
343 | #define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, type) \ | |
344 | { \ | |
345 | int from, to, delta, loc; \ | |
346 | loc = (int)(read_register (SP_REGNUM) - CALL_DUMMY_LENGTH); \ | |
347 | from = loc + 5; \ | |
348 | to = (int)(fun); \ | |
349 | delta = to - from; \ | |
350 | *(int *)((char *)(dummyname) + 1) = delta; \ | |
351 | } | |
352 | ||
353 | \f | |
354 | #if 0 | |
355 | /* Interface definitions for kernel debugger KDB. */ | |
356 | ||
357 | /* Map machine fault codes into signal numbers. | |
358 | First subtract 0, divide by 4, then index in a table. | |
359 | Faults for which the entry in this table is 0 | |
360 | are not handled by KDB; the program's own trap handler | |
361 | gets to handle then. */ | |
362 | ||
363 | #define FAULT_CODE_ORIGIN 0 | |
364 | #define FAULT_CODE_UNITS 4 | |
365 | #define FAULT_TABLE \ | |
366 | { 0, 0, 0, 0, 0, 0, 0, 0, \ | |
367 | 0, 0, 0, 0, 0, 0, 0, 0, \ | |
368 | 0, 0, 0, 0, 0, 0, 0, 0} | |
369 | ||
370 | /* Start running with a stack stretching from BEG to END. | |
371 | BEG and END should be symbols meaningful to the assembler. | |
372 | This is used only for kdb. */ | |
373 | ||
374 | #define INIT_STACK(beg, end) {} | |
375 | ||
376 | /* Push the frame pointer register on the stack. */ | |
377 | #define PUSH_FRAME_PTR {} | |
378 | ||
379 | /* Copy the top-of-stack to the frame pointer register. */ | |
380 | #define POP_FRAME_PTR {} | |
381 | ||
382 | /* After KDB is entered by a fault, push all registers | |
383 | that GDB thinks about (all NUM_REGS of them), | |
384 | so that they appear in order of ascending GDB register number. | |
385 | The fault code will be on the stack beyond the last register. */ | |
386 | ||
387 | #define PUSH_REGISTERS {} | |
388 | ||
389 | /* Assuming the registers (including processor status) have been | |
390 | pushed on the stack in order of ascending GDB register number, | |
391 | restore them and return to the address in the saved PC register. */ | |
392 | ||
393 | #define POP_REGISTERS {} | |
394 | #endif |