| 1 | /* Cache and manage frames for GDB, the GNU debugger. |
| 2 | |
| 3 | Copyright 1986, 1987, 1989, 1991, 1994, 1995, 1996, 1998, 2000, |
| 4 | 2001, 2002, 2003, 2004 Free Software Foundation, Inc. |
| 5 | |
| 6 | This file is part of GDB. |
| 7 | |
| 8 | This program is free software; you can redistribute it and/or modify |
| 9 | it under the terms of the GNU General Public License as published by |
| 10 | the Free Software Foundation; either version 2 of the License, or |
| 11 | (at your option) any later version. |
| 12 | |
| 13 | This program is distributed in the hope that it will be useful, |
| 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | GNU General Public License for more details. |
| 17 | |
| 18 | You should have received a copy of the GNU General Public License |
| 19 | along with this program; if not, write to the Free Software |
| 20 | Foundation, Inc., 59 Temple Place - Suite 330, |
| 21 | Boston, MA 02111-1307, USA. */ |
| 22 | |
| 23 | #include "defs.h" |
| 24 | #include "frame.h" |
| 25 | #include "target.h" |
| 26 | #include "value.h" |
| 27 | #include "inferior.h" /* for inferior_ptid */ |
| 28 | #include "regcache.h" |
| 29 | #include "gdb_assert.h" |
| 30 | #include "gdb_string.h" |
| 31 | #include "user-regs.h" |
| 32 | #include "gdb_obstack.h" |
| 33 | #include "dummy-frame.h" |
| 34 | #include "sentinel-frame.h" |
| 35 | #include "gdbcore.h" |
| 36 | #include "annotate.h" |
| 37 | #include "language.h" |
| 38 | #include "frame-unwind.h" |
| 39 | #include "frame-base.h" |
| 40 | #include "command.h" |
| 41 | #include "gdbcmd.h" |
| 42 | #include "observer.h" |
| 43 | #include "objfiles.h" |
| 44 | #include "exceptions.h" |
| 45 | |
| 46 | static struct frame_info *get_prev_frame_1 (struct frame_info *this_frame); |
| 47 | |
| 48 | /* We keep a cache of stack frames, each of which is a "struct |
| 49 | frame_info". The innermost one gets allocated (in |
| 50 | wait_for_inferior) each time the inferior stops; current_frame |
| 51 | points to it. Additional frames get allocated (in get_prev_frame) |
| 52 | as needed, and are chained through the next and prev fields. Any |
| 53 | time that the frame cache becomes invalid (most notably when we |
| 54 | execute something, but also if we change how we interpret the |
| 55 | frames (e.g. "set heuristic-fence-post" in mips-tdep.c, or anything |
| 56 | which reads new symbols)), we should call reinit_frame_cache. */ |
| 57 | |
| 58 | struct frame_info |
| 59 | { |
| 60 | /* Level of this frame. The inner-most (youngest) frame is at level |
| 61 | 0. As you move towards the outer-most (oldest) frame, the level |
| 62 | increases. This is a cached value. It could just as easily be |
| 63 | computed by counting back from the selected frame to the inner |
| 64 | most frame. */ |
| 65 | /* NOTE: cagney/2002-04-05: Perhaps a level of ``-1'' should be |
| 66 | reserved to indicate a bogus frame - one that has been created |
| 67 | just to keep GDB happy (GDB always needs a frame). For the |
| 68 | moment leave this as speculation. */ |
| 69 | int level; |
| 70 | |
| 71 | /* The frame's low-level unwinder and corresponding cache. The |
| 72 | low-level unwinder is responsible for unwinding register values |
| 73 | for the previous frame. The low-level unwind methods are |
| 74 | selected based on the presence, or otherwise, of register unwind |
| 75 | information such as CFI. */ |
| 76 | void *prologue_cache; |
| 77 | const struct frame_unwind *unwind; |
| 78 | |
| 79 | /* Cached copy of the previous frame's resume address. */ |
| 80 | struct { |
| 81 | int p; |
| 82 | CORE_ADDR value; |
| 83 | } prev_pc; |
| 84 | |
| 85 | /* Cached copy of the previous frame's function address. */ |
| 86 | struct |
| 87 | { |
| 88 | CORE_ADDR addr; |
| 89 | int p; |
| 90 | } prev_func; |
| 91 | |
| 92 | /* This frame's ID. */ |
| 93 | struct |
| 94 | { |
| 95 | int p; |
| 96 | struct frame_id value; |
| 97 | } this_id; |
| 98 | |
| 99 | /* The frame's high-level base methods, and corresponding cache. |
| 100 | The high level base methods are selected based on the frame's |
| 101 | debug info. */ |
| 102 | const struct frame_base *base; |
| 103 | void *base_cache; |
| 104 | |
| 105 | /* Pointers to the next (down, inner, younger) and previous (up, |
| 106 | outer, older) frame_info's in the frame cache. */ |
| 107 | struct frame_info *next; /* down, inner, younger */ |
| 108 | int prev_p; |
| 109 | struct frame_info *prev; /* up, outer, older */ |
| 110 | }; |
| 111 | |
| 112 | /* Flag to control debugging. */ |
| 113 | |
| 114 | static int frame_debug; |
| 115 | static void |
| 116 | show_frame_debug (struct ui_file *file, int from_tty, |
| 117 | struct cmd_list_element *c, const char *value) |
| 118 | { |
| 119 | fprintf_filtered (file, _("Frame debugging is %s.\n"), value); |
| 120 | } |
| 121 | |
| 122 | /* Flag to indicate whether backtraces should stop at main et.al. */ |
| 123 | |
| 124 | static int backtrace_past_main; |
| 125 | static void |
| 126 | show_backtrace_past_main (struct ui_file *file, int from_tty, |
| 127 | struct cmd_list_element *c, const char *value) |
| 128 | { |
| 129 | fprintf_filtered (file, _("\ |
| 130 | Whether backtraces should continue past \"main\" is %s.\n"), |
| 131 | value); |
| 132 | } |
| 133 | |
| 134 | static int backtrace_past_entry; |
| 135 | static void |
| 136 | show_backtrace_past_entry (struct ui_file *file, int from_tty, |
| 137 | struct cmd_list_element *c, const char *value) |
| 138 | { |
| 139 | fprintf_filtered (file, _("\ |
| 140 | Whether backtraces should continue past the entry point of a program is %s.\n"), |
| 141 | value); |
| 142 | } |
| 143 | |
| 144 | static unsigned int backtrace_limit = UINT_MAX; |
| 145 | static void |
| 146 | show_backtrace_limit (struct ui_file *file, int from_tty, |
| 147 | struct cmd_list_element *c, const char *value) |
| 148 | { |
| 149 | fprintf_filtered (file, _("\ |
| 150 | An upper bound on the number of backtrace levels is %s.\n"), |
| 151 | value); |
| 152 | } |
| 153 | |
| 154 | |
| 155 | static void |
| 156 | fprint_field (struct ui_file *file, const char *name, int p, CORE_ADDR addr) |
| 157 | { |
| 158 | if (p) |
| 159 | fprintf_unfiltered (file, "%s=0x%s", name, paddr_nz (addr)); |
| 160 | else |
| 161 | fprintf_unfiltered (file, "!%s", name); |
| 162 | } |
| 163 | |
| 164 | void |
| 165 | fprint_frame_id (struct ui_file *file, struct frame_id id) |
| 166 | { |
| 167 | fprintf_unfiltered (file, "{"); |
| 168 | fprint_field (file, "stack", id.stack_addr_p, id.stack_addr); |
| 169 | fprintf_unfiltered (file, ","); |
| 170 | fprint_field (file, "code", id.code_addr_p, id.code_addr); |
| 171 | fprintf_unfiltered (file, ","); |
| 172 | fprint_field (file, "special", id.special_addr_p, id.special_addr); |
| 173 | fprintf_unfiltered (file, "}"); |
| 174 | } |
| 175 | |
| 176 | static void |
| 177 | fprint_frame_type (struct ui_file *file, enum frame_type type) |
| 178 | { |
| 179 | switch (type) |
| 180 | { |
| 181 | case NORMAL_FRAME: |
| 182 | fprintf_unfiltered (file, "NORMAL_FRAME"); |
| 183 | return; |
| 184 | case DUMMY_FRAME: |
| 185 | fprintf_unfiltered (file, "DUMMY_FRAME"); |
| 186 | return; |
| 187 | case SIGTRAMP_FRAME: |
| 188 | fprintf_unfiltered (file, "SIGTRAMP_FRAME"); |
| 189 | return; |
| 190 | default: |
| 191 | fprintf_unfiltered (file, "<unknown type>"); |
| 192 | return; |
| 193 | }; |
| 194 | } |
| 195 | |
| 196 | static void |
| 197 | fprint_frame (struct ui_file *file, struct frame_info *fi) |
| 198 | { |
| 199 | if (fi == NULL) |
| 200 | { |
| 201 | fprintf_unfiltered (file, "<NULL frame>"); |
| 202 | return; |
| 203 | } |
| 204 | fprintf_unfiltered (file, "{"); |
| 205 | fprintf_unfiltered (file, "level=%d", fi->level); |
| 206 | fprintf_unfiltered (file, ","); |
| 207 | fprintf_unfiltered (file, "type="); |
| 208 | if (fi->unwind != NULL) |
| 209 | fprint_frame_type (file, fi->unwind->type); |
| 210 | else |
| 211 | fprintf_unfiltered (file, "<unknown>"); |
| 212 | fprintf_unfiltered (file, ","); |
| 213 | fprintf_unfiltered (file, "unwind="); |
| 214 | if (fi->unwind != NULL) |
| 215 | gdb_print_host_address (fi->unwind, file); |
| 216 | else |
| 217 | fprintf_unfiltered (file, "<unknown>"); |
| 218 | fprintf_unfiltered (file, ","); |
| 219 | fprintf_unfiltered (file, "pc="); |
| 220 | if (fi->next != NULL && fi->next->prev_pc.p) |
| 221 | fprintf_unfiltered (file, "0x%s", paddr_nz (fi->next->prev_pc.value)); |
| 222 | else |
| 223 | fprintf_unfiltered (file, "<unknown>"); |
| 224 | fprintf_unfiltered (file, ","); |
| 225 | fprintf_unfiltered (file, "id="); |
| 226 | if (fi->this_id.p) |
| 227 | fprint_frame_id (file, fi->this_id.value); |
| 228 | else |
| 229 | fprintf_unfiltered (file, "<unknown>"); |
| 230 | fprintf_unfiltered (file, ","); |
| 231 | fprintf_unfiltered (file, "func="); |
| 232 | if (fi->next != NULL && fi->next->prev_func.p) |
| 233 | fprintf_unfiltered (file, "0x%s", paddr_nz (fi->next->prev_func.addr)); |
| 234 | else |
| 235 | fprintf_unfiltered (file, "<unknown>"); |
| 236 | fprintf_unfiltered (file, "}"); |
| 237 | } |
| 238 | |
| 239 | /* Return a frame uniq ID that can be used to, later, re-find the |
| 240 | frame. */ |
| 241 | |
| 242 | struct frame_id |
| 243 | get_frame_id (struct frame_info *fi) |
| 244 | { |
| 245 | if (fi == NULL) |
| 246 | { |
| 247 | return null_frame_id; |
| 248 | } |
| 249 | if (!fi->this_id.p) |
| 250 | { |
| 251 | if (frame_debug) |
| 252 | fprintf_unfiltered (gdb_stdlog, "{ get_frame_id (fi=%d) ", |
| 253 | fi->level); |
| 254 | /* Find the unwinder. */ |
| 255 | if (fi->unwind == NULL) |
| 256 | fi->unwind = frame_unwind_find_by_frame (fi->next, |
| 257 | &fi->prologue_cache); |
| 258 | /* Find THIS frame's ID. */ |
| 259 | fi->unwind->this_id (fi->next, &fi->prologue_cache, &fi->this_id.value); |
| 260 | fi->this_id.p = 1; |
| 261 | if (frame_debug) |
| 262 | { |
| 263 | fprintf_unfiltered (gdb_stdlog, "-> "); |
| 264 | fprint_frame_id (gdb_stdlog, fi->this_id.value); |
| 265 | fprintf_unfiltered (gdb_stdlog, " }\n"); |
| 266 | } |
| 267 | } |
| 268 | return fi->this_id.value; |
| 269 | } |
| 270 | |
| 271 | struct frame_id |
| 272 | frame_unwind_id (struct frame_info *next_frame) |
| 273 | { |
| 274 | /* Use prev_frame, and not get_prev_frame. The latter will truncate |
| 275 | the frame chain, leading to this function unintentionally |
| 276 | returning a null_frame_id (e.g., when a caller requests the frame |
| 277 | ID of "main()"s caller. */ |
| 278 | return get_frame_id (get_prev_frame_1 (next_frame)); |
| 279 | } |
| 280 | |
| 281 | const struct frame_id null_frame_id; /* All zeros. */ |
| 282 | |
| 283 | struct frame_id |
| 284 | frame_id_build_special (CORE_ADDR stack_addr, CORE_ADDR code_addr, |
| 285 | CORE_ADDR special_addr) |
| 286 | { |
| 287 | struct frame_id id = null_frame_id; |
| 288 | id.stack_addr = stack_addr; |
| 289 | id.stack_addr_p = 1; |
| 290 | id.code_addr = code_addr; |
| 291 | id.code_addr_p = 1; |
| 292 | id.special_addr = special_addr; |
| 293 | id.special_addr_p = 1; |
| 294 | return id; |
| 295 | } |
| 296 | |
| 297 | struct frame_id |
| 298 | frame_id_build (CORE_ADDR stack_addr, CORE_ADDR code_addr) |
| 299 | { |
| 300 | struct frame_id id = null_frame_id; |
| 301 | id.stack_addr = stack_addr; |
| 302 | id.stack_addr_p = 1; |
| 303 | id.code_addr = code_addr; |
| 304 | id.code_addr_p = 1; |
| 305 | return id; |
| 306 | } |
| 307 | |
| 308 | struct frame_id |
| 309 | frame_id_build_wild (CORE_ADDR stack_addr) |
| 310 | { |
| 311 | struct frame_id id = null_frame_id; |
| 312 | id.stack_addr = stack_addr; |
| 313 | id.stack_addr_p = 1; |
| 314 | return id; |
| 315 | } |
| 316 | |
| 317 | int |
| 318 | frame_id_p (struct frame_id l) |
| 319 | { |
| 320 | int p; |
| 321 | /* The frame is valid iff it has a valid stack address. */ |
| 322 | p = l.stack_addr_p; |
| 323 | if (frame_debug) |
| 324 | { |
| 325 | fprintf_unfiltered (gdb_stdlog, "{ frame_id_p (l="); |
| 326 | fprint_frame_id (gdb_stdlog, l); |
| 327 | fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", p); |
| 328 | } |
| 329 | return p; |
| 330 | } |
| 331 | |
| 332 | int |
| 333 | frame_id_eq (struct frame_id l, struct frame_id r) |
| 334 | { |
| 335 | int eq; |
| 336 | if (!l.stack_addr_p || !r.stack_addr_p) |
| 337 | /* Like a NaN, if either ID is invalid, the result is false. |
| 338 | Note that a frame ID is invalid iff it is the null frame ID. */ |
| 339 | eq = 0; |
| 340 | else if (l.stack_addr != r.stack_addr) |
| 341 | /* If .stack addresses are different, the frames are different. */ |
| 342 | eq = 0; |
| 343 | else if (!l.code_addr_p || !r.code_addr_p) |
| 344 | /* An invalid code addr is a wild card, always succeed. */ |
| 345 | eq = 1; |
| 346 | else if (l.code_addr != r.code_addr) |
| 347 | /* If .code addresses are different, the frames are different. */ |
| 348 | eq = 0; |
| 349 | else if (!l.special_addr_p || !r.special_addr_p) |
| 350 | /* An invalid special addr is a wild card (or unused), always succeed. */ |
| 351 | eq = 1; |
| 352 | else if (l.special_addr == r.special_addr) |
| 353 | /* Frames are equal. */ |
| 354 | eq = 1; |
| 355 | else |
| 356 | /* No luck. */ |
| 357 | eq = 0; |
| 358 | if (frame_debug) |
| 359 | { |
| 360 | fprintf_unfiltered (gdb_stdlog, "{ frame_id_eq (l="); |
| 361 | fprint_frame_id (gdb_stdlog, l); |
| 362 | fprintf_unfiltered (gdb_stdlog, ",r="); |
| 363 | fprint_frame_id (gdb_stdlog, r); |
| 364 | fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", eq); |
| 365 | } |
| 366 | return eq; |
| 367 | } |
| 368 | |
| 369 | int |
| 370 | frame_id_inner (struct frame_id l, struct frame_id r) |
| 371 | { |
| 372 | int inner; |
| 373 | if (!l.stack_addr_p || !r.stack_addr_p) |
| 374 | /* Like NaN, any operation involving an invalid ID always fails. */ |
| 375 | inner = 0; |
| 376 | else |
| 377 | /* Only return non-zero when strictly inner than. Note that, per |
| 378 | comment in "frame.h", there is some fuzz here. Frameless |
| 379 | functions are not strictly inner than (same .stack but |
| 380 | different .code and/or .special address). */ |
| 381 | inner = INNER_THAN (l.stack_addr, r.stack_addr); |
| 382 | if (frame_debug) |
| 383 | { |
| 384 | fprintf_unfiltered (gdb_stdlog, "{ frame_id_inner (l="); |
| 385 | fprint_frame_id (gdb_stdlog, l); |
| 386 | fprintf_unfiltered (gdb_stdlog, ",r="); |
| 387 | fprint_frame_id (gdb_stdlog, r); |
| 388 | fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", inner); |
| 389 | } |
| 390 | return inner; |
| 391 | } |
| 392 | |
| 393 | struct frame_info * |
| 394 | frame_find_by_id (struct frame_id id) |
| 395 | { |
| 396 | struct frame_info *frame; |
| 397 | |
| 398 | /* ZERO denotes the null frame, let the caller decide what to do |
| 399 | about it. Should it instead return get_current_frame()? */ |
| 400 | if (!frame_id_p (id)) |
| 401 | return NULL; |
| 402 | |
| 403 | for (frame = get_current_frame (); |
| 404 | frame != NULL; |
| 405 | frame = get_prev_frame (frame)) |
| 406 | { |
| 407 | struct frame_id this = get_frame_id (frame); |
| 408 | if (frame_id_eq (id, this)) |
| 409 | /* An exact match. */ |
| 410 | return frame; |
| 411 | if (frame_id_inner (id, this)) |
| 412 | /* Gone to far. */ |
| 413 | return NULL; |
| 414 | /* Either we're not yet gone far enough out along the frame |
| 415 | chain (inner(this,id)), or we're comparing frameless functions |
| 416 | (same .base, different .func, no test available). Struggle |
| 417 | on until we've definitly gone to far. */ |
| 418 | } |
| 419 | return NULL; |
| 420 | } |
| 421 | |
| 422 | CORE_ADDR |
| 423 | frame_pc_unwind (struct frame_info *this_frame) |
| 424 | { |
| 425 | if (!this_frame->prev_pc.p) |
| 426 | { |
| 427 | CORE_ADDR pc; |
| 428 | if (this_frame->unwind == NULL) |
| 429 | this_frame->unwind |
| 430 | = frame_unwind_find_by_frame (this_frame->next, |
| 431 | &this_frame->prologue_cache); |
| 432 | if (this_frame->unwind->prev_pc != NULL) |
| 433 | /* A per-frame unwinder, prefer it. */ |
| 434 | pc = this_frame->unwind->prev_pc (this_frame->next, |
| 435 | &this_frame->prologue_cache); |
| 436 | else if (gdbarch_unwind_pc_p (current_gdbarch)) |
| 437 | { |
| 438 | /* The right way. The `pure' way. The one true way. This |
| 439 | method depends solely on the register-unwind code to |
| 440 | determine the value of registers in THIS frame, and hence |
| 441 | the value of this frame's PC (resume address). A typical |
| 442 | implementation is no more than: |
| 443 | |
| 444 | frame_unwind_register (this_frame, ISA_PC_REGNUM, buf); |
| 445 | return extract_unsigned_integer (buf, size of ISA_PC_REGNUM); |
| 446 | |
| 447 | Note: this method is very heavily dependent on a correct |
| 448 | register-unwind implementation, it pays to fix that |
| 449 | method first; this method is frame type agnostic, since |
| 450 | it only deals with register values, it works with any |
| 451 | frame. This is all in stark contrast to the old |
| 452 | FRAME_SAVED_PC which would try to directly handle all the |
| 453 | different ways that a PC could be unwound. */ |
| 454 | pc = gdbarch_unwind_pc (current_gdbarch, this_frame); |
| 455 | } |
| 456 | else |
| 457 | internal_error (__FILE__, __LINE__, _("No unwind_pc method")); |
| 458 | this_frame->prev_pc.value = pc; |
| 459 | this_frame->prev_pc.p = 1; |
| 460 | if (frame_debug) |
| 461 | fprintf_unfiltered (gdb_stdlog, |
| 462 | "{ frame_pc_unwind (this_frame=%d) -> 0x%s }\n", |
| 463 | this_frame->level, |
| 464 | paddr_nz (this_frame->prev_pc.value)); |
| 465 | } |
| 466 | return this_frame->prev_pc.value; |
| 467 | } |
| 468 | |
| 469 | CORE_ADDR |
| 470 | frame_func_unwind (struct frame_info *fi) |
| 471 | { |
| 472 | if (!fi->prev_func.p) |
| 473 | { |
| 474 | /* Make certain that this, and not the adjacent, function is |
| 475 | found. */ |
| 476 | CORE_ADDR addr_in_block = frame_unwind_address_in_block (fi); |
| 477 | fi->prev_func.p = 1; |
| 478 | fi->prev_func.addr = get_pc_function_start (addr_in_block); |
| 479 | if (frame_debug) |
| 480 | fprintf_unfiltered (gdb_stdlog, |
| 481 | "{ frame_func_unwind (fi=%d) -> 0x%s }\n", |
| 482 | fi->level, paddr_nz (fi->prev_func.addr)); |
| 483 | } |
| 484 | return fi->prev_func.addr; |
| 485 | } |
| 486 | |
| 487 | CORE_ADDR |
| 488 | get_frame_func (struct frame_info *fi) |
| 489 | { |
| 490 | return frame_func_unwind (fi->next); |
| 491 | } |
| 492 | |
| 493 | static int |
| 494 | do_frame_register_read (void *src, int regnum, void *buf) |
| 495 | { |
| 496 | frame_register_read (src, regnum, buf); |
| 497 | return 1; |
| 498 | } |
| 499 | |
| 500 | struct regcache * |
| 501 | frame_save_as_regcache (struct frame_info *this_frame) |
| 502 | { |
| 503 | struct regcache *regcache = regcache_xmalloc (current_gdbarch); |
| 504 | struct cleanup *cleanups = make_cleanup_regcache_xfree (regcache); |
| 505 | regcache_save (regcache, do_frame_register_read, this_frame); |
| 506 | discard_cleanups (cleanups); |
| 507 | return regcache; |
| 508 | } |
| 509 | |
| 510 | void |
| 511 | frame_pop (struct frame_info *this_frame) |
| 512 | { |
| 513 | /* Make a copy of all the register values unwound from this frame. |
| 514 | Save them in a scratch buffer so that there isn't a race between |
| 515 | trying to extract the old values from the current_regcache while |
| 516 | at the same time writing new values into that same cache. */ |
| 517 | struct regcache *scratch |
| 518 | = frame_save_as_regcache (get_prev_frame_1 (this_frame)); |
| 519 | struct cleanup *cleanups = make_cleanup_regcache_xfree (scratch); |
| 520 | |
| 521 | /* FIXME: cagney/2003-03-16: It should be possible to tell the |
| 522 | target's register cache that it is about to be hit with a burst |
| 523 | register transfer and that the sequence of register writes should |
| 524 | be batched. The pair target_prepare_to_store() and |
| 525 | target_store_registers() kind of suggest this functionality. |
| 526 | Unfortunately, they don't implement it. Their lack of a formal |
| 527 | definition can lead to targets writing back bogus values |
| 528 | (arguably a bug in the target code mind). */ |
| 529 | /* Now copy those saved registers into the current regcache. |
| 530 | Here, regcache_cpy() calls regcache_restore(). */ |
| 531 | regcache_cpy (current_regcache, scratch); |
| 532 | do_cleanups (cleanups); |
| 533 | |
| 534 | /* We've made right mess of GDB's local state, just discard |
| 535 | everything. */ |
| 536 | flush_cached_frames (); |
| 537 | } |
| 538 | |
| 539 | void |
| 540 | frame_register_unwind (struct frame_info *frame, int regnum, |
| 541 | int *optimizedp, enum lval_type *lvalp, |
| 542 | CORE_ADDR *addrp, int *realnump, void *bufferp) |
| 543 | { |
| 544 | struct frame_unwind_cache *cache; |
| 545 | |
| 546 | if (frame_debug) |
| 547 | { |
| 548 | fprintf_unfiltered (gdb_stdlog, "\ |
| 549 | { frame_register_unwind (frame=%d,regnum=%d(%s),...) ", |
| 550 | frame->level, regnum, |
| 551 | frame_map_regnum_to_name (frame, regnum)); |
| 552 | } |
| 553 | |
| 554 | /* Require all but BUFFERP to be valid. A NULL BUFFERP indicates |
| 555 | that the value proper does not need to be fetched. */ |
| 556 | gdb_assert (optimizedp != NULL); |
| 557 | gdb_assert (lvalp != NULL); |
| 558 | gdb_assert (addrp != NULL); |
| 559 | gdb_assert (realnump != NULL); |
| 560 | /* gdb_assert (bufferp != NULL); */ |
| 561 | |
| 562 | /* NOTE: cagney/2002-11-27: A program trying to unwind a NULL frame |
| 563 | is broken. There is always a frame. If there, for some reason, |
| 564 | isn't a frame, there is some pretty busted code as it should have |
| 565 | detected the problem before calling here. */ |
| 566 | gdb_assert (frame != NULL); |
| 567 | |
| 568 | /* Find the unwinder. */ |
| 569 | if (frame->unwind == NULL) |
| 570 | frame->unwind = frame_unwind_find_by_frame (frame->next, |
| 571 | &frame->prologue_cache); |
| 572 | |
| 573 | /* Ask this frame to unwind its register. See comment in |
| 574 | "frame-unwind.h" for why NEXT frame and this unwind cache are |
| 575 | passed in. */ |
| 576 | frame->unwind->prev_register (frame->next, &frame->prologue_cache, regnum, |
| 577 | optimizedp, lvalp, addrp, realnump, bufferp); |
| 578 | |
| 579 | if (frame_debug) |
| 580 | { |
| 581 | fprintf_unfiltered (gdb_stdlog, "->"); |
| 582 | fprintf_unfiltered (gdb_stdlog, " *optimizedp=%d", (*optimizedp)); |
| 583 | fprintf_unfiltered (gdb_stdlog, " *lvalp=%d", (int) (*lvalp)); |
| 584 | fprintf_unfiltered (gdb_stdlog, " *addrp=0x%s", paddr_nz ((*addrp))); |
| 585 | fprintf_unfiltered (gdb_stdlog, " *bufferp="); |
| 586 | if (bufferp == NULL) |
| 587 | fprintf_unfiltered (gdb_stdlog, "<NULL>"); |
| 588 | else |
| 589 | { |
| 590 | int i; |
| 591 | const unsigned char *buf = bufferp; |
| 592 | fprintf_unfiltered (gdb_stdlog, "["); |
| 593 | for (i = 0; i < register_size (current_gdbarch, regnum); i++) |
| 594 | fprintf_unfiltered (gdb_stdlog, "%02x", buf[i]); |
| 595 | fprintf_unfiltered (gdb_stdlog, "]"); |
| 596 | } |
| 597 | fprintf_unfiltered (gdb_stdlog, " }\n"); |
| 598 | } |
| 599 | } |
| 600 | |
| 601 | void |
| 602 | frame_register (struct frame_info *frame, int regnum, |
| 603 | int *optimizedp, enum lval_type *lvalp, |
| 604 | CORE_ADDR *addrp, int *realnump, void *bufferp) |
| 605 | { |
| 606 | /* Require all but BUFFERP to be valid. A NULL BUFFERP indicates |
| 607 | that the value proper does not need to be fetched. */ |
| 608 | gdb_assert (optimizedp != NULL); |
| 609 | gdb_assert (lvalp != NULL); |
| 610 | gdb_assert (addrp != NULL); |
| 611 | gdb_assert (realnump != NULL); |
| 612 | /* gdb_assert (bufferp != NULL); */ |
| 613 | |
| 614 | /* Obtain the register value by unwinding the register from the next |
| 615 | (more inner frame). */ |
| 616 | gdb_assert (frame != NULL && frame->next != NULL); |
| 617 | frame_register_unwind (frame->next, regnum, optimizedp, lvalp, addrp, |
| 618 | realnump, bufferp); |
| 619 | } |
| 620 | |
| 621 | void |
| 622 | frame_unwind_register (struct frame_info *frame, int regnum, void *buf) |
| 623 | { |
| 624 | int optimized; |
| 625 | CORE_ADDR addr; |
| 626 | int realnum; |
| 627 | enum lval_type lval; |
| 628 | frame_register_unwind (frame, regnum, &optimized, &lval, &addr, |
| 629 | &realnum, buf); |
| 630 | } |
| 631 | |
| 632 | void |
| 633 | get_frame_register (struct frame_info *frame, |
| 634 | int regnum, void *buf) |
| 635 | { |
| 636 | frame_unwind_register (frame->next, regnum, buf); |
| 637 | } |
| 638 | |
| 639 | LONGEST |
| 640 | frame_unwind_register_signed (struct frame_info *frame, int regnum) |
| 641 | { |
| 642 | char buf[MAX_REGISTER_SIZE]; |
| 643 | frame_unwind_register (frame, regnum, buf); |
| 644 | return extract_signed_integer (buf, register_size (get_frame_arch (frame), |
| 645 | regnum)); |
| 646 | } |
| 647 | |
| 648 | LONGEST |
| 649 | get_frame_register_signed (struct frame_info *frame, int regnum) |
| 650 | { |
| 651 | return frame_unwind_register_signed (frame->next, regnum); |
| 652 | } |
| 653 | |
| 654 | ULONGEST |
| 655 | frame_unwind_register_unsigned (struct frame_info *frame, int regnum) |
| 656 | { |
| 657 | char buf[MAX_REGISTER_SIZE]; |
| 658 | frame_unwind_register (frame, regnum, buf); |
| 659 | return extract_unsigned_integer (buf, register_size (get_frame_arch (frame), |
| 660 | regnum)); |
| 661 | } |
| 662 | |
| 663 | ULONGEST |
| 664 | get_frame_register_unsigned (struct frame_info *frame, int regnum) |
| 665 | { |
| 666 | return frame_unwind_register_unsigned (frame->next, regnum); |
| 667 | } |
| 668 | |
| 669 | void |
| 670 | frame_unwind_unsigned_register (struct frame_info *frame, int regnum, |
| 671 | ULONGEST *val) |
| 672 | { |
| 673 | char buf[MAX_REGISTER_SIZE]; |
| 674 | frame_unwind_register (frame, regnum, buf); |
| 675 | (*val) = extract_unsigned_integer (buf, |
| 676 | register_size (get_frame_arch (frame), |
| 677 | regnum)); |
| 678 | } |
| 679 | |
| 680 | void |
| 681 | put_frame_register (struct frame_info *frame, int regnum, const void *buf) |
| 682 | { |
| 683 | struct gdbarch *gdbarch = get_frame_arch (frame); |
| 684 | int realnum; |
| 685 | int optim; |
| 686 | enum lval_type lval; |
| 687 | CORE_ADDR addr; |
| 688 | frame_register (frame, regnum, &optim, &lval, &addr, &realnum, NULL); |
| 689 | if (optim) |
| 690 | error (_("Attempt to assign to a value that was optimized out.")); |
| 691 | switch (lval) |
| 692 | { |
| 693 | case lval_memory: |
| 694 | { |
| 695 | /* FIXME: write_memory doesn't yet take constant buffers. |
| 696 | Arrrg! */ |
| 697 | char tmp[MAX_REGISTER_SIZE]; |
| 698 | memcpy (tmp, buf, register_size (gdbarch, regnum)); |
| 699 | write_memory (addr, tmp, register_size (gdbarch, regnum)); |
| 700 | break; |
| 701 | } |
| 702 | case lval_register: |
| 703 | regcache_cooked_write (current_regcache, realnum, buf); |
| 704 | break; |
| 705 | default: |
| 706 | error (_("Attempt to assign to an unmodifiable value.")); |
| 707 | } |
| 708 | } |
| 709 | |
| 710 | /* frame_register_read () |
| 711 | |
| 712 | Find and return the value of REGNUM for the specified stack frame. |
| 713 | The number of bytes copied is REGISTER_SIZE (REGNUM). |
| 714 | |
| 715 | Returns 0 if the register value could not be found. */ |
| 716 | |
| 717 | int |
| 718 | frame_register_read (struct frame_info *frame, int regnum, void *myaddr) |
| 719 | { |
| 720 | int optimized; |
| 721 | enum lval_type lval; |
| 722 | CORE_ADDR addr; |
| 723 | int realnum; |
| 724 | frame_register (frame, regnum, &optimized, &lval, &addr, &realnum, myaddr); |
| 725 | |
| 726 | /* FIXME: cagney/2002-05-15: This test is just bogus. |
| 727 | |
| 728 | It indicates that the target failed to supply a value for a |
| 729 | register because it was "not available" at this time. Problem |
| 730 | is, the target still has the register and so get saved_register() |
| 731 | may be returning a value saved on the stack. */ |
| 732 | |
| 733 | if (register_cached (regnum) < 0) |
| 734 | return 0; /* register value not available */ |
| 735 | |
| 736 | return !optimized; |
| 737 | } |
| 738 | |
| 739 | |
| 740 | /* Map between a frame register number and its name. A frame register |
| 741 | space is a superset of the cooked register space --- it also |
| 742 | includes builtin registers. */ |
| 743 | |
| 744 | int |
| 745 | frame_map_name_to_regnum (struct frame_info *frame, const char *name, int len) |
| 746 | { |
| 747 | return user_reg_map_name_to_regnum (get_frame_arch (frame), name, len); |
| 748 | } |
| 749 | |
| 750 | const char * |
| 751 | frame_map_regnum_to_name (struct frame_info *frame, int regnum) |
| 752 | { |
| 753 | return user_reg_map_regnum_to_name (get_frame_arch (frame), regnum); |
| 754 | } |
| 755 | |
| 756 | /* Create a sentinel frame. */ |
| 757 | |
| 758 | static struct frame_info * |
| 759 | create_sentinel_frame (struct regcache *regcache) |
| 760 | { |
| 761 | struct frame_info *frame = FRAME_OBSTACK_ZALLOC (struct frame_info); |
| 762 | frame->level = -1; |
| 763 | /* Explicitly initialize the sentinel frame's cache. Provide it |
| 764 | with the underlying regcache. In the future additional |
| 765 | information, such as the frame's thread will be added. */ |
| 766 | frame->prologue_cache = sentinel_frame_cache (regcache); |
| 767 | /* For the moment there is only one sentinel frame implementation. */ |
| 768 | frame->unwind = sentinel_frame_unwind; |
| 769 | /* Link this frame back to itself. The frame is self referential |
| 770 | (the unwound PC is the same as the pc), so make it so. */ |
| 771 | frame->next = frame; |
| 772 | /* Make the sentinel frame's ID valid, but invalid. That way all |
| 773 | comparisons with it should fail. */ |
| 774 | frame->this_id.p = 1; |
| 775 | frame->this_id.value = null_frame_id; |
| 776 | if (frame_debug) |
| 777 | { |
| 778 | fprintf_unfiltered (gdb_stdlog, "{ create_sentinel_frame (...) -> "); |
| 779 | fprint_frame (gdb_stdlog, frame); |
| 780 | fprintf_unfiltered (gdb_stdlog, " }\n"); |
| 781 | } |
| 782 | return frame; |
| 783 | } |
| 784 | |
| 785 | /* Info about the innermost stack frame (contents of FP register) */ |
| 786 | |
| 787 | static struct frame_info *current_frame; |
| 788 | |
| 789 | /* Cache for frame addresses already read by gdb. Valid only while |
| 790 | inferior is stopped. Control variables for the frame cache should |
| 791 | be local to this module. */ |
| 792 | |
| 793 | static struct obstack frame_cache_obstack; |
| 794 | |
| 795 | void * |
| 796 | frame_obstack_zalloc (unsigned long size) |
| 797 | { |
| 798 | void *data = obstack_alloc (&frame_cache_obstack, size); |
| 799 | memset (data, 0, size); |
| 800 | return data; |
| 801 | } |
| 802 | |
| 803 | /* Return the innermost (currently executing) stack frame. This is |
| 804 | split into two functions. The function unwind_to_current_frame() |
| 805 | is wrapped in catch exceptions so that, even when the unwind of the |
| 806 | sentinel frame fails, the function still returns a stack frame. */ |
| 807 | |
| 808 | static int |
| 809 | unwind_to_current_frame (struct ui_out *ui_out, void *args) |
| 810 | { |
| 811 | struct frame_info *frame = get_prev_frame (args); |
| 812 | /* A sentinel frame can fail to unwind, e.g., because its PC value |
| 813 | lands in somewhere like start. */ |
| 814 | if (frame == NULL) |
| 815 | return 1; |
| 816 | current_frame = frame; |
| 817 | return 0; |
| 818 | } |
| 819 | |
| 820 | struct frame_info * |
| 821 | get_current_frame (void) |
| 822 | { |
| 823 | /* First check, and report, the lack of registers. Having GDB |
| 824 | report "No stack!" or "No memory" when the target doesn't even |
| 825 | have registers is very confusing. Besides, "printcmd.exp" |
| 826 | explicitly checks that ``print $pc'' with no registers prints "No |
| 827 | registers". */ |
| 828 | if (!target_has_registers) |
| 829 | error (_("No registers.")); |
| 830 | if (!target_has_stack) |
| 831 | error (_("No stack.")); |
| 832 | if (!target_has_memory) |
| 833 | error (_("No memory.")); |
| 834 | if (current_frame == NULL) |
| 835 | { |
| 836 | struct frame_info *sentinel_frame = |
| 837 | create_sentinel_frame (current_regcache); |
| 838 | if (catch_exceptions (uiout, unwind_to_current_frame, sentinel_frame, |
| 839 | RETURN_MASK_ERROR) != 0) |
| 840 | { |
| 841 | /* Oops! Fake a current frame? Is this useful? It has a PC |
| 842 | of zero, for instance. */ |
| 843 | current_frame = sentinel_frame; |
| 844 | } |
| 845 | } |
| 846 | return current_frame; |
| 847 | } |
| 848 | |
| 849 | /* The "selected" stack frame is used by default for local and arg |
| 850 | access. May be zero, for no selected frame. */ |
| 851 | |
| 852 | struct frame_info *deprecated_selected_frame; |
| 853 | |
| 854 | /* Return the selected frame. Always non-NULL (unless there isn't an |
| 855 | inferior sufficient for creating a frame) in which case an error is |
| 856 | thrown. */ |
| 857 | |
| 858 | struct frame_info * |
| 859 | get_selected_frame (const char *message) |
| 860 | { |
| 861 | if (deprecated_selected_frame == NULL) |
| 862 | { |
| 863 | if (message != NULL && (!target_has_registers |
| 864 | || !target_has_stack |
| 865 | || !target_has_memory)) |
| 866 | error (("%s"), message); |
| 867 | /* Hey! Don't trust this. It should really be re-finding the |
| 868 | last selected frame of the currently selected thread. This, |
| 869 | though, is better than nothing. */ |
| 870 | select_frame (get_current_frame ()); |
| 871 | } |
| 872 | /* There is always a frame. */ |
| 873 | gdb_assert (deprecated_selected_frame != NULL); |
| 874 | return deprecated_selected_frame; |
| 875 | } |
| 876 | |
| 877 | /* This is a variant of get_selected_frame() which can be called when |
| 878 | the inferior does not have a frame; in that case it will return |
| 879 | NULL instead of calling error(). */ |
| 880 | |
| 881 | struct frame_info * |
| 882 | deprecated_safe_get_selected_frame (void) |
| 883 | { |
| 884 | if (!target_has_registers || !target_has_stack || !target_has_memory) |
| 885 | return NULL; |
| 886 | return get_selected_frame (NULL); |
| 887 | } |
| 888 | |
| 889 | /* Select frame FI (or NULL - to invalidate the current frame). */ |
| 890 | |
| 891 | void |
| 892 | select_frame (struct frame_info *fi) |
| 893 | { |
| 894 | struct symtab *s; |
| 895 | |
| 896 | deprecated_selected_frame = fi; |
| 897 | /* NOTE: cagney/2002-05-04: FI can be NULL. This occurs when the |
| 898 | frame is being invalidated. */ |
| 899 | if (deprecated_selected_frame_level_changed_hook) |
| 900 | deprecated_selected_frame_level_changed_hook (frame_relative_level (fi)); |
| 901 | |
| 902 | /* FIXME: kseitz/2002-08-28: It would be nice to call |
| 903 | selected_frame_level_changed_event() right here, but due to limitations |
| 904 | in the current interfaces, we would end up flooding UIs with events |
| 905 | because select_frame() is used extensively internally. |
| 906 | |
| 907 | Once we have frame-parameterized frame (and frame-related) commands, |
| 908 | the event notification can be moved here, since this function will only |
| 909 | be called when the user's selected frame is being changed. */ |
| 910 | |
| 911 | /* Ensure that symbols for this frame are read in. Also, determine the |
| 912 | source language of this frame, and switch to it if desired. */ |
| 913 | if (fi) |
| 914 | { |
| 915 | /* We retrieve the frame's symtab by using the frame PC. However |
| 916 | we cannot use the frame PC as-is, because it usually points to |
| 917 | the instruction following the "call", which is sometimes the |
| 918 | first instruction of another function. So we rely on |
| 919 | get_frame_address_in_block() which provides us with a PC which |
| 920 | is guaranteed to be inside the frame's code block. */ |
| 921 | s = find_pc_symtab (get_frame_address_in_block (fi)); |
| 922 | if (s |
| 923 | && s->language != current_language->la_language |
| 924 | && s->language != language_unknown |
| 925 | && language_mode == language_mode_auto) |
| 926 | { |
| 927 | set_language (s->language); |
| 928 | } |
| 929 | } |
| 930 | } |
| 931 | |
| 932 | /* Create an arbitrary (i.e. address specified by user) or innermost frame. |
| 933 | Always returns a non-NULL value. */ |
| 934 | |
| 935 | struct frame_info * |
| 936 | create_new_frame (CORE_ADDR addr, CORE_ADDR pc) |
| 937 | { |
| 938 | struct frame_info *fi; |
| 939 | |
| 940 | if (frame_debug) |
| 941 | { |
| 942 | fprintf_unfiltered (gdb_stdlog, |
| 943 | "{ create_new_frame (addr=0x%s, pc=0x%s) ", |
| 944 | paddr_nz (addr), paddr_nz (pc)); |
| 945 | } |
| 946 | |
| 947 | fi = frame_obstack_zalloc (sizeof (struct frame_info)); |
| 948 | |
| 949 | fi->next = create_sentinel_frame (current_regcache); |
| 950 | |
| 951 | /* Select/initialize both the unwind function and the frame's type |
| 952 | based on the PC. */ |
| 953 | fi->unwind = frame_unwind_find_by_frame (fi->next, &fi->prologue_cache); |
| 954 | |
| 955 | fi->this_id.p = 1; |
| 956 | deprecated_update_frame_base_hack (fi, addr); |
| 957 | deprecated_update_frame_pc_hack (fi, pc); |
| 958 | |
| 959 | if (frame_debug) |
| 960 | { |
| 961 | fprintf_unfiltered (gdb_stdlog, "-> "); |
| 962 | fprint_frame (gdb_stdlog, fi); |
| 963 | fprintf_unfiltered (gdb_stdlog, " }\n"); |
| 964 | } |
| 965 | |
| 966 | return fi; |
| 967 | } |
| 968 | |
| 969 | /* Return the frame that THIS_FRAME calls (NULL if THIS_FRAME is the |
| 970 | innermost frame). Be careful to not fall off the bottom of the |
| 971 | frame chain and onto the sentinel frame. */ |
| 972 | |
| 973 | struct frame_info * |
| 974 | get_next_frame (struct frame_info *this_frame) |
| 975 | { |
| 976 | if (this_frame->level > 0) |
| 977 | return this_frame->next; |
| 978 | else |
| 979 | return NULL; |
| 980 | } |
| 981 | |
| 982 | /* Observer for the target_changed event. */ |
| 983 | |
| 984 | void |
| 985 | frame_observer_target_changed (struct target_ops *target) |
| 986 | { |
| 987 | flush_cached_frames (); |
| 988 | } |
| 989 | |
| 990 | /* Flush the entire frame cache. */ |
| 991 | |
| 992 | void |
| 993 | flush_cached_frames (void) |
| 994 | { |
| 995 | /* Since we can't really be sure what the first object allocated was */ |
| 996 | obstack_free (&frame_cache_obstack, 0); |
| 997 | obstack_init (&frame_cache_obstack); |
| 998 | |
| 999 | current_frame = NULL; /* Invalidate cache */ |
| 1000 | select_frame (NULL); |
| 1001 | annotate_frames_invalid (); |
| 1002 | if (frame_debug) |
| 1003 | fprintf_unfiltered (gdb_stdlog, "{ flush_cached_frames () }\n"); |
| 1004 | } |
| 1005 | |
| 1006 | /* Flush the frame cache, and start a new one if necessary. */ |
| 1007 | |
| 1008 | void |
| 1009 | reinit_frame_cache (void) |
| 1010 | { |
| 1011 | flush_cached_frames (); |
| 1012 | |
| 1013 | /* FIXME: The inferior_ptid test is wrong if there is a corefile. */ |
| 1014 | if (PIDGET (inferior_ptid) != 0) |
| 1015 | { |
| 1016 | select_frame (get_current_frame ()); |
| 1017 | } |
| 1018 | } |
| 1019 | |
| 1020 | /* Return a "struct frame_info" corresponding to the frame that called |
| 1021 | THIS_FRAME. Returns NULL if there is no such frame. |
| 1022 | |
| 1023 | Unlike get_prev_frame, this function always tries to unwind the |
| 1024 | frame. */ |
| 1025 | |
| 1026 | static struct frame_info * |
| 1027 | get_prev_frame_1 (struct frame_info *this_frame) |
| 1028 | { |
| 1029 | struct frame_info *prev_frame; |
| 1030 | struct frame_id this_id; |
| 1031 | |
| 1032 | gdb_assert (this_frame != NULL); |
| 1033 | |
| 1034 | if (frame_debug) |
| 1035 | { |
| 1036 | fprintf_unfiltered (gdb_stdlog, "{ get_prev_frame_1 (this_frame="); |
| 1037 | if (this_frame != NULL) |
| 1038 | fprintf_unfiltered (gdb_stdlog, "%d", this_frame->level); |
| 1039 | else |
| 1040 | fprintf_unfiltered (gdb_stdlog, "<NULL>"); |
| 1041 | fprintf_unfiltered (gdb_stdlog, ") "); |
| 1042 | } |
| 1043 | |
| 1044 | /* Only try to do the unwind once. */ |
| 1045 | if (this_frame->prev_p) |
| 1046 | { |
| 1047 | if (frame_debug) |
| 1048 | { |
| 1049 | fprintf_unfiltered (gdb_stdlog, "-> "); |
| 1050 | fprint_frame (gdb_stdlog, this_frame->prev); |
| 1051 | fprintf_unfiltered (gdb_stdlog, " // cached \n"); |
| 1052 | } |
| 1053 | return this_frame->prev; |
| 1054 | } |
| 1055 | this_frame->prev_p = 1; |
| 1056 | |
| 1057 | /* Check that this frame's ID was valid. If it wasn't, don't try to |
| 1058 | unwind to the prev frame. Be careful to not apply this test to |
| 1059 | the sentinel frame. */ |
| 1060 | this_id = get_frame_id (this_frame); |
| 1061 | if (this_frame->level >= 0 && !frame_id_p (this_id)) |
| 1062 | { |
| 1063 | if (frame_debug) |
| 1064 | { |
| 1065 | fprintf_unfiltered (gdb_stdlog, "-> "); |
| 1066 | fprint_frame (gdb_stdlog, NULL); |
| 1067 | fprintf_unfiltered (gdb_stdlog, " // this ID is NULL }\n"); |
| 1068 | } |
| 1069 | return NULL; |
| 1070 | } |
| 1071 | |
| 1072 | /* Check that this frame's ID isn't inner to (younger, below, next) |
| 1073 | the next frame. This happens when a frame unwind goes backwards. |
| 1074 | Exclude signal trampolines (due to sigaltstack the frame ID can |
| 1075 | go backwards) and sentinel frames (the test is meaningless). */ |
| 1076 | if (this_frame->next->level >= 0 |
| 1077 | && this_frame->next->unwind->type != SIGTRAMP_FRAME |
| 1078 | && frame_id_inner (this_id, get_frame_id (this_frame->next))) |
| 1079 | error (_("Previous frame inner to this frame (corrupt stack?)")); |
| 1080 | |
| 1081 | /* Check that this and the next frame are not identical. If they |
| 1082 | are, there is most likely a stack cycle. As with the inner-than |
| 1083 | test above, avoid comparing the inner-most and sentinel frames. */ |
| 1084 | if (this_frame->level > 0 |
| 1085 | && frame_id_eq (this_id, get_frame_id (this_frame->next))) |
| 1086 | error (_("Previous frame identical to this frame (corrupt stack?)")); |
| 1087 | |
| 1088 | /* Allocate the new frame but do not wire it in to the frame chain. |
| 1089 | Some (bad) code in INIT_FRAME_EXTRA_INFO tries to look along |
| 1090 | frame->next to pull some fancy tricks (of course such code is, by |
| 1091 | definition, recursive). Try to prevent it. |
| 1092 | |
| 1093 | There is no reason to worry about memory leaks, should the |
| 1094 | remainder of the function fail. The allocated memory will be |
| 1095 | quickly reclaimed when the frame cache is flushed, and the `we've |
| 1096 | been here before' check above will stop repeated memory |
| 1097 | allocation calls. */ |
| 1098 | prev_frame = FRAME_OBSTACK_ZALLOC (struct frame_info); |
| 1099 | prev_frame->level = this_frame->level + 1; |
| 1100 | |
| 1101 | /* Don't yet compute ->unwind (and hence ->type). It is computed |
| 1102 | on-demand in get_frame_type, frame_register_unwind, and |
| 1103 | get_frame_id. */ |
| 1104 | |
| 1105 | /* Don't yet compute the frame's ID. It is computed on-demand by |
| 1106 | get_frame_id(). */ |
| 1107 | |
| 1108 | /* The unwound frame ID is validate at the start of this function, |
| 1109 | as part of the logic to decide if that frame should be further |
| 1110 | unwound, and not here while the prev frame is being created. |
| 1111 | Doing this makes it possible for the user to examine a frame that |
| 1112 | has an invalid frame ID. |
| 1113 | |
| 1114 | Some very old VAX code noted: [...] For the sake of argument, |
| 1115 | suppose that the stack is somewhat trashed (which is one reason |
| 1116 | that "info frame" exists). So, return 0 (indicating we don't |
| 1117 | know the address of the arglist) if we don't know what frame this |
| 1118 | frame calls. */ |
| 1119 | |
| 1120 | /* Link it in. */ |
| 1121 | this_frame->prev = prev_frame; |
| 1122 | prev_frame->next = this_frame; |
| 1123 | |
| 1124 | if (frame_debug) |
| 1125 | { |
| 1126 | fprintf_unfiltered (gdb_stdlog, "-> "); |
| 1127 | fprint_frame (gdb_stdlog, prev_frame); |
| 1128 | fprintf_unfiltered (gdb_stdlog, " }\n"); |
| 1129 | } |
| 1130 | |
| 1131 | return prev_frame; |
| 1132 | } |
| 1133 | |
| 1134 | /* Debug routine to print a NULL frame being returned. */ |
| 1135 | |
| 1136 | static void |
| 1137 | frame_debug_got_null_frame (struct ui_file *file, |
| 1138 | struct frame_info *this_frame, |
| 1139 | const char *reason) |
| 1140 | { |
| 1141 | if (frame_debug) |
| 1142 | { |
| 1143 | fprintf_unfiltered (gdb_stdlog, "{ get_prev_frame (this_frame="); |
| 1144 | if (this_frame != NULL) |
| 1145 | fprintf_unfiltered (gdb_stdlog, "%d", this_frame->level); |
| 1146 | else |
| 1147 | fprintf_unfiltered (gdb_stdlog, "<NULL>"); |
| 1148 | fprintf_unfiltered (gdb_stdlog, ") -> // %s}\n", reason); |
| 1149 | } |
| 1150 | } |
| 1151 | |
| 1152 | /* Is this (non-sentinel) frame in the "main"() function? */ |
| 1153 | |
| 1154 | static int |
| 1155 | inside_main_func (struct frame_info *this_frame) |
| 1156 | { |
| 1157 | struct minimal_symbol *msymbol; |
| 1158 | CORE_ADDR maddr; |
| 1159 | |
| 1160 | if (symfile_objfile == 0) |
| 1161 | return 0; |
| 1162 | msymbol = lookup_minimal_symbol (main_name (), NULL, symfile_objfile); |
| 1163 | if (msymbol == NULL) |
| 1164 | return 0; |
| 1165 | /* Make certain that the code, and not descriptor, address is |
| 1166 | returned. */ |
| 1167 | maddr = gdbarch_convert_from_func_ptr_addr (current_gdbarch, |
| 1168 | SYMBOL_VALUE_ADDRESS (msymbol), |
| 1169 | ¤t_target); |
| 1170 | return maddr == get_frame_func (this_frame); |
| 1171 | } |
| 1172 | |
| 1173 | /* Test whether THIS_FRAME is inside the process entry point function. */ |
| 1174 | |
| 1175 | static int |
| 1176 | inside_entry_func (struct frame_info *this_frame) |
| 1177 | { |
| 1178 | return (get_frame_func (this_frame) == entry_point_address ()); |
| 1179 | } |
| 1180 | |
| 1181 | /* Return a structure containing various interesting information about |
| 1182 | the frame that called THIS_FRAME. Returns NULL if there is entier |
| 1183 | no such frame or the frame fails any of a set of target-independent |
| 1184 | condition that should terminate the frame chain (e.g., as unwinding |
| 1185 | past main()). |
| 1186 | |
| 1187 | This function should not contain target-dependent tests, such as |
| 1188 | checking whether the program-counter is zero. */ |
| 1189 | |
| 1190 | struct frame_info * |
| 1191 | get_prev_frame (struct frame_info *this_frame) |
| 1192 | { |
| 1193 | struct frame_info *prev_frame; |
| 1194 | |
| 1195 | /* Return the inner-most frame, when the caller passes in NULL. */ |
| 1196 | /* NOTE: cagney/2002-11-09: Not sure how this would happen. The |
| 1197 | caller should have previously obtained a valid frame using |
| 1198 | get_selected_frame() and then called this code - only possibility |
| 1199 | I can think of is code behaving badly. |
| 1200 | |
| 1201 | NOTE: cagney/2003-01-10: Talk about code behaving badly. Check |
| 1202 | block_innermost_frame(). It does the sequence: frame = NULL; |
| 1203 | while (1) { frame = get_prev_frame (frame); .... }. Ulgh! Why |
| 1204 | it couldn't be written better, I don't know. |
| 1205 | |
| 1206 | NOTE: cagney/2003-01-11: I suspect what is happening in |
| 1207 | block_innermost_frame() is, when the target has no state |
| 1208 | (registers, memory, ...), it is still calling this function. The |
| 1209 | assumption being that this function will return NULL indicating |
| 1210 | that a frame isn't possible, rather than checking that the target |
| 1211 | has state and then calling get_current_frame() and |
| 1212 | get_prev_frame(). This is a guess mind. */ |
| 1213 | if (this_frame == NULL) |
| 1214 | { |
| 1215 | /* NOTE: cagney/2002-11-09: There was a code segment here that |
| 1216 | would error out when CURRENT_FRAME was NULL. The comment |
| 1217 | that went with it made the claim ... |
| 1218 | |
| 1219 | ``This screws value_of_variable, which just wants a nice |
| 1220 | clean NULL return from block_innermost_frame if there are no |
| 1221 | frames. I don't think I've ever seen this message happen |
| 1222 | otherwise. And returning NULL here is a perfectly legitimate |
| 1223 | thing to do.'' |
| 1224 | |
| 1225 | Per the above, this code shouldn't even be called with a NULL |
| 1226 | THIS_FRAME. */ |
| 1227 | frame_debug_got_null_frame (gdb_stdlog, this_frame, "this_frame NULL"); |
| 1228 | return current_frame; |
| 1229 | } |
| 1230 | |
| 1231 | /* There is always a frame. If this assertion fails, suspect that |
| 1232 | something should be calling get_selected_frame() or |
| 1233 | get_current_frame(). */ |
| 1234 | gdb_assert (this_frame != NULL); |
| 1235 | |
| 1236 | /* tausq/2004-12-07: Dummy frames are skipped because it doesn't make much |
| 1237 | sense to stop unwinding at a dummy frame. One place where a dummy |
| 1238 | frame may have an address "inside_main_func" is on HPUX. On HPUX, the |
| 1239 | pcsqh register (space register for the instruction at the head of the |
| 1240 | instruction queue) cannot be written directly; the only way to set it |
| 1241 | is to branch to code that is in the target space. In order to implement |
| 1242 | frame dummies on HPUX, the called function is made to jump back to where |
| 1243 | the inferior was when the user function was called. If gdb was inside |
| 1244 | the main function when we created the dummy frame, the dummy frame will |
| 1245 | point inside the main function. */ |
| 1246 | if (this_frame->level >= 0 |
| 1247 | && get_frame_type (this_frame) != DUMMY_FRAME |
| 1248 | && !backtrace_past_main |
| 1249 | && inside_main_func (this_frame)) |
| 1250 | /* Don't unwind past main(). Note, this is done _before_ the |
| 1251 | frame has been marked as previously unwound. That way if the |
| 1252 | user later decides to enable unwinds past main(), that will |
| 1253 | automatically happen. */ |
| 1254 | { |
| 1255 | frame_debug_got_null_frame (gdb_stdlog, this_frame, "inside main func"); |
| 1256 | return NULL; |
| 1257 | } |
| 1258 | |
| 1259 | if (this_frame->level > backtrace_limit) |
| 1260 | { |
| 1261 | error (_("Backtrace limit of %d exceeded"), backtrace_limit); |
| 1262 | } |
| 1263 | |
| 1264 | /* If we're already inside the entry function for the main objfile, |
| 1265 | then it isn't valid. Don't apply this test to a dummy frame - |
| 1266 | dummy frame PCs typically land in the entry func. Don't apply |
| 1267 | this test to the sentinel frame. Sentinel frames should always |
| 1268 | be allowed to unwind. */ |
| 1269 | /* NOTE: cagney/2003-07-07: Fixed a bug in inside_main_func() - |
| 1270 | wasn't checking for "main" in the minimal symbols. With that |
| 1271 | fixed asm-source tests now stop in "main" instead of halting the |
| 1272 | backtrace in weird and wonderful ways somewhere inside the entry |
| 1273 | file. Suspect that tests for inside the entry file/func were |
| 1274 | added to work around that (now fixed) case. */ |
| 1275 | /* NOTE: cagney/2003-07-15: danielj (if I'm reading it right) |
| 1276 | suggested having the inside_entry_func test use the |
| 1277 | inside_main_func() msymbol trick (along with entry_point_address() |
| 1278 | I guess) to determine the address range of the start function. |
| 1279 | That should provide a far better stopper than the current |
| 1280 | heuristics. */ |
| 1281 | /* NOTE: tausq/2004-10-09: this is needed if, for example, the compiler |
| 1282 | applied tail-call optimizations to main so that a function called |
| 1283 | from main returns directly to the caller of main. Since we don't |
| 1284 | stop at main, we should at least stop at the entry point of the |
| 1285 | application. */ |
| 1286 | if (!backtrace_past_entry |
| 1287 | && get_frame_type (this_frame) != DUMMY_FRAME && this_frame->level >= 0 |
| 1288 | && inside_entry_func (this_frame)) |
| 1289 | { |
| 1290 | frame_debug_got_null_frame (gdb_stdlog, this_frame, "inside entry func"); |
| 1291 | return NULL; |
| 1292 | } |
| 1293 | |
| 1294 | /* Assume that the only way to get a zero PC is through something |
| 1295 | like a SIGSEGV or a dummy frame, and hence that NORMAL frames |
| 1296 | will never unwind a zero PC. */ |
| 1297 | if (this_frame->level > 0 |
| 1298 | && get_frame_type (this_frame) == NORMAL_FRAME |
| 1299 | && get_frame_type (get_next_frame (this_frame)) == NORMAL_FRAME |
| 1300 | && get_frame_pc (this_frame) == 0) |
| 1301 | { |
| 1302 | frame_debug_got_null_frame (gdb_stdlog, this_frame, "zero PC"); |
| 1303 | return NULL; |
| 1304 | } |
| 1305 | |
| 1306 | return get_prev_frame_1 (this_frame); |
| 1307 | } |
| 1308 | |
| 1309 | CORE_ADDR |
| 1310 | get_frame_pc (struct frame_info *frame) |
| 1311 | { |
| 1312 | gdb_assert (frame->next != NULL); |
| 1313 | return frame_pc_unwind (frame->next); |
| 1314 | } |
| 1315 | |
| 1316 | /* Return an address of that falls within the frame's code block. */ |
| 1317 | |
| 1318 | CORE_ADDR |
| 1319 | frame_unwind_address_in_block (struct frame_info *next_frame) |
| 1320 | { |
| 1321 | /* A draft address. */ |
| 1322 | CORE_ADDR pc = frame_pc_unwind (next_frame); |
| 1323 | |
| 1324 | /* If THIS frame is not inner most (i.e., NEXT isn't the sentinel), |
| 1325 | and NEXT is `normal' (i.e., not a sigtramp, dummy, ....) THIS |
| 1326 | frame's PC ends up pointing at the instruction fallowing the |
| 1327 | "call". Adjust that PC value so that it falls on the call |
| 1328 | instruction (which, hopefully, falls within THIS frame's code |
| 1329 | block. So far it's proved to be a very good approximation. See |
| 1330 | get_frame_type() for why ->type can't be used. */ |
| 1331 | if (next_frame->level >= 0 |
| 1332 | && get_frame_type (next_frame) == NORMAL_FRAME) |
| 1333 | --pc; |
| 1334 | return pc; |
| 1335 | } |
| 1336 | |
| 1337 | CORE_ADDR |
| 1338 | get_frame_address_in_block (struct frame_info *this_frame) |
| 1339 | { |
| 1340 | return frame_unwind_address_in_block (this_frame->next); |
| 1341 | } |
| 1342 | |
| 1343 | static int |
| 1344 | pc_notcurrent (struct frame_info *frame) |
| 1345 | { |
| 1346 | /* If FRAME is not the innermost frame, that normally means that |
| 1347 | FRAME->pc points at the return instruction (which is *after* the |
| 1348 | call instruction), and we want to get the line containing the |
| 1349 | call (because the call is where the user thinks the program is). |
| 1350 | However, if the next frame is either a SIGTRAMP_FRAME or a |
| 1351 | DUMMY_FRAME, then the next frame will contain a saved interrupt |
| 1352 | PC and such a PC indicates the current (rather than next) |
| 1353 | instruction/line, consequently, for such cases, want to get the |
| 1354 | line containing fi->pc. */ |
| 1355 | struct frame_info *next = get_next_frame (frame); |
| 1356 | int notcurrent = (next != NULL && get_frame_type (next) == NORMAL_FRAME); |
| 1357 | return notcurrent; |
| 1358 | } |
| 1359 | |
| 1360 | void |
| 1361 | find_frame_sal (struct frame_info *frame, struct symtab_and_line *sal) |
| 1362 | { |
| 1363 | (*sal) = find_pc_line (get_frame_pc (frame), pc_notcurrent (frame)); |
| 1364 | } |
| 1365 | |
| 1366 | /* Per "frame.h", return the ``address'' of the frame. Code should |
| 1367 | really be using get_frame_id(). */ |
| 1368 | CORE_ADDR |
| 1369 | get_frame_base (struct frame_info *fi) |
| 1370 | { |
| 1371 | return get_frame_id (fi).stack_addr; |
| 1372 | } |
| 1373 | |
| 1374 | /* High-level offsets into the frame. Used by the debug info. */ |
| 1375 | |
| 1376 | CORE_ADDR |
| 1377 | get_frame_base_address (struct frame_info *fi) |
| 1378 | { |
| 1379 | if (get_frame_type (fi) != NORMAL_FRAME) |
| 1380 | return 0; |
| 1381 | if (fi->base == NULL) |
| 1382 | fi->base = frame_base_find_by_frame (fi->next); |
| 1383 | /* Sneaky: If the low-level unwind and high-level base code share a |
| 1384 | common unwinder, let them share the prologue cache. */ |
| 1385 | if (fi->base->unwind == fi->unwind) |
| 1386 | return fi->base->this_base (fi->next, &fi->prologue_cache); |
| 1387 | return fi->base->this_base (fi->next, &fi->base_cache); |
| 1388 | } |
| 1389 | |
| 1390 | CORE_ADDR |
| 1391 | get_frame_locals_address (struct frame_info *fi) |
| 1392 | { |
| 1393 | void **cache; |
| 1394 | if (get_frame_type (fi) != NORMAL_FRAME) |
| 1395 | return 0; |
| 1396 | /* If there isn't a frame address method, find it. */ |
| 1397 | if (fi->base == NULL) |
| 1398 | fi->base = frame_base_find_by_frame (fi->next); |
| 1399 | /* Sneaky: If the low-level unwind and high-level base code share a |
| 1400 | common unwinder, let them share the prologue cache. */ |
| 1401 | if (fi->base->unwind == fi->unwind) |
| 1402 | cache = &fi->prologue_cache; |
| 1403 | else |
| 1404 | cache = &fi->base_cache; |
| 1405 | return fi->base->this_locals (fi->next, cache); |
| 1406 | } |
| 1407 | |
| 1408 | CORE_ADDR |
| 1409 | get_frame_args_address (struct frame_info *fi) |
| 1410 | { |
| 1411 | void **cache; |
| 1412 | if (get_frame_type (fi) != NORMAL_FRAME) |
| 1413 | return 0; |
| 1414 | /* If there isn't a frame address method, find it. */ |
| 1415 | if (fi->base == NULL) |
| 1416 | fi->base = frame_base_find_by_frame (fi->next); |
| 1417 | /* Sneaky: If the low-level unwind and high-level base code share a |
| 1418 | common unwinder, let them share the prologue cache. */ |
| 1419 | if (fi->base->unwind == fi->unwind) |
| 1420 | cache = &fi->prologue_cache; |
| 1421 | else |
| 1422 | cache = &fi->base_cache; |
| 1423 | return fi->base->this_args (fi->next, cache); |
| 1424 | } |
| 1425 | |
| 1426 | /* Level of the selected frame: 0 for innermost, 1 for its caller, ... |
| 1427 | or -1 for a NULL frame. */ |
| 1428 | |
| 1429 | int |
| 1430 | frame_relative_level (struct frame_info *fi) |
| 1431 | { |
| 1432 | if (fi == NULL) |
| 1433 | return -1; |
| 1434 | else |
| 1435 | return fi->level; |
| 1436 | } |
| 1437 | |
| 1438 | enum frame_type |
| 1439 | get_frame_type (struct frame_info *frame) |
| 1440 | { |
| 1441 | if (frame->unwind == NULL) |
| 1442 | /* Initialize the frame's unwinder because that's what |
| 1443 | provides the frame's type. */ |
| 1444 | frame->unwind = frame_unwind_find_by_frame (frame->next, |
| 1445 | &frame->prologue_cache); |
| 1446 | return frame->unwind->type; |
| 1447 | } |
| 1448 | |
| 1449 | void |
| 1450 | deprecated_update_frame_pc_hack (struct frame_info *frame, CORE_ADDR pc) |
| 1451 | { |
| 1452 | if (frame_debug) |
| 1453 | fprintf_unfiltered (gdb_stdlog, |
| 1454 | "{ deprecated_update_frame_pc_hack (frame=%d,pc=0x%s) }\n", |
| 1455 | frame->level, paddr_nz (pc)); |
| 1456 | /* NOTE: cagney/2003-03-11: Some architectures (e.g., Arm) are |
| 1457 | maintaining a locally allocated frame object. Since such frames |
| 1458 | are not in the frame chain, it isn't possible to assume that the |
| 1459 | frame has a next. Sigh. */ |
| 1460 | if (frame->next != NULL) |
| 1461 | { |
| 1462 | /* While we're at it, update this frame's cached PC value, found |
| 1463 | in the next frame. Oh for the day when "struct frame_info" |
| 1464 | is opaque and this hack on hack can just go away. */ |
| 1465 | frame->next->prev_pc.value = pc; |
| 1466 | frame->next->prev_pc.p = 1; |
| 1467 | } |
| 1468 | } |
| 1469 | |
| 1470 | void |
| 1471 | deprecated_update_frame_base_hack (struct frame_info *frame, CORE_ADDR base) |
| 1472 | { |
| 1473 | if (frame_debug) |
| 1474 | fprintf_unfiltered (gdb_stdlog, |
| 1475 | "{ deprecated_update_frame_base_hack (frame=%d,base=0x%s) }\n", |
| 1476 | frame->level, paddr_nz (base)); |
| 1477 | /* See comment in "frame.h". */ |
| 1478 | frame->this_id.value.stack_addr = base; |
| 1479 | } |
| 1480 | |
| 1481 | /* Memory access methods. */ |
| 1482 | |
| 1483 | void |
| 1484 | get_frame_memory (struct frame_info *this_frame, CORE_ADDR addr, void *buf, |
| 1485 | int len) |
| 1486 | { |
| 1487 | read_memory (addr, buf, len); |
| 1488 | } |
| 1489 | |
| 1490 | LONGEST |
| 1491 | get_frame_memory_signed (struct frame_info *this_frame, CORE_ADDR addr, |
| 1492 | int len) |
| 1493 | { |
| 1494 | return read_memory_integer (addr, len); |
| 1495 | } |
| 1496 | |
| 1497 | ULONGEST |
| 1498 | get_frame_memory_unsigned (struct frame_info *this_frame, CORE_ADDR addr, |
| 1499 | int len) |
| 1500 | { |
| 1501 | return read_memory_unsigned_integer (addr, len); |
| 1502 | } |
| 1503 | |
| 1504 | int |
| 1505 | safe_frame_unwind_memory (struct frame_info *this_frame, |
| 1506 | CORE_ADDR addr, void *buf, int len) |
| 1507 | { |
| 1508 | /* NOTE: deprecated_read_memory_nobpt returns zero on success! */ |
| 1509 | return !deprecated_read_memory_nobpt (addr, buf, len); |
| 1510 | } |
| 1511 | |
| 1512 | /* Architecture method. */ |
| 1513 | |
| 1514 | struct gdbarch * |
| 1515 | get_frame_arch (struct frame_info *this_frame) |
| 1516 | { |
| 1517 | return current_gdbarch; |
| 1518 | } |
| 1519 | |
| 1520 | /* Stack pointer methods. */ |
| 1521 | |
| 1522 | CORE_ADDR |
| 1523 | get_frame_sp (struct frame_info *this_frame) |
| 1524 | { |
| 1525 | return frame_sp_unwind (this_frame->next); |
| 1526 | } |
| 1527 | |
| 1528 | CORE_ADDR |
| 1529 | frame_sp_unwind (struct frame_info *next_frame) |
| 1530 | { |
| 1531 | /* Normality - an architecture that provides a way of obtaining any |
| 1532 | frame inner-most address. */ |
| 1533 | if (gdbarch_unwind_sp_p (current_gdbarch)) |
| 1534 | return gdbarch_unwind_sp (current_gdbarch, next_frame); |
| 1535 | /* Things are looking grim. If it's the inner-most frame and there |
| 1536 | is a TARGET_READ_SP, then that can be used. */ |
| 1537 | if (next_frame->level < 0 && TARGET_READ_SP_P ()) |
| 1538 | return TARGET_READ_SP (); |
| 1539 | /* Now things are really are grim. Hope that the value returned by |
| 1540 | the SP_REGNUM register is meaningful. */ |
| 1541 | if (SP_REGNUM >= 0) |
| 1542 | { |
| 1543 | ULONGEST sp; |
| 1544 | frame_unwind_unsigned_register (next_frame, SP_REGNUM, &sp); |
| 1545 | return sp; |
| 1546 | } |
| 1547 | internal_error (__FILE__, __LINE__, _("Missing unwind SP method")); |
| 1548 | } |
| 1549 | |
| 1550 | extern initialize_file_ftype _initialize_frame; /* -Wmissing-prototypes */ |
| 1551 | |
| 1552 | static struct cmd_list_element *set_backtrace_cmdlist; |
| 1553 | static struct cmd_list_element *show_backtrace_cmdlist; |
| 1554 | |
| 1555 | static void |
| 1556 | set_backtrace_cmd (char *args, int from_tty) |
| 1557 | { |
| 1558 | help_list (set_backtrace_cmdlist, "set backtrace ", -1, gdb_stdout); |
| 1559 | } |
| 1560 | |
| 1561 | static void |
| 1562 | show_backtrace_cmd (char *args, int from_tty) |
| 1563 | { |
| 1564 | cmd_show_list (show_backtrace_cmdlist, from_tty, ""); |
| 1565 | } |
| 1566 | |
| 1567 | void |
| 1568 | _initialize_frame (void) |
| 1569 | { |
| 1570 | obstack_init (&frame_cache_obstack); |
| 1571 | |
| 1572 | observer_attach_target_changed (frame_observer_target_changed); |
| 1573 | |
| 1574 | add_prefix_cmd ("backtrace", class_maintenance, set_backtrace_cmd, _("\ |
| 1575 | Set backtrace specific variables.\n\ |
| 1576 | Configure backtrace variables such as the backtrace limit"), |
| 1577 | &set_backtrace_cmdlist, "set backtrace ", |
| 1578 | 0/*allow-unknown*/, &setlist); |
| 1579 | add_prefix_cmd ("backtrace", class_maintenance, show_backtrace_cmd, _("\ |
| 1580 | Show backtrace specific variables\n\ |
| 1581 | Show backtrace variables such as the backtrace limit"), |
| 1582 | &show_backtrace_cmdlist, "show backtrace ", |
| 1583 | 0/*allow-unknown*/, &showlist); |
| 1584 | |
| 1585 | add_setshow_boolean_cmd ("past-main", class_obscure, |
| 1586 | &backtrace_past_main, _("\ |
| 1587 | Set whether backtraces should continue past \"main\"."), _("\ |
| 1588 | Show whether backtraces should continue past \"main\"."), _("\ |
| 1589 | Normally the caller of \"main\" is not of interest, so GDB will terminate\n\ |
| 1590 | the backtrace at \"main\". Set this variable if you need to see the rest\n\ |
| 1591 | of the stack trace."), |
| 1592 | NULL, |
| 1593 | show_backtrace_past_main, |
| 1594 | &set_backtrace_cmdlist, |
| 1595 | &show_backtrace_cmdlist); |
| 1596 | |
| 1597 | add_setshow_boolean_cmd ("past-entry", class_obscure, |
| 1598 | &backtrace_past_entry, _("\ |
| 1599 | Set whether backtraces should continue past the entry point of a program."), |
| 1600 | _("\ |
| 1601 | Show whether backtraces should continue past the entry point of a program."), |
| 1602 | _("\ |
| 1603 | Normally there are no callers beyond the entry point of a program, so GDB\n\ |
| 1604 | will terminate the backtrace there. Set this variable if you need to see \n\ |
| 1605 | the rest of the stack trace."), |
| 1606 | NULL, |
| 1607 | show_backtrace_past_entry, |
| 1608 | &set_backtrace_cmdlist, |
| 1609 | &show_backtrace_cmdlist); |
| 1610 | |
| 1611 | add_setshow_uinteger_cmd ("limit", class_obscure, |
| 1612 | &backtrace_limit, _("\ |
| 1613 | Set an upper bound on the number of backtrace levels."), _("\ |
| 1614 | Show the upper bound on the number of backtrace levels."), _("\ |
| 1615 | No more than the specified number of frames can be displayed or examined.\n\ |
| 1616 | Zero is unlimited."), |
| 1617 | NULL, |
| 1618 | show_backtrace_limit, |
| 1619 | &set_backtrace_cmdlist, |
| 1620 | &show_backtrace_cmdlist); |
| 1621 | |
| 1622 | /* Debug this files internals. */ |
| 1623 | add_setshow_zinteger_cmd ("frame", class_maintenance, &frame_debug, _("\ |
| 1624 | Set frame debugging."), _("\ |
| 1625 | Show frame debugging."), _("\ |
| 1626 | When non-zero, frame specific internal debugging is enabled."), |
| 1627 | NULL, |
| 1628 | show_frame_debug, |
| 1629 | &setdebuglist, &showdebuglist); |
| 1630 | } |