Lines Matching full:cell

59  * Search bucket for key and return the cell number if found; SIZE_T_MAX
64 ckhc_t *cell; in ckh_bucket_search() local
68 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i]; in ckh_bucket_search()
69 if (cell->key != NULL && ckh->keycomp(key, cell->key)) { in ckh_bucket_search()
78 * Search table for key and return cell number if found; SIZE_T_MAX otherwise.
82 size_t hashes[2], bucket, cell; in ckh_isearch() local
90 cell = ckh_bucket_search(ckh, bucket, key); in ckh_isearch()
91 if (cell != SIZE_T_MAX) { in ckh_isearch()
92 return cell; in ckh_isearch()
97 cell = ckh_bucket_search(ckh, bucket, key); in ckh_isearch()
98 return cell; in ckh_isearch()
104 ckhc_t *cell; in ckh_try_bucket_insert() local
114 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + in ckh_try_bucket_insert()
116 if (cell->key == NULL) { in ckh_try_bucket_insert()
117 cell->key = key; in ckh_try_bucket_insert()
118 cell->data = data; in ckh_try_bucket_insert()
137 ckhc_t *cell; in ckh_evict_reloc_insert() local
155 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i]; in ckh_evict_reloc_insert()
156 assert(cell->key != NULL); in ckh_evict_reloc_insert()
158 /* Swap cell->{key,data} and {key,data} (evict). */ in ckh_evict_reloc_insert()
159 tkey = cell->key; tdata = cell->data; in ckh_evict_reloc_insert()
160 cell->key = key; cell->data = data; in ckh_evict_reloc_insert()
492 size_t cell; in ckh_remove() local
496 cell = ckh_isearch(ckh, searchkey); in ckh_remove()
497 if (cell != SIZE_T_MAX) { in ckh_remove()
499 *key = (void *)ckh->tab[cell].key; in ckh_remove()
502 *data = (void *)ckh->tab[cell].data; in ckh_remove()
504 ckh->tab[cell].key = NULL; in ckh_remove()
505 ckh->tab[cell].data = NULL; /* Not necessary. */ in ckh_remove()
524 size_t cell; in ckh_search() local
528 cell = ckh_isearch(ckh, searchkey); in ckh_search()
529 if (cell != SIZE_T_MAX) { in ckh_search()
531 *key = (void *)ckh->tab[cell].key; in ckh_search()
534 *data = (void *)ckh->tab[cell].data; in ckh_search()