gdb/tm-sun386.h

   1 /* Parameters for execution on a Sun 386i, for GDB, the GNU debugger.
   2    Copyright (C) 1986, 1987 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 #define TARGET_BYTE_ORDER LITTLE_ENDIAN
  21
  22 #ifndef sun386
  23 #define sun386
  24 #endif
  25 #define GDB_TARGET_IS_SUN386 1
  26 #define SUNOS4
  27 #define USE_MACHINE_REG_H
  28
  29 /* Perhaps some day this will work even without the following #define */
  30 #define COFF_ENCAPSULATE
  31
  32 #ifdef COFF_ENCAPSULATE
  33 #define NAMES_HAVE_UNDERSCORE
  34 /* Avoid conflicts between "a.out.gnu.h" and <sys/exec.h> */
  35 #define _EXEC_
  36 #endif
  37
  38 /* sun386 ptrace seems unable to change the frame pointer */
  39 #define PTRACE_FP_BUG
  40
  41 /* Debugger information will be in DBX format.  */
  42
  43 #define READ_DBX_FORMAT
  44
  45 /* Offset from address of function to start of its code.
  46    Zero on most machines.  */
  47
  48 #define FUNCTION_START_OFFSET 0
  49
  50 /* Advance PC across any function entry prologue instructions
  51    to reach some "real" code.  */
  52
  53 #define SKIP_PROLOGUE(frompc)   {(frompc) = i386_skip_prologue((frompc));}
  54
  55 /* Immediately after a function call, return the saved pc.
  56    Can't always go through the frames for this because on some machines
  57    the new frame is not set up until the new function executes
  58    some instructions.  */
  59
  60 #define SAVED_PC_AFTER_CALL(frame) \
  61   (read_memory_integer (read_register (SP_REGNUM), 4))
  62
  63 /* Address of end of stack space.  */
  64
  65 #define STACK_END_ADDR 0xfc000000
  66
  67 /* Stack grows downward.  */
  68
  69 #define INNER_THAN <
  70
  71 /* Sequence of bytes for breakpoint instruction.  */
  72
  73 #define BREAKPOINT {0xcc}
  74
  75 /* Amount PC must be decremented by after a breakpoint.
  76    This is often the number of bytes in BREAKPOINT
  77    but not always.  */
  78
  79 #define DECR_PC_AFTER_BREAK 1
  80
  81 /* Nonzero if instruction at PC is a return instruction.  */
  82
  83 #define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 1) == 0xc3)
  84
  85 /* Return 1 if P points to an invalid floating point value.
  86    LEN is the length in bytes -- not relevant on the 386.  */
  87
  88 #define INVALID_FLOAT(p, len) (0)
  89
  90 /* Largest integer type */
  91 #define LONGEST long
  92
  93 /* Name of the builtin type for the LONGEST type above. */
  94 #define BUILTIN_TYPE_LONGEST builtin_type_long
  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 35
 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 { "gs", "fs", "es", "ds",                \
 112                          "edi", "esi", "ebp", "esp",            \
 113                          "ebx", "edx", "ecx", "eax",            \
 114                          "retaddr", "trapnum", "errcode", "ip", \
 115                          "cs", "ps", "sp", "ss",                \
 116                          "fst0", "fst1", "fst2", "fst3",        \
 117                          "fst4", "fst5", "fst6", "fst7",        \
 118                          "fctrl", "fstat", "ftag", "fip",       \
 119                          "fcs", "fopoff", "fopsel"              \
 120                          }
 121
 122 /* Register numbers of various important registers.
 123    Note that some of these values are "real" register numbers,
 124    and correspond to the general registers of the machine,
 125    and some are "phony" register numbers which are too large
 126    to be actual register numbers as far as the user is concerned
 127    but do serve to get the desired values when passed to read_register.  */
 128
 129 #define FP_REGNUM 6             /* Contains address of executing stack frame */
 130 #define SP_REGNUM 18            /* Contains address of top of stack */
 131 #define PS_REGNUM 17            /* Contains processor status */
 132 #define PC_REGNUM 15            /* Contains program counter */
 133 #define FP0_REGNUM 20           /* Floating point register 0 */
 134 #define FPC_REGNUM 28           /* 80387 control register */
 135
 136 /* Total amount of space needed to store our copies of the machine's
 137    register state, the array `registers'.  */
 138 #define REGISTER_BYTES (20*4+8*10+7*4)
 139
 140 /* Index within `registers' of the first byte of the space for
 141    register N.  */
 142
 143 #define REGISTER_BYTE(N) \
 144  ((N) >= FPC_REGNUM ? (((N) - FPC_REGNUM) * 4) + 160    \
 145   : (N) >= FP0_REGNUM ? (((N) - FP0_REGNUM) * 10) + 80  \
 146   : (N) * 4)
 147
 148 /* Number of bytes of storage in the actual machine representation
 149    for register N.  */
 150
 151 #define REGISTER_RAW_SIZE(N) (((unsigned)((N) - FP0_REGNUM)) < 8 ? 10 : 4)
 152
 153 /* Number of bytes of storage in the program's representation
 154    for register N. */
 155
 156 #define REGISTER_VIRTUAL_SIZE(N) (((unsigned)((N) - FP0_REGNUM)) < 8 ? 8 : 4)
 157
 158 /* Largest value REGISTER_RAW_SIZE can have.  */
 159
 160 #define MAX_REGISTER_RAW_SIZE 10
 161
 162 /* Largest value REGISTER_VIRTUAL_SIZE can have.  */
 163
 164 #define MAX_REGISTER_VIRTUAL_SIZE 8
 165
 166 /* Nonzero if register N requires conversion
 167    from raw format to virtual format.  */
 168
 169 #define REGISTER_CONVERTIBLE(N) (((unsigned)((N) - FP0_REGNUM)) < 8)
 170
 171 /* Convert data from raw format for register REGNUM
 172    to virtual format for register REGNUM.  */
 173
 174 #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO)     \
 175 { if ((REGNUM) >= FP0_REGNUM && (REGNUM) < FPC_REGNUM)  \
 176     i387_to_double ((FROM), (TO));                      \
 177   else                                                  \
 178     bcopy ((FROM), (TO), 4); }
 179
 180 /* Convert data from virtual format for register REGNUM
 181    to raw format for register REGNUM.  */
 182
 183 #define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO)         \
 184 { if ((REGNUM) >= FP0_REGNUM && (REGNUM) < FPC_REGNUM)  \
 185     double_to_i387 ((FROM), (TO));      \
 186   else                                  \
 187     bcopy ((FROM), (TO), 4); }
 188
 189 /* Return the GDB type object for the "standard" data type
 190    of data in register N.  */
 191
 192 #define REGISTER_VIRTUAL_TYPE(N) \
 193  (((unsigned)((N) - FP0_REGNUM)) < 8 ? builtin_type_double : builtin_type_int)
 194
 195 /* Store the address of the place in which to copy the structure the
 196    subroutine will return.  This is called from call_function. */
 197
 198 #define STORE_STRUCT_RETURN(ADDR, SP) \
 199   { (SP) -= sizeof (ADDR);              \
 200     write_memory ((SP), &(ADDR), sizeof (ADDR)); }
 201
 202 /* Extract from an array REGBUF containing the (raw) register state
 203    a function return value of type TYPE, and copy that, in virtual format,
 204    into VALBUF.  */
 205
 206 #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
 207   bcopy (REGBUF + REGISTER_BYTE (TYPE_CODE (TYPE) == TYPE_CODE_FLT ? FP0_REGNUM : 11), VALBUF, TYPE_LENGTH (TYPE))
 208
 209 /* Write into appropriate registers a function return value
 210    of type TYPE, given in virtual format.  */
 211
 212 #define STORE_RETURN_VALUE(TYPE,VALBUF) \
 213   write_register_bytes (REGISTER_BYTE (TYPE_CODE (TYPE) == TYPE_CODE_FLT ? FP0_REGNUM : 11), VALBUF, TYPE_LENGTH (TYPE))
 214
 215 /* Extract from an array REGBUF containing the (raw) register state
 216    the address in which a function should return its structure value,
 217    as a CORE_ADDR (or an expression that can be used as one).  */
 218
 219 #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF))
 220 \f
 221 /* Describe the pointer in each stack frame to the previous stack frame
 222    (its caller).  */
 223
 224 /* FRAME_CHAIN takes a frame's nominal address
 225    and produces the frame's chain-pointer.
 226
 227    FRAME_CHAIN_COMBINE takes the chain pointer and the frame's nominal address
 228    and produces the nominal address of the caller frame.
 229
 230    However, if FRAME_CHAIN_VALID returns zero,
 231    it means the given frame is the outermost one and has no caller.
 232    In that case, FRAME_CHAIN_COMBINE is not used.  */
 233
 234 #define FRAME_CHAIN(thisframe) \
 235   (outside_startup_file ((thisframe)->pc) ? \
 236    read_memory_integer ((thisframe)->frame, 4) :\
 237    0)
 238
 239 #define FRAME_CHAIN_VALID(chain, thisframe) \
 240   (chain != 0 && (outside_startup_file (FRAME_SAVED_PC (thisframe))))
 241
 242 #define FRAME_CHAIN_COMBINE(chain, thisframe) (chain)
 243
 244 /* Define other aspects of the stack frame.  */
 245
 246 /* A macro that tells us whether the function invocation represented
 247    by FI does not have a frame on the stack associated with it.  If it
 248    does not, FRAMELESS is set to 1, else 0.  */
 249 #define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \
 250 { (FRAMELESS) = frameless_look_for_prologue (FI); }
 251
 252 #define FRAME_SAVED_PC(FRAME) (read_memory_integer ((FRAME)->frame + 4, 4))
 253
 254 #define FRAME_ARGS_ADDRESS(fi) ((fi)->frame)
 255
 256 #define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame)
 257
 258 /* Return number of args passed to a frame.
 259    Can return -1, meaning no way to tell.  */
 260
 261 #define FRAME_NUM_ARGS(numargs, fi) (numargs) = i386_frame_num_args(fi)
 262
 263 /* Return number of bytes at start of arglist that are not really args.  */
 264
 265 #define FRAME_ARGS_SKIP 8
 266
 267 /* Put here the code to store, into a struct frame_saved_regs,
 268    the addresses of the saved registers of frame described by FRAME_INFO.
 269    This includes special registers such as pc and fp saved in special
 270    ways in the stack frame.  sp is even more special:
 271    the address we return for it IS the sp for the next frame.  */
 272
 273 #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \
 274 { i386_frame_find_saved_regs ((frame_info), &(frame_saved_regs)); }
 275
 276 \f
 277 /* Things needed for making the inferior call functions.  */
 278
 279 /* Push an empty stack frame, to record the current PC, etc.  */
 280
 281 #define PUSH_DUMMY_FRAME { i386_push_dummy_frame (); }
 282
 283 /* Discard from the stack the innermost frame, restoring all registers.  */
 284
 285 #define POP_FRAME  { i386_pop_frame (); }
 286
 287 /* this is
 288  *   call 11223344 (32 bit relative)
 289  *   int3
 290  */
 291
 292 #define CALL_DUMMY { 0x223344e8, 0xcc11 }
 293
 294 #define CALL_DUMMY_LENGTH 8
 295
 296 #define CALL_DUMMY_START_OFFSET 0  /* Start execution at beginning of dummy */
 297
 298 /* Insert the specified number of args and function address
 299    into a call sequence of the above form stored at DUMMYNAME.  */
 300
 301 #define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, gcc_p)   \
 302 { \
 303         *(int *)((char *)(dummyname) + 1) = (int)(fun) - (pc) - 5; \
 304 }