Commit aaa0878e4df2825d2597e407b5015a0e663ec7f8

Stefan Sperling 2019-01-08T19:44:25

add got_pathset API which manages a tree of paths

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
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
diff --git a/lib/got_lib_pathset.h b/lib/got_lib_pathset.h
new file mode 100644
index 0000000..a9b72d3
--- /dev/null
+++ b/lib/got_lib_pathset.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2019 Stefan Sperling <stsp@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.
+ */
+
+struct got_pathset;
+
+struct got_pathset *got_pathset_alloc(void);
+void got_pathset_free(struct got_pathset *);
+
+const struct got_error *got_pathset_add(struct got_pathset *, const char *,
+    void *);
+void *got_pathset_get(struct got_pathset *, const char *);
+const struct got_error *got_pathset_remove(void **, struct got_pathset *,
+    const char *);
+int got_pathset_contains(struct got_pathset *, const char *);
+const struct got_error *got_pathset_for_each(struct got_pathset *,
+    const struct got_error *(*cb)(const char *, void *, void *),
+    void *);
+int got_pathset_num_elements(struct got_pathset *);
diff --git a/lib/pathset.c b/lib/pathset.c
new file mode 100644
index 0000000..2ba5c86
--- /dev/null
+++ b/lib/pathset.c
@@ -0,0 +1,208 @@
+/*
+ * Copyright (c) 2019 Stefan Sperling <stsp@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/tree.h>
+
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+#include <limits.h>
+
+#include "got_error.h"
+#include "got_lib_pathset.h"
+
+#ifndef MIN
+#define	MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
+#endif
+
+struct got_pathset_element {
+	RB_ENTRY(got_pathset_element)	entry;
+	char *path;
+	void *data;	/* API user data */
+};
+
+RB_HEAD(got_pathset_tree, got_pathset_element);
+
+static int
+cmp_elements(const struct got_pathset_element *e1,
+    const struct got_pathset_element *e2)
+{
+	size_t len1 = strlen(e1->path);
+	size_t len2 = strlen(e2->path);
+	size_t min_len = MIN(len1, len2);
+	size_t i = 0;
+
+	/* Skip over common prefix. */
+	while (i < min_len && e1->path[i] == e2->path[i])
+		i++;
+
+	/* Are the paths exactly equal? */
+	if (len1 == len2 && i >= min_len)
+		return 0;
+
+	/* Order children in subdirectories directly after their parents. */
+	if (e1->path[i] == '/' && e2->path[i] == '\0')
+		return 1;
+	if (e2->path[i] == '/' && e1->path[i] == '\0')
+		return -1;
+	if (e1->path[i] == '/')
+		return -1;
+	if (e2->path[i] == '/')
+		return 1;
+
+	/* Next character following the common prefix determines order. */
+	return (unsigned char)e1->path[i] < (unsigned char)e2->path[i] ? -1 : 1;
+}
+
+RB_PROTOTYPE(got_pathset_tree, got_pathset_element, entry, cmp_elements);
+
+struct got_pathset {
+	struct got_pathset_tree entries;
+	int totelem;
+#define GOT_OBJECT_IDSET_MAX_ELEM INT_MAX
+};
+
+struct got_pathset *
+got_pathset_alloc(void)
+{
+	struct got_pathset *set;
+
+	set = malloc(sizeof(*set));
+	if (set == NULL)
+		return NULL;
+
+	RB_INIT(&set->entries);
+	set->totelem = 0;
+
+	return set;
+}
+
+static void
+free_element(struct got_pathset_element *entry)
+{
+	free(entry->path);
+	free(entry);
+}
+
+void
+got_pathset_free(struct got_pathset *set)
+{
+	struct got_pathset_element *entry;
+
+	while ((entry = RB_MIN(got_pathset_tree, &set->entries))) {
+		RB_REMOVE(got_pathset_tree, &set->entries, entry);
+		/* User data should be freed by caller. */
+		free_element(entry);
+	}
+
+	free(set);
+}
+
+const struct got_error *
+got_pathset_add(struct got_pathset *set, const char *path, void *data)
+{
+	struct got_pathset_element *new;
+
+	if (set->totelem >= GOT_OBJECT_IDSET_MAX_ELEM)
+		return got_error(GOT_ERR_NO_SPACE);
+
+	new = malloc(sizeof(*new));
+	if (new == NULL)
+		return got_error_from_errno();
+
+	new->path = strdup(path);
+	if (new->path == NULL)
+		return got_error_from_errno();
+		
+	new->data = data;
+
+	RB_INSERT(got_pathset_tree, &set->entries, new);
+	set->totelem++;
+	return NULL;
+}
+
+static struct got_pathset_element *
+find_element(struct got_pathset *set, const char *path)
+{
+	struct got_pathset_element key, *entry;
+	key.path = strdup(path);
+	entry = RB_FIND(got_pathset_tree, &set->entries, &key);
+	free(key.path);
+	return entry;
+}
+
+void *
+got_pathset_get(struct got_pathset *set, const char *path)
+{
+	struct got_pathset_element *entry = find_element(set, path);
+	return entry ? entry->data : NULL;
+}
+
+const struct got_error *
+got_pathset_remove(void **data, struct got_pathset *set, const char *path)
+{
+	struct got_pathset_element *entry;
+
+	if (data)
+		*data = NULL;
+
+	if (set->totelem == 0)
+		return got_error(GOT_ERR_NO_OBJ);
+
+	if (path == NULL)
+		entry = RB_ROOT(&set->entries);
+	else
+		entry = find_element(set, path);
+	if (entry == NULL)
+		return got_error(GOT_ERR_NO_OBJ);
+
+	RB_REMOVE(got_pathset_tree, &set->entries, entry);
+	if (data)
+		*data = entry->data;
+	free_element(entry);
+	set->totelem--;
+	return NULL;
+}
+
+int
+got_pathset_contains(struct got_pathset *set, const char *path)
+{
+	struct got_pathset_element *entry = find_element(set, path);
+	return entry ? 1 : 0;
+}
+
+const struct got_error *
+got_pathset_for_each(struct got_pathset *set,
+    const struct got_error *(*cb)(const char *, void *, void *), void *arg)
+{
+	const struct got_error *err;
+	struct got_pathset_element *entry, *tmp;
+
+	RB_FOREACH_SAFE(entry, got_pathset_tree, &set->entries, tmp) {
+		err = (*cb)(entry->path, entry->data, arg);
+		if (err)
+			return err;
+	}
+	return NULL;
+}
+
+int
+got_pathset_num_elements(struct got_pathset *set)
+{
+	return set->totelem;
+}
+
+RB_GENERATE(got_pathset_tree, got_pathset_element, entry, cmp_elements);
diff --git a/regress/Makefile b/regress/Makefile
index bd68cd5..f4dda9c 100644
--- a/regress/Makefile
+++ b/regress/Makefile
@@ -1,3 +1,3 @@
-SUBDIR = cmdline delta idset repository worktree
+SUBDIR = cmdline delta idset pathset repository worktree
 
 .include <bsd.subdir.mk>
diff --git a/regress/pathset/Makefile b/regress/pathset/Makefile
new file mode 100644
index 0000000..9727586
--- /dev/null
+++ b/regress/pathset/Makefile
@@ -0,0 +1,11 @@
+.PATH:${.CURDIR}/../../lib
+
+PROG = pathset_test
+SRCS = error.c sha1.c pathset.c pathset_test.c
+
+CPPFLAGS = -I${.CURDIR}/../../include -I${.CURDIR}/../../lib
+LDADD = 
+
+NOMAN = yes
+
+.include <bsd.regress.mk>
diff --git a/regress/pathset/pathset_test.c b/regress/pathset/pathset_test.c
new file mode 100644
index 0000000..c003ce5
--- /dev/null
+++ b/regress/pathset/pathset_test.c
@@ -0,0 +1,235 @@
+/*
+ * Copyright (c) 2019 Stefan Sperling <stsp@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 <stdarg.h>
+#include <string.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <err.h>
+
+#include "got_error.h"
+
+#include "got_lib_pathset.h"
+
+static int verbose;
+
+void
+test_printf(char *fmt, ...)
+{
+	va_list ap;
+
+	if (!verbose)
+		return;
+
+	va_start(ap, fmt);
+	vprintf(fmt, ap);
+	va_end(ap);
+}
+
+static const char *path1 = "/", *path2 = "/usr", *path3 = "/usr/bin";
+static const char *data1 = "data1", *data2 = "data2", *data3 = "data3";
+
+static const struct got_error *
+pathset_add_remove_iter_cb(const char *path, void *data, void *arg) {
+	test_printf("%s\n", path);
+	if ((strcmp(path, path1) == 0 && data == (void *)data1) ||
+	    (strcmp(path, path3) == 0 && data == (void *)data3))
+		return NULL;
+	abort();
+	return NULL; /* not reached */
+}
+
+static int
+pathset_add_remove_iter(void)
+{
+	const struct got_error *err = NULL;
+	struct got_pathset *set;
+
+	set = got_pathset_alloc();
+	if (set == NULL) {
+		err = got_error_from_errno();
+		goto done;
+	}
+	if (got_pathset_num_elements(set) != 0) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+
+
+	err = got_pathset_add(set, path1, (void *)data1);
+	if (err)
+		goto done;
+	if (got_pathset_num_elements(set) != 1) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+
+	if (!got_pathset_contains(set, path1)) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+
+	err = got_pathset_add(set, path2, (void *)data2);
+	if (err)
+		goto done;
+	if (!got_pathset_contains(set, path2)) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+	if (got_pathset_num_elements(set) != 2) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+
+	err = got_pathset_add(set, path3, (void *)data3);
+	if (err)
+		goto done;
+	if (got_pathset_get(set, path3) != (void *)data3) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+	if (got_pathset_num_elements(set) != 3) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+
+	err = got_pathset_remove(NULL, set, path2);
+	if (err)
+		goto done;
+	if (got_pathset_num_elements(set) != 2) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+	if (got_pathset_contains(set, path2)) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+	if (got_pathset_get(set, path2) != NULL) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+
+	got_pathset_for_each(set, pathset_add_remove_iter_cb, NULL);
+done:
+	got_pathset_free(set);
+	return (err == NULL);
+}
+
+static const struct got_error *
+pathset_iter_ordering_cb(const char *path, void *data, void *arg) {
+	static int i;
+	test_printf("%s\n", path);
+	if (i == 0 && strcmp(path, "/") != 0)
+		abort();
+	if (i == 1 && strcmp(path, "/usr.bin") != 0)
+		abort();
+	if (i == 2 && strcmp(path, "/usr.bin/vi") != 0)
+		abort();
+	if (i == 3 && strcmp(path, "/usr.sbin") != 0)
+		abort();
+	if (i == 4 && strcmp(path, "/usr.sbin/unbound") != 0)
+		abort();
+	if (i == 5 && strcmp(path, "/usr.sbin/zic") != 0)
+		abort();
+	if (i > 5)
+		abort();
+	i++;
+	return NULL;
+}
+
+static int
+pathset_iter_ordering(void)
+{
+	const struct got_error *err = NULL;
+	struct got_pathset *set;
+
+	set = got_pathset_alloc();
+	if (set == NULL) {
+		err = got_error_from_errno();
+		goto done;
+	}
+	if (got_pathset_num_elements(set) != 0) {
+		err = got_error(GOT_ERR_BAD_PATH);
+		goto done;
+	}
+
+
+	err = got_pathset_add(set, "/usr.bin", (void *)data1);
+	if (err)
+		goto done;
+	err = got_pathset_add(set, "/usr.sbin/unbound", (void *)data1);
+	if (err)
+		goto done;
+	err = got_pathset_add(set, "/usr.bin/vi", (void *)data1);
+	if (err)
+		goto done;
+	err = got_pathset_add(set, "/", (void *)data1);
+	if (err)
+		goto done;
+	err = got_pathset_add(set, "/usr.sbin/zic", (void *)data1);
+	if (err)
+		goto done;
+	err = got_pathset_add(set, "/usr.sbin", (void *)data1);
+	if (err)
+		goto done;
+
+	got_pathset_for_each(set, pathset_iter_ordering_cb, NULL);
+done:
+	got_pathset_free(set);
+	return (err == NULL);
+}
+
+#define RUN_TEST(expr, name) \
+	{ test_ok = (expr);  \
+	printf("test_%s %s\n", (name), test_ok ? "ok" : "failed"); \
+	failure = (failure || !test_ok); }
+
+void
+usage(void)
+{
+	fprintf(stderr, "usage: pathset_test [-v]\n");
+}
+
+int
+main(int argc, char *argv[])
+{
+	int test_ok = 0, failure = 0;
+	int ch;
+
+#ifndef PROFILE
+	if (pledge("stdio", NULL) == -1)
+		err(1, "pledge");
+#endif
+
+	while ((ch = getopt(argc, argv, "v")) != -1) {
+		switch (ch) {
+		case 'v':
+			verbose = 1;
+			break;
+		default:
+			usage();
+			return 1;
+		}
+	}
+	argc -= optind;
+	argv += optind;
+
+	RUN_TEST(pathset_add_remove_iter(), "pathset_add_remove_iter");
+	RUN_TEST(pathset_iter_ordering(), "pathset_iter_ordering");
+
+	return failure ? 1 : 0;
+}