| H A D | ckh.c | 43 static bool ckh_grow(ckh_t *ckh);
44 static void ckh_shrink(ckh_t *ckh);
53 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) argument
59 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
60 if (cell->key != NULL && ckh->keycomp(key, cell->key))
71 ckh_isearch(ckh_t *ckh, const void *key) argument
75 assert(ckh != NULL);
77 ckh->hash(key, hashes);
80 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
81 cell = ckh_bucket_search(ckh, bucke
92 ckh_try_bucket_insert(ckh_t *ckh, size_t bucket, const void *key, const void *data) argument
124 ckh_evict_reloc_insert(ckh_t *ckh, size_t argbucket, void const **argkey, void const **argdata) argument
194 ckh_try_insert(ckh_t *ckh, void const**argkey, void const**argdata) argument
223 ckh_rebuild(ckh_t *ckh, ckhc_t *aTab) argument
246 ckh_grow(ckh_t *ckh) argument
301 ckh_shrink(ckh_t *ckh) argument
348 ckh_new(ckh_t *ckh, size_t minitems, ckh_hash_t *hash, ckh_keycomp_t *keycomp) argument
403 ckh_delete(ckh_t *ckh) argument
426 ckh_count(ckh_t *ckh) argument
435 ckh_iter(ckh_t *ckh, size_t *tabind, void **key, void **data) argument
455 ckh_insert(ckh_t *ckh, const void *key, const void *data) argument
479 ckh_remove(ckh_t *ckh, const void *searchkey, void **key, void **data) argument
510 ckh_search(ckh_t *ckh, const void *searchkey, void **key, void **data) argument
[all...] |