Branch Coverage

hashmap_generic.h
Criterion Covered Total %
branch 2762 5032 54.8


line true false branch
177 2733536 301 for (i = 0; i < capacity; i++) {
983392 45 for (i = 0; i < capacity; i++) {
2098080 51 for (i = 0; i < capacity; i++) {
2722432 163 for (i = 0; i < capacity; i++) {
2726448 226 for (i = 0; i < capacity; i++) {
10595104 460 for (i = 0; i < capacity; i++) {
4294368 135 for (i = 0; i < capacity; i++) {
1607568 160 for (i = 0; i < capacity; i++) {
2004640 132 for (i = 0; i < capacity; i++) {
199 81577 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
81577 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
80225 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
80225 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
82419 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
82419 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
80240 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
80240 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
80125 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
80125 0 if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
205 80413 0 if (node->value != NULL) {
82419 0 if (node->value != NULL) {
81022 0 if (node->value != NULL) {
60313 0 if (node->value != NULL) {
210 81577 0 if (node->value != NULL && map->free_value_fn) {
81577 0 if (node->value != NULL && map->free_value_fn) {
82013 0 if (node->value != NULL && map->free_value_fn) {
82013 0 if (node->value != NULL && map->free_value_fn) {
30065 0 if (node->value != NULL && map->free_value_fn) {
30065 0 if (node->value != NULL && map->free_value_fn) {
50125 0 if (node->value != NULL && map->free_value_fn) {
50125 0 if (node->value != NULL && map->free_value_fn) {
223 342 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
185 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
2 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
2 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
1 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
181 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
341 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
3 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
181 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
2790 2 if (p != HM_LRU_NONE) map->lru_next[p] = n;
1 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
3 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
181 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
1 0 if (p != HM_LRU_NONE) map->lru_next[p] = n;
225 0 342 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
1 184 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 2 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 2 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 1 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 181 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 341 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
1 2 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 181 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
9 2783 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 1 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
1 2 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 181 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
0 1 if (n != HM_LRU_NONE) map->lru_prev[n] = p;
234 402 6 if (map->lru_head != HM_LRU_NONE)
207 4 if (map->lru_head != HM_LRU_NONE)
6 2 if (map->lru_head != HM_LRU_NONE)
6 2 if (map->lru_head != HM_LRU_NONE)
2 1 if (map->lru_head != HM_LRU_NONE)
200 3 if (map->lru_head != HM_LRU_NONE)
399 5 if (map->lru_head != HM_LRU_NONE)
5 1 if (map->lru_head != HM_LRU_NONE)
200 3 if (map->lru_head != HM_LRU_NONE)
2964 21 if (map->lru_head != HM_LRU_NONE)
3 1 if (map->lru_head != HM_LRU_NONE)
5 1 if (map->lru_head != HM_LRU_NONE)
200 3 if (map->lru_head != HM_LRU_NONE)
3 1 if (map->lru_head != HM_LRU_NONE)
242 2 0 if (map->lru_head == idx) return;
2 2 if (map->lru_head == idx) return;
2 0 if (map->lru_head == idx) return;
2 0 if (map->lru_head == idx) return;
0 0 if (map->lru_head == idx) return;
0 0 if (map->lru_head == idx) return;
1 0 if (map->lru_head == idx) return;
0 2 if (map->lru_head == idx) return;
1 0 if (map->lru_head == idx) return;
6 111 if (map->lru_head == idx) return;
0 0 if (map->lru_head == idx) return;
0 2 if (map->lru_head == idx) return;
0 0 if (map->lru_head == idx) return;
0 0 if (map->lru_head == idx) return;
260 163 80686 if (map->expires_at) map->expires_at[index] = 0;
3 80687 if (map->expires_at) map->expires_at[index] = 0;
2 30006 if (map->expires_at) map->expires_at[index] = 0;
2 50006 if (map->expires_at) map->expires_at[index] = 0;
1 80005 if (map->expires_at) map->expires_at[index] = 0;
0 80184 if (map->expires_at) map->expires_at[index] = 0;
162 80688 if (map->expires_at) map->expires_at[index] = 0;
1 80006 if (map->expires_at) map->expires_at[index] = 0;
1 80284 if (map->expires_at) map->expires_at[index] = 0;
16 282692 if (map->expires_at) map->expires_at[index] = 0;
1 150003 if (map->expires_at) map->expires_at[index] = 0;
2 80005 if (map->expires_at) map->expires_at[index] = 0;
0 60184 if (map->expires_at) map->expires_at[index] = 0;
1 80006 if (map->expires_at) map->expires_at[index] = 0;
268 0 342 if (victim == HM_LRU_NONE) return;
0 183 if (victim == HM_LRU_NONE) return;
0 2 if (victim == HM_LRU_NONE) return;
0 2 if (victim == HM_LRU_NONE) return;
0 1 if (victim == HM_LRU_NONE) return;
0 181 if (victim == HM_LRU_NONE) return;
0 341 if (victim == HM_LRU_NONE) return;
0 1 if (victim == HM_LRU_NONE) return;
0 181 if (victim == HM_LRU_NONE) return;
0 2674 if (victim == HM_LRU_NONE) return;
0 1 if (victim == HM_LRU_NONE) return;
0 1 if (victim == HM_LRU_NONE) return;
0 181 if (victim == HM_LRU_NONE) return;
0 1 if (victim == HM_LRU_NONE) return;
281 0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 0 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
2 13 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 0 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
283 1 2 if (may_compact &&
1 2 if (may_compact &&
1 1 if (may_compact &&
1 1 if (may_compact &&
0 1 if (may_compact &&
0 0 if (may_compact &&
0 2 if (may_compact &&
0 1 if (may_compact &&
0 1 if (may_compact &&
3 12 if (may_compact &&
0 1 if (may_compact &&
0 2 if (may_compact &&
0 0 if (may_compact &&
0 1 if (may_compact &&
284 1 0 (map->tombstones > map->capacity / 4 ||
1 0 (map->tombstones > map->capacity / 4 ||
1 0 (map->tombstones > map->capacity / 4 ||
1 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
3 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
0 0 (map->tombstones > map->capacity / 4 ||
285 0 1 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 1 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 1 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 1 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 3 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
0 0 (map->size > 0 && map->tombstones > map->size))) {
294 0 44 if (!map) return NULL;
0 47 if (!map) return NULL;
0 15 if (!map) return NULL;
0 15 if (!map) return NULL;
0 15 if (!map) return NULL;
0 13 if (!map) return NULL;
0 57 if (!map) return NULL;
0 25 if (!map) return NULL;
0 33 if (!map) return NULL;
0 74 if (!map) return NULL;
0 21 if (!map) return NULL;
0 14 if (!map) return NULL;
0 14 if (!map) return NULL;
0 19 if (!map) return NULL;
313 0 44 if (!map->nodes) { free(map); return NULL; }
0 47 if (!map->nodes) { free(map); return NULL; }
0 15 if (!map->nodes) { free(map); return NULL; }
0 15 if (!map->nodes) { free(map); return NULL; }
0 15 if (!map->nodes) { free(map); return NULL; }
0 13 if (!map->nodes) { free(map); return NULL; }
0 57 if (!map->nodes) { free(map); return NULL; }
0 25 if (!map->nodes) { free(map); return NULL; }
0 33 if (!map->nodes) { free(map); return NULL; }
0 74 if (!map->nodes) { free(map); return NULL; }
0 21 if (!map->nodes) { free(map); return NULL; }
0 14 if (!map->nodes) { free(map); return NULL; }
0 14 if (!map->nodes) { free(map); return NULL; }
0 19 if (!map->nodes) { free(map); return NULL; }
316 6 38 if (max_size > 0) {
4 43 if (max_size > 0) {
2 13 if (max_size > 0) {
2 13 if (max_size > 0) {
1 14 if (max_size > 0) {
3 10 if (max_size > 0) {
5 52 if (max_size > 0) {
1 24 if (max_size > 0) {
3 30 if (max_size > 0) {
21 53 if (max_size > 0) {
1 20 if (max_size > 0) {
1 13 if (max_size > 0) {
3 11 if (max_size > 0) {
1 18 if (max_size > 0) {
319 6 0 if (!map->lru_prev || !map->lru_next) {
0 6 if (!map->lru_prev || !map->lru_next) {
4 0 if (!map->lru_prev || !map->lru_next) {
0 4 if (!map->lru_prev || !map->lru_next) {
2 0 if (!map->lru_prev || !map->lru_next) {
0 2 if (!map->lru_prev || !map->lru_next) {
2 0 if (!map->lru_prev || !map->lru_next) {
0 2 if (!map->lru_prev || !map->lru_next) {
1 0 if (!map->lru_prev || !map->lru_next) {
0 1 if (!map->lru_prev || !map->lru_next) {
3 0 if (!map->lru_prev || !map->lru_next) {
0 3 if (!map->lru_prev || !map->lru_next) {
5 0 if (!map->lru_prev || !map->lru_next) {
0 5 if (!map->lru_prev || !map->lru_next) {
1 0 if (!map->lru_prev || !map->lru_next) {
0 1 if (!map->lru_prev || !map->lru_next) {
3 0 if (!map->lru_prev || !map->lru_next) {
0 3 if (!map->lru_prev || !map->lru_next) {
21 0 if (!map->lru_prev || !map->lru_next) {
0 21 if (!map->lru_prev || !map->lru_next) {
1 0 if (!map->lru_prev || !map->lru_next) {
0 1 if (!map->lru_prev || !map->lru_next) {
1 0 if (!map->lru_prev || !map->lru_next) {
0 1 if (!map->lru_prev || !map->lru_next) {
3 0 if (!map->lru_prev || !map->lru_next) {
0 3 if (!map->lru_prev || !map->lru_next) {
1 0 if (!map->lru_prev || !map->lru_next) {
0 1 if (!map->lru_prev || !map->lru_next) {
328 4 40 if (default_ttl > 0) {
4 43 if (default_ttl > 0) {
2 13 if (default_ttl > 0) {
2 13 if (default_ttl > 0) {
0 15 if (default_ttl > 0) {
0 13 if (default_ttl > 0) {
5 52 if (default_ttl > 0) {
1 24 if (default_ttl > 0) {
1 32 if (default_ttl > 0) {
18 56 if (default_ttl > 0) {
0 21 if (default_ttl > 0) {
1 13 if (default_ttl > 0) {
0 14 if (default_ttl > 0) {
1 18 if (default_ttl > 0) {
330 0 4 if (!map->expires_at) {
0 4 if (!map->expires_at) {
0 2 if (!map->expires_at) {
0 2 if (!map->expires_at) {
0 0 if (!map->expires_at) {
0 0 if (!map->expires_at) {
0 5 if (!map->expires_at) {
0 1 if (!map->expires_at) {
0 1 if (!map->expires_at) {
0 18 if (!map->expires_at) {
0 0 if (!map->expires_at) {
0 1 if (!map->expires_at) {
0 0 if (!map->expires_at) {
0 1 if (!map->expires_at) {
341 0 44 if (!map) return;
0 47 if (!map) return;
0 15 if (!map) return;
0 15 if (!map) return;
0 15 if (!map) return;
0 13 if (!map) return;
0 57 if (!map) return;
0 25 if (!map) return;
0 33 if (!map) return;
0 74 if (!map) return;
0 21 if (!map) return;
0 14 if (!map) return;
0 14 if (!map) return;
0 19 if (!map) return;
345 149760 44 for (i = 0; i < map->capacity; i++) {
151248 47 for (i = 0; i < map->capacity; i++) {
65792 15 for (i = 0; i < map->capacity; i++) {
131520 15 for (i = 0; i < map->capacity; i++) {
148144 15 for (i = 0; i < map->capacity; i++) {
148112 13 for (i = 0; i < map->capacity; i++) {
151920 57 for (i = 0; i < map->capacity; i++) {
148304 25 for (i = 0; i < map->capacity; i++) {
149776 33 for (i = 0; i < map->capacity; i++) {
147872 14 for (i = 0; i < map->capacity; i++) {
82336 14 for (i = 0; i < map->capacity; i++) {
346 648 149112 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
629 19 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
1042 150206 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
1024 18 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
25 65767 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
18 7 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
25 131495 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
18 7 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
27 148117 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
21 6 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
39 148073 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
30 9 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
1090 150830 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
1072 18 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
40 148264 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
35 5 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
553 149223 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
539 14 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
26 147846 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
20 6 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
39 82297 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
30 9 if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
362 0 3 if (!map) return;
0 7 if (!map) return;
0 3 if (!map) return;
0 3 if (!map) return;
0 2 if (!map) return;
0 3 if (!map) return;
0 9 if (!map) return;
0 2 if (!map) return;
0 2 if (!map) return;
0 8 if (!map) return;
0 3 if (!map) return;
0 2 if (!map) return;
0 3 if (!map) return;
0 3 if (!map) return;
366 272 3 for (i = 0; i < map->capacity; i++) {
784 7 for (i = 0; i < map->capacity; i++) {
80 3 for (i = 0; i < map->capacity; i++) {
272 3 for (i = 0; i < map->capacity; i++) {
512 2 for (i = 0; i < map->capacity; i++) {
528 3 for (i = 0; i < map->capacity; i++) {
1296 9 for (i = 0; i < map->capacity; i++) {
512 2 for (i = 0; i < map->capacity; i++) {
512 2 for (i = 0; i < map->capacity; i++) {
256 2 for (i = 0; i < map->capacity; i++) {
272 3 for (i = 0; i < map->capacity; i++) {
367 101 171 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
99 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
301 483 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
299 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
41 39 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
39 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
101 171 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
99 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
200 312 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
198 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
201 327 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
199 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
501 795 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
497 4 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
200 312 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
198 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
200 312 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
198 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
100 156 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
98 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
101 171 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
99 2 if (HM_SLOT_IS_LIVE(&map->nodes[i]))
376 0 3 if (map->lru_prev) {
0 7 if (map->lru_prev) {
0 3 if (map->lru_prev) {
0 3 if (map->lru_prev) {
0 2 if (map->lru_prev) {
0 3 if (map->lru_prev) {
0 9 if (map->lru_prev) {
0 2 if (map->lru_prev) {
0 2 if (map->lru_prev) {
1 7 if (map->lru_prev) {
0 3 if (map->lru_prev) {
0 2 if (map->lru_prev) {
0 3 if (map->lru_prev) {
0 3 if (map->lru_prev) {
382 0 3 if (map->expires_at)
4 3 if (map->expires_at)
0 3 if (map->expires_at)
0 3 if (map->expires_at)
0 2 if (map->expires_at)
0 3 if (map->expires_at)
4 5 if (map->expires_at)
0 2 if (map->expires_at)
0 2 if (map->expires_at)
3 5 if (map->expires_at)
0 3 if (map->expires_at)
0 2 if (map->expires_at)
0 3 if (map->expires_at)
0 3 if (map->expires_at)
392 69 192 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
91 156 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
14 13 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
19 14 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
31 50 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
31 116 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
101 192 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
31 50 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
67 124 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
58 320 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
32 79 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
29 50 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
28 115 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
37 73 size_t new_capacity = grow ? old_capacity * 2 : old_capacity;
395 0 261 if (!new_nodes) return false;
0 247 if (!new_nodes) return false;
0 27 if (!new_nodes) return false;
0 33 if (!new_nodes) return false;
0 81 if (!new_nodes) return false;
0 147 if (!new_nodes) return false;
0 293 if (!new_nodes) return false;
0 81 if (!new_nodes) return false;
0 191 if (!new_nodes) return false;
0 378 if (!new_nodes) return false;
0 111 if (!new_nodes) return false;
0 79 if (!new_nodes) return false;
0 143 if (!new_nodes) return false;
0 110 if (!new_nodes) return false;
401 104 157 if (map->lru_prev) {
66 181 if (map->lru_prev) {
0 27 if (map->lru_prev) {
0 33 if (map->lru_prev) {
0 81 if (map->lru_prev) {
66 81 if (map->lru_prev) {
104 189 if (map->lru_prev) {
0 81 if (map->lru_prev) {
66 125 if (map->lru_prev) {
217 161 if (map->lru_prev) {
0 111 if (map->lru_prev) {
0 79 if (map->lru_prev) {
66 77 if (map->lru_prev) {
0 110 if (map->lru_prev) {
402 0 104 if (new_capacity > (size_t)(uint32_t)-2) {
0 66 if (new_capacity > (size_t)(uint32_t)-2) {
0 0 if (new_capacity > (size_t)(uint32_t)-2) {
0 0 if (new_capacity > (size_t)(uint32_t)-2) {
0 0 if (new_capacity > (size_t)(uint32_t)-2) {
0 66 if (new_capacity > (size_t)(uint32_t)-2) {
0 104 if (new_capacity > (size_t)(uint32_t)-2) {
0 0 if (new_capacity > (size_t)(uint32_t)-2) {
0 66 if (new_capacity > (size_t)(uint32_t)-2) {
0 217 if (new_capacity > (size_t)(uint32_t)-2) {
0 0 if (new_capacity > (size_t)(uint32_t)-2) {
0 0 if (new_capacity > (size_t)(uint32_t)-2) {
0 66 if (new_capacity > (size_t)(uint32_t)-2) {
0 0 if (new_capacity > (size_t)(uint32_t)-2) {
409 104 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
104 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 104 if (!new_lru_prev || !new_lru_next || !old_to_new) {
66 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
66 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 66 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
66 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
66 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 66 if (!new_lru_prev || !new_lru_next || !old_to_new) {
104 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
104 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 104 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
66 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
66 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 66 if (!new_lru_prev || !new_lru_next || !old_to_new) {
217 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
217 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 217 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
66 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
66 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 66 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
0 0 if (!new_lru_prev || !new_lru_next || !old_to_new) {
420 34 227 if (map->expires_at) {
12 235 if (map->expires_at) {
0 27 if (map->expires_at) {
0 33 if (map->expires_at) {
0 81 if (map->expires_at) {
0 147 if (map->expires_at) {
46 247 if (map->expires_at) {
0 81 if (map->expires_at) {
0 191 if (map->expires_at) {
8 370 if (map->expires_at) {
0 111 if (map->expires_at) {
0 79 if (map->expires_at) {
0 143 if (map->expires_at) {
0 110 if (map->expires_at) {
422 0 34 if (!new_expires_at) {
0 12 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 46 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 8 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 0 if (!new_expires_at) {
0 0 if (!new_expires_at) {
433 2581152 261 for (i = 0; i < old_capacity; i++) {
2581504 247 for (i = 0; i < old_capacity; i++) {
917520 27 for (i = 0; i < old_capacity; i++) {
1966288 33 for (i = 0; i < old_capacity; i++) {
2572736 81 for (i = 0; i < old_capacity; i++) {
2573792 147 for (i = 0; i < old_capacity; i++) {
2583104 293 for (i = 0; i < old_capacity; i++) {
2572736 81 for (i = 0; i < old_capacity; i++) {
2576160 191 for (i = 0; i < old_capacity; i++) {
10182528 378 for (i = 0; i < old_capacity; i++) {
4129216 111 for (i = 0; i < old_capacity; i++) {
2572480 79 for (i = 0; i < old_capacity; i++) {
1524960 143 for (i = 0; i < old_capacity; i++) {
1919408 110 for (i = 0; i < old_capacity; i++) {
434 279644 2301508 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
198901 80743 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
279908 2301596 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
199301 80607 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
109141 808379 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
79143 29998 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
198437 1767851 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
148439 49998 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
276272 2296464 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
196277 79995 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
277064 2296728 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
196937 80127 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
281108 2301996 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
200365 80743 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
276272 2296464 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
196277 79995 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
278252 2297908 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
198029 80223 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
878491 9304037 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
596692 281799 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
441173 3688043 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
291180 149993 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
276080 2296400 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
196085 79995 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
187720 1337240 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
127593 60127 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
232222 1687186 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
152229 79993 if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
437 44525 199301 while (new_nodes[index].key != HM_EMPTY_KEY)
17686 79143 while (new_nodes[index].key != HM_EMPTY_KEY)
33161 148439 while (new_nodes[index].key != HM_EMPTY_KEY)
43841 196937 while (new_nodes[index].key != HM_EMPTY_KEY)
44217 198029 while (new_nodes[index].key != HM_EMPTY_KEY)
118776 596692 while (new_nodes[index].key != HM_EMPTY_KEY)
61423 291180 while (new_nodes[index].key != HM_EMPTY_KEY)
28388 127593 while (new_nodes[index].key != HM_EMPTY_KEY)
32931 152229 while (new_nodes[index].key != HM_EMPTY_KEY)
441 44972 198901 while (new_nodes[index].key != NULL)
44460 196277 while (new_nodes[index].key != NULL)
45282 200365 while (new_nodes[index].key != NULL)
44460 196277 while (new_nodes[index].key != NULL)
44420 196085 while (new_nodes[index].key != NULL)
445 1364 197537 if (old_to_new) old_to_new[i] = (uint32_t)index;
660 198641 if (old_to_new) old_to_new[i] = (uint32_t)index;
0 79143 if (old_to_new) old_to_new[i] = (uint32_t)index;
0 148439 if (old_to_new) old_to_new[i] = (uint32_t)index;
0 196277 if (old_to_new) old_to_new[i] = (uint32_t)index;
660 196277 if (old_to_new) old_to_new[i] = (uint32_t)index;
1364 199001 if (old_to_new) old_to_new[i] = (uint32_t)index;
0 196277 if (old_to_new) old_to_new[i] = (uint32_t)index;
660 197369 if (old_to_new) old_to_new[i] = (uint32_t)index;
3692 593000 if (old_to_new) old_to_new[i] = (uint32_t)index;
0 291180 if (old_to_new) old_to_new[i] = (uint32_t)index;
0 196085 if (old_to_new) old_to_new[i] = (uint32_t)index;
660 126933 if (old_to_new) old_to_new[i] = (uint32_t)index;
0 152229 if (old_to_new) old_to_new[i] = (uint32_t)index;
446 664 198237 if (new_expires_at)
336 198965 if (new_expires_at)
0 79143 if (new_expires_at)
0 148439 if (new_expires_at)
0 196277 if (new_expires_at)
0 196937 if (new_expires_at)
1000 199365 if (new_expires_at)
0 196277 if (new_expires_at)
0 198029 if (new_expires_at)
204 596488 if (new_expires_at)
0 291180 if (new_expires_at)
0 196085 if (new_expires_at)
0 127593 if (new_expires_at)
0 152229 if (new_expires_at)
453 104 157 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
104 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
66 181 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
66 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 27 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 33 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 81 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
66 81 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
66 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
104 189 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
104 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 81 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
66 125 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
66 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
217 161 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
217 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 111 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 79 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
66 77 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
66 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 110 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
0 0 if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
459 1364 104 while (old_idx != HM_LRU_NONE) {
660 66 while (old_idx != HM_LRU_NONE) {
0 0 while (old_idx != HM_LRU_NONE) {
0 0 while (old_idx != HM_LRU_NONE) {
0 0 while (old_idx != HM_LRU_NONE) {
660 66 while (old_idx != HM_LRU_NONE) {
1364 104 while (old_idx != HM_LRU_NONE) {
0 0 while (old_idx != HM_LRU_NONE) {
660 66 while (old_idx != HM_LRU_NONE) {
3692 217 while (old_idx != HM_LRU_NONE) {
0 0 while (old_idx != HM_LRU_NONE) {
0 0 while (old_idx != HM_LRU_NONE) {
660 66 while (old_idx != HM_LRU_NONE) {
0 0 while (old_idx != HM_LRU_NONE) {
462 1364 0 if (ni != HM_LRU_NONE) {
660 0 if (ni != HM_LRU_NONE) {
0 0 if (ni != HM_LRU_NONE) {
0 0 if (ni != HM_LRU_NONE) {
0 0 if (ni != HM_LRU_NONE) {
660 0 if (ni != HM_LRU_NONE) {
1364 0 if (ni != HM_LRU_NONE) {
0 0 if (ni != HM_LRU_NONE) {
660 0 if (ni != HM_LRU_NONE) {
3692 0 if (ni != HM_LRU_NONE) {
0 0 if (ni != HM_LRU_NONE) {
0 0 if (ni != HM_LRU_NONE) {
660 0 if (ni != HM_LRU_NONE) {
0 0 if (ni != HM_LRU_NONE) {
465 1260 104 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
594 66 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
0 0 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
0 0 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
0 0 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
594 66 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
1260 104 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
0 0 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
594 66 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
3475 217 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
0 0 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
0 0 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
594 66 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
0 0 if (prev_new != HM_LRU_NONE) new_lru_next[prev_new] = ni;
478 0 157 } else if (map->lru_prev) {
0 181 } else if (map->lru_prev) {
0 27 } else if (map->lru_prev) {
0 33 } else if (map->lru_prev) {
0 81 } else if (map->lru_prev) {
0 81 } else if (map->lru_prev) {
0 189 } else if (map->lru_prev) {
0 81 } else if (map->lru_prev) {
0 125 } else if (map->lru_prev) {
0 161 } else if (map->lru_prev) {
0 111 } else if (map->lru_prev) {
0 79 } else if (map->lru_prev) {
0 77 } else if (map->lru_prev) {
0 110 } else if (map->lru_prev) {
485 34 227 if (map->expires_at) {
12 235 if (map->expires_at) {
0 27 if (map->expires_at) {
0 33 if (map->expires_at) {
0 81 if (map->expires_at) {
0 147 if (map->expires_at) {
46 247 if (map->expires_at) {
0 81 if (map->expires_at) {
0 191 if (map->expires_at) {
8 370 if (map->expires_at) {
0 111 if (map->expires_at) {
0 79 if (map->expires_at) {
0 143 if (map->expires_at) {
0 110 if (map->expires_at) {
518 130525 22155 if (k == key) return index;
60019 15331 if (k == key) return index;
100019 18811 if (k == key) return index;
130012 22076 if (k == key) return index;
130116 22095 if (k == key) return index;
400193 52672 if (k == key) return index;
200029 29720 if (k == key) return index;
90012 18597 if (k == key) return index;
110033 20784 if (k == key) return index;
519 6 22149 if (k == HM_EMPTY_KEY) return index;
5 15326 if (k == HM_EMPTY_KEY) return index;
5 18806 if (k == HM_EMPTY_KEY) return index;
4 22072 if (k == HM_EMPTY_KEY) return index;
5 22090 if (k == HM_EMPTY_KEY) return index;
26 52646 if (k == HM_EMPTY_KEY) return index;
10 29710 if (k == HM_EMPTY_KEY) return index;
5 18592 if (k == HM_EMPTY_KEY) return index;
12 20772 if (k == HM_EMPTY_KEY) return index;
521 22149 0 } while (HM_LIKELY(index != original_index));
15326 0 } while (HM_LIKELY(index != original_index));
18806 0 } while (HM_LIKELY(index != original_index));
22072 0 } while (HM_LIKELY(index != original_index));
22090 0 } while (HM_LIKELY(index != original_index));
52646 0 } while (HM_LIKELY(index != original_index));
29710 0 } while (HM_LIKELY(index != original_index));
18592 0 } while (HM_LIKELY(index != original_index));
20772 0 } while (HM_LIKELY(index != original_index));
535 5 153670 if (nodes[index].key == NULL) return index; /* empty */
9 153136 if (nodes[index].key == NULL) return index; /* empty */
7 153668 if (nodes[index].key == NULL) return index; /* empty */
14 173147 if (nodes[index].key == NULL) return index; /* empty */
10 153138 if (nodes[index].key == NULL) return index; /* empty */
536 146203 7467 if (nodes[index].key != HM_STR_TOMBSTONE &&
145699 7437 if (nodes[index].key != HM_STR_TOMBSTONE &&
146201 7467 if (nodes[index].key != HM_STR_TOMBSTONE &&
165708 7439 if (nodes[index].key != HM_STR_TOMBSTONE &&
145700 7438 if (nodes[index].key != HM_STR_TOMBSTONE &&
537 130529 15674 nodes[index].key_hash == key_hash &&
130029 15670 nodes[index].key_hash == key_hash &&
130532 15669 nodes[index].key_hash == key_hash &&
150037 15671 nodes[index].key_hash == key_hash &&
130030 15670 nodes[index].key_hash == key_hash &&
538 2 130527 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
130529 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
1 130028 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
130029 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
5 130527 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
130532 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
1 150036 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
150037 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
2 130028 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
130030 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
539 130529 0 memcmp(nodes[index].key, key, key_len) == 0) {
130029 0 memcmp(nodes[index].key, key, key_len) == 0) {
130532 0 memcmp(nodes[index].key, key, key_len) == 0) {
150037 0 memcmp(nodes[index].key, key, key_len) == 0) {
130030 0 memcmp(nodes[index].key, key, key_len) == 0) {
543 23141 0 } while (HM_LIKELY(index != original_index));
23107 0 } while (HM_LIKELY(index != original_index));
23136 0 } while (HM_LIKELY(index != original_index));
23110 0 } while (HM_LIKELY(index != original_index));
23108 0 } while (HM_LIKELY(index != original_index));
562 8 270734 if (k == key) {
3 108688 if (k == key) {
3 193371 if (k == key) {
1 266881 if (k == key) {
8 268558 if (k == key) {
11 916003 if (k == key) {
2 405845 if (k == key) {
1 182162 if (k == key) {
2 221151 if (k == key) {
566 82196 188538 if (k == HM_EMPTY_KEY) {
30067 78621 if (k == HM_EMPTY_KEY) {
50127 143244 if (k == HM_EMPTY_KEY) {
80594 186287 if (k == HM_EMPTY_KEY) {
81203 187355 if (k == HM_EMPTY_KEY) {
385941 530062 if (k == HM_EMPTY_KEY) {
150225 255620 if (k == HM_EMPTY_KEY) {
60494 121668 if (k == HM_EMPTY_KEY) {
81226 139925 if (k == HM_EMPTY_KEY) {
568 71 82125 return (first_tombstone < map->capacity) ? first_tombstone : index;
1 30066 return (first_tombstone < map->capacity) ? first_tombstone : index;
1 50126 return (first_tombstone < map->capacity) ? first_tombstone : index;
54 80540 return (first_tombstone < map->capacity) ? first_tombstone : index;
54 81149 return (first_tombstone < map->capacity) ? first_tombstone : index;
1579 384362 return (first_tombstone < map->capacity) ? first_tombstone : index;
4 150221 return (first_tombstone < map->capacity) ? first_tombstone : index;
54 60440 return (first_tombstone < map->capacity) ? first_tombstone : index;
5 81221 return (first_tombstone < map->capacity) ? first_tombstone : index;
570 73 188465 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
71 2 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
1 78620 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
1 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
1 143243 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
1 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
56 186231 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
54 2 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
56 187299 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
54 2 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
3163 526899 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
1579 1584 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
4 255616 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
4 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
56 121612 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
54 2 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
5 139920 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
5 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
574 188538 0 } while (index != original_index);
78621 0 } while (index != original_index);
143244 0 } while (index != original_index);
186287 0 } while (index != original_index);
187355 0 } while (index != original_index);
530062 0 } while (index != original_index);
255620 0 } while (index != original_index);
121668 0 } while (index != original_index);
139925 0 } while (index != original_index);
591 81919 172458 if (nodes[index].key == NULL) {
80221 170739 if (nodes[index].key == NULL) {
82760 173895 if (nodes[index].key == NULL) {
80231 170743 if (nodes[index].key == NULL) {
80120 170459 if (nodes[index].key == NULL) {
593 117 81802 return (first_tombstone < map->capacity) ? first_tombstone : index;
2 80219 return (first_tombstone < map->capacity) ? first_tombstone : index;
117 82643 return (first_tombstone < map->capacity) ? first_tombstone : index;
2 80229 return (first_tombstone < map->capacity) ? first_tombstone : index;
2 80118 return (first_tombstone < map->capacity) ? first_tombstone : index;
595 135 172323 if (nodes[index].key == HM_STR_TOMBSTONE) {
2 170737 if (nodes[index].key == HM_STR_TOMBSTONE) {
135 173760 if (nodes[index].key == HM_STR_TOMBSTONE) {
2 170741 if (nodes[index].key == HM_STR_TOMBSTONE) {
2 170457 if (nodes[index].key == HM_STR_TOMBSTONE) {
596 117 18 if (first_tombstone >= map->capacity) first_tombstone = index;
2 0 if (first_tombstone >= map->capacity) first_tombstone = index;
117 18 if (first_tombstone >= map->capacity) first_tombstone = index;
2 0 if (first_tombstone >= map->capacity) first_tombstone = index;
2 0 if (first_tombstone >= map->capacity) first_tombstone = index;
597 8 172315 } else if (nodes[index].key_hash == key_hash &&
1 170736 } else if (nodes[index].key_hash == key_hash &&
9 173751 } else if (nodes[index].key_hash == key_hash &&
4 170737 } else if (nodes[index].key_hash == key_hash &&
1 170456 } else if (nodes[index].key_hash == key_hash &&
598 0 8 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
8 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 1 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
1 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 9 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
9 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 4 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
4 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 1 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
1 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
599 8 0 memcmp(nodes[index].key, key, key_len) == 0) {
1 0 memcmp(nodes[index].key, key, key_len) == 0) {
9 0 memcmp(nodes[index].key, key, key_len) == 0) {
4 0 memcmp(nodes[index].key, key, key_len) == 0) {
1 0 memcmp(nodes[index].key, key, key_len) == 0) {
604 172450 0 } while (index != original_index);
170738 0 } while (index != original_index);
173886 0 } while (index != original_index);
170739 0 } while (index != original_index);
170458 0 } while (index != original_index);
625 82018 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
82017 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 82016 if (!map || HM_IS_RESERVED_KEY(key)) return false;
30067 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
30066 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 30065 if (!map || HM_IS_RESERVED_KEY(key)) return false;
50127 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
50126 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 50125 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80416 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80415 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 80414 if (!map || HM_IS_RESERVED_KEY(key)) return false;
81023 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
81022 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 81021 if (!map || HM_IS_RESERVED_KEY(key)) return false;
383265 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
383264 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 383263 if (!map || HM_IS_RESERVED_KEY(key)) return false;
150226 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
150225 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 150224 if (!map || HM_IS_RESERVED_KEY(key)) return false;
60315 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
60314 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 60313 if (!map || HM_IS_RESERVED_KEY(key)) return false;
81227 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
81226 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 81225 if (!map || HM_IS_RESERVED_KEY(key)) return false;
627 157 81859 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
14 30051 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
19 50106 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
97 80317 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
133 80888 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
270 382993 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
32 150192 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
94 60219 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
37 81188 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
628 66 91 if (map->max_size > 0 && map->tombstones > 0) {
66 0 if (map->max_size > 0 && map->tombstones > 0) {
0 14 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 19 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
66 31 if (map->max_size > 0 && map->tombstones > 0) {
66 0 if (map->max_size > 0 && map->tombstones > 0) {
66 67 if (map->max_size > 0 && map->tombstones > 0) {
66 0 if (map->max_size > 0 && map->tombstones > 0) {
217 53 if (map->max_size > 0 && map->tombstones > 0) {
212 5 if (map->max_size > 0 && map->tombstones > 0) {
0 32 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
66 28 if (map->max_size > 0 && map->tombstones > 0) {
66 0 if (map->max_size > 0 && map->tombstones > 0) {
0 37 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
629 0 66 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 66 if (!HM_FN(compact)(map)) return false;
0 66 if (!HM_FN(compact)(map)) return false;
0 212 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 66 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
631 0 91 if (!HM_FN(resize)(map)) return false;
0 14 if (!HM_FN(resize)(map)) return false;
0 19 if (!HM_FN(resize)(map)) return false;
0 31 if (!HM_FN(resize)(map)) return false;
0 67 if (!HM_FN(resize)(map)) return false;
0 58 if (!HM_FN(resize)(map)) return false;
0 32 if (!HM_FN(resize)(map)) return false;
0 28 if (!HM_FN(resize)(map)) return false;
0 37 if (!HM_FN(resize)(map)) return false;
637 0 82016 if (index >= map->capacity) return false;
0 30065 if (index >= map->capacity) return false;
0 50125 if (index >= map->capacity) return false;
0 80414 if (index >= map->capacity) return false;
0 81021 if (index >= map->capacity) return false;
0 383263 if (index >= map->capacity) return false;
0 150224 if (index >= map->capacity) return false;
0 60313 if (index >= map->capacity) return false;
0 81225 if (index >= map->capacity) return false;
640 82010 6 if (!found && map->max_size > 0 && map->size >= map->max_size) {
209 81801 if (!found && map->max_size > 0 && map->size >= map->max_size) {
183 26 if (!found && map->max_size > 0 && map->size >= map->max_size) {
30063 2 if (!found && map->max_size > 0 && map->size >= map->max_size) {
8 30055 if (!found && map->max_size > 0 && map->size >= map->max_size) {
2 6 if (!found && map->max_size > 0 && map->size >= map->max_size) {
50123 2 if (!found && map->max_size > 0 && map->size >= map->max_size) {
8 50115 if (!found && map->max_size > 0 && map->size >= map->max_size) {
2 6 if (!found && map->max_size > 0 && map->size >= map->max_size) {
80413 1 if (!found && map->max_size > 0 && map->size >= map->max_size) {
203 80210 if (!found && map->max_size > 0 && map->size >= map->max_size) {
181 22 if (!found && map->max_size > 0 && map->size >= map->max_size) {
81016 5 if (!found && map->max_size > 0 && map->size >= map->max_size) {
203 80813 if (!found && map->max_size > 0 && map->size >= map->max_size) {
181 22 if (!found && map->max_size > 0 && map->size >= map->max_size) {
383257 6 if (!found && map->max_size > 0 && map->size >= map->max_size) {
2869 380388 if (!found && map->max_size > 0 && map->size >= map->max_size) {
2672 197 if (!found && map->max_size > 0 && map->size >= map->max_size) {
150223 1 if (!found && map->max_size > 0 && map->size >= map->max_size) {
4 150219 if (!found && map->max_size > 0 && map->size >= map->max_size) {
1 3 if (!found && map->max_size > 0 && map->size >= map->max_size) {
60312 1 if (!found && map->max_size > 0 && map->size >= map->max_size) {
203 60109 if (!found && map->max_size > 0 && map->size >= map->max_size) {
181 22 if (!found && map->max_size > 0 && map->size >= map->max_size) {
81224 1 if (!found && map->max_size > 0 && map->size >= map->max_size) {
4 81220 if (!found && map->max_size > 0 && map->size >= map->max_size) {
1 3 if (!found && map->max_size > 0 && map->size >= map->max_size) {
644 0 183 if (index >= map->capacity) return false;
0 2 if (index >= map->capacity) return false;
0 2 if (index >= map->capacity) return false;
0 181 if (index >= map->capacity) return false;
0 181 if (index >= map->capacity) return false;
0 2672 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
0 181 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
648 101 81915 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
3 98 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 30065 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 50125 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 80414 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 81021 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
107 383156 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
8 99 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1 150223 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 60313 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 81225 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
650 0 3 if (!map->expires_at) return false;
0 0 if (!map->expires_at) return false;
0 0 if (!map->expires_at) return false;
0 0 if (!map->expires_at) return false;
0 0 if (!map->expires_at) return false;
0 8 if (!map->expires_at) return false;
0 1 if (!map->expires_at) return false;
0 0 if (!map->expires_at) return false;
0 0 if (!map->expires_at) return false;
657 80414 0 if (value && val_len > 0) {
80413 1 if (value && val_len > 0) {
81021 0 if (value && val_len > 0) {
81020 1 if (value && val_len > 0) {
60313 0 if (value && val_len > 0) {
60313 0 if (value && val_len > 0) {
659 0 80413 if (!new_val) return false;
0 81020 if (!new_val) return false;
0 60313 if (!new_val) return false;
662 1 80412 new_val_len = HM_PACK_LEN(val_len, val_utf8);
101 80919 new_val_len = HM_PACK_LEN(val_len, val_utf8);
1 60312 new_val_len = HM_PACK_LEN(val_len, val_utf8);
663 1 0 } else if (value) {
1 0 } else if (value) {
0 0 } else if (value) {
665 0 1 if (!new_val) return false;
0 1 if (!new_val) return false;
0 0 if (!new_val) return false;
667 0 1 new_val_len = HM_PACK_LEN(0, val_utf8);
0 1 new_val_len = HM_PACK_LEN(0, val_utf8);
0 0 new_val_len = HM_PACK_LEN(0, val_utf8);
671 6 82010 if (found) {
2 30063 if (found) {
2 50123 if (found) {
1 80413 if (found) {
5 81016 if (found) {
383257 6 if (found) {
150223 1 if (found) {
1 60312 if (found) {
81224 1 if (found) {
673 1 0 if (map->nodes[index].value) free(map->nodes[index].value);
5 0 if (map->nodes[index].value) free(map->nodes[index].value);
1 0 if (map->nodes[index].value) free(map->nodes[index].value);
675 6 0 if (map->nodes[index].value && map->free_value_fn)
6 0 if (map->nodes[index].value && map->free_value_fn)
2 0 if (map->nodes[index].value && map->free_value_fn)
2 0 if (map->nodes[index].value && map->free_value_fn)
2 0 if (map->nodes[index].value && map->free_value_fn)
2 0 if (map->nodes[index].value && map->free_value_fn)
679 62 81948 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
0 30063 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
0 50123 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
46 80367 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
46 80970 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
848 382409 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
4 150219 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
46 60266 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
5 81219 if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
694 209 81807 if (HM_UNLIKELY(map->lru_prev)) {
8 30057 if (HM_UNLIKELY(map->lru_prev)) {
8 50117 if (HM_UNLIKELY(map->lru_prev)) {
203 80211 if (HM_UNLIKELY(map->lru_prev)) {
203 80818 if (HM_UNLIKELY(map->lru_prev)) {
2872 380391 if (HM_UNLIKELY(map->lru_prev)) {
4 150220 if (HM_UNLIKELY(map->lru_prev)) {
203 60110 if (HM_UNLIKELY(map->lru_prev)) {
4 81221 if (HM_UNLIKELY(map->lru_prev)) {
695 0 209 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 8 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 8 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 203 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 203 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
3 2869 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 4 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 203 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 4 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
699 203 81813 if (map->expires_at) {
1 30064 if (map->expires_at) {
1 50124 if (map->expires_at) {
0 80414 if (map->expires_at) {
1 81020 if (map->expires_at) {
161 383102 if (map->expires_at) {
1 150223 if (map->expires_at) {
0 60313 if (map->expires_at) {
1 81224 if (map->expires_at) {
700 102 101 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
0 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
54 107 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
0 1 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
0 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
701 203 0 if (ttl > 0)
1 0 if (ttl > 0)
1 0 if (ttl > 0)
0 0 if (ttl > 0)
1 0 if (ttl > 0)
158 3 if (ttl > 0)
1 0 if (ttl > 0)
0 0 if (ttl > 0)
1 0 if (ttl > 0)
722 81580 0 if (!map || !key) return false;
0 81580 if (!map || !key) return false;
80220 0 if (!map || !key) return false;
0 80220 if (!map || !key) return false;
82419 0 if (!map || !key) return false;
0 82419 if (!map || !key) return false;
80226 0 if (!map || !key) return false;
0 80226 if (!map || !key) return false;
80120 0 if (!map || !key) return false;
0 80120 if (!map || !key) return false;
724 171 81409 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
31 80189 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
203 82216 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
31 80195 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
29 80091 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
725 104 67 if (map->max_size > 0 && map->tombstones > 0) {
102 2 if (map->max_size > 0 && map->tombstones > 0) {
0 31 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
104 99 if (map->max_size > 0 && map->tombstones > 0) {
102 2 if (map->max_size > 0 && map->tombstones > 0) {
0 31 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 29 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
726 0 102 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 102 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
728 0 69 if (!HM_FN(resize)(map)) return false;
0 31 if (!HM_FN(resize)(map)) return false;
0 101 if (!HM_FN(resize)(map)) return false;
0 31 if (!HM_FN(resize)(map)) return false;
0 29 if (!HM_FN(resize)(map)) return false;
734 0 81580 if (index >= map->capacity) return false;
0 80220 if (index >= map->capacity) return false;
0 82419 if (index >= map->capacity) return false;
0 80226 if (index >= map->capacity) return false;
0 80120 if (index >= map->capacity) return false;
737 81574 6 if (!found && map->max_size > 0 && map->size >= map->max_size) {
408 81166 if (!found && map->max_size > 0 && map->size >= map->max_size) {
342 66 if (!found && map->max_size > 0 && map->size >= map->max_size) {
80219 1 if (!found && map->max_size > 0 && map->size >= map->max_size) {
3 80216 if (!found && map->max_size > 0 && map->size >= map->max_size) {
1 2 if (!found && map->max_size > 0 && map->size >= map->max_size) {
82413 6 if (!found && map->max_size > 0 && map->size >= map->max_size) {
404 82009 if (!found && map->max_size > 0 && map->size >= map->max_size) {
341 63 if (!found && map->max_size > 0 && map->size >= map->max_size) {
80225 1 if (!found && map->max_size > 0 && map->size >= map->max_size) {
4 80221 if (!found && map->max_size > 0 && map->size >= map->max_size) {
1 3 if (!found && map->max_size > 0 && map->size >= map->max_size) {
80119 1 if (!found && map->max_size > 0 && map->size >= map->max_size) {
4 80115 if (!found && map->max_size > 0 && map->size >= map->max_size) {
1 3 if (!found && map->max_size > 0 && map->size >= map->max_size) {
741 0 342 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
0 341 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
745 1 81579 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1 80219 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
102 82317 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
4 98 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 80226 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1 80119 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
747 0 1 if (!map->expires_at) return false;
0 1 if (!map->expires_at) return false;
0 4 if (!map->expires_at) return false;
0 0 if (!map->expires_at) return false;
0 1 if (!map->expires_at) return false;
754 82419 0 if (value && val_len > 0) {
82418 1 if (value && val_len > 0) {
756 0 82418 if (!new_val) return false;
759 104 82314 new_val_len = HM_PACK_LEN(val_len, val_utf8);
760 1 0 } else if (value) {
762 0 1 if (!new_val) return false;
764 0 1 new_val_len = HM_PACK_LEN(0, val_utf8);
768 6 81574 if (found) {
1 80219 if (found) {
6 82413 if (found) {
1 80225 if (found) {
1 80119 if (found) {
770 6 0 if (map->nodes[index].value) free(map->nodes[index].value);
772 6 0 if (map->nodes[index].value && map->free_value_fn)
6 0 if (map->nodes[index].value && map->free_value_fn)
775 0 6 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
0 1 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
0 6 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
0 1 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
0 1 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
778 0 81574 if (!new_key) {
0 80219 if (!new_key) {
0 82413 if (!new_key) {
0 80225 if (!new_key) {
0 80119 if (!new_key) {
786 84 81490 if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
2 80217 if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
85 82328 if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
2 80223 if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
2 80117 if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
791 1 81573 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
1 80218 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
103 82310 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
1 80224 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
1 80118 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
803 408 81172 if (HM_UNLIKELY(map->lru_prev)) {
3 80217 if (HM_UNLIKELY(map->lru_prev)) {
404 82015 if (HM_UNLIKELY(map->lru_prev)) {
4 80222 if (HM_UNLIKELY(map->lru_prev)) {
4 80116 if (HM_UNLIKELY(map->lru_prev)) {
804 0 408 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 3 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 404 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 4 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
0 4 if (found) HM_FN(lru_promote)(map, (uint32_t)index);
808 203 81377 if (map->expires_at) {
1 80219 if (map->expires_at) {
405 82014 if (map->expires_at) {
1 80225 if (map->expires_at) {
2 80118 if (map->expires_at) {
809 202 1 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
0 1 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
303 102 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1 1 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
810 203 0 if (ttl > 0)
1 0 if (ttl > 0)
403 2 if (ttl > 0)
1 0 if (ttl > 0)
2 0 if (ttl > 0)
828 50011 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
50010 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 50010 if (!map || HM_IS_RESERVED_KEY(key)) return false;
50016 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
50015 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 50015 if (!map || HM_IS_RESERVED_KEY(key)) return false;
30011 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
30010 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 30010 if (!map || HM_IS_RESERVED_KEY(key)) return false;
831 50010 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
2 50008 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
50015 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 50012 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
30010 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 30007 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
834 0 50008 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 50010 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 30007 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
835 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 1 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
840 0 50008 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1 50010 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 30007 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
849 50023 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
50023 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
50022 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 50022 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
30016 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
30016 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
30016 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 30016 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
50016 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
50016 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
50016 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 50016 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
852 50022 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
4 50018 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
30016 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 30013 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
50016 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 50013 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
855 2 50016 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 30012 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 50012 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
856 2 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
861 4 50012 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
2 30010 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
2 50010 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
868 100164 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
100164 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
100163 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 100163 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
50010 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
50010 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
50009 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 50009 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
30013 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
30013 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
30012 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 30012 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
871 100163 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
13 100150 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
50009 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 50006 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
30012 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
4 30008 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
874 26 100124 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
22 4 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 50004 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 30006 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
875 12 10 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 1 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 1 (uint32_t)time(NULL) >= map->expires_at[index]) {
880 113 100025 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 50005 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 30007 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
893 50029 0 if (!map || !key) return false;
0 50029 if (!map || !key) return false;
896 50029 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
5 50024 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
899 5 50019 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
3 2 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
900 2 1 (uint32_t)time(NULL) >= map->expires_at[index]) {
905 1 50021 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
916 50024 0 if (!map || !key || !out_value) return false;
50024 0 if (!map || !key || !out_value) return false;
0 50024 if (!map || !key || !out_value) return false;
919 50024 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
3 50021 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
922 2 50019 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
923 2 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
928 2 50017 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
937 50010 0 if (!map || !key || !out_value) return false;
50010 0 if (!map || !key || !out_value) return false;
0 50010 if (!map || !key || !out_value) return false;
50016 0 if (!map || !key || !out_value) return false;
50016 0 if (!map || !key || !out_value) return false;
0 50016 if (!map || !key || !out_value) return false;
50010 0 if (!map || !key || !out_value) return false;
50010 0 if (!map || !key || !out_value) return false;
0 50010 if (!map || !key || !out_value) return false;
940 50010 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
2 50008 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
50016 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
2 50014 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
50010 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
2 50008 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
943 2 50006 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 50013 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
3 50005 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
3 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
944 1 1 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
2 1 (uint32_t)time(NULL) >= map->expires_at[index]) {
949 0 50007 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1 50012 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1 50005 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
963 4 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
4 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 4 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 3 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 3 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
2 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 2 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
2 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 2 if (!map || HM_IS_RESERVED_KEY(key)) return false;
10 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
9 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 9 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
2 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 2 if (!map || HM_IS_RESERVED_KEY(key)) return false;
4 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 3 if (!map || HM_IS_RESERVED_KEY(key)) return false;
4 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
3 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 3 if (!map || HM_IS_RESERVED_KEY(key)) return false;
965 4 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1 3 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1 2 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1 2 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
2 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1 1 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
2 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1 1 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
9 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 6 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
2 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1 1 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1 2 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
3 0 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1 2 if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
968 0 3 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 2 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 2 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 5 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 2 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 2 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
969 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 1 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
980 5 0 if (!map || !key) return false;
0 5 if (!map || !key) return false;
2 0 if (!map || !key) return false;
0 2 if (!map || !key) return false;
2 0 if (!map || !key) return false;
0 2 if (!map || !key) return false;
2 0 if (!map || !key) return false;
0 2 if (!map || !key) return false;
4 0 if (!map || !key) return false;
0 4 if (!map || !key) return false;
982 5 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 4 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
2 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 1 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
2 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 1 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
2 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 1 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
4 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 3 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
985 0 4 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 3 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
986 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1000 80505 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80505 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 80505 if (!map || HM_IS_RESERVED_KEY(key)) return false;
30005 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
30005 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 30005 if (!map || HM_IS_RESERVED_KEY(key)) return false;
50005 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
50005 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 50005 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80006 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80005 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 80004 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80106 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80105 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 80104 if (!map || HM_IS_RESERVED_KEY(key)) return false;
280022 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
280021 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 280021 if (!map || HM_IS_RESERVED_KEY(key)) return false;
150004 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
150003 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 150003 if (!map || HM_IS_RESERVED_KEY(key)) return false;
60006 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
60005 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1 60004 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80007 0 if (!map || HM_IS_RESERVED_KEY(key)) return false;
80006 1 if (!map || HM_IS_RESERVED_KEY(key)) return false;
0 80006 if (!map || HM_IS_RESERVED_KEY(key)) return false;
1003 80505 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 80504 if (index >= map->capacity || map->nodes[index].key != key) return false;
30005 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 30004 if (index >= map->capacity || map->nodes[index].key != key) return false;
50005 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 50004 if (index >= map->capacity || map->nodes[index].key != key) return false;
80004 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 80003 if (index >= map->capacity || map->nodes[index].key != key) return false;
80104 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 80103 if (index >= map->capacity || map->nodes[index].key != key) return false;
280021 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 280020 if (index >= map->capacity || map->nodes[index].key != key) return false;
150003 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 150002 if (index >= map->capacity || map->nodes[index].key != key) return false;
60004 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 60003 if (index >= map->capacity || map->nodes[index].key != key) return false;
80006 0 if (index >= map->capacity || map->nodes[index].key != key) return false;
1 80005 if (index >= map->capacity || map->nodes[index].key != key) return false;
1006 0 80504 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 30004 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 50004 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 80003 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 80103 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 280018 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 150002 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 60003 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 80005 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1007 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 1 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1012 0 80504 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 30004 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 50004 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 80003 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 80103 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
5 280014 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 150002 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 60003 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 80005 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
1014 80501 3 if (map->tombstones > map->capacity / 4 ||
30004 0 if (map->tombstones > map->capacity / 4 ||
50004 0 if (map->tombstones > map->capacity / 4 ||
80000 3 if (map->tombstones > map->capacity / 4 ||
80100 3 if (map->tombstones > map->capacity / 4 ||
280015 4 if (map->tombstones > map->capacity / 4 ||
149997 5 if (map->tombstones > map->capacity / 4 ||
60000 3 if (map->tombstones > map->capacity / 4 ||
80000 5 if (map->tombstones > map->capacity / 4 ||
1015 80486 15 (map->size > 0 && map->tombstones > map->size)) {
87 80399 (map->size > 0 && map->tombstones > map->size)) {
30002 2 (map->size > 0 && map->tombstones > map->size)) {
13 29989 (map->size > 0 && map->tombstones > map->size)) {
50002 2 (map->size > 0 && map->tombstones > map->size)) {
14 49988 (map->size > 0 && map->tombstones > map->size)) {
79996 4 (map->size > 0 && map->tombstones > map->size)) {
47 79949 (map->size > 0 && map->tombstones > map->size)) {
80094 6 (map->size > 0 && map->tombstones > map->size)) {
55 80039 (map->size > 0 && map->tombstones > map->size)) {
280003 12 (map->size > 0 && map->tombstones > map->size)) {
104 279899 (map->size > 0 && map->tombstones > map->size)) {
149989 8 (map->size > 0 && map->tombstones > map->size)) {
74 149915 (map->size > 0 && map->tombstones > map->size)) {
59996 4 (map->size > 0 && map->tombstones > map->size)) {
46 59950 (map->size > 0 && map->tombstones > map->size)) {
79992 8 (map->size > 0 && map->tombstones > map->size)) {
68 79924 (map->size > 0 && map->tombstones > map->size)) {
1025 80505 0 if (!map || !key) return false;
0 80505 if (!map || !key) return false;
80005 0 if (!map || !key) return false;
0 80005 if (!map || !key) return false;
80508 0 if (!map || !key) return false;
0 80508 if (!map || !key) return false;
80006 0 if (!map || !key) return false;
0 80006 if (!map || !key) return false;
80005 0 if (!map || !key) return false;
0 80005 if (!map || !key) return false;
1028 80505 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 80504 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
80005 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 80004 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
80508 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 80507 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
80006 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 80005 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
80005 0 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1 80004 if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1031 0 80504 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 80004 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 80507 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 80005 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 80004 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1032 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1037 0 80504 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 80004 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 80507 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 80005 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
0 80004 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
1039 80501 3 if (map->tombstones > map->capacity / 4 ||
80001 3 if (map->tombstones > map->capacity / 4 ||
80504 3 if (map->tombstones > map->capacity / 4 ||
80002 3 if (map->tombstones > map->capacity / 4 ||
80001 3 if (map->tombstones > map->capacity / 4 ||
1040 80486 15 (map->size > 0 && map->tombstones > map->size)) {
87 80399 (map->size > 0 && map->tombstones > map->size)) {
79997 4 (map->size > 0 && map->tombstones > map->size)) {
47 79950 (map->size > 0 && map->tombstones > map->size)) {
80489 15 (map->size > 0 && map->tombstones > map->size)) {
87 80402 (map->size > 0 && map->tombstones > map->size)) {
79997 5 (map->size > 0 && map->tombstones > map->size)) {
47 79950 (map->size > 0 && map->tombstones > map->size)) {
79996 5 (map->size > 0 && map->tombstones > map->size)) {
47 79949 (map->size > 0 && map->tombstones > map->size)) {
1062 0 15 if (k == key) return index;
0 6 if (k == key) return index;
0 8 if (k == key) return index;
1063 10 5 if (k == HM_EMPTY_KEY) {
5 1 if (k == HM_EMPTY_KEY) {
6 2 if (k == HM_EMPTY_KEY) {
1064 2 8 size_t target = (first_tombstone < map->capacity) ? first_tombstone : index;
1 4 size_t target = (first_tombstone < map->capacity) ? first_tombstone : index;
2 4 size_t target = (first_tombstone < map->capacity) ? first_tombstone : index;
1065 2 8 if (nodes[target].key == HM_TOMBSTONE_KEY) map->tombstones--;
1 4 if (nodes[target].key == HM_TOMBSTONE_KEY) map->tombstones--;
2 4 if (nodes[target].key == HM_TOMBSTONE_KEY) map->tombstones--;
1071 2 3 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
2 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
1 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
1 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
2 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
2 0 if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
1075 5 0 } while (index != original_index);
1 0 } while (index != original_index);
2 0 } while (index != original_index);
1077 0 0 if (first_tombstone < map->capacity) {
0 0 if (first_tombstone < map->capacity) {
0 0 if (first_tombstone < map->capacity) {
1088 15014 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
15014 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
15013 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 15013 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
9 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
9 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
8 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 8 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
12 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
12 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
11 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 11 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
1091 15013 0 if (index < map->capacity && map->nodes[index].key == key) {
4 15009 if (index < map->capacity && map->nodes[index].key == key) {
8 0 if (index < map->capacity && map->nodes[index].key == key) {
2 6 if (index < map->capacity && map->nodes[index].key == key) {
11 0 if (index < map->capacity && map->nodes[index].key == key) {
3 8 if (index < map->capacity && map->nodes[index].key == key) {
1093 3 15006 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
3 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 6 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 8 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1094 1 2 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1098 2 15006 if (map->nodes[index].value == HM_INT_MAX) return false;
1 5 if (map->nodes[index].value == HM_INT_MAX) return false;
2 6 if (map->nodes[index].value == HM_INT_MAX) return false;
1100 1 15005 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 5 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 6 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1101 2 15004 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1 1 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 5 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 6 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1106 1 4 if (map->max_size > 0 && map->size >= map->max_size)
1 0 if (map->max_size > 0 && map->size >= map->max_size)
0 2 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 3 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
1109 0 5 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 3 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1110 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1111 0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
1113 0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
1118 0 5 if (index >= map->capacity) return false;
0 2 if (index >= map->capacity) return false;
0 3 if (index >= map->capacity) return false;
1120 1 4 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1121 1 4 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1126 8 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
8 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
8 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 8 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
9 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
9 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
9 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 9 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
8 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
8 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
8 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 8 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
1129 8 0 if (index < map->capacity && map->nodes[index].key == key) {
3 5 if (index < map->capacity && map->nodes[index].key == key) {
9 0 if (index < map->capacity && map->nodes[index].key == key) {
2 7 if (index < map->capacity && map->nodes[index].key == key) {
8 0 if (index < map->capacity && map->nodes[index].key == key) {
2 6 if (index < map->capacity && map->nodes[index].key == key) {
1131 0 5 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 7 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 6 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1132 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1137 2 3 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1 1 if (delta > 0 && val > HM_INT_MAX - delta) return false;
4 3 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1 3 if (delta > 0 && val > HM_INT_MAX - delta) return false;
3 3 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1 2 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1138 2 2 if (delta < 0) {
2 4 if (delta < 0) {
2 3 if (delta < 0) {
1139 0 2 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 0 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 2 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 0 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 2 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 0 if (delta == HM_INT_MIN) { if (val < 0) return false; }
1140 1 1 else { if (val < HM_INT_MIN - delta) return false; }
1 1 else { if (val < HM_INT_MIN - delta) return false; }
1 1 else { if (val < HM_INT_MIN - delta) return false; }
1144 0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 5 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 4 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1145 0 3 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 5 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 4 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1150 0 3 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 2 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 2 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
1153 0 3 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1154 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1155 0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
1157 0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
1162 0 3 if (index >= map->capacity) return false;
0 2 if (index >= map->capacity) return false;
0 2 if (index >= map->capacity) return false;
1165 0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1166 0 3 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1171 5006 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
5006 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
5005 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 5005 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
9 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
9 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
8 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 8 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
6 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
6 0 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
5 1 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
0 5 if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
1174 5005 0 if (index < map->capacity && map->nodes[index].key == key) {
2 5003 if (index < map->capacity && map->nodes[index].key == key) {
8 0 if (index < map->capacity && map->nodes[index].key == key) {
1 7 if (index < map->capacity && map->nodes[index].key == key) {
5 0 if (index < map->capacity && map->nodes[index].key == key) {
1 4 if (index < map->capacity && map->nodes[index].key == key) {
1176 0 5003 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 7 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 4 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1177 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1181 1 5002 if (map->nodes[index].value == HM_INT_MIN) return false;
2 5 if (map->nodes[index].value == HM_INT_MIN) return false;
1 3 if (map->nodes[index].value == HM_INT_MIN) return false;
1183 0 5002 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 5 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1184 0 5002 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 5 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 3 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1189 0 2 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 1 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 1 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
1192 0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 1 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 1 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1193 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1194 0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
1196 0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
1201 0 2 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
1203 0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1204 0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 1 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 1 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1219 5 2 if (nodes[index].key == NULL) {
10 4 if (nodes[index].key == NULL) {
6 2 if (nodes[index].key == NULL) {
1220 1 4 size_t target = (first_tombstone < map->capacity) ? first_tombstone : index;
3 7 size_t target = (first_tombstone < map->capacity) ? first_tombstone : index;
2 4 size_t target = (first_tombstone < map->capacity) ? first_tombstone : index;
1222 0 5 if (!new_key) return map->capacity;
0 10 if (!new_key) return map->capacity;
0 6 if (!new_key) return map->capacity;
1225 1 4 if (HM_SLOT_IS_TOMBSTONE(&nodes[target])) map->tombstones--;
3 7 if (HM_SLOT_IS_TOMBSTONE(&nodes[target])) map->tombstones--;
2 4 if (HM_SLOT_IS_TOMBSTONE(&nodes[target])) map->tombstones--;
1227 0 5 nodes[target].key_len = HM_PACK_LEN(key_len, key_utf8);
0 10 nodes[target].key_len = HM_PACK_LEN(key_len, key_utf8);
0 6 nodes[target].key_len = HM_PACK_LEN(key_len, key_utf8);
1233 1 1 if (nodes[index].key == HM_STR_TOMBSTONE) {
3 1 if (nodes[index].key == HM_STR_TOMBSTONE) {
2 0 if (nodes[index].key == HM_STR_TOMBSTONE) {
1234 1 0 if (first_tombstone >= map->capacity) first_tombstone = index;
3 0 if (first_tombstone >= map->capacity) first_tombstone = index;
2 0 if (first_tombstone >= map->capacity) first_tombstone = index;
1235 0 1 } else if (nodes[index].key_hash == key_hash &&
0 1 } else if (nodes[index].key_hash == key_hash &&
0 0 } else if (nodes[index].key_hash == key_hash &&
1236 0 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
0 0 nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
1237 0 0 memcmp(nodes[index].key, key, key_len) == 0) {
0 0 memcmp(nodes[index].key, key, key_len) == 0) {
0 0 memcmp(nodes[index].key, key, key_len) == 0) {
1241 2 0 } while (index != original_index);
4 0 } while (index != original_index);
2 0 } while (index != original_index);
1243 0 0 if (first_tombstone < map->capacity) {
0 0 if (first_tombstone < map->capacity) {
0 0 if (first_tombstone < map->capacity) {
1245 0 0 if (!new_key) return map->capacity;
0 0 if (!new_key) return map->capacity;
0 0 if (!new_key) return map->capacity;
1250 0 0 nodes[first_tombstone].key_len = HM_PACK_LEN(key_len, key_utf8);
0 0 nodes[first_tombstone].key_len = HM_PACK_LEN(key_len, key_utf8);
0 0 nodes[first_tombstone].key_len = HM_PACK_LEN(key_len, key_utf8);
1262 12 0 if (!map || !key || !out_value) return false;
12 0 if (!map || !key || !out_value) return false;
0 12 if (!map || !key || !out_value) return false;
15015 0 if (!map || !key || !out_value) return false;
15015 0 if (!map || !key || !out_value) return false;
0 15015 if (!map || !key || !out_value) return false;
10 0 if (!map || !key || !out_value) return false;
10 0 if (!map || !key || !out_value) return false;
0 10 if (!map || !key || !out_value) return false;
1265 12 0 if (index < map->capacity && map->nodes[index].key != NULL &&
2 10 if (index < map->capacity && map->nodes[index].key != NULL &&
15015 0 if (index < map->capacity && map->nodes[index].key != NULL &&
6 15009 if (index < map->capacity && map->nodes[index].key != NULL &&
10 0 if (index < map->capacity && map->nodes[index].key != NULL &&
4 6 if (index < map->capacity && map->nodes[index].key != NULL &&
1266 0 10 map->nodes[index].key != HM_STR_TOMBSTONE) {
0 15009 map->nodes[index].key != HM_STR_TOMBSTONE) {
0 6 map->nodes[index].key != HM_STR_TOMBSTONE) {
1268 0 10 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 15009 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 6 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1269 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1273 1 9 if (map->nodes[index].value == HM_INT_MAX) return false;
1 15008 if (map->nodes[index].value == HM_INT_MAX) return false;
1 5 if (map->nodes[index].value == HM_INT_MAX) return false;
1275 0 9 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1 15007 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1 4 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1276 0 9 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 15008 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 5 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1281 0 2 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 6 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 4 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
1284 0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 6 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 4 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1285 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1286 0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
1288 0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
1293 0 2 if (index >= map->capacity) return false;
0 6 if (index >= map->capacity) return false;
0 4 if (index >= map->capacity) return false;
1295 0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 6 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 4 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1296 0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1 5 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1 3 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1303 6 0 if (!map || !key || !out_value) return false;
6 0 if (!map || !key || !out_value) return false;
0 6 if (!map || !key || !out_value) return false;
6 0 if (!map || !key || !out_value) return false;
6 0 if (!map || !key || !out_value) return false;
0 6 if (!map || !key || !out_value) return false;
6 0 if (!map || !key || !out_value) return false;
6 0 if (!map || !key || !out_value) return false;
0 6 if (!map || !key || !out_value) return false;
1306 6 0 if (index < map->capacity && map->nodes[index].key != NULL &&
2 4 if (index < map->capacity && map->nodes[index].key != NULL &&
6 0 if (index < map->capacity && map->nodes[index].key != NULL &&
2 4 if (index < map->capacity && map->nodes[index].key != NULL &&
6 0 if (index < map->capacity && map->nodes[index].key != NULL &&
1 5 if (index < map->capacity && map->nodes[index].key != NULL &&
1307 0 4 map->nodes[index].key != HM_STR_TOMBSTONE) {
0 4 map->nodes[index].key != HM_STR_TOMBSTONE) {
0 5 map->nodes[index].key != HM_STR_TOMBSTONE) {
1309 0 4 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 4 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 5 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1310 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1315 1 3 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1 0 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1 3 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1 0 if (delta > 0 && val > HM_INT_MAX - delta) return false;
3 2 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1 2 if (delta > 0 && val > HM_INT_MAX - delta) return false;
1316 2 1 if (delta < 0) {
2 1 if (delta < 0) {
2 2 if (delta < 0) {
1317 0 2 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 0 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 2 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 0 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 2 if (delta == HM_INT_MIN) { if (val < 0) return false; }
0 0 if (delta == HM_INT_MIN) { if (val < 0) return false; }
1318 1 1 else { if (val < HM_INT_MIN - delta) return false; }
1 1 else { if (val < HM_INT_MIN - delta) return false; }
1 1 else { if (val < HM_INT_MIN - delta) return false; }
1322 0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1323 0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 3 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1328 0 2 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 2 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 1 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
1331 0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 1 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1332 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1333 0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
1335 0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
1340 0 2 if (index >= map->capacity) return false;
0 2 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
1343 0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1344 0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 1 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1351 3 0 if (!map || !key || !out_value) return false;
3 0 if (!map || !key || !out_value) return false;
0 3 if (!map || !key || !out_value) return false;
5006 0 if (!map || !key || !out_value) return false;
5006 0 if (!map || !key || !out_value) return false;
0 5006 if (!map || !key || !out_value) return false;
5 0 if (!map || !key || !out_value) return false;
5 0 if (!map || !key || !out_value) return false;
0 5 if (!map || !key || !out_value) return false;
1354 3 0 if (index < map->capacity && map->nodes[index].key != NULL &&
1 2 if (index < map->capacity && map->nodes[index].key != NULL &&
5006 0 if (index < map->capacity && map->nodes[index].key != NULL &&
2 5004 if (index < map->capacity && map->nodes[index].key != NULL &&
5 0 if (index < map->capacity && map->nodes[index].key != NULL &&
1 4 if (index < map->capacity && map->nodes[index].key != NULL &&
1355 0 2 map->nodes[index].key != HM_STR_TOMBSTONE) {
0 5004 map->nodes[index].key != HM_STR_TOMBSTONE) {
0 4 map->nodes[index].key != HM_STR_TOMBSTONE) {
1357 0 2 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 5004 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 4 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1358 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1362 1 1 if (map->nodes[index].value == HM_INT_MIN) return false;
2 5002 if (map->nodes[index].value == HM_INT_MIN) return false;
1 3 if (map->nodes[index].value == HM_INT_MIN) return false;
1364 0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 5002 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1365 0 1 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 5002 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 3 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1370 0 1 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 2 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
0 1 if (map->max_size > 0 && map->size >= map->max_size)
0 0 if (map->max_size > 0 && map->size >= map->max_size)
1373 0 1 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 1 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1374 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1375 0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
0 0 if (!HM_FN(compact)(map)) return false;
1377 0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
0 0 if (!HM_FN(resize)(map)) return false;
1382 0 1 if (index >= map->capacity) return false;
0 2 if (index >= map->capacity) return false;
0 1 if (index >= map->capacity) return false;
1384 0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1385 0 1 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 2 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 1 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
0 0 if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = (uint32_t)time(NULL) + map->default_ttl;
1403 0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
9 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
9 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 9 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
1 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
1 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 1 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
1405 0 0 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 9 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 1 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1406 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1407 0 0 if (!HM_FN(compact)(map)) return map->capacity;
0 0 if (!HM_FN(compact)(map)) return map->capacity;
0 0 if (!HM_FN(compact)(map)) return map->capacity;
1409 0 0 if (!HM_FN(resize)(map)) return map->capacity;
0 0 if (!HM_FN(resize)(map)) return map->capacity;
0 0 if (!HM_FN(resize)(map)) return map->capacity;
1415 0 0 if (index >= map->capacity) return map->capacity;
0 9 if (index >= map->capacity) return map->capacity;
0 1 if (index >= map->capacity) return map->capacity;
1417 0 0 if (found) {
3 6 if (found) {
0 1 if (found) {
1419 0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 3 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1420 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1425 0 0 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
1429 0 0 if (found) {
3 6 if (found) {
0 1 if (found) {
1431 0 0 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 0 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1436 0 0 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
0 6 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
0 1 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
1439 0 0 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
1443 0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 6 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 1 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1445 0 0 if (!map->expires_at) return map->capacity;
0 0 if (!map->expires_at) return map->capacity;
0 0 if (!map->expires_at) return map->capacity;
1451 0 0 if (def_val && def_len > 0) {
0 0 if (def_val && def_len > 0) {
6 0 if (def_val && def_len > 0) {
6 0 if (def_val && def_len > 0) {
1 0 if (def_val && def_len > 0) {
1 0 if (def_val && def_len > 0) {
1453 0 0 if (!new_val) return map->capacity;
0 6 if (!new_val) return map->capacity;
0 1 if (!new_val) return map->capacity;
1456 0 0 new_val_len = HM_PACK_LEN(def_len, def_utf8);
0 6 new_val_len = HM_PACK_LEN(def_len, def_utf8);
0 1 new_val_len = HM_PACK_LEN(def_len, def_utf8);
1457 0 0 } else if (def_val) {
0 0 } else if (def_val) {
0 0 } else if (def_val) {
1459 0 0 if (!new_val) return map->capacity;
0 0 if (!new_val) return map->capacity;
0 0 if (!new_val) return map->capacity;
1461 0 0 new_val_len = HM_PACK_LEN(0, def_utf8);
0 0 new_val_len = HM_PACK_LEN(0, def_utf8);
0 0 new_val_len = HM_PACK_LEN(0, def_utf8);
1464 0 0 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
0 6 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
0 1 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
1470 0 0 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 6 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1471 0 0 if (map->expires_at) {
0 6 if (map->expires_at) {
0 1 if (map->expires_at) {
1472 0 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
0 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
0 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1473 0 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
0 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
0 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
1482 4 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
4 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 4 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
2 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
2 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 2 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
2 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
2 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 2 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
1484 0 4 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1485 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1486 0 0 if (!HM_FN(compact)(map)) return map->capacity;
0 0 if (!HM_FN(compact)(map)) return map->capacity;
0 0 if (!HM_FN(compact)(map)) return map->capacity;
1488 0 0 if (!HM_FN(resize)(map)) return map->capacity;
0 0 if (!HM_FN(resize)(map)) return map->capacity;
0 0 if (!HM_FN(resize)(map)) return map->capacity;
1494 0 4 if (index >= map->capacity) return map->capacity;
0 2 if (index >= map->capacity) return map->capacity;
0 2 if (index >= map->capacity) return map->capacity;
1496 2 2 if (found) {
1 1 if (found) {
1 1 if (found) {
1497 1 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1498 1 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1502 0 1 if (index >= map->capacity) return map->capacity;
0 1 if (index >= map->capacity) return map->capacity;
0 1 if (index >= map->capacity) return map->capacity;
1506 1 3 if (found) {
0 2 if (found) {
0 2 if (found) {
1508 0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 0 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 0 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1512 0 3 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
0 2 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
0 2 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
1515 0 0 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
1519 0 3 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 2 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 2 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1521 0 0 if (!map->expires_at) return map->capacity;
0 0 if (!map->expires_at) return map->capacity;
0 0 if (!map->expires_at) return map->capacity;
1524 1 2 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
1 1 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
1 1 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
1529 0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 2 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1530 2 1 if (map->expires_at) {
2 0 if (map->expires_at) {
2 0 if (map->expires_at) {
1531 2 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
2 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
2 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1532 2 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
2 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
2 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
1541 15 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
15 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 15 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
2 1 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 2 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
1 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
3 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
2 1 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
0 2 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
1 0 if (!map || HM_IS_RESERVED_KEY(key)) return map ? map->capacity : 0;
1543 0 15 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
0 2 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1544 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1545 0 0 if (!HM_FN(compact)(map)) return map->capacity;
0 0 if (!HM_FN(compact)(map)) return map->capacity;
0 0 if (!HM_FN(compact)(map)) return map->capacity;
1547 0 0 if (!HM_FN(resize)(map)) return map->capacity;
0 0 if (!HM_FN(resize)(map)) return map->capacity;
0 0 if (!HM_FN(resize)(map)) return map->capacity;
1553 0 15 if (index >= map->capacity) return map->capacity;
0 2 if (index >= map->capacity) return map->capacity;
0 2 if (index >= map->capacity) return map->capacity;
1555 5 10 if (found) {
1 1 if (found) {
1 1 if (found) {
1556 1 4 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1557 1 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1561 0 1 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
1565 4 11 if (found) {
1 1 if (found) {
1 1 if (found) {
1567 0 4 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1571 4 7 if (map->max_size > 0 && map->size >= map->max_size) {
1 3 if (map->max_size > 0 && map->size >= map->max_size) {
0 1 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
0 1 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
1574 0 1 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
0 0 if (index >= map->capacity) return map->capacity;
1578 0 11 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 1 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 1 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1580 0 0 if (!map->expires_at) return map->capacity;
0 0 if (!map->expires_at) return map->capacity;
0 0 if (!map->expires_at) return map->capacity;
1583 1 10 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
0 1 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
0 1 if (map->nodes[index].key == HM_TOMBSTONE_KEY) map->tombstones--;
1588 4 7 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1589 2 9 if (map->expires_at) {
0 1 if (map->expires_at) {
0 1 if (map->expires_at) {
1590 2 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
0 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
0 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1591 1 1 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
0 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
0 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
1606 9 0 if (!map || !key) return map ? map->capacity : 0;
0 9 if (!map || !key) return map ? map->capacity : 0;
0 0 if (!map || !key) return map ? map->capacity : 0;
1608 0 9 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1609 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1610 0 0 if (!HM_FN(compact)(map)) return map->capacity;
1612 0 0 if (!HM_FN(resize)(map)) return map->capacity;
1618 0 9 if (index >= map->capacity) return map->capacity;
1620 3 6 if (found) {
1621 0 3 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
0 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1622 0 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1626 0 0 if (index >= map->capacity) return map->capacity;
1630 3 6 if (found) {
1632 0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1636 0 6 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
1639 0 0 if (index >= map->capacity) return map->capacity;
1643 0 6 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1645 0 0 if (!map->expires_at) return map->capacity;
1650 0 6 if (!new_key) return map->capacity;
1656 6 0 if (def_val && def_len > 0) {
6 0 if (def_val && def_len > 0) {
1658 0 6 if (!new_val) { free(new_key); return map->capacity; }
1661 0 6 new_val_len = HM_PACK_LEN(def_len, def_utf8);
1662 0 0 } else if (def_val) {
1664 0 0 if (!new_val) { free(new_key); return map->capacity; }
1666 0 0 new_val_len = HM_PACK_LEN(0, def_utf8);
1669 0 6 if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) map->tombstones--;
1672 0 6 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
1677 0 6 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1678 0 6 if (map->expires_at) {
1679 0 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1680 0 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;
1690 4 0 if (!map || !key) return map ? map->capacity : 0;
0 4 if (!map || !key) return map ? map->capacity : 0;
0 0 if (!map || !key) return map ? map->capacity : 0;
1692 0 4 if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
1693 0 0 if (map->max_size > 0 && map->tombstones > 0) {
0 0 if (map->max_size > 0 && map->tombstones > 0) {
1694 0 0 if (!HM_FN(compact)(map)) return map->capacity;
1696 0 0 if (!HM_FN(resize)(map)) return map->capacity;
1702 0 4 if (index >= map->capacity) return map->capacity;
1704 2 2 if (found) {
1705 1 1 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1 0 if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1706 1 0 (uint32_t)time(NULL) >= map->expires_at[index]) {
1710 0 1 if (index >= map->capacity) return map->capacity;
1714 1 3 if (found) {
1716 0 1 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1720 0 3 if (map->max_size > 0 && map->size >= map->max_size) {
0 0 if (map->max_size > 0 && map->size >= map->max_size) {
1723 0 0 if (index >= map->capacity) return map->capacity;
1727 0 3 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
0 0 if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
1729 0 0 if (!map->expires_at) return map->capacity;
1733 0 3 if (!new_key) return map->capacity;
1737 1 2 if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) map->tombstones--;
1740 0 3 map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
1744 0 3 if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
1745 2 1 if (map->expires_at) {
1746 2 0 uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
1747 2 0 if (ttl > 0) map->expires_at[index] = (uint32_t)time(NULL) + ttl;