| 1 | /* Parameters for target execution on an RS6000, for GDB, the GNU debugger. |
| 2 | Copyright (C) 1986, 1987, 1989, 1991 Free Software Foundation, Inc. |
| 3 | Contributed by IBM Corporation. |
| 4 | |
| 5 | This file is part of GDB. |
| 6 | |
| 7 | This program is free software; you can redistribute it and/or modify |
| 8 | it under the terms of the GNU General Public License as published by |
| 9 | the Free Software Foundation; either version 2 of the License, or |
| 10 | (at your option) any later version. |
| 11 | |
| 12 | This program is distributed in the hope that it will be useful, |
| 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 | GNU General Public License for more details. |
| 16 | |
| 17 | You should have received a copy of the GNU General Public License |
| 18 | along with this program; if not, write to the Free Software |
| 19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ |
| 20 | |
| 21 | extern int symtab_relocated; |
| 22 | |
| 23 | /* Minimum possible text address in AIX */ |
| 24 | |
| 25 | #define TEXT_SEGMENT_BASE 0x10000000 |
| 26 | |
| 27 | |
| 28 | /* text addresses in a core file does not necessarily match to symbol table, |
| 29 | if symbol table relocation wasn't done yet. */ |
| 30 | |
| 31 | #define CORE_NEEDS_RELOCATION(PC) \ |
| 32 | if (!symtab_relocated && !inferior_pid && (PC) > TEXT_SEGMENT_BASE) \ |
| 33 | (PC) -= ( TEXT_SEGMENT_BASE + text_adjustment (exec_bfd)); |
| 34 | |
| 35 | /* Load segment of a given pc value. */ |
| 36 | |
| 37 | #define PC_LOAD_SEGMENT(PC) pc_load_segment_name(PC) |
| 38 | |
| 39 | |
| 40 | /* Conversion between a register number in stab string to actual register num. */ |
| 41 | |
| 42 | #define STAB_REG_TO_REGNUM(value) (value) |
| 43 | |
| 44 | /* return true if a given `pc' value is in `call dummy' function. */ |
| 45 | |
| 46 | #define PC_IN_CALL_DUMMY(STOP_PC, STOP_SP, STOP_FRAME_ADDR) \ |
| 47 | (STOP_SP < STOP_PC && STOP_PC < STACK_END_ADDR) |
| 48 | |
| 49 | /* For each symtab, we keep track of which BFD it came from. */ |
| 50 | #define EXTRA_SYMTAB_INFO \ |
| 51 | unsigned nonreloc:1; /* TRUE if non relocatable */ |
| 52 | |
| 53 | #define INIT_EXTRA_SYMTAB_INFO(symtab) \ |
| 54 | symtab->nonreloc = 0; \ |
| 55 | |
| 56 | extern unsigned int text_start, data_start; |
| 57 | extern int inferior_pid; |
| 58 | extern char *corefile; |
| 59 | |
| 60 | /* setpgrp() messes up controling terminal. The other version of it |
| 61 | requires libbsd.a. */ |
| 62 | #define setpgrp(XX,YY) setpgid (XX, YY) |
| 63 | |
| 64 | /* We are missing register descriptions in the system header files. Sigh! */ |
| 65 | |
| 66 | struct regs { |
| 67 | int gregs [32]; /* general purpose registers */ |
| 68 | int pc; /* program conter */ |
| 69 | int ps; /* processor status, or machine state */ |
| 70 | }; |
| 71 | |
| 72 | struct fp_status { |
| 73 | double fpregs [32]; /* floating GP registers */ |
| 74 | }; |
| 75 | |
| 76 | |
| 77 | /* To be used by function_frame_info. */ |
| 78 | |
| 79 | struct aix_framedata { |
| 80 | int offset; /* # of bytes in gpr's and fpr's are saved */ |
| 81 | int saved_gpr; /* smallest # of saved gpr */ |
| 82 | int saved_fpr; /* smallest # of saved fpr */ |
| 83 | int alloca_reg; /* alloca register number (frame ptr) */ |
| 84 | char frameless; /* true if frameless functions. */ |
| 85 | }; |
| 86 | |
| 87 | void |
| 88 | function_frame_info PARAMS ((CORE_ADDR, struct aix_framedata *)); |
| 89 | |
| 90 | /* Define the byte order of the machine. */ |
| 91 | |
| 92 | #define TARGET_BYTE_ORDER BIG_ENDIAN |
| 93 | |
| 94 | /* Define this if the C compiler puts an underscore at the front |
| 95 | of external names before giving them to the linker. */ |
| 96 | |
| 97 | #undef NAMES_HAVE_UNDERSCORE |
| 98 | |
| 99 | /* AIX's assembler doesn't grok dollar signs in identifiers. |
| 100 | So we use dots instead. This item must be coordinated with G++. */ |
| 101 | #undef CPLUS_MARKER |
| 102 | #define CPLUS_MARKER '.' |
| 103 | |
| 104 | /* Offset from address of function to start of its code. |
| 105 | Zero on most machines. */ |
| 106 | |
| 107 | #define FUNCTION_START_OFFSET 0 |
| 108 | |
| 109 | /* Advance PC across any function entry prologue instructions |
| 110 | to reach some "real" code. */ |
| 111 | |
| 112 | #define SKIP_PROLOGUE(pc) pc = skip_prologue (pc) |
| 113 | |
| 114 | /* If PC is in some function-call trampoline code, return the PC |
| 115 | where the function itself actually starts. If not, return NULL. */ |
| 116 | |
| 117 | #define SKIP_TRAMPOLINE_CODE(pc) skip_trampoline_code (pc) |
| 118 | |
| 119 | /* When a child process is just starting, we sneak in and relocate |
| 120 | the symbol table (and other stuff) after the dynamic linker has |
| 121 | figured out where they go. But we want to do this relocation just |
| 122 | once. */ |
| 123 | |
| 124 | extern int loadinfotextindex; |
| 125 | |
| 126 | #define SOLIB_CREATE_INFERIOR_HOOK(PID) \ |
| 127 | do { \ |
| 128 | if (loadinfotextindex == 0) \ |
| 129 | xcoff_relocate_symtab (PID); \ |
| 130 | } while (0) |
| 131 | |
| 132 | |
| 133 | /* Number of trap signals we need to skip over, once the inferior process |
| 134 | starts running. */ |
| 135 | |
| 136 | #define START_INFERIOR_TRAPS_EXPECTED 2 |
| 137 | |
| 138 | /* AIX might return a sigtrap, with a "stop after load" status. It should |
| 139 | be ignored by gdb, shouldn't be mixed up with breakpoint traps. */ |
| 140 | |
| 141 | /* Another little glitch in AIX is signal 0. I have no idea why wait(2) |
| 142 | returns with this status word. It looks harmless. */ |
| 143 | |
| 144 | #define SIGTRAP_STOP_AFTER_LOAD(W) \ |
| 145 | if ( (W) == 0x57c || (W) == 0x7f) { \ |
| 146 | if ((W)==0x57c && breakpoints_inserted) { \ |
| 147 | mark_breakpoints_out (); \ |
| 148 | insert_breakpoints (); \ |
| 149 | insert_step_breakpoint (); \ |
| 150 | } \ |
| 151 | resume (0, 0); \ |
| 152 | continue; \ |
| 153 | } |
| 154 | |
| 155 | /* In xcoff, we cannot process line numbers when we see them. This is |
| 156 | mainly because we don't know the boundaries of the include files. So, |
| 157 | we postpone that, and then enter and sort(?) the whole line table at |
| 158 | once, when we are closing the current symbol table in end_symtab(). */ |
| 159 | |
| 160 | #define PROCESS_LINENUMBER_HOOK() aix_process_linenos () |
| 161 | |
| 162 | |
| 163 | /* When a target process or core-file has been attached, we sneak in |
| 164 | and figure out where the shared libraries have got to. In case there |
| 165 | is no inferior_process exists (e.g. bringing up a core file), we can't |
| 166 | attemtp to relocate symbol table, since we don't have information about |
| 167 | load segments. */ |
| 168 | |
| 169 | #define SOLIB_ADD(a, b, c) \ |
| 170 | if (inferior_pid) xcoff_relocate_symtab (inferior_pid) |
| 171 | |
| 172 | /* Immediately after a function call, return the saved pc. |
| 173 | Can't go through the frames for this because on some machines |
| 174 | the new frame is not set up until the new function executes |
| 175 | some instructions. */ |
| 176 | |
| 177 | #define SAVED_PC_AFTER_CALL(frame) \ |
| 178 | (register_valid [LR_REGNUM] ? \ |
| 179 | (*(int*)®isters[REGISTER_BYTE (LR_REGNUM)]) : \ |
| 180 | read_register (LR_REGNUM)) |
| 181 | |
| 182 | /*#define SAVED_PC_AFTER_CALL(frame) saved_pc_after_call(frame) */ |
| 183 | |
| 184 | |
| 185 | /* Address of end of stack space. */ |
| 186 | |
| 187 | #define STACK_END_ADDR 0x2ff80000 |
| 188 | |
| 189 | /* Stack grows downward. */ |
| 190 | |
| 191 | #define INNER_THAN < |
| 192 | |
| 193 | #if 0 |
| 194 | /* No, we shouldn't use this. push_arguments() should leave stack in a |
| 195 | proper alignment! */ |
| 196 | /* Stack has strict alignment. */ |
| 197 | |
| 198 | #define STACK_ALIGN(ADDR) (((ADDR)+7)&-8) |
| 199 | #endif |
| 200 | |
| 201 | /* This is how argumets pushed onto stack or passed in registers. */ |
| 202 | |
| 203 | #define PUSH_ARGUMENTS(nargs, args, sp, struct_return, struct_addr) \ |
| 204 | sp = push_arguments(nargs, args, sp, struct_return, struct_addr) |
| 205 | |
| 206 | /* Sequence of bytes for breakpoint instruction. */ |
| 207 | |
| 208 | #define BREAKPOINT {0x7d, 0x82, 0x10, 0x08} |
| 209 | |
| 210 | /* Amount PC must be decremented by after a breakpoint. |
| 211 | This is often the number of bytes in BREAKPOINT |
| 212 | but not always. */ |
| 213 | |
| 214 | #define DECR_PC_AFTER_BREAK 0 |
| 215 | |
| 216 | /* Nonzero if instruction at PC is a return instruction. */ |
| 217 | /* Allow any of the return instructions, including a trapv and a return |
| 218 | from interrupt. */ |
| 219 | |
| 220 | #define ABOUT_TO_RETURN(pc) \ |
| 221 | ((read_memory_integer (pc, 4) & 0xfe8007ff) == 0x4e800020) |
| 222 | |
| 223 | /* Return 1 if P points to an invalid floating point value. */ |
| 224 | |
| 225 | #define INVALID_FLOAT(p, len) 0 /* Just a first guess; not checked */ |
| 226 | |
| 227 | /* Largest integer type */ |
| 228 | |
| 229 | #define LONGEST long |
| 230 | |
| 231 | /* Name of the builtin type for the LONGEST type above. */ |
| 232 | |
| 233 | #define BUILTIN_TYPE_LONGEST builtin_type_long |
| 234 | |
| 235 | /* Say how long (ordinary) registers are. */ |
| 236 | |
| 237 | #define REGISTER_TYPE long |
| 238 | |
| 239 | /* Number of machine registers */ |
| 240 | |
| 241 | #define NUM_REGS 71 |
| 242 | |
| 243 | /* Initializer for an array of names of registers. |
| 244 | There should be NUM_REGS strings in this initializer. */ |
| 245 | |
| 246 | #define REGISTER_NAMES \ |
| 247 | {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", \ |
| 248 | "r8", "r9", "r10","r11","r12","r13","r14","r15", \ |
| 249 | "r16","r17","r18","r19","r20","r21","r22","r23", \ |
| 250 | "r24","r25","r26","r27","r28","r29","r30","r31", \ |
| 251 | "f0", "f1", "f2", "f3", "f4", "f5", "f6", "f7", \ |
| 252 | "f8", "f9", "f10","f11","f12","f13","f14","f15", \ |
| 253 | "f16","f17","f18","f19","f20","f21","f22","f23", \ |
| 254 | "f24","f25","f26","f27","f28","f29","f30","f31", \ |
| 255 | "pc", "ps", "cnd", "lr", "cnt", "xer", "mq" } |
| 256 | |
| 257 | /* Register numbers of various important registers. |
| 258 | Note that some of these values are "real" register numbers, |
| 259 | and correspond to the general registers of the machine, |
| 260 | and some are "phony" register numbers which are too large |
| 261 | to be actual register numbers as far as the user is concerned |
| 262 | but do serve to get the desired values when passed to read_register. */ |
| 263 | |
| 264 | #define FP_REGNUM 1 /* Contains address of executing stack frame */ |
| 265 | #define SP_REGNUM 1 /* Contains address of top of stack */ |
| 266 | #define TOC_REGNUM 2 /* TOC register */ |
| 267 | #define FP0_REGNUM 32 /* Floating point register 0 */ |
| 268 | #define GP0_REGNUM 0 /* GPR register 0 */ |
| 269 | #define FP0_REGNUM 32 /* FPR (Floating point) register 0 */ |
| 270 | #define FPLAST_REGNUM 63 /* Last floating point register */ |
| 271 | |
| 272 | /* Special purpose registers... */ |
| 273 | /* P.S. keep these in the same order as in /usr/mstsave.h `mstsave' structure, for |
| 274 | easier processing */ |
| 275 | |
| 276 | #define PC_REGNUM 64 /* Program counter (instruction address %iar) */ |
| 277 | #define PS_REGNUM 65 /* Processor (or machine) status (%msr) */ |
| 278 | #define CR_REGNUM 66 /* Condition register */ |
| 279 | #define LR_REGNUM 67 /* Link register */ |
| 280 | #define CTR_REGNUM 68 /* Count register */ |
| 281 | #define XER_REGNUM 69 /* Fixed point exception registers */ |
| 282 | #define MQ_REGNUM 70 /* Multiply/quotient register */ |
| 283 | |
| 284 | #define FIRST_SP_REGNUM 64 /* first special register number */ |
| 285 | #define LAST_SP_REGNUM 70 /* last special register number */ |
| 286 | |
| 287 | /* Total amount of space needed to store our copies of the machine's |
| 288 | register state, the array `registers'. |
| 289 | |
| 290 | 32 4-byte gpr's |
| 291 | 32 8-byte fpr's |
| 292 | 7 4-byte special purpose registers, |
| 293 | |
| 294 | total 416 bytes. Keep some extra space for now, in case to add more. */ |
| 295 | |
| 296 | #define REGISTER_BYTES 420 |
| 297 | |
| 298 | |
| 299 | /* Index within `registers' of the first byte of the space for |
| 300 | register N. */ |
| 301 | |
| 302 | #define REGISTER_BYTE(N) \ |
| 303 | ( \ |
| 304 | ((N) > FPLAST_REGNUM) ? ((((N) - FPLAST_REGNUM -1) * 4) + 384)\ |
| 305 | :((N) >= FP0_REGNUM) ? ((((N) - FP0_REGNUM) * 8) + 128) \ |
| 306 | :((N) * 4) ) |
| 307 | |
| 308 | /* Number of bytes of storage in the actual machine representation |
| 309 | for register N. */ |
| 310 | /* Note that the unsigned cast here forces the result of the |
| 311 | subtractiion to very high positive values if N < FP0_REGNUM */ |
| 312 | |
| 313 | #define REGISTER_RAW_SIZE(N) (((unsigned)(N) - FP0_REGNUM) < 32 ? 8 : 4) |
| 314 | |
| 315 | /* Number of bytes of storage in the program's representation |
| 316 | for register N. On the RS6000, all regs are 4 bytes |
| 317 | except the floating point regs which are 8-byte doubles. */ |
| 318 | |
| 319 | #define REGISTER_VIRTUAL_SIZE(N) (((unsigned)(N) - FP0_REGNUM) < 32 ? 8 : 4) |
| 320 | |
| 321 | /* Largest value REGISTER_RAW_SIZE can have. */ |
| 322 | |
| 323 | #define MAX_REGISTER_RAW_SIZE 8 |
| 324 | |
| 325 | /* Largest value REGISTER_VIRTUAL_SIZE can have. */ |
| 326 | |
| 327 | #define MAX_REGISTER_VIRTUAL_SIZE 8 |
| 328 | |
| 329 | /* convert a dbx stab register number (from `r' declaration) to a gdb REGNUM */ |
| 330 | |
| 331 | #define STAB_REG_TO_REGNUM(value) (value) |
| 332 | |
| 333 | /* Nonzero if register N requires conversion |
| 334 | from raw format to virtual format. */ |
| 335 | |
| 336 | #define REGISTER_CONVERTIBLE(N) ((N) >= FP0_REGNUM && (N) <= FPLAST_REGNUM) |
| 337 | |
| 338 | /* Convert data from raw format for register REGNUM |
| 339 | to virtual format for register REGNUM. */ |
| 340 | |
| 341 | #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) \ |
| 342 | bcopy ((FROM), (TO), REGISTER_RAW_SIZE (REGNUM)) |
| 343 | |
| 344 | /* Convert data from virtual format for register REGNUM |
| 345 | to raw format for register REGNUM. */ |
| 346 | |
| 347 | #define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) \ |
| 348 | bcopy ((FROM), (TO), REGISTER_RAW_SIZE (REGNUM)) |
| 349 | |
| 350 | /* Return the GDB type object for the "standard" data type |
| 351 | of data in register N. */ |
| 352 | |
| 353 | #define REGISTER_VIRTUAL_TYPE(N) \ |
| 354 | (((unsigned)(N) - FP0_REGNUM) < 32 ? builtin_type_double : builtin_type_int) |
| 355 | |
| 356 | /* Store the address of the place in which to copy the structure the |
| 357 | subroutine will return. This is called from call_function. */ |
| 358 | /* in RS6000, struct return addresses are passed as an extra parameter in r3. |
| 359 | In function return, callee is not responsible of returning this address back. |
| 360 | Since gdb needs to find it, we will store in a designated variable |
| 361 | `rs6000_struct_return_address'. */ |
| 362 | |
| 363 | extern unsigned int rs6000_struct_return_address; |
| 364 | |
| 365 | #define STORE_STRUCT_RETURN(ADDR, SP) \ |
| 366 | { write_register (3, (ADDR)); \ |
| 367 | rs6000_struct_return_address = (unsigned int)(ADDR); } |
| 368 | |
| 369 | /* Extract from an array REGBUF containing the (raw) register state |
| 370 | a function return value of type TYPE, and copy that, in virtual format, |
| 371 | into VALBUF. */ |
| 372 | |
| 373 | /* #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \ |
| 374 | bcopy (REGBUF, VALBUF, TYPE_LENGTH (TYPE)) */ |
| 375 | |
| 376 | #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \ |
| 377 | extract_return_value(TYPE,REGBUF,VALBUF) |
| 378 | |
| 379 | /* Write into appropriate registers a function return value |
| 380 | of type TYPE, given in virtual format. */ |
| 381 | |
| 382 | #define STORE_RETURN_VALUE(TYPE,VALBUF) \ |
| 383 | { \ |
| 384 | if (TYPE_CODE (TYPE) == TYPE_CODE_FLT) \ |
| 385 | \ |
| 386 | /* Floating point values are returned starting from FPR1 and up. \ |
| 387 | Say a double_double_double type could be returned in \ |
| 388 | FPR1/FPR2/FPR3 triple. */ \ |
| 389 | \ |
| 390 | write_register_bytes (REGISTER_BYTE (FP0_REGNUM+1), (VALBUF), \ |
| 391 | TYPE_LENGTH (TYPE)); \ |
| 392 | else \ |
| 393 | /* Everything else is returned in GPR3 and up. */ \ |
| 394 | write_register_bytes (REGISTER_BYTE (GP0_REGNUM+3), (VALBUF), \ |
| 395 | TYPE_LENGTH (TYPE)); \ |
| 396 | } |
| 397 | |
| 398 | |
| 399 | /* Extract from an array REGBUF containing the (raw) register state |
| 400 | the address in which a function should return its structure value, |
| 401 | as a CORE_ADDR (or an expression that can be used as one). */ |
| 402 | |
| 403 | #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) rs6000_struct_return_address |
| 404 | \f |
| 405 | /* Describe the pointer in each stack frame to the previous stack frame |
| 406 | (its caller). */ |
| 407 | |
| 408 | /* FRAME_CHAIN takes a frame's nominal address |
| 409 | and produces the frame's chain-pointer. */ |
| 410 | |
| 411 | /* In the case of the RS6000, the frame's nominal address |
| 412 | is the address of a 4-byte word containing the calling frame's address. */ |
| 413 | |
| 414 | #define FRAME_CHAIN(thisframe) \ |
| 415 | (!inside_entry_file ((thisframe)->pc) ? \ |
| 416 | read_memory_integer ((thisframe)->frame, 4) :\ |
| 417 | 0) |
| 418 | |
| 419 | /* Define other aspects of the stack frame. */ |
| 420 | |
| 421 | /* A macro that tells us whether the function invocation represented |
| 422 | by FI does not have a frame on the stack associated with it. If it |
| 423 | does not, FRAMELESS is set to 1, else 0. */ |
| 424 | |
| 425 | #define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \ |
| 426 | FRAMELESS = frameless_function_invocation (FI) |
| 427 | |
| 428 | /* Functions calling alloca() change the value of the stack pointer. We |
| 429 | need to use initial stack pointer (which is saved in r31 by gcc) in |
| 430 | such cases. If a compiler emits traceback table, then we should use the |
| 431 | alloca register specified in traceback table. FIXME. */ |
| 432 | /* Also, it is a good idea to cache information about frame's saved registers |
| 433 | in the frame structure to speed things up. See tm-m88k.h. FIXME. */ |
| 434 | |
| 435 | #define EXTRA_FRAME_INFO \ |
| 436 | CORE_ADDR initial_sp; /* initial stack pointer. */ \ |
| 437 | struct frame_saved_regs *cache_fsr; /* saved registers */ |
| 438 | |
| 439 | /* Frameless function invocation in IBM RS/6000 is half-done. It perfectly |
| 440 | sets up a new frame, e.g. a new frame (in fact stack) pointer, etc, but it |
| 441 | doesn't save the %pc. In the following, even though it is considered a |
| 442 | frameless invocation, we still need to walk one frame up. */ |
| 443 | |
| 444 | #define INIT_EXTRA_FRAME_INFO(fromleaf, fi) \ |
| 445 | fi->initial_sp = 0; \ |
| 446 | fi->cache_fsr = 0; |
| 447 | |
| 448 | #define FRAME_SAVED_PC(FRAME) \ |
| 449 | read_memory_integer (read_memory_integer ((FRAME)->frame, 4)+8, 4) |
| 450 | |
| 451 | #define FRAME_ARGS_ADDRESS(FI) \ |
| 452 | (((struct frame_info*)(FI))->initial_sp ? \ |
| 453 | ((struct frame_info*)(FI))->initial_sp : \ |
| 454 | frame_initial_stack_address (FI)) |
| 455 | |
| 456 | #define FRAME_LOCALS_ADDRESS(FI) FRAME_ARGS_ADDRESS(FI) |
| 457 | |
| 458 | |
| 459 | /* Set VAL to the number of args passed to frame described by FI. |
| 460 | Can set VAL to -1, meaning no way to tell. */ |
| 461 | |
| 462 | /* We can't tell how many args there are |
| 463 | now that the C compiler delays popping them. */ |
| 464 | |
| 465 | #define FRAME_NUM_ARGS(val,fi) (val = -1) |
| 466 | |
| 467 | /* Return number of bytes at start of arglist that are not really args. */ |
| 468 | |
| 469 | #define FRAME_ARGS_SKIP 8 /* Not sure on this. FIXMEmgo */ |
| 470 | |
| 471 | /* Put here the code to store, into a struct frame_saved_regs, |
| 472 | the addresses of the saved registers of frame described by FRAME_INFO. |
| 473 | This includes special registers such as pc and fp saved in special |
| 474 | ways in the stack frame. sp is even more special: |
| 475 | the address we return for it IS the sp for the next frame. */ |
| 476 | /* In the following implementation for RS6000, we did *not* save sp. I am |
| 477 | not sure if it will be needed. The following macro takes care of gpr's |
| 478 | and fpr's only. */ |
| 479 | |
| 480 | #define FRAME_FIND_SAVED_REGS(FRAME_INFO, FRAME_SAVED_REGS) \ |
| 481 | { \ |
| 482 | int ii; \ |
| 483 | CORE_ADDR frame_addr, func_start; \ |
| 484 | struct aix_framedata fdata; \ |
| 485 | \ |
| 486 | /* find the start of the function and collect info about its frame. */\ |
| 487 | \ |
| 488 | func_start = get_pc_function_start ((FRAME_INFO)->pc) + FUNCTION_START_OFFSET; \ |
| 489 | function_frame_info (func_start, &fdata); \ |
| 490 | bzero (&(FRAME_SAVED_REGS), sizeof (FRAME_SAVED_REGS)); \ |
| 491 | \ |
| 492 | /* if there were any saved registers, figure out parent's stack pointer. */ \ |
| 493 | frame_addr = 0; \ |
| 494 | /* the following is true only if the frame doesn't have a call to alloca(), \ |
| 495 | FIXME. */ \ |
| 496 | if (fdata.saved_fpr >= 0 || fdata.saved_gpr >= 0) { \ |
| 497 | if ((FRAME_INFO)->prev && (FRAME_INFO)->prev->frame) \ |
| 498 | frame_addr = (FRAME_INFO)->prev->frame; \ |
| 499 | else \ |
| 500 | frame_addr = read_memory_integer ((FRAME_INFO)->frame, 4); \ |
| 501 | } \ |
| 502 | \ |
| 503 | /* if != -1, fdata.saved_fpr is the smallest number of saved_fpr. All fpr's \ |
| 504 | from saved_fpr to fp31 are saved right underneath caller stack pointer, \ |
| 505 | starting from fp31 first. */ \ |
| 506 | \ |
| 507 | if (fdata.saved_fpr >= 0) { \ |
| 508 | for (ii=31; ii >= fdata.saved_fpr; --ii) \ |
| 509 | (FRAME_SAVED_REGS).regs [FP0_REGNUM + ii] = frame_addr - ((32 - ii) * 8); \ |
| 510 | frame_addr -= (32 - fdata.saved_fpr) * 8; \ |
| 511 | } \ |
| 512 | \ |
| 513 | /* if != -1, fdata.saved_gpr is the smallest number of saved_gpr. All gpr's \ |
| 514 | from saved_gpr to gpr31 are saved right under saved fprs, starting \ |
| 515 | from r31 first. */ \ |
| 516 | \ |
| 517 | if (fdata.saved_gpr >= 0) \ |
| 518 | for (ii=31; ii >= fdata.saved_gpr; --ii) \ |
| 519 | (FRAME_SAVED_REGS).regs [ii] = frame_addr - ((32 - ii) * 4); \ |
| 520 | } |
| 521 | |
| 522 | \f |
| 523 | /* Things needed for making the inferior call functions. */ |
| 524 | |
| 525 | /* Push an empty stack frame, to record the current PC, etc. */ |
| 526 | /* Change these names into rs6k_{push, pop}_frame(). FIXMEmgo. */ |
| 527 | |
| 528 | #define PUSH_DUMMY_FRAME push_dummy_frame () |
| 529 | |
| 530 | /* Discard from the stack the innermost frame, |
| 531 | restoring all saved registers. */ |
| 532 | |
| 533 | #define POP_FRAME pop_frame () |
| 534 | |
| 535 | /* This sequence of words is the instructions: |
| 536 | |
| 537 | mflr r0 // 0x7c0802a6 |
| 538 | // save fpr's |
| 539 | stfd r?, num(r1) // 0xd8010000 there should be 32 of this?? |
| 540 | // save gpr's |
| 541 | stm r0, num(r1) // 0xbc010000 |
| 542 | stu r1, num(r1) // 0x94210000 |
| 543 | |
| 544 | // the function we want to branch might be in a different load |
| 545 | // segment. reset the toc register. Note that the actual toc address |
| 546 | // will be fix by fix_call_dummy () along with function address. |
| 547 | |
| 548 | st r2, 0x14(r1) // 0x90410014 save toc register |
| 549 | liu r2, 0x1234 // 0x3c401234 reset a new toc value 0x12345678 |
| 550 | oril r2, r2,0x5678 // 0x60425678 |
| 551 | |
| 552 | // load absolute address 0x12345678 to r0 |
| 553 | liu r0, 0x1234 // 0x3c001234 |
| 554 | oril r0, r0,0x5678 // 0x60005678 |
| 555 | mtctr r0 // 0x7c0903a6 ctr <- r0 |
| 556 | bctrl // 0x4e800421 jump subroutine 0x12345678 (%ctr) |
| 557 | cror 0xf, 0xf, 0xf // 0x4def7b82 |
| 558 | brpt // 0x7d821008, breakpoint |
| 559 | cror 0xf, 0xf, 0xf // 0x4def7b82 (for 8 byte alignment) |
| 560 | |
| 561 | |
| 562 | We actually start executing by saving the toc register first, since the pushing |
| 563 | of the registers is done by PUSH_DUMMY_FRAME. If this were real code, |
| 564 | the arguments for the function called by the `bctrl' would be pushed |
| 565 | between the `stu' and the `bctrl', and we could allow it to execute through. |
| 566 | But the arguments have to be pushed by GDB after the PUSH_DUMMY_FRAME is done, |
| 567 | and we cannot allow to push the registers again. |
| 568 | */ |
| 569 | |
| 570 | #define CALL_DUMMY {0x7c0802a6, 0xd8010000, 0xbc010000, 0x94210000, \ |
| 571 | 0x90410014, 0x3c401234, 0x60425678, \ |
| 572 | 0x3c001234, 0x60005678, 0x7c0903a6, 0x4e800421, \ |
| 573 | 0x4def7b82, 0x7d821008, 0x4def7b82 } |
| 574 | |
| 575 | |
| 576 | /* keep this as multiple of 8 (%sp requires 8 byte alignment) */ |
| 577 | #define CALL_DUMMY_LENGTH 56 |
| 578 | |
| 579 | #define CALL_DUMMY_START_OFFSET 16 |
| 580 | |
| 581 | /* Insert the specified number of args and function address |
| 582 | into a call sequence of the above form stored at DUMMYNAME. */ |
| 583 | |
| 584 | #define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, using_gcc) \ |
| 585 | fix_call_dummy(dummyname, pc, fun, nargs, type) |
| 586 | |
| 587 | |
| 588 | /* Signal handler for SIGWINCH `window size changed'. */ |
| 589 | |
| 590 | #define SIGWINCH_HANDLER aix_resizewindow |
| 591 | extern void aix_resizewindow (); |
| 592 | |
| 593 | /* `lines_per_page' and `chars_per_line' are local to utils.c. Rectify this. */ |
| 594 | |
| 595 | #define SIGWINCH_HANDLER_BODY \ |
| 596 | \ |
| 597 | /* Respond to SIGWINCH `window size changed' signal, and reset GDB's \ |
| 598 | window settings approproatelt. */ \ |
| 599 | \ |
| 600 | void \ |
| 601 | aix_resizewindow () \ |
| 602 | { \ |
| 603 | int fd = fileno (stdout); \ |
| 604 | if (isatty (fd)) { \ |
| 605 | int val; \ |
| 606 | \ |
| 607 | val = atoi (termdef (fd, 'l')); \ |
| 608 | if (val > 0) \ |
| 609 | lines_per_page = val; \ |
| 610 | val = atoi (termdef (fd, 'c')); \ |
| 611 | if (val > 0) \ |
| 612 | chars_per_line = val; \ |
| 613 | } \ |
| 614 | } |
| 615 | |
| 616 | |
| 617 | /* Flag for machine-specific stuff in shared files. FIXME */ |
| 618 | #define IBM6000_TARGET |
| 619 | |
| 620 | /* RS6000/AIX does not support PT_STEP. Has to be simulated. */ |
| 621 | |
| 622 | #define NO_SINGLE_STEP |