gdb/tm-i386v.h

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