dwarf_arange.c revision 07dc1947c362e187fb955d283b692f8769dd5def
/*
Copyright (C) 2000-2004 Silicon Graphics, Inc. All Rights Reserved.
Portions Copyright (C) 2007-2010 David Anderson. All Rights Reserved.
under the terms of version 2.1 of the GNU Lesser General Public License
as published by the Free Software Foundation.
This program is distributed in the hope that it would be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
Further, this software is distributed without any warranty that it is
free of the rightful claim of any third person regarding infringement
or the like. Any license provided herein, whether implied or
otherwise, applies only to this software file. Patent licenses, if
any, provided herein do not apply to combinations of this program with
other software, or any other product whatsoever.
You should have received a copy of the GNU Lesser General Public
License along with this program; if not, write the Free Software
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston MA 02110-1301,
USA.
Contact information: Silicon Graphics, Inc., 1500 Crittenden Lane,
Mountain View, CA 94043, or:
For further information regarding this notice, see:
*/
/* The address of the Free Software Foundation is
Free Software Foundation, Inc., 51 Franklin St, Fifth Floor,
Boston, MA 02110-1301, USA.
SGI has moved from the Crittenden Lane address.
*/
#include "config.h"
#include "dwarf_incl.h"
#include <stdio.h>
#include "dwarf_arange.h"
#include "dwarf_global.h" /* for _dwarf_fixup_* */
/* Common code for two user-visible routines to share.
Errors here result in memory leaks, but errors here
are serious (making aranges unusable) so we assume
callers will not repeat the error often or mind the leaks.
*/
static int
Dwarf_Error * error)
{
/* Sweeps through the arange. */
Dwarf_Small *arange_ptr = 0;
Dwarf_Small *arange_ptr_start = 0;
/* Start of arange header. Used for rounding offset of arange_ptr
to twice the tuple size. Libdwarf requirement. */
Dwarf_Small *header_ptr = 0;
/* Version of .debug_aranges header. */
Dwarf_Half version = 0;
/* Offset of current set of aranges into .debug_info. */
Dwarf_Off info_offset = 0;
/* Size in bytes of addresses in target. */
Dwarf_Small address_size = 0;
/* Size in bytes of segment offsets in target. */
Dwarf_Small segment_size = 0;
/* Count of total number of aranges. */
Dwarf_Arange arange = 0;
/* Used to chain Dwarf_Aranges structs. */
do {
/* Length of current set of aranges. */
Dwarf_Unsigned length = 0;
Dwarf_Small remainder = 0;
int local_length_size;
/*REFERENCED*/ /* Not used in this instance of the macro */
int local_extension_size = 0;
/* READ_AREA_LENGTH updates arange_ptr for consumed bytes */
arange_ptr, sizeof(Dwarf_Half));
arange_ptr += sizeof(Dwarf_Half);
if (version != CURRENT_VERSION_STAMP) {
return (DW_DLV_ERROR);
}
"arange info offset.a");
return (DW_DLV_ERROR);
}
}
/* It is not an error if the sizes differ.
Unusual, but not an error. */
if (segment_size != 0) {
return (DW_DLV_ERROR);
}
/* Round arange_ptr offset to next multiple of address_size. */
if (remainder != 0) {
}
do {
Dwarf_Addr range_address = 0;
/* For segmented address spaces, the first field to
read is a segment selector (new in DWARF4) */
}
{ /* We used to suppress all-zero entries, but
now we return all aranges entries so we show
the entire content. March 31, 2010. */
arange = (Dwarf_Arange)
return (DW_DLV_ERROR);
}
arange_count++;
if (curr_chain == NULL) {
return (DW_DLV_ERROR);
}
if (head_chain == NULL)
else {
}
}
/* The current set of ranges is terminated by
range_address 0 and range_length 0, but that
does not necessarily terminate the ranges for this CU!
There can be multiple sets in that DWARF
does not explicitly forbid multiple sets.
DWARF2,3,4 section 7.20
We stop short to avoid overrun of the end of the CU.
*/
/* A compiler could emit some padding bytes here. dwarf2/3
(dwarf4 sec 7.20) does not clearly make extra padding
bytes illegal. */
if (arange_ptr_past_end < arange_ptr) {
char buf[200];
" 0x%" DW_PR_DUx
" pad bytes at offset 0x%" DW_PR_DUx
" in .debug_aranges",
}
/* For most compilers, arange_ptr == arange_ptr_past_end at
this point. But not if there were padding bytes */
} while (arange_ptr <
if (arange_ptr !=
return (DW_DLV_ERROR);
}
*chain_out = head_chain;
return DW_DLV_OK;
}
/*
This function returns the count of the number of
aranges in the .debug_aranges section. It sets
aranges to point to a block of Dwarf_Arange's
describing the arange's. It returns DW_DLV_ERROR
on error.
Must be identical in most aspects to
dwarf_get_aranges_addr_offsets!
*/
int
Dwarf_Arange ** aranges,
{
/* Count of total number of aranges. */
Dwarf_Signed arange_count = 0;
Dwarf_Arange *arange_block = 0;
/* Used to chain Dwarf_Aranges structs. */
Dwarf_Unsigned i = 0;
int res = DW_DLV_ERROR;
/* ***** BEGIN CODE ***** */
return (DW_DLV_ERROR);
}
return res;
}
return res;
}
arange_block = (Dwarf_Arange *)
if (arange_block == NULL) {
return (DW_DLV_ERROR);
}
for (i = 0; i < arange_count; i++) {
}
*aranges = arange_block;
*returned_count = (arange_count);
return DW_DLV_OK;
}
/*
This function returns DW_DLV_OK if it succeeds
and DW_DLV_ERR or DW_DLV_OK otherwise.
count is set to the number of addresses in the
.debug_aranges section.
For each address, the corresponding element in
an array is set to the address itself(aranges) and
the section offset (offsets).
Must be identical in most aspects to
dwarf_get_aranges!
*/
int
Dwarf_Addr ** addrs,
Dwarf_Error * error)
{
Dwarf_Unsigned i = 0;
/* Used to chain Dwarf_Aranges structs. */
Dwarf_Signed arange_count = 0;
Dwarf_Addr *arange_addrs = 0;
Dwarf_Off *arange_offsets = 0;
int res = DW_DLV_ERROR;
/* ***** BEGIN CODE ***** */
return (DW_DLV_ERROR);
}
return res;
}
return res;
}
arange_addrs = (Dwarf_Addr *)
if (arange_addrs == NULL) {
return (DW_DLV_ERROR);
}
arange_offsets = (Dwarf_Off *)
if (arange_offsets == NULL) {
return (DW_DLV_ERROR);
}
for (i = 0; i < arange_count; i++) {
}
*count = arange_count;
*addrs = arange_addrs;
return (DW_DLV_OK);
}
/*
This function takes a pointer to a block
of Dwarf_Arange's, and a count of the
length of the block. It checks if the
given address is within the range of an
address range in the block. If yes, it
returns the appropriate Dwarf_Arange.
Otherwise, it returns DW_DLV_ERROR.
*/
int
{
Dwarf_Arange curr_arange = 0;
Dwarf_Unsigned i = 0;
return (DW_DLV_ERROR);
}
for (i = 0; i < arange_count; i++) {
curr_arange = *(aranges + i);
address <
return (DW_DLV_OK);
}
}
return (DW_DLV_NO_ENTRY);
}
/*
This function takes an Dwarf_Arange,
and returns the offset of the first
die in the compilation-unit that the
arange belongs to. Returns DW_DLV_ERROR
on error.
*/
int
Dwarf_Error * error)
{
Dwarf_Debug dbg = 0;
return (DW_DLV_ERROR);
}
return res;
}
}
return DW_DLV_OK;
}
/*
This function takes an Dwarf_Arange,
and returns the offset of the CU header
in the compilation-unit that the
arange belongs to. Returns DW_DLV_ERROR
on error.
Ensures .debug_info loaded so
the cu_offset is meaningful.
*/
int
Dwarf_Error * error)
{
Dwarf_Debug dbg = 0;
return (DW_DLV_ERROR);
}
/* Like dwarf_get_arange_info this ensures debug_info loaded:
the cu_header is in debug_info and will be used else
we would not call dwarf_get_arange_cu_header_offset. */
return res;
}
}
return DW_DLV_OK;
}
/*
This function takes a Dwarf_Arange, and returns
true if it is not NULL. It also stores the start
address of the range in *start, the length of the
range in *length, and the offset of the first die
in the compilation-unit in *cu_die_offset. It
returns false on error.
If cu_die_offset returned ensures .debug_info loaded so
the cu_die_offset is meaningful.
*/
int
Dwarf_Addr * start,
{
return (DW_DLV_ERROR);
}
if (cu_die_offset != NULL) {
return res;
}
}
}
return (DW_DLV_OK);
}
/* New for DWARF4, entries may have segment information.
*segment is only meaningful if *segment_entry_size is non-zero. */
int
Dwarf_Addr * start,
Dwarf_Error * error)
{
return (DW_DLV_ERROR);
}
}
if(segment_entry_size != NULL) {
}
if (cu_die_offset != NULL) {
return res;
}
}
}
return (DW_DLV_OK);
}