Branch data Line data Source code
1 : : /* Find CU for given offset.
2 : : Copyright (C) 2003-2010, 2014, 2016, 2017, 2018 Red Hat, Inc.
3 : : This file is part of elfutils.
4 : : Written by Ulrich Drepper <drepper@redhat.com>, 2003.
5 : :
6 : : This file is free software; you can redistribute it and/or modify
7 : : it under the terms of either
8 : :
9 : : * the GNU Lesser General Public License as published by the Free
10 : : Software Foundation; either version 3 of the License, or (at
11 : : your option) any later version
12 : :
13 : : or
14 : :
15 : : * the GNU General Public License as published by the Free
16 : : Software Foundation; either version 2 of the License, or (at
17 : : your option) any later version
18 : :
19 : : or both in parallel, as here.
20 : :
21 : : elfutils is distributed in the hope that it will be useful, but
22 : : WITHOUT ANY WARRANTY; without even the implied warranty of
23 : : MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
24 : : General Public License for more details.
25 : :
26 : : You should have received copies of the GNU General Public License and
27 : : the GNU Lesser General Public License along with this program. If
28 : : not, see <http://www.gnu.org/licenses/>. */
29 : :
30 : : #ifdef HAVE_CONFIG_H
31 : : # include <config.h>
32 : : #endif
33 : :
34 : : #include <assert.h>
35 : : #include <search.h>
36 : : #include "libdwP.h"
37 : :
38 : : static int
39 : 7382610 : findcu_cb (const void *arg1, const void *arg2)
40 : : {
41 : 7382610 : struct Dwarf_CU *cu1 = (struct Dwarf_CU *) arg1;
42 : 7382610 : struct Dwarf_CU *cu2 = (struct Dwarf_CU *) arg2;
43 : :
44 : : /* Find out which of the two arguments is the search value. It has
45 : : end offset 0. */
46 [ + + ]: 7382610 : if (cu1->end == 0)
47 : : {
48 [ + + ]: 6947743 : if (cu1->start < cu2->start)
49 : : return -1;
50 [ + + ]: 6934160 : if (cu1->start >= cu2->end)
51 : 6267773 : return 1;
52 : : }
53 : : else
54 : : {
55 [ - + ]: 434867 : if (cu2->start < cu1->start)
56 : : return 1;
57 [ # # ]: 0 : if (cu2->start >= cu1->end)
58 : 0 : return -1;
59 : : }
60 : :
61 : : return 0;
62 : : }
63 : :
64 : : int
65 : 261 : __libdw_finddbg_cb (const void *arg1, const void *arg2)
66 : : {
67 : 261 : Dwarf *dbg1 = (Dwarf *) arg1;
68 : 261 : Dwarf *dbg2 = (Dwarf *) arg2;
69 : :
70 : 261 : Elf_Data *dbg1_data = dbg1->sectiondata[IDX_debug_info];
71 : 261 : unsigned char *dbg1_start = dbg1_data->d_buf;
72 : 261 : size_t dbg1_size = dbg1_data->d_size;
73 : :
74 : 261 : Elf_Data *dbg2_data = dbg2->sectiondata[IDX_debug_info];
75 : 261 : unsigned char *dbg2_start = dbg2_data->d_buf;
76 : 261 : size_t dbg2_size = dbg2_data->d_size;
77 : :
78 : : /* Find out which of the two arguments is the search value. It has
79 : : a size of 0. */
80 [ + + ]: 261 : if (dbg1_size == 0)
81 : : {
82 [ + - ]: 220 : if (dbg1_start < dbg2_start)
83 : : return -1;
84 [ + + ]: 220 : if (dbg1_start >= dbg2_start + dbg2_size)
85 : 72 : return 1;
86 : : }
87 : : else
88 : : {
89 [ + + ]: 41 : if (dbg2_start < dbg1_start)
90 : : return 1;
91 [ + + ]: 26 : if (dbg2_start >= dbg1_start + dbg1_size)
92 : 4 : return -1;
93 : : }
94 : :
95 : : return 0;
96 : : }
97 : :
98 : : struct Dwarf_CU *
99 : : internal_function
100 : 39655 : __libdw_intern_next_unit (Dwarf *dbg, bool debug_types)
101 : : {
102 : 79310 : Dwarf_Off *const offsetp
103 [ + + ]: 39655 : = debug_types ? &dbg->next_tu_offset : &dbg->next_cu_offset;
104 : 39655 : void **tree = debug_types ? &dbg->tu_tree : &dbg->cu_tree;
105 : :
106 : 39655 : Dwarf_Off oldoff = *offsetp;
107 : 39655 : uint16_t version;
108 : 39655 : uint8_t unit_type;
109 : 39655 : uint8_t address_size;
110 : 39655 : uint8_t offset_size;
111 : 39655 : Dwarf_Off abbrev_offset;
112 : 39655 : uint64_t unit_id8;
113 : 39655 : Dwarf_Off subdie_offset;
114 : :
115 [ + + ]: 39655 : if (__libdw_next_unit (dbg, debug_types, oldoff, offsetp, NULL,
116 : : &version, &unit_type, &abbrev_offset,
117 : : &address_size, &offset_size,
118 : : &unit_id8, &subdie_offset) != 0)
119 : : /* No more entries. */
120 : : return NULL;
121 : :
122 : : /* We only know how to handle the DWARF version 2 through 5 formats.
123 : : For v4 debug types we only handle version 4. */
124 [ + - + - ]: 39650 : if (unlikely (version < 2) || unlikely (version > 5)
125 [ + + - + ]: 39650 : || (debug_types && unlikely (version != 4)))
126 : : {
127 : 0 : __libdw_seterrno (DWARF_E_VERSION);
128 : 0 : return NULL;
129 : : }
130 : :
131 : : /* We only handle 32 or 64 bit (4 or 8 byte) addresses and offsets.
132 : : Just assume we are dealing with 64bit in case the size is "unknown".
133 : : Too much code assumes if it isn't 4 then it is 8 (or the other way
134 : : around). */
135 [ - + ]: 39650 : if (unlikely (address_size != 4 && address_size != 8))
136 : 0 : address_size = 8;
137 [ - + ]: 39650 : if (unlikely (offset_size != 4 && offset_size != 8))
138 : 0 : offset_size = 8;
139 : :
140 : : /* Invalid or truncated debug section data? */
141 : 39650 : size_t sec_idx = debug_types ? IDX_debug_types : IDX_debug_info;
142 : 39650 : Elf_Data *data = dbg->sectiondata[sec_idx];
143 [ - + ]: 39650 : if (unlikely (*offsetp > data->d_size))
144 : 0 : *offsetp = data->d_size;
145 : :
146 : 39650 : uint32_t dwp_row;
147 : 39650 : Dwarf_Off dwp_abbrev_offset;
148 [ - + ]: 39650 : if (__libdw_dwp_find_unit (dbg, debug_types, oldoff, version, unit_type,
149 : : unit_id8, &dwp_row, &dwp_abbrev_offset) != 0)
150 : : return NULL;
151 : 39650 : abbrev_offset += dwp_abbrev_offset;
152 : :
153 : : /* Create an entry for this CU. */
154 [ + + ]: 39650 : struct Dwarf_CU *newp = libdw_typed_alloc (dbg, struct Dwarf_CU);
155 : :
156 : 39650 : newp->dbg = dbg;
157 : 39650 : newp->sec_idx = sec_idx;
158 : 39650 : newp->start = oldoff;
159 : 39650 : newp->end = *offsetp;
160 : 39650 : newp->dwp_row = dwp_row;
161 : 39650 : newp->address_size = address_size;
162 : 39650 : newp->offset_size = offset_size;
163 : 39650 : newp->version = version;
164 : 39650 : newp->unit_id8 = unit_id8;
165 : 39650 : newp->subdie_offset = subdie_offset;
166 : 39650 : Dwarf_Abbrev_Hash_init (&newp->abbrev_hash, 41);
167 : 39650 : newp->orig_abbrev_offset = newp->last_abbrev_offset = abbrev_offset;
168 : 39650 : newp->files = NULL;
169 : 39650 : newp->lines = NULL;
170 : 39650 : newp->locs = NULL;
171 : 39650 : newp->split = (Dwarf_CU *) -1;
172 : 39650 : newp->base_address = (Dwarf_Addr) -1;
173 : 39650 : newp->addr_base = (Dwarf_Off) -1;
174 : 39650 : newp->str_off_base = (Dwarf_Off) -1;
175 : 39650 : newp->ranges_base = (Dwarf_Off) -1;
176 : 39650 : newp->locs_base = (Dwarf_Off) -1;
177 : :
178 : 39650 : newp->startp = data->d_buf + newp->start;
179 : 39650 : newp->endp = data->d_buf + newp->end;
180 : :
181 : : /* v4 debug type units have version == 4 and unit_type == DW_UT_type. */
182 [ + + ]: 39650 : if (debug_types)
183 : 22 : newp->unit_type = DW_UT_type;
184 [ + + ]: 39628 : else if (version < 5)
185 : : {
186 : : /* This is a reasonable guess (and needed to get the CUDIE). */
187 : 698 : newp->unit_type = DW_UT_compile;
188 : :
189 : : /* But set it correctly from the actual CUDIE tag. */
190 : 698 : Dwarf_Die cudie = CUDIE (newp);
191 : 698 : int tag = INTUSE(dwarf_tag) (&cudie);
192 [ + + ]: 698 : if (tag == DW_TAG_compile_unit)
193 : : {
194 : 673 : Dwarf_Attribute dwo_id;
195 [ + + ]: 673 : if (INTUSE(dwarf_attr) (&cudie, DW_AT_GNU_dwo_id, &dwo_id) != NULL)
196 : : {
197 : 135 : Dwarf_Word id8;
198 [ + - ]: 135 : if (INTUSE(dwarf_formudata) (&dwo_id, &id8) == 0)
199 : : {
200 [ + + ]: 135 : if (INTUSE(dwarf_haschildren) (&cudie) == 0
201 [ + - ]: 66 : && INTUSE(dwarf_hasattr) (&cudie,
202 : : DW_AT_GNU_dwo_name) == 1)
203 : 66 : newp->unit_type = DW_UT_skeleton;
204 : : else
205 : 69 : newp->unit_type = DW_UT_split_compile;
206 : :
207 : 135 : newp->unit_id8 = id8;
208 : : }
209 : : }
210 : : }
211 [ + + ]: 25 : else if (tag == DW_TAG_partial_unit)
212 : 23 : newp->unit_type = DW_UT_partial;
213 [ - + ]: 2 : else if (tag == DW_TAG_type_unit)
214 : 0 : newp->unit_type = DW_UT_type;
215 : : }
216 : : else
217 : 38930 : newp->unit_type = unit_type;
218 : :
219 : : /* Store a reference to any type unit ids in the hash for quick lookup. */
220 [ + + ]: 39650 : if (unit_type == DW_UT_type || unit_type == DW_UT_split_type)
221 : 37 : Dwarf_Sig8_Hash_insert (&dbg->sig8_hash, unit_id8, newp);
222 : :
223 : : /* Add the new entry to the search tree. */
224 [ - + ]: 39650 : if (tsearch (newp, tree, findcu_cb) == NULL)
225 : : {
226 : : /* Something went wrong. Undo the operation. */
227 : 0 : *offsetp = oldoff;
228 : 0 : __libdw_seterrno (DWARF_E_NOMEM);
229 : 0 : return NULL;
230 : : }
231 : :
232 : : return newp;
233 : : }
234 : :
235 : : struct Dwarf_CU *
236 : : internal_function
237 : 54235 : __libdw_findcu (Dwarf *dbg, Dwarf_Off start, bool v4_debug_types)
238 : : {
239 [ + + ]: 54235 : void **tree = v4_debug_types ? &dbg->tu_tree : &dbg->cu_tree;
240 : 108470 : Dwarf_Off *next_offset
241 : 54235 : = v4_debug_types ? &dbg->next_tu_offset : &dbg->next_cu_offset;
242 : :
243 : : /* Maybe we already know that CU. */
244 : 54235 : struct Dwarf_CU fake = { .start = start, .end = 0 };
245 : 54235 : struct Dwarf_CU **found = tfind (&fake, tree, findcu_cb);
246 [ + + ]: 54235 : if (found != NULL)
247 : 14592 : return *found;
248 : :
249 [ + + ]: 39643 : if (start < *next_offset)
250 : : {
251 : 5 : __libdw_seterrno (DWARF_E_INVALID_DWARF);
252 : 5 : return NULL;
253 : : }
254 : :
255 : : /* No. Then read more CUs. */
256 : 39653 : while (1)
257 : : {
258 : 39653 : struct Dwarf_CU *newp = __libdw_intern_next_unit (dbg, v4_debug_types);
259 [ + + ]: 39653 : if (newp == NULL)
260 : : return NULL;
261 : :
262 : : /* Is this the one we are looking for? */
263 [ + + + - ]: 39649 : if (start < *next_offset || start == newp->start)
264 : 39634 : return newp;
265 : : }
266 : : /* NOTREACHED */
267 : : }
268 : :
269 : : struct Dwarf_CU *
270 : : internal_function
271 : 651958 : __libdw_findcu_addr (Dwarf *dbg, void *addr)
272 : : {
273 : 651958 : void **tree;
274 : 651958 : Dwarf_Off start;
275 [ + + ]: 651958 : if (addr >= dbg->sectiondata[IDX_debug_info]->d_buf
276 : 651795 : && addr < (dbg->sectiondata[IDX_debug_info]->d_buf
277 [ + + ]: 651795 : + dbg->sectiondata[IDX_debug_info]->d_size))
278 : : {
279 : 651779 : tree = &dbg->cu_tree;
280 : 651779 : start = addr - dbg->sectiondata[IDX_debug_info]->d_buf;
281 : : }
282 [ + + ]: 179 : else if (dbg->sectiondata[IDX_debug_types] != NULL
283 [ + - ]: 16 : && addr >= dbg->sectiondata[IDX_debug_types]->d_buf
284 : 16 : && addr < (dbg->sectiondata[IDX_debug_types]->d_buf
285 [ + - ]: 16 : + dbg->sectiondata[IDX_debug_types]->d_size))
286 : : {
287 : 16 : tree = &dbg->tu_tree;
288 : 16 : start = addr - dbg->sectiondata[IDX_debug_types]->d_buf;
289 : : }
290 : : else
291 : : return NULL;
292 : :
293 : 651795 : struct Dwarf_CU fake = { .start = start, .end = 0 };
294 : 651795 : struct Dwarf_CU **found = tfind (&fake, tree, findcu_cb);
295 : :
296 [ - + ]: 651795 : if (found != NULL)
297 : 651795 : return *found;
298 : :
299 : : return NULL;
300 : : }
301 : :
302 : : Dwarf *
303 : : internal_function
304 : 148 : __libdw_find_split_dbg_addr (Dwarf *dbg, void *addr)
305 : : {
306 : : /* XXX Assumes split DWARF only has CUs in main IDX_debug_info. */
307 : 148 : Elf_Data fake_data = { .d_buf = addr, .d_size = 0 };
308 : 148 : Dwarf fake = { .sectiondata[IDX_debug_info] = &fake_data };
309 : 148 : Dwarf **found = tfind (&fake, &dbg->split_tree, __libdw_finddbg_cb);
310 : :
311 [ + - ]: 148 : if (found != NULL)
312 : 148 : return *found;
313 : :
314 : : return NULL;
315 : : }
|
