elf/dl-addr.c

   1 /* Locate the shared object symbol nearest a given address.
   2    Copyright (C) 1996-2003, 2004   Free Software Foundation, Inc.
   3    This file is part of the GNU C Library.
   4
   5    The GNU C Library is free software; you can redistribute it and/or
   6    modify it under the terms of the GNU Lesser General Public
   7    License as published by the Free Software Foundation; either
   8    version 2.1 of the License, or (at your option) any later version.
   9
  10    The GNU C Library is distributed in the hope that it will be useful,
  11    but WITHOUT ANY WARRANTY; without even the implied warranty of
  12    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13    Lesser General Public License for more details.
  14
  15    You should have received a copy of the GNU Lesser General Public
  16    License along with the GNU C Library; if not, write to the Free
  17    Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  18    02111-1307 USA.  */
  19
  20 #include <dlfcn.h>
  21 #include <stddef.h>
  22 #include <ldsodefs.h>
  23
  24
  25 int
  26 internal_function
  27 _dl_addr (const void *address, Dl_info *info,
  28           struct link_map **mapp, const ElfW(Sym) **symbolp)
  29 {
  30   const ElfW(Addr) addr = DL_LOOKUP_ADDRESS (address);
  31   struct link_map *match;
  32   const ElfW(Sym) *symtab, *matchsym, *symtabend;
  33   const char *strtab;
  34   ElfW(Word) strtabsize;
  35
  36   /* Protect against concurrent loads and unloads.  */
  37   __rtld_lock_lock_recursive (GL(dl_load_lock));
  38
  39   /* Find the highest-addressed object that ADDRESS is not below.  */
  40   match = NULL;
  41   for (Lmid_t ns = 0; ns < DL_NNS; ++ns)
  42     for (struct link_map *l = GL(dl_ns)[ns]._ns_loaded; l; l = l->l_next)
  43       if (addr >= l->l_map_start && addr < l->l_map_end)
  44         {
  45           /* We know ADDRESS lies within L if in any shared object.
  46              Make sure it isn't past the end of L's segments.  */
  47           size_t n = l->l_phnum;
  48           if (n > 0)
  49             {
  50               do
  51                 --n;
  52               while (l->l_phdr[n].p_type != PT_LOAD);
  53               if (addr >= (l->l_addr +
  54                            l->l_phdr[n].p_vaddr + l->l_phdr[n].p_memsz))
  55                 /* Off the end of the highest-addressed shared object.  */
  56                 continue;
  57             }
  58
  59           match = l;
  60           break;
  61         }
  62
  63   int result = 0;
  64   if (match != NULL)
  65     {
  66       /* Now we know what object the address lies in.  */
  67       info->dli_fname = match->l_name;
  68       info->dli_fbase = (void *) match->l_map_start;
  69
  70       /* If this is the main program the information is incomplete.  */
  71       if (__builtin_expect (match->l_name[0], 'a') == '\0'
  72           && match->l_type == lt_executable)
  73         info->dli_fname = _dl_argv[0];
  74
  75       symtab = (const void *) D_PTR (match, l_info[DT_SYMTAB]);
  76       strtab = (const void *) D_PTR (match, l_info[DT_STRTAB]);
  77
  78       strtabsize = match->l_info[DT_STRSZ]->d_un.d_val;
  79
  80       if (match->l_info[DT_HASH] != NULL)
  81         symtabend = (symtab
  82                      + ((Elf_Symndx *) D_PTR (match, l_info[DT_HASH]))[1]);
  83       else
  84         /* There is no direct way to determine the number of symbols in the
  85            dynamic symbol table and no hash table is present.  The ELF
  86            binary is ill-formed but what shall we do?  Use the beginning of
  87            the string table which generally follows the symbol table.  */
  88         symtabend = (const ElfW(Sym) *) strtab;
  89
  90       /* We assume that the string table follows the symbol table,
  91          because there is no way in ELF to know the size of the
  92          dynamic symbol table!!  */
  93       for (matchsym = NULL; (void *) symtab < (void *) symtabend; ++symtab)
  94         if (addr >= match->l_addr + symtab->st_value
  95 #if defined USE_TLS
  96             && ELFW(ST_TYPE) (symtab->st_info) != STT_TLS
  97 #endif
  98             && ((symtab->st_size == 0
  99                  && addr == match->l_addr + symtab->st_value)
 100                 || addr < match->l_addr + symtab->st_value + symtab->st_size)
 101             && symtab->st_name < strtabsize
 102             && (matchsym == NULL || matchsym->st_value < symtab->st_value)
 103             && (ELFW(ST_BIND) (symtab->st_info) == STB_GLOBAL
 104                 || ELFW(ST_BIND) (symtab->st_info) == STB_WEAK))
 105           matchsym = (ElfW(Sym) *) symtab;
 106
 107       if (mapp)
 108         *mapp = match;
 109       if (symbolp)
 110         *symbolp = matchsym;
 111
 112       if (matchsym)
 113         {
 114           /* We found a symbol close by.  Fill in its name and exact
 115              address.  */
 116           lookup_t matchl = LOOKUP_VALUE (match);
 117
 118           info->dli_sname = strtab + matchsym->st_name;
 119           info->dli_saddr = DL_SYMBOL_ADDRESS (matchl, matchsym);
 120         }
 121       else
 122         {
 123           /* No symbol matches.  We return only the containing object.  */
 124           info->dli_sname = NULL;
 125           info->dli_saddr = NULL;
 126         }
 127
 128       result = 1;
 129     }
 130
 131   __rtld_lock_unlock_recursive (GL(dl_load_lock));
 132
 133   return result;
 134 }
 135 libc_hidden_def (_dl_addr)