1 /* Map in a shared object's segments from the file.
2 Copyright (C) 1995,96,97,98,99,2000,2001,2002 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
5 The GNU C Library is free software; you can redistribute it and/or
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.
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
13 Lesser General Public License for more details.
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
30 #include <sys/param.h>
32 #include <sys/types.h>
33 #include "dynamic-link.h"
35 #include <dl-osinfo.h>
39 /* On some systems, no flag bits are given to specify file mapping. */
44 /* The right way to map in the shared library files is MAP_COPY, which
45 makes a virtual copy of the data at the time of the mmap call; this
46 guarantees the mapped pages will be consistent even if the file is
47 overwritten. Some losing VM systems like Linux's lack MAP_COPY. All we
48 get is MAP_PRIVATE, which copies each page when it is modified; this
49 means if the file is overwritten, we may at some point get some pages
50 from the new version after starting with pages from the old version. */
52 # define MAP_COPY MAP_PRIVATE
55 /* Some systems link their relocatable objects for another base address
56 than 0. We want to know the base address for these such that we can
57 subtract this address from the segment addresses during mapping.
58 This results in a more efficient address space usage. Defaults to
59 zero for almost all systems. */
61 # define MAP_BASE_ADDR(l) 0
66 #if BYTE_ORDER == BIG_ENDIAN
67 # define byteorder ELFDATA2MSB
68 #elif BYTE_ORDER == LITTLE_ENDIAN
69 # define byteorder ELFDATA2LSB
71 # error "Unknown BYTE_ORDER " BYTE_ORDER
72 # define byteorder ELFDATANONE
75 #define STRING(x) __STRING (x)
78 /* The fd is not examined when using MAP_ANON. */
82 # define ANONFD _dl_zerofd
85 /* Handle situations where we have a preferred location in memory for
86 the shared objects. */
87 #ifdef ELF_PREFERRED_ADDRESS_DATA
88 ELF_PREFERRED_ADDRESS_DATA
;
90 #ifndef ELF_PREFERRED_ADDRESS
91 # define ELF_PREFERRED_ADDRESS(loader, maplength, mapstartpref) (mapstartpref)
93 #ifndef ELF_FIXED_ADDRESS
94 # define ELF_FIXED_ADDRESS(loader, mapstart) ((void) 0)
97 /* Type for the buffer we put the ELF header and hopefully the program
98 header. This buffer does not really have to be too large. In most
99 cases the program header follows the ELF header directly. If this
100 is not the case all bets are off and we can make the header arbitrarily
101 large and still won't get it read. This means the only question is
102 how large are the ELF and program header combined. The ELF header
103 in 64-bit files is 56 bytes long. Each program header entry is again
104 56 bytes long. I.e., even with a file which has 17 program header
105 entries we only have to read 1kB. And 17 program header entries is
106 plenty, normal files have < 10. If this heuristic should really fail
107 for some file the code in `_dl_map_object_from_fd' knows how to
115 /* This is the decomposed LD_LIBRARY_PATH search path. */
116 static struct r_search_path_struct env_path_list
;
118 /* List of the hardware capabilities we might end up using. */
119 static const struct r_strlenpair
*capstr
;
120 static size_t ncapstr
;
121 static size_t max_capstrlen
;
124 /* Get the generated information about the trusted directories. */
125 #include "trusted-dirs.h"
127 static const char system_dirs
[] = SYSTEM_DIRS
;
128 static const size_t system_dirs_len
[] =
132 #define nsystem_dirs_len \
133 (sizeof (system_dirs_len) / sizeof (system_dirs_len[0]))
136 /* Local version of `strdup' function. */
138 local_strdup (const char *s
)
140 size_t len
= strlen (s
) + 1;
141 void *new = malloc (len
);
146 return (char *) memcpy (new, s
, len
);
151 is_dst (const char *start
, const char *name
, const char *str
,
152 int is_path
, int secure
)
155 bool is_curly
= false;
164 while (name
[len
] == str
[len
] && name
[len
] != '\0')
169 if (name
[len
] != '}')
172 /* Point again at the beginning of the name. */
174 /* Skip over closing curly brace and adjust for the --name. */
177 else if (name
[len
] != '\0' && name
[len
] != '/'
178 && (!is_path
|| name
[len
] != ':'))
181 if (__builtin_expect (secure
, 0)
182 && ((name
[len
] != '\0' && (!is_path
|| name
[len
] != ':'))
183 || (name
!= start
+ 1 && (!is_path
|| name
[-2] != ':'))))
191 _dl_dst_count (const char *name
, int is_path
)
193 const char *const start
= name
;
200 /* $ORIGIN is not expanded for SUID/GUID programs (except if it
201 is $ORIGIN alone) and it must always appear first in path. */
203 if ((len
= is_dst (start
, name
, "ORIGIN", is_path
,
204 __libc_enable_secure
)) != 0
205 || ((len
= is_dst (start
, name
, "PLATFORM", is_path
, 0))
209 name
= strchr (name
+ len
, '$');
211 while (name
!= NULL
);
215 INTDEF (_dl_dst_count
)
219 _dl_dst_substitute (struct link_map
*l
, const char *name
, char *result
,
222 const char *const start
= name
;
223 char *last_elem
, *wp
;
225 /* Now fill the result path. While copying over the string we keep
226 track of the start of the last path element. When we come accross
227 a DST we copy over the value or (if the value is not available)
228 leave the entire path element out. */
229 last_elem
= wp
= result
;
233 if (__builtin_expect (*name
== '$', 0))
235 const char *repl
= NULL
;
239 if ((len
= is_dst (start
, name
, "ORIGIN", is_path
,
240 __libc_enable_secure
)) != 0)
242 else if ((len
= is_dst (start
, name
, "PLATFORM", is_path
,
244 repl
= GL(dl_platform
);
246 if (repl
!= NULL
&& repl
!= (const char *) -1)
248 wp
= __stpcpy (wp
, repl
);
253 /* We cannot use this path element, the value of the
254 replacement is unknown. */
257 while (*name
!= '\0' && (!is_path
|| *name
!= ':'))
261 /* No DST we recognize. */
267 if (is_path
&& *name
== ':')
271 while (*name
!= '\0');
277 INTDEF (_dl_dst_substitute
)
280 /* Return copy of argument with all recognized dynamic string tokens
281 ($ORIGIN and $PLATFORM for now) replaced. On some platforms it
282 might not be possible to determine the path from which the object
283 belonging to the map is loaded. In this case the path element
284 containing $ORIGIN is left out. */
286 expand_dynamic_string_token (struct link_map
*l
, const char *s
)
288 /* We make two runs over the string. First we determine how large the
289 resulting string is and then we copy it over. Since this is now
290 frequently executed operation we are looking here not for performance
291 but rather for code size. */
296 /* Determine the number of DST elements. */
297 cnt
= DL_DST_COUNT (s
, 1);
299 /* If we do not have to replace anything simply copy the string. */
300 if (__builtin_expect (cnt
, 0) == 0)
301 return local_strdup (s
);
303 /* Determine the length of the substituted string. */
304 total
= DL_DST_REQUIRED (l
, s
, strlen (s
), cnt
);
306 /* Allocate the necessary memory. */
307 result
= (char *) malloc (total
+ 1);
311 return INTUSE(_dl_dst_substitute
) (l
, s
, result
, 1);
315 /* Add `name' to the list of names for a particular shared object.
316 `name' is expected to have been allocated with malloc and will
317 be freed if the shared object already has this name.
318 Returns false if the object already had this name. */
321 add_name_to_object (struct link_map
*l
, const char *name
)
323 struct libname_list
*lnp
, *lastp
;
324 struct libname_list
*newname
;
328 for (lnp
= l
->l_libname
; lnp
!= NULL
; lastp
= lnp
, lnp
= lnp
->next
)
329 if (strcmp (name
, lnp
->name
) == 0)
332 name_len
= strlen (name
) + 1;
333 newname
= (struct libname_list
*) malloc (sizeof *newname
+ name_len
);
336 /* No more memory. */
337 INTUSE(_dl_signal_error
) (ENOMEM
, name
, NULL
,
338 N_("cannot allocate name record"));
341 /* The object should have a libname set from _dl_new_object. */
342 assert (lastp
!= NULL
);
344 newname
->name
= memcpy (newname
+ 1, name
, name_len
);
345 newname
->next
= NULL
;
346 newname
->dont_free
= 0;
347 lastp
->next
= newname
;
350 /* Standard search directories. */
351 static struct r_search_path_struct rtld_search_dirs
;
353 static size_t max_dirnamelen
;
355 static inline struct r_search_path_elem
**
356 fillin_rpath (char *rpath
, struct r_search_path_elem
**result
, const char *sep
,
357 int check_trusted
, const char *what
, const char *where
)
362 while ((cp
= __strsep (&rpath
, sep
)) != NULL
)
364 struct r_search_path_elem
*dirp
;
365 size_t len
= strlen (cp
);
367 /* `strsep' can pass an empty string. This has to be
368 interpreted as `use the current directory'. */
371 static const char curwd
[] = "./";
375 /* Remove trailing slashes (except for "/"). */
376 while (len
> 1 && cp
[len
- 1] == '/')
379 /* Now add one if there is none so far. */
380 if (len
> 0 && cp
[len
- 1] != '/')
383 /* Make sure we don't use untrusted directories if we run SUID. */
384 if (__builtin_expect (check_trusted
, 0))
386 const char *trun
= system_dirs
;
390 /* All trusted directories must be complete names. */
393 for (idx
= 0; idx
< nsystem_dirs_len
; ++idx
)
395 if (len
== system_dirs_len
[idx
]
396 && memcmp (trun
, cp
, len
) == 0)
403 trun
+= system_dirs_len
[idx
] + 1;
408 /* Simply drop this directory. */
412 /* See if this directory is already known. */
413 for (dirp
= GL(dl_all_dirs
); dirp
!= NULL
; dirp
= dirp
->next
)
414 if (dirp
->dirnamelen
== len
&& memcmp (cp
, dirp
->dirname
, len
) == 0)
419 /* It is available, see whether it's on our own list. */
421 for (cnt
= 0; cnt
< nelems
; ++cnt
)
422 if (result
[cnt
] == dirp
)
426 result
[nelems
++] = dirp
;
431 enum r_dir_status init_val
;
432 size_t where_len
= where
? strlen (where
) + 1 : 0;
434 /* It's a new directory. Create an entry and add it. */
435 dirp
= (struct r_search_path_elem
*)
436 malloc (sizeof (*dirp
) + ncapstr
* sizeof (enum r_dir_status
)
437 + where_len
+ len
+ 1);
439 INTUSE(_dl_signal_error
) (ENOMEM
, NULL
, NULL
,
440 N_("cannot create cache for search path"));
442 dirp
->dirname
= ((char *) dirp
+ sizeof (*dirp
)
443 + ncapstr
* sizeof (enum r_dir_status
));
444 *((char *) __mempcpy ((char *) dirp
->dirname
, cp
, len
)) = '\0';
445 dirp
->dirnamelen
= len
;
447 if (len
> max_dirnamelen
)
448 max_dirnamelen
= len
;
450 /* We have to make sure all the relative directories are
451 never ignored. The current directory might change and
452 all our saved information would be void. */
453 init_val
= cp
[0] != '/' ? existing
: unknown
;
454 for (cnt
= 0; cnt
< ncapstr
; ++cnt
)
455 dirp
->status
[cnt
] = init_val
;
458 if (__builtin_expect (where
!= NULL
, 1))
459 dirp
->where
= memcpy ((char *) dirp
+ sizeof (*dirp
) + len
+ 1
460 + (ncapstr
* sizeof (enum r_dir_status
)),
465 dirp
->next
= GL(dl_all_dirs
);
466 GL(dl_all_dirs
) = dirp
;
468 /* Put it in the result array. */
469 result
[nelems
++] = dirp
;
473 /* Terminate the array. */
474 result
[nelems
] = NULL
;
482 decompose_rpath (struct r_search_path_struct
*sps
,
483 const char *rpath
, struct link_map
*l
, const char *what
)
485 /* Make a copy we can work with. */
486 const char *where
= l
->l_name
;
489 struct r_search_path_elem
**result
;
491 /* Initialize to please the compiler. */
492 const char *errstring
= NULL
;
494 /* First see whether we must forget the RUNPATH and RPATH from this
496 if (__builtin_expect (GL(dl_inhibit_rpath
) != NULL
, 0)
497 && !__libc_enable_secure
)
499 const char *inhp
= GL(dl_inhibit_rpath
);
503 const char *wp
= where
;
505 while (*inhp
== *wp
&& *wp
!= '\0')
511 if (*wp
== '\0' && (*inhp
== '\0' || *inhp
== ':'))
513 /* This object is on the list of objects for which the
514 RUNPATH and RPATH must not be used. */
515 result
= (struct r_search_path_elem
**)
516 malloc (sizeof (*result
));
520 errstring
= N_("cannot create cache for search path");
522 INTUSE(_dl_signal_error
) (ENOMEM
, NULL
, NULL
, errstring
);
533 while (*inhp
!= '\0')
537 while (*inhp
!= '\0');
540 /* Make a writable copy. At the same time expand possible dynamic
542 copy
= expand_dynamic_string_token (l
, rpath
);
545 errstring
= N_("cannot create RUNPATH/RPATH copy");
549 /* Count the number of necessary elements in the result array. */
551 for (cp
= copy
; *cp
!= '\0'; ++cp
)
555 /* Allocate room for the result. NELEMS + 1 is an upper limit for the
556 number of necessary entries. */
557 result
= (struct r_search_path_elem
**) malloc ((nelems
+ 1 + 1)
560 goto signal_error_cache
;
562 fillin_rpath (copy
, result
, ":", 0, what
, where
);
564 /* Free the copied RPATH string. `fillin_rpath' make own copies if
569 /* The caller will change this value if we haven't used a real malloc. */
576 _dl_init_paths (const char *llp
)
580 struct r_search_path_elem
*pelem
, **aelem
;
585 /* Initialize to please the compiler. */
586 const char *errstring
= NULL
;
588 /* Fill in the information about the application's RPATH and the
589 directories addressed by the LD_LIBRARY_PATH environment variable. */
591 /* Get the capabilities. */
592 capstr
= _dl_important_hwcaps (GL(dl_platform
), GL(dl_platformlen
),
593 &ncapstr
, &max_capstrlen
);
595 /* First set up the rest of the default search directory entries. */
596 aelem
= rtld_search_dirs
.dirs
= (struct r_search_path_elem
**)
597 malloc ((nsystem_dirs_len
+ 1) * sizeof (struct r_search_path_elem
*));
598 if (rtld_search_dirs
.dirs
== NULL
)
600 errstring
= N_("cannot create search path array");
602 INTUSE(_dl_signal_error
) (ENOMEM
, NULL
, NULL
, errstring
);
605 round_size
= ((2 * sizeof (struct r_search_path_elem
) - 1
606 + ncapstr
* sizeof (enum r_dir_status
))
607 / sizeof (struct r_search_path_elem
));
609 rtld_search_dirs
.dirs
[0] = (struct r_search_path_elem
*)
610 malloc ((sizeof (system_dirs
) / sizeof (system_dirs
[0]))
611 * round_size
* sizeof (struct r_search_path_elem
));
612 if (rtld_search_dirs
.dirs
[0] == NULL
)
614 errstring
= N_("cannot create cache for search path");
618 rtld_search_dirs
.malloced
= 0;
619 pelem
= GL(dl_all_dirs
) = rtld_search_dirs
.dirs
[0];
629 pelem
->what
= "system search path";
632 pelem
->dirname
= strp
;
633 pelem
->dirnamelen
= system_dirs_len
[idx
];
634 strp
+= system_dirs_len
[idx
] + 1;
636 /* System paths must be absolute. */
637 assert (pelem
->dirname
[0] == '/');
638 for (cnt
= 0; cnt
< ncapstr
; ++cnt
)
639 pelem
->status
[cnt
] = unknown
;
641 pelem
->next
= (++idx
== nsystem_dirs_len
? NULL
: (pelem
+ round_size
));
645 while (idx
< nsystem_dirs_len
);
647 max_dirnamelen
= SYSTEM_DIRS_MAX_LEN
;
651 /* This points to the map of the main object. */
655 assert (l
->l_type
!= lt_loaded
);
657 if (l
->l_info
[DT_RUNPATH
])
659 /* Allocate room for the search path and fill in information
661 decompose_rpath (&l
->l_runpath_dirs
,
662 (const void *) (D_PTR (l
, l_info
[DT_STRTAB
])
663 + l
->l_info
[DT_RUNPATH
]->d_un
.d_val
),
666 /* The RPATH is ignored. */
667 l
->l_rpath_dirs
.dirs
= (void *) -1;
671 l
->l_runpath_dirs
.dirs
= (void *) -1;
673 if (l
->l_info
[DT_RPATH
])
675 /* Allocate room for the search path and fill in information
677 decompose_rpath (&l
->l_rpath_dirs
,
678 (const void *) (D_PTR (l
, l_info
[DT_STRTAB
])
679 + l
->l_info
[DT_RPATH
]->d_un
.d_val
),
681 l
->l_rpath_dirs
.malloced
= 0;
684 l
->l_rpath_dirs
.dirs
= (void *) -1;
689 if (llp
!= NULL
&& *llp
!= '\0')
692 const char *cp
= llp
;
693 char *llp_tmp
= strdupa (llp
);
695 /* Decompose the LD_LIBRARY_PATH contents. First determine how many
700 if (*cp
== ':' || *cp
== ';')
705 env_path_list
.dirs
= (struct r_search_path_elem
**)
706 malloc ((nllp
+ 1) * sizeof (struct r_search_path_elem
*));
707 if (env_path_list
.dirs
== NULL
)
709 errstring
= N_("cannot create cache for search path");
713 (void) fillin_rpath (llp_tmp
, env_path_list
.dirs
, ":;",
714 __libc_enable_secure
, "LD_LIBRARY_PATH", NULL
);
716 if (env_path_list
.dirs
[0] == NULL
)
718 free (env_path_list
.dirs
);
719 env_path_list
.dirs
= (void *) -1;
722 env_path_list
.malloced
= 0;
725 env_path_list
.dirs
= (void *) -1;
727 /* Remember the last search directory added at startup. */
728 GL(dl_init_all_dirs
) = GL(dl_all_dirs
);
732 /* Think twice before changing anything in this function. It is placed
733 here and prepared using the `alloca' magic to prevent it from being
734 inlined. The function is only called in case of an error. But then
735 performance does not count. The function used to be "inlinable" and
736 the compiled did so all the time. This increased the code size for
737 absolutely no good reason. */
739 __attribute__ ((noreturn
))
740 lose (int code
, int fd
, const char *name
, char *realname
, struct link_map
*l
,
743 /* The use of `alloca' here looks ridiculous but it helps. The goal
744 is to avoid the function from being inlined. There is no official
745 way to do this so we use this trick. gcc never inlines functions
746 which use `alloca'. */
747 int *a
= (int *) alloca (sizeof (int));
749 /* The file might already be closed. */
751 (void) __close (a
[0]);
754 /* Remove the stillborn object from the list and free it. */
755 assert (l
->l_next
== NULL
);
757 if (l
->l_prev
== NULL
)
758 /* No other module loaded. */
759 GL(dl_loaded
) = NULL
;
762 l
->l_prev
->l_next
= NULL
;
767 INTUSE(_dl_signal_error
) (code
, name
, NULL
, msg
);
771 /* Map in the shared object NAME, actually located in REALNAME, and already
774 #ifndef EXTERNAL_MAP_FROM_FD
778 _dl_map_object_from_fd (const char *name
, int fd
, struct filebuf
*fbp
,
779 char *realname
, struct link_map
*loader
, int l_type
,
782 struct link_map
*l
= NULL
;
783 const ElfW(Ehdr
) *header
;
784 const ElfW(Phdr
) *phdr
;
785 const ElfW(Phdr
) *ph
;
789 /* Initialize to keep the compiler happy. */
790 const char *errstring
= NULL
;
793 /* Get file information. */
794 if (__builtin_expect (__fxstat64 (_STAT_VER
, fd
, &st
) < 0, 0))
796 errstring
= N_("cannot stat shared object");
800 lose (errval
, fd
, name
, realname
, l
, errstring
);
803 /* Look again to see if the real name matched another already loaded. */
804 for (l
= GL(dl_loaded
); l
; l
= l
->l_next
)
805 if (l
->l_ino
== st
.st_ino
&& l
->l_dev
== st
.st_dev
)
807 /* The object is already loaded.
808 Just bump its reference count and return it. */
811 /* If the name is not in the list of names for this object add
814 add_name_to_object (l
, name
);
819 if (mode
& RTLD_NOLOAD
)
820 /* We are not supposed to load the object unless it is already
821 loaded. So return now. */
824 /* Print debugging message. */
825 if (__builtin_expect (GL(dl_debug_mask
) & DL_DEBUG_FILES
, 0))
826 INTUSE(_dl_debug_printf
) ("file=%s; generating link map\n", name
);
828 /* This is the ELF header. We read it in `open_verify'. */
829 header
= (void *) fbp
->buf
;
833 if (_dl_zerofd
== -1)
835 _dl_zerofd
= _dl_sysdep_open_zero_fill ();
836 if (_dl_zerofd
== -1)
839 INTUSE(_dl_signal_error
) (errno
, NULL
, NULL
,
840 N_("cannot open zero fill device"));
845 /* Enter the new object in the list of loaded objects. */
846 l
= _dl_new_object (realname
, name
, l_type
, loader
);
847 if (__builtin_expect (! l
, 0))
849 errstring
= N_("cannot create shared object descriptor");
850 goto call_lose_errno
;
853 /* Extract the remaining details we need from the ELF header
854 and then read in the program header table. */
855 l
->l_entry
= header
->e_entry
;
856 type
= header
->e_type
;
857 l
->l_phnum
= header
->e_phnum
;
859 maplength
= header
->e_phnum
* sizeof (ElfW(Phdr
));
860 if (header
->e_phoff
+ maplength
<= fbp
->len
)
861 phdr
= (void *) (fbp
->buf
+ header
->e_phoff
);
864 phdr
= alloca (maplength
);
865 __lseek (fd
, SEEK_SET
, header
->e_phoff
);
866 if (__libc_read (fd
, (void *) phdr
, maplength
) != maplength
)
868 errstring
= N_("cannot read file data");
869 goto call_lose_errno
;
874 /* Scan the program header table, collecting its load commands. */
877 ElfW(Addr
) mapstart
, mapend
, dataend
, allocend
;
880 } loadcmds
[l
->l_phnum
], *c
;
881 size_t nloadcmds
= 0;
883 /* The struct is initialized to zero so this is not necessary:
887 for (ph
= phdr
; ph
< &phdr
[l
->l_phnum
]; ++ph
)
890 /* These entries tell us where to find things once the file's
891 segments are mapped in. We record the addresses it says
892 verbatim, and later correct for the run-time load address. */
894 l
->l_ld
= (void *) ph
->p_vaddr
;
895 l
->l_ldnum
= ph
->p_memsz
/ sizeof (ElfW(Dyn
));
899 l
->l_phdr
= (void *) ph
->p_vaddr
;
903 /* A load command tells us to map in part of the file.
904 We record the load commands and process them all later. */
905 if ((ph
->p_align
& (GL(dl_pagesize
) - 1)) != 0)
907 errstring
= N_("ELF load command alignment not page-aligned");
910 if (((ph
->p_vaddr
- ph
->p_offset
) & (ph
->p_align
- 1)) != 0)
913 = N_("ELF load command address/offset not properly aligned");
918 struct loadcmd
*c
= &loadcmds
[nloadcmds
++];
919 c
->mapstart
= ph
->p_vaddr
& ~(ph
->p_align
- 1);
920 c
->mapend
= ((ph
->p_vaddr
+ ph
->p_filesz
+ GL(dl_pagesize
) - 1)
921 & ~(GL(dl_pagesize
) - 1));
922 c
->dataend
= ph
->p_vaddr
+ ph
->p_filesz
;
923 c
->allocend
= ph
->p_vaddr
+ ph
->p_memsz
;
924 c
->mapoff
= ph
->p_offset
& ~(ph
->p_align
- 1);
926 /* Optimize a common case. */
927 #if (PF_R | PF_W | PF_X) == 7 && (PROT_READ | PROT_WRITE | PROT_EXEC) == 7
928 c
->prot
= (PF_TO_PROT
929 >> ((ph
->p_flags
& (PF_R
| PF_W
| PF_X
)) * 4)) & 0xf;
932 if (ph
->p_flags
& PF_R
)
933 c
->prot
|= PROT_READ
;
934 if (ph
->p_flags
& PF_W
)
935 c
->prot
|= PROT_WRITE
;
936 if (ph
->p_flags
& PF_X
)
937 c
->prot
|= PROT_EXEC
;
944 l
->l_tls_blocksize
= ph
->p_memsz
;
945 l
->l_tls_align
= ph
->p_align
;
946 l
->l_tls_initimage_size
= ph
->p_filesz
;
947 /* Since we don't know the load address yet only store the
948 offset. We will adjust it later. */
949 l
->l_tls_initimage
= (void *) ph
->p_offset
;
951 /* This is the first element of the initialization image list.
952 It is created as a circular list so that we can easily
954 if (GL(dl_initimage_list
) == NULL
)
955 GL(dl_initimage_list
) = l
->l_tls_nextimage
= l
->l_tls_previmage
959 l
->l_tls_nextimage
= GL(dl_initimage_list
)->l_tls_nextimage
;
960 l
->l_tls_nextimage
->l_tls_previmage
= l
;
961 l
->l_tls_previmage
= GL(dl_initimage_list
);
962 l
->l_tls_previmage
->l_tls_nextimage
= l
;
963 GL(dl_initimage_list
) = l
;
966 /* Assign the next available module ID. */
967 l
->l_tls_modid
= _dl_next_tls_modid ();
972 /* Now process the load commands and map segments into memory. */
975 /* Length of the sections to be loaded. */
976 maplength
= loadcmds
[nloadcmds
- 1].allocend
- c
->mapstart
;
978 if (__builtin_expect (type
, ET_DYN
) == ET_DYN
)
980 /* This is a position-independent shared object. We can let the
981 kernel map it anywhere it likes, but we must have space for all
982 the segments in their specified positions relative to the first.
983 So we map the first segment without MAP_FIXED, but with its
984 extent increased to cover all the segments. Then we remove
985 access from excess portion, and there is known sufficient space
986 there to remap from the later segments.
988 As a refinement, sometimes we have an address that we would
989 prefer to map such objects at; but this is only a preference,
990 the OS can do whatever it likes. */
992 mappref
= (ELF_PREFERRED_ADDRESS (loader
, maplength
, c
->mapstart
)
993 - MAP_BASE_ADDR (l
));
995 /* Remember which part of the address space this object uses. */
996 l
->l_map_start
= (ElfW(Addr
)) __mmap ((void *) mappref
, maplength
,
997 c
->prot
, MAP_COPY
| MAP_FILE
,
999 if ((void *) l
->l_map_start
== MAP_FAILED
)
1002 errstring
= N_("failed to map segment from shared object");
1003 goto call_lose_errno
;
1006 l
->l_map_end
= l
->l_map_start
+ maplength
;
1007 l
->l_addr
= l
->l_map_start
- c
->mapstart
;
1009 /* Change protection on the excess portion to disallow all access;
1010 the portions we do not remap later will be inaccessible as if
1011 unallocated. Then jump into the normal segment-mapping loop to
1012 handle the portion of the segment past the end of the file
1014 __mprotect ((caddr_t
) (l
->l_addr
+ c
->mapend
),
1015 loadcmds
[nloadcmds
- 1].allocend
- c
->mapend
,
1022 /* This object is loaded at a fixed address. This must never
1023 happen for objects loaded with dlopen(). */
1024 if (__builtin_expect (mode
& __RTLD_DLOPEN
, 0))
1026 errstring
= N_("cannot dynamically load executable");
1030 /* Notify ELF_PREFERRED_ADDRESS that we have to load this one
1032 ELF_FIXED_ADDRESS (loader
, c
->mapstart
);
1035 /* Remember which part of the address space this object uses. */
1036 l
->l_map_start
= c
->mapstart
+ l
->l_addr
;
1037 l
->l_map_end
= l
->l_map_start
+ maplength
;
1039 while (c
< &loadcmds
[nloadcmds
])
1041 if (c
->mapend
> c
->mapstart
1042 /* Map the segment contents from the file. */
1043 && (__mmap ((void *) (l
->l_addr
+ c
->mapstart
),
1044 c
->mapend
- c
->mapstart
, c
->prot
,
1045 MAP_FIXED
| MAP_COPY
| MAP_FILE
, fd
, c
->mapoff
)
1051 && c
->mapoff
<= header
->e_phoff
1052 && (c
->mapend
- c
->mapstart
+ c
->mapoff
1053 >= header
->e_phoff
+ header
->e_phnum
* sizeof (ElfW(Phdr
))))
1054 /* Found the program header in this segment. */
1055 l
->l_phdr
= (void *) (c
->mapstart
+ header
->e_phoff
- c
->mapoff
);
1057 if (c
->allocend
> c
->dataend
)
1059 /* Extra zero pages should appear at the end of this segment,
1060 after the data mapped from the file. */
1061 ElfW(Addr
) zero
, zeroend
, zeropage
;
1063 zero
= l
->l_addr
+ c
->dataend
;
1064 zeroend
= l
->l_addr
+ c
->allocend
;
1065 zeropage
= ((zero
+ GL(dl_pagesize
) - 1)
1066 & ~(GL(dl_pagesize
) - 1));
1068 if (zeroend
< zeropage
)
1069 /* All the extra data is in the last page of the segment.
1070 We can just zero it. */
1073 if (zeropage
> zero
)
1075 /* Zero the final part of the last page of the segment. */
1076 if ((c
->prot
& PROT_WRITE
) == 0)
1079 if (__mprotect ((caddr_t
) (zero
& ~(GL(dl_pagesize
) - 1)),
1080 GL(dl_pagesize
), c
->prot
|PROT_WRITE
) < 0)
1082 errstring
= N_("cannot change memory protections");
1083 goto call_lose_errno
;
1086 memset ((void *) zero
, '\0', zeropage
- zero
);
1087 if ((c
->prot
& PROT_WRITE
) == 0)
1088 __mprotect ((caddr_t
) (zero
& ~(GL(dl_pagesize
) - 1)),
1089 GL(dl_pagesize
), c
->prot
);
1092 if (zeroend
> zeropage
)
1094 /* Map the remaining zero pages in from the zero fill FD. */
1096 mapat
= __mmap ((caddr_t
) zeropage
, zeroend
- zeropage
,
1097 c
->prot
, MAP_ANON
|MAP_PRIVATE
|MAP_FIXED
,
1099 if (mapat
== MAP_FAILED
)
1101 errstring
= N_("cannot map zero-fill pages");
1102 goto call_lose_errno
;
1110 if (l
->l_phdr
== NULL
)
1112 /* The program header is not contained in any of the segments.
1113 We have to allocate memory ourself and copy it over from
1114 out temporary place. */
1115 ElfW(Phdr
) *newp
= (ElfW(Phdr
) *) malloc (header
->e_phnum
1116 * sizeof (ElfW(Phdr
)));
1119 errstring
= N_("cannot allocate memory for program header");
1120 goto call_lose_errno
;
1123 l
->l_phdr
= memcpy (newp
, phdr
,
1124 (header
->e_phnum
* sizeof (ElfW(Phdr
))));
1125 l
->l_phdr_allocated
= 1;
1128 /* Adjust the PT_PHDR value by the runtime load address. */
1129 (ElfW(Addr
)) l
->l_phdr
+= l
->l_addr
;
1133 /* Adjust the address of the TLS initialization image. */
1134 if (l
->l_tls_initimage
!= NULL
)
1135 l
->l_tls_initimage
= (char *) l
->l_tls_initimage
+ l
->l_map_start
;
1138 /* We are done mapping in the file. We no longer need the descriptor. */
1140 /* Signal that we closed the file. */
1143 if (l
->l_type
== lt_library
&& type
== ET_EXEC
)
1144 l
->l_type
= lt_executable
;
1150 errstring
= N_("object file has no dynamic section");
1155 (ElfW(Addr
)) l
->l_ld
+= l
->l_addr
;
1157 l
->l_entry
+= l
->l_addr
;
1159 if (__builtin_expect (GL(dl_debug_mask
) & DL_DEBUG_FILES
, 0))
1160 INTUSE(_dl_debug_printf
) ("\
1161 dynamic: 0x%0*lx base: 0x%0*lx size: 0x%0*Zx\n\
1162 entry: 0x%0*lx phdr: 0x%0*lx phnum: %*u\n\n",
1163 (int) sizeof (void *) * 2,
1164 (unsigned long int) l
->l_ld
,
1165 (int) sizeof (void *) * 2,
1166 (unsigned long int) l
->l_addr
,
1167 (int) sizeof (void *) * 2, maplength
,
1168 (int) sizeof (void *) * 2,
1169 (unsigned long int) l
->l_entry
,
1170 (int) sizeof (void *) * 2,
1171 (unsigned long int) l
->l_phdr
,
1172 (int) sizeof (void *) * 2, l
->l_phnum
);
1174 elf_get_dynamic_info (l
);
1176 /* Make sure we are dlopen()ing an object which has the DF_1_NOOPEN
1178 if ((__builtin_expect (l
->l_flags_1
& DF_1_NOOPEN
, 0)
1180 || __builtin_expect (l
->l_flags
& DF_STATIC_TLS
, 0)
1183 && (mode
& __RTLD_DLOPEN
))
1185 /* We are not supposed to load this object. Free all resources. */
1186 __munmap ((void *) l
->l_map_start
, l
->l_map_end
- l
->l_map_start
);
1188 if (!l
->l_libname
->dont_free
)
1189 free (l
->l_libname
);
1191 if (l
->l_phdr_allocated
)
1192 free ((void *) l
->l_phdr
);
1194 errstring
= N_("shared object cannot be dlopen()ed");
1198 if (l
->l_info
[DT_HASH
])
1201 /* If this object has DT_SYMBOLIC set modify now its scope. We don't
1202 have to do this for the main map. */
1203 if (__builtin_expect (l
->l_info
[DT_SYMBOLIC
] != NULL
, 0)
1204 && &l
->l_searchlist
!= l
->l_scope
[0])
1206 /* Create an appropriate searchlist. It contains only this map.
1208 XXX This is the definition of DT_SYMBOLIC in SysVr4. The old
1209 GNU ld.so implementation had a different interpretation which
1210 is more reasonable. We are prepared to add this possibility
1211 back as part of a GNU extension of the ELF format. */
1212 l
->l_symbolic_searchlist
.r_list
=
1213 (struct link_map
**) malloc (sizeof (struct link_map
*));
1215 if (l
->l_symbolic_searchlist
.r_list
== NULL
)
1217 errstring
= N_("cannot create searchlist");
1218 goto call_lose_errno
;
1221 l
->l_symbolic_searchlist
.r_list
[0] = l
;
1222 l
->l_symbolic_searchlist
.r_nlist
= 1;
1224 /* Now move the existing entries one back. */
1225 memmove (&l
->l_scope
[1], &l
->l_scope
[0],
1226 (l
->l_scope_max
- 1) * sizeof (l
->l_scope
[0]));
1228 /* Now add the new entry. */
1229 l
->l_scope
[0] = &l
->l_symbolic_searchlist
;
1232 /* Remember whether this object must be initialized first. */
1233 if (l
->l_flags_1
& DF_1_INITFIRST
)
1234 GL(dl_initfirst
) = l
;
1236 /* Finally the file information. */
1237 l
->l_dev
= st
.st_dev
;
1238 l
->l_ino
= st
.st_ino
;
1243 /* Print search path. */
1245 print_search_path (struct r_search_path_elem
**list
,
1246 const char *what
, const char *name
)
1248 char buf
[max_dirnamelen
+ max_capstrlen
];
1251 INTUSE(_dl_debug_printf
) (" search path=");
1253 while (*list
!= NULL
&& (*list
)->what
== what
) /* Yes, ==. */
1255 char *endp
= __mempcpy (buf
, (*list
)->dirname
, (*list
)->dirnamelen
);
1258 for (cnt
= 0; cnt
< ncapstr
; ++cnt
)
1259 if ((*list
)->status
[cnt
] != nonexisting
)
1261 char *cp
= __mempcpy (endp
, capstr
[cnt
].str
, capstr
[cnt
].len
);
1262 if (cp
== buf
|| (cp
== buf
+ 1 && buf
[0] == '/'))
1267 _dl_debug_printf_c (first
? "%s" : ":%s", buf
);
1275 _dl_debug_printf_c ("\t\t(%s from file %s)\n", what
,
1276 name
[0] ? name
: _dl_argv
[0]);
1278 _dl_debug_printf_c ("\t\t(%s)\n", what
);
1281 /* Open a file and verify it is an ELF file for this architecture. We
1282 ignore only ELF files for other architectures. Non-ELF files and
1283 ELF files with different header information cause fatal errors since
1284 this could mean there is something wrong in the installation and the
1285 user might want to know about this. */
1287 open_verify (const char *name
, struct filebuf
*fbp
)
1289 /* This is the expected ELF header. */
1290 #define ELF32_CLASS ELFCLASS32
1291 #define ELF64_CLASS ELFCLASS64
1292 #ifndef VALID_ELF_HEADER
1293 # define VALID_ELF_HEADER(hdr,exp,size) (memcmp (hdr, exp, size) == 0)
1294 # define VALID_ELF_OSABI(osabi) (osabi == ELFOSABI_SYSV)
1295 # define VALID_ELF_ABIVERSION(ver) (ver == 0)
1297 static const unsigned char expected
[EI_PAD
] =
1299 [EI_MAG0
] = ELFMAG0
,
1300 [EI_MAG1
] = ELFMAG1
,
1301 [EI_MAG2
] = ELFMAG2
,
1302 [EI_MAG3
] = ELFMAG3
,
1303 [EI_CLASS
] = ELFW(CLASS
),
1304 [EI_DATA
] = byteorder
,
1305 [EI_VERSION
] = EV_CURRENT
,
1306 [EI_OSABI
] = ELFOSABI_SYSV
,
1311 ElfW(Word
) vendorlen
;
1315 } expected_note
= { 4, 16, 1, "GNU" };
1317 /* Initialize it to make the compiler happy. */
1318 const char *errstring
= NULL
;
1321 /* Open the file. We always open files read-only. */
1322 fd
= __open (name
, O_RDONLY
);
1326 ElfW(Phdr
) *phdr
, *ph
;
1327 ElfW(Word
) *abi_note
, abi_note_buf
[8];
1328 unsigned int osversion
;
1331 /* We successfully openened the file. Now verify it is a file
1334 fbp
->len
= __libc_read (fd
, fbp
->buf
, sizeof (fbp
->buf
));
1336 /* This is where the ELF header is loaded. */
1337 assert (sizeof (fbp
->buf
) > sizeof (ElfW(Ehdr
)));
1338 ehdr
= (ElfW(Ehdr
) *) fbp
->buf
;
1340 /* Now run the tests. */
1341 if (__builtin_expect (fbp
->len
< (ssize_t
) sizeof (ElfW(Ehdr
)), 0))
1344 errstring
= (errval
== 0
1345 ? N_("file too short") : N_("cannot read file data"));
1347 lose (errval
, fd
, name
, NULL
, NULL
, errstring
);
1350 /* See whether the ELF header is what we expect. */
1351 if (__builtin_expect (! VALID_ELF_HEADER (ehdr
->e_ident
, expected
,
1354 /* Something is wrong. */
1355 if (*(Elf32_Word
*) &ehdr
->e_ident
!=
1356 #if BYTE_ORDER == LITTLE_ENDIAN
1357 ((ELFMAG0
<< (EI_MAG0
* 8)) |
1358 (ELFMAG1
<< (EI_MAG1
* 8)) |
1359 (ELFMAG2
<< (EI_MAG2
* 8)) |
1360 (ELFMAG3
<< (EI_MAG3
* 8)))
1362 ((ELFMAG0
<< (EI_MAG3
* 8)) |
1363 (ELFMAG1
<< (EI_MAG2
* 8)) |
1364 (ELFMAG2
<< (EI_MAG1
* 8)) |
1365 (ELFMAG3
<< (EI_MAG0
* 8)))
1368 errstring
= N_("invalid ELF header");
1369 else if (ehdr
->e_ident
[EI_CLASS
] != ELFW(CLASS
))
1370 /* This is not a fatal error. On architectures where
1371 32-bit and 64-bit binaries can be run this might
1374 else if (ehdr
->e_ident
[EI_DATA
] != byteorder
)
1376 if (BYTE_ORDER
== BIG_ENDIAN
)
1377 errstring
= N_("ELF file data encoding not big-endian");
1379 errstring
= N_("ELF file data encoding not little-endian");
1381 else if (ehdr
->e_ident
[EI_VERSION
] != EV_CURRENT
)
1383 = N_("ELF file version ident does not match current one");
1384 /* XXX We should be able so set system specific versions which are
1386 else if (!VALID_ELF_OSABI (ehdr
->e_ident
[EI_OSABI
]))
1387 errstring
= N_("ELF file OS ABI invalid");
1388 else if (!VALID_ELF_ABIVERSION (ehdr
->e_ident
[EI_ABIVERSION
]))
1389 errstring
= N_("ELF file ABI version invalid");
1391 /* Otherwise we don't know what went wrong. */
1392 errstring
= N_("internal error");
1397 if (__builtin_expect (ehdr
->e_version
, EV_CURRENT
) != EV_CURRENT
)
1399 errstring
= N_("ELF file version does not match current one");
1402 if (! __builtin_expect (elf_machine_matches_host (ehdr
), 1))
1404 else if (__builtin_expect (ehdr
->e_phentsize
, sizeof (ElfW(Phdr
)))
1405 != sizeof (ElfW(Phdr
)))
1407 errstring
= N_("ELF file's phentsize not the expected size");
1410 else if (__builtin_expect (ehdr
->e_type
, ET_DYN
) != ET_DYN
1411 && __builtin_expect (ehdr
->e_type
, ET_EXEC
) != ET_EXEC
)
1413 errstring
= N_("only ET_DYN and ET_EXEC can be loaded");
1417 maplength
= ehdr
->e_phnum
* sizeof (ElfW(Phdr
));
1418 if (ehdr
->e_phoff
+ maplength
<= fbp
->len
)
1419 phdr
= (void *) (fbp
->buf
+ ehdr
->e_phoff
);
1422 phdr
= alloca (maplength
);
1423 __lseek (fd
, SEEK_SET
, ehdr
->e_phoff
);
1424 if (__libc_read (fd
, (void *) phdr
, maplength
) != maplength
)
1428 errstring
= N_("cannot read file data");
1433 /* Check .note.ABI-tag if present. */
1434 for (ph
= phdr
; ph
< &phdr
[ehdr
->e_phnum
]; ++ph
)
1435 if (ph
->p_type
== PT_NOTE
&& ph
->p_filesz
== 32 && ph
->p_align
>= 4)
1437 if (ph
->p_offset
+ 32 <= fbp
->len
)
1438 abi_note
= (void *) (fbp
->buf
+ ph
->p_offset
);
1441 __lseek (fd
, SEEK_SET
, ph
->p_offset
);
1442 if (__libc_read (fd
, (void *) abi_note_buf
, 32) != 32)
1445 abi_note
= abi_note_buf
;
1448 if (memcmp (abi_note
, &expected_note
, sizeof (expected_note
)))
1451 osversion
= (abi_note
[5] & 0xff) * 65536
1452 + (abi_note
[6] & 0xff) * 256
1453 + (abi_note
[7] & 0xff);
1454 if (abi_note
[4] != __ABI_TAG_OS
1455 || (GL(dl_osversion
) && GL(dl_osversion
) < osversion
))
1459 __set_errno (ENOENT
);
1470 /* Try to open NAME in one of the directories in *DIRSP.
1471 Return the fd, or -1. If successful, fill in *REALNAME
1472 with the malloc'd full directory name. If it turns out
1473 that none of the directories in *DIRSP exists, *DIRSP is
1474 replaced with (void *) -1, and the old value is free()d
1475 if MAY_FREE_DIRS is true. */
1478 open_path (const char *name
, size_t namelen
, int preloaded
,
1479 struct r_search_path_struct
*sps
, char **realname
,
1480 struct filebuf
*fbp
)
1482 struct r_search_path_elem
**dirs
= sps
->dirs
;
1485 const char *current_what
= NULL
;
1488 buf
= alloca (max_dirnamelen
+ max_capstrlen
+ namelen
);
1491 struct r_search_path_elem
*this_dir
= *dirs
;
1498 /* If we are debugging the search for libraries print the path
1499 now if it hasn't happened now. */
1500 if (__builtin_expect (GL(dl_debug_mask
) & DL_DEBUG_LIBS
, 0)
1501 && current_what
!= this_dir
->what
)
1503 current_what
= this_dir
->what
;
1504 print_search_path (dirs
, current_what
, this_dir
->where
);
1507 edp
= (char *) __mempcpy (buf
, this_dir
->dirname
, this_dir
->dirnamelen
);
1508 for (cnt
= 0; fd
== -1 && cnt
< ncapstr
; ++cnt
)
1510 /* Skip this directory if we know it does not exist. */
1511 if (this_dir
->status
[cnt
] == nonexisting
)
1515 ((char *) __mempcpy (__mempcpy (edp
, capstr
[cnt
].str
,
1520 /* Print name we try if this is wanted. */
1521 if (__builtin_expect (GL(dl_debug_mask
) & DL_DEBUG_LIBS
, 0))
1522 INTUSE(_dl_debug_printf
) (" trying file=%s\n", buf
);
1524 fd
= open_verify (buf
, fbp
);
1525 if (this_dir
->status
[cnt
] == unknown
)
1528 this_dir
->status
[cnt
] = existing
;
1531 /* We failed to open machine dependent library. Let's
1532 test whether there is any directory at all. */
1535 buf
[buflen
- namelen
- 1] = '\0';
1537 if (__xstat64 (_STAT_VER
, buf
, &st
) != 0
1538 || ! S_ISDIR (st
.st_mode
))
1539 /* The directory does not exist or it is no directory. */
1540 this_dir
->status
[cnt
] = nonexisting
;
1542 this_dir
->status
[cnt
] = existing
;
1546 /* Remember whether we found any existing directory. */
1547 here_any
|= this_dir
->status
[cnt
] == existing
;
1549 if (fd
!= -1 && __builtin_expect (preloaded
, 0)
1550 && __libc_enable_secure
)
1552 /* This is an extra security effort to make sure nobody can
1553 preload broken shared objects which are in the trusted
1554 directories and so exploit the bugs. */
1557 if (__fxstat64 (_STAT_VER
, fd
, &st
) != 0
1558 || (st
.st_mode
& S_ISUID
) == 0)
1560 /* The shared object cannot be tested for being SUID
1561 or this bit is not set. In this case we must not
1565 /* We simply ignore the file, signal this by setting
1566 the error value which would have been set by `open'. */
1574 *realname
= (char *) malloc (buflen
);
1575 if (*realname
!= NULL
)
1577 memcpy (*realname
, buf
, buflen
);
1582 /* No memory for the name, we certainly won't be able
1583 to load and link it. */
1588 if (here_any
&& (err
= errno
) != ENOENT
&& err
!= EACCES
)
1589 /* The file exists and is readable, but something went wrong. */
1592 /* Remember whether we found anything. */
1595 while (*++dirs
!= NULL
);
1597 /* Remove the whole path if none of the directories exists. */
1598 if (__builtin_expect (! any
, 0))
1600 /* Paths which were allocated using the minimal malloc() in ld.so
1601 must not be freed using the general free() in libc. */
1604 sps
->dirs
= (void *) -1;
1610 /* Map in the shared object file NAME. */
1614 _dl_map_object (struct link_map
*loader
, const char *name
, int preloaded
,
1615 int type
, int trace_mode
, int mode
)
1623 /* Look for this name among those already loaded. */
1624 for (l
= GL(dl_loaded
); l
; l
= l
->l_next
)
1626 /* If the requested name matches the soname of a loaded object,
1627 use that object. Elide this check for names that have not
1629 if (__builtin_expect (l
->l_faked
, 0) != 0)
1631 if (!_dl_name_match_p (name
, l
))
1635 if (__builtin_expect (l
->l_soname_added
, 1)
1636 || l
->l_info
[DT_SONAME
] == NULL
)
1639 soname
= ((const char *) D_PTR (l
, l_info
[DT_STRTAB
])
1640 + l
->l_info
[DT_SONAME
]->d_un
.d_val
);
1641 if (strcmp (name
, soname
) != 0)
1644 /* We have a match on a new name -- cache it. */
1645 add_name_to_object (l
, soname
);
1646 l
->l_soname_added
= 1;
1649 /* We have a match. */
1653 /* Display information if we are debugging. */
1654 if (__builtin_expect (GL(dl_debug_mask
) & DL_DEBUG_FILES
, 0)
1656 INTUSE(_dl_debug_printf
) ("\nfile=%s; needed by %s\n", name
,
1657 loader
->l_name
[0] ? loader
->l_name
: _dl_argv
[0]);
1659 if (strchr (name
, '/') == NULL
)
1661 /* Search for NAME in several places. */
1663 size_t namelen
= strlen (name
) + 1;
1665 if (__builtin_expect (GL(dl_debug_mask
) & DL_DEBUG_LIBS
, 0))
1666 INTUSE(_dl_debug_printf
) ("find library=%s; searching\n", name
);
1670 /* When the object has the RUNPATH information we don't use any
1672 if (loader
== NULL
|| loader
->l_info
[DT_RUNPATH
] == NULL
)
1674 /* First try the DT_RPATH of the dependent object that caused NAME
1675 to be loaded. Then that object's dependent, and on up. */
1676 for (l
= loader
; fd
== -1 && l
; l
= l
->l_loader
)
1678 if (l
->l_rpath_dirs
.dirs
== NULL
)
1680 if (l
->l_info
[DT_RPATH
] == NULL
)
1682 /* There is no path. */
1683 l
->l_rpath_dirs
.dirs
= (void *) -1;
1688 /* Make sure the cache information is available. */
1689 size_t ptrval
= (D_PTR (l
, l_info
[DT_STRTAB
])
1690 + l
->l_info
[DT_RPATH
]->d_un
.d_val
);
1691 decompose_rpath (&l
->l_rpath_dirs
,
1692 (const char *) ptrval
, l
, "RPATH");
1696 if (l
->l_rpath_dirs
.dirs
!= (void *) -1)
1697 fd
= open_path (name
, namelen
, preloaded
, &l
->l_rpath_dirs
,
1701 /* If dynamically linked, try the DT_RPATH of the executable
1704 if (fd
== -1 && l
&& l
->l_type
!= lt_loaded
&& l
!= loader
1705 && l
->l_rpath_dirs
.dirs
!= (void *) -1)
1706 fd
= open_path (name
, namelen
, preloaded
, &l
->l_rpath_dirs
,
1710 /* Try the LD_LIBRARY_PATH environment variable. */
1711 if (fd
== -1 && env_path_list
.dirs
!= (void *) -1)
1712 fd
= open_path (name
, namelen
, preloaded
, &env_path_list
,
1715 /* Look at the RUNPATH information for this binary.
1717 Note that this is no real loop. 'while' is used only to enable
1718 us to use 'break' instead of a 'goto' to jump to the end. The
1719 loop is always left after the first round. */
1720 while (fd
== -1 && loader
!= NULL
1721 && loader
->l_runpath_dirs
.dirs
!= (void *) -1)
1723 if (loader
->l_runpath_dirs
.dirs
== NULL
)
1725 if (loader
->l_info
[DT_RUNPATH
] == NULL
)
1728 loader
->l_runpath_dirs
.dirs
= (void *) -1;
1733 /* Make sure the cache information is available. */
1734 size_t ptrval
= (D_PTR (loader
, l_info
[DT_STRTAB
])
1735 + loader
->l_info
[DT_RUNPATH
]->d_un
.d_val
);
1736 decompose_rpath (&loader
->l_runpath_dirs
,
1737 (const char *) ptrval
, loader
, "RUNPATH");
1741 if (loader
->l_runpath_dirs
.dirs
!= (void *) -1)
1742 fd
= open_path (name
, namelen
, preloaded
,
1743 &loader
->l_runpath_dirs
, &realname
, &fb
);
1748 && (__builtin_expect (! preloaded
, 1) || ! __libc_enable_secure
))
1750 /* Check the list of libraries in the file /etc/ld.so.cache,
1751 for compatibility with Linux's ldconfig program. */
1752 const char *cached
= _dl_load_cache_lookup (name
);
1757 l
= loader
?: GL(dl_loaded
);
1762 /* If the loader has the DF_1_NODEFLIB flag set we must not
1763 use a cache entry from any of these directories. */
1766 /* 'l' is always != NULL for dynamically linked objects. */
1769 __builtin_expect (l
->l_flags_1
& DF_1_NODEFLIB
, 0))
1771 const char *dirp
= system_dirs
;
1772 unsigned int cnt
= 0;
1776 if (memcmp (cached
, dirp
, system_dirs_len
[cnt
]) == 0)
1778 /* The prefix matches. Don't use the entry. */
1783 dirp
+= system_dirs_len
[cnt
] + 1;
1786 while (cnt
< nsystem_dirs_len
);
1791 fd
= open_verify (cached
, &fb
);
1792 if (__builtin_expect (fd
!= -1, 1))
1794 realname
= local_strdup (cached
);
1795 if (realname
== NULL
)
1805 /* Finally, try the default path. */
1807 && ((l
= loader
?: GL(dl_loaded
)) == NULL
1808 || __builtin_expect (!(l
->l_flags_1
& DF_1_NODEFLIB
), 1))
1809 && rtld_search_dirs
.dirs
!= (void *) -1)
1810 fd
= open_path (name
, namelen
, preloaded
, &rtld_search_dirs
,
1813 /* Add another newline when we a tracing the library loading. */
1814 if (__builtin_expect (GL(dl_debug_mask
) & DL_DEBUG_LIBS
, 0))
1815 INTUSE(_dl_debug_printf
) ("\n");
1819 /* The path may contain dynamic string tokens. */
1821 ? expand_dynamic_string_token (loader
, name
)
1822 : local_strdup (name
));
1823 if (realname
== NULL
)
1827 fd
= open_verify (realname
, &fb
);
1828 if (__builtin_expect (fd
, 0) == -1)
1833 if (__builtin_expect (fd
, 0) == -1)
1836 && __builtin_expect (GL(dl_debug_mask
) & DL_DEBUG_PRELINK
, 0) == 0)
1838 /* We haven't found an appropriate library. But since we
1839 are only interested in the list of libraries this isn't
1840 so severe. Fake an entry with all the information we
1842 static const Elf_Symndx dummy_bucket
= STN_UNDEF
;
1844 /* Enter the new object in the list of loaded objects. */
1845 if ((name_copy
= local_strdup (name
)) == NULL
1846 || (l
= _dl_new_object (name_copy
, name
, type
, loader
)) == NULL
)
1847 INTUSE(_dl_signal_error
) (ENOMEM
, name
, NULL
, N_("\
1848 cannot create shared object descriptor"));
1849 /* Signal that this is a faked entry. */
1851 /* Since the descriptor is initialized with zero we do not
1853 l->l_reserved = 0; */
1854 l
->l_buckets
= &dummy_bucket
;
1861 INTUSE(_dl_signal_error
) (errno
, name
, NULL
,
1862 N_("cannot open shared object file"));
1865 return _dl_map_object_from_fd (name
, fd
, &fb
, realname
, loader
, type
, mode
);
1867 INTDEF (_dl_map_object
)