blob: 2f8a63e38881587fe29fcb72a5272ef54b9efa6e [file] [log] [blame]
Linus Torvaldsa59b2762007-04-16 16:03:15 -07001/*
2 * decorate.c - decorate a git object with some arbitrary
3 * data.
4 */
5#include "cache.h"
6#include "object.h"
7#include "decorate.h"
8
Jeff King54988bd2008-08-20 13:55:33 -04009static unsigned int hash_obj(const struct object *obj, unsigned int n)
Linus Torvaldsa59b2762007-04-16 16:03:15 -070010{
Dan McGeeb867d322009-05-11 20:17:38 -050011 unsigned int hash;
12
13 memcpy(&hash, obj->sha1, sizeof(unsigned int));
Linus Torvaldsa59b2762007-04-16 16:03:15 -070014 return hash % n;
15}
16
Jeff King54988bd2008-08-20 13:55:33 -040017static void *insert_decoration(struct decoration *n, const struct object *base, void *decoration)
Linus Torvaldsa59b2762007-04-16 16:03:15 -070018{
19 int size = n->size;
20 struct object_decoration *hash = n->hash;
Dan McGee91fe2f92009-05-18 23:34:02 -050021 unsigned int j = hash_obj(base, size);
Linus Torvaldsa59b2762007-04-16 16:03:15 -070022
23 while (hash[j].base) {
24 if (hash[j].base == base) {
25 void *old = hash[j].decoration;
26 hash[j].decoration = decoration;
27 return old;
28 }
Linus Torvaldsa59b2762007-04-16 16:03:15 -070029 if (++j >= size)
30 j = 0;
31 }
32 hash[j].base = base;
33 hash[j].decoration = decoration;
34 n->nr++;
35 return NULL;
36}
37
38static void grow_decoration(struct decoration *n)
39{
40 int i;
41 int old_size = n->size;
Junio C Hamano69913572008-07-03 00:25:23 -070042 struct object_decoration *old_hash = n->hash;
Linus Torvaldsa59b2762007-04-16 16:03:15 -070043
44 n->size = (old_size + 1000) * 3 / 2;
45 n->hash = xcalloc(n->size, sizeof(struct object_decoration));
46 n->nr = 0;
47
48 for (i = 0; i < old_size; i++) {
Jeff King54988bd2008-08-20 13:55:33 -040049 const struct object *base = old_hash[i].base;
Linus Torvaldsa59b2762007-04-16 16:03:15 -070050 void *decoration = old_hash[i].decoration;
51
52 if (!base)
53 continue;
54 insert_decoration(n, base, decoration);
55 }
56 free(old_hash);
57}
58
59/* Add a decoration pointer, return any old one */
Jeff King54988bd2008-08-20 13:55:33 -040060void *add_decoration(struct decoration *n, const struct object *obj,
61 void *decoration)
Linus Torvaldsa59b2762007-04-16 16:03:15 -070062{
63 int nr = n->nr + 1;
64
65 if (nr > n->size * 2 / 3)
66 grow_decoration(n);
67 return insert_decoration(n, obj, decoration);
68}
69
70/* Lookup a decoration pointer */
Jeff King54988bd2008-08-20 13:55:33 -040071void *lookup_decoration(struct decoration *n, const struct object *obj)
Linus Torvaldsa59b2762007-04-16 16:03:15 -070072{
Dan McGee91fe2f92009-05-18 23:34:02 -050073 unsigned int j;
Linus Torvaldsa59b2762007-04-16 16:03:15 -070074
75 /* nothing to lookup */
76 if (!n->size)
77 return NULL;
78 j = hash_obj(obj, n->size);
79 for (;;) {
80 struct object_decoration *ref = n->hash + j;
81 if (ref->base == obj)
82 return ref->decoration;
83 if (!ref->base)
84 return NULL;
85 if (++j == n->size)
86 j = 0;
87 }
88}