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
+ the Free Software Foundation; either version 3 of the License, or (at
your option) any later version.
This program is distributed in the hope that it will be useful, but
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., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA. */
+ Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
+ MA 02110-1301, USA. */
#include "sysdep.h"
#include "bfd.h"
/* The bfd we are working with. */
bfd* abfd;
+ /* Pointer to the symbol table. */
+ asymbol** syms;
+
/* List of already parsed compilation units. */
struct dwarf1_unit* lastUnit;
/* The buffer for the .debug section.
Zero indicates that the .debug section failed to load. */
- char* debug_section;
+ bfd_byte *debug_section;
/* Pointer to the end of the .debug_info section memory buffer. */
- char* debug_section_end;
+ bfd_byte *debug_section_end;
/* The buffer for the .line section. */
- char* line_section;
+ bfd_byte *line_section;
/* End of that buffer. */
- char* line_section_end;
+ bfd_byte *line_section_end;
/* The current or next unread die within the .debug section. */
- char* currentDie;
+ bfd_byte *currentDie;
};
/* One dwarf1_unit for each parsed compilation unit die. */
struct dwarf1_unit* prev;
/* Name of the compilation unit. */
- char* name;
+ char *name;
/* The highest and lowest address used in the compilation unit. */
unsigned long low_pc;
unsigned long stmt_list_offset;
/* If non-zero, a pointer to the first child of this unit. */
- char* first_child;
+ bfd_byte *first_child;
/* How many line entries? */
unsigned long line_count;
bfd_size_type amt = sizeof (struct dwarf1_unit);
struct dwarf1_unit* x = bfd_zalloc (stash->abfd, amt);
- x->prev = stash->lastUnit;
- stash->lastUnit = x;
+ if (x)
+ {
+ x->prev = stash->lastUnit;
+ stash->lastUnit = x;
+ }
return x;
}
bfd_size_type amt = sizeof (struct dwarf1_func);
struct dwarf1_func* x = bfd_zalloc (stash->abfd, amt);
- x->prev = aUnit->func_list;
- aUnit->func_list = x;
+ if (x)
+ {
+ x->prev = aUnit->func_list;
+ aUnit->func_list = x;
+ }
return x;
}
static bfd_boolean
parse_die (bfd * abfd,
struct die_info * aDieInfo,
- char * aDiePtr,
- char * aDiePtrEnd)
+ bfd_byte * aDiePtr,
+ bfd_byte * aDiePtrEnd)
{
- char* this_die = aDiePtr;
- char* xptr = this_die;
+ bfd_byte *this_die = aDiePtr;
+ bfd_byte *xptr = this_die;
memset (aDieInfo, 0, sizeof (* aDieInfo));
break;
case FORM_STRING:
if (attr == AT_name)
- aDieInfo->name = xptr;
- xptr += strlen (xptr) + 1;
+ aDieInfo->name = (char *)xptr;
+ xptr += strlen (aDieInfo->name) + 1;
break;
}
}
static bfd_boolean
parse_line_table (struct dwarf1_debug* stash, struct dwarf1_unit* aUnit)
{
- char* xptr;
+ bfd_byte *xptr;
/* Load the ".line" section from the bfd if we haven't already. */
if (stash->line_section == 0)
return FALSE;
size = msec->rawsize ? msec->rawsize : msec->size;
- stash->line_section = bfd_alloc (stash->abfd, size);
+ stash->line_section
+ = bfd_simple_get_relocated_section_contents
+ (stash->abfd, msec, NULL, stash->syms);
if (! stash->line_section)
return FALSE;
- if (! bfd_get_section_contents (stash->abfd, msec, stash->line_section,
- 0, size))
- {
- stash->line_section = 0;
- return FALSE;
- }
-
stash->line_section_end = stash->line_section + size;
}
if (xptr < stash->line_section_end)
{
unsigned long eachLine;
- char *tblend;
+ bfd_byte *tblend;
unsigned long base;
bfd_size_type amt;
/* Allocate an array for the entries. */
amt = sizeof (struct linenumber) * aUnit->line_count;
aUnit->linenumber_table = bfd_alloc (stash->abfd, amt);
+ if (!aUnit->linenumber_table)
+ return FALSE;
for (eachLine = 0; eachLine < aUnit->line_count; eachLine++)
{
static bfd_boolean
parse_functions_in_unit (struct dwarf1_debug* stash, struct dwarf1_unit* aUnit)
{
- char* eachDie;
+ bfd_byte *eachDie;
if (aUnit->first_child)
for (eachDie = aUnit->first_child;
|| eachDieInfo.tag == TAG_entry_point)
{
struct dwarf1_func* aFunc = alloc_dwarf1_func (stash,aUnit);
+ if (!aFunc)
+ return FALSE;
aFunc->name = eachDieInfo.name;
aFunc->low_pc = eachDieInfo.low_pc;
bfd_boolean
_bfd_dwarf1_find_nearest_line (bfd *abfd,
asection *section,
- asymbol **symbols ATTRIBUTE_UNUSED,
+ asymbol **symbols,
bfd_vma offset,
const char **filename_ptr,
const char **functionname_ptr,
return FALSE;
size = msec->rawsize ? msec->rawsize : msec->size;
- stash->debug_section = bfd_alloc (abfd, size);
+ stash->debug_section
+ = bfd_simple_get_relocated_section_contents (abfd, msec, NULL,
+ symbols);
if (! stash->debug_section)
return FALSE;
- if (! bfd_get_section_contents (abfd, msec, stash->debug_section,
- 0, size))
- {
- stash->debug_section = 0;
- return FALSE;
- }
-
stash->debug_section_end = stash->debug_section + size;
stash->currentDie = stash->debug_section;
stash->abfd = abfd;
+ stash->syms = symbols;
}
/* A null debug_section indicates that there was no dwarf1 info
{
struct dwarf1_unit* aUnit
= alloc_dwarf1_unit (stash);
+ if (!aUnit)
+ return FALSE;
aUnit->name = aDieInfo.name;
aUnit->low_pc = aDieInfo.low_pc;