+2011-07-14 Marek Polacek <mpolacek@redhat.com>
+
+ * elf/dl-fini.c (_dl_sort_fini): Remove unused link_map *l argument,
+ * elf/dl-fini.c (_dl_fini): Adjust caller.
+ * elf/dl-close.c (_dl_close_worker): Likewise.
+ * sysdeps/generic/ldsodefs.h: Adjust declaration.
+
2011-07-15 Marek Polacek <mpolacek@redhat.com>
* elf/cache.c (load_aux_cache): Remove unnecessary condition of
}
/* Sort the entries. */
- _dl_sort_fini (ns->_ns_loaded, maps, nloaded, used, nsid);
+ _dl_sort_fini (maps, nloaded, used, nsid);
/* Call all termination functions at once. */
#ifdef SHARED
void
internal_function
-_dl_sort_fini (struct link_map *l, struct link_map **maps, size_t nmaps,
- char *used, Lmid_t ns)
+_dl_sort_fini (struct link_map **maps, size_t nmaps, char *used, Lmid_t ns)
{
/* A list of one element need not be sorted. */
if (nmaps == 1)
nmaps = i;
/* Now we have to do the sorting. */
- _dl_sort_fini (GL(dl_ns)[ns]._ns_loaded, maps, nmaps, NULL, ns);
+ _dl_sort_fini (maps, nmaps, NULL, ns);
/* We do not rely on the linked list of loaded object anymore from
this point on. We have our own list here (maps). The various
/* Run-time dynamic linker data structures for loaded ELF shared objects.
- Copyright (C) 1995-2009, 2010 Free Software Foundation, Inc.
+ Copyright (C) 1995-2009, 2010, 2011 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
extern void _dl_fini (void) internal_function;
/* Sort array MAPS according to dependencies of the contained objects. */
-extern void _dl_sort_fini (struct link_map *l, struct link_map **maps,
- size_t nmaps, char *used, Lmid_t ns)
+extern void _dl_sort_fini (struct link_map **maps, size_t nmaps, char *used,
+ Lmid_t ns)
internal_function;
/* The dynamic linker calls this function before and having changing