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>
27 #include "got_object.h"
28 #include "got_error.h"
30 #include "got_lib_delta.h"
31 #include "got_lib_inflate.h"
32 #include "got_lib_object.h"
33 #include "got_lib_object_idcache.h"
36 #define nitems(_a) (sizeof(_a) / sizeof((_a)[0]))
39 struct got_object_idcache_element {
40 TAILQ_ENTRY(got_object_idcache_element) entry;
41 struct got_object_id id;
42 void *data; /* API user data */
45 TAILQ_HEAD(got_object_idcache_head, got_object_idcache_element);
47 struct got_object_idcache {
48 struct got_object_idcache_head entries;
53 struct got_object_idcache *
54 got_object_idcache_alloc(int maxelem)
56 struct got_object_idcache *cache;
58 cache = calloc(1, sizeof(*cache));
62 TAILQ_INIT(&cache->entries);
63 cache->maxelem = maxelem;
68 got_object_idcache_free(struct got_object_idcache *cache)
70 struct got_object_idcache_element *entry;
72 while (!TAILQ_EMPTY(&cache->entries)) {
73 entry = TAILQ_FIRST(&cache->entries);
74 TAILQ_REMOVE(&cache->entries, entry, entry);
75 /* User data should be freed by caller. */
81 const struct got_error *
82 got_object_idcache_add(struct got_object_idcache *cache,
83 struct got_object_id *id, void *data)
85 struct got_object_idcache_element *entry;
87 if (cache->nelem >= cache->maxelem) {
88 entry = TAILQ_LAST(&cache->entries, got_object_idcache_head);
89 TAILQ_REMOVE(&cache->entries, entry, entry);
93 entry = calloc(1, sizeof(*entry));
95 return got_error_from_errno();
97 memcpy(&entry->id, id, sizeof(entry->id));
100 TAILQ_INSERT_HEAD(&cache->entries, entry, entry);
106 got_object_idcache_get(struct got_object_idcache *cache, struct got_object_id *id)
108 struct got_object_idcache_element *entry;
110 TAILQ_FOREACH(entry, &cache->entries, entry) {
111 if (got_object_id_cmp(&entry->id, id) != 0)
113 if (entry != TAILQ_FIRST(&cache->entries)) {
114 TAILQ_REMOVE(&cache->entries, entry, entry);
115 TAILQ_INSERT_HEAD(&cache->entries, entry, entry);
123 const struct got_error *
124 got_object_idcache_remove_least_used(void **data, struct got_object_idcache *cache)
126 struct got_object_idcache_element *entry;
131 if (cache->nelem == 0)
132 return got_error(GOT_ERR_NO_OBJ);
134 entry = TAILQ_LAST(&cache->entries, got_object_idcache_head);
135 TAILQ_REMOVE(&cache->entries, entry, entry);
144 got_object_idcache_contains(struct got_object_idcache *cache,
145 struct got_object_id *id)
147 struct got_object_idcache_element *entry;
149 TAILQ_FOREACH(entry, &cache->entries, entry) {
150 if (got_object_id_cmp(&entry->id, id) == 0)
157 void got_object_idcache_for_each(struct got_object_idcache *cache,
158 void (*cb)(struct got_object_id *, void *, void *), void *arg)
160 struct got_object_idcache_element *entry;
162 TAILQ_FOREACH(entry, &cache->entries, entry)
163 cb(&entry->id, entry->data, arg);
167 got_object_idcache_num_elements(struct got_object_idcache *set)