1999-05-05 23:29:18 +00:00
|
|
|
/* Handling of dynamic sring tokens.
|
2014-01-01 11:03:15 +00:00
|
|
|
Copyright (C) 1999-2014 Free Software Foundation, Inc.
|
1999-05-05 23:29:18 +00:00
|
|
|
This file is part of the GNU C Library.
|
|
|
|
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
2001-07-06 04:58:11 +00:00
|
|
|
modify it under the terms of the GNU Lesser General Public
|
|
|
|
License as published by the Free Software Foundation; either
|
|
|
|
version 2.1 of the License, or (at your option) any later version.
|
1999-05-05 23:29:18 +00:00
|
|
|
|
|
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
2001-07-06 04:58:11 +00:00
|
|
|
Lesser General Public License for more details.
|
1999-05-05 23:29:18 +00:00
|
|
|
|
2001-07-06 04:58:11 +00:00
|
|
|
You should have received a copy of the GNU Lesser General Public
|
2012-02-09 23:18:22 +00:00
|
|
|
License along with the GNU C Library; if not, see
|
|
|
|
<http://www.gnu.org/licenses/>. */
|
1999-05-05 23:29:18 +00:00
|
|
|
|
2010-03-12 15:57:19 +00:00
|
|
|
#include "trusted-dirs.h"
|
|
|
|
|
1999-05-05 23:29:18 +00:00
|
|
|
/* Determine the number of DST elements in the name. Only if IS_PATH is
|
|
|
|
nonzero paths are recognized (i.e., multiple, ':' separated filenames). */
|
|
|
|
#define DL_DST_COUNT(name, is_path) \
|
|
|
|
({ \
|
|
|
|
size_t __cnt = 0; \
|
|
|
|
const char *__sf = strchr (name, '$'); \
|
|
|
|
\
|
2014-02-10 13:45:42 +00:00
|
|
|
if (__glibc_unlikely (__sf != NULL)) \
|
2004-03-06 08:19:29 +00:00
|
|
|
__cnt = _dl_dst_count (__sf, is_path); \
|
1999-05-05 23:29:18 +00:00
|
|
|
\
|
|
|
|
__cnt; })
|
|
|
|
|
|
|
|
|
2011-01-13 04:10:00 +00:00
|
|
|
#ifdef SHARED
|
|
|
|
# define IS_RTLD(l) (l) == &GL(dl_rtld_map)
|
|
|
|
#else
|
|
|
|
# define IS_RTLD(l) 0
|
|
|
|
#endif
|
1999-06-28 15:52:36 +00:00
|
|
|
/* Guess from the number of DSTs the length of the result string. */
|
1999-05-05 23:29:18 +00:00
|
|
|
#define DL_DST_REQUIRED(l, name, len, cnt) \
|
|
|
|
({ \
|
|
|
|
size_t __len = (len); \
|
2003-12-31 11:17:09 +00:00
|
|
|
size_t __cnt = (cnt); \
|
1999-05-05 23:29:18 +00:00
|
|
|
\
|
2003-12-31 11:17:09 +00:00
|
|
|
if (__cnt > 0) \
|
1999-05-05 23:29:18 +00:00
|
|
|
{ \
|
2011-01-13 04:10:00 +00:00
|
|
|
size_t dst_len; \
|
2003-12-31 11:17:09 +00:00
|
|
|
/* Now we make a guess how many extra characters on top of the \
|
|
|
|
length of S we need to represent the result. We know that \
|
|
|
|
we have CNT replacements. Each at most can use \
|
2010-03-12 15:57:19 +00:00
|
|
|
MAX (MAX (strlen (ORIGIN), strlen (_dl_platform)), \
|
|
|
|
strlen (DL_DST_LIB)) \
|
|
|
|
minus 4 (which is the length of "$LIB"). \
|
2003-12-31 11:17:09 +00:00
|
|
|
\
|
|
|
|
First get the origin string if it is not available yet. \
|
2011-01-13 04:10:00 +00:00
|
|
|
This can only happen for the map of the executable or, when \
|
|
|
|
auditing, in ld.so. */ \
|
2003-12-31 11:17:09 +00:00
|
|
|
if ((l)->l_origin == NULL) \
|
|
|
|
{ \
|
2011-01-13 04:10:00 +00:00
|
|
|
assert ((l)->l_name[0] == '\0' || IS_RTLD (l)); \
|
2003-12-31 11:17:09 +00:00
|
|
|
(l)->l_origin = _dl_get_origin (); \
|
2010-03-12 15:57:19 +00:00
|
|
|
dst_len = ((l)->l_origin && (l)->l_origin != (char *) -1 \
|
2003-12-31 11:17:09 +00:00
|
|
|
? strlen ((l)->l_origin) : 0); \
|
|
|
|
} \
|
|
|
|
else \
|
2010-03-12 15:57:19 +00:00
|
|
|
dst_len = (l)->l_origin == (char *) -1 \
|
2003-12-31 11:17:09 +00:00
|
|
|
? 0 : strlen ((l)->l_origin); \
|
2011-01-13 04:10:00 +00:00
|
|
|
dst_len = MAX (MAX (dst_len, GLRO(dl_platformlen)), \
|
2010-03-12 15:57:19 +00:00
|
|
|
strlen (DL_DST_LIB)); \
|
|
|
|
if (dst_len > 4) \
|
|
|
|
__len += __cnt * (dst_len - 4); \
|
1999-05-05 23:29:18 +00:00
|
|
|
} \
|
|
|
|
\
|
2003-12-31 11:17:09 +00:00
|
|
|
__len; })
|