2 619de35f 2022-04-22 thomas * Copyright (c) 2022 Stefan Sperling <stsp@openbsd.org>
4 54be8251 2018-06-04 stsp * Permission to use, copy, modify, and distribute this software for any
5 54be8251 2018-06-04 stsp * purpose with or without fee is hereby granted, provided that the above
6 54be8251 2018-06-04 stsp * copyright notice and this permission notice appear in all copies.
8 54be8251 2018-06-04 stsp * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 54be8251 2018-06-04 stsp * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 54be8251 2018-06-04 stsp * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 54be8251 2018-06-04 stsp * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 54be8251 2018-06-04 stsp * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 54be8251 2018-06-04 stsp * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 54be8251 2018-06-04 stsp * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 54be8251 2018-06-04 stsp #include <stdlib.h>
18 619de35f 2022-04-22 thomas #include <stdint.h>
19 54be8251 2018-06-04 stsp #include <string.h>
20 54be8251 2018-06-04 stsp #include <stdio.h>
21 54be8251 2018-06-04 stsp #include <zlib.h>
22 c6f420bf 2018-06-04 stsp #include <limits.h>
23 788c352e 2018-06-16 stsp #include <time.h>
24 619de35f 2022-04-22 thomas #include <errno.h>
26 dd038bc6 2021-09-21 thomas.ad #include "got_compat.h"
28 54be8251 2018-06-04 stsp #include "got_object.h"
29 54be8251 2018-06-04 stsp #include "got_error.h"
31 54be8251 2018-06-04 stsp #include "got_lib_delta.h"
32 63581804 2018-07-09 stsp #include "got_lib_inflate.h"
33 54be8251 2018-06-04 stsp #include "got_lib_object.h"
34 54be8251 2018-06-04 stsp #include "got_lib_object_idset.h"
35 619de35f 2022-04-22 thomas #include "got_lib_object_parse.h"
37 619de35f 2022-04-22 thomas #define GOT_OBJECT_IDSET_MIN_BUCKETS 64
39 54be8251 2018-06-04 stsp struct got_object_idset {
40 619de35f 2022-04-22 thomas struct got_object_id_queue *ids;
41 619de35f 2022-04-22 thomas size_t nbuckets;
42 619de35f 2022-04-22 thomas unsigned int totelem;
43 619de35f 2022-04-22 thomas unsigned int flags;
44 619de35f 2022-04-22 thomas #define GOT_OBJECT_IDSET_F_TRAVERSAL 0x01
45 619de35f 2022-04-22 thomas #define GOT_OBJECT_IDSET_F_NOMEM 0x02
46 619de35f 2022-04-22 thomas SIPHASH_KEY key;
49 54be8251 2018-06-04 stsp struct got_object_idset *
50 60f2eee1 2018-07-08 stsp got_object_idset_alloc(void)
52 54be8251 2018-06-04 stsp struct got_object_idset *set;
55 984e8a45 2018-11-05 stsp set = malloc(sizeof(*set));
56 54be8251 2018-06-04 stsp if (set == NULL)
57 54be8251 2018-06-04 stsp return NULL;
59 619de35f 2022-04-22 thomas set->ids = calloc(sizeof(set->ids[0]), GOT_OBJECT_IDSET_MIN_BUCKETS);
60 619de35f 2022-04-22 thomas if (set->ids == NULL) {
61 619de35f 2022-04-22 thomas free(set);
62 619de35f 2022-04-22 thomas return NULL;
64 619de35f 2022-04-22 thomas for (i = 0; i < GOT_OBJECT_IDSET_MIN_BUCKETS; i++)
65 619de35f 2022-04-22 thomas STAILQ_INIT(&set->ids[i]);
67 619de35f 2022-04-22 thomas set->totelem = 0;
68 619de35f 2022-04-22 thomas set->nbuckets = GOT_OBJECT_IDSET_MIN_BUCKETS;
69 619de35f 2022-04-22 thomas set->flags = 0;
70 619de35f 2022-04-22 thomas arc4random_buf(&set->key, sizeof(set->key));
75 54be8251 2018-06-04 stsp got_object_idset_free(struct got_object_idset *set)
78 619de35f 2022-04-22 thomas struct got_object_qid *qid;
80 619de35f 2022-04-22 thomas for (i = 0; i < set->nbuckets; i++) {
81 619de35f 2022-04-22 thomas while (!STAILQ_EMPTY(&set->ids[i])) {
82 619de35f 2022-04-22 thomas qid = STAILQ_FIRST(&set->ids[i]);
83 619de35f 2022-04-22 thomas STAILQ_REMOVE(&set->ids[i], qid, got_object_qid, entry);
84 619de35f 2022-04-22 thomas got_object_qid_free(qid);
87 619de35f 2022-04-22 thomas /* User data should be freed by caller. */
88 619de35f 2022-04-22 thomas free(set->ids);
92 619de35f 2022-04-22 thomas static uint64_t
93 619de35f 2022-04-22 thomas idset_hash(struct got_object_idset *set, struct got_object_id *id)
95 619de35f 2022-04-22 thomas return SipHash24(&set->key, id->sha1, sizeof(id->sha1));
98 619de35f 2022-04-22 thomas static const struct got_error *
99 619de35f 2022-04-22 thomas idset_resize(struct got_object_idset *set, size_t nbuckets)
101 619de35f 2022-04-22 thomas struct got_object_id_queue *ids;
102 619de35f 2022-04-22 thomas size_t i;
104 619de35f 2022-04-22 thomas ids = calloc(nbuckets, sizeof(ids[0]));
105 619de35f 2022-04-22 thomas if (ids == NULL) {
106 619de35f 2022-04-22 thomas if (errno != ENOMEM)
107 619de35f 2022-04-22 thomas return got_error_from_errno("calloc");
108 619de35f 2022-04-22 thomas /* Proceed with our current amount of hash buckets. */
109 619de35f 2022-04-22 thomas set->flags |= GOT_OBJECT_IDSET_F_NOMEM;
110 619de35f 2022-04-22 thomas return NULL;
113 619de35f 2022-04-22 thomas for (i = 0; i < nbuckets; i++)
114 619de35f 2022-04-22 thomas STAILQ_INIT(&ids[i]);
116 619de35f 2022-04-22 thomas arc4random_buf(&set->key, sizeof(set->key));
118 619de35f 2022-04-22 thomas for (i = 0; i < set->nbuckets; i++) {
119 619de35f 2022-04-22 thomas while (!STAILQ_EMPTY(&set->ids[i])) {
120 619de35f 2022-04-22 thomas struct got_object_qid *qid;
121 619de35f 2022-04-22 thomas uint64_t idx;
122 619de35f 2022-04-22 thomas qid = STAILQ_FIRST(&set->ids[i]);
123 619de35f 2022-04-22 thomas STAILQ_REMOVE(&set->ids[i], qid, got_object_qid, entry);
124 ec242592 2022-04-22 thomas idx = idset_hash(set, &qid->id) % nbuckets;
125 619de35f 2022-04-22 thomas STAILQ_INSERT_HEAD(&ids[idx], qid, entry);
129 619de35f 2022-04-22 thomas free(set->ids);
130 619de35f 2022-04-22 thomas set->ids = ids;
131 619de35f 2022-04-22 thomas set->nbuckets = nbuckets;
132 b36429ab 2018-11-05 stsp return NULL;
135 619de35f 2022-04-22 thomas static const struct got_error *
136 619de35f 2022-04-22 thomas idset_grow(struct got_object_idset *set)
138 619de35f 2022-04-22 thomas size_t nbuckets;
140 619de35f 2022-04-22 thomas if (set->flags & GOT_OBJECT_IDSET_F_NOMEM)
141 619de35f 2022-04-22 thomas return NULL;
143 619de35f 2022-04-22 thomas if (set->nbuckets >= UINT_MAX / 2)
144 619de35f 2022-04-22 thomas nbuckets = UINT_MAX;
146 619de35f 2022-04-22 thomas nbuckets = set->nbuckets * 2;
148 619de35f 2022-04-22 thomas return idset_resize(set, nbuckets);
151 619de35f 2022-04-22 thomas const struct got_error *
152 619de35f 2022-04-22 thomas got_object_idset_add(struct got_object_idset *set, struct got_object_id *id,
153 619de35f 2022-04-22 thomas void *data)
155 619de35f 2022-04-22 thomas const struct got_error *err;
156 619de35f 2022-04-22 thomas struct got_object_qid *qid;
157 619de35f 2022-04-22 thomas uint64_t idx;
158 619de35f 2022-04-22 thomas struct got_object_id_queue *head;
160 619de35f 2022-04-22 thomas /* This function may resize the set. */
161 619de35f 2022-04-22 thomas if (set->flags & GOT_OBJECT_IDSET_F_TRAVERSAL)
162 619de35f 2022-04-22 thomas return got_error_msg(GOT_ERR_NOT_IMPL,
163 619de35f 2022-04-22 thomas "cannot add elements to idset during traversal");
165 619de35f 2022-04-22 thomas if (set->totelem == UINT_MAX)
166 619de35f 2022-04-22 thomas return got_error(GOT_ERR_NO_SPACE);
168 619de35f 2022-04-22 thomas err = got_object_qid_alloc_partial(&qid);
170 619de35f 2022-04-22 thomas return err;
171 ec242592 2022-04-22 thomas memcpy(&qid->id, id, sizeof(qid->id));
172 619de35f 2022-04-22 thomas qid->data = data;
174 619de35f 2022-04-22 thomas idx = idset_hash(set, id) % set->nbuckets;
175 619de35f 2022-04-22 thomas head = &set->ids[idx];
176 619de35f 2022-04-22 thomas STAILQ_INSERT_HEAD(head, qid, entry);
177 619de35f 2022-04-22 thomas set->totelem++;
179 619de35f 2022-04-22 thomas if (set->nbuckets < set->totelem)
180 619de35f 2022-04-22 thomas err = idset_grow(set);
182 619de35f 2022-04-22 thomas return err;
185 619de35f 2022-04-22 thomas static struct got_object_qid *
186 619de35f 2022-04-22 thomas find_element(struct got_object_idset *set, struct got_object_id *id)
188 619de35f 2022-04-22 thomas uint64_t idx = idset_hash(set, id) % set->nbuckets;
189 619de35f 2022-04-22 thomas struct got_object_id_queue *head = &set->ids[idx];
190 619de35f 2022-04-22 thomas struct got_object_qid *qid;
192 619de35f 2022-04-22 thomas STAILQ_FOREACH(qid, head, entry) {
193 ec242592 2022-04-22 thomas if (got_object_id_cmp(&qid->id, id) == 0)
194 619de35f 2022-04-22 thomas return qid;
197 619de35f 2022-04-22 thomas return NULL;
201 984e8a45 2018-11-05 stsp got_object_idset_get(struct got_object_idset *set, struct got_object_id *id)
203 619de35f 2022-04-22 thomas struct got_object_qid *qid = find_element(set, id);
204 619de35f 2022-04-22 thomas return qid ? qid->data : NULL;
207 54be8251 2018-06-04 stsp const struct got_error *
208 e7c810ea 2018-06-22 stsp got_object_idset_remove(void **data, struct got_object_idset *set,
209 54be8251 2018-06-04 stsp struct got_object_id *id)
211 619de35f 2022-04-22 thomas uint64_t idx;
212 619de35f 2022-04-22 thomas struct got_object_id_queue *head;
213 619de35f 2022-04-22 thomas struct got_object_qid *qid;
216 441e144c 2018-06-22 stsp *data = NULL;
218 984e8a45 2018-11-05 stsp if (set->totelem == 0)
219 c6f420bf 2018-06-04 stsp return got_error(GOT_ERR_NO_OBJ);
221 3a4790b6 2022-03-22 thomas if (id == NULL) {
222 619de35f 2022-04-22 thomas /* Remove a "random" element. */
223 619de35f 2022-04-22 thomas for (idx = 0; idx < set->nbuckets; idx++) {
224 619de35f 2022-04-22 thomas head = &set->ids[idx];
225 619de35f 2022-04-22 thomas qid = STAILQ_FIRST(head);
230 619de35f 2022-04-22 thomas idx = idset_hash(set, id) % set->nbuckets;
231 619de35f 2022-04-22 thomas head = &set->ids[idx];
232 619de35f 2022-04-22 thomas STAILQ_FOREACH(qid, head, entry) {
233 ec242592 2022-04-22 thomas if (got_object_id_cmp(&qid->id, id) == 0)
236 619de35f 2022-04-22 thomas if (qid == NULL)
237 3a4790b6 2022-03-22 thomas return got_error_no_obj(id);
241 619de35f 2022-04-22 thomas *data = qid->data;
242 619de35f 2022-04-22 thomas STAILQ_REMOVE(head, qid, got_object_qid, entry);
243 619de35f 2022-04-22 thomas got_object_qid_free(qid);
244 984e8a45 2018-11-05 stsp set->totelem--;
246 984e8a45 2018-11-05 stsp return NULL;
250 54be8251 2018-06-04 stsp got_object_idset_contains(struct got_object_idset *set,
251 54be8251 2018-06-04 stsp struct got_object_id *id)
253 619de35f 2022-04-22 thomas struct got_object_qid *qid = find_element(set, id);
254 619de35f 2022-04-22 thomas return qid ? 1 : 0;
257 cb103d04 2018-11-07 stsp const struct got_error *
258 cb103d04 2018-11-07 stsp got_object_idset_for_each(struct got_object_idset *set,
259 cb103d04 2018-11-07 stsp const struct got_error *(*cb)(struct got_object_id *, void *, void *),
262 619de35f 2022-04-22 thomas const struct got_error *err = NULL;
263 619de35f 2022-04-22 thomas struct got_object_id_queue *head;
264 619de35f 2022-04-22 thomas struct got_object_qid *qid, *tmp;
265 619de35f 2022-04-22 thomas size_t i;
267 619de35f 2022-04-22 thomas set->flags |= GOT_OBJECT_IDSET_F_TRAVERSAL;
268 619de35f 2022-04-22 thomas for (i = 0; i < set->nbuckets; i++) {
269 619de35f 2022-04-22 thomas head = &set->ids[i];
270 619de35f 2022-04-22 thomas STAILQ_FOREACH_SAFE(qid, head, entry, tmp) {
271 ec242592 2022-04-22 thomas err = (*cb)(&qid->id, qid->data, arg);
273 619de35f 2022-04-22 thomas goto done;
277 619de35f 2022-04-22 thomas set->flags &= ~GOT_OBJECT_IDSET_F_TRAVERSAL;
278 619de35f 2022-04-22 thomas return err;
282 c6f420bf 2018-06-04 stsp got_object_idset_num_elements(struct got_object_idset *set)
284 2bd394ff 2018-06-22 stsp return set->totelem;