Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 1 | #include "git-compat-util.h" |
| 2 | #include "strmap.h" |
Elijah Newren | a208ec1 | 2020-11-11 20:02:18 +0000 | [diff] [blame] | 3 | #include "mem-pool.h" |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 4 | |
| 5 | int cmp_strmap_entry(const void *hashmap_cmp_fn_data, |
| 6 | const struct hashmap_entry *entry1, |
| 7 | const struct hashmap_entry *entry2, |
| 8 | const void *keydata) |
| 9 | { |
| 10 | const struct strmap_entry *e1, *e2; |
| 11 | |
| 12 | e1 = container_of(entry1, const struct strmap_entry, ent); |
| 13 | e2 = container_of(entry2, const struct strmap_entry, ent); |
| 14 | return strcmp(e1->key, e2->key); |
| 15 | } |
| 16 | |
| 17 | static struct strmap_entry *find_strmap_entry(struct strmap *map, |
| 18 | const char *str) |
| 19 | { |
| 20 | struct strmap_entry entry; |
| 21 | hashmap_entry_init(&entry.ent, strhash(str)); |
| 22 | entry.key = str; |
| 23 | return hashmap_get_entry(&map->map, &entry, ent, NULL); |
| 24 | } |
| 25 | |
| 26 | void strmap_init(struct strmap *map) |
| 27 | { |
Ævar Arnfjörð Bjarmason | 5726a6b | 2021-07-01 12:51:26 +0200 | [diff] [blame] | 28 | struct strmap blank = STRMAP_INIT; |
| 29 | memcpy(map, &blank, sizeof(*map)); |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 30 | } |
| 31 | |
| 32 | void strmap_init_with_options(struct strmap *map, |
Elijah Newren | a208ec1 | 2020-11-11 20:02:18 +0000 | [diff] [blame] | 33 | struct mem_pool *pool, |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 34 | int strdup_strings) |
| 35 | { |
| 36 | hashmap_init(&map->map, cmp_strmap_entry, NULL, 0); |
Elijah Newren | a208ec1 | 2020-11-11 20:02:18 +0000 | [diff] [blame] | 37 | map->pool = pool; |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 38 | map->strdup_strings = strdup_strings; |
| 39 | } |
| 40 | |
| 41 | static void strmap_free_entries_(struct strmap *map, int free_values) |
| 42 | { |
| 43 | struct hashmap_iter iter; |
| 44 | struct strmap_entry *e; |
| 45 | |
| 46 | if (!map) |
| 47 | return; |
| 48 | |
Elijah Newren | a208ec1 | 2020-11-11 20:02:18 +0000 | [diff] [blame] | 49 | if (!free_values && map->pool) |
| 50 | /* Memory other than util is owned by and freed with the pool */ |
| 51 | return; |
| 52 | |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 53 | /* |
| 54 | * We need to iterate over the hashmap entries and free |
| 55 | * e->key and e->value ourselves; hashmap has no API to |
| 56 | * take care of that for us. Since we're already iterating over |
| 57 | * the hashmap, though, might as well free e too and avoid the need |
| 58 | * to make some call into the hashmap API to do that. |
| 59 | */ |
| 60 | hashmap_for_each_entry(&map->map, &iter, e, ent) { |
| 61 | if (free_values) |
| 62 | free(e->value); |
Elijah Newren | 23a276a | 2020-11-11 20:02:19 +0000 | [diff] [blame] | 63 | if (!map->pool) |
Elijah Newren | a208ec1 | 2020-11-11 20:02:18 +0000 | [diff] [blame] | 64 | free(e); |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 65 | } |
| 66 | } |
| 67 | |
| 68 | void strmap_clear(struct strmap *map, int free_values) |
| 69 | { |
| 70 | strmap_free_entries_(map, free_values); |
| 71 | hashmap_clear(&map->map); |
| 72 | } |
| 73 | |
Elijah Newren | 6ccdfc2 | 2020-11-05 00:22:40 +0000 | [diff] [blame] | 74 | void strmap_partial_clear(struct strmap *map, int free_values) |
| 75 | { |
| 76 | strmap_free_entries_(map, free_values); |
| 77 | hashmap_partial_clear(&map->map); |
| 78 | } |
| 79 | |
Elijah Newren | 6abd220 | 2020-11-06 00:24:53 +0000 | [diff] [blame] | 80 | static struct strmap_entry *create_entry(struct strmap *map, |
| 81 | const char *str, |
| 82 | void *data) |
| 83 | { |
| 84 | struct strmap_entry *entry; |
Elijah Newren | 6abd220 | 2020-11-06 00:24:53 +0000 | [diff] [blame] | 85 | |
Elijah Newren | 23a276a | 2020-11-11 20:02:19 +0000 | [diff] [blame] | 86 | if (map->strdup_strings) { |
| 87 | if (!map->pool) { |
| 88 | FLEXPTR_ALLOC_STR(entry, key, str); |
| 89 | } else { |
| 90 | size_t len = st_add(strlen(str), 1); /* include NUL */ |
| 91 | entry = mem_pool_alloc(map->pool, |
| 92 | st_add(sizeof(*entry), len)); |
| 93 | memcpy(entry + 1, str, len); |
| 94 | entry->key = (void *)(entry + 1); |
| 95 | } |
| 96 | } else if (!map->pool) { |
| 97 | entry = xmalloc(sizeof(*entry)); |
| 98 | } else { |
| 99 | entry = mem_pool_alloc(map->pool, sizeof(*entry)); |
| 100 | } |
Elijah Newren | 6abd220 | 2020-11-06 00:24:53 +0000 | [diff] [blame] | 101 | hashmap_entry_init(&entry->ent, strhash(str)); |
Elijah Newren | 23a276a | 2020-11-11 20:02:19 +0000 | [diff] [blame] | 102 | if (!map->strdup_strings) |
| 103 | entry->key = str; |
Elijah Newren | 6abd220 | 2020-11-06 00:24:53 +0000 | [diff] [blame] | 104 | entry->value = data; |
| 105 | return entry; |
| 106 | } |
| 107 | |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 108 | void *strmap_put(struct strmap *map, const char *str, void *data) |
| 109 | { |
| 110 | struct strmap_entry *entry = find_strmap_entry(map, str); |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 111 | |
| 112 | if (entry) { |
Elijah Newren | 6abd220 | 2020-11-06 00:24:53 +0000 | [diff] [blame] | 113 | void *old = entry->value; |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 114 | entry->value = data; |
Elijah Newren | 6abd220 | 2020-11-06 00:24:53 +0000 | [diff] [blame] | 115 | return old; |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 116 | } |
Elijah Newren | 6abd220 | 2020-11-06 00:24:53 +0000 | [diff] [blame] | 117 | |
| 118 | entry = create_entry(map, str, data); |
| 119 | hashmap_add(&map->map, &entry->ent); |
| 120 | return NULL; |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 121 | } |
| 122 | |
Elijah Newren | b70c82e | 2020-11-05 00:22:39 +0000 | [diff] [blame] | 123 | struct strmap_entry *strmap_get_entry(struct strmap *map, const char *str) |
| 124 | { |
| 125 | return find_strmap_entry(map, str); |
| 126 | } |
| 127 | |
Elijah Newren | ae20bf1 | 2020-11-02 18:55:06 +0000 | [diff] [blame] | 128 | void *strmap_get(struct strmap *map, const char *str) |
| 129 | { |
| 130 | struct strmap_entry *entry = find_strmap_entry(map, str); |
| 131 | return entry ? entry->value : NULL; |
| 132 | } |
| 133 | |
| 134 | int strmap_contains(struct strmap *map, const char *str) |
| 135 | { |
| 136 | return find_strmap_entry(map, str) != NULL; |
| 137 | } |
Elijah Newren | b70c82e | 2020-11-05 00:22:39 +0000 | [diff] [blame] | 138 | |
| 139 | void strmap_remove(struct strmap *map, const char *str, int free_value) |
| 140 | { |
| 141 | struct strmap_entry entry, *ret; |
| 142 | hashmap_entry_init(&entry.ent, strhash(str)); |
| 143 | entry.key = str; |
| 144 | ret = hashmap_remove_entry(&map->map, &entry, ent, NULL); |
| 145 | if (!ret) |
| 146 | return; |
| 147 | if (free_value) |
| 148 | free(ret->value); |
Elijah Newren | 23a276a | 2020-11-11 20:02:19 +0000 | [diff] [blame] | 149 | if (!map->pool) |
Elijah Newren | a208ec1 | 2020-11-11 20:02:18 +0000 | [diff] [blame] | 150 | free(ret); |
Elijah Newren | b70c82e | 2020-11-05 00:22:39 +0000 | [diff] [blame] | 151 | } |
Elijah Newren | 4fa1d50 | 2020-11-05 00:22:41 +0000 | [diff] [blame] | 152 | |
| 153 | void strintmap_incr(struct strintmap *map, const char *str, intptr_t amt) |
| 154 | { |
| 155 | struct strmap_entry *entry = find_strmap_entry(&map->map, str); |
| 156 | if (entry) { |
| 157 | intptr_t *whence = (intptr_t*)&entry->value; |
| 158 | *whence += amt; |
| 159 | } |
| 160 | else |
| 161 | strintmap_set(map, str, map->default_value + amt); |
| 162 | } |
Elijah Newren | 1201eb6 | 2020-11-06 00:24:54 +0000 | [diff] [blame] | 163 | |
| 164 | int strset_add(struct strset *set, const char *str) |
| 165 | { |
| 166 | /* |
| 167 | * Cannot use strmap_put() because it'll return NULL in both cases: |
| 168 | * - cannot find str: NULL means "not found" |
| 169 | * - does find str: NULL is the value associated with str |
| 170 | */ |
| 171 | struct strmap_entry *entry = find_strmap_entry(&set->map, str); |
| 172 | |
| 173 | if (entry) |
| 174 | return 0; |
| 175 | |
| 176 | entry = create_entry(&set->map, str, NULL); |
| 177 | hashmap_add(&set->map.map, &entry->ent); |
| 178 | return 1; |
| 179 | } |