Hash :
7f2a8dc2
Author :
Date :
2019-05-12T15:33:37
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 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379
/*
* Copyright (c) 2018, 2019 Stefan Sperling <stsp@openbsd.org>
* Copyright (c) 2015 Theo de Raadt <deraadt@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/queue.h>
#include <sys/stat.h>
#include <errno.h>
#include <limits.h>
#include <libgen.h>
#include <stdlib.h>
#include <unistd.h>
#include <stdio.h>
#include <string.h>
#include <dirent.h>
#include "got_error.h"
#include "got_path.h"
#ifndef MIN
#define MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
#endif
int
got_path_is_absolute(const char *path)
{
return path[0] == '/';
}
char *
got_path_get_absolute(const char *relpath)
{
char cwd[PATH_MAX];
char *abspath;
if (getcwd(cwd, sizeof(cwd)) == NULL)
return NULL;
if (asprintf(&abspath, "%s/%s/", cwd, relpath) == -1)
return NULL;
return abspath;
}
char *
got_path_normalize(const char *path)
{
char *resolved;
resolved = realpath(path, NULL);
if (resolved == NULL)
return NULL;
if (!got_path_is_absolute(resolved)) {
char *abspath = got_path_get_absolute(resolved);
free(resolved);
resolved = abspath;
}
return resolved;
}
/* based on canonpath() from kern_pledge.c */
const struct got_error *
got_canonpath(const char *input, char *buf, size_t bufsize)
{
const char *p;
char *q;
/* can't canon relative paths, don't bother */
if (!got_path_is_absolute(input)) {
if (strlcpy(buf, input, bufsize) >= bufsize)
return got_error(GOT_ERR_NO_SPACE);
return NULL;
}
p = input;
q = buf;
while (*p && (q - buf < bufsize)) {
if (p[0] == '/' && (p[1] == '/' || p[1] == '\0')) {
p += 1;
} else if (p[0] == '/' && p[1] == '.' &&
(p[2] == '/' || p[2] == '\0')) {
p += 2;
} else if (p[0] == '/' && p[1] == '.' && p[2] == '.' &&
(p[3] == '/' || p[3] == '\0')) {
p += 3;
if (q != buf) /* "/../" at start of buf */
while (*--q != '/')
continue;
} else {
*q++ = *p++;
}
}
if ((*p == '\0') && (q - buf < bufsize)) {
*q = 0;
return NULL;
} else
return got_error(GOT_ERR_NO_SPACE);
}
const struct got_error *
got_path_skip_common_ancestor(char **child, const char *parent_abspath,
const char *abspath)
{
const struct got_error *err = NULL;
size_t len_parent, len, bufsize;
*child = NULL;
len_parent = strlen(parent_abspath);
len = strlen(abspath);
if (len_parent >= len)
return got_error(GOT_ERR_BAD_PATH);
if (strncmp(parent_abspath, abspath, len_parent) != 0)
return got_error(GOT_ERR_BAD_PATH);
if (!got_path_is_root_dir(parent_abspath) && abspath[len_parent] != '/')
return got_error(GOT_ERR_BAD_PATH);
while (abspath[len_parent] == '/')
abspath++;
bufsize = len - len_parent + 1;
*child = malloc(bufsize);
if (*child == NULL)
return got_error_prefix_errno("malloc");
if (strlcpy(*child, abspath + len_parent, bufsize) >= bufsize) {
err = got_error_prefix_errno("strlcpy");
free(*child);
*child = NULL;
return err;
}
return NULL;
}
int
got_path_is_root_dir(const char *path)
{
return (path[0] == '/' && path[1] == '\0');
}
int
got_path_is_current_dir(const char *path)
{
return (path[0] == '.' && path[1] == '\0');
}
int
got_path_is_child(const char *child, const char *parent, size_t parent_len)
{
if (parent_len == 0 || got_path_is_root_dir(parent))
return 1;
if (strncmp(parent, child, parent_len) != 0)
return 0;
if (child[parent_len] != '/')
return 0;
return 1;
}
int
got_path_cmp(const char *path1, const char *path2)
{
size_t len1 = strlen(path1);
size_t len2 = strlen(path2);
size_t min_len = MIN(len1, len2);
size_t i = 0;
/* Leading directory separators are insignificant. */
while (path1[0] == '/')
path1++;
while (path2[0] == '/')
path2++;
len1 = strlen(path1);
len2 = strlen(path2);
min_len = MIN(len1, len2);
/* Skip over common prefix. */
while (i < min_len && path1[i] == path2[i])
i++;
/* Are the paths exactly equal (besides path separators)? */
if (len1 == len2 && i >= min_len)
return 0;
/* Skip over redundant trailing path seperators. */
while (path1[i] == '/' && path1[i + 1] == '/')
path1++;
while (path2[i] == '/' && path2[i + 1] == '/')
path2++;
/* Trailing path separators are insignificant. */
if (path1[i] == '/' && path1[i + 1] == '\0' && path2[i] == '\0')
return 0;
if (path2[i] == '/' && path2[i + 1] == '\0' && path1[i] == '\0')
return 0;
/* Order children in subdirectories directly after their parents. */
if (path1[i] == '/' && path2[i] == '\0')
return 1;
if (path2[i] == '/' && path1[i] == '\0')
return -1;
if (path1[i] == '/' && path2[i] != '\0')
return -1;
if (path2[i] == '/' && path1[i] != '\0')
return 1;
/* Next character following the common prefix determines order. */
return (unsigned char)path1[i] < (unsigned char)path2[i] ? -1 : 1;
}
const struct got_error *
got_pathlist_insert(struct got_pathlist_entry **inserted,
struct got_pathlist_head *pathlist, const char *path, void *data)
{
struct got_pathlist_entry *new, *pe;
if (inserted)
*inserted = NULL;
new = malloc(sizeof(*new));
if (new == NULL)
return got_error_prefix_errno("malloc");
new->path = path;
new->data = data;
/*
* Many callers will provide paths in a somewhat sorted order while
* constructing a path list from inputs such as tree objects or
* dirents. Iterating backwards from the tail of the list should
* be more efficient than traversing through the entire list each
* time an element is inserted.
*/
pe = TAILQ_LAST(pathlist, got_pathlist_head);
while (pe) {
int cmp = got_path_cmp(pe->path, path);
if (cmp == 0) {
free(new); /* duplicate */
return NULL;
} else if (cmp < 0) {
TAILQ_INSERT_AFTER(pathlist, pe, new, entry);
if (inserted)
*inserted = new;
return NULL;
}
pe = TAILQ_PREV(pe, got_pathlist_head, entry);
}
TAILQ_INSERT_HEAD(pathlist, new, entry);
if (inserted)
*inserted = new;
return NULL;
}
void
got_pathlist_free(struct got_pathlist_head *pathlist)
{
struct got_pathlist_entry *pe;
while ((pe = TAILQ_FIRST(pathlist)) != NULL) {
TAILQ_REMOVE(pathlist, pe, entry);
free(pe);
}
}
static const struct got_error *
make_parent_dirs(const char *abspath)
{
const struct got_error *err = NULL;
char *parent;
err = got_path_dirname(&parent, abspath);
if (err)
return err;
if (mkdir(parent, GOT_DEFAULT_DIR_MODE) == -1) {
if (errno == ENOENT) {
err = make_parent_dirs(parent);
if (err)
goto done;
if (mkdir(parent, GOT_DEFAULT_DIR_MODE) == -1) {
err = got_error_prefix_errno2("mkdir", parent);
goto done;
}
} else
err = got_error_prefix_errno2("mkdir", parent);
}
done:
free(parent);
return err;
}
const struct got_error *
got_path_mkdir(const char *abspath)
{
const struct got_error *err = NULL;
if (mkdir(abspath, GOT_DEFAULT_DIR_MODE) == -1) {
if (errno == ENOENT) {
err = make_parent_dirs(abspath);
if (err)
goto done;
if (mkdir(abspath, GOT_DEFAULT_DIR_MODE) == -1)
err = got_error_prefix_errno2("mkdir", abspath);
} else
err = got_error_prefix_errno2("mkdir", abspath);
}
done:
return err;
}
int
got_path_dir_is_empty(const char *dir)
{
DIR *d;
struct dirent *dent;
int empty = 1;
d = opendir(dir);
if (d == NULL)
return 1;
while ((dent = readdir(d)) != NULL) {
if (strcmp(dent->d_name, ".") == 0 ||
strcmp(dent->d_name, "..") == 0)
continue;
empty = 0;
break;
}
closedir(d);
return empty;
}
const struct got_error *
got_path_dirname(char **parent, const char *path)
{
char *p;
p = dirname(path);
if (p == NULL)
return got_error_prefix_errno2("dirname", path);
if (p[0] == '.' && p[1] == '\0')
return got_error(GOT_ERR_BAD_PATH);
*parent = strdup(p);
if (*parent == NULL)
return got_error_prefix_errno("strdup");
return NULL;
}
void
got_path_strip_trailing_slashes(char *path)
{
int x;
while (path[x = strlen(path) - 1] == '/')
path[x] = '\0';
}