]>
Commit | Line | Data |
---|---|---|
efec1d0c | 1 | /* Load the dependencies of a mapped object. |
d4697bc9 | 2 | Copyright (C) 1996-2014 Free Software Foundation, Inc. |
afd4eb37 UD |
3 | This file is part of the GNU C Library. |
4 | ||
5 | The GNU C Library is free software; you can redistribute it and/or | |
41bdb6e2 AJ |
6 | modify it under the terms of the GNU Lesser General Public |
7 | License as published by the Free Software Foundation; either | |
8 | version 2.1 of the License, or (at your option) any later version. | |
afd4eb37 UD |
9 | |
10 | The GNU C Library is distributed in the hope that it will be useful, | |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
41bdb6e2 | 13 | Lesser General Public License for more details. |
afd4eb37 | 14 | |
41bdb6e2 | 15 | You should have received a copy of the GNU Lesser General Public |
59ba27a6 PE |
16 | License along with the GNU C Library; if not, see |
17 | <http://www.gnu.org/licenses/>. */ | |
efec1d0c | 18 | |
385b4cf4 | 19 | #include <atomic.h> |
dc5efe83 | 20 | #include <assert.h> |
efec1d0c | 21 | #include <dlfcn.h> |
a853022c | 22 | #include <errno.h> |
8e17ea58 | 23 | #include <libintl.h> |
32e6df36 | 24 | #include <stddef.h> |
efec1d0c | 25 | #include <stdlib.h> |
ca34d7a7 | 26 | #include <string.h> |
06535ae9 | 27 | #include <unistd.h> |
dc5efe83 | 28 | #include <sys/param.h> |
a42195db | 29 | #include <ldsodefs.h> |
a853022c | 30 | |
dc5efe83 | 31 | #include <dl-dst.h> |
1522c368 UD |
32 | |
33 | /* Whether an shared object references one or more auxiliary objects | |
34 | is signaled by the AUXTAG entry in l_info. */ | |
b0982c4a | 35 | #define AUXTAG (DT_NUM + DT_THISPROCNUM + DT_VERSIONTAGNUM \ |
1522c368 | 36 | + DT_EXTRATAGIDX (DT_AUXILIARY)) |
f41c8091 UD |
37 | /* Whether an shared object references one or more auxiliary objects |
38 | is signaled by the AUXTAG entry in l_info. */ | |
b0982c4a | 39 | #define FILTERTAG (DT_NUM + DT_THISPROCNUM + DT_VERSIONTAGNUM \ |
f41c8091 | 40 | + DT_EXTRATAGIDX (DT_FILTER)) |
1522c368 UD |
41 | |
42 | ||
43 | /* When loading auxiliary objects we must ignore errors. It's ok if | |
44 | an object is missing. */ | |
993b3242 | 45 | struct openaux_args |
1522c368 UD |
46 | { |
47 | /* The arguments to openaux. */ | |
48 | struct link_map *map; | |
49 | int trace_mode; | |
87837aac | 50 | int open_mode; |
1522c368 | 51 | const char *strtab; |
dc5efe83 | 52 | const char *name; |
993b3242 | 53 | |
1522c368 UD |
54 | /* The return value of openaux. */ |
55 | struct link_map *aux; | |
56 | }; | |
993b3242 UD |
57 | |
58 | static void | |
59 | openaux (void *a) | |
60 | { | |
61 | struct openaux_args *args = (struct openaux_args *) a; | |
62 | ||
8e9f92e9 | 63 | args->aux = _dl_map_object (args->map, args->name, |
154d10bd UD |
64 | (args->map->l_type == lt_executable |
65 | ? lt_library : args->map->l_type), | |
c0f62c56 UD |
66 | args->trace_mode, args->open_mode, |
67 | args->map->l_ns); | |
993b3242 UD |
68 | } |
69 | ||
32e6df36 UD |
70 | static ptrdiff_t |
71 | internal_function | |
72 | _dl_build_local_scope (struct link_map **list, struct link_map *map) | |
73 | { | |
74 | struct link_map **p = list; | |
75 | struct link_map **q; | |
76 | ||
77 | *p++ = map; | |
78 | map->l_reserved = 1; | |
79 | if (map->l_initfini) | |
80 | for (q = map->l_initfini + 1; *q; ++q) | |
81 | if (! (*q)->l_reserved) | |
82 | p += _dl_build_local_scope (p, *q); | |
83 | return p - list; | |
84 | } | |
1522c368 UD |
85 | |
86 | ||
80d9c5f0 | 87 | /* We use a very special kind of list to track the path |
1522c368 | 88 | through the list of loaded shared objects. We have to |
80d9c5f0 | 89 | produce a flat list with unique members of all involved objects. |
1522c368 UD |
90 | */ |
91 | struct list | |
92 | { | |
93 | int done; /* Nonzero if this map was processed. */ | |
94 | struct link_map *map; /* The data. */ | |
ac55a25b | 95 | struct list *next; /* Elements for normal list. */ |
1522c368 UD |
96 | }; |
97 | ||
98 | ||
dc5efe83 UD |
99 | /* Macro to expand DST. It is an macro since we use `alloca'. */ |
100 | #define expand_dst(l, str, fatal) \ | |
101 | ({ \ | |
102 | const char *__str = (str); \ | |
103 | const char *__result = __str; \ | |
ac55a25b | 104 | size_t __dst_cnt = DL_DST_COUNT (__str, 0); \ |
dc5efe83 | 105 | \ |
ac55a25b | 106 | if (__dst_cnt != 0) \ |
dc5efe83 | 107 | { \ |
06535ae9 UD |
108 | char *__newp; \ |
109 | \ | |
110 | /* DST must not appear in SUID/SGID programs. */ \ | |
e6caf4e1 | 111 | if (INTUSE(__libc_enable_secure)) \ |
154d10bd | 112 | _dl_signal_error (0, __str, NULL, N_("\ |
87837aac | 113 | DST not allowed in SUID/SGID programs")); \ |
06535ae9 UD |
114 | \ |
115 | __newp = (char *) alloca (DL_DST_REQUIRED (l, __str, strlen (__str), \ | |
ac55a25b | 116 | __dst_cnt)); \ |
dc5efe83 | 117 | \ |
ac55a25b | 118 | __result = _dl_dst_substitute (l, __str, __newp, 0); \ |
dc5efe83 UD |
119 | \ |
120 | if (*__result == '\0') \ | |
121 | { \ | |
122 | /* The replacement for the DST is not known. We can't \ | |
123 | processed. */ \ | |
124 | if (fatal) \ | |
154d10bd | 125 | _dl_signal_error (0, __str, NULL, N_("\ |
11bf311e | 126 | empty dynamic string token substitution")); \ |
dc5efe83 UD |
127 | else \ |
128 | { \ | |
129 | /* This is for DT_AUXILIARY. */ \ | |
a1ffb40e | 130 | if (__glibc_unlikely (GLRO(dl_debug_mask) & DL_DEBUG_LIBS)) \ |
154d10bd | 131 | _dl_debug_printf (N_("\ |
7969407a UD |
132 | cannot load auxiliary `%s' because of empty dynamic string token " \ |
133 | "substitution\n"), __str); \ | |
dc5efe83 UD |
134 | continue; \ |
135 | } \ | |
136 | } \ | |
137 | } \ | |
138 | \ | |
139 | __result; }) | |
140 | ||
141 | ||
d9cb1a7d | 142 | void |
d0fc4041 | 143 | internal_function |
2064087b | 144 | _dl_map_object_deps (struct link_map *map, |
46ec036d | 145 | struct link_map **preloads, unsigned int npreloads, |
87837aac | 146 | int trace_mode, int open_mode) |
efec1d0c | 147 | { |
db2f05ba | 148 | struct list *known = __alloca (sizeof *known * (1 + npreloads + 1)); |
80d9c5f0 UD |
149 | struct list *runp, *tail; |
150 | unsigned int nlist, i; | |
c77a4478 UD |
151 | /* Object name. */ |
152 | const char *name; | |
153 | int errno_saved; | |
154 | int errno_reason; | |
951d5dd8 | 155 | const char *errstring; |
64b7897d | 156 | const char *objname; |
1522c368 | 157 | |
f1d70dad | 158 | void preload (struct link_map *map) |
df4ef2ab | 159 | { |
1522c368 UD |
160 | known[nlist].done = 0; |
161 | known[nlist].map = map; | |
80d9c5f0 | 162 | known[nlist].next = &known[nlist + 1]; |
efec1d0c | 163 | |
1522c368 | 164 | ++nlist; |
df4ef2ab UD |
165 | /* We use `l_reserved' as a mark bit to detect objects we have |
166 | already put in the search list and avoid adding duplicate | |
167 | elements later in the list. */ | |
168 | map->l_reserved = 1; | |
169 | } | |
2064087b | 170 | |
1522c368 UD |
171 | /* No loaded object so far. */ |
172 | nlist = 0; | |
2064087b | 173 | |
1522c368 | 174 | /* First load MAP itself. */ |
df4ef2ab UD |
175 | preload (map); |
176 | ||
177 | /* Add the preloaded items after MAP but before any of its dependencies. */ | |
178 | for (i = 0; i < npreloads; ++i) | |
179 | preload (preloads[i]); | |
180 | ||
8a523922 | 181 | /* Terminate the lists. */ |
80d9c5f0 | 182 | known[nlist - 1].next = NULL; |
1522c368 | 183 | |
1522c368 | 184 | /* Pointer to last unique object. */ |
80d9c5f0 | 185 | tail = &known[nlist - 1]; |
efec1d0c | 186 | |
02f9c6cf PP |
187 | /* No alloca'd space yet. */ |
188 | struct link_map **needed_space = NULL; | |
189 | size_t needed_space_bytes = 0; | |
190 | ||
1522c368 UD |
191 | /* Process each element of the search list, loading each of its |
192 | auxiliary objects and immediate dependencies. Auxiliary objects | |
193 | will be added in the list before the object itself and | |
194 | dependencies will be appended to the list as we step through it. | |
195 | This produces a flat, ordered list that represents a | |
196 | breadth-first search of the dependency tree. | |
197 | ||
198 | The whole process is complicated by the fact that we better | |
199 | should use alloca for the temporary list elements. But using | |
200 | alloca means we cannot use recursive function calls. */ | |
c77a4478 UD |
201 | errno_saved = errno; |
202 | errno_reason = 0; | |
951d5dd8 | 203 | errstring = NULL; |
c77a4478 UD |
204 | errno = 0; |
205 | name = NULL; | |
1522c368 | 206 | for (runp = known; runp; ) |
efec1d0c | 207 | { |
1522c368 | 208 | struct link_map *l = runp->map; |
dacc8ffa UD |
209 | struct link_map **needed = NULL; |
210 | unsigned int nneeded = 0; | |
211 | ||
212 | /* Unless otherwise stated, this object is handled. */ | |
213 | runp->done = 1; | |
214 | ||
215 | /* Allocate a temporary record to contain the references to the | |
216 | dependencies of this object. */ | |
07a3d63e UD |
217 | if (l->l_searchlist.r_list == NULL && l->l_initfini == NULL |
218 | && l != map && l->l_ldnum > 0) | |
02f9c6cf | 219 | { |
647776f6 | 220 | size_t new_size = l->l_ldnum * sizeof (struct link_map *); |
02f9c6cf PP |
221 | |
222 | if (new_size > needed_space_bytes) | |
223 | needed_space | |
647776f6 | 224 | = extend_alloca (needed_space, needed_space_bytes, new_size); |
02f9c6cf PP |
225 | |
226 | needed = needed_space; | |
227 | } | |
f68b86cc | 228 | |
8193034b | 229 | if (l->l_info[DT_NEEDED] || l->l_info[AUXTAG] || l->l_info[FILTERTAG]) |
efec1d0c | 230 | { |
a42195db | 231 | const char *strtab = (const void *) D_PTR (l, l_info[DT_STRTAB]); |
1522c368 UD |
232 | struct openaux_args args; |
233 | struct list *orig; | |
266180eb | 234 | const ElfW(Dyn) *d; |
1522c368 | 235 | |
1522c368 UD |
236 | args.strtab = strtab; |
237 | args.map = l; | |
238 | args.trace_mode = trace_mode; | |
87837aac | 239 | args.open_mode = open_mode; |
1522c368 UD |
240 | orig = runp; |
241 | ||
efec1d0c | 242 | for (d = l->l_ld; d->d_tag != DT_NULL; ++d) |
e3e35cfc | 243 | if (__builtin_expect (d->d_tag, DT_NEEDED) == DT_NEEDED) |
efec1d0c | 244 | { |
f68b86cc | 245 | /* Map in the needed object. */ |
dc5efe83 | 246 | struct link_map *dep; |
dc5efe83 UD |
247 | |
248 | /* Recognize DSTs. */ | |
249 | name = expand_dst (l, strtab + d->d_un.d_val, 0); | |
c77a4478 UD |
250 | /* Store the tag in the argument structure. */ |
251 | args.name = name; | |
dc5efe83 | 252 | |
74780cf6 UD |
253 | bool malloced; |
254 | int err = _dl_catch_error (&objname, &errstring, &malloced, | |
255 | openaux, &args); | |
a1ffb40e | 256 | if (__glibc_unlikely (errstring != NULL)) |
c77a4478 | 257 | { |
74780cf6 | 258 | char *new_errstring = strdupa (errstring); |
65515a05 | 259 | objname = strdupa (objname); |
74780cf6 UD |
260 | if (malloced) |
261 | free ((char *) errstring); | |
262 | errstring = new_errstring; | |
263 | ||
505d4b24 UD |
264 | if (err) |
265 | errno_reason = err; | |
c77a4478 UD |
266 | else |
267 | errno_reason = -1; | |
268 | goto out; | |
269 | } | |
270 | else | |
271 | dep = args.aux; | |
1522c368 | 272 | |
42c4f32a | 273 | if (! dep->l_reserved) |
efec1d0c | 274 | { |
80d9c5f0 UD |
275 | /* Allocate new entry. */ |
276 | struct list *newp; | |
277 | ||
278 | newp = alloca (sizeof (struct list)); | |
279 | ||
280 | /* Append DEP to the list. */ | |
281 | newp->map = dep; | |
1522c368 | 282 | newp->done = 0; |
80d9c5f0 UD |
283 | newp->next = NULL; |
284 | tail->next = newp; | |
285 | tail = newp; | |
f68b86cc | 286 | ++nlist; |
f9496a7b RM |
287 | /* Set the mark bit that says it's already in the list. */ |
288 | dep->l_reserved = 1; | |
efec1d0c | 289 | } |
dacc8ffa UD |
290 | |
291 | /* Remember this dependency. */ | |
292 | if (needed != NULL) | |
293 | needed[nneeded++] = dep; | |
1522c368 | 294 | } |
f41c8091 | 295 | else if (d->d_tag == DT_AUXILIARY || d->d_tag == DT_FILTER) |
1522c368 | 296 | { |
f41c8091 | 297 | struct list *newp; |
dc5efe83 UD |
298 | |
299 | /* Recognize DSTs. */ | |
300 | name = expand_dst (l, strtab + d->d_un.d_val, | |
301 | d->d_tag == DT_AUXILIARY); | |
c77a4478 UD |
302 | /* Store the tag in the argument structure. */ |
303 | args.name = name; | |
84384f5b | 304 | |
3dfb9a5c OB |
305 | /* Say that we are about to load an auxiliary library. */ |
306 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_LIBS, | |
307 | 0)) | |
308 | _dl_debug_printf ("load auxiliary object=%s" | |
309 | " requested by file=%s\n", | |
310 | name, | |
311 | DSO_FILENAME (l->l_name)); | |
312 | ||
313 | /* We must be prepared that the addressed shared | |
314 | object is not available. For filter objects the dependency | |
315 | must be available. */ | |
316 | bool malloced; | |
317 | int err = _dl_catch_error (&objname, &errstring, &malloced, | |
318 | openaux, &args); | |
319 | ||
320 | if (__glibc_unlikely (errstring != NULL)) | |
1522c368 | 321 | { |
3dfb9a5c | 322 | if (d->d_tag == DT_AUXILIARY) |
f41c8091 UD |
323 | { |
324 | /* We are not interested in the error message. */ | |
325 | assert (errstring != NULL); | |
74780cf6 | 326 | if (malloced) |
ca3c0135 | 327 | free ((char *) errstring); |
f41c8091 UD |
328 | |
329 | /* Simply ignore this error and continue the work. */ | |
330 | continue; | |
331 | } | |
3dfb9a5c | 332 | else |
c77a4478 | 333 | { |
3dfb9a5c | 334 | |
74780cf6 | 335 | char *new_errstring = strdupa (errstring); |
65515a05 | 336 | objname = strdupa (objname); |
74780cf6 UD |
337 | if (malloced) |
338 | free ((char *) errstring); | |
339 | errstring = new_errstring; | |
340 | ||
505d4b24 UD |
341 | if (err) |
342 | errno_reason = err; | |
c77a4478 UD |
343 | else |
344 | errno_reason = -1; | |
345 | goto out; | |
346 | } | |
8d9618b7 | 347 | } |
f41c8091 UD |
348 | |
349 | /* The auxiliary object is actually available. | |
350 | Incorporate the map in all the lists. */ | |
351 | ||
352 | /* Allocate new entry. This always has to be done. */ | |
353 | newp = alloca (sizeof (struct list)); | |
354 | ||
ee0f7bd6 UD |
355 | /* We want to insert the new map before the current one, |
356 | but we have no back links. So we copy the contents of | |
357 | the current entry over. Note that ORIG and NEWP now | |
358 | have switched their meanings. */ | |
80d9c5f0 | 359 | memcpy (newp, orig, sizeof (*newp)); |
f41c8091 UD |
360 | |
361 | /* Initialize new entry. */ | |
362 | orig->done = 0; | |
363 | orig->map = args.aux; | |
f41c8091 | 364 | |
dacc8ffa UD |
365 | /* Remember this dependency. */ |
366 | if (needed != NULL) | |
367 | needed[nneeded++] = args.aux; | |
368 | ||
f41c8091 UD |
369 | /* We must handle two situations here: the map is new, |
370 | so we must add it in all three lists. If the map | |
371 | is already known, we have two further possibilities: | |
372 | - if the object is before the current map in the | |
373 | search list, we do nothing. It is already found | |
374 | early | |
375 | - if the object is after the current one, we must | |
376 | move it just before the current map to make sure | |
377 | the symbols are found early enough | |
378 | */ | |
379 | if (args.aux->l_reserved) | |
1522c368 | 380 | { |
f41c8091 UD |
381 | /* The object is already somewhere in the list. |
382 | Locate it first. */ | |
383 | struct list *late; | |
384 | ||
385 | /* This object is already in the search list we | |
386 | are building. Don't add a duplicate pointer. | |
42c4f32a | 387 | Just added by _dl_map_object. */ |
23382b36 | 388 | for (late = newp; late->next != NULL; late = late->next) |
80d9c5f0 | 389 | if (late->next->map == args.aux) |
f41c8091 UD |
390 | break; |
391 | ||
23382b36 | 392 | if (late->next != NULL) |
1522c368 | 393 | { |
f41c8091 UD |
394 | /* The object is somewhere behind the current |
395 | position in the search path. We have to | |
396 | move it to this earlier position. */ | |
80d9c5f0 | 397 | orig->next = newp; |
f41c8091 | 398 | |
80d9c5f0 | 399 | /* Now remove the later entry from the list |
ee0f7bd6 | 400 | and adjust the tail pointer. */ |
80d9c5f0 UD |
401 | if (tail == late->next) |
402 | tail = late; | |
403 | late->next = late->next->next; | |
f41c8091 | 404 | |
ee0f7bd6 | 405 | /* We must move the object earlier in the chain. */ |
23382b36 | 406 | if (args.aux->l_prev != NULL) |
1522c368 | 407 | args.aux->l_prev->l_next = args.aux->l_next; |
23382b36 | 408 | if (args.aux->l_next != NULL) |
1522c368 UD |
409 | args.aux->l_next->l_prev = args.aux->l_prev; |
410 | ||
411 | args.aux->l_prev = newp->map->l_prev; | |
412 | newp->map->l_prev = args.aux; | |
413 | if (args.aux->l_prev != NULL) | |
414 | args.aux->l_prev->l_next = args.aux; | |
415 | args.aux->l_next = newp->map; | |
416 | } | |
f41c8091 UD |
417 | else |
418 | { | |
419 | /* The object must be somewhere earlier in the | |
23382b36 UD |
420 | list. Undo to the current list element what |
421 | we did above. */ | |
422 | memcpy (orig, newp, sizeof (*newp)); | |
423 | continue; | |
f41c8091 UD |
424 | } |
425 | } | |
426 | else | |
427 | { | |
428 | /* This is easy. We just add the symbol right here. */ | |
80d9c5f0 | 429 | orig->next = newp; |
f41c8091 UD |
430 | ++nlist; |
431 | /* Set the mark bit that says it's already in the list. */ | |
432 | args.aux->l_reserved = 1; | |
433 | ||
434 | /* The only problem is that in the double linked | |
435 | list of all objects we don't have this new | |
436 | object at the correct place. Correct this here. */ | |
437 | if (args.aux->l_prev) | |
438 | args.aux->l_prev->l_next = args.aux->l_next; | |
439 | if (args.aux->l_next) | |
440 | args.aux->l_next->l_prev = args.aux->l_prev; | |
441 | ||
442 | args.aux->l_prev = newp->map->l_prev; | |
443 | newp->map->l_prev = args.aux; | |
444 | if (args.aux->l_prev != NULL) | |
445 | args.aux->l_prev->l_next = args.aux; | |
446 | args.aux->l_next = newp->map; | |
447 | } | |
1522c368 | 448 | |
80d9c5f0 UD |
449 | /* Move the tail pointer if necessary. */ |
450 | if (orig == tail) | |
451 | tail = newp; | |
1522c368 | 452 | |
f41c8091 UD |
453 | /* Move on the insert point. */ |
454 | orig = newp; | |
efec1d0c RM |
455 | } |
456 | } | |
dacc8ffa UD |
457 | |
458 | /* Terminate the list of dependencies and store the array address. */ | |
459 | if (needed != NULL) | |
460 | { | |
461 | needed[nneeded++] = NULL; | |
462 | ||
385b4cf4 | 463 | struct link_map **l_initfini = (struct link_map **) |
aff4519d | 464 | malloc ((2 * nneeded + 1) * sizeof needed[0]); |
385b4cf4 | 465 | if (l_initfini == NULL) |
154d10bd UD |
466 | _dl_signal_error (ENOMEM, map->l_name, NULL, |
467 | N_("cannot allocate dependency list")); | |
385b4cf4 UD |
468 | l_initfini[0] = l; |
469 | memcpy (&l_initfini[1], needed, nneeded * sizeof needed[0]); | |
470 | memcpy (&l_initfini[nneeded + 1], l_initfini, | |
aff4519d | 471 | nneeded * sizeof needed[0]); |
385b4cf4 UD |
472 | atomic_write_barrier (); |
473 | l->l_initfini = l_initfini; | |
0479b305 | 474 | l->l_free_initfini = 1; |
dacc8ffa | 475 | } |
1522c368 UD |
476 | |
477 | /* If we have no auxiliary objects just go on to the next map. */ | |
478 | if (runp->done) | |
479 | do | |
80d9c5f0 | 480 | runp = runp->next; |
8193034b | 481 | while (runp != NULL && runp->done); |
efec1d0c RM |
482 | } |
483 | ||
c4bb124a | 484 | out: |
c77a4478 UD |
485 | if (errno == 0 && errno_saved != 0) |
486 | __set_errno (errno_saved); | |
487 | ||
385b4cf4 | 488 | struct link_map **old_l_initfini = NULL; |
752a2a50 UD |
489 | if (map->l_initfini != NULL && map->l_type == lt_loaded) |
490 | { | |
491 | /* This object was previously loaded as a dependency and we have | |
492 | a separate l_initfini list. We don't need it anymore. */ | |
493 | assert (map->l_searchlist.r_list == NULL); | |
385b4cf4 | 494 | old_l_initfini = map->l_initfini; |
752a2a50 UD |
495 | } |
496 | ||
f68b86cc RM |
497 | /* Store the search list we built in the object. It will be used for |
498 | searches in the scope of this object. */ | |
385b4cf4 | 499 | struct link_map **l_initfini = |
80d9c5f0 | 500 | (struct link_map **) malloc ((2 * nlist + 1) |
2e93b4a4 | 501 | * sizeof (struct link_map *)); |
385b4cf4 | 502 | if (l_initfini == NULL) |
154d10bd UD |
503 | _dl_signal_error (ENOMEM, map->l_name, NULL, |
504 | N_("cannot allocate symbol search list")); | |
2e93b4a4 UD |
505 | |
506 | ||
385b4cf4 | 507 | map->l_searchlist.r_list = &l_initfini[nlist + 1]; |
be935610 | 508 | map->l_searchlist.r_nlist = nlist; |
f68b86cc | 509 | |
80d9c5f0 | 510 | for (nlist = 0, runp = known; runp; runp = runp->next) |
f68b86cc | 511 | { |
c4bb124a | 512 | if (__builtin_expect (trace_mode, 0) && runp->map->l_faked) |
ad9570d7 UD |
513 | /* This can happen when we trace the loading. */ |
514 | --map->l_searchlist.r_nlist; | |
515 | else | |
516 | map->l_searchlist.r_list[nlist++] = runp->map; | |
f68b86cc RM |
517 | |
518 | /* Now clear all the mark bits we set in the objects on the search list | |
519 | to avoid duplicates, so the next call starts fresh. */ | |
1522c368 | 520 | runp->map->l_reserved = 0; |
f68b86cc | 521 | } |
84384f5b | 522 | |
1fc07491 | 523 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_PRELINK, 0) != 0 |
c0f62c56 | 524 | && map == GL(dl_ns)[LM_ID_BASE]._ns_loaded) |
32e6df36 UD |
525 | { |
526 | /* If we are to compute conflicts, we have to build local scope | |
527 | for each library, not just the ultimate loader. */ | |
528 | for (i = 0; i < nlist; ++i) | |
529 | { | |
530 | struct link_map *l = map->l_searchlist.r_list[i]; | |
531 | unsigned int j, cnt; | |
532 | ||
533 | /* The local scope has been already computed. */ | |
534 | if (l == map | |
535 | || (l->l_local_scope[0] | |
536 | && l->l_local_scope[0]->r_nlist) != 0) | |
537 | continue; | |
538 | ||
539 | if (l->l_info[AUXTAG] || l->l_info[FILTERTAG]) | |
540 | { | |
541 | /* As current DT_AUXILIARY/DT_FILTER implementation needs to be | |
542 | rewritten, no need to bother with prelinking the old | |
543 | implementation. */ | |
154d10bd | 544 | _dl_signal_error (EINVAL, l->l_name, NULL, N_("\ |
32e6df36 UD |
545 | Filters not supported with LD_TRACE_PRELINKING")); |
546 | } | |
547 | ||
385b4cf4 | 548 | cnt = _dl_build_local_scope (l_initfini, l); |
32e6df36 UD |
549 | assert (cnt <= nlist); |
550 | for (j = 0; j < cnt; j++) | |
4ad43b62 UD |
551 | { |
552 | l_initfini[j]->l_reserved = 0; | |
553 | if (j && __builtin_expect (l_initfini[j]->l_info[DT_SYMBOLIC] | |
554 | != NULL, 0)) | |
555 | l->l_symbolic_in_local_scope = true; | |
556 | } | |
32e6df36 UD |
557 | |
558 | l->l_local_scope[0] = | |
559 | (struct r_scope_elem *) malloc (sizeof (struct r_scope_elem) | |
560 | + (cnt | |
561 | * sizeof (struct link_map *))); | |
562 | if (l->l_local_scope[0] == NULL) | |
154d10bd UD |
563 | _dl_signal_error (ENOMEM, map->l_name, NULL, |
564 | N_("cannot allocate symbol search list")); | |
32e6df36 UD |
565 | l->l_local_scope[0]->r_nlist = cnt; |
566 | l->l_local_scope[0]->r_list = | |
567 | (struct link_map **) (l->l_local_scope[0] + 1); | |
385b4cf4 | 568 | memcpy (l->l_local_scope[0]->r_list, l_initfini, |
32e6df36 UD |
569 | cnt * sizeof (struct link_map *)); |
570 | } | |
571 | } | |
572 | ||
c4bb124a UD |
573 | /* Maybe we can remove some relocation dependencies now. */ |
574 | assert (map->l_searchlist.r_list[0] == map); | |
385b4cf4 UD |
575 | struct link_map_reldeps *l_reldeps = NULL; |
576 | if (map->l_reldeps != NULL) | |
c4bb124a | 577 | { |
385b4cf4 UD |
578 | for (i = 1; i < nlist; ++i) |
579 | map->l_searchlist.r_list[i]->l_reserved = 1; | |
c4bb124a | 580 | |
385b4cf4 UD |
581 | struct link_map **list = &map->l_reldeps->list[0]; |
582 | for (i = 0; i < map->l_reldeps->act; ++i) | |
583 | if (list[i]->l_reserved) | |
c4bb124a | 584 | { |
385b4cf4 | 585 | /* Need to allocate new array of relocation dependencies. */ |
385b4cf4 | 586 | l_reldeps = malloc (sizeof (*l_reldeps) |
968dad0a | 587 | + map->l_reldepsmax |
385b4cf4 UD |
588 | * sizeof (struct link_map *)); |
589 | if (l_reldeps == NULL) | |
590 | /* Bad luck, keep the reldeps duplicated between | |
591 | map->l_reldeps->list and map->l_initfini lists. */ | |
592 | ; | |
593 | else | |
594 | { | |
595 | unsigned int j = i; | |
596 | memcpy (&l_reldeps->list[0], &list[0], | |
597 | i * sizeof (struct link_map *)); | |
598 | for (i = i + 1; i < map->l_reldeps->act; ++i) | |
599 | if (!list[i]->l_reserved) | |
600 | l_reldeps->list[j++] = list[i]; | |
601 | l_reldeps->act = j; | |
602 | } | |
c4bb124a | 603 | } |
385b4cf4 UD |
604 | |
605 | for (i = 1; i < nlist; ++i) | |
606 | map->l_searchlist.r_list[i]->l_reserved = 0; | |
c4bb124a UD |
607 | } |
608 | ||
6b1e7d19 UD |
609 | /* Sort the initializer list to take dependencies into account. The binary |
610 | itself will always be initialize last. */ | |
385b4cf4 | 611 | memcpy (l_initfini, map->l_searchlist.r_list, |
2e93b4a4 | 612 | nlist * sizeof (struct link_map *)); |
a1ffb40e | 613 | if (__glibc_likely (nlist > 1)) |
dacc8ffa | 614 | { |
6b1e7d19 UD |
615 | /* We can skip looking for the binary itself which is at the front |
616 | of the search list. */ | |
617 | i = 1; | |
28363bbf | 618 | uint16_t seen[nlist]; |
e888bcbe | 619 | memset (seen, 0, nlist * sizeof (seen[0])); |
6b1e7d19 | 620 | while (1) |
dacc8ffa | 621 | { |
6b1e7d19 | 622 | /* Keep track of which object we looked at this round. */ |
16437fec | 623 | ++seen[i]; |
6b1e7d19 UD |
624 | struct link_map *thisp = l_initfini[i]; |
625 | ||
626 | /* Find the last object in the list for which the current one is | |
627 | a dependency and move the current object behind the object | |
628 | with the dependency. */ | |
629 | unsigned int k = nlist - 1; | |
630 | while (k > i) | |
631 | { | |
632 | struct link_map **runp = l_initfini[k]->l_initfini; | |
633 | if (runp != NULL) | |
634 | /* Look through the dependencies of the object. */ | |
635 | while (*runp != NULL) | |
a1ffb40e | 636 | if (__glibc_unlikely (*runp++ == thisp)) |
968dad0a | 637 | { |
6b1e7d19 UD |
638 | /* Move the current object to the back past the last |
639 | object with it as the dependency. */ | |
640 | memmove (&l_initfini[i], &l_initfini[i + 1], | |
641 | (k - i) * sizeof (l_initfini[0])); | |
642 | l_initfini[k] = thisp; | |
643 | ||
28363bbf | 644 | if (seen[i + 1] > nlist - i) |
6b1e7d19 UD |
645 | { |
646 | ++i; | |
647 | goto next_clear; | |
648 | } | |
649 | ||
28363bbf | 650 | uint16_t this_seen = seen[i]; |
6b1e7d19 UD |
651 | memmove (&seen[i], &seen[i + 1], |
652 | (k - i) * sizeof (seen[0])); | |
e888bcbe | 653 | seen[k] = this_seen; |
6b1e7d19 UD |
654 | |
655 | goto next; | |
968dad0a UD |
656 | } |
657 | ||
6b1e7d19 UD |
658 | --k; |
659 | } | |
968dad0a | 660 | |
6b1e7d19 UD |
661 | if (++i == nlist) |
662 | break; | |
663 | next_clear: | |
e888bcbe | 664 | memset (&seen[i], 0, (nlist - i) * sizeof (seen[0])); |
968dad0a | 665 | |
6b1e7d19 | 666 | next:; |
968dad0a | 667 | } |
dacc8ffa | 668 | } |
968dad0a | 669 | |
a8571d37 | 670 | /* Terminate the list of dependencies. */ |
385b4cf4 UD |
671 | l_initfini[nlist] = NULL; |
672 | atomic_write_barrier (); | |
673 | map->l_initfini = l_initfini; | |
0479b305 | 674 | map->l_free_initfini = 1; |
385b4cf4 UD |
675 | if (l_reldeps != NULL) |
676 | { | |
677 | atomic_write_barrier (); | |
678 | void *old_l_reldeps = map->l_reldeps; | |
679 | map->l_reldeps = l_reldeps; | |
680 | _dl_scope_free (old_l_reldeps); | |
681 | } | |
682 | if (old_l_initfini != NULL) | |
0479b305 | 683 | _dl_scope_free (old_l_initfini); |
f55ffe58 AS |
684 | |
685 | if (errno_reason) | |
686 | _dl_signal_error (errno_reason == -1 ? 0 : errno_reason, objname, | |
687 | NULL, errstring); | |
efec1d0c | 688 | } |