gdb/tm-i386v.h

   1 /* Macro definitions for i386, Unix System V.
   2    Copyright 1986, 1987, 1989, 1991, 1992, 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., 675 Mass Ave, Cambridge, MA 02139, USA.  */
  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 /* Define this if the C compiler puts an underscore at the front
  34    of external names before giving them to the linker.  */
  35
  36 /* #define NAMES_HAVE_UNDERSCORE */
  37
  38 /* number of traps that happen between exec'ing the shell
  39  * to run an inferior, and when we finally get to
  40  * the inferior code.  This is 2 on most implementations.
  41  */
  42 #ifndef START_INFERIOR_TRAPS_EXPECTED
  43 #define START_INFERIOR_TRAPS_EXPECTED 4
  44 #endif
  45
  46 /* Offset from address of function to start of its code.
  47    Zero on most machines.  */
  48
  49 #define FUNCTION_START_OFFSET 0
  50
  51 /* Advance PC across any function entry prologue instructions
  52    to reach some "real" code.  */
  53
  54 #define SKIP_PROLOGUE(frompc)   {(frompc) = i386_skip_prologue((frompc));}
  55
  56 extern int
  57 i386_skip_prologue PARAMS ((int));
  58
  59 /* Immediately after a function call, return the saved pc.
  60    Can't always go through the frames for this because on some machines
  61    the new frame is not set up until the new function executes
  62    some instructions.  */
  63
  64 #define SAVED_PC_AFTER_CALL(frame) \
  65   (read_memory_integer (read_register (SP_REGNUM), 4))
  66
  67 /* Address of end of stack space.  */
  68
  69 #define STACK_END_ADDR 0x80000000
  70
  71 /* Stack grows downward.  */
  72
  73 #define INNER_THAN <
  74
  75 /* Sequence of bytes for breakpoint instruction.  */
  76
  77 #define BREAKPOINT {0xcc}
  78
  79 /* Amount PC must be decremented by after a breakpoint.
  80    This is often the number of bytes in BREAKPOINT
  81    but not always.  */
  82
  83 #ifndef DECR_PC_AFTER_BREAK
  84 #define DECR_PC_AFTER_BREAK 1
  85 #endif
  86
  87 /* Nonzero if instruction at PC is a return instruction.  */
  88
  89 #define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 1) == 0xc3)
  90
  91 /* Return 1 if P points to an invalid floating point value.
  92    LEN is the length in bytes -- not relevant on the 386.  */
  93
  94 #define INVALID_FLOAT(p, len) (0)
  95
  96 /* Say how long (ordinary) registers are.  */
  97
  98 #define REGISTER_TYPE long
  99
 100 /* Number of machine registers */
 101
 102 #define NUM_REGS 16
 103
 104 /* Initializer for an array of names of registers.
 105    There should be NUM_REGS strings in this initializer.  */
 106
 107 /* the order of the first 8 registers must match the compiler's
 108  * numbering scheme (which is the same as the 386 scheme)
 109  * also, this table must match regmap in i386-pinsn.c.
 110  */
 111 #define REGISTER_NAMES { "eax", "ecx", "edx", "ebx", \
 112                          "esp", "ebp", "esi", "edi", \
 113                          "eip", "ps", "cs", "ss", \
 114                          "ds", "es", "fs", "gs", \
 115                          }
 116
 117 /* Register numbers of various important registers.
 118    Note that some of these values are "real" register numbers,
 119    and correspond to the general registers of the machine,
 120    and some are "phony" register numbers which are too large
 121    to be actual register numbers as far as the user is concerned
 122    but do serve to get the desired values when passed to read_register.  */
 123
 124 #define FP_REGNUM 5             /* Contains address of executing stack frame */
 125 #define SP_REGNUM 4             /* Contains address of top of stack */
 126
 127 #define PC_REGNUM 8
 128 #define PS_REGNUM 9
 129
 130 /* Total amount of space needed to store our copies of the machine's
 131    register state, the array `registers'.  */
 132 #define REGISTER_BYTES (NUM_REGS * 4)
 133
 134 /* Index within `registers' of the first byte of the space for
 135    register N.  */
 136
 137 #define REGISTER_BYTE(N) ((N)*4)
 138
 139 /* Number of bytes of storage in the actual machine representation
 140    for register N.  */
 141
 142 #define REGISTER_RAW_SIZE(N) (4)
 143
 144 /* Number of bytes of storage in the program's representation
 145    for register N. */
 146
 147 #define REGISTER_VIRTUAL_SIZE(N) (4)
 148
 149 /* Largest value REGISTER_RAW_SIZE can have.  */
 150
 151 #define MAX_REGISTER_RAW_SIZE 4
 152
 153 /* Largest value REGISTER_VIRTUAL_SIZE can have.  */
 154
 155 #define MAX_REGISTER_VIRTUAL_SIZE 4
 156
 157 /* Nonzero if register N requires conversion
 158    from raw format to virtual format.  */
 159
 160 #define REGISTER_CONVERTIBLE(N) (0)
 161
 162 /* Convert data from raw format for register REGNUM
 163    to virtual format for register REGNUM.  */
 164
 165 #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) \
 166   {memcpy ((TO), (FROM), 4);}
 167
 168 /* Convert data from virtual format for register REGNUM
 169    to raw format for register REGNUM.  */
 170
 171 #define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) \
 172   {memcpy ((TO), (FROM), 4);}
 173
 174 /* Return the GDB type object for the "standard" data type
 175    of data in register N.  */
 176 /* Perhaps si and di should go here, but potentially they could be
 177    used for things other than address.  */
 178 #define REGISTER_VIRTUAL_TYPE(N) \
 179   ((N) == PC_REGNUM || (N) == FP_REGNUM || (N) == SP_REGNUM ?         \
 180    lookup_pointer_type (builtin_type_void) : builtin_type_int)
 181
 182 /* Store the address of the place in which to copy the structure the
 183    subroutine will return.  This is called from call_function. */
 184
 185 #define STORE_STRUCT_RETURN(ADDR, SP) \
 186   { (SP) -= sizeof (ADDR);              \
 187     write_memory ((SP), (char *) &(ADDR), sizeof (ADDR)); }
 188
 189 /* Extract from an array REGBUF containing the (raw) register state
 190    a function return value of type TYPE, and copy that, in virtual format,
 191    into VALBUF.  */
 192
 193 #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
 194   memcpy ((VALBUF), (REGBUF), TYPE_LENGTH (TYPE))
 195
 196 /* Write into appropriate registers a function return value
 197    of type TYPE, given in virtual format.  */
 198
 199 #define STORE_RETURN_VALUE(TYPE,VALBUF) \
 200   write_register_bytes (0, VALBUF, TYPE_LENGTH (TYPE))
 201
 202 /* Extract from an array REGBUF containing the (raw) register state
 203    the address in which a function should return its structure value,
 204    as a CORE_ADDR (or an expression that can be used as one).  */
 205
 206 #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF))
 207
 208 \f
 209 /* Describe the pointer in each stack frame to the previous stack frame
 210    (its caller).  */
 211
 212 /* FRAME_CHAIN takes a frame's nominal address
 213    and produces the frame's chain-pointer. */
 214
 215 #define FRAME_CHAIN(thisframe) \
 216   (!inside_entry_file ((thisframe)->pc) ? \
 217    read_memory_integer ((thisframe)->frame, 4) :\
 218    0)
 219
 220 /* Define other aspects of the stack frame.  */
 221
 222 /* A macro that tells us whether the function invocation represented
 223    by FI does not have a frame on the stack associated with it.  If it
 224    does not, FRAMELESS is set to 1, else 0.  */
 225 #define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \
 226   (FRAMELESS) = frameless_look_for_prologue(FI)
 227
 228 #define FRAME_SAVED_PC(FRAME) (read_memory_integer ((FRAME)->frame + 4, 4))
 229
 230 #define FRAME_ARGS_ADDRESS(fi) ((fi)->frame)
 231
 232 #define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame)
 233
 234 /* Return number of args passed to a frame.
 235    Can return -1, meaning no way to tell.  */
 236
 237 #define FRAME_NUM_ARGS(numargs, fi) (numargs) = i386_frame_num_args(fi)
 238
 239 #ifdef __STDC__         /* Forward decl's for prototypes */
 240 struct frame_info;
 241 struct frame_saved_regs;
 242 #endif
 243
 244 extern int
 245 i386_frame_num_args PARAMS ((struct frame_info *));
 246
 247 /* Return number of bytes at start of arglist that are not really args.  */
 248
 249 #define FRAME_ARGS_SKIP 8
 250
 251 /* Put here the code to store, into a struct frame_saved_regs,
 252    the addresses of the saved registers of frame described by FRAME_INFO.
 253    This includes special registers such as pc and fp saved in special
 254    ways in the stack frame.  sp is even more special:
 255    the address we return for it IS the sp for the next frame.  */
 256
 257 #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \
 258 { i386_frame_find_saved_regs ((frame_info), &(frame_saved_regs)); }
 259
 260 extern void
 261 i386_frame_find_saved_regs PARAMS ((struct frame_info *,
 262                                     struct frame_saved_regs *));
 263
 264 \f
 265 /* Things needed for making the inferior call functions.  */
 266
 267 /* Push an empty stack frame, to record the current PC, etc.  */
 268
 269 #define PUSH_DUMMY_FRAME { i386_push_dummy_frame (); }
 270
 271 extern void
 272 i386_push_dummy_frame PARAMS ((void));
 273
 274 /* Discard from the stack the innermost frame, restoring all registers.  */
 275
 276 #define POP_FRAME  { i386_pop_frame (); }
 277
 278 extern void
 279 i386_pop_frame PARAMS ((void));
 280
 281 /* this is
 282  *   call 11223344 (32 bit relative)
 283  *   int3
 284  */
 285
 286 #define CALL_DUMMY { 0x223344e8, 0xcc11 }
 287
 288 #define CALL_DUMMY_LENGTH 8
 289
 290 #define CALL_DUMMY_START_OFFSET 0  /* Start execution at beginning of dummy */
 291
 292 /* Insert the specified number of args and function address
 293    into a call sequence of the above form stored at DUMMYNAME.  */
 294
 295 #define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, gcc_p)   \
 296 { \
 297         int from, to, delta, loc; \
 298         loc = (int)(read_register (SP_REGNUM) - CALL_DUMMY_LENGTH); \
 299         from = loc + 5; \
 300         to = (int)(fun); \
 301         delta = to - from; \
 302         *((char *)(dummyname) + 1) = (delta & 0xff); \
 303         *((char *)(dummyname) + 2) = ((delta >> 8) & 0xff); \
 304         *((char *)(dummyname) + 3) = ((delta >> 16) & 0xff); \
 305         *((char *)(dummyname) + 4) = ((delta >> 24) & 0xff); \
 306 }
 307
 308 extern void
 309 print_387_control_word PARAMS ((unsigned int));
 310
 311 extern void
 312 print_387_status_word PARAMS ((unsigned int));
 313
 314 /* Offset from SP to first arg on stack at first instruction of a function */
 315
 316 #define SP_ARG0 (1 * 4)
 317
 318 #endif  /* !defined (TM_I386V_H) */