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 |
|
---|
39 | #include <rtld/elf_dyn.h>
|
---|
40 | #include <rtld/dynamic.h>
|
---|
41 | #include <rtld/rtld.h>
|
---|
42 | #include <rtld/rtld_debug.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(dyn_info_t));
|
---|
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 | DPRINTF("tag=%u ptr=0x%x val=%u\n", (unsigned)dp->d_tag,
|
---|
65 | (unsigned)d_ptr, (unsigned)d_val);
|
---|
66 |
|
---|
67 | switch (dp->d_tag) {
|
---|
68 |
|
---|
69 | case DT_PLTRELSZ: info->plt_rel_sz = d_val; break;
|
---|
70 | case DT_PLTGOT: info->plt_got = d_ptr; break;
|
---|
71 | case DT_HASH: info->hash = d_ptr; break;
|
---|
72 | case DT_STRTAB: info->str_tab = d_ptr; break;
|
---|
73 | case DT_SYMTAB: info->sym_tab = d_ptr; break;
|
---|
74 | case DT_RELA: info->rela = d_ptr; break;
|
---|
75 | case DT_RELASZ: info->rela_sz = d_val; break;
|
---|
76 | case DT_RELAENT: info->rela_ent = d_val; break;
|
---|
77 | case DT_STRSZ: info->str_sz = d_val; break;
|
---|
78 | case DT_SYMENT: info->sym_ent = d_val; break;
|
---|
79 | case DT_INIT: info->init = d_ptr; break;
|
---|
80 | case DT_FINI: info->fini = d_ptr; break;
|
---|
81 | case DT_SONAME: soname_idx = d_val; break;
|
---|
82 | case DT_RPATH: rpath_idx = d_val; break;
|
---|
83 | case DT_SYMBOLIC: info->symbolic = true; break;
|
---|
84 | case DT_REL: info->rel = d_ptr; break;
|
---|
85 | case DT_RELSZ: info->rel_sz = d_val; break;
|
---|
86 | case DT_RELENT: info->rel_ent = d_val; break;
|
---|
87 | case DT_PLTREL: info->plt_rel = d_val; break;
|
---|
88 | case DT_TEXTREL: info->text_rel = true; break;
|
---|
89 | case DT_JMPREL: info->jmp_rel = d_ptr; break;
|
---|
90 | case DT_BIND_NOW: info->bind_now = true; break;
|
---|
91 |
|
---|
92 | default:
|
---|
93 | if (dp->d_tag >= DT_LOPROC && dp->d_tag <= DT_HIPROC)
|
---|
94 | dyn_parse_arch(dp, bias, info);
|
---|
95 | break;
|
---|
96 | }
|
---|
97 |
|
---|
98 | ++dp;
|
---|
99 | }
|
---|
100 |
|
---|
101 | info->soname = info->str_tab + soname_idx;
|
---|
102 | info->rpath = info->str_tab + rpath_idx;
|
---|
103 |
|
---|
104 | /* This will be useful for parsing dependencies later */
|
---|
105 | info->dynamic = dyn_ptr;
|
---|
106 |
|
---|
107 | DPRINTF("str_tab=0x%x, soname_idx=0x%x, soname=0x%x\n",
|
---|
108 | (uintptr_t)info->soname, soname_idx, (uintptr_t)info->soname);
|
---|
109 | DPRINTF("soname='%s'\n", info->soname);
|
---|
110 | DPRINTF("rpath='%s'\n", info->rpath);
|
---|
111 | DPRINTF("hash=0x%x\n", (uintptr_t)info->hash);
|
---|
112 | DPRINTF("dt_rela=0x%x\n", (uintptr_t)info->rela);
|
---|
113 | DPRINTF("dt_rela_sz=0x%x\n", (uintptr_t)info->rela_sz);
|
---|
114 | DPRINTF("dt_rel=0x%x\n", (uintptr_t)info->rel);
|
---|
115 | DPRINTF("dt_rel_sz=0x%x\n", (uintptr_t)info->rel_sz);
|
---|
116 |
|
---|
117 | /*
|
---|
118 | * Now that we have a pointer to the string table,
|
---|
119 | * we can parse DT_NEEDED fields (which contain offsets into it).
|
---|
120 | */
|
---|
121 |
|
---|
122 | DPRINTF("pass 2\n");
|
---|
123 | dp = dyn_ptr;
|
---|
124 | while (dp->d_tag != DT_NULL) {
|
---|
125 | d_val = dp->d_un.d_val;
|
---|
126 |
|
---|
127 | switch (dp->d_tag) {
|
---|
128 | case DT_NEEDED:
|
---|
129 | /* Assume just for now there's only one dependency */
|
---|
130 | info->needed = info->str_tab + d_val;
|
---|
131 | DPRINTF("needed:'%s'\n", info->needed);
|
---|
132 | break;
|
---|
133 |
|
---|
134 | default: break;
|
---|
135 | }
|
---|
136 |
|
---|
137 | ++dp;
|
---|
138 | }
|
---|
139 | }
|
---|
140 |
|
---|
141 | /** @}
|
---|
142 | */
|
---|