2020-09-02 16:47:03 +08:00
|
|
|
/* Read symbolic links into a buffer without size limitation, relative to fd.
|
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
Copyright (C) 2001, 2003-2004, 2007, 2009-2022 Free Software Foundation,
|
2020-09-02 16:47:03 +08:00
|
|
|
Inc.
|
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
This file is free software: you can redistribute it and/or 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.
|
2020-09-02 16:47:03 +08:00
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
This file is distributed in the hope that it will be useful,
|
2020-09-02 16:47:03 +08:00
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
2022-07-28 14:16:50 +08:00
|
|
|
GNU Lesser General Public License for more details.
|
2020-09-02 16:47:03 +08:00
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
2020-09-02 16:47:03 +08:00
|
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>. */
|
|
|
|
|
|
|
|
/* Written by Paul Eggert, Bruno Haible, and Jim Meyering. */
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
|
|
|
#include "careadlinkat.h"
|
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
#include "idx.h"
|
|
|
|
#include "minmax.h"
|
|
|
|
|
2020-09-02 16:47:03 +08:00
|
|
|
#include <errno.h>
|
|
|
|
#include <limits.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
|
|
|
|
/* Define this independently so that stdint.h is not a prerequisite. */
|
|
|
|
#ifndef SIZE_MAX
|
|
|
|
# define SIZE_MAX ((size_t) -1)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef SSIZE_MAX
|
|
|
|
# define SSIZE_MAX ((ssize_t) (SIZE_MAX / 2))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "allocator.h"
|
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
enum { STACK_BUF_SIZE = 1024 };
|
|
|
|
|
|
|
|
/* Act like careadlinkat (see below), with an additional argument
|
|
|
|
STACK_BUF that can be used as temporary storage.
|
|
|
|
|
|
|
|
If GCC_LINT is defined, do not inline this function with GCC 10.1
|
|
|
|
and later, to avoid creating a pointer to the stack that GCC
|
|
|
|
-Wreturn-local-addr incorrectly complains about. See:
|
|
|
|
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=93644
|
|
|
|
Although the noinline attribute can hurt performance a bit, no better way
|
|
|
|
to pacify GCC is known; even an explicit #pragma does not pacify GCC.
|
|
|
|
When the GCC bug is fixed this workaround should be limited to the
|
|
|
|
broken GCC versions. */
|
|
|
|
#if _GL_GNUC_PREREQ (10, 1)
|
|
|
|
# if defined GCC_LINT || defined lint
|
|
|
|
__attribute__ ((__noinline__))
|
|
|
|
# elif __OPTIMIZE__ && !__NO_INLINE__
|
|
|
|
# define GCC_BOGUS_WRETURN_LOCAL_ADDR
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
static char *
|
|
|
|
readlink_stk (int fd, char const *filename,
|
2020-09-02 16:47:03 +08:00
|
|
|
char *buffer, size_t buffer_size,
|
|
|
|
struct allocator const *alloc,
|
2022-07-28 14:16:50 +08:00
|
|
|
ssize_t (*preadlinkat) (int, char const *, char *, size_t),
|
|
|
|
char stack_buf[STACK_BUF_SIZE])
|
2020-09-02 16:47:03 +08:00
|
|
|
{
|
|
|
|
if (! alloc)
|
|
|
|
alloc = &stdlib_allocator;
|
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
if (!buffer)
|
2020-09-02 16:47:03 +08:00
|
|
|
{
|
|
|
|
buffer = stack_buf;
|
2022-07-28 14:16:50 +08:00
|
|
|
buffer_size = STACK_BUF_SIZE;
|
2020-09-02 16:47:03 +08:00
|
|
|
}
|
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
char *buf = buffer;
|
|
|
|
idx_t buf_size_max = MIN (IDX_MAX, MIN (SSIZE_MAX, SIZE_MAX));
|
|
|
|
idx_t buf_size = MIN (buffer_size, buf_size_max);
|
2020-09-02 16:47:03 +08:00
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
while (buf)
|
2020-09-02 16:47:03 +08:00
|
|
|
{
|
|
|
|
/* Attempt to read the link into the current buffer. */
|
2022-07-28 14:16:50 +08:00
|
|
|
idx_t link_length = preadlinkat (fd, filename, buf, buf_size);
|
2020-09-02 16:47:03 +08:00
|
|
|
if (link_length < 0)
|
|
|
|
{
|
2022-07-28 14:16:50 +08:00
|
|
|
if (buf != buffer)
|
2020-09-02 16:47:03 +08:00
|
|
|
{
|
2022-07-28 14:16:50 +08:00
|
|
|
int readlinkat_errno = errno;
|
|
|
|
alloc->free (buf);
|
|
|
|
errno = readlinkat_errno;
|
2020-09-02 16:47:03 +08:00
|
|
|
}
|
2022-07-28 14:16:50 +08:00
|
|
|
return NULL;
|
2020-09-02 16:47:03 +08:00
|
|
|
}
|
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
idx_t link_size = link_length;
|
2020-09-02 16:47:03 +08:00
|
|
|
|
|
|
|
if (link_size < buf_size)
|
|
|
|
{
|
|
|
|
buf[link_size++] = '\0';
|
|
|
|
|
|
|
|
if (buf == stack_buf)
|
|
|
|
{
|
2022-07-28 14:16:50 +08:00
|
|
|
char *b = alloc->allocate (link_size);
|
2020-09-02 16:47:03 +08:00
|
|
|
buf_size = link_size;
|
|
|
|
if (! b)
|
|
|
|
break;
|
2022-07-28 14:16:50 +08:00
|
|
|
return memcpy (b, buf, link_size);
|
2020-09-02 16:47:03 +08:00
|
|
|
}
|
2022-07-28 14:16:50 +08:00
|
|
|
|
|
|
|
if (link_size < buf_size && buf != buffer && alloc->reallocate)
|
2020-09-02 16:47:03 +08:00
|
|
|
{
|
|
|
|
/* Shrink BUF before returning it. */
|
2022-07-28 14:16:50 +08:00
|
|
|
char *b = alloc->reallocate (buf, link_size);
|
2020-09-02 16:47:03 +08:00
|
|
|
if (b)
|
2022-07-28 14:16:50 +08:00
|
|
|
return b;
|
2020-09-02 16:47:03 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (buf != buffer)
|
|
|
|
alloc->free (buf);
|
|
|
|
|
2022-07-28 14:16:50 +08:00
|
|
|
if (buf_size_max / 2 <= buf_size)
|
2020-09-02 16:47:03 +08:00
|
|
|
{
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
return NULL;
|
|
|
|
}
|
2022-07-28 14:16:50 +08:00
|
|
|
|
|
|
|
buf_size = 2 * buf_size + 1;
|
|
|
|
buf = alloc->allocate (buf_size);
|
2020-09-02 16:47:03 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (alloc->die)
|
|
|
|
alloc->die (buf_size);
|
|
|
|
errno = ENOMEM;
|
|
|
|
return NULL;
|
|
|
|
}
|
2022-07-28 14:16:50 +08:00
|
|
|
|
|
|
|
|
|
|
|
/* Assuming the current directory is FD, get the symbolic link value
|
|
|
|
of FILENAME as a null-terminated string and put it into a buffer.
|
|
|
|
If FD is AT_FDCWD, FILENAME is interpreted relative to the current
|
|
|
|
working directory, as in openat.
|
|
|
|
|
|
|
|
If the link is small enough to fit into BUFFER put it there.
|
|
|
|
BUFFER's size is BUFFER_SIZE, and BUFFER can be null
|
|
|
|
if BUFFER_SIZE is zero.
|
|
|
|
|
|
|
|
If the link is not small, put it into a dynamically allocated
|
|
|
|
buffer managed by ALLOC. It is the caller's responsibility to free
|
|
|
|
the returned value if it is nonnull and is not BUFFER. A null
|
|
|
|
ALLOC stands for the standard allocator.
|
|
|
|
|
|
|
|
The PREADLINKAT function specifies how to read links. It operates
|
|
|
|
like POSIX readlinkat()
|
|
|
|
<https://pubs.opengroup.org/onlinepubs/9699919799/functions/readlink.html>
|
|
|
|
but can assume that its first argument is the same as FD.
|
|
|
|
|
|
|
|
If successful, return the buffer address; otherwise return NULL and
|
|
|
|
set errno. */
|
|
|
|
|
|
|
|
char *
|
|
|
|
careadlinkat (int fd, char const *filename,
|
|
|
|
char *buffer, size_t buffer_size,
|
|
|
|
struct allocator const *alloc,
|
|
|
|
ssize_t (*preadlinkat) (int, char const *, char *, size_t))
|
|
|
|
{
|
|
|
|
/* Allocate the initial buffer on the stack. This way, in the
|
|
|
|
common case of a symlink of small size, we get away with a
|
|
|
|
single small malloc instead of a big malloc followed by a
|
|
|
|
shrinking realloc. */
|
|
|
|
#ifdef GCC_BOGUS_WRETURN_LOCAL_ADDR
|
|
|
|
#warning "GCC might issue a bogus -Wreturn-local-addr warning here."
|
|
|
|
#warning "See <https://gcc.gnu.org/bugzilla/show_bug.cgi?id=93644>."
|
|
|
|
#endif
|
|
|
|
char stack_buf[STACK_BUF_SIZE];
|
|
|
|
return readlink_stk (fd, filename, buffer, buffer_size, alloc,
|
|
|
|
preadlinkat, stack_buf);
|
|
|
|
}
|