| 1 | /* Definitions to make GDB target for a tahoe running 4.3-Reno. |
| 2 | Copyright (C) 1986, 1987, 1989, 1991 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 | /* |
| 21 | * Ported by the State University of New York at Buffalo by the Distributed |
| 22 | * Computer Systems Lab, Department of Computer Science, 1991. |
| 23 | */ |
| 24 | |
| 25 | #define TARGET_BYTE_ORDER BIG_ENDIAN |
| 26 | #define BITS_BIG_ENDIAN 0 |
| 27 | |
| 28 | /* Define this if the C compiler puts an underscore at the front |
| 29 | of external names before giving them to the linker. */ |
| 30 | |
| 31 | #define NAMES_HAVE_UNDERSCORE |
| 32 | |
| 33 | /* Offset from address of function to start of its code. |
| 34 | Zero on most machines. */ |
| 35 | |
| 36 | #define FUNCTION_START_OFFSET 2 |
| 37 | |
| 38 | /* Advance PC across any function entry prologue instructions |
| 39 | to reach some "real" code. */ |
| 40 | |
| 41 | #define SKIP_PROLOGUE(pc) \ |
| 42 | { register int op = (unsigned char) read_memory_integer (pc, 1); \ |
| 43 | if (op == 0x11) pc += 2; /* skip brb */ \ |
| 44 | if (op == 0x13) pc += 3; /* skip brw */ \ |
| 45 | if (op == 0x2c && \ |
| 46 | ((unsigned char) read_memory_integer (pc+2, 1)) == 0x5e) \ |
| 47 | pc += 3; /* skip subl2 */ \ |
| 48 | if (op == 0xe9 && \ |
| 49 | ((unsigned char) read_memory_integer (pc+1, 1)) == 0xae && \ |
| 50 | ((unsigned char) read_memory_integer(pc+3, 1)) == 0x5e) \ |
| 51 | pc += 4; /* skip movab */ \ |
| 52 | if (op == 0xe9 && \ |
| 53 | ((unsigned char) read_memory_integer (pc+1, 1)) == 0xce && \ |
| 54 | ((unsigned char) read_memory_integer(pc+4, 1)) == 0x5e) \ |
| 55 | pc += 5; /* skip movab */ \ |
| 56 | if (op == 0xe9 && \ |
| 57 | ((unsigned char) read_memory_integer (pc+1, 1)) == 0xee && \ |
| 58 | ((unsigned char) read_memory_integer(pc+6, 1)) == 0x5e) \ |
| 59 | pc += 7; /* skip movab */ \ |
| 60 | } |
| 61 | |
| 62 | /* Immediately after a function call, return the saved pc. |
| 63 | Can't always go through the frames for this because on some machines |
| 64 | the new frame is not set up until the new function executes |
| 65 | some instructions. */ |
| 66 | |
| 67 | #define SAVED_PC_AFTER_CALL(frame) FRAME_SAVED_PC(frame) |
| 68 | |
| 69 | /* Wrong for cross-debugging. I don't know the real values. */ |
| 70 | #include <machine/param.h> |
| 71 | #define TARGET_UPAGES UPAGES |
| 72 | #define TARGET_NBPG NBPG |
| 73 | |
| 74 | /* This is the amount to subtract from u.u_ar0 |
| 75 | to get the offset in the core file of the register values. */ |
| 76 | |
| 77 | #define KERNEL_U_ADDR (0xc0000000 - (TARGET_UPAGES * TARGET_NBPG)) |
| 78 | |
| 79 | /* Address of end of stack space. */ |
| 80 | |
| 81 | #define STACK_END_ADDR (0xc0000000 - (TARGET_UPAGES * TARGET_NBPG)) |
| 82 | |
| 83 | /* On BSD, sigtramp is in the u area. Can't check the exact |
| 84 | addresses because for cross-debugging we don't have target include |
| 85 | files around. This should be close enough. */ |
| 86 | #define IN_SIGTRAMP(pc, name) ((pc) >= STACK_END_ADDR && (pc < 0xc0000000)) |
| 87 | |
| 88 | /* Stack grows downward. */ |
| 89 | |
| 90 | #define INNER_THAN < |
| 91 | |
| 92 | /* Sequence of bytes for breakpoint instruction. */ |
| 93 | |
| 94 | #define BREAKPOINT {0x30} |
| 95 | |
| 96 | /* Amount PC must be decremented by after a breakpoint. |
| 97 | This is often the number of bytes in BREAKPOINT |
| 98 | but not always. */ |
| 99 | |
| 100 | #define DECR_PC_AFTER_BREAK 0 |
| 101 | |
| 102 | /* Nonzero if instruction at PC is a return instruction. */ |
| 103 | |
| 104 | #define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 1) == 0x40) |
| 105 | |
| 106 | /* Return 1 if P points to an invalid floating point value. |
| 107 | LEN is the length in bytes -- not relevant on the Tahoe. */ |
| 108 | |
| 109 | #define INVALID_FLOAT(p, len) ((*(short *) p & 0xff80) == 0x8000) |
| 110 | |
| 111 | /* Say how long (ordinary) registers are. */ |
| 112 | |
| 113 | #define REGISTER_TYPE long |
| 114 | |
| 115 | /* Number of machine registers */ |
| 116 | |
| 117 | #define NUM_REGS 19 |
| 118 | |
| 119 | /* Initializer for an array of names of registers. |
| 120 | There should be NUM_REGS strings in this initializer. */ |
| 121 | |
| 122 | #define REGISTER_NAMES {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", "r9", "r10", "r11", "r12", "fp", "sp", "pc", "ps", "al", "ah"} |
| 123 | |
| 124 | #define FP_REGNUM 13 /* Contains address of executing stack frame */ |
| 125 | #define SP_REGNUM 14 /* Contains address of top of stack */ |
| 126 | #define PC_REGNUM 15 /* Contains program counter */ |
| 127 | #define PS_REGNUM 16 /* Contains processor status */ |
| 128 | |
| 129 | #define AL_REGNUM 17 /* Contains accumulator */ |
| 130 | #define AH_REGNUM 18 |
| 131 | |
| 132 | /* Total amount of space needed to store our copies of the machine's |
| 133 | register state, the array `registers'. */ |
| 134 | |
| 135 | #define REGISTER_BYTES (19*4) |
| 136 | |
| 137 | /* Index within `registers' of the first byte of the space for |
| 138 | register N. */ |
| 139 | |
| 140 | #define REGISTER_BYTE(N) ((N) * 4) |
| 141 | |
| 142 | /* Number of bytes of storage in the actual machine representation |
| 143 | for register N. On the tahoe, all regs are 4 bytes. */ |
| 144 | |
| 145 | #define REGISTER_RAW_SIZE(N) 4 |
| 146 | |
| 147 | /* Number of bytes of storage in the program's representation |
| 148 | for register N. On the tahoe, all regs are 4 bytes. */ |
| 149 | |
| 150 | #define REGISTER_VIRTUAL_SIZE(N) 4 |
| 151 | |
| 152 | /* Largest value REGISTER_RAW_SIZE can have. */ |
| 153 | |
| 154 | #define MAX_REGISTER_RAW_SIZE 4 |
| 155 | |
| 156 | /* Largest value REGISTER_VIRTUAL_SIZE can have. */ |
| 157 | |
| 158 | #define MAX_REGISTER_VIRTUAL_SIZE 4 |
| 159 | |
| 160 | /* Nonzero if register N requires conversion |
| 161 | from raw format to virtual format. */ |
| 162 | |
| 163 | #define REGISTER_CONVERTIBLE(N) 0 |
| 164 | |
| 165 | /* Convert data from raw format for register REGNUM |
| 166 | to virtual format for register REGNUM. */ |
| 167 | |
| 168 | #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) \ |
| 169 | bcopy ((FROM), (TO), 4); |
| 170 | |
| 171 | /* Convert data from virtual format for register REGNUM |
| 172 | to raw format for register REGNUM. */ |
| 173 | |
| 174 | #define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) \ |
| 175 | bcopy ((FROM), (TO), 4); |
| 176 | |
| 177 | /* Return the GDB type object for the "standard" data type |
| 178 | of data in register N. */ |
| 179 | |
| 180 | #define REGISTER_VIRTUAL_TYPE(N) 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 | { write_register (1, (ADDR)); } |
| 187 | |
| 188 | /* Extract from an array REGBUF containing the (raw) register state |
| 189 | a function return value of type TYPE, and copy that, in virtual format, |
| 190 | into VALBUF. */ |
| 191 | |
| 192 | #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \ |
| 193 | bcopy (REGBUF, VALBUF, TYPE_LENGTH (TYPE)) |
| 194 | |
| 195 | /* Write into appropriate registers a function return value |
| 196 | of type TYPE, given in virtual format. */ |
| 197 | |
| 198 | #define STORE_RETURN_VALUE(TYPE,VALBUF) \ |
| 199 | write_register_bytes (0, VALBUF, TYPE_LENGTH (TYPE)) |
| 200 | |
| 201 | /* Extract from an array REGBUF containing the (raw) register state |
| 202 | the address in which a function should return its structure value, |
| 203 | as a CORE_ADDR (or an expression that can be used as one). */ |
| 204 | |
| 205 | #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)(REGBUF)) |
| 206 | |
| 207 | /* Describe the pointer in each stack frame to the previous stack frame |
| 208 | (its caller). |
| 209 | |
| 210 | FRAME_CHAIN takes a frame's nominal address |
| 211 | and produces the frame's chain-pointer. */ |
| 212 | |
| 213 | /* In the case of the Tahoe, the frame's nominal address is the FP value, |
| 214 | and it points to the old FP */ |
| 215 | |
| 216 | #define FRAME_CHAIN(thisframe) \ |
| 217 | (!inside_entry_file ((thisframe)->pc) ? \ |
| 218 | read_memory_integer ((thisframe)->frame, 4) :\ |
| 219 | 0) |
| 220 | |
| 221 | /* Define other aspects of the stack frame. */ |
| 222 | |
| 223 | /* Saved PC */ |
| 224 | |
| 225 | #define FRAME_SAVED_PC(FRAME) (read_memory_integer ((FRAME)->frame - 8, 4)) |
| 226 | |
| 227 | /* In most of GDB, getting the args address is too important to |
| 228 | just say "I don't know". */ |
| 229 | |
| 230 | #define FRAME_ARGS_ADDRESS(fi) ((fi)->frame) |
| 231 | |
| 232 | /* Address to use as an anchor for finding local variables */ |
| 233 | |
| 234 | #define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame) |
| 235 | |
| 236 | /* Return number of args passed to a frame. |
| 237 | Can return -1, meaning no way to tell. */ |
| 238 | |
| 239 | #define FRAME_NUM_ARGS(numargs, fi) \ |
| 240 | { numargs = ((0xffff & read_memory_integer(((fi)->frame-4),4)) - 4) >> 2; } |
| 241 | |
| 242 | /* Return number of bytes at start of arglist that are not really args. */ |
| 243 | |
| 244 | #define FRAME_ARGS_SKIP 0 |
| 245 | |
| 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. */ |
| 251 | |
| 252 | #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \ |
| 253 | { register int regnum; \ |
| 254 | register int rmask = read_memory_integer ((frame_info)->frame-4, 4) >> 16;\ |
| 255 | register CORE_ADDR next_addr; \ |
| 256 | bzero (&frame_saved_regs, sizeof frame_saved_regs); \ |
| 257 | next_addr = (frame_info)->frame - 8; \ |
| 258 | for (regnum = 12; regnum >= 0; regnum--, rmask <<= 1) \ |
| 259 | (frame_saved_regs).regs[regnum] = (rmask & 0x1000) ? (next_addr -= 4) : 0;\ |
| 260 | (frame_saved_regs).regs[SP_REGNUM] = (frame_info)->frame + 4; \ |
| 261 | (frame_saved_regs).regs[PC_REGNUM] = (frame_info)->frame - 8; \ |
| 262 | (frame_saved_regs).regs[FP_REGNUM] = (frame_info)->frame; \ |
| 263 | } |
| 264 | |
| 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 \ |
| 270 | { register CORE_ADDR sp = read_register (SP_REGNUM); \ |
| 271 | register int regnum; \ |
| 272 | printf("PUSH_DUMMY_FRAME\n"); \ |
| 273 | sp = push_word (sp, read_register (FP_REGNUM)); \ |
| 274 | write_register (FP_REGNUM, sp); \ |
| 275 | sp = push_word (sp, 0x1fff0004); /*SAVE MASK*/ \ |
| 276 | sp = push_word (sp, read_register (PC_REGNUM)); \ |
| 277 | for (regnum = 12; regnum >= 0; regnum--) \ |
| 278 | sp = push_word (sp, read_register (regnum)); \ |
| 279 | write_register (SP_REGNUM, sp); \ |
| 280 | } |
| 281 | |
| 282 | /* Discard from the stack the innermost frame, restoring all registers. */ |
| 283 | |
| 284 | #define POP_FRAME \ |
| 285 | { register CORE_ADDR fp = read_register (FP_REGNUM); \ |
| 286 | register int regnum; \ |
| 287 | register int regmask = read_memory_integer (fp-4, 4); \ |
| 288 | printf("POP_FRAME\n"); \ |
| 289 | regmask >>= 16; \ |
| 290 | write_register (SP_REGNUM, fp+4); \ |
| 291 | write_register (PC_REGNUM, read_memory_integer(fp-8, 4)); \ |
| 292 | write_register (FP_REGNUM, read_memory_integer(fp, 4)); \ |
| 293 | fp -= 8; \ |
| 294 | for (regnum = 12; regnum >= 0; regnum--, regmask <<= 1) \ |
| 295 | if (regmask & 0x1000) \ |
| 296 | write_register (regnum, read_memory_integer (fp-=4, 4)); \ |
| 297 | flush_cached_frames (); \ |
| 298 | set_current_frame (create_new_frame (read_register (FP_REGNUM), \ |
| 299 | read_pc ())); } |
| 300 | |
| 301 | /* This sequence of words is the instructions |
| 302 | calls #69, @#32323232 |
| 303 | bpt |
| 304 | Note this is 8 bytes. */ |
| 305 | |
| 306 | #define CALL_DUMMY {0xbf699f32, 0x32323230} |
| 307 | |
| 308 | /* Start execution at beginning of dummy */ |
| 309 | |
| 310 | #define CALL_DUMMY_START_OFFSET 0 |
| 311 | |
| 312 | /* Insert the specified number of args and function address |
| 313 | into a call sequence of the above form stored at DUMMYNAME. */ |
| 314 | |
| 315 | #define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, valtype, using_gcc) \ |
| 316 | { int temp = (int) fun; \ |
| 317 | *((char *) dummyname + 1) = nargs; \ |
| 318 | bcopy(&temp,(char *)dummyname+3,4); } |
| 319 | |