mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-26 23:10:06 +00:00
8114530a31
2000-07-17 Bruno Haible <haible@clisp.cons.org> * iconv/gconv_open.c (__gconv_open): Initialize the __data field of struct __gconv_trans_data differently. Don't pass NULL to trans_init_fct. Simplify list append operation. 2000-07-14 Bruno Haible <haible@clisp.cons.org> * intl/dcigettext.c (dcigettext): Call plural_eval on all platforms, not only those having tsearch. 2000-07-17 Ulrich Drepper <drepper@redhat.com> * locale/langinfo.h: Add placeholder values in enum for removed LC_CTYPE entries. 2000-07-17 Jakub Jelinek <jakub@redhat.com> * elf/dl-addr.c (_dl_addr): Keep searching in the _dl_loaded chain if the PHDR check fails. 2000-07-17 Mark Kettenis <kettenis@gnu.org> * nss/getent.c (print_hosts): Make sure we always print a space between numeric addresses and hostnames. 2000-07-17 Wolfram Gloger <wg@malloc.de> * malloc/malloc.c (chunk_alloc): Use mmap_chunk() only if allowed, i.e. if n_mmaps_max>0. 2000-07-16 Mark Kettenis <kettenis@gnu.org> * resolv/netdb.h (AI_V4MAPPED, AI_ALL, AI_ADDRCONFIG): Adjust values to remove possible clash with other AI_* constants. (AI_PASSIVE, AI_CANONNAME, AI_NUMERICHOST): Define as hexadecimal constants to stress the fact they're in fact bit flags. 2000-07-15 Mark Kettenis <kettenis@gnu.org> * nss/getXXent_r.c [NEED__RES]: Include <resolv.h>. (SETFUNC_NAME, ENDFUNC_NAME, REENTRANT_GETNAME): Use res_ninit instead of res_init.
99 lines
3.1 KiB
C
99 lines
3.1 KiB
C
/* Locate the shared object symbol nearest a given address.
|
|
Copyright (C) 1996, 1997, 1998, 1999, 2000 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
|
|
modify it under the terms of the GNU Library General Public License as
|
|
published by the Free Software Foundation; either version 2 of the
|
|
License, or (at your option) any later version.
|
|
|
|
The GNU C Library 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
|
|
Library General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Library General Public
|
|
License along with the GNU C Library; see the file COPYING.LIB. If not,
|
|
write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
#include <dlfcn.h>
|
|
#include <stddef.h>
|
|
#include <ldsodefs.h>
|
|
|
|
|
|
int
|
|
internal_function
|
|
_dl_addr (const void *address, Dl_info *info)
|
|
{
|
|
const ElfW(Addr) addr = (ElfW(Addr)) address;
|
|
struct link_map *l, *match;
|
|
const ElfW(Sym) *symtab, *matchsym;
|
|
const char *strtab;
|
|
|
|
/* Find the highest-addressed object that ADDRESS is not below. */
|
|
match = NULL;
|
|
for (l = _dl_loaded; l; l = l->l_next)
|
|
if (addr >= l->l_map_start && addr < l->l_map_end)
|
|
{
|
|
/* We know ADDRESS lies within L if in any shared object.
|
|
Make sure it isn't past the end of L's segments. */
|
|
size_t n = l->l_phnum;
|
|
if (n > 0)
|
|
{
|
|
do
|
|
--n;
|
|
while (l->l_phdr[n].p_type != PT_LOAD);
|
|
if (addr >= (l->l_addr +
|
|
l->l_phdr[n].p_vaddr + l->l_phdr[n].p_memsz))
|
|
/* Off the end of the highest-addressed shared object. */
|
|
continue;
|
|
}
|
|
|
|
match = l;
|
|
break;
|
|
}
|
|
|
|
if (match == NULL)
|
|
return 0;
|
|
|
|
/* Now we know what object the address lies in. */
|
|
info->dli_fname = match->l_name;
|
|
info->dli_fbase = (void *) match->l_addr;
|
|
|
|
/* If this is the main program the information is incomplete. */
|
|
if (__builtin_expect (info->dli_fbase == NULL, 0))
|
|
{
|
|
info->dli_fname = _dl_argv[0];
|
|
info->dli_fbase = (void *) match->l_map_start;
|
|
}
|
|
|
|
symtab = (const void *) D_PTR (match, l_info[DT_SYMTAB]);
|
|
strtab = (const void *) D_PTR (match, l_info[DT_STRTAB]);
|
|
|
|
/* We assume that the string table follows the symbol table, because
|
|
there is no way in ELF to know the size of the dynamic symbol table!! */
|
|
for (matchsym = NULL; (void *) symtab < (void *) strtab; ++symtab)
|
|
if (addr >= match->l_addr + symtab->st_value
|
|
&& (!matchsym
|
|
|| (matchsym->st_value < symtab->st_value
|
|
&& (ELFW(ST_BIND) (symtab->st_info) == STB_GLOBAL
|
|
|| ELFW(ST_BIND) (symtab->st_info) == STB_WEAK))))
|
|
matchsym = symtab;
|
|
|
|
if (matchsym)
|
|
{
|
|
/* We found a symbol close by. Fill in its name and exact address. */
|
|
info->dli_sname = strtab + matchsym->st_name;
|
|
info->dli_saddr = (void *) (match->l_addr + matchsym->st_value);
|
|
}
|
|
else
|
|
{
|
|
/* No symbol matches. We return only the containing object. */
|
|
info->dli_sname = NULL;
|
|
info->dli_saddr = NULL;
|
|
}
|
|
|
|
return 1;
|
|
}
|