2007-04-17 01:03:15 +02:00
|
|
|
/*
|
|
|
|
* decorate.c - decorate a git object with some arbitrary
|
|
|
|
* data.
|
|
|
|
*/
|
|
|
|
#include "cache.h"
|
|
|
|
#include "object.h"
|
|
|
|
#include "decorate.h"
|
|
|
|
|
2008-08-20 19:55:33 +02:00
|
|
|
static unsigned int hash_obj(const struct object *obj, unsigned int n)
|
2007-04-17 01:03:15 +02:00
|
|
|
{
|
2019-06-20 09:41:49 +02:00
|
|
|
return oidhash(&obj->oid) % n;
|
2007-04-17 01:03:15 +02:00
|
|
|
}
|
|
|
|
|
2008-08-20 19:55:33 +02:00
|
|
|
static void *insert_decoration(struct decoration *n, const struct object *base, void *decoration)
|
2007-04-17 01:03:15 +02:00
|
|
|
{
|
|
|
|
int size = n->size;
|
2017-12-08 01:14:24 +01:00
|
|
|
struct decoration_entry *entries = n->entries;
|
2009-05-19 06:34:02 +02:00
|
|
|
unsigned int j = hash_obj(base, size);
|
2007-04-17 01:03:15 +02:00
|
|
|
|
2017-12-08 01:14:24 +01:00
|
|
|
while (entries[j].base) {
|
|
|
|
if (entries[j].base == base) {
|
|
|
|
void *old = entries[j].decoration;
|
|
|
|
entries[j].decoration = decoration;
|
2007-04-17 01:03:15 +02:00
|
|
|
return old;
|
|
|
|
}
|
|
|
|
if (++j >= size)
|
|
|
|
j = 0;
|
|
|
|
}
|
2017-12-08 01:14:24 +01:00
|
|
|
entries[j].base = base;
|
|
|
|
entries[j].decoration = decoration;
|
2007-04-17 01:03:15 +02:00
|
|
|
n->nr++;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void grow_decoration(struct decoration *n)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int old_size = n->size;
|
2017-12-08 01:14:24 +01:00
|
|
|
struct decoration_entry *old_entries = n->entries;
|
2007-04-17 01:03:15 +02:00
|
|
|
|
|
|
|
n->size = (old_size + 1000) * 3 / 2;
|
2021-03-13 17:17:22 +01:00
|
|
|
CALLOC_ARRAY(n->entries, n->size);
|
2007-04-17 01:03:15 +02:00
|
|
|
n->nr = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < old_size; i++) {
|
2017-12-08 01:14:24 +01:00
|
|
|
const struct object *base = old_entries[i].base;
|
|
|
|
void *decoration = old_entries[i].decoration;
|
2007-04-17 01:03:15 +02:00
|
|
|
|
2013-05-16 17:32:27 +02:00
|
|
|
if (!decoration)
|
2007-04-17 01:03:15 +02:00
|
|
|
continue;
|
|
|
|
insert_decoration(n, base, decoration);
|
|
|
|
}
|
2017-12-08 01:14:24 +01:00
|
|
|
free(old_entries);
|
2007-04-17 01:03:15 +02:00
|
|
|
}
|
|
|
|
|
2008-08-20 19:55:33 +02:00
|
|
|
void *add_decoration(struct decoration *n, const struct object *obj,
|
|
|
|
void *decoration)
|
2007-04-17 01:03:15 +02:00
|
|
|
{
|
|
|
|
int nr = n->nr + 1;
|
|
|
|
|
|
|
|
if (nr > n->size * 2 / 3)
|
|
|
|
grow_decoration(n);
|
|
|
|
return insert_decoration(n, obj, decoration);
|
|
|
|
}
|
|
|
|
|
2008-08-20 19:55:33 +02:00
|
|
|
void *lookup_decoration(struct decoration *n, const struct object *obj)
|
2007-04-17 01:03:15 +02:00
|
|
|
{
|
2009-05-19 06:34:02 +02:00
|
|
|
unsigned int j;
|
2007-04-17 01:03:15 +02:00
|
|
|
|
|
|
|
/* nothing to lookup */
|
|
|
|
if (!n->size)
|
|
|
|
return NULL;
|
|
|
|
j = hash_obj(obj, n->size);
|
|
|
|
for (;;) {
|
2017-12-08 01:14:24 +01:00
|
|
|
struct decoration_entry *ref = n->entries + j;
|
2007-04-17 01:03:15 +02:00
|
|
|
if (ref->base == obj)
|
|
|
|
return ref->decoration;
|
|
|
|
if (!ref->base)
|
|
|
|
return NULL;
|
|
|
|
if (++j == n->size)
|
|
|
|
j = 0;
|
|
|
|
}
|
|
|
|
}
|