2 cbc287dc 2022-04-19 stsp * 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 <sys/queue.h>
19 54be8251 2018-06-04 stsp #include <stdlib.h>
20 cbc287dc 2022-04-19 stsp #include <stdint.h>
21 54be8251 2018-06-04 stsp #include <string.h>
22 54be8251 2018-06-04 stsp #include <sha1.h>
23 69c6accf 2023-02-04 op #include <sha2.h>
24 54be8251 2018-06-04 stsp #include <stdio.h>
25 54be8251 2018-06-04 stsp #include <zlib.h>
26 c6f420bf 2018-06-04 stsp #include <limits.h>
27 788c352e 2018-06-16 stsp #include <time.h>
28 cbc287dc 2022-04-19 stsp #include <errno.h>
29 cbc287dc 2022-04-19 stsp #include <siphash.h>
31 54be8251 2018-06-04 stsp #include "got_object.h"
32 54be8251 2018-06-04 stsp #include "got_error.h"
34 54be8251 2018-06-04 stsp #include "got_lib_delta.h"
35 63581804 2018-07-09 stsp #include "got_lib_inflate.h"
36 54be8251 2018-06-04 stsp #include "got_lib_object.h"
37 54be8251 2018-06-04 stsp #include "got_lib_object_idset.h"
38 cbc287dc 2022-04-19 stsp #include "got_lib_object_parse.h"
40 cbc287dc 2022-04-19 stsp #define GOT_OBJECT_IDSET_MIN_BUCKETS 64
42 54be8251 2018-06-04 stsp struct got_object_idset {
43 cbc287dc 2022-04-19 stsp struct got_object_id_queue *ids;
44 cbc287dc 2022-04-19 stsp size_t nbuckets;
45 cbc287dc 2022-04-19 stsp unsigned int totelem;
46 cbc287dc 2022-04-19 stsp unsigned int flags;
47 cbc287dc 2022-04-19 stsp #define GOT_OBJECT_IDSET_F_TRAVERSAL 0x01
48 cbc287dc 2022-04-19 stsp #define GOT_OBJECT_IDSET_F_NOMEM 0x02
49 cbc287dc 2022-04-19 stsp SIPHASH_KEY key;
52 54be8251 2018-06-04 stsp struct got_object_idset *
53 60f2eee1 2018-07-08 stsp got_object_idset_alloc(void)
55 54be8251 2018-06-04 stsp struct got_object_idset *set;
58 984e8a45 2018-11-05 stsp set = malloc(sizeof(*set));
59 54be8251 2018-06-04 stsp if (set == NULL)
60 54be8251 2018-06-04 stsp return NULL;
62 cbc287dc 2022-04-19 stsp set->ids = calloc(sizeof(set->ids[0]), GOT_OBJECT_IDSET_MIN_BUCKETS);
63 cbc287dc 2022-04-19 stsp if (set->ids == NULL) {
65 cbc287dc 2022-04-19 stsp return NULL;
67 cbc287dc 2022-04-19 stsp for (i = 0; i < GOT_OBJECT_IDSET_MIN_BUCKETS; i++)
68 cbc287dc 2022-04-19 stsp STAILQ_INIT(&set->ids[i]);
70 cbc287dc 2022-04-19 stsp set->totelem = 0;
71 cbc287dc 2022-04-19 stsp set->nbuckets = GOT_OBJECT_IDSET_MIN_BUCKETS;
72 cbc287dc 2022-04-19 stsp set->flags = 0;
73 cbc287dc 2022-04-19 stsp arc4random_buf(&set->key, sizeof(set->key));
78 54be8251 2018-06-04 stsp got_object_idset_free(struct got_object_idset *set)
81 cbc287dc 2022-04-19 stsp struct got_object_qid *qid;
83 cbc287dc 2022-04-19 stsp for (i = 0; i < set->nbuckets; i++) {
84 cbc287dc 2022-04-19 stsp while (!STAILQ_EMPTY(&set->ids[i])) {
85 cbc287dc 2022-04-19 stsp qid = STAILQ_FIRST(&set->ids[i]);
86 cbc287dc 2022-04-19 stsp STAILQ_REMOVE(&set->ids[i], qid, got_object_qid, entry);
87 cbc287dc 2022-04-19 stsp got_object_qid_free(qid);
90 cbc287dc 2022-04-19 stsp /* User data should be freed by caller. */
91 cbc287dc 2022-04-19 stsp free(set->ids);
95 cbc287dc 2022-04-19 stsp static uint64_t
96 cbc287dc 2022-04-19 stsp idset_hash(struct got_object_idset *set, struct got_object_id *id)
98 3093e2d7 2023-02-04 op return SipHash24(&set->key, id->hash, sizeof(id->hash));
101 cbc287dc 2022-04-19 stsp static const struct got_error *
102 cbc287dc 2022-04-19 stsp idset_resize(struct got_object_idset *set, size_t nbuckets)
104 cbc287dc 2022-04-19 stsp struct got_object_id_queue *ids;
107 cbc287dc 2022-04-19 stsp ids = calloc(nbuckets, sizeof(ids[0]));
108 cbc287dc 2022-04-19 stsp if (ids == NULL) {
109 cbc287dc 2022-04-19 stsp if (errno != ENOMEM)
110 cbc287dc 2022-04-19 stsp return got_error_from_errno("calloc");
111 cbc287dc 2022-04-19 stsp /* Proceed with our current amount of hash buckets. */
112 cbc287dc 2022-04-19 stsp set->flags |= GOT_OBJECT_IDSET_F_NOMEM;
113 cbc287dc 2022-04-19 stsp return NULL;
116 cbc287dc 2022-04-19 stsp for (i = 0; i < nbuckets; i++)
117 cbc287dc 2022-04-19 stsp STAILQ_INIT(&ids[i]);
119 cbc287dc 2022-04-19 stsp arc4random_buf(&set->key, sizeof(set->key));
121 cbc287dc 2022-04-19 stsp for (i = 0; i < set->nbuckets; i++) {
122 cbc287dc 2022-04-19 stsp while (!STAILQ_EMPTY(&set->ids[i])) {
123 cbc287dc 2022-04-19 stsp struct got_object_qid *qid;
124 cbc287dc 2022-04-19 stsp uint64_t idx;
125 cbc287dc 2022-04-19 stsp qid = STAILQ_FIRST(&set->ids[i]);
126 cbc287dc 2022-04-19 stsp STAILQ_REMOVE(&set->ids[i], qid, got_object_qid, entry);
127 d7b5a0e8 2022-04-20 stsp idx = idset_hash(set, &qid->id) % nbuckets;
128 cbc287dc 2022-04-19 stsp STAILQ_INSERT_HEAD(&ids[idx], qid, entry);
132 cbc287dc 2022-04-19 stsp free(set->ids);
133 cbc287dc 2022-04-19 stsp set->ids = ids;
134 cbc287dc 2022-04-19 stsp set->nbuckets = nbuckets;
135 b36429ab 2018-11-05 stsp return NULL;
138 cbc287dc 2022-04-19 stsp static const struct got_error *
139 cbc287dc 2022-04-19 stsp idset_grow(struct got_object_idset *set)
141 cbc287dc 2022-04-19 stsp size_t nbuckets;
143 cbc287dc 2022-04-19 stsp if (set->flags & GOT_OBJECT_IDSET_F_NOMEM)
144 cbc287dc 2022-04-19 stsp return NULL;
146 cbc287dc 2022-04-19 stsp if (set->nbuckets >= UINT_MAX / 2)
147 cbc287dc 2022-04-19 stsp nbuckets = UINT_MAX;
149 cbc287dc 2022-04-19 stsp nbuckets = set->nbuckets * 2;
151 cbc287dc 2022-04-19 stsp return idset_resize(set, nbuckets);
154 cbc287dc 2022-04-19 stsp const struct got_error *
155 cbc287dc 2022-04-19 stsp got_object_idset_add(struct got_object_idset *set, struct got_object_id *id,
156 cbc287dc 2022-04-19 stsp void *data)
158 cbc287dc 2022-04-19 stsp const struct got_error *err;
159 cbc287dc 2022-04-19 stsp struct got_object_qid *qid;
160 cbc287dc 2022-04-19 stsp uint64_t idx;
161 cbc287dc 2022-04-19 stsp struct got_object_id_queue *head;
163 cbc287dc 2022-04-19 stsp /* This function may resize the set. */
164 cbc287dc 2022-04-19 stsp if (set->flags & GOT_OBJECT_IDSET_F_TRAVERSAL)
165 cbc287dc 2022-04-19 stsp return got_error_msg(GOT_ERR_NOT_IMPL,
166 cbc287dc 2022-04-19 stsp "cannot add elements to idset during traversal");
168 cbc287dc 2022-04-19 stsp if (set->totelem == UINT_MAX)
169 cbc287dc 2022-04-19 stsp return got_error(GOT_ERR_NO_SPACE);
171 cbc287dc 2022-04-19 stsp err = got_object_qid_alloc_partial(&qid);
173 cbc287dc 2022-04-19 stsp return err;
174 d7b5a0e8 2022-04-20 stsp memcpy(&qid->id, id, sizeof(qid->id));
175 cbc287dc 2022-04-19 stsp qid->data = data;
177 cbc287dc 2022-04-19 stsp idx = idset_hash(set, id) % set->nbuckets;
178 cbc287dc 2022-04-19 stsp head = &set->ids[idx];
179 cbc287dc 2022-04-19 stsp STAILQ_INSERT_HEAD(head, qid, entry);
180 cbc287dc 2022-04-19 stsp set->totelem++;
182 cbc287dc 2022-04-19 stsp if (set->nbuckets < set->totelem)
183 cbc287dc 2022-04-19 stsp err = idset_grow(set);
185 cbc287dc 2022-04-19 stsp return err;
188 cbc287dc 2022-04-19 stsp static struct got_object_qid *
189 cbc287dc 2022-04-19 stsp find_element(struct got_object_idset *set, struct got_object_id *id)
191 cbc287dc 2022-04-19 stsp uint64_t idx = idset_hash(set, id) % set->nbuckets;
192 cbc287dc 2022-04-19 stsp struct got_object_id_queue *head = &set->ids[idx];
193 cbc287dc 2022-04-19 stsp struct got_object_qid *qid;
195 cbc287dc 2022-04-19 stsp STAILQ_FOREACH(qid, head, entry) {
196 d7b5a0e8 2022-04-20 stsp if (got_object_id_cmp(&qid->id, id) == 0)
197 cbc287dc 2022-04-19 stsp return qid;
200 cbc287dc 2022-04-19 stsp return NULL;
204 984e8a45 2018-11-05 stsp got_object_idset_get(struct got_object_idset *set, struct got_object_id *id)
206 cbc287dc 2022-04-19 stsp struct got_object_qid *qid = find_element(set, id);
207 cbc287dc 2022-04-19 stsp return qid ? qid->data : NULL;
210 54be8251 2018-06-04 stsp const struct got_error *
211 e7c810ea 2018-06-22 stsp got_object_idset_remove(void **data, struct got_object_idset *set,
212 54be8251 2018-06-04 stsp struct got_object_id *id)
214 cbc287dc 2022-04-19 stsp uint64_t idx;
215 cbc287dc 2022-04-19 stsp struct got_object_id_queue *head;
216 cbc287dc 2022-04-19 stsp struct got_object_qid *qid;
219 441e144c 2018-06-22 stsp *data = NULL;
221 984e8a45 2018-11-05 stsp if (set->totelem == 0)
222 c6f420bf 2018-06-04 stsp return got_error(GOT_ERR_NO_OBJ);
224 0ae61b79 2022-03-21 stsp if (id == NULL) {
225 cbc287dc 2022-04-19 stsp /* Remove a "random" element. */
226 cbc287dc 2022-04-19 stsp for (idx = 0; idx < set->nbuckets; idx++) {
227 cbc287dc 2022-04-19 stsp head = &set->ids[idx];
228 cbc287dc 2022-04-19 stsp qid = STAILQ_FIRST(head);
233 cbc287dc 2022-04-19 stsp idx = idset_hash(set, id) % set->nbuckets;
234 cbc287dc 2022-04-19 stsp head = &set->ids[idx];
235 cbc287dc 2022-04-19 stsp STAILQ_FOREACH(qid, head, entry) {
236 d7b5a0e8 2022-04-20 stsp if (got_object_id_cmp(&qid->id, id) == 0)
239 cbc287dc 2022-04-19 stsp if (qid == NULL)
240 0ae61b79 2022-03-21 stsp return got_error_no_obj(id);
244 cbc287dc 2022-04-19 stsp *data = qid->data;
245 cbc287dc 2022-04-19 stsp STAILQ_REMOVE(head, qid, got_object_qid, entry);
246 cbc287dc 2022-04-19 stsp got_object_qid_free(qid);
247 984e8a45 2018-11-05 stsp set->totelem--;
249 984e8a45 2018-11-05 stsp return NULL;
253 54be8251 2018-06-04 stsp got_object_idset_contains(struct got_object_idset *set,
254 54be8251 2018-06-04 stsp struct got_object_id *id)
256 cbc287dc 2022-04-19 stsp struct got_object_qid *qid = find_element(set, id);
257 cbc287dc 2022-04-19 stsp return qid ? 1 : 0;
260 cb103d04 2018-11-07 stsp const struct got_error *
261 cb103d04 2018-11-07 stsp got_object_idset_for_each(struct got_object_idset *set,
262 cb103d04 2018-11-07 stsp const struct got_error *(*cb)(struct got_object_id *, void *, void *),
265 cbc287dc 2022-04-19 stsp const struct got_error *err = NULL;
266 cbc287dc 2022-04-19 stsp struct got_object_id_queue *head;
267 cbc287dc 2022-04-19 stsp struct got_object_qid *qid, *tmp;
270 cbc287dc 2022-04-19 stsp set->flags |= GOT_OBJECT_IDSET_F_TRAVERSAL;
271 cbc287dc 2022-04-19 stsp for (i = 0; i < set->nbuckets; i++) {
272 cbc287dc 2022-04-19 stsp head = &set->ids[i];
273 cbc287dc 2022-04-19 stsp STAILQ_FOREACH_SAFE(qid, head, entry, tmp) {
274 d7b5a0e8 2022-04-20 stsp err = (*cb)(&qid->id, qid->data, arg);
280 cbc287dc 2022-04-19 stsp set->flags &= ~GOT_OBJECT_IDSET_F_TRAVERSAL;
281 cbc287dc 2022-04-19 stsp return err;
285 c6f420bf 2018-06-04 stsp got_object_idset_num_elements(struct got_object_idset *set)
287 2bd394ff 2018-06-22 stsp return set->totelem;
