61#if defined(HASH_IMPLEMENTATION) || !defined(KAZLIB_OPAQUE_DEBUG)
62#ifdef KAZLIB_SIDEEFFECT_DEBUG
63#define hash_isfull(H) (SFX_CHECK(H)->hash_nodecount == (H)->hash_maxcount)
65#define hash_isfull(H) ((H)->hash_nodecount == (H)->hash_maxcount)
67#define hash_isempty(H) ((H)->hash_nodecount == 0)
68#define hash_count(H) ((H)->hash_nodecount)
69#define hash_size(H) ((H)->hash_nchains)
70#define hnode_get(N) ((N)->hash_data)
71#define hnode_getkey(N) ((N)->hash_key)
72#define hnode_put(N, V) ((N)->hash_data = (V))
void hash_insert(hash_t *, hnode_t *, const void *)
Insert a node into the hash table.
Definition hash.c:527
void hash_set_allocator(hash_t *, hnode_alloc_t, hnode_free_t, void *)
Definition hash.c:373
#define hnode_getkey(N)
Definition etc/afpd/hash.h:71
void hash_scan_delfree(hash_t *, hnode_t *)
Definition hash.c:703
void hash_delete_free(hash_t *, hnode_t *)
Definition hash.c:665
int hash_verify(hash_t *)
Verify whether the given object is a valid hash table.
Definition hash.c:718
#define hnode_get(N)
Definition etc/afpd/hash.h:70
int hash_alloc_insert(hash_t *, const void *, void *)
Definition hash.c:644
hash_t * hash_init(hash_t *, hashcount_t, hash_comp_t, hash_fun_t, hnode_t **, hashcount_t)
void hash_free_nodes(hash_t *)
Definition hash.c:387
#define hnode_put(N, V)
Definition etc/afpd/hash.h:72
hnode_t * hash_scan_delete(hash_t *, hnode_t *)
Definition hash.c:675
hash_t * hash_create(hashcount_t, hash_comp_t, hash_fun_t)
Create a dynamic hash table.
Definition hash.c:324
hnode_t * hash_lookup(hash_t *, const void *)
Find a node in the hash table and return a pointer to it.
Definition hash.c:568
hnode_t * hnode_create(void *)
hnode_t * hash_alloc_insert_node(hash_t *, const void *, void *)
Definition hash.c:653
hnode_t * hnode_init(hnode_t *, void *)
Definition hash.c:769
void hnode_destroy(hnode_t *)
hnode_t * hash_delete(hash_t *, hnode_t *)
Delete the given node from the hash table. Since the chains are singly linked, we must locate the sta...
Definition hash.c:605
#define hash_isfull(H)
Definition etc/afpd/hash.h:65
#define hash_isempty(H)
Definition etc/afpd/hash.h:67
void hash_destroy(hash_t *)
Definition hash.c:405
hnode_t * hash_scan_next(hscan_t *)
Retrieve the next node from the hash table, and update the pointer for the next invocation of hash_sc...
Definition hash.c:471
void hash_scan_begin(hscan_t *, hash_t *)
Initialize a hash scanner.
Definition hash.c:426
#define hash_size(H)
Definition etc/afpd/hash.h:69
#define hash_count(H)
Definition etc/afpd/hash.h:68
hash_val_t(* hash_fun_t)(const void *)
Definition include/atalk/hash.h:95
int(* hash_comp_t)(const void *, const void *)
Definition include/atalk/hash.h:81
void(* hnode_free_t)(hnode_t *, void *)
Definition include/atalk/hash.h:102
hnode_t *(* hnode_alloc_t)(void *)
Definition include/atalk/hash.h:101
unsigned long hashcount_t
Definition include/atalk/hash.h:26
Definition include/atalk/hash.h:139
Hash chain node structure.
Definition include/atalk/hash.h:63
Definition include/atalk/hash.h:169