1 /* Compute size of an aggregate type from DWARF.
2 Copyright (C) 2010, 2014, 2016 Red Hat, Inc.
3 This file is part of elfutils.
5 This file is free software; you can redistribute it and/or modify
6 it under the terms of either
8 * the GNU Lesser General Public License as published by the Free
9 Software Foundation; either version 3 of the License, or (at
10 your option) any later version
14 * the GNU General Public License as published by the Free
15 Software Foundation; either version 2 of the License, or (at
16 your option) any later version
18 or both in parallel, as here.
20 elfutils is distributed in the hope that it will be useful, but
21 WITHOUT ANY WARRANTY; without even the implied warranty of
22 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
23 General Public License for more details.
25 You should have received copies of the GNU General Public License and
26 the GNU Lesser General Public License along with this program. If
27 not, see <http://www.gnu.org/licenses/>. */
38 get_type (Dwarf_Die *die, Dwarf_Attribute *attr_mem, Dwarf_Die *type_mem)
40 Dwarf_Die *type = INTUSE(dwarf_formref_die)
41 (INTUSE(dwarf_attr_integrate) (die, DW_AT_type, attr_mem), type_mem);
43 if (INTUSE(dwarf_peel_type) (type, type) != 0)
49 static int aggregate_size (Dwarf_Die *die, Dwarf_Word *size,
50 Dwarf_Die *type_mem, int depth);
53 array_size (Dwarf_Die *die, Dwarf_Word *size,
54 Dwarf_Attribute *attr_mem, int depth)
57 Dwarf_Die type_mem, aggregate_type_mem;
58 if (aggregate_size (get_type (die, attr_mem, &type_mem), &eltsize,
59 &aggregate_type_mem, depth) != 0)
62 /* An array can have DW_TAG_subrange_type or DW_TAG_enumeration_type
63 children instead that give the size of each dimension. */
66 if (INTUSE(dwarf_child) (die, &child) != 0)
70 Dwarf_Word count_total = 1;
74 switch (INTUSE(dwarf_tag) (&child))
76 case DW_TAG_subrange_type:
77 /* This has either DW_AT_count or DW_AT_upper_bound. */
78 if (INTUSE(dwarf_attr_integrate) (&child, DW_AT_count,
81 if (INTUSE(dwarf_formudata) (attr_mem, &count) != 0)
88 if (INTUSE(dwarf_formsdata) (INTUSE(dwarf_attr_integrate)
89 (&child, DW_AT_upper_bound,
90 attr_mem), &upper) != 0)
93 /* Having DW_AT_lower_bound is optional. */
94 if (INTUSE(dwarf_attr_integrate) (&child, DW_AT_lower_bound,
97 if (INTUSE(dwarf_formsdata) (attr_mem, &lower) != 0)
102 Dwarf_Die cu = CUDIE (die->cu);
103 int lang = INTUSE(dwarf_srclang) (&cu);
105 || INTUSE(dwarf_default_lower_bound) (lang, &lower) != 0)
108 if (unlikely (lower > upper))
110 count = upper - lower + 1;
114 case DW_TAG_enumeration_type:
115 /* We have to find the DW_TAG_enumerator child with the
116 highest value to know the array's element count. */
118 Dwarf_Die enum_child;
119 int has_children = INTUSE(dwarf_child) (die, &enum_child);
120 if (has_children < 0)
122 if (has_children > 0)
124 if (INTUSE(dwarf_tag) (&enum_child) == DW_TAG_enumerator)
127 if (INTUSE(dwarf_formudata) (INTUSE(dwarf_attr_integrate)
128 (&enum_child, DW_AT_const_value,
129 attr_mem), &value) != 0)
134 while (INTUSE(dwarf_siblingof) (&enum_child, &enum_child) > 0);
141 count_total *= count;
145 while (INTUSE(dwarf_siblingof) (&child, &child) == 0);
150 /* This is a subrange_type or enumeration_type and we've set COUNT.
151 Now determine the stride for this array. */
152 Dwarf_Word stride = eltsize;
153 if (INTUSE(dwarf_attr_integrate) (die, DW_AT_byte_stride,
156 if (INTUSE(dwarf_formudata) (attr_mem, &stride) != 0)
159 else if (INTUSE(dwarf_attr_integrate) (die, DW_AT_bit_stride,
162 if (INTUSE(dwarf_formudata) (attr_mem, &stride) != 0)
164 if (stride % 8) /* XXX maybe compute in bits? */
169 *size = count_total * stride;
174 aggregate_size (Dwarf_Die *die, Dwarf_Word *size,
175 Dwarf_Die *type_mem, int depth)
177 Dwarf_Attribute attr_mem;
179 /* Arrays of arrays of subrange types of arrays... Don't recurse too deep. */
180 #define MAX_DEPTH 256
181 if (die == NULL || depth++ >= MAX_DEPTH)
184 if (INTUSE(dwarf_attr_integrate) (die, DW_AT_byte_size, &attr_mem) != NULL)
185 return INTUSE(dwarf_formudata) (&attr_mem, size);
187 switch (INTUSE(dwarf_tag) (die))
189 case DW_TAG_subrange_type:
191 Dwarf_Die aggregate_type_mem;
192 return aggregate_size (get_type (die, &attr_mem, type_mem),
193 size, &aggregate_type_mem, depth);
196 case DW_TAG_array_type:
197 return array_size (die, size, &attr_mem, depth);
199 /* Assume references and pointers have pointer size if not given an
200 explicit DW_AT_byte_size. */
201 case DW_TAG_pointer_type:
202 case DW_TAG_reference_type:
203 case DW_TAG_rvalue_reference_type:
204 *size = die->cu->address_size;
208 /* Most types must give their size directly. */
213 dwarf_aggregate_size (Dwarf_Die *die, Dwarf_Word *size)
215 Dwarf_Die die_mem, type_mem;
217 if (INTUSE (dwarf_peel_type) (die, &die_mem) != 0)
220 return aggregate_size (&die_mem, size, &type_mem, 0);
222 INTDEF (dwarf_aggregate_size)
223 OLD_VERSION (dwarf_aggregate_size, ELFUTILS_0.144)
224 NEW_VERSION (dwarf_aggregate_size, ELFUTILS_0.161)