forked from Imagelibrary/binutils-gdb
1d506c26d9
This commit is the result of the following actions:
- Running gdb/copyright.py to update all of the copyright headers to
include 2024,
- Manually updating a few files the copyright.py script told me to
update, these files had copyright headers embedded within the
file,
- Regenerating gdbsupport/Makefile.in to refresh it's copyright
date,
- Using grep to find other files that still mentioned 2023. If
these files were updated last year from 2022 to 2023 then I've
updated them this year to 2024.
I'm sure I've probably missed some dates. Feel free to fix them up as
you spot them.
66 lines
2.0 KiB
C
66 lines
2.0 KiB
C
/* DWARF 2 abbrev table cache
|
|
|
|
Copyright (C) 2022-2024 Free Software Foundation, Inc.
|
|
|
|
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/>. */
|
|
|
|
#include "defs.h"
|
|
#include "dwarf2/read.h"
|
|
#include "dwarf2/abbrev-cache.h"
|
|
|
|
/* Hash function for an abbrev table. */
|
|
|
|
hashval_t
|
|
abbrev_cache::hash_table (const void *item)
|
|
{
|
|
const struct abbrev_table *table = (const struct abbrev_table *) item;
|
|
return to_underlying (table->sect_off);
|
|
}
|
|
|
|
/* Comparison function for abbrev table. */
|
|
|
|
int
|
|
abbrev_cache::eq_table (const void *lhs, const void *rhs)
|
|
{
|
|
const struct abbrev_table *l_table = (const struct abbrev_table *) lhs;
|
|
const search_key *key = (const search_key *) rhs;
|
|
return (l_table->section == key->section
|
|
&& l_table->sect_off == key->offset);
|
|
}
|
|
|
|
abbrev_cache::abbrev_cache ()
|
|
: m_tables (htab_create_alloc (20, hash_table, eq_table,
|
|
htab_delete_entry<abbrev_table>,
|
|
xcalloc, xfree))
|
|
{
|
|
}
|
|
|
|
void
|
|
abbrev_cache::add (abbrev_table_up table)
|
|
{
|
|
/* We allow this as a convenience to the caller. */
|
|
if (table == nullptr)
|
|
return;
|
|
|
|
search_key key = { table->section, table->sect_off };
|
|
void **slot = htab_find_slot_with_hash (m_tables.get (), &key,
|
|
to_underlying (table->sect_off),
|
|
INSERT);
|
|
/* If this one already existed, then it should have been reused. */
|
|
gdb_assert (*slot == nullptr);
|
|
*slot = (void *) table.release ();
|
|
}
|