1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/* Definitions for a frame unwinder, for GDB, the GNU debugger.
Copyright 2003 Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
#if !defined (FRAME_UNWIND_H)
#define FRAME_UNWIND_H 1
struct frame_info;
struct frame_id;
struct frame_unwind;
struct gdbarch;
struct regcache;
/* Return the frame unwind methods for the function that contains PC,
or NULL if this this unwinder can't handle this frame. */
typedef const struct frame_unwind *(frame_unwind_p_ftype) (CORE_ADDR pc);
/* Add a frame unwinder to the list. The predicates are polled in the
order that they are appended. The initial list contains the dummy
frame's predicate. */
extern void frame_unwind_append_predicate (struct gdbarch *gdbarch,
frame_unwind_p_ftype *p);
/* Iterate through the list of frame unwinders until one returns an
implementation. */
extern const struct frame_unwind *frame_unwind_find_by_pc (struct gdbarch
*gdbarch,
CORE_ADDR pc);
/* The following unwind functions assume a chain of frames forming the
sequence: (outer) prev <-> this <-> next (inner). All the
functions are called with called with the next frame's `struct
frame_info' and and this frame's prologue cache.
THIS frame's register values can be obtained by unwinding NEXT
frame's registers (a recursive operation).
THIS frame's prologue cache can be used to cache information such
as where this frame's prologue stores the previous frame's
registers. */
/* Assuming the frame chain: (outer) prev <-> this <-> next (inner);
use the NEXT frame, and its register unwind method, to determine
the frame ID of THIS frame.
A frame ID provides an invariant that can be used to re-identify an
instance of a frame. It is a combination of the frame's `base' and
the frame's function's code address.
Traditionally, THIS frame's ID was determined by examining THIS
frame's function's prologue, and identifying the register/offset
used as THIS frame's base.
Example: An examination of THIS frame's prologue reveals that, on
entry, it saves the PC(+12), SP(+8), and R1(+4) registers
(decrementing the SP by 12). Consequently, the frame ID's base can
be determined by adding 12 to the THIS frame's stack-pointer, and
the value of THIS frame's SP can be obtained by unwinding the NEXT
frame's SP.
THIS_PROLOGUE_CACHE can be used to share any prolog analysis data
with the other unwind methods. Memory for that cache should be
allocated using frame_obstack_zalloc(). */
typedef void (frame_this_id_ftype) (struct frame_info *next_frame,
void **this_prologue_cache,
struct frame_id *this_id);
/* Assuming the frame chain: (outer) prev <-> this <-> next (inner);
use the NEXT frame, and its register unwind method, to unwind THIS
frame's registers (returning the value of the specified register
REGNUM in the previous frame).
Traditionally, THIS frame's registers were unwound by examining
THIS frame's function's prologue and identifying which registers
that prolog code saved on the stack.
Example: An examination of THIS frame's prologue reveals that, on
entry, it saves the PC(+12), SP(+8), and R1(+4) registers
(decrementing the SP by 12). Consequently, the value of the PC
register in the previous frame is found in memory at SP+12, and
THIS frame's SP can be obtained by unwinding the NEXT frame's SP.
Why not pass in THIS_FRAME? By passing in NEXT frame and THIS
cache, the supplied parameters are consistent with the sibling
function THIS_ID.
Can the code call ``frame_register (get_prev_frame (NEXT_FRAME))''?
Won't the call frame_register (THIS_FRAME) be faster? Well,
ignoring the possability that the previous frame does not yet
exist, the ``frame_register (FRAME)'' function is expanded to
``frame_register_unwind (get_next_frame (FRAME)'' and hence that
call will expand to ``frame_register_unwind (get_next_frame
(get_prev_frame (NEXT_FRAME)))''. Might as well call
``frame_register_unwind (NEXT_FRAME)'' directly.
THIS_PROLOGUE_CACHE can be used to share any prolog analysis data
with the other unwind methods. Memory for that cache should be
allocated using frame_obstack_zalloc(). */
typedef void (frame_prev_register_ftype) (struct frame_info *next_frame,
void **this_prologue_cache,
int prev_regnum,
int *optimized,
enum lval_type * lvalp,
CORE_ADDR *addrp,
int *realnump, void *valuep);
struct frame_unwind
{
/* Should the frame's type go here? */
/* Should an attribute indicating the frame's address-in-block go
here? */
frame_this_id_ftype *this_id;
frame_prev_register_ftype *prev_register;
};
#endif
|
