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>
27 #include "got_object.h"
28 #include "got_error.h"
30 #include "got_lib_delta.h"
31 #include "got_lib_zbuf.h"
32 #include "got_lib_object.h"
33 #include "got_lib_object_idset.h"
36 #define nitems(_a) (sizeof(_a) / sizeof((_a)[0]))
39 struct got_object_idset_element {
40 TAILQ_ENTRY(got_object_idset_element) entry;
41 struct got_object_id id;
42 void *data; /* API user data */
45 struct got_object_idset {
47 * A set is implemented as a collection of 256 lists.
48 * The value of the first byte of an object ID determines
49 * which of these lists an object ID is stored in.
51 TAILQ_HEAD(, got_object_idset_element) entries[0xff + 1];
53 #define GOT_OBJECT_IDSET_MAX_ELEM INT_MAX
56 struct got_object_idset *
57 got_object_idset_alloc(void)
59 struct got_object_idset *set;
62 set = calloc(1, sizeof(*set));
66 for (i = 0; i < nitems(set->entries); i++)
67 TAILQ_INIT(&set->entries[i]);
73 got_object_idset_free(struct got_object_idset *set)
75 struct got_object_idset_element *entry;
78 for (i = 0; i < nitems(set->entries); i++) {
79 while (!TAILQ_EMPTY(&set->entries[i])) {
80 entry = TAILQ_FIRST(&set->entries[i]);
81 TAILQ_REMOVE(&set->entries[i], entry, entry);
82 /* User data should be freed by caller. */
89 const struct got_error *
90 got_object_idset_add(void **existing_data,
91 struct got_object_idset *set, struct got_object_id *id, void *data)
93 struct got_object_idset_element *new, *entry;
94 uint8_t i = id->sha1[0];
97 *existing_data = NULL;
99 if (set->nelem >= GOT_OBJECT_IDSET_MAX_ELEM)
100 return got_error(GOT_ERR_NO_SPACE);
102 new = calloc(1, sizeof(*new));
104 return got_error_from_errno();
106 memcpy(&new->id, id, sizeof(new->id));
109 if (TAILQ_EMPTY(&set->entries[i])) {
110 TAILQ_INSERT_HEAD(&set->entries[i], new, entry);
116 * Keep the list sorted by ID so that iterations of
117 * the set occur in a predictable order.
119 TAILQ_FOREACH(entry, &set->entries[i], entry) {
120 int cmp = got_object_id_cmp(&new->id, &entry->id);
121 struct got_object_idset_element *next;
126 *existing_data = entry->data;
127 return got_error(GOT_ERR_OBJ_EXISTS);
128 } else if (cmp < 0) {
129 TAILQ_INSERT_BEFORE(entry, new, entry);
134 next = TAILQ_NEXT(entry, entry);
136 TAILQ_INSERT_AFTER(&set->entries[i], entry, new, entry);
139 } else if (got_object_id_cmp(&new->id, &next->id) > 0) {
140 TAILQ_INSERT_BEFORE(next, new, entry);
146 return got_error(GOT_ERR_BAD_OBJ_ID); /* should not get here */
150 got_object_idset_get(struct got_object_idset *set, struct got_object_id *id)
152 struct got_object_idset_element *entry;
153 uint8_t i = id->sha1[0];
155 TAILQ_FOREACH(entry, &set->entries[i], entry) {
156 if (got_object_id_cmp(&entry->id, id) == 0)
163 const struct got_error *
164 got_object_idset_remove(struct got_object_idset *set,
165 struct got_object_id *id)
167 struct got_object_idset_element *entry, *tmp;
168 uint8_t i = id->sha1[0];
171 return got_error(GOT_ERR_NO_OBJ);
173 TAILQ_FOREACH_SAFE(entry, &set->entries[i], entry, tmp) {
174 if (got_object_id_cmp(&entry->id, id) == 0) {
175 TAILQ_REMOVE(&set->entries[i], entry, entry);
181 return got_error(GOT_ERR_NO_OBJ);
185 got_object_idset_contains(struct got_object_idset *set,
186 struct got_object_id *id)
188 struct got_object_idset_element *entry;
189 uint8_t i = id->sha1[0];
191 TAILQ_FOREACH(entry, &set->entries[i], entry) {
192 if (got_object_id_cmp(&entry->id, id) == 0)
199 void got_object_idset_for_each(struct got_object_idset *set,
200 void (*cb)(struct got_object_id *, void *, void *), void *arg)
202 struct got_object_idset_element *entry;
205 for (i = 0; i < nitems(set->entries); i++) {
206 TAILQ_FOREACH(entry, &set->entries[i], entry)
207 cb(&entry->id, entry->data, arg);
212 got_object_idset_num_elements(struct got_object_idset *set)