elf/dl-addr.c

   1 /* Locate the shared object symbol nearest a given address.
   2    Copyright (C) 1996, 1997, 1998, 1999, 2000 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 Library General Public License as
   7    published by the Free Software Foundation; either version 2 of the
   8    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    Library General Public License for more details.
  14
  15    You should have received a copy of the GNU Library General Public
  16    License along with the GNU C Library; see the file COPYING.LIB.  If not,
  17    write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  18    Boston, MA 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 {
  29   const ElfW(Addr) addr = DL_LOOKUP_ADDRESS (address);
  30   struct link_map *l, *match;
  31   const ElfW(Sym) *symtab, *matchsym;
  32   const char *strtab;
  33
  34   /* Find the highest-addressed object that ADDRESS is not below.  */
  35   match = NULL;
  36   for (l = _dl_loaded; l; l = l->l_next)
  37     if (addr >= l->l_map_start && addr < l->l_map_end)
  38       {
  39         /* We know ADDRESS lies within L if in any shared object.
  40            Make sure it isn't past the end of L's segments.  */
  41         size_t n = l->l_phnum;
  42         if (n > 0)
  43           {
  44             do
  45               --n;
  46             while (l->l_phdr[n].p_type != PT_LOAD);
  47             if (addr >= (l->l_addr +
  48                          l->l_phdr[n].p_vaddr + l->l_phdr[n].p_memsz))
  49               /* Off the end of the highest-addressed shared object.  */
  50               continue;
  51           }
  52
  53         match = l;
  54         break;
  55       }
  56
  57   if (match == NULL)
  58     return 0;
  59
  60   /* Now we know what object the address lies in.  */
  61   info->dli_fname = match->l_name;
  62   info->dli_fbase = (void *) match->l_addr;
  63
  64   /* If this is the main program the information is incomplete.  */
  65   if (__builtin_expect (info->dli_fbase == NULL, 0))
  66     {
  67       info->dli_fname = _dl_argv[0];
  68       info->dli_fbase = (void *) match->l_map_start;
  69     }
  70
  71   symtab = (const void *) D_PTR (match, l_info[DT_SYMTAB]);
  72   strtab = (const void *) D_PTR (match, l_info[DT_STRTAB]);
  73
  74   /* We assume that the string table follows the symbol table, because
  75      there is no way in ELF to know the size of the dynamic symbol table!!  */
  76   for (matchsym = NULL; (void *) symtab < (void *) strtab; ++symtab)
  77     if (addr >= match->l_addr + symtab->st_value
  78         && (!matchsym
  79             || (matchsym->st_value < symtab->st_value
  80                 && (ELFW(ST_BIND) (symtab->st_info) == STB_GLOBAL
  81                     || ELFW(ST_BIND) (symtab->st_info) == STB_WEAK))))
  82       matchsym = symtab;
  83
  84   if (matchsym)
  85     {
  86       /* We found a symbol close by.  Fill in its name and exact address.  */
  87       info->dli_sname = strtab + matchsym->st_name;
  88       info->dli_saddr = (void *) (match->l_addr + matchsym->st_value);
  89     }
  90   else
  91     {
  92       /* No symbol matches.  We return only the containing object.  */
  93       info->dli_sname = NULL;
  94       info->dli_saddr = NULL;
  95     }
  96
  97   return 1;
  98 }