Commit | Line | Data |
---|---|---|
4f460812 | 1 | /* Cache and manage frames for GDB, the GNU debugger. |
96cb11df AC |
2 | |
3 | Copyright 1986, 1987, 1989, 1991, 1994, 1995, 1996, 1998, 2000, | |
51603483 | 4 | 2001, 2002, 2003 Free Software Foundation, Inc. |
d65fe839 AC |
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" | |
39f77062 | 27 | #include "inferior.h" /* for inferior_ptid */ |
4e052eda | 28 | #include "regcache.h" |
4f460812 | 29 | #include "gdb_assert.h" |
e36180d7 AC |
30 | #include "gdb_string.h" |
31 | #include "builtin-regs.h" | |
4c1e7e9d AC |
32 | #include "gdb_obstack.h" |
33 | #include "dummy-frame.h" | |
a94dd1fd | 34 | #include "sentinel-frame.h" |
4c1e7e9d AC |
35 | #include "gdbcore.h" |
36 | #include "annotate.h" | |
6e7f8b9c | 37 | #include "language.h" |
494cca16 | 38 | #include "frame-unwind.h" |
da62e633 | 39 | #include "frame-base.h" |
eb4f72c5 AC |
40 | #include "command.h" |
41 | #include "gdbcmd.h" | |
42 | ||
ac2bd0a9 AC |
43 | /* Flag to control debugging. */ |
44 | ||
45 | static int frame_debug; | |
46 | ||
eb4f72c5 AC |
47 | /* Flag to indicate whether backtraces should stop at main. */ |
48 | ||
49 | static int backtrace_below_main; | |
d65fe839 | 50 | |
7a424e99 | 51 | /* Return a frame uniq ID that can be used to, later, re-find the |
101dcfbe AC |
52 | frame. */ |
53 | ||
7a424e99 AC |
54 | struct frame_id |
55 | get_frame_id (struct frame_info *fi) | |
101dcfbe AC |
56 | { |
57 | if (fi == NULL) | |
58 | { | |
7a424e99 | 59 | return null_frame_id; |
101dcfbe | 60 | } |
06c77151 | 61 | if (!fi->id_p) |
101dcfbe | 62 | { |
06c77151 AC |
63 | gdb_assert (!legacy_frame_p (current_gdbarch)); |
64 | /* Find THIS frame's ID. */ | |
65 | fi->unwind->this_id (fi->next, &fi->prologue_cache, &fi->id); | |
66 | fi->id_p = 1; | |
67 | /* FIXME: cagney/2002-12-18: Instead of this hack, should only | |
5e5592e6 | 68 | store the frame ID in PREV_FRAME. */ |
06c77151 | 69 | fi->frame = fi->id.base; |
101dcfbe | 70 | } |
11889732 | 71 | return frame_id_build (fi->frame, get_frame_pc (fi)); |
101dcfbe AC |
72 | } |
73 | ||
7a424e99 AC |
74 | const struct frame_id null_frame_id; /* All zeros. */ |
75 | ||
76 | struct frame_id | |
77 | frame_id_build (CORE_ADDR base, CORE_ADDR func_or_pc) | |
78 | { | |
79 | struct frame_id id; | |
80 | id.base = base; | |
81 | id.pc = func_or_pc; | |
82 | return id; | |
83 | } | |
84 | ||
85 | int | |
86 | frame_id_p (struct frame_id l) | |
87 | { | |
88 | /* The .func can be NULL but the .base cannot. */ | |
89 | return (l.base != 0); | |
90 | } | |
91 | ||
92 | int | |
93 | frame_id_eq (struct frame_id l, struct frame_id r) | |
94 | { | |
95 | /* If .base is different, the frames are different. */ | |
96 | if (l.base != r.base) | |
97 | return 0; | |
98 | /* Add a test to check that the frame ID's are for the same function | |
99 | here. */ | |
100 | return 1; | |
101 | } | |
102 | ||
103 | int | |
104 | frame_id_inner (struct frame_id l, struct frame_id r) | |
105 | { | |
106 | /* Only return non-zero when strictly inner than. Note that, per | |
107 | comment in "frame.h", there is some fuzz here. Frameless | |
108 | functions are not strictly inner than (same .base but different | |
109 | .func). */ | |
110 | return INNER_THAN (l.base, r.base); | |
111 | } | |
112 | ||
101dcfbe AC |
113 | struct frame_info * |
114 | frame_find_by_id (struct frame_id id) | |
115 | { | |
116 | struct frame_info *frame; | |
117 | ||
118 | /* ZERO denotes the null frame, let the caller decide what to do | |
119 | about it. Should it instead return get_current_frame()? */ | |
7a424e99 | 120 | if (!frame_id_p (id)) |
101dcfbe AC |
121 | return NULL; |
122 | ||
123 | for (frame = get_current_frame (); | |
124 | frame != NULL; | |
125 | frame = get_prev_frame (frame)) | |
126 | { | |
7a424e99 AC |
127 | struct frame_id this = get_frame_id (frame); |
128 | if (frame_id_eq (id, this)) | |
129 | /* An exact match. */ | |
130 | return frame; | |
131 | if (frame_id_inner (id, this)) | |
132 | /* Gone to far. */ | |
101dcfbe | 133 | return NULL; |
7a424e99 AC |
134 | /* Either, we're not yet gone far enough out along the frame |
135 | chain (inner(this,id), or we're comparing frameless functions | |
136 | (same .base, different .func, no test available). Struggle | |
137 | on until we've definitly gone to far. */ | |
101dcfbe AC |
138 | } |
139 | return NULL; | |
140 | } | |
141 | ||
f18c5a73 | 142 | CORE_ADDR |
12cc2063 | 143 | frame_pc_unwind (struct frame_info *this_frame) |
f18c5a73 | 144 | { |
12cc2063 | 145 | if (!this_frame->pc_unwind_cache_p) |
f18c5a73 | 146 | { |
12cc2063 AC |
147 | CORE_ADDR pc; |
148 | if (gdbarch_unwind_pc_p (current_gdbarch)) | |
149 | { | |
150 | /* The right way. The `pure' way. The one true way. This | |
151 | method depends solely on the register-unwind code to | |
152 | determine the value of registers in THIS frame, and hence | |
153 | the value of this frame's PC (resume address). A typical | |
154 | implementation is no more than: | |
155 | ||
156 | frame_unwind_register (this_frame, ISA_PC_REGNUM, buf); | |
157 | return extract_address (buf, size of ISA_PC_REGNUM); | |
158 | ||
159 | Note: this method is very heavily dependent on a correct | |
160 | register-unwind implementation, it pays to fix that | |
161 | method first; this method is frame type agnostic, since | |
162 | it only deals with register values, it works with any | |
163 | frame. This is all in stark contrast to the old | |
164 | FRAME_SAVED_PC which would try to directly handle all the | |
165 | different ways that a PC could be unwound. */ | |
166 | pc = gdbarch_unwind_pc (current_gdbarch, this_frame); | |
167 | } | |
168 | else if (this_frame->level < 0) | |
169 | { | |
170 | /* FIXME: cagney/2003-03-06: Old code and and a sentinel | |
171 | frame. Do like was always done. Fetch the PC's value | |
172 | direct from the global registers array (via read_pc). | |
173 | This assumes that this frame belongs to the current | |
174 | global register cache. The assumption is dangerous. */ | |
175 | pc = read_pc (); | |
176 | } | |
8bedc050 | 177 | else if (DEPRECATED_FRAME_SAVED_PC_P ()) |
12cc2063 AC |
178 | { |
179 | /* FIXME: cagney/2003-03-06: Old code, but not a sentinel | |
180 | frame. Do like was always done. Note that this method, | |
181 | unlike unwind_pc(), tries to handle all the different | |
182 | frame cases directly. It fails. */ | |
8bedc050 | 183 | pc = DEPRECATED_FRAME_SAVED_PC (this_frame); |
12cc2063 AC |
184 | } |
185 | else | |
186 | internal_error (__FILE__, __LINE__, "No gdbarch_unwind_pc method"); | |
187 | this_frame->pc_unwind_cache = pc; | |
188 | this_frame->pc_unwind_cache_p = 1; | |
f18c5a73 | 189 | } |
12cc2063 | 190 | return this_frame->pc_unwind_cache; |
f18c5a73 AC |
191 | } |
192 | ||
7a25a7c1 AC |
193 | static int |
194 | do_frame_unwind_register (void *src, int regnum, void *buf) | |
195 | { | |
196 | frame_unwind_register (src, regnum, buf); | |
197 | return 1; | |
198 | } | |
199 | ||
dbe9fe58 | 200 | void |
7a25a7c1 AC |
201 | frame_pop (struct frame_info *this_frame) |
202 | { | |
203 | struct regcache *scratch_regcache; | |
204 | struct cleanup *cleanups; | |
205 | ||
749b82f6 | 206 | if (DEPRECATED_POP_FRAME_P ()) |
7a25a7c1 AC |
207 | { |
208 | /* A legacy architecture that has implemented a custom pop | |
209 | function. All new architectures should instead be using the | |
210 | generic code below. */ | |
749b82f6 | 211 | DEPRECATED_POP_FRAME; |
7a25a7c1 AC |
212 | } |
213 | else | |
214 | { | |
215 | /* Make a copy of all the register values unwound from this | |
216 | frame. Save them in a scratch buffer so that there isn't a | |
217 | race betweening trying to extract the old values from the | |
218 | current_regcache while, at the same time writing new values | |
219 | into that same cache. */ | |
220 | struct regcache *scratch = regcache_xmalloc (current_gdbarch); | |
221 | struct cleanup *cleanups = make_cleanup_regcache_xfree (scratch); | |
222 | regcache_save (scratch, do_frame_unwind_register, this_frame); | |
efd710d6 AC |
223 | /* FIXME: cagney/2003-03-16: It should be possible to tell the |
224 | target's register cache that it is about to be hit with a | |
225 | burst register transfer and that the sequence of register | |
226 | writes should be batched. The pair target_prepare_to_store() | |
227 | and target_store_registers() kind of suggest this | |
228 | functionality. Unfortunatly, they don't implement it. Their | |
229 | lack of a formal definition can lead to targets writing back | |
230 | bogus values (arguably a bug in the target code mind). */ | |
7a25a7c1 AC |
231 | /* Now copy those saved registers into the current regcache. |
232 | Here, regcache_cpy() calls regcache_restore(). */ | |
233 | regcache_cpy (current_regcache, scratch); | |
234 | do_cleanups (cleanups); | |
235 | } | |
236 | /* We've made right mess of GDB's local state, just discard | |
237 | everything. */ | |
dbe9fe58 AC |
238 | flush_cached_frames (); |
239 | } | |
c689142b | 240 | |
4f460812 AC |
241 | void |
242 | frame_register_unwind (struct frame_info *frame, int regnum, | |
243 | int *optimizedp, enum lval_type *lvalp, | |
244 | CORE_ADDR *addrp, int *realnump, void *bufferp) | |
245 | { | |
246 | struct frame_unwind_cache *cache; | |
247 | ||
248 | /* Require all but BUFFERP to be valid. A NULL BUFFERP indicates | |
249 | that the value proper does not need to be fetched. */ | |
250 | gdb_assert (optimizedp != NULL); | |
251 | gdb_assert (lvalp != NULL); | |
252 | gdb_assert (addrp != NULL); | |
253 | gdb_assert (realnump != NULL); | |
254 | /* gdb_assert (bufferp != NULL); */ | |
255 | ||
a94dd1fd AC |
256 | /* NOTE: cagney/2002-11-27: A program trying to unwind a NULL frame |
257 | is broken. There is always a frame. If there, for some reason, | |
258 | isn't, there is some pretty busted code as it should have | |
259 | detected the problem before calling here. */ | |
260 | gdb_assert (frame != NULL); | |
4f460812 | 261 | |
6dc42492 AC |
262 | /* Ask this frame to unwind its register. See comment in |
263 | "frame-unwind.h" for why NEXT frame and this unwind cace are | |
264 | passed in. */ | |
265 | frame->unwind->prev_register (frame->next, &frame->prologue_cache, regnum, | |
266 | optimizedp, lvalp, addrp, realnump, bufferp); | |
267 | ||
4f460812 AC |
268 | } |
269 | ||
a216a322 AC |
270 | void |
271 | frame_register (struct frame_info *frame, int regnum, | |
272 | int *optimizedp, enum lval_type *lvalp, | |
273 | CORE_ADDR *addrp, int *realnump, void *bufferp) | |
274 | { | |
275 | /* Require all but BUFFERP to be valid. A NULL BUFFERP indicates | |
276 | that the value proper does not need to be fetched. */ | |
277 | gdb_assert (optimizedp != NULL); | |
278 | gdb_assert (lvalp != NULL); | |
279 | gdb_assert (addrp != NULL); | |
280 | gdb_assert (realnump != NULL); | |
281 | /* gdb_assert (bufferp != NULL); */ | |
282 | ||
283 | /* Ulgh! Old code that, for lval_register, sets ADDRP to the offset | |
284 | of the register in the register cache. It should instead return | |
285 | the REGNUM corresponding to that register. Translate the . */ | |
129c1cd6 | 286 | if (DEPRECATED_GET_SAVED_REGISTER_P ()) |
a216a322 | 287 | { |
129c1cd6 AC |
288 | DEPRECATED_GET_SAVED_REGISTER (bufferp, optimizedp, addrp, frame, |
289 | regnum, lvalp); | |
a216a322 AC |
290 | /* Compute the REALNUM if the caller wants it. */ |
291 | if (*lvalp == lval_register) | |
292 | { | |
293 | int regnum; | |
294 | for (regnum = 0; regnum < NUM_REGS + NUM_PSEUDO_REGS; regnum++) | |
295 | { | |
296 | if (*addrp == register_offset_hack (current_gdbarch, regnum)) | |
297 | { | |
298 | *realnump = regnum; | |
299 | return; | |
300 | } | |
301 | } | |
302 | internal_error (__FILE__, __LINE__, | |
303 | "Failed to compute the register number corresponding" | |
304 | " to 0x%s", paddr_d (*addrp)); | |
305 | } | |
306 | *realnump = -1; | |
307 | return; | |
308 | } | |
309 | ||
a94dd1fd AC |
310 | /* Obtain the register value by unwinding the register from the next |
311 | (more inner frame). */ | |
312 | gdb_assert (frame != NULL && frame->next != NULL); | |
313 | frame_register_unwind (frame->next, regnum, optimizedp, lvalp, addrp, | |
314 | realnump, bufferp); | |
a216a322 AC |
315 | } |
316 | ||
135c175f | 317 | void |
5b181d62 | 318 | frame_unwind_register (struct frame_info *frame, int regnum, void *buf) |
135c175f AC |
319 | { |
320 | int optimized; | |
321 | CORE_ADDR addr; | |
322 | int realnum; | |
323 | enum lval_type lval; | |
135c175f AC |
324 | frame_register_unwind (frame, regnum, &optimized, &lval, &addr, |
325 | &realnum, buf); | |
5b181d62 AC |
326 | } |
327 | ||
328 | void | |
329 | frame_unwind_signed_register (struct frame_info *frame, int regnum, | |
330 | LONGEST *val) | |
331 | { | |
332 | void *buf = alloca (MAX_REGISTER_RAW_SIZE); | |
333 | frame_unwind_register (frame, regnum, buf); | |
135c175f AC |
334 | (*val) = extract_signed_integer (buf, REGISTER_VIRTUAL_SIZE (regnum)); |
335 | } | |
336 | ||
337 | void | |
338 | frame_unwind_unsigned_register (struct frame_info *frame, int regnum, | |
339 | ULONGEST *val) | |
340 | { | |
135c175f | 341 | void *buf = alloca (MAX_REGISTER_RAW_SIZE); |
5b181d62 | 342 | frame_unwind_register (frame, regnum, buf); |
135c175f AC |
343 | (*val) = extract_unsigned_integer (buf, REGISTER_VIRTUAL_SIZE (regnum)); |
344 | } | |
4f460812 | 345 | |
5b181d62 AC |
346 | void |
347 | frame_read_register (struct frame_info *frame, int regnum, void *buf) | |
348 | { | |
349 | gdb_assert (frame != NULL && frame->next != NULL); | |
350 | frame_unwind_register (frame->next, regnum, buf); | |
351 | } | |
352 | ||
f908a0eb AC |
353 | void |
354 | frame_read_unsigned_register (struct frame_info *frame, int regnum, | |
355 | ULONGEST *val) | |
356 | { | |
357 | /* NOTE: cagney/2002-10-31: There is a bit of dogma here - there is | |
358 | always a frame. Both this, and the equivalent | |
359 | frame_read_signed_register() function, can only be called with a | |
360 | valid frame. If, for some reason, this function is called | |
361 | without a frame then the problem isn't here, but rather in the | |
362 | caller. It should of first created a frame and then passed that | |
363 | in. */ | |
364 | /* NOTE: cagney/2002-10-31: As a side bar, keep in mind that the | |
365 | ``current_frame'' should not be treated as a special case. While | |
366 | ``get_next_frame (current_frame) == NULL'' currently holds, it | |
367 | should, as far as possible, not be relied upon. In the future, | |
368 | ``get_next_frame (current_frame)'' may instead simply return a | |
369 | normal frame object that simply always gets register values from | |
370 | the register cache. Consequently, frame code should try to avoid | |
371 | tests like ``if get_next_frame() == NULL'' and instead just rely | |
372 | on recursive frame calls (like the below code) when manipulating | |
373 | a frame chain. */ | |
a94dd1fd AC |
374 | gdb_assert (frame != NULL && frame->next != NULL); |
375 | frame_unwind_unsigned_register (frame->next, regnum, val); | |
f908a0eb AC |
376 | } |
377 | ||
378 | void | |
379 | frame_read_signed_register (struct frame_info *frame, int regnum, | |
380 | LONGEST *val) | |
381 | { | |
a94dd1fd AC |
382 | /* See note above in frame_read_unsigned_register(). */ |
383 | gdb_assert (frame != NULL && frame->next != NULL); | |
384 | frame_unwind_signed_register (frame->next, regnum, val); | |
f908a0eb AC |
385 | } |
386 | ||
f796e4be | 387 | void |
4f460812 AC |
388 | generic_unwind_get_saved_register (char *raw_buffer, |
389 | int *optimizedp, | |
390 | CORE_ADDR *addrp, | |
391 | struct frame_info *frame, | |
392 | int regnum, | |
393 | enum lval_type *lvalp) | |
394 | { | |
395 | int optimizedx; | |
396 | CORE_ADDR addrx; | |
397 | int realnumx; | |
398 | enum lval_type lvalx; | |
399 | ||
400 | if (!target_has_registers) | |
401 | error ("No registers."); | |
402 | ||
403 | /* Keep things simple, ensure that all the pointers (except valuep) | |
404 | are non NULL. */ | |
405 | if (optimizedp == NULL) | |
406 | optimizedp = &optimizedx; | |
407 | if (lvalp == NULL) | |
408 | lvalp = &lvalx; | |
409 | if (addrp == NULL) | |
410 | addrp = &addrx; | |
411 | ||
a94dd1fd AC |
412 | gdb_assert (frame != NULL && frame->next != NULL); |
413 | frame_register_unwind (frame->next, regnum, optimizedp, lvalp, addrp, | |
414 | &realnumx, raw_buffer); | |
4f460812 AC |
415 | } |
416 | ||
cda5a58a | 417 | /* frame_register_read () |
d65fe839 | 418 | |
cda5a58a | 419 | Find and return the value of REGNUM for the specified stack frame. |
d65fe839 AC |
420 | The number of bytes copied is REGISTER_RAW_SIZE (REGNUM). |
421 | ||
cda5a58a | 422 | Returns 0 if the register value could not be found. */ |
d65fe839 | 423 | |
cda5a58a AC |
424 | int |
425 | frame_register_read (struct frame_info *frame, int regnum, void *myaddr) | |
d65fe839 | 426 | { |
a216a322 AC |
427 | int optimized; |
428 | enum lval_type lval; | |
429 | CORE_ADDR addr; | |
430 | int realnum; | |
431 | frame_register (frame, regnum, &optimized, &lval, &addr, &realnum, myaddr); | |
d65fe839 | 432 | |
c97dcfc7 AC |
433 | /* FIXME: cagney/2002-05-15: This test, is just bogus. |
434 | ||
435 | It indicates that the target failed to supply a value for a | |
436 | register because it was "not available" at this time. Problem | |
437 | is, the target still has the register and so get saved_register() | |
438 | may be returning a value saved on the stack. */ | |
439 | ||
d65fe839 | 440 | if (register_cached (regnum) < 0) |
cda5a58a | 441 | return 0; /* register value not available */ |
d65fe839 | 442 | |
a216a322 | 443 | return !optimized; |
d65fe839 | 444 | } |
e36180d7 AC |
445 | |
446 | ||
447 | /* Map between a frame register number and its name. A frame register | |
448 | space is a superset of the cooked register space --- it also | |
449 | includes builtin registers. */ | |
450 | ||
451 | int | |
452 | frame_map_name_to_regnum (const char *name, int len) | |
453 | { | |
454 | int i; | |
455 | ||
5f601589 AC |
456 | if (len < 0) |
457 | len = strlen (name); | |
458 | ||
e36180d7 AC |
459 | /* Search register name space. */ |
460 | for (i = 0; i < NUM_REGS + NUM_PSEUDO_REGS; i++) | |
461 | if (REGISTER_NAME (i) && len == strlen (REGISTER_NAME (i)) | |
462 | && strncmp (name, REGISTER_NAME (i), len) == 0) | |
463 | { | |
464 | return i; | |
465 | } | |
466 | ||
467 | /* Try builtin registers. */ | |
468 | i = builtin_reg_map_name_to_regnum (name, len); | |
469 | if (i >= 0) | |
470 | { | |
471 | /* A builtin register doesn't fall into the architecture's | |
472 | register range. */ | |
473 | gdb_assert (i >= NUM_REGS + NUM_PSEUDO_REGS); | |
474 | return i; | |
475 | } | |
476 | ||
477 | return -1; | |
478 | } | |
479 | ||
480 | const char * | |
481 | frame_map_regnum_to_name (int regnum) | |
482 | { | |
483 | if (regnum < 0) | |
484 | return NULL; | |
485 | if (regnum < NUM_REGS + NUM_PSEUDO_REGS) | |
486 | return REGISTER_NAME (regnum); | |
487 | return builtin_reg_map_regnum_to_name (regnum); | |
488 | } | |
4c1e7e9d | 489 | |
a94dd1fd AC |
490 | /* Create a sentinel frame. */ |
491 | ||
492 | struct frame_info * | |
493 | create_sentinel_frame (struct regcache *regcache) | |
494 | { | |
495 | struct frame_info *frame = FRAME_OBSTACK_ZALLOC (struct frame_info); | |
496 | frame->type = NORMAL_FRAME; | |
497 | frame->level = -1; | |
498 | /* Explicitly initialize the sentinel frame's cache. Provide it | |
499 | with the underlying regcache. In the future additional | |
500 | information, such as the frame's thread will be added. */ | |
6dc42492 | 501 | frame->prologue_cache = sentinel_frame_cache (regcache); |
a94dd1fd AC |
502 | /* For the moment there is only one sentinel frame implementation. */ |
503 | frame->unwind = sentinel_frame_unwind; | |
504 | /* Link this frame back to itself. The frame is self referential | |
505 | (the unwound PC is the same as the pc), so make it so. */ | |
506 | frame->next = frame; | |
507 | /* Always unwind the PC as part of creating this frame. This | |
508 | ensures that the frame's PC points at something valid. */ | |
509 | /* FIXME: cagney/2003-01-10: Problem here. Unwinding a sentinel | |
510 | frame's PC may require information such as the frame's thread's | |
511 | stop reason. Is it possible to get to that? */ | |
11889732 AC |
512 | /* FIXME: cagney/2003-04-04: Once ->pc is eliminated, this |
513 | assignment can go away. */ | |
a94dd1fd | 514 | frame->pc = frame_pc_unwind (frame); |
50bbdbd9 AC |
515 | /* Make the sentinel frame's ID valid, but invalid. That way all |
516 | comparisons with it should fail. */ | |
517 | frame->id_p = 1; | |
518 | frame->id = null_frame_id; | |
a94dd1fd AC |
519 | return frame; |
520 | } | |
521 | ||
4c1e7e9d AC |
522 | /* Info about the innermost stack frame (contents of FP register) */ |
523 | ||
524 | static struct frame_info *current_frame; | |
525 | ||
526 | /* Cache for frame addresses already read by gdb. Valid only while | |
527 | inferior is stopped. Control variables for the frame cache should | |
528 | be local to this module. */ | |
529 | ||
530 | static struct obstack frame_cache_obstack; | |
531 | ||
532 | void * | |
479ab5a0 | 533 | frame_obstack_zalloc (unsigned long size) |
4c1e7e9d | 534 | { |
479ab5a0 AC |
535 | void *data = obstack_alloc (&frame_cache_obstack, size); |
536 | memset (data, 0, size); | |
537 | return data; | |
4c1e7e9d AC |
538 | } |
539 | ||
6baff1d2 | 540 | CORE_ADDR * |
4c1e7e9d AC |
541 | frame_saved_regs_zalloc (struct frame_info *fi) |
542 | { | |
543 | fi->saved_regs = (CORE_ADDR *) | |
479ab5a0 | 544 | frame_obstack_zalloc (SIZEOF_FRAME_SAVED_REGS); |
6baff1d2 | 545 | return fi->saved_regs; |
4c1e7e9d AC |
546 | } |
547 | ||
6baff1d2 AC |
548 | CORE_ADDR * |
549 | get_frame_saved_regs (struct frame_info *fi) | |
550 | { | |
551 | return fi->saved_regs; | |
552 | } | |
4c1e7e9d | 553 | |
a94dd1fd AC |
554 | /* Return the innermost (currently executing) stack frame. This is |
555 | split into two functions. The function unwind_to_current_frame() | |
556 | is wrapped in catch exceptions so that, even when the unwind of the | |
557 | sentinel frame fails, the function still returns a stack frame. */ | |
558 | ||
559 | static int | |
560 | unwind_to_current_frame (struct ui_out *ui_out, void *args) | |
561 | { | |
562 | struct frame_info *frame = get_prev_frame (args); | |
563 | /* A sentinel frame can fail to unwind, eg, because it's PC value | |
564 | lands in somewhere like start. */ | |
565 | if (frame == NULL) | |
566 | return 1; | |
567 | current_frame = frame; | |
568 | return 0; | |
569 | } | |
4c1e7e9d AC |
570 | |
571 | struct frame_info * | |
572 | get_current_frame (void) | |
573 | { | |
0a1e1ca1 AC |
574 | /* First check, and report, the lack of registers. Having GDB |
575 | report "No stack!" or "No memory" when the target doesn't even | |
576 | have registers is very confusing. Besides, "printcmd.exp" | |
577 | explicitly checks that ``print $pc'' with no registers prints "No | |
578 | registers". */ | |
a94dd1fd AC |
579 | if (!target_has_registers) |
580 | error ("No registers."); | |
0a1e1ca1 AC |
581 | if (!target_has_stack) |
582 | error ("No stack."); | |
a94dd1fd AC |
583 | if (!target_has_memory) |
584 | error ("No memory."); | |
4c1e7e9d AC |
585 | if (current_frame == NULL) |
586 | { | |
a94dd1fd AC |
587 | struct frame_info *sentinel_frame = |
588 | create_sentinel_frame (current_regcache); | |
589 | if (catch_exceptions (uiout, unwind_to_current_frame, sentinel_frame, | |
590 | NULL, RETURN_MASK_ERROR) != 0) | |
591 | { | |
592 | /* Oops! Fake a current frame? Is this useful? It has a PC | |
593 | of zero, for instance. */ | |
594 | current_frame = sentinel_frame; | |
595 | } | |
4c1e7e9d AC |
596 | } |
597 | return current_frame; | |
598 | } | |
599 | ||
6e7f8b9c AC |
600 | /* The "selected" stack frame is used by default for local and arg |
601 | access. May be zero, for no selected frame. */ | |
602 | ||
603 | struct frame_info *deprecated_selected_frame; | |
604 | ||
605 | /* Return the selected frame. Always non-null (unless there isn't an | |
606 | inferior sufficient for creating a frame) in which case an error is | |
607 | thrown. */ | |
608 | ||
609 | struct frame_info * | |
610 | get_selected_frame (void) | |
611 | { | |
612 | if (deprecated_selected_frame == NULL) | |
613 | /* Hey! Don't trust this. It should really be re-finding the | |
614 | last selected frame of the currently selected thread. This, | |
615 | though, is better than nothing. */ | |
616 | select_frame (get_current_frame ()); | |
617 | /* There is always a frame. */ | |
618 | gdb_assert (deprecated_selected_frame != NULL); | |
619 | return deprecated_selected_frame; | |
620 | } | |
621 | ||
622 | /* Select frame FI (or NULL - to invalidate the current frame). */ | |
623 | ||
624 | void | |
625 | select_frame (struct frame_info *fi) | |
626 | { | |
627 | register struct symtab *s; | |
628 | ||
629 | deprecated_selected_frame = fi; | |
630 | /* NOTE: cagney/2002-05-04: FI can be NULL. This occures when the | |
631 | frame is being invalidated. */ | |
632 | if (selected_frame_level_changed_hook) | |
633 | selected_frame_level_changed_hook (frame_relative_level (fi)); | |
634 | ||
635 | /* FIXME: kseitz/2002-08-28: It would be nice to call | |
636 | selected_frame_level_changed_event right here, but due to limitations | |
637 | in the current interfaces, we would end up flooding UIs with events | |
638 | because select_frame is used extensively internally. | |
639 | ||
640 | Once we have frame-parameterized frame (and frame-related) commands, | |
641 | the event notification can be moved here, since this function will only | |
642 | be called when the users selected frame is being changed. */ | |
643 | ||
644 | /* Ensure that symbols for this frame are read in. Also, determine the | |
645 | source language of this frame, and switch to it if desired. */ | |
646 | if (fi) | |
647 | { | |
11889732 | 648 | s = find_pc_symtab (get_frame_pc (fi)); |
6e7f8b9c AC |
649 | if (s |
650 | && s->language != current_language->la_language | |
651 | && s->language != language_unknown | |
652 | && language_mode == language_mode_auto) | |
653 | { | |
654 | set_language (s->language); | |
655 | } | |
656 | } | |
657 | } | |
658 | ||
4c1e7e9d AC |
659 | /* Return the register saved in the simplistic ``saved_regs'' cache. |
660 | If the value isn't here AND a value is needed, try the next inner | |
661 | most frame. */ | |
662 | ||
663 | static void | |
6dc42492 AC |
664 | legacy_saved_regs_prev_register (struct frame_info *next_frame, |
665 | void **this_prologue_cache, | |
666 | int regnum, int *optimizedp, | |
667 | enum lval_type *lvalp, CORE_ADDR *addrp, | |
668 | int *realnump, void *bufferp) | |
4c1e7e9d | 669 | { |
6dc42492 AC |
670 | /* HACK: New code is passed the next frame and this cache. |
671 | Unfortunatly, old code expects this frame. Since this is a | |
672 | backward compatibility hack, cheat by walking one level along the | |
673 | prologue chain to the frame the old code expects. | |
674 | ||
675 | Do not try this at home. Professional driver, closed course. */ | |
676 | struct frame_info *frame = next_frame->prev; | |
4c1e7e9d | 677 | gdb_assert (frame != NULL); |
4c1e7e9d | 678 | |
8f871025 | 679 | /* Only (older) architectures that implement the |
f30ee0bc AC |
680 | DEPRECATED_FRAME_INIT_SAVED_REGS method should be using this |
681 | function. */ | |
682 | gdb_assert (DEPRECATED_FRAME_INIT_SAVED_REGS_P ()); | |
8f871025 | 683 | |
4c1e7e9d | 684 | /* Load the saved_regs register cache. */ |
a94dd1fd | 685 | if (get_frame_saved_regs (frame) == NULL) |
f30ee0bc | 686 | DEPRECATED_FRAME_INIT_SAVED_REGS (frame); |
4c1e7e9d | 687 | |
a94dd1fd AC |
688 | if (get_frame_saved_regs (frame) != NULL |
689 | && get_frame_saved_regs (frame)[regnum] != 0) | |
4c1e7e9d AC |
690 | { |
691 | if (regnum == SP_REGNUM) | |
692 | { | |
693 | /* SP register treated specially. */ | |
694 | *optimizedp = 0; | |
695 | *lvalp = not_lval; | |
696 | *addrp = 0; | |
697 | *realnump = -1; | |
698 | if (bufferp != NULL) | |
699 | store_address (bufferp, REGISTER_RAW_SIZE (regnum), | |
a94dd1fd | 700 | get_frame_saved_regs (frame)[regnum]); |
4c1e7e9d AC |
701 | } |
702 | else | |
703 | { | |
704 | /* Any other register is saved in memory, fetch it but cache | |
705 | a local copy of its value. */ | |
706 | *optimizedp = 0; | |
707 | *lvalp = lval_memory; | |
a94dd1fd | 708 | *addrp = get_frame_saved_regs (frame)[regnum]; |
4c1e7e9d AC |
709 | *realnump = -1; |
710 | if (bufferp != NULL) | |
711 | { | |
712 | #if 1 | |
713 | /* Save each register value, as it is read in, in a | |
714 | frame based cache. */ | |
6dc42492 | 715 | void **regs = (*this_prologue_cache); |
4c1e7e9d AC |
716 | if (regs == NULL) |
717 | { | |
718 | int sizeof_cache = ((NUM_REGS + NUM_PSEUDO_REGS) | |
719 | * sizeof (void *)); | |
479ab5a0 | 720 | regs = frame_obstack_zalloc (sizeof_cache); |
6dc42492 | 721 | (*this_prologue_cache) = regs; |
4c1e7e9d AC |
722 | } |
723 | if (regs[regnum] == NULL) | |
724 | { | |
725 | regs[regnum] | |
479ab5a0 | 726 | = frame_obstack_zalloc (REGISTER_RAW_SIZE (regnum)); |
a94dd1fd | 727 | read_memory (get_frame_saved_regs (frame)[regnum], regs[regnum], |
4c1e7e9d AC |
728 | REGISTER_RAW_SIZE (regnum)); |
729 | } | |
730 | memcpy (bufferp, regs[regnum], REGISTER_RAW_SIZE (regnum)); | |
731 | #else | |
732 | /* Read the value in from memory. */ | |
a94dd1fd | 733 | read_memory (get_frame_saved_regs (frame)[regnum], bufferp, |
4c1e7e9d AC |
734 | REGISTER_RAW_SIZE (regnum)); |
735 | #endif | |
736 | } | |
737 | } | |
738 | return; | |
739 | } | |
740 | ||
6dc42492 AC |
741 | /* No luck. Assume this and the next frame have the same register |
742 | value. Pass the unwind request down the frame chain to the next | |
743 | frame. Hopefully that frame will find the register's location. */ | |
744 | frame_register_unwind (next_frame, regnum, optimizedp, lvalp, addrp, | |
745 | realnump, bufferp); | |
4c1e7e9d AC |
746 | } |
747 | ||
c170fb60 | 748 | static void |
6dc42492 AC |
749 | legacy_saved_regs_this_id (struct frame_info *next_frame, |
750 | void **this_prologue_cache, | |
751 | struct frame_id *id) | |
c689142b AC |
752 | { |
753 | int fromleaf; | |
c170fb60 AC |
754 | CORE_ADDR base; |
755 | CORE_ADDR pc; | |
756 | ||
6dc42492 AC |
757 | if (frame_relative_level (next_frame) < 0) |
758 | { | |
759 | /* FIXME: cagney/2003-03-14: We've got the extra special case of | |
760 | unwinding a sentinel frame, the PC of which is pointing at a | |
761 | stack dummy. Fake up the dummy frame's ID using the same | |
762 | sequence as is found a traditional unwinder. */ | |
11889732 | 763 | (*id) = frame_id_build (read_fp (), read_pc ()); |
6dc42492 AC |
764 | return; |
765 | } | |
766 | ||
c170fb60 AC |
767 | /* Start out by assuming it's NULL. */ |
768 | (*id) = null_frame_id; | |
c689142b | 769 | |
a94dd1fd | 770 | if (frame_relative_level (next_frame) <= 0) |
c689142b AC |
771 | /* FIXME: 2002-11-09: Frameless functions can occure anywhere in |
772 | the frame chain, not just the inner most frame! The generic, | |
773 | per-architecture, frame code should handle this and the below | |
774 | should simply be removed. */ | |
775 | fromleaf = FRAMELESS_FUNCTION_INVOCATION (next_frame); | |
776 | else | |
777 | fromleaf = 0; | |
778 | ||
779 | if (fromleaf) | |
780 | /* A frameless inner-most frame. The `FP' (which isn't an | |
781 | architecture frame-pointer register!) of the caller is the same | |
782 | as the callee. */ | |
783 | /* FIXME: 2002-11-09: There isn't any reason to special case this | |
784 | edge condition. Instead the per-architecture code should hande | |
785 | it locally. */ | |
c170fb60 | 786 | base = get_frame_base (next_frame); |
c689142b AC |
787 | else |
788 | { | |
789 | /* Two macros defined in tm.h specify the machine-dependent | |
790 | actions to be performed here. | |
791 | ||
792 | First, get the frame's chain-pointer. | |
793 | ||
794 | If that is zero, the frame is the outermost frame or a leaf | |
795 | called by the outermost frame. This means that if start | |
796 | calls main without a frame, we'll return 0 (which is fine | |
797 | anyway). | |
798 | ||
799 | Nope; there's a problem. This also returns when the current | |
800 | routine is a leaf of main. This is unacceptable. We move | |
801 | this to after the ffi test; I'd rather have backtraces from | |
802 | start go curfluy than have an abort called from main not show | |
803 | main. */ | |
618ce49f AC |
804 | gdb_assert (DEPRECATED_FRAME_CHAIN_P ()); |
805 | base = DEPRECATED_FRAME_CHAIN (next_frame); | |
c689142b | 806 | |
c170fb60 AC |
807 | if (!frame_chain_valid (base, next_frame)) |
808 | return; | |
c689142b | 809 | } |
c170fb60 AC |
810 | if (base == 0) |
811 | return; | |
c689142b AC |
812 | |
813 | /* FIXME: cagney/2002-06-08: This should probably return the frame's | |
814 | function and not the PC (a.k.a. resume address). */ | |
c170fb60 | 815 | pc = frame_pc_unwind (next_frame); |
11889732 | 816 | (*id) = frame_id_build (base, pc); |
c689142b AC |
817 | } |
818 | ||
6dc42492 | 819 | const struct frame_unwind legacy_saved_regs_unwinder = { |
7df05f2b AC |
820 | /* Not really. It gets overridden by legacy_get_prev_frame. */ |
821 | UNKNOWN_FRAME, | |
6dc42492 AC |
822 | legacy_saved_regs_this_id, |
823 | legacy_saved_regs_prev_register | |
494cca16 | 824 | }; |
6dc42492 | 825 | const struct frame_unwind *legacy_saved_regs_unwind = &legacy_saved_regs_unwinder; |
494cca16 AC |
826 | |
827 | ||
ac2adee5 | 828 | /* Function: deprecated_generic_get_saved_register |
4c1e7e9d | 829 | Find register number REGNUM relative to FRAME and put its (raw, |
ac2adee5 | 830 | target format) contents in *RAW_BUFFER. |
4c1e7e9d AC |
831 | |
832 | Set *OPTIMIZED if the variable was optimized out (and thus can't be | |
833 | fetched). Note that this is never set to anything other than zero | |
834 | in this implementation. | |
835 | ||
836 | Set *LVAL to lval_memory, lval_register, or not_lval, depending on | |
837 | whether the value was fetched from memory, from a register, or in a | |
838 | strange and non-modifiable way (e.g. a frame pointer which was | |
839 | calculated rather than fetched). We will use not_lval for values | |
840 | fetched from generic dummy frames. | |
841 | ||
842 | Set *ADDRP to the address, either in memory or as a REGISTER_BYTE | |
843 | offset into the registers array. If the value is stored in a dummy | |
844 | frame, set *ADDRP to zero. | |
845 | ||
4c1e7e9d AC |
846 | The argument RAW_BUFFER must point to aligned memory. */ |
847 | ||
848 | void | |
849 | deprecated_generic_get_saved_register (char *raw_buffer, int *optimized, | |
850 | CORE_ADDR *addrp, | |
851 | struct frame_info *frame, int regnum, | |
852 | enum lval_type *lval) | |
853 | { | |
854 | if (!target_has_registers) | |
855 | error ("No registers."); | |
856 | ||
f30ee0bc | 857 | gdb_assert (DEPRECATED_FRAME_INIT_SAVED_REGS_P ()); |
8f871025 | 858 | |
4c1e7e9d AC |
859 | /* Normal systems don't optimize out things with register numbers. */ |
860 | if (optimized != NULL) | |
861 | *optimized = 0; | |
862 | ||
863 | if (addrp) /* default assumption: not found in memory */ | |
864 | *addrp = 0; | |
865 | ||
866 | /* Note: since the current frame's registers could only have been | |
867 | saved by frames INTERIOR TO the current frame, we skip examining | |
868 | the current frame itself: otherwise, we would be getting the | |
869 | previous frame's registers which were saved by the current frame. */ | |
870 | ||
a94dd1fd | 871 | if (frame != NULL) |
4c1e7e9d | 872 | { |
a94dd1fd AC |
873 | for (frame = get_next_frame (frame); |
874 | frame_relative_level (frame) >= 0; | |
875 | frame = get_next_frame (frame)) | |
4c1e7e9d | 876 | { |
a94dd1fd | 877 | if (get_frame_type (frame) == DUMMY_FRAME) |
4c1e7e9d | 878 | { |
a94dd1fd AC |
879 | if (lval) /* found it in a CALL_DUMMY frame */ |
880 | *lval = not_lval; | |
881 | if (raw_buffer) | |
882 | /* FIXME: cagney/2002-06-26: This should be via the | |
883 | gdbarch_register_read() method so that it, on the | |
884 | fly, constructs either a raw or pseudo register | |
885 | from the raw register cache. */ | |
886 | regcache_raw_read | |
887 | (generic_find_dummy_frame (get_frame_pc (frame), | |
888 | get_frame_base (frame)), | |
889 | regnum, raw_buffer); | |
890 | return; | |
4c1e7e9d | 891 | } |
a94dd1fd | 892 | |
f30ee0bc | 893 | DEPRECATED_FRAME_INIT_SAVED_REGS (frame); |
a94dd1fd AC |
894 | if (get_frame_saved_regs (frame) != NULL |
895 | && get_frame_saved_regs (frame)[regnum] != 0) | |
4c1e7e9d | 896 | { |
a94dd1fd AC |
897 | if (lval) /* found it saved on the stack */ |
898 | *lval = lval_memory; | |
899 | if (regnum == SP_REGNUM) | |
900 | { | |
901 | if (raw_buffer) /* SP register treated specially */ | |
902 | store_address (raw_buffer, REGISTER_RAW_SIZE (regnum), | |
903 | get_frame_saved_regs (frame)[regnum]); | |
904 | } | |
905 | else | |
906 | { | |
907 | if (addrp) /* any other register */ | |
908 | *addrp = get_frame_saved_regs (frame)[regnum]; | |
909 | if (raw_buffer) | |
910 | read_memory (get_frame_saved_regs (frame)[regnum], raw_buffer, | |
911 | REGISTER_RAW_SIZE (regnum)); | |
912 | } | |
913 | return; | |
4c1e7e9d | 914 | } |
4c1e7e9d AC |
915 | } |
916 | } | |
917 | ||
918 | /* If we get thru the loop to this point, it means the register was | |
919 | not saved in any frame. Return the actual live-register value. */ | |
920 | ||
921 | if (lval) /* found it in a live register */ | |
922 | *lval = lval_register; | |
923 | if (addrp) | |
924 | *addrp = REGISTER_BYTE (regnum); | |
925 | if (raw_buffer) | |
926 | deprecated_read_register_gen (regnum, raw_buffer); | |
927 | } | |
928 | ||
eb4f72c5 AC |
929 | /* Determine the frame's type based on its PC. */ |
930 | ||
931 | static enum frame_type | |
932 | frame_type_from_pc (CORE_ADDR pc) | |
933 | { | |
934 | /* FIXME: cagney/2002-11-24: Can't yet directly call | |
935 | pc_in_dummy_frame() as some architectures don't set | |
936 | PC_IN_CALL_DUMMY() to generic_pc_in_call_dummy() (remember the | |
937 | latter is implemented by simply calling pc_in_dummy_frame). */ | |
938 | if (DEPRECATED_USE_GENERIC_DUMMY_FRAMES | |
939 | && DEPRECATED_PC_IN_CALL_DUMMY (pc, 0, 0)) | |
940 | return DUMMY_FRAME; | |
941 | else | |
942 | { | |
943 | char *name; | |
944 | find_pc_partial_function (pc, &name, NULL, NULL); | |
945 | if (PC_IN_SIGTRAMP (pc, name)) | |
946 | return SIGTRAMP_FRAME; | |
947 | else | |
948 | return NORMAL_FRAME; | |
949 | } | |
950 | } | |
951 | ||
4c1e7e9d AC |
952 | /* Create an arbitrary (i.e. address specified by user) or innermost frame. |
953 | Always returns a non-NULL value. */ | |
954 | ||
955 | struct frame_info * | |
956 | create_new_frame (CORE_ADDR addr, CORE_ADDR pc) | |
957 | { | |
958 | struct frame_info *fi; | |
4c1e7e9d | 959 | |
479ab5a0 | 960 | fi = frame_obstack_zalloc (sizeof (struct frame_info)); |
4c1e7e9d | 961 | |
a94dd1fd | 962 | fi->next = create_sentinel_frame (current_regcache); |
7df05f2b AC |
963 | |
964 | /* Select/initialize both the unwind function and the frame's type | |
965 | based on the PC. */ | |
966 | fi->unwind = frame_unwind_find_by_pc (current_gdbarch, fi->pc); | |
967 | if (fi->unwind->type != UNKNOWN_FRAME) | |
968 | fi->type = fi->unwind->type; | |
969 | else | |
970 | fi->type = frame_type_from_pc (pc); | |
971 | ||
11889732 AC |
972 | deprecated_update_frame_base_hack (fi, addr); |
973 | deprecated_update_frame_pc_hack (fi, pc); | |
4c1e7e9d | 974 | |
e9582e71 AC |
975 | if (DEPRECATED_INIT_EXTRA_FRAME_INFO_P ()) |
976 | DEPRECATED_INIT_EXTRA_FRAME_INFO (0, fi); | |
4c1e7e9d | 977 | |
4c1e7e9d AC |
978 | return fi; |
979 | } | |
980 | ||
03febf99 AC |
981 | /* Return the frame that THIS_FRAME calls (NULL if THIS_FRAME is the |
982 | innermost frame). Be careful to not fall off the bottom of the | |
983 | frame chain and onto the sentinel frame. */ | |
4c1e7e9d AC |
984 | |
985 | struct frame_info * | |
03febf99 | 986 | get_next_frame (struct frame_info *this_frame) |
4c1e7e9d | 987 | { |
03febf99 AC |
988 | if (this_frame->level > 0) |
989 | return this_frame->next; | |
a94dd1fd AC |
990 | else |
991 | return NULL; | |
4c1e7e9d AC |
992 | } |
993 | ||
994 | /* Flush the entire frame cache. */ | |
995 | ||
996 | void | |
997 | flush_cached_frames (void) | |
998 | { | |
999 | /* Since we can't really be sure what the first object allocated was */ | |
1000 | obstack_free (&frame_cache_obstack, 0); | |
1001 | obstack_init (&frame_cache_obstack); | |
1002 | ||
1003 | current_frame = NULL; /* Invalidate cache */ | |
1004 | select_frame (NULL); | |
1005 | annotate_frames_invalid (); | |
1006 | } | |
1007 | ||
1008 | /* Flush the frame cache, and start a new one if necessary. */ | |
1009 | ||
1010 | void | |
1011 | reinit_frame_cache (void) | |
1012 | { | |
1013 | flush_cached_frames (); | |
1014 | ||
1015 | /* FIXME: The inferior_ptid test is wrong if there is a corefile. */ | |
1016 | if (PIDGET (inferior_ptid) != 0) | |
1017 | { | |
1018 | select_frame (get_current_frame ()); | |
1019 | } | |
1020 | } | |
1021 | ||
eb4f72c5 AC |
1022 | /* Create the previous frame using the deprecated methods |
1023 | INIT_EXTRA_INFO, INIT_FRAME_PC and INIT_FRAME_PC_FIRST. */ | |
4c1e7e9d | 1024 | |
eb4f72c5 | 1025 | static struct frame_info * |
03febf99 | 1026 | legacy_get_prev_frame (struct frame_info *this_frame) |
4c1e7e9d AC |
1027 | { |
1028 | CORE_ADDR address = 0; | |
1029 | struct frame_info *prev; | |
95adb866 | 1030 | int fromleaf; |
4c1e7e9d | 1031 | |
a01dd7cc | 1032 | /* Allocate the new frame. |
055bb976 AC |
1033 | |
1034 | There is no reason to worry about memory leaks, should the | |
1035 | remainder of the function fail. The allocated memory will be | |
1036 | quickly reclaimed when the frame cache is flushed, and the `we've | |
1037 | been here before' check, in get_prev_frame will stop repeated | |
1038 | memory allocation calls. */ | |
1039 | prev = FRAME_OBSTACK_ZALLOC (struct frame_info); | |
1040 | prev->level = this_frame->level + 1; | |
1041 | ||
a01dd7cc AC |
1042 | /* Do not completly wire it in to the frame chain. Some (bad) code |
1043 | in INIT_FRAME_EXTRA_INFO tries to look along frame->prev to pull | |
1044 | some fancy tricks (of course such code is, by definition, | |
1045 | recursive). | |
1046 | ||
1047 | On the other hand, methods, such as get_frame_pc() and | |
1048 | get_frame_base() rely on being able to walk along the frame | |
1049 | chain. Make certain that at least they work by providing that | |
1050 | link. Of course things manipulating prev can't go back. */ | |
1051 | prev->next = this_frame; | |
1052 | ||
055bb976 AC |
1053 | /* NOTE: cagney/2002-11-18: Should have been correctly setting the |
1054 | frame's type here, before anything else, and not last, at the | |
1055 | bottom of this function. The various | |
1056 | DEPRECATED_INIT_EXTRA_FRAME_INFO, DEPRECATED_INIT_FRAME_PC, | |
1057 | DEPRECATED_INIT_FRAME_PC_FIRST and | |
1058 | DEPRECATED_FRAME_INIT_SAVED_REGS methods are full of work-arounds | |
1059 | that handle the frame not being correctly set from the start. | |
1060 | Unfortunatly those same work-arounds rely on the type defaulting | |
1061 | to NORMAL_FRAME. Ulgh! The new frame code does not have this | |
1062 | problem. */ | |
7df05f2b | 1063 | prev->type = UNKNOWN_FRAME; |
055bb976 | 1064 | |
06c77151 AC |
1065 | /* A legacy frame's ID is always computed here. Mark it as valid. */ |
1066 | prev->id_p = 1; | |
1067 | ||
055bb976 AC |
1068 | /* Handle sentinel frame unwind as a special case. */ |
1069 | if (this_frame->level < 0) | |
1070 | { | |
1071 | /* Try to unwind the PC. If that doesn't work, assume we've reached | |
1072 | the oldest frame and simply return. Is there a better sentinal | |
1073 | value? The unwound PC value is then used to initialize the new | |
1074 | previous frame's type. | |
1075 | ||
1076 | Note that the pc-unwind is intentionally performed before the | |
1077 | frame chain. This is ok since, for old targets, both | |
618ce49f AC |
1078 | frame_pc_unwind (nee, DEPRECATED_FRAME_SAVED_PC) and |
1079 | DEPRECATED_FRAME_CHAIN()) assume THIS_FRAME's data structures | |
1080 | have already been initialized (using | |
055bb976 AC |
1081 | DEPRECATED_INIT_EXTRA_FRAME_INFO) and hence the call order |
1082 | doesn't matter. | |
1083 | ||
1084 | By unwinding the PC first, it becomes possible to, in the case of | |
1085 | a dummy frame, avoid also unwinding the frame ID. This is | |
1086 | because (well ignoring the PPC) a dummy frame can be located | |
1087 | using THIS_FRAME's frame ID. */ | |
1088 | ||
11889732 AC |
1089 | deprecated_update_frame_pc_hack (prev, frame_pc_unwind (this_frame)); |
1090 | if (get_frame_pc (prev) == 0) | |
055bb976 AC |
1091 | { |
1092 | /* The allocated PREV_FRAME will be reclaimed when the frame | |
1093 | obstack is next purged. */ | |
1094 | if (frame_debug) | |
1095 | fprintf_unfiltered (gdb_stdlog, | |
1096 | "Outermost frame - unwound PC zero\n"); | |
1097 | return NULL; | |
1098 | } | |
055bb976 | 1099 | |
7df05f2b AC |
1100 | /* Set the unwind functions based on that identified PC. Ditto |
1101 | for the "type" but strongly prefer the unwinder's frame type. */ | |
1102 | prev->unwind = frame_unwind_find_by_pc (current_gdbarch, prev->pc); | |
1103 | if (prev->unwind->type == UNKNOWN_FRAME) | |
1104 | prev->type = frame_type_from_pc (prev->pc); | |
1105 | else | |
1106 | prev->type = prev->unwind->type; | |
055bb976 AC |
1107 | |
1108 | /* Find the prev's frame's ID. */ | |
1109 | if (prev->type == DUMMY_FRAME | |
1110 | && gdbarch_unwind_dummy_id_p (current_gdbarch)) | |
1111 | { | |
1112 | /* When unwinding a normal frame, the stack structure is | |
1113 | determined by analyzing the frame's function's code (be | |
1114 | it using brute force prologue analysis, or the dwarf2 | |
1115 | CFI). In the case of a dummy frame, that simply isn't | |
1116 | possible. The The PC is either the program entry point, | |
1117 | or some random address on the stack. Trying to use that | |
1118 | PC to apply standard frame ID unwind techniques is just | |
1119 | asking for trouble. */ | |
e8a8712a | 1120 | /* Assume call_function_by_hand(), via SAVE_DUMMY_FRAME_TOS, |
055bb976 AC |
1121 | previously saved the dummy frame's ID. Things only work |
1122 | if the two return the same value. */ | |
1123 | gdb_assert (SAVE_DUMMY_FRAME_TOS_P ()); | |
1124 | /* Use an architecture specific method to extract the prev's | |
1125 | dummy ID from the next frame. Note that this method uses | |
1126 | frame_register_unwind to obtain the register values | |
1127 | needed to determine the dummy frame's ID. */ | |
1128 | prev->id = gdbarch_unwind_dummy_id (current_gdbarch, this_frame); | |
1129 | } | |
1130 | else | |
1131 | { | |
1132 | /* We're unwinding a sentinel frame, the PC of which is | |
1133 | pointing at a stack dummy. Fake up the dummy frame's ID | |
1134 | using the same sequence as is found a traditional | |
1135 | unwinder. Once all architectures supply the | |
1136 | unwind_dummy_id method, this code can go away. */ | |
11889732 | 1137 | prev->id = frame_id_build (read_fp (), read_pc ()); |
055bb976 AC |
1138 | } |
1139 | ||
1140 | /* Check that the unwound ID is valid. */ | |
1141 | if (!frame_id_p (prev->id)) | |
1142 | { | |
1143 | if (frame_debug) | |
1144 | fprintf_unfiltered (gdb_stdlog, | |
1145 | "Outermost legacy sentinel frame - unwound frame ID invalid\n"); | |
1146 | return NULL; | |
1147 | } | |
1148 | ||
1149 | /* Check that the new frame isn't inner to (younger, below, | |
1150 | next) the old frame. If that happens the frame unwind is | |
1151 | going backwards. */ | |
1152 | /* FIXME: cagney/2003-02-25: Ignore the sentinel frame since | |
1153 | that doesn't have a valid frame ID. Should instead set the | |
1154 | sentinel frame's frame ID to a `sentinel'. Leave it until | |
1155 | after the switch to storing the frame ID, instead of the | |
1156 | frame base, in the frame object. */ | |
1157 | ||
1158 | /* FIXME: cagney/2002-12-18: Instead of this hack, should only | |
5e5592e6 | 1159 | store the frame ID in PREV_FRAME. */ |
11889732 AC |
1160 | /* FIXME: cagney/2003-04-04: Once ->frame is eliminated, this |
1161 | assignment can go. */ | |
055bb976 AC |
1162 | prev->frame = prev->id.base; |
1163 | ||
1164 | /* Link it in. */ | |
1165 | this_frame->prev = prev; | |
055bb976 AC |
1166 | |
1167 | /* FIXME: cagney/2002-01-19: This call will go away. Instead of | |
1168 | initializing extra info, all frames will use the frame_cache | |
1169 | (passed to the unwind functions) to store additional frame | |
1170 | info. Unfortunatly legacy targets can't use | |
1171 | legacy_get_prev_frame() to unwind the sentinel frame and, | |
1172 | consequently, are forced to take this code path and rely on | |
1173 | the below call to DEPRECATED_INIT_EXTRA_FRAME_INFO to | |
1174 | initialize the inner-most frame. */ | |
1175 | if (DEPRECATED_INIT_EXTRA_FRAME_INFO_P ()) | |
1176 | { | |
1177 | DEPRECATED_INIT_EXTRA_FRAME_INFO (0, prev); | |
1178 | } | |
1179 | return prev; | |
1180 | } | |
1181 | ||
eb4f72c5 AC |
1182 | /* This code only works on normal frames. A sentinel frame, where |
1183 | the level is -1, should never reach this code. */ | |
03febf99 | 1184 | gdb_assert (this_frame->level >= 0); |
4c1e7e9d AC |
1185 | |
1186 | /* On some machines it is possible to call a function without | |
1187 | setting up a stack frame for it. On these machines, we | |
1188 | define this macro to take two args; a frameinfo pointer | |
1189 | identifying a frame and a variable to set or clear if it is | |
1190 | or isn't leafless. */ | |
1191 | ||
1192 | /* Still don't want to worry about this except on the innermost | |
03febf99 | 1193 | frame. This macro will set FROMLEAF if THIS_FRAME is a frameless |
95adb866 | 1194 | function invocation. */ |
03febf99 | 1195 | if (this_frame->level == 0) |
95adb866 AC |
1196 | /* FIXME: 2002-11-09: Frameless functions can occure anywhere in |
1197 | the frame chain, not just the inner most frame! The generic, | |
1198 | per-architecture, frame code should handle this and the below | |
1199 | should simply be removed. */ | |
03febf99 | 1200 | fromleaf = FRAMELESS_FUNCTION_INVOCATION (this_frame); |
95adb866 AC |
1201 | else |
1202 | fromleaf = 0; | |
1203 | ||
1204 | if (fromleaf) | |
1205 | /* A frameless inner-most frame. The `FP' (which isn't an | |
1206 | architecture frame-pointer register!) of the caller is the same | |
1207 | as the callee. */ | |
1208 | /* FIXME: 2002-11-09: There isn't any reason to special case this | |
1209 | edge condition. Instead the per-architecture code should hande | |
1210 | it locally. */ | |
03febf99 | 1211 | address = get_frame_base (this_frame); |
95adb866 | 1212 | else |
4c1e7e9d AC |
1213 | { |
1214 | /* Two macros defined in tm.h specify the machine-dependent | |
1215 | actions to be performed here. | |
95adb866 | 1216 | |
4c1e7e9d | 1217 | First, get the frame's chain-pointer. |
95adb866 | 1218 | |
4c1e7e9d AC |
1219 | If that is zero, the frame is the outermost frame or a leaf |
1220 | called by the outermost frame. This means that if start | |
1221 | calls main without a frame, we'll return 0 (which is fine | |
1222 | anyway). | |
1223 | ||
1224 | Nope; there's a problem. This also returns when the current | |
1225 | routine is a leaf of main. This is unacceptable. We move | |
1226 | this to after the ffi test; I'd rather have backtraces from | |
1227 | start go curfluy than have an abort called from main not show | |
1228 | main. */ | |
618ce49f AC |
1229 | gdb_assert (DEPRECATED_FRAME_CHAIN_P ()); |
1230 | address = DEPRECATED_FRAME_CHAIN (this_frame); | |
4c1e7e9d | 1231 | |
03febf99 | 1232 | if (!frame_chain_valid (address, this_frame)) |
4c1e7e9d AC |
1233 | return 0; |
1234 | } | |
1235 | if (address == 0) | |
1236 | return 0; | |
1237 | ||
055bb976 | 1238 | /* Link in the already allocated prev frame. */ |
03febf99 | 1239 | this_frame->prev = prev; |
11889732 | 1240 | deprecated_update_frame_base_hack (prev, address); |
4c1e7e9d | 1241 | |
95adb866 | 1242 | /* This change should not be needed, FIXME! We should determine |
a5afb99f | 1243 | whether any targets *need* DEPRECATED_INIT_FRAME_PC to happen |
e9582e71 AC |
1244 | after DEPRECATED_INIT_EXTRA_FRAME_INFO and come up with a simple |
1245 | way to express what goes on here. | |
95adb866 | 1246 | |
e9582e71 AC |
1247 | DEPRECATED_INIT_EXTRA_FRAME_INFO is called from two places: |
1248 | create_new_frame (where the PC is already set up) and here (where | |
1249 | it isn't). DEPRECATED_INIT_FRAME_PC is only called from here, | |
1250 | always after DEPRECATED_INIT_EXTRA_FRAME_INFO. | |
95adb866 | 1251 | |
e9582e71 AC |
1252 | The catch is the MIPS, where DEPRECATED_INIT_EXTRA_FRAME_INFO |
1253 | requires the PC value (which hasn't been set yet). Some other | |
1254 | machines appear to require DEPRECATED_INIT_EXTRA_FRAME_INFO | |
1255 | before they can do DEPRECATED_INIT_FRAME_PC. Phoo. | |
95adb866 | 1256 | |
2ca6c561 AC |
1257 | We shouldn't need DEPRECATED_INIT_FRAME_PC_FIRST to add more |
1258 | complication to an already overcomplicated part of GDB. | |
1259 | gnu@cygnus.com, 15Sep92. | |
95adb866 | 1260 | |
a5afb99f | 1261 | Assuming that some machines need DEPRECATED_INIT_FRAME_PC after |
e9582e71 | 1262 | DEPRECATED_INIT_EXTRA_FRAME_INFO, one possible scheme: |
95adb866 AC |
1263 | |
1264 | SETUP_INNERMOST_FRAME(): Default version is just create_new_frame | |
1265 | (read_fp ()), read_pc ()). Machines with extra frame info would | |
1266 | do that (or the local equivalent) and then set the extra fields. | |
1267 | ||
1268 | SETUP_ARBITRARY_FRAME(argc, argv): Only change here is that | |
1269 | create_new_frame would no longer init extra frame info; | |
1270 | SETUP_ARBITRARY_FRAME would have to do that. | |
1271 | ||
e9582e71 AC |
1272 | INIT_PREV_FRAME(fromleaf, prev) Replace |
1273 | DEPRECATED_INIT_EXTRA_FRAME_INFO and DEPRECATED_INIT_FRAME_PC. | |
1274 | This should also return a flag saying whether to keep the new | |
1275 | frame, or whether to discard it, because on some machines (e.g. | |
618ce49f AC |
1276 | mips) it is really awkward to have DEPRECATED_FRAME_CHAIN_VALID |
1277 | called BEFORE DEPRECATED_INIT_EXTRA_FRAME_INFO (there is no good | |
1278 | way to get information deduced in DEPRECATED_FRAME_CHAIN_VALID | |
1279 | into the extra fields of the new frame). std_frame_pc(fromleaf, | |
1280 | prev) | |
95adb866 AC |
1281 | |
1282 | This is the default setting for INIT_PREV_FRAME. It just does | |
a5afb99f AC |
1283 | what the default DEPRECATED_INIT_FRAME_PC does. Some machines |
1284 | will call it from INIT_PREV_FRAME (either at the beginning, the | |
1285 | end, or in the middle). Some machines won't use it. | |
95adb866 AC |
1286 | |
1287 | kingdon@cygnus.com, 13Apr93, 31Jan94, 14Dec94. */ | |
1288 | ||
1289 | /* NOTE: cagney/2002-11-09: Just ignore the above! There is no | |
1290 | reason for things to be this complicated. | |
1291 | ||
1292 | The trick is to assume that there is always a frame. Instead of | |
1293 | special casing the inner-most frame, create fake frame | |
1294 | (containing the hardware registers) that is inner to the | |
1295 | user-visible inner-most frame (...) and then unwind from that. | |
1296 | That way architecture code can use use the standard | |
1297 | frame_XX_unwind() functions and not differentiate between the | |
1298 | inner most and any other case. | |
1299 | ||
1300 | Since there is always a frame to unwind from, there is always | |
03febf99 | 1301 | somewhere (THIS_FRAME) to store all the info needed to construct |
95adb866 AC |
1302 | a new (previous) frame without having to first create it. This |
1303 | means that the convolution below - needing to carefully order a | |
1304 | frame's initialization - isn't needed. | |
1305 | ||
618ce49f AC |
1306 | The irony here though, is that DEPRECATED_FRAME_CHAIN(), at least |
1307 | for a more up-to-date architecture, always calls | |
1308 | FRAME_SAVED_PC(), and FRAME_SAVED_PC() computes the PC but | |
1309 | without first needing the frame! Instead of the convolution | |
1310 | below, we could have simply called FRAME_SAVED_PC() and been done | |
1311 | with it! Note that FRAME_SAVED_PC() is being superseed by | |
1312 | frame_pc_unwind() and that function does have somewhere to cache | |
1313 | that PC value. */ | |
4c1e7e9d | 1314 | |
2ca6c561 | 1315 | if (DEPRECATED_INIT_FRAME_PC_FIRST_P ()) |
11889732 AC |
1316 | deprecated_update_frame_pc_hack (prev, |
1317 | DEPRECATED_INIT_FRAME_PC_FIRST (fromleaf, | |
1318 | prev)); | |
4c1e7e9d | 1319 | |
e9582e71 AC |
1320 | if (DEPRECATED_INIT_EXTRA_FRAME_INFO_P ()) |
1321 | DEPRECATED_INIT_EXTRA_FRAME_INFO (fromleaf, prev); | |
4c1e7e9d AC |
1322 | |
1323 | /* This entry is in the frame queue now, which is good since | |
95adb866 AC |
1324 | FRAME_SAVED_PC may use that queue to figure out its value (see |
1325 | tm-sparc.h). We want the pc saved in the inferior frame. */ | |
a5afb99f | 1326 | if (DEPRECATED_INIT_FRAME_PC_P ()) |
11889732 AC |
1327 | deprecated_update_frame_pc_hack (prev, |
1328 | DEPRECATED_INIT_FRAME_PC (fromleaf, | |
1329 | prev)); | |
4c1e7e9d | 1330 | |
95adb866 AC |
1331 | /* If ->frame and ->pc are unchanged, we are in the process of |
1332 | getting ourselves into an infinite backtrace. Some architectures | |
618ce49f AC |
1333 | check this in DEPRECATED_FRAME_CHAIN or thereabouts, but it seems |
1334 | like there is no reason this can't be an architecture-independent | |
1335 | check. */ | |
11889732 AC |
1336 | if (get_frame_base (prev) == get_frame_base (this_frame) |
1337 | && get_frame_pc (prev) == get_frame_pc (this_frame)) | |
4c1e7e9d | 1338 | { |
03febf99 | 1339 | this_frame->prev = NULL; |
95adb866 AC |
1340 | obstack_free (&frame_cache_obstack, prev); |
1341 | return NULL; | |
4c1e7e9d AC |
1342 | } |
1343 | ||
1344 | /* Initialize the code used to unwind the frame PREV based on the PC | |
1345 | (and probably other architectural information). The PC lets you | |
1346 | check things like the debug info at that point (dwarf2cfi?) and | |
1347 | use that to decide how the frame should be unwound. */ | |
11889732 AC |
1348 | prev->unwind = frame_unwind_find_by_pc (current_gdbarch, |
1349 | get_frame_pc (prev)); | |
4c1e7e9d | 1350 | |
7df05f2b AC |
1351 | /* If the unwinder provides a frame type, use it. Otherwize |
1352 | continue on to that heuristic mess. */ | |
1353 | if (prev->unwind->type != UNKNOWN_FRAME) | |
1354 | { | |
1355 | prev->type = prev->unwind->type; | |
1356 | return prev; | |
1357 | } | |
1358 | ||
5a203e44 AC |
1359 | /* NOTE: cagney/2002-11-18: The code segments, found in |
1360 | create_new_frame and get_prev_frame(), that initializes the | |
1361 | frames type is subtly different. The latter only updates ->type | |
1362 | when it encounters a SIGTRAMP_FRAME or DUMMY_FRAME. This stops | |
1363 | get_prev_frame() overriding the frame's type when the INIT code | |
1364 | has previously set it. This is really somewhat bogus. The | |
1365 | initialization, as seen in create_new_frame(), should occur | |
1366 | before the INIT function has been called. */ | |
07555a72 | 1367 | if (DEPRECATED_USE_GENERIC_DUMMY_FRAMES |
ae45cd16 | 1368 | && (DEPRECATED_PC_IN_CALL_DUMMY_P () |
11889732 AC |
1369 | ? DEPRECATED_PC_IN_CALL_DUMMY (get_frame_pc (prev), 0, 0) |
1370 | : pc_in_dummy_frame (get_frame_pc (prev)))) | |
5a203e44 AC |
1371 | prev->type = DUMMY_FRAME; |
1372 | else | |
1373 | { | |
1374 | /* FIXME: cagney/2002-11-10: This should be moved to before the | |
1375 | INIT code above so that the INIT code knows what the frame's | |
1376 | type is (in fact, for a [generic] dummy-frame, the type can | |
1377 | be set and then the entire initialization can be skipped. | |
1378 | Unforunatly, its the INIT code that sets the PC (Hmm, catch | |
1379 | 22). */ | |
1380 | char *name; | |
11889732 AC |
1381 | find_pc_partial_function (get_frame_pc (prev), &name, NULL, NULL); |
1382 | if (PC_IN_SIGTRAMP (get_frame_pc (prev), name)) | |
5a203e44 AC |
1383 | prev->type = SIGTRAMP_FRAME; |
1384 | /* FIXME: cagney/2002-11-11: Leave prev->type alone. Some | |
1385 | architectures are forcing the frame's type in INIT so we | |
1386 | don't want to override it here. Remember, NORMAL_FRAME == 0, | |
1387 | so it all works (just :-/). Once this initialization is | |
1388 | moved to the start of this function, all this nastness will | |
1389 | go away. */ | |
1390 | } | |
4c1e7e9d AC |
1391 | |
1392 | return prev; | |
1393 | } | |
1394 | ||
eb4f72c5 | 1395 | /* Return a structure containing various interesting information |
03febf99 | 1396 | about the frame that called THIS_FRAME. Returns NULL |
eb4f72c5 AC |
1397 | if there is no such frame. */ |
1398 | ||
1399 | struct frame_info * | |
03febf99 | 1400 | get_prev_frame (struct frame_info *this_frame) |
eb4f72c5 AC |
1401 | { |
1402 | struct frame_info *prev_frame; | |
1403 | ||
1404 | /* Return the inner-most frame, when the caller passes in NULL. */ | |
1405 | /* NOTE: cagney/2002-11-09: Not sure how this would happen. The | |
1406 | caller should have previously obtained a valid frame using | |
1407 | get_selected_frame() and then called this code - only possibility | |
1408 | I can think of is code behaving badly. | |
1409 | ||
1410 | NOTE: cagney/2003-01-10: Talk about code behaving badly. Check | |
1411 | block_innermost_frame(). It does the sequence: frame = NULL; | |
1412 | while (1) { frame = get_prev_frame (frame); .... }. Ulgh! Why | |
1413 | it couldn't be written better, I don't know. | |
1414 | ||
1415 | NOTE: cagney/2003-01-11: I suspect what is happening is | |
1416 | block_innermost_frame() is, when the target has no state | |
1417 | (registers, memory, ...), still calling this function. The | |
1418 | assumption being that this function will return NULL indicating | |
1419 | that a frame isn't possible, rather than checking that the target | |
1420 | has state and then calling get_current_frame() and | |
1421 | get_prev_frame(). This is a guess mind. */ | |
03febf99 | 1422 | if (this_frame == NULL) |
eb4f72c5 AC |
1423 | { |
1424 | /* NOTE: cagney/2002-11-09: There was a code segment here that | |
1425 | would error out when CURRENT_FRAME was NULL. The comment | |
1426 | that went with it made the claim ... | |
1427 | ||
1428 | ``This screws value_of_variable, which just wants a nice | |
1429 | clean NULL return from block_innermost_frame if there are no | |
1430 | frames. I don't think I've ever seen this message happen | |
1431 | otherwise. And returning NULL here is a perfectly legitimate | |
1432 | thing to do.'' | |
1433 | ||
1434 | Per the above, this code shouldn't even be called with a NULL | |
03febf99 | 1435 | THIS_FRAME. */ |
eb4f72c5 AC |
1436 | return current_frame; |
1437 | } | |
1438 | ||
1439 | /* There is always a frame. If this assertion fails, suspect that | |
1440 | something should be calling get_selected_frame() or | |
1441 | get_current_frame(). */ | |
03febf99 | 1442 | gdb_assert (this_frame != NULL); |
eb4f72c5 | 1443 | |
03febf99 | 1444 | if (this_frame->level >= 0 |
eb4f72c5 | 1445 | && !backtrace_below_main |
03febf99 | 1446 | && inside_main_func (get_frame_pc (this_frame))) |
eb4f72c5 AC |
1447 | /* Don't unwind past main(), bug always unwind the sentinel frame. |
1448 | Note, this is done _before_ the frame has been marked as | |
1449 | previously unwound. That way if the user later decides to | |
1450 | allow unwinds past main(), that just happens. */ | |
ac2bd0a9 AC |
1451 | { |
1452 | if (frame_debug) | |
1453 | fprintf_unfiltered (gdb_stdlog, | |
1454 | "Outermost frame - inside main func.\n"); | |
1455 | return NULL; | |
1456 | } | |
eb4f72c5 AC |
1457 | |
1458 | /* Only try to do the unwind once. */ | |
03febf99 AC |
1459 | if (this_frame->prev_p) |
1460 | return this_frame->prev; | |
1461 | this_frame->prev_p = 1; | |
eb4f72c5 | 1462 | |
ce0c7262 | 1463 | #if 0 |
b14185ce AC |
1464 | /* If we're inside the entry file, it isn't valid. Don't apply this |
1465 | test to a dummy frame - dummy frame PC's typically land in the | |
1466 | entry file. Don't apply this test to the sentinel frame. | |
1467 | Sentinel frames should always be allowed to unwind. */ | |
eb4f72c5 AC |
1468 | /* NOTE: drow/2002-12-25: should there be a way to disable this |
1469 | check? It assumes a single small entry file, and the way some | |
1470 | debug readers (e.g. dbxread) figure out which object is the | |
1471 | entry file is somewhat hokey. */ | |
1472 | /* NOTE: cagney/2003-01-10: If there is a way of disabling this test | |
1473 | then it should probably be moved to before the ->prev_p test, | |
1474 | above. */ | |
ce0c7262 CV |
1475 | /* NOTE: vinschen/2003-04-01: Disabled. It turns out that the call to |
1476 | inside_entry_file destroys a meaningful backtrace under some | |
1477 | conditions. E. g. the backtrace tests in the asm-source testcase | |
1478 | are broken for some targets. In this test the functions are all | |
1479 | implemented as part of one file and the testcase is not necessarily | |
1480 | linked with a start file (depending on the target). What happens is, | |
1481 | that the first frame is printed normaly and following frames are | |
1482 | treated as being inside the enttry file then. This way, only the | |
1483 | #0 frame is printed in the backtrace output. */ | |
03febf99 AC |
1484 | if (this_frame->type != DUMMY_FRAME && this_frame->level >= 0 |
1485 | && inside_entry_file (get_frame_pc (this_frame))) | |
ac2bd0a9 AC |
1486 | { |
1487 | if (frame_debug) | |
1488 | fprintf_unfiltered (gdb_stdlog, | |
1489 | "Outermost frame - inside entry file\n"); | |
eb4f72c5 | 1490 | return NULL; |
ac2bd0a9 | 1491 | } |
ce0c7262 | 1492 | #endif |
eb4f72c5 | 1493 | |
b14185ce AC |
1494 | /* If we're already inside the entry function for the main objfile, |
1495 | then it isn't valid. Don't apply this test to a dummy frame - | |
1496 | dummy frame PC's typically land in the entry func. Don't apply | |
1497 | this test to the sentinel frame. Sentinel frames should always | |
1498 | be allowed to unwind. */ | |
1499 | /* NOTE: cagney/2003-02-25: Don't enable until someone has found | |
1500 | hard evidence that this is needed. */ | |
1501 | if (0 | |
03febf99 AC |
1502 | && this_frame->type != DUMMY_FRAME && this_frame->level >= 0 |
1503 | && inside_entry_func (get_frame_pc (this_frame))) | |
b14185ce AC |
1504 | { |
1505 | if (frame_debug) | |
1506 | fprintf_unfiltered (gdb_stdlog, | |
1507 | "Outermost frame - inside entry func\n"); | |
1508 | return NULL; | |
1509 | } | |
1510 | ||
eb4f72c5 | 1511 | /* If any of the old frame initialization methods are around, use |
055bb976 AC |
1512 | the legacy get_prev_frame method. */ |
1513 | if (legacy_frame_p (current_gdbarch)) | |
ac2bd0a9 | 1514 | { |
03febf99 | 1515 | prev_frame = legacy_get_prev_frame (this_frame); |
ac2bd0a9 AC |
1516 | if (frame_debug && prev_frame == NULL) |
1517 | fprintf_unfiltered (gdb_stdlog, | |
1518 | "Outermost frame - legacy_get_prev_frame NULL.\n"); | |
1519 | return prev_frame; | |
1520 | } | |
eb4f72c5 | 1521 | |
270c3b1d AC |
1522 | /* Check that this frame's ID was valid. If it wasn't, don't try to |
1523 | unwind to the prev frame. Be careful to not apply this test to | |
1524 | the sentinel frame. */ | |
1525 | if (this_frame->level >= 0 && !frame_id_p (get_frame_id (this_frame))) | |
1526 | { | |
1527 | if (frame_debug) | |
1528 | fprintf_filtered (gdb_stdlog, | |
1529 | "Outermost frame - this ID is NULL\n"); | |
1530 | return NULL; | |
1531 | } | |
1532 | ||
1533 | /* Check that this frame's ID isn't inner to (younger, below, next) | |
1534 | the next frame. This happens when frame unwind goes backwards. | |
1535 | Since the sentinel frame isn't valid, don't apply this if this | |
1536 | frame is entier the inner-most or sentinel frame. */ | |
1537 | if (this_frame->level > 0 | |
1538 | && frame_id_inner (get_frame_id (this_frame), | |
1539 | get_frame_id (this_frame->next))) | |
1540 | error ("This frame inner-to next frame (corrupt stack?)"); | |
1541 | ||
1542 | /* Check that this and the next frame are different. If they are | |
1543 | not, there is most likely a stack cycle. As with the inner-than | |
1544 | test, avoid the inner-most and sentinel frames. */ | |
1545 | /* FIXME: cagney/2003-03-17: Can't yet enable this this check. The | |
1546 | frame_id_eq() method doesn't yet use function addresses when | |
1547 | comparing frame IDs. */ | |
1548 | if (0 | |
1549 | && this_frame->level > 0 | |
1550 | && frame_id_eq (get_frame_id (this_frame), | |
1551 | get_frame_id (this_frame->next))) | |
1552 | error ("This frame identical to next frame (corrupt stack?)"); | |
1553 | ||
eb4f72c5 AC |
1554 | /* Allocate the new frame but do not wire it in to the frame chain. |
1555 | Some (bad) code in INIT_FRAME_EXTRA_INFO tries to look along | |
1556 | frame->next to pull some fancy tricks (of course such code is, by | |
1557 | definition, recursive). Try to prevent it. | |
1558 | ||
1559 | There is no reason to worry about memory leaks, should the | |
1560 | remainder of the function fail. The allocated memory will be | |
1561 | quickly reclaimed when the frame cache is flushed, and the `we've | |
1562 | been here before' check above will stop repeated memory | |
1563 | allocation calls. */ | |
1564 | prev_frame = FRAME_OBSTACK_ZALLOC (struct frame_info); | |
03febf99 | 1565 | prev_frame->level = this_frame->level + 1; |
eb4f72c5 AC |
1566 | |
1567 | /* Try to unwind the PC. If that doesn't work, assume we've reached | |
1568 | the oldest frame and simply return. Is there a better sentinal | |
1569 | value? The unwound PC value is then used to initialize the new | |
1570 | previous frame's type. | |
1571 | ||
1572 | Note that the pc-unwind is intentionally performed before the | |
1573 | frame chain. This is ok since, for old targets, both | |
618ce49f AC |
1574 | frame_pc_unwind (nee, FRAME_SAVED_PC) and |
1575 | DEPRECATED_FRAME_CHAIN()) assume THIS_FRAME's data structures | |
1576 | have already been initialized (using | |
e9582e71 AC |
1577 | DEPRECATED_INIT_EXTRA_FRAME_INFO) and hence the call order |
1578 | doesn't matter. | |
eb4f72c5 AC |
1579 | |
1580 | By unwinding the PC first, it becomes possible to, in the case of | |
1581 | a dummy frame, avoid also unwinding the frame ID. This is | |
1582 | because (well ignoring the PPC) a dummy frame can be located | |
03febf99 | 1583 | using THIS_FRAME's frame ID. */ |
eb4f72c5 | 1584 | |
11889732 AC |
1585 | /* FIXME: cagney/2003-04-04: Once ->pc is eliminated, this |
1586 | assignment can go away. */ | |
03febf99 | 1587 | prev_frame->pc = frame_pc_unwind (this_frame); |
eb4f72c5 | 1588 | if (prev_frame->pc == 0) |
ac2bd0a9 AC |
1589 | { |
1590 | /* The allocated PREV_FRAME will be reclaimed when the frame | |
1591 | obstack is next purged. */ | |
1592 | if (frame_debug) | |
1593 | fprintf_unfiltered (gdb_stdlog, | |
1594 | "Outermost frame - unwound PC zero\n"); | |
1595 | return NULL; | |
1596 | } | |
eb4f72c5 AC |
1597 | |
1598 | /* Set the unwind functions based on that identified PC. */ | |
1599 | prev_frame->unwind = frame_unwind_find_by_pc (current_gdbarch, | |
1600 | prev_frame->pc); | |
1601 | ||
7df05f2b AC |
1602 | /* FIXME: cagney/2003-04-02: Rather than storing the frame's type in |
1603 | the frame, the unwinder's type should be returned directly. | |
1604 | Unfortunatly, legacy code, called by legacy_get_prev_frame, | |
1605 | explicitly set the frames type using the method | |
1606 | deprecated_set_frame_type(). */ | |
1607 | gdb_assert (prev_frame->unwind->type != UNKNOWN_FRAME); | |
1608 | prev_frame->type = prev_frame->unwind->type; | |
1609 | ||
1610 | /* Can the frame's type and unwinder be computed on demand? That | |
1611 | would make a frame's creation really really lite! */ | |
1612 | ||
06c77151 | 1613 | /* The prev's frame's ID is computed by demand in get_frame_id(). */ |
6dc42492 | 1614 | |
270c3b1d AC |
1615 | /* The unwound frame ID is validate at the start of this function, |
1616 | as part of the logic to decide if that frame should be further | |
1617 | unwound, and not here while the prev frame is being created. | |
1618 | Doing this makes it possible for the user to examine a frame that | |
1619 | has an invalid frame ID. | |
1620 | ||
1621 | The very old VAX frame_args_address_correct() method noted: [...] | |
1622 | For the sake of argument, suppose that the stack is somewhat | |
1623 | trashed (which is one reason that "info frame" exists). So, | |
1624 | return 0 (indicating we don't know the address of the arglist) if | |
1625 | we don't know what frame this frame calls. */ | |
6dc42492 | 1626 | |
eb4f72c5 | 1627 | /* Link it in. */ |
03febf99 AC |
1628 | this_frame->prev = prev_frame; |
1629 | prev_frame->next = this_frame; | |
eb4f72c5 | 1630 | |
eb4f72c5 AC |
1631 | return prev_frame; |
1632 | } | |
1633 | ||
4c1e7e9d AC |
1634 | CORE_ADDR |
1635 | get_frame_pc (struct frame_info *frame) | |
1636 | { | |
1637 | return frame->pc; | |
1638 | } | |
1639 | ||
1058bca7 AC |
1640 | static int |
1641 | pc_notcurrent (struct frame_info *frame) | |
1642 | { | |
1643 | /* If FRAME is not the innermost frame, that normally means that | |
1644 | FRAME->pc points at the return instruction (which is *after* the | |
1645 | call instruction), and we want to get the line containing the | |
1646 | call (because the call is where the user thinks the program is). | |
1647 | However, if the next frame is either a SIGTRAMP_FRAME or a | |
1648 | DUMMY_FRAME, then the next frame will contain a saved interrupt | |
1649 | PC and such a PC indicates the current (rather than next) | |
1650 | instruction/line, consequently, for such cases, want to get the | |
1651 | line containing fi->pc. */ | |
1652 | struct frame_info *next = get_next_frame (frame); | |
1653 | int notcurrent = (next != NULL && get_frame_type (next) == NORMAL_FRAME); | |
1654 | return notcurrent; | |
1655 | } | |
1656 | ||
1657 | void | |
1658 | find_frame_sal (struct frame_info *frame, struct symtab_and_line *sal) | |
1659 | { | |
11889732 | 1660 | (*sal) = find_pc_line (get_frame_pc (frame), pc_notcurrent (frame)); |
1058bca7 AC |
1661 | } |
1662 | ||
c193f6ac AC |
1663 | /* Per "frame.h", return the ``address'' of the frame. Code should |
1664 | really be using get_frame_id(). */ | |
1665 | CORE_ADDR | |
1666 | get_frame_base (struct frame_info *fi) | |
1667 | { | |
06c77151 AC |
1668 | if (!fi->id_p) |
1669 | { | |
1670 | /* HACK: Force the ID code to (indirectly) initialize the | |
1671 | ->frame pointer. */ | |
1672 | get_frame_id (fi); | |
1673 | } | |
c193f6ac AC |
1674 | return fi->frame; |
1675 | } | |
1676 | ||
da62e633 AC |
1677 | /* High-level offsets into the frame. Used by the debug info. */ |
1678 | ||
1679 | CORE_ADDR | |
1680 | get_frame_base_address (struct frame_info *fi) | |
1681 | { | |
7df05f2b | 1682 | if (get_frame_type (fi) != NORMAL_FRAME) |
da62e633 AC |
1683 | return 0; |
1684 | if (fi->base == NULL) | |
1685 | fi->base = frame_base_find_by_pc (current_gdbarch, get_frame_pc (fi)); | |
1686 | /* Sneaky: If the low-level unwind and high-level base code share a | |
1687 | common unwinder, let them share the prologue cache. */ | |
1688 | if (fi->base->unwind == fi->unwind) | |
1689 | return fi->base->this_base (fi->next, &fi->prologue_cache); | |
1690 | return fi->base->this_base (fi->next, &fi->base_cache); | |
1691 | } | |
1692 | ||
1693 | CORE_ADDR | |
1694 | get_frame_locals_address (struct frame_info *fi) | |
1695 | { | |
1696 | void **cache; | |
7df05f2b | 1697 | if (get_frame_type (fi) != NORMAL_FRAME) |
da62e633 AC |
1698 | return 0; |
1699 | /* If there isn't a frame address method, find it. */ | |
1700 | if (fi->base == NULL) | |
1701 | fi->base = frame_base_find_by_pc (current_gdbarch, get_frame_pc (fi)); | |
1702 | /* Sneaky: If the low-level unwind and high-level base code share a | |
1703 | common unwinder, let them share the prologue cache. */ | |
1704 | if (fi->base->unwind == fi->unwind) | |
1705 | cache = &fi->prologue_cache; | |
1706 | else | |
1707 | cache = &fi->base_cache; | |
1708 | return fi->base->this_locals (fi->next, cache); | |
1709 | } | |
1710 | ||
1711 | CORE_ADDR | |
1712 | get_frame_args_address (struct frame_info *fi) | |
1713 | { | |
1714 | void **cache; | |
7df05f2b | 1715 | if (get_frame_type (fi) != NORMAL_FRAME) |
da62e633 AC |
1716 | return 0; |
1717 | /* If there isn't a frame address method, find it. */ | |
1718 | if (fi->base == NULL) | |
1719 | fi->base = frame_base_find_by_pc (current_gdbarch, get_frame_pc (fi)); | |
1720 | /* Sneaky: If the low-level unwind and high-level base code share a | |
1721 | common unwinder, let them share the prologue cache. */ | |
1722 | if (fi->base->unwind == fi->unwind) | |
1723 | cache = &fi->prologue_cache; | |
1724 | else | |
1725 | cache = &fi->base_cache; | |
1726 | return fi->base->this_args (fi->next, cache); | |
1727 | } | |
1728 | ||
85cf597a AC |
1729 | /* Level of the selected frame: 0 for innermost, 1 for its caller, ... |
1730 | or -1 for a NULL frame. */ | |
1731 | ||
1732 | int | |
1733 | frame_relative_level (struct frame_info *fi) | |
1734 | { | |
1735 | if (fi == NULL) | |
1736 | return -1; | |
1737 | else | |
1738 | return fi->level; | |
1739 | } | |
1740 | ||
5a203e44 AC |
1741 | enum frame_type |
1742 | get_frame_type (struct frame_info *frame) | |
1743 | { | |
1744 | /* Some targets still don't use [generic] dummy frames. Catch them | |
1745 | here. */ | |
07555a72 | 1746 | if (!DEPRECATED_USE_GENERIC_DUMMY_FRAMES |
5a203e44 AC |
1747 | && deprecated_frame_in_dummy (frame)) |
1748 | return DUMMY_FRAME; | |
7df05f2b AC |
1749 | if (frame->type == UNKNOWN_FRAME) |
1750 | return NORMAL_FRAME; | |
1751 | else | |
1752 | return frame->type; | |
5a203e44 AC |
1753 | } |
1754 | ||
1755 | void | |
1756 | deprecated_set_frame_type (struct frame_info *frame, enum frame_type type) | |
1757 | { | |
1758 | /* Arrrg! See comment in "frame.h". */ | |
1759 | frame->type = type; | |
1760 | } | |
1761 | ||
4c1e7e9d AC |
1762 | #ifdef FRAME_FIND_SAVED_REGS |
1763 | /* XXX - deprecated. This is a compatibility function for targets | |
f30ee0bc | 1764 | that do not yet implement DEPRECATED_FRAME_INIT_SAVED_REGS. */ |
4c1e7e9d AC |
1765 | /* Find the addresses in which registers are saved in FRAME. */ |
1766 | ||
1767 | void | |
95486978 AC |
1768 | deprecated_get_frame_saved_regs (struct frame_info *frame, |
1769 | struct frame_saved_regs *saved_regs_addr) | |
4c1e7e9d AC |
1770 | { |
1771 | if (frame->saved_regs == NULL) | |
1772 | { | |
1773 | frame->saved_regs = (CORE_ADDR *) | |
479ab5a0 | 1774 | frame_obstack_zalloc (SIZEOF_FRAME_SAVED_REGS); |
4c1e7e9d AC |
1775 | } |
1776 | if (saved_regs_addr == NULL) | |
1777 | { | |
1778 | struct frame_saved_regs saved_regs; | |
1779 | FRAME_FIND_SAVED_REGS (frame, saved_regs); | |
1780 | memcpy (frame->saved_regs, &saved_regs, SIZEOF_FRAME_SAVED_REGS); | |
1781 | } | |
1782 | else | |
1783 | { | |
1784 | FRAME_FIND_SAVED_REGS (frame, *saved_regs_addr); | |
1785 | memcpy (frame->saved_regs, saved_regs_addr, SIZEOF_FRAME_SAVED_REGS); | |
1786 | } | |
1787 | } | |
1788 | #endif | |
1789 | ||
0394eb2a AC |
1790 | struct frame_extra_info * |
1791 | get_frame_extra_info (struct frame_info *fi) | |
1792 | { | |
1793 | return fi->extra_info; | |
1794 | } | |
1795 | ||
2c517d0e AC |
1796 | struct frame_extra_info * |
1797 | frame_extra_info_zalloc (struct frame_info *fi, long size) | |
1798 | { | |
479ab5a0 | 1799 | fi->extra_info = frame_obstack_zalloc (size); |
2c517d0e AC |
1800 | return fi->extra_info; |
1801 | } | |
1802 | ||
b87efeee | 1803 | void |
2f107107 | 1804 | deprecated_update_frame_pc_hack (struct frame_info *frame, CORE_ADDR pc) |
b87efeee | 1805 | { |
2f107107 AC |
1806 | /* See comment in "frame.h". */ |
1807 | frame->pc = pc; | |
e0d2ae16 AC |
1808 | /* NOTE: cagney/2003-03-11: Some architectures (e.g., Arm) are |
1809 | maintaining a locally allocated frame object. Since such frame's | |
1810 | are not in the frame chain, it isn't possible to assume that the | |
1811 | frame has a next. Sigh. */ | |
1812 | if (frame->next != NULL) | |
1813 | { | |
1814 | /* While we're at it, update this frame's cached PC value, found | |
1815 | in the next frame. Oh for the day when "struct frame_info" | |
1816 | is opaque and this hack on hack can just go away. */ | |
1817 | frame->next->pc_unwind_cache = pc; | |
1818 | frame->next->pc_unwind_cache_p = 1; | |
1819 | } | |
2f107107 AC |
1820 | } |
1821 | ||
1822 | void | |
1823 | deprecated_update_frame_base_hack (struct frame_info *frame, CORE_ADDR base) | |
1824 | { | |
1825 | /* See comment in "frame.h". */ | |
1826 | frame->frame = base; | |
b87efeee AC |
1827 | } |
1828 | ||
c8b8a898 AC |
1829 | void |
1830 | deprecated_set_frame_saved_regs_hack (struct frame_info *frame, | |
1831 | CORE_ADDR *saved_regs) | |
1832 | { | |
1833 | frame->saved_regs = saved_regs; | |
1834 | } | |
1835 | ||
1836 | void | |
1837 | deprecated_set_frame_extra_info_hack (struct frame_info *frame, | |
1838 | struct frame_extra_info *extra_info) | |
1839 | { | |
1840 | frame->extra_info = extra_info; | |
1841 | } | |
1842 | ||
483d36b2 AC |
1843 | void |
1844 | deprecated_set_frame_next_hack (struct frame_info *fi, | |
1845 | struct frame_info *next) | |
1846 | { | |
1847 | fi->next = next; | |
1848 | } | |
1849 | ||
1850 | void | |
1851 | deprecated_set_frame_prev_hack (struct frame_info *fi, | |
1852 | struct frame_info *prev) | |
1853 | { | |
1854 | fi->prev = prev; | |
1855 | } | |
1856 | ||
2d75187b AC |
1857 | struct context * |
1858 | deprecated_get_frame_context (struct frame_info *fi) | |
1859 | { | |
1860 | return fi->context; | |
1861 | } | |
1862 | ||
1863 | void | |
1864 | deprecated_set_frame_context (struct frame_info *fi, | |
1865 | struct context *context) | |
1866 | { | |
1867 | fi->context = context; | |
1868 | } | |
1869 | ||
c8b8a898 AC |
1870 | struct frame_info * |
1871 | deprecated_frame_xmalloc (void) | |
1872 | { | |
1873 | struct frame_info *frame = XMALLOC (struct frame_info); | |
1874 | memset (frame, 0, sizeof (struct frame_info)); | |
1875 | return frame; | |
1876 | } | |
1877 | ||
f6c609c4 AC |
1878 | struct frame_info * |
1879 | deprecated_frame_xmalloc_with_cleanup (long sizeof_saved_regs, | |
1880 | long sizeof_extra_info) | |
1881 | { | |
1882 | struct frame_info *frame = deprecated_frame_xmalloc (); | |
1883 | make_cleanup (xfree, frame); | |
1884 | if (sizeof_saved_regs > 0) | |
1885 | { | |
1886 | frame->saved_regs = xcalloc (1, sizeof_saved_regs); | |
1887 | make_cleanup (xfree, frame->saved_regs); | |
1888 | } | |
1889 | if (sizeof_extra_info > 0) | |
1890 | { | |
1891 | frame->extra_info = xcalloc (1, sizeof_extra_info); | |
1892 | make_cleanup (xfree, frame->extra_info); | |
1893 | } | |
1894 | return frame; | |
1895 | } | |
c8b8a898 | 1896 | |
1594fa56 AC |
1897 | int |
1898 | legacy_frame_p (struct gdbarch *current_gdbarch) | |
1899 | { | |
1900 | return (DEPRECATED_INIT_FRAME_PC_P () | |
1901 | || DEPRECATED_INIT_FRAME_PC_FIRST_P () | |
1902 | || DEPRECATED_INIT_EXTRA_FRAME_INFO_P () | |
618ce49f | 1903 | || DEPRECATED_FRAME_CHAIN_P () |
055bb976 AC |
1904 | || !gdbarch_unwind_dummy_id_p (current_gdbarch) |
1905 | || !SAVE_DUMMY_FRAME_TOS_P ()); | |
1594fa56 AC |
1906 | } |
1907 | ||
4c1e7e9d AC |
1908 | void |
1909 | _initialize_frame (void) | |
1910 | { | |
1911 | obstack_init (&frame_cache_obstack); | |
eb4f72c5 AC |
1912 | |
1913 | /* FIXME: cagney/2003-01-19: This command needs a rename. Suggest | |
1914 | `set backtrace {past,beyond,...}-main'. Also suggest adding `set | |
1915 | backtrace ...-start' to control backtraces past start. The | |
1916 | problem with `below' is that it stops the `up' command. */ | |
1917 | ||
1918 | add_setshow_boolean_cmd ("backtrace-below-main", class_obscure, | |
1919 | &backtrace_below_main, "\ | |
1920 | Set whether backtraces should continue past \"main\".\n\ | |
1921 | Normally the caller of \"main\" is not of interest, so GDB will terminate\n\ | |
1922 | the backtrace at \"main\". Set this variable if you need to see the rest\n\ | |
1923 | of the stack trace.", "\ | |
1924 | Show whether backtraces should continue past \"main\".\n\ | |
1925 | Normally the caller of \"main\" is not of interest, so GDB will terminate\n\ | |
1926 | the backtrace at \"main\". Set this variable if you need to see the rest\n\ | |
1927 | of the stack trace.", | |
1928 | NULL, NULL, &setlist, &showlist); | |
ac2bd0a9 AC |
1929 | |
1930 | ||
1931 | /* Debug this files internals. */ | |
1932 | add_show_from_set (add_set_cmd ("frame", class_maintenance, var_zinteger, | |
1933 | &frame_debug, "Set frame debugging.\n\ | |
1934 | When non-zero, frame specific internal debugging is enabled.", &setdebuglist), | |
1935 | &showdebuglist); | |
4c1e7e9d | 1936 | } |