2010-05-06 Michael Snyder <msnyder@vmware.com>
[deliverable/binutils-gdb.git] / gdb / frame-unwind.c
CommitLineData
494cca16
AC
1/* Definitions for frame unwinder, for GDB, the GNU debugger.
2
4c38e0a4
JB
3 Copyright (C) 2003, 2004, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
494cca16
AC
5
6 This file is part of GDB.
7
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
a9762ec7 10 the Free Software Foundation; either version 3 of the License, or
494cca16
AC
11 (at your option) any later version.
12
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
17
18 You should have received a copy of the GNU General Public License
a9762ec7 19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
494cca16
AC
20
21#include "defs.h"
22#include "frame.h"
23#include "frame-unwind.h"
494cca16 24#include "dummy-frame.h"
edb3359d 25#include "inline-frame.h"
669fac23
DJ
26#include "value.h"
27#include "regcache.h"
28
29#include "gdb_assert.h"
41fe5eb3 30#include "gdb_obstack.h"
494cca16
AC
31
32static struct gdbarch_data *frame_unwind_data;
33
41fe5eb3 34struct frame_unwind_table_entry
494cca16 35{
82417da5 36 const struct frame_unwind *unwinder;
41fe5eb3 37 struct frame_unwind_table_entry *next;
494cca16
AC
38};
39
41fe5eb3 40struct frame_unwind_table
494cca16 41{
fb2be677
AC
42 struct frame_unwind_table_entry *list;
43 /* The head of the OSABI part of the search list. */
44 struct frame_unwind_table_entry **osabi_head;
41fe5eb3 45};
494cca16
AC
46
47static void *
41fe5eb3 48frame_unwind_init (struct obstack *obstack)
494cca16 49{
41fe5eb3
AC
50 struct frame_unwind_table *table
51 = OBSTACK_ZALLOC (obstack, struct frame_unwind_table);
fb2be677
AC
52 /* Start the table out with a few default sniffers. OSABI code
53 can't override this. */
54 table->list = OBSTACK_ZALLOC (obstack, struct frame_unwind_table_entry);
d67ec5db 55 table->list->unwinder = dummy_frame_unwind;
edb3359d
DJ
56 table->list->next = OBSTACK_ZALLOC (obstack, struct frame_unwind_table_entry);
57 table->list->next->unwinder = inline_frame_unwind;
fb2be677 58 /* The insertion point for OSABI sniffers. */
edb3359d 59 table->osabi_head = &table->list->next->next;
494cca16
AC
60 return table;
61}
62
82417da5 63void
fb2be677 64frame_unwind_prepend_unwinder (struct gdbarch *gdbarch,
82417da5
AC
65 const struct frame_unwind *unwinder)
66{
67 struct frame_unwind_table *table = gdbarch_data (gdbarch, frame_unwind_data);
fb2be677
AC
68 struct frame_unwind_table_entry *entry;
69
70 /* Insert the new entry at the start of the list. */
71 entry = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct frame_unwind_table_entry);
72 entry->unwinder = unwinder;
73 entry->next = (*table->osabi_head);
74 (*table->osabi_head) = entry;
82417da5
AC
75}
76
669fac23
DJ
77void
78frame_unwind_append_unwinder (struct gdbarch *gdbarch,
79 const struct frame_unwind *unwinder)
80{
81 struct frame_unwind_table *table = gdbarch_data (gdbarch, frame_unwind_data);
82 struct frame_unwind_table_entry **ip;
83
84 /* Find the end of the list and insert the new entry there. */
85 for (ip = table->osabi_head; (*ip) != NULL; ip = &(*ip)->next);
86 (*ip) = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct frame_unwind_table_entry);
87 (*ip)->unwinder = unwinder;
88}
89
e8a89fe2 90const struct frame_unwind *
669fac23 91frame_unwind_find_by_frame (struct frame_info *this_frame, void **this_cache)
e8a89fe2
AC
92{
93 int i;
669fac23 94 struct gdbarch *gdbarch = get_frame_arch (this_frame);
e8a89fe2 95 struct frame_unwind_table *table = gdbarch_data (gdbarch, frame_unwind_data);
41fe5eb3 96 struct frame_unwind_table_entry *entry;
669fac23 97 struct cleanup *old_cleanup;
fb2be677 98 for (entry = table->list; entry != NULL; entry = entry->next)
494cca16 99 {
669fac23
DJ
100 struct cleanup *old_cleanup;
101
102 old_cleanup = frame_prepare_for_sniffer (this_frame, entry->unwinder);
103 if (entry->unwinder->sniffer (entry->unwinder, this_frame,
104 this_cache))
82417da5 105 {
669fac23
DJ
106 discard_cleanups (old_cleanup);
107 return entry->unwinder;
82417da5 108 }
669fac23 109 do_cleanups (old_cleanup);
494cca16 110 }
e2e0b3e5 111 internal_error (__FILE__, __LINE__, _("frame_unwind_find_by_frame failed"));
494cca16
AC
112}
113
669fac23
DJ
114/* A default frame sniffer which always accepts the frame. Used by
115 fallback prologue unwinders. */
116
117int
118default_frame_sniffer (const struct frame_unwind *self,
119 struct frame_info *this_frame,
120 void **this_prologue_cache)
121{
122 return 1;
123}
124
125/* Helper functions for value-based register unwinding. These return
126 a (possibly lazy) value of the appropriate type. */
127
128/* Return a value which indicates that FRAME did not save REGNUM. */
129
130struct value *
131frame_unwind_got_optimized (struct frame_info *frame, int regnum)
132{
36f15f55 133 struct gdbarch *gdbarch = frame_unwind_arch (frame);
669fac23
DJ
134 struct value *reg_val;
135
136 reg_val = value_zero (register_type (gdbarch, regnum), not_lval);
137 set_value_optimized_out (reg_val, 1);
138 return reg_val;
139}
140
141/* Return a value which indicates that FRAME copied REGNUM into
142 register NEW_REGNUM. */
143
144struct value *
145frame_unwind_got_register (struct frame_info *frame, int regnum, int new_regnum)
146{
147 return value_of_register_lazy (frame, new_regnum);
148}
149
150/* Return a value which indicates that FRAME saved REGNUM in memory at
151 ADDR. */
152
153struct value *
154frame_unwind_got_memory (struct frame_info *frame, int regnum, CORE_ADDR addr)
155{
36f15f55 156 struct gdbarch *gdbarch = frame_unwind_arch (frame);
4e5d721f 157 struct value *v = value_at_lazy (register_type (gdbarch, regnum), addr);
669fac23 158
4e5d721f
DE
159 set_value_stack (v, 1);
160 return v;
669fac23
DJ
161}
162
163/* Return a value which indicates that FRAME's saved version of
164 REGNUM has a known constant (computed) value of VAL. */
165
166struct value *
167frame_unwind_got_constant (struct frame_info *frame, int regnum,
168 ULONGEST val)
169{
36f15f55 170 struct gdbarch *gdbarch = frame_unwind_arch (frame);
e17a4113 171 enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
669fac23
DJ
172 struct value *reg_val;
173
174 reg_val = value_zero (register_type (gdbarch, regnum), not_lval);
175 store_unsigned_integer (value_contents_writeable (reg_val),
e17a4113 176 register_size (gdbarch, regnum), byte_order, val);
669fac23
DJ
177 return reg_val;
178}
179
15c1e57f
JB
180struct value *
181frame_unwind_got_bytes (struct frame_info *frame, int regnum, gdb_byte *buf)
182{
36f15f55 183 struct gdbarch *gdbarch = frame_unwind_arch (frame);
15c1e57f
JB
184 struct value *reg_val;
185
186 reg_val = value_zero (register_type (gdbarch, regnum), not_lval);
187 memcpy (value_contents_raw (reg_val), buf, register_size (gdbarch, regnum));
188 return reg_val;
189}
190
669fac23
DJ
191/* Return a value which indicates that FRAME's saved version of REGNUM
192 has a known constant (computed) value of ADDR. Convert the
193 CORE_ADDR to a target address if necessary. */
194
195struct value *
196frame_unwind_got_address (struct frame_info *frame, int regnum,
197 CORE_ADDR addr)
198{
36f15f55 199 struct gdbarch *gdbarch = frame_unwind_arch (frame);
669fac23
DJ
200 struct value *reg_val;
201
202 reg_val = value_zero (register_type (gdbarch, regnum), not_lval);
203 pack_long (value_contents_writeable (reg_val),
204 register_type (gdbarch, regnum), addr);
205 return reg_val;
206}
207
b9362cc7
AC
208extern initialize_file_ftype _initialize_frame_unwind; /* -Wmissing-prototypes */
209
494cca16
AC
210void
211_initialize_frame_unwind (void)
212{
41fe5eb3 213 frame_unwind_data = gdbarch_data_register_pre_init (frame_unwind_init);
494cca16 214}
This page took 0.851152 seconds and 4 git commands to generate.