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 43static void 44noop_free (void *arg __attribute__ ((unused))) 45{ 46} 47 48 49static void 50cu_free (void *arg) 51{ 52 struct Dwarf_CU *p = (struct Dwarf_CU *) arg; 53 54 tdestroy (p->locs, noop_free); 55 56 /* Only free the CU internals if its not a fake CU. */ 57 if(p != p->dbg->fake_loc_cu && p != p->dbg->fake_loclists_cu 58 && p != p->dbg->fake_addr_cu) 59 { 60 Dwarf_Abbrev_Hash_free (&p->abbrev_hash); 61 62 /* Free split dwarf one way (from skeleton to split). */ 63 if (p->unit_type == DW_UT_skeleton 64 && p->split != NULL && p->split != (void *)-1) 65 { 66 /* The fake_addr_cu might be shared, only release one. */ 67 if (p->dbg->fake_addr_cu == p->split->dbg->fake_addr_cu) 68 p->split->dbg->fake_addr_cu = NULL; 69 INTUSE(dwarf_end) (p->split->dbg); 70 } 71 } 72} 73 74 75int 76dwarf_end (Dwarf *dwarf) 77{ 78 if (dwarf != NULL) 79 { 80 if (dwarf->cfi != NULL) 81 /* Clean up the CFI cache. */ 82 __libdw_destroy_frame_cache (dwarf->cfi); 83 84 Dwarf_Sig8_Hash_free (&dwarf->sig8_hash); 85 86 /* The search tree for the CUs. NB: the CU data itself is 87 allocated separately, but the abbreviation hash tables need 88 to be handled. */ 89 tdestroy (dwarf->cu_tree, cu_free); 90 tdestroy (dwarf->tu_tree, cu_free); 91 92 /* Search tree for macro opcode tables. */ 93 tdestroy (dwarf->macro_ops, noop_free); 94 95 /* Search tree for decoded .debug_lines units. */ 96 tdestroy (dwarf->files_lines, noop_free); 97 98 /* And the split Dwarf. */ 99 tdestroy (dwarf->split_tree, noop_free); 100 101 /* Free the internally allocated memory. */ 102 for (size_t i = 0; i < dwarf->mem_stacks; i++) 103 { 104 struct libdw_memblock *memp = dwarf->mem_tails[i]; 105 while (memp != NULL) 106 { 107 struct libdw_memblock *prevp = memp->prev; 108 free (memp); 109 memp = prevp; 110 } 111 } 112 if (dwarf->mem_tails != NULL) 113 free (dwarf->mem_tails); 114 pthread_rwlock_destroy (&dwarf->mem_rwl); 115 116 /* Free the pubnames helper structure. */ 117 free (dwarf->pubnames_sets); 118 119 /* Free the ELF descriptor if necessary. */ 120 if (dwarf->free_elf) 121 elf_end (dwarf->elf); 122 123 /* Free the fake location list CU. */ 124 if (dwarf->fake_loc_cu != NULL) 125 { 126 cu_free (dwarf->fake_loc_cu); 127 free (dwarf->fake_loc_cu); 128 } 129 if (dwarf->fake_loclists_cu != NULL) 130 { 131 cu_free (dwarf->fake_loclists_cu); 132 free (dwarf->fake_loclists_cu); 133 } 134 if (dwarf->fake_addr_cu != NULL) 135 { 136 cu_free (dwarf->fake_addr_cu); 137 free (dwarf->fake_addr_cu); 138 } 139 140 /* Did we find and allocate the alt Dwarf ourselves? */ 141 if (dwarf->alt_fd != -1) 142 { 143 INTUSE(dwarf_end) (dwarf->alt_dwarf); 144 close (dwarf->alt_fd); 145 } 146 147 /* The cached dir we found the Dwarf ELF file in. */ 148 free (dwarf->debugdir); 149 150 /* Free the context descriptor. */ 151 free (dwarf); 152 } 153 154 return 0; 155} 156INTDEF(dwarf_end) 157