Coverage Report

Created: 2025-08-29 06:10

/src/elfutils/libdw/dwarf_end.c
Line
Count
Source (jump to first uncovered line)
1
/* Release debugging handling context.
2
   Copyright (C) 2002-2011, 2014, 2018 Red Hat, Inc.
3
   This file is part of elfutils.
4
   Written by Ulrich Drepper <drepper@redhat.com>, 2002.
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 <search.h>
35
#include <stdlib.h>
36
#include <assert.h>
37
#include <string.h>
38
39
#include "libdwP.h"
40
#include "cfi.h"
41
42
43
static void
44
dwarf_package_index_free (Dwarf_Package_Index *index)
45
0
{
46
0
  if (index != NULL)
47
0
    {
48
0
      free (index->debug_info_offsets);
49
0
      free (index);
50
0
    }
51
0
}
52
53
54
static void
55
noop_free (void *arg __attribute__ ((unused)))
56
0
{
57
0
}
58
59
60
static void
61
cu_free (void *arg)
62
0
{
63
0
  struct Dwarf_CU *p = (struct Dwarf_CU *) arg;
64
65
0
  eu_search_tree_fini (&p->locs_tree, noop_free);
66
0
  rwlock_fini (p->abbrev_lock);
67
0
  rwlock_fini (p->split_lock);
68
0
  mutex_fini (p->src_lock);
69
0
  mutex_fini (p->str_off_base_lock);
70
0
  mutex_fini (p->intern_lock);
71
72
  /* Only free the CU internals if its not a fake CU.  */
73
0
  if (p != p->dbg->fake_loc_cu && p != p->dbg->fake_loclists_cu
74
0
     && p != p->dbg->fake_addr_cu)
75
0
    {
76
0
      Dwarf_Abbrev_Hash_free (&p->abbrev_hash);
77
78
      /* Free split dwarf one way (from skeleton to split).  */
79
0
      if (p->unit_type == DW_UT_skeleton
80
0
    && p->split != NULL && p->split != (void *)-1)
81
0
  {
82
    /* The fake_addr_cu might be shared, only release one.  */
83
0
    if (p->dbg->fake_addr_cu == p->split->dbg->fake_addr_cu)
84
0
      p->split->dbg->fake_addr_cu = NULL;
85
    /* There is only one DWP file. We free it later.  */
86
0
    if (p->split->dbg != p->dbg->dwp_dwarf)
87
0
      INTUSE(dwarf_end) (p->split->dbg);
88
0
  }
89
0
    }
90
0
}
91
92
93
int
94
dwarf_end (Dwarf *dwarf)
95
0
{
96
0
  if (dwarf != NULL)
97
0
    {
98
0
      dwarf_package_index_free (dwarf->tu_index);
99
0
      dwarf_package_index_free (dwarf->cu_index);
100
101
0
      if (dwarf->cfi != NULL)
102
  /* Clean up the CFI cache.  */
103
0
  __libdw_destroy_frame_cache (dwarf->cfi);
104
105
0
      Dwarf_Sig8_Hash_free (&dwarf->sig8_hash);
106
107
      /* The search tree for the CUs.  NB: the CU data itself is
108
   allocated separately, but the abbreviation hash tables need
109
   to be handled.  */
110
0
      eu_search_tree_fini (&dwarf->cu_tree, cu_free);
111
0
      eu_search_tree_fini (&dwarf->tu_tree, cu_free);
112
113
      /* Search tree for macro opcode tables.  */
114
0
      eu_search_tree_fini (&dwarf->macro_ops_tree, noop_free);
115
116
      /* Search tree for decoded .debug_lines units.  */
117
0
      eu_search_tree_fini (&dwarf->files_lines_tree, noop_free);
118
119
      /* And the split Dwarf.  */
120
0
      eu_search_tree_fini (&dwarf->split_tree, noop_free);
121
122
      /* Free the internally allocated memory.  */
123
0
      for (size_t i = 0; i < dwarf->mem_stacks; i++)
124
0
        {
125
0
          struct libdw_memblock *memp = dwarf->mem_tails[i];
126
0
          while (memp != NULL)
127
0
      {
128
0
        struct libdw_memblock *prevp = memp->prev;
129
0
        free (memp);
130
0
        memp = prevp;
131
0
      }
132
0
        }
133
0
      if (dwarf->mem_tails != NULL)
134
0
        free (dwarf->mem_tails);
135
0
      pthread_rwlock_destroy (&dwarf->mem_rwl);
136
0
      mutex_fini (dwarf->dwarf_lock);
137
0
      mutex_fini (dwarf->macro_lock);
138
139
      /* Free the pubnames helper structure.  */
140
0
      free (dwarf->pubnames_sets);
141
142
      /* Free the ELF descriptor if necessary.  */
143
0
      if (dwarf->free_elf)
144
0
  elf_end (dwarf->elf);
145
146
      /* Free the fake location list CU.  */
147
0
      if (dwarf->fake_loc_cu != NULL)
148
0
  {
149
0
    cu_free (dwarf->fake_loc_cu);
150
0
    free (dwarf->fake_loc_cu);
151
0
  }
152
0
      if (dwarf->fake_loclists_cu != NULL)
153
0
  {
154
0
    cu_free (dwarf->fake_loclists_cu);
155
0
    free (dwarf->fake_loclists_cu);
156
0
  }
157
0
      if (dwarf->fake_addr_cu != NULL)
158
0
  {
159
0
    cu_free (dwarf->fake_addr_cu);
160
0
    free (dwarf->fake_addr_cu);
161
0
  }
162
163
      /* Did we find and allocate the alt Dwarf ourselves?  */
164
0
      if (dwarf->alt_fd != -1)
165
0
  {
166
0
    INTUSE(dwarf_end) (dwarf->alt_dwarf);
167
0
    close (dwarf->alt_fd);
168
0
  }
169
170
0
      if (dwarf->dwp_fd != -1)
171
0
  {
172
0
    INTUSE(dwarf_end) (dwarf->dwp_dwarf);
173
0
    close (dwarf->dwp_fd);
174
0
  }
175
176
      /* The cached path and dir we found the Dwarf ELF file in.  */
177
0
      free (dwarf->elfpath);
178
0
      free (dwarf->debugdir);
179
180
      /* Free the context descriptor.  */
181
0
      free (dwarf);
182
0
    }
183
184
0
  return 0;
185
0
}
186
INTDEF(dwarf_end)