]>
Commit | Line | Data |
---|---|---|
0a54e401 | 1 | /* Map in a shared object's segments from the file. |
568035b7 | 2 | Copyright (C) 1995-2013 Free Software Foundation, Inc. |
afd4eb37 | 3 | This file is part of the GNU C Library. |
d66e34cd | 4 | |
afd4eb37 | 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. | |
d66e34cd | 9 | |
afd4eb37 UD |
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. |
d66e34cd | 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/>. */ | |
d66e34cd | 18 | |
14e9dd67 | 19 | #include <elf.h> |
0a54e401 UD |
20 | #include <errno.h> |
21 | #include <fcntl.h> | |
8e17ea58 | 22 | #include <libintl.h> |
379d4ec4 | 23 | #include <stdbool.h> |
0a54e401 | 24 | #include <stdlib.h> |
d66e34cd | 25 | #include <string.h> |
d66e34cd | 26 | #include <unistd.h> |
a42195db | 27 | #include <ldsodefs.h> |
ca97fb53 | 28 | #include <bits/wordsize.h> |
0a54e401 | 29 | #include <sys/mman.h> |
f8f7e090 | 30 | #include <sys/param.h> |
0a54e401 UD |
31 | #include <sys/stat.h> |
32 | #include <sys/types.h> | |
d66e34cd | 33 | #include "dynamic-link.h" |
a986484f | 34 | #include <abi-tag.h> |
664e7d93 | 35 | #include <stackinfo.h> |
703ccc12 | 36 | #include <caller.h> |
606832e6 | 37 | #include <sysdep.h> |
815e6fa3 | 38 | #include <stap-probe.h> |
d66e34cd | 39 | |
dc5efe83 | 40 | #include <dl-dst.h> |
d66e34cd | 41 | |
9b8a44cd RM |
42 | /* On some systems, no flag bits are given to specify file mapping. */ |
43 | #ifndef MAP_FILE | |
fcf70d41 | 44 | # define MAP_FILE 0 |
9b8a44cd RM |
45 | #endif |
46 | ||
47 | /* The right way to map in the shared library files is MAP_COPY, which | |
48 | makes a virtual copy of the data at the time of the mmap call; this | |
49 | guarantees the mapped pages will be consistent even if the file is | |
50 | overwritten. Some losing VM systems like Linux's lack MAP_COPY. All we | |
51 | get is MAP_PRIVATE, which copies each page when it is modified; this | |
52 | means if the file is overwritten, we may at some point get some pages | |
a3fcd5e8 | 53 | from the new version after starting with pages from the old version. |
a334319f | 54 | |
a3fcd5e8 RM |
55 | To make up for the lack and avoid the overwriting problem, |
56 | what Linux does have is MAP_DENYWRITE. This prevents anyone | |
57 | from modifying the file while we have it mapped. */ | |
58 | #ifndef MAP_COPY | |
59 | # ifdef MAP_DENYWRITE | |
60 | # define MAP_COPY (MAP_PRIVATE | MAP_DENYWRITE) | |
61 | # else | |
62 | # define MAP_COPY MAP_PRIVATE | |
63 | # endif | |
b34cbd14 RM |
64 | #endif |
65 | ||
f21acc89 UD |
66 | /* Some systems link their relocatable objects for another base address |
67 | than 0. We want to know the base address for these such that we can | |
68 | subtract this address from the segment addresses during mapping. | |
69 | This results in a more efficient address space usage. Defaults to | |
70 | zero for almost all systems. */ | |
71 | #ifndef MAP_BASE_ADDR | |
fcf70d41 | 72 | # define MAP_BASE_ADDR(l) 0 |
f21acc89 UD |
73 | #endif |
74 | ||
9b8a44cd | 75 | |
d66e34cd RM |
76 | #include <endian.h> |
77 | #if BYTE_ORDER == BIG_ENDIAN | |
fcf70d41 | 78 | # define byteorder ELFDATA2MSB |
d66e34cd | 79 | #elif BYTE_ORDER == LITTLE_ENDIAN |
fcf70d41 | 80 | # define byteorder ELFDATA2LSB |
d66e34cd | 81 | #else |
fcf70d41 UD |
82 | # error "Unknown BYTE_ORDER " BYTE_ORDER |
83 | # define byteorder ELFDATANONE | |
d66e34cd RM |
84 | #endif |
85 | ||
14e9dd67 | 86 | #define STRING(x) __STRING (x) |
d66e34cd | 87 | |
4cca6b86 UD |
88 | /* Handle situations where we have a preferred location in memory for |
89 | the shared objects. */ | |
90 | #ifdef ELF_PREFERRED_ADDRESS_DATA | |
91 | ELF_PREFERRED_ADDRESS_DATA; | |
92 | #endif | |
93 | #ifndef ELF_PREFERRED_ADDRESS | |
fcf70d41 | 94 | # define ELF_PREFERRED_ADDRESS(loader, maplength, mapstartpref) (mapstartpref) |
4cca6b86 UD |
95 | #endif |
96 | #ifndef ELF_FIXED_ADDRESS | |
fcf70d41 | 97 | # define ELF_FIXED_ADDRESS(loader, mapstart) ((void) 0) |
4cca6b86 UD |
98 | #endif |
99 | ||
dcca3fe2 | 100 | |
664e7d93 | 101 | int __stack_prot attribute_hidden attribute_relro |
44828b9d | 102 | #if _STACK_GROWS_DOWN && defined PROT_GROWSDOWN |
ecc1d0c3 | 103 | = PROT_GROWSDOWN; |
44828b9d | 104 | #elif _STACK_GROWS_UP && defined PROT_GROWSUP |
ecc1d0c3 | 105 | = PROT_GROWSUP; |
f8286ce6 RM |
106 | #else |
107 | = 0; | |
664e7d93 UD |
108 | #endif |
109 | ||
dcca3fe2 | 110 | |
a35e137a UD |
111 | /* Type for the buffer we put the ELF header and hopefully the program |
112 | header. This buffer does not really have to be too large. In most | |
113 | cases the program header follows the ELF header directly. If this | |
6fffb9a2 UD |
114 | is not the case all bets are off and we can make the header |
115 | arbitrarily large and still won't get it read. This means the only | |
116 | question is how large are the ELF and program header combined. The | |
117 | ELF header 32-bit files is 52 bytes long and in 64-bit files is 64 | |
118 | bytes long. Each program header entry is again 32 and 56 bytes | |
23e2554f UD |
119 | long respectively. I.e., even with a file which has 10 program |
120 | header entries we only have to read 372B/624B respectively. Add to | |
121 | this a bit of margin for program notes and reading 512B and 832B | |
122 | for 32-bit and 64-bit files respecitvely is enough. If this | |
123 | heuristic should really fail for some file the code in | |
124 | `_dl_map_object_from_fd' knows how to recover. */ | |
a35e137a UD |
125 | struct filebuf |
126 | { | |
127 | ssize_t len; | |
868b9d6a | 128 | #if __WORDSIZE == 32 |
ca97fb53 UD |
129 | # define FILEBUF_SIZE 512 |
130 | #else | |
23e2554f | 131 | # define FILEBUF_SIZE 832 |
ca97fb53 | 132 | #endif |
6fffb9a2 | 133 | char buf[FILEBUF_SIZE] __attribute__ ((aligned (__alignof (ElfW(Ehdr))))); |
a35e137a UD |
134 | }; |
135 | ||
7ef90c15 | 136 | /* This is the decomposed LD_LIBRARY_PATH search path. */ |
392a6b52 | 137 | static struct r_search_path_struct env_path_list attribute_relro; |
40a55d20 | 138 | |
12264bd7 | 139 | /* List of the hardware capabilities we might end up using. */ |
392a6b52 UD |
140 | static const struct r_strlenpair *capstr attribute_relro; |
141 | static size_t ncapstr attribute_relro; | |
142 | static size_t max_capstrlen attribute_relro; | |
12264bd7 | 143 | |
40a55d20 | 144 | |
ab7eb292 UD |
145 | /* Get the generated information about the trusted directories. */ |
146 | #include "trusted-dirs.h" | |
147 | ||
148 | static const char system_dirs[] = SYSTEM_DIRS; | |
149 | static const size_t system_dirs_len[] = | |
150 | { | |
151 | SYSTEM_DIRS_LEN | |
152 | }; | |
4a6d1198 UD |
153 | #define nsystem_dirs_len \ |
154 | (sizeof (system_dirs_len) / sizeof (system_dirs_len[0])) | |
ab7eb292 | 155 | |
32c85e43 | 156 | |
706074a5 | 157 | /* Local version of `strdup' function. */ |
ff0bf753 | 158 | static char * |
706074a5 UD |
159 | local_strdup (const char *s) |
160 | { | |
161 | size_t len = strlen (s) + 1; | |
162 | void *new = malloc (len); | |
163 | ||
164 | if (new == NULL) | |
165 | return NULL; | |
166 | ||
167 | return (char *) memcpy (new, s, len); | |
168 | } | |
169 | ||
dc5efe83 | 170 | |
47c3cd7a UD |
171 | static bool |
172 | is_trusted_path (const char *path, size_t len) | |
173 | { | |
47c3cd7a UD |
174 | const char *trun = system_dirs; |
175 | ||
176 | for (size_t idx = 0; idx < nsystem_dirs_len; ++idx) | |
177 | { | |
178 | if (len == system_dirs_len[idx] && memcmp (trun, path, len) == 0) | |
179 | /* Found it. */ | |
180 | return true; | |
181 | ||
182 | trun += system_dirs_len[idx] + 1; | |
183 | } | |
184 | ||
185 | return false; | |
186 | } | |
187 | ||
188 | ||
189 | static bool | |
190 | is_trusted_path_normalize (const char *path, size_t len) | |
191 | { | |
22836f52 UD |
192 | if (len == 0) |
193 | return false; | |
194 | ||
195 | if (*path == ':') | |
196 | { | |
197 | ++path; | |
198 | --len; | |
199 | } | |
200 | ||
47c3cd7a UD |
201 | char *npath = (char *) alloca (len + 2); |
202 | char *wnp = npath; | |
47c3cd7a UD |
203 | while (*path != '\0') |
204 | { | |
205 | if (path[0] == '/') | |
206 | { | |
207 | if (path[1] == '.') | |
208 | { | |
209 | if (path[2] == '.' && (path[3] == '/' || path[3] == '\0')) | |
210 | { | |
211 | while (wnp > npath && *--wnp != '/') | |
212 | ; | |
213 | path += 3; | |
214 | continue; | |
215 | } | |
216 | else if (path[2] == '/' || path[2] == '\0') | |
217 | { | |
218 | path += 2; | |
219 | continue; | |
220 | } | |
221 | } | |
222 | ||
223 | if (wnp > npath && wnp[-1] == '/') | |
224 | { | |
225 | ++path; | |
226 | continue; | |
227 | } | |
228 | } | |
229 | ||
230 | *wnp++ = *path++; | |
231 | } | |
22836f52 UD |
232 | |
233 | if (wnp == npath || wnp[-1] != '/') | |
47c3cd7a | 234 | *wnp++ = '/'; |
47c3cd7a | 235 | |
22836f52 UD |
236 | const char *trun = system_dirs; |
237 | ||
238 | for (size_t idx = 0; idx < nsystem_dirs_len; ++idx) | |
239 | { | |
240 | if (wnp - npath >= system_dirs_len[idx] | |
241 | && memcmp (trun, npath, system_dirs_len[idx]) == 0) | |
242 | /* Found it. */ | |
243 | return true; | |
244 | ||
245 | trun += system_dirs_len[idx] + 1; | |
246 | } | |
247 | ||
248 | return false; | |
47c3cd7a UD |
249 | } |
250 | ||
251 | ||
6d5d3ae3 | 252 | static size_t |
379d4ec4 | 253 | is_dst (const char *start, const char *name, const char *str, |
d43c8c5f | 254 | int is_path, int secure) |
6d5d3ae3 UD |
255 | { |
256 | size_t len; | |
379d4ec4 | 257 | bool is_curly = false; |
6d5d3ae3 | 258 | |
379d4ec4 UD |
259 | if (name[0] == '{') |
260 | { | |
261 | is_curly = true; | |
262 | ++name; | |
263 | } | |
264 | ||
265 | len = 0; | |
266 | while (name[len] == str[len] && name[len] != '\0') | |
267 | ++len; | |
268 | ||
269 | if (is_curly) | |
270 | { | |
271 | if (name[len] != '}') | |
272 | return 0; | |
273 | ||
274 | /* Point again at the beginning of the name. */ | |
275 | --name; | |
276 | /* Skip over closing curly brace and adjust for the --name. */ | |
277 | len += 2; | |
278 | } | |
279 | else if (name[len] != '\0' && name[len] != '/' | |
280 | && (!is_path || name[len] != ':')) | |
6d5d3ae3 UD |
281 | return 0; |
282 | ||
283 | if (__builtin_expect (secure, 0) | |
22836f52 UD |
284 | && ((name[len] != '\0' && name[len] != '/' |
285 | && (!is_path || name[len] != ':')) | |
6d5d3ae3 UD |
286 | || (name != start + 1 && (!is_path || name[-2] != ':')))) |
287 | return 0; | |
288 | ||
289 | return len; | |
290 | } | |
291 | ||
292 | ||
dc5efe83 UD |
293 | size_t |
294 | _dl_dst_count (const char *name, int is_path) | |
f787edde | 295 | { |
2864e767 | 296 | const char *const start = name; |
f787edde | 297 | size_t cnt = 0; |
f787edde | 298 | |
dc5efe83 | 299 | do |
f787edde | 300 | { |
379d4ec4 | 301 | size_t len; |
f787edde | 302 | |
32463b1a | 303 | /* $ORIGIN is not expanded for SUID/GUID programs (except if it |
379d4ec4 UD |
304 | is $ORIGIN alone) and it must always appear first in path. */ |
305 | ++name; | |
306 | if ((len = is_dst (start, name, "ORIGIN", is_path, | |
e6caf4e1 | 307 | INTUSE(__libc_enable_secure))) != 0 |
27af5372 RM |
308 | || (len = is_dst (start, name, "PLATFORM", is_path, 0)) != 0 |
309 | || (len = is_dst (start, name, "LIB", is_path, 0)) != 0) | |
f787edde UD |
310 | ++cnt; |
311 | ||
dc5efe83 | 312 | name = strchr (name + len, '$'); |
f787edde | 313 | } |
dc5efe83 | 314 | while (name != NULL); |
f787edde | 315 | |
dc5efe83 UD |
316 | return cnt; |
317 | } | |
f787edde | 318 | |
f787edde | 319 | |
dc5efe83 UD |
320 | char * |
321 | _dl_dst_substitute (struct link_map *l, const char *name, char *result, | |
322 | int is_path) | |
323 | { | |
2864e767 | 324 | const char *const start = name; |
f787edde UD |
325 | |
326 | /* Now fill the result path. While copying over the string we keep | |
c0c3f78a | 327 | track of the start of the last path element. When we come across |
f787edde UD |
328 | a DST we copy over the value or (if the value is not available) |
329 | leave the entire path element out. */ | |
47c3cd7a UD |
330 | char *wp = result; |
331 | char *last_elem = result; | |
332 | bool check_for_trusted = false; | |
dc5efe83 | 333 | |
f787edde UD |
334 | do |
335 | { | |
39b3385d | 336 | if (__builtin_expect (*name == '$', 0)) |
f787edde | 337 | { |
2541eda0 | 338 | const char *repl = NULL; |
379d4ec4 | 339 | size_t len; |
2541eda0 | 340 | |
379d4ec4 UD |
341 | ++name; |
342 | if ((len = is_dst (start, name, "ORIGIN", is_path, | |
e6caf4e1 | 343 | INTUSE(__libc_enable_secure))) != 0) |
e7c8359e | 344 | { |
f91f1c0f | 345 | repl = l->l_origin; |
47c3cd7a UD |
346 | check_for_trusted = (INTUSE(__libc_enable_secure) |
347 | && l->l_type == lt_executable); | |
e7c8359e | 348 | } |
27af5372 | 349 | else if ((len = is_dst (start, name, "PLATFORM", is_path, 0)) != 0) |
afdca0f2 | 350 | repl = GLRO(dl_platform); |
27af5372 RM |
351 | else if ((len = is_dst (start, name, "LIB", is_path, 0)) != 0) |
352 | repl = DL_DST_LIB; | |
2541eda0 | 353 | |
2541eda0 UD |
354 | if (repl != NULL && repl != (const char *) -1) |
355 | { | |
356 | wp = __stpcpy (wp, repl); | |
357 | name += len; | |
358 | } | |
359 | else if (len > 1) | |
f787edde | 360 | { |
2541eda0 UD |
361 | /* We cannot use this path element, the value of the |
362 | replacement is unknown. */ | |
363 | wp = last_elem; | |
364 | name += len; | |
365 | while (*name != '\0' && (!is_path || *name != ':')) | |
366 | ++name; | |
34fe483e AS |
367 | /* Also skip following colon if this is the first rpath |
368 | element, but keep an empty element at the end. */ | |
369 | if (wp == result && is_path && *name == ':' && name[1] != '\0') | |
370 | ++name; | |
f787edde UD |
371 | } |
372 | else | |
27aa0631 | 373 | /* No DST we recognize. */ |
379d4ec4 | 374 | *wp++ = '$'; |
f787edde | 375 | } |
2541eda0 | 376 | else |
f787edde | 377 | { |
dc5efe83 | 378 | *wp++ = *name++; |
2541eda0 | 379 | if (is_path && *name == ':') |
47c3cd7a UD |
380 | { |
381 | /* In SUID/SGID programs, after $ORIGIN expansion the | |
382 | normalized path must be rooted in one of the trusted | |
383 | directories. */ | |
384 | if (__builtin_expect (check_for_trusted, false) | |
22836f52 UD |
385 | && !is_trusted_path_normalize (last_elem, wp - last_elem)) |
386 | wp = last_elem; | |
47c3cd7a UD |
387 | else |
388 | last_elem = wp; | |
22836f52 UD |
389 | |
390 | check_for_trusted = false; | |
47c3cd7a | 391 | } |
f787edde | 392 | } |
f787edde | 393 | } |
dc5efe83 | 394 | while (*name != '\0'); |
f787edde | 395 | |
47c3cd7a UD |
396 | /* In SUID/SGID programs, after $ORIGIN expansion the normalized |
397 | path must be rooted in one of the trusted directories. */ | |
398 | if (__builtin_expect (check_for_trusted, false) | |
22836f52 | 399 | && !is_trusted_path_normalize (last_elem, wp - last_elem)) |
47c3cd7a UD |
400 | wp = last_elem; |
401 | ||
f787edde UD |
402 | *wp = '\0'; |
403 | ||
404 | return result; | |
405 | } | |
406 | ||
dc5efe83 UD |
407 | |
408 | /* Return copy of argument with all recognized dynamic string tokens | |
409 | ($ORIGIN and $PLATFORM for now) replaced. On some platforms it | |
410 | might not be possible to determine the path from which the object | |
411 | belonging to the map is loaded. In this case the path element | |
412 | containing $ORIGIN is left out. */ | |
413 | static char * | |
34fe483e | 414 | expand_dynamic_string_token (struct link_map *l, const char *s, int is_path) |
dc5efe83 UD |
415 | { |
416 | /* We make two runs over the string. First we determine how large the | |
844c394a | 417 | resulting string is and then we copy it over. Since this is no |
dc5efe83 UD |
418 | frequently executed operation we are looking here not for performance |
419 | but rather for code size. */ | |
420 | size_t cnt; | |
421 | size_t total; | |
422 | char *result; | |
423 | ||
2864e767 | 424 | /* Determine the number of DST elements. */ |
34fe483e | 425 | cnt = DL_DST_COUNT (s, is_path); |
dc5efe83 UD |
426 | |
427 | /* If we do not have to replace anything simply copy the string. */ | |
55c91021 | 428 | if (__builtin_expect (cnt, 0) == 0) |
dc5efe83 UD |
429 | return local_strdup (s); |
430 | ||
431 | /* Determine the length of the substituted string. */ | |
432 | total = DL_DST_REQUIRED (l, s, strlen (s), cnt); | |
433 | ||
434 | /* Allocate the necessary memory. */ | |
435 | result = (char *) malloc (total + 1); | |
436 | if (result == NULL) | |
437 | return NULL; | |
438 | ||
34fe483e | 439 | return _dl_dst_substitute (l, s, result, is_path); |
dc5efe83 UD |
440 | } |
441 | ||
442 | ||
0413b54c UD |
443 | /* Add `name' to the list of names for a particular shared object. |
444 | `name' is expected to have been allocated with malloc and will | |
445 | be freed if the shared object already has this name. | |
446 | Returns false if the object already had this name. */ | |
76156ea1 | 447 | static void |
12264bd7 | 448 | internal_function |
76156ea1 | 449 | add_name_to_object (struct link_map *l, const char *name) |
0a54e401 | 450 | { |
0413b54c UD |
451 | struct libname_list *lnp, *lastp; |
452 | struct libname_list *newname; | |
76156ea1 | 453 | size_t name_len; |
0413b54c UD |
454 | |
455 | lastp = NULL; | |
456 | for (lnp = l->l_libname; lnp != NULL; lastp = lnp, lnp = lnp->next) | |
457 | if (strcmp (name, lnp->name) == 0) | |
76156ea1 | 458 | return; |
0413b54c | 459 | |
76156ea1 | 460 | name_len = strlen (name) + 1; |
839be784 | 461 | newname = (struct libname_list *) malloc (sizeof *newname + name_len); |
0413b54c | 462 | if (newname == NULL) |
da832465 UD |
463 | { |
464 | /* No more memory. */ | |
154d10bd | 465 | _dl_signal_error (ENOMEM, name, NULL, N_("cannot allocate name record")); |
76156ea1 | 466 | return; |
da832465 | 467 | } |
0413b54c UD |
468 | /* The object should have a libname set from _dl_new_object. */ |
469 | assert (lastp != NULL); | |
470 | ||
76156ea1 | 471 | newname->name = memcpy (newname + 1, name, name_len); |
0413b54c | 472 | newname->next = NULL; |
752a2a50 | 473 | newname->dont_free = 0; |
0413b54c | 474 | lastp->next = newname; |
0413b54c UD |
475 | } |
476 | ||
12264bd7 | 477 | /* Standard search directories. */ |
392a6b52 | 478 | static struct r_search_path_struct rtld_search_dirs attribute_relro; |
0a54e401 | 479 | |
a658675d | 480 | static size_t max_dirnamelen; |
0a54e401 | 481 | |
dd9423a6 | 482 | static struct r_search_path_elem ** |
0a54e401 | 483 | fillin_rpath (char *rpath, struct r_search_path_elem **result, const char *sep, |
2a939a7e OB |
484 | int check_trusted, const char *what, const char *where, |
485 | struct link_map *l) | |
0a54e401 UD |
486 | { |
487 | char *cp; | |
488 | size_t nelems = 0; | |
2a939a7e | 489 | char *to_free; |
0a54e401 UD |
490 | |
491 | while ((cp = __strsep (&rpath, sep)) != NULL) | |
492 | { | |
493 | struct r_search_path_elem *dirp; | |
2a939a7e OB |
494 | |
495 | to_free = cp = expand_dynamic_string_token (l, cp, 1); | |
496 | ||
0a54e401 | 497 | size_t len = strlen (cp); |
12264bd7 | 498 | |
af3878df | 499 | /* `strsep' can pass an empty string. This has to be |
844c394a | 500 | interpreted as `use the current directory'. */ |
12264bd7 | 501 | if (len == 0) |
af3878df | 502 | { |
ab7eb292 UD |
503 | static const char curwd[] = "./"; |
504 | cp = (char *) curwd; | |
af3878df | 505 | } |
12264bd7 | 506 | |
143e2b96 | 507 | /* Remove trailing slashes (except for "/"). */ |
0a54e401 UD |
508 | while (len > 1 && cp[len - 1] == '/') |
509 | --len; | |
510 | ||
ab7eb292 UD |
511 | /* Now add one if there is none so far. */ |
512 | if (len > 0 && cp[len - 1] != '/') | |
513 | cp[len++] = '/'; | |
514 | ||
07ba7349 | 515 | /* Make sure we don't use untrusted directories if we run SUID. */ |
47c3cd7a | 516 | if (__builtin_expect (check_trusted, 0) && !is_trusted_path (cp, len)) |
2a939a7e OB |
517 | { |
518 | free (to_free); | |
519 | continue; | |
520 | } | |
07ba7349 | 521 | |
0a54e401 | 522 | /* See if this directory is already known. */ |
d6b5d570 | 523 | for (dirp = GL(dl_all_dirs); dirp != NULL; dirp = dirp->next) |
12264bd7 | 524 | if (dirp->dirnamelen == len && memcmp (cp, dirp->dirname, len) == 0) |
0a54e401 UD |
525 | break; |
526 | ||
527 | if (dirp != NULL) | |
528 | { | |
12264bd7 | 529 | /* It is available, see whether it's on our own list. */ |
0a54e401 UD |
530 | size_t cnt; |
531 | for (cnt = 0; cnt < nelems; ++cnt) | |
532 | if (result[cnt] == dirp) | |
533 | break; | |
534 | ||
535 | if (cnt == nelems) | |
536 | result[nelems++] = dirp; | |
537 | } | |
538 | else | |
539 | { | |
12264bd7 | 540 | size_t cnt; |
839be784 | 541 | enum r_dir_status init_val; |
4a6d1198 | 542 | size_t where_len = where ? strlen (where) + 1 : 0; |
12264bd7 | 543 | |
0a54e401 | 544 | /* It's a new directory. Create an entry and add it. */ |
12264bd7 | 545 | dirp = (struct r_search_path_elem *) |
32ee8d95 | 546 | malloc (sizeof (*dirp) + ncapstr * sizeof (enum r_dir_status) |
f55727ca | 547 | + where_len + len + 1); |
0a54e401 | 548 | if (dirp == NULL) |
154d10bd UD |
549 | _dl_signal_error (ENOMEM, NULL, NULL, |
550 | N_("cannot create cache for search path")); | |
0a54e401 | 551 | |
f55727ca UD |
552 | dirp->dirname = ((char *) dirp + sizeof (*dirp) |
553 | + ncapstr * sizeof (enum r_dir_status)); | |
104d0bd3 | 554 | *((char *) __mempcpy ((char *) dirp->dirname, cp, len)) = '\0'; |
0a54e401 | 555 | dirp->dirnamelen = len; |
12264bd7 UD |
556 | |
557 | if (len > max_dirnamelen) | |
558 | max_dirnamelen = len; | |
559 | ||
07ba7349 UD |
560 | /* We have to make sure all the relative directories are |
561 | never ignored. The current directory might change and | |
562 | all our saved information would be void. */ | |
563 | init_val = cp[0] != '/' ? existing : unknown; | |
839be784 UD |
564 | for (cnt = 0; cnt < ncapstr; ++cnt) |
565 | dirp->status[cnt] = init_val; | |
0a54e401 | 566 | |
b5efde2f | 567 | dirp->what = what; |
4a6d1198 | 568 | if (__builtin_expect (where != NULL, 1)) |
f55727ca | 569 | dirp->where = memcpy ((char *) dirp + sizeof (*dirp) + len + 1 |
d6b5d570 | 570 | + (ncapstr * sizeof (enum r_dir_status)), |
4a6d1198 UD |
571 | where, where_len); |
572 | else | |
573 | dirp->where = NULL; | |
b5efde2f | 574 | |
d6b5d570 UD |
575 | dirp->next = GL(dl_all_dirs); |
576 | GL(dl_all_dirs) = dirp; | |
0a54e401 UD |
577 | |
578 | /* Put it in the result array. */ | |
579 | result[nelems++] = dirp; | |
580 | } | |
2a939a7e | 581 | free (to_free); |
0a54e401 UD |
582 | } |
583 | ||
584 | /* Terminate the array. */ | |
585 | result[nelems] = NULL; | |
586 | ||
587 | return result; | |
588 | } | |
589 | ||
590 | ||
2692deea | 591 | static bool |
12264bd7 | 592 | internal_function |
f55727ca UD |
593 | decompose_rpath (struct r_search_path_struct *sps, |
594 | const char *rpath, struct link_map *l, const char *what) | |
0a54e401 UD |
595 | { |
596 | /* Make a copy we can work with. */ | |
f787edde | 597 | const char *where = l->l_name; |
310930c1 | 598 | char *copy; |
0a54e401 UD |
599 | char *cp; |
600 | struct r_search_path_elem **result; | |
310930c1 | 601 | size_t nelems; |
39b3385d UD |
602 | /* Initialize to please the compiler. */ |
603 | const char *errstring = NULL; | |
310930c1 | 604 | |
fcf70d41 UD |
605 | /* First see whether we must forget the RUNPATH and RPATH from this |
606 | object. */ | |
afdca0f2 | 607 | if (__builtin_expect (GLRO(dl_inhibit_rpath) != NULL, 0) |
e6caf4e1 | 608 | && !INTUSE(__libc_enable_secure)) |
310930c1 | 609 | { |
afdca0f2 | 610 | const char *inhp = GLRO(dl_inhibit_rpath); |
9710f75d UD |
611 | |
612 | do | |
310930c1 | 613 | { |
9710f75d UD |
614 | const char *wp = where; |
615 | ||
616 | while (*inhp == *wp && *wp != '\0') | |
617 | { | |
618 | ++inhp; | |
619 | ++wp; | |
620 | } | |
621 | ||
622 | if (*wp == '\0' && (*inhp == '\0' || *inhp == ':')) | |
310930c1 | 623 | { |
fcf70d41 UD |
624 | /* This object is on the list of objects for which the |
625 | RUNPATH and RPATH must not be used. */ | |
2692deea UD |
626 | sps->dirs = (void *) -1; |
627 | return false; | |
310930c1 | 628 | } |
9710f75d UD |
629 | |
630 | while (*inhp != '\0') | |
631 | if (*inhp++ == ':') | |
632 | break; | |
310930c1 | 633 | } |
9710f75d | 634 | while (*inhp != '\0'); |
310930c1 | 635 | } |
0a54e401 | 636 | |
2a939a7e OB |
637 | /* Make a writable copy. */ |
638 | copy = local_strdup (rpath); | |
f787edde | 639 | if (copy == NULL) |
39b3385d UD |
640 | { |
641 | errstring = N_("cannot create RUNPATH/RPATH copy"); | |
642 | goto signal_error; | |
643 | } | |
f787edde | 644 | |
34fe483e AS |
645 | /* Ignore empty rpaths. */ |
646 | if (*copy == 0) | |
647 | { | |
648 | free (copy); | |
22836f52 | 649 | sps->dirs = (struct r_search_path_elem **) -1; |
34fe483e AS |
650 | return false; |
651 | } | |
652 | ||
310930c1 | 653 | /* Count the number of necessary elements in the result array. */ |
310930c1 | 654 | nelems = 0; |
0a54e401 UD |
655 | for (cp = copy; *cp != '\0'; ++cp) |
656 | if (*cp == ':') | |
657 | ++nelems; | |
658 | ||
7ef90c15 UD |
659 | /* Allocate room for the result. NELEMS + 1 is an upper limit for the |
660 | number of necessary entries. */ | |
661 | result = (struct r_search_path_elem **) malloc ((nelems + 1 + 1) | |
0a54e401 UD |
662 | * sizeof (*result)); |
663 | if (result == NULL) | |
2692deea | 664 | { |
ce31a3b1 | 665 | free (copy); |
2692deea UD |
666 | errstring = N_("cannot create cache for search path"); |
667 | signal_error: | |
668 | _dl_signal_error (ENOMEM, NULL, NULL, errstring); | |
669 | } | |
0a54e401 | 670 | |
2a939a7e | 671 | fillin_rpath (copy, result, ":", 0, what, where, l); |
f55727ca UD |
672 | |
673 | /* Free the copied RPATH string. `fillin_rpath' make own copies if | |
674 | necessary. */ | |
675 | free (copy); | |
676 | ||
677 | sps->dirs = result; | |
678 | /* The caller will change this value if we haven't used a real malloc. */ | |
679 | sps->malloced = 1; | |
2692deea | 680 | return true; |
0a54e401 UD |
681 | } |
682 | ||
45e4762c RM |
683 | /* Make sure cached path information is stored in *SP |
684 | and return true if there are any paths to search there. */ | |
25337753 | 685 | static bool |
45e4762c RM |
686 | cache_rpath (struct link_map *l, |
687 | struct r_search_path_struct *sp, | |
688 | int tag, | |
689 | const char *what) | |
690 | { | |
691 | if (sp->dirs == (void *) -1) | |
692 | return false; | |
693 | ||
694 | if (sp->dirs != NULL) | |
695 | return true; | |
696 | ||
697 | if (l->l_info[tag] == NULL) | |
698 | { | |
699 | /* There is no path. */ | |
700 | sp->dirs = (void *) -1; | |
701 | return false; | |
702 | } | |
703 | ||
704 | /* Make sure the cache information is available. */ | |
2692deea UD |
705 | return decompose_rpath (sp, (const char *) (D_PTR (l, l_info[DT_STRTAB]) |
706 | + l->l_info[tag]->d_un.d_val), | |
707 | l, what); | |
45e4762c RM |
708 | } |
709 | ||
0a54e401 UD |
710 | |
711 | void | |
d0fc4041 | 712 | internal_function |
880f421f | 713 | _dl_init_paths (const char *llp) |
0a54e401 | 714 | { |
ab7eb292 UD |
715 | size_t idx; |
716 | const char *strp; | |
12264bd7 UD |
717 | struct r_search_path_elem *pelem, **aelem; |
718 | size_t round_size; | |
2a939a7e | 719 | struct link_map __attribute__ ((unused)) *l = NULL; |
39b3385d UD |
720 | /* Initialize to please the compiler. */ |
721 | const char *errstring = NULL; | |
0a54e401 | 722 | |
7ef90c15 UD |
723 | /* Fill in the information about the application's RPATH and the |
724 | directories addressed by the LD_LIBRARY_PATH environment variable. */ | |
0a54e401 | 725 | |
4317f9e1 | 726 | /* Get the capabilities. */ |
afdca0f2 | 727 | capstr = _dl_important_hwcaps (GLRO(dl_platform), GLRO(dl_platformlen), |
12264bd7 UD |
728 | &ncapstr, &max_capstrlen); |
729 | ||
730 | /* First set up the rest of the default search directory entries. */ | |
f55727ca | 731 | aelem = rtld_search_dirs.dirs = (struct r_search_path_elem **) |
4a6d1198 | 732 | malloc ((nsystem_dirs_len + 1) * sizeof (struct r_search_path_elem *)); |
f55727ca | 733 | if (rtld_search_dirs.dirs == NULL) |
39b3385d UD |
734 | { |
735 | errstring = N_("cannot create search path array"); | |
736 | signal_error: | |
154d10bd | 737 | _dl_signal_error (ENOMEM, NULL, NULL, errstring); |
39b3385d | 738 | } |
12264bd7 UD |
739 | |
740 | round_size = ((2 * sizeof (struct r_search_path_elem) - 1 | |
741 | + ncapstr * sizeof (enum r_dir_status)) | |
742 | / sizeof (struct r_search_path_elem)); | |
743 | ||
f55727ca | 744 | rtld_search_dirs.dirs[0] = (struct r_search_path_elem *) |
228589d2 | 745 | malloc ((sizeof (system_dirs) / sizeof (system_dirs[0])) |
12264bd7 | 746 | * round_size * sizeof (struct r_search_path_elem)); |
f55727ca | 747 | if (rtld_search_dirs.dirs[0] == NULL) |
39b3385d UD |
748 | { |
749 | errstring = N_("cannot create cache for search path"); | |
750 | goto signal_error; | |
751 | } | |
12264bd7 | 752 | |
f55727ca | 753 | rtld_search_dirs.malloced = 0; |
d6b5d570 | 754 | pelem = GL(dl_all_dirs) = rtld_search_dirs.dirs[0]; |
ab7eb292 UD |
755 | strp = system_dirs; |
756 | idx = 0; | |
757 | ||
758 | do | |
12264bd7 UD |
759 | { |
760 | size_t cnt; | |
761 | ||
762 | *aelem++ = pelem; | |
763 | ||
12264bd7 UD |
764 | pelem->what = "system search path"; |
765 | pelem->where = NULL; | |
766 | ||
ab7eb292 UD |
767 | pelem->dirname = strp; |
768 | pelem->dirnamelen = system_dirs_len[idx]; | |
769 | strp += system_dirs_len[idx] + 1; | |
12264bd7 | 770 | |
f55727ca UD |
771 | /* System paths must be absolute. */ |
772 | assert (pelem->dirname[0] == '/'); | |
773 | for (cnt = 0; cnt < ncapstr; ++cnt) | |
774 | pelem->status[cnt] = unknown; | |
ab7eb292 | 775 | |
4a6d1198 | 776 | pelem->next = (++idx == nsystem_dirs_len ? NULL : (pelem + round_size)); |
ab7eb292 UD |
777 | |
778 | pelem += round_size; | |
12264bd7 | 779 | } |
4a6d1198 | 780 | while (idx < nsystem_dirs_len); |
ab7eb292 UD |
781 | |
782 | max_dirnamelen = SYSTEM_DIRS_MAX_LEN; | |
12264bd7 | 783 | *aelem = NULL; |
4317f9e1 | 784 | |
b5567b2a | 785 | #ifdef SHARED |
81e0cb2d | 786 | /* This points to the map of the main object. */ |
c0f62c56 | 787 | l = GL(dl_ns)[LM_ID_BASE]._ns_loaded; |
011ce8ed UD |
788 | if (l != NULL) |
789 | { | |
011ce8ed | 790 | assert (l->l_type != lt_loaded); |
40a55d20 | 791 | |
fcf70d41 UD |
792 | if (l->l_info[DT_RUNPATH]) |
793 | { | |
794 | /* Allocate room for the search path and fill in information | |
795 | from RUNPATH. */ | |
f55727ca UD |
796 | decompose_rpath (&l->l_runpath_dirs, |
797 | (const void *) (D_PTR (l, l_info[DT_STRTAB]) | |
798 | + l->l_info[DT_RUNPATH]->d_un.d_val), | |
799 | l, "RUNPATH"); | |
273cdee8 AS |
800 | /* During rtld init the memory is allocated by the stub malloc, |
801 | prevent any attempt to free it by the normal malloc. */ | |
802 | l->l_runpath_dirs.malloced = 0; | |
fcf70d41 UD |
803 | |
804 | /* The RPATH is ignored. */ | |
f55727ca | 805 | l->l_rpath_dirs.dirs = (void *) -1; |
fcf70d41 | 806 | } |
011ce8ed | 807 | else |
fcf70d41 | 808 | { |
f55727ca | 809 | l->l_runpath_dirs.dirs = (void *) -1; |
fcf70d41 UD |
810 | |
811 | if (l->l_info[DT_RPATH]) | |
f55727ca UD |
812 | { |
813 | /* Allocate room for the search path and fill in information | |
814 | from RPATH. */ | |
815 | decompose_rpath (&l->l_rpath_dirs, | |
816 | (const void *) (D_PTR (l, l_info[DT_STRTAB]) | |
fcf70d41 UD |
817 | + l->l_info[DT_RPATH]->d_un.d_val), |
818 | l, "RPATH"); | |
273cdee8 AS |
819 | /* During rtld init the memory is allocated by the stub |
820 | malloc, prevent any attempt to free it by the normal | |
821 | malloc. */ | |
f55727ca UD |
822 | l->l_rpath_dirs.malloced = 0; |
823 | } | |
fcf70d41 | 824 | else |
f55727ca | 825 | l->l_rpath_dirs.dirs = (void *) -1; |
fcf70d41 | 826 | } |
0a54e401 | 827 | } |
b5567b2a | 828 | #endif /* SHARED */ |
7ef90c15 UD |
829 | |
830 | if (llp != NULL && *llp != '\0') | |
0a54e401 | 831 | { |
7ef90c15 UD |
832 | size_t nllp; |
833 | const char *cp = llp; | |
950398e1 UD |
834 | char *llp_tmp; |
835 | ||
836 | #ifdef SHARED | |
837 | /* Expand DSTs. */ | |
838 | size_t cnt = DL_DST_COUNT (llp, 1); | |
839 | if (__builtin_expect (cnt == 0, 1)) | |
840 | llp_tmp = strdupa (llp); | |
841 | else | |
842 | { | |
843 | /* Determine the length of the substituted string. */ | |
844 | size_t total = DL_DST_REQUIRED (l, llp, strlen (llp), cnt); | |
845 | ||
846 | /* Allocate the necessary memory. */ | |
847 | llp_tmp = (char *) alloca (total + 1); | |
848 | llp_tmp = _dl_dst_substitute (l, llp, llp_tmp, 1); | |
849 | } | |
850 | #else | |
851 | llp_tmp = strdupa (llp); | |
852 | #endif | |
011ce8ed | 853 | |
7ef90c15 UD |
854 | /* Decompose the LD_LIBRARY_PATH contents. First determine how many |
855 | elements it has. */ | |
856 | nllp = 1; | |
857 | while (*cp) | |
0a54e401 | 858 | { |
7ef90c15 UD |
859 | if (*cp == ':' || *cp == ';') |
860 | ++nllp; | |
861 | ++cp; | |
011ce8ed | 862 | } |
7ef90c15 | 863 | |
f55727ca | 864 | env_path_list.dirs = (struct r_search_path_elem **) |
7ef90c15 | 865 | malloc ((nllp + 1) * sizeof (struct r_search_path_elem *)); |
f55727ca | 866 | if (env_path_list.dirs == NULL) |
39b3385d UD |
867 | { |
868 | errstring = N_("cannot create cache for search path"); | |
869 | goto signal_error; | |
870 | } | |
7ef90c15 | 871 | |
b0ed91ae | 872 | (void) fillin_rpath (llp_tmp, env_path_list.dirs, ":;", |
e6caf4e1 | 873 | INTUSE(__libc_enable_secure), "LD_LIBRARY_PATH", |
2a939a7e | 874 | NULL, l); |
6a7c9bb4 | 875 | |
f55727ca | 876 | if (env_path_list.dirs[0] == NULL) |
6a7c9bb4 | 877 | { |
f55727ca UD |
878 | free (env_path_list.dirs); |
879 | env_path_list.dirs = (void *) -1; | |
6a7c9bb4 | 880 | } |
f55727ca UD |
881 | |
882 | env_path_list.malloced = 0; | |
81e0cb2d | 883 | } |
152e7964 | 884 | else |
f55727ca | 885 | env_path_list.dirs = (void *) -1; |
0a54e401 UD |
886 | } |
887 | ||
888 | ||
a6291c3d | 889 | static void |
a481b13c | 890 | __attribute__ ((noreturn, noinline)) |
126b06f9 | 891 | lose (int code, int fd, const char *name, char *realname, struct link_map *l, |
815e6fa3 | 892 | const char *msg, struct r_debug *r, Lmid_t nsid) |
126b06f9 | 893 | { |
fb0356b9 | 894 | /* The file might already be closed. */ |
a481b13c UD |
895 | if (fd != -1) |
896 | (void) __close (fd); | |
610f9ab4 | 897 | if (l != NULL && l->l_origin != (char *) -1l) |
fde56e5c | 898 | free ((char *) l->l_origin); |
f0967738 | 899 | free (l); |
126b06f9 | 900 | free (realname); |
bca2218b UD |
901 | |
902 | if (r != NULL) | |
903 | { | |
904 | r->r_state = RT_CONSISTENT; | |
905 | _dl_debug_state (); | |
815e6fa3 | 906 | LIBC_PROBE (map_failed, 2, nsid, r); |
bca2218b UD |
907 | } |
908 | ||
154d10bd | 909 | _dl_signal_error (code, name, NULL, msg); |
126b06f9 UD |
910 | } |
911 | ||
912 | ||
ea03559a RM |
913 | /* Map in the shared object NAME, actually located in REALNAME, and already |
914 | opened on FD. */ | |
915 | ||
f787edde UD |
916 | #ifndef EXTERNAL_MAP_FROM_FD |
917 | static | |
918 | #endif | |
ea03559a | 919 | struct link_map * |
a35e137a UD |
920 | _dl_map_object_from_fd (const char *name, int fd, struct filebuf *fbp, |
921 | char *realname, struct link_map *loader, int l_type, | |
c0f62c56 | 922 | int mode, void **stack_endp, Lmid_t nsid) |
ea03559a | 923 | { |
622586fb | 924 | struct link_map *l = NULL; |
266180eb RM |
925 | const ElfW(Ehdr) *header; |
926 | const ElfW(Phdr) *phdr; | |
927 | const ElfW(Phdr) *ph; | |
8193034b | 928 | size_t maplength; |
b122c703 | 929 | int type; |
5763742f | 930 | struct stat64 st; |
39b3385d UD |
931 | /* Initialize to keep the compiler happy. */ |
932 | const char *errstring = NULL; | |
933 | int errval = 0; | |
29f97654 | 934 | struct r_debug *r = _dl_debug_initialize (0, nsid); |
9dcafc55 | 935 | bool make_consistent = false; |
61e0617a UD |
936 | |
937 | /* Get file information. */ | |
39b3385d UD |
938 | if (__builtin_expect (__fxstat64 (_STAT_VER, fd, &st) < 0, 0)) |
939 | { | |
940 | errstring = N_("cannot stat shared object"); | |
941 | call_lose_errno: | |
942 | errval = errno; | |
943 | call_lose: | |
bca2218b | 944 | lose (errval, fd, name, realname, l, errstring, |
815e6fa3 | 945 | make_consistent ? r : NULL, nsid); |
39b3385d | 946 | } |
d66e34cd RM |
947 | |
948 | /* Look again to see if the real name matched another already loaded. */ | |
c0f62c56 | 949 | for (l = GL(dl_ns)[nsid]._ns_loaded; l; l = l->l_next) |
20fe49b9 | 950 | if (l->l_removed == 0 && l->l_ino == st.st_ino && l->l_dev == st.st_dev) |
d66e34cd RM |
951 | { |
952 | /* The object is already loaded. | |
953 | Just bump its reference count and return it. */ | |
266180eb | 954 | __close (fd); |
c84142e8 UD |
955 | |
956 | /* If the name is not in the list of names for this object add | |
957 | it. */ | |
ea03559a | 958 | free (realname); |
0413b54c | 959 | add_name_to_object (l, name); |
8699e7b1 | 960 | |
d66e34cd RM |
961 | return l; |
962 | } | |
963 | ||
c0f62c56 UD |
964 | #ifdef SHARED |
965 | /* When loading into a namespace other than the base one we must | |
966 | avoid loading ld.so since there can only be one copy. Ever. */ | |
967 | if (__builtin_expect (nsid != LM_ID_BASE, 0) | |
968 | && ((st.st_ino == GL(dl_rtld_map).l_ino | |
969 | && st.st_dev == GL(dl_rtld_map).l_dev) | |
970 | || _dl_name_match_p (name, &GL(dl_rtld_map)))) | |
971 | { | |
972 | /* This is indeed ld.so. Create a new link_map which refers to | |
973 | the real one for almost everything. */ | |
974 | l = _dl_new_object (realname, name, l_type, loader, mode, nsid); | |
975 | if (l == NULL) | |
976 | goto fail_new; | |
977 | ||
978 | /* Refer to the real descriptor. */ | |
979 | l->l_real = &GL(dl_rtld_map); | |
980 | ||
981 | /* No need to bump the refcount of the real object, ld.so will | |
982 | never be unloaded. */ | |
983 | __close (fd); | |
984 | ||
f0967738 AK |
985 | /* Add the map for the mirrored object to the object list. */ |
986 | _dl_add_to_namespace_list (l, nsid); | |
987 | ||
c0f62c56 UD |
988 | return l; |
989 | } | |
990 | #endif | |
991 | ||
2f54c82d | 992 | if (mode & RTLD_NOLOAD) |
96961bf7 AS |
993 | { |
994 | /* We are not supposed to load the object unless it is already | |
995 | loaded. So return now. */ | |
4bff6e01 | 996 | free (realname); |
96961bf7 AS |
997 | __close (fd); |
998 | return NULL; | |
999 | } | |
bf8b3e74 | 1000 | |
8193034b | 1001 | /* Print debugging message. */ |
afdca0f2 | 1002 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_FILES, 0)) |
c0f62c56 | 1003 | _dl_debug_printf ("file=%s [%lu]; generating link map\n", name, nsid); |
8193034b | 1004 | |
a35e137a UD |
1005 | /* This is the ELF header. We read it in `open_verify'. */ |
1006 | header = (void *) fbp->buf; | |
d66e34cd | 1007 | |
2064087b | 1008 | #ifndef MAP_ANON |
126b06f9 | 1009 | # define MAP_ANON 0 |
d66e34cd RM |
1010 | if (_dl_zerofd == -1) |
1011 | { | |
1012 | _dl_zerofd = _dl_sysdep_open_zero_fill (); | |
1013 | if (_dl_zerofd == -1) | |
ba79d61b | 1014 | { |
4bff6e01 | 1015 | free (realname); |
ba79d61b | 1016 | __close (fd); |
154d10bd UD |
1017 | _dl_signal_error (errno, NULL, NULL, |
1018 | N_("cannot open zero fill device")); | |
ba79d61b | 1019 | } |
d66e34cd | 1020 | } |
2064087b | 1021 | #endif |
d66e34cd | 1022 | |
9dcafc55 UD |
1023 | /* Signal that we are going to add new objects. */ |
1024 | if (r->r_state == RT_CONSISTENT) | |
1025 | { | |
1026 | #ifdef SHARED | |
1027 | /* Auditing checkpoint: we are going to add new objects. */ | |
2ca285b0 UD |
1028 | if ((mode & __RTLD_AUDIT) == 0 |
1029 | && __builtin_expect (GLRO(dl_naudit) > 0, 0)) | |
9dcafc55 UD |
1030 | { |
1031 | struct link_map *head = GL(dl_ns)[nsid]._ns_loaded; | |
1032 | /* Do not call the functions for any auditing object. */ | |
1033 | if (head->l_auditing == 0) | |
1034 | { | |
1035 | struct audit_ifaces *afct = GLRO(dl_audit); | |
1036 | for (unsigned int cnt = 0; cnt < GLRO(dl_naudit); ++cnt) | |
1037 | { | |
1038 | if (afct->activity != NULL) | |
1039 | afct->activity (&head->l_audit[cnt].cookie, LA_ACT_ADD); | |
1040 | ||
1041 | afct = afct->next; | |
1042 | } | |
1043 | } | |
1044 | } | |
1045 | #endif | |
1046 | ||
1047 | /* Notify the debugger we have added some objects. We need to | |
1048 | call _dl_debug_initialize in a static program in case dynamic | |
1049 | linking has not been used before. */ | |
1050 | r->r_state = RT_ADD; | |
1051 | _dl_debug_state (); | |
815e6fa3 | 1052 | LIBC_PROBE (map_start, 2, nsid, r); |
9dcafc55 UD |
1053 | make_consistent = true; |
1054 | } | |
1055 | else | |
1056 | assert (r->r_state == RT_ADD); | |
1057 | ||
ba79d61b | 1058 | /* Enter the new object in the list of loaded objects. */ |
c0f62c56 UD |
1059 | l = _dl_new_object (realname, name, l_type, loader, mode, nsid); |
1060 | if (__builtin_expect (l == NULL, 0)) | |
39b3385d | 1061 | { |
7cb92a99 | 1062 | #ifdef SHARED |
c0f62c56 | 1063 | fail_new: |
7cb92a99 | 1064 | #endif |
39b3385d UD |
1065 | errstring = N_("cannot create shared object descriptor"); |
1066 | goto call_lose_errno; | |
1067 | } | |
ba79d61b | 1068 | |
b122c703 | 1069 | /* Extract the remaining details we need from the ELF header |
32c85e43 | 1070 | and then read in the program header table. */ |
b122c703 RM |
1071 | l->l_entry = header->e_entry; |
1072 | type = header->e_type; | |
1073 | l->l_phnum = header->e_phnum; | |
32c85e43 UD |
1074 | |
1075 | maplength = header->e_phnum * sizeof (ElfW(Phdr)); | |
6dd67bd5 | 1076 | if (header->e_phoff + maplength <= (size_t) fbp->len) |
a35e137a | 1077 | phdr = (void *) (fbp->buf + header->e_phoff); |
32c85e43 UD |
1078 | else |
1079 | { | |
1080 | phdr = alloca (maplength); | |
0e15c4b6 | 1081 | __lseek (fd, header->e_phoff, SEEK_SET); |
6dd67bd5 | 1082 | if ((size_t) __libc_read (fd, (void *) phdr, maplength) != maplength) |
39b3385d UD |
1083 | { |
1084 | errstring = N_("cannot read file data"); | |
1085 | goto call_lose_errno; | |
1086 | } | |
32c85e43 | 1087 | } |
879bf2e6 | 1088 | |
30950a5f RA |
1089 | /* On most platforms presume that PT_GNU_STACK is absent and the stack is |
1090 | * executable. Other platforms default to a nonexecutable stack and don't | |
1091 | * need PT_GNU_STACK to do so. */ | |
1092 | uint_fast16_t stack_flags = DEFAULT_STACK_PERMS; | |
ecdeaac0 | 1093 | |
b122c703 RM |
1094 | { |
1095 | /* Scan the program header table, collecting its load commands. */ | |
1096 | struct loadcmd | |
1097 | { | |
266180eb | 1098 | ElfW(Addr) mapstart, mapend, dataend, allocend; |
408223d4 | 1099 | ElfW(Off) mapoff; |
b122c703 RM |
1100 | int prot; |
1101 | } loadcmds[l->l_phnum], *c; | |
1102 | size_t nloadcmds = 0; | |
6fffb9a2 | 1103 | bool has_holes = false; |
d66e34cd | 1104 | |
126b06f9 | 1105 | /* The struct is initialized to zero so this is not necessary: |
d66e34cd | 1106 | l->l_ld = 0; |
b122c703 | 1107 | l->l_phdr = 0; |
126b06f9 | 1108 | l->l_addr = 0; */ |
d66e34cd RM |
1109 | for (ph = phdr; ph < &phdr[l->l_phnum]; ++ph) |
1110 | switch (ph->p_type) | |
1111 | { | |
1112 | /* These entries tell us where to find things once the file's | |
1113 | segments are mapped in. We record the addresses it says | |
1114 | verbatim, and later correct for the run-time load address. */ | |
1115 | case PT_DYNAMIC: | |
1116 | l->l_ld = (void *) ph->p_vaddr; | |
dacc8ffa | 1117 | l->l_ldnum = ph->p_memsz / sizeof (ElfW(Dyn)); |
d66e34cd | 1118 | break; |
39b3385d | 1119 | |
d66e34cd RM |
1120 | case PT_PHDR: |
1121 | l->l_phdr = (void *) ph->p_vaddr; | |
1122 | break; | |
1123 | ||
1124 | case PT_LOAD: | |
b122c703 RM |
1125 | /* A load command tells us to map in part of the file. |
1126 | We record the load commands and process them all later. */ | |
afdca0f2 | 1127 | if (__builtin_expect ((ph->p_align & (GLRO(dl_pagesize) - 1)) != 0, |
fd77c361 | 1128 | 0)) |
39b3385d UD |
1129 | { |
1130 | errstring = N_("ELF load command alignment not page-aligned"); | |
1131 | goto call_lose; | |
1132 | } | |
fd77c361 UD |
1133 | if (__builtin_expect (((ph->p_vaddr - ph->p_offset) |
1134 | & (ph->p_align - 1)) != 0, 0)) | |
39b3385d UD |
1135 | { |
1136 | errstring | |
1137 | = N_("ELF load command address/offset not properly aligned"); | |
1138 | goto call_lose; | |
1139 | } | |
1140 | ||
cc12f2a4 | 1141 | c = &loadcmds[nloadcmds++]; |
410828e4 | 1142 | c->mapstart = ph->p_vaddr & ~(GLRO(dl_pagesize) - 1); |
afdca0f2 UD |
1143 | c->mapend = ((ph->p_vaddr + ph->p_filesz + GLRO(dl_pagesize) - 1) |
1144 | & ~(GLRO(dl_pagesize) - 1)); | |
cc12f2a4 UD |
1145 | c->dataend = ph->p_vaddr + ph->p_filesz; |
1146 | c->allocend = ph->p_vaddr + ph->p_memsz; | |
410828e4 | 1147 | c->mapoff = ph->p_offset & ~(GLRO(dl_pagesize) - 1); |
cc12f2a4 | 1148 | |
6fffb9a2 UD |
1149 | /* Determine whether there is a gap between the last segment |
1150 | and this one. */ | |
1151 | if (nloadcmds > 1 && c[-1].mapend != c->mapstart) | |
1152 | has_holes = true; | |
1153 | ||
cc12f2a4 | 1154 | /* Optimize a common case. */ |
94a758fe | 1155 | #if (PF_R | PF_W | PF_X) == 7 && (PROT_READ | PROT_WRITE | PROT_EXEC) == 7 |
cc12f2a4 UD |
1156 | c->prot = (PF_TO_PROT |
1157 | >> ((ph->p_flags & (PF_R | PF_W | PF_X)) * 4)) & 0xf; | |
94a758fe | 1158 | #else |
cc12f2a4 UD |
1159 | c->prot = 0; |
1160 | if (ph->p_flags & PF_R) | |
1161 | c->prot |= PROT_READ; | |
1162 | if (ph->p_flags & PF_W) | |
1163 | c->prot |= PROT_WRITE; | |
1164 | if (ph->p_flags & PF_X) | |
1165 | c->prot |= PROT_EXEC; | |
94a758fe | 1166 | #endif |
55c91021 | 1167 | break; |
96f208a4 | 1168 | |
96f208a4 | 1169 | case PT_TLS: |
2d148689 RM |
1170 | if (ph->p_memsz == 0) |
1171 | /* Nothing to do for an empty segment. */ | |
1172 | break; | |
1173 | ||
216455bc RM |
1174 | l->l_tls_blocksize = ph->p_memsz; |
1175 | l->l_tls_align = ph->p_align; | |
99fe3b0e UD |
1176 | if (ph->p_align == 0) |
1177 | l->l_tls_firstbyte_offset = 0; | |
1178 | else | |
1179 | l->l_tls_firstbyte_offset = ph->p_vaddr & (ph->p_align - 1); | |
216455bc RM |
1180 | l->l_tls_initimage_size = ph->p_filesz; |
1181 | /* Since we don't know the load address yet only store the | |
1182 | offset. We will adjust it later. */ | |
1183 | l->l_tls_initimage = (void *) ph->p_vaddr; | |
1184 | ||
2d148689 RM |
1185 | /* If not loading the initial set of shared libraries, |
1186 | check whether we should permit loading a TLS segment. */ | |
216455bc | 1187 | if (__builtin_expect (l->l_type == lt_library, 1) |
850dcfca UD |
1188 | /* If GL(dl_tls_dtv_slotinfo_list) == NULL, then rtld.c did |
1189 | not set up TLS data structures, so don't use them now. */ | |
1190 | || __builtin_expect (GL(dl_tls_dtv_slotinfo_list) != NULL, 1)) | |
96f208a4 | 1191 | { |
aed283dd UD |
1192 | /* Assign the next available module ID. */ |
1193 | l->l_tls_modid = _dl_next_tls_modid (); | |
2d148689 | 1194 | break; |
96f208a4 | 1195 | } |
2d148689 | 1196 | |
11bf311e | 1197 | #ifdef SHARED |
785290ea | 1198 | if (l->l_prev == NULL || (mode & __RTLD_AUDIT) != 0) |
2d148689 RM |
1199 | /* We are loading the executable itself when the dynamic linker |
1200 | was executed directly. The setup will happen later. */ | |
1201 | break; | |
216455bc | 1202 | |
4b4f2771 | 1203 | # ifdef _LIBC_REENTRANT |
216455bc RM |
1204 | /* In a static binary there is no way to tell if we dynamically |
1205 | loaded libpthread. */ | |
1206 | if (GL(dl_error_catch_tsd) == &_dl_initial_error_catch_tsd) | |
4b4f2771 | 1207 | # endif |
11bf311e | 1208 | #endif |
216455bc RM |
1209 | { |
1210 | /* We have not yet loaded libpthread. | |
1211 | We can do the TLS setup right now! */ | |
1212 | ||
1213 | void *tcb; | |
1214 | ||
1215 | /* The first call allocates TLS bookkeeping data structures. | |
1216 | Then we allocate the TCB for the initial thread. */ | |
1217 | if (__builtin_expect (_dl_tls_setup (), 0) | |
1218 | || __builtin_expect ((tcb = _dl_allocate_tls (NULL)) == NULL, | |
1219 | 0)) | |
1220 | { | |
1221 | errval = ENOMEM; | |
1222 | errstring = N_("\ | |
1223 | cannot allocate TLS data structures for initial thread"); | |
1224 | goto call_lose; | |
1225 | } | |
1226 | ||
1227 | /* Now we install the TCB in the thread register. */ | |
fde89ad0 RM |
1228 | errstring = TLS_INIT_TP (tcb, 0); |
1229 | if (__builtin_expect (errstring == NULL, 1)) | |
216455bc RM |
1230 | { |
1231 | /* Now we are all good. */ | |
1232 | l->l_tls_modid = ++GL(dl_tls_max_dtv_idx); | |
1233 | break; | |
1234 | } | |
1235 | ||
1236 | /* The kernel is too old or somesuch. */ | |
fde89ad0 | 1237 | errval = 0; |
216455bc | 1238 | _dl_deallocate_tls (tcb, 1); |
fde89ad0 | 1239 | goto call_lose; |
216455bc | 1240 | } |
2d148689 | 1241 | |
807bce82 UD |
1242 | /* Uh-oh, the binary expects TLS support but we cannot |
1243 | provide it. */ | |
2430d57a RM |
1244 | errval = 0; |
1245 | errstring = N_("cannot handle TLS data"); | |
1246 | goto call_lose; | |
807bce82 | 1247 | break; |
ecdeaac0 RM |
1248 | |
1249 | case PT_GNU_STACK: | |
1250 | stack_flags = ph->p_flags; | |
1251 | break; | |
ed20b3d9 UD |
1252 | |
1253 | case PT_GNU_RELRO: | |
1254 | l->l_relro_addr = ph->p_vaddr; | |
1255 | l->l_relro_size = ph->p_memsz; | |
1256 | break; | |
b122c703 | 1257 | } |
d66e34cd | 1258 | |
d8a5edc2 RM |
1259 | if (__builtin_expect (nloadcmds == 0, 0)) |
1260 | { | |
1261 | /* This only happens for a bogus object that will be caught with | |
1262 | another error below. But we don't want to go through the | |
1263 | calculations below using NLOADCMDS - 1. */ | |
1264 | errstring = N_("object file has no loadable segments"); | |
1265 | goto call_lose; | |
1266 | } | |
1267 | ||
b122c703 RM |
1268 | /* Now process the load commands and map segments into memory. */ |
1269 | c = loadcmds; | |
1270 | ||
8193034b UD |
1271 | /* Length of the sections to be loaded. */ |
1272 | maplength = loadcmds[nloadcmds - 1].allocend - c->mapstart; | |
1273 | ||
9987236e | 1274 | if (__builtin_expect (type, ET_DYN) == ET_DYN) |
b122c703 RM |
1275 | { |
1276 | /* This is a position-independent shared object. We can let the | |
1277 | kernel map it anywhere it likes, but we must have space for all | |
1278 | the segments in their specified positions relative to the first. | |
1279 | So we map the first segment without MAP_FIXED, but with its | |
22930c9b RM |
1280 | extent increased to cover all the segments. Then we remove |
1281 | access from excess portion, and there is known sufficient space | |
4cca6b86 UD |
1282 | there to remap from the later segments. |
1283 | ||
1284 | As a refinement, sometimes we have an address that we would | |
1285 | prefer to map such objects at; but this is only a preference, | |
1286 | the OS can do whatever it likes. */ | |
4cca6b86 | 1287 | ElfW(Addr) mappref; |
97fd3a30 | 1288 | mappref = (ELF_PREFERRED_ADDRESS (loader, maplength, |
afdca0f2 | 1289 | c->mapstart & GLRO(dl_use_load_bias)) |
f21acc89 | 1290 | - MAP_BASE_ADDR (l)); |
c0282c06 UD |
1291 | |
1292 | /* Remember which part of the address space this object uses. */ | |
39b3385d | 1293 | l->l_map_start = (ElfW(Addr)) __mmap ((void *) mappref, maplength, |
1773d1ba | 1294 | c->prot, |
a3fcd5e8 | 1295 | MAP_COPY|MAP_FILE, |
39b3385d | 1296 | fd, c->mapoff); |
fd77c361 | 1297 | if (__builtin_expect ((void *) l->l_map_start == MAP_FAILED, 0)) |
39b3385d UD |
1298 | { |
1299 | map_error: | |
1300 | errstring = N_("failed to map segment from shared object"); | |
1301 | goto call_lose_errno; | |
1302 | } | |
1303 | ||
c0282c06 | 1304 | l->l_map_end = l->l_map_start + maplength; |
c77ec56d | 1305 | l->l_addr = l->l_map_start - c->mapstart; |
b122c703 | 1306 | |
6fffb9a2 UD |
1307 | if (has_holes) |
1308 | /* Change protection on the excess portion to disallow all access; | |
1309 | the portions we do not remap later will be inaccessible as if | |
1310 | unallocated. Then jump into the normal segment-mapping loop to | |
1311 | handle the portion of the segment past the end of the file | |
1312 | mapping. */ | |
3fb035f6 | 1313 | __mprotect ((caddr_t) (l->l_addr + c->mapend), |
fc072bad | 1314 | loadcmds[nloadcmds - 1].mapstart - c->mapend, |
6fffb9a2 | 1315 | PROT_NONE); |
052b6a6c | 1316 | |
9be09e06 UD |
1317 | l->l_contiguous = 1; |
1318 | ||
b122c703 RM |
1319 | goto postmap; |
1320 | } | |
48da1092 | 1321 | |
efec5079 UD |
1322 | /* This object is loaded at a fixed address. This must never |
1323 | happen for objects loaded with dlopen(). */ | |
1324 | if (__builtin_expect ((mode & __RTLD_OPENEXEC) == 0, 0)) | |
1325 | { | |
1326 | errstring = N_("cannot dynamically load executable"); | |
1327 | goto call_lose; | |
4cca6b86 | 1328 | } |
b122c703 | 1329 | |
efec5079 UD |
1330 | /* Notify ELF_PREFERRED_ADDRESS that we have to load this one |
1331 | fixed. */ | |
1332 | ELF_FIXED_ADDRESS (loader, c->mapstart); | |
1333 | ||
1334 | ||
052b6a6c UD |
1335 | /* Remember which part of the address space this object uses. */ |
1336 | l->l_map_start = c->mapstart + l->l_addr; | |
1337 | l->l_map_end = l->l_map_start + maplength; | |
9be09e06 | 1338 | l->l_contiguous = !has_holes; |
052b6a6c | 1339 | |
b122c703 RM |
1340 | while (c < &loadcmds[nloadcmds]) |
1341 | { | |
39b3385d UD |
1342 | if (c->mapend > c->mapstart |
1343 | /* Map the segment contents from the file. */ | |
1344 | && (__mmap ((void *) (l->l_addr + c->mapstart), | |
1345 | c->mapend - c->mapstart, c->prot, | |
a3fcd5e8 | 1346 | MAP_FIXED|MAP_COPY|MAP_FILE, |
1773d1ba | 1347 | fd, c->mapoff) |
39b3385d UD |
1348 | == MAP_FAILED)) |
1349 | goto map_error; | |
b122c703 RM |
1350 | |
1351 | postmap: | |
eec8b6ca UD |
1352 | if (c->prot & PROT_EXEC) |
1353 | l->l_text_end = l->l_addr + c->mapend; | |
1354 | ||
7bcaca43 | 1355 | if (l->l_phdr == 0 |
408223d4 | 1356 | && c->mapoff <= header->e_phoff |
6dd67bd5 | 1357 | && ((size_t) (c->mapend - c->mapstart + c->mapoff) |
7bcaca43 UD |
1358 | >= header->e_phoff + header->e_phnum * sizeof (ElfW(Phdr)))) |
1359 | /* Found the program header in this segment. */ | |
c515fb51 L |
1360 | l->l_phdr = (void *) (uintptr_t) (c->mapstart + header->e_phoff |
1361 | - c->mapoff); | |
7bcaca43 | 1362 | |
b122c703 RM |
1363 | if (c->allocend > c->dataend) |
1364 | { | |
1365 | /* Extra zero pages should appear at the end of this segment, | |
1366 | after the data mapped from the file. */ | |
266180eb | 1367 | ElfW(Addr) zero, zeroend, zeropage; |
b122c703 RM |
1368 | |
1369 | zero = l->l_addr + c->dataend; | |
1370 | zeroend = l->l_addr + c->allocend; | |
afdca0f2 UD |
1371 | zeropage = ((zero + GLRO(dl_pagesize) - 1) |
1372 | & ~(GLRO(dl_pagesize) - 1)); | |
d66e34cd | 1373 | |
b122c703 RM |
1374 | if (zeroend < zeropage) |
1375 | /* All the extra data is in the last page of the segment. | |
1376 | We can just zero it. */ | |
1377 | zeropage = zeroend; | |
1378 | ||
1379 | if (zeropage > zero) | |
d66e34cd | 1380 | { |
b122c703 | 1381 | /* Zero the final part of the last page of the segment. */ |
6fffb9a2 | 1382 | if (__builtin_expect ((c->prot & PROT_WRITE) == 0, 0)) |
d66e34cd | 1383 | { |
b122c703 | 1384 | /* Dag nab it. */ |
afdca0f2 UD |
1385 | if (__mprotect ((caddr_t) (zero |
1386 | & ~(GLRO(dl_pagesize) - 1)), | |
1387 | GLRO(dl_pagesize), c->prot|PROT_WRITE) < 0) | |
39b3385d UD |
1388 | { |
1389 | errstring = N_("cannot change memory protections"); | |
1390 | goto call_lose_errno; | |
1391 | } | |
d66e34cd | 1392 | } |
55c91021 | 1393 | memset ((void *) zero, '\0', zeropage - zero); |
6fffb9a2 | 1394 | if (__builtin_expect ((c->prot & PROT_WRITE) == 0, 0)) |
afdca0f2 UD |
1395 | __mprotect ((caddr_t) (zero & ~(GLRO(dl_pagesize) - 1)), |
1396 | GLRO(dl_pagesize), c->prot); | |
b122c703 | 1397 | } |
d66e34cd | 1398 | |
b122c703 RM |
1399 | if (zeroend > zeropage) |
1400 | { | |
1401 | /* Map the remaining zero pages in from the zero fill FD. */ | |
1402 | caddr_t mapat; | |
266180eb RM |
1403 | mapat = __mmap ((caddr_t) zeropage, zeroend - zeropage, |
1404 | c->prot, MAP_ANON|MAP_PRIVATE|MAP_FIXED, | |
20739e54 | 1405 | -1, 0); |
fd77c361 | 1406 | if (__builtin_expect (mapat == MAP_FAILED, 0)) |
39b3385d UD |
1407 | { |
1408 | errstring = N_("cannot map zero-fill pages"); | |
1409 | goto call_lose_errno; | |
1410 | } | |
d66e34cd RM |
1411 | } |
1412 | } | |
d66e34cd | 1413 | |
b122c703 | 1414 | ++c; |
879bf2e6 | 1415 | } |
b122c703 | 1416 | } |
d66e34cd | 1417 | |
b122c703 RM |
1418 | if (l->l_ld == 0) |
1419 | { | |
fd77c361 | 1420 | if (__builtin_expect (type == ET_DYN, 0)) |
39b3385d UD |
1421 | { |
1422 | errstring = N_("object file has no dynamic section"); | |
1423 | goto call_lose; | |
1424 | } | |
b122c703 RM |
1425 | } |
1426 | else | |
14755b91 | 1427 | l->l_ld = (ElfW(Dyn) *) ((ElfW(Addr)) l->l_ld + l->l_addr); |
879bf2e6 | 1428 | |
479aa8ec | 1429 | elf_get_dynamic_info (l, NULL); |
2f54c82d | 1430 | |
efec5079 UD |
1431 | /* Make sure we are not dlopen'ing an object that has the |
1432 | DF_1_NOOPEN flag set. */ | |
2430d57a | 1433 | if (__builtin_expect (l->l_flags_1 & DF_1_NOOPEN, 0) |
2f54c82d UD |
1434 | && (mode & __RTLD_DLOPEN)) |
1435 | { | |
2f54c82d UD |
1436 | /* We are not supposed to load this object. Free all resources. */ |
1437 | __munmap ((void *) l->l_map_start, l->l_map_end - l->l_map_start); | |
1438 | ||
11810621 UD |
1439 | if (!l->l_libname->dont_free) |
1440 | free (l->l_libname); | |
2f54c82d UD |
1441 | |
1442 | if (l->l_phdr_allocated) | |
1443 | free ((void *) l->l_phdr); | |
1444 | ||
fb0356b9 UD |
1445 | errstring = N_("shared object cannot be dlopen()ed"); |
1446 | goto call_lose; | |
2f54c82d UD |
1447 | } |
1448 | ||
efec5079 UD |
1449 | if (l->l_phdr == NULL) |
1450 | { | |
1451 | /* The program header is not contained in any of the segments. | |
1452 | We have to allocate memory ourself and copy it over from out | |
1453 | temporary place. */ | |
1454 | ElfW(Phdr) *newp = (ElfW(Phdr) *) malloc (header->e_phnum | |
1455 | * sizeof (ElfW(Phdr))); | |
1456 | if (newp == NULL) | |
1457 | { | |
1458 | errstring = N_("cannot allocate memory for program header"); | |
1459 | goto call_lose_errno; | |
1460 | } | |
1461 | ||
1462 | l->l_phdr = memcpy (newp, phdr, | |
1463 | (header->e_phnum * sizeof (ElfW(Phdr)))); | |
1464 | l->l_phdr_allocated = 1; | |
1465 | } | |
1466 | else | |
1467 | /* Adjust the PT_PHDR value by the runtime load address. */ | |
1468 | l->l_phdr = (ElfW(Phdr) *) ((ElfW(Addr)) l->l_phdr + l->l_addr); | |
1469 | ||
dcca3fe2 UD |
1470 | if (__builtin_expect ((stack_flags &~ GL(dl_stack_flags)) & PF_X, 0)) |
1471 | { | |
e751d282 RM |
1472 | if (__builtin_expect (__check_caller (RETURN_ADDRESS (0), allow_ldso), |
1473 | 0) != 0) | |
1474 | { | |
1475 | errstring = N_("invalid caller"); | |
1476 | goto call_lose; | |
1477 | } | |
1478 | ||
dcca3fe2 UD |
1479 | /* The stack is presently not executable, but this module |
1480 | requires that it be executable. We must change the | |
1481 | protection of the variable which contains the flags used in | |
1482 | the mprotect calls. */ | |
11bf311e | 1483 | #ifdef SHARED |
3e539cb4 | 1484 | if ((mode & (__RTLD_DLOPEN | __RTLD_AUDIT)) == __RTLD_DLOPEN) |
dcca3fe2 | 1485 | { |
e751d282 RM |
1486 | const uintptr_t p = (uintptr_t) &__stack_prot & -GLRO(dl_pagesize); |
1487 | const size_t s = (uintptr_t) (&__stack_prot + 1) - p; | |
1488 | ||
1489 | struct link_map *const m = &GL(dl_rtld_map); | |
1490 | const uintptr_t relro_end = ((m->l_addr + m->l_relro_addr | |
1491 | + m->l_relro_size) | |
1492 | & -GLRO(dl_pagesize)); | |
1493 | if (__builtin_expect (p + s <= relro_end, 1)) | |
1494 | { | |
1495 | /* The variable lies in the region protected by RELRO. */ | |
0432680e PY |
1496 | if (__mprotect ((void *) p, s, PROT_READ|PROT_WRITE) < 0) |
1497 | { | |
1498 | errstring = N_("cannot change memory protections"); | |
1499 | goto call_lose_errno; | |
1500 | } | |
e751d282 RM |
1501 | __stack_prot |= PROT_READ|PROT_WRITE|PROT_EXEC; |
1502 | __mprotect ((void *) p, s, PROT_READ); | |
1503 | } | |
1504 | else | |
ecc1d0c3 | 1505 | __stack_prot |= PROT_READ|PROT_WRITE|PROT_EXEC; |
dcca3fe2 UD |
1506 | } |
1507 | else | |
1508 | #endif | |
ecc1d0c3 | 1509 | __stack_prot |= PROT_READ|PROT_WRITE|PROT_EXEC; |
dcca3fe2 | 1510 | |
606832e6 UD |
1511 | #ifdef check_consistency |
1512 | check_consistency (); | |
1513 | #endif | |
1514 | ||
dcca3fe2 UD |
1515 | errval = (*GL(dl_make_stack_executable_hook)) (stack_endp); |
1516 | if (errval) | |
1517 | { | |
1518 | errstring = N_("\ | |
1519 | cannot enable executable stack as shared object requires"); | |
1520 | goto call_lose; | |
1521 | } | |
1522 | } | |
1523 | ||
efec5079 UD |
1524 | /* Adjust the address of the TLS initialization image. */ |
1525 | if (l->l_tls_initimage != NULL) | |
1526 | l->l_tls_initimage = (char *) l->l_tls_initimage + l->l_addr; | |
efec5079 UD |
1527 | |
1528 | /* We are done mapping in the file. We no longer need the descriptor. */ | |
1529 | if (__builtin_expect (__close (fd) != 0, 0)) | |
1530 | { | |
1531 | errstring = N_("cannot close file descriptor"); | |
1532 | goto call_lose_errno; | |
1533 | } | |
1534 | /* Signal that we closed the file. */ | |
1535 | fd = -1; | |
1536 | ||
1537 | if (l->l_type == lt_library && type == ET_EXEC) | |
1538 | l->l_type = lt_executable; | |
1539 | ||
1540 | l->l_entry += l->l_addr; | |
1541 | ||
1542 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_FILES, 0)) | |
1543 | _dl_debug_printf ("\ | |
1544 | dynamic: 0x%0*lx base: 0x%0*lx size: 0x%0*Zx\n\ | |
1545 | entry: 0x%0*lx phdr: 0x%0*lx phnum: %*u\n\n", | |
1546 | (int) sizeof (void *) * 2, | |
1547 | (unsigned long int) l->l_ld, | |
1548 | (int) sizeof (void *) * 2, | |
1549 | (unsigned long int) l->l_addr, | |
1550 | (int) sizeof (void *) * 2, maplength, | |
1551 | (int) sizeof (void *) * 2, | |
1552 | (unsigned long int) l->l_entry, | |
1553 | (int) sizeof (void *) * 2, | |
1554 | (unsigned long int) l->l_phdr, | |
1555 | (int) sizeof (void *) * 2, l->l_phnum); | |
1556 | ||
1557 | /* Set up the symbol hash table. */ | |
1558 | _dl_setup_hash (l); | |
d66e34cd | 1559 | |
be935610 UD |
1560 | /* If this object has DT_SYMBOLIC set modify now its scope. We don't |
1561 | have to do this for the main map. */ | |
1fc07491 UD |
1562 | if ((mode & RTLD_DEEPBIND) == 0 |
1563 | && __builtin_expect (l->l_info[DT_SYMBOLIC] != NULL, 0) | |
c0a777e8 | 1564 | && &l->l_searchlist != l->l_scope[0]) |
be935610 UD |
1565 | { |
1566 | /* Create an appropriate searchlist. It contains only this map. | |
1fc07491 | 1567 | This is the definition of DT_SYMBOLIC in SysVr4. */ |
be935610 UD |
1568 | l->l_symbolic_searchlist.r_list[0] = l; |
1569 | l->l_symbolic_searchlist.r_nlist = 1; | |
be935610 UD |
1570 | |
1571 | /* Now move the existing entries one back. */ | |
c0a777e8 UD |
1572 | memmove (&l->l_scope[1], &l->l_scope[0], |
1573 | (l->l_scope_max - 1) * sizeof (l->l_scope[0])); | |
be935610 UD |
1574 | |
1575 | /* Now add the new entry. */ | |
c0a777e8 | 1576 | l->l_scope[0] = &l->l_symbolic_searchlist; |
be935610 UD |
1577 | } |
1578 | ||
5d916713 | 1579 | /* Remember whether this object must be initialized first. */ |
39b3385d | 1580 | if (l->l_flags_1 & DF_1_INITFIRST) |
d6b5d570 | 1581 | GL(dl_initfirst) = l; |
5d916713 | 1582 | |
61e0617a UD |
1583 | /* Finally the file information. */ |
1584 | l->l_dev = st.st_dev; | |
1585 | l->l_ino = st.st_ino; | |
1586 | ||
51f38e87 UD |
1587 | /* When we profile the SONAME might be needed for something else but |
1588 | loading. Add it right away. */ | |
afdca0f2 | 1589 | if (__builtin_expect (GLRO(dl_profile) != NULL, 0) |
51f38e87 UD |
1590 | && l->l_info[DT_SONAME] != NULL) |
1591 | add_name_to_object (l, ((const char *) D_PTR (l, l_info[DT_STRTAB]) | |
1592 | + l->l_info[DT_SONAME]->d_un.d_val)); | |
1593 | ||
47cc1490 CM |
1594 | #ifdef DL_AFTER_LOAD |
1595 | DL_AFTER_LOAD (l); | |
1596 | #endif | |
1597 | ||
f0967738 AK |
1598 | /* Now that the object is fully initialized add it to the object list. */ |
1599 | _dl_add_to_namespace_list (l, nsid); | |
1600 | ||
9dcafc55 UD |
1601 | #ifdef SHARED |
1602 | /* Auditing checkpoint: we have a new object. */ | |
29f97654 UD |
1603 | if (__builtin_expect (GLRO(dl_naudit) > 0, 0) |
1604 | && !GL(dl_ns)[l->l_ns]._ns_loaded->l_auditing) | |
9dcafc55 UD |
1605 | { |
1606 | struct audit_ifaces *afct = GLRO(dl_audit); | |
1607 | for (unsigned int cnt = 0; cnt < GLRO(dl_naudit); ++cnt) | |
1608 | { | |
1609 | if (afct->objopen != NULL) | |
1610 | { | |
1611 | l->l_audit[cnt].bindflags | |
1612 | = afct->objopen (l, nsid, &l->l_audit[cnt].cookie); | |
1613 | ||
1614 | l->l_audit_any_plt |= l->l_audit[cnt].bindflags != 0; | |
1615 | } | |
1616 | ||
1617 | afct = afct->next; | |
1618 | } | |
1619 | } | |
1620 | #endif | |
1621 | ||
d66e34cd RM |
1622 | return l; |
1623 | } | |
ba79d61b | 1624 | \f |
b5efde2f UD |
1625 | /* Print search path. */ |
1626 | static void | |
1627 | print_search_path (struct r_search_path_elem **list, | |
844c394a | 1628 | const char *what, const char *name) |
b5efde2f | 1629 | { |
12264bd7 | 1630 | char buf[max_dirnamelen + max_capstrlen]; |
b5efde2f UD |
1631 | int first = 1; |
1632 | ||
154d10bd | 1633 | _dl_debug_printf (" search path="); |
b5efde2f UD |
1634 | |
1635 | while (*list != NULL && (*list)->what == what) /* Yes, ==. */ | |
1636 | { | |
12264bd7 UD |
1637 | char *endp = __mempcpy (buf, (*list)->dirname, (*list)->dirnamelen); |
1638 | size_t cnt; | |
1639 | ||
1640 | for (cnt = 0; cnt < ncapstr; ++cnt) | |
1641 | if ((*list)->status[cnt] != nonexisting) | |
1642 | { | |
1643 | char *cp = __mempcpy (endp, capstr[cnt].str, capstr[cnt].len); | |
143e2b96 UD |
1644 | if (cp == buf || (cp == buf + 1 && buf[0] == '/')) |
1645 | cp[0] = '\0'; | |
1646 | else | |
1647 | cp[-1] = '\0'; | |
fb0356b9 UD |
1648 | |
1649 | _dl_debug_printf_c (first ? "%s" : ":%s", buf); | |
1650 | first = 0; | |
12264bd7 | 1651 | } |
b5efde2f | 1652 | |
b5efde2f UD |
1653 | ++list; |
1654 | } | |
1655 | ||
1656 | if (name != NULL) | |
35fc382a | 1657 | _dl_debug_printf_c ("\t\t(%s from file %s)\n", what, |
b9375348 | 1658 | DSO_FILENAME (name)); |
b5efde2f | 1659 | else |
35fc382a | 1660 | _dl_debug_printf_c ("\t\t(%s)\n", what); |
b5efde2f UD |
1661 | } |
1662 | \f | |
a35e137a UD |
1663 | /* Open a file and verify it is an ELF file for this architecture. We |
1664 | ignore only ELF files for other architectures. Non-ELF files and | |
1665 | ELF files with different header information cause fatal errors since | |
1666 | this could mean there is something wrong in the installation and the | |
1667 | user might want to know about this. */ | |
1668 | static int | |
9dcafc55 | 1669 | open_verify (const char *name, struct filebuf *fbp, struct link_map *loader, |
2e0fc40c | 1670 | int whatcode, bool *found_other_class, bool free_name) |
a35e137a UD |
1671 | { |
1672 | /* This is the expected ELF header. */ | |
1673 | #define ELF32_CLASS ELFCLASS32 | |
1674 | #define ELF64_CLASS ELFCLASS64 | |
1675 | #ifndef VALID_ELF_HEADER | |
1676 | # define VALID_ELF_HEADER(hdr,exp,size) (memcmp (hdr, exp, size) == 0) | |
1677 | # define VALID_ELF_OSABI(osabi) (osabi == ELFOSABI_SYSV) | |
d8c47894 | 1678 | # define VALID_ELF_ABIVERSION(osabi,ver) (ver == 0) |
40e2fc8b UD |
1679 | #elif defined MORE_ELF_HEADER_DATA |
1680 | MORE_ELF_HEADER_DATA; | |
a35e137a | 1681 | #endif |
04f2902d | 1682 | static const unsigned char expected[EI_NIDENT] = |
a35e137a UD |
1683 | { |
1684 | [EI_MAG0] = ELFMAG0, | |
1685 | [EI_MAG1] = ELFMAG1, | |
1686 | [EI_MAG2] = ELFMAG2, | |
1687 | [EI_MAG3] = ELFMAG3, | |
1688 | [EI_CLASS] = ELFW(CLASS), | |
1689 | [EI_DATA] = byteorder, | |
1690 | [EI_VERSION] = EV_CURRENT, | |
1691 | [EI_OSABI] = ELFOSABI_SYSV, | |
1692 | [EI_ABIVERSION] = 0 | |
1693 | }; | |
39b3385d UD |
1694 | static const struct |
1695 | { | |
1696 | ElfW(Word) vendorlen; | |
1697 | ElfW(Word) datalen; | |
1698 | ElfW(Word) type; | |
55c91021 | 1699 | char vendor[4]; |
a986484f | 1700 | } expected_note = { 4, 16, 1, "GNU" }; |
39b3385d UD |
1701 | /* Initialize it to make the compiler happy. */ |
1702 | const char *errstring = NULL; | |
1703 | int errval = 0; | |
a35e137a | 1704 | |
9dcafc55 UD |
1705 | #ifdef SHARED |
1706 | /* Give the auditing libraries a chance. */ | |
1707 | if (__builtin_expect (GLRO(dl_naudit) > 0, 0) && whatcode != 0 | |
1708 | && loader->l_auditing == 0) | |
1709 | { | |
1710 | struct audit_ifaces *afct = GLRO(dl_audit); | |
1711 | for (unsigned int cnt = 0; cnt < GLRO(dl_naudit); ++cnt) | |
1712 | { | |
1713 | if (afct->objsearch != NULL) | |
1714 | { | |
1715 | name = afct->objsearch (name, &loader->l_audit[cnt].cookie, | |
1716 | whatcode); | |
1717 | if (name == NULL) | |
1718 | /* Ignore the path. */ | |
1719 | return -1; | |
1720 | } | |
1721 | ||
1722 | afct = afct->next; | |
1723 | } | |
1724 | } | |
1725 | #endif | |
1726 | ||
a35e137a | 1727 | /* Open the file. We always open files read-only. */ |
b49865be | 1728 | int fd = __open (name, O_RDONLY | O_CLOEXEC); |
a35e137a UD |
1729 | if (fd != -1) |
1730 | { | |
1731 | ElfW(Ehdr) *ehdr; | |
a986484f | 1732 | ElfW(Phdr) *phdr, *ph; |
2f6773b5 | 1733 | ElfW(Word) *abi_note; |
a986484f UD |
1734 | unsigned int osversion; |
1735 | size_t maplength; | |
a35e137a UD |
1736 | |
1737 | /* We successfully openened the file. Now verify it is a file | |
1738 | we can use. */ | |
1739 | __set_errno (0); | |
88481c16 SP |
1740 | fbp->len = 0; |
1741 | assert (sizeof (fbp->buf) > sizeof (ElfW(Ehdr))); | |
1742 | /* Read in the header. */ | |
1743 | do | |
1744 | { | |
1745 | ssize_t retlen = __libc_read (fd, fbp->buf + fbp->len, | |
1746 | sizeof (fbp->buf) - fbp->len); | |
1747 | if (retlen <= 0) | |
1748 | break; | |
1749 | fbp->len += retlen; | |
1750 | } | |
1751 | while (__builtin_expect (fbp->len < sizeof (ElfW(Ehdr)), 0)); | |
a35e137a UD |
1752 | |
1753 | /* This is where the ELF header is loaded. */ | |
a35e137a UD |
1754 | ehdr = (ElfW(Ehdr) *) fbp->buf; |
1755 | ||
1756 | /* Now run the tests. */ | |
1757 | if (__builtin_expect (fbp->len < (ssize_t) sizeof (ElfW(Ehdr)), 0)) | |
39b3385d UD |
1758 | { |
1759 | errval = errno; | |
1760 | errstring = (errval == 0 | |
1761 | ? N_("file too short") : N_("cannot read file data")); | |
1762 | call_lose: | |
2e0fc40c UD |
1763 | if (free_name) |
1764 | { | |
1765 | char *realname = (char *) name; | |
1766 | name = strdupa (realname); | |
1767 | free (realname); | |
1768 | } | |
815e6fa3 | 1769 | lose (errval, fd, name, NULL, NULL, errstring, NULL, 0); |
39b3385d | 1770 | } |
a35e137a UD |
1771 | |
1772 | /* See whether the ELF header is what we expect. */ | |
1773 | if (__builtin_expect (! VALID_ELF_HEADER (ehdr->e_ident, expected, | |
92ad15a8 | 1774 | EI_ABIVERSION) |
d8c47894 | 1775 | || !VALID_ELF_ABIVERSION (ehdr->e_ident[EI_OSABI], |
04f2902d UD |
1776 | ehdr->e_ident[EI_ABIVERSION]) |
1777 | || memcmp (&ehdr->e_ident[EI_PAD], | |
1778 | &expected[EI_PAD], | |
1779 | EI_NIDENT - EI_PAD) != 0, | |
92ad15a8 | 1780 | 0)) |
a35e137a UD |
1781 | { |
1782 | /* Something is wrong. */ | |
6cc8844f UD |
1783 | const Elf32_Word *magp = (const void *) ehdr->e_ident; |
1784 | if (*magp != | |
a35e137a UD |
1785 | #if BYTE_ORDER == LITTLE_ENDIAN |
1786 | ((ELFMAG0 << (EI_MAG0 * 8)) | | |
1787 | (ELFMAG1 << (EI_MAG1 * 8)) | | |
1788 | (ELFMAG2 << (EI_MAG2 * 8)) | | |
1789 | (ELFMAG3 << (EI_MAG3 * 8))) | |
1790 | #else | |
1791 | ((ELFMAG0 << (EI_MAG3 * 8)) | | |
1792 | (ELFMAG1 << (EI_MAG2 * 8)) | | |
1793 | (ELFMAG2 << (EI_MAG1 * 8)) | | |
1794 | (ELFMAG3 << (EI_MAG0 * 8))) | |
1795 | #endif | |
1796 | ) | |
39b3385d UD |
1797 | errstring = N_("invalid ELF header"); |
1798 | else if (ehdr->e_ident[EI_CLASS] != ELFW(CLASS)) | |
7f71c55d UD |
1799 | { |
1800 | /* This is not a fatal error. On architectures where | |
1801 | 32-bit and 64-bit binaries can be run this might | |
1802 | happen. */ | |
1803 | *found_other_class = true; | |
1804 | goto close_and_out; | |
1805 | } | |
39b3385d | 1806 | else if (ehdr->e_ident[EI_DATA] != byteorder) |
a35e137a UD |
1807 | { |
1808 | if (BYTE_ORDER == BIG_ENDIAN) | |
39b3385d | 1809 | errstring = N_("ELF file data encoding not big-endian"); |
a35e137a | 1810 | else |
39b3385d | 1811 | errstring = N_("ELF file data encoding not little-endian"); |
a35e137a | 1812 | } |
39b3385d UD |
1813 | else if (ehdr->e_ident[EI_VERSION] != EV_CURRENT) |
1814 | errstring | |
1815 | = N_("ELF file version ident does not match current one"); | |
a35e137a UD |
1816 | /* XXX We should be able so set system specific versions which are |
1817 | allowed here. */ | |
39b3385d UD |
1818 | else if (!VALID_ELF_OSABI (ehdr->e_ident[EI_OSABI])) |
1819 | errstring = N_("ELF file OS ABI invalid"); | |
d8c47894 UD |
1820 | else if (!VALID_ELF_ABIVERSION (ehdr->e_ident[EI_OSABI], |
1821 | ehdr->e_ident[EI_ABIVERSION])) | |
39b3385d | 1822 | errstring = N_("ELF file ABI version invalid"); |
04f2902d UD |
1823 | else if (memcmp (&ehdr->e_ident[EI_PAD], &expected[EI_PAD], |
1824 | EI_NIDENT - EI_PAD) != 0) | |
1825 | errstring = N_("nonzero padding in e_ident"); | |
39b3385d UD |
1826 | else |
1827 | /* Otherwise we don't know what went wrong. */ | |
1828 | errstring = N_("internal error"); | |
1829 | ||
1830 | goto call_lose; | |
a35e137a UD |
1831 | } |
1832 | ||
1833 | if (__builtin_expect (ehdr->e_version, EV_CURRENT) != EV_CURRENT) | |
39b3385d UD |
1834 | { |
1835 | errstring = N_("ELF file version does not match current one"); | |
1836 | goto call_lose; | |
1837 | } | |
a35e137a | 1838 | if (! __builtin_expect (elf_machine_matches_host (ehdr), 1)) |
a986484f | 1839 | goto close_and_out; |
9987236e UD |
1840 | else if (__builtin_expect (ehdr->e_type, ET_DYN) != ET_DYN |
1841 | && __builtin_expect (ehdr->e_type, ET_EXEC) != ET_EXEC) | |
39b3385d UD |
1842 | { |
1843 | errstring = N_("only ET_DYN and ET_EXEC can be loaded"); | |
1844 | goto call_lose; | |
1845 | } | |
5ce98c3f UD |
1846 | else if (__builtin_expect (ehdr->e_phentsize, sizeof (ElfW(Phdr))) |
1847 | != sizeof (ElfW(Phdr))) | |
1848 | { | |
1849 | errstring = N_("ELF file's phentsize not the expected size"); | |
1850 | goto call_lose; | |
1851 | } | |
a986484f UD |
1852 | |
1853 | maplength = ehdr->e_phnum * sizeof (ElfW(Phdr)); | |
6dd67bd5 | 1854 | if (ehdr->e_phoff + maplength <= (size_t) fbp->len) |
a986484f UD |
1855 | phdr = (void *) (fbp->buf + ehdr->e_phoff); |
1856 | else | |
1857 | { | |
1858 | phdr = alloca (maplength); | |
0e15c4b6 | 1859 | __lseek (fd, ehdr->e_phoff, SEEK_SET); |
6dd67bd5 | 1860 | if ((size_t) __libc_read (fd, (void *) phdr, maplength) != maplength) |
39b3385d UD |
1861 | { |
1862 | read_error: | |
1863 | errval = errno; | |
1864 | errstring = N_("cannot read file data"); | |
1865 | goto call_lose; | |
1866 | } | |
a986484f UD |
1867 | } |
1868 | ||
1869 | /* Check .note.ABI-tag if present. */ | |
1870 | for (ph = phdr; ph < &phdr[ehdr->e_phnum]; ++ph) | |
2f6773b5 | 1871 | if (ph->p_type == PT_NOTE && ph->p_filesz >= 32 && ph->p_align >= 4) |
a986484f | 1872 | { |
2f6773b5 UD |
1873 | ElfW(Addr) size = ph->p_filesz; |
1874 | ||
1875 | if (ph->p_offset + size <= (size_t) fbp->len) | |
a986484f UD |
1876 | abi_note = (void *) (fbp->buf + ph->p_offset); |
1877 | else | |
1878 | { | |
2f6773b5 | 1879 | abi_note = alloca (size); |
0e15c4b6 | 1880 | __lseek (fd, ph->p_offset, SEEK_SET); |
2f6773b5 | 1881 | if (__libc_read (fd, (void *) abi_note, size) != size) |
39b3385d | 1882 | goto read_error; |
2f6773b5 UD |
1883 | } |
1884 | ||
1885 | while (memcmp (abi_note, &expected_note, sizeof (expected_note))) | |
1886 | { | |
1887 | #define ROUND(len) (((len) + sizeof (ElfW(Word)) - 1) & -sizeof (ElfW(Word))) | |
1888 | ElfW(Addr) note_size = 3 * sizeof (ElfW(Word)) | |
1889 | + ROUND (abi_note[0]) | |
1890 | + ROUND (abi_note[1]); | |
39b3385d | 1891 | |
2f6773b5 UD |
1892 | if (size - 32 < note_size) |
1893 | { | |
1894 | size = 0; | |
1895 | break; | |
1896 | } | |
1897 | size -= note_size; | |
1898 | abi_note = (void *) abi_note + note_size; | |
a986484f UD |
1899 | } |
1900 | ||
2f6773b5 | 1901 | if (size == 0) |
a986484f UD |
1902 | continue; |
1903 | ||
55c91021 UD |
1904 | osversion = (abi_note[5] & 0xff) * 65536 |
1905 | + (abi_note[6] & 0xff) * 256 | |
1906 | + (abi_note[7] & 0xff); | |
1907 | if (abi_note[4] != __ABI_TAG_OS | |
afdca0f2 | 1908 | || (GLRO(dl_osversion) && GLRO(dl_osversion) < osversion)) |
a986484f UD |
1909 | { |
1910 | close_and_out: | |
1911 | __close (fd); | |
1912 | __set_errno (ENOENT); | |
1913 | fd = -1; | |
1914 | } | |
1915 | ||
1916 | break; | |
1917 | } | |
a35e137a UD |
1918 | } |
1919 | ||
1920 | return fd; | |
1921 | } | |
1922 | \f | |
04ea3b0f | 1923 | /* Try to open NAME in one of the directories in *DIRSP. |
ba79d61b | 1924 | Return the fd, or -1. If successful, fill in *REALNAME |
04ea3b0f UD |
1925 | with the malloc'd full directory name. If it turns out |
1926 | that none of the directories in *DIRSP exists, *DIRSP is | |
1927 | replaced with (void *) -1, and the old value is free()d | |
1928 | if MAY_FREE_DIRS is true. */ | |
ba79d61b RM |
1929 | |
1930 | static int | |
8e9f92e9 | 1931 | open_path (const char *name, size_t namelen, int secure, |
a35e137a | 1932 | struct r_search_path_struct *sps, char **realname, |
7f71c55d UD |
1933 | struct filebuf *fbp, struct link_map *loader, int whatcode, |
1934 | bool *found_other_class) | |
ba79d61b | 1935 | { |
f55727ca | 1936 | struct r_search_path_elem **dirs = sps->dirs; |
ba79d61b | 1937 | char *buf; |
0a54e401 | 1938 | int fd = -1; |
b5efde2f | 1939 | const char *current_what = NULL; |
152e7964 | 1940 | int any = 0; |
ba79d61b | 1941 | |
ab1d521d RM |
1942 | if (__builtin_expect (dirs == NULL, 0)) |
1943 | /* We're called before _dl_init_paths when loading the main executable | |
1944 | given on the command line when rtld is run directly. */ | |
1945 | return -1; | |
1946 | ||
5431ece5 | 1947 | buf = alloca (max_dirnamelen + max_capstrlen + namelen); |
ba79d61b RM |
1948 | do |
1949 | { | |
0a54e401 UD |
1950 | struct r_search_path_elem *this_dir = *dirs; |
1951 | size_t buflen = 0; | |
12264bd7 | 1952 | size_t cnt; |
b0b67c47 | 1953 | char *edp; |
f5858039 | 1954 | int here_any = 0; |
55c91021 | 1955 | int err; |
ba79d61b | 1956 | |
b5efde2f UD |
1957 | /* If we are debugging the search for libraries print the path |
1958 | now if it hasn't happened now. */ | |
afdca0f2 | 1959 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_LIBS, 0) |
cf197e41 | 1960 | && current_what != this_dir->what) |
b5efde2f UD |
1961 | { |
1962 | current_what = this_dir->what; | |
1963 | print_search_path (dirs, current_what, this_dir->where); | |
1964 | } | |
1965 | ||
b0b67c47 | 1966 | edp = (char *) __mempcpy (buf, this_dir->dirname, this_dir->dirnamelen); |
12264bd7 | 1967 | for (cnt = 0; fd == -1 && cnt < ncapstr; ++cnt) |
fd26970f | 1968 | { |
12264bd7 UD |
1969 | /* Skip this directory if we know it does not exist. */ |
1970 | if (this_dir->status[cnt] == nonexisting) | |
1971 | continue; | |
0a54e401 | 1972 | |
12264bd7 | 1973 | buflen = |
d6b5d570 UD |
1974 | ((char *) __mempcpy (__mempcpy (edp, capstr[cnt].str, |
1975 | capstr[cnt].len), | |
12264bd7 UD |
1976 | name, namelen) |
1977 | - buf); | |
1978 | ||
1979 | /* Print name we try if this is wanted. */ | |
afdca0f2 | 1980 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_LIBS, 0)) |
154d10bd | 1981 | _dl_debug_printf (" trying file=%s\n", buf); |
b5efde2f | 1982 | |
2e0fc40c UD |
1983 | fd = open_verify (buf, fbp, loader, whatcode, found_other_class, |
1984 | false); | |
12264bd7 | 1985 | if (this_dir->status[cnt] == unknown) |
6e4c40ba UD |
1986 | { |
1987 | if (fd != -1) | |
1988 | this_dir->status[cnt] = existing; | |
9dcafc55 UD |
1989 | /* Do not update the directory information when loading |
1990 | auditing code. We must try to disturb the program as | |
1991 | little as possible. */ | |
1992 | else if (loader == NULL | |
361a3706 | 1993 | || GL(dl_ns)[loader->l_ns]._ns_loaded->l_auditing == 0) |
6e4c40ba UD |
1994 | { |
1995 | /* We failed to open machine dependent library. Let's | |
1996 | test whether there is any directory at all. */ | |
5763742f | 1997 | struct stat64 st; |
6e4c40ba UD |
1998 | |
1999 | buf[buflen - namelen - 1] = '\0'; | |
2000 | ||
5763742f | 2001 | if (__xstat64 (_STAT_VER, buf, &st) != 0 |
6e4c40ba UD |
2002 | || ! S_ISDIR (st.st_mode)) |
2003 | /* The directory does not exist or it is no directory. */ | |
2004 | this_dir->status[cnt] = nonexisting; | |
2005 | else | |
2006 | this_dir->status[cnt] = existing; | |
2007 | } | |
2008 | } | |
fd26970f | 2009 | |
152e7964 | 2010 | /* Remember whether we found any existing directory. */ |
9dcafc55 | 2011 | here_any |= this_dir->status[cnt] != nonexisting; |
152e7964 | 2012 | |
8e9f92e9 | 2013 | if (fd != -1 && __builtin_expect (secure, 0) |
e6caf4e1 | 2014 | && INTUSE(__libc_enable_secure)) |
c6222ab9 UD |
2015 | { |
2016 | /* This is an extra security effort to make sure nobody can | |
2017 | preload broken shared objects which are in the trusted | |
2018 | directories and so exploit the bugs. */ | |
5763742f | 2019 | struct stat64 st; |
c6222ab9 | 2020 | |
5763742f | 2021 | if (__fxstat64 (_STAT_VER, fd, &st) != 0 |
c6222ab9 UD |
2022 | || (st.st_mode & S_ISUID) == 0) |
2023 | { | |
2024 | /* The shared object cannot be tested for being SUID | |
2025 | or this bit is not set. In this case we must not | |
2026 | use this object. */ | |
2027 | __close (fd); | |
2028 | fd = -1; | |
2029 | /* We simply ignore the file, signal this by setting | |
2030 | the error value which would have been set by `open'. */ | |
2031 | errno = ENOENT; | |
2032 | } | |
2033 | } | |
ba79d61b RM |
2034 | } |
2035 | ||
ba79d61b RM |
2036 | if (fd != -1) |
2037 | { | |
2f653c01 | 2038 | *realname = (char *) malloc (buflen); |
c6222ab9 | 2039 | if (*realname != NULL) |
ba79d61b RM |
2040 | { |
2041 | memcpy (*realname, buf, buflen); | |
2042 | return fd; | |
2043 | } | |
2044 | else | |
2045 | { | |
2046 | /* No memory for the name, we certainly won't be able | |
2047 | to load and link it. */ | |
2048 | __close (fd); | |
2049 | return -1; | |
2050 | } | |
2051 | } | |
55c91021 | 2052 | if (here_any && (err = errno) != ENOENT && err != EACCES) |
ba79d61b RM |
2053 | /* The file exists and is readable, but something went wrong. */ |
2054 | return -1; | |
f5858039 UD |
2055 | |
2056 | /* Remember whether we found anything. */ | |
2057 | any |= here_any; | |
ba79d61b | 2058 | } |
0a54e401 | 2059 | while (*++dirs != NULL); |
ba79d61b | 2060 | |
152e7964 | 2061 | /* Remove the whole path if none of the directories exists. */ |
55c91021 | 2062 | if (__builtin_expect (! any, 0)) |
152e7964 | 2063 | { |
04ea3b0f UD |
2064 | /* Paths which were allocated using the minimal malloc() in ld.so |
2065 | must not be freed using the general free() in libc. */ | |
f55727ca UD |
2066 | if (sps->malloced) |
2067 | free (sps->dirs); | |
11bf311e | 2068 | |
ecc1d0c3 UD |
2069 | /* rtld_search_dirs is attribute_relro, therefore avoid writing |
2070 | into it. */ | |
2071 | if (sps != &rtld_search_dirs) | |
ecc1d0c3 | 2072 | sps->dirs = (void *) -1; |
152e7964 UD |
2073 | } |
2074 | ||
ba79d61b RM |
2075 | return -1; |
2076 | } | |
2077 | ||
2078 | /* Map in the shared object file NAME. */ | |
2079 | ||
2080 | struct link_map * | |
d0fc4041 | 2081 | internal_function |
8e9f92e9 | 2082 | _dl_map_object (struct link_map *loader, const char *name, |
c0f62c56 | 2083 | int type, int trace_mode, int mode, Lmid_t nsid) |
ba79d61b RM |
2084 | { |
2085 | int fd; | |
2086 | char *realname; | |
14bab8de | 2087 | char *name_copy; |
ba79d61b | 2088 | struct link_map *l; |
a35e137a | 2089 | struct filebuf fb; |
ba79d61b | 2090 | |
c0f62c56 | 2091 | assert (nsid >= 0); |
22c83193 | 2092 | assert (nsid < GL(dl_nns)); |
c0f62c56 | 2093 | |
ba79d61b | 2094 | /* Look for this name among those already loaded. */ |
c0f62c56 | 2095 | for (l = GL(dl_ns)[nsid]._ns_loaded; l; l = l->l_next) |
f41c8091 UD |
2096 | { |
2097 | /* If the requested name matches the soname of a loaded object, | |
2098 | use that object. Elide this check for names that have not | |
2099 | yet been opened. */ | |
20fe49b9 UD |
2100 | if (__builtin_expect (l->l_faked, 0) != 0 |
2101 | || __builtin_expect (l->l_removed, 0) != 0) | |
f41c8091 UD |
2102 | continue; |
2103 | if (!_dl_name_match_p (name, l)) | |
2104 | { | |
2105 | const char *soname; | |
2106 | ||
c91bc73e UD |
2107 | if (__builtin_expect (l->l_soname_added, 1) |
2108 | || l->l_info[DT_SONAME] == NULL) | |
f41c8091 UD |
2109 | continue; |
2110 | ||
8699e7b1 UD |
2111 | soname = ((const char *) D_PTR (l, l_info[DT_STRTAB]) |
2112 | + l->l_info[DT_SONAME]->d_un.d_val); | |
f41c8091 UD |
2113 | if (strcmp (name, soname) != 0) |
2114 | continue; | |
2115 | ||
2116 | /* We have a match on a new name -- cache it. */ | |
76156ea1 | 2117 | add_name_to_object (l, soname); |
c91bc73e | 2118 | l->l_soname_added = 1; |
f41c8091 UD |
2119 | } |
2120 | ||
42c4f32a | 2121 | /* We have a match. */ |
f41c8091 UD |
2122 | return l; |
2123 | } | |
ba79d61b | 2124 | |
8193034b | 2125 | /* Display information if we are debugging. */ |
afdca0f2 | 2126 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_FILES, 0) |
7969407a | 2127 | && loader != NULL) |
07df30d9 | 2128 | _dl_debug_printf ((mode & __RTLD_CALLMAP) == 0 |
9ac533d3 UD |
2129 | ? "\nfile=%s [%lu]; needed by %s [%lu]\n" |
2130 | : "\nfile=%s [%lu]; dynamically loaded by %s [%lu]\n", | |
b9375348 | 2131 | name, nsid, DSO_FILENAME (loader->l_name), loader->l_ns); |
8193034b | 2132 | |
9dcafc55 UD |
2133 | #ifdef SHARED |
2134 | /* Give the auditing libraries a chance to change the name before we | |
2135 | try anything. */ | |
2136 | if (__builtin_expect (GLRO(dl_naudit) > 0, 0) | |
2137 | && (loader == NULL || loader->l_auditing == 0)) | |
2138 | { | |
2139 | struct audit_ifaces *afct = GLRO(dl_audit); | |
2140 | for (unsigned int cnt = 0; cnt < GLRO(dl_naudit); ++cnt) | |
2141 | { | |
2142 | if (afct->objsearch != NULL) | |
2143 | { | |
2144 | name = afct->objsearch (name, &loader->l_audit[cnt].cookie, | |
2145 | LA_SER_ORIG); | |
2146 | if (name == NULL) | |
2147 | { | |
2148 | /* Do not try anything further. */ | |
2149 | fd = -1; | |
2150 | goto no_file; | |
2151 | } | |
2152 | } | |
2153 | ||
2154 | afct = afct->next; | |
2155 | } | |
2156 | } | |
2157 | #endif | |
2158 | ||
7f71c55d UD |
2159 | /* Will be true if we found a DSO which is of the other ELF class. */ |
2160 | bool found_other_class = false; | |
2161 | ||
ba79d61b RM |
2162 | if (strchr (name, '/') == NULL) |
2163 | { | |
2164 | /* Search for NAME in several places. */ | |
2165 | ||
2166 | size_t namelen = strlen (name) + 1; | |
2167 | ||
afdca0f2 | 2168 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_LIBS, 0)) |
c0f62c56 | 2169 | _dl_debug_printf ("find library=%s [%lu]; searching\n", name, nsid); |
b5efde2f | 2170 | |
ba79d61b | 2171 | fd = -1; |
a23db8e4 | 2172 | |
fcf70d41 | 2173 | /* When the object has the RUNPATH information we don't use any |
844c394a | 2174 | RPATHs. */ |
4c540916 | 2175 | if (loader == NULL || loader->l_info[DT_RUNPATH] == NULL) |
fcf70d41 | 2176 | { |
a1f0de82 UD |
2177 | /* This is the executable's map (if there is one). Make sure that |
2178 | we do not look at it twice. */ | |
2179 | struct link_map *main_map = GL(dl_ns)[LM_ID_BASE]._ns_loaded; | |
2180 | bool did_main_map = false; | |
2181 | ||
fcf70d41 UD |
2182 | /* First try the DT_RPATH of the dependent object that caused NAME |
2183 | to be loaded. Then that object's dependent, and on up. */ | |
a1f0de82 | 2184 | for (l = loader; l; l = l->l_loader) |
45e4762c | 2185 | if (cache_rpath (l, &l->l_rpath_dirs, DT_RPATH, "RPATH")) |
a1f0de82 | 2186 | { |
8e9f92e9 AS |
2187 | fd = open_path (name, namelen, mode & __RTLD_SECURE, |
2188 | &l->l_rpath_dirs, | |
a1f0de82 UD |
2189 | &realname, &fb, loader, LA_SER_RUNPATH, |
2190 | &found_other_class); | |
2191 | if (fd != -1) | |
2192 | break; | |
2193 | ||
2194 | did_main_map |= l == main_map; | |
2195 | } | |
0a54e401 | 2196 | |
fcf70d41 | 2197 | /* If dynamically linked, try the DT_RPATH of the executable |
844c394a | 2198 | itself. NB: we do this for lookups in any namespace. */ |
a1f0de82 UD |
2199 | if (fd == -1 && !did_main_map |
2200 | && main_map != NULL && main_map->l_type != lt_loaded | |
2201 | && cache_rpath (main_map, &main_map->l_rpath_dirs, DT_RPATH, | |
2202 | "RPATH")) | |
8e9f92e9 AS |
2203 | fd = open_path (name, namelen, mode & __RTLD_SECURE, |
2204 | &main_map->l_rpath_dirs, | |
a1f0de82 UD |
2205 | &realname, &fb, loader ?: main_map, LA_SER_RUNPATH, |
2206 | &found_other_class); | |
fcf70d41 | 2207 | } |
fd26970f | 2208 | |
7ef90c15 | 2209 | /* Try the LD_LIBRARY_PATH environment variable. */ |
f55727ca | 2210 | if (fd == -1 && env_path_list.dirs != (void *) -1) |
8e9f92e9 | 2211 | fd = open_path (name, namelen, mode & __RTLD_SECURE, &env_path_list, |
9dcafc55 UD |
2212 | &realname, &fb, |
2213 | loader ?: GL(dl_ns)[LM_ID_BASE]._ns_loaded, | |
7f71c55d | 2214 | LA_SER_LIBPATH, &found_other_class); |
40a55d20 | 2215 | |
45e4762c RM |
2216 | /* Look at the RUNPATH information for this binary. */ |
2217 | if (fd == -1 && loader != NULL | |
2218 | && cache_rpath (loader, &loader->l_runpath_dirs, | |
2219 | DT_RUNPATH, "RUNPATH")) | |
8e9f92e9 | 2220 | fd = open_path (name, namelen, mode & __RTLD_SECURE, |
9dcafc55 | 2221 | &loader->l_runpath_dirs, &realname, &fb, loader, |
7f71c55d | 2222 | LA_SER_RUNPATH, &found_other_class); |
fcf70d41 | 2223 | |
f57f8055 | 2224 | #ifdef USE_LDCONFIG |
55c91021 | 2225 | if (fd == -1 |
8e9f92e9 | 2226 | && (__builtin_expect (! (mode & __RTLD_SECURE), 1) |
73d65cc3 SP |
2227 | || ! INTUSE(__libc_enable_secure)) |
2228 | && __builtin_expect (GLRO(dl_inhibit_cache) == 0, 1)) | |
f18edac3 RM |
2229 | { |
2230 | /* Check the list of libraries in the file /etc/ld.so.cache, | |
2231 | for compatibility with Linux's ldconfig program. */ | |
f18edac3 | 2232 | const char *cached = _dl_load_cache_lookup (name); |
0f6b172f | 2233 | |
2f653c01 UD |
2234 | if (cached != NULL) |
2235 | { | |
f57f8055 | 2236 | # ifdef SHARED |
c0f62c56 | 2237 | // XXX Correct to unconditionally default to namespace 0? |
6a5ee102 UD |
2238 | l = (loader |
2239 | ?: GL(dl_ns)[LM_ID_BASE]._ns_loaded | |
2240 | ?: &GL(dl_rtld_map)); | |
f57f8055 | 2241 | # else |
2f653c01 | 2242 | l = loader; |
f57f8055 | 2243 | # endif |
0f6b172f | 2244 | |
266bb989 UD |
2245 | /* If the loader has the DF_1_NODEFLIB flag set we must not |
2246 | use a cache entry from any of these directories. */ | |
2f653c01 | 2247 | if ( |
f57f8055 | 2248 | # ifndef SHARED |
2f653c01 UD |
2249 | /* 'l' is always != NULL for dynamically linked objects. */ |
2250 | l != NULL && | |
f57f8055 | 2251 | # endif |
2f653c01 | 2252 | __builtin_expect (l->l_flags_1 & DF_1_NODEFLIB, 0)) |
266bb989 UD |
2253 | { |
2254 | const char *dirp = system_dirs; | |
2e47aff5 | 2255 | unsigned int cnt = 0; |
266bb989 UD |
2256 | |
2257 | do | |
2258 | { | |
2259 | if (memcmp (cached, dirp, system_dirs_len[cnt]) == 0) | |
2260 | { | |
2261 | /* The prefix matches. Don't use the entry. */ | |
2262 | cached = NULL; | |
2263 | break; | |
2264 | } | |
2265 | ||
2266 | dirp += system_dirs_len[cnt] + 1; | |
2267 | ++cnt; | |
2268 | } | |
4a6d1198 | 2269 | while (cnt < nsystem_dirs_len); |
266bb989 UD |
2270 | } |
2271 | ||
2f653c01 | 2272 | if (cached != NULL) |
f18edac3 | 2273 | { |
9dcafc55 UD |
2274 | fd = open_verify (cached, |
2275 | &fb, loader ?: GL(dl_ns)[nsid]._ns_loaded, | |
2e0fc40c | 2276 | LA_SER_CONFIG, &found_other_class, false); |
2f653c01 | 2277 | if (__builtin_expect (fd != -1, 1)) |
f18edac3 | 2278 | { |
266bb989 UD |
2279 | realname = local_strdup (cached); |
2280 | if (realname == NULL) | |
2281 | { | |
2282 | __close (fd); | |
2283 | fd = -1; | |
2284 | } | |
f18edac3 RM |
2285 | } |
2286 | } | |
2287 | } | |
2288 | } | |
f57f8055 | 2289 | #endif |
0a54e401 | 2290 | |
a23db8e4 | 2291 | /* Finally, try the default path. */ |
266bb989 | 2292 | if (fd == -1 |
c0f62c56 | 2293 | && ((l = loader ?: GL(dl_ns)[nsid]._ns_loaded) == NULL |
db2ebcef | 2294 | || __builtin_expect (!(l->l_flags_1 & DF_1_NODEFLIB), 1)) |
f55727ca | 2295 | && rtld_search_dirs.dirs != (void *) -1) |
8e9f92e9 | 2296 | fd = open_path (name, namelen, mode & __RTLD_SECURE, &rtld_search_dirs, |
7f71c55d | 2297 | &realname, &fb, l, LA_SER_DEFAULT, &found_other_class); |
b5efde2f | 2298 | |
fd77c361 | 2299 | /* Add another newline when we are tracing the library loading. */ |
afdca0f2 | 2300 | if (__builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_LIBS, 0)) |
844c394a | 2301 | _dl_debug_printf ("\n"); |
ba79d61b RM |
2302 | } |
2303 | else | |
2304 | { | |
f787edde UD |
2305 | /* The path may contain dynamic string tokens. */ |
2306 | realname = (loader | |
34fe483e | 2307 | ? expand_dynamic_string_token (loader, name, 0) |
f787edde UD |
2308 | : local_strdup (name)); |
2309 | if (realname == NULL) | |
2310 | fd = -1; | |
2311 | else | |
ba79d61b | 2312 | { |
9dcafc55 | 2313 | fd = open_verify (realname, &fb, |
7f71c55d | 2314 | loader ?: GL(dl_ns)[nsid]._ns_loaded, 0, |
2e0fc40c | 2315 | &found_other_class, true); |
55c91021 | 2316 | if (__builtin_expect (fd, 0) == -1) |
f787edde | 2317 | free (realname); |
ba79d61b RM |
2318 | } |
2319 | } | |
2320 | ||
9dcafc55 UD |
2321 | #ifdef SHARED |
2322 | no_file: | |
2323 | #endif | |
c14e9135 UD |
2324 | /* In case the LOADER information has only been provided to get to |
2325 | the appropriate RUNPATH/RPATH information we do not need it | |
2326 | anymore. */ | |
2327 | if (mode & __RTLD_CALLMAP) | |
2328 | loader = NULL; | |
2329 | ||
55c91021 | 2330 | if (__builtin_expect (fd, 0) == -1) |
46ec036d | 2331 | { |
32e6df36 | 2332 | if (trace_mode |
afdca0f2 | 2333 | && __builtin_expect (GLRO(dl_debug_mask) & DL_DEBUG_PRELINK, 0) == 0) |
46ec036d UD |
2334 | { |
2335 | /* We haven't found an appropriate library. But since we | |
2336 | are only interested in the list of libraries this isn't | |
2337 | so severe. Fake an entry with all the information we | |
1ef32c3d | 2338 | have. */ |
a1eca9f3 | 2339 | static const Elf_Symndx dummy_bucket = STN_UNDEF; |
46ec036d | 2340 | |
f0967738 | 2341 | /* Allocate a new object map. */ |
46ec036d | 2342 | if ((name_copy = local_strdup (name)) == NULL |
1fc07491 | 2343 | || (l = _dl_new_object (name_copy, name, type, loader, |
c0f62c56 | 2344 | mode, nsid)) == NULL) |
2e0fc40c UD |
2345 | { |
2346 | free (name_copy); | |
2347 | _dl_signal_error (ENOMEM, name, NULL, | |
2348 | N_("cannot create shared object descriptor")); | |
2349 | } | |
a881e0a0 UD |
2350 | /* Signal that this is a faked entry. */ |
2351 | l->l_faked = 1; | |
2352 | /* Since the descriptor is initialized with zero we do not | |
126b06f9 | 2353 | have do this here. |
126b06f9 | 2354 | l->l_reserved = 0; */ |
fd26970f UD |
2355 | l->l_buckets = &dummy_bucket; |
2356 | l->l_nbuckets = 1; | |
2357 | l->l_relocated = 1; | |
2358 | ||
f0967738 AK |
2359 | /* Enter the object in the object list. */ |
2360 | _dl_add_to_namespace_list (l, nsid); | |
2361 | ||
fd26970f | 2362 | return l; |
46ec036d | 2363 | } |
7f71c55d UD |
2364 | else if (found_other_class) |
2365 | _dl_signal_error (0, name, NULL, | |
2366 | ELFW(CLASS) == ELFCLASS32 | |
2367 | ? N_("wrong ELF class: ELFCLASS64") | |
2368 | : N_("wrong ELF class: ELFCLASS32")); | |
46ec036d | 2369 | else |
154d10bd UD |
2370 | _dl_signal_error (errno, name, NULL, |
2371 | N_("cannot open shared object file")); | |
46ec036d | 2372 | } |
ba79d61b | 2373 | |
d1fc817e UD |
2374 | void *stack_end = __libc_stack_end; |
2375 | return _dl_map_object_from_fd (name, fd, &fb, realname, loader, type, mode, | |
c0f62c56 | 2376 | &stack_end, nsid); |
ba79d61b | 2377 | } |
154d10bd | 2378 | |
45e4762c RM |
2379 | |
2380 | void | |
2381 | internal_function | |
2382 | _dl_rtld_di_serinfo (struct link_map *loader, Dl_serinfo *si, bool counting) | |
2383 | { | |
2384 | if (counting) | |
2385 | { | |
2386 | si->dls_cnt = 0; | |
2387 | si->dls_size = 0; | |
2388 | } | |
2389 | ||
2390 | unsigned int idx = 0; | |
2391 | char *allocptr = (char *) &si->dls_serpath[si->dls_cnt]; | |
dd9423a6 | 2392 | void add_path (const struct r_search_path_struct *sps, unsigned int flags) |
45e4762c RM |
2393 | # define add_path(sps, flags) add_path(sps, 0) /* XXX */ |
2394 | { | |
2395 | if (sps->dirs != (void *) -1) | |
2396 | { | |
2397 | struct r_search_path_elem **dirs = sps->dirs; | |
2398 | do | |
2399 | { | |
2400 | const struct r_search_path_elem *const r = *dirs++; | |
2401 | if (counting) | |
2402 | { | |
2403 | si->dls_cnt++; | |
88197030 | 2404 | si->dls_size += MAX (2, r->dirnamelen); |
45e4762c RM |
2405 | } |
2406 | else | |
2407 | { | |
2408 | Dl_serpath *const sp = &si->dls_serpath[idx++]; | |
2409 | sp->dls_name = allocptr; | |
1c298d08 UD |
2410 | if (r->dirnamelen < 2) |
2411 | *allocptr++ = r->dirnamelen ? '/' : '.'; | |
2412 | else | |
2413 | allocptr = __mempcpy (allocptr, | |
2414 | r->dirname, r->dirnamelen - 1); | |
45e4762c RM |
2415 | *allocptr++ = '\0'; |
2416 | sp->dls_flags = flags; | |
2417 | } | |
2418 | } | |
2419 | while (*dirs != NULL); | |
2420 | } | |
2421 | } | |
2422 | ||
2423 | /* When the object has the RUNPATH information we don't use any RPATHs. */ | |
2424 | if (loader->l_info[DT_RUNPATH] == NULL) | |
2425 | { | |
2426 | /* First try the DT_RPATH of the dependent object that caused NAME | |
2427 | to be loaded. Then that object's dependent, and on up. */ | |
2428 | ||
2429 | struct link_map *l = loader; | |
2430 | do | |
2431 | { | |
2432 | if (cache_rpath (l, &l->l_rpath_dirs, DT_RPATH, "RPATH")) | |
2433 | add_path (&l->l_rpath_dirs, XXX_RPATH); | |
2434 | l = l->l_loader; | |
2435 | } | |
2436 | while (l != NULL); | |
2437 | ||
2438 | /* If dynamically linked, try the DT_RPATH of the executable itself. */ | |
c0f62c56 UD |
2439 | if (loader->l_ns == LM_ID_BASE) |
2440 | { | |
2441 | l = GL(dl_ns)[LM_ID_BASE]._ns_loaded; | |
2442 | if (l != NULL && l->l_type != lt_loaded && l != loader) | |
2443 | if (cache_rpath (l, &l->l_rpath_dirs, DT_RPATH, "RPATH")) | |
2444 | add_path (&l->l_rpath_dirs, XXX_RPATH); | |
2445 | } | |
45e4762c RM |
2446 | } |
2447 | ||
2448 | /* Try the LD_LIBRARY_PATH environment variable. */ | |
2449 | add_path (&env_path_list, XXX_ENV); | |
2450 | ||
2451 | /* Look at the RUNPATH information for this binary. */ | |
2452 | if (cache_rpath (loader, &loader->l_runpath_dirs, DT_RUNPATH, "RUNPATH")) | |
2453 | add_path (&loader->l_runpath_dirs, XXX_RUNPATH); | |
2454 | ||
2455 | /* XXX | |
2456 | Here is where ld.so.cache gets checked, but we don't have | |
2457 | a way to indicate that in the results for Dl_serinfo. */ | |
2458 | ||
2459 | /* Finally, try the default path. */ | |
2460 | if (!(loader->l_flags_1 & DF_1_NODEFLIB)) | |
2461 | add_path (&rtld_search_dirs, XXX_default); | |
2462 | ||
2463 | if (counting) | |
2464 | /* Count the struct size before the string area, which we didn't | |
2465 | know before we completed dls_cnt. */ | |
2466 | si->dls_size += (char *) &si->dls_serpath[si->dls_cnt] - (char *) si; | |
2467 | } |