summaryrefslogtreecommitdiffstats
path: root/decorate.c
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-07 14:47:53 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-07 14:47:53 +0000
commitc8bae7493d2f2910b57f13ded012e86bdcfb0532 (patch)
tree24e09d9f84dec336720cf393e156089ca2835791 /decorate.c
parentInitial commit. (diff)
downloadgit-c8bae7493d2f2910b57f13ded012e86bdcfb0532.tar.xz
git-c8bae7493d2f2910b57f13ded012e86bdcfb0532.zip
Adding upstream version 1:2.39.2.upstream/1%2.39.2upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'decorate.c')
-rw-r--r--decorate.c83
1 files changed, 83 insertions, 0 deletions
diff --git a/decorate.c b/decorate.c
new file mode 100644
index 0000000..2036d15
--- /dev/null
+++ b/decorate.c
@@ -0,0 +1,83 @@
+/*
+ * decorate.c - decorate a git object with some arbitrary
+ * data.
+ */
+#include "cache.h"
+#include "object.h"
+#include "decorate.h"
+
+static unsigned int hash_obj(const struct object *obj, unsigned int n)
+{
+ return oidhash(&obj->oid) % n;
+}
+
+static void *insert_decoration(struct decoration *n, const struct object *base, void *decoration)
+{
+ int size = n->size;
+ struct decoration_entry *entries = n->entries;
+ unsigned int j = hash_obj(base, size);
+
+ while (entries[j].base) {
+ if (entries[j].base == base) {
+ void *old = entries[j].decoration;
+ entries[j].decoration = decoration;
+ return old;
+ }
+ if (++j >= size)
+ j = 0;
+ }
+ entries[j].base = base;
+ entries[j].decoration = decoration;
+ n->nr++;
+ return NULL;
+}
+
+static void grow_decoration(struct decoration *n)
+{
+ int i;
+ int old_size = n->size;
+ struct decoration_entry *old_entries = n->entries;
+
+ n->size = (old_size + 1000) * 3 / 2;
+ CALLOC_ARRAY(n->entries, n->size);
+ n->nr = 0;
+
+ for (i = 0; i < old_size; i++) {
+ const struct object *base = old_entries[i].base;
+ void *decoration = old_entries[i].decoration;
+
+ if (!decoration)
+ continue;
+ insert_decoration(n, base, decoration);
+ }
+ free(old_entries);
+}
+
+void *add_decoration(struct decoration *n, const struct object *obj,
+ void *decoration)
+{
+ int nr = n->nr + 1;
+
+ if (nr > n->size * 2 / 3)
+ grow_decoration(n);
+ return insert_decoration(n, obj, decoration);
+}
+
+void *lookup_decoration(struct decoration *n, const struct object *obj)
+{
+ unsigned int j;
+
+ /* nothing to lookup */
+ if (!n->size)
+ return NULL;
+ j = hash_obj(obj, n->size);
+ for (;;) {
+ struct decoration_entry *ref = n->entries + j;
+ if (ref->base == obj)
+ return ref->decoration;
+ if (!ref->base)
+ return NULL;
+ if (++j == n->size)
+ j = 0;
+ }
+}