1 /* Macro definitions for i386, Unix System V.
2 Copyright 1986, 1987, 1989, 1991, 1992, 1993 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. */
20 #if !defined (TM_I386V_H)
24 * Changes for 80386 by Pace Willisson (pace@prep.ai.mit.edu)
28 #define TARGET_BYTE_ORDER LITTLE_ENDIAN
30 /* turn this on when rest of gdb is ready */
33 /* number of traps that happen between exec'ing the shell
34 * to run an inferior, and when we finally get to
35 * the inferior code. This is 2 on most implementations.
37 #ifndef START_INFERIOR_TRAPS_EXPECTED
38 #define START_INFERIOR_TRAPS_EXPECTED 4
41 /* Offset from address of function to start of its code.
42 Zero on most machines. */
44 #define FUNCTION_START_OFFSET 0
46 /* Advance PC across any function entry prologue instructions
47 to reach some "real" code. */
49 #define SKIP_PROLOGUE(frompc) {(frompc) = i386_skip_prologue((frompc));}
52 i386_skip_prologue
PARAMS ((int));
54 /* Immediately after a function call, return the saved pc.
55 Can't always go through the frames for this because on some machines
56 the new frame is not set up until the new function executes
59 #define SAVED_PC_AFTER_CALL(frame) \
60 (read_memory_integer (read_register (SP_REGNUM), 4))
62 /* Address of end of stack space. */
64 #define STACK_END_ADDR 0x80000000
66 /* Stack grows downward. */
70 /* Sequence of bytes for breakpoint instruction. */
72 #define BREAKPOINT {0xcc}
74 /* Amount PC must be decremented by after a breakpoint.
75 This is often the number of bytes in BREAKPOINT
78 #ifndef DECR_PC_AFTER_BREAK
79 #define DECR_PC_AFTER_BREAK 1
82 /* Nonzero if instruction at PC is a return instruction. */
84 #define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 1) == 0xc3)
86 /* Return 1 if P points to an invalid floating point value.
87 LEN is the length in bytes -- not relevant on the 386. */
89 #define INVALID_FLOAT(p, len) (0)
91 /* Say how long (ordinary) registers are. */
93 #define REGISTER_TYPE long
95 /* Number of machine registers */
99 /* Initializer for an array of names of registers.
100 There should be NUM_REGS strings in this initializer. */
102 /* the order of the first 8 registers must match the compiler's
103 * numbering scheme (which is the same as the 386 scheme)
104 * also, this table must match regmap in i386-pinsn.c.
106 #define REGISTER_NAMES { "eax", "ecx", "edx", "ebx", \
107 "esp", "ebp", "esi", "edi", \
108 "eip", "ps", "cs", "ss", \
109 "ds", "es", "fs", "gs", \
112 /* Register numbers of various important registers.
113 Note that some of these values are "real" register numbers,
114 and correspond to the general registers of the machine,
115 and some are "phony" register numbers which are too large
116 to be actual register numbers as far as the user is concerned
117 but do serve to get the desired values when passed to read_register. */
119 #define FP_REGNUM 5 /* Contains address of executing stack frame */
120 #define SP_REGNUM 4 /* Contains address of top of stack */
125 /* Total amount of space needed to store our copies of the machine's
126 register state, the array `registers'. */
127 #define REGISTER_BYTES (NUM_REGS * 4)
129 /* Index within `registers' of the first byte of the space for
132 #define REGISTER_BYTE(N) ((N)*4)
134 /* Number of bytes of storage in the actual machine representation
137 #define REGISTER_RAW_SIZE(N) (4)
139 /* Number of bytes of storage in the program's representation
142 #define REGISTER_VIRTUAL_SIZE(N) (4)
144 /* Largest value REGISTER_RAW_SIZE can have. */
146 #define MAX_REGISTER_RAW_SIZE 4
148 /* Largest value REGISTER_VIRTUAL_SIZE can have. */
150 #define MAX_REGISTER_VIRTUAL_SIZE 4
152 /* Nonzero if register N requires conversion
153 from raw format to virtual format. */
155 #define REGISTER_CONVERTIBLE(N) (0)
157 /* Convert data from raw format for register REGNUM
158 to virtual format for register REGNUM. */
160 #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) \
161 {memcpy ((TO), (FROM), 4);}
163 /* Convert data from virtual format for register REGNUM
164 to raw format for register REGNUM. */
166 #define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) \
167 {memcpy ((TO), (FROM), 4);}
169 /* Return the GDB type object for the "standard" data type
170 of data in register N. */
171 /* Perhaps si and di should go here, but potentially they could be
172 used for things other than address. */
173 #define REGISTER_VIRTUAL_TYPE(N) \
174 ((N) == PC_REGNUM || (N) == FP_REGNUM || (N) == SP_REGNUM ? \
175 lookup_pointer_type (builtin_type_void) : builtin_type_int)
177 /* Store the address of the place in which to copy the structure the
178 subroutine will return. This is called from call_function. */
180 #define STORE_STRUCT_RETURN(ADDR, SP) \
181 { (SP) -= sizeof (ADDR); \
182 write_memory ((SP), (char *) &(ADDR), sizeof (ADDR)); }
184 /* Extract from an array REGBUF containing the (raw) register state
185 a function return value of type TYPE, and copy that, in virtual format,
188 #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
189 memcpy ((VALBUF), (REGBUF), TYPE_LENGTH (TYPE))
191 /* Write into appropriate registers a function return value
192 of type TYPE, given in virtual format. */
194 #define STORE_RETURN_VALUE(TYPE,VALBUF) \
195 write_register_bytes (0, VALBUF, TYPE_LENGTH (TYPE))
197 /* Extract from an array REGBUF containing the (raw) register state
198 the address in which a function should return its structure value,
199 as a CORE_ADDR (or an expression that can be used as one). */
201 #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF))
204 /* Describe the pointer in each stack frame to the previous stack frame
207 /* FRAME_CHAIN takes a frame's nominal address
208 and produces the frame's chain-pointer. */
210 #define FRAME_CHAIN(thisframe) \
211 (!inside_entry_file ((thisframe)->pc) ? \
212 read_memory_integer ((thisframe)->frame, 4) :\
215 /* Define other aspects of the stack frame. */
217 /* A macro that tells us whether the function invocation represented
218 by FI does not have a frame on the stack associated with it. If it
219 does not, FRAMELESS is set to 1, else 0. */
220 #define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \
221 (FRAMELESS) = frameless_look_for_prologue(FI)
223 #define FRAME_SAVED_PC(FRAME) (read_memory_integer ((FRAME)->frame + 4, 4))
225 #define FRAME_ARGS_ADDRESS(fi) ((fi)->frame)
227 #define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame)
229 /* Return number of args passed to a frame.
230 Can return -1, meaning no way to tell. */
232 #define FRAME_NUM_ARGS(numargs, fi) (numargs) = i386_frame_num_args(fi)
234 #ifdef __STDC__ /* Forward decl's for prototypes */
236 struct frame_saved_regs
;
240 i386_frame_num_args
PARAMS ((struct frame_info
*));
242 /* Return number of bytes at start of arglist that are not really args. */
244 #define FRAME_ARGS_SKIP 8
246 /* Put here the code to store, into a struct frame_saved_regs,
247 the addresses of the saved registers of frame described by FRAME_INFO.
248 This includes special registers such as pc and fp saved in special
249 ways in the stack frame. sp is even more special:
250 the address we return for it IS the sp for the next frame. */
252 #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \
253 { i386_frame_find_saved_regs ((frame_info), &(frame_saved_regs)); }
256 i386_frame_find_saved_regs
PARAMS ((struct frame_info
*,
257 struct frame_saved_regs
*));
260 /* Things needed for making the inferior call functions. */
262 /* Push an empty stack frame, to record the current PC, etc. */
264 #define PUSH_DUMMY_FRAME { i386_push_dummy_frame (); }
267 i386_push_dummy_frame
PARAMS ((void));
269 /* Discard from the stack the innermost frame, restoring all registers. */
271 #define POP_FRAME { i386_pop_frame (); }
274 i386_pop_frame
PARAMS ((void));
277 * call 11223344 (32 bit relative)
281 #define CALL_DUMMY { 0x223344e8, 0xcc11 }
283 #define CALL_DUMMY_LENGTH 8
285 #define CALL_DUMMY_START_OFFSET 0 /* Start execution at beginning of dummy */
287 /* Insert the specified number of args and function address
288 into a call sequence of the above form stored at DUMMYNAME. */
290 #define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, gcc_p) \
292 int from, to, delta, loc; \
293 loc = (int)(read_register (SP_REGNUM) - CALL_DUMMY_LENGTH); \
297 *((char *)(dummyname) + 1) = (delta & 0xff); \
298 *((char *)(dummyname) + 2) = ((delta >> 8) & 0xff); \
299 *((char *)(dummyname) + 3) = ((delta >> 16) & 0xff); \
300 *((char *)(dummyname) + 4) = ((delta >> 24) & 0xff); \
304 print_387_control_word
PARAMS ((unsigned int));
307 print_387_status_word
PARAMS ((unsigned int));
309 /* Offset from SP to first arg on stack at first instruction of a function */
311 #define SP_ARG0 (1 * 4)
313 #endif /* !defined (TM_I386V_H) */