1 #ifndef _URCU_RCULFHASH_H
2 #define _URCU_RCULFHASH_H
5 #include <urcu-call-rcu.h>
12 struct rcu_ht_node
*next
; /* ptr | DUMMY_FLAG | REMOVED_FLAG */
13 unsigned long reverse_hash
;
17 /* cache-hot for iteration */
18 struct _rcu_ht_node p
; /* needs to be first field */
21 /* cache-cold for iteration */
29 * Ensure reader and writer threads are registered as urcu readers.
32 typedef unsigned long (*ht_hash_fct
)(void *key
, size_t length
,
34 typedef unsigned long (*ht_compare_fct
)(void *key1
, size_t key1_len
,
35 void *key2
, size_t key2_len
);
38 void ht_node_init(struct rcu_ht_node
*node
, void *key
,
42 node
->key_len
= key_len
;
46 * init_size must be power of two.
48 struct rcu_ht
*ht_new(ht_hash_fct hash_fct
,
49 ht_compare_fct compare_fct
,
50 unsigned long hash_seed
,
51 unsigned long init_size
,
52 void (*ht_call_rcu
)(struct rcu_head
*head
,
53 void (*func
)(struct rcu_head
*head
)));
55 int ht_destroy(struct rcu_ht
*ht
);
56 /* Count the number of nodes in the hash table. Call with rcu_read_lock held. */
57 void ht_count_nodes(struct rcu_ht
*ht
,
59 unsigned long *removed
);
61 /* Call with rcu_read_lock held. */
62 struct rcu_ht_node
*ht_lookup(struct rcu_ht
*ht
, void *key
, size_t key_len
);
64 /* Call with rcu_read_lock held. */
65 void ht_add(struct rcu_ht
*ht
, struct rcu_ht_node
*node
);
68 * Call with rcu_read_lock held.
69 * Returns the node added upon success.
70 * Returns the unique node already present upon failure. If ht_add_unique fails,
71 * the node passed as parameter should be freed by the caller.
73 struct rcu_ht_node
*ht_add_unique(struct rcu_ht
*ht
, struct rcu_ht_node
*node
);
75 /* Call with rcu_read_lock held. */
76 int ht_remove(struct rcu_ht
*ht
, struct rcu_ht_node
*node
);
78 void ht_resize(struct rcu_ht
*ht
, int growth
);
84 #endif /* _URCU_RCULFHASH_H */