Lines Matching refs:key

14     if (*(uintptr_t *) lhq->key.start == (uintptr_t) data) {  in nxt_lvlhsh_test_key_test()
40 void *pool, uintptr_t key) in nxt_lvlhsh_test_add() argument
44 lhq.key_hash = key; in nxt_lvlhsh_test_add()
46 lhq.key.length = sizeof(uintptr_t); in nxt_lvlhsh_test_add()
47 lhq.key.start = (u_char *) &key; in nxt_lvlhsh_test_add()
48 lhq.value = (void *) key; in nxt_lvlhsh_test_add()
59 "key %p is already in hash", key); in nxt_lvlhsh_test_add()
69 uintptr_t key) in nxt_lvlhsh_test_get() argument
73 lhq.key_hash = key; in nxt_lvlhsh_test_get()
74 lhq.key.length = sizeof(uintptr_t); in nxt_lvlhsh_test_get()
75 lhq.key.start = (u_char *) &key; in nxt_lvlhsh_test_get()
80 if (key == (uintptr_t) lhq.value) { in nxt_lvlhsh_test_get()
86 "key %p not found in hash", key); in nxt_lvlhsh_test_get()
94 void *pool, uintptr_t key) in nxt_lvlhsh_test_delete() argument
99 lhq.key_hash = key; in nxt_lvlhsh_test_delete()
100 lhq.key.length = sizeof(uintptr_t); in nxt_lvlhsh_test_delete()
101 lhq.key.start = (u_char *) &key; in nxt_lvlhsh_test_delete()
109 "key %p not found in hash", key); in nxt_lvlhsh_test_delete()
120 uint32_t key; in nxt_lvlhsh_test() local
156 key = 0; in nxt_lvlhsh_test()
158 key = nxt_murmur_hash2(&key, sizeof(uint32_t)); in nxt_lvlhsh_test()
160 if (nxt_lvlhsh_test_add(&lh, proto, mp, key) != NXT_OK) { in nxt_lvlhsh_test()
167 key = 0; in nxt_lvlhsh_test()
169 key = nxt_murmur_hash2(&key, sizeof(uint32_t)); in nxt_lvlhsh_test()
171 if (nxt_lvlhsh_test_get(&lh, proto, key) != NXT_OK) { in nxt_lvlhsh_test()
197 key = (uintptr_t) value; in nxt_lvlhsh_test()
199 if (nxt_lvlhsh_test_delete(&lh, proto, mp, key) != NXT_OK) { in nxt_lvlhsh_test()
216 key = 0; in nxt_lvlhsh_test()
218 key = nxt_murmur_hash2(&key, sizeof(uint32_t)); in nxt_lvlhsh_test()
220 if (nxt_lvlhsh_test_add(&lh, proto, mp, key) != NXT_OK) { in nxt_lvlhsh_test()