Gotweb

Blob

Date:: Sat Jul 16 17:56:14 2022 UTC
Message:: portable: add back sys/queue.h Now that the handling of including sys/queue.h is better, there's no need to remove those lines from the source. Copy the location of those original sys/queue.h lines from upstream at the same line number, so as to avoid any conflicts in the future.
Actions:: History | Blame | Raw File
1 /*
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>
5  *
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.
9  *
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.
17  */
18 
19 #include <sys/queue.h>
20 #include <sys/stat.h>
21 
22 #include <errno.h>
23 #include <fcntl.h>
24 #include <limits.h>
25 #include <libgen.h>
26 #include <stdlib.h>
27 #include <unistd.h>
28 #include <stdio.h>
29 #include <string.h>
30 #include <dirent.h>
31 #include <paths.h>
32 
33 #include "got_compat.h"
34 
35 #include "got_error.h"
36 #include "got_path.h"
37 
38 #ifndef MIN
39 #define	MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
40 #endif
41 
42 int
43 got_path_is_absolute(const char *path)
44 {
45 	return path[0] == '/';
46 }
47 
48 /* based on canonpath() from kern_pledge.c */
49 const struct got_error *
50 got_canonpath(const char *input, char *buf, size_t bufsize)
51 {
52 	const char *p;
53 	char *q;
54 
55 	/* can't canon relative paths, don't bother */
56 	if (!got_path_is_absolute(input)) {
57 		if (strlcpy(buf, input, bufsize) >= bufsize)
58 			return got_error(GOT_ERR_NO_SPACE);
59 		return NULL;
60 	}
61 
62 	p = input;
63 	q = buf;
64 	while (*p && (q - buf < bufsize)) {
65 		if (p[0] == '/' && (p[1] == '/' || p[1] == '\0')) {
66 			p += 1;
67 
68 		} else if (p[0] == '/' && p[1] == '.' &&
69 		    (p[2] == '/' || p[2] == '\0')) {
70 			p += 2;
71 
72 		} else if (p[0] == '/' && p[1] == '.' && p[2] == '.' &&
73 		    (p[3] == '/' || p[3] == '\0')) {
74 			p += 3;
75 			if (q != buf)	/* "/../" at start of buf */
76 				while (*--q != '/')
77 					continue;
78 
79 		} else {
80 			*q++ = *p++;
81 		}
82 	}
83 	if ((*p == '\0') && (q - buf < bufsize)) {
84 		*q = 0;
85 		return NULL;
86 	} else
87 		return got_error(GOT_ERR_NO_SPACE);
88 }
89 
90 const struct got_error *
91 got_path_skip_common_ancestor(char **child, const char *parent_abspath,
92     const char *abspath)
93 {
94 	const struct got_error *err = NULL;
95 	size_t len_parent, len, bufsize;
96 
97 	*child = NULL;
98 
99 	len_parent = strlen(parent_abspath);
100 	len = strlen(abspath);
101 	if (len_parent >= len)
102 		return got_error_path(abspath, GOT_ERR_BAD_PATH);
103 	if (strncmp(parent_abspath, abspath, len_parent) != 0)
104 		return got_error_path(abspath, GOT_ERR_BAD_PATH);
105 	if (!got_path_is_root_dir(parent_abspath) && abspath[len_parent] != '/')
106 		return got_error_path(abspath, GOT_ERR_BAD_PATH);
107 	while (abspath[len_parent] == '/')
108 		abspath++;
109 	bufsize = len - len_parent + 1;
110 	*child = malloc(bufsize);
111 	if (*child == NULL)
112 		return got_error_from_errno("malloc");
113 	if (strlcpy(*child, abspath + len_parent, bufsize) >= bufsize) {
114 		err = got_error_from_errno("strlcpy");
115 		free(*child);
116 		*child = NULL;
117 		return err;
118 	}
119 	return NULL;
120 }
121 
122 const struct got_error *
123 got_path_strip(char **out, const char *path, int n)
124 {
125 	const char *p, *c;
126 
127 	p = path;
128 	*out = NULL;
129 
130 	while (n > 0 && (c = strchr(p, '/')) != NULL) {
131 		p = c + 1;
132 		n--;
133 	}
134 
135 	if (n > 0)
136 		return got_error_fmt(GOT_ERR_BAD_PATH,
137 		    "can't strip %d path-components from %s", n, path);
138 
139 	if ((*out = strdup(p)) == NULL)
140 		return got_error_from_errno("strdup");
141 	return NULL;
142 }
143 
144 int
145 got_path_is_root_dir(const char *path)
146 {
147 	while (*path == '/')
148 		path++;
149 	return (*path == '\0');
150 }
151 
152 int
153 got_path_is_child(const char *child, const char *parent, size_t parent_len)
154 {
155 	if (parent_len == 0 || got_path_is_root_dir(parent))
156 		return 1;
157 
158 	if (strncmp(parent, child, parent_len) != 0)
159 		return 0;
160 	if (child[parent_len] != '/')
161 		return 0;
162 
163 	return 1;
164 }
165 
166 int
167 got_path_cmp(const char *path1, const char *path2, size_t len1, size_t len2)
168 {
169 	size_t min_len;
170 	size_t i = 0;
171 
172 	/* Leading directory separators are insignificant. */
173 	while (path1[0] == '/') {
174 		path1++;
175 		len1--;
176 	}
177 	while (path2[0] == '/') {
178 		path2++;
179 		len2--;
180 	}
181 
182 	min_len = MIN(len1, len2);
183 
184 	/* Skip over common prefix. */
185 	while (i < min_len && path1[i] == path2[i])
186 		i++;
187 
188 	/* Are the paths exactly equal (besides path separators)? */
189 	if (len1 == len2 && i >= min_len)
190 		return 0;
191 
192 	/* Skip over redundant trailing path seperators. */
193 	while (path1[i] == '/' && path1[i + 1] == '/')
194 		path1++;
195 	while (path2[i] == '/' && path2[i + 1] == '/')
196 		path2++;
197 
198 	/* Trailing path separators are insignificant. */
199 	if (path1[i] == '/' && path1[i + 1] == '\0' && path2[i] == '\0')
200 		return 0;
201 	if (path2[i] == '/' && path2[i + 1] == '\0' && path1[i] == '\0')
202 		return 0;
203 
204 	/* Order children in subdirectories directly after their parents. */
205 	if (path1[i] == '/' && path2[i] == '\0')
206 		return 1;
207 	if (path2[i] == '/' && path1[i] == '\0')
208 		return -1;
209 	if (path1[i] == '/' && path2[i] != '\0')
210 		return -1;
211 	if (path2[i] == '/' && path1[i] != '\0')
212 		return 1;
213 
214 	/* Next character following the common prefix determines order. */
215 	return (unsigned char)path1[i] < (unsigned char)path2[i] ? -1 : 1;
216 }
217 
218 const struct got_error *
219 got_pathlist_insert(struct got_pathlist_entry **inserted,
220     struct got_pathlist_head *pathlist, const char *path, void *data)
221 {
222 	struct got_pathlist_entry *new, *pe;
223 	size_t path_len = strlen(path);
224 
225 	if (inserted)
226 		*inserted = NULL;
227 
228 	/*
229 	 * Many callers will provide paths in a somewhat sorted order while
230 	 * constructing a path list from inputs such as tree objects or
231 	 * dirents. Iterating backwards from the tail of the list should
232 	 * be more efficient than traversing through the entire list each
233 	 * time an element is inserted.
234 	 */
235 	pe = TAILQ_LAST(pathlist, got_pathlist_head);
236 	while (pe) {
237 		int cmp = got_path_cmp(pe->path, path, pe->path_len, path_len);
238 		if (cmp == 0)
239 			return NULL;  /* duplicate */
240 		else if (cmp < 0)
241 			break;
242 		pe = TAILQ_PREV(pe, got_pathlist_head, entry);
243 	}
244 
245 	new = malloc(sizeof(*new));
246 	if (new == NULL)
247 		return got_error_from_errno("malloc");
248 	new->path = path;
249 	new->path_len = path_len;
250 	new->data = data;
251 	if (pe)
252 		TAILQ_INSERT_AFTER(pathlist, pe, new, entry);
253 	else
254 		TAILQ_INSERT_HEAD(pathlist, new, entry);
255 	if (inserted)
256 		*inserted = new;
257 	return NULL;
258 }
259 
260 const struct got_error *
261 got_pathlist_append(struct got_pathlist_head *pathlist,
262     const char *path, void *data)
263 {
264 	struct got_pathlist_entry *new;
265 
266 	new = malloc(sizeof(*new));
267 	if (new == NULL)
268 		return got_error_from_errno("malloc");
269 	new->path = path;
270 	new->path_len = strlen(path);
271 	new->data = data;
272 	TAILQ_INSERT_TAIL(pathlist, new, entry);
273 	return NULL;
274 }
275 
276 void
277 got_pathlist_free(struct got_pathlist_head *pathlist)
278 {
279 	struct got_pathlist_entry *pe;
280 
281 	while ((pe = TAILQ_FIRST(pathlist)) != NULL) {
282 		TAILQ_REMOVE(pathlist, pe, entry);
283 		free(pe);
284 	}
285 }
286 
287 static const struct got_error *
288 make_parent_dirs(const char *abspath)
289 {
290 	const struct got_error *err = NULL;
291 	char *parent;
292 
293 	err = got_path_dirname(&parent, abspath);
294 	if (err)
295 		return err;
296 
297 	if (mkdir(parent, GOT_DEFAULT_DIR_MODE) == -1) {
298 		if (errno == ENOENT) {
299 			err = make_parent_dirs(parent);
300 			if (err)
301 				goto done;
302 			if (mkdir(parent, GOT_DEFAULT_DIR_MODE) == -1) {
303 				err = got_error_from_errno2("mkdir", parent);
304 				goto done;
305 			}
306 		} else
307 			err = got_error_from_errno2("mkdir", parent);
308 	}
309 done:
310 	free(parent);
311 	return err;
312 }
313 
314 const struct got_error *
315 got_path_mkdir(const char *abspath)
316 {
317 	const struct got_error *err = NULL;
318 
319 	if (mkdir(abspath, GOT_DEFAULT_DIR_MODE) == -1) {
320 		if (errno == ENOENT) {
321 			err = make_parent_dirs(abspath);
322 			if (err)
323 				goto done;
324 			if (mkdir(abspath, GOT_DEFAULT_DIR_MODE) == -1)
325 				err = got_error_from_errno2("mkdir", abspath);
326 		} else
327 			err = got_error_from_errno2("mkdir", abspath);
328 	}
329 
330 done:
331 	return err;
332 }
333 
334 int
335 got_path_dir_is_empty(const char *dir)
336 {
337 	DIR *d;
338 	struct dirent *dent;
339 	int empty = 1;
340 
341 	d = opendir(dir);
342 	if (d == NULL)
343 		return 1;
344 
345 	while ((dent = readdir(d)) != NULL) {
346 		if (strcmp(dent->d_name, ".") == 0 ||
347 		    strcmp(dent->d_name, "..") == 0)
348 			continue;
349 
350 		empty = 0;
351 		break;
352 	}
353 
354 	closedir(d);
355 	return empty;
356 }
357 
358 const struct got_error *
359 got_path_dirname(char **parent, const char *path)
360 {
361 	char buf[PATH_MAX];
362 	char *p;
363 
364 	if (strlcpy(buf, path, sizeof(buf)) >= sizeof(buf))
365 		return got_error(GOT_ERR_NO_SPACE);
366 
367 	p = dirname(buf);
368 	if (p == NULL)
369 		return got_error_from_errno2("dirname", path);
370 
371 	if (p[0] == '.' && p[1] == '\0')
372 		return got_error_path(path, GOT_ERR_BAD_PATH);
373 
374 	*parent = strdup(p);
375 	if (*parent == NULL)
376 		return got_error_from_errno("strdup");
377 
378 	return NULL;
379 }
380 
381 const struct got_error *
382 got_path_dirent_type(int *type, const char *path_parent, struct dirent *dent)
383 {
384 	const struct got_error *err = NULL;
385 	char *path_child;
386 	struct stat sb;
387 
388 	if (dent->d_type != DT_UNKNOWN) {
389 		*type = dent->d_type;
390 		return NULL;
391 	}
392 
393 	*type = DT_UNKNOWN;
394 
395 	/*
396 	 * This is a fallback to accommodate filesystems which do not
397 	 * provide directory entry type information. DT_UNKNOWN directory
398 	 * entries occur on NFS mounts without "readdir plus" RPC.
399 	 */
400 
401 	if (asprintf(&path_child, "%s/%s", path_parent, dent->d_name) == -1)
402 		return got_error_from_errno("asprintf");
403 
404 	if (lstat(path_child, &sb) == -1) {
405 		err = got_error_from_errno2("lstat", path_child);
406 		goto done;
407 	}
408 
409 	if (S_ISFIFO(sb.st_mode))
410 		*type = DT_FIFO;
411 	else if (S_ISCHR(sb.st_mode))
412 		*type = DT_CHR;
413 	else if (S_ISDIR(sb.st_mode))
414 		*type = DT_DIR;
415 	else if (S_ISBLK(sb.st_mode))
416 		*type = DT_BLK;
417 	else if (S_ISLNK(sb.st_mode))
418 		*type = DT_LNK;
419 	else if (S_ISREG(sb.st_mode))
420 		*type = DT_REG;
421 	else if (S_ISSOCK(sb.st_mode))
422 		*type = DT_SOCK;
423 done:
424 	free(path_child);
425 	return err;
426 }
427 
428 const struct got_error *
429 got_path_basename(char **s, const char *path)
430 {
431 	char buf[PATH_MAX];
432 	char *base;
433 
434 	if (strlcpy(buf, path, sizeof(buf)) >= sizeof(buf))
435 		return got_error(GOT_ERR_NO_SPACE);
436 
437 	base = basename(buf);
438 	if (base == NULL)
439 		return got_error_from_errno2("basename", path);
440 
441 	*s = strdup(base);
442 	if (*s == NULL)
443 		return got_error_from_errno("strdup");
444 
445 	return NULL;
446 }
447 
448 void
449 got_path_strip_trailing_slashes(char *path)
450 {
451 	size_t x;
452 
453 	x = strlen(path);
454 	while (x-- > 0 && path[x] == '/')
455 		path[x] = '\0';
456 }
457 
458 /* based on findprog() from usr.bin/which/which.c */
459 const struct got_error *
460 got_path_find_prog(char **filename, const char *prog)
461 {
462 	const struct got_error *err = NULL;
463 	const char *path;
464 	char *p;
465 	int len;
466 	struct stat sbuf;
467 	char *pathcpy, *dup = NULL;
468 
469 	*filename = NULL;
470 
471 	path = getenv("PATH");
472 	if (path == NULL)
473 		path = _PATH_DEFPATH;
474 
475 	/* Special case if prog contains '/' */
476 	if (strchr(prog, '/')) {
477 		if ((stat(prog, &sbuf) == 0) && S_ISREG(sbuf.st_mode) &&
478 		    access(prog, X_OK) == 0) {
479 			*filename = strdup(prog);
480 			if (*filename == NULL)
481 				return got_error_from_errno("strdup");
482 		}
483 		return NULL;
484 	}
485 
486 	if ((dup = strdup(path)) == NULL)
487 		return got_error_from_errno("strdup");
488 	pathcpy = dup;
489 
490 	while ((p = strsep(&pathcpy, ":")) != NULL) {
491 		const char *d;
492 
493 		len = strlen(p);
494 		while (len > 0 && p[len-1] == '/')
495 			p[--len] = '\0';	/* strip trailing '/' */
496 
497 		d = p;
498 		if (*d == '\0')
499 			d = ".";
500 
501 		if (asprintf(filename, "%s/%s", d, prog) == -1) {
502 			err = got_error_from_errno("asprintf");
503 			break;
504 		}
505 		if ((stat(*filename, &sbuf) == 0) && S_ISREG(sbuf.st_mode) &&
506 		    access(*filename, X_OK) == 0)
507 			break;
508 		free(*filename);
509 		*filename = NULL;
510 		continue;
511 	}
512 	free(dup);
513 	return err;
514 }
515 
516 const struct got_error *
517 got_path_create_file(const char *path, const char *content)
518 {
519 	const struct got_error *err = NULL;
520 	int fd = -1;
521 
522 	fd = open(path, O_RDWR | O_CREAT | O_EXCL | O_NOFOLLOW | O_CLOEXEC,
523 	    GOT_DEFAULT_FILE_MODE);
524 	if (fd == -1) {
525 		err = got_error_from_errno2("open", path);
526 		goto done;
527 	}
528 
529 	if (content) {
530 		int len = dprintf(fd, "%s\n", content);
531 		if (len != strlen(content) + 1) {
532 			err = got_error_from_errno("dprintf");
533 			goto done;
534 		}
535 	}
536 
537 done:
538 	if (fd != -1 && close(fd) == -1 && err == NULL)
539 		err = got_error_from_errno("close");
540 	return err;
541 }