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