Rev 2968 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 2968 | svoboda | 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 | |||
| 43 | void dynamic_parse(elf_dyn_t *dyn_ptr, size_t bias, dyn_info_t *info) |
||
| 44 | { |
||
| 45 | elf_dyn_t *dp = dyn_ptr; |
||
| 46 | |||
| 47 | void *d_ptr; |
||
| 48 | elf_word d_val; |
||
| 49 | |||
| 50 | elf_word soname_idx; |
||
| 51 | elf_word rpath_idx; |
||
| 52 | |||
| 53 | printf("memset\n"); |
||
| 54 | memset(info, 0, sizeof(info)); |
||
| 55 | |||
| 56 | printf("pass 1\n"); |
||
| 57 | while (dp->d_tag != DT_NULL) { |
||
| 58 | d_ptr = (void *)((uint8_t *)dp->d_un.d_ptr + bias); |
||
| 59 | d_val = dp->d_un.d_val; |
||
| 60 | |||
| 61 | switch (dp->d_tag) { |
||
| 62 | |||
| 63 | case DT_PLTRELSZ: info->plt_rel_sz = d_val; break; |
||
| 64 | case DT_PLTGOT: info->plt_got = d_ptr; break; |
||
| 65 | case DT_HASH: info->hash = d_ptr; break; |
||
| 66 | case DT_STRTAB: info->str_tab = d_ptr; break; |
||
| 67 | case DT_SYMTAB: info->sym_tab = d_ptr; break; |
||
| 68 | case DT_RELA: info->rela = d_ptr; break; |
||
| 69 | case DT_RELASZ: info->rela_sz = d_val; break; |
||
| 70 | case DT_RELAENT: info->rela_ent = d_val; break; |
||
| 71 | case DT_STRSZ: info->str_sz = d_val; break; |
||
| 72 | case DT_SYMENT: info->sym_ent = d_val; break; |
||
| 73 | case DT_INIT: info->init = d_ptr; break; |
||
| 74 | case DT_FINI: info->fini = d_ptr; break; |
||
| 75 | case DT_SONAME: soname_idx = d_val; break; |
||
| 76 | case DT_RPATH: rpath_idx = d_val; break; |
||
| 77 | case DT_SYMBOLIC: info->symbolic = true; break; |
||
| 78 | case DT_REL: info->rel = d_ptr; break; |
||
| 79 | case DT_RELSZ: info->rel_sz = d_val; break; |
||
| 80 | case DT_RELENT: info->rel_ent = d_val; break; |
||
| 81 | case DT_PLTREL: info->plt_rel = d_val; break; |
||
| 82 | case DT_TEXTREL: info->text_rel = true; break; |
||
| 83 | case DT_JMPREL: info->jmp_rel = d_ptr; break; |
||
| 84 | case DT_BIND_NOW: info->bind_now = true; break; |
||
| 85 | |||
| 86 | default: break; |
||
| 87 | } |
||
| 88 | |||
| 89 | ++dp; |
||
| 90 | } |
||
| 91 | |||
| 92 | info->soname = info->str_tab + soname_idx; |
||
| 93 | info->rpath = info->str_tab + rpath_idx; |
||
| 94 | |||
| 95 | /* |
||
| 96 | * Now that we have a pointer to the string table, |
||
| 97 | * we can parse DT_NEEDED fields (which contain offsets into it). |
||
| 98 | */ |
||
| 99 | |||
| 100 | printf("pass 2\n"); |
||
| 101 | dp = dyn_ptr; |
||
| 102 | while (dp->d_tag != DT_NULL) { |
||
| 103 | d_val = dp->d_un.d_val; |
||
| 104 | |||
| 105 | switch (dp->d_tag) { |
||
| 106 | case DT_NEEDED: |
||
| 2969 | svoboda | 107 | /* Assume just for now there's only one dependency */ |
| 108 | info->needed = info->str_tab + d_val; |
||
| 109 | printf("needed:'%s'\n", info->needed); |
||
| 2968 | svoboda | 110 | break; |
| 111 | |||
| 112 | default: break; |
||
| 113 | } |
||
| 114 | |||
| 115 | ++dp; |
||
| 116 | } |
||
| 117 | } |
||
| 118 | |||
| 119 | /** @} |
||
| 120 | */ |