1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/* 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>
/* Add one breakpoint location to the result vector. */
static inline int
add_bkpt (Dwarf_Addr pc, Dwarf_Addr **bkpts, int *pnbkpts)
{
Dwarf_Addr *newlist = realloc (*bkpts, ++(*pnbkpts) * sizeof newlist[0]);
if (newlist == NULL)
{
free (*bkpts);
*bkpts = NULL;
__libdw_seterrno (DWARF_E_NOMEM);
return -1;
}
newlist[*pnbkpts - 1] = pc;
*bkpts = newlist;
return *pnbkpts;
}
/* Fallback result, break at the entrypc/lowpc value. */
static inline int
entrypc_bkpt (Dwarf_Die *die, Dwarf_Addr **bkpts, int *pnbkpts)
{
Dwarf_Addr pc;
return INTUSE(dwarf_entrypc) (die, &pc) < 0 ? -1 : add_bkpt (pc, bkpts, pnbkpts);
}
/* 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. */
static inline int
search_range (Dwarf_Addr low, Dwarf_Addr high,
bool dwarf, bool adhoc,
Dwarf_Lines *lines, size_t nlines,
Dwarf_Addr **bkpts, int *pnbkpts)
{
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, bkpts, pnbkpts) < 0)
return -1;
if (adhoc && *pnbkpts == 0)
while (++l < nlines && lines->info[l].addr < high)
if (!lines->info[l].end_sequence)
return add_bkpt (lines->info[l].addr, bkpts, pnbkpts);
return *pnbkpts;
}
__libdw_seterrno (DWARF_E_INVALID_DWARF);
return -1;
}
int
dwarf_entry_breakpoints (Dwarf_Die *die, Dwarf_Addr **bkpts)
{
int nbkpts = 0;
*bkpts = NULL;
/* 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 (die, bkpts, &nbkpts);
__libdw_seterrno (error);
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, lines, nlines, bkpts, &nbkpts)
?: entrypc_bkpt (die, bkpts, &nbkpts);
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,
lines, nlines, bkpts, &nbkpts) < 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,
lines, nlines, bkpts, &nbkpts))
?: entrypc_bkpt (die, bkpts, &nbkpts));
}
|
