1 /* Return list address ranges.
2 Copyright (C) 2000-2010 Red Hat, Inc.
3 This file is part of elfutils.
4 Written by Ulrich Drepper <drepper@redhat.com>, 2000.
6 This file is free software; you can redistribute it and/or modify
7 it under the terms of either
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
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
19 or both in parallel, as here.
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.
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/>. */
42 struct arangelist *next;
45 /* Compare by Dwarf_Arange.addr, given pointers into an array of pointeers. */
47 compare_aranges (const void *a, const void *b)
49 struct arangelist *const *p1 = a, *const *p2 = b;
50 struct arangelist *l1 = *p1, *l2 = *p2;
51 return l1->arange.addr - l2->arange.addr;
55 dwarf_getaranges (dbg, aranges, naranges)
57 Dwarf_Aranges **aranges;
63 if (dbg->aranges != NULL)
65 *aranges = dbg->aranges;
67 *naranges = dbg->aranges->naranges;
71 if (dbg->sectiondata[IDX_debug_aranges] == NULL)
73 /* No such section. */
80 if (dbg->sectiondata[IDX_debug_aranges]->d_buf == NULL)
83 struct arangelist *arangelist = NULL;
84 unsigned int narangelist = 0;
86 const unsigned char *readp = dbg->sectiondata[IDX_debug_aranges]->d_buf;
87 const unsigned char *readendp
88 = readp + dbg->sectiondata[IDX_debug_aranges]->d_size;
90 while (readp < readendp)
92 const unsigned char *hdrstart = readp;
94 /* Each entry starts with a header:
96 1. A 4-byte or 12-byte length containing the length of the
97 set of entries for this compilation unit, not including the
98 length field itself. [...]
100 2. A 2-byte version identifier containing the value 2 for
103 3. A 4-byte or 8-byte offset into the .debug_info section. [...]
105 4. A 1-byte unsigned integer containing the size in bytes of
106 an address (or the offset portion of an address for segmented
107 addressing) on the target system.
109 5. A 1-byte unsigned integer containing the size in bytes of
110 a segment descriptor on the target system. */
111 Dwarf_Word length = read_4ubyte_unaligned_inc (dbg, readp);
112 unsigned int length_bytes = 4;
113 if (length == DWARF3_LENGTH_64_BIT)
115 length = read_8ubyte_unaligned_inc (dbg, readp);
118 else if (unlikely (length >= DWARF3_LENGTH_MIN_ESCAPE_CODE
119 && length <= DWARF3_LENGTH_MAX_ESCAPE_CODE))
122 unsigned int version = read_2ubyte_unaligned_inc (dbg, readp);
126 __libdw_seterrno (DWARF_E_INVALID_DWARF);
128 while (arangelist != NULL)
130 struct arangelist *next = arangelist->next;
138 if (__libdw_read_offset_inc (dbg,
139 IDX_debug_aranges, &readp,
140 length_bytes, &offset, IDX_debug_info, 4))
143 unsigned int address_size = *readp++;
144 if (address_size != 4 && address_size != 8)
147 /* Ignore the segment size value. */
151 /* Round the address to the next multiple of 2*address_size. */
152 readp += ((2 * address_size - ((readp - hdrstart) % (2 * address_size)))
153 % (2 * address_size));
157 Dwarf_Word range_address;
158 Dwarf_Word range_length;
160 if (__libdw_read_address_inc (dbg, IDX_debug_aranges, &readp,
161 address_size, &range_address))
164 if (address_size == 4)
165 range_length = read_4ubyte_unaligned_inc (dbg, readp);
167 range_length = read_8ubyte_unaligned_inc (dbg, readp);
169 /* Two zero values mark the end. */
170 if (range_address == 0 && range_length == 0)
173 /* We don't use alloca for these temporary structures because
174 the total number of them can be quite large. */
175 struct arangelist *new_arange = malloc (sizeof *new_arange);
176 if (unlikely (new_arange == NULL))
178 __libdw_seterrno (DWARF_E_NOMEM);
182 new_arange->arange.addr = range_address;
183 new_arange->arange.length = range_length;
185 /* We store the actual CU DIE offset, not the CU header offset. */
186 const char *cu_header = (dbg->sectiondata[IDX_debug_info]->d_buf
188 unsigned int offset_size;
189 if (read_4ubyte_unaligned_noncvt (cu_header) == DWARF3_LENGTH_64_BIT)
193 new_arange->arange.offset = DIE_OFFSET_FROM_CU_OFFSET (offset,
197 new_arange->next = arangelist;
198 arangelist = new_arange;
201 /* Sanity-check the data. */
202 if (unlikely (new_arange->arange.offset
203 >= dbg->sectiondata[IDX_debug_info]->d_size))
208 if (narangelist == 0)
210 assert (arangelist == NULL);
211 if (naranges != NULL)
217 /* Allocate the array for the result. */
218 void *buf = libdw_alloc (dbg, Dwarf_Aranges,
219 sizeof (Dwarf_Aranges)
220 + narangelist * sizeof (Dwarf_Arange), 1);
222 /* First use the buffer for the pointers, and sort the entries.
223 We'll write the pointers in the end of the buffer, and then
224 copy into the buffer from the beginning so the overlap works. */
225 assert (sizeof (Dwarf_Arange) >= sizeof (Dwarf_Arange *));
226 struct arangelist **sortaranges
227 = (buf + sizeof (Dwarf_Aranges)
228 + ((sizeof (Dwarf_Arange) - sizeof sortaranges[0]) * narangelist));
230 /* The list is in LIFO order and usually they come in clumps with
231 ascending addresses. So fill from the back to probably start with
232 runs already in order before we sort. */
233 unsigned int i = narangelist;
236 sortaranges[i] = arangelist;
237 arangelist = arangelist->next;
239 assert (arangelist == NULL);
241 /* Sort by ascending address. */
242 qsort (sortaranges, narangelist, sizeof sortaranges[0], &compare_aranges);
244 /* Now that they are sorted, put them in the final array.
245 The buffers overlap, so we've clobbered the early elements
246 of SORTARANGES by the time we're reading the later ones. */
248 (*aranges)->dbg = dbg;
249 (*aranges)->naranges = narangelist;
250 dbg->aranges = *aranges;
251 if (naranges != NULL)
252 *naranges = narangelist;
253 for (i = 0; i < narangelist; ++i)
255 struct arangelist *elt = sortaranges[i];
256 (*aranges)->info[i] = elt->arange;
262 INTDEF(dwarf_getaranges)