| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #include <errno.h> | ||
| 2 | #include <stdlib.h> | ||
| 3 | #include <string.h> | ||
| 4 | #include "hashset.h" | ||
| 5 | #include "bit.h" | ||
| 6 | #include "debug.h" | ||
| 7 | #include "hash.h" | ||
| 8 | #include "xmalloc.h" | ||
| 9 | #include "xstring.h" | ||
| 10 | |||
| 11 | 156 | static void alloc_table(HashSet *set, size_t size) | |
| 12 | { | ||
| 13 | 156 | BUG_ON(size < 8); | |
| 14 | 156 | BUG_ON(!IS_POWER_OF_2(size)); | |
| 15 | 156 | set->table_size = size; | |
| 16 | 156 | set->table = xcalloc(size, sizeof(set->table[0])); | |
| 17 | 156 | set->grow_at = size - (size / 4); // 75% load factor (size * 0.75) | |
| 18 | 156 | } | |
| 19 | |||
| 20 | 141 | void hashset_init(HashSet *set, size_t size, bool icase) | |
| 21 | { | ||
| 22 | 141 | size = MAX(size, 8); | |
| 23 | |||
| 24 | // Accommodate the 75% load factor in the table size, to allow filling | ||
| 25 | // the set to the requested size without needing to rehash() | ||
| 26 | 141 | size += size / 3; | |
| 27 | |||
| 28 | // Round up the allocation to the next power of 2, to allow using | ||
| 29 | // simple bitwise ops (instead of modulo) in get_slot() | ||
| 30 | 141 | size = next_pow2(size); | |
| 31 |
1/2✗ Branch 0 (2→3) not taken.
✓ Branch 1 (2→4) taken 141 times.
|
141 | if (unlikely(size == 0)) { |
| 32 | − | fatal_error(__func__, EOVERFLOW); | |
| 33 | } | ||
| 34 | |||
| 35 | 141 | alloc_table(set, size); | |
| 36 | 141 | set->nr_entries = 0; | |
| 37 | |||
| 38 |
2/2✓ Branch 0 (5→6) taken 21 times.
✓ Branch 1 (5→7) taken 120 times.
|
141 | if (icase) { |
| 39 | 21 | set->hash = fnv_1a_hash_icase; | |
| 40 | 21 | set->equal = mem_equal_icase; | |
| 41 | } else { | ||
| 42 | 120 | set->hash = fnv_1a_hash; | |
| 43 | 120 | set->equal = mem_equal; | |
| 44 | } | ||
| 45 | 141 | } | |
| 46 | |||
| 47 | 142 | void hashset_free(HashSet *set) | |
| 48 | { | ||
| 49 |
2/2✓ Branch 0 (7→3) taken 10336 times.
✓ Branch 1 (7→8) taken 142 times.
|
10478 | for (size_t i = 0, n = set->table_size; i < n; i++) { |
| 50 | 10336 | HashSetEntry *h = set->table[i]; | |
| 51 |
2/2✓ Branch 0 (5→4) taken 4703 times.
✓ Branch 1 (5→6) taken 10336 times.
|
15039 | while (h) { |
| 52 | 4703 | HashSetEntry *next = h->next; | |
| 53 | 4703 | free(h); | |
| 54 | 4703 | h = next; | |
| 55 | } | ||
| 56 | } | ||
| 57 | 142 | free(set->table); | |
| 58 | 142 | } | |
| 59 | |||
| 60 | 12758 | static size_t get_slot(const HashSet *set, const char *str, size_t str_len) | |
| 61 | { | ||
| 62 | 12758 | const size_t hash = set->hash(str, str_len); | |
| 63 | 12758 | return hash & (set->table_size - 1); | |
| 64 | } | ||
| 65 | |||
| 66 | 6852 | HashSetEntry *hashset_get(const HashSet *set, const char *str, size_t str_len) | |
| 67 | { | ||
| 68 | 6852 | const size_t slot = get_slot(set, str, str_len); | |
| 69 | 6852 | HashSetEntry *h = set->table[slot]; | |
| 70 |
2/2✓ Branch 0 (8→4) taken 3673 times.
✓ Branch 1 (8→9) taken 4804 times.
|
8477 | while (h) { |
| 71 |
4/4✓ Branch 0 (4→5) taken 2229 times.
✓ Branch 1 (4→7) taken 1444 times.
✓ Branch 2 (6→7) taken 181 times.
✓ Branch 3 (6→9) taken 2048 times.
|
3673 | if (str_len == h->str_len && set->equal(str, h->str, str_len)) { |
| 72 | return h; | ||
| 73 | } | ||
| 74 | 1625 | h = h->next; | |
| 75 | } | ||
| 76 | return NULL; | ||
| 77 | } | ||
| 78 | |||
| 79 | 15 | static void rehash(HashSet *set, size_t newsize) | |
| 80 | { | ||
| 81 | 15 | size_t oldsize = set->table_size; | |
| 82 | 15 | HashSetEntry **oldtable = set->table; | |
| 83 | 15 | alloc_table(set, newsize); | |
| 84 |
2/2✓ Branch 0 (9→4) taken 1584 times.
✓ Branch 1 (9→10) taken 15 times.
|
1599 | for (size_t i = 0; i < oldsize; i++) { |
| 85 | 1584 | HashSetEntry *e = oldtable[i]; | |
| 86 |
2/2✓ Branch 0 (7→5) taken 1203 times.
✓ Branch 1 (7→8) taken 1584 times.
|
2787 | while (e) { |
| 87 | 1203 | HashSetEntry *next = e->next; | |
| 88 | 1203 | const size_t slot = get_slot(set, e->str, e->str_len); | |
| 89 | 1203 | e->next = set->table[slot]; | |
| 90 | 1203 | set->table[slot] = e; | |
| 91 | 1203 | e = next; | |
| 92 | } | ||
| 93 | } | ||
| 94 | 15 | free(oldtable); | |
| 95 | 15 | } | |
| 96 | |||
| 97 | 6711 | HashSetEntry *hashset_insert(HashSet *set, const char *str, size_t str_len) | |
| 98 | { | ||
| 99 | 6711 | HashSetEntry *h = hashset_get(set, str, str_len); | |
| 100 |
2/2✓ Branch 0 (3→4) taken 4703 times.
✓ Branch 1 (3→10) taken 2008 times.
|
6711 | if (h) { |
| 101 | return h; | ||
| 102 | } | ||
| 103 | |||
| 104 | 4703 | const size_t slot = get_slot(set, str, str_len); | |
| 105 | 4703 | h = xmalloc(sizeof(*h) + str_len + 1); | |
| 106 | 4703 | h->next = set->table[slot]; | |
| 107 | 4703 | h->str_len = str_len; | |
| 108 | 4703 | memcpy(h->str, str, str_len); | |
| 109 | 4703 | h->str[str_len] = '\0'; | |
| 110 | 4703 | set->table[slot] = h; | |
| 111 | |||
| 112 |
2/2✓ Branch 0 (6→7) taken 15 times.
✓ Branch 1 (6→10) taken 4688 times.
|
4703 | if (++set->nr_entries > set->grow_at) { |
| 113 | 15 | size_t new_size = set->table_size << 1; | |
| 114 |
1/2✗ Branch 0 (7→8) not taken.
✓ Branch 1 (7→9) taken 15 times.
|
15 | if (unlikely(new_size == 0)) { |
| 115 | − | fatal_error(__func__, EOVERFLOW); | |
| 116 | } | ||
| 117 | 15 | rehash(set, new_size); | |
| 118 | } | ||
| 119 | |||
| 120 | return h; | ||
| 121 | } | ||
| 122 |