2012-11-15 12:06:41 +01:00
|
|
|
/* $NetBSD: getcwd.c,v 1.53 2012/06/21 23:29:23 enami Exp $ */
|
2011-02-14 20:36:03 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1989, 1991, 1993, 1995
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Jan-Simon Pendry.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/cdefs.h>
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
|
|
#if 0
|
|
|
|
static char sccsid[] = "@(#)getcwd.c 8.5 (Berkeley) 2/7/95";
|
|
|
|
#else
|
2012-11-15 12:06:41 +01:00
|
|
|
__RCSID("$NetBSD: getcwd.c,v 1.53 2012/06/21 23:29:23 enami Exp $");
|
2011-02-14 20:36:03 +01:00
|
|
|
#endif
|
|
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
|
|
|
|
#include "namespace.h"
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <unistd.h>
|
2012-11-15 12:06:41 +01:00
|
|
|
#include <ssp/ssp.h>
|
2011-02-14 20:36:03 +01:00
|
|
|
|
|
|
|
#include "extern.h"
|
|
|
|
|
|
|
|
#ifdef __weak_alias
|
2011-02-22 10:08:24 +01:00
|
|
|
__weak_alias(getcwd,_getcwd)
|
2012-11-15 12:06:41 +01:00
|
|
|
__weak_alias(_sys_getcwd,_getcwd)
|
2011-02-14 20:36:03 +01:00
|
|
|
__weak_alias(realpath,_realpath)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
2012-11-15 12:06:41 +01:00
|
|
|
* char *realpath(const char *path, char *resolved);
|
2011-02-14 20:36:03 +01:00
|
|
|
*
|
|
|
|
* Find the real name of path, by removing all ".", ".." and symlink
|
|
|
|
* components. Returns (resolved) on success, or (NULL) on failure,
|
|
|
|
* in which case the path which caused trouble is left in (resolved).
|
|
|
|
*/
|
|
|
|
char *
|
2012-11-15 12:06:41 +01:00
|
|
|
realpath(const char * __restrict path, char * __restrict resolved)
|
2011-02-14 20:36:03 +01:00
|
|
|
{
|
|
|
|
struct stat sb;
|
2012-11-15 12:06:41 +01:00
|
|
|
int idx = 0, nlnk = 0;
|
2011-02-14 20:36:03 +01:00
|
|
|
const char *q;
|
2012-11-15 12:06:41 +01:00
|
|
|
char *p, wbuf[2][MAXPATHLEN], *fres;
|
2011-02-14 20:36:03 +01:00
|
|
|
size_t len;
|
2012-11-15 12:06:41 +01:00
|
|
|
ssize_t n;
|
2011-02-14 20:36:03 +01:00
|
|
|
|
|
|
|
/* POSIX sez we must test for this */
|
|
|
|
if (path == NULL) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-11-15 12:06:41 +01:00
|
|
|
if (resolved == NULL) {
|
|
|
|
fres = resolved = malloc(MAXPATHLEN);
|
|
|
|
if (resolved == NULL)
|
|
|
|
return NULL;
|
|
|
|
} else
|
|
|
|
fres = NULL;
|
|
|
|
|
|
|
|
|
2011-02-14 20:36:03 +01:00
|
|
|
/*
|
|
|
|
* Build real path one by one with paying an attention to .,
|
|
|
|
* .. and symbolic link.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* `p' is where we'll put a new component with prepending
|
|
|
|
* a delimiter.
|
|
|
|
*/
|
|
|
|
p = resolved;
|
|
|
|
|
2012-11-15 12:06:41 +01:00
|
|
|
if (*path == '\0') {
|
|
|
|
*p = '\0';
|
2011-02-14 20:36:03 +01:00
|
|
|
errno = ENOENT;
|
2012-11-15 12:06:41 +01:00
|
|
|
goto out;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* If relative path, start from current working directory. */
|
|
|
|
if (*path != '/') {
|
|
|
|
/* check for resolved pointer to appease coverity */
|
|
|
|
if (resolved && getcwd(resolved, MAXPATHLEN) == NULL) {
|
|
|
|
p[0] = '.';
|
2012-11-15 12:06:41 +01:00
|
|
|
p[1] = '\0';
|
|
|
|
goto out;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
len = strlen(resolved);
|
|
|
|
if (len > 1)
|
|
|
|
p += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
loop:
|
|
|
|
/* Skip any slash. */
|
|
|
|
while (*path == '/')
|
|
|
|
path++;
|
|
|
|
|
2012-11-15 12:06:41 +01:00
|
|
|
if (*path == '\0') {
|
2011-02-14 20:36:03 +01:00
|
|
|
if (p == resolved)
|
|
|
|
*p++ = '/';
|
2012-11-15 12:06:41 +01:00
|
|
|
*p = '\0';
|
|
|
|
return resolved;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Find the end of this component. */
|
|
|
|
q = path;
|
|
|
|
do
|
|
|
|
q++;
|
2012-11-15 12:06:41 +01:00
|
|
|
while (*q != '/' && *q != '\0');
|
2011-02-14 20:36:03 +01:00
|
|
|
|
|
|
|
/* Test . or .. */
|
|
|
|
if (path[0] == '.') {
|
|
|
|
if (q - path == 1) {
|
|
|
|
path = q;
|
|
|
|
goto loop;
|
|
|
|
}
|
|
|
|
if (path[1] == '.' && q - path == 2) {
|
|
|
|
/* Trim the last component. */
|
|
|
|
if (p != resolved)
|
|
|
|
while (*--p != '/')
|
2012-11-15 12:06:41 +01:00
|
|
|
continue;
|
2011-02-14 20:36:03 +01:00
|
|
|
path = q;
|
|
|
|
goto loop;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Append this component. */
|
|
|
|
if (p - resolved + 1 + q - path + 1 > MAXPATHLEN) {
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
if (p == resolved)
|
|
|
|
*p++ = '/';
|
2012-11-15 12:06:41 +01:00
|
|
|
*p = '\0';
|
|
|
|
goto out;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
p[0] = '/';
|
|
|
|
memcpy(&p[1], path,
|
|
|
|
/* LINTED We know q > path. */
|
|
|
|
q - path);
|
2012-11-15 12:06:41 +01:00
|
|
|
p[1 + q - path] = '\0';
|
2011-02-14 20:36:03 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If this component is a symlink, toss it and prepend link
|
|
|
|
* target to unresolved path.
|
|
|
|
*/
|
2012-11-15 12:06:41 +01:00
|
|
|
if (lstat(resolved, &sb) == -1)
|
|
|
|
goto out;
|
|
|
|
|
2011-02-14 20:36:03 +01:00
|
|
|
if (S_ISLNK(sb.st_mode)) {
|
|
|
|
if (nlnk++ >= MAXSYMLINKS) {
|
|
|
|
errno = ELOOP;
|
2012-11-15 12:06:41 +01:00
|
|
|
goto out;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
n = readlink(resolved, wbuf[idx], sizeof(wbuf[0]) - 1);
|
|
|
|
if (n < 0)
|
2012-11-15 12:06:41 +01:00
|
|
|
goto out;
|
2011-02-14 20:36:03 +01:00
|
|
|
if (n == 0) {
|
|
|
|
errno = ENOENT;
|
2012-11-15 12:06:41 +01:00
|
|
|
goto out;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Append unresolved path to link target and switch to it. */
|
|
|
|
if (n + (len = strlen(q)) + 1 > sizeof(wbuf[0])) {
|
|
|
|
errno = ENAMETOOLONG;
|
2012-11-15 12:06:41 +01:00
|
|
|
goto out;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
memcpy(&wbuf[idx][n], q, len + 1);
|
|
|
|
path = wbuf[idx];
|
|
|
|
idx ^= 1;
|
|
|
|
|
|
|
|
/* If absolute symlink, start from root. */
|
|
|
|
if (*path == '/')
|
|
|
|
p = resolved;
|
|
|
|
goto loop;
|
|
|
|
}
|
|
|
|
if (*q == '/' && !S_ISDIR(sb.st_mode)) {
|
|
|
|
errno = ENOTDIR;
|
2012-11-15 12:06:41 +01:00
|
|
|
goto out;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Advance both resolved and unresolved path. */
|
|
|
|
p += 1 + q - path;
|
|
|
|
path = q;
|
|
|
|
goto loop;
|
2012-11-15 12:06:41 +01:00
|
|
|
out:
|
|
|
|
free(fres);
|
|
|
|
return NULL;
|
2011-02-14 20:36:03 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
2012-11-15 12:06:41 +01:00
|
|
|
__ssp_real(getcwd)(char *pt, size_t size)
|
2011-02-14 20:36:03 +01:00
|
|
|
{
|
|
|
|
char *npt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If a buffer is specified, the size has to be non-zero.
|
|
|
|
*/
|
|
|
|
if (pt != NULL) {
|
|
|
|
if (size == 0) {
|
|
|
|
/* __getcwd(pt, 0) results ERANGE. */
|
|
|
|
errno = EINVAL;
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
if (__getcwd(pt, size) >= 0)
|
|
|
|
return (pt);
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If no buffer specified by the user, allocate one as necessary.
|
|
|
|
*/
|
|
|
|
size = 1024 >> 1;
|
|
|
|
do {
|
|
|
|
if ((npt = realloc(pt, size <<= 1)) == NULL)
|
|
|
|
break;
|
|
|
|
pt = npt;
|
|
|
|
if (__getcwd(pt, size) >= 0)
|
|
|
|
return (pt);
|
|
|
|
} while (size <= MAXPATHLEN * 4 && errno == ERANGE);
|
|
|
|
|
|
|
|
free(pt);
|
|
|
|
return (NULL);
|
|
|
|
}
|