/* Maintenance of module list in libdwfl.
- Copyright (C) 2005, 2006, 2007 Red Hat, Inc.
- This file is part of Red Hat elfutils.
+ Copyright (C) 2005, 2006, 2007, 2008, 2014 Red Hat, Inc.
+ This file is part of elfutils.
- Red Hat elfutils 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; version 2 of the License.
+ This file is free software; you can redistribute it and/or modify
+ it under the terms of either
- Red Hat elfutils is distributed in the hope that it will be useful, but
+ * the GNU Lesser General Public License as published by the Free
+ Software Foundation; either version 3 of the License, or (at
+ your option) any later version
+
+ or
+
+ * the GNU General Public License as published by the Free
+ Software Foundation; either version 2 of the License, or (at
+ your option) any later version
+
+ or both in parallel, as here.
+
+ elfutils 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 Red Hat elfutils; if not, write to the Free Software Foundation,
- Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA.
-
- In addition, as a special exception, Red Hat, Inc. gives You the
- additional right to link the code of Red Hat elfutils with code licensed
- under any Open Source Initiative certified open source license
- (http://www.opensource.org/licenses/index.php) which requires the
- distribution of source code with any binary distribution and to
- distribute linked combinations of the two. Non-GPL Code permitted under
- this exception must only link to the code of Red Hat elfutils through
- those well defined interfaces identified in the file named EXCEPTION
- found in the source code files (the "Approved Interfaces"). The files
- of Non-GPL Code may instantiate templates or use macros or inline
- functions from the Approved Interfaces without causing the resulting
- work to be covered by the GNU General Public License. Only Red Hat,
- Inc. may make changes or additions to the list of Approved Interfaces.
- Red Hat's grant of this exception is conditioned upon your not adding
- any new exceptions. If you wish to add a new Approved Interface or
- exception, please contact Red Hat. You must obey the GNU General Public
- License in all respects for all of the Red Hat elfutils code and other
- code used in conjunction with Red Hat elfutils except the Non-GPL Code
- covered by this exception. If you modify this file, you may extend this
- exception to your version of the file, but you are not obligated to do
- so. If you do not wish to provide this exception without modification,
- you must delete this exception statement from your version and license
- this file solely under the GPL without exception.
-
- Red Hat elfutils is an included package of the Open Invention Network.
- An included package of the Open Invention Network is a package for which
- Open Invention Network licensees cross-license their patents. No patent
- license is granted, either expressly or impliedly, by designation as an
- included package. Should you wish to participate in the Open Invention
- Network licensing program, please visit www.openinventionnetwork.com
- <http://www.openinventionnetwork.com>. */
+ You should have received copies of the GNU General Public License and
+ the GNU Lesser General Public License along with this program. If
+ not, see <http://www.gnu.org/licenses/>. */
#include "libdwflP.h"
#include <search.h>
free_file (struct dwfl_file *file)
{
free (file->name);
- if (file->elf != NULL)
- {
- elf_end (file->elf);
- if (file->fd != -1)
- close (file->fd);
- }
+
+ /* Close the fd only on the last reference. */
+ if (file->elf != NULL && elf_end (file->elf) == 0 && file->fd != -1)
+ close (file->fd);
}
void
}
if (mod->dw != NULL)
- INTUSE(dwarf_end) (mod->dw);
+ {
+ INTUSE(dwarf_end) (mod->dw);
+ if (mod->alt != NULL)
+ {
+ INTUSE(dwarf_end) (mod->alt);
+ if (mod->alt_elf != NULL)
+ elf_end (mod->alt_elf);
+ if (mod->alt_fd != -1)
+ close (mod->alt_fd);
+ }
+ }
if (mod->ebl != NULL)
ebl_closebackend (mod->ebl);
if (mod->debug.elf != mod->main.elf)
free_file (&mod->debug);
free_file (&mod->main);
+ free_file (&mod->aux_sym);
+
+ if (mod->build_id_bits != NULL)
+ free (mod->build_id_bits);
+
+ if (mod->reloc_info != NULL)
+ free (mod->reloc_info);
+
+ if (mod->eh_cfi != NULL)
+ dwarf_cfi_end (mod->eh_cfi);
free (mod->name);
free (mod);
}
void
-dwfl_report_begin_add (Dwfl *dwfl)
+dwfl_report_begin_add (Dwfl *dwfl __attribute__ ((unused)))
{
- if (dwfl->modules != NULL)
- free (dwfl->modules);
- dwfl->modules = NULL;
- dwfl->nmodules = 0;
+ /* The lookup table will be cleared on demand, there is nothing we need
+ to do here. */
}
INTDEF (dwfl_report_begin_add)
void
dwfl_report_begin (Dwfl *dwfl)
{
- INTUSE(dwfl_report_begin_add) (dwfl);
+ /* Clear the segment lookup table. */
+ dwfl->lookup_elts = 0;
for (Dwfl_Module *m = dwfl->modulelist; m != NULL; m = m->next)
m->gc = true;
GElf_Addr start, GElf_Addr end)
{
Dwfl_Module **tailp = &dwfl->modulelist, **prevp = tailp;
+
+ inline Dwfl_Module *use (Dwfl_Module *mod)
+ {
+ mod->next = *tailp;
+ *tailp = mod;
+
+ if (unlikely (dwfl->lookup_module != NULL))
+ {
+ free (dwfl->lookup_module);
+ dwfl->lookup_module = NULL;
+ }
+
+ return mod;
+ }
+
for (Dwfl_Module *m = *prevp; m != NULL; m = *(prevp = &m->next))
{
if (m->low_addr == start && m->high_addr == end
{
/* This module is still here. Move it to the place in the list
after the last module already reported. */
-
*prevp = m->next;
- m->next = *tailp;
m->gc = false;
- *tailp = m;
- ++dwfl->nmodules;
- return m;
+ return use (m);
}
if (! m->gc)
mod->high_addr = end;
mod->dwfl = dwfl;
- mod->next = *tailp;
- *tailp = mod;
- ++dwfl->nmodules;
-
- return mod;
+ return use (mod);
}
INTDEF (dwfl_report_module)
-static int
-compare_modules (const void *a, const void *b)
-{
- Dwfl_Module *const *p1 = a, *const *p2 = b;
- const Dwfl_Module *m1 = *p1, *m2 = *p2;
- if (m1 == NULL)
- return -1;
- if (m2 == NULL)
- return 1;
-
- /* No signed difference calculation is correct here, since the
- terms are unsigned and could be more than INT64_MAX apart. */
- if (m1->low_addr < m2->low_addr)
- return -1;
- if (m1->low_addr > m2->low_addr)
- return 1;
- return 0;
-}
-
-
/* Finish reporting the current set of modules to the library.
If REMOVED is not null, it's called for each module that
existed before but was not included in the current report.
void *arg),
void *arg)
{
- assert (dwfl->modules == NULL);
-
Dwfl_Module **tailp = &dwfl->modulelist;
while (*tailp != NULL)
{
tailp = &m->next;
}
- dwfl->modules = malloc (dwfl->nmodules * sizeof dwfl->modules[0]);
- if (dwfl->modules == NULL && dwfl->nmodules != 0)
- return -1;
-
- size_t i = 0;
- for (Dwfl_Module *m = dwfl->modulelist; m != NULL; m = m->next)
- {
- assert (! m->gc);
- dwfl->modules[i++] = m;
- }
- assert (i == dwfl->nmodules);
-
- qsort (dwfl->modules, dwfl->nmodules, sizeof dwfl->modules[0],
- &compare_modules);
-
return 0;
}
INTDEF (dwfl_report_end)
projects / platform / upstream / elfutils.git / blobdiff