• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /* Return tag of given DIE.
2    Copyright (C) 2003-2011, 2014 Red Hat, Inc.
3    This file is part of elfutils.
4    Written by Ulrich Drepper <drepper@redhat.com>, 2003.
5 
6    This file is free software; you can redistribute it and/or modify
7    it under the terms of either
8 
9      * the GNU Lesser General Public License as published by the Free
10        Software Foundation; either version 3 of the License, or (at
11        your option) any later version
12 
13    or
14 
15      * the GNU General Public License as published by the Free
16        Software Foundation; either version 2 of the License, or (at
17        your option) any later version
18 
19    or both in parallel, as here.
20 
21    elfutils is distributed in the hope that it will be useful, but
22    WITHOUT ANY WARRANTY; without even the implied warranty of
23    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
24    General Public License for more details.
25 
26    You should have received copies of the GNU General Public License and
27    the GNU Lesser General Public License along with this program.  If
28    not, see <http://www.gnu.org/licenses/>.  */
29 
30 #ifdef HAVE_CONFIG_H
31 # include <config.h>
32 #endif
33 
34 #include "libdwP.h"
35 
36 
37 Dwarf_Abbrev *
38 internal_function
__libdw_findabbrev(struct Dwarf_CU * cu,unsigned int code)39 __libdw_findabbrev (struct Dwarf_CU *cu, unsigned int code)
40 {
41   Dwarf_Abbrev *abb;
42 
43   /* Abbreviation code can never have a value of 0.  */
44   if (unlikely (code == 0))
45     return DWARF_END_ABBREV;
46 
47   /* See whether the entry is already in the hash table.  */
48   abb = Dwarf_Abbrev_Hash_find (&cu->abbrev_hash, code, NULL);
49   if (abb == NULL)
50     while (cu->last_abbrev_offset != (size_t) -1l)
51       {
52 	size_t length;
53 
54 	/* Find the next entry.  It gets automatically added to the
55 	   hash table.  */
56 	abb = __libdw_getabbrev (cu->dbg, cu, cu->last_abbrev_offset, &length,
57 				 NULL);
58 	if (abb == NULL || abb == DWARF_END_ABBREV)
59 	  {
60 	    /* Make sure we do not try to search for it again.  */
61 	    cu->last_abbrev_offset = (size_t) -1l;
62 	    return DWARF_END_ABBREV;
63 	  }
64 
65 	cu->last_abbrev_offset += length;
66 
67 	/* Is this the code we are looking for?  */
68 	if (abb->code == code)
69 	  break;
70       }
71 
72   /* This is our second (or third, etc.) call to __libdw_findabbrev
73      and the code is invalid.  */
74   if (unlikely (abb == NULL))
75     abb = DWARF_END_ABBREV;
76 
77   return abb;
78 }
79 
80 
81 int
dwarf_tag(Dwarf_Die * die)82 dwarf_tag (Dwarf_Die *die)
83 {
84   /* Find the abbreviation entry.  */
85   Dwarf_Abbrev *abbrevp = __libdw_dieabbrev (die, NULL);
86   if (unlikely (abbrevp == DWARF_END_ABBREV))
87     {
88       __libdw_seterrno (DWARF_E_INVALID_DWARF);
89       return DW_TAG_invalid;
90     }
91 
92   return abbrevp->tag;
93 }
94 INTDEF(dwarf_tag)
95