Commit | Line | Data |
---|---|---|
4f460812 | 1 | /* Cache and manage frames for GDB, the GNU debugger. |
96cb11df | 2 | |
618f726f | 3 | Copyright (C) 1986-2016 Free Software Foundation, Inc. |
d65fe839 AC |
4 | |
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
d65fe839 AC |
10 | (at your option) any later version. |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
d65fe839 AC |
19 | |
20 | #include "defs.h" | |
21 | #include "frame.h" | |
22 | #include "target.h" | |
23 | #include "value.h" | |
39f77062 | 24 | #include "inferior.h" /* for inferior_ptid */ |
4e052eda | 25 | #include "regcache.h" |
eb8bc282 | 26 | #include "user-regs.h" |
4c1e7e9d AC |
27 | #include "gdb_obstack.h" |
28 | #include "dummy-frame.h" | |
a94dd1fd | 29 | #include "sentinel-frame.h" |
4c1e7e9d AC |
30 | #include "gdbcore.h" |
31 | #include "annotate.h" | |
6e7f8b9c | 32 | #include "language.h" |
494cca16 | 33 | #include "frame-unwind.h" |
da62e633 | 34 | #include "frame-base.h" |
eb4f72c5 AC |
35 | #include "command.h" |
36 | #include "gdbcmd.h" | |
f4c5303c | 37 | #include "observer.h" |
c8cd9f6c | 38 | #include "objfiles.h" |
8ea051c5 | 39 | #include "gdbthread.h" |
edb3359d DJ |
40 | #include "block.h" |
41 | #include "inline-frame.h" | |
983dc440 | 42 | #include "tracepoint.h" |
3de661e6 | 43 | #include "hashtab.h" |
f6c01fc5 | 44 | #include "valprint.h" |
eb4f72c5 | 45 | |
edb3359d | 46 | static struct frame_info *get_prev_frame_raw (struct frame_info *this_frame); |
a7300869 | 47 | static const char *frame_stop_reason_symbol_string (enum unwind_stop_reason reason); |
5613d8d3 | 48 | |
782d47df PA |
49 | /* Status of some values cached in the frame_info object. */ |
50 | ||
51 | enum cached_copy_status | |
52 | { | |
53 | /* Value is unknown. */ | |
54 | CC_UNKNOWN, | |
55 | ||
56 | /* We have a value. */ | |
57 | CC_VALUE, | |
58 | ||
59 | /* Value was not saved. */ | |
60 | CC_NOT_SAVED, | |
61 | ||
62 | /* Value is unavailable. */ | |
63 | CC_UNAVAILABLE | |
64 | }; | |
65 | ||
bd013d54 AC |
66 | /* We keep a cache of stack frames, each of which is a "struct |
67 | frame_info". The innermost one gets allocated (in | |
68 | wait_for_inferior) each time the inferior stops; current_frame | |
69 | points to it. Additional frames get allocated (in get_prev_frame) | |
70 | as needed, and are chained through the next and prev fields. Any | |
71 | time that the frame cache becomes invalid (most notably when we | |
72 | execute something, but also if we change how we interpret the | |
73 | frames (e.g. "set heuristic-fence-post" in mips-tdep.c, or anything | |
74 | which reads new symbols)), we should call reinit_frame_cache. */ | |
75 | ||
76 | struct frame_info | |
77 | { | |
78 | /* Level of this frame. The inner-most (youngest) frame is at level | |
79 | 0. As you move towards the outer-most (oldest) frame, the level | |
80 | increases. This is a cached value. It could just as easily be | |
81 | computed by counting back from the selected frame to the inner | |
82 | most frame. */ | |
bbde78fa | 83 | /* NOTE: cagney/2002-04-05: Perhaps a level of ``-1'' should be |
bd013d54 AC |
84 | reserved to indicate a bogus frame - one that has been created |
85 | just to keep GDB happy (GDB always needs a frame). For the | |
86 | moment leave this as speculation. */ | |
87 | int level; | |
88 | ||
6c95b8df PA |
89 | /* The frame's program space. */ |
90 | struct program_space *pspace; | |
91 | ||
92 | /* The frame's address space. */ | |
93 | struct address_space *aspace; | |
94 | ||
bd013d54 AC |
95 | /* The frame's low-level unwinder and corresponding cache. The |
96 | low-level unwinder is responsible for unwinding register values | |
97 | for the previous frame. The low-level unwind methods are | |
bbde78fa | 98 | selected based on the presence, or otherwise, of register unwind |
bd013d54 AC |
99 | information such as CFI. */ |
100 | void *prologue_cache; | |
101 | const struct frame_unwind *unwind; | |
102 | ||
36f15f55 UW |
103 | /* Cached copy of the previous frame's architecture. */ |
104 | struct | |
105 | { | |
106 | int p; | |
107 | struct gdbarch *arch; | |
108 | } prev_arch; | |
109 | ||
bd013d54 AC |
110 | /* Cached copy of the previous frame's resume address. */ |
111 | struct { | |
782d47df | 112 | enum cached_copy_status status; |
bd013d54 AC |
113 | CORE_ADDR value; |
114 | } prev_pc; | |
115 | ||
116 | /* Cached copy of the previous frame's function address. */ | |
117 | struct | |
118 | { | |
119 | CORE_ADDR addr; | |
120 | int p; | |
121 | } prev_func; | |
122 | ||
123 | /* This frame's ID. */ | |
124 | struct | |
125 | { | |
126 | int p; | |
127 | struct frame_id value; | |
128 | } this_id; | |
129 | ||
130 | /* The frame's high-level base methods, and corresponding cache. | |
131 | The high level base methods are selected based on the frame's | |
132 | debug info. */ | |
133 | const struct frame_base *base; | |
134 | void *base_cache; | |
135 | ||
136 | /* Pointers to the next (down, inner, younger) and previous (up, | |
137 | outer, older) frame_info's in the frame cache. */ | |
138 | struct frame_info *next; /* down, inner, younger */ | |
139 | int prev_p; | |
140 | struct frame_info *prev; /* up, outer, older */ | |
55feb689 DJ |
141 | |
142 | /* The reason why we could not set PREV, or UNWIND_NO_REASON if we | |
143 | could. Only valid when PREV_P is set. */ | |
144 | enum unwind_stop_reason stop_reason; | |
53e8a631 AB |
145 | |
146 | /* A frame specific string describing the STOP_REASON in more detail. | |
147 | Only valid when PREV_P is set, but even then may still be NULL. */ | |
148 | const char *stop_string; | |
bd013d54 AC |
149 | }; |
150 | ||
3de661e6 PM |
151 | /* A frame stash used to speed up frame lookups. Create a hash table |
152 | to stash frames previously accessed from the frame cache for | |
153 | quicker subsequent retrieval. The hash table is emptied whenever | |
154 | the frame cache is invalidated. */ | |
b83e9eb7 | 155 | |
3de661e6 | 156 | static htab_t frame_stash; |
b83e9eb7 | 157 | |
3de661e6 PM |
158 | /* Internal function to calculate a hash from the frame_id addresses, |
159 | using as many valid addresses as possible. Frames below level 0 | |
160 | are not stored in the hash table. */ | |
161 | ||
162 | static hashval_t | |
163 | frame_addr_hash (const void *ap) | |
164 | { | |
9a3c8263 | 165 | const struct frame_info *frame = (const struct frame_info *) ap; |
3de661e6 PM |
166 | const struct frame_id f_id = frame->this_id.value; |
167 | hashval_t hash = 0; | |
168 | ||
5ce0145d PA |
169 | gdb_assert (f_id.stack_status != FID_STACK_INVALID |
170 | || f_id.code_addr_p | |
3de661e6 PM |
171 | || f_id.special_addr_p); |
172 | ||
5ce0145d | 173 | if (f_id.stack_status == FID_STACK_VALID) |
3de661e6 PM |
174 | hash = iterative_hash (&f_id.stack_addr, |
175 | sizeof (f_id.stack_addr), hash); | |
176 | if (f_id.code_addr_p) | |
177 | hash = iterative_hash (&f_id.code_addr, | |
178 | sizeof (f_id.code_addr), hash); | |
179 | if (f_id.special_addr_p) | |
180 | hash = iterative_hash (&f_id.special_addr, | |
181 | sizeof (f_id.special_addr), hash); | |
182 | ||
183 | return hash; | |
184 | } | |
185 | ||
186 | /* Internal equality function for the hash table. This function | |
187 | defers equality operations to frame_id_eq. */ | |
188 | ||
189 | static int | |
190 | frame_addr_hash_eq (const void *a, const void *b) | |
191 | { | |
9a3c8263 SM |
192 | const struct frame_info *f_entry = (const struct frame_info *) a; |
193 | const struct frame_info *f_element = (const struct frame_info *) b; | |
3de661e6 PM |
194 | |
195 | return frame_id_eq (f_entry->this_id.value, | |
196 | f_element->this_id.value); | |
197 | } | |
198 | ||
199 | /* Internal function to create the frame_stash hash table. 100 seems | |
200 | to be a good compromise to start the hash table at. */ | |
201 | ||
202 | static void | |
203 | frame_stash_create (void) | |
204 | { | |
205 | frame_stash = htab_create (100, | |
206 | frame_addr_hash, | |
207 | frame_addr_hash_eq, | |
208 | NULL); | |
209 | } | |
210 | ||
194cca41 PA |
211 | /* Internal function to add a frame to the frame_stash hash table. |
212 | Returns false if a frame with the same ID was already stashed, true | |
213 | otherwise. */ | |
b83e9eb7 | 214 | |
194cca41 | 215 | static int |
b83e9eb7 JB |
216 | frame_stash_add (struct frame_info *frame) |
217 | { | |
194cca41 | 218 | struct frame_info **slot; |
f5b0ed3c | 219 | |
194cca41 PA |
220 | /* Do not try to stash the sentinel frame. */ |
221 | gdb_assert (frame->level >= 0); | |
222 | ||
223 | slot = (struct frame_info **) htab_find_slot (frame_stash, | |
224 | frame, | |
225 | INSERT); | |
226 | ||
227 | /* If we already have a frame in the stack with the same id, we | |
228 | either have a stack cycle (corrupted stack?), or some bug | |
229 | elsewhere in GDB. In any case, ignore the duplicate and return | |
230 | an indication to the caller. */ | |
231 | if (*slot != NULL) | |
232 | return 0; | |
233 | ||
234 | *slot = frame; | |
235 | return 1; | |
b83e9eb7 JB |
236 | } |
237 | ||
3de661e6 PM |
238 | /* Internal function to search the frame stash for an entry with the |
239 | given frame ID. If found, return that frame. Otherwise return | |
240 | NULL. */ | |
b83e9eb7 JB |
241 | |
242 | static struct frame_info * | |
243 | frame_stash_find (struct frame_id id) | |
244 | { | |
3de661e6 PM |
245 | struct frame_info dummy; |
246 | struct frame_info *frame; | |
b83e9eb7 | 247 | |
3de661e6 | 248 | dummy.this_id.value = id; |
9a3c8263 | 249 | frame = (struct frame_info *) htab_find (frame_stash, &dummy); |
3de661e6 | 250 | return frame; |
b83e9eb7 JB |
251 | } |
252 | ||
3de661e6 PM |
253 | /* Internal function to invalidate the frame stash by removing all |
254 | entries in it. This only occurs when the frame cache is | |
255 | invalidated. */ | |
b83e9eb7 JB |
256 | |
257 | static void | |
258 | frame_stash_invalidate (void) | |
259 | { | |
3de661e6 | 260 | htab_empty (frame_stash); |
b83e9eb7 JB |
261 | } |
262 | ||
ac2bd0a9 AC |
263 | /* Flag to control debugging. */ |
264 | ||
ccce17b0 | 265 | unsigned int frame_debug; |
920d2a44 AC |
266 | static void |
267 | show_frame_debug (struct ui_file *file, int from_tty, | |
268 | struct cmd_list_element *c, const char *value) | |
269 | { | |
270 | fprintf_filtered (file, _("Frame debugging is %s.\n"), value); | |
271 | } | |
ac2bd0a9 | 272 | |
25d29d70 AC |
273 | /* Flag to indicate whether backtraces should stop at main et.al. */ |
274 | ||
275 | static int backtrace_past_main; | |
920d2a44 AC |
276 | static void |
277 | show_backtrace_past_main (struct ui_file *file, int from_tty, | |
278 | struct cmd_list_element *c, const char *value) | |
279 | { | |
3e43a32a MS |
280 | fprintf_filtered (file, |
281 | _("Whether backtraces should " | |
282 | "continue past \"main\" is %s.\n"), | |
920d2a44 AC |
283 | value); |
284 | } | |
285 | ||
2315ffec | 286 | static int backtrace_past_entry; |
920d2a44 AC |
287 | static void |
288 | show_backtrace_past_entry (struct ui_file *file, int from_tty, | |
289 | struct cmd_list_element *c, const char *value) | |
290 | { | |
3e43a32a MS |
291 | fprintf_filtered (file, _("Whether backtraces should continue past the " |
292 | "entry point of a program is %s.\n"), | |
920d2a44 AC |
293 | value); |
294 | } | |
295 | ||
883b9c6c | 296 | static unsigned int backtrace_limit = UINT_MAX; |
920d2a44 AC |
297 | static void |
298 | show_backtrace_limit (struct ui_file *file, int from_tty, | |
299 | struct cmd_list_element *c, const char *value) | |
300 | { | |
3e43a32a MS |
301 | fprintf_filtered (file, |
302 | _("An upper bound on the number " | |
303 | "of backtrace levels is %s.\n"), | |
920d2a44 AC |
304 | value); |
305 | } | |
306 | ||
eb4f72c5 | 307 | |
ca73dd9d AC |
308 | static void |
309 | fprint_field (struct ui_file *file, const char *name, int p, CORE_ADDR addr) | |
310 | { | |
311 | if (p) | |
5af949e3 | 312 | fprintf_unfiltered (file, "%s=%s", name, hex_string (addr)); |
ca73dd9d AC |
313 | else |
314 | fprintf_unfiltered (file, "!%s", name); | |
315 | } | |
d65fe839 | 316 | |
00905d52 | 317 | void |
7f78e237 AC |
318 | fprint_frame_id (struct ui_file *file, struct frame_id id) |
319 | { | |
ca73dd9d | 320 | fprintf_unfiltered (file, "{"); |
5ce0145d PA |
321 | |
322 | if (id.stack_status == FID_STACK_INVALID) | |
323 | fprintf_unfiltered (file, "!stack"); | |
324 | else if (id.stack_status == FID_STACK_UNAVAILABLE) | |
325 | fprintf_unfiltered (file, "stack=<unavailable>"); | |
326 | else | |
327 | fprintf_unfiltered (file, "stack=%s", hex_string (id.stack_addr)); | |
ca73dd9d | 328 | fprintf_unfiltered (file, ","); |
5ce0145d | 329 | |
ca73dd9d AC |
330 | fprint_field (file, "code", id.code_addr_p, id.code_addr); |
331 | fprintf_unfiltered (file, ","); | |
5ce0145d | 332 | |
ca73dd9d | 333 | fprint_field (file, "special", id.special_addr_p, id.special_addr); |
5ce0145d | 334 | |
193facb3 JK |
335 | if (id.artificial_depth) |
336 | fprintf_unfiltered (file, ",artificial=%d", id.artificial_depth); | |
5ce0145d | 337 | |
ca73dd9d | 338 | fprintf_unfiltered (file, "}"); |
7f78e237 AC |
339 | } |
340 | ||
341 | static void | |
342 | fprint_frame_type (struct ui_file *file, enum frame_type type) | |
343 | { | |
344 | switch (type) | |
345 | { | |
7f78e237 AC |
346 | case NORMAL_FRAME: |
347 | fprintf_unfiltered (file, "NORMAL_FRAME"); | |
348 | return; | |
349 | case DUMMY_FRAME: | |
350 | fprintf_unfiltered (file, "DUMMY_FRAME"); | |
351 | return; | |
edb3359d DJ |
352 | case INLINE_FRAME: |
353 | fprintf_unfiltered (file, "INLINE_FRAME"); | |
354 | return; | |
b5eef7aa JK |
355 | case TAILCALL_FRAME: |
356 | fprintf_unfiltered (file, "TAILCALL_FRAME"); | |
edb3359d | 357 | return; |
7f78e237 AC |
358 | case SIGTRAMP_FRAME: |
359 | fprintf_unfiltered (file, "SIGTRAMP_FRAME"); | |
360 | return; | |
36f15f55 UW |
361 | case ARCH_FRAME: |
362 | fprintf_unfiltered (file, "ARCH_FRAME"); | |
363 | return; | |
b5eef7aa JK |
364 | case SENTINEL_FRAME: |
365 | fprintf_unfiltered (file, "SENTINEL_FRAME"); | |
366 | return; | |
7f78e237 AC |
367 | default: |
368 | fprintf_unfiltered (file, "<unknown type>"); | |
369 | return; | |
370 | }; | |
371 | } | |
372 | ||
373 | static void | |
374 | fprint_frame (struct ui_file *file, struct frame_info *fi) | |
375 | { | |
376 | if (fi == NULL) | |
377 | { | |
378 | fprintf_unfiltered (file, "<NULL frame>"); | |
379 | return; | |
380 | } | |
381 | fprintf_unfiltered (file, "{"); | |
382 | fprintf_unfiltered (file, "level=%d", fi->level); | |
383 | fprintf_unfiltered (file, ","); | |
384 | fprintf_unfiltered (file, "type="); | |
c1bf6f65 AC |
385 | if (fi->unwind != NULL) |
386 | fprint_frame_type (file, fi->unwind->type); | |
387 | else | |
388 | fprintf_unfiltered (file, "<unknown>"); | |
7f78e237 AC |
389 | fprintf_unfiltered (file, ","); |
390 | fprintf_unfiltered (file, "unwind="); | |
391 | if (fi->unwind != NULL) | |
392 | gdb_print_host_address (fi->unwind, file); | |
393 | else | |
394 | fprintf_unfiltered (file, "<unknown>"); | |
395 | fprintf_unfiltered (file, ","); | |
396 | fprintf_unfiltered (file, "pc="); | |
782d47df | 397 | if (fi->next == NULL || fi->next->prev_pc.status == CC_UNKNOWN) |
7f78e237 | 398 | fprintf_unfiltered (file, "<unknown>"); |
782d47df PA |
399 | else if (fi->next->prev_pc.status == CC_VALUE) |
400 | fprintf_unfiltered (file, "%s", | |
401 | hex_string (fi->next->prev_pc.value)); | |
402 | else if (fi->next->prev_pc.status == CC_NOT_SAVED) | |
403 | val_print_not_saved (file); | |
404 | else if (fi->next->prev_pc.status == CC_UNAVAILABLE) | |
405 | val_print_unavailable (file); | |
7f78e237 AC |
406 | fprintf_unfiltered (file, ","); |
407 | fprintf_unfiltered (file, "id="); | |
408 | if (fi->this_id.p) | |
409 | fprint_frame_id (file, fi->this_id.value); | |
410 | else | |
411 | fprintf_unfiltered (file, "<unknown>"); | |
412 | fprintf_unfiltered (file, ","); | |
413 | fprintf_unfiltered (file, "func="); | |
414 | if (fi->next != NULL && fi->next->prev_func.p) | |
5af949e3 | 415 | fprintf_unfiltered (file, "%s", hex_string (fi->next->prev_func.addr)); |
7f78e237 AC |
416 | else |
417 | fprintf_unfiltered (file, "<unknown>"); | |
418 | fprintf_unfiltered (file, "}"); | |
419 | } | |
420 | ||
193facb3 JK |
421 | /* Given FRAME, return the enclosing frame as found in real frames read-in from |
422 | inferior memory. Skip any previous frames which were made up by GDB. | |
423 | Return the original frame if no immediate previous frames exist. */ | |
edb3359d DJ |
424 | |
425 | static struct frame_info * | |
193facb3 | 426 | skip_artificial_frames (struct frame_info *frame) |
edb3359d | 427 | { |
51d48146 PA |
428 | /* Note we use get_prev_frame_always, and not get_prev_frame. The |
429 | latter will truncate the frame chain, leading to this function | |
430 | unintentionally returning a null_frame_id (e.g., when the user | |
431 | sets a backtrace limit). This is safe, because as these frames | |
432 | are made up by GDB, there must be a real frame in the chain | |
433 | below. */ | |
1ab3b62c JK |
434 | while (get_frame_type (frame) == INLINE_FRAME |
435 | || get_frame_type (frame) == TAILCALL_FRAME) | |
51d48146 | 436 | frame = get_prev_frame_always (frame); |
edb3359d DJ |
437 | |
438 | return frame; | |
439 | } | |
440 | ||
2f3ef606 MM |
441 | /* See frame.h. */ |
442 | ||
443 | struct frame_info * | |
444 | skip_tailcall_frames (struct frame_info *frame) | |
445 | { | |
446 | while (get_frame_type (frame) == TAILCALL_FRAME) | |
447 | frame = get_prev_frame (frame); | |
448 | ||
449 | return frame; | |
450 | } | |
451 | ||
194cca41 PA |
452 | /* Compute the frame's uniq ID that can be used to, later, re-find the |
453 | frame. */ | |
454 | ||
455 | static void | |
456 | compute_frame_id (struct frame_info *fi) | |
457 | { | |
458 | gdb_assert (!fi->this_id.p); | |
459 | ||
460 | if (frame_debug) | |
461 | fprintf_unfiltered (gdb_stdlog, "{ compute_frame_id (fi=%d) ", | |
462 | fi->level); | |
463 | /* Find the unwinder. */ | |
464 | if (fi->unwind == NULL) | |
465 | frame_unwind_find_by_frame (fi, &fi->prologue_cache); | |
466 | /* Find THIS frame's ID. */ | |
467 | /* Default to outermost if no ID is found. */ | |
468 | fi->this_id.value = outer_frame_id; | |
469 | fi->unwind->this_id (fi, &fi->prologue_cache, &fi->this_id.value); | |
470 | gdb_assert (frame_id_p (fi->this_id.value)); | |
471 | fi->this_id.p = 1; | |
472 | if (frame_debug) | |
473 | { | |
474 | fprintf_unfiltered (gdb_stdlog, "-> "); | |
475 | fprint_frame_id (gdb_stdlog, fi->this_id.value); | |
476 | fprintf_unfiltered (gdb_stdlog, " }\n"); | |
477 | } | |
478 | } | |
479 | ||
7a424e99 | 480 | /* Return a frame uniq ID that can be used to, later, re-find the |
101dcfbe AC |
481 | frame. */ |
482 | ||
7a424e99 AC |
483 | struct frame_id |
484 | get_frame_id (struct frame_info *fi) | |
101dcfbe AC |
485 | { |
486 | if (fi == NULL) | |
b83e9eb7 JB |
487 | return null_frame_id; |
488 | ||
194cca41 | 489 | gdb_assert (fi->this_id.p); |
18adea3f | 490 | return fi->this_id.value; |
101dcfbe AC |
491 | } |
492 | ||
edb3359d DJ |
493 | struct frame_id |
494 | get_stack_frame_id (struct frame_info *next_frame) | |
495 | { | |
193facb3 | 496 | return get_frame_id (skip_artificial_frames (next_frame)); |
edb3359d DJ |
497 | } |
498 | ||
5613d8d3 | 499 | struct frame_id |
c7ce8faa | 500 | frame_unwind_caller_id (struct frame_info *next_frame) |
5613d8d3 | 501 | { |
edb3359d DJ |
502 | struct frame_info *this_frame; |
503 | ||
51d48146 PA |
504 | /* Use get_prev_frame_always, and not get_prev_frame. The latter |
505 | will truncate the frame chain, leading to this function | |
506 | unintentionally returning a null_frame_id (e.g., when a caller | |
507 | requests the frame ID of "main()"s caller. */ | |
edb3359d | 508 | |
193facb3 | 509 | next_frame = skip_artificial_frames (next_frame); |
51d48146 | 510 | this_frame = get_prev_frame_always (next_frame); |
edb3359d | 511 | if (this_frame) |
193facb3 | 512 | return get_frame_id (skip_artificial_frames (this_frame)); |
edb3359d DJ |
513 | else |
514 | return null_frame_id; | |
5613d8d3 AC |
515 | } |
516 | ||
f8904751 | 517 | const struct frame_id null_frame_id = { 0 }; /* All zeros. */ |
5ce0145d | 518 | const struct frame_id outer_frame_id = { 0, 0, 0, FID_STACK_INVALID, 0, 1, 0 }; |
7a424e99 AC |
519 | |
520 | struct frame_id | |
48c66725 JJ |
521 | frame_id_build_special (CORE_ADDR stack_addr, CORE_ADDR code_addr, |
522 | CORE_ADDR special_addr) | |
7a424e99 | 523 | { |
12b0b6de | 524 | struct frame_id id = null_frame_id; |
1c4d3f96 | 525 | |
d0a55772 | 526 | id.stack_addr = stack_addr; |
5ce0145d | 527 | id.stack_status = FID_STACK_VALID; |
d0a55772 | 528 | id.code_addr = code_addr; |
12b0b6de | 529 | id.code_addr_p = 1; |
48c66725 | 530 | id.special_addr = special_addr; |
12b0b6de | 531 | id.special_addr_p = 1; |
7a424e99 AC |
532 | return id; |
533 | } | |
534 | ||
5ce0145d PA |
535 | /* See frame.h. */ |
536 | ||
537 | struct frame_id | |
538 | frame_id_build_unavailable_stack (CORE_ADDR code_addr) | |
539 | { | |
540 | struct frame_id id = null_frame_id; | |
541 | ||
542 | id.stack_status = FID_STACK_UNAVAILABLE; | |
543 | id.code_addr = code_addr; | |
544 | id.code_addr_p = 1; | |
545 | return id; | |
546 | } | |
547 | ||
8372a7cb MM |
548 | /* See frame.h. */ |
549 | ||
550 | struct frame_id | |
551 | frame_id_build_unavailable_stack_special (CORE_ADDR code_addr, | |
552 | CORE_ADDR special_addr) | |
553 | { | |
554 | struct frame_id id = null_frame_id; | |
555 | ||
556 | id.stack_status = FID_STACK_UNAVAILABLE; | |
557 | id.code_addr = code_addr; | |
558 | id.code_addr_p = 1; | |
559 | id.special_addr = special_addr; | |
560 | id.special_addr_p = 1; | |
561 | return id; | |
562 | } | |
563 | ||
48c66725 JJ |
564 | struct frame_id |
565 | frame_id_build (CORE_ADDR stack_addr, CORE_ADDR code_addr) | |
566 | { | |
12b0b6de | 567 | struct frame_id id = null_frame_id; |
1c4d3f96 | 568 | |
12b0b6de | 569 | id.stack_addr = stack_addr; |
5ce0145d | 570 | id.stack_status = FID_STACK_VALID; |
12b0b6de UW |
571 | id.code_addr = code_addr; |
572 | id.code_addr_p = 1; | |
573 | return id; | |
574 | } | |
575 | ||
576 | struct frame_id | |
577 | frame_id_build_wild (CORE_ADDR stack_addr) | |
578 | { | |
579 | struct frame_id id = null_frame_id; | |
1c4d3f96 | 580 | |
12b0b6de | 581 | id.stack_addr = stack_addr; |
5ce0145d | 582 | id.stack_status = FID_STACK_VALID; |
12b0b6de | 583 | return id; |
48c66725 JJ |
584 | } |
585 | ||
7a424e99 AC |
586 | int |
587 | frame_id_p (struct frame_id l) | |
588 | { | |
d0a55772 | 589 | int p; |
1c4d3f96 | 590 | |
12b0b6de | 591 | /* The frame is valid iff it has a valid stack address. */ |
5ce0145d | 592 | p = l.stack_status != FID_STACK_INVALID; |
005ca36a JB |
593 | /* outer_frame_id is also valid. */ |
594 | if (!p && memcmp (&l, &outer_frame_id, sizeof (l)) == 0) | |
595 | p = 1; | |
7f78e237 AC |
596 | if (frame_debug) |
597 | { | |
598 | fprintf_unfiltered (gdb_stdlog, "{ frame_id_p (l="); | |
599 | fprint_frame_id (gdb_stdlog, l); | |
600 | fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", p); | |
601 | } | |
d0a55772 | 602 | return p; |
7a424e99 AC |
603 | } |
604 | ||
edb3359d | 605 | int |
193facb3 | 606 | frame_id_artificial_p (struct frame_id l) |
edb3359d DJ |
607 | { |
608 | if (!frame_id_p (l)) | |
609 | return 0; | |
610 | ||
193facb3 | 611 | return (l.artificial_depth != 0); |
edb3359d DJ |
612 | } |
613 | ||
7a424e99 AC |
614 | int |
615 | frame_id_eq (struct frame_id l, struct frame_id r) | |
616 | { | |
d0a55772 | 617 | int eq; |
1c4d3f96 | 618 | |
5ce0145d PA |
619 | if (l.stack_status == FID_STACK_INVALID && l.special_addr_p |
620 | && r.stack_status == FID_STACK_INVALID && r.special_addr_p) | |
005ca36a JB |
621 | /* The outermost frame marker is equal to itself. This is the |
622 | dodgy thing about outer_frame_id, since between execution steps | |
623 | we might step into another function - from which we can't | |
624 | unwind either. More thought required to get rid of | |
625 | outer_frame_id. */ | |
626 | eq = 1; | |
5ce0145d | 627 | else if (l.stack_status == FID_STACK_INVALID |
f0d4ba1f | 628 | || r.stack_status == FID_STACK_INVALID) |
12b0b6de UW |
629 | /* Like a NaN, if either ID is invalid, the result is false. |
630 | Note that a frame ID is invalid iff it is the null frame ID. */ | |
d0a55772 | 631 | eq = 0; |
5ce0145d | 632 | else if (l.stack_status != r.stack_status || l.stack_addr != r.stack_addr) |
d0a55772 AC |
633 | /* If .stack addresses are different, the frames are different. */ |
634 | eq = 0; | |
edb3359d DJ |
635 | else if (l.code_addr_p && r.code_addr_p && l.code_addr != r.code_addr) |
636 | /* An invalid code addr is a wild card. If .code addresses are | |
637 | different, the frames are different. */ | |
48c66725 | 638 | eq = 0; |
edb3359d DJ |
639 | else if (l.special_addr_p && r.special_addr_p |
640 | && l.special_addr != r.special_addr) | |
641 | /* An invalid special addr is a wild card (or unused). Otherwise | |
642 | if special addresses are different, the frames are different. */ | |
643 | eq = 0; | |
193facb3 JK |
644 | else if (l.artificial_depth != r.artificial_depth) |
645 | /* If artifical depths are different, the frames must be different. */ | |
edb3359d DJ |
646 | eq = 0; |
647 | else | |
48c66725 | 648 | /* Frames are equal. */ |
d0a55772 | 649 | eq = 1; |
edb3359d | 650 | |
7f78e237 AC |
651 | if (frame_debug) |
652 | { | |
653 | fprintf_unfiltered (gdb_stdlog, "{ frame_id_eq (l="); | |
654 | fprint_frame_id (gdb_stdlog, l); | |
655 | fprintf_unfiltered (gdb_stdlog, ",r="); | |
656 | fprint_frame_id (gdb_stdlog, r); | |
657 | fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", eq); | |
658 | } | |
d0a55772 | 659 | return eq; |
7a424e99 AC |
660 | } |
661 | ||
a45ae3ed UW |
662 | /* Safety net to check whether frame ID L should be inner to |
663 | frame ID R, according to their stack addresses. | |
664 | ||
665 | This method cannot be used to compare arbitrary frames, as the | |
666 | ranges of valid stack addresses may be discontiguous (e.g. due | |
667 | to sigaltstack). | |
668 | ||
669 | However, it can be used as safety net to discover invalid frame | |
0963b4bd | 670 | IDs in certain circumstances. Assuming that NEXT is the immediate |
f06eadd9 | 671 | inner frame to THIS and that NEXT and THIS are both NORMAL frames: |
a45ae3ed | 672 | |
f06eadd9 JB |
673 | * The stack address of NEXT must be inner-than-or-equal to the stack |
674 | address of THIS. | |
a45ae3ed UW |
675 | |
676 | Therefore, if frame_id_inner (THIS, NEXT) holds, some unwind | |
677 | error has occurred. | |
678 | ||
f06eadd9 JB |
679 | * If NEXT and THIS have different stack addresses, no other frame |
680 | in the frame chain may have a stack address in between. | |
a45ae3ed UW |
681 | |
682 | Therefore, if frame_id_inner (TEST, THIS) holds, but | |
683 | frame_id_inner (TEST, NEXT) does not hold, TEST cannot refer | |
f06eadd9 JB |
684 | to a valid frame in the frame chain. |
685 | ||
686 | The sanity checks above cannot be performed when a SIGTRAMP frame | |
687 | is involved, because signal handlers might be executed on a different | |
688 | stack than the stack used by the routine that caused the signal | |
689 | to be raised. This can happen for instance when a thread exceeds | |
0963b4bd | 690 | its maximum stack size. In this case, certain compilers implement |
f06eadd9 JB |
691 | a stack overflow strategy that cause the handler to be run on a |
692 | different stack. */ | |
a45ae3ed UW |
693 | |
694 | static int | |
09a7aba8 | 695 | frame_id_inner (struct gdbarch *gdbarch, struct frame_id l, struct frame_id r) |
7a424e99 | 696 | { |
d0a55772 | 697 | int inner; |
1c4d3f96 | 698 | |
5ce0145d PA |
699 | if (l.stack_status != FID_STACK_VALID || r.stack_status != FID_STACK_VALID) |
700 | /* Like NaN, any operation involving an invalid ID always fails. | |
701 | Likewise if either ID has an unavailable stack address. */ | |
d0a55772 | 702 | inner = 0; |
193facb3 | 703 | else if (l.artificial_depth > r.artificial_depth |
edb3359d DJ |
704 | && l.stack_addr == r.stack_addr |
705 | && l.code_addr_p == r.code_addr_p | |
706 | && l.special_addr_p == r.special_addr_p | |
707 | && l.special_addr == r.special_addr) | |
708 | { | |
709 | /* Same function, different inlined functions. */ | |
3977b71f | 710 | const struct block *lb, *rb; |
edb3359d DJ |
711 | |
712 | gdb_assert (l.code_addr_p && r.code_addr_p); | |
713 | ||
714 | lb = block_for_pc (l.code_addr); | |
715 | rb = block_for_pc (r.code_addr); | |
716 | ||
717 | if (lb == NULL || rb == NULL) | |
718 | /* Something's gone wrong. */ | |
719 | inner = 0; | |
720 | else | |
721 | /* This will return true if LB and RB are the same block, or | |
722 | if the block with the smaller depth lexically encloses the | |
723 | block with the greater depth. */ | |
724 | inner = contained_in (lb, rb); | |
725 | } | |
d0a55772 AC |
726 | else |
727 | /* Only return non-zero when strictly inner than. Note that, per | |
728 | comment in "frame.h", there is some fuzz here. Frameless | |
729 | functions are not strictly inner than (same .stack but | |
48c66725 | 730 | different .code and/or .special address). */ |
09a7aba8 | 731 | inner = gdbarch_inner_than (gdbarch, l.stack_addr, r.stack_addr); |
7f78e237 AC |
732 | if (frame_debug) |
733 | { | |
734 | fprintf_unfiltered (gdb_stdlog, "{ frame_id_inner (l="); | |
735 | fprint_frame_id (gdb_stdlog, l); | |
736 | fprintf_unfiltered (gdb_stdlog, ",r="); | |
737 | fprint_frame_id (gdb_stdlog, r); | |
738 | fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", inner); | |
739 | } | |
d0a55772 | 740 | return inner; |
7a424e99 AC |
741 | } |
742 | ||
101dcfbe AC |
743 | struct frame_info * |
744 | frame_find_by_id (struct frame_id id) | |
745 | { | |
a45ae3ed | 746 | struct frame_info *frame, *prev_frame; |
101dcfbe AC |
747 | |
748 | /* ZERO denotes the null frame, let the caller decide what to do | |
749 | about it. Should it instead return get_current_frame()? */ | |
7a424e99 | 750 | if (!frame_id_p (id)) |
101dcfbe AC |
751 | return NULL; |
752 | ||
b83e9eb7 JB |
753 | /* Try using the frame stash first. Finding it there removes the need |
754 | to perform the search by looping over all frames, which can be very | |
755 | CPU-intensive if the number of frames is very high (the loop is O(n) | |
756 | and get_prev_frame performs a series of checks that are relatively | |
757 | expensive). This optimization is particularly useful when this function | |
758 | is called from another function (such as value_fetch_lazy, case | |
759 | VALUE_LVAL (val) == lval_register) which already loops over all frames, | |
760 | making the overall behavior O(n^2). */ | |
761 | frame = frame_stash_find (id); | |
762 | if (frame) | |
763 | return frame; | |
764 | ||
a45ae3ed | 765 | for (frame = get_current_frame (); ; frame = prev_frame) |
101dcfbe | 766 | { |
fe978cb0 | 767 | struct frame_id self = get_frame_id (frame); |
bb9bcb69 | 768 | |
fe978cb0 | 769 | if (frame_id_eq (id, self)) |
7a424e99 AC |
770 | /* An exact match. */ |
771 | return frame; | |
a45ae3ed UW |
772 | |
773 | prev_frame = get_prev_frame (frame); | |
774 | if (!prev_frame) | |
775 | return NULL; | |
776 | ||
777 | /* As a safety net to avoid unnecessary backtracing while trying | |
778 | to find an invalid ID, we check for a common situation where | |
779 | we can detect from comparing stack addresses that no other | |
780 | frame in the current frame chain can have this ID. See the | |
781 | comment at frame_id_inner for details. */ | |
782 | if (get_frame_type (frame) == NORMAL_FRAME | |
fe978cb0 | 783 | && !frame_id_inner (get_frame_arch (frame), id, self) |
a45ae3ed UW |
784 | && frame_id_inner (get_frame_arch (prev_frame), id, |
785 | get_frame_id (prev_frame))) | |
101dcfbe | 786 | return NULL; |
101dcfbe AC |
787 | } |
788 | return NULL; | |
789 | } | |
790 | ||
782d47df PA |
791 | static CORE_ADDR |
792 | frame_unwind_pc (struct frame_info *this_frame) | |
f18c5a73 | 793 | { |
782d47df | 794 | if (this_frame->prev_pc.status == CC_UNKNOWN) |
f18c5a73 | 795 | { |
36f15f55 | 796 | if (gdbarch_unwind_pc_p (frame_unwind_arch (this_frame))) |
12cc2063 | 797 | { |
e3eebbd7 PA |
798 | struct gdbarch *prev_gdbarch; |
799 | CORE_ADDR pc = 0; | |
492d29ea | 800 | int pc_p = 0; |
e3eebbd7 | 801 | |
12cc2063 AC |
802 | /* The right way. The `pure' way. The one true way. This |
803 | method depends solely on the register-unwind code to | |
804 | determine the value of registers in THIS frame, and hence | |
805 | the value of this frame's PC (resume address). A typical | |
806 | implementation is no more than: | |
807 | ||
808 | frame_unwind_register (this_frame, ISA_PC_REGNUM, buf); | |
af1342ab | 809 | return extract_unsigned_integer (buf, size of ISA_PC_REGNUM); |
12cc2063 AC |
810 | |
811 | Note: this method is very heavily dependent on a correct | |
812 | register-unwind implementation, it pays to fix that | |
813 | method first; this method is frame type agnostic, since | |
814 | it only deals with register values, it works with any | |
815 | frame. This is all in stark contrast to the old | |
816 | FRAME_SAVED_PC which would try to directly handle all the | |
817 | different ways that a PC could be unwound. */ | |
e3eebbd7 PA |
818 | prev_gdbarch = frame_unwind_arch (this_frame); |
819 | ||
492d29ea | 820 | TRY |
e3eebbd7 PA |
821 | { |
822 | pc = gdbarch_unwind_pc (prev_gdbarch, this_frame); | |
492d29ea | 823 | pc_p = 1; |
e3eebbd7 | 824 | } |
492d29ea | 825 | CATCH (ex, RETURN_MASK_ERROR) |
e3eebbd7 | 826 | { |
782d47df PA |
827 | if (ex.error == NOT_AVAILABLE_ERROR) |
828 | { | |
829 | this_frame->prev_pc.status = CC_UNAVAILABLE; | |
830 | ||
831 | if (frame_debug) | |
832 | fprintf_unfiltered (gdb_stdlog, | |
833 | "{ frame_unwind_pc (this_frame=%d)" | |
834 | " -> <unavailable> }\n", | |
835 | this_frame->level); | |
836 | } | |
837 | else if (ex.error == OPTIMIZED_OUT_ERROR) | |
838 | { | |
839 | this_frame->prev_pc.status = CC_NOT_SAVED; | |
840 | ||
841 | if (frame_debug) | |
842 | fprintf_unfiltered (gdb_stdlog, | |
843 | "{ frame_unwind_pc (this_frame=%d)" | |
844 | " -> <not saved> }\n", | |
845 | this_frame->level); | |
846 | } | |
847 | else | |
848 | throw_exception (ex); | |
e3eebbd7 | 849 | } |
492d29ea PA |
850 | END_CATCH |
851 | ||
852 | if (pc_p) | |
e3eebbd7 PA |
853 | { |
854 | this_frame->prev_pc.value = pc; | |
782d47df | 855 | this_frame->prev_pc.status = CC_VALUE; |
e3eebbd7 PA |
856 | if (frame_debug) |
857 | fprintf_unfiltered (gdb_stdlog, | |
858 | "{ frame_unwind_pc (this_frame=%d) " | |
859 | "-> %s }\n", | |
860 | this_frame->level, | |
861 | hex_string (this_frame->prev_pc.value)); | |
862 | } | |
12cc2063 | 863 | } |
12cc2063 | 864 | else |
e2e0b3e5 | 865 | internal_error (__FILE__, __LINE__, _("No unwind_pc method")); |
f18c5a73 | 866 | } |
e3eebbd7 | 867 | |
782d47df PA |
868 | if (this_frame->prev_pc.status == CC_VALUE) |
869 | return this_frame->prev_pc.value; | |
870 | else if (this_frame->prev_pc.status == CC_UNAVAILABLE) | |
e3eebbd7 | 871 | throw_error (NOT_AVAILABLE_ERROR, _("PC not available")); |
782d47df PA |
872 | else if (this_frame->prev_pc.status == CC_NOT_SAVED) |
873 | throw_error (OPTIMIZED_OUT_ERROR, _("PC not saved")); | |
e3eebbd7 | 874 | else |
782d47df PA |
875 | internal_error (__FILE__, __LINE__, |
876 | "unexpected prev_pc status: %d", | |
877 | (int) this_frame->prev_pc.status); | |
f18c5a73 AC |
878 | } |
879 | ||
edb3359d DJ |
880 | CORE_ADDR |
881 | frame_unwind_caller_pc (struct frame_info *this_frame) | |
882 | { | |
193facb3 | 883 | return frame_unwind_pc (skip_artificial_frames (this_frame)); |
edb3359d DJ |
884 | } |
885 | ||
e3eebbd7 PA |
886 | int |
887 | get_frame_func_if_available (struct frame_info *this_frame, CORE_ADDR *pc) | |
be41e9f4 | 888 | { |
ef02daa9 DJ |
889 | struct frame_info *next_frame = this_frame->next; |
890 | ||
891 | if (!next_frame->prev_func.p) | |
be41e9f4 | 892 | { |
e3eebbd7 PA |
893 | CORE_ADDR addr_in_block; |
894 | ||
57bfe177 AC |
895 | /* Make certain that this, and not the adjacent, function is |
896 | found. */ | |
e3eebbd7 PA |
897 | if (!get_frame_address_in_block_if_available (this_frame, &addr_in_block)) |
898 | { | |
899 | next_frame->prev_func.p = -1; | |
900 | if (frame_debug) | |
901 | fprintf_unfiltered (gdb_stdlog, | |
902 | "{ get_frame_func (this_frame=%d)" | |
903 | " -> unavailable }\n", | |
904 | this_frame->level); | |
905 | } | |
906 | else | |
907 | { | |
908 | next_frame->prev_func.p = 1; | |
909 | next_frame->prev_func.addr = get_pc_function_start (addr_in_block); | |
910 | if (frame_debug) | |
911 | fprintf_unfiltered (gdb_stdlog, | |
912 | "{ get_frame_func (this_frame=%d) -> %s }\n", | |
913 | this_frame->level, | |
914 | hex_string (next_frame->prev_func.addr)); | |
915 | } | |
be41e9f4 | 916 | } |
e3eebbd7 PA |
917 | |
918 | if (next_frame->prev_func.p < 0) | |
919 | { | |
920 | *pc = -1; | |
921 | return 0; | |
922 | } | |
923 | else | |
924 | { | |
925 | *pc = next_frame->prev_func.addr; | |
926 | return 1; | |
927 | } | |
928 | } | |
929 | ||
930 | CORE_ADDR | |
931 | get_frame_func (struct frame_info *this_frame) | |
932 | { | |
933 | CORE_ADDR pc; | |
934 | ||
935 | if (!get_frame_func_if_available (this_frame, &pc)) | |
936 | throw_error (NOT_AVAILABLE_ERROR, _("PC not available")); | |
937 | ||
938 | return pc; | |
be41e9f4 AC |
939 | } |
940 | ||
05d1431c | 941 | static enum register_status |
2d522557 | 942 | do_frame_register_read (void *src, int regnum, gdb_byte *buf) |
7a25a7c1 | 943 | { |
9a3c8263 | 944 | if (!deprecated_frame_register_read ((struct frame_info *) src, regnum, buf)) |
05d1431c PA |
945 | return REG_UNAVAILABLE; |
946 | else | |
947 | return REG_VALID; | |
7a25a7c1 AC |
948 | } |
949 | ||
a81dcb05 AC |
950 | struct regcache * |
951 | frame_save_as_regcache (struct frame_info *this_frame) | |
952 | { | |
d37346f0 DJ |
953 | struct address_space *aspace = get_frame_address_space (this_frame); |
954 | struct regcache *regcache = regcache_xmalloc (get_frame_arch (this_frame), | |
955 | aspace); | |
a81dcb05 | 956 | struct cleanup *cleanups = make_cleanup_regcache_xfree (regcache); |
1c4d3f96 | 957 | |
a81dcb05 AC |
958 | regcache_save (regcache, do_frame_register_read, this_frame); |
959 | discard_cleanups (cleanups); | |
960 | return regcache; | |
961 | } | |
962 | ||
dbe9fe58 | 963 | void |
7a25a7c1 AC |
964 | frame_pop (struct frame_info *this_frame) |
965 | { | |
348473d5 NF |
966 | struct frame_info *prev_frame; |
967 | struct regcache *scratch; | |
968 | struct cleanup *cleanups; | |
969 | ||
b89667eb DE |
970 | if (get_frame_type (this_frame) == DUMMY_FRAME) |
971 | { | |
972 | /* Popping a dummy frame involves restoring more than just registers. | |
973 | dummy_frame_pop does all the work. */ | |
b67a2c6f | 974 | dummy_frame_pop (get_frame_id (this_frame), inferior_ptid); |
b89667eb DE |
975 | return; |
976 | } | |
977 | ||
348473d5 | 978 | /* Ensure that we have a frame to pop to. */ |
51d48146 | 979 | prev_frame = get_prev_frame_always (this_frame); |
348473d5 NF |
980 | |
981 | if (!prev_frame) | |
982 | error (_("Cannot pop the initial frame.")); | |
983 | ||
1ab3b62c JK |
984 | /* Ignore TAILCALL_FRAME type frames, they were executed already before |
985 | entering THISFRAME. */ | |
2f3ef606 | 986 | prev_frame = skip_tailcall_frames (prev_frame); |
1ab3b62c | 987 | |
c1bf6f65 AC |
988 | /* Make a copy of all the register values unwound from this frame. |
989 | Save them in a scratch buffer so that there isn't a race between | |
594f7785 | 990 | trying to extract the old values from the current regcache while |
c1bf6f65 | 991 | at the same time writing new values into that same cache. */ |
348473d5 NF |
992 | scratch = frame_save_as_regcache (prev_frame); |
993 | cleanups = make_cleanup_regcache_xfree (scratch); | |
c1bf6f65 AC |
994 | |
995 | /* FIXME: cagney/2003-03-16: It should be possible to tell the | |
996 | target's register cache that it is about to be hit with a burst | |
997 | register transfer and that the sequence of register writes should | |
998 | be batched. The pair target_prepare_to_store() and | |
999 | target_store_registers() kind of suggest this functionality. | |
1000 | Unfortunately, they don't implement it. Their lack of a formal | |
1001 | definition can lead to targets writing back bogus values | |
1002 | (arguably a bug in the target code mind). */ | |
1003 | /* Now copy those saved registers into the current regcache. | |
1004 | Here, regcache_cpy() calls regcache_restore(). */ | |
594f7785 | 1005 | regcache_cpy (get_current_regcache (), scratch); |
c1bf6f65 | 1006 | do_cleanups (cleanups); |
7a25a7c1 | 1007 | |
7a25a7c1 AC |
1008 | /* We've made right mess of GDB's local state, just discard |
1009 | everything. */ | |
35f196d9 | 1010 | reinit_frame_cache (); |
dbe9fe58 | 1011 | } |
c689142b | 1012 | |
4f460812 AC |
1013 | void |
1014 | frame_register_unwind (struct frame_info *frame, int regnum, | |
0fdb4f18 PA |
1015 | int *optimizedp, int *unavailablep, |
1016 | enum lval_type *lvalp, CORE_ADDR *addrp, | |
1017 | int *realnump, gdb_byte *bufferp) | |
4f460812 | 1018 | { |
669fac23 | 1019 | struct value *value; |
7f78e237 | 1020 | |
4f460812 AC |
1021 | /* Require all but BUFFERP to be valid. A NULL BUFFERP indicates |
1022 | that the value proper does not need to be fetched. */ | |
1023 | gdb_assert (optimizedp != NULL); | |
1024 | gdb_assert (lvalp != NULL); | |
1025 | gdb_assert (addrp != NULL); | |
1026 | gdb_assert (realnump != NULL); | |
1027 | /* gdb_assert (bufferp != NULL); */ | |
1028 | ||
669fac23 | 1029 | value = frame_unwind_register_value (frame, regnum); |
4f460812 | 1030 | |
669fac23 | 1031 | gdb_assert (value != NULL); |
c50901fd | 1032 | |
669fac23 | 1033 | *optimizedp = value_optimized_out (value); |
0fdb4f18 | 1034 | *unavailablep = !value_entirely_available (value); |
669fac23 | 1035 | *lvalp = VALUE_LVAL (value); |
42ae5230 | 1036 | *addrp = value_address (value); |
669fac23 | 1037 | *realnump = VALUE_REGNUM (value); |
6dc42492 | 1038 | |
0fdb4f18 PA |
1039 | if (bufferp) |
1040 | { | |
1041 | if (!*optimizedp && !*unavailablep) | |
1042 | memcpy (bufferp, value_contents_all (value), | |
1043 | TYPE_LENGTH (value_type (value))); | |
1044 | else | |
1045 | memset (bufferp, 0, TYPE_LENGTH (value_type (value))); | |
1046 | } | |
669fac23 DJ |
1047 | |
1048 | /* Dispose of the new value. This prevents watchpoints from | |
1049 | trying to watch the saved frame pointer. */ | |
1050 | release_value (value); | |
1051 | value_free (value); | |
4f460812 AC |
1052 | } |
1053 | ||
a216a322 AC |
1054 | void |
1055 | frame_register (struct frame_info *frame, int regnum, | |
0fdb4f18 | 1056 | int *optimizedp, int *unavailablep, enum lval_type *lvalp, |
10c42a71 | 1057 | CORE_ADDR *addrp, int *realnump, gdb_byte *bufferp) |
a216a322 AC |
1058 | { |
1059 | /* Require all but BUFFERP to be valid. A NULL BUFFERP indicates | |
1060 | that the value proper does not need to be fetched. */ | |
1061 | gdb_assert (optimizedp != NULL); | |
1062 | gdb_assert (lvalp != NULL); | |
1063 | gdb_assert (addrp != NULL); | |
1064 | gdb_assert (realnump != NULL); | |
1065 | /* gdb_assert (bufferp != NULL); */ | |
1066 | ||
a94dd1fd AC |
1067 | /* Obtain the register value by unwinding the register from the next |
1068 | (more inner frame). */ | |
1069 | gdb_assert (frame != NULL && frame->next != NULL); | |
0fdb4f18 PA |
1070 | frame_register_unwind (frame->next, regnum, optimizedp, unavailablep, |
1071 | lvalp, addrp, realnump, bufferp); | |
a216a322 AC |
1072 | } |
1073 | ||
135c175f | 1074 | void |
10c42a71 | 1075 | frame_unwind_register (struct frame_info *frame, int regnum, gdb_byte *buf) |
135c175f AC |
1076 | { |
1077 | int optimized; | |
0fdb4f18 | 1078 | int unavailable; |
135c175f AC |
1079 | CORE_ADDR addr; |
1080 | int realnum; | |
1081 | enum lval_type lval; | |
1c4d3f96 | 1082 | |
0fdb4f18 PA |
1083 | frame_register_unwind (frame, regnum, &optimized, &unavailable, |
1084 | &lval, &addr, &realnum, buf); | |
8fbca658 PA |
1085 | |
1086 | if (optimized) | |
710409a2 PA |
1087 | throw_error (OPTIMIZED_OUT_ERROR, |
1088 | _("Register %d was not saved"), regnum); | |
8fbca658 PA |
1089 | if (unavailable) |
1090 | throw_error (NOT_AVAILABLE_ERROR, | |
1091 | _("Register %d is not available"), regnum); | |
5b181d62 AC |
1092 | } |
1093 | ||
f0e7d0e8 AC |
1094 | void |
1095 | get_frame_register (struct frame_info *frame, | |
10c42a71 | 1096 | int regnum, gdb_byte *buf) |
f0e7d0e8 AC |
1097 | { |
1098 | frame_unwind_register (frame->next, regnum, buf); | |
1099 | } | |
1100 | ||
669fac23 DJ |
1101 | struct value * |
1102 | frame_unwind_register_value (struct frame_info *frame, int regnum) | |
1103 | { | |
36f15f55 | 1104 | struct gdbarch *gdbarch; |
669fac23 DJ |
1105 | struct value *value; |
1106 | ||
1107 | gdb_assert (frame != NULL); | |
36f15f55 | 1108 | gdbarch = frame_unwind_arch (frame); |
669fac23 DJ |
1109 | |
1110 | if (frame_debug) | |
1111 | { | |
3e43a32a MS |
1112 | fprintf_unfiltered (gdb_stdlog, |
1113 | "{ frame_unwind_register_value " | |
1114 | "(frame=%d,regnum=%d(%s),...) ", | |
669fac23 | 1115 | frame->level, regnum, |
36f15f55 | 1116 | user_reg_map_regnum_to_name (gdbarch, regnum)); |
669fac23 DJ |
1117 | } |
1118 | ||
1119 | /* Find the unwinder. */ | |
1120 | if (frame->unwind == NULL) | |
9f9a8002 | 1121 | frame_unwind_find_by_frame (frame, &frame->prologue_cache); |
669fac23 DJ |
1122 | |
1123 | /* Ask this frame to unwind its register. */ | |
1124 | value = frame->unwind->prev_register (frame, &frame->prologue_cache, regnum); | |
1125 | ||
1126 | if (frame_debug) | |
1127 | { | |
1128 | fprintf_unfiltered (gdb_stdlog, "->"); | |
1129 | if (value_optimized_out (value)) | |
f6c01fc5 AB |
1130 | { |
1131 | fprintf_unfiltered (gdb_stdlog, " "); | |
1132 | val_print_optimized_out (value, gdb_stdlog); | |
1133 | } | |
669fac23 DJ |
1134 | else |
1135 | { | |
1136 | if (VALUE_LVAL (value) == lval_register) | |
1137 | fprintf_unfiltered (gdb_stdlog, " register=%d", | |
1138 | VALUE_REGNUM (value)); | |
1139 | else if (VALUE_LVAL (value) == lval_memory) | |
5af949e3 UW |
1140 | fprintf_unfiltered (gdb_stdlog, " address=%s", |
1141 | paddress (gdbarch, | |
1142 | value_address (value))); | |
669fac23 DJ |
1143 | else |
1144 | fprintf_unfiltered (gdb_stdlog, " computed"); | |
1145 | ||
1146 | if (value_lazy (value)) | |
1147 | fprintf_unfiltered (gdb_stdlog, " lazy"); | |
1148 | else | |
1149 | { | |
1150 | int i; | |
1151 | const gdb_byte *buf = value_contents (value); | |
1152 | ||
1153 | fprintf_unfiltered (gdb_stdlog, " bytes="); | |
1154 | fprintf_unfiltered (gdb_stdlog, "["); | |
36f15f55 | 1155 | for (i = 0; i < register_size (gdbarch, regnum); i++) |
669fac23 DJ |
1156 | fprintf_unfiltered (gdb_stdlog, "%02x", buf[i]); |
1157 | fprintf_unfiltered (gdb_stdlog, "]"); | |
1158 | } | |
1159 | } | |
1160 | ||
1161 | fprintf_unfiltered (gdb_stdlog, " }\n"); | |
1162 | } | |
1163 | ||
1164 | return value; | |
1165 | } | |
1166 | ||
1167 | struct value * | |
1168 | get_frame_register_value (struct frame_info *frame, int regnum) | |
1169 | { | |
1170 | return frame_unwind_register_value (frame->next, regnum); | |
1171 | } | |
1172 | ||
f0e7d0e8 AC |
1173 | LONGEST |
1174 | frame_unwind_register_signed (struct frame_info *frame, int regnum) | |
1175 | { | |
e17a4113 UW |
1176 | struct gdbarch *gdbarch = frame_unwind_arch (frame); |
1177 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); | |
1178 | int size = register_size (gdbarch, regnum); | |
10c42a71 | 1179 | gdb_byte buf[MAX_REGISTER_SIZE]; |
1c4d3f96 | 1180 | |
f0e7d0e8 | 1181 | frame_unwind_register (frame, regnum, buf); |
e17a4113 | 1182 | return extract_signed_integer (buf, size, byte_order); |
f0e7d0e8 AC |
1183 | } |
1184 | ||
1185 | LONGEST | |
1186 | get_frame_register_signed (struct frame_info *frame, int regnum) | |
1187 | { | |
1188 | return frame_unwind_register_signed (frame->next, regnum); | |
1189 | } | |
1190 | ||
1191 | ULONGEST | |
1192 | frame_unwind_register_unsigned (struct frame_info *frame, int regnum) | |
1193 | { | |
e17a4113 UW |
1194 | struct gdbarch *gdbarch = frame_unwind_arch (frame); |
1195 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); | |
1196 | int size = register_size (gdbarch, regnum); | |
10c42a71 | 1197 | gdb_byte buf[MAX_REGISTER_SIZE]; |
1c4d3f96 | 1198 | |
f0e7d0e8 | 1199 | frame_unwind_register (frame, regnum, buf); |
e17a4113 | 1200 | return extract_unsigned_integer (buf, size, byte_order); |
f0e7d0e8 AC |
1201 | } |
1202 | ||
1203 | ULONGEST | |
1204 | get_frame_register_unsigned (struct frame_info *frame, int regnum) | |
1205 | { | |
1206 | return frame_unwind_register_unsigned (frame->next, regnum); | |
1207 | } | |
1208 | ||
ad5f7d6e PA |
1209 | int |
1210 | read_frame_register_unsigned (struct frame_info *frame, int regnum, | |
1211 | ULONGEST *val) | |
1212 | { | |
1213 | struct value *regval = get_frame_register_value (frame, regnum); | |
1214 | ||
1215 | if (!value_optimized_out (regval) | |
1216 | && value_entirely_available (regval)) | |
1217 | { | |
1218 | struct gdbarch *gdbarch = get_frame_arch (frame); | |
1219 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); | |
1220 | int size = register_size (gdbarch, VALUE_REGNUM (regval)); | |
1221 | ||
1222 | *val = extract_unsigned_integer (value_contents (regval), size, byte_order); | |
1223 | return 1; | |
1224 | } | |
1225 | ||
1226 | return 0; | |
1227 | } | |
1228 | ||
ff2e87ac | 1229 | void |
10c42a71 AC |
1230 | put_frame_register (struct frame_info *frame, int regnum, |
1231 | const gdb_byte *buf) | |
ff2e87ac AC |
1232 | { |
1233 | struct gdbarch *gdbarch = get_frame_arch (frame); | |
1234 | int realnum; | |
1235 | int optim; | |
0fdb4f18 | 1236 | int unavail; |
ff2e87ac AC |
1237 | enum lval_type lval; |
1238 | CORE_ADDR addr; | |
1c4d3f96 | 1239 | |
0fdb4f18 PA |
1240 | frame_register (frame, regnum, &optim, &unavail, |
1241 | &lval, &addr, &realnum, NULL); | |
ff2e87ac | 1242 | if (optim) |
901461f8 | 1243 | error (_("Attempt to assign to a register that was not saved.")); |
ff2e87ac AC |
1244 | switch (lval) |
1245 | { | |
1246 | case lval_memory: | |
1247 | { | |
954b50b3 | 1248 | write_memory (addr, buf, register_size (gdbarch, regnum)); |
ff2e87ac AC |
1249 | break; |
1250 | } | |
1251 | case lval_register: | |
594f7785 | 1252 | regcache_cooked_write (get_current_regcache (), realnum, buf); |
ff2e87ac AC |
1253 | break; |
1254 | default: | |
8a3fe4f8 | 1255 | error (_("Attempt to assign to an unmodifiable value.")); |
ff2e87ac AC |
1256 | } |
1257 | } | |
1258 | ||
b2c7d45a JB |
1259 | /* This function is deprecated. Use get_frame_register_value instead, |
1260 | which provides more accurate information. | |
d65fe839 | 1261 | |
cda5a58a | 1262 | Find and return the value of REGNUM for the specified stack frame. |
5bc602c7 | 1263 | The number of bytes copied is REGISTER_SIZE (REGNUM). |
d65fe839 | 1264 | |
cda5a58a | 1265 | Returns 0 if the register value could not be found. */ |
d65fe839 | 1266 | |
cda5a58a | 1267 | int |
ca9d61b9 | 1268 | deprecated_frame_register_read (struct frame_info *frame, int regnum, |
10c42a71 | 1269 | gdb_byte *myaddr) |
d65fe839 | 1270 | { |
a216a322 | 1271 | int optimized; |
0fdb4f18 | 1272 | int unavailable; |
a216a322 AC |
1273 | enum lval_type lval; |
1274 | CORE_ADDR addr; | |
1275 | int realnum; | |
1c4d3f96 | 1276 | |
0fdb4f18 PA |
1277 | frame_register (frame, regnum, &optimized, &unavailable, |
1278 | &lval, &addr, &realnum, myaddr); | |
d65fe839 | 1279 | |
0fdb4f18 | 1280 | return !optimized && !unavailable; |
d65fe839 | 1281 | } |
e36180d7 | 1282 | |
00fa51f6 UW |
1283 | int |
1284 | get_frame_register_bytes (struct frame_info *frame, int regnum, | |
8dccd430 PA |
1285 | CORE_ADDR offset, int len, gdb_byte *myaddr, |
1286 | int *optimizedp, int *unavailablep) | |
00fa51f6 UW |
1287 | { |
1288 | struct gdbarch *gdbarch = get_frame_arch (frame); | |
3f27f2a4 AS |
1289 | int i; |
1290 | int maxsize; | |
68e007ca | 1291 | int numregs; |
00fa51f6 UW |
1292 | |
1293 | /* Skip registers wholly inside of OFFSET. */ | |
1294 | while (offset >= register_size (gdbarch, regnum)) | |
1295 | { | |
1296 | offset -= register_size (gdbarch, regnum); | |
1297 | regnum++; | |
1298 | } | |
1299 | ||
26fae1d6 AS |
1300 | /* Ensure that we will not read beyond the end of the register file. |
1301 | This can only ever happen if the debug information is bad. */ | |
3f27f2a4 | 1302 | maxsize = -offset; |
68e007ca AS |
1303 | numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch); |
1304 | for (i = regnum; i < numregs; i++) | |
3f27f2a4 AS |
1305 | { |
1306 | int thissize = register_size (gdbarch, i); | |
bb9bcb69 | 1307 | |
3f27f2a4 | 1308 | if (thissize == 0) |
26fae1d6 | 1309 | break; /* This register is not available on this architecture. */ |
3f27f2a4 AS |
1310 | maxsize += thissize; |
1311 | } | |
1312 | if (len > maxsize) | |
8dccd430 PA |
1313 | error (_("Bad debug information detected: " |
1314 | "Attempt to read %d bytes from registers."), len); | |
3f27f2a4 | 1315 | |
00fa51f6 UW |
1316 | /* Copy the data. */ |
1317 | while (len > 0) | |
1318 | { | |
1319 | int curr_len = register_size (gdbarch, regnum) - offset; | |
bb9bcb69 | 1320 | |
00fa51f6 UW |
1321 | if (curr_len > len) |
1322 | curr_len = len; | |
1323 | ||
1324 | if (curr_len == register_size (gdbarch, regnum)) | |
1325 | { | |
8dccd430 PA |
1326 | enum lval_type lval; |
1327 | CORE_ADDR addr; | |
1328 | int realnum; | |
1329 | ||
1330 | frame_register (frame, regnum, optimizedp, unavailablep, | |
1331 | &lval, &addr, &realnum, myaddr); | |
1332 | if (*optimizedp || *unavailablep) | |
00fa51f6 UW |
1333 | return 0; |
1334 | } | |
1335 | else | |
1336 | { | |
1337 | gdb_byte buf[MAX_REGISTER_SIZE]; | |
8dccd430 PA |
1338 | enum lval_type lval; |
1339 | CORE_ADDR addr; | |
1340 | int realnum; | |
bb9bcb69 | 1341 | |
8dccd430 PA |
1342 | frame_register (frame, regnum, optimizedp, unavailablep, |
1343 | &lval, &addr, &realnum, buf); | |
1344 | if (*optimizedp || *unavailablep) | |
00fa51f6 UW |
1345 | return 0; |
1346 | memcpy (myaddr, buf + offset, curr_len); | |
1347 | } | |
1348 | ||
765f065a | 1349 | myaddr += curr_len; |
00fa51f6 UW |
1350 | len -= curr_len; |
1351 | offset = 0; | |
1352 | regnum++; | |
1353 | } | |
1354 | ||
8dccd430 PA |
1355 | *optimizedp = 0; |
1356 | *unavailablep = 0; | |
00fa51f6 UW |
1357 | return 1; |
1358 | } | |
1359 | ||
1360 | void | |
1361 | put_frame_register_bytes (struct frame_info *frame, int regnum, | |
1362 | CORE_ADDR offset, int len, const gdb_byte *myaddr) | |
1363 | { | |
1364 | struct gdbarch *gdbarch = get_frame_arch (frame); | |
1365 | ||
1366 | /* Skip registers wholly inside of OFFSET. */ | |
1367 | while (offset >= register_size (gdbarch, regnum)) | |
1368 | { | |
1369 | offset -= register_size (gdbarch, regnum); | |
1370 | regnum++; | |
1371 | } | |
1372 | ||
1373 | /* Copy the data. */ | |
1374 | while (len > 0) | |
1375 | { | |
1376 | int curr_len = register_size (gdbarch, regnum) - offset; | |
bb9bcb69 | 1377 | |
00fa51f6 UW |
1378 | if (curr_len > len) |
1379 | curr_len = len; | |
1380 | ||
1381 | if (curr_len == register_size (gdbarch, regnum)) | |
1382 | { | |
1383 | put_frame_register (frame, regnum, myaddr); | |
1384 | } | |
1385 | else | |
1386 | { | |
1387 | gdb_byte buf[MAX_REGISTER_SIZE]; | |
bb9bcb69 | 1388 | |
ca9d61b9 | 1389 | deprecated_frame_register_read (frame, regnum, buf); |
00fa51f6 UW |
1390 | memcpy (buf + offset, myaddr, curr_len); |
1391 | put_frame_register (frame, regnum, buf); | |
1392 | } | |
1393 | ||
765f065a | 1394 | myaddr += curr_len; |
00fa51f6 UW |
1395 | len -= curr_len; |
1396 | offset = 0; | |
1397 | regnum++; | |
1398 | } | |
1399 | } | |
e36180d7 | 1400 | |
a94dd1fd AC |
1401 | /* Create a sentinel frame. */ |
1402 | ||
b9362cc7 | 1403 | static struct frame_info * |
6c95b8df | 1404 | create_sentinel_frame (struct program_space *pspace, struct regcache *regcache) |
a94dd1fd AC |
1405 | { |
1406 | struct frame_info *frame = FRAME_OBSTACK_ZALLOC (struct frame_info); | |
1c4d3f96 | 1407 | |
a94dd1fd | 1408 | frame->level = -1; |
6c95b8df PA |
1409 | frame->pspace = pspace; |
1410 | frame->aspace = get_regcache_aspace (regcache); | |
a94dd1fd AC |
1411 | /* Explicitly initialize the sentinel frame's cache. Provide it |
1412 | with the underlying regcache. In the future additional | |
1413 | information, such as the frame's thread will be added. */ | |
6dc42492 | 1414 | frame->prologue_cache = sentinel_frame_cache (regcache); |
a94dd1fd | 1415 | /* For the moment there is only one sentinel frame implementation. */ |
39d7b0e2 | 1416 | frame->unwind = &sentinel_frame_unwind; |
a94dd1fd AC |
1417 | /* Link this frame back to itself. The frame is self referential |
1418 | (the unwound PC is the same as the pc), so make it so. */ | |
1419 | frame->next = frame; | |
50bbdbd9 AC |
1420 | /* Make the sentinel frame's ID valid, but invalid. That way all |
1421 | comparisons with it should fail. */ | |
d0a55772 AC |
1422 | frame->this_id.p = 1; |
1423 | frame->this_id.value = null_frame_id; | |
7f78e237 AC |
1424 | if (frame_debug) |
1425 | { | |
1426 | fprintf_unfiltered (gdb_stdlog, "{ create_sentinel_frame (...) -> "); | |
1427 | fprint_frame (gdb_stdlog, frame); | |
1428 | fprintf_unfiltered (gdb_stdlog, " }\n"); | |
1429 | } | |
a94dd1fd AC |
1430 | return frame; |
1431 | } | |
1432 | ||
0963b4bd | 1433 | /* Info about the innermost stack frame (contents of FP register). */ |
4c1e7e9d AC |
1434 | |
1435 | static struct frame_info *current_frame; | |
1436 | ||
1437 | /* Cache for frame addresses already read by gdb. Valid only while | |
1438 | inferior is stopped. Control variables for the frame cache should | |
1439 | be local to this module. */ | |
1440 | ||
1441 | static struct obstack frame_cache_obstack; | |
1442 | ||
1443 | void * | |
479ab5a0 | 1444 | frame_obstack_zalloc (unsigned long size) |
4c1e7e9d | 1445 | { |
479ab5a0 | 1446 | void *data = obstack_alloc (&frame_cache_obstack, size); |
1c4d3f96 | 1447 | |
479ab5a0 AC |
1448 | memset (data, 0, size); |
1449 | return data; | |
4c1e7e9d AC |
1450 | } |
1451 | ||
a94dd1fd AC |
1452 | /* Return the innermost (currently executing) stack frame. This is |
1453 | split into two functions. The function unwind_to_current_frame() | |
1454 | is wrapped in catch exceptions so that, even when the unwind of the | |
1455 | sentinel frame fails, the function still returns a stack frame. */ | |
1456 | ||
1457 | static int | |
1458 | unwind_to_current_frame (struct ui_out *ui_out, void *args) | |
1459 | { | |
9a3c8263 | 1460 | struct frame_info *frame = get_prev_frame ((struct frame_info *) args); |
1c4d3f96 | 1461 | |
bbde78fa | 1462 | /* A sentinel frame can fail to unwind, e.g., because its PC value |
a94dd1fd AC |
1463 | lands in somewhere like start. */ |
1464 | if (frame == NULL) | |
1465 | return 1; | |
1466 | current_frame = frame; | |
1467 | return 0; | |
1468 | } | |
4c1e7e9d AC |
1469 | |
1470 | struct frame_info * | |
1471 | get_current_frame (void) | |
1472 | { | |
0a1e1ca1 AC |
1473 | /* First check, and report, the lack of registers. Having GDB |
1474 | report "No stack!" or "No memory" when the target doesn't even | |
1475 | have registers is very confusing. Besides, "printcmd.exp" | |
1476 | explicitly checks that ``print $pc'' with no registers prints "No | |
1477 | registers". */ | |
a94dd1fd | 1478 | if (!target_has_registers) |
8a3fe4f8 | 1479 | error (_("No registers.")); |
0a1e1ca1 | 1480 | if (!target_has_stack) |
8a3fe4f8 | 1481 | error (_("No stack.")); |
a94dd1fd | 1482 | if (!target_has_memory) |
8a3fe4f8 | 1483 | error (_("No memory.")); |
2ce6d6bf SS |
1484 | /* Traceframes are effectively a substitute for the live inferior. */ |
1485 | if (get_traceframe_number () < 0) | |
a911d87a | 1486 | validate_registers_access (); |
8ea051c5 | 1487 | |
4c1e7e9d AC |
1488 | if (current_frame == NULL) |
1489 | { | |
a94dd1fd | 1490 | struct frame_info *sentinel_frame = |
6c95b8df | 1491 | create_sentinel_frame (current_program_space, get_current_regcache ()); |
79a45e25 PA |
1492 | if (catch_exceptions (current_uiout, unwind_to_current_frame, |
1493 | sentinel_frame, RETURN_MASK_ERROR) != 0) | |
a94dd1fd AC |
1494 | { |
1495 | /* Oops! Fake a current frame? Is this useful? It has a PC | |
1496 | of zero, for instance. */ | |
1497 | current_frame = sentinel_frame; | |
1498 | } | |
4c1e7e9d AC |
1499 | } |
1500 | return current_frame; | |
1501 | } | |
1502 | ||
6e7f8b9c AC |
1503 | /* The "selected" stack frame is used by default for local and arg |
1504 | access. May be zero, for no selected frame. */ | |
1505 | ||
206415a3 | 1506 | static struct frame_info *selected_frame; |
6e7f8b9c | 1507 | |
9d49bdc2 | 1508 | int |
8ea051c5 PA |
1509 | has_stack_frames (void) |
1510 | { | |
1511 | if (!target_has_registers || !target_has_stack || !target_has_memory) | |
1512 | return 0; | |
1513 | ||
861152be LM |
1514 | /* Traceframes are effectively a substitute for the live inferior. */ |
1515 | if (get_traceframe_number () < 0) | |
1516 | { | |
1517 | /* No current inferior, no frame. */ | |
1518 | if (ptid_equal (inferior_ptid, null_ptid)) | |
1519 | return 0; | |
d729566a | 1520 | |
861152be LM |
1521 | /* Don't try to read from a dead thread. */ |
1522 | if (is_exited (inferior_ptid)) | |
1523 | return 0; | |
d729566a | 1524 | |
861152be LM |
1525 | /* ... or from a spinning thread. */ |
1526 | if (is_executing (inferior_ptid)) | |
1527 | return 0; | |
1528 | } | |
8ea051c5 PA |
1529 | |
1530 | return 1; | |
1531 | } | |
1532 | ||
bbde78fa | 1533 | /* Return the selected frame. Always non-NULL (unless there isn't an |
6e7f8b9c AC |
1534 | inferior sufficient for creating a frame) in which case an error is |
1535 | thrown. */ | |
1536 | ||
1537 | struct frame_info * | |
b04f3ab4 | 1538 | get_selected_frame (const char *message) |
6e7f8b9c | 1539 | { |
206415a3 | 1540 | if (selected_frame == NULL) |
b04f3ab4 | 1541 | { |
8ea051c5 | 1542 | if (message != NULL && !has_stack_frames ()) |
8a3fe4f8 | 1543 | error (("%s"), message); |
b04f3ab4 AC |
1544 | /* Hey! Don't trust this. It should really be re-finding the |
1545 | last selected frame of the currently selected thread. This, | |
1546 | though, is better than nothing. */ | |
1547 | select_frame (get_current_frame ()); | |
1548 | } | |
6e7f8b9c | 1549 | /* There is always a frame. */ |
206415a3 DJ |
1550 | gdb_assert (selected_frame != NULL); |
1551 | return selected_frame; | |
6e7f8b9c AC |
1552 | } |
1553 | ||
eb8c0621 TT |
1554 | /* If there is a selected frame, return it. Otherwise, return NULL. */ |
1555 | ||
1556 | struct frame_info * | |
1557 | get_selected_frame_if_set (void) | |
1558 | { | |
1559 | return selected_frame; | |
1560 | } | |
1561 | ||
bbde78fa | 1562 | /* This is a variant of get_selected_frame() which can be called when |
7dd88986 | 1563 | the inferior does not have a frame; in that case it will return |
bbde78fa | 1564 | NULL instead of calling error(). */ |
7dd88986 DJ |
1565 | |
1566 | struct frame_info * | |
1567 | deprecated_safe_get_selected_frame (void) | |
1568 | { | |
8ea051c5 | 1569 | if (!has_stack_frames ()) |
7dd88986 | 1570 | return NULL; |
b04f3ab4 | 1571 | return get_selected_frame (NULL); |
7dd88986 DJ |
1572 | } |
1573 | ||
6e7f8b9c AC |
1574 | /* Select frame FI (or NULL - to invalidate the current frame). */ |
1575 | ||
1576 | void | |
1577 | select_frame (struct frame_info *fi) | |
1578 | { | |
206415a3 | 1579 | selected_frame = fi; |
bbde78fa | 1580 | /* NOTE: cagney/2002-05-04: FI can be NULL. This occurs when the |
6e7f8b9c | 1581 | frame is being invalidated. */ |
6e7f8b9c AC |
1582 | |
1583 | /* FIXME: kseitz/2002-08-28: It would be nice to call | |
bbde78fa | 1584 | selected_frame_level_changed_event() right here, but due to limitations |
6e7f8b9c | 1585 | in the current interfaces, we would end up flooding UIs with events |
bbde78fa | 1586 | because select_frame() is used extensively internally. |
6e7f8b9c AC |
1587 | |
1588 | Once we have frame-parameterized frame (and frame-related) commands, | |
1589 | the event notification can be moved here, since this function will only | |
0963b4bd | 1590 | be called when the user's selected frame is being changed. */ |
6e7f8b9c AC |
1591 | |
1592 | /* Ensure that symbols for this frame are read in. Also, determine the | |
1593 | source language of this frame, and switch to it if desired. */ | |
1594 | if (fi) | |
1595 | { | |
e3eebbd7 PA |
1596 | CORE_ADDR pc; |
1597 | ||
1598 | /* We retrieve the frame's symtab by using the frame PC. | |
1599 | However we cannot use the frame PC as-is, because it usually | |
1600 | points to the instruction following the "call", which is | |
1601 | sometimes the first instruction of another function. So we | |
1602 | rely on get_frame_address_in_block() which provides us with a | |
1603 | PC which is guaranteed to be inside the frame's code | |
1604 | block. */ | |
1605 | if (get_frame_address_in_block_if_available (fi, &pc)) | |
6e7f8b9c | 1606 | { |
43f3e411 | 1607 | struct compunit_symtab *cust = find_pc_compunit_symtab (pc); |
e3eebbd7 | 1608 | |
43f3e411 DE |
1609 | if (cust != NULL |
1610 | && compunit_language (cust) != current_language->la_language | |
1611 | && compunit_language (cust) != language_unknown | |
e3eebbd7 | 1612 | && language_mode == language_mode_auto) |
43f3e411 | 1613 | set_language (compunit_language (cust)); |
6e7f8b9c AC |
1614 | } |
1615 | } | |
1616 | } | |
e3eebbd7 | 1617 | |
4c1e7e9d AC |
1618 | /* Create an arbitrary (i.e. address specified by user) or innermost frame. |
1619 | Always returns a non-NULL value. */ | |
1620 | ||
1621 | struct frame_info * | |
1622 | create_new_frame (CORE_ADDR addr, CORE_ADDR pc) | |
1623 | { | |
1624 | struct frame_info *fi; | |
4c1e7e9d | 1625 | |
7f78e237 AC |
1626 | if (frame_debug) |
1627 | { | |
1628 | fprintf_unfiltered (gdb_stdlog, | |
5af949e3 UW |
1629 | "{ create_new_frame (addr=%s, pc=%s) ", |
1630 | hex_string (addr), hex_string (pc)); | |
7f78e237 AC |
1631 | } |
1632 | ||
35d5d4ee | 1633 | fi = FRAME_OBSTACK_ZALLOC (struct frame_info); |
4c1e7e9d | 1634 | |
3e43a32a MS |
1635 | fi->next = create_sentinel_frame (current_program_space, |
1636 | get_current_regcache ()); | |
7df05f2b | 1637 | |
1e275f79 PA |
1638 | /* Set/update this frame's cached PC value, found in the next frame. |
1639 | Do this before looking for this frame's unwinder. A sniffer is | |
1640 | very likely to read this, and the corresponding unwinder is | |
1641 | entitled to rely that the PC doesn't magically change. */ | |
1642 | fi->next->prev_pc.value = pc; | |
782d47df | 1643 | fi->next->prev_pc.status = CC_VALUE; |
1e275f79 | 1644 | |
6c95b8df PA |
1645 | /* We currently assume that frame chain's can't cross spaces. */ |
1646 | fi->pspace = fi->next->pspace; | |
1647 | fi->aspace = fi->next->aspace; | |
1648 | ||
7df05f2b AC |
1649 | /* Select/initialize both the unwind function and the frame's type |
1650 | based on the PC. */ | |
9f9a8002 | 1651 | frame_unwind_find_by_frame (fi, &fi->prologue_cache); |
7df05f2b | 1652 | |
18adea3f | 1653 | fi->this_id.p = 1; |
1e275f79 | 1654 | fi->this_id.value = frame_id_build (addr, pc); |
4c1e7e9d | 1655 | |
7f78e237 AC |
1656 | if (frame_debug) |
1657 | { | |
1658 | fprintf_unfiltered (gdb_stdlog, "-> "); | |
1659 | fprint_frame (gdb_stdlog, fi); | |
1660 | fprintf_unfiltered (gdb_stdlog, " }\n"); | |
1661 | } | |
1662 | ||
4c1e7e9d AC |
1663 | return fi; |
1664 | } | |
1665 | ||
03febf99 AC |
1666 | /* Return the frame that THIS_FRAME calls (NULL if THIS_FRAME is the |
1667 | innermost frame). Be careful to not fall off the bottom of the | |
1668 | frame chain and onto the sentinel frame. */ | |
4c1e7e9d AC |
1669 | |
1670 | struct frame_info * | |
03febf99 | 1671 | get_next_frame (struct frame_info *this_frame) |
4c1e7e9d | 1672 | { |
03febf99 AC |
1673 | if (this_frame->level > 0) |
1674 | return this_frame->next; | |
a94dd1fd AC |
1675 | else |
1676 | return NULL; | |
4c1e7e9d AC |
1677 | } |
1678 | ||
f4c5303c OF |
1679 | /* Observer for the target_changed event. */ |
1680 | ||
2c0b251b | 1681 | static void |
f4c5303c OF |
1682 | frame_observer_target_changed (struct target_ops *target) |
1683 | { | |
35f196d9 | 1684 | reinit_frame_cache (); |
f4c5303c OF |
1685 | } |
1686 | ||
4c1e7e9d AC |
1687 | /* Flush the entire frame cache. */ |
1688 | ||
1689 | void | |
35f196d9 | 1690 | reinit_frame_cache (void) |
4c1e7e9d | 1691 | { |
272dfcfd AS |
1692 | struct frame_info *fi; |
1693 | ||
1694 | /* Tear down all frame caches. */ | |
1695 | for (fi = current_frame; fi != NULL; fi = fi->prev) | |
1696 | { | |
1697 | if (fi->prologue_cache && fi->unwind->dealloc_cache) | |
1698 | fi->unwind->dealloc_cache (fi, fi->prologue_cache); | |
1699 | if (fi->base_cache && fi->base->unwind->dealloc_cache) | |
1700 | fi->base->unwind->dealloc_cache (fi, fi->base_cache); | |
1701 | } | |
1702 | ||
0963b4bd | 1703 | /* Since we can't really be sure what the first object allocated was. */ |
4c1e7e9d AC |
1704 | obstack_free (&frame_cache_obstack, 0); |
1705 | obstack_init (&frame_cache_obstack); | |
1706 | ||
0d6ba1b1 DJ |
1707 | if (current_frame != NULL) |
1708 | annotate_frames_invalid (); | |
1709 | ||
4c1e7e9d AC |
1710 | current_frame = NULL; /* Invalidate cache */ |
1711 | select_frame (NULL); | |
b83e9eb7 | 1712 | frame_stash_invalidate (); |
7f78e237 | 1713 | if (frame_debug) |
35f196d9 | 1714 | fprintf_unfiltered (gdb_stdlog, "{ reinit_frame_cache () }\n"); |
4c1e7e9d AC |
1715 | } |
1716 | ||
e48af409 DJ |
1717 | /* Find where a register is saved (in memory or another register). |
1718 | The result of frame_register_unwind is just where it is saved | |
5efde112 | 1719 | relative to this particular frame. */ |
e48af409 DJ |
1720 | |
1721 | static void | |
1722 | frame_register_unwind_location (struct frame_info *this_frame, int regnum, | |
1723 | int *optimizedp, enum lval_type *lvalp, | |
1724 | CORE_ADDR *addrp, int *realnump) | |
1725 | { | |
1726 | gdb_assert (this_frame == NULL || this_frame->level >= 0); | |
1727 | ||
1728 | while (this_frame != NULL) | |
1729 | { | |
0fdb4f18 PA |
1730 | int unavailable; |
1731 | ||
1732 | frame_register_unwind (this_frame, regnum, optimizedp, &unavailable, | |
1733 | lvalp, addrp, realnump, NULL); | |
e48af409 DJ |
1734 | |
1735 | if (*optimizedp) | |
1736 | break; | |
1737 | ||
1738 | if (*lvalp != lval_register) | |
1739 | break; | |
1740 | ||
1741 | regnum = *realnump; | |
1742 | this_frame = get_next_frame (this_frame); | |
1743 | } | |
1744 | } | |
1745 | ||
938f0e2f AB |
1746 | /* Called during frame unwinding to remove a previous frame pointer from a |
1747 | frame passed in ARG. */ | |
1748 | ||
1749 | static void | |
1750 | remove_prev_frame (void *arg) | |
1751 | { | |
1752 | struct frame_info *this_frame, *prev_frame; | |
1753 | ||
1754 | this_frame = (struct frame_info *) arg; | |
1755 | prev_frame = this_frame->prev; | |
1756 | gdb_assert (prev_frame != NULL); | |
1757 | ||
1758 | prev_frame->next = NULL; | |
1759 | this_frame->prev = NULL; | |
1760 | } | |
1761 | ||
194cca41 PA |
1762 | /* Get the previous raw frame, and check that it is not identical to |
1763 | same other frame frame already in the chain. If it is, there is | |
1764 | most likely a stack cycle, so we discard it, and mark THIS_FRAME as | |
1765 | outermost, with UNWIND_SAME_ID stop reason. Unlike the other | |
1766 | validity tests, that compare THIS_FRAME and the next frame, we do | |
1767 | this right after creating the previous frame, to avoid ever ending | |
1768 | up with two frames with the same id in the frame chain. */ | |
1769 | ||
1770 | static struct frame_info * | |
1771 | get_prev_frame_if_no_cycle (struct frame_info *this_frame) | |
1772 | { | |
1773 | struct frame_info *prev_frame; | |
938f0e2f | 1774 | struct cleanup *prev_frame_cleanup; |
194cca41 PA |
1775 | |
1776 | prev_frame = get_prev_frame_raw (this_frame); | |
1777 | if (prev_frame == NULL) | |
1778 | return NULL; | |
1779 | ||
938f0e2f AB |
1780 | /* The cleanup will remove the previous frame that get_prev_frame_raw |
1781 | linked onto THIS_FRAME. */ | |
1782 | prev_frame_cleanup = make_cleanup (remove_prev_frame, this_frame); | |
194cca41 | 1783 | |
938f0e2f AB |
1784 | compute_frame_id (prev_frame); |
1785 | if (!frame_stash_add (prev_frame)) | |
194cca41 | 1786 | { |
938f0e2f AB |
1787 | /* Another frame with the same id was already in the stash. We just |
1788 | detected a cycle. */ | |
1789 | if (frame_debug) | |
1790 | { | |
1791 | fprintf_unfiltered (gdb_stdlog, "-> "); | |
1792 | fprint_frame (gdb_stdlog, NULL); | |
1793 | fprintf_unfiltered (gdb_stdlog, " // this frame has same ID }\n"); | |
1794 | } | |
1795 | this_frame->stop_reason = UNWIND_SAME_ID; | |
1796 | /* Unlink. */ | |
1797 | prev_frame->next = NULL; | |
1798 | this_frame->prev = NULL; | |
1799 | prev_frame = NULL; | |
194cca41 | 1800 | } |
938f0e2f AB |
1801 | |
1802 | discard_cleanups (prev_frame_cleanup); | |
1803 | return prev_frame; | |
194cca41 PA |
1804 | } |
1805 | ||
53e8a631 AB |
1806 | /* Helper function for get_prev_frame_always, this is called inside a |
1807 | TRY_CATCH block. Return the frame that called THIS_FRAME or NULL if | |
1808 | there is no such frame. This may throw an exception. */ | |
eb4f72c5 | 1809 | |
53e8a631 AB |
1810 | static struct frame_info * |
1811 | get_prev_frame_always_1 (struct frame_info *this_frame) | |
eb4f72c5 | 1812 | { |
b1bd0044 | 1813 | struct gdbarch *gdbarch; |
eb4f72c5 | 1814 | |
5613d8d3 | 1815 | gdb_assert (this_frame != NULL); |
b1bd0044 | 1816 | gdbarch = get_frame_arch (this_frame); |
5613d8d3 | 1817 | |
7f78e237 AC |
1818 | if (frame_debug) |
1819 | { | |
51d48146 | 1820 | fprintf_unfiltered (gdb_stdlog, "{ get_prev_frame_always (this_frame="); |
7f78e237 AC |
1821 | if (this_frame != NULL) |
1822 | fprintf_unfiltered (gdb_stdlog, "%d", this_frame->level); | |
1823 | else | |
1824 | fprintf_unfiltered (gdb_stdlog, "<NULL>"); | |
1825 | fprintf_unfiltered (gdb_stdlog, ") "); | |
1826 | } | |
1827 | ||
5613d8d3 AC |
1828 | /* Only try to do the unwind once. */ |
1829 | if (this_frame->prev_p) | |
1830 | { | |
1831 | if (frame_debug) | |
1832 | { | |
1833 | fprintf_unfiltered (gdb_stdlog, "-> "); | |
1834 | fprint_frame (gdb_stdlog, this_frame->prev); | |
1835 | fprintf_unfiltered (gdb_stdlog, " // cached \n"); | |
1836 | } | |
1837 | return this_frame->prev; | |
1838 | } | |
8fa75a5d | 1839 | |
0d254d6f DJ |
1840 | /* If the frame unwinder hasn't been selected yet, we must do so |
1841 | before setting prev_p; otherwise the check for misbehaved | |
1842 | sniffers will think that this frame's sniffer tried to unwind | |
1843 | further (see frame_cleanup_after_sniffer). */ | |
1844 | if (this_frame->unwind == NULL) | |
9f9a8002 | 1845 | frame_unwind_find_by_frame (this_frame, &this_frame->prologue_cache); |
8fa75a5d | 1846 | |
5613d8d3 | 1847 | this_frame->prev_p = 1; |
55feb689 | 1848 | this_frame->stop_reason = UNWIND_NO_REASON; |
5613d8d3 | 1849 | |
edb3359d DJ |
1850 | /* If we are unwinding from an inline frame, all of the below tests |
1851 | were already performed when we unwound from the next non-inline | |
1852 | frame. We must skip them, since we can not get THIS_FRAME's ID | |
1853 | until we have unwound all the way down to the previous non-inline | |
1854 | frame. */ | |
1855 | if (get_frame_type (this_frame) == INLINE_FRAME) | |
194cca41 | 1856 | return get_prev_frame_if_no_cycle (this_frame); |
edb3359d | 1857 | |
8fbca658 PA |
1858 | /* Check that this frame is unwindable. If it isn't, don't try to |
1859 | unwind to the prev frame. */ | |
1860 | this_frame->stop_reason | |
1861 | = this_frame->unwind->stop_reason (this_frame, | |
1862 | &this_frame->prologue_cache); | |
1863 | ||
1864 | if (this_frame->stop_reason != UNWIND_NO_REASON) | |
a7300869 PA |
1865 | { |
1866 | if (frame_debug) | |
1867 | { | |
1868 | enum unwind_stop_reason reason = this_frame->stop_reason; | |
1869 | ||
1870 | fprintf_unfiltered (gdb_stdlog, "-> "); | |
1871 | fprint_frame (gdb_stdlog, NULL); | |
1872 | fprintf_unfiltered (gdb_stdlog, " // %s }\n", | |
1873 | frame_stop_reason_symbol_string (reason)); | |
1874 | } | |
1875 | return NULL; | |
1876 | } | |
8fbca658 | 1877 | |
5613d8d3 AC |
1878 | /* Check that this frame's ID isn't inner to (younger, below, next) |
1879 | the next frame. This happens when a frame unwind goes backwards. | |
f06eadd9 JB |
1880 | This check is valid only if this frame and the next frame are NORMAL. |
1881 | See the comment at frame_id_inner for details. */ | |
1882 | if (get_frame_type (this_frame) == NORMAL_FRAME | |
1883 | && this_frame->next->unwind->type == NORMAL_FRAME | |
da361ebd JB |
1884 | && frame_id_inner (get_frame_arch (this_frame->next), |
1885 | get_frame_id (this_frame), | |
09a7aba8 | 1886 | get_frame_id (this_frame->next))) |
55feb689 | 1887 | { |
ebedcab5 JK |
1888 | CORE_ADDR this_pc_in_block; |
1889 | struct minimal_symbol *morestack_msym; | |
1890 | const char *morestack_name = NULL; | |
1891 | ||
1892 | /* gcc -fsplit-stack __morestack can continue the stack anywhere. */ | |
1893 | this_pc_in_block = get_frame_address_in_block (this_frame); | |
7cbd4a93 | 1894 | morestack_msym = lookup_minimal_symbol_by_pc (this_pc_in_block).minsym; |
ebedcab5 | 1895 | if (morestack_msym) |
efd66ac6 | 1896 | morestack_name = MSYMBOL_LINKAGE_NAME (morestack_msym); |
ebedcab5 | 1897 | if (!morestack_name || strcmp (morestack_name, "__morestack") != 0) |
55feb689 | 1898 | { |
ebedcab5 JK |
1899 | if (frame_debug) |
1900 | { | |
1901 | fprintf_unfiltered (gdb_stdlog, "-> "); | |
1902 | fprint_frame (gdb_stdlog, NULL); | |
3e43a32a MS |
1903 | fprintf_unfiltered (gdb_stdlog, |
1904 | " // this frame ID is inner }\n"); | |
ebedcab5 JK |
1905 | } |
1906 | this_frame->stop_reason = UNWIND_INNER_ID; | |
1907 | return NULL; | |
55feb689 | 1908 | } |
55feb689 | 1909 | } |
5613d8d3 | 1910 | |
e48af409 DJ |
1911 | /* Check that this and the next frame do not unwind the PC register |
1912 | to the same memory location. If they do, then even though they | |
1913 | have different frame IDs, the new frame will be bogus; two | |
1914 | functions can't share a register save slot for the PC. This can | |
1915 | happen when the prologue analyzer finds a stack adjustment, but | |
d57df5e4 DJ |
1916 | no PC save. |
1917 | ||
1918 | This check does assume that the "PC register" is roughly a | |
1919 | traditional PC, even if the gdbarch_unwind_pc method adjusts | |
1920 | it (we do not rely on the value, only on the unwound PC being | |
1921 | dependent on this value). A potential improvement would be | |
1922 | to have the frame prev_pc method and the gdbarch unwind_pc | |
1923 | method set the same lval and location information as | |
1924 | frame_register_unwind. */ | |
e48af409 | 1925 | if (this_frame->level > 0 |
b1bd0044 | 1926 | && gdbarch_pc_regnum (gdbarch) >= 0 |
e48af409 | 1927 | && get_frame_type (this_frame) == NORMAL_FRAME |
edb3359d DJ |
1928 | && (get_frame_type (this_frame->next) == NORMAL_FRAME |
1929 | || get_frame_type (this_frame->next) == INLINE_FRAME)) | |
e48af409 | 1930 | { |
32276632 | 1931 | int optimized, realnum, nrealnum; |
e48af409 DJ |
1932 | enum lval_type lval, nlval; |
1933 | CORE_ADDR addr, naddr; | |
1934 | ||
3e8c568d | 1935 | frame_register_unwind_location (this_frame, |
b1bd0044 | 1936 | gdbarch_pc_regnum (gdbarch), |
3e8c568d UW |
1937 | &optimized, &lval, &addr, &realnum); |
1938 | frame_register_unwind_location (get_next_frame (this_frame), | |
b1bd0044 | 1939 | gdbarch_pc_regnum (gdbarch), |
32276632 | 1940 | &optimized, &nlval, &naddr, &nrealnum); |
e48af409 | 1941 | |
32276632 DJ |
1942 | if ((lval == lval_memory && lval == nlval && addr == naddr) |
1943 | || (lval == lval_register && lval == nlval && realnum == nrealnum)) | |
e48af409 DJ |
1944 | { |
1945 | if (frame_debug) | |
1946 | { | |
1947 | fprintf_unfiltered (gdb_stdlog, "-> "); | |
1948 | fprint_frame (gdb_stdlog, NULL); | |
1949 | fprintf_unfiltered (gdb_stdlog, " // no saved PC }\n"); | |
1950 | } | |
1951 | ||
1952 | this_frame->stop_reason = UNWIND_NO_SAVED_PC; | |
1953 | this_frame->prev = NULL; | |
1954 | return NULL; | |
1955 | } | |
1956 | } | |
1957 | ||
194cca41 | 1958 | return get_prev_frame_if_no_cycle (this_frame); |
edb3359d DJ |
1959 | } |
1960 | ||
53e8a631 AB |
1961 | /* Return a "struct frame_info" corresponding to the frame that called |
1962 | THIS_FRAME. Returns NULL if there is no such frame. | |
1963 | ||
1964 | Unlike get_prev_frame, this function always tries to unwind the | |
1965 | frame. */ | |
1966 | ||
1967 | struct frame_info * | |
1968 | get_prev_frame_always (struct frame_info *this_frame) | |
1969 | { | |
53e8a631 AB |
1970 | struct frame_info *prev_frame = NULL; |
1971 | ||
492d29ea | 1972 | TRY |
53e8a631 AB |
1973 | { |
1974 | prev_frame = get_prev_frame_always_1 (this_frame); | |
1975 | } | |
492d29ea | 1976 | CATCH (ex, RETURN_MASK_ERROR) |
53e8a631 AB |
1977 | { |
1978 | if (ex.error == MEMORY_ERROR) | |
1979 | { | |
1980 | this_frame->stop_reason = UNWIND_MEMORY_ERROR; | |
1981 | if (ex.message != NULL) | |
1982 | { | |
1983 | char *stop_string; | |
1984 | size_t size; | |
1985 | ||
1986 | /* The error needs to live as long as the frame does. | |
1987 | Allocate using stack local STOP_STRING then assign the | |
1988 | pointer to the frame, this allows the STOP_STRING on the | |
1989 | frame to be of type 'const char *'. */ | |
1990 | size = strlen (ex.message) + 1; | |
224c3ddb | 1991 | stop_string = (char *) frame_obstack_zalloc (size); |
53e8a631 AB |
1992 | memcpy (stop_string, ex.message, size); |
1993 | this_frame->stop_string = stop_string; | |
1994 | } | |
1995 | prev_frame = NULL; | |
1996 | } | |
1997 | else | |
1998 | throw_exception (ex); | |
1999 | } | |
492d29ea | 2000 | END_CATCH |
53e8a631 AB |
2001 | |
2002 | return prev_frame; | |
2003 | } | |
2004 | ||
edb3359d DJ |
2005 | /* Construct a new "struct frame_info" and link it previous to |
2006 | this_frame. */ | |
2007 | ||
2008 | static struct frame_info * | |
2009 | get_prev_frame_raw (struct frame_info *this_frame) | |
2010 | { | |
2011 | struct frame_info *prev_frame; | |
2012 | ||
5613d8d3 AC |
2013 | /* Allocate the new frame but do not wire it in to the frame chain. |
2014 | Some (bad) code in INIT_FRAME_EXTRA_INFO tries to look along | |
2015 | frame->next to pull some fancy tricks (of course such code is, by | |
2016 | definition, recursive). Try to prevent it. | |
2017 | ||
2018 | There is no reason to worry about memory leaks, should the | |
2019 | remainder of the function fail. The allocated memory will be | |
2020 | quickly reclaimed when the frame cache is flushed, and the `we've | |
2021 | been here before' check above will stop repeated memory | |
2022 | allocation calls. */ | |
2023 | prev_frame = FRAME_OBSTACK_ZALLOC (struct frame_info); | |
2024 | prev_frame->level = this_frame->level + 1; | |
2025 | ||
6c95b8df PA |
2026 | /* For now, assume we don't have frame chains crossing address |
2027 | spaces. */ | |
2028 | prev_frame->pspace = this_frame->pspace; | |
2029 | prev_frame->aspace = this_frame->aspace; | |
2030 | ||
5613d8d3 AC |
2031 | /* Don't yet compute ->unwind (and hence ->type). It is computed |
2032 | on-demand in get_frame_type, frame_register_unwind, and | |
2033 | get_frame_id. */ | |
2034 | ||
2035 | /* Don't yet compute the frame's ID. It is computed on-demand by | |
2036 | get_frame_id(). */ | |
2037 | ||
2038 | /* The unwound frame ID is validate at the start of this function, | |
2039 | as part of the logic to decide if that frame should be further | |
2040 | unwound, and not here while the prev frame is being created. | |
2041 | Doing this makes it possible for the user to examine a frame that | |
2042 | has an invalid frame ID. | |
2043 | ||
2044 | Some very old VAX code noted: [...] For the sake of argument, | |
2045 | suppose that the stack is somewhat trashed (which is one reason | |
2046 | that "info frame" exists). So, return 0 (indicating we don't | |
2047 | know the address of the arglist) if we don't know what frame this | |
2048 | frame calls. */ | |
2049 | ||
2050 | /* Link it in. */ | |
2051 | this_frame->prev = prev_frame; | |
2052 | prev_frame->next = this_frame; | |
2053 | ||
2054 | if (frame_debug) | |
2055 | { | |
2056 | fprintf_unfiltered (gdb_stdlog, "-> "); | |
2057 | fprint_frame (gdb_stdlog, prev_frame); | |
2058 | fprintf_unfiltered (gdb_stdlog, " }\n"); | |
2059 | } | |
2060 | ||
2061 | return prev_frame; | |
2062 | } | |
2063 | ||
2064 | /* Debug routine to print a NULL frame being returned. */ | |
2065 | ||
2066 | static void | |
d2bf72c0 | 2067 | frame_debug_got_null_frame (struct frame_info *this_frame, |
5613d8d3 AC |
2068 | const char *reason) |
2069 | { | |
2070 | if (frame_debug) | |
2071 | { | |
2072 | fprintf_unfiltered (gdb_stdlog, "{ get_prev_frame (this_frame="); | |
2073 | if (this_frame != NULL) | |
2074 | fprintf_unfiltered (gdb_stdlog, "%d", this_frame->level); | |
2075 | else | |
2076 | fprintf_unfiltered (gdb_stdlog, "<NULL>"); | |
2077 | fprintf_unfiltered (gdb_stdlog, ") -> // %s}\n", reason); | |
2078 | } | |
2079 | } | |
2080 | ||
c8cd9f6c AC |
2081 | /* Is this (non-sentinel) frame in the "main"() function? */ |
2082 | ||
2083 | static int | |
2084 | inside_main_func (struct frame_info *this_frame) | |
2085 | { | |
3b7344d5 | 2086 | struct bound_minimal_symbol msymbol; |
c8cd9f6c AC |
2087 | CORE_ADDR maddr; |
2088 | ||
2089 | if (symfile_objfile == 0) | |
2090 | return 0; | |
2091 | msymbol = lookup_minimal_symbol (main_name (), NULL, symfile_objfile); | |
3b7344d5 | 2092 | if (msymbol.minsym == NULL) |
c8cd9f6c AC |
2093 | return 0; |
2094 | /* Make certain that the code, and not descriptor, address is | |
2095 | returned. */ | |
b1bd0044 | 2096 | maddr = gdbarch_convert_from_func_ptr_addr (get_frame_arch (this_frame), |
77e371c0 | 2097 | BMSYMBOL_VALUE_ADDRESS (msymbol), |
c8cd9f6c AC |
2098 | ¤t_target); |
2099 | return maddr == get_frame_func (this_frame); | |
2100 | } | |
2101 | ||
2315ffec RC |
2102 | /* Test whether THIS_FRAME is inside the process entry point function. */ |
2103 | ||
2104 | static int | |
2105 | inside_entry_func (struct frame_info *this_frame) | |
2106 | { | |
abd0a5fa JK |
2107 | CORE_ADDR entry_point; |
2108 | ||
2109 | if (!entry_point_address_query (&entry_point)) | |
2110 | return 0; | |
2111 | ||
2112 | return get_frame_func (this_frame) == entry_point; | |
2315ffec RC |
2113 | } |
2114 | ||
5613d8d3 AC |
2115 | /* Return a structure containing various interesting information about |
2116 | the frame that called THIS_FRAME. Returns NULL if there is entier | |
2117 | no such frame or the frame fails any of a set of target-independent | |
2118 | condition that should terminate the frame chain (e.g., as unwinding | |
2119 | past main()). | |
2120 | ||
2121 | This function should not contain target-dependent tests, such as | |
2122 | checking whether the program-counter is zero. */ | |
2123 | ||
2124 | struct frame_info * | |
2125 | get_prev_frame (struct frame_info *this_frame) | |
2126 | { | |
e3eebbd7 PA |
2127 | CORE_ADDR frame_pc; |
2128 | int frame_pc_p; | |
2129 | ||
eb4f72c5 AC |
2130 | /* There is always a frame. If this assertion fails, suspect that |
2131 | something should be calling get_selected_frame() or | |
2132 | get_current_frame(). */ | |
03febf99 | 2133 | gdb_assert (this_frame != NULL); |
e3eebbd7 | 2134 | frame_pc_p = get_frame_pc_if_available (this_frame, &frame_pc); |
eb4f72c5 | 2135 | |
cc9bed83 RC |
2136 | /* tausq/2004-12-07: Dummy frames are skipped because it doesn't make much |
2137 | sense to stop unwinding at a dummy frame. One place where a dummy | |
2138 | frame may have an address "inside_main_func" is on HPUX. On HPUX, the | |
2139 | pcsqh register (space register for the instruction at the head of the | |
2140 | instruction queue) cannot be written directly; the only way to set it | |
2141 | is to branch to code that is in the target space. In order to implement | |
2142 | frame dummies on HPUX, the called function is made to jump back to where | |
2143 | the inferior was when the user function was called. If gdb was inside | |
2144 | the main function when we created the dummy frame, the dummy frame will | |
2145 | point inside the main function. */ | |
03febf99 | 2146 | if (this_frame->level >= 0 |
edb3359d | 2147 | && get_frame_type (this_frame) == NORMAL_FRAME |
25d29d70 | 2148 | && !backtrace_past_main |
e3eebbd7 | 2149 | && frame_pc_p |
c8cd9f6c AC |
2150 | && inside_main_func (this_frame)) |
2151 | /* Don't unwind past main(). Note, this is done _before_ the | |
2152 | frame has been marked as previously unwound. That way if the | |
2153 | user later decides to enable unwinds past main(), that will | |
2154 | automatically happen. */ | |
ac2bd0a9 | 2155 | { |
d2bf72c0 | 2156 | frame_debug_got_null_frame (this_frame, "inside main func"); |
ac2bd0a9 AC |
2157 | return NULL; |
2158 | } | |
eb4f72c5 | 2159 | |
4a5e53e8 DJ |
2160 | /* If the user's backtrace limit has been exceeded, stop. We must |
2161 | add two to the current level; one of those accounts for backtrace_limit | |
2162 | being 1-based and the level being 0-based, and the other accounts for | |
2163 | the level of the new frame instead of the level of the current | |
2164 | frame. */ | |
2165 | if (this_frame->level + 2 > backtrace_limit) | |
25d29d70 | 2166 | { |
d2bf72c0 | 2167 | frame_debug_got_null_frame (this_frame, "backtrace limit exceeded"); |
4a5e53e8 | 2168 | return NULL; |
25d29d70 AC |
2169 | } |
2170 | ||
0714963c AC |
2171 | /* If we're already inside the entry function for the main objfile, |
2172 | then it isn't valid. Don't apply this test to a dummy frame - | |
bbde78fa | 2173 | dummy frame PCs typically land in the entry func. Don't apply |
0714963c AC |
2174 | this test to the sentinel frame. Sentinel frames should always |
2175 | be allowed to unwind. */ | |
2f72f850 AC |
2176 | /* NOTE: cagney/2003-07-07: Fixed a bug in inside_main_func() - |
2177 | wasn't checking for "main" in the minimal symbols. With that | |
2178 | fixed asm-source tests now stop in "main" instead of halting the | |
bbde78fa | 2179 | backtrace in weird and wonderful ways somewhere inside the entry |
2f72f850 AC |
2180 | file. Suspect that tests for inside the entry file/func were |
2181 | added to work around that (now fixed) case. */ | |
0714963c AC |
2182 | /* NOTE: cagney/2003-07-15: danielj (if I'm reading it right) |
2183 | suggested having the inside_entry_func test use the | |
bbde78fa JM |
2184 | inside_main_func() msymbol trick (along with entry_point_address() |
2185 | I guess) to determine the address range of the start function. | |
0714963c AC |
2186 | That should provide a far better stopper than the current |
2187 | heuristics. */ | |
2315ffec RC |
2188 | /* NOTE: tausq/2004-10-09: this is needed if, for example, the compiler |
2189 | applied tail-call optimizations to main so that a function called | |
2190 | from main returns directly to the caller of main. Since we don't | |
2191 | stop at main, we should at least stop at the entry point of the | |
2192 | application. */ | |
edb3359d DJ |
2193 | if (this_frame->level >= 0 |
2194 | && get_frame_type (this_frame) == NORMAL_FRAME | |
2195 | && !backtrace_past_entry | |
e3eebbd7 | 2196 | && frame_pc_p |
6e4c6c91 | 2197 | && inside_entry_func (this_frame)) |
0714963c | 2198 | { |
d2bf72c0 | 2199 | frame_debug_got_null_frame (this_frame, "inside entry func"); |
0714963c AC |
2200 | return NULL; |
2201 | } | |
2202 | ||
39ee2ff0 AC |
2203 | /* Assume that the only way to get a zero PC is through something |
2204 | like a SIGSEGV or a dummy frame, and hence that NORMAL frames | |
2205 | will never unwind a zero PC. */ | |
2206 | if (this_frame->level > 0 | |
edb3359d DJ |
2207 | && (get_frame_type (this_frame) == NORMAL_FRAME |
2208 | || get_frame_type (this_frame) == INLINE_FRAME) | |
39ee2ff0 | 2209 | && get_frame_type (get_next_frame (this_frame)) == NORMAL_FRAME |
e3eebbd7 | 2210 | && frame_pc_p && frame_pc == 0) |
39ee2ff0 | 2211 | { |
d2bf72c0 | 2212 | frame_debug_got_null_frame (this_frame, "zero PC"); |
39ee2ff0 AC |
2213 | return NULL; |
2214 | } | |
2215 | ||
51d48146 | 2216 | return get_prev_frame_always (this_frame); |
eb4f72c5 AC |
2217 | } |
2218 | ||
4c1e7e9d AC |
2219 | CORE_ADDR |
2220 | get_frame_pc (struct frame_info *frame) | |
2221 | { | |
d1340264 | 2222 | gdb_assert (frame->next != NULL); |
edb3359d | 2223 | return frame_unwind_pc (frame->next); |
4c1e7e9d AC |
2224 | } |
2225 | ||
e3eebbd7 PA |
2226 | int |
2227 | get_frame_pc_if_available (struct frame_info *frame, CORE_ADDR *pc) | |
2228 | { | |
e3eebbd7 PA |
2229 | |
2230 | gdb_assert (frame->next != NULL); | |
2231 | ||
492d29ea | 2232 | TRY |
e3eebbd7 PA |
2233 | { |
2234 | *pc = frame_unwind_pc (frame->next); | |
2235 | } | |
492d29ea | 2236 | CATCH (ex, RETURN_MASK_ERROR) |
e3eebbd7 PA |
2237 | { |
2238 | if (ex.error == NOT_AVAILABLE_ERROR) | |
2239 | return 0; | |
2240 | else | |
2241 | throw_exception (ex); | |
2242 | } | |
492d29ea | 2243 | END_CATCH |
e3eebbd7 PA |
2244 | |
2245 | return 1; | |
2246 | } | |
2247 | ||
ad1193e7 | 2248 | /* Return an address that falls within THIS_FRAME's code block. */ |
8edd5d01 AC |
2249 | |
2250 | CORE_ADDR | |
ad1193e7 | 2251 | get_frame_address_in_block (struct frame_info *this_frame) |
8edd5d01 AC |
2252 | { |
2253 | /* A draft address. */ | |
ad1193e7 | 2254 | CORE_ADDR pc = get_frame_pc (this_frame); |
8edd5d01 | 2255 | |
ad1193e7 DJ |
2256 | struct frame_info *next_frame = this_frame->next; |
2257 | ||
2258 | /* Calling get_frame_pc returns the resume address for THIS_FRAME. | |
2259 | Normally the resume address is inside the body of the function | |
2260 | associated with THIS_FRAME, but there is a special case: when | |
2261 | calling a function which the compiler knows will never return | |
2262 | (for instance abort), the call may be the very last instruction | |
2263 | in the calling function. The resume address will point after the | |
2264 | call and may be at the beginning of a different function | |
2265 | entirely. | |
2266 | ||
2267 | If THIS_FRAME is a signal frame or dummy frame, then we should | |
2268 | not adjust the unwound PC. For a dummy frame, GDB pushed the | |
2269 | resume address manually onto the stack. For a signal frame, the | |
2270 | OS may have pushed the resume address manually and invoked the | |
2271 | handler (e.g. GNU/Linux), or invoked the trampoline which called | |
2272 | the signal handler - but in either case the signal handler is | |
2273 | expected to return to the trampoline. So in both of these | |
2274 | cases we know that the resume address is executable and | |
2275 | related. So we only need to adjust the PC if THIS_FRAME | |
2276 | is a normal function. | |
2277 | ||
2278 | If the program has been interrupted while THIS_FRAME is current, | |
2279 | then clearly the resume address is inside the associated | |
2280 | function. There are three kinds of interruption: debugger stop | |
2281 | (next frame will be SENTINEL_FRAME), operating system | |
2282 | signal or exception (next frame will be SIGTRAMP_FRAME), | |
2283 | or debugger-induced function call (next frame will be | |
2284 | DUMMY_FRAME). So we only need to adjust the PC if | |
2285 | NEXT_FRAME is a normal function. | |
2286 | ||
2287 | We check the type of NEXT_FRAME first, since it is already | |
2288 | known; frame type is determined by the unwinder, and since | |
2289 | we have THIS_FRAME we've already selected an unwinder for | |
edb3359d DJ |
2290 | NEXT_FRAME. |
2291 | ||
2292 | If the next frame is inlined, we need to keep going until we find | |
2293 | the real function - for instance, if a signal handler is invoked | |
2294 | while in an inlined function, then the code address of the | |
2295 | "calling" normal function should not be adjusted either. */ | |
2296 | ||
2297 | while (get_frame_type (next_frame) == INLINE_FRAME) | |
2298 | next_frame = next_frame->next; | |
2299 | ||
111c6489 JK |
2300 | if ((get_frame_type (next_frame) == NORMAL_FRAME |
2301 | || get_frame_type (next_frame) == TAILCALL_FRAME) | |
edb3359d | 2302 | && (get_frame_type (this_frame) == NORMAL_FRAME |
111c6489 | 2303 | || get_frame_type (this_frame) == TAILCALL_FRAME |
edb3359d | 2304 | || get_frame_type (this_frame) == INLINE_FRAME)) |
ad1193e7 DJ |
2305 | return pc - 1; |
2306 | ||
2307 | return pc; | |
8edd5d01 AC |
2308 | } |
2309 | ||
e3eebbd7 PA |
2310 | int |
2311 | get_frame_address_in_block_if_available (struct frame_info *this_frame, | |
2312 | CORE_ADDR *pc) | |
2313 | { | |
e3eebbd7 | 2314 | |
492d29ea | 2315 | TRY |
e3eebbd7 PA |
2316 | { |
2317 | *pc = get_frame_address_in_block (this_frame); | |
2318 | } | |
492d29ea | 2319 | CATCH (ex, RETURN_MASK_ERROR) |
7556d4a4 PA |
2320 | { |
2321 | if (ex.error == NOT_AVAILABLE_ERROR) | |
2322 | return 0; | |
2323 | throw_exception (ex); | |
2324 | } | |
492d29ea | 2325 | END_CATCH |
7556d4a4 PA |
2326 | |
2327 | return 1; | |
e3eebbd7 PA |
2328 | } |
2329 | ||
edb3359d DJ |
2330 | void |
2331 | find_frame_sal (struct frame_info *frame, struct symtab_and_line *sal) | |
1058bca7 | 2332 | { |
edb3359d DJ |
2333 | struct frame_info *next_frame; |
2334 | int notcurrent; | |
e3eebbd7 | 2335 | CORE_ADDR pc; |
edb3359d DJ |
2336 | |
2337 | /* If the next frame represents an inlined function call, this frame's | |
2338 | sal is the "call site" of that inlined function, which can not | |
2339 | be inferred from get_frame_pc. */ | |
2340 | next_frame = get_next_frame (frame); | |
2341 | if (frame_inlined_callees (frame) > 0) | |
2342 | { | |
2343 | struct symbol *sym; | |
2344 | ||
2345 | if (next_frame) | |
2346 | sym = get_frame_function (next_frame); | |
2347 | else | |
2348 | sym = inline_skipped_symbol (inferior_ptid); | |
2349 | ||
f3df5b08 MS |
2350 | /* If frame is inline, it certainly has symbols. */ |
2351 | gdb_assert (sym); | |
edb3359d DJ |
2352 | init_sal (sal); |
2353 | if (SYMBOL_LINE (sym) != 0) | |
2354 | { | |
08be3fe3 | 2355 | sal->symtab = symbol_symtab (sym); |
edb3359d DJ |
2356 | sal->line = SYMBOL_LINE (sym); |
2357 | } | |
2358 | else | |
2359 | /* If the symbol does not have a location, we don't know where | |
2360 | the call site is. Do not pretend to. This is jarring, but | |
2361 | we can't do much better. */ | |
2362 | sal->pc = get_frame_pc (frame); | |
2363 | ||
4cb6da1c AR |
2364 | sal->pspace = get_frame_program_space (frame); |
2365 | ||
edb3359d DJ |
2366 | return; |
2367 | } | |
2368 | ||
1058bca7 AC |
2369 | /* If FRAME is not the innermost frame, that normally means that |
2370 | FRAME->pc points at the return instruction (which is *after* the | |
2371 | call instruction), and we want to get the line containing the | |
2372 | call (because the call is where the user thinks the program is). | |
2373 | However, if the next frame is either a SIGTRAMP_FRAME or a | |
2374 | DUMMY_FRAME, then the next frame will contain a saved interrupt | |
2375 | PC and such a PC indicates the current (rather than next) | |
2376 | instruction/line, consequently, for such cases, want to get the | |
2377 | line containing fi->pc. */ | |
e3eebbd7 PA |
2378 | if (!get_frame_pc_if_available (frame, &pc)) |
2379 | { | |
2380 | init_sal (sal); | |
2381 | return; | |
2382 | } | |
2383 | ||
2384 | notcurrent = (pc != get_frame_address_in_block (frame)); | |
2385 | (*sal) = find_pc_line (pc, notcurrent); | |
1058bca7 AC |
2386 | } |
2387 | ||
c193f6ac AC |
2388 | /* Per "frame.h", return the ``address'' of the frame. Code should |
2389 | really be using get_frame_id(). */ | |
2390 | CORE_ADDR | |
2391 | get_frame_base (struct frame_info *fi) | |
2392 | { | |
d0a55772 | 2393 | return get_frame_id (fi).stack_addr; |
c193f6ac AC |
2394 | } |
2395 | ||
da62e633 AC |
2396 | /* High-level offsets into the frame. Used by the debug info. */ |
2397 | ||
2398 | CORE_ADDR | |
2399 | get_frame_base_address (struct frame_info *fi) | |
2400 | { | |
7df05f2b | 2401 | if (get_frame_type (fi) != NORMAL_FRAME) |
da62e633 AC |
2402 | return 0; |
2403 | if (fi->base == NULL) | |
86c31399 | 2404 | fi->base = frame_base_find_by_frame (fi); |
da62e633 AC |
2405 | /* Sneaky: If the low-level unwind and high-level base code share a |
2406 | common unwinder, let them share the prologue cache. */ | |
2407 | if (fi->base->unwind == fi->unwind) | |
669fac23 DJ |
2408 | return fi->base->this_base (fi, &fi->prologue_cache); |
2409 | return fi->base->this_base (fi, &fi->base_cache); | |
da62e633 AC |
2410 | } |
2411 | ||
2412 | CORE_ADDR | |
2413 | get_frame_locals_address (struct frame_info *fi) | |
2414 | { | |
7df05f2b | 2415 | if (get_frame_type (fi) != NORMAL_FRAME) |
da62e633 AC |
2416 | return 0; |
2417 | /* If there isn't a frame address method, find it. */ | |
2418 | if (fi->base == NULL) | |
86c31399 | 2419 | fi->base = frame_base_find_by_frame (fi); |
da62e633 AC |
2420 | /* Sneaky: If the low-level unwind and high-level base code share a |
2421 | common unwinder, let them share the prologue cache. */ | |
2422 | if (fi->base->unwind == fi->unwind) | |
669fac23 DJ |
2423 | return fi->base->this_locals (fi, &fi->prologue_cache); |
2424 | return fi->base->this_locals (fi, &fi->base_cache); | |
da62e633 AC |
2425 | } |
2426 | ||
2427 | CORE_ADDR | |
2428 | get_frame_args_address (struct frame_info *fi) | |
2429 | { | |
7df05f2b | 2430 | if (get_frame_type (fi) != NORMAL_FRAME) |
da62e633 AC |
2431 | return 0; |
2432 | /* If there isn't a frame address method, find it. */ | |
2433 | if (fi->base == NULL) | |
86c31399 | 2434 | fi->base = frame_base_find_by_frame (fi); |
da62e633 AC |
2435 | /* Sneaky: If the low-level unwind and high-level base code share a |
2436 | common unwinder, let them share the prologue cache. */ | |
2437 | if (fi->base->unwind == fi->unwind) | |
669fac23 DJ |
2438 | return fi->base->this_args (fi, &fi->prologue_cache); |
2439 | return fi->base->this_args (fi, &fi->base_cache); | |
da62e633 AC |
2440 | } |
2441 | ||
e7802207 TT |
2442 | /* Return true if the frame unwinder for frame FI is UNWINDER; false |
2443 | otherwise. */ | |
2444 | ||
2445 | int | |
2446 | frame_unwinder_is (struct frame_info *fi, const struct frame_unwind *unwinder) | |
2447 | { | |
2448 | if (fi->unwind == NULL) | |
9f9a8002 | 2449 | frame_unwind_find_by_frame (fi, &fi->prologue_cache); |
e7802207 TT |
2450 | return fi->unwind == unwinder; |
2451 | } | |
2452 | ||
85cf597a AC |
2453 | /* Level of the selected frame: 0 for innermost, 1 for its caller, ... |
2454 | or -1 for a NULL frame. */ | |
2455 | ||
2456 | int | |
2457 | frame_relative_level (struct frame_info *fi) | |
2458 | { | |
2459 | if (fi == NULL) | |
2460 | return -1; | |
2461 | else | |
2462 | return fi->level; | |
2463 | } | |
2464 | ||
5a203e44 AC |
2465 | enum frame_type |
2466 | get_frame_type (struct frame_info *frame) | |
2467 | { | |
c1bf6f65 AC |
2468 | if (frame->unwind == NULL) |
2469 | /* Initialize the frame's unwinder because that's what | |
2470 | provides the frame's type. */ | |
9f9a8002 | 2471 | frame_unwind_find_by_frame (frame, &frame->prologue_cache); |
c1bf6f65 | 2472 | return frame->unwind->type; |
5a203e44 AC |
2473 | } |
2474 | ||
6c95b8df PA |
2475 | struct program_space * |
2476 | get_frame_program_space (struct frame_info *frame) | |
2477 | { | |
2478 | return frame->pspace; | |
2479 | } | |
2480 | ||
2481 | struct program_space * | |
2482 | frame_unwind_program_space (struct frame_info *this_frame) | |
2483 | { | |
2484 | gdb_assert (this_frame); | |
2485 | ||
2486 | /* This is really a placeholder to keep the API consistent --- we | |
2487 | assume for now that we don't have frame chains crossing | |
2488 | spaces. */ | |
2489 | return this_frame->pspace; | |
2490 | } | |
2491 | ||
2492 | struct address_space * | |
2493 | get_frame_address_space (struct frame_info *frame) | |
2494 | { | |
2495 | return frame->aspace; | |
2496 | } | |
2497 | ||
ae1e7417 AC |
2498 | /* Memory access methods. */ |
2499 | ||
2500 | void | |
10c42a71 AC |
2501 | get_frame_memory (struct frame_info *this_frame, CORE_ADDR addr, |
2502 | gdb_byte *buf, int len) | |
ae1e7417 AC |
2503 | { |
2504 | read_memory (addr, buf, len); | |
2505 | } | |
2506 | ||
2507 | LONGEST | |
2508 | get_frame_memory_signed (struct frame_info *this_frame, CORE_ADDR addr, | |
2509 | int len) | |
2510 | { | |
e17a4113 UW |
2511 | struct gdbarch *gdbarch = get_frame_arch (this_frame); |
2512 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); | |
1c4d3f96 | 2513 | |
e17a4113 | 2514 | return read_memory_integer (addr, len, byte_order); |
ae1e7417 AC |
2515 | } |
2516 | ||
2517 | ULONGEST | |
2518 | get_frame_memory_unsigned (struct frame_info *this_frame, CORE_ADDR addr, | |
2519 | int len) | |
2520 | { | |
e17a4113 UW |
2521 | struct gdbarch *gdbarch = get_frame_arch (this_frame); |
2522 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); | |
1c4d3f96 | 2523 | |
e17a4113 | 2524 | return read_memory_unsigned_integer (addr, len, byte_order); |
ae1e7417 AC |
2525 | } |
2526 | ||
304396fb AC |
2527 | int |
2528 | safe_frame_unwind_memory (struct frame_info *this_frame, | |
10c42a71 | 2529 | CORE_ADDR addr, gdb_byte *buf, int len) |
304396fb | 2530 | { |
8defab1a DJ |
2531 | /* NOTE: target_read_memory returns zero on success! */ |
2532 | return !target_read_memory (addr, buf, len); | |
304396fb AC |
2533 | } |
2534 | ||
36f15f55 | 2535 | /* Architecture methods. */ |
ae1e7417 AC |
2536 | |
2537 | struct gdbarch * | |
2538 | get_frame_arch (struct frame_info *this_frame) | |
2539 | { | |
36f15f55 UW |
2540 | return frame_unwind_arch (this_frame->next); |
2541 | } | |
2542 | ||
2543 | struct gdbarch * | |
2544 | frame_unwind_arch (struct frame_info *next_frame) | |
2545 | { | |
2546 | if (!next_frame->prev_arch.p) | |
2547 | { | |
2548 | struct gdbarch *arch; | |
0701b271 | 2549 | |
36f15f55 | 2550 | if (next_frame->unwind == NULL) |
9f9a8002 | 2551 | frame_unwind_find_by_frame (next_frame, &next_frame->prologue_cache); |
36f15f55 UW |
2552 | |
2553 | if (next_frame->unwind->prev_arch != NULL) | |
2554 | arch = next_frame->unwind->prev_arch (next_frame, | |
2555 | &next_frame->prologue_cache); | |
2556 | else | |
2557 | arch = get_frame_arch (next_frame); | |
2558 | ||
2559 | next_frame->prev_arch.arch = arch; | |
2560 | next_frame->prev_arch.p = 1; | |
2561 | if (frame_debug) | |
2562 | fprintf_unfiltered (gdb_stdlog, | |
2563 | "{ frame_unwind_arch (next_frame=%d) -> %s }\n", | |
2564 | next_frame->level, | |
2565 | gdbarch_bfd_arch_info (arch)->printable_name); | |
2566 | } | |
2567 | ||
2568 | return next_frame->prev_arch.arch; | |
2569 | } | |
2570 | ||
2571 | struct gdbarch * | |
2572 | frame_unwind_caller_arch (struct frame_info *next_frame) | |
2573 | { | |
193facb3 | 2574 | return frame_unwind_arch (skip_artificial_frames (next_frame)); |
ae1e7417 AC |
2575 | } |
2576 | ||
06096720 AB |
2577 | /* Gets the language of FRAME. */ |
2578 | ||
2579 | enum language | |
2580 | get_frame_language (struct frame_info *frame) | |
2581 | { | |
2582 | CORE_ADDR pc = 0; | |
2583 | int pc_p = 0; | |
2584 | ||
2585 | gdb_assert (frame!= NULL); | |
2586 | ||
2587 | /* We determine the current frame language by looking up its | |
2588 | associated symtab. To retrieve this symtab, we use the frame | |
2589 | PC. However we cannot use the frame PC as is, because it | |
2590 | usually points to the instruction following the "call", which | |
2591 | is sometimes the first instruction of another function. So | |
2592 | we rely on get_frame_address_in_block(), it provides us with | |
2593 | a PC that is guaranteed to be inside the frame's code | |
2594 | block. */ | |
2595 | ||
2596 | TRY | |
2597 | { | |
2598 | pc = get_frame_address_in_block (frame); | |
2599 | pc_p = 1; | |
2600 | } | |
2601 | CATCH (ex, RETURN_MASK_ERROR) | |
2602 | { | |
2603 | if (ex.error != NOT_AVAILABLE_ERROR) | |
2604 | throw_exception (ex); | |
2605 | } | |
2606 | END_CATCH | |
2607 | ||
2608 | if (pc_p) | |
2609 | { | |
2610 | struct compunit_symtab *cust = find_pc_compunit_symtab (pc); | |
2611 | ||
2612 | if (cust != NULL) | |
2613 | return compunit_language (cust); | |
2614 | } | |
2615 | ||
2616 | return language_unknown; | |
2617 | } | |
2618 | ||
a9e5fdc2 AC |
2619 | /* Stack pointer methods. */ |
2620 | ||
2621 | CORE_ADDR | |
2622 | get_frame_sp (struct frame_info *this_frame) | |
2623 | { | |
d56907c1 | 2624 | struct gdbarch *gdbarch = get_frame_arch (this_frame); |
1c4d3f96 | 2625 | |
bbde78fa | 2626 | /* Normality - an architecture that provides a way of obtaining any |
a9e5fdc2 | 2627 | frame inner-most address. */ |
b1bd0044 | 2628 | if (gdbarch_unwind_sp_p (gdbarch)) |
d56907c1 DJ |
2629 | /* NOTE drow/2008-06-28: gdbarch_unwind_sp could be converted to |
2630 | operate on THIS_FRAME now. */ | |
2631 | return gdbarch_unwind_sp (gdbarch, this_frame->next); | |
a9e5fdc2 | 2632 | /* Now things are really are grim. Hope that the value returned by |
3e8c568d | 2633 | the gdbarch_sp_regnum register is meaningful. */ |
b1bd0044 | 2634 | if (gdbarch_sp_regnum (gdbarch) >= 0) |
d56907c1 DJ |
2635 | return get_frame_register_unsigned (this_frame, |
2636 | gdbarch_sp_regnum (gdbarch)); | |
e2e0b3e5 | 2637 | internal_error (__FILE__, __LINE__, _("Missing unwind SP method")); |
a9e5fdc2 AC |
2638 | } |
2639 | ||
55feb689 DJ |
2640 | /* Return the reason why we can't unwind past FRAME. */ |
2641 | ||
2642 | enum unwind_stop_reason | |
2643 | get_frame_unwind_stop_reason (struct frame_info *frame) | |
2644 | { | |
824344ca | 2645 | /* Fill-in STOP_REASON. */ |
51d48146 | 2646 | get_prev_frame_always (frame); |
824344ca | 2647 | gdb_assert (frame->prev_p); |
55feb689 | 2648 | |
55feb689 DJ |
2649 | return frame->stop_reason; |
2650 | } | |
2651 | ||
2652 | /* Return a string explaining REASON. */ | |
2653 | ||
2654 | const char * | |
70e38b8e | 2655 | unwind_stop_reason_to_string (enum unwind_stop_reason reason) |
55feb689 DJ |
2656 | { |
2657 | switch (reason) | |
2658 | { | |
2231f1fb KP |
2659 | #define SET(name, description) \ |
2660 | case name: return _(description); | |
2661 | #include "unwind_stop_reasons.def" | |
2662 | #undef SET | |
55feb689 | 2663 | |
55feb689 DJ |
2664 | default: |
2665 | internal_error (__FILE__, __LINE__, | |
2666 | "Invalid frame stop reason"); | |
2667 | } | |
2668 | } | |
2669 | ||
53e8a631 AB |
2670 | const char * |
2671 | frame_stop_reason_string (struct frame_info *fi) | |
2672 | { | |
2673 | gdb_assert (fi->prev_p); | |
2674 | gdb_assert (fi->prev == NULL); | |
2675 | ||
2676 | /* Return the specific string if we have one. */ | |
2677 | if (fi->stop_string != NULL) | |
2678 | return fi->stop_string; | |
2679 | ||
2680 | /* Return the generic string if we have nothing better. */ | |
2681 | return unwind_stop_reason_to_string (fi->stop_reason); | |
2682 | } | |
2683 | ||
a7300869 PA |
2684 | /* Return the enum symbol name of REASON as a string, to use in debug |
2685 | output. */ | |
2686 | ||
2687 | static const char * | |
2688 | frame_stop_reason_symbol_string (enum unwind_stop_reason reason) | |
2689 | { | |
2690 | switch (reason) | |
2691 | { | |
2692 | #define SET(name, description) \ | |
2693 | case name: return #name; | |
2694 | #include "unwind_stop_reasons.def" | |
2695 | #undef SET | |
2696 | ||
2697 | default: | |
2698 | internal_error (__FILE__, __LINE__, | |
2699 | "Invalid frame stop reason"); | |
2700 | } | |
2701 | } | |
2702 | ||
669fac23 DJ |
2703 | /* Clean up after a failed (wrong unwinder) attempt to unwind past |
2704 | FRAME. */ | |
2705 | ||
2706 | static void | |
2707 | frame_cleanup_after_sniffer (void *arg) | |
2708 | { | |
9a3c8263 | 2709 | struct frame_info *frame = (struct frame_info *) arg; |
669fac23 DJ |
2710 | |
2711 | /* The sniffer should not allocate a prologue cache if it did not | |
2712 | match this frame. */ | |
2713 | gdb_assert (frame->prologue_cache == NULL); | |
2714 | ||
2715 | /* No sniffer should extend the frame chain; sniff based on what is | |
2716 | already certain. */ | |
2717 | gdb_assert (!frame->prev_p); | |
2718 | ||
2719 | /* The sniffer should not check the frame's ID; that's circular. */ | |
2720 | gdb_assert (!frame->this_id.p); | |
2721 | ||
2722 | /* Clear cached fields dependent on the unwinder. | |
2723 | ||
2724 | The previous PC is independent of the unwinder, but the previous | |
ad1193e7 | 2725 | function is not (see get_frame_address_in_block). */ |
669fac23 DJ |
2726 | frame->prev_func.p = 0; |
2727 | frame->prev_func.addr = 0; | |
2728 | ||
2729 | /* Discard the unwinder last, so that we can easily find it if an assertion | |
2730 | in this function triggers. */ | |
2731 | frame->unwind = NULL; | |
2732 | } | |
2733 | ||
2734 | /* Set FRAME's unwinder temporarily, so that we can call a sniffer. | |
2735 | Return a cleanup which should be called if unwinding fails, and | |
2736 | discarded if it succeeds. */ | |
2737 | ||
2738 | struct cleanup * | |
2739 | frame_prepare_for_sniffer (struct frame_info *frame, | |
2740 | const struct frame_unwind *unwind) | |
2741 | { | |
2742 | gdb_assert (frame->unwind == NULL); | |
2743 | frame->unwind = unwind; | |
2744 | return make_cleanup (frame_cleanup_after_sniffer, frame); | |
2745 | } | |
2746 | ||
b9362cc7 AC |
2747 | extern initialize_file_ftype _initialize_frame; /* -Wmissing-prototypes */ |
2748 | ||
25d29d70 AC |
2749 | static struct cmd_list_element *set_backtrace_cmdlist; |
2750 | static struct cmd_list_element *show_backtrace_cmdlist; | |
2751 | ||
2752 | static void | |
2753 | set_backtrace_cmd (char *args, int from_tty) | |
2754 | { | |
635c7e8a TT |
2755 | help_list (set_backtrace_cmdlist, "set backtrace ", all_commands, |
2756 | gdb_stdout); | |
25d29d70 AC |
2757 | } |
2758 | ||
2759 | static void | |
2760 | show_backtrace_cmd (char *args, int from_tty) | |
2761 | { | |
2762 | cmd_show_list (show_backtrace_cmdlist, from_tty, ""); | |
2763 | } | |
2764 | ||
4c1e7e9d AC |
2765 | void |
2766 | _initialize_frame (void) | |
2767 | { | |
2768 | obstack_init (&frame_cache_obstack); | |
eb4f72c5 | 2769 | |
3de661e6 PM |
2770 | frame_stash_create (); |
2771 | ||
f4c5303c OF |
2772 | observer_attach_target_changed (frame_observer_target_changed); |
2773 | ||
1bedd215 | 2774 | add_prefix_cmd ("backtrace", class_maintenance, set_backtrace_cmd, _("\ |
25d29d70 | 2775 | Set backtrace specific variables.\n\ |
1bedd215 | 2776 | Configure backtrace variables such as the backtrace limit"), |
25d29d70 AC |
2777 | &set_backtrace_cmdlist, "set backtrace ", |
2778 | 0/*allow-unknown*/, &setlist); | |
1bedd215 | 2779 | add_prefix_cmd ("backtrace", class_maintenance, show_backtrace_cmd, _("\ |
25d29d70 | 2780 | Show backtrace specific variables\n\ |
1bedd215 | 2781 | Show backtrace variables such as the backtrace limit"), |
25d29d70 AC |
2782 | &show_backtrace_cmdlist, "show backtrace ", |
2783 | 0/*allow-unknown*/, &showlist); | |
2784 | ||
2785 | add_setshow_boolean_cmd ("past-main", class_obscure, | |
7915a72c AC |
2786 | &backtrace_past_main, _("\ |
2787 | Set whether backtraces should continue past \"main\"."), _("\ | |
2788 | Show whether backtraces should continue past \"main\"."), _("\ | |
eb4f72c5 AC |
2789 | Normally the caller of \"main\" is not of interest, so GDB will terminate\n\ |
2790 | the backtrace at \"main\". Set this variable if you need to see the rest\n\ | |
7915a72c | 2791 | of the stack trace."), |
2c5b56ce | 2792 | NULL, |
920d2a44 | 2793 | show_backtrace_past_main, |
2c5b56ce | 2794 | &set_backtrace_cmdlist, |
25d29d70 AC |
2795 | &show_backtrace_cmdlist); |
2796 | ||
2315ffec | 2797 | add_setshow_boolean_cmd ("past-entry", class_obscure, |
7915a72c AC |
2798 | &backtrace_past_entry, _("\ |
2799 | Set whether backtraces should continue past the entry point of a program."), | |
2800 | _("\ | |
2801 | Show whether backtraces should continue past the entry point of a program."), | |
2802 | _("\ | |
2315ffec | 2803 | Normally there are no callers beyond the entry point of a program, so GDB\n\ |
cce7e648 | 2804 | will terminate the backtrace there. Set this variable if you need to see\n\ |
7915a72c | 2805 | the rest of the stack trace."), |
2c5b56ce | 2806 | NULL, |
920d2a44 | 2807 | show_backtrace_past_entry, |
2c5b56ce | 2808 | &set_backtrace_cmdlist, |
2315ffec RC |
2809 | &show_backtrace_cmdlist); |
2810 | ||
883b9c6c YQ |
2811 | add_setshow_uinteger_cmd ("limit", class_obscure, |
2812 | &backtrace_limit, _("\ | |
7915a72c AC |
2813 | Set an upper bound on the number of backtrace levels."), _("\ |
2814 | Show the upper bound on the number of backtrace levels."), _("\ | |
fec74868 | 2815 | No more than the specified number of frames can be displayed or examined.\n\ |
f81d1120 | 2816 | Literal \"unlimited\" or zero means no limit."), |
883b9c6c YQ |
2817 | NULL, |
2818 | show_backtrace_limit, | |
2819 | &set_backtrace_cmdlist, | |
2820 | &show_backtrace_cmdlist); | |
ac2bd0a9 | 2821 | |
0963b4bd | 2822 | /* Debug this files internals. */ |
ccce17b0 | 2823 | add_setshow_zuinteger_cmd ("frame", class_maintenance, &frame_debug, _("\ |
85c07804 AC |
2824 | Set frame debugging."), _("\ |
2825 | Show frame debugging."), _("\ | |
2826 | When non-zero, frame specific internal debugging is enabled."), | |
ccce17b0 YQ |
2827 | NULL, |
2828 | show_frame_debug, | |
2829 | &setdebuglist, &showdebuglist); | |
4c1e7e9d | 2830 | } |