2 * Copyright (c) 2018 Stefan Sperling <stsp@openbsd.org>
4 * Permission to use, copy, modify, and distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 #include <sys/queue.h>
25 #include "got_object.h"
26 #include "got_error.h"
28 #include "got_lib_delta.h"
29 #include "got_lib_zbuf.h"
30 #include "got_lib_object.h"
31 #include "got_lib_object_idset.h"
34 #define nitems(_a) (sizeof(_a) / sizeof((_a)[0]))
37 struct got_object_idset_element {
38 TAILQ_ENTRY(got_object_idset_element) entry;
39 struct got_object_id id;
40 void *data; /* API user data */
43 struct got_object_idset {
45 * A set is implemented as a collection of 256 lists.
46 * The value of the first byte of an object ID determines
47 * which of these lists an object ID is stored in.
49 TAILQ_HEAD(, got_object_idset_element) entries[0xff + 1];
52 struct got_object_idset *
53 got_object_idset_alloc(void)
55 struct got_object_idset *set;
58 set = calloc(1, sizeof(*set));
62 for (i = 0; i < nitems(set->entries); i++)
63 TAILQ_INIT(&set->entries[i]);
69 got_object_idset_free(struct got_object_idset *set)
71 struct got_object_idset_element *entry;
74 for (i = 0; i < nitems(set->entries); i++) {
75 while (!TAILQ_EMPTY(&set->entries[i])) {
76 entry = TAILQ_FIRST(&set->entries[i]);
77 TAILQ_REMOVE(&set->entries[i], entry, entry);
78 /* User data should be freed by caller. */
85 const struct got_error *
86 got_object_idset_add(struct got_object_idset *set, struct got_object_id *id,
89 struct got_object_idset_element *new, *entry;
90 uint8_t i = id->sha1[0];
92 new = calloc(1, sizeof(*new));
94 return got_error_from_errno();
96 memcpy(&new->id, id, sizeof(new->id));
99 if (TAILQ_EMPTY(&set->entries[i])) {
100 TAILQ_INSERT_HEAD(&set->entries[i], new, entry);
105 * Keep the list sorted by ID so that iterations of
106 * the set occur in a predictable order.
108 TAILQ_FOREACH(entry, &set->entries[i], entry) {
109 int cmp = got_object_id_cmp(&new->id, &entry->id);
110 struct got_object_idset_element *next;
114 return got_error(GOT_ERR_OBJ_EXISTS);
115 } else if (cmp < 0) {
116 TAILQ_INSERT_BEFORE(entry, new, entry);
120 next = TAILQ_NEXT(entry, entry);
122 TAILQ_INSERT_AFTER(&set->entries[i], entry, new, entry);
124 } else if (got_object_id_cmp(&new->id, &next->id) > 0) {
125 TAILQ_INSERT_BEFORE(next, new, entry);
130 return got_error(GOT_ERR_BAD_OBJ_ID); /* should not get here */
134 got_object_idset_get_data(struct got_object_idset *set,
135 struct got_object_id *id)
137 struct got_object_idset_element *entry;
138 uint8_t i = id->sha1[0];
140 TAILQ_FOREACH(entry, &set->entries[i], entry) {
141 if (got_object_id_cmp(&entry->id, id) == 0)
148 const struct got_error *
149 got_object_idset_remove(struct got_object_idset *set,
150 struct got_object_id *id)
152 struct got_object_idset_element *entry, *tmp;
153 uint8_t i = id->sha1[0];
155 TAILQ_FOREACH_SAFE(entry, &set->entries[i], entry, tmp) {
156 if (got_object_id_cmp(&entry->id, id) == 0) {
157 TAILQ_REMOVE(&set->entries[i], entry, entry);
162 return got_error(GOT_ERR_NO_OBJ);
166 got_object_idset_contains(struct got_object_idset *set,
167 struct got_object_id *id)
169 struct got_object_idset_element *entry;
170 uint8_t i = id->sha1[0];
172 TAILQ_FOREACH(entry, &set->entries[i], entry) {
173 if (got_object_id_cmp(&entry->id, id) == 0)
180 void got_object_idset_for_each(struct got_object_idset *set,
181 void (*cb)(struct got_object_id *, void *))
183 struct got_object_idset_element *entry, *tmp;
186 for (i = 0; i < nitems(set->entries); i++) {
187 TAILQ_FOREACH_SAFE(entry, &set->entries[i], entry, tmp) {
188 cb(&entry->id, entry->data);