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
|
/* DWARF abbrev table
Copyright (C) 1994-2023 Free Software Foundation, Inc.
Adapted by Gary Funck (gary@intrepid.com), Intrepid Technology,
Inc. with support from Florida State University (under contract
with the Ada Joint Program Office), and Silicon Graphics, Inc.
Initial contribution by Brent Benson, Harris Computer Systems, Inc.,
based on Fred Fish's (Cygnus Support) implementation of DWARF 1
support.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program 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 a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef GDB_DWARF2_ABBREV_H
#define GDB_DWARF2_ABBREV_H
#include "hashtab.h"
struct attr_abbrev
{
ENUM_BITFIELD(dwarf_attribute) name : 16;
ENUM_BITFIELD(dwarf_form) form : 16;
/* It is valid only if FORM is DW_FORM_implicit_const. */
LONGEST implicit_const;
};
/* This data structure holds the information of an abbrev. */
struct abbrev_info
{
/* Number identifying abbrev. */
unsigned int number;
/* DWARF tag. */
ENUM_BITFIELD (dwarf_tag) tag : 16;
/* True if the DIE has children. */
bool has_children;
bool interesting;
unsigned short size_if_constant;
unsigned short sibling_offset;
/* Number of attributes. */
unsigned short num_attrs;
/* An array of attribute descriptions, allocated using the struct
hack. */
struct attr_abbrev attrs[1];
};
struct abbrev_table;
typedef std::unique_ptr<struct abbrev_table> abbrev_table_up;
/* Top level data structure to contain an abbreviation table. */
struct abbrev_table
{
/* Read an abbrev table from the indicated section, at the given
offset. The caller is responsible for ensuring that the section
has already been read. */
static abbrev_table_up read (struct dwarf2_section_info *section,
sect_offset sect_off);
/* Look up an abbrev in the table.
Returns NULL if the abbrev is not found. */
const struct abbrev_info *lookup_abbrev (unsigned int abbrev_number) const
{
struct abbrev_info search;
search.number = abbrev_number;
return (struct abbrev_info *) htab_find_with_hash (m_abbrevs.get (),
&search,
abbrev_number);
}
/* Where the abbrev table came from.
This is used as a sanity check when the table is used. */
const sect_offset sect_off;
struct dwarf2_section_info *section;
private:
abbrev_table (sect_offset off, struct dwarf2_section_info *sect);
DISABLE_COPY_AND_ASSIGN (abbrev_table);
/* Add an abbreviation to the table. */
void add_abbrev (struct abbrev_info *abbrev);
/* Hash table of abbrevs. */
htab_up m_abbrevs;
/* Storage for the abbrev table. */
auto_obstack m_abbrev_obstack;
};
#endif /* GDB_DWARF2_ABBREV_H */
|
