55 	ckhc_t *cell;  in ckh_bucket_search()  local
59 		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];  in ckh_bucket_search()
60 		if (cell->key != NULL && ckh->keycomp(key, cell->key))  in ckh_bucket_search()
73 	size_t hashes[2], bucket, cell;  in ckh_isearch()  local
81 	cell = ckh_bucket_search(ckh, bucket, key);  in ckh_isearch()
82 	if (cell != SIZE_T_MAX)  in ckh_isearch()
83 		return (cell);  in ckh_isearch()
87 	cell = ckh_bucket_search(ckh, bucket, key);  in ckh_isearch()
88 	return (cell);  in ckh_isearch()
95 	ckhc_t *cell;  in ckh_try_bucket_insert()  local
104 		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) +  in ckh_try_bucket_insert()
106 		if (cell->key == NULL) {  in ckh_try_bucket_insert()
107 			cell->key = key;  in ckh_try_bucket_insert()
108 			cell->data = data;  in ckh_try_bucket_insert()
128 	ckhc_t *cell;  in ckh_evict_reloc_insert()  local
146 		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];  in ckh_evict_reloc_insert()
147 		assert(cell->key != NULL);  in ckh_evict_reloc_insert()
150 		tkey = cell->key; tdata = cell->data;  in ckh_evict_reloc_insert()
151 		cell->key = key; cell->data = data;  in ckh_evict_reloc_insert()
486 	size_t cell;  in ckh_remove()  local
490 	cell = ckh_isearch(ckh, searchkey);  in ckh_remove()
491 	if (cell != SIZE_T_MAX) {  in ckh_remove()
493 			*key = (void *)ckh->tab[cell].key;  in ckh_remove()
495 			*data = (void *)ckh->tab[cell].data;  in ckh_remove()
496 		ckh->tab[cell].key = NULL;  in ckh_remove()
497 		ckh->tab[cell].data = NULL; /* Not necessary. */  in ckh_remove()
517 	size_t cell;  in ckh_search()  local
521 	cell = ckh_isearch(ckh, searchkey);  in ckh_search()
522 	if (cell != SIZE_T_MAX) {  in ckh_search()
524 			*key = (void *)ckh->tab[cell].key;  in ckh_search()
526 			*data = (void *)ckh->tab[cell].data;  in ckh_search()