mirror of
https://github.com/openharmony/third_party_elfutils.git
synced 2026-07-19 19:43:34 -04:00
de2ed97f33
* Change name from "Red Hat elfutils" to "elfutils". * Update license of standalone tools and test from GPLv2 to GPLv3+. * Change license of libraries from GPLv2+exception to GPLv2/LGPLv3+. * Add Developer Certificate of Origin based contributor policy. top-level: - COPYING: Upgraded from GPLv2 to GPLv3. - CONTRIBUTING, COPYING-GPLv2, COPYING-LGPLv3: New files. - NEWS: Added note about new contribution and license policy. - Makefile.am: Updated to GPLv3, added new files to EXTRA_DIST. - configure.ac: Update to GPLv3, changed AC_INIT name to 'elfutils'. backends, lib, libasm, libcpu, libdw, libdwfl, libebl, libelf: - All files updated to GPLv2/LGPLv3+. Except some very small files (<5 lines) which didn't have any headers at all before, the linker .maps files and the libcpu/defs files which only contain data and libelf/elf.h which comes from glibc and is under LGPLv2+. config: - elfutils.spec.in: Add new License: headers and new %doc files. - Update all license headers to GPLv2/LGPLv3+ for files used by libs. src, tests: - All files updated to GPLv3+. Except for the test bz2 data files, the linker maps and script files and some very small files (<5 lines) that don't have any headers. Signed-off-by: Richard Fontana <rfontana@redhat.com> Signed-off-by: Mark Wielaard <mjw@redhat.com>
158 lines
4.3 KiB
C
158 lines
4.3 KiB
C
/* Find entry breakpoint locations for a function.
|
|
Copyright (C) 2005-2009 Red Hat, Inc.
|
|
This file is part of elfutils.
|
|
|
|
This file is free software; you can redistribute it and/or modify
|
|
it under the terms of either
|
|
|
|
* the GNU Lesser General Public License as published by the Free
|
|
Software Foundation; either version 3 of the License, or (at
|
|
your option) any later version
|
|
|
|
or
|
|
|
|
* the GNU General Public License as published by the Free
|
|
Software Foundation; either version 2 of the License, or (at
|
|
your option) any later version
|
|
|
|
or both in parallel, as here.
|
|
|
|
elfutils is distributed in the hope that it will be useful, but
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
General Public License for more details.
|
|
|
|
You should have received copies of the GNU General Public License and
|
|
the GNU Lesser General Public License along with this program. If
|
|
not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
# include <config.h>
|
|
#endif
|
|
#include "libdwP.h"
|
|
#include <dwarf.h>
|
|
#include <stdlib.h>
|
|
|
|
|
|
int
|
|
dwarf_entry_breakpoints (die, bkpts)
|
|
Dwarf_Die *die;
|
|
Dwarf_Addr **bkpts;
|
|
{
|
|
int nbkpts = 0;
|
|
*bkpts = NULL;
|
|
|
|
/* Add one breakpoint location to the result vector. */
|
|
inline int add_bkpt (Dwarf_Addr pc)
|
|
{
|
|
Dwarf_Addr *newlist = realloc (*bkpts, ++nbkpts * sizeof newlist[0]);
|
|
if (newlist == NULL)
|
|
{
|
|
free (*bkpts);
|
|
*bkpts = NULL;
|
|
__libdw_seterrno (DWARF_E_NOMEM);
|
|
return -1;
|
|
}
|
|
newlist[nbkpts - 1] = pc;
|
|
*bkpts = newlist;
|
|
return nbkpts;
|
|
}
|
|
|
|
/* Fallback result, break at the entrypc/lowpc value. */
|
|
inline int entrypc_bkpt (void)
|
|
{
|
|
Dwarf_Addr pc;
|
|
return INTUSE(dwarf_entrypc) (die, &pc) < 0 ? -1 : add_bkpt (pc);
|
|
}
|
|
|
|
/* Fetch the CU's line records to look for this DIE's addresses. */
|
|
Dwarf_Die cudie = CUDIE (die->cu);
|
|
Dwarf_Lines *lines;
|
|
size_t nlines;
|
|
if (INTUSE(dwarf_getsrclines) (&cudie, &lines, &nlines) < 0)
|
|
{
|
|
int error = INTUSE (dwarf_errno) ();
|
|
if (error == 0) /* CU has no DW_AT_stmt_list. */
|
|
return entrypc_bkpt ();
|
|
__libdw_seterrno (error);
|
|
return -1;
|
|
}
|
|
|
|
/* Search a contiguous PC range for prologue-end markers.
|
|
If DWARF, look for proper markers.
|
|
Failing that, if ADHOC, look for the ad hoc convention. */
|
|
inline int search_range (Dwarf_Addr low, Dwarf_Addr high,
|
|
bool dwarf, bool adhoc)
|
|
{
|
|
size_t l = 0, u = nlines;
|
|
while (l < u)
|
|
{
|
|
size_t idx = (l + u) / 2;
|
|
if (lines->info[idx].addr < low)
|
|
l = idx + 1;
|
|
else if (lines->info[idx].addr > low)
|
|
u = idx;
|
|
else if (lines->info[idx].end_sequence)
|
|
l = idx + 1;
|
|
else
|
|
{
|
|
l = idx;
|
|
break;
|
|
}
|
|
}
|
|
if (l < u)
|
|
{
|
|
if (dwarf)
|
|
for (size_t i = l; i < u && lines->info[i].addr < high; ++i)
|
|
if (lines->info[i].prologue_end
|
|
&& add_bkpt (lines->info[i].addr) < 0)
|
|
return -1;
|
|
if (adhoc && nbkpts == 0)
|
|
while (++l < nlines && lines->info[l].addr < high)
|
|
if (!lines->info[l].end_sequence)
|
|
return add_bkpt (lines->info[l].addr);
|
|
return nbkpts;
|
|
}
|
|
__libdw_seterrno (DWARF_E_INVALID_DWARF);
|
|
return -1;
|
|
}
|
|
|
|
/* Search each contiguous address range for DWARF prologue_end markers. */
|
|
|
|
Dwarf_Addr base;
|
|
Dwarf_Addr begin;
|
|
Dwarf_Addr end;
|
|
ptrdiff_t offset = INTUSE(dwarf_ranges) (die, 0, &base, &begin, &end);
|
|
if (offset < 0)
|
|
return -1;
|
|
|
|
/* Most often there is a single contiguous PC range for the DIE. */
|
|
if (offset == 1)
|
|
return search_range (begin, end, true, true) ?: entrypc_bkpt ();
|
|
|
|
Dwarf_Addr lowpc = (Dwarf_Addr) -1l;
|
|
Dwarf_Addr highpc = (Dwarf_Addr) -1l;
|
|
while (offset > 0)
|
|
{
|
|
/* We have an address range entry. */
|
|
if (search_range (begin, end, true, false) < 0)
|
|
return -1;
|
|
|
|
if (begin < lowpc)
|
|
{
|
|
lowpc = begin;
|
|
highpc = end;
|
|
}
|
|
|
|
offset = INTUSE(dwarf_ranges) (die, offset, &base, &begin, &end);
|
|
}
|
|
|
|
/* If we didn't find any proper DWARF markers, then look in the
|
|
lowest-addressed range for an ad hoc marker. Failing that,
|
|
fall back to just using the entrypc value. */
|
|
return (nbkpts
|
|
?: (lowpc == (Dwarf_Addr) -1l ? 0
|
|
: search_range (lowpc, highpc, false, true))
|
|
?: entrypc_bkpt ());
|
|
}
|