Rev 3000 | Rev 3552 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3000 | Rev 3400 | ||
---|---|---|---|
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 | 43 | ||
43 | #include <rtld.h> |
44 | #include <rtld.h> |
44 | #include <dynamic.h> |
45 | #include <dynamic.h> |
45 | #include <pcb.h> |
- | |
46 | #include <elf_load.h> |
46 | #include <elf_load.h> |
47 | #include <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 | printf("module_process_relocs('%s')\n", m->dyn.soname); |
56 | printf("module_process_relocs('%s')\n", m->dyn.soname); |
57 | if (m->dyn.plt_rel == DT_REL) { |
57 | if (m->dyn.plt_rel == DT_REL) { |
58 | if (m->dyn.rel != NULL) |
58 | if (m->dyn.rel != NULL) |
59 | rel_table_process(m, m->dyn.rel, m->dyn.rel_sz); |
59 | rel_table_process(m, m->dyn.rel, m->dyn.rel_sz); |
60 | /* FIXME: this seems wrong */ |
60 | /* FIXME: this seems wrong */ |
61 | if (m->dyn.jmp_rel != NULL) |
61 | if (m->dyn.jmp_rel != NULL) |
62 | rel_table_process(m, m->dyn.jmp_rel, m->dyn.plt_rel_sz); |
62 | rel_table_process(m, m->dyn.jmp_rel, m->dyn.plt_rel_sz); |
63 | } else { /* (m->dyn.plt_rel == DT_RELA) */ |
63 | } else { /* (m->dyn.plt_rel == DT_RELA) */ |
64 | printf("table type DT_RELA\n"); |
64 | printf("table type DT_RELA\n"); |
65 | if (m->dyn.rela != NULL) { |
65 | if (m->dyn.rela != NULL) { |
66 | printf("non-empty\n"); |
66 | printf("non-empty\n"); |
67 | rela_table_process(m, m->dyn.rela, m->dyn.rela_sz); |
67 | rela_table_process(m, m->dyn.rela, m->dyn.rela_sz); |
68 | } |
68 | } |
69 | } |
69 | } |
70 | } |
70 | } |
71 | 71 | ||
72 | /** Find module structure by soname/pathname. |
72 | /** Find module structure by soname/pathname. |
73 | * |
73 | * |
74 | * Used primarily to see if a module has already been loaded. |
74 | * Used primarily to see if a module has already been loaded. |
75 | * Modules are compared according to their soname, i.e. possible |
75 | * Modules are compared according to their soname, i.e. possible |
76 | * path components are ignored. |
76 | * path components are ignored. |
77 | */ |
77 | */ |
78 | module_t *module_find(char *name) |
78 | module_t *module_find(char *name) |
79 | { |
79 | { |
80 | link_t *head = &runtime_env.modules_head; |
80 | link_t *head = &runtime_env.modules_head; |
81 | 81 | ||
82 | link_t *cur; |
82 | link_t *cur; |
83 | module_t *m; |
83 | module_t *m; |
84 | char *p, *soname; |
84 | char *p, *soname; |
85 | 85 | ||
86 | /* |
86 | /* |
87 | * If name contains slashes, treat it as a pathname and |
87 | * If name contains slashes, treat it as a pathname and |
88 | * construct soname by chopping off the path. Otherwise |
88 | * construct soname by chopping off the path. Otherwise |
89 | * treat it as soname. |
89 | * treat it as soname. |
90 | */ |
90 | */ |
91 | p = strrchr(name, '/'); |
91 | p = strrchr(name, '/'); |
92 | soname = p ? (p + 1) : name; |
92 | soname = p ? (p + 1) : name; |
93 | 93 | ||
94 | /* Traverse list of all modules. Not extremely fast, but simple */ |
94 | /* Traverse list of all modules. Not extremely fast, but simple */ |
95 | for (cur = head->next; cur != head; cur = cur->next) { |
95 | for (cur = head->next; cur != head; cur = cur->next) { |
96 | m = list_get_instance(cur, module_t, modules_link); |
96 | m = list_get_instance(cur, module_t, modules_link); |
97 | if (strcmp(m->dyn.soname, soname) == 0) { |
97 | if (strcmp(m->dyn.soname, soname) == 0) { |
98 | return m; /* Found */ |
98 | return m; /* Found */ |
99 | } |
99 | } |
100 | } |
100 | } |
101 | 101 | ||
102 | return NULL; /* Not found */ |
102 | return NULL; /* Not found */ |
103 | } |
103 | } |
104 | 104 | ||
105 | #define NAME_BUF_SIZE 64 |
105 | #define NAME_BUF_SIZE 64 |
106 | 106 | ||
107 | /** Load a module. |
107 | /** Load a module. |
108 | * |
108 | * |
109 | * Currently this trivially tries to load '/<name>'. |
109 | * Currently this trivially tries to load '/<name>'. |
110 | */ |
110 | */ |
111 | module_t *module_load(char *name) |
111 | module_t *module_load(char *name) |
112 | { |
112 | { |
113 | elf_info_t info; |
113 | elf_info_t info; |
114 | char name_buf[NAME_BUF_SIZE]; |
114 | char name_buf[NAME_BUF_SIZE]; |
115 | module_t *m; |
115 | module_t *m; |
116 | int rc; |
116 | int rc; |
117 | 117 | ||
118 | m = malloc(sizeof(module_t)); |
118 | m = malloc(sizeof(module_t)); |
119 | if (!m) { |
119 | if (!m) { |
120 | printf("malloc failed\n"); |
120 | printf("malloc failed\n"); |
121 | exit(1); |
121 | exit(1); |
122 | } |
122 | } |
123 | 123 | ||
124 | if (strlen(name) > NAME_BUF_SIZE - 2) { |
124 | if (strlen(name) > NAME_BUF_SIZE - 2) { |
125 | printf("soname too long. increase NAME_BUF_SIZE\n"); |
125 | printf("soname too long. increase NAME_BUF_SIZE\n"); |
126 | exit(1); |
126 | exit(1); |
127 | } |
127 | } |
128 | 128 | ||
129 | /* Prepend soname with slash */ |
129 | /* Prepend soname with '/lib/' */ |
130 | name_buf[0] = '/'; |
130 | name_buf[0] = '/'; |
- | 131 | strcpy(name_buf, "/lib/"); |
|
131 | strcpy(name_buf + 1, name); |
132 | strcpy(name_buf + 5, name); |
132 | 133 | ||
133 | /* FIXME: need to vary bias / allocate address space */ |
134 | /* FIXME: need to vary bias / allocate address space */ |
134 | m->bias = 0x20000; |
135 | m->bias = 0x20000; |
135 | printf("filename:'%s'\n", name_buf); |
136 | printf("filename:'%s'\n", name_buf); |
136 | 137 | ||
137 | rc = elf_load_file(name_buf, m->bias, &info); |
138 | rc = elf_load_file(name_buf, m->bias, &info); |
138 | if (rc < 0) { |
139 | if (rc < 0) { |
139 | printf("Failed to load '%s'\n"); |
140 | printf("Failed to load '%s'\n", name_buf); |
140 | exit(1); |
141 | exit(1); |
141 | } |
142 | } |
142 | 143 | ||
143 | printf("parse dynamic section\n"); |
144 | printf("parse dynamic section\n"); |
144 | /* Parse ELF .dynamic section. Store info to m->dyn. */ |
145 | /* Parse ELF .dynamic section. Store info to m->dyn. */ |
145 | dynamic_parse(info.dynamic, m->bias, &m->dyn); |
146 | dynamic_parse(info.dynamic, m->bias, &m->dyn); |
146 | 147 | ||
147 | /* Insert into the list of loaded modules */ |
148 | /* Insert into the list of loaded modules */ |
148 | list_append(&m->modules_link, &runtime_env.modules_head); |
149 | list_append(&m->modules_link, &runtime_env.modules_head); |
149 | 150 | ||
150 | return m; |
151 | return m; |
151 | } |
152 | } |
152 | 153 | ||
153 | /** Load all modules on which m (transitively) depends. |
154 | /** Load all modules on which m (transitively) depends. |
154 | */ |
155 | */ |
155 | void module_load_deps(module_t *m) |
156 | void module_load_deps(module_t *m) |
156 | { |
157 | { |
157 | elf_dyn_t *dp; |
158 | elf_dyn_t *dp; |
158 | char *dep_name; |
159 | char *dep_name; |
159 | module_t *dm; |
160 | module_t *dm; |
160 | size_t n, i; |
161 | size_t n, i; |
161 | 162 | ||
162 | /* Count direct dependencies */ |
163 | /* Count direct dependencies */ |
163 | 164 | ||
164 | dp = m->dyn.dynamic; |
165 | dp = m->dyn.dynamic; |
165 | n = 0; |
166 | n = 0; |
166 | 167 | ||
167 | while (dp->d_tag != DT_NULL) { |
168 | while (dp->d_tag != DT_NULL) { |
168 | if (dp->d_tag == DT_NEEDED) ++n; |
169 | if (dp->d_tag == DT_NEEDED) ++n; |
169 | ++dp; |
170 | ++dp; |
170 | } |
171 | } |
171 | 172 | ||
172 | /* Create an array of pointers to direct dependencies */ |
173 | /* Create an array of pointers to direct dependencies */ |
173 | 174 | ||
174 | m->n_deps = n; |
175 | m->n_deps = n; |
175 | if (n > 0) |
176 | if (n > 0) |
176 | m->deps = malloc(n * sizeof(module_t *)); |
177 | m->deps = malloc(n * sizeof(module_t *)); |
177 | else |
178 | else |
178 | m->deps = NULL; |
179 | m->deps = NULL; |
179 | 180 | ||
180 | if (!m->deps) { |
181 | if (!m->deps) { |
181 | printf("malloc failed\n"); |
182 | printf("malloc failed\n"); |
182 | exit(1); |
183 | exit(1); |
183 | } |
184 | } |
184 | 185 | ||
185 | i = 0; /* Current dependency index */ |
186 | i = 0; /* Current dependency index */ |
186 | dp = m->dyn.dynamic; |
187 | dp = m->dyn.dynamic; |
187 | 188 | ||
188 | while (dp->d_tag != DT_NULL) { |
189 | while (dp->d_tag != DT_NULL) { |
189 | if (dp->d_tag == DT_NEEDED) { |
190 | if (dp->d_tag == DT_NEEDED) { |
190 | dep_name = m->dyn.str_tab + dp->d_un.d_val; |
191 | dep_name = m->dyn.str_tab + dp->d_un.d_val; |
191 | 192 | ||
192 | printf("%s needs %s\n", m->dyn.soname, dep_name); |
193 | printf("%s needs %s\n", m->dyn.soname, dep_name); |
193 | dm = module_find(dep_name); |
194 | dm = module_find(dep_name); |
194 | if (!dm) { |
195 | if (!dm) { |
195 | dm = module_load(dep_name); |
196 | dm = module_load(dep_name); |
196 | module_load_deps(dm); |
197 | module_load_deps(dm); |
197 | } |
198 | } |
198 | 199 | ||
199 | /* Save into deps table */ |
200 | /* Save into deps table */ |
200 | m->deps[i++] = dm; |
201 | m->deps[i++] = dm; |
201 | } |
202 | } |
202 | ++dp; |
203 | ++dp; |
203 | } |
204 | } |
204 | } |
205 | } |
205 | 206 | ||
206 | void modules_process_relocs(void) |
207 | void modules_process_relocs(void) |
207 | { |
208 | { |
208 | link_t *head = &runtime_env.modules_head; |
209 | link_t *head = &runtime_env.modules_head; |
209 | 210 | ||
210 | link_t *cur; |
211 | link_t *cur; |
211 | module_t *m; |
212 | module_t *m; |
212 | 213 | ||
213 | for (cur = head->next; cur != head; cur = cur->next) { |
214 | for (cur = head->next; cur != head; cur = cur->next) { |
214 | m = list_get_instance(cur, module_t, modules_link); |
215 | m = list_get_instance(cur, module_t, modules_link); |
215 | 216 | ||
216 | /* Skip rtld, since it has already been processed */ |
217 | /* Skip rtld, since it has already been processed */ |
217 | if (m != &runtime_env.rtld) { |
218 | if (m != &runtime_env.rtld) { |
218 | module_process_relocs(m); |
219 | module_process_relocs(m); |
219 | } |
220 | } |
220 | } |
221 | } |
221 | } |
222 | } |
222 | 223 | ||
223 | /** Clear BFS tags of all modules. |
224 | /** Clear BFS tags of all modules. |
224 | */ |
225 | */ |
225 | void modules_untag(void) |
226 | void modules_untag(void) |
226 | { |
227 | { |
227 | link_t *head = &runtime_env.modules_head; |
228 | link_t *head = &runtime_env.modules_head; |
228 | 229 | ||
229 | link_t *cur; |
230 | link_t *cur; |
230 | module_t *m; |
231 | module_t *m; |
231 | 232 | ||
232 | for (cur = head->next; cur != head; cur = cur->next) { |
233 | for (cur = head->next; cur != head; cur = cur->next) { |
233 | m = list_get_instance(cur, module_t, modules_link); |
234 | m = list_get_instance(cur, module_t, modules_link); |
234 | m->bfs_tag = false; |
235 | m->bfs_tag = false; |
235 | } |
236 | } |
236 | } |
237 | } |
237 | 238 | ||
238 | /** @} |
239 | /** @} |
239 | */ |
240 | */ |
240 | 241 |