Lines Matching defs:cell
58 * Search bucket for key and return the cell number if found; SIZE_T_MAX
63 ckhc_t *cell;
67 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
68 if (cell->key != NULL && ckh->keycomp(key, cell->key)) {
77 * Search table for key and return cell number if found; SIZE_T_MAX otherwise.
81 size_t hashes[2], bucket, cell;
89 cell = ckh_bucket_search(ckh, bucket, key);
90 if (cell != SIZE_T_MAX) {
91 return cell;
96 cell = ckh_bucket_search(ckh, bucket, key);
97 return cell;
103 ckhc_t *cell;
113 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) +
115 if (cell->key == NULL) {
116 cell->key = key;
117 cell->data = data;
136 ckhc_t *cell;
154 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
155 assert(cell->key != NULL);
157 /* Swap cell->{key,data} and {key,data} (evict). */
158 tkey = cell->key; tdata = cell->data;
159 cell->key = key; cell->data = data;
491 size_t cell;
495 cell = ckh_isearch(ckh, searchkey);
496 if (cell != SIZE_T_MAX) {
498 *key = (void *)ckh->tab[cell].key;
501 *data = (void *)ckh->tab[cell].data;
503 ckh->tab[cell].key = NULL;
504 ckh->tab[cell].data = NULL; /* Not necessary. */
523 size_t cell;
527 cell = ckh_isearch(ckh, searchkey);
528 if (cell != SIZE_T_MAX) {
530 *key = (void *)ckh->tab[cell].key;
533 *data = (void *)ckh->tab[cell].data;