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>
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"
37 #define nitems(_a) (sizeof(_a) / sizeof((_a)[0]))
40 struct got_object_idset_element {
41 RB_ENTRY(got_object_idset_element) entry;
42 struct got_object_id id;
43 void *data; /* API user data */
46 RB_HEAD(got_object_idset_tree, got_object_idset_element);
49 cmp_elements(const struct got_object_idset_element *e1,
50 const struct got_object_idset_element *e2)
52 return got_object_id_cmp(&e1->id, &e2->id);
55 RB_PROTOTYPE(got_object_idset_tree, got_object_idset_element, entry,
58 struct got_object_idset {
59 struct got_object_idset_tree entries;
61 #define GOT_OBJECT_IDSET_MAX_ELEM INT_MAX
64 struct got_object_idset *
65 got_object_idset_alloc(void)
67 struct got_object_idset *set;
69 set = malloc(sizeof(*set));
73 RB_INIT(&set->entries);
80 got_object_idset_free(struct got_object_idset *set)
82 struct got_object_idset_element *entry;
84 while ((entry = RB_MIN(got_object_idset_tree, &set->entries))) {
85 RB_REMOVE(got_object_idset_tree, &set->entries, entry);
86 /* User data should be freed by caller. */
93 const struct got_error *
94 got_object_idset_add(struct got_object_idset *set, struct got_object_id *id,
97 struct got_object_idset_element *new;
99 if (set->totelem >= GOT_OBJECT_IDSET_MAX_ELEM)
100 return got_error(GOT_ERR_NO_SPACE);
102 new = malloc(sizeof(*new));
104 return got_error_from_errno();
106 memcpy(&new->id, id, sizeof(new->id));
109 RB_INSERT(got_object_idset_tree, &set->entries, new);
114 static struct got_object_idset_element *
115 find_element(struct got_object_idset *set, struct got_object_id *id)
117 struct got_object_idset_element *entry;
119 entry = RB_ROOT(&set->entries);
121 int cmp = got_object_id_cmp(id, &entry->id);
123 entry = RB_LEFT(entry, entry);
125 entry = RB_RIGHT(entry, entry);
134 got_object_idset_get(struct got_object_idset *set, struct got_object_id *id)
136 struct got_object_idset_element *entry = find_element(set, id);
137 return entry ? entry->data : NULL;
140 const struct got_error *
141 got_object_idset_remove(void **data, struct got_object_idset *set,
142 struct got_object_id *id)
144 struct got_object_idset_element *entry;
149 if (set->totelem == 0)
150 return got_error(GOT_ERR_NO_OBJ);
153 entry = RB_ROOT(&set->entries);
155 entry = find_element(set, id);
157 return got_error(GOT_ERR_NO_OBJ);
159 RB_REMOVE(got_object_idset_tree, &set->entries, entry);
168 got_object_idset_contains(struct got_object_idset *set,
169 struct got_object_id *id)
171 struct got_object_idset_element *entry = find_element(set, id);
172 return entry ? 1 : 0;
175 const struct got_error *
176 got_object_idset_for_each(struct got_object_idset *set,
177 const struct got_error *(*cb)(struct got_object_id *, void *, void *),
180 const struct got_error *err;
181 struct got_object_idset_element *entry, *tmp;
183 RB_FOREACH_SAFE(entry, got_object_idset_tree, &set->entries, tmp) {
184 err = (*cb)(&entry->id, entry->data, arg);
192 got_object_idset_num_elements(struct got_object_idset *set)
197 RB_GENERATE(got_object_idset_tree, got_object_idset_element, entry,