]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blame - gdb/config/i386/tm-i386v.h
Add ppc-opcode-stupid
[thirdparty/binutils-gdb.git] / gdb / config / i386 / tm-i386v.h
CommitLineData
5076de82
FF
1/* Macro definitions for i386, Unix System V.
2 Copyright 1986, 1987, 1989, 1991, 1992, 1993 Free Software Foundation, Inc.
3
4This file is part of GDB.
5
6This program is free software; you can redistribute it and/or modify
7it under the terms of the GNU General Public License as published by
8the Free Software Foundation; either version 2 of the License, or
9(at your option) any later version.
10
11This program is distributed in the hope that it will be useful,
12but WITHOUT ANY WARRANTY; without even the implied warranty of
13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14GNU General Public License for more details.
15
16You should have received a copy of the GNU General Public License
17along with this program; if not, write to the Free Software
6c9638b4 18Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
5076de82
FF
19
20#if !defined (TM_I386V_H)
21#define TM_I386V_H 1
22
23/*
24 * Changes for 80386 by Pace Willisson (pace@prep.ai.mit.edu)
25 * July 1988
26 */
27
28#define TARGET_BYTE_ORDER LITTLE_ENDIAN
29
30/* turn this on when rest of gdb is ready */
31#define IEEE_FLOAT
32
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.
36 */
37#ifndef START_INFERIOR_TRAPS_EXPECTED
38#define START_INFERIOR_TRAPS_EXPECTED 4
39#endif
40
41/* Offset from address of function to start of its code.
42 Zero on most machines. */
43
44#define FUNCTION_START_OFFSET 0
45
46/* Advance PC across any function entry prologue instructions
47 to reach some "real" code. */
48
49#define SKIP_PROLOGUE(frompc) {(frompc) = i386_skip_prologue((frompc));}
50
51extern int
52i386_skip_prologue PARAMS ((int));
53
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
57 some instructions. */
58
59#define SAVED_PC_AFTER_CALL(frame) \
60 (read_memory_integer (read_register (SP_REGNUM), 4))
61
5076de82
FF
62/* Stack grows downward. */
63
64#define INNER_THAN <
65
66/* Sequence of bytes for breakpoint instruction. */
67
68#define BREAKPOINT {0xcc}
69
70/* Amount PC must be decremented by after a breakpoint.
71 This is often the number of bytes in BREAKPOINT
72 but not always. */
73
74#ifndef DECR_PC_AFTER_BREAK
75#define DECR_PC_AFTER_BREAK 1
76#endif
77
78/* Nonzero if instruction at PC is a return instruction. */
79
80#define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 1) == 0xc3)
81
f4f0d174
JK
82/* Say how long (ordinary) registers are. This is a piece of bogosity
83 used in push_word and a few other places; REGISTER_RAW_SIZE is the
84 real way to know how big a register is. */
5076de82 85
f4f0d174 86#define REGISTER_SIZE 4
5076de82
FF
87
88/* Number of machine registers */
89
90#define NUM_REGS 16
91
92/* Initializer for an array of names of registers.
93 There should be NUM_REGS strings in this initializer. */
94
95/* the order of the first 8 registers must match the compiler's
96 * numbering scheme (which is the same as the 386 scheme)
97 * also, this table must match regmap in i386-pinsn.c.
98 */
99#define REGISTER_NAMES { "eax", "ecx", "edx", "ebx", \
100 "esp", "ebp", "esi", "edi", \
101 "eip", "ps", "cs", "ss", \
102 "ds", "es", "fs", "gs", \
103 }
104
105/* Register numbers of various important registers.
106 Note that some of these values are "real" register numbers,
107 and correspond to the general registers of the machine,
108 and some are "phony" register numbers which are too large
109 to be actual register numbers as far as the user is concerned
110 but do serve to get the desired values when passed to read_register. */
111
112#define FP_REGNUM 5 /* Contains address of executing stack frame */
113#define SP_REGNUM 4 /* Contains address of top of stack */
114
115#define PC_REGNUM 8
116#define PS_REGNUM 9
117
118/* Total amount of space needed to store our copies of the machine's
119 register state, the array `registers'. */
120#define REGISTER_BYTES (NUM_REGS * 4)
121
122/* Index within `registers' of the first byte of the space for
123 register N. */
124
125#define REGISTER_BYTE(N) ((N)*4)
126
127/* Number of bytes of storage in the actual machine representation
128 for register N. */
129
130#define REGISTER_RAW_SIZE(N) (4)
131
132/* Number of bytes of storage in the program's representation
133 for register N. */
134
135#define REGISTER_VIRTUAL_SIZE(N) (4)
136
137/* Largest value REGISTER_RAW_SIZE can have. */
138
139#define MAX_REGISTER_RAW_SIZE 4
140
141/* Largest value REGISTER_VIRTUAL_SIZE can have. */
142
143#define MAX_REGISTER_VIRTUAL_SIZE 4
144
5076de82
FF
145/* Return the GDB type object for the "standard" data type
146 of data in register N. */
147/* Perhaps si and di should go here, but potentially they could be
148 used for things other than address. */
149#define REGISTER_VIRTUAL_TYPE(N) \
150 ((N) == PC_REGNUM || (N) == FP_REGNUM || (N) == SP_REGNUM ? \
151 lookup_pointer_type (builtin_type_void) : builtin_type_int)
152
153/* Store the address of the place in which to copy the structure the
154 subroutine will return. This is called from call_function. */
155
156#define STORE_STRUCT_RETURN(ADDR, SP) \
157 { (SP) -= sizeof (ADDR); \
158 write_memory ((SP), (char *) &(ADDR), sizeof (ADDR)); }
159
160/* Extract from an array REGBUF containing the (raw) register state
161 a function return value of type TYPE, and copy that, in virtual format,
162 into VALBUF. */
163
164#define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
165 memcpy ((VALBUF), (REGBUF), TYPE_LENGTH (TYPE))
166
167/* Write into appropriate registers a function return value
168 of type TYPE, given in virtual format. */
169
170#define STORE_RETURN_VALUE(TYPE,VALBUF) \
171 write_register_bytes (0, VALBUF, TYPE_LENGTH (TYPE))
172
173/* Extract from an array REGBUF containing the (raw) register state
174 the address in which a function should return its structure value,
175 as a CORE_ADDR (or an expression that can be used as one). */
176
177#define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF))
178
179\f
180/* Describe the pointer in each stack frame to the previous stack frame
181 (its caller). */
182
183/* FRAME_CHAIN takes a frame's nominal address
184 and produces the frame's chain-pointer. */
185
186#define FRAME_CHAIN(thisframe) \
187 (!inside_entry_file ((thisframe)->pc) ? \
188 read_memory_integer ((thisframe)->frame, 4) :\
189 0)
190
191/* Define other aspects of the stack frame. */
192
193/* A macro that tells us whether the function invocation represented
194 by FI does not have a frame on the stack associated with it. If it
195 does not, FRAMELESS is set to 1, else 0. */
196#define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \
197 (FRAMELESS) = frameless_look_for_prologue(FI)
198
199#define FRAME_SAVED_PC(FRAME) (read_memory_integer ((FRAME)->frame + 4, 4))
200
201#define FRAME_ARGS_ADDRESS(fi) ((fi)->frame)
202
203#define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame)
204
205/* Return number of args passed to a frame.
206 Can return -1, meaning no way to tell. */
207
56eec3c7 208#define FRAME_NUM_ARGS(numargs, fi) (numargs) = -1
5076de82
FF
209
210#ifdef __STDC__ /* Forward decl's for prototypes */
211struct frame_info;
212struct frame_saved_regs;
213#endif
214
215extern int
216i386_frame_num_args PARAMS ((struct frame_info *));
217
218/* Return number of bytes at start of arglist that are not really args. */
219
220#define FRAME_ARGS_SKIP 8
221
222/* Put here the code to store, into a struct frame_saved_regs,
223 the addresses of the saved registers of frame described by FRAME_INFO.
224 This includes special registers such as pc and fp saved in special
225 ways in the stack frame. sp is even more special:
226 the address we return for it IS the sp for the next frame. */
227
228#define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \
229{ i386_frame_find_saved_regs ((frame_info), &(frame_saved_regs)); }
230
231extern void
232i386_frame_find_saved_regs PARAMS ((struct frame_info *,
233 struct frame_saved_regs *));
234
235\f
236/* Things needed for making the inferior call functions. */
237
238/* Push an empty stack frame, to record the current PC, etc. */
239
240#define PUSH_DUMMY_FRAME { i386_push_dummy_frame (); }
241
242extern void
243i386_push_dummy_frame PARAMS ((void));
244
245/* Discard from the stack the innermost frame, restoring all registers. */
246
247#define POP_FRAME { i386_pop_frame (); }
248
249extern void
250i386_pop_frame PARAMS ((void));
251
252/* this is
253 * call 11223344 (32 bit relative)
254 * int3
255 */
256
257#define CALL_DUMMY { 0x223344e8, 0xcc11 }
258
259#define CALL_DUMMY_LENGTH 8
260
261#define CALL_DUMMY_START_OFFSET 0 /* Start execution at beginning of dummy */
262
f0d2557c
PS
263#define CALL_DUMMY_BREAKPOINT_OFFSET 5
264
5076de82
FF
265/* Insert the specified number of args and function address
266 into a call sequence of the above form stored at DUMMYNAME. */
267
268#define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, gcc_p) \
269{ \
270 int from, to, delta, loc; \
271 loc = (int)(read_register (SP_REGNUM) - CALL_DUMMY_LENGTH); \
272 from = loc + 5; \
273 to = (int)(fun); \
274 delta = to - from; \
275 *((char *)(dummyname) + 1) = (delta & 0xff); \
276 *((char *)(dummyname) + 2) = ((delta >> 8) & 0xff); \
277 *((char *)(dummyname) + 3) = ((delta >> 16) & 0xff); \
278 *((char *)(dummyname) + 4) = ((delta >> 24) & 0xff); \
279}
280
281extern void
282print_387_control_word PARAMS ((unsigned int));
283
284extern void
285print_387_status_word PARAMS ((unsigned int));
286
287/* Offset from SP to first arg on stack at first instruction of a function */
288
289#define SP_ARG0 (1 * 4)
290
291#endif /* !defined (TM_I386V_H) */