2011-04-01 06:28:48 +00:00
|
|
|
/* Read symbolic links into a buffer without size limitation, relative to fd.
|
|
|
|
|
2014-01-01 07:43:34 +00:00
|
|
|
Copyright (C) 2001, 2003-2004, 2007, 2009-2014 Free Software Foundation,
|
2011-04-01 06:28:48 +00:00
|
|
|
Inc.
|
|
|
|
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program 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 General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
|
|
|
|
/* Written by Paul Eggert, Bruno Haible, and Jim Meyering. */
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
|
|
|
#include "careadlinkat.h"
|
|
|
|
|
|
|
|
#include <errno.h>
|
|
|
|
#include <limits.h>
|
|
|
|
#include <string.h>
|
2013-02-08 23:37:17 +00:00
|
|
|
#include <unistd.h>
|
2011-04-01 06:28:48 +00:00
|
|
|
|
|
|
|
/* 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
|
|
|
|
|
2011-04-10 16:00:46 +00:00
|
|
|
#include "allocator.h"
|
|
|
|
|
2011-04-01 06:28:48 +00: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.
|
|
|
|
|
2011-04-09 18:44:05 +00:00
|
|
|
The PREADLINKAT function specifies how to read links. It operates
|
|
|
|
like POSIX readlinkat()
|
|
|
|
<http://pubs.opengroup.org/onlinepubs/9699919799/functions/readlink.html>
|
|
|
|
but can assume that its first argument is the same as FD.
|
2011-04-01 06:28:48 +00:00
|
|
|
|
|
|
|
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))
|
|
|
|
{
|
|
|
|
char *buf;
|
|
|
|
size_t buf_size;
|
|
|
|
size_t buf_size_max =
|
|
|
|
SSIZE_MAX < SIZE_MAX ? (size_t) SSIZE_MAX + 1 : SIZE_MAX;
|
|
|
|
char stack_buf[1024];
|
|
|
|
|
2011-04-05 18:19:19 +00:00
|
|
|
if (! alloc)
|
2011-04-08 21:53:30 +00:00
|
|
|
alloc = &stdlib_allocator;
|
2011-04-01 06:28:48 +00:00
|
|
|
|
|
|
|
if (! buffer_size)
|
|
|
|
{
|
|
|
|
/* 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(). */
|
|
|
|
buffer = stack_buf;
|
|
|
|
buffer_size = sizeof stack_buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
buf = buffer;
|
|
|
|
buf_size = buffer_size;
|
|
|
|
|
|
|
|
do
|
|
|
|
{
|
|
|
|
/* Attempt to read the link into the current buffer. */
|
|
|
|
ssize_t link_length = preadlinkat (fd, filename, buf, buf_size);
|
|
|
|
size_t link_size;
|
|
|
|
if (link_length < 0)
|
|
|
|
{
|
|
|
|
/* On AIX 5L v5.3 and HP-UX 11i v2 04/09, readlink returns -1
|
|
|
|
with errno == ERANGE if the buffer is too small. */
|
|
|
|
int readlinkat_errno = errno;
|
|
|
|
if (readlinkat_errno != ERANGE)
|
|
|
|
{
|
|
|
|
if (buf != buffer)
|
|
|
|
{
|
2011-04-05 18:19:19 +00:00
|
|
|
alloc->free (buf);
|
2011-04-01 06:28:48 +00:00
|
|
|
errno = readlinkat_errno;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
link_size = link_length;
|
|
|
|
|
|
|
|
if (link_size < buf_size)
|
|
|
|
{
|
|
|
|
buf[link_size++] = '\0';
|
|
|
|
|
|
|
|
if (buf == stack_buf)
|
|
|
|
{
|
2011-04-08 21:53:30 +00:00
|
|
|
char *b = (char *) alloc->allocate (link_size);
|
2011-06-02 08:22:57 +00:00
|
|
|
buf_size = link_size;
|
2011-04-01 06:28:48 +00:00
|
|
|
if (! b)
|
|
|
|
break;
|
|
|
|
memcpy (b, buf, link_size);
|
|
|
|
buf = b;
|
|
|
|
}
|
2011-04-08 21:53:30 +00:00
|
|
|
else if (link_size < buf_size && buf != buffer && alloc->reallocate)
|
2011-04-01 06:28:48 +00:00
|
|
|
{
|
|
|
|
/* Shrink BUF before returning it. */
|
2011-04-08 21:53:30 +00:00
|
|
|
char *b = (char *) alloc->reallocate (buf, link_size);
|
2011-04-01 06:28:48 +00:00
|
|
|
if (b)
|
|
|
|
buf = b;
|
|
|
|
}
|
|
|
|
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (buf != buffer)
|
2011-04-05 18:19:19 +00:00
|
|
|
alloc->free (buf);
|
2011-04-01 06:28:48 +00:00
|
|
|
|
|
|
|
if (buf_size <= buf_size_max / 2)
|
|
|
|
buf_size *= 2;
|
|
|
|
else if (buf_size < buf_size_max)
|
|
|
|
buf_size = buf_size_max;
|
2011-06-02 08:22:57 +00:00
|
|
|
else if (buf_size_max < SIZE_MAX)
|
|
|
|
{
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
return NULL;
|
|
|
|
}
|
2011-04-01 06:28:48 +00:00
|
|
|
else
|
|
|
|
break;
|
2011-04-08 21:53:30 +00:00
|
|
|
buf = (char *) alloc->allocate (buf_size);
|
2011-04-01 06:28:48 +00:00
|
|
|
}
|
|
|
|
while (buf);
|
|
|
|
|
2011-04-05 18:19:19 +00:00
|
|
|
if (alloc->die)
|
2011-06-02 08:22:57 +00:00
|
|
|
alloc->die (buf_size);
|
2011-04-01 06:28:48 +00:00
|
|
|
errno = ENOMEM;
|
|
|
|
return NULL;
|
|
|
|
}
|