/*
Copyright (C) 2000-2006 Silicon Graphics, Inc. All Rights Reserved.
Portions Copyright (C) 2009-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:
*/
#include "config.h"
#include "dwarf_incl.h"
#include <stdio.h>
#include <stdlib.h>
#include "dwarf_frame.h"
#include "dwarf_arange.h" /* using Arange as a way to build a list */
/*
Used by rqs (an IRIX application).
Not needed except for that one application.
Should be moved to its own source file since
it is so rarely needed.
Returns DW_DLV_OK if returns the arrays.
Returns DW_DLV_NO_ENTRY if no section. ?? (How do I tell?)
Returns DW_DLV_ERROR if there is an error.
Uses DW_FRAME_CFA_COL because IRIX is only DWARF2
and that is what IRIX compilers and compatible
compilers support on IRIX.
*/
int
Dwarf_Off ** offsetlist,
Dwarf_Error * err)
{
Dwarf_Signed i;
return res;
}
return res;
}
for (i = 0; i < cie_count; i++) {
int j = 0;
int dw_err;
/* search_pc= */ false,
/* search_pc_val= */ 0,
/* location */ 0,
/* Dwarf_frame= */ 0,
/* cie= */ 0,
dbg,
if (res == DW_DLV_ERROR) {
return (res);
} else if (res == DW_DLV_NO_ENTRY) {
continue;
}
for (j = 0; j < icount; ++j) {
/* is DW_CFA_set_loc */
arange = (Dwarf_Arange)
return (DW_DLV_ERROR);
}
arange_count++;
if (curr_chain == NULL) {
return (DW_DLV_ERROR);
}
if (head_chain == NULL)
else {
}
}
}
}
for (i = 0; i < fde_count; i++) {
int j = 0;
int dw_err;
arange = (Dwarf_Arange)
return (DW_DLV_ERROR);
}
arange_count++;
if (curr_chain == NULL) {
return (DW_DLV_ERROR);
}
if (head_chain == NULL)
else {
}
/* search_pc= */ false,
/* search_pc_val= */ 0,
/* location */ 0,
/* Dwarf_frame= */ 0,
/* cie= */ 0,
dbg,
if (res == DW_DLV_ERROR) {
return (res);
} else if (res == DW_DLV_NO_ENTRY) {
continue;
}
for (j = 0; j < icount; ++j) {
/* is DW_CFA_set_loc */
arange = (Dwarf_Arange)
return (DW_DLV_ERROR);
}
arange_count++;
if (curr_chain == NULL) {
return (DW_DLV_ERROR);
}
if (head_chain == NULL)
else {
}
}
}
}
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++) {
}
*addrlist = arange_addrs;
return retval;
}