Commit | Line | Data |
---|---|---|
7cc19214 AC |
1 | /* Get info from stack frames; convert between frames, blocks, |
2 | functions and pc values. | |
3 | ||
4 | Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, | |
5 | 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002 Free Software | |
6 | Foundation, Inc. | |
c906108c | 7 | |
c5aa993b | 8 | This file is part of GDB. |
c906108c | 9 | |
c5aa993b JM |
10 | This program is free software; you can redistribute it and/or modify |
11 | it under the terms of the GNU General Public License as published by | |
12 | the Free Software Foundation; either version 2 of the License, or | |
13 | (at your option) any later version. | |
c906108c | 14 | |
c5aa993b JM |
15 | This program is distributed in the hope that it will be useful, |
16 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
18 | GNU General Public License for more details. | |
c906108c | 19 | |
c5aa993b JM |
20 | You should have received a copy of the GNU General Public License |
21 | along with this program; if not, write to the Free Software | |
22 | Foundation, Inc., 59 Temple Place - Suite 330, | |
23 | Boston, MA 02111-1307, USA. */ | |
c906108c SS |
24 | |
25 | #include "defs.h" | |
26 | #include "symtab.h" | |
27 | #include "bfd.h" | |
28 | #include "symfile.h" | |
29 | #include "objfiles.h" | |
30 | #include "frame.h" | |
31 | #include "gdbcore.h" | |
32 | #include "value.h" /* for read_register */ | |
33 | #include "target.h" /* for target_has_stack */ | |
34 | #include "inferior.h" /* for read_pc */ | |
35 | #include "annotate.h" | |
4e052eda | 36 | #include "regcache.h" |
4f460812 | 37 | #include "gdb_assert.h" |
c906108c SS |
38 | |
39 | /* Prototypes for exported functions. */ | |
40 | ||
4f460812 AC |
41 | static void generic_call_dummy_register_unwind (struct frame_info *frame, |
42 | void **cache, | |
43 | int regnum, | |
44 | int *optimized, | |
45 | enum lval_type *lval, | |
46 | CORE_ADDR *addrp, | |
47 | int *realnum, | |
48 | void *raw_buffer); | |
49 | static void frame_saved_regs_register_unwind (struct frame_info *frame, | |
50 | void **cache, | |
51 | int regnum, | |
52 | int *optimized, | |
53 | enum lval_type *lval, | |
54 | CORE_ADDR *addrp, | |
55 | int *realnum, | |
56 | void *buffer); | |
57 | ||
58 | ||
53a5351d | 59 | void _initialize_blockframe (void); |
c906108c SS |
60 | |
61 | /* A default FRAME_CHAIN_VALID, in the form that is suitable for most | |
62 | targets. If FRAME_CHAIN_VALID returns zero it means that the given | |
63 | frame is the outermost one and has no caller. */ | |
64 | ||
65 | int | |
fba45db2 | 66 | file_frame_chain_valid (CORE_ADDR chain, struct frame_info *thisframe) |
c906108c SS |
67 | { |
68 | return ((chain) != 0 | |
c4093a6a | 69 | && !inside_entry_file (FRAME_SAVED_PC (thisframe))); |
c906108c SS |
70 | } |
71 | ||
72 | /* Use the alternate method of avoiding running up off the end of the | |
73 | frame chain or following frames back into the startup code. See | |
74 | the comments in objfiles.h. */ | |
c5aa993b | 75 | |
c906108c | 76 | int |
fba45db2 | 77 | func_frame_chain_valid (CORE_ADDR chain, struct frame_info *thisframe) |
c906108c SS |
78 | { |
79 | return ((chain) != 0 | |
c4093a6a JM |
80 | && !inside_main_func ((thisframe)->pc) |
81 | && !inside_entry_func ((thisframe)->pc)); | |
c906108c SS |
82 | } |
83 | ||
84 | /* A very simple method of determining a valid frame */ | |
c5aa993b | 85 | |
c906108c | 86 | int |
fba45db2 | 87 | nonnull_frame_chain_valid (CORE_ADDR chain, struct frame_info *thisframe) |
c906108c SS |
88 | { |
89 | return ((chain) != 0); | |
90 | } | |
91 | ||
92 | /* Is ADDR inside the startup file? Note that if your machine | |
93 | has a way to detect the bottom of the stack, there is no need | |
94 | to call this function from FRAME_CHAIN_VALID; the reason for | |
95 | doing so is that some machines have no way of detecting bottom | |
96 | of stack. | |
97 | ||
98 | A PC of zero is always considered to be the bottom of the stack. */ | |
99 | ||
100 | int | |
fba45db2 | 101 | inside_entry_file (CORE_ADDR addr) |
c906108c SS |
102 | { |
103 | if (addr == 0) | |
104 | return 1; | |
105 | if (symfile_objfile == 0) | |
106 | return 0; | |
7a292a7a SS |
107 | if (CALL_DUMMY_LOCATION == AT_ENTRY_POINT) |
108 | { | |
109 | /* Do not stop backtracing if the pc is in the call dummy | |
c5aa993b | 110 | at the entry point. */ |
7a292a7a | 111 | /* FIXME: Won't always work with zeros for the last two arguments */ |
c5aa993b | 112 | if (PC_IN_CALL_DUMMY (addr, 0, 0)) |
7a292a7a SS |
113 | return 0; |
114 | } | |
c5aa993b JM |
115 | return (addr >= symfile_objfile->ei.entry_file_lowpc && |
116 | addr < symfile_objfile->ei.entry_file_highpc); | |
c906108c SS |
117 | } |
118 | ||
119 | /* Test a specified PC value to see if it is in the range of addresses | |
120 | that correspond to the main() function. See comments above for why | |
121 | we might want to do this. | |
122 | ||
123 | Typically called from FRAME_CHAIN_VALID. | |
124 | ||
125 | A PC of zero is always considered to be the bottom of the stack. */ | |
126 | ||
127 | int | |
fba45db2 | 128 | inside_main_func (CORE_ADDR pc) |
c906108c SS |
129 | { |
130 | if (pc == 0) | |
131 | return 1; | |
132 | if (symfile_objfile == 0) | |
133 | return 0; | |
134 | ||
135 | /* If the addr range is not set up at symbol reading time, set it up now. | |
136 | This is for FRAME_CHAIN_VALID_ALTERNATE. I do this for coff, because | |
137 | it is unable to set it up and symbol reading time. */ | |
138 | ||
c5aa993b JM |
139 | if (symfile_objfile->ei.main_func_lowpc == INVALID_ENTRY_LOWPC && |
140 | symfile_objfile->ei.main_func_highpc == INVALID_ENTRY_HIGHPC) | |
c906108c SS |
141 | { |
142 | struct symbol *mainsym; | |
143 | ||
51cc5b07 | 144 | mainsym = lookup_symbol (main_name (), NULL, VAR_NAMESPACE, NULL, NULL); |
c5aa993b JM |
145 | if (mainsym && SYMBOL_CLASS (mainsym) == LOC_BLOCK) |
146 | { | |
147 | symfile_objfile->ei.main_func_lowpc = | |
c906108c | 148 | BLOCK_START (SYMBOL_BLOCK_VALUE (mainsym)); |
c5aa993b | 149 | symfile_objfile->ei.main_func_highpc = |
c906108c | 150 | BLOCK_END (SYMBOL_BLOCK_VALUE (mainsym)); |
c5aa993b | 151 | } |
c906108c | 152 | } |
c5aa993b JM |
153 | return (symfile_objfile->ei.main_func_lowpc <= pc && |
154 | symfile_objfile->ei.main_func_highpc > pc); | |
c906108c SS |
155 | } |
156 | ||
157 | /* Test a specified PC value to see if it is in the range of addresses | |
158 | that correspond to the process entry point function. See comments | |
159 | in objfiles.h for why we might want to do this. | |
160 | ||
161 | Typically called from FRAME_CHAIN_VALID. | |
162 | ||
163 | A PC of zero is always considered to be the bottom of the stack. */ | |
164 | ||
165 | int | |
fba45db2 | 166 | inside_entry_func (CORE_ADDR pc) |
c906108c SS |
167 | { |
168 | if (pc == 0) | |
169 | return 1; | |
170 | if (symfile_objfile == 0) | |
171 | return 0; | |
7a292a7a SS |
172 | if (CALL_DUMMY_LOCATION == AT_ENTRY_POINT) |
173 | { | |
174 | /* Do not stop backtracing if the pc is in the call dummy | |
c5aa993b | 175 | at the entry point. */ |
7a292a7a SS |
176 | /* FIXME: Won't always work with zeros for the last two arguments */ |
177 | if (PC_IN_CALL_DUMMY (pc, 0, 0)) | |
178 | return 0; | |
179 | } | |
c5aa993b JM |
180 | return (symfile_objfile->ei.entry_func_lowpc <= pc && |
181 | symfile_objfile->ei.entry_func_highpc > pc); | |
c906108c SS |
182 | } |
183 | ||
184 | /* Info about the innermost stack frame (contents of FP register) */ | |
185 | ||
186 | static struct frame_info *current_frame; | |
187 | ||
188 | /* Cache for frame addresses already read by gdb. Valid only while | |
189 | inferior is stopped. Control variables for the frame cache should | |
190 | be local to this module. */ | |
191 | ||
192 | static struct obstack frame_cache_obstack; | |
193 | ||
194 | void * | |
fba45db2 | 195 | frame_obstack_alloc (unsigned long size) |
c906108c SS |
196 | { |
197 | return obstack_alloc (&frame_cache_obstack, size); | |
198 | } | |
199 | ||
200 | void | |
fba45db2 | 201 | frame_saved_regs_zalloc (struct frame_info *fi) |
c906108c | 202 | { |
c5aa993b | 203 | fi->saved_regs = (CORE_ADDR *) |
c906108c SS |
204 | frame_obstack_alloc (SIZEOF_FRAME_SAVED_REGS); |
205 | memset (fi->saved_regs, 0, SIZEOF_FRAME_SAVED_REGS); | |
206 | } | |
207 | ||
208 | ||
209 | /* Return the innermost (currently executing) stack frame. */ | |
210 | ||
211 | struct frame_info * | |
fba45db2 | 212 | get_current_frame (void) |
c906108c SS |
213 | { |
214 | if (current_frame == NULL) | |
215 | { | |
216 | if (target_has_stack) | |
217 | current_frame = create_new_frame (read_fp (), read_pc ()); | |
218 | else | |
219 | error ("No stack."); | |
220 | } | |
221 | return current_frame; | |
222 | } | |
223 | ||
224 | void | |
fba45db2 | 225 | set_current_frame (struct frame_info *frame) |
c906108c SS |
226 | { |
227 | current_frame = frame; | |
228 | } | |
229 | ||
4f460812 AC |
230 | |
231 | /* Using the PC, select a mechanism for unwinding a frame returning | |
232 | the previous frame. The register unwind function should, on | |
233 | demand, initialize the ->context object. */ | |
234 | ||
235 | static void | |
236 | set_unwind_by_pc (CORE_ADDR pc, CORE_ADDR fp, | |
237 | frame_register_unwind_ftype **unwind) | |
238 | { | |
239 | if (!USE_GENERIC_DUMMY_FRAMES) | |
240 | /* Still need to set this to something. The ``info frame'' code | |
241 | calls this function to find out where the saved registers are. | |
242 | Hopefully this is robust enough to stop any core dumps and | |
243 | return vaguely correct values.. */ | |
244 | *unwind = frame_saved_regs_register_unwind; | |
245 | else if (PC_IN_CALL_DUMMY (pc, fp, fp)) | |
246 | *unwind = generic_call_dummy_register_unwind; | |
247 | else | |
248 | *unwind = frame_saved_regs_register_unwind; | |
249 | } | |
250 | ||
c906108c SS |
251 | /* Create an arbitrary (i.e. address specified by user) or innermost frame. |
252 | Always returns a non-NULL value. */ | |
253 | ||
254 | struct frame_info * | |
fba45db2 | 255 | create_new_frame (CORE_ADDR addr, CORE_ADDR pc) |
c906108c SS |
256 | { |
257 | struct frame_info *fi; | |
258 | char *name; | |
259 | ||
260 | fi = (struct frame_info *) | |
261 | obstack_alloc (&frame_cache_obstack, | |
262 | sizeof (struct frame_info)); | |
263 | ||
736d0890 MS |
264 | /* Zero all fields by default. */ |
265 | memset (fi, 0, sizeof (struct frame_info)); | |
266 | ||
c906108c SS |
267 | fi->frame = addr; |
268 | fi->pc = pc; | |
c5aa993b | 269 | find_pc_partial_function (pc, &name, (CORE_ADDR *) NULL, (CORE_ADDR *) NULL); |
d7bd68ca | 270 | fi->signal_handler_caller = PC_IN_SIGTRAMP (fi->pc, name); |
c906108c | 271 | |
5fdff426 AC |
272 | if (INIT_EXTRA_FRAME_INFO_P ()) |
273 | INIT_EXTRA_FRAME_INFO (0, fi); | |
c906108c | 274 | |
4f460812 AC |
275 | /* Select/initialize an unwind function. */ |
276 | set_unwind_by_pc (fi->pc, fi->frame, &fi->register_unwind); | |
277 | ||
c906108c SS |
278 | return fi; |
279 | } | |
280 | ||
c906108c SS |
281 | /* Return the frame that FRAME calls (NULL if FRAME is the innermost |
282 | frame). */ | |
283 | ||
284 | struct frame_info * | |
fba45db2 | 285 | get_next_frame (struct frame_info *frame) |
c906108c SS |
286 | { |
287 | return frame->next; | |
288 | } | |
289 | ||
290 | /* Flush the entire frame cache. */ | |
291 | ||
292 | void | |
fba45db2 | 293 | flush_cached_frames (void) |
c906108c SS |
294 | { |
295 | /* Since we can't really be sure what the first object allocated was */ | |
296 | obstack_free (&frame_cache_obstack, 0); | |
297 | obstack_init (&frame_cache_obstack); | |
298 | ||
c5aa993b | 299 | current_frame = NULL; /* Invalidate cache */ |
0f7d239c | 300 | select_frame (NULL); |
c906108c SS |
301 | annotate_frames_invalid (); |
302 | } | |
303 | ||
304 | /* Flush the frame cache, and start a new one if necessary. */ | |
305 | ||
306 | void | |
fba45db2 | 307 | reinit_frame_cache (void) |
c906108c SS |
308 | { |
309 | flush_cached_frames (); | |
310 | ||
39f77062 KB |
311 | /* FIXME: The inferior_ptid test is wrong if there is a corefile. */ |
312 | if (PIDGET (inferior_ptid) != 0) | |
c906108c | 313 | { |
0f7d239c | 314 | select_frame (get_current_frame ()); |
c906108c SS |
315 | } |
316 | } | |
317 | ||
c906108c SS |
318 | /* Return nonzero if the function for this frame lacks a prologue. Many |
319 | machines can define FRAMELESS_FUNCTION_INVOCATION to just call this | |
320 | function. */ | |
321 | ||
322 | int | |
fba45db2 | 323 | frameless_look_for_prologue (struct frame_info *frame) |
c906108c SS |
324 | { |
325 | CORE_ADDR func_start, after_prologue; | |
53a5351d | 326 | |
c906108c SS |
327 | func_start = get_pc_function_start (frame->pc); |
328 | if (func_start) | |
329 | { | |
330 | func_start += FUNCTION_START_OFFSET; | |
53a5351d JM |
331 | /* This is faster, since only care whether there *is* a |
332 | prologue, not how long it is. */ | |
dad41f9a | 333 | return PROLOGUE_FRAMELESS_P (func_start); |
c906108c SS |
334 | } |
335 | else if (frame->pc == 0) | |
53a5351d JM |
336 | /* A frame with a zero PC is usually created by dereferencing a |
337 | NULL function pointer, normally causing an immediate core dump | |
338 | of the inferior. Mark function as frameless, as the inferior | |
339 | has no chance of setting up a stack frame. */ | |
c906108c SS |
340 | return 1; |
341 | else | |
342 | /* If we can't find the start of the function, we don't really | |
343 | know whether the function is frameless, but we should be able | |
344 | to get a reasonable (i.e. best we can do under the | |
345 | circumstances) backtrace by saying that it isn't. */ | |
346 | return 0; | |
347 | } | |
348 | ||
c906108c SS |
349 | /* Return a structure containing various interesting information |
350 | about the frame that called NEXT_FRAME. Returns NULL | |
351 | if there is no such frame. */ | |
352 | ||
353 | struct frame_info * | |
fba45db2 | 354 | get_prev_frame (struct frame_info *next_frame) |
c906108c SS |
355 | { |
356 | CORE_ADDR address = 0; | |
357 | struct frame_info *prev; | |
358 | int fromleaf = 0; | |
359 | char *name; | |
360 | ||
361 | /* If the requested entry is in the cache, return it. | |
362 | Otherwise, figure out what the address should be for the entry | |
363 | we're about to add to the cache. */ | |
364 | ||
365 | if (!next_frame) | |
366 | { | |
367 | #if 0 | |
368 | /* This screws value_of_variable, which just wants a nice clean | |
c5aa993b JM |
369 | NULL return from block_innermost_frame if there are no frames. |
370 | I don't think I've ever seen this message happen otherwise. | |
371 | And returning NULL here is a perfectly legitimate thing to do. */ | |
c906108c SS |
372 | if (!current_frame) |
373 | { | |
374 | error ("You haven't set up a process's stack to examine."); | |
375 | } | |
376 | #endif | |
377 | ||
378 | return current_frame; | |
379 | } | |
380 | ||
381 | /* If we have the prev one, return it */ | |
382 | if (next_frame->prev) | |
383 | return next_frame->prev; | |
384 | ||
385 | /* On some machines it is possible to call a function without | |
386 | setting up a stack frame for it. On these machines, we | |
387 | define this macro to take two args; a frameinfo pointer | |
388 | identifying a frame and a variable to set or clear if it is | |
389 | or isn't leafless. */ | |
392a587b | 390 | |
c906108c SS |
391 | /* Still don't want to worry about this except on the innermost |
392 | frame. This macro will set FROMLEAF if NEXT_FRAME is a | |
393 | frameless function invocation. */ | |
394 | if (!(next_frame->next)) | |
395 | { | |
392a587b | 396 | fromleaf = FRAMELESS_FUNCTION_INVOCATION (next_frame); |
c906108c SS |
397 | if (fromleaf) |
398 | address = FRAME_FP (next_frame); | |
399 | } | |
c906108c SS |
400 | |
401 | if (!fromleaf) | |
402 | { | |
403 | /* Two macros defined in tm.h specify the machine-dependent | |
c5aa993b JM |
404 | actions to be performed here. |
405 | First, get the frame's chain-pointer. | |
406 | If that is zero, the frame is the outermost frame or a leaf | |
407 | called by the outermost frame. This means that if start | |
408 | calls main without a frame, we'll return 0 (which is fine | |
409 | anyway). | |
410 | ||
411 | Nope; there's a problem. This also returns when the current | |
412 | routine is a leaf of main. This is unacceptable. We move | |
413 | this to after the ffi test; I'd rather have backtraces from | |
414 | start go curfluy than have an abort called from main not show | |
415 | main. */ | |
c906108c | 416 | address = FRAME_CHAIN (next_frame); |
ca0d0b52 AC |
417 | |
418 | /* FIXME: cagney/2002-06-08: There should be two tests here. | |
419 | The first would check for a valid frame chain based on a user | |
420 | selectable policy. The default being ``stop at main'' (as | |
421 | implemented by generic_func_frame_chain_valid()). Other | |
422 | policies would be available - stop at NULL, .... The second | |
423 | test, if provided by the target architecture, would check for | |
424 | more exotic cases - most target architectures wouldn't bother | |
425 | with this second case. */ | |
c906108c SS |
426 | if (!FRAME_CHAIN_VALID (address, next_frame)) |
427 | return 0; | |
c906108c SS |
428 | } |
429 | if (address == 0) | |
430 | return 0; | |
431 | ||
432 | prev = (struct frame_info *) | |
433 | obstack_alloc (&frame_cache_obstack, | |
434 | sizeof (struct frame_info)); | |
435 | ||
bb30608f | 436 | /* Zero all fields by default. */ |
0c8053b6 | 437 | memset (prev, 0, sizeof (struct frame_info)); |
bb30608f | 438 | |
c906108c SS |
439 | if (next_frame) |
440 | next_frame->prev = prev; | |
441 | prev->next = next_frame; | |
c906108c | 442 | prev->frame = address; |
7cc19214 | 443 | prev->level = next_frame->level + 1; |
c906108c SS |
444 | |
445 | /* This change should not be needed, FIXME! We should | |
446 | determine whether any targets *need* INIT_FRAME_PC to happen | |
447 | after INIT_EXTRA_FRAME_INFO and come up with a simple way to | |
448 | express what goes on here. | |
449 | ||
c5aa993b JM |
450 | INIT_EXTRA_FRAME_INFO is called from two places: create_new_frame |
451 | (where the PC is already set up) and here (where it isn't). | |
452 | INIT_FRAME_PC is only called from here, always after | |
453 | INIT_EXTRA_FRAME_INFO. | |
454 | ||
c906108c SS |
455 | The catch is the MIPS, where INIT_EXTRA_FRAME_INFO requires the PC |
456 | value (which hasn't been set yet). Some other machines appear to | |
457 | require INIT_EXTRA_FRAME_INFO before they can do INIT_FRAME_PC. Phoo. | |
458 | ||
459 | We shouldn't need INIT_FRAME_PC_FIRST to add more complication to | |
460 | an already overcomplicated part of GDB. gnu@cygnus.com, 15Sep92. | |
461 | ||
462 | Assuming that some machines need INIT_FRAME_PC after | |
463 | INIT_EXTRA_FRAME_INFO, one possible scheme: | |
464 | ||
465 | SETUP_INNERMOST_FRAME() | |
c5aa993b JM |
466 | Default version is just create_new_frame (read_fp ()), |
467 | read_pc ()). Machines with extra frame info would do that (or the | |
468 | local equivalent) and then set the extra fields. | |
c906108c | 469 | SETUP_ARBITRARY_FRAME(argc, argv) |
c5aa993b JM |
470 | Only change here is that create_new_frame would no longer init extra |
471 | frame info; SETUP_ARBITRARY_FRAME would have to do that. | |
c906108c | 472 | INIT_PREV_FRAME(fromleaf, prev) |
c5aa993b JM |
473 | Replace INIT_EXTRA_FRAME_INFO and INIT_FRAME_PC. This should |
474 | also return a flag saying whether to keep the new frame, or | |
475 | whether to discard it, because on some machines (e.g. mips) it | |
476 | is really awkward to have FRAME_CHAIN_VALID called *before* | |
477 | INIT_EXTRA_FRAME_INFO (there is no good way to get information | |
478 | deduced in FRAME_CHAIN_VALID into the extra fields of the new frame). | |
c906108c | 479 | std_frame_pc(fromleaf, prev) |
c5aa993b JM |
480 | This is the default setting for INIT_PREV_FRAME. It just does what |
481 | the default INIT_FRAME_PC does. Some machines will call it from | |
482 | INIT_PREV_FRAME (either at the beginning, the end, or in the middle). | |
483 | Some machines won't use it. | |
c906108c SS |
484 | kingdon@cygnus.com, 13Apr93, 31Jan94, 14Dec94. */ |
485 | ||
c906108c | 486 | INIT_FRAME_PC_FIRST (fromleaf, prev); |
c906108c | 487 | |
e6b47f07 AC |
488 | if (INIT_EXTRA_FRAME_INFO_P ()) |
489 | INIT_EXTRA_FRAME_INFO (fromleaf, prev); | |
c906108c SS |
490 | |
491 | /* This entry is in the frame queue now, which is good since | |
492 | FRAME_SAVED_PC may use that queue to figure out its value | |
493 | (see tm-sparc.h). We want the pc saved in the inferior frame. */ | |
c5aa993b | 494 | INIT_FRAME_PC (fromleaf, prev); |
c906108c SS |
495 | |
496 | /* If ->frame and ->pc are unchanged, we are in the process of getting | |
497 | ourselves into an infinite backtrace. Some architectures check this | |
498 | in FRAME_CHAIN or thereabouts, but it seems like there is no reason | |
499 | this can't be an architecture-independent check. */ | |
500 | if (next_frame != NULL) | |
501 | { | |
502 | if (prev->frame == next_frame->frame | |
503 | && prev->pc == next_frame->pc) | |
504 | { | |
505 | next_frame->prev = NULL; | |
506 | obstack_free (&frame_cache_obstack, prev); | |
507 | return NULL; | |
508 | } | |
509 | } | |
510 | ||
4f460812 AC |
511 | /* Initialize the code used to unwind the frame PREV based on the PC |
512 | (and probably other architectural information). The PC lets you | |
513 | check things like the debug info at that point (dwarf2cfi?) and | |
514 | use that to decide how the frame should be unwound. */ | |
515 | set_unwind_by_pc (prev->pc, prev->frame, &prev->register_unwind); | |
516 | ||
c906108c | 517 | find_pc_partial_function (prev->pc, &name, |
c5aa993b | 518 | (CORE_ADDR *) NULL, (CORE_ADDR *) NULL); |
d7bd68ca | 519 | if (PC_IN_SIGTRAMP (prev->pc, name)) |
c906108c SS |
520 | prev->signal_handler_caller = 1; |
521 | ||
522 | return prev; | |
523 | } | |
524 | ||
525 | CORE_ADDR | |
fba45db2 | 526 | get_frame_pc (struct frame_info *frame) |
c906108c SS |
527 | { |
528 | return frame->pc; | |
529 | } | |
530 | ||
42f99ac2 JB |
531 | /* return the address of the PC for the given FRAME, ie the current PC value |
532 | if FRAME is the innermost frame, or the address adjusted to point to the | |
533 | call instruction if not. */ | |
534 | ||
535 | CORE_ADDR | |
536 | frame_address_in_block (struct frame_info *frame) | |
537 | { | |
538 | CORE_ADDR pc = frame->pc; | |
539 | ||
540 | /* If we are not in the innermost frame, and we are not interrupted | |
541 | by a signal, frame->pc points to the instruction following the | |
542 | call. As a consequence, we need to get the address of the previous | |
543 | instruction. Unfortunately, this is not straightforward to do, so | |
544 | we just use the address minus one, which is a good enough | |
545 | approximation. */ | |
546 | if (frame->next != 0 && frame->next->signal_handler_caller == 0) | |
547 | --pc; | |
548 | ||
549 | return pc; | |
550 | } | |
c906108c SS |
551 | |
552 | #ifdef FRAME_FIND_SAVED_REGS | |
553 | /* XXX - deprecated. This is a compatibility function for targets | |
554 | that do not yet implement FRAME_INIT_SAVED_REGS. */ | |
555 | /* Find the addresses in which registers are saved in FRAME. */ | |
556 | ||
557 | void | |
fba45db2 KB |
558 | get_frame_saved_regs (struct frame_info *frame, |
559 | struct frame_saved_regs *saved_regs_addr) | |
c906108c SS |
560 | { |
561 | if (frame->saved_regs == NULL) | |
562 | { | |
c5aa993b | 563 | frame->saved_regs = (CORE_ADDR *) |
c906108c SS |
564 | frame_obstack_alloc (SIZEOF_FRAME_SAVED_REGS); |
565 | } | |
566 | if (saved_regs_addr == NULL) | |
567 | { | |
568 | struct frame_saved_regs saved_regs; | |
569 | FRAME_FIND_SAVED_REGS (frame, saved_regs); | |
570 | memcpy (frame->saved_regs, &saved_regs, SIZEOF_FRAME_SAVED_REGS); | |
571 | } | |
572 | else | |
573 | { | |
574 | FRAME_FIND_SAVED_REGS (frame, *saved_regs_addr); | |
575 | memcpy (frame->saved_regs, saved_regs_addr, SIZEOF_FRAME_SAVED_REGS); | |
576 | } | |
577 | } | |
578 | #endif | |
579 | ||
580 | /* Return the innermost lexical block in execution | |
ae767bfb JB |
581 | in a specified stack frame. The frame address is assumed valid. |
582 | ||
583 | If ADDR_IN_BLOCK is non-zero, set *ADDR_IN_BLOCK to the exact code | |
584 | address we used to choose the block. We use this to find a source | |
585 | line, to decide which macro definitions are in scope. | |
586 | ||
587 | The value returned in *ADDR_IN_BLOCK isn't necessarily the frame's | |
588 | PC, and may not really be a valid PC at all. For example, in the | |
589 | caller of a function declared to never return, the code at the | |
590 | return address will never be reached, so the call instruction may | |
591 | be the very last instruction in the block. So the address we use | |
592 | to choose the block is actually one byte before the return address | |
593 | --- hopefully pointing us at the call instruction, or its delay | |
594 | slot instruction. */ | |
c906108c SS |
595 | |
596 | struct block * | |
ae767bfb | 597 | get_frame_block (struct frame_info *frame, CORE_ADDR *addr_in_block) |
c906108c | 598 | { |
42f99ac2 | 599 | const CORE_ADDR pc = frame_address_in_block (frame); |
ae767bfb JB |
600 | |
601 | if (addr_in_block) | |
602 | *addr_in_block = pc; | |
603 | ||
c906108c SS |
604 | return block_for_pc (pc); |
605 | } | |
606 | ||
607 | struct block * | |
ae767bfb | 608 | get_current_block (CORE_ADDR *addr_in_block) |
c906108c | 609 | { |
ae767bfb JB |
610 | CORE_ADDR pc = read_pc (); |
611 | ||
612 | if (addr_in_block) | |
613 | *addr_in_block = pc; | |
614 | ||
615 | return block_for_pc (pc); | |
c906108c SS |
616 | } |
617 | ||
618 | CORE_ADDR | |
fba45db2 | 619 | get_pc_function_start (CORE_ADDR pc) |
c906108c SS |
620 | { |
621 | register struct block *bl; | |
622 | register struct symbol *symbol; | |
623 | register struct minimal_symbol *msymbol; | |
624 | CORE_ADDR fstart; | |
625 | ||
626 | if ((bl = block_for_pc (pc)) != NULL && | |
627 | (symbol = block_function (bl)) != NULL) | |
628 | { | |
629 | bl = SYMBOL_BLOCK_VALUE (symbol); | |
630 | fstart = BLOCK_START (bl); | |
631 | } | |
632 | else if ((msymbol = lookup_minimal_symbol_by_pc (pc)) != NULL) | |
633 | { | |
634 | fstart = SYMBOL_VALUE_ADDRESS (msymbol); | |
28a93f5a PM |
635 | if (!find_pc_section (fstart)) |
636 | return 0; | |
c906108c SS |
637 | } |
638 | else | |
639 | { | |
640 | fstart = 0; | |
641 | } | |
642 | return (fstart); | |
643 | } | |
644 | ||
645 | /* Return the symbol for the function executing in frame FRAME. */ | |
646 | ||
647 | struct symbol * | |
fba45db2 | 648 | get_frame_function (struct frame_info *frame) |
c906108c | 649 | { |
ae767bfb | 650 | register struct block *bl = get_frame_block (frame, 0); |
c906108c SS |
651 | if (bl == 0) |
652 | return 0; | |
653 | return block_function (bl); | |
654 | } | |
655 | \f | |
656 | ||
657 | /* Return the blockvector immediately containing the innermost lexical block | |
658 | containing the specified pc value and section, or 0 if there is none. | |
659 | PINDEX is a pointer to the index value of the block. If PINDEX | |
660 | is NULL, we don't pass this information back to the caller. */ | |
661 | ||
662 | struct blockvector * | |
fba45db2 KB |
663 | blockvector_for_pc_sect (register CORE_ADDR pc, struct sec *section, |
664 | int *pindex, struct symtab *symtab) | |
c906108c SS |
665 | { |
666 | register struct block *b; | |
667 | register int bot, top, half; | |
668 | struct blockvector *bl; | |
669 | ||
c5aa993b | 670 | if (symtab == 0) /* if no symtab specified by caller */ |
c906108c SS |
671 | { |
672 | /* First search all symtabs for one whose file contains our pc */ | |
673 | if ((symtab = find_pc_sect_symtab (pc, section)) == 0) | |
674 | return 0; | |
675 | } | |
676 | ||
677 | bl = BLOCKVECTOR (symtab); | |
678 | b = BLOCKVECTOR_BLOCK (bl, 0); | |
679 | ||
680 | /* Then search that symtab for the smallest block that wins. */ | |
681 | /* Use binary search to find the last block that starts before PC. */ | |
682 | ||
683 | bot = 0; | |
684 | top = BLOCKVECTOR_NBLOCKS (bl); | |
685 | ||
686 | while (top - bot > 1) | |
687 | { | |
688 | half = (top - bot + 1) >> 1; | |
689 | b = BLOCKVECTOR_BLOCK (bl, bot + half); | |
690 | if (BLOCK_START (b) <= pc) | |
691 | bot += half; | |
692 | else | |
693 | top = bot + half; | |
694 | } | |
695 | ||
696 | /* Now search backward for a block that ends after PC. */ | |
697 | ||
698 | while (bot >= 0) | |
699 | { | |
700 | b = BLOCKVECTOR_BLOCK (bl, bot); | |
43e526b9 | 701 | if (BLOCK_END (b) > pc) |
c906108c SS |
702 | { |
703 | if (pindex) | |
704 | *pindex = bot; | |
705 | return bl; | |
706 | } | |
707 | bot--; | |
708 | } | |
709 | return 0; | |
710 | } | |
711 | ||
712 | /* Return the blockvector immediately containing the innermost lexical block | |
713 | containing the specified pc value, or 0 if there is none. | |
714 | Backward compatibility, no section. */ | |
715 | ||
716 | struct blockvector * | |
fba45db2 | 717 | blockvector_for_pc (register CORE_ADDR pc, int *pindex) |
c906108c SS |
718 | { |
719 | return blockvector_for_pc_sect (pc, find_pc_mapped_section (pc), | |
720 | pindex, NULL); | |
721 | } | |
722 | ||
723 | /* Return the innermost lexical block containing the specified pc value | |
724 | in the specified section, or 0 if there is none. */ | |
725 | ||
726 | struct block * | |
fba45db2 | 727 | block_for_pc_sect (register CORE_ADDR pc, struct sec *section) |
c906108c SS |
728 | { |
729 | register struct blockvector *bl; | |
730 | int index; | |
731 | ||
732 | bl = blockvector_for_pc_sect (pc, section, &index, NULL); | |
733 | if (bl) | |
734 | return BLOCKVECTOR_BLOCK (bl, index); | |
735 | return 0; | |
736 | } | |
737 | ||
738 | /* Return the innermost lexical block containing the specified pc value, | |
739 | or 0 if there is none. Backward compatibility, no section. */ | |
740 | ||
741 | struct block * | |
fba45db2 | 742 | block_for_pc (register CORE_ADDR pc) |
c906108c SS |
743 | { |
744 | return block_for_pc_sect (pc, find_pc_mapped_section (pc)); | |
745 | } | |
746 | ||
747 | /* Return the function containing pc value PC in section SECTION. | |
748 | Returns 0 if function is not known. */ | |
749 | ||
750 | struct symbol * | |
fba45db2 | 751 | find_pc_sect_function (CORE_ADDR pc, struct sec *section) |
c906108c SS |
752 | { |
753 | register struct block *b = block_for_pc_sect (pc, section); | |
754 | if (b == 0) | |
755 | return 0; | |
756 | return block_function (b); | |
757 | } | |
758 | ||
759 | /* Return the function containing pc value PC. | |
760 | Returns 0 if function is not known. Backward compatibility, no section */ | |
761 | ||
762 | struct symbol * | |
fba45db2 | 763 | find_pc_function (CORE_ADDR pc) |
c906108c SS |
764 | { |
765 | return find_pc_sect_function (pc, find_pc_mapped_section (pc)); | |
766 | } | |
767 | ||
768 | /* These variables are used to cache the most recent result | |
769 | * of find_pc_partial_function. */ | |
770 | ||
c5aa993b JM |
771 | static CORE_ADDR cache_pc_function_low = 0; |
772 | static CORE_ADDR cache_pc_function_high = 0; | |
773 | static char *cache_pc_function_name = 0; | |
c906108c SS |
774 | static struct sec *cache_pc_function_section = NULL; |
775 | ||
776 | /* Clear cache, e.g. when symbol table is discarded. */ | |
777 | ||
778 | void | |
fba45db2 | 779 | clear_pc_function_cache (void) |
c906108c SS |
780 | { |
781 | cache_pc_function_low = 0; | |
782 | cache_pc_function_high = 0; | |
c5aa993b | 783 | cache_pc_function_name = (char *) 0; |
c906108c SS |
784 | cache_pc_function_section = NULL; |
785 | } | |
786 | ||
787 | /* Finds the "function" (text symbol) that is smaller than PC but | |
788 | greatest of all of the potential text symbols in SECTION. Sets | |
789 | *NAME and/or *ADDRESS conditionally if that pointer is non-null. | |
790 | If ENDADDR is non-null, then set *ENDADDR to be the end of the | |
791 | function (exclusive), but passing ENDADDR as non-null means that | |
792 | the function might cause symbols to be read. This function either | |
793 | succeeds or fails (not halfway succeeds). If it succeeds, it sets | |
794 | *NAME, *ADDRESS, and *ENDADDR to real information and returns 1. | |
795 | If it fails, it sets *NAME, *ADDRESS, and *ENDADDR to zero and | |
796 | returns 0. */ | |
797 | ||
798 | int | |
fba45db2 KB |
799 | find_pc_sect_partial_function (CORE_ADDR pc, asection *section, char **name, |
800 | CORE_ADDR *address, CORE_ADDR *endaddr) | |
c906108c SS |
801 | { |
802 | struct partial_symtab *pst; | |
c5aa993b | 803 | struct symbol *f; |
c906108c SS |
804 | struct minimal_symbol *msymbol; |
805 | struct partial_symbol *psb; | |
c5aa993b | 806 | struct obj_section *osect; |
c906108c SS |
807 | int i; |
808 | CORE_ADDR mapped_pc; | |
809 | ||
810 | mapped_pc = overlay_mapped_address (pc, section); | |
811 | ||
c5aa993b | 812 | if (mapped_pc >= cache_pc_function_low && |
c906108c SS |
813 | mapped_pc < cache_pc_function_high && |
814 | section == cache_pc_function_section) | |
815 | goto return_cached_value; | |
816 | ||
817 | /* If sigtramp is in the u area, it counts as a function (especially | |
818 | important for step_1). */ | |
819 | #if defined SIGTRAMP_START | |
d7bd68ca | 820 | if (PC_IN_SIGTRAMP (mapped_pc, (char *) NULL)) |
c906108c | 821 | { |
c5aa993b JM |
822 | cache_pc_function_low = SIGTRAMP_START (mapped_pc); |
823 | cache_pc_function_high = SIGTRAMP_END (mapped_pc); | |
824 | cache_pc_function_name = "<sigtramp>"; | |
c906108c SS |
825 | cache_pc_function_section = section; |
826 | goto return_cached_value; | |
827 | } | |
828 | #endif | |
829 | ||
830 | msymbol = lookup_minimal_symbol_by_pc_section (mapped_pc, section); | |
831 | pst = find_pc_sect_psymtab (mapped_pc, section); | |
832 | if (pst) | |
833 | { | |
834 | /* Need to read the symbols to get a good value for the end address. */ | |
835 | if (endaddr != NULL && !pst->readin) | |
836 | { | |
837 | /* Need to get the terminal in case symbol-reading produces | |
838 | output. */ | |
839 | target_terminal_ours_for_output (); | |
840 | PSYMTAB_TO_SYMTAB (pst); | |
841 | } | |
842 | ||
843 | if (pst->readin) | |
844 | { | |
845 | /* Checking whether the msymbol has a larger value is for the | |
846 | "pathological" case mentioned in print_frame_info. */ | |
847 | f = find_pc_sect_function (mapped_pc, section); | |
848 | if (f != NULL | |
849 | && (msymbol == NULL | |
850 | || (BLOCK_START (SYMBOL_BLOCK_VALUE (f)) | |
851 | >= SYMBOL_VALUE_ADDRESS (msymbol)))) | |
852 | { | |
c5aa993b JM |
853 | cache_pc_function_low = BLOCK_START (SYMBOL_BLOCK_VALUE (f)); |
854 | cache_pc_function_high = BLOCK_END (SYMBOL_BLOCK_VALUE (f)); | |
855 | cache_pc_function_name = SYMBOL_NAME (f); | |
c906108c SS |
856 | cache_pc_function_section = section; |
857 | goto return_cached_value; | |
858 | } | |
859 | } | |
860 | else | |
861 | { | |
862 | /* Now that static symbols go in the minimal symbol table, perhaps | |
863 | we could just ignore the partial symbols. But at least for now | |
864 | we use the partial or minimal symbol, whichever is larger. */ | |
865 | psb = find_pc_sect_psymbol (pst, mapped_pc, section); | |
866 | ||
867 | if (psb | |
868 | && (msymbol == NULL || | |
869 | (SYMBOL_VALUE_ADDRESS (psb) | |
870 | >= SYMBOL_VALUE_ADDRESS (msymbol)))) | |
871 | { | |
872 | /* This case isn't being cached currently. */ | |
873 | if (address) | |
874 | *address = SYMBOL_VALUE_ADDRESS (psb); | |
875 | if (name) | |
876 | *name = SYMBOL_NAME (psb); | |
877 | /* endaddr non-NULL can't happen here. */ | |
878 | return 1; | |
879 | } | |
880 | } | |
881 | } | |
882 | ||
883 | /* Not in the normal symbol tables, see if the pc is in a known section. | |
884 | If it's not, then give up. This ensures that anything beyond the end | |
885 | of the text seg doesn't appear to be part of the last function in the | |
886 | text segment. */ | |
887 | ||
888 | osect = find_pc_sect_section (mapped_pc, section); | |
889 | ||
890 | if (!osect) | |
891 | msymbol = NULL; | |
892 | ||
893 | /* Must be in the minimal symbol table. */ | |
894 | if (msymbol == NULL) | |
895 | { | |
896 | /* No available symbol. */ | |
897 | if (name != NULL) | |
898 | *name = 0; | |
899 | if (address != NULL) | |
900 | *address = 0; | |
901 | if (endaddr != NULL) | |
902 | *endaddr = 0; | |
903 | return 0; | |
904 | } | |
905 | ||
c5aa993b JM |
906 | cache_pc_function_low = SYMBOL_VALUE_ADDRESS (msymbol); |
907 | cache_pc_function_name = SYMBOL_NAME (msymbol); | |
c906108c SS |
908 | cache_pc_function_section = section; |
909 | ||
910 | /* Use the lesser of the next minimal symbol in the same section, or | |
911 | the end of the section, as the end of the function. */ | |
c5aa993b | 912 | |
c906108c SS |
913 | /* Step over other symbols at this same address, and symbols in |
914 | other sections, to find the next symbol in this section with | |
915 | a different address. */ | |
916 | ||
c5aa993b | 917 | for (i = 1; SYMBOL_NAME (msymbol + i) != NULL; i++) |
c906108c | 918 | { |
c5aa993b JM |
919 | if (SYMBOL_VALUE_ADDRESS (msymbol + i) != SYMBOL_VALUE_ADDRESS (msymbol) |
920 | && SYMBOL_BFD_SECTION (msymbol + i) == SYMBOL_BFD_SECTION (msymbol)) | |
c906108c SS |
921 | break; |
922 | } | |
923 | ||
924 | if (SYMBOL_NAME (msymbol + i) != NULL | |
925 | && SYMBOL_VALUE_ADDRESS (msymbol + i) < osect->endaddr) | |
926 | cache_pc_function_high = SYMBOL_VALUE_ADDRESS (msymbol + i); | |
927 | else | |
928 | /* We got the start address from the last msymbol in the objfile. | |
929 | So the end address is the end of the section. */ | |
930 | cache_pc_function_high = osect->endaddr; | |
931 | ||
c5aa993b | 932 | return_cached_value: |
c906108c SS |
933 | |
934 | if (address) | |
935 | { | |
936 | if (pc_in_unmapped_range (pc, section)) | |
c5aa993b | 937 | *address = overlay_unmapped_address (cache_pc_function_low, section); |
c906108c | 938 | else |
c5aa993b | 939 | *address = cache_pc_function_low; |
c906108c | 940 | } |
c5aa993b | 941 | |
c906108c SS |
942 | if (name) |
943 | *name = cache_pc_function_name; | |
944 | ||
945 | if (endaddr) | |
946 | { | |
947 | if (pc_in_unmapped_range (pc, section)) | |
c5aa993b | 948 | { |
c906108c SS |
949 | /* Because the high address is actually beyond the end of |
950 | the function (and therefore possibly beyond the end of | |
951 | the overlay), we must actually convert (high - 1) | |
952 | and then add one to that. */ | |
953 | ||
c5aa993b | 954 | *endaddr = 1 + overlay_unmapped_address (cache_pc_function_high - 1, |
c906108c | 955 | section); |
c5aa993b | 956 | } |
c906108c | 957 | else |
c5aa993b | 958 | *endaddr = cache_pc_function_high; |
c906108c SS |
959 | } |
960 | ||
961 | return 1; | |
962 | } | |
963 | ||
964 | /* Backward compatibility, no section argument */ | |
965 | ||
966 | int | |
fba45db2 KB |
967 | find_pc_partial_function (CORE_ADDR pc, char **name, CORE_ADDR *address, |
968 | CORE_ADDR *endaddr) | |
c906108c | 969 | { |
c5aa993b | 970 | asection *section; |
c906108c SS |
971 | |
972 | section = find_pc_overlay (pc); | |
973 | return find_pc_sect_partial_function (pc, section, name, address, endaddr); | |
974 | } | |
975 | ||
976 | /* Return the innermost stack frame executing inside of BLOCK, | |
977 | or NULL if there is no such frame. If BLOCK is NULL, just return NULL. */ | |
978 | ||
979 | struct frame_info * | |
fba45db2 | 980 | block_innermost_frame (struct block *block) |
c906108c SS |
981 | { |
982 | struct frame_info *frame; | |
983 | register CORE_ADDR start; | |
984 | register CORE_ADDR end; | |
42f99ac2 | 985 | CORE_ADDR calling_pc; |
c906108c SS |
986 | |
987 | if (block == NULL) | |
988 | return NULL; | |
989 | ||
990 | start = BLOCK_START (block); | |
991 | end = BLOCK_END (block); | |
992 | ||
993 | frame = NULL; | |
994 | while (1) | |
995 | { | |
996 | frame = get_prev_frame (frame); | |
997 | if (frame == NULL) | |
998 | return NULL; | |
42f99ac2 JB |
999 | calling_pc = frame_address_in_block (frame); |
1000 | if (calling_pc >= start && calling_pc < end) | |
c906108c SS |
1001 | return frame; |
1002 | } | |
1003 | } | |
1004 | ||
1005 | /* Return the full FRAME which corresponds to the given CORE_ADDR | |
1006 | or NULL if no FRAME on the chain corresponds to CORE_ADDR. */ | |
1007 | ||
1008 | struct frame_info * | |
fba45db2 | 1009 | find_frame_addr_in_frame_chain (CORE_ADDR frame_addr) |
c906108c SS |
1010 | { |
1011 | struct frame_info *frame = NULL; | |
1012 | ||
c5aa993b | 1013 | if (frame_addr == (CORE_ADDR) 0) |
c906108c SS |
1014 | return NULL; |
1015 | ||
1016 | while (1) | |
1017 | { | |
1018 | frame = get_prev_frame (frame); | |
1019 | if (frame == NULL) | |
1020 | return NULL; | |
1021 | if (FRAME_FP (frame) == frame_addr) | |
1022 | return frame; | |
1023 | } | |
1024 | } | |
1025 | ||
1026 | #ifdef SIGCONTEXT_PC_OFFSET | |
1027 | /* Get saved user PC for sigtramp from sigcontext for BSD style sigtramp. */ | |
1028 | ||
1029 | CORE_ADDR | |
fba45db2 | 1030 | sigtramp_saved_pc (struct frame_info *frame) |
c906108c SS |
1031 | { |
1032 | CORE_ADDR sigcontext_addr; | |
35fc8285 | 1033 | char *buf; |
c906108c SS |
1034 | int ptrbytes = TARGET_PTR_BIT / TARGET_CHAR_BIT; |
1035 | int sigcontext_offs = (2 * TARGET_INT_BIT) / TARGET_CHAR_BIT; | |
1036 | ||
35fc8285 | 1037 | buf = alloca (ptrbytes); |
c906108c SS |
1038 | /* Get sigcontext address, it is the third parameter on the stack. */ |
1039 | if (frame->next) | |
1040 | sigcontext_addr = read_memory_integer (FRAME_ARGS_ADDRESS (frame->next) | |
1041 | + FRAME_ARGS_SKIP | |
1042 | + sigcontext_offs, | |
1043 | ptrbytes); | |
1044 | else | |
1045 | sigcontext_addr = read_memory_integer (read_register (SP_REGNUM) | |
c5aa993b | 1046 | + sigcontext_offs, |
c906108c SS |
1047 | ptrbytes); |
1048 | ||
1049 | /* Don't cause a memory_error when accessing sigcontext in case the stack | |
1050 | layout has changed or the stack is corrupt. */ | |
1051 | target_read_memory (sigcontext_addr + SIGCONTEXT_PC_OFFSET, buf, ptrbytes); | |
1052 | return extract_unsigned_integer (buf, ptrbytes); | |
1053 | } | |
1054 | #endif /* SIGCONTEXT_PC_OFFSET */ | |
1055 | ||
7a292a7a SS |
1056 | |
1057 | /* Are we in a call dummy? The code below which allows DECR_PC_AFTER_BREAK | |
1058 | below is for infrun.c, which may give the macro a pc without that | |
1059 | subtracted out. */ | |
1060 | ||
1061 | extern CORE_ADDR text_end; | |
1062 | ||
1063 | int | |
fba45db2 KB |
1064 | pc_in_call_dummy_before_text_end (CORE_ADDR pc, CORE_ADDR sp, |
1065 | CORE_ADDR frame_address) | |
7a292a7a SS |
1066 | { |
1067 | return ((pc) >= text_end - CALL_DUMMY_LENGTH | |
1068 | && (pc) <= text_end + DECR_PC_AFTER_BREAK); | |
1069 | } | |
1070 | ||
1071 | int | |
fba45db2 KB |
1072 | pc_in_call_dummy_after_text_end (CORE_ADDR pc, CORE_ADDR sp, |
1073 | CORE_ADDR frame_address) | |
7a292a7a SS |
1074 | { |
1075 | return ((pc) >= text_end | |
1076 | && (pc) <= text_end + CALL_DUMMY_LENGTH + DECR_PC_AFTER_BREAK); | |
1077 | } | |
1078 | ||
1079 | /* Is the PC in a call dummy? SP and FRAME_ADDRESS are the bottom and | |
1080 | top of the stack frame which we are checking, where "bottom" and | |
1081 | "top" refer to some section of memory which contains the code for | |
1082 | the call dummy. Calls to this macro assume that the contents of | |
1083 | SP_REGNUM and FP_REGNUM (or the saved values thereof), respectively, | |
1084 | are the things to pass. | |
1085 | ||
1086 | This won't work on the 29k, where SP_REGNUM and FP_REGNUM don't | |
1087 | have that meaning, but the 29k doesn't use ON_STACK. This could be | |
1088 | fixed by generalizing this scheme, perhaps by passing in a frame | |
1089 | and adding a few fields, at least on machines which need them for | |
1090 | PC_IN_CALL_DUMMY. | |
1091 | ||
1092 | Something simpler, like checking for the stack segment, doesn't work, | |
1093 | since various programs (threads implementations, gcc nested function | |
1094 | stubs, etc) may either allocate stack frames in another segment, or | |
1095 | allocate other kinds of code on the stack. */ | |
1096 | ||
1097 | int | |
fba45db2 | 1098 | pc_in_call_dummy_on_stack (CORE_ADDR pc, CORE_ADDR sp, CORE_ADDR frame_address) |
7a292a7a SS |
1099 | { |
1100 | return (INNER_THAN ((sp), (pc)) | |
1101 | && (frame_address != 0) | |
1102 | && INNER_THAN ((pc), (frame_address))); | |
1103 | } | |
1104 | ||
1105 | int | |
fba45db2 KB |
1106 | pc_in_call_dummy_at_entry_point (CORE_ADDR pc, CORE_ADDR sp, |
1107 | CORE_ADDR frame_address) | |
7a292a7a SS |
1108 | { |
1109 | return ((pc) >= CALL_DUMMY_ADDRESS () | |
1110 | && (pc) <= (CALL_DUMMY_ADDRESS () + DECR_PC_AFTER_BREAK)); | |
1111 | } | |
1112 | ||
c906108c SS |
1113 | |
1114 | /* | |
1115 | * GENERIC DUMMY FRAMES | |
1116 | * | |
1117 | * The following code serves to maintain the dummy stack frames for | |
1118 | * inferior function calls (ie. when gdb calls into the inferior via | |
1119 | * call_function_by_hand). This code saves the machine state before | |
b7d6b182 | 1120 | * the call in host memory, so we must maintain an independent stack |
c906108c SS |
1121 | * and keep it consistant etc. I am attempting to make this code |
1122 | * generic enough to be used by many targets. | |
1123 | * | |
1124 | * The cheapest and most generic way to do CALL_DUMMY on a new target | |
1125 | * is probably to define CALL_DUMMY to be empty, CALL_DUMMY_LENGTH to | |
1126 | * zero, and CALL_DUMMY_LOCATION to AT_ENTRY. Then you must remember | |
1127 | * to define PUSH_RETURN_ADDRESS, because no call instruction will be | |
1128 | * being executed by the target. Also FRAME_CHAIN_VALID as | |
c4093a6a | 1129 | * generic_{file,func}_frame_chain_valid and FIX_CALL_DUMMY as |
cce74817 | 1130 | * generic_fix_call_dummy. */ |
c906108c | 1131 | |
7a292a7a SS |
1132 | /* Dummy frame. This saves the processor state just prior to setting |
1133 | up the inferior function call. Older targets save the registers | |
72229eb7 | 1134 | on the target stack (but that really slows down function calls). */ |
7a292a7a SS |
1135 | |
1136 | struct dummy_frame | |
1137 | { | |
1138 | struct dummy_frame *next; | |
1139 | ||
1140 | CORE_ADDR pc; | |
1141 | CORE_ADDR fp; | |
1142 | CORE_ADDR sp; | |
43ff13b4 | 1143 | CORE_ADDR top; |
b4d83933 | 1144 | struct regcache *regcache; |
6096c27a AC |
1145 | |
1146 | /* Address range of the call dummy code. Look for PC in the range | |
1147 | [LO..HI) (after allowing for DECR_PC_AFTER_BREAK). */ | |
1148 | CORE_ADDR call_lo; | |
1149 | CORE_ADDR call_hi; | |
7a292a7a SS |
1150 | }; |
1151 | ||
c906108c SS |
1152 | static struct dummy_frame *dummy_frame_stack = NULL; |
1153 | ||
1154 | /* Function: find_dummy_frame(pc, fp, sp) | |
6096c27a AC |
1155 | |
1156 | Search the stack of dummy frames for one matching the given PC, FP | |
1157 | and SP. Unlike PC_IN_CALL_DUMMY, this function doesn't need to | |
1158 | adjust for DECR_PC_AFTER_BREAK. This is because it is only legal | |
1159 | to call this function after the PC has been adjusted. */ | |
c906108c | 1160 | |
b4d83933 | 1161 | static struct regcache * |
fba45db2 | 1162 | generic_find_dummy_frame (CORE_ADDR pc, CORE_ADDR fp) |
c906108c | 1163 | { |
c5aa993b | 1164 | struct dummy_frame *dummyframe; |
c906108c | 1165 | |
c906108c SS |
1166 | for (dummyframe = dummy_frame_stack; dummyframe != NULL; |
1167 | dummyframe = dummyframe->next) | |
6096c27a AC |
1168 | if ((pc >= dummyframe->call_lo && pc < dummyframe->call_hi) |
1169 | && (fp == dummyframe->fp | |
1170 | || fp == dummyframe->sp | |
1171 | || fp == dummyframe->top)) | |
c906108c | 1172 | /* The frame in question lies between the saved fp and sp, inclusive */ |
b4d83933 | 1173 | return dummyframe->regcache; |
c906108c SS |
1174 | |
1175 | return 0; | |
1176 | } | |
1177 | ||
da130f98 AC |
1178 | char * |
1179 | deprecated_generic_find_dummy_frame (CORE_ADDR pc, CORE_ADDR fp) | |
1180 | { | |
b4d83933 AC |
1181 | struct regcache *regcache = generic_find_dummy_frame (pc, fp); |
1182 | if (regcache == NULL) | |
1183 | return NULL; | |
1184 | return deprecated_grub_regcache_for_registers (regcache); | |
da130f98 AC |
1185 | } |
1186 | ||
6096c27a AC |
1187 | /* Function: pc_in_call_dummy (pc, sp, fp) |
1188 | ||
1189 | Return true if the PC falls in a dummy frame created by gdb for an | |
1190 | inferior call. The code below which allows DECR_PC_AFTER_BREAK is | |
1191 | for infrun.c, which may give the function a PC without that | |
1192 | subtracted out. */ | |
c906108c SS |
1193 | |
1194 | int | |
fba45db2 | 1195 | generic_pc_in_call_dummy (CORE_ADDR pc, CORE_ADDR sp, CORE_ADDR fp) |
c906108c | 1196 | { |
6096c27a AC |
1197 | struct dummy_frame *dummyframe; |
1198 | for (dummyframe = dummy_frame_stack; | |
1199 | dummyframe != NULL; | |
1200 | dummyframe = dummyframe->next) | |
1201 | { | |
1202 | if ((pc >= dummyframe->call_lo) | |
1203 | && (pc < dummyframe->call_hi + DECR_PC_AFTER_BREAK)) | |
1204 | return 1; | |
1205 | } | |
1206 | return 0; | |
c906108c SS |
1207 | } |
1208 | ||
1209 | /* Function: read_register_dummy | |
1210 | Find a saved register from before GDB calls a function in the inferior */ | |
1211 | ||
1212 | CORE_ADDR | |
fba45db2 | 1213 | generic_read_register_dummy (CORE_ADDR pc, CORE_ADDR fp, int regno) |
c906108c | 1214 | { |
b4d83933 | 1215 | struct regcache *dummy_regs = generic_find_dummy_frame (pc, fp); |
c906108c SS |
1216 | |
1217 | if (dummy_regs) | |
0818c12a | 1218 | return regcache_raw_read_as_address (dummy_regs, regno); |
c906108c SS |
1219 | else |
1220 | return 0; | |
1221 | } | |
1222 | ||
1223 | /* Save all the registers on the dummy frame stack. Most ports save the | |
1224 | registers on the target stack. This results in lots of unnecessary memory | |
1225 | references, which are slow when debugging via a serial line. Instead, we | |
1226 | save all the registers internally, and never write them to the stack. The | |
1227 | registers get restored when the called function returns to the entry point, | |
1228 | where a breakpoint is laying in wait. */ | |
1229 | ||
1230 | void | |
fba45db2 | 1231 | generic_push_dummy_frame (void) |
c906108c SS |
1232 | { |
1233 | struct dummy_frame *dummy_frame; | |
1234 | CORE_ADDR fp = (get_current_frame ())->frame; | |
1235 | ||
1236 | /* check to see if there are stale dummy frames, | |
1237 | perhaps left over from when a longjump took us out of a | |
1238 | function that was called by the debugger */ | |
1239 | ||
1240 | dummy_frame = dummy_frame_stack; | |
1241 | while (dummy_frame) | |
1242 | if (INNER_THAN (dummy_frame->fp, fp)) /* stale -- destroy! */ | |
1243 | { | |
1244 | dummy_frame_stack = dummy_frame->next; | |
b4d83933 | 1245 | regcache_xfree (dummy_frame->regcache); |
b8c9b27d | 1246 | xfree (dummy_frame); |
c906108c SS |
1247 | dummy_frame = dummy_frame_stack; |
1248 | } | |
1249 | else | |
1250 | dummy_frame = dummy_frame->next; | |
1251 | ||
1252 | dummy_frame = xmalloc (sizeof (struct dummy_frame)); | |
b4d83933 | 1253 | dummy_frame->regcache = regcache_xmalloc (current_gdbarch); |
7a292a7a | 1254 | |
4478b372 JB |
1255 | dummy_frame->pc = read_pc (); |
1256 | dummy_frame->sp = read_sp (); | |
c5aa993b JM |
1257 | dummy_frame->top = dummy_frame->sp; |
1258 | dummy_frame->fp = fp; | |
b4d83933 | 1259 | regcache_cpy (dummy_frame->regcache, current_regcache); |
c906108c SS |
1260 | dummy_frame->next = dummy_frame_stack; |
1261 | dummy_frame_stack = dummy_frame; | |
1262 | } | |
1263 | ||
43ff13b4 | 1264 | void |
fba45db2 | 1265 | generic_save_dummy_frame_tos (CORE_ADDR sp) |
43ff13b4 JM |
1266 | { |
1267 | dummy_frame_stack->top = sp; | |
1268 | } | |
1269 | ||
6096c27a AC |
1270 | /* Record the upper/lower bounds on the address of the call dummy. */ |
1271 | ||
1272 | void | |
1273 | generic_save_call_dummy_addr (CORE_ADDR lo, CORE_ADDR hi) | |
1274 | { | |
1275 | dummy_frame_stack->call_lo = lo; | |
1276 | dummy_frame_stack->call_hi = hi; | |
1277 | } | |
1278 | ||
ed9a39eb | 1279 | /* Restore the machine state from either the saved dummy stack or a |
c906108c SS |
1280 | real stack frame. */ |
1281 | ||
1282 | void | |
ed9a39eb | 1283 | generic_pop_current_frame (void (*popper) (struct frame_info * frame)) |
c906108c SS |
1284 | { |
1285 | struct frame_info *frame = get_current_frame (); | |
ed9a39eb | 1286 | |
c5aa993b | 1287 | if (PC_IN_CALL_DUMMY (frame->pc, frame->frame, frame->frame)) |
c906108c SS |
1288 | generic_pop_dummy_frame (); |
1289 | else | |
ed9a39eb | 1290 | (*popper) (frame); |
c906108c SS |
1291 | } |
1292 | ||
1293 | /* Function: pop_dummy_frame | |
1294 | Restore the machine state from a saved dummy stack frame. */ | |
1295 | ||
1296 | void | |
fba45db2 | 1297 | generic_pop_dummy_frame (void) |
c906108c SS |
1298 | { |
1299 | struct dummy_frame *dummy_frame = dummy_frame_stack; | |
1300 | ||
1301 | /* FIXME: what if the first frame isn't the right one, eg.. | |
1302 | because one call-by-hand function has done a longjmp into another one? */ | |
1303 | ||
1304 | if (!dummy_frame) | |
1305 | error ("Can't pop dummy frame!"); | |
1306 | dummy_frame_stack = dummy_frame->next; | |
b4d83933 | 1307 | regcache_cpy (current_regcache, dummy_frame->regcache); |
c906108c | 1308 | flush_cached_frames (); |
7a292a7a | 1309 | |
b4d83933 | 1310 | regcache_xfree (dummy_frame->regcache); |
b8c9b27d | 1311 | xfree (dummy_frame); |
c906108c SS |
1312 | } |
1313 | ||
1314 | /* Function: frame_chain_valid | |
1315 | Returns true for a user frame or a call_function_by_hand dummy frame, | |
1316 | and false for the CRT0 start-up frame. Purpose is to terminate backtrace */ | |
c5aa993b | 1317 | |
c906108c | 1318 | int |
fba45db2 | 1319 | generic_file_frame_chain_valid (CORE_ADDR fp, struct frame_info *fi) |
c906108c | 1320 | { |
c5aa993b JM |
1321 | if (PC_IN_CALL_DUMMY (FRAME_SAVED_PC (fi), fp, fp)) |
1322 | return 1; /* don't prune CALL_DUMMY frames */ | |
1323 | else /* fall back to default algorithm (see frame.h) */ | |
c906108c SS |
1324 | return (fp != 0 |
1325 | && (INNER_THAN (fi->frame, fp) || fi->frame == fp) | |
c5aa993b | 1326 | && !inside_entry_file (FRAME_SAVED_PC (fi))); |
c906108c | 1327 | } |
c5aa993b | 1328 | |
c4093a6a | 1329 | int |
fba45db2 | 1330 | generic_func_frame_chain_valid (CORE_ADDR fp, struct frame_info *fi) |
c4093a6a | 1331 | { |
ca0d0b52 AC |
1332 | if (USE_GENERIC_DUMMY_FRAMES |
1333 | && PC_IN_CALL_DUMMY ((fi)->pc, 0, 0)) | |
c4093a6a JM |
1334 | return 1; /* don't prune CALL_DUMMY frames */ |
1335 | else /* fall back to default algorithm (see frame.h) */ | |
1336 | return (fp != 0 | |
1337 | && (INNER_THAN (fi->frame, fp) || fi->frame == fp) | |
1338 | && !inside_main_func ((fi)->pc) | |
1339 | && !inside_entry_func ((fi)->pc)); | |
1340 | } | |
1341 | ||
cce74817 | 1342 | /* Function: fix_call_dummy |
c570663e | 1343 | Stub function. Generic dummy frames typically do not need to fix |
cce74817 JM |
1344 | the frame being created */ |
1345 | ||
1346 | void | |
fba45db2 KB |
1347 | generic_fix_call_dummy (char *dummy, CORE_ADDR pc, CORE_ADDR fun, int nargs, |
1348 | struct value **args, struct type *type, int gcc_p) | |
cce74817 JM |
1349 | { |
1350 | return; | |
1351 | } | |
1352 | ||
4f460812 AC |
1353 | /* Given a call-dummy dummy-frame, return the registers. Here the |
1354 | register value is taken from the local copy of the register buffer. */ | |
1355 | ||
1356 | static void | |
1357 | generic_call_dummy_register_unwind (struct frame_info *frame, void **cache, | |
1358 | int regnum, int *optimized, | |
1359 | enum lval_type *lvalp, CORE_ADDR *addrp, | |
1360 | int *realnum, void *bufferp) | |
1361 | { | |
1362 | gdb_assert (frame != NULL); | |
1363 | gdb_assert (PC_IN_CALL_DUMMY (frame->pc, frame->frame, frame->frame)); | |
1364 | ||
1365 | /* Describe the register's location. Generic dummy frames always | |
1366 | have the register value in an ``expression''. */ | |
1367 | *optimized = 0; | |
1368 | *lvalp = not_lval; | |
1369 | *addrp = 0; | |
1370 | *realnum = -1; | |
1371 | ||
1372 | /* If needed, find and return the value of the register. */ | |
1373 | if (bufferp != NULL) | |
1374 | { | |
b4d83933 | 1375 | struct regcache *registers; |
4f460812 AC |
1376 | #if 1 |
1377 | /* Get the address of the register buffer that contains all the | |
1378 | saved registers for this dummy frame. Cache that address. */ | |
1379 | registers = (*cache); | |
1380 | if (registers == NULL) | |
1381 | { | |
1382 | registers = generic_find_dummy_frame (frame->pc, frame->frame); | |
1383 | (*cache) = registers; | |
1384 | } | |
1385 | #else | |
1386 | /* Get the address of the register buffer that contains the | |
1387 | saved registers and then extract the value from that. */ | |
1388 | registers = generic_find_dummy_frame (frame->pc, frame->frame); | |
1389 | #endif | |
1390 | gdb_assert (registers != NULL); | |
1391 | /* Return the actual value. */ | |
b4d83933 AC |
1392 | /* FIXME: cagney/2002-06-26: This should be via the |
1393 | gdbarch_register_read() method so that it, on the fly, | |
1394 | constructs either a raw or pseudo register from the raw | |
1395 | register cache. */ | |
0818c12a | 1396 | regcache_raw_read (registers, regnum, bufferp); |
4f460812 AC |
1397 | } |
1398 | } | |
1399 | ||
1400 | /* Return the register saved in the simplistic ``saved_regs'' cache. | |
1401 | If the value isn't here AND a value is needed, try the next inner | |
1402 | most frame. */ | |
1403 | ||
1404 | static void | |
1405 | frame_saved_regs_register_unwind (struct frame_info *frame, void **cache, | |
1406 | int regnum, int *optimizedp, | |
1407 | enum lval_type *lvalp, CORE_ADDR *addrp, | |
1408 | int *realnump, void *bufferp) | |
1409 | { | |
1410 | /* There is always a frame at this point. And THIS is the frame | |
1411 | we're interested in. */ | |
1412 | gdb_assert (frame != NULL); | |
fbcdb4a3 KB |
1413 | /* If we're using generic dummy frames, we'd better not be in a call |
1414 | dummy. (generic_call_dummy_register_unwind ought to have been called | |
1415 | instead.) */ | |
1416 | gdb_assert (!(USE_GENERIC_DUMMY_FRAMES | |
1417 | && PC_IN_CALL_DUMMY (frame->pc, frame->frame, frame->frame))); | |
4f460812 AC |
1418 | |
1419 | /* Load the saved_regs register cache. */ | |
1420 | if (frame->saved_regs == NULL) | |
1421 | FRAME_INIT_SAVED_REGS (frame); | |
1422 | ||
1423 | if (frame->saved_regs != NULL | |
1424 | && frame->saved_regs[regnum] != 0) | |
1425 | { | |
1426 | if (regnum == SP_REGNUM) | |
1427 | { | |
1428 | /* SP register treated specially. */ | |
1429 | *optimizedp = 0; | |
1430 | *lvalp = not_lval; | |
1431 | *addrp = 0; | |
1432 | *realnump = -1; | |
1433 | if (bufferp != NULL) | |
1434 | store_address (bufferp, REGISTER_RAW_SIZE (regnum), | |
1435 | frame->saved_regs[regnum]); | |
1436 | } | |
1437 | else | |
1438 | { | |
1439 | /* Any other register is saved in memory, fetch it but cache | |
1440 | a local copy of its value. */ | |
1441 | *optimizedp = 0; | |
1442 | *lvalp = lval_memory; | |
1443 | *addrp = frame->saved_regs[regnum]; | |
1444 | *realnump = -1; | |
1445 | if (bufferp != NULL) | |
1446 | { | |
1447 | #if 1 | |
1448 | /* Save each register value, as it is read in, in a | |
1449 | frame based cache. */ | |
1450 | void **regs = (*cache); | |
1451 | if (regs == NULL) | |
1452 | { | |
1453 | int sizeof_cache = ((NUM_REGS + NUM_PSEUDO_REGS) | |
1454 | * sizeof (void *)); | |
1455 | regs = frame_obstack_alloc (sizeof_cache); | |
1456 | memset (regs, 0, sizeof_cache); | |
1457 | (*cache) = regs; | |
1458 | } | |
1459 | if (regs[regnum] == NULL) | |
1460 | { | |
1461 | regs[regnum] | |
1462 | = frame_obstack_alloc (REGISTER_RAW_SIZE (regnum)); | |
1463 | read_memory (frame->saved_regs[regnum], regs[regnum], | |
1464 | REGISTER_RAW_SIZE (regnum)); | |
1465 | } | |
1466 | memcpy (bufferp, regs[regnum], REGISTER_RAW_SIZE (regnum)); | |
1467 | #else | |
1468 | /* Read the value in from memory. */ | |
1469 | read_memory (frame->saved_regs[regnum], bufferp, | |
1470 | REGISTER_RAW_SIZE (regnum)); | |
1471 | #endif | |
1472 | } | |
1473 | } | |
1474 | return; | |
1475 | } | |
1476 | ||
1477 | /* No luck, assume this and the next frame have the same register | |
1478 | value. If a value is needed, pass the request on down the chain; | |
1479 | otherwise just return an indication that the value is in the same | |
1480 | register as the next frame. */ | |
1481 | if (bufferp == NULL) | |
1482 | { | |
1483 | *optimizedp = 0; | |
1484 | *lvalp = lval_register; | |
1485 | *addrp = 0; | |
1486 | *realnump = regnum; | |
1487 | } | |
1488 | else | |
1489 | { | |
1490 | frame_register_unwind (frame->next, regnum, optimizedp, lvalp, addrp, | |
1491 | realnump, bufferp); | |
1492 | } | |
1493 | } | |
1494 | ||
c906108c SS |
1495 | /* Function: get_saved_register |
1496 | Find register number REGNUM relative to FRAME and put its (raw, | |
1497 | target format) contents in *RAW_BUFFER. | |
1498 | ||
1499 | Set *OPTIMIZED if the variable was optimized out (and thus can't be | |
1500 | fetched). Note that this is never set to anything other than zero | |
1501 | in this implementation. | |
1502 | ||
1503 | Set *LVAL to lval_memory, lval_register, or not_lval, depending on | |
1504 | whether the value was fetched from memory, from a register, or in a | |
1505 | strange and non-modifiable way (e.g. a frame pointer which was | |
1506 | calculated rather than fetched). We will use not_lval for values | |
1507 | fetched from generic dummy frames. | |
1508 | ||
7036d6ce | 1509 | Set *ADDRP to the address, either in memory or as a REGISTER_BYTE |
c906108c SS |
1510 | offset into the registers array. If the value is stored in a dummy |
1511 | frame, set *ADDRP to zero. | |
1512 | ||
1513 | To use this implementation, define a function called | |
1514 | "get_saved_register" in your target code, which simply passes all | |
1515 | of its arguments to this function. | |
1516 | ||
1517 | The argument RAW_BUFFER must point to aligned memory. */ | |
1518 | ||
1519 | void | |
fba45db2 KB |
1520 | generic_get_saved_register (char *raw_buffer, int *optimized, CORE_ADDR *addrp, |
1521 | struct frame_info *frame, int regnum, | |
1522 | enum lval_type *lval) | |
c906108c SS |
1523 | { |
1524 | if (!target_has_registers) | |
1525 | error ("No registers."); | |
1526 | ||
1527 | /* Normal systems don't optimize out things with register numbers. */ | |
1528 | if (optimized != NULL) | |
1529 | *optimized = 0; | |
1530 | ||
c5aa993b | 1531 | if (addrp) /* default assumption: not found in memory */ |
c906108c SS |
1532 | *addrp = 0; |
1533 | ||
1534 | /* Note: since the current frame's registers could only have been | |
1535 | saved by frames INTERIOR TO the current frame, we skip examining | |
1536 | the current frame itself: otherwise, we would be getting the | |
1537 | previous frame's registers which were saved by the current frame. */ | |
1538 | ||
1539 | while (frame && ((frame = frame->next) != NULL)) | |
1540 | { | |
1541 | if (PC_IN_CALL_DUMMY (frame->pc, frame->frame, frame->frame)) | |
1542 | { | |
c5aa993b | 1543 | if (lval) /* found it in a CALL_DUMMY frame */ |
c906108c SS |
1544 | *lval = not_lval; |
1545 | if (raw_buffer) | |
b4d83933 AC |
1546 | /* FIXME: cagney/2002-06-26: This should be via the |
1547 | gdbarch_register_read() method so that it, on the fly, | |
1548 | constructs either a raw or pseudo register from the raw | |
1549 | register cache. */ | |
0818c12a AC |
1550 | regcache_raw_read (generic_find_dummy_frame (frame->pc, |
1551 | frame->frame), | |
1552 | regnum, raw_buffer); | |
c5aa993b | 1553 | return; |
c906108c SS |
1554 | } |
1555 | ||
1556 | FRAME_INIT_SAVED_REGS (frame); | |
1557 | if (frame->saved_regs != NULL | |
1558 | && frame->saved_regs[regnum] != 0) | |
1559 | { | |
c5aa993b | 1560 | if (lval) /* found it saved on the stack */ |
c906108c SS |
1561 | *lval = lval_memory; |
1562 | if (regnum == SP_REGNUM) | |
1563 | { | |
c5aa993b JM |
1564 | if (raw_buffer) /* SP register treated specially */ |
1565 | store_address (raw_buffer, REGISTER_RAW_SIZE (regnum), | |
c906108c SS |
1566 | frame->saved_regs[regnum]); |
1567 | } | |
1568 | else | |
1569 | { | |
c5aa993b | 1570 | if (addrp) /* any other register */ |
c906108c SS |
1571 | *addrp = frame->saved_regs[regnum]; |
1572 | if (raw_buffer) | |
c5aa993b | 1573 | read_memory (frame->saved_regs[regnum], raw_buffer, |
c906108c SS |
1574 | REGISTER_RAW_SIZE (regnum)); |
1575 | } | |
1576 | return; | |
1577 | } | |
1578 | } | |
1579 | ||
1580 | /* If we get thru the loop to this point, it means the register was | |
1581 | not saved in any frame. Return the actual live-register value. */ | |
1582 | ||
c5aa993b | 1583 | if (lval) /* found it in a live register */ |
c906108c SS |
1584 | *lval = lval_register; |
1585 | if (addrp) | |
1586 | *addrp = REGISTER_BYTE (regnum); | |
1587 | if (raw_buffer) | |
1588 | read_register_gen (regnum, raw_buffer); | |
1589 | } | |
c906108c SS |
1590 | |
1591 | void | |
53a5351d | 1592 | _initialize_blockframe (void) |
c906108c SS |
1593 | { |
1594 | obstack_init (&frame_cache_obstack); | |
1595 | } |