Rev 3690 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3690 | Rev 3869 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2008 Jiri Svoboda |
2 | * Copyright (c) 2008 Jiri Svoboda |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup rtld rtld |
29 | /** @addtogroup rtld rtld |
30 | * @brief |
30 | * @brief |
31 | * @{ |
31 | * @{ |
32 | */ |
32 | */ |
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | */ |
35 | */ |
36 | 36 | ||
37 | #include <stdio.h> |
37 | #include <stdio.h> |
38 | #include <stdlib.h> |
38 | #include <stdlib.h> |
39 | #include <unistd.h> |
39 | #include <unistd.h> |
40 | #include <fcntl.h> |
40 | #include <fcntl.h> |
41 | #include <libadt/list.h> |
41 | #include <libadt/list.h> |
42 | #include <loader/pcb.h> |
42 | #include <loader/pcb.h> |
43 | 43 | ||
44 | #include <rtld.h> |
44 | #include <rtld.h> |
45 | #include <dynamic.h> |
45 | #include <dynamic.h> |
46 | #include <elf_load.h> |
46 | #include <elf_load.h> |
47 | #include <rtld_arch.h> |
47 | #include <rtld_arch.h> |
48 | #include <module.h> |
48 | #include <module.h> |
49 | 49 | ||
50 | /** (Eagerly) process all relocation tables in a module. |
50 | /** (Eagerly) process all relocation tables in a module. |
51 | * |
51 | * |
52 | * Currently works as if LD_BIND_NOW was specified. |
52 | * Currently works as if LD_BIND_NOW was specified. |
53 | */ |
53 | */ |
54 | void module_process_relocs(module_t *m) |
54 | void module_process_relocs(module_t *m) |
55 | { |
55 | { |
56 | DPRINTF("module_process_relocs('%s')\n", m->dyn.soname); |
56 | DPRINTF("module_process_relocs('%s')\n", m->dyn.soname); |
57 | 57 | ||
58 | /* Do not relocate twice. */ |
58 | /* Do not relocate twice. */ |
59 | if (m->relocated) return; |
59 | if (m->relocated) return; |
60 | 60 | ||
- | 61 | module_process_pre_arch(m); |
|
- | 62 | ||
61 | if (m->dyn.plt_rel == DT_REL) { |
63 | if (m->dyn.plt_rel == DT_REL) { |
- | 64 | DPRINTF("table type DT_REL\n"); |
|
62 | if (m->dyn.rel != NULL) |
65 | if (m->dyn.rel != NULL) { |
- | 66 | DPRINTF("non-empty\n"); |
|
63 | rel_table_process(m, m->dyn.rel, m->dyn.rel_sz); |
67 | rel_table_process(m, m->dyn.rel, m->dyn.rel_sz); |
- | 68 | } |
|
64 | /* FIXME: this seems wrong */ |
69 | /* FIXME: this seems wrong */ |
65 | if (m->dyn.jmp_rel != NULL) |
70 | if (m->dyn.jmp_rel != NULL) { |
- | 71 | DPRINTF("table type jmp-rel\n"); |
|
- | 72 | DPRINTF("non-empty\n"); |
|
66 | rel_table_process(m, m->dyn.jmp_rel, m->dyn.plt_rel_sz); |
73 | rel_table_process(m, m->dyn.jmp_rel, m->dyn.plt_rel_sz); |
- | 74 | } |
|
67 | } else { /* (m->dyn.plt_rel == DT_RELA) */ |
75 | } else { /* (m->dyn.plt_rel == DT_RELA) */ |
68 | DPRINTF("table type DT_RELA\n"); |
76 | DPRINTF("table type DT_RELA\n"); |
69 | if (m->dyn.rela != NULL) { |
77 | if (m->dyn.rela != NULL) { |
70 | DPRINTF("non-empty\n"); |
78 | DPRINTF("non-empty\n"); |
71 | rela_table_process(m, m->dyn.rela, m->dyn.rela_sz); |
79 | rela_table_process(m, m->dyn.rela, m->dyn.rela_sz); |
72 | } |
80 | } |
73 | } |
81 | } |
74 | 82 | ||
75 | m->relocated = true; |
83 | m->relocated = true; |
76 | } |
84 | } |
77 | 85 | ||
78 | /** Find module structure by soname/pathname. |
86 | /** Find module structure by soname/pathname. |
79 | * |
87 | * |
80 | * Used primarily to see if a module has already been loaded. |
88 | * Used primarily to see if a module has already been loaded. |
81 | * Modules are compared according to their soname, i.e. possible |
89 | * Modules are compared according to their soname, i.e. possible |
82 | * path components are ignored. |
90 | * path components are ignored. |
83 | */ |
91 | */ |
84 | module_t *module_find(char *name) |
92 | module_t *module_find(char *name) |
85 | { |
93 | { |
86 | link_t *head = &runtime_env->modules_head; |
94 | link_t *head = &runtime_env->modules_head; |
87 | 95 | ||
88 | link_t *cur; |
96 | link_t *cur; |
89 | module_t *m; |
97 | module_t *m; |
90 | char *p, *soname; |
98 | char *p, *soname; |
91 | 99 | ||
92 | /* |
100 | /* |
93 | * If name contains slashes, treat it as a pathname and |
101 | * If name contains slashes, treat it as a pathname and |
94 | * construct soname by chopping off the path. Otherwise |
102 | * construct soname by chopping off the path. Otherwise |
95 | * treat it as soname. |
103 | * treat it as soname. |
96 | */ |
104 | */ |
97 | p = strrchr(name, '/'); |
105 | p = strrchr(name, '/'); |
98 | soname = p ? (p + 1) : name; |
106 | soname = p ? (p + 1) : name; |
99 | 107 | ||
100 | /* Traverse list of all modules. Not extremely fast, but simple */ |
108 | /* Traverse list of all modules. Not extremely fast, but simple */ |
101 | for (cur = head->next; cur != head; cur = cur->next) { |
109 | for (cur = head->next; cur != head; cur = cur->next) { |
102 | m = list_get_instance(cur, module_t, modules_link); |
110 | m = list_get_instance(cur, module_t, modules_link); |
103 | if (strcmp(m->dyn.soname, soname) == 0) { |
111 | if (strcmp(m->dyn.soname, soname) == 0) { |
104 | return m; /* Found */ |
112 | return m; /* Found */ |
105 | } |
113 | } |
106 | } |
114 | } |
107 | 115 | ||
108 | return NULL; /* Not found */ |
116 | return NULL; /* Not found */ |
109 | } |
117 | } |
110 | 118 | ||
111 | #define NAME_BUF_SIZE 64 |
119 | #define NAME_BUF_SIZE 64 |
112 | 120 | ||
113 | /** Load a module. |
121 | /** Load a module. |
114 | * |
122 | * |
115 | * Currently this trivially tries to load '/<name>'. |
123 | * Currently this trivially tries to load '/<name>'. |
116 | */ |
124 | */ |
117 | module_t *module_load(char *name) |
125 | module_t *module_load(char *name) |
118 | { |
126 | { |
119 | elf_info_t info; |
127 | elf_info_t info; |
120 | char name_buf[NAME_BUF_SIZE]; |
128 | char name_buf[NAME_BUF_SIZE]; |
121 | module_t *m; |
129 | module_t *m; |
122 | int rc; |
130 | int rc; |
123 | 131 | ||
124 | m = malloc(sizeof(module_t)); |
132 | m = malloc(sizeof(module_t)); |
125 | if (!m) { |
133 | if (!m) { |
126 | printf("malloc failed\n"); |
134 | printf("malloc failed\n"); |
127 | exit(1); |
135 | exit(1); |
128 | } |
136 | } |
129 | 137 | ||
130 | if (strlen(name) > NAME_BUF_SIZE - 2) { |
138 | if (strlen(name) > NAME_BUF_SIZE - 2) { |
131 | printf("soname too long. increase NAME_BUF_SIZE\n"); |
139 | printf("soname too long. increase NAME_BUF_SIZE\n"); |
132 | exit(1); |
140 | exit(1); |
133 | } |
141 | } |
134 | 142 | ||
135 | /* Prepend soname with '/lib/' */ |
143 | /* Prepend soname with '/lib/' */ |
136 | name_buf[0] = '/'; |
144 | name_buf[0] = '/'; |
137 | strcpy(name_buf, "/lib/"); |
145 | strcpy(name_buf, "/lib/"); |
138 | strcpy(name_buf + 5, name); |
146 | strcpy(name_buf + 5, name); |
139 | 147 | ||
140 | /* FIXME: need to real allocation of address space */ |
148 | /* FIXME: need to real allocation of address space */ |
141 | m->bias = runtime_env->next_bias; |
149 | m->bias = runtime_env->next_bias; |
142 | runtime_env->next_bias += 0x100000; |
150 | runtime_env->next_bias += 0x100000; |
143 | 151 | ||
144 | DPRINTF("filename:'%s'\n", name_buf); |
152 | DPRINTF("filename:'%s'\n", name_buf); |
- | 153 | printf("load '%s' at 0x%x\n", name_buf, m->bias); |
|
145 | 154 | ||
146 | rc = elf_load_file(name_buf, m->bias, ELDF_RW, &info); |
155 | rc = elf_load_file(name_buf, m->bias, ELDF_RW, &info); |
147 | if (rc != EE_OK) { |
156 | if (rc != EE_OK) { |
148 | printf("Failed to load '%s'\n", name_buf); |
157 | printf("Failed to load '%s'\n", name_buf); |
149 | exit(1); |
158 | exit(1); |
150 | } |
159 | } |
151 | 160 | ||
152 | if (info.dynamic == NULL) { |
161 | if (info.dynamic == NULL) { |
153 | printf("Error: '%s' is not a dynamically-linked object.\n", |
162 | printf("Error: '%s' is not a dynamically-linked object.\n", |
154 | name_buf); |
163 | name_buf); |
155 | exit(1); |
164 | exit(1); |
156 | } |
165 | } |
157 | 166 | ||
158 | /* Pending relocation. */ |
167 | /* Pending relocation. */ |
159 | m->relocated = false; |
168 | m->relocated = false; |
160 | 169 | ||
161 | DPRINTF("parse dynamic section\n"); |
170 | DPRINTF("parse dynamic section\n"); |
162 | /* Parse ELF .dynamic section. Store info to m->dyn. */ |
171 | /* Parse ELF .dynamic section. Store info to m->dyn. */ |
163 | dynamic_parse(info.dynamic, m->bias, &m->dyn); |
172 | dynamic_parse(info.dynamic, m->bias, &m->dyn); |
164 | 173 | ||
165 | /* Insert into the list of loaded modules */ |
174 | /* Insert into the list of loaded modules */ |
166 | list_append(&m->modules_link, &runtime_env->modules_head); |
175 | list_append(&m->modules_link, &runtime_env->modules_head); |
167 | 176 | ||
168 | return m; |
177 | return m; |
169 | } |
178 | } |
170 | 179 | ||
171 | /** Load all modules on which m (transitively) depends. |
180 | /** Load all modules on which m (transitively) depends. |
172 | */ |
181 | */ |
173 | void module_load_deps(module_t *m) |
182 | void module_load_deps(module_t *m) |
174 | { |
183 | { |
175 | elf_dyn_t *dp; |
184 | elf_dyn_t *dp; |
176 | char *dep_name; |
185 | char *dep_name; |
177 | module_t *dm; |
186 | module_t *dm; |
178 | size_t n, i; |
187 | size_t n, i; |
179 | 188 | ||
180 | /* Count direct dependencies */ |
189 | /* Count direct dependencies */ |
181 | 190 | ||
182 | dp = m->dyn.dynamic; |
191 | dp = m->dyn.dynamic; |
183 | n = 0; |
192 | n = 0; |
184 | 193 | ||
185 | while (dp->d_tag != DT_NULL) { |
194 | while (dp->d_tag != DT_NULL) { |
186 | if (dp->d_tag == DT_NEEDED) ++n; |
195 | if (dp->d_tag == DT_NEEDED) ++n; |
187 | ++dp; |
196 | ++dp; |
188 | } |
197 | } |
189 | 198 | ||
190 | /* Create an array of pointers to direct dependencies */ |
199 | /* Create an array of pointers to direct dependencies */ |
191 | 200 | ||
192 | m->n_deps = n; |
201 | m->n_deps = n; |
193 | 202 | ||
194 | if (n == 0) { |
203 | if (n == 0) { |
195 | /* There are no dependencies, so we are done. */ |
204 | /* There are no dependencies, so we are done. */ |
196 | m->deps = NULL; |
205 | m->deps = NULL; |
197 | return; |
206 | return; |
198 | } |
207 | } |
199 | 208 | ||
200 | m->deps = malloc(n * sizeof(module_t *)); |
209 | m->deps = malloc(n * sizeof(module_t *)); |
201 | if (!m->deps) { |
210 | if (!m->deps) { |
202 | printf("malloc failed\n"); |
211 | printf("malloc failed\n"); |
203 | exit(1); |
212 | exit(1); |
204 | } |
213 | } |
205 | 214 | ||
206 | i = 0; /* Current dependency index */ |
215 | i = 0; /* Current dependency index */ |
207 | dp = m->dyn.dynamic; |
216 | dp = m->dyn.dynamic; |
208 | 217 | ||
209 | while (dp->d_tag != DT_NULL) { |
218 | while (dp->d_tag != DT_NULL) { |
210 | if (dp->d_tag == DT_NEEDED) { |
219 | if (dp->d_tag == DT_NEEDED) { |
211 | dep_name = m->dyn.str_tab + dp->d_un.d_val; |
220 | dep_name = m->dyn.str_tab + dp->d_un.d_val; |
212 | 221 | ||
213 | DPRINTF("%s needs %s\n", m->dyn.soname, dep_name); |
222 | DPRINTF("%s needs %s\n", m->dyn.soname, dep_name); |
214 | dm = module_find(dep_name); |
223 | dm = module_find(dep_name); |
215 | if (!dm) { |
224 | if (!dm) { |
216 | dm = module_load(dep_name); |
225 | dm = module_load(dep_name); |
217 | module_load_deps(dm); |
226 | module_load_deps(dm); |
218 | } |
227 | } |
219 | 228 | ||
220 | /* Save into deps table */ |
229 | /* Save into deps table */ |
221 | m->deps[i++] = dm; |
230 | m->deps[i++] = dm; |
222 | } |
231 | } |
223 | ++dp; |
232 | ++dp; |
224 | } |
233 | } |
225 | } |
234 | } |
226 | 235 | ||
227 | /** Process relocations in modules. |
236 | /** Process relocations in modules. |
228 | * |
237 | * |
229 | * Processes relocations in @a start and all its dependencies. |
238 | * Processes relocations in @a start and all its dependencies. |
230 | * Modules that have already been relocated are unaffected. |
239 | * Modules that have already been relocated are unaffected. |
231 | * |
240 | * |
232 | * @param start The module where to start from. |
241 | * @param start The module where to start from. |
233 | */ |
242 | */ |
234 | void modules_process_relocs(module_t *start) |
243 | void modules_process_relocs(module_t *start) |
235 | { |
244 | { |
236 | link_t *head = &runtime_env->modules_head; |
245 | link_t *head = &runtime_env->modules_head; |
237 | 246 | ||
238 | link_t *cur; |
247 | link_t *cur; |
239 | module_t *m; |
248 | module_t *m; |
240 | 249 | ||
241 | for (cur = head->next; cur != head; cur = cur->next) { |
250 | for (cur = head->next; cur != head; cur = cur->next) { |
242 | m = list_get_instance(cur, module_t, modules_link); |
251 | m = list_get_instance(cur, module_t, modules_link); |
243 | 252 | ||
244 | /* Skip rtld, since it has already been processed */ |
253 | /* Skip rtld, since it has already been processed */ |
245 | if (m != &runtime_env->rtld) { |
254 | if (m != &runtime_env->rtld) { |
246 | module_process_relocs(m); |
255 | module_process_relocs(m); |
247 | } |
256 | } |
248 | } |
257 | } |
249 | } |
258 | } |
250 | 259 | ||
251 | /** Clear BFS tags of all modules. |
260 | /** Clear BFS tags of all modules. |
252 | */ |
261 | */ |
253 | void modules_untag(void) |
262 | void modules_untag(void) |
254 | { |
263 | { |
255 | link_t *head = &runtime_env->modules_head; |
264 | link_t *head = &runtime_env->modules_head; |
256 | 265 | ||
257 | link_t *cur; |
266 | link_t *cur; |
258 | module_t *m; |
267 | module_t *m; |
259 | 268 | ||
260 | for (cur = head->next; cur != head; cur = cur->next) { |
269 | for (cur = head->next; cur != head; cur = cur->next) { |
261 | m = list_get_instance(cur, module_t, modules_link); |
270 | m = list_get_instance(cur, module_t, modules_link); |
262 | m->bfs_tag = false; |
271 | m->bfs_tag = false; |
263 | } |
272 | } |
264 | } |
273 | } |
265 | 274 | ||
266 | /** @} |
275 | /** @} |
267 | */ |
276 | */ |
268 | 277 |