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