1 /*
2  * Copyright (c) 2018, 2019 Stefan Sperling <stsp@openbsd.org>
3  *
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.
7  *
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.
15  */
16 
17 #include <sys/queue.h>
18 #include <sys/tree.h>
19 
20 #include <stdlib.h>
21 #include <string.h>
22 #include <sha1.h>
23 #include <stdio.h>
24 #include <zlib.h>
25 #include <limits.h>
26 #include <time.h>
27 
28 #include "got_object.h"
29 #include "got_error.h"
30 
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"
35 
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 */
40 };
41 
42 RB_HEAD(got_object_idset_tree, got_object_idset_element);
43 
44 static int
45 cmp_elements(const struct got_object_idset_element *e1,
46     const struct got_object_idset_element *e2)
47 {
48 	return got_object_id_cmp(&e1->id, &e2->id);
49 }
50 
51 RB_PROTOTYPE(got_object_idset_tree, got_object_idset_element, entry,
52     cmp_elements);
53 
54 struct got_object_idset {
55 	struct got_object_idset_tree entries;
56 	int totelem;
57 #define GOT_OBJECT_IDSET_MAX_ELEM INT_MAX
58 };
59 
60 struct got_object_idset *
61 got_object_idset_alloc(void)
62 {
63 	struct got_object_idset *set;
64 
65 	set = malloc(sizeof(*set));
66 	if (set == NULL)
67 		return NULL;
68 
69 	RB_INIT(&set->entries);
70 	set->totelem = 0;
71 
72 	return set;
73 }
74 
75 void
76 got_object_idset_free(struct got_object_idset *set)
77 {
78 	struct got_object_idset_element *entry;
79 
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. */
83 		free(entry);
84 	}
85 
86 	free(set);
87 }
88 
89 const struct got_error *
90 got_object_idset_add(struct got_object_idset *set, struct got_object_id *id,
91     void *data)
92 {
93 	struct got_object_idset_element *new;
94 
95 	if (set->totelem >= GOT_OBJECT_IDSET_MAX_ELEM)
96 		return got_error(GOT_ERR_NO_SPACE);
97 
98 	new = malloc(sizeof(*new));
99 	if (new == NULL)
100 		return got_error_from_errno("malloc");
101 
102 	memcpy(&new->id, id, sizeof(new->id));
103 	new->data = data;
104 
105 	if (RB_INSERT(got_object_idset_tree, &set->entries, new) != NULL) {
106 		free(new);
107 		return got_error(GOT_ERR_OBJ_EXISTS);
108 	}
109 
110 	set->totelem++;
111 	return NULL;
112 }
113 
114 static struct got_object_idset_element *
115 find_element(struct got_object_idset *set, struct got_object_id *id)
116 {
117 	struct got_object_idset_element *entry;
118 
119 	entry = RB_ROOT(&set->entries);
120 	while (entry) {
121 		int cmp = got_object_id_cmp(id, &entry->id);
122 		if (cmp < 0)
123 			entry = RB_LEFT(entry, entry);
124 		else if (cmp > 0)
125 			entry = RB_RIGHT(entry, entry);
126 		else
127 			break;
128 	}
129 
130 	return entry;
131 }
132 
133 void *
134 got_object_idset_get(struct got_object_idset *set, struct got_object_id *id)
135 {
136 	struct got_object_idset_element *entry = find_element(set, id);
137 	return entry ? entry->data : NULL;
138 }
139 
140 const struct got_error *
141 got_object_idset_remove(void **data, struct got_object_idset *set,
142     struct got_object_id *id)
143 {
144 	struct got_object_idset_element *entry;
145 
146 	if (data)
147 		*data = NULL;
148 
149 	if (set->totelem == 0)
150 		return got_error(GOT_ERR_NO_OBJ);
151 
152 	if (id == NULL) {
153 		entry = RB_ROOT(&set->entries);
154 		if (entry == NULL)
155 			return got_error(GOT_ERR_NO_OBJ);
156 	} else {
157 		entry = find_element(set, id);
158 		if (entry == NULL)
159 			return got_error_no_obj(id);
160 	}
161 
162 	RB_REMOVE(got_object_idset_tree, &set->entries, entry);
163 	if (data)
164 		*data = entry->data;
165 	free(entry);
166 	set->totelem--;
167 	return NULL;
168 }
169 
170 int
171 got_object_idset_contains(struct got_object_idset *set,
172     struct got_object_id *id)
173 {
174 	struct got_object_idset_element *entry = find_element(set, id);
175 	return entry ? 1 : 0;
176 }
177 
178 const struct got_error *
179 got_object_idset_for_each(struct got_object_idset *set,
180     const struct got_error *(*cb)(struct got_object_id *, void *, void *),
181     void *arg)
182 {
183 	const struct got_error *err;
184 	struct got_object_idset_element *entry, *tmp;
185 
186 	RB_FOREACH_SAFE(entry, got_object_idset_tree, &set->entries, tmp) {
187 		err = (*cb)(&entry->id, entry->data, arg);
188 		if (err)
189 			return err;
190 	}
191 	return NULL;
192 }
193 
194 int
195 got_object_idset_num_elements(struct got_object_idset *set)
196 {
197 	return set->totelem;
198 }
199 
200 struct got_object_idset_element *
201 got_object_idset_get_element(struct got_object_idset *set, struct got_object_id *id)
202 {
203 	return find_element(set, id);
204 }
205 
206 void *
207 got_object_idset_get_element_data(struct got_object_idset_element *entry)
208 {
209 	return entry->data;
210 }
211 
212 const struct got_error *
213 got_object_idset_for_each_element(struct got_object_idset *set,
214     const struct got_error *(*cb)(struct got_object_idset_element *, void *),
215     void *arg)
216 {
217 	const struct got_error *err;
218 	struct got_object_idset_element *entry, *tmp;
219 
220 	RB_FOREACH_SAFE(entry, got_object_idset_tree, &set->entries, tmp) {
221 		err = (*cb)(entry, arg);
222 		if (err)
223 			return err;
224 	}
225 	return NULL;
226 }
227 
228 void
229 got_object_idset_remove_element(struct got_object_idset *set,
230     struct got_object_idset_element *entry)
231 {
232 	RB_REMOVE(got_object_idset_tree, &set->entries, entry);
233 	free(entry);
234 	set->totelem--;
235 }
236 
237 RB_GENERATE(got_object_idset_tree, got_object_idset_element, entry,
238     cmp_elements);