Subversion Repositories HelenOS

Rev

Rev 3562 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (c) 2008 Jiri Svoboda
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. /** @addtogroup rtld rtld
  30.  * @brief
  31.  * @{
  32.  */
  33. /**
  34.  * @file
  35.  */
  36.  
  37. #include <stdio.h>
  38. #include <string.h>
  39.  
  40. #include <elf_dyn.h>
  41. #include <dynamic.h>
  42. #include <rtld.h>
  43.  
  44. void dynamic_parse(elf_dyn_t *dyn_ptr, size_t bias, dyn_info_t *info)
  45. {
  46.     elf_dyn_t *dp = dyn_ptr;
  47.  
  48.     void *d_ptr;
  49.     elf_word d_val;
  50.  
  51.     elf_word soname_idx;
  52.     elf_word rpath_idx;
  53.  
  54.     DPRINTF("memset\n");
  55.     memset(info, 0, sizeof(info));
  56.  
  57.     soname_idx = 0;
  58.     rpath_idx = 0;
  59.  
  60.     DPRINTF("pass 1\n");
  61.     while (dp->d_tag != DT_NULL) {
  62.         d_ptr = (void *)((uint8_t *)dp->d_un.d_ptr + bias);
  63.         d_val = dp->d_un.d_val;
  64.  
  65.         switch (dp->d_tag) {
  66.  
  67.         case DT_PLTRELSZ:   info->plt_rel_sz = d_val; break;
  68.         case DT_PLTGOT:     info->plt_got = d_ptr; break;
  69.         case DT_HASH:       info->hash = d_ptr; break;
  70.         case DT_STRTAB:     info->str_tab = d_ptr; break;
  71.         case DT_SYMTAB:     info->sym_tab = d_ptr; break;
  72.         case DT_RELA:       info->rela = d_ptr; break;
  73.         case DT_RELASZ:     info->rela_sz = d_val; break;
  74.         case DT_RELAENT:    info->rela_ent = d_val; break;
  75.         case DT_STRSZ:      info->str_sz = d_val; break;
  76.         case DT_SYMENT:     info->sym_ent = d_val; break;
  77.         case DT_INIT:       info->init = d_ptr; break;
  78.         case DT_FINI:       info->fini = d_ptr; break;
  79.         case DT_SONAME:     soname_idx = d_val; break;
  80.         case DT_RPATH:      rpath_idx = d_val; break;
  81.         case DT_SYMBOLIC:   info->symbolic = true; break;
  82.         case DT_REL:        info->rel = d_ptr; break;
  83.         case DT_RELSZ:      info->rel_sz = d_val; break;
  84.         case DT_RELENT:     info->rel_ent = d_val; break;
  85.         case DT_PLTREL:     info->plt_rel = d_val; break;
  86.         case DT_TEXTREL:    info->text_rel = true; break;
  87.         case DT_JMPREL:     info->jmp_rel = d_ptr; break;
  88.         case DT_BIND_NOW:   info->bind_now = true; break;
  89.  
  90.         default:
  91.             if (dp->d_tag >= DT_LOPROC && dp->d_tag <= DT_HIPROC)
  92.                 dyn_parse_arch(dp, bias, info);
  93.             break;
  94.         }
  95.  
  96.         ++dp;
  97.     }
  98.  
  99.     info->soname = info->str_tab + soname_idx;
  100.     info->rpath = info->str_tab + rpath_idx;
  101.  
  102.     /* This will be useful for parsing dependencies later */
  103.     info->dynamic = dyn_ptr;
  104.  
  105.     DPRINTF("str_tab=0x%x, soname_idx=0x%x, soname=0x%x\n",
  106.         (uintptr_t)info->soname, soname_idx, (uintptr_t)info->soname);
  107.     DPRINTF("soname='%s'\n", info->soname);
  108.     DPRINTF("rpath='%s'\n", info->rpath);
  109.     DPRINTF("hash=0x%x\n", (uintptr_t)info->hash);
  110.  
  111.     /*
  112.      * Now that we have a pointer to the string table,
  113.      * we can parse DT_NEEDED fields (which contain offsets into it).
  114.      */
  115.  
  116.     DPRINTF("pass 2\n");
  117.     dp = dyn_ptr;
  118.     while (dp->d_tag != DT_NULL) {
  119.         d_val = dp->d_un.d_val;
  120.  
  121.         switch (dp->d_tag) {
  122.         case DT_NEEDED:
  123.             /* Assume just for now there's only one dependency */
  124.             info->needed = info->str_tab + d_val;
  125.             DPRINTF("needed:'%s'\n", info->needed);
  126.             break;
  127.  
  128.         default: break;
  129.         }
  130.  
  131.         ++dp;
  132.     }
  133. }
  134.  
  135. /** @}
  136.  */
  137.