2 * Copyright (c) 2018, 2019 Stefan Sperling <stsp@openbsd.org>
3 * Copyright (c) 2015 Theo de Raadt <deraadt@openbsd.org>
4 * Copyright (c) 1997 Todd C. Miller <millert@openbsd.org>
6 * Permission to use, copy, modify, and distribute this software for any
7 * purpose with or without fee is hereby granted, provided that the above
8 * copyright notice and this permission notice appear in all copies.
10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
32 #include "got_compat.h"
34 #include "got_error.h"
38 #define MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
42 got_path_is_absolute(const char *path
)
44 return path
[0] == '/';
47 /* based on canonpath() from kern_pledge.c */
48 const struct got_error
*
49 got_canonpath(const char *input
, char *buf
, size_t bufsize
)
54 /* can't canon relative paths, don't bother */
55 if (!got_path_is_absolute(input
)) {
56 if (strlcpy(buf
, input
, bufsize
) >= bufsize
)
57 return got_error(GOT_ERR_NO_SPACE
);
63 while (*p
&& (q
- buf
< bufsize
)) {
64 if (p
[0] == '/' && (p
[1] == '/' || p
[1] == '\0')) {
67 } else if (p
[0] == '/' && p
[1] == '.' &&
68 (p
[2] == '/' || p
[2] == '\0')) {
71 } else if (p
[0] == '/' && p
[1] == '.' && p
[2] == '.' &&
72 (p
[3] == '/' || p
[3] == '\0')) {
74 if (q
!= buf
) /* "/../" at start of buf */
82 if ((*p
== '\0') && (q
- buf
< bufsize
)) {
86 return got_error(GOT_ERR_NO_SPACE
);
89 const struct got_error
*
90 got_path_skip_common_ancestor(char **child
, const char *parent_abspath
,
93 const struct got_error
*err
= NULL
;
94 size_t len_parent
, len
, bufsize
;
98 len_parent
= strlen(parent_abspath
);
99 len
= strlen(abspath
);
100 if (len_parent
>= len
)
101 return got_error_path(abspath
, GOT_ERR_BAD_PATH
);
102 if (strncmp(parent_abspath
, abspath
, len_parent
) != 0)
103 return got_error_path(abspath
, GOT_ERR_BAD_PATH
);
104 if (!got_path_is_root_dir(parent_abspath
) && abspath
[len_parent
] != '/')
105 return got_error_path(abspath
, GOT_ERR_BAD_PATH
);
106 while (abspath
[len_parent
] == '/')
108 bufsize
= len
- len_parent
+ 1;
109 *child
= malloc(bufsize
);
111 return got_error_from_errno("malloc");
112 if (strlcpy(*child
, abspath
+ len_parent
, bufsize
) >= bufsize
) {
113 err
= got_error_from_errno("strlcpy");
122 got_path_is_root_dir(const char *path
)
126 return (*path
== '\0');
130 got_path_is_current_dir(const char *path
)
132 return (path
[0] == '.' && path
[1] == '\0');
136 got_path_is_child(const char *child
, const char *parent
, size_t parent_len
)
138 if (parent_len
== 0 || got_path_is_root_dir(parent
))
141 if (strncmp(parent
, child
, parent_len
) != 0)
143 if (child
[parent_len
] != '/')
150 got_path_cmp(const char *path1
, const char *path2
, size_t len1
, size_t len2
)
155 /* Leading directory separators are insignificant. */
156 while (path1
[0] == '/') {
160 while (path2
[0] == '/') {
165 min_len
= MIN(len1
, len2
);
167 /* Skip over common prefix. */
168 while (i
< min_len
&& path1
[i
] == path2
[i
])
171 /* Are the paths exactly equal (besides path separators)? */
172 if (len1
== len2
&& i
>= min_len
)
175 /* Skip over redundant trailing path seperators. */
176 while (path1
[i
] == '/' && path1
[i
+ 1] == '/')
178 while (path2
[i
] == '/' && path2
[i
+ 1] == '/')
181 /* Trailing path separators are insignificant. */
182 if (path1
[i
] == '/' && path1
[i
+ 1] == '\0' && path2
[i
] == '\0')
184 if (path2
[i
] == '/' && path2
[i
+ 1] == '\0' && path1
[i
] == '\0')
187 /* Order children in subdirectories directly after their parents. */
188 if (path1
[i
] == '/' && path2
[i
] == '\0')
190 if (path2
[i
] == '/' && path1
[i
] == '\0')
192 if (path1
[i
] == '/' && path2
[i
] != '\0')
194 if (path2
[i
] == '/' && path1
[i
] != '\0')
197 /* Next character following the common prefix determines order. */
198 return (unsigned char)path1
[i
] < (unsigned char)path2
[i
] ? -1 : 1;
201 const struct got_error
*
202 got_pathlist_insert(struct got_pathlist_entry
**inserted
,
203 struct got_pathlist_head
*pathlist
, const char *path
, void *data
)
205 struct got_pathlist_entry
*new, *pe
;
210 new = malloc(sizeof(*new));
212 return got_error_from_errno("malloc");
214 new->path_len
= strlen(path
);
218 * Many callers will provide paths in a somewhat sorted order while
219 * constructing a path list from inputs such as tree objects or
220 * dirents. Iterating backwards from the tail of the list should
221 * be more efficient than traversing through the entire list each
222 * time an element is inserted.
224 pe
= TAILQ_LAST(pathlist
, got_pathlist_head
);
226 int cmp
= got_path_cmp(pe
->path
, new->path
,
227 pe
->path_len
, new->path_len
);
229 free(new); /* duplicate */
231 } else if (cmp
< 0) {
232 TAILQ_INSERT_AFTER(pathlist
, pe
, new, entry
);
237 pe
= TAILQ_PREV(pe
, got_pathlist_head
, entry
);
240 TAILQ_INSERT_HEAD(pathlist
, new, entry
);
246 const struct got_error
*
247 got_pathlist_append(struct got_pathlist_head
*pathlist
,
248 const char *path
, void *data
)
250 struct got_pathlist_entry
*new;
252 new = malloc(sizeof(*new));
254 return got_error_from_errno("malloc");
256 new->path_len
= strlen(path
);
258 TAILQ_INSERT_TAIL(pathlist
, new, entry
);
263 got_pathlist_free(struct got_pathlist_head
*pathlist
)
265 struct got_pathlist_entry
*pe
;
267 while ((pe
= TAILQ_FIRST(pathlist
)) != NULL
) {
268 TAILQ_REMOVE(pathlist
, pe
, entry
);
273 static const struct got_error
*
274 make_parent_dirs(const char *abspath
)
276 const struct got_error
*err
= NULL
;
279 err
= got_path_dirname(&parent
, abspath
);
283 if (mkdir(parent
, GOT_DEFAULT_DIR_MODE
) == -1) {
284 if (errno
== ENOENT
) {
285 err
= make_parent_dirs(parent
);
288 if (mkdir(parent
, GOT_DEFAULT_DIR_MODE
) == -1) {
289 err
= got_error_from_errno2("mkdir", parent
);
293 err
= got_error_from_errno2("mkdir", parent
);
300 const struct got_error
*
301 got_path_mkdir(const char *abspath
)
303 const struct got_error
*err
= NULL
;
305 if (mkdir(abspath
, GOT_DEFAULT_DIR_MODE
) == -1) {
306 if (errno
== ENOENT
) {
307 err
= make_parent_dirs(abspath
);
310 if (mkdir(abspath
, GOT_DEFAULT_DIR_MODE
) == -1)
311 err
= got_error_from_errno2("mkdir", abspath
);
313 err
= got_error_from_errno2("mkdir", abspath
);
321 got_path_dir_is_empty(const char *dir
)
331 while ((dent
= readdir(d
)) != NULL
) {
332 if (strcmp(dent
->d_name
, ".") == 0 ||
333 strcmp(dent
->d_name
, "..") == 0)
344 const struct got_error
*
345 got_path_dirname(char **parent
, const char *path
)
350 if (strlcpy(buf
, path
, sizeof(buf
)) >= sizeof(buf
))
351 return got_error(GOT_ERR_NO_SPACE
);
355 return got_error_from_errno2("dirname", path
);
357 if (p
[0] == '.' && p
[1] == '\0')
358 return got_error_path(path
, GOT_ERR_BAD_PATH
);
362 return got_error_from_errno("strdup");
367 const struct got_error
*
368 got_path_dirent_type(int *type
, const char *path_parent
, struct dirent
*dent
)
370 const struct got_error
*err
= NULL
;
374 if (dent
->d_type
!= DT_UNKNOWN
) {
375 *type
= dent
->d_type
;
382 * This is a fallback to accommodate filesystems which do not
383 * provide directory entry type information. DT_UNKNOWN directory
384 * entries occur on NFS mounts without "readdir plus" RPC.
387 if (asprintf(&path_child
, "%s/%s", path_parent
, dent
->d_name
) == -1)
388 return got_error_from_errno("asprintf");
390 if (lstat(path_child
, &sb
) == -1) {
391 err
= got_error_from_errno2("lstat", path_child
);
395 if (S_ISFIFO(sb
.st_mode
))
397 else if (S_ISCHR(sb
.st_mode
))
399 else if (S_ISDIR(sb
.st_mode
))
401 else if (S_ISBLK(sb
.st_mode
))
403 else if (S_ISLNK(sb
.st_mode
))
405 else if (S_ISREG(sb
.st_mode
))
407 else if (S_ISSOCK(sb
.st_mode
))
414 const struct got_error
*
415 got_path_basename(char **s
, const char *path
)
420 if (strlcpy(buf
, path
, sizeof(buf
)) >= sizeof(buf
))
421 return got_error(GOT_ERR_NO_SPACE
);
423 base
= basename(buf
);
425 return got_error_from_errno2("basename", path
);
429 return got_error_from_errno("strdup");
435 got_path_strip_trailing_slashes(char *path
)
440 while (x
-- > 0 && path
[x
] == '/')
444 /* based on findprog() from usr.sbin/which/which.c */
445 const struct got_error
*
446 got_path_find_prog(char **filename
, const char *prog
)
448 const struct got_error
*err
= NULL
;
452 char *path
, *pathcpy
;
456 path
= getenv("PATH");
458 path
= _PATH_DEFPATH
;
460 /* Special case if prog contains '/' */
461 if (strchr(prog
, '/')) {
462 if ((stat(prog
, &sbuf
) == 0) && S_ISREG(sbuf
.st_mode
) &&
463 access(prog
, X_OK
) == 0) {
464 *filename
= strdup(prog
);
465 if (*filename
== NULL
)
466 return got_error_from_errno("strdup");
471 if ((path
= strdup(path
)) == NULL
)
472 return got_error_from_errno("strdup");
475 while ((p
= strsep(&pathcpy
, ":")) != NULL
) {
480 while (len
> 0 && p
[len
-1] == '/')
481 p
[--len
] = '\0'; /* strip trailing '/' */
483 if (asprintf(filename
, "%s/%s", p
, prog
) == -1) {
484 err
= got_error_from_errno("asprintf");
487 if ((stat(*filename
, &sbuf
) == 0) && S_ISREG(sbuf
.st_mode
) &&
488 access(*filename
, X_OK
) == 0)
498 const struct got_error
*
499 got_path_create_file(const char *path
, const char *content
)
501 const struct got_error
*err
= NULL
;
504 fd
= open(path
, O_RDWR
| O_CREAT
| O_EXCL
| O_NOFOLLOW
,
505 GOT_DEFAULT_FILE_MODE
);
507 err
= got_error_from_errno2("open", path
);
512 int len
= dprintf(fd
, "%s\n", content
);
513 if (len
!= strlen(content
) + 1) {
514 err
= got_error_from_errno("dprintf");
520 if (fd
!= -1 && close(fd
) == -1 && err
== NULL
)
521 err
= got_error_from_errno("close");