1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
|
/* Return the canonical absolute name of a given file.
* Copyright (C) 1996-2001, 2002 Free Software Foundation, Inc.
* This file is part of the GNU C Library.
*
* Copyright (C) 2002 Red Hat, Inc. (trivial port to GLib)
*
* The GNU C Library 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.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with the GNU C Library; if not, write to the Free
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA.
*/
#include <config.h>
#include "canonicalize.h"
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <limits.h>
#include <sys/param.h>
#include <sys/stat.h>
#include <errno.h>
#include <stddef.h>
#ifndef MAXSYMLINKS
#define MAXSYMLINKS sysconf(_SC_SYMLOOP_MAX)
#endif
/* Return the canonical absolute name of file NAME. A canonical name
does not contain any `.', `..' components nor any repeated path
separators ('/') or symlinks. All path components must exist. If
RESOLVED is null, the result is malloc'd; otherwise, if the
canonical name is PATH_MAX chars or more, returns null with `errno'
set to ENAMETOOLONG; if the name fits in fewer than PATH_MAX chars,
returns the name in RESOLVED. If the name cannot be resolved and
RESOLVED is non-NULL, it contains the path of the first component
that cannot be resolved. If the path can be resolved, RESOLVED
holds the same value as the value returned. */
static char* menu_realpath(const char* name, char* resolved)
{
char* rpath = NULL;
char* dest = NULL;
char* extra_buf = NULL;
const char* start;
const char* end;
const char* rpath_limit;
long int path_max;
int num_links = 0;
if (name == NULL)
{
/* As per Single Unix Specification V2 we must return an error if
* either parameter is a null pointer. We extend this to allow
* the RESOLVED parameter to be NULL in case the we are expected to
* allocate the room for the return value. */
errno = EINVAL;
return NULL;
}
if (name[0] == '\0')
{
/* As per Single Unix Specification V2 we must return an error if
* the name argument points to an empty string. */
errno = ENOENT;
return NULL;
}
#ifdef PATH_MAX
path_max = PATH_MAX;
#else
path_max = pathconf(name, _PC_PATH_MAX);
if (path_max <= 0)
{
path_max = 1024;
}
#endif
rpath = resolved ? g_alloca(path_max) : g_malloc(path_max);
rpath_limit = rpath + path_max;
if (name[0] != G_DIR_SEPARATOR)
{
if (!getcwd(rpath, path_max))
{
rpath[0] = '\0';
goto error;
}
dest = strchr(rpath, '\0');
}
else
{
rpath[0] = G_DIR_SEPARATOR;
dest = rpath + 1;
}
for (start = end = name; *start; start = end)
{
struct stat st;
int n;
/* Skip sequence of multiple path-separators. */
while (*start == G_DIR_SEPARATOR)
{
++start;
}
/* Find end of path component. */
for (end = start; *end && *end != G_DIR_SEPARATOR; ++end)
{
/* Nothing. */;
}
if (end - start == 0)
{
break;
}
else if (end - start == 1 && start[0] == '.')
{
/* nothing */;
}
else if (end - start == 2 && start[0] == '.' && start[1] == '.')
{
/* Back up to previous component, ignore if at root already. */
if (dest > rpath + 1)
{
while ((--dest)[-1] != G_DIR_SEPARATOR)
{
/* Nothing. */;
}
}
}
else
{
size_t new_size;
if (dest[-1] != G_DIR_SEPARATOR)
{
*dest++ = G_DIR_SEPARATOR;
}
if (dest + (end - start) >= rpath_limit)
{
char* new_rpath;
ptrdiff_t dest_offset = dest - rpath;
if (resolved)
{
#ifdef ENAMETOOLONG
errno = ENAMETOOLONG;
#else
/* Uh... just pick something */
errno = EINVAL;
#endif
if (dest > rpath + 1)
{
dest--;
}
*dest = '\0';
goto error;
}
new_size = rpath_limit - rpath;
if (end - start + 1 > path_max)
{
new_size += end - start + 1;
}
else
{
new_size += path_max;
}
new_rpath = (char*) realloc(rpath, new_size);
if (new_rpath == NULL)
{
goto error;
}
rpath = new_rpath;
rpath_limit = rpath + new_size;
dest = rpath + dest_offset;
}
memcpy(dest, start, end - start);
dest = dest + (end - start);
*dest = '\0';
if (stat(rpath, &st) < 0)
{
goto error;
}
if (S_ISLNK(st.st_mode))
{
char* buf = alloca(path_max);
size_t len;
if (++num_links > MAXSYMLINKS)
{
errno = ELOOP;
goto error;
}
n = readlink(rpath, buf, path_max);
if (n < 0)
{
goto error;
}
buf[n] = '\0';
if (!extra_buf)
{
extra_buf = g_alloca(path_max);
}
len = strlen(end);
if ((long int) (n + len) >= path_max)
{
#ifdef ENAMETOOLONG
errno = ENAMETOOLONG;
#else
/* Uh... just pick something */
errno = EINVAL;
#endif
goto error;
}
/* Careful here, end may be a pointer into extra_buf... */
g_memmove(&extra_buf[n], end, len + 1);
name = end = memcpy(extra_buf, buf, n);
if (buf[0] == G_DIR_SEPARATOR)
{
dest = rpath + 1; /* It's an absolute symlink */
}
else
{
/* Back up to previous component, ignore if at root already: */
if (dest > rpath + 1)
{
while ((--dest)[-1] != G_DIR_SEPARATOR)
{
/* Nothing. */;
}
}
}
}
}
}
if (dest > rpath + 1 && dest[-1] == G_DIR_SEPARATOR)
{
--dest;
}
*dest = '\0';
return resolved ? memcpy(resolved, rpath, dest - rpath + 1) : rpath;
error:
if (resolved)
{
strcpy(resolved, rpath);
}
else
{
g_free(rpath);
}
return NULL;
}
char* menu_canonicalize_file_name(const char* name, gboolean allow_missing_basename)
{
char* retval;
retval = menu_realpath(name, NULL);
/* We could avoid some system calls by using the second
* argument to realpath() instead of doing realpath
* all over again, but who cares really. we'll see if
* it's ever in a profile.
*/
if (allow_missing_basename && retval == NULL)
{
char* dirname;
char* canonical_dirname;
dirname = g_path_get_dirname(name);
canonical_dirname = menu_realpath(dirname, NULL);
g_free(dirname);
if (canonical_dirname)
{
char* basename;
basename = g_path_get_basename(name);
retval = g_build_filename(canonical_dirname, basename, NULL);
g_free(basename);
g_free(canonical_dirname);
}
}
return retval;
}
|