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