2 * Copyright (c) 2018, 2019 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>
28 #include "got_object.h"
29 #include "got_error.h"
31 #include "got_lib_delta.h"
32 #include "got_lib_inflate.h"
33 #include "got_lib_object.h"
34 #include "got_lib_object_idset.h"
36 struct got_object_idset_element {
37 RB_ENTRY(got_object_idset_element) entry;
38 struct got_object_id id;
39 void *data; /* API user data */
42 RB_HEAD(got_object_idset_tree, got_object_idset_element);
45 cmp_elements(const struct got_object_idset_element *e1,
46 const struct got_object_idset_element *e2)
48 return got_object_id_cmp(&e1->id, &e2->id);
51 RB_PROTOTYPE(got_object_idset_tree, got_object_idset_element, entry,
54 struct got_object_idset {
55 struct got_object_idset_tree entries;
57 #define GOT_OBJECT_IDSET_MAX_ELEM INT_MAX
60 struct got_object_idset *
61 got_object_idset_alloc(void)
63 struct got_object_idset *set;
65 set = malloc(sizeof(*set));
69 RB_INIT(&set->entries);
76 got_object_idset_free(struct got_object_idset *set)
78 struct got_object_idset_element *entry;
80 while ((entry = RB_MIN(got_object_idset_tree, &set->entries))) {
81 RB_REMOVE(got_object_idset_tree, &set->entries, entry);
82 /* User data should be freed by caller. */
89 const struct got_error *
90 got_object_idset_add(struct got_object_idset *set, struct got_object_id *id,
93 struct got_object_idset_element *new;
95 if (set->totelem >= GOT_OBJECT_IDSET_MAX_ELEM)
96 return got_error(GOT_ERR_NO_SPACE);
98 new = malloc(sizeof(*new));
100 return got_error_from_errno();
102 memcpy(&new->id, id, sizeof(new->id));
105 RB_INSERT(got_object_idset_tree, &set->entries, new);
110 static struct got_object_idset_element *
111 find_element(struct got_object_idset *set, struct got_object_id *id)
113 struct got_object_idset_element *entry;
115 entry = RB_ROOT(&set->entries);
117 int cmp = got_object_id_cmp(id, &entry->id);
119 entry = RB_LEFT(entry, entry);
121 entry = RB_RIGHT(entry, entry);
130 got_object_idset_get(struct got_object_idset *set, struct got_object_id *id)
132 struct got_object_idset_element *entry = find_element(set, id);
133 return entry ? entry->data : NULL;
136 const struct got_error *
137 got_object_idset_remove(void **data, struct got_object_idset *set,
138 struct got_object_id *id)
140 struct got_object_idset_element *entry;
145 if (set->totelem == 0)
146 return got_error(GOT_ERR_NO_OBJ);
149 entry = RB_ROOT(&set->entries);
151 entry = find_element(set, id);
153 return got_error(GOT_ERR_NO_OBJ);
155 RB_REMOVE(got_object_idset_tree, &set->entries, entry);
164 got_object_idset_contains(struct got_object_idset *set,
165 struct got_object_id *id)
167 struct got_object_idset_element *entry = find_element(set, id);
168 return entry ? 1 : 0;
171 const struct got_error *
172 got_object_idset_for_each(struct got_object_idset *set,
173 const struct got_error *(*cb)(struct got_object_id *, void *, void *),
176 const struct got_error *err;
177 struct got_object_idset_element *entry, *tmp;
179 RB_FOREACH_SAFE(entry, got_object_idset_tree, &set->entries, tmp) {
180 err = (*cb)(&entry->id, entry->data, arg);
188 got_object_idset_num_elements(struct got_object_idset *set)
193 RB_GENERATE(got_object_idset_tree, got_object_idset_element, entry,