]>
Commit | Line | Data |
---|---|---|
1 | #include "cache.h" | |
2 | #include "oidmap.h" | |
3 | ||
4 | static int oidmap_neq(const void *hashmap_cmp_fn_data, | |
5 | const struct hashmap_entry *e1, | |
6 | const struct hashmap_entry *e2, | |
7 | const void *keydata) | |
8 | { | |
9 | const struct oidmap_entry *a, *b; | |
10 | ||
11 | a = container_of(e1, const struct oidmap_entry, internal_entry); | |
12 | b = container_of(e2, const struct oidmap_entry, internal_entry); | |
13 | ||
14 | if (keydata) | |
15 | return !oideq(&a->oid, (const struct object_id *) keydata); | |
16 | return !oideq(&a->oid, &b->oid); | |
17 | } | |
18 | ||
19 | void oidmap_init(struct oidmap *map, size_t initial_size) | |
20 | { | |
21 | hashmap_init(&map->map, oidmap_neq, NULL, initial_size); | |
22 | } | |
23 | ||
24 | void oidmap_free(struct oidmap *map, int free_entries) | |
25 | { | |
26 | if (!map) | |
27 | return; | |
28 | ||
29 | /* TODO: make oidmap itself not depend on struct layouts */ | |
30 | hashmap_free_(&map->map, free_entries ? 0 : -1); | |
31 | } | |
32 | ||
33 | void *oidmap_get(const struct oidmap *map, const struct object_id *key) | |
34 | { | |
35 | if (!map->map.cmpfn) | |
36 | return NULL; | |
37 | ||
38 | return hashmap_get_from_hash(&map->map, oidhash(key), key); | |
39 | } | |
40 | ||
41 | void *oidmap_remove(struct oidmap *map, const struct object_id *key) | |
42 | { | |
43 | struct hashmap_entry entry; | |
44 | ||
45 | if (!map->map.cmpfn) | |
46 | oidmap_init(map, 0); | |
47 | ||
48 | hashmap_entry_init(&entry, oidhash(key)); | |
49 | return hashmap_remove(&map->map, &entry, key); | |
50 | } | |
51 | ||
52 | void *oidmap_put(struct oidmap *map, void *entry) | |
53 | { | |
54 | struct oidmap_entry *to_put = entry; | |
55 | ||
56 | if (!map->map.cmpfn) | |
57 | oidmap_init(map, 0); | |
58 | ||
59 | hashmap_entry_init(&to_put->internal_entry, oidhash(&to_put->oid)); | |
60 | return hashmap_put(&map->map, &to_put->internal_entry); | |
61 | } |