diff options
author | Vincent Ambo <Vincent Ambo> | 2020-01-11T23·36+0000 |
---|---|---|
committer | Vincent Ambo <Vincent Ambo> | 2020-01-11T23·36+0000 |
commit | 1b593e1ea4d2af0f6444d9a7788d5d99abd6fde5 (patch) | |
tree | e3accb9beed5c4c1b5a05c99db71ab2841f0ed04 /decorate.c |
Squashed 'third_party/git/' content from commit cb71568594
git-subtree-dir: third_party/git git-subtree-split: cb715685942260375e1eb8153b0768a376e4ece7
Diffstat (limited to 'decorate.c')
-rw-r--r-- | decorate.c | 83 |
1 files changed, 83 insertions, 0 deletions
diff --git a/decorate.c b/decorate.c new file mode 100644 index 000000000000..a605b1b5f4ac --- /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; + n->entries = xcalloc(n->size, sizeof(struct decoration_entry)); + 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; + } +} |