diff options
| author | Tom Tromey <tom@tromey.com> | 2020-11-02 17:35:51 -0700 |
|---|---|---|
| committer | Tom Tromey <tom@tromey.com> | 2022-04-12 09:31:16 -0600 |
| commit | 8c83177441405ace08650d9d36f76311009c2ed3 (patch) | |
| tree | 0657df0e955e78285d9f58dfe271bb7251d7bfc5 /gdb/Makefile.in | |
| parent | c600d77cb77d6eafc15ff6b1bb34c765e3b21bcc (diff) | |
| download | fsf-binutils-gdb-8c83177441405ace08650d9d36f76311009c2ed3.zip fsf-binutils-gdb-8c83177441405ace08650d9d36f76311009c2ed3.tar.gz fsf-binutils-gdb-8c83177441405ace08650d9d36f76311009c2ed3.tar.bz2 | |
Introduce DWARF abbrev cache
The replacement for the DWARF psymbol reader works in a somewhat
different way. The current reader reads and stores all the DIEs that
might be interesting. Then, if it is missing a DIE, it re-scans the
CU and reads them all. This approach is used for both intra- and
inter-CU references.
I instrumented the partial DIE hash to see how frequently it was used:
[ 0] -> 1538165
[ 1] -> 4912
[ 2] -> 96102
[ 3] -> 175
[ 4] -> 244
That is, most DIEs are never used, and some are looked up twice -- but
this is just an artifact of the implementation of
partial_die_info::fixup, which may do two lookups.
Based on this, the new implementation doesn't try to store any DIEs,
but instead just re-scans them on demand. In order to do this,
though, it is convenient to have a cache of DWARF abbrevs. This way,
if a second CU is needed to resolve an inter-CU reference, the abbrevs
for that CU need only be computed a single time.
Diffstat (limited to 'gdb/Makefile.in')
| -rw-r--r-- | gdb/Makefile.in | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/gdb/Makefile.in b/gdb/Makefile.in index 110c157..1374f29 100644 --- a/gdb/Makefile.in +++ b/gdb/Makefile.in @@ -1044,6 +1044,7 @@ COMMON_SFILES = \ displaced-stepping.c \ dummy-frame.c \ dwarf2/abbrev.c \ + dwarf2/abbrev-cache.c \ dwarf2/attribute.c \ dwarf2/comp-unit-head.c \ dwarf2/cu.c \ |