Branch Coverage

hashmap_generic.h

Criterion	Covered	Total	%
branch	3056	6800	44.9

line	true	false	branch
67	1042	0	return e ? e : 1;
202	2733696	311	for (i = 0; i < capacity; i++) {
	983408	46	for (i = 0; i < capacity; i++) {
	2098096	52	for (i = 0; i < capacity; i++) {
	2722464	165	for (i = 0; i < capacity; i++) {
	2726512	230	for (i = 0; i < capacity; i++) {
	10861200	545	for (i = 0; i < capacity; i++) {
	4294464	141	for (i = 0; i < capacity; i++) {
	1607584	161	for (i = 0; i < capacity; i++) {
	2004688	135	for (i = 0; i < capacity; i++) {
224	81579	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	81579	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	80229	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	80229	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	82489	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	82489	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	80283	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	80283	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	80127	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
	80127	0	if (node->key != NULL && node->key != HM_STR_TOMBSTONE) {
230	80414	3	if (node->value != NULL) {
	82484	5	if (node->value != NULL) {
	81022	11	if (node->value != NULL) {
	60313	1	if (node->value != NULL) {
235	81577	2	if (node->value != NULL && map->free_value_fn) {
	81577	0	if (node->value != NULL && map->free_value_fn) {
	82021	4	if (node->value != NULL && map->free_value_fn) {
	82021	0	if (node->value != NULL && map->free_value_fn) {
	30065	1	if (node->value != NULL && map->free_value_fn) {
	30065	0	if (node->value != NULL && map->free_value_fn) {
	50125	1	if (node->value != NULL && map->free_value_fn) {
	50125	0	if (node->value != NULL && map->free_value_fn) {
248	342	1	if (p != HM_LRU_NONE) map->lru_next[p] = n;
	186	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	1	if (p != HM_LRU_NONE) map->lru_next[p] = n;
	181	0	if (p != HM_LRU_NONE) map->lru_next[p] = n;
	352	0	if (p != HM_LRU_NONE) map->lru_next[p] = n;
	3	1	if (p != HM_LRU_NONE) map->lru_next[p] = n;
	181	0	if (p != HM_LRU_NONE) map->lru_next[p] = n;
	2806	6	if (p != HM_LRU_NONE) map->lru_next[p] = n;
	1	0	if (p != HM_LRU_NONE) map->lru_next[p] = n;
	3	1	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;
250	0	343	if (n != HM_LRU_NONE) map->lru_prev[n] = p;
	1	185	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	2	if (n != HM_LRU_NONE) map->lru_prev[n] = p;
	0	181	if (n != HM_LRU_NONE) map->lru_prev[n] = p;
	0	352	if (n != HM_LRU_NONE) map->lru_prev[n] = p;
	1	3	if (n != HM_LRU_NONE) map->lru_prev[n] = p;
	0	181	if (n != HM_LRU_NONE) map->lru_prev[n] = p;
	18	2794	if (n != HM_LRU_NONE) map->lru_prev[n] = p;
	0	1	if (n != HM_LRU_NONE) map->lru_prev[n] = p;
	1	3	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;
259	402	7	if (map->lru_head != HM_LRU_NONE)
	208	5	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	2	if (map->lru_head != HM_LRU_NONE)
	200	3	if (map->lru_head != HM_LRU_NONE)
	419	7	if (map->lru_head != HM_LRU_NONE)
	5	2	if (map->lru_head != HM_LRU_NONE)
	200	3	if (map->lru_head != HM_LRU_NONE)
	3251	35	if (map->lru_head != HM_LRU_NONE)
	3	1	if (map->lru_head != HM_LRU_NONE)
	5	2	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)
267	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;
	2	0	if (map->lru_head == idx) return;
	0	2	if (map->lru_head == idx) return;
	1	0	if (map->lru_head == idx) return;
	7	119	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;
268	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	2	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	2	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	2	117	if (map->lru_skip_every && idx != map->lru_tail) {
	1	1	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	2	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
	0	0	if (map->lru_skip_every && idx != map->lru_tail) {
269	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	1	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
	0	0	if (++map->lru_skip_ctr < map->lru_skip_every) return;
289	163	80688	if (map->expires_at) map->expires_at[index] = 0;
	3	80691	if (map->expires_at) map->expires_at[index] = 0;
	2	30007	if (map->expires_at) map->expires_at[index] = 0;
	2	50007	if (map->expires_at) map->expires_at[index] = 0;
	1	80008	if (map->expires_at) map->expires_at[index] = 0;
	0	80187	if (map->expires_at) map->expires_at[index] = 0;
	168	80704	if (map->expires_at) map->expires_at[index] = 0;
	1	80008	if (map->expires_at) map->expires_at[index] = 0;
	1	80295	if (map->expires_at) map->expires_at[index] = 0;
	35	282718	if (map->expires_at) map->expires_at[index] = 0;
	1	150009	if (map->expires_at) map->expires_at[index] = 0;
	2	80007	if (map->expires_at) map->expires_at[index] = 0;
	0	60185	if (map->expires_at) map->expires_at[index] = 0;
	1	80010	if (map->expires_at) map->expires_at[index] = 0;
297	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	351	if (victim == HM_LRU_NONE) return;
	0	1	if (victim == HM_LRU_NONE) return;
	0	181	if (victim == HM_LRU_NONE) return;
	0	2678	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;
310	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	3	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);
	4	17	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);
312	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	3	if (may_compact &&
	0	1	if (may_compact &&
	0	1	if (may_compact &&
	7	14	if (may_compact &&
	0	1	if (may_compact &&
	0	2	if (may_compact &&
	0	0	if (may_compact &&
	0	1	if (may_compact &&
313	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 ||
	7	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 ||
314	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))) {
	2	5	(map->size > 0 && map->tombstones > map->size))) {
	1	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))) {
323	0	46	if (!map) return NULL;
	0	55	if (!map) return NULL;
	0	16	if (!map) return NULL;
	0	16	if (!map) return NULL;
	0	17	if (!map) return NULL;
	0	14	if (!map) return NULL;
	0	75	if (!map) return NULL;
	0	30	if (!map) return NULL;
	0	35	if (!map) return NULL;
	0	124	if (!map) return NULL;
	0	26	if (!map) return NULL;
	0	16	if (!map) return NULL;
	0	15	if (!map) return NULL;
	0	21	if (!map) return NULL;
333	0	46	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	55	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	16	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	16	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	17	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	14	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	1	74	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	30	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	35	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	5	119	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	26	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	16	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	15	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
	0	21	map->lru_skip_every = (map->lru_skip > 0) ? (uint32_t)(100 / (100 - map->lru_skip)) : 0;
346	0	46	if (!map->nodes) { free(map); return NULL; }
	0	55	if (!map->nodes) { free(map); return NULL; }
	0	16	if (!map->nodes) { free(map); return NULL; }
	0	16	if (!map->nodes) { free(map); return NULL; }
	0	17	if (!map->nodes) { free(map); return NULL; }
	0	14	if (!map->nodes) { free(map); return NULL; }
	0	75	if (!map->nodes) { free(map); return NULL; }
	0	30	if (!map->nodes) { free(map); return NULL; }
	0	35	if (!map->nodes) { free(map); return NULL; }
	0	124	if (!map->nodes) { free(map); return NULL; }
	0	26	if (!map->nodes) { free(map); return NULL; }
	0	16	if (!map->nodes) { free(map); return NULL; }
	0	15	if (!map->nodes) { free(map); return NULL; }
	0	21	if (!map->nodes) { free(map); return NULL; }
349	7	39	if (max_size > 0) {
	5	50	if (max_size > 0) {
	2	14	if (max_size > 0) {
	2	14	if (max_size > 0) {
	2	15	if (max_size > 0) {
	3	11	if (max_size > 0) {
	7	68	if (max_size > 0) {
	2	28	if (max_size > 0) {
	3	32	if (max_size > 0) {
	39	85	if (max_size > 0) {
	1	25	if (max_size > 0) {
	2	14	if (max_size > 0) {
	3	12	if (max_size > 0) {
	1	20	if (max_size > 0) {
352	7	0	if (!map->lru_prev || !map->lru_next) {
	0	7	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) {
	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) {
	2	0	if (!map->lru_prev || !map->lru_next) {
	0	2	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) {
	7	0	if (!map->lru_prev || !map->lru_next) {
	0	7	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) {
	3	0	if (!map->lru_prev || !map->lru_next) {
	0	3	if (!map->lru_prev || !map->lru_next) {
	39	0	if (!map->lru_prev || !map->lru_next) {
	0	39	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) {
	2	0	if (!map->lru_prev || !map->lru_next) {
	0	2	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) {
361	4	42	if (default_ttl > 0) {
	4	51	if (default_ttl > 0) {
	2	14	if (default_ttl > 0) {
	2	14	if (default_ttl > 0) {
	0	17	if (default_ttl > 0) {
	0	14	if (default_ttl > 0) {
	9	66	if (default_ttl > 0) {
	1	29	if (default_ttl > 0) {
	1	34	if (default_ttl > 0) {
	30	94	if (default_ttl > 0) {
	0	26	if (default_ttl > 0) {
	1	15	if (default_ttl > 0) {
	0	15	if (default_ttl > 0) {
	1	20	if (default_ttl > 0) {
363	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	9	if (!map->expires_at) {
	0	1	if (!map->expires_at) {
	0	1	if (!map->expires_at) {
	0	30	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) {
374	0	46	if (!map) return;
	0	56	if (!map) return;
	0	16	if (!map) return;
	0	16	if (!map) return;
	0	17	if (!map) return;
	0	14	if (!map) return;
	0	76	if (!map) return;
	0	30	if (!map) return;
	0	35	if (!map) return;
	0	128	if (!map) return;
	0	26	if (!map) return;
	0	16	if (!map) return;
	0	15	if (!map) return;
	0	21	if (!map) return;
378	149792	46	for (i = 0; i < map->capacity; i++) {
	151392	56	for (i = 0; i < map->capacity; i++) {
	65808	16	for (i = 0; i < map->capacity; i++) {
	131536	16	for (i = 0; i < map->capacity; i++) {
	148176	17	for (i = 0; i < map->capacity; i++) {
	148128	14	for (i = 0; i < map->capacity; i++) {
	152224	76	for (i = 0; i < map->capacity; i++) {
	148416	30	for (i = 0; i < map->capacity; i++) {
	149808	35	for (i = 0; i < map->capacity; i++) {
	147904	16	for (i = 0; i < map->capacity; i++) {
	82352	15	for (i = 0; i < map->capacity; i++) {
379	650	149142	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	629	21	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	1052	150340	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	1032	20	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	26	65782	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	18	8	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	26	131510	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	18	8	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	29	148147	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	22	7	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	40	148088	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	31	9	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	1147	151077	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	1120	27	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	83	148333	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	76	7	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	556	149252	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	539	17	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	28	147876	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	20	8	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	40	82312	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
	30	10	if (HM_SLOT_IS_LIVE(&map->nodes[i])) {
395	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;
399	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++) {
400	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]))
409	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) {
415	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)
422	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	1	0	if (!map || !map->expires_at) return;
	0	1	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	1	0	if (!map || !map->expires_at) return;
	0	1	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
	0	0	if (!map || !map->expires_at) return;
425	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	16	1	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	16	1	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
426	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	5	11	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	5	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	11	5	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	11	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
	0	0	if (HM_SLOT_IS_LIVE(&map->nodes[i]) &&
427	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	5	0	map->expires_at[i] && now > map->expires_at[i]) {
	5	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	11	0	map->expires_at[i] && now > map->expires_at[i]) {
	10	1	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
	0	0	map->expires_at[i] && now > map->expires_at[i]) {
428	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	5	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	10	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
	0	0	if (HM_UNLIKELY(map->lru_prev))
433	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	1	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	1	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
	0	0	if (map->tombstones > 0) HM_FN(compact)(map);
439	0	0	if (!map) return NULL;
	0	1	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	1	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	4	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	0	if (!map) return NULL;
	0	0	if (!map) return NULL;
442	0	0	if (!c) return NULL;
	0	1	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	1	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	4	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	0	if (!c) return NULL;
	0	0	if (!c) return NULL;
450	0	0	if (!c->nodes) { free(c); return NULL; }
	0	1	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	1	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	4	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
	0	0	if (!c->nodes) { free(c); return NULL; }
463	0	0	for (i = 0; i < map->capacity; i++) {
	16	1	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	16	1	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	416	4	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
	0	0	for (i = 0; i < map->capacity; i++) {
464	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	1	15	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	1	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	10	6	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	10	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	156	260	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	156	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
	0	0	if (!HM_SLOT_IS_LIVE(&map->nodes[i])) continue;
471	0	0	if (!c->nodes[i].key) goto fail;
	0	0	if (!c->nodes[i].key) goto fail;
	0	10	if (!c->nodes[i].key) goto fail;
	0	0	if (!c->nodes[i].key) goto fail;
	0	0	if (!c->nodes[i].key) goto fail;
478	0	0	if (map->nodes[i].value) {
	10	0	if (map->nodes[i].value) {
	0	0	if (map->nodes[i].value) {
	0	0	if (map->nodes[i].value) {
481	0	0	if (!c->nodes[i].value) goto fail;
	0	10	if (!c->nodes[i].value) goto fail;
	0	0	if (!c->nodes[i].value) goto fail;
	0	0	if (!c->nodes[i].value) goto fail;
496	0	0	if (map->lru_prev) {
	0	1	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	0	1	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	2	2	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
	0	0	if (map->lru_prev) {
499	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	2	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	2	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
	0	0	if (!c->lru_prev || !c->lru_next) goto fail;
505	0	0	if (map->expires_at) {
	0	1	if (map->expires_at) {
	0	0	if (map->expires_at) {
	0	0	if (map->expires_at) {
	0	0	if (map->expires_at) {
	0	0	if (map->expires_at) {
	0	1	if (map->expires_at) {
	0	0	if (map->expires_at) {
	0	0	if (map->expires_at) {
	1	3	if (map->expires_at) {
	0	0	if (map->expires_at) {
	0	0	if (map->expires_at) {
	0	0	if (map->expires_at) {
	0	0	if (map->expires_at) {
507	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	1	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
	0	0	if (!c->expires_at) goto fail;
530	0	261	if (!new_nodes) return false;
	0	248	if (!new_nodes) return false;
	0	27	if (!new_nodes) return false;
	0	33	if (!new_nodes) return false;
	0	82	if (!new_nodes) return false;
	0	148	if (!new_nodes) return false;
	0	297	if (!new_nodes) return false;
	0	83	if (!new_nodes) return false;
	0	193	if (!new_nodes) return false;
	0	409	if (!new_nodes) return false;
	0	112	if (!new_nodes) return false;
	0	79	if (!new_nodes) return false;
	0	143	if (!new_nodes) return false;
	0	111	if (!new_nodes) return false;
536	104	157	if (map->lru_prev) {
	66	182	if (map->lru_prev) {
	0	27	if (map->lru_prev) {
	0	33	if (map->lru_prev) {
	0	82	if (map->lru_prev) {
	66	82	if (map->lru_prev) {
	107	190	if (map->lru_prev) {
	0	83	if (map->lru_prev) {
	66	127	if (map->lru_prev) {
	229	180	if (map->lru_prev) {
	0	112	if (map->lru_prev) {
	0	79	if (map->lru_prev) {
	66	77	if (map->lru_prev) {
	0	111	if (map->lru_prev) {
537	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	107	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	229	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) {
544	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) {
	107	0	if (!new_lru_prev || !new_lru_next || !old_to_new) {
	107	0	if (!new_lru_prev || !new_lru_next || !old_to_new) {
	0	107	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) {
	229	0	if (!new_lru_prev || !new_lru_next || !old_to_new) {
	229	0	if (!new_lru_prev || !new_lru_next || !old_to_new) {
	0	229	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) {
555	34	227	if (map->expires_at) {
	12	236	if (map->expires_at) {
	0	27	if (map->expires_at) {
	0	33	if (map->expires_at) {
	0	82	if (map->expires_at) {
	0	148	if (map->expires_at) {
	47	250	if (map->expires_at) {
	0	83	if (map->expires_at) {
	0	193	if (map->expires_at) {
	10	399	if (map->expires_at) {
	0	112	if (map->expires_at) {
	0	79	if (map->expires_at) {
	0	143	if (map->expires_at) {
	0	111	if (map->expires_at) {
557	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	47	if (!new_expires_at) {
	0	0	if (!new_expires_at) {
	0	0	if (!new_expires_at) {
	0	10	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) {
568	2581152	261	for (i = 0; i < old_capacity; i++) {
	2581520	248	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++) {
	2572752	82	for (i = 0; i < old_capacity; i++) {
	2573808	148	for (i = 0; i < old_capacity; i++) {
	2583168	297	for (i = 0; i < old_capacity; i++) {
	2572768	83	for (i = 0; i < old_capacity; i++) {
	2576192	193	for (i = 0; i < old_capacity; i++) {
	10183744	409	for (i = 0; i < old_capacity; i++) {
	4129232	112	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++) {
	1919424	111	for (i = 0; i < old_capacity; i++) {
569	279644	2301508	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	198901	80743	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	279911	2301609	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	199302	80609	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])) {
	276275	2296477	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	196278	79997	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	277067	2296741	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	196938	80129	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	281149	2302019	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	200395	80754	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	276284	2296484	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	196289	79995	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	278267	2297925	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	198036	80231	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	879325	9304419	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	597500	281825	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	441178	3688054	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	291182	149996	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])) {
	232225	1687199	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
	152230	79995	if (HM_SLOT_IS_LIVE(&old_nodes[i])) {
572	44525	199302	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	196938	while (new_nodes[index].key != HM_EMPTY_KEY)
	44217	198036	while (new_nodes[index].key != HM_EMPTY_KEY)
	119016	597500	while (new_nodes[index].key != HM_EMPTY_KEY)
	61423	291182	while (new_nodes[index].key != HM_EMPTY_KEY)
	28388	127593	while (new_nodes[index].key != HM_EMPTY_KEY)
	32931	152230	while (new_nodes[index].key != HM_EMPTY_KEY)
576	44972	198901	while (new_nodes[index].key != NULL)
	44460	196278	while (new_nodes[index].key != NULL)
	45295	200395	while (new_nodes[index].key != NULL)
	44461	196289	while (new_nodes[index].key != NULL)
	44420	196085	while (new_nodes[index].key != NULL)
580	1364	197537	if (old_to_new) old_to_new[i] = (uint32_t)index;
	660	198642	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	196278	if (old_to_new) old_to_new[i] = (uint32_t)index;
	660	196278	if (old_to_new) old_to_new[i] = (uint32_t)index;
	1394	199001	if (old_to_new) old_to_new[i] = (uint32_t)index;
	0	196289	if (old_to_new) old_to_new[i] = (uint32_t)index;
	660	197376	if (old_to_new) old_to_new[i] = (uint32_t)index;
	4041	593459	if (old_to_new) old_to_new[i] = (uint32_t)index;
	0	291182	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	152230	if (old_to_new) old_to_new[i] = (uint32_t)index;
581	664	198237	if (new_expires_at)
	336	198966	if (new_expires_at)
	0	79143	if (new_expires_at)
	0	148439	if (new_expires_at)
	0	196278	if (new_expires_at)
	0	196938	if (new_expires_at)
	1000	199395	if (new_expires_at)
	0	196289	if (new_expires_at)
	0	198036	if (new_expires_at)
	206	597294	if (new_expires_at)
	0	291182	if (new_expires_at)
	0	196085	if (new_expires_at)
	0	127593	if (new_expires_at)
	0	152230	if (new_expires_at)
588	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	182	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	82	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	0	0	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	66	82	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	66	0	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	107	190	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	107	0	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	0	83	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	0	0	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	66	127	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	66	0	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	229	180	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	228	1	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	0	112	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	111	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
	0	0	if (map->lru_prev && map->lru_head != HM_LRU_NONE) {
594	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) {
	1394	107	while (old_idx != HM_LRU_NONE) {
	0	0	while (old_idx != HM_LRU_NONE) {
	660	66	while (old_idx != HM_LRU_NONE) {
	4041	228	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) {
597	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) {
	1394	0	if (ni != HM_LRU_NONE) {
	0	0	if (ni != HM_LRU_NONE) {
	660	0	if (ni != HM_LRU_NONE) {
	4041	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) {
600	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;
	1287	107	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;
	3813	228	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;
613	0	157	} else if (map->lru_prev) {
	0	182	} else if (map->lru_prev) {
	0	27	} else if (map->lru_prev) {
	0	33	} else if (map->lru_prev) {
	0	82	} else if (map->lru_prev) {
	0	82	} else if (map->lru_prev) {
	0	190	} else if (map->lru_prev) {
	0	83	} else if (map->lru_prev) {
	0	127	} else if (map->lru_prev) {
	1	180	} else if (map->lru_prev) {
	0	112	} else if (map->lru_prev) {
	0	79	} else if (map->lru_prev) {
	0	77	} else if (map->lru_prev) {
	0	111	} else if (map->lru_prev) {
620	34	227	if (map->expires_at) {
	12	236	if (map->expires_at) {
	0	27	if (map->expires_at) {
	0	33	if (map->expires_at) {
	0	82	if (map->expires_at) {
	0	148	if (map->expires_at) {
	47	250	if (map->expires_at) {
	0	83	if (map->expires_at) {
	0	193	if (map->expires_at) {
	10	399	if (map->expires_at) {
	0	112	if (map->expires_at) {
	0	79	if (map->expires_at) {
	0	143	if (map->expires_at) {
	0	111	if (map->expires_at) {
643	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	1	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	4	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	1	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	13	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	1	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
	0	0	if (count > SIZE_MAX / 4) return false; /* overflow guard */
646	0	0	if (needed <= map->capacity) return true;
	1	0	if (needed <= map->capacity) return true;
	0	0	if (needed <= map->capacity) return true;
	0	0	if (needed <= map->capacity) return true;
	0	0	if (needed <= map->capacity) return true;
	0	0	if (needed <= map->capacity) return true;
	4	0	if (needed <= map->capacity) return true;
	0	1	if (needed <= map->capacity) return true;
	0	0	if (needed <= map->capacity) return true;
	9	4	if (needed <= map->capacity) return true;
	1	0	if (needed <= map->capacity) return true;
	0	0	if (needed <= map->capacity) return true;
	0	0	if (needed <= map->capacity) return true;
	0	0	if (needed <= map->capacity) return true;
649	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	1	1	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	24	4	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
	0	0	while (cap < needed) cap <<= 1;
664	130530	22158	if (k == key) return index;
	60020	15331	if (k == key) return index;
	100020	18811	if (k == key) return index;
	130013	22076	if (k == key) return index;
	130117	22095	if (k == key) return index;
	400228	52680	if (k == key) return index;
	200031	29720	if (k == key) return index;
	90013	18597	if (k == key) return index;
	110035	20784	if (k == key) return index;
665	8	22150	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;
	31	52649	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;
667	22150	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));
	52649	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));
681	5	153671	if (nodes[index].key == NULL) return index; /* empty */
	9	153137	if (nodes[index].key == NULL) return index; /* empty */
	8	153695	if (nodes[index].key == NULL) return index; /* empty */
	14	173151	if (nodes[index].key == NULL) return index; /* empty */
	10	153139	if (nodes[index].key == NULL) return index; /* empty */
682	146204	7467	if (nodes[index].key != HM_STR_TOMBSTONE &&
	145700	7437	if (nodes[index].key != HM_STR_TOMBSTONE &&
	146228	7467	if (nodes[index].key != HM_STR_TOMBSTONE &&
	165712	7439	if (nodes[index].key != HM_STR_TOMBSTONE &&
	145701	7438	if (nodes[index].key != HM_STR_TOMBSTONE &&
683	130530	15674	nodes[index].key_hash == key_hash &&
	130030	15670	nodes[index].key_hash == key_hash &&
	130550	15678	nodes[index].key_hash == key_hash &&
	150041	15671	nodes[index].key_hash == key_hash &&
	130031	15670	nodes[index].key_hash == key_hash &&
684	2	130528	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	130530	0	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	1	130029	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	130030	0	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	7	130543	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	130550	0	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	1	150040	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	150041	0	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	2	130029	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
	130031	0	nodes[index].key_len == HM_PACK_LEN(key_len, key_utf8) &&
685	130530	0	memcmp(nodes[index].key, key, key_len) == 0) {
	130030	0	memcmp(nodes[index].key, key, key_len) == 0) {
	130550	0	memcmp(nodes[index].key, key, key_len) == 0) {
	150041	0	memcmp(nodes[index].key, key, key_len) == 0) {
	130031	0	memcmp(nodes[index].key, key, key_len) == 0) {
689	23141	0	} while (HM_LIKELY(index != original_index));
	23107	0	} while (HM_LIKELY(index != original_index));
	23145	0	} while (HM_LIKELY(index != original_index));
	23110	0	} while (HM_LIKELY(index != original_index));
	23108	0	} while (HM_LIKELY(index != original_index));
708	8	270745	if (k == key) {
	3	108689	if (k == key) {
	3	193372	if (k == key) {
	1	266886	if (k == key) {
	8	268571	if (k == key) {
	13	918637	if (k == key) {
	2	405878	if (k == key) {
	1	182163	if (k == key) {
	2	221155	if (k == key) {
712	82207	188538	if (k == HM_EMPTY_KEY) {
	30068	78621	if (k == HM_EMPTY_KEY) {
	50128	143244	if (k == HM_EMPTY_KEY) {
	80598	186288	if (k == HM_EMPTY_KEY) {
	81214	187357	if (k == HM_EMPTY_KEY) {
	387734	530903	if (k == HM_EMPTY_KEY) {
	150254	255624	if (k == HM_EMPTY_KEY) {
	60495	121668	if (k == HM_EMPTY_KEY) {
	81230	139925	if (k == HM_EMPTY_KEY) {
714	71	82136	return (first_tombstone < map->capacity) ? first_tombstone : index;
	1	30067	return (first_tombstone < map->capacity) ? first_tombstone : index;
	1	50127	return (first_tombstone < map->capacity) ? first_tombstone : index;
	55	80543	return (first_tombstone < map->capacity) ? first_tombstone : index;
	54	81160	return (first_tombstone < map->capacity) ? first_tombstone : index;
	1579	386155	return (first_tombstone < map->capacity) ? first_tombstone : index;
	4	150250	return (first_tombstone < map->capacity) ? first_tombstone : index;
	54	60441	return (first_tombstone < map->capacity) ? first_tombstone : index;
	5	81225	return (first_tombstone < map->capacity) ? first_tombstone : index;
716	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) {
	57	186231	if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
	55	2	if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
	56	187301	if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
	54	2	if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
	3163	527740	if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
	1579	1584	if (k == HM_TOMBSTONE_KEY && first_tombstone >= map->capacity) {
	4	255620	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) {
720	188538	0	} while (index != original_index);
	78621	0	} while (index != original_index);
	143244	0	} while (index != original_index);
	186288	0	} while (index != original_index);
	187357	0	} while (index != original_index);
	530903	0	} while (index != original_index);
	255624	0	} while (index != original_index);
	121668	0	} while (index != original_index);
	139925	0	} while (index != original_index);
737	81921	172458	if (nodes[index].key == NULL) {
	80225	170740	if (nodes[index].key == NULL) {
	82830	173951	if (nodes[index].key == NULL) {
	80274	170772	if (nodes[index].key == NULL) {
	80122	170459	if (nodes[index].key == NULL) {
739	117	81804	return (first_tombstone < map->capacity) ? first_tombstone : index;
	2	80223	return (first_tombstone < map->capacity) ? first_tombstone : index;
	120	82710	return (first_tombstone < map->capacity) ? first_tombstone : index;
	2	80272	return (first_tombstone < map->capacity) ? first_tombstone : index;
	2	80120	return (first_tombstone < map->capacity) ? first_tombstone : index;
741	135	172323	if (nodes[index].key == HM_STR_TOMBSTONE) {
	2	170738	if (nodes[index].key == HM_STR_TOMBSTONE) {
	139	173812	if (nodes[index].key == HM_STR_TOMBSTONE) {
	2	170770	if (nodes[index].key == HM_STR_TOMBSTONE) {
	2	170457	if (nodes[index].key == HM_STR_TOMBSTONE) {
742	117	18	if (first_tombstone >= map->capacity) first_tombstone = index;
	2	0	if (first_tombstone >= map->capacity) first_tombstone = index;
	120	19	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;
743	8	172315	} else if (nodes[index].key_hash == key_hash &&
	1	170737	} else if (nodes[index].key_hash == key_hash &&
	9	173803	} else if (nodes[index].key_hash == key_hash &&
	4	170766	} else if (nodes[index].key_hash == key_hash &&
	1	170456	} else if (nodes[index].key_hash == key_hash &&
744	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) &&
745	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) {
750	172450	0	} while (index != original_index);
	170739	0	} while (index != original_index);
	173942	0	} while (index != original_index);
	170768	0	} while (index != original_index);
	170458	0	} while (index != original_index);
771	82029	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	82028	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	82027	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	30068	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	30067	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	30066	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	50128	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	50127	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	50126	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	80420	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	80419	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	80418	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	81034	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	81033	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	81032	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	385056	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	385055	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	385054	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	150255	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	150254	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	150253	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	60316	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	60315	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	60314	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	81231	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	81230	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	81229	if (!map || HM_IS_RESERVED_KEY(key)) return false;
773	157	81870	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	14	30052	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	19	50107	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	97	80321	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	133	80899	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	292	384762	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	32	150221	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	94	60220	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	37	81192	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
774	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) {
	227	65	if (map->max_size > 0 && map->tombstones > 0) {
	212	15	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) {
775	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;
777	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	80	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;
783	0	82027	if (index >= map->capacity) return false;
	0	30066	if (index >= map->capacity) return false;
	0	50126	if (index >= map->capacity) return false;
	0	80418	if (index >= map->capacity) return false;
	0	81032	if (index >= map->capacity) return false;
	0	385054	if (index >= map->capacity) return false;
	0	150253	if (index >= map->capacity) return false;
	0	60314	if (index >= map->capacity) return false;
	0	81229	if (index >= map->capacity) return false;
786	82021	6	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	211	81810	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	183	28	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	30064	2	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	8	30056	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	2	6	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	50124	2	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	8	50116	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	2	6	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	80417	1	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	203	80214	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	181	22	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	81027	5	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	203	80824	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	181	22	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	385046	8	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	3163	381883	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	2676	487	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	150252	1	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	4	150248	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	1	3	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	60313	1	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	203	60110	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	181	22	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	81228	1	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	4	81224	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	1	3	if (!found && map->max_size > 0 && map->size >= map->max_size) {
790	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	2676	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;
794	101	81926	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	3	98	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	30066	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	50126	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	80418	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	81032	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	109	384945	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	8	101	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	1	150252	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	1	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	60314	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	81229	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
796	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;
803	80418	0	if (value && val_len > 0) {
	80417	1	if (value && val_len > 0) {
	81032	0	if (value && val_len > 0) {
	81031	1	if (value && val_len > 0) {
	60314	0	if (value && val_len > 0) {
	60314	0	if (value && val_len > 0) {
805	0	80417	if (!new_val) return false;
	0	81031	if (!new_val) return false;
	0	60314	if (!new_val) return false;
808	1	80416	new_val_len = HM_PACK_LEN(val_len, val_utf8);
	101	80930	new_val_len = HM_PACK_LEN(val_len, val_utf8);
	1	60313	new_val_len = HM_PACK_LEN(val_len, val_utf8);
809	1	0	} else if (value) {
	1	0	} else if (value) {
	0	0	} else if (value) {
811	0	1	if (!new_val) return false;
	0	1	if (!new_val) return false;
	0	0	if (!new_val) return false;
813	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);
817	6	82021	if (found) {
	2	30064	if (found) {
	2	50124	if (found) {
	1	80417	if (found) {
	5	81027	if (found) {
	385046	8	if (found) {
	150252	1	if (found) {
	1	60313	if (found) {
	81228	1	if (found) {
819	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);
821	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)
825	62	81959	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
	0	30064	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
	0	50124	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
	47	80370	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
	46	80981	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
	848	384198	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
	4	150248	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
	46	60267	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
	5	81223	if (map->nodes[index].key == HM_TOMBSTONE_KEY) {
840	211	81816	if (HM_UNLIKELY(map->lru_prev)) {
	8	30058	if (HM_UNLIKELY(map->lru_prev)) {
	8	50118	if (HM_UNLIKELY(map->lru_prev)) {
	203	80215	if (HM_UNLIKELY(map->lru_prev)) {
	203	80829	if (HM_UNLIKELY(map->lru_prev)) {
	3166	381888	if (HM_UNLIKELY(map->lru_prev)) {
	4	150249	if (HM_UNLIKELY(map->lru_prev)) {
	203	60111	if (HM_UNLIKELY(map->lru_prev)) {
	4	81225	if (HM_UNLIKELY(map->lru_prev)) {
841	0	211	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	3163	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);
845	203	81824	if (map->expires_at) {
	1	30065	if (map->expires_at) {
	1	50125	if (map->expires_at) {
	0	80418	if (map->expires_at) {
	1	81031	if (map->expires_at) {
	203	384851	if (map->expires_at) {
	1	150252	if (map->expires_at) {
	0	60314	if (map->expires_at) {
	1	81228	if (map->expires_at) {
846	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;
	94	109	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;
847	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)
	200	3	if (ttl > 0)
	1	0	if (ttl > 0)
	0	0	if (ttl > 0)
	1	0	if (ttl > 0)
868	81582	0	if (!map || !key) return false;
	0	81582	if (!map || !key) return false;
	80224	0	if (!map || !key) return false;
	0	80224	if (!map || !key) return false;
	82479	0	if (!map || !key) return false;
	0	82479	if (!map || !key) return false;
	80269	0	if (!map || !key) return false;
	0	80269	if (!map || !key) return false;
	80122	0	if (!map || !key) return false;
	0	80122	if (!map || !key) return false;
870	171	81411	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	31	80193	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	206	82273	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	32	80237	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
	29	80093	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
871	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) {
	107	99	if (map->max_size > 0 && map->tombstones > 0) {
	105	2	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) {
	0	29	if (map->max_size > 0 && map->tombstones > 0) {
	0	0	if (map->max_size > 0 && map->tombstones > 0) {
872	0	102	if (!HM_FN(compact)(map)) return false;
	0	0	if (!HM_FN(compact)(map)) return false;
	0	105	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;
874	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	32	if (!HM_FN(resize)(map)) return false;
	0	29	if (!HM_FN(resize)(map)) return false;
880	0	81582	if (index >= map->capacity) return false;
	0	80224	if (index >= map->capacity) return false;
	0	82479	if (index >= map->capacity) return false;
	0	80269	if (index >= map->capacity) return false;
	0	80122	if (index >= map->capacity) return false;
883	81576	6	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	409	81167	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	342	67	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	80223	1	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	4	80219	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	1	3	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	82473	6	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	426	82047	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	351	75	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	80268	1	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	5	80263	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	1	4	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	80121	1	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	5	80116	if (!found && map->max_size > 0 && map->size >= map->max_size) {
	1	4	if (!found && map->max_size > 0 && map->size >= map->max_size) {
887	0	342	if (index >= map->capacity) return false;
	0	1	if (index >= map->capacity) return false;
	0	351	if (index >= map->capacity) return false;
	0	1	if (index >= map->capacity) return false;
	0	1	if (index >= map->capacity) return false;
891	1	81581	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	1	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	1	80223	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	1	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	103	82376	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	4	99	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	80269	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	1	80121	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	1	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
893	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;
900	82479	0	if (value && val_len > 0) {
	82478	1	if (value && val_len > 0) {
902	0	82478	if (!new_val) return false;
905	106	82372	new_val_len = HM_PACK_LEN(val_len, val_utf8);
906	1	0	} else if (value) {
908	0	1	if (!new_val) return false;
910	0	1	new_val_len = HM_PACK_LEN(0, val_utf8);
914	6	81576	if (found) {
	1	80223	if (found) {
	6	82473	if (found) {
	1	80268	if (found) {
	1	80121	if (found) {
916	6	0	if (map->nodes[index].value) free(map->nodes[index].value);
918	6	0	if (map->nodes[index].value && map->free_value_fn)
	6	0	if (map->nodes[index].value && map->free_value_fn)
921	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);
924	0	81576	if (!new_key) {
	0	80223	if (!new_key) {
	0	82473	if (!new_key) {
	0	80268	if (!new_key) {
	0	80121	if (!new_key) {
932	84	81492	if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
	2	80221	if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
	87	82386	if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
	2	80266	if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
	2	80119	if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) {
937	2	81574	map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
	2	80221	map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
	107	82366	map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
	2	80266	map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
	2	80119	map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
949	409	81173	if (HM_UNLIKELY(map->lru_prev)) {
	4	80220	if (HM_UNLIKELY(map->lru_prev)) {
	426	82053	if (HM_UNLIKELY(map->lru_prev)) {
	5	80264	if (HM_UNLIKELY(map->lru_prev)) {
	5	80117	if (HM_UNLIKELY(map->lru_prev)) {
950	0	409	if (found) HM_FN(lru_promote)(map, (uint32_t)index);
	0	4	if (found) HM_FN(lru_promote)(map, (uint32_t)index);
	0	426	if (found) HM_FN(lru_promote)(map, (uint32_t)index);
	0	5	if (found) HM_FN(lru_promote)(map, (uint32_t)index);
	0	5	if (found) HM_FN(lru_promote)(map, (uint32_t)index);
954	203	81379	if (map->expires_at) {
	1	80223	if (map->expires_at) {
	415	82064	if (map->expires_at) {
	1	80268	if (map->expires_at) {
	2	80120	if (map->expires_at) {
955	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;
	312	103	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;
956	203	0	if (ttl > 0)
	1	0	if (ttl > 0)
	413	2	if (ttl > 0)
	1	0	if (ttl > 0)
	2	0	if (ttl > 0)
974	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;
977	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;
980	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]) &&
981	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]) {
986	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);
995	50026	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	50026	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	50025	1	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	0	50025	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;
998	50025	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	4	50021	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;
1001	2	50019	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]) &&
1002	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]) {
1007	4	50015	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);
1014	100192	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	100192	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	100191	1	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	0	100191	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;
1017	100191	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	15	100176	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;
1020	32	100144	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	26	6	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]) &&
1021	14	12	(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]) {
1026	122	100040	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);
1039	50041	0	if (!map || !key) return false;
	0	50041	if (!map || !key) return false;
1042	50041	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	5	50036	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1045	8	50028	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	4	4	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1046	3	1	(uint32_t)time(NULL) > map->expires_at[index]) {
1051	2	50031	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1062	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;
1065	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;
1068	2	50019	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	2	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1069	2	0	(uint32_t)time(NULL) > map->expires_at[index]) {
1074	2	50017	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1083	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;
	50018	0	if (!map || !key || !out_value) return false;
	50018	0	if (!map || !key || !out_value) return false;
	0	50018	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;
1086	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;
	50018	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	2	50016	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;
1089	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	50015	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]) &&
1090	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]) {
1095	0	50007	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
	1	50014	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);
1109	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;
1111	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;
1114	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]) &&
1115	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]) {
1126	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;
1128	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;
1131	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]) &&
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]) {
	0	0	(uint32_t)time(NULL) > map->expires_at[index]) {
	0	0	(uint32_t)time(NULL) > map->expires_at[index]) {
1146	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;
1149	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;
1152	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]) &&
1153	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]) {
1158	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);
1160	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 ||
1161	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)) {
1171	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;
	80509	0	if (!map || !key) return false;
	0	80509	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;
1174	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;
	80509	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	1	80508	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;
1177	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	80508	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]) &&
1178	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]) {
1183	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	80508	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);
1185	80501	3	if (map->tombstones > map->capacity / 4 ||
	80001	3	if (map->tombstones > map->capacity / 4 ||
	80505	3	if (map->tombstones > map->capacity / 4 ||
	80002	3	if (map->tombstones > map->capacity / 4 ||
	80001	3	if (map->tombstones > map->capacity / 4 ||
1186	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)) {
	80490	15	(map->size > 0 && map->tombstones > map->size)) {
	87	80403	(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)) {
1201	1	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	1	if (!map || HM_IS_RESERVED_KEY(key)) return false;
1204	1	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key != key) return false;
1206	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]) &&
1207	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]) {
1217	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);
	0	1	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
1219	1	0	if (map->tombstones > map->capacity / 4 ||
	1	0	if (map->tombstones > map->capacity / 4 ||
	1	0	if (map->tombstones > map->capacity / 4 ||
1220	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))
1226	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	0	2	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	0	1	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	1	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	0	1	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
1229	2	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	1	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key != key) return false;
1231	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]) &&
1232	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]) {
1240	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);
	0	1	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
1242	1	0	if (map->tombstones > map->capacity / 4 ||
	1	0	if (map->tombstones > map->capacity / 4 ||
	1	0	if (map->tombstones > map->capacity / 4 ||
1243	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))
1249	3	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	3	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	3	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	0	3	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	0	2	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
	0	2	if (!map || !out_value || HM_IS_RESERVED_KEY(key)) return false;
1252	3	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	2	if (index >= map->capacity || map->nodes[index].key != key) return false;
	2	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	2	if (index >= map->capacity || map->nodes[index].key != key) return false;
	2	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	2	if (index >= map->capacity || map->nodes[index].key != key) return false;
1254	1	1	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	1	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]) &&
1255	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]) {
1262	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	2	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
1264	1	0	if (map->tombstones > map->capacity / 4 ||
	2	0	if (map->tombstones > map->capacity / 4 ||
	2	0	if (map->tombstones > map->capacity / 4 ||
1265	0	1	(map->size > 0 && map->tombstones > map->size))
	0	0	(map->size > 0 && map->tombstones > map->size))
	1	1	(map->size > 0 && map->tombstones > map->size))
	0	1	(map->size > 0 && map->tombstones > map->size))
	1	1	(map->size > 0 && map->tombstones > map->size))
	0	1	(map->size > 0 && map->tombstones > map->size))
1277	1	0	if (!map || !key) return false;
	0	1	if (!map || !key) return false;
1280	1	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1282	0	1	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	0	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1283	0	0	(uint32_t)time(NULL) > map->expires_at[index]) {
1293	0	1	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
1295	1	0	if (map->tombstones > map->capacity / 4 ||
1296	0	1	(map->size > 0 && map->tombstones > map->size))
	0	0	(map->size > 0 && map->tombstones > map->size))
1304	1	0	if (!map || !key || !out_value) return false;
	1	0	if (!map || !key || !out_value) return false;
	0	1	if (!map || !key || !out_value) return false;
1307	1	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1309	0	1	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]) {
1318	0	1	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
1320	1	0	if (map->tombstones > map->capacity / 4 ||
1321	0	1	(map->size > 0 && map->tombstones > map->size))
	0	0	(map->size > 0 && map->tombstones > map->size))
1329	1	0	if (!map || !key || !out_value) return false;
	1	0	if (!map || !key || !out_value) return false;
	0	1	if (!map || !key || !out_value) return false;
	1	0	if (!map || !key || !out_value) return false;
	1	0	if (!map || !key || !out_value) return false;
	0	1	if (!map || !key || !out_value) return false;
	1	0	if (!map || !key || !out_value) return false;
	1	0	if (!map || !key || !out_value) return false;
	0	1	if (!map || !key || !out_value) return false;
1332	1	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	1	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	1	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1334	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]) &&
1335	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]) {
1342	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);
	0	1	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_unlink)(map, (uint32_t)index);
1344	1	0	if (map->tombstones > map->capacity / 4 ||
	1	0	if (map->tombstones > map->capacity / 4 ||
	1	0	if (map->tombstones > map->capacity / 4 ||
1345	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))
1357	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	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;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
1359	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	4	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	4	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == HM_EMPTY_KEY) return false;
1361	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	4	0	if (map->expires_at && map->expires_at[index] &&
	4	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
1362	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	3	(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]) {
1366	0	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
	3	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
1372	0	0	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
	3	0	if (!map || !key) return false;
	0	3	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
1374	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	3	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	3	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1376	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	3	0	if (map->expires_at && map->expires_at[index] &&
	3	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
	0	0	if (map->expires_at && map->expires_at[index] &&
1377	0	0	(uint32_t)time(NULL) > map->expires_at[index]) {
	0	0	(uint32_t)time(NULL) > map->expires_at[index]) {
	0	3	(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]) {
1381	0	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
	3	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
	0	0	if (map->expires_at) map->expires_at[index] = 0;
1394	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
1396	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
1397	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]) &&
	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]) &&
1398	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]) {
1407	0	0	if (new_val && new_len > 0) {
	0	0	if (new_val && new_len > 0) {
	0	0	if (new_val && new_len > 0) {
	0	0	if (new_val && new_len > 0) {
	0	0	if (new_val && new_len > 0) {
	0	0	if (new_val && new_len > 0) {
1409	0	0	if (!buf) return false;
	0	0	if (!buf) return false;
	0	0	if (!buf) return false;
1413	0	0	} else if (new_val) {
	0	0	} else if (new_val) {
	0	0	} else if (new_val) {
1415	0	0	if (!buf) return false;
	0	0	if (!buf) return false;
	0	0	if (!buf) return false;
1421	0	0	map->nodes[index].val_len = HM_PACK_LEN(new_len, new_utf8);
	0	0	map->nodes[index].val_len = HM_PACK_LEN(new_len, new_utf8);
	0	0	map->nodes[index].val_len = HM_PACK_LEN(new_len, new_utf8);
1422	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);
	0	0	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1428	2	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	2	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
1430	2	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	1	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
1431	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	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]) &&
	0	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1432	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]) {
1438	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);
1444	2	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	2	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	2	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || !out_old || HM_IS_RESERVED_KEY(key)) return false;
1446	2	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	1	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
1447	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	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]) &&
	0	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1448	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]) {
1454	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);
1466	2	0	if (!map || !key) return false;
	0	2	if (!map || !key) return false;
1468	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;
1469	0	1	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	0	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1470	0	0	(uint32_t)time(NULL) > map->expires_at[index]) {
1477	1	0	if (new_val && new_len > 0) {
	1	0	if (new_val && new_len > 0) {
1479	0	1	if (!buf) return false;
1483	0	0	} else if (new_val) {
1485	0	0	if (!buf) return false;
1491	0	1	map->nodes[index].val_len = HM_PACK_LEN(new_len, new_utf8);
1492	0	1	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1499	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
1501	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1502	0	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	0	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1503	0	0	(uint32_t)time(NULL) > map->expires_at[index]) {
1509	0	0	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1516	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
	0	0	if (!map || !key || !out_old) return false;
1518	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1519	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]) &&
	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]) &&
1520	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]) {
1526	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);
	0	0	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1540	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;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
	0	0	if (!map || HM_IS_RESERVED_KEY(key)) return false;
1542	3	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	1	2	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key != key) return false;
1543	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	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]) &&
	0	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
1544	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]) {
1548	1	1	if (map->nodes[index].value != expected) return false;
	0	0	if (map->nodes[index].value != expected) return false;
	0	0	if (map->nodes[index].value != expected) return false;
1550	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);
1557	0	0	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
	1	0	if (!map || !key) return false;
	0	1	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
	0	0	if (!map || !key) return false;
1559	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	1	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	1	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
	0	0	if (index >= map->capacity || map->nodes[index].key == NULL) return false;
1560	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	1	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]) &&
1561	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]) {
1565	0	0	if (map->nodes[index].value != expected) return false;
	0	1	if (map->nodes[index].value != expected) return false;
	0	0	if (map->nodes[index].value != expected) return false;
1567	0	0	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	0	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
1588	0	15	if (k == key) return index;
	0	6	if (k == key) return index;
	0	8	if (k == key) return index;
1589	10	5	if (k == HM_EMPTY_KEY) {
	5	1	if (k == HM_EMPTY_KEY) {
	6	2	if (k == HM_EMPTY_KEY) {
1590	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;
1591	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--;
1597	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) {
1601	5	0	} while (index != original_index);
	1	0	} while (index != original_index);
	2	0	} while (index != original_index);
1603	0	0	if (first_tombstone < map->capacity) {
	0	0	if (first_tombstone < map->capacity) {
	0	0	if (first_tombstone < map->capacity) {
1614	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;
1617	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) {
1619	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]) &&
1620	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]) {
1624	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;
1626	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);
1627	2	15004	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	1	1	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	5	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	6	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1632	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)
1635	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) {
1636	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) {
1637	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;
1639	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;
1644	0	5	if (index >= map->capacity) return false;
	0	2	if (index >= map->capacity) return false;
	0	3	if (index >= map->capacity) return false;
1646	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);
1647	1	4	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	1	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	1	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	1	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1652	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;
1655	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) {
1657	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]) &&
1658	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]) {
1663	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;
1664	2	2	if (delta < 0) {
	2	4	if (delta < 0) {
	2	3	if (delta < 0) {
1665	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; }
1666	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; }
1670	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);
1671	0	3	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	5	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	4	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1676	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)
1679	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) {
1680	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) {
1681	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;
1683	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;
1688	0	3	if (index >= map->capacity) return false;
	0	2	if (index >= map->capacity) return false;
	0	2	if (index >= map->capacity) return false;
1691	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);
1692	0	3	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1697	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;
1700	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) {
1702	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]) &&
1703	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]) {
1707	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;
1709	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);
1710	0	5002	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	5	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	3	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1715	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)
1718	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) {
1719	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) {
1720	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;
1722	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;
1727	0	2	if (index >= map->capacity) return false;
	0	1	if (index >= map->capacity) return false;
	0	1	if (index >= map->capacity) return false;
1729	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);
1730	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	1	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	1	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1745	5	2	if (nodes[index].key == NULL) {
	10	4	if (nodes[index].key == NULL) {
	6	2	if (nodes[index].key == NULL) {
1746	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;
1748	0	5	if (!new_key) return map->capacity;
	0	10	if (!new_key) return map->capacity;
	0	6	if (!new_key) return map->capacity;
1751	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--;
1753	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);
1759	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) {
1760	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;
1761	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 &&
1762	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) &&
1763	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) {
1767	2	0	} while (index != original_index);
	4	0	} while (index != original_index);
	2	0	} while (index != original_index);
1769	0	0	if (first_tombstone < map->capacity) {
	0	0	if (first_tombstone < map->capacity) {
	0	0	if (first_tombstone < map->capacity) {
1771	0	0	if (!new_key) return map->capacity;
	0	0	if (!new_key) return map->capacity;
	0	0	if (!new_key) return map->capacity;
1776	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);
1788	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;
1791	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 &&
1792	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) {
1794	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]) &&
1795	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]) {
1799	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;
1801	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);
1802	0	9	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	15008	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	5	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1807	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)
1810	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) {
1811	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) {
1812	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;
1814	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;
1819	0	2	if (index >= map->capacity) return false;
	0	6	if (index >= map->capacity) return false;
	0	4	if (index >= map->capacity) return false;
1821	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);
1822	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	1	5	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	1	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	1	3	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	1	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1829	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;
1832	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 &&
1833	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) {
1835	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]) &&
1836	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]) {
1841	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;
1842	2	1	if (delta < 0) {
	2	1	if (delta < 0) {
	2	2	if (delta < 0) {
1843	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; }
1844	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; }
1848	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);
1849	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	3	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1854	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)
1857	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) {
1858	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) {
1859	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;
1861	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;
1866	0	2	if (index >= map->capacity) return false;
	0	2	if (index >= map->capacity) return false;
	0	1	if (index >= map->capacity) return false;
1869	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);
1870	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	1	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1877	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;
1880	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 &&
1881	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) {
1883	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]) &&
1884	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]) {
1888	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;
1890	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);
1891	0	1	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	5002	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	3	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1896	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)
1899	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) {
1900	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) {
1901	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;
1903	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;
1908	0	1	if (index >= map->capacity) return false;
	0	2	if (index >= map->capacity) return false;
	0	1	if (index >= map->capacity) return false;
1910	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);
1911	0	1	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	2	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	1	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
	0	0	if (HM_UNLIKELY(map->expires_at && map->default_ttl > 0)) map->expires_at[index] = hm_expiry_at(map->default_ttl);
1929	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;
1931	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) {
1932	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) {
1933	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;
1935	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;
1941	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;
1943	0	0	if (found) {
	3	6	if (found) {
	0	1	if (found) {
1945	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]) &&
1946	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]) {
1951	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;
1955	0	0	if (found) {
	3	6	if (found) {
	0	1	if (found) {
1957	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);
1962	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) {
1965	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;
1969	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)) {
1971	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;
1977	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) {
1979	0	0	if (!new_val) return map->capacity;
	0	6	if (!new_val) return map->capacity;
	0	1	if (!new_val) return map->capacity;
1982	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);
1983	0	0	} else if (def_val) {
	0	0	} else if (def_val) {
	0	0	} else if (def_val) {
1985	0	0	if (!new_val) return map->capacity;
	0	0	if (!new_val) return map->capacity;
	0	0	if (!new_val) return map->capacity;
1987	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);
1990	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--;
1996	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);
1997	0	0	if (map->expires_at) {
	0	6	if (map->expires_at) {
	0	1	if (map->expires_at) {
1998	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;
1999	0	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
	0	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
	0	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
2008	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;
2010	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) {
2011	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) {
2012	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;
2014	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;
2020	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;
2022	2	2	if (found) {
	1	1	if (found) {
	1	1	if (found) {
2023	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]) &&
2024	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]) {
2028	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;
2032	1	3	if (found) {
	0	2	if (found) {
	0	2	if (found) {
2034	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);
2038	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) {
2041	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;
2045	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)) {
2047	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;
2050	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--;
2055	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);
2056	2	1	if (map->expires_at) {
	2	0	if (map->expires_at) {
	2	0	if (map->expires_at) {
2057	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;
2058	2	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
	2	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
	2	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
2067	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;
2069	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) {
2070	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) {
2071	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;
2073	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;
2079	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;
2081	5	10	if (found) {
	1	1	if (found) {
	1	1	if (found) {
2082	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]) &&
2083	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]) {
2087	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;
2091	4	11	if (found) {
	1	1	if (found) {
	1	1	if (found) {
2093	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);
2097	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) {
2100	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;
2104	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)) {
2106	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;
2109	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--;
2114	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);
2115	2	9	if (map->expires_at) {
	0	1	if (map->expires_at) {
	0	1	if (map->expires_at) {
2116	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;
2117	1	1	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
	0	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
	0	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
2132	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;
2134	0	9	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
2135	0	0	if (map->max_size > 0 && map->tombstones > 0) {
	0	0	if (map->max_size > 0 && map->tombstones > 0) {
2136	0	0	if (!HM_FN(compact)(map)) return map->capacity;
2138	0	0	if (!HM_FN(resize)(map)) return map->capacity;
2144	0	9	if (index >= map->capacity) return map->capacity;
2146	3	6	if (found) {
2147	0	3	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	0	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2148	0	0	(uint32_t)time(NULL) > map->expires_at[index]) {
2152	0	0	if (index >= map->capacity) return map->capacity;
2156	3	6	if (found) {
2158	0	3	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
2162	0	6	if (map->max_size > 0 && map->size >= map->max_size) {
	0	0	if (map->max_size > 0 && map->size >= map->max_size) {
2165	0	0	if (index >= map->capacity) return map->capacity;
2169	0	6	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
2171	0	0	if (!map->expires_at) return map->capacity;
2176	0	6	if (!new_key) return map->capacity;
2182	6	0	if (def_val && def_len > 0) {
	6	0	if (def_val && def_len > 0) {
2184	0	6	if (!new_val) { free(new_key); return map->capacity; }
2187	0	6	new_val_len = HM_PACK_LEN(def_len, def_utf8);
2188	0	0	} else if (def_val) {
2190	0	0	if (!new_val) { free(new_key); return map->capacity; }
2192	0	0	new_val_len = HM_PACK_LEN(0, def_utf8);
2195	0	6	if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) map->tombstones--;
2198	0	6	map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
2203	0	6	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
2204	0	6	if (map->expires_at) {
2205	0	0	uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
2206	0	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);
2216	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;
2218	0	4	if ((map->size + map->tombstones) * 4 >= map->capacity * 3) {
2219	0	0	if (map->max_size > 0 && map->tombstones > 0) {
	0	0	if (map->max_size > 0 && map->tombstones > 0) {
2220	0	0	if (!HM_FN(compact)(map)) return map->capacity;
2222	0	0	if (!HM_FN(resize)(map)) return map->capacity;
2228	0	4	if (index >= map->capacity) return map->capacity;
2230	2	2	if (found) {
2231	1	1	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
	1	0	if (HM_UNLIKELY(map->expires_at && map->expires_at[index]) &&
2232	1	0	(uint32_t)time(NULL) > map->expires_at[index]) {
2236	0	1	if (index >= map->capacity) return map->capacity;
2240	1	3	if (found) {
2242	0	1	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_promote)(map, (uint32_t)index);
2246	0	3	if (map->max_size > 0 && map->size >= map->max_size) {
	0	0	if (map->max_size > 0 && map->size >= map->max_size) {
2249	0	0	if (index >= map->capacity) return map->capacity;
2253	0	3	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
	0	0	if (HM_UNLIKELY(entry_ttl > 0 && !map->expires_at)) {
2255	0	0	if (!map->expires_at) return map->capacity;
2259	0	3	if (!new_key) return map->capacity;
2263	1	2	if (HM_SLOT_IS_TOMBSTONE(&map->nodes[index])) map->tombstones--;
2266	0	3	map->nodes[index].key_len = HM_PACK_LEN(key_len, key_utf8);
2270	0	3	if (HM_UNLIKELY(map->lru_prev)) HM_FN(lru_push_front)(map, (uint32_t)index);
2271	2	1	if (map->expires_at) {
2272	2	0	uint32_t ttl = entry_ttl > 0 ? entry_ttl : map->default_ttl;
2273	2	0	if (ttl > 0) map->expires_at[index] = hm_expiry_at(ttl);