1 #ifndef _URCU_RCULFHASH_H
2 #define _URCU_RCULFHASH_H
5 #include <urcu-call-rcu.h>
12 struct rcu_ht_node
*next
;
13 unsigned long reverse_hash
;
18 /* cache-hot for iteration */
19 struct _rcu_ht_node p
; /* needs to be first field */
22 /* cache-cold for iteration */
30 * Ensure reader and writer threads are registered as urcu readers.
33 typedef unsigned long (*ht_hash_fct
)(void *key
, size_t length
,
35 typedef unsigned long (*ht_compare_fct
)(void *key1
, size_t key1_len
,
36 void *key2
, size_t key2_len
);
39 void ht_node_init(struct rcu_ht_node
*node
, void *key
,
43 node
->key_len
= key_len
;
48 * init_size must be power of two.
50 struct rcu_ht
*ht_new(ht_hash_fct hash_fct
,
51 ht_compare_fct compare_fct
,
52 unsigned long hash_seed
,
53 unsigned long init_size
,
54 void (*ht_call_rcu
)(struct rcu_head
*head
,
55 void (*func
)(struct rcu_head
*head
)));
57 int ht_destroy(struct rcu_ht
*ht
);
58 /* Count the number of nodes in the hash table. Call with rcu_read_lock held. */
59 void ht_count_nodes(struct rcu_ht
*ht
,
61 unsigned long *removed
);
63 /* Call with rcu_read_lock held. */
64 struct rcu_ht_node
*ht_lookup(struct rcu_ht
*ht
, void *key
, size_t key_len
);
66 /* Call with rcu_read_lock held. */
67 void ht_add(struct rcu_ht
*ht
, struct rcu_ht_node
*node
);
70 * Call with rcu_read_lock held.
71 * Returns the node added upon success.
72 * Returns the unique node already present upon failure. If ht_add_unique fails,
73 * the node passed as parameter should be freed by the caller.
75 struct rcu_ht_node
*ht_add_unique(struct rcu_ht
*ht
, struct rcu_ht_node
*node
);
77 /* Call with rcu_read_lock held. */
78 int ht_remove(struct rcu_ht
*ht
, struct rcu_ht_node
*node
);
80 void ht_resize(struct rcu_ht
*ht
, int growth
);
86 #endif /* _URCU_RCULFHASH_H */