projects
/
deliverable
/
binutils-gdb.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
change delegation for to_read_description
[deliverable/binutils-gdb.git]
/
gdb
/
prologue-value.c
diff --git
a/gdb/prologue-value.c
b/gdb/prologue-value.c
index e4282e648df076f1485b96ba1566e8344ebe439a..56b32f4aa4b2bd349dc6341850b057a8ebc87d07 100644
(file)
--- a/
gdb/prologue-value.c
+++ b/
gdb/prologue-value.c
@@
-1,5
+1,5
@@
/* Prologue value handling for GDB.
/* Prologue value handling for GDB.
- Copyright
2003, 2004, 2005, 2007, 2008, 2009
Free Software Foundation, Inc.
+ Copyright
(C) 2003-2014
Free Software Foundation, Inc.
This file is part of GDB.
This file is part of GDB.
@@
-14,10
+14,10
@@
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
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, see <http://www.gnu.org/licenses/>. */
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "defs.h"
#include "defs.h"
-#include
"gdb_string.h"
+#include
<string.h>
#include "gdb_assert.h"
#include "prologue-value.h"
#include "regcache.h"
#include "gdb_assert.h"
#include "prologue-value.h"
#include "regcache.h"
@@
-202,7
+202,7
@@
pv_is_identical (pv_t a, pv_t b)
case pvk_register:
return (a.reg == b.reg && a.k == b.k);
default:
case pvk_register:
return (a.reg == b.reg && a.k == b.k);
default:
- gdb_assert
(0
);
+ gdb_assert
_not_reached ("unexpected prologue value kind"
);
}
}
}
}
@@
-345,6
+345,7
@@
clear_entries (struct pv_area *area)
do
{
struct area_entry *next = e->next;
do
{
struct area_entry *next = e->next;
+
xfree (e);
e = next;
}
xfree (e);
e = next;
}
@@
-397,7
+398,7
@@
pv_area_store_would_trash (struct pv_area *area, pv_t addr)
This may return zero, if AREA has no entries.
And since the entries are a ring, this may return an entry that
This may return zero, if AREA has no entries.
And since the entries are a ring, this may return an entry that
- entirely prece
ed
s OFFSET. This is the correct behavior: depending
+ entirely prece
de
s OFFSET. This is the correct behavior: depending
on the sizes involved, we could still overlap such an area, with
wrap-around. */
static struct area_entry *
on the sizes involved, we could still overlap such an area, with
wrap-around. */
static struct area_entry *
@@
-467,6
+468,7
@@
pv_area_store (struct pv_area *area,
while (e && overlaps (area, e, offset, size))
{
struct area_entry *next = (e->next == e) ? 0 : e->next;
while (e && overlaps (area, e, offset, size))
{
struct area_entry *next = (e->next == e) ? 0 : e->next;
+
e->prev->next = e->next;
e->next->prev = e->prev;
e->prev->next = e->next;
e->next->prev = e->prev;
@@
-491,6
+493,7
@@
pv_area_store (struct pv_area *area,
{
CORE_ADDR offset = addr.k;
struct area_entry *e = (struct area_entry *) xmalloc (sizeof (*e));
{
CORE_ADDR offset = addr.k;
struct area_entry *e = (struct area_entry *) xmalloc (sizeof (*e));
+
e->offset = offset;
e->size = size;
e->value = value;
e->offset = offset;
e->size = size;
e->value = value;
This page took
0.025216 seconds
and
4
git commands to generate.