diff options
| author | Ulrich Drepper <drepper@redhat.com> | 1998-09-06 09:16:53 +0000 |
|---|---|---|
| committer | Ulrich Drepper <drepper@redhat.com> | 1998-09-06 09:16:53 +0000 |
| commit | be93561004695198611aa8707f10250f780988b2 (patch) | |
| tree | 7b9a502d849b761d966114b855a1fa9de4022e90 /elf/dl-version.c | |
| parent | 9eb71e60ef889158238c3066c75b65336d846684 (diff) | |
| download | glibc-be93561004695198611aa8707f10250f780988b2.tar.gz | |
Update.
1998-09-06 09:00 Ulrich Drepper <drepper@cygnus.com>
* version.h (VERSION): Bump to 2.0.96.
Rewrite runtime linker to be truly thread-safe. There is now no
global variable specifying the scope. We create all needed
scopes at the time the link maps are created.
* elf/Versions [GLIBC_2.1]: Add _dl_loaded and _dl_main_searchlist.
* elf/link.h: Add struct r_scope_elem and use this for l_searchlist,
l_symbolic_searchlist, l_scope, and l_local_scope elements in
struct link_map.
* elf/dl-close.c: Rewritten accordingly.
* elf/dl-deps.c: Likewise.
* elf/dl-error.c: Likewise.
* elf/dl-init.c: Likewise.
* elf/dl-load.c: Likewise.
* elf/dl-lookup.c: Likewise.
* elf/dl-object.c: Likewise.
* elf/dl-open.c: Likewise.
* elf/dl-reloc.c: Likewise.
* elf/dl-runtime.c: Likewise.
* elf/dl-support.c: Likewise.
* elf/dl-symbol.c: Likewise.
* elf/dl-version.c: Likewise.
* elf/dlfcn.h: Likewise.
* elf/dlsym.c: Likewise.
* elf/dlvsym.c: Likewise.
* elf/ldsodefs.h: Likewise.
* elf/rtld.c: Likewise.
* iconv/gconv_dl.c: Likewise.
* nss/nsswitch.c: Likewise.
* sysdeps/i386/dl-machine.h: Likewise.
* sysdeps/unix/sysv/linux/i386/dl-librecon.h: Likewise.
Diffstat (limited to 'elf/dl-version.c')
| -rw-r--r-- | elf/dl-version.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/elf/dl-version.c b/elf/dl-version.c index 413b3bc0df..4ba7f1ab3a 100644 --- a/elf/dl-version.c +++ b/elf/dl-version.c @@ -61,9 +61,9 @@ find_needed (const char *name, struct link_map *map) /* The required object is not in the global scope, look to see if it is a dependency of the current object. */ - for (n = 0; n < map->l_nsearchlist; n++) - if (_dl_name_match_p (name, map->l_searchlist[n])) - return map->l_searchlist[n]; + for (n = 0; n < map->l_searchlist.r_nlist; n++) + if (_dl_name_match_p (name, map->l_searchlist.r_list[n])) + return map->l_searchlist.r_list[n]; /* Should never happen. */ return NULL; |