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
|
/* Internal abbrev list handling
Copyright (C) 2000, 2001, 2002 Red Hat, Inc.
Written by Ulrich Drepper <drepper@redhat.com>, 2000.
This program is Open Source software; you can redistribute it and/or
modify it under the terms of the Open Software License version 1.0 as
published by the Open Source Initiative.
You should have received a copy of the Open Software License along
with this program; if not, you may obtain a copy of the Open Software
License version 1.0 from http://www.opensource.org/licenses/osl.php or
by writing the Open Source Initiative c/o Lawrence Rosen, Esq.,
3001 King Ranch Road, Ukiah, CA 95482. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <dwarf.h>
#include <stdlib.h>
#include <libdwarfP.h>
Dwarf_Abbrev
__libdwarf_get_abbrev (dbg, cu, code, error)
Dwarf_Debug dbg;
Dwarf_CU_Info cu;
Dwarf_Word code;
Dwarf_Error *error;
{
Dwarf_Abbrev ent;
/* See whether the entry is already in the hash table. */
ent = Dwarf_Abbrev_Hash_find (&cu->abbrev_hash, code, NULL);
if (ent != NULL)
return ent;
while (1)
{
Dwarf_Unsigned length;
Dwarf_Unsigned attr_count;
if (dwarf_get_abbrev (dbg, cu->last_abbrev_offset, &ent, &length,
&attr_count, error) != DW_DLV_OK)
return NULL;
if (length == 1)
/* This is the end of the list. */
break;
/* Update the offset to the next record. */
cu->last_abbrev_offset += length;
/* Insert the new entry into the hashing table. */
if (unlikely (Dwarf_Abbrev_Hash_insert (&cu->abbrev_hash, ent->code, ent)
!= 0))
{
free (ent);
__libdwarf_error (dbg, error, DW_E_NOMEM);
return NULL;
}
/* Is this the code we are looking for? */
if (ent->code == code)
/* Yes! */
return ent;
}
/* If we come here we haven't found anything. */
__libdwarf_error (dbg, error, DW_E_NO_ABBR);
return NULL;
}
|
