1 /* Get info from stack frames; convert between frames, blocks,
2 functions and pc values.
4 Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994,
5 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002 Free Software
8 This file is part of GDB.
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.
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.
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. */
32 #include "value.h" /* for read_register */
33 #include "target.h" /* for target_has_stack */
34 #include "inferior.h" /* for read_pc */
37 #include "gdb_assert.h"
39 /* Prototypes for exported functions. */
41 static void generic_call_dummy_register_unwind (struct frame_info
*frame
,
49 static void frame_saved_regs_register_unwind (struct frame_info
*frame
,
59 void _initialize_blockframe (void);
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. */
66 file_frame_chain_valid (CORE_ADDR chain
, struct frame_info
*thisframe
)
69 && !inside_entry_file (FRAME_SAVED_PC (thisframe
)));
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. */
77 func_frame_chain_valid (CORE_ADDR chain
, struct frame_info
*thisframe
)
80 && !inside_main_func ((thisframe
)->pc
)
81 && !inside_entry_func ((thisframe
)->pc
));
84 /* A very simple method of determining a valid frame */
87 nonnull_frame_chain_valid (CORE_ADDR chain
, struct frame_info
*thisframe
)
89 return ((chain
) != 0);
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
98 A PC of zero is always considered to be the bottom of the stack. */
101 inside_entry_file (CORE_ADDR addr
)
105 if (symfile_objfile
== 0)
107 if (CALL_DUMMY_LOCATION
== AT_ENTRY_POINT
)
109 /* Do not stop backtracing if the pc is in the call dummy
110 at the entry point. */
111 /* FIXME: Won't always work with zeros for the last two arguments */
112 if (PC_IN_CALL_DUMMY (addr
, 0, 0))
115 return (addr
>= symfile_objfile
->ei
.entry_file_lowpc
&&
116 addr
< symfile_objfile
->ei
.entry_file_highpc
);
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.
123 Typically called from FRAME_CHAIN_VALID.
125 A PC of zero is always considered to be the bottom of the stack. */
128 inside_main_func (CORE_ADDR pc
)
132 if (symfile_objfile
== 0)
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. */
139 if (symfile_objfile
->ei
.main_func_lowpc
== INVALID_ENTRY_LOWPC
&&
140 symfile_objfile
->ei
.main_func_highpc
== INVALID_ENTRY_HIGHPC
)
142 struct symbol
*mainsym
;
144 mainsym
= lookup_symbol (main_name (), NULL
, VAR_NAMESPACE
, NULL
, NULL
);
145 if (mainsym
&& SYMBOL_CLASS (mainsym
) == LOC_BLOCK
)
147 symfile_objfile
->ei
.main_func_lowpc
=
148 BLOCK_START (SYMBOL_BLOCK_VALUE (mainsym
));
149 symfile_objfile
->ei
.main_func_highpc
=
150 BLOCK_END (SYMBOL_BLOCK_VALUE (mainsym
));
153 return (symfile_objfile
->ei
.main_func_lowpc
<= pc
&&
154 symfile_objfile
->ei
.main_func_highpc
> pc
);
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.
161 Typically called from FRAME_CHAIN_VALID.
163 A PC of zero is always considered to be the bottom of the stack. */
166 inside_entry_func (CORE_ADDR pc
)
170 if (symfile_objfile
== 0)
172 if (CALL_DUMMY_LOCATION
== AT_ENTRY_POINT
)
174 /* Do not stop backtracing if the pc is in the call dummy
175 at the entry point. */
176 /* FIXME: Won't always work with zeros for the last two arguments */
177 if (PC_IN_CALL_DUMMY (pc
, 0, 0))
180 return (symfile_objfile
->ei
.entry_func_lowpc
<= pc
&&
181 symfile_objfile
->ei
.entry_func_highpc
> pc
);
184 /* Info about the innermost stack frame (contents of FP register) */
186 static struct frame_info
*current_frame
;
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. */
192 static struct obstack frame_cache_obstack
;
195 frame_obstack_alloc (unsigned long size
)
197 return obstack_alloc (&frame_cache_obstack
, size
);
201 frame_saved_regs_zalloc (struct frame_info
*fi
)
203 fi
->saved_regs
= (CORE_ADDR
*)
204 frame_obstack_alloc (SIZEOF_FRAME_SAVED_REGS
);
205 memset (fi
->saved_regs
, 0, SIZEOF_FRAME_SAVED_REGS
);
209 /* Return the innermost (currently executing) stack frame. */
212 get_current_frame (void)
214 if (current_frame
== NULL
)
216 if (target_has_stack
)
217 current_frame
= create_new_frame (read_fp (), read_pc ());
221 return current_frame
;
225 set_current_frame (struct frame_info
*frame
)
227 current_frame
= frame
;
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. */
236 set_unwind_by_pc (CORE_ADDR pc
, CORE_ADDR fp
,
237 frame_register_unwind_ftype
**unwind
)
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
;
248 *unwind
= frame_saved_regs_register_unwind
;
251 /* Create an arbitrary (i.e. address specified by user) or innermost frame.
252 Always returns a non-NULL value. */
255 create_new_frame (CORE_ADDR addr
, CORE_ADDR pc
)
257 struct frame_info
*fi
;
260 fi
= (struct frame_info
*)
261 obstack_alloc (&frame_cache_obstack
,
262 sizeof (struct frame_info
));
264 /* Zero all fields by default. */
265 memset (fi
, 0, sizeof (struct frame_info
));
269 find_pc_partial_function (pc
, &name
, (CORE_ADDR
*) NULL
, (CORE_ADDR
*) NULL
);
270 fi
->signal_handler_caller
= PC_IN_SIGTRAMP (fi
->pc
, name
);
272 if (INIT_EXTRA_FRAME_INFO_P ())
273 INIT_EXTRA_FRAME_INFO (0, fi
);
275 /* Select/initialize an unwind function. */
276 set_unwind_by_pc (fi
->pc
, fi
->frame
, &fi
->register_unwind
);
281 /* Return the frame that FRAME calls (NULL if FRAME is the innermost
285 get_next_frame (struct frame_info
*frame
)
290 /* Flush the entire frame cache. */
293 flush_cached_frames (void)
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
);
299 current_frame
= NULL
; /* Invalidate cache */
301 annotate_frames_invalid ();
304 /* Flush the frame cache, and start a new one if necessary. */
307 reinit_frame_cache (void)
309 flush_cached_frames ();
311 /* FIXME: The inferior_ptid test is wrong if there is a corefile. */
312 if (PIDGET (inferior_ptid
) != 0)
314 select_frame (get_current_frame ());
318 /* Return nonzero if the function for this frame lacks a prologue. Many
319 machines can define FRAMELESS_FUNCTION_INVOCATION to just call this
323 frameless_look_for_prologue (struct frame_info
*frame
)
325 CORE_ADDR func_start
, after_prologue
;
327 func_start
= get_pc_function_start (frame
->pc
);
330 func_start
+= FUNCTION_START_OFFSET
;
331 /* This is faster, since only care whether there *is* a
332 prologue, not how long it is. */
333 return PROLOGUE_FRAMELESS_P (func_start
);
335 else if (frame
->pc
== 0)
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. */
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. */
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. */
354 get_prev_frame (struct frame_info
*next_frame
)
356 CORE_ADDR address
= 0;
357 struct frame_info
*prev
;
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. */
368 /* This screws value_of_variable, which just wants a nice clean
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. */
374 error ("You haven't set up a process's stack to examine.");
378 return current_frame
;
381 /* If we have the prev one, return it */
382 if (next_frame
->prev
)
383 return next_frame
->prev
;
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. */
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
))
396 fromleaf
= FRAMELESS_FUNCTION_INVOCATION (next_frame
);
398 address
= FRAME_FP (next_frame
);
403 /* Two macros defined in tm.h specify the machine-dependent
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
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
416 address
= FRAME_CHAIN (next_frame
);
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. */
426 if (!FRAME_CHAIN_VALID (address
, next_frame
))
432 prev
= (struct frame_info
*)
433 obstack_alloc (&frame_cache_obstack
,
434 sizeof (struct frame_info
));
436 /* Zero all fields by default. */
437 memset (prev
, 0, sizeof (struct frame_info
));
440 next_frame
->prev
= prev
;
441 prev
->next
= next_frame
;
442 prev
->frame
= address
;
443 prev
->level
= next_frame
->level
+ 1;
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.
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.
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.
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.
462 Assuming that some machines need INIT_FRAME_PC after
463 INIT_EXTRA_FRAME_INFO, one possible scheme:
465 SETUP_INNERMOST_FRAME()
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.
469 SETUP_ARBITRARY_FRAME(argc, argv)
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.
472 INIT_PREV_FRAME(fromleaf, prev)
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).
479 std_frame_pc(fromleaf, prev)
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.
484 kingdon@cygnus.com, 13Apr93, 31Jan94, 14Dec94. */
486 INIT_FRAME_PC_FIRST (fromleaf
, prev
);
488 if (INIT_EXTRA_FRAME_INFO_P ())
489 INIT_EXTRA_FRAME_INFO (fromleaf
, prev
);
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. */
494 INIT_FRAME_PC (fromleaf
, prev
);
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
)
502 if (prev
->frame
== next_frame
->frame
503 && prev
->pc
== next_frame
->pc
)
505 next_frame
->prev
= NULL
;
506 obstack_free (&frame_cache_obstack
, prev
);
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
);
517 find_pc_partial_function (prev
->pc
, &name
,
518 (CORE_ADDR
*) NULL
, (CORE_ADDR
*) NULL
);
519 if (PC_IN_SIGTRAMP (prev
->pc
, name
))
520 prev
->signal_handler_caller
= 1;
526 get_frame_pc (struct frame_info
*frame
)
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. */
536 frame_address_in_block (struct frame_info
*frame
)
538 CORE_ADDR pc
= frame
->pc
;
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
546 if (frame
->next
!= 0 && frame
->next
->signal_handler_caller
== 0)
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. */
558 get_frame_saved_regs (struct frame_info
*frame
,
559 struct frame_saved_regs
*saved_regs_addr
)
561 if (frame
->saved_regs
== NULL
)
563 frame
->saved_regs
= (CORE_ADDR
*)
564 frame_obstack_alloc (SIZEOF_FRAME_SAVED_REGS
);
566 if (saved_regs_addr
== NULL
)
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
);
574 FRAME_FIND_SAVED_REGS (frame
, *saved_regs_addr
);
575 memcpy (frame
->saved_regs
, saved_regs_addr
, SIZEOF_FRAME_SAVED_REGS
);
580 /* Return the innermost lexical block in execution
581 in a specified stack frame. The frame address is assumed valid.
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.
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
597 get_frame_block (struct frame_info
*frame
, CORE_ADDR
*addr_in_block
)
599 const CORE_ADDR pc
= frame_address_in_block (frame
);
604 return block_for_pc (pc
);
608 get_current_block (CORE_ADDR
*addr_in_block
)
610 CORE_ADDR pc
= read_pc ();
615 return block_for_pc (pc
);
619 get_pc_function_start (CORE_ADDR pc
)
621 register struct block
*bl
;
622 register struct symbol
*symbol
;
623 register struct minimal_symbol
*msymbol
;
626 if ((bl
= block_for_pc (pc
)) != NULL
&&
627 (symbol
= block_function (bl
)) != NULL
)
629 bl
= SYMBOL_BLOCK_VALUE (symbol
);
630 fstart
= BLOCK_START (bl
);
632 else if ((msymbol
= lookup_minimal_symbol_by_pc (pc
)) != NULL
)
634 fstart
= SYMBOL_VALUE_ADDRESS (msymbol
);
643 /* Return the symbol for the function executing in frame FRAME. */
646 get_frame_function (struct frame_info
*frame
)
648 register struct block
*bl
= get_frame_block (frame
, 0);
651 return block_function (bl
);
655 /* Return the blockvector immediately containing the innermost lexical block
656 containing the specified pc value and section, or 0 if there is none.
657 PINDEX is a pointer to the index value of the block. If PINDEX
658 is NULL, we don't pass this information back to the caller. */
661 blockvector_for_pc_sect (register CORE_ADDR pc
, struct sec
*section
,
662 int *pindex
, struct symtab
*symtab
)
664 register struct block
*b
;
665 register int bot
, top
, half
;
666 struct blockvector
*bl
;
668 if (symtab
== 0) /* if no symtab specified by caller */
670 /* First search all symtabs for one whose file contains our pc */
671 if ((symtab
= find_pc_sect_symtab (pc
, section
)) == 0)
675 bl
= BLOCKVECTOR (symtab
);
676 b
= BLOCKVECTOR_BLOCK (bl
, 0);
678 /* Then search that symtab for the smallest block that wins. */
679 /* Use binary search to find the last block that starts before PC. */
682 top
= BLOCKVECTOR_NBLOCKS (bl
);
684 while (top
- bot
> 1)
686 half
= (top
- bot
+ 1) >> 1;
687 b
= BLOCKVECTOR_BLOCK (bl
, bot
+ half
);
688 if (BLOCK_START (b
) <= pc
)
694 /* Now search backward for a block that ends after PC. */
698 b
= BLOCKVECTOR_BLOCK (bl
, bot
);
699 if (BLOCK_END (b
) > pc
)
710 /* Return the blockvector immediately containing the innermost lexical block
711 containing the specified pc value, or 0 if there is none.
712 Backward compatibility, no section. */
715 blockvector_for_pc (register CORE_ADDR pc
, int *pindex
)
717 return blockvector_for_pc_sect (pc
, find_pc_mapped_section (pc
),
721 /* Return the innermost lexical block containing the specified pc value
722 in the specified section, or 0 if there is none. */
725 block_for_pc_sect (register CORE_ADDR pc
, struct sec
*section
)
727 register struct blockvector
*bl
;
730 bl
= blockvector_for_pc_sect (pc
, section
, &index
, NULL
);
732 return BLOCKVECTOR_BLOCK (bl
, index
);
736 /* Return the innermost lexical block containing the specified pc value,
737 or 0 if there is none. Backward compatibility, no section. */
740 block_for_pc (register CORE_ADDR pc
)
742 return block_for_pc_sect (pc
, find_pc_mapped_section (pc
));
745 /* Return the function containing pc value PC in section SECTION.
746 Returns 0 if function is not known. */
749 find_pc_sect_function (CORE_ADDR pc
, struct sec
*section
)
751 register struct block
*b
= block_for_pc_sect (pc
, section
);
754 return block_function (b
);
757 /* Return the function containing pc value PC.
758 Returns 0 if function is not known. Backward compatibility, no section */
761 find_pc_function (CORE_ADDR pc
)
763 return find_pc_sect_function (pc
, find_pc_mapped_section (pc
));
766 /* These variables are used to cache the most recent result
767 * of find_pc_partial_function. */
769 static CORE_ADDR cache_pc_function_low
= 0;
770 static CORE_ADDR cache_pc_function_high
= 0;
771 static char *cache_pc_function_name
= 0;
772 static struct sec
*cache_pc_function_section
= NULL
;
774 /* Clear cache, e.g. when symbol table is discarded. */
777 clear_pc_function_cache (void)
779 cache_pc_function_low
= 0;
780 cache_pc_function_high
= 0;
781 cache_pc_function_name
= (char *) 0;
782 cache_pc_function_section
= NULL
;
785 /* Finds the "function" (text symbol) that is smaller than PC but
786 greatest of all of the potential text symbols in SECTION. Sets
787 *NAME and/or *ADDRESS conditionally if that pointer is non-null.
788 If ENDADDR is non-null, then set *ENDADDR to be the end of the
789 function (exclusive), but passing ENDADDR as non-null means that
790 the function might cause symbols to be read. This function either
791 succeeds or fails (not halfway succeeds). If it succeeds, it sets
792 *NAME, *ADDRESS, and *ENDADDR to real information and returns 1.
793 If it fails, it sets *NAME, *ADDRESS, and *ENDADDR to zero and
797 find_pc_sect_partial_function (CORE_ADDR pc
, asection
*section
, char **name
,
798 CORE_ADDR
*address
, CORE_ADDR
*endaddr
)
800 struct partial_symtab
*pst
;
802 struct minimal_symbol
*msymbol
;
803 struct partial_symbol
*psb
;
804 struct obj_section
*osect
;
808 mapped_pc
= overlay_mapped_address (pc
, section
);
810 if (mapped_pc
>= cache_pc_function_low
&&
811 mapped_pc
< cache_pc_function_high
&&
812 section
== cache_pc_function_section
)
813 goto return_cached_value
;
815 /* If sigtramp is in the u area, it counts as a function (especially
816 important for step_1). */
817 #if defined SIGTRAMP_START
818 if (PC_IN_SIGTRAMP (mapped_pc
, (char *) NULL
))
820 cache_pc_function_low
= SIGTRAMP_START (mapped_pc
);
821 cache_pc_function_high
= SIGTRAMP_END (mapped_pc
);
822 cache_pc_function_name
= "<sigtramp>";
823 cache_pc_function_section
= section
;
824 goto return_cached_value
;
828 msymbol
= lookup_minimal_symbol_by_pc_section (mapped_pc
, section
);
829 pst
= find_pc_sect_psymtab (mapped_pc
, section
);
832 /* Need to read the symbols to get a good value for the end address. */
833 if (endaddr
!= NULL
&& !pst
->readin
)
835 /* Need to get the terminal in case symbol-reading produces
837 target_terminal_ours_for_output ();
838 PSYMTAB_TO_SYMTAB (pst
);
843 /* Checking whether the msymbol has a larger value is for the
844 "pathological" case mentioned in print_frame_info. */
845 f
= find_pc_sect_function (mapped_pc
, section
);
848 || (BLOCK_START (SYMBOL_BLOCK_VALUE (f
))
849 >= SYMBOL_VALUE_ADDRESS (msymbol
))))
851 cache_pc_function_low
= BLOCK_START (SYMBOL_BLOCK_VALUE (f
));
852 cache_pc_function_high
= BLOCK_END (SYMBOL_BLOCK_VALUE (f
));
853 cache_pc_function_name
= SYMBOL_NAME (f
);
854 cache_pc_function_section
= section
;
855 goto return_cached_value
;
860 /* Now that static symbols go in the minimal symbol table, perhaps
861 we could just ignore the partial symbols. But at least for now
862 we use the partial or minimal symbol, whichever is larger. */
863 psb
= find_pc_sect_psymbol (pst
, mapped_pc
, section
);
866 && (msymbol
== NULL
||
867 (SYMBOL_VALUE_ADDRESS (psb
)
868 >= SYMBOL_VALUE_ADDRESS (msymbol
))))
870 /* This case isn't being cached currently. */
872 *address
= SYMBOL_VALUE_ADDRESS (psb
);
874 *name
= SYMBOL_NAME (psb
);
875 /* endaddr non-NULL can't happen here. */
881 /* Not in the normal symbol tables, see if the pc is in a known section.
882 If it's not, then give up. This ensures that anything beyond the end
883 of the text seg doesn't appear to be part of the last function in the
886 osect
= find_pc_sect_section (mapped_pc
, section
);
891 /* Must be in the minimal symbol table. */
894 /* No available symbol. */
904 cache_pc_function_low
= SYMBOL_VALUE_ADDRESS (msymbol
);
905 cache_pc_function_name
= SYMBOL_NAME (msymbol
);
906 cache_pc_function_section
= section
;
908 /* Use the lesser of the next minimal symbol in the same section, or
909 the end of the section, as the end of the function. */
911 /* Step over other symbols at this same address, and symbols in
912 other sections, to find the next symbol in this section with
913 a different address. */
915 for (i
= 1; SYMBOL_NAME (msymbol
+ i
) != NULL
; i
++)
917 if (SYMBOL_VALUE_ADDRESS (msymbol
+ i
) != SYMBOL_VALUE_ADDRESS (msymbol
)
918 && SYMBOL_BFD_SECTION (msymbol
+ i
) == SYMBOL_BFD_SECTION (msymbol
))
922 if (SYMBOL_NAME (msymbol
+ i
) != NULL
923 && SYMBOL_VALUE_ADDRESS (msymbol
+ i
) < osect
->endaddr
)
924 cache_pc_function_high
= SYMBOL_VALUE_ADDRESS (msymbol
+ i
);
926 /* We got the start address from the last msymbol in the objfile.
927 So the end address is the end of the section. */
928 cache_pc_function_high
= osect
->endaddr
;
934 if (pc_in_unmapped_range (pc
, section
))
935 *address
= overlay_unmapped_address (cache_pc_function_low
, section
);
937 *address
= cache_pc_function_low
;
941 *name
= cache_pc_function_name
;
945 if (pc_in_unmapped_range (pc
, section
))
947 /* Because the high address is actually beyond the end of
948 the function (and therefore possibly beyond the end of
949 the overlay), we must actually convert (high - 1)
950 and then add one to that. */
952 *endaddr
= 1 + overlay_unmapped_address (cache_pc_function_high
- 1,
956 *endaddr
= cache_pc_function_high
;
962 /* Backward compatibility, no section argument */
965 find_pc_partial_function (CORE_ADDR pc
, char **name
, CORE_ADDR
*address
,
970 section
= find_pc_overlay (pc
);
971 return find_pc_sect_partial_function (pc
, section
, name
, address
, endaddr
);
974 /* Return the innermost stack frame executing inside of BLOCK,
975 or NULL if there is no such frame. If BLOCK is NULL, just return NULL. */
978 block_innermost_frame (struct block
*block
)
980 struct frame_info
*frame
;
981 register CORE_ADDR start
;
982 register CORE_ADDR end
;
983 CORE_ADDR calling_pc
;
988 start
= BLOCK_START (block
);
989 end
= BLOCK_END (block
);
994 frame
= get_prev_frame (frame
);
997 calling_pc
= frame_address_in_block (frame
);
998 if (calling_pc
>= start
&& calling_pc
< end
)
1003 /* Return the full FRAME which corresponds to the given CORE_ADDR
1004 or NULL if no FRAME on the chain corresponds to CORE_ADDR. */
1007 find_frame_addr_in_frame_chain (CORE_ADDR frame_addr
)
1009 struct frame_info
*frame
= NULL
;
1011 if (frame_addr
== (CORE_ADDR
) 0)
1016 frame
= get_prev_frame (frame
);
1019 if (FRAME_FP (frame
) == frame_addr
)
1024 #ifdef SIGCONTEXT_PC_OFFSET
1025 /* Get saved user PC for sigtramp from sigcontext for BSD style sigtramp. */
1028 sigtramp_saved_pc (struct frame_info
*frame
)
1030 CORE_ADDR sigcontext_addr
;
1032 int ptrbytes
= TARGET_PTR_BIT
/ TARGET_CHAR_BIT
;
1033 int sigcontext_offs
= (2 * TARGET_INT_BIT
) / TARGET_CHAR_BIT
;
1035 buf
= alloca (ptrbytes
);
1036 /* Get sigcontext address, it is the third parameter on the stack. */
1038 sigcontext_addr
= read_memory_integer (FRAME_ARGS_ADDRESS (frame
->next
)
1043 sigcontext_addr
= read_memory_integer (read_register (SP_REGNUM
)
1047 /* Don't cause a memory_error when accessing sigcontext in case the stack
1048 layout has changed or the stack is corrupt. */
1049 target_read_memory (sigcontext_addr
+ SIGCONTEXT_PC_OFFSET
, buf
, ptrbytes
);
1050 return extract_unsigned_integer (buf
, ptrbytes
);
1052 #endif /* SIGCONTEXT_PC_OFFSET */
1055 /* Are we in a call dummy? The code below which allows DECR_PC_AFTER_BREAK
1056 below is for infrun.c, which may give the macro a pc without that
1059 extern CORE_ADDR text_end
;
1062 pc_in_call_dummy_before_text_end (CORE_ADDR pc
, CORE_ADDR sp
,
1063 CORE_ADDR frame_address
)
1065 return ((pc
) >= text_end
- CALL_DUMMY_LENGTH
1066 && (pc
) <= text_end
+ DECR_PC_AFTER_BREAK
);
1070 pc_in_call_dummy_after_text_end (CORE_ADDR pc
, CORE_ADDR sp
,
1071 CORE_ADDR frame_address
)
1073 return ((pc
) >= text_end
1074 && (pc
) <= text_end
+ CALL_DUMMY_LENGTH
+ DECR_PC_AFTER_BREAK
);
1077 /* Is the PC in a call dummy? SP and FRAME_ADDRESS are the bottom and
1078 top of the stack frame which we are checking, where "bottom" and
1079 "top" refer to some section of memory which contains the code for
1080 the call dummy. Calls to this macro assume that the contents of
1081 SP_REGNUM and FP_REGNUM (or the saved values thereof), respectively,
1082 are the things to pass.
1084 This won't work on the 29k, where SP_REGNUM and FP_REGNUM don't
1085 have that meaning, but the 29k doesn't use ON_STACK. This could be
1086 fixed by generalizing this scheme, perhaps by passing in a frame
1087 and adding a few fields, at least on machines which need them for
1090 Something simpler, like checking for the stack segment, doesn't work,
1091 since various programs (threads implementations, gcc nested function
1092 stubs, etc) may either allocate stack frames in another segment, or
1093 allocate other kinds of code on the stack. */
1096 pc_in_call_dummy_on_stack (CORE_ADDR pc
, CORE_ADDR sp
, CORE_ADDR frame_address
)
1098 return (INNER_THAN ((sp
), (pc
))
1099 && (frame_address
!= 0)
1100 && INNER_THAN ((pc
), (frame_address
)));
1104 pc_in_call_dummy_at_entry_point (CORE_ADDR pc
, CORE_ADDR sp
,
1105 CORE_ADDR frame_address
)
1107 return ((pc
) >= CALL_DUMMY_ADDRESS ()
1108 && (pc
) <= (CALL_DUMMY_ADDRESS () + DECR_PC_AFTER_BREAK
));
1113 * GENERIC DUMMY FRAMES
1115 * The following code serves to maintain the dummy stack frames for
1116 * inferior function calls (ie. when gdb calls into the inferior via
1117 * call_function_by_hand). This code saves the machine state before
1118 * the call in host memory, so we must maintain an independent stack
1119 * and keep it consistant etc. I am attempting to make this code
1120 * generic enough to be used by many targets.
1122 * The cheapest and most generic way to do CALL_DUMMY on a new target
1123 * is probably to define CALL_DUMMY to be empty, CALL_DUMMY_LENGTH to
1124 * zero, and CALL_DUMMY_LOCATION to AT_ENTRY. Then you must remember
1125 * to define PUSH_RETURN_ADDRESS, because no call instruction will be
1126 * being executed by the target. Also FRAME_CHAIN_VALID as
1127 * generic_{file,func}_frame_chain_valid and FIX_CALL_DUMMY as
1128 * generic_fix_call_dummy. */
1130 /* Dummy frame. This saves the processor state just prior to setting
1131 up the inferior function call. Older targets save the registers
1132 on the target stack (but that really slows down function calls). */
1136 struct dummy_frame
*next
;
1142 struct regcache
*regcache
;
1144 /* Address range of the call dummy code. Look for PC in the range
1145 [LO..HI) (after allowing for DECR_PC_AFTER_BREAK). */
1150 static struct dummy_frame
*dummy_frame_stack
= NULL
;
1152 /* Function: find_dummy_frame(pc, fp, sp)
1154 Search the stack of dummy frames for one matching the given PC, FP
1155 and SP. Unlike PC_IN_CALL_DUMMY, this function doesn't need to
1156 adjust for DECR_PC_AFTER_BREAK. This is because it is only legal
1157 to call this function after the PC has been adjusted. */
1159 static struct regcache
*
1160 generic_find_dummy_frame (CORE_ADDR pc
, CORE_ADDR fp
)
1162 struct dummy_frame
*dummyframe
;
1164 for (dummyframe
= dummy_frame_stack
; dummyframe
!= NULL
;
1165 dummyframe
= dummyframe
->next
)
1166 if ((pc
>= dummyframe
->call_lo
&& pc
< dummyframe
->call_hi
)
1167 && (fp
== dummyframe
->fp
1168 || fp
== dummyframe
->sp
1169 || fp
== dummyframe
->top
))
1170 /* The frame in question lies between the saved fp and sp, inclusive */
1171 return dummyframe
->regcache
;
1177 deprecated_generic_find_dummy_frame (CORE_ADDR pc
, CORE_ADDR fp
)
1179 struct regcache
*regcache
= generic_find_dummy_frame (pc
, fp
);
1180 if (regcache
== NULL
)
1182 return deprecated_grub_regcache_for_registers (regcache
);
1185 /* Function: pc_in_call_dummy (pc, sp, fp)
1187 Return true if the PC falls in a dummy frame created by gdb for an
1188 inferior call. The code below which allows DECR_PC_AFTER_BREAK is
1189 for infrun.c, which may give the function a PC without that
1193 generic_pc_in_call_dummy (CORE_ADDR pc
, CORE_ADDR sp
, CORE_ADDR fp
)
1195 struct dummy_frame
*dummyframe
;
1196 for (dummyframe
= dummy_frame_stack
;
1198 dummyframe
= dummyframe
->next
)
1200 if ((pc
>= dummyframe
->call_lo
)
1201 && (pc
< dummyframe
->call_hi
+ DECR_PC_AFTER_BREAK
))
1207 /* Function: read_register_dummy
1208 Find a saved register from before GDB calls a function in the inferior */
1211 generic_read_register_dummy (CORE_ADDR pc
, CORE_ADDR fp
, int regno
)
1213 struct regcache
*dummy_regs
= generic_find_dummy_frame (pc
, fp
);
1216 return regcache_read_as_address (dummy_regs
, regno
);
1221 /* Save all the registers on the dummy frame stack. Most ports save the
1222 registers on the target stack. This results in lots of unnecessary memory
1223 references, which are slow when debugging via a serial line. Instead, we
1224 save all the registers internally, and never write them to the stack. The
1225 registers get restored when the called function returns to the entry point,
1226 where a breakpoint is laying in wait. */
1229 generic_push_dummy_frame (void)
1231 struct dummy_frame
*dummy_frame
;
1232 CORE_ADDR fp
= (get_current_frame ())->frame
;
1234 /* check to see if there are stale dummy frames,
1235 perhaps left over from when a longjump took us out of a
1236 function that was called by the debugger */
1238 dummy_frame
= dummy_frame_stack
;
1240 if (INNER_THAN (dummy_frame
->fp
, fp
)) /* stale -- destroy! */
1242 dummy_frame_stack
= dummy_frame
->next
;
1243 regcache_xfree (dummy_frame
->regcache
);
1244 xfree (dummy_frame
);
1245 dummy_frame
= dummy_frame_stack
;
1248 dummy_frame
= dummy_frame
->next
;
1250 dummy_frame
= xmalloc (sizeof (struct dummy_frame
));
1251 dummy_frame
->regcache
= regcache_xmalloc (current_gdbarch
);
1253 dummy_frame
->pc
= read_pc ();
1254 dummy_frame
->sp
= read_sp ();
1255 dummy_frame
->top
= dummy_frame
->sp
;
1256 dummy_frame
->fp
= fp
;
1257 regcache_cpy (dummy_frame
->regcache
, current_regcache
);
1258 dummy_frame
->next
= dummy_frame_stack
;
1259 dummy_frame_stack
= dummy_frame
;
1263 generic_save_dummy_frame_tos (CORE_ADDR sp
)
1265 dummy_frame_stack
->top
= sp
;
1268 /* Record the upper/lower bounds on the address of the call dummy. */
1271 generic_save_call_dummy_addr (CORE_ADDR lo
, CORE_ADDR hi
)
1273 dummy_frame_stack
->call_lo
= lo
;
1274 dummy_frame_stack
->call_hi
= hi
;
1277 /* Restore the machine state from either the saved dummy stack or a
1278 real stack frame. */
1281 generic_pop_current_frame (void (*popper
) (struct frame_info
* frame
))
1283 struct frame_info
*frame
= get_current_frame ();
1285 if (PC_IN_CALL_DUMMY (frame
->pc
, frame
->frame
, frame
->frame
))
1286 generic_pop_dummy_frame ();
1291 /* Function: pop_dummy_frame
1292 Restore the machine state from a saved dummy stack frame. */
1295 generic_pop_dummy_frame (void)
1297 struct dummy_frame
*dummy_frame
= dummy_frame_stack
;
1299 /* FIXME: what if the first frame isn't the right one, eg..
1300 because one call-by-hand function has done a longjmp into another one? */
1303 error ("Can't pop dummy frame!");
1304 dummy_frame_stack
= dummy_frame
->next
;
1305 regcache_cpy (current_regcache
, dummy_frame
->regcache
);
1306 flush_cached_frames ();
1308 regcache_xfree (dummy_frame
->regcache
);
1309 xfree (dummy_frame
);
1312 /* Function: frame_chain_valid
1313 Returns true for a user frame or a call_function_by_hand dummy frame,
1314 and false for the CRT0 start-up frame. Purpose is to terminate backtrace */
1317 generic_file_frame_chain_valid (CORE_ADDR fp
, struct frame_info
*fi
)
1319 if (PC_IN_CALL_DUMMY (FRAME_SAVED_PC (fi
), fp
, fp
))
1320 return 1; /* don't prune CALL_DUMMY frames */
1321 else /* fall back to default algorithm (see frame.h) */
1323 && (INNER_THAN (fi
->frame
, fp
) || fi
->frame
== fp
)
1324 && !inside_entry_file (FRAME_SAVED_PC (fi
)));
1328 generic_func_frame_chain_valid (CORE_ADDR fp
, struct frame_info
*fi
)
1330 if (USE_GENERIC_DUMMY_FRAMES
1331 && PC_IN_CALL_DUMMY ((fi
)->pc
, 0, 0))
1332 return 1; /* don't prune CALL_DUMMY frames */
1333 else /* fall back to default algorithm (see frame.h) */
1335 && (INNER_THAN (fi
->frame
, fp
) || fi
->frame
== fp
)
1336 && !inside_main_func ((fi
)->pc
)
1337 && !inside_entry_func ((fi
)->pc
));
1340 /* Function: fix_call_dummy
1341 Stub function. Generic dummy frames typically do not need to fix
1342 the frame being created */
1345 generic_fix_call_dummy (char *dummy
, CORE_ADDR pc
, CORE_ADDR fun
, int nargs
,
1346 struct value
**args
, struct type
*type
, int gcc_p
)
1351 /* Given a call-dummy dummy-frame, return the registers. Here the
1352 register value is taken from the local copy of the register buffer. */
1355 generic_call_dummy_register_unwind (struct frame_info
*frame
, void **cache
,
1356 int regnum
, int *optimized
,
1357 enum lval_type
*lvalp
, CORE_ADDR
*addrp
,
1358 int *realnum
, void *bufferp
)
1360 gdb_assert (frame
!= NULL
);
1361 gdb_assert (PC_IN_CALL_DUMMY (frame
->pc
, frame
->frame
, frame
->frame
));
1363 /* Describe the register's location. Generic dummy frames always
1364 have the register value in an ``expression''. */
1370 /* If needed, find and return the value of the register. */
1371 if (bufferp
!= NULL
)
1373 struct regcache
*registers
;
1375 /* Get the address of the register buffer that contains all the
1376 saved registers for this dummy frame. Cache that address. */
1377 registers
= (*cache
);
1378 if (registers
== NULL
)
1380 registers
= generic_find_dummy_frame (frame
->pc
, frame
->frame
);
1381 (*cache
) = registers
;
1384 /* Get the address of the register buffer that contains the
1385 saved registers and then extract the value from that. */
1386 registers
= generic_find_dummy_frame (frame
->pc
, frame
->frame
);
1388 gdb_assert (registers
!= NULL
);
1389 /* Return the actual value. */
1390 /* FIXME: cagney/2002-06-26: This should be via the
1391 gdbarch_register_read() method so that it, on the fly,
1392 constructs either a raw or pseudo register from the raw
1394 regcache_read (registers
, regnum
, bufferp
);
1398 /* Return the register saved in the simplistic ``saved_regs'' cache.
1399 If the value isn't here AND a value is needed, try the next inner
1403 frame_saved_regs_register_unwind (struct frame_info
*frame
, void **cache
,
1404 int regnum
, int *optimizedp
,
1405 enum lval_type
*lvalp
, CORE_ADDR
*addrp
,
1406 int *realnump
, void *bufferp
)
1408 /* There is always a frame at this point. And THIS is the frame
1409 we're interested in. */
1410 gdb_assert (frame
!= NULL
);
1411 gdb_assert (!PC_IN_CALL_DUMMY (frame
->pc
, frame
->frame
, frame
->frame
));
1413 /* Load the saved_regs register cache. */
1414 if (frame
->saved_regs
== NULL
)
1415 FRAME_INIT_SAVED_REGS (frame
);
1417 if (frame
->saved_regs
!= NULL
1418 && frame
->saved_regs
[regnum
] != 0)
1420 if (regnum
== SP_REGNUM
)
1422 /* SP register treated specially. */
1427 if (bufferp
!= NULL
)
1428 store_address (bufferp
, REGISTER_RAW_SIZE (regnum
),
1429 frame
->saved_regs
[regnum
]);
1433 /* Any other register is saved in memory, fetch it but cache
1434 a local copy of its value. */
1436 *lvalp
= lval_memory
;
1437 *addrp
= frame
->saved_regs
[regnum
];
1439 if (bufferp
!= NULL
)
1442 /* Save each register value, as it is read in, in a
1443 frame based cache. */
1444 void **regs
= (*cache
);
1447 int sizeof_cache
= ((NUM_REGS
+ NUM_PSEUDO_REGS
)
1449 regs
= frame_obstack_alloc (sizeof_cache
);
1450 memset (regs
, 0, sizeof_cache
);
1453 if (regs
[regnum
] == NULL
)
1456 = frame_obstack_alloc (REGISTER_RAW_SIZE (regnum
));
1457 read_memory (frame
->saved_regs
[regnum
], regs
[regnum
],
1458 REGISTER_RAW_SIZE (regnum
));
1460 memcpy (bufferp
, regs
[regnum
], REGISTER_RAW_SIZE (regnum
));
1462 /* Read the value in from memory. */
1463 read_memory (frame
->saved_regs
[regnum
], bufferp
,
1464 REGISTER_RAW_SIZE (regnum
));
1471 /* No luck, assume this and the next frame have the same register
1472 value. If a value is needed, pass the request on down the chain;
1473 otherwise just return an indication that the value is in the same
1474 register as the next frame. */
1475 if (bufferp
== NULL
)
1478 *lvalp
= lval_register
;
1484 frame_register_unwind (frame
->next
, regnum
, optimizedp
, lvalp
, addrp
,
1489 /* Function: get_saved_register
1490 Find register number REGNUM relative to FRAME and put its (raw,
1491 target format) contents in *RAW_BUFFER.
1493 Set *OPTIMIZED if the variable was optimized out (and thus can't be
1494 fetched). Note that this is never set to anything other than zero
1495 in this implementation.
1497 Set *LVAL to lval_memory, lval_register, or not_lval, depending on
1498 whether the value was fetched from memory, from a register, or in a
1499 strange and non-modifiable way (e.g. a frame pointer which was
1500 calculated rather than fetched). We will use not_lval for values
1501 fetched from generic dummy frames.
1503 Set *ADDRP to the address, either in memory or as a REGISTER_BYTE
1504 offset into the registers array. If the value is stored in a dummy
1505 frame, set *ADDRP to zero.
1507 To use this implementation, define a function called
1508 "get_saved_register" in your target code, which simply passes all
1509 of its arguments to this function.
1511 The argument RAW_BUFFER must point to aligned memory. */
1514 generic_get_saved_register (char *raw_buffer
, int *optimized
, CORE_ADDR
*addrp
,
1515 struct frame_info
*frame
, int regnum
,
1516 enum lval_type
*lval
)
1518 if (!target_has_registers
)
1519 error ("No registers.");
1521 /* Normal systems don't optimize out things with register numbers. */
1522 if (optimized
!= NULL
)
1525 if (addrp
) /* default assumption: not found in memory */
1528 /* Note: since the current frame's registers could only have been
1529 saved by frames INTERIOR TO the current frame, we skip examining
1530 the current frame itself: otherwise, we would be getting the
1531 previous frame's registers which were saved by the current frame. */
1533 while (frame
&& ((frame
= frame
->next
) != NULL
))
1535 if (PC_IN_CALL_DUMMY (frame
->pc
, frame
->frame
, frame
->frame
))
1537 if (lval
) /* found it in a CALL_DUMMY frame */
1540 /* FIXME: cagney/2002-06-26: This should be via the
1541 gdbarch_register_read() method so that it, on the fly,
1542 constructs either a raw or pseudo register from the raw
1544 regcache_read (generic_find_dummy_frame (frame
->pc
, frame
->frame
),
1545 regnum
, raw_buffer
);
1549 FRAME_INIT_SAVED_REGS (frame
);
1550 if (frame
->saved_regs
!= NULL
1551 && frame
->saved_regs
[regnum
] != 0)
1553 if (lval
) /* found it saved on the stack */
1554 *lval
= lval_memory
;
1555 if (regnum
== SP_REGNUM
)
1557 if (raw_buffer
) /* SP register treated specially */
1558 store_address (raw_buffer
, REGISTER_RAW_SIZE (regnum
),
1559 frame
->saved_regs
[regnum
]);
1563 if (addrp
) /* any other register */
1564 *addrp
= frame
->saved_regs
[regnum
];
1566 read_memory (frame
->saved_regs
[regnum
], raw_buffer
,
1567 REGISTER_RAW_SIZE (regnum
));
1573 /* If we get thru the loop to this point, it means the register was
1574 not saved in any frame. Return the actual live-register value. */
1576 if (lval
) /* found it in a live register */
1577 *lval
= lval_register
;
1579 *addrp
= REGISTER_BYTE (regnum
);
1581 read_register_gen (regnum
, raw_buffer
);
1585 _initialize_blockframe (void)
1587 obstack_init (&frame_cache_obstack
);