oidmap.c 1.38 KB
Newer Older
1 2 3
#include "cache.h"
#include "oidmap.h"

4 5 6
static int oidmap_neq(const void *hashmap_cmp_fn_data,
		      const void *entry, const void *entry_or_key,
		      const void *keydata)
7 8 9
{
	const struct oidmap_entry *entry_ = entry;
	if (keydata)
10 11
		return !oideq(&entry_->oid, (const struct object_id *) keydata);
	return !oideq(&entry_->oid,
12 13 14 15 16 17 18 19 20 21 22 23
		      &((const struct oidmap_entry *) entry_or_key)->oid);
}

static int hash(const struct object_id *oid)
{
	int hash;
	memcpy(&hash, oid->hash, sizeof(hash));
	return hash;
}

void oidmap_init(struct oidmap *map, size_t initial_size)
{
24
	hashmap_init(&map->map, oidmap_neq, NULL, initial_size);
25 26 27 28 29 30 31 32 33 34 35
}

void oidmap_free(struct oidmap *map, int free_entries)
{
	if (!map)
		return;
	hashmap_free(&map->map, free_entries);
}

void *oidmap_get(const struct oidmap *map, const struct object_id *key)
{
36 37 38
	if (!map->map.cmpfn)
		return NULL;

39 40 41 42 43 44
	return hashmap_get_from_hash(&map->map, hash(key), key);
}

void *oidmap_remove(struct oidmap *map, const struct object_id *key)
{
	struct hashmap_entry entry;
45 46 47 48

	if (!map->map.cmpfn)
		oidmap_init(map, 0);

49 50 51 52 53 54 55
	hashmap_entry_init(&entry, hash(key));
	return hashmap_remove(&map->map, &entry, key);
}

void *oidmap_put(struct oidmap *map, void *entry)
{
	struct oidmap_entry *to_put = entry;
56 57 58 59

	if (!map->map.cmpfn)
		oidmap_init(map, 0);

60 61 62
	hashmap_entry_init(&to_put->internal_entry, hash(&to_put->oid));
	return hashmap_put(&map->map, to_put);
}