Lines Matching refs:cell
49 * Search bucket for key and return the cell number if found; SIZE_T_MAX
55 ckhc_t *cell;
59 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
60 if (cell->key != NULL && ckh->keycomp(key, cell->key))
68 * Search table for key and return cell number if found; SIZE_T_MAX otherwise.
73 size_t hashes[2], bucket, cell;
81 cell = ckh_bucket_search(ckh, bucket, key);
82 if (cell != SIZE_T_MAX)
83 return (cell);
87 cell = ckh_bucket_search(ckh, bucket, key);
88 return (cell);
95 ckhc_t *cell;
104 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) +
106 if (cell->key == NULL) {
107 cell->key = key;
108 cell->data = data;
128 ckhc_t *cell;
145 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
146 assert(cell->key != NULL);
148 /* Swap cell->{key,data} and {key,data} (evict). */
149 tkey = cell->key; tdata = cell->data;
150 cell->key = key; cell->data = data;
481 size_t cell;
485 cell = ckh_isearch(ckh, searchkey);
486 if (cell != SIZE_T_MAX) {
488 *key = (void *)ckh->tab[cell].key;
490 *data = (void *)ckh->tab[cell].data;
491 ckh->tab[cell].key = NULL;
492 ckh->tab[cell].data = NULL; /* Not necessary. */
512 size_t cell;
516 cell = ckh_isearch(ckh, searchkey);
517 if (cell != SIZE_T_MAX) {
519 *key = (void *)ckh->tab[cell].key;
521 *data = (void *)ckh->tab[cell].data;