1 /* Miscellaneous support functions for dynamic linker
2 Copyright (C) 1997-2004, 2006, 2009, 2011 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, see
17 <http://www.gnu.org/licenses/>. */
29 #include <sys/param.h>
34 #include <bits/libc-lock.h>
36 /* Read the whole contents of FILE into new mmap'd space with given
37 protections. *SIZEP gets the size of the file. On error MAP_FAILED
42 _dl_sysdep_read_whole_file (const char *file
, size_t *sizep
, int prot
)
44 void *result
= MAP_FAILED
;
50 int fd
= __open (file
, flags
);
53 if (__fxstat64 (_STAT_VER
, fd
, &st
) >= 0)
57 /* No need to map the file if it is empty. */
59 /* Map a copy of the file contents. */
60 result
= __mmap (NULL
, *sizep
, prot
,
77 /* Bare-bones printf implementation. This function only knows about
78 the formats and flags needed and can handle only up to 64 stripes in
81 _dl_debug_vdprintf (int fd
, int tag_p
, const char *fmt
, va_list arg
)
84 struct iovec iov
[NIOVMAX
];
91 const char *startp
= fmt
;
95 /* Generate the tag line once. It consists of the PID and a
96 colon followed by a tab. */
101 assert (pid
>= 0 && sizeof (pid_t
) <= 4);
102 p
= _itoa (pid
, &pidbuf
[10], 10, 0);
109 /* Append to the output. */
110 assert (niov
< NIOVMAX
);
111 iov
[niov
].iov_len
= 12;
112 iov
[niov
++].iov_base
= pidbuf
;
114 /* No more tags until we see the next newline. */
118 /* Skip everything except % and \n (if tags are needed). */
119 while (*fmt
!= '\0' && *fmt
!= '%' && (! tag_p
|| *fmt
!= '\n'))
122 /* Append constant string. */
123 assert (niov
< NIOVMAX
);
124 if ((iov
[niov
].iov_len
= fmt
- startp
) != 0)
125 iov
[niov
++].iov_base
= (char *) startp
;
129 /* It is a format specifier. */
133 #if LONG_MAX != INT_MAX
137 /* Recognize zero-digit fill flag. */
144 /* See whether with comes from a parameter. Note that no other
145 way to specify the width is implemented. */
148 width
= va_arg (arg
, int);
152 /* Handle precision. */
153 if (*fmt
== '.' && fmt
[1] == '*')
155 prec
= va_arg (arg
, int);
159 /* Recognize the l modifier. It is only important on some
160 platforms where long and int have a different size. We
161 can use the same code for size_t. */
162 if (*fmt
== 'l' || *fmt
== 'Z')
164 #if LONG_MAX != INT_MAX
172 /* Integer formatting. */
176 /* We have to make a difference if long and int have a
178 #if LONG_MAX != INT_MAX
179 unsigned long int num
= (long_mod
180 ? va_arg (arg
, unsigned long int)
181 : va_arg (arg
, unsigned int));
183 unsigned long int num
= va_arg (arg
, unsigned int);
185 /* We use alloca() to allocate the buffer with the most
186 pessimistic guess for the size. Using alloca() allows
187 having more than one integer formatting in a call. */
188 char *buf
= (char *) alloca (3 * sizeof (unsigned long int));
189 char *endp
= &buf
[3 * sizeof (unsigned long int)];
190 char *cp
= _itoa (num
, endp
, *fmt
== 'x' ? 16 : 10, 0);
192 /* Pad to the width the user specified. */
194 while (endp
- cp
< width
)
197 iov
[niov
].iov_base
= cp
;
198 iov
[niov
].iov_len
= endp
- cp
;
204 /* Get the string argument. */
205 iov
[niov
].iov_base
= va_arg (arg
, char *);
206 iov
[niov
].iov_len
= strlen (iov
[niov
].iov_base
);
208 iov
[niov
].iov_len
= MIN ((size_t) prec
, iov
[niov
].iov_len
);
213 iov
[niov
].iov_base
= (void *) fmt
;
214 iov
[niov
].iov_len
= 1;
219 assert (! "invalid format specifier");
223 else if (*fmt
== '\n')
225 /* See whether we have to print a single newline character. */
228 iov
[niov
].iov_base
= (char *) startp
;
229 iov
[niov
++].iov_len
= 1;
232 /* No, just add it to the rest of the string. */
233 ++iov
[niov
- 1].iov_len
;
235 /* Next line, print a tag again. */
241 /* Finally write the result. */
242 #ifdef HAVE_INLINED_SYSCALLS
243 INTERNAL_SYSCALL_DECL (err
);
244 INTERNAL_SYSCALL (writev
, err
, 3, fd
, &iov
, niov
);
245 #elif RTLD_PRIVATE_ERRNO
246 /* We have to take this lock just to be sure we don't clobber the private
247 errno when it's being used by another thread that cares about it.
248 Yet we must be sure not to try calling the lock functions before
249 the thread library is fully initialized. */
250 if (__builtin_expect (INTUSE (_dl_starting_up
), 0))
251 __writev (fd
, iov
, niov
);
254 __rtld_lock_lock_recursive (GL(dl_load_lock
));
255 __writev (fd
, iov
, niov
);
256 __rtld_lock_unlock_recursive (GL(dl_load_lock
));
259 __writev (fd
, iov
, niov
);
264 /* Write to debug file. */
266 _dl_debug_printf (const char *fmt
, ...)
271 _dl_debug_vdprintf (GLRO(dl_debug_fd
), 1, fmt
, arg
);
276 /* Write to debug file but don't start with a tag. */
278 _dl_debug_printf_c (const char *fmt
, ...)
283 _dl_debug_vdprintf (GLRO(dl_debug_fd
), -1, fmt
, arg
);
288 /* Write the given file descriptor. */
290 _dl_dprintf (int fd
, const char *fmt
, ...)
295 _dl_debug_vdprintf (fd
, 0, fmt
, arg
);
300 /* Test whether given NAME matches any of the names of the given object. */
303 _dl_name_match_p (const char *name
, const struct link_map
*map
)
305 if (strcmp (name
, map
->l_name
) == 0)
308 struct libname_list
*runp
= map
->l_libname
;
311 if (strcmp (name
, runp
->name
) == 0)
322 _dl_higher_prime_number (unsigned long int n
)
324 /* These are primes that are near, but slightly smaller than, a
326 static const uint32_t primes
[] = {
351 UINT32_C (134217689),
352 UINT32_C (268435399),
353 UINT32_C (536870909),
354 UINT32_C (1073741789),
355 UINT32_C (2147483647),
357 UINT32_C (2147483647) + UINT32_C (2147483644)
360 const uint32_t *low
= &primes
[0];
361 const uint32_t *high
= &primes
[sizeof (primes
) / sizeof (primes
[0])];
365 const uint32_t *mid
= low
+ (high
- low
) / 2;
373 /* If we've run out of primes, abort. */
376 fprintf (stderr
, "Cannot find prime bigger than %lu\n", n
);