dwarf_sort_line.c revision 49d3bc91e27cd871b950d56c01398fa2f2e12ab4
/*
Copyright (C) 2000,2002,2004 Silicon Graphics, Inc. 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., 59 Temple Place - Suite 330, Boston MA 02111-1307,
USA.
Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pky,
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_line.h"
#ifdef HAVE_ALLOCA_H
#include <alloca.h>
#endif
#include <malloc.h>
/* the definition of the DWARF2/3 line table prolog.
The value here should be >8 (accounting for
a 64 bit read) and <= the length
of a legal DWARF2/3 line prolog,
which is at least 10 bytes long (but can be longer).
What this constant helps avoid is reading past the end of a
malloc'd buffer in _dwarf_update_line_sec().
*/
static int
unsigned long remaining_bytes,
int *any_change,
int length_size,
/* Used to construct
a linked list of so we can sort and reorder the line info.
*/
struct a_line_area {
int ala_entry_num; /* to guarantee stable sort */
struct a_line_area *ala_next;
};
/*
returns
DW_DLV_OK if nothing went wrong.
DW_DLV_ERROR if could not do anything due to
error. the original buffer is unchanged.
is_64_bit must be passed in by caller and tells
if this is a 32 or 64bit pointer object section
being processed.
err_code must be a non-null pointer to integer.
If DW_DLV_ERROR is returned that integer is set
to a dwarf error code so the caller may
print it for diagnostic purposes.
*any_change is set here
set 0 if no sorting (movement) done.
set 1 if some sorting (movement) done.
on all returns. On error return sets to 0.
*/
int
_dwarf_ld_sort_lines(void *orig_buffer,
unsigned long buffer_len,
{
int length_size = 4;
buffer */
incremented thru to end of our copy
of the input buffer */
used to update line_ptr as we pass
thru compilation units in a .o
.debug_line */
original area left
to be processed.
Changes as we pass
thru compilation
units in a .o
.debug_line */
int sec_res;
int lany_change = 0;
int did_change = 0;
if (is_64_bit)
length_size = 8;
*any_change = 0;
if (!line_ptr) {
return DW_DLV_ERROR;
}
/*
We must iterate thru each of a set of prologues and line data.
We process each set in turn. If all pass, we update the
passed-in buffer. */
&new_line_ptr);
err_code, &new_line_ptr)) {
if (lany_change) {
did_change = 1;
}
if (remaining_bytes > 0) {
continue;
}
break;
}
if (sec_res == DW_DLV_ERROR) {
return sec_res;
}
/* all passed */
if (did_change) {
/* So update the passed in buffer orig_buffer is caller's
input area. orig_line_ptr is our modified copy of input
area. */
*any_change = 1;
}
return sec_res;
}
/* By setting ala_entry_num we guarantee a stable sort,
no duplicates
Sorting in address order.
*/
static int
{
const struct a_line_area *l = lin;
const struct a_line_area *r = rin;
if (l->ala_address < r->ala_address) {
return -1;
}
if (l->ala_address > r->ala_address) {
return 1;
}
if (l->ala_entry_num < r->ala_entry_num) {
return -1;
}
if (l->ala_entry_num > r->ala_entry_num) {
return 1;
}
return 0; /* should never happen. */
}
/*
On entry:
line_ptr must point to first
byte of a line group for one (original) .o
remaining_bytes is the size of the area pointed to
by line_ptr: may be larger than the
current original compilation unit .
length size is 4 for 32bit pointers, 8 for 64bit pointers
in the data pointed to.
On return:
return DW_DLV_OK if all ok. (ignore
*err_code in this case)
return DW_DLV_ERROR and set *err_code if an error.
If some line data was moved around, set *any_change to 1.
If error or no movement, set *any_change to 0;
Set *new_line_ptr to one-byte-past the end of the
current original compilation unit (not necessary
if returning DW_DLV_ERROR, but not harmful).
This copies the entire array to a malloc area, then
mallocs pieces of it (another malloc) for sorting a CU entries
and copying back. Then at end the whole new thing copied in.
The result is that on error, the input is not touched.
An alternative would be to just update a piece at a time
and on error stop updating but leave what was done, done.
This alternative would save some temporary malloc space.
*/
static int
unsigned long remaining_bytes,
int *any_change,
int length_size,
{
/*
This points to the last byte of the .debug_line portion for the
current cu. */
/*
This points to the end of the statement program prologue for the
current cu, and serves to check that the prologue was correctly
decoded. */
/* These are the fields of the statement program header. */
struct Dwarf_Debug_s dbg_data;
Dwarf_Small *opcode_length = 0;
/* These are the state machine state variables. */
struct a_line_area *area_base = 0;
struct a_line_area *area_current = 0;
long area_count = 0;
Dwarf_Addr last_address = 0;
int need_to_sort = 0;
Dwarf_Sword i;
/*
This is the current opcode read from the statement program. */
/*
These variables are used to decode leb128 numbers. Leb128_num
holds the decoded number, and leb128_length is its length in
bytes. */
/*
This is the operand of the latest fixed_advance_pc extended
opcode. */
/* This is the length of an extended opcode instr. */
/*
Following is a straightforward decoding of the statement
program prologue information. */
*any_change = 0;
/* We are at the end. Remaining should be zero bytes,
padding.
This is really just 'end of CU buffer'
not an error.
The is no 'entry' left so report there is none.
We don't want to READ_UNALIGNED the total_length below
and then belatedly discover that we read off the end
already.
*/
return(DW_DLV_NO_ENTRY);
}
line_ptr += length_size;
return (DW_DLV_ERROR);
}
line_ptr, sizeof(Dwarf_Half));
line_ptr += sizeof(Dwarf_Half);
if (version != CURRENT_VERSION_STAMP) {
return (DW_DLV_ERROR);
}
line_ptr += length_size;
opcode_length = (Dwarf_Small *)
for (i = 1; i < opcode_base; i++) {
}
while ((*(char *) line_ptr) != '\0') {
}
line_ptr++;
file_entry_count = 0;
while (*(char *) line_ptr != '\0') {
/* filename = (Dwarf_Small *)line_ptr; */
/* dir_index = */
/* time_last_mod = */
/* file_length = */
}
line_ptr++;
return (DW_DLV_ERROR);
}
/* Initialize the state machine. */
address = 0;
/* file = 1; */
line = 1;
/* column = 0; */
/* basic_block = false; */
/* end_sequence = false; */
/* Start of statement program. */
while (line_ptr < line_ptr_end) {
int type;
line_ptr++;
/* 'type' is the output */
if (type == LOP_DISCARD) {
/* do nothing, necessary ops done */
} else if (type == LOP_SPECIAL) {
(opcode / line_range);
/* basic_block = false; */
} else if (type == LOP_STANDARD) {
switch (opcode) {
case DW_LNS_copy:{
if (opcode_length[DW_LNS_copy] != 0) {
return (DW_DLV_ERROR);
}
/* basic_block = false; */
break;
}
case DW_LNS_advance_pc:{
return (DW_DLV_ERROR);
}
address =
address +
break;
}
case DW_LNS_advance_line:{
return (DW_DLV_ERROR);
}
break;
}
case DW_LNS_set_file:{
return (DW_DLV_ERROR);
}
/* file = (Dwarf_Word)utmp2; */
break;
}
case DW_LNS_set_column:{
return (DW_DLV_ERROR);
}
/* column = (Dwarf_Word)utmp2; */
break;
}
case DW_LNS_negate_stmt:{
if (opcode_length[DW_LNS_negate_stmt] != 0) {
return (DW_DLV_ERROR);
}
break;
}
case DW_LNS_set_basic_block:{
if (opcode_length[DW_LNS_set_basic_block] != 0) {
return (DW_DLV_ERROR);
}
/* basic_block = true; */
break;
}
case DW_LNS_const_add_pc:{
(opcode / line_range);
break;
}
case DW_LNS_fixed_advance_pc:{
return (DW_DLV_ERROR);
}
line_ptr, sizeof(Dwarf_Half));
line_ptr += sizeof(Dwarf_Half);
break;
}
}
} else if (type == LOP_EXTENDED) {
line_ptr++;
switch (ext_opcode) {
case DW_LNE_end_sequence:{
/* end_sequence = true; */
address = 0;
/* file = 1; */
line = 1;
/* column = 0; */
/* basic_block = false; */
/* end_sequence = false; */
break;
}
case DW_LNE_set_address:{
struct a_line_area *area;
/* Here we need to remember the offset into the
buffer and check to see if address went
down. */
if (address < last_address) {
need_to_sort = 1;
}
area->ala_length = 0;
if (area_current) {
area->ala_offset -
}
++area_count;
area_current = area;
if (area_base == 0) {
}
line_ptr += length_size;
} else {
return (DW_DLV_ERROR);
}
break;
}
case DW_LNE_define_file:{
break;
}
default:{
return (DW_DLV_ERROR);
}
}
}
}
if (!need_to_sort) {
return (DW_DLV_OK);
}
/* so now we have something to sort. First, finish off the last
area record: */
offset */
/* Build and sort a simple array of sections. Forcing a stable sort
by comparing on sequence number. We will use the sorted list to
move sections of this part of the line table. Each 'section'
starting with a DW_LNE_set_address opcode, on the assumption
that such only get out of order where there was an ld-cord
function rearrangement and that it is meaningful to restart the
line info there. */
{
struct a_line_area *ala_array;
struct a_line_area *local;
long start_len;
long i;
if (!ala_array) {
return DW_DLV_ERROR;
}
}
/* Now we must rearrange the pieces of the line table. */
if (!new_area) {
return DW_DLV_ERROR;
}
for (i = 0; i < area_count; ++i) {
}
ala_array = 0;
new_area = 0;
}
*any_change = 1;
return (DW_DLV_OK);
}