mirror of
https://github.com/git/git.git
synced 2026-01-11 21:33:13 +09:00
Although strmap could be used as a string->int map, one either had to allocate an int for every entry and then deallocate later, or one had to do a bunch of casting between (void*) and (intptr_t). Add some special functions that do the casting. Also, rename put->set for such wrapper functions since 'put' implied there may be some deallocation needed if the string was already found in the map, which isn't the case when we're storing an int value directly in the void* slot instead of using the void* slot as a pointer to data. Signed-off-by: Elijah Newren <newren@gmail.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
137 lines
3.2 KiB
C
137 lines
3.2 KiB
C
#include "git-compat-util.h"
|
|
#include "strmap.h"
|
|
|
|
int cmp_strmap_entry(const void *hashmap_cmp_fn_data,
|
|
const struct hashmap_entry *entry1,
|
|
const struct hashmap_entry *entry2,
|
|
const void *keydata)
|
|
{
|
|
const struct strmap_entry *e1, *e2;
|
|
|
|
e1 = container_of(entry1, const struct strmap_entry, ent);
|
|
e2 = container_of(entry2, const struct strmap_entry, ent);
|
|
return strcmp(e1->key, e2->key);
|
|
}
|
|
|
|
static struct strmap_entry *find_strmap_entry(struct strmap *map,
|
|
const char *str)
|
|
{
|
|
struct strmap_entry entry;
|
|
hashmap_entry_init(&entry.ent, strhash(str));
|
|
entry.key = str;
|
|
return hashmap_get_entry(&map->map, &entry, ent, NULL);
|
|
}
|
|
|
|
void strmap_init(struct strmap *map)
|
|
{
|
|
strmap_init_with_options(map, 1);
|
|
}
|
|
|
|
void strmap_init_with_options(struct strmap *map,
|
|
int strdup_strings)
|
|
{
|
|
hashmap_init(&map->map, cmp_strmap_entry, NULL, 0);
|
|
map->strdup_strings = strdup_strings;
|
|
}
|
|
|
|
static void strmap_free_entries_(struct strmap *map, int free_values)
|
|
{
|
|
struct hashmap_iter iter;
|
|
struct strmap_entry *e;
|
|
|
|
if (!map)
|
|
return;
|
|
|
|
/*
|
|
* We need to iterate over the hashmap entries and free
|
|
* e->key and e->value ourselves; hashmap has no API to
|
|
* take care of that for us. Since we're already iterating over
|
|
* the hashmap, though, might as well free e too and avoid the need
|
|
* to make some call into the hashmap API to do that.
|
|
*/
|
|
hashmap_for_each_entry(&map->map, &iter, e, ent) {
|
|
if (free_values)
|
|
free(e->value);
|
|
if (map->strdup_strings)
|
|
free((char*)e->key);
|
|
free(e);
|
|
}
|
|
}
|
|
|
|
void strmap_clear(struct strmap *map, int free_values)
|
|
{
|
|
strmap_free_entries_(map, free_values);
|
|
hashmap_clear(&map->map);
|
|
}
|
|
|
|
void strmap_partial_clear(struct strmap *map, int free_values)
|
|
{
|
|
strmap_free_entries_(map, free_values);
|
|
hashmap_partial_clear(&map->map);
|
|
}
|
|
|
|
void *strmap_put(struct strmap *map, const char *str, void *data)
|
|
{
|
|
struct strmap_entry *entry = find_strmap_entry(map, str);
|
|
void *old = NULL;
|
|
|
|
if (entry) {
|
|
old = entry->value;
|
|
entry->value = data;
|
|
} else {
|
|
const char *key = str;
|
|
|
|
entry = xmalloc(sizeof(*entry));
|
|
hashmap_entry_init(&entry->ent, strhash(str));
|
|
|
|
if (map->strdup_strings)
|
|
key = xstrdup(str);
|
|
entry->key = key;
|
|
entry->value = data;
|
|
hashmap_add(&map->map, &entry->ent);
|
|
}
|
|
return old;
|
|
}
|
|
|
|
struct strmap_entry *strmap_get_entry(struct strmap *map, const char *str)
|
|
{
|
|
return find_strmap_entry(map, str);
|
|
}
|
|
|
|
void *strmap_get(struct strmap *map, const char *str)
|
|
{
|
|
struct strmap_entry *entry = find_strmap_entry(map, str);
|
|
return entry ? entry->value : NULL;
|
|
}
|
|
|
|
int strmap_contains(struct strmap *map, const char *str)
|
|
{
|
|
return find_strmap_entry(map, str) != NULL;
|
|
}
|
|
|
|
void strmap_remove(struct strmap *map, const char *str, int free_value)
|
|
{
|
|
struct strmap_entry entry, *ret;
|
|
hashmap_entry_init(&entry.ent, strhash(str));
|
|
entry.key = str;
|
|
ret = hashmap_remove_entry(&map->map, &entry, ent, NULL);
|
|
if (!ret)
|
|
return;
|
|
if (free_value)
|
|
free(ret->value);
|
|
if (map->strdup_strings)
|
|
free((char*)ret->key);
|
|
free(ret);
|
|
}
|
|
|
|
void strintmap_incr(struct strintmap *map, const char *str, intptr_t amt)
|
|
{
|
|
struct strmap_entry *entry = find_strmap_entry(&map->map, str);
|
|
if (entry) {
|
|
intptr_t *whence = (intptr_t*)&entry->value;
|
|
*whence += amt;
|
|
}
|
|
else
|
|
strintmap_set(map, str, map->default_value + amt);
|
|
}
|