#endif
/*
- * struct rcu_ht_node and struct _rcu_ht_node should be aligned on
+ * struct cds_lfht_node and struct _cds_lfht_node should be aligned on
* 4-bytes boundaries because the two lower bits are used as flags.
*/
-struct _rcu_ht_node {
- struct rcu_ht_node *next; /* ptr | DUMMY_FLAG | REMOVED_FLAG */
+struct _cds_lfht_node {
+ struct cds_lfht_node *next; /* ptr | DUMMY_FLAG | REMOVED_FLAG */
unsigned long reverse_hash;
};
-struct rcu_ht_node {
+struct cds_lfht_node {
/* cache-hot for iteration */
- struct _rcu_ht_node p; /* needs to be first field */
+ struct _cds_lfht_node p; /* needs to be first field */
void *key;
unsigned int key_len;
/* cache-cold for iteration */
struct rcu_head head;
};
-struct rcu_ht;
+struct cds_lfht;
/*
* Caution !
* Ensure reader and writer threads are registered as urcu readers.
*/
-typedef unsigned long (*ht_hash_fct)(void *key, size_t length,
- unsigned long seed);
-typedef unsigned long (*ht_compare_fct)(void *key1, size_t key1_len,
- void *key2, size_t key2_len);
+typedef unsigned long (*cds_lfht_hash_fct)(void *key, size_t length,
+ unsigned long seed);
+typedef unsigned long (*cds_lfht_compare_fct)(void *key1, size_t key1_len,
+ void *key2, size_t key2_len);
/*
- * ht_node_init - initialize a hash table node
+ * cds_lfht_node_init - initialize a hash table node
*/
static inline
-void ht_node_init(struct rcu_ht_node *node, void *key,
- size_t key_len)
+void cds_lfht_node_init(struct cds_lfht_node *node, void *key,
+ size_t key_len)
{
node->key = key;
node->key_len = key_len;
}
/*
- * ht_new - allocate a hash table.
+ * cds_lfht_new - allocate a hash table.
*
* init_size must be power of two.
*/
-struct rcu_ht *ht_new(ht_hash_fct hash_fct,
- ht_compare_fct compare_fct,
- unsigned long hash_seed,
- unsigned long init_size,
- void (*ht_call_rcu)(struct rcu_head *head,
+struct cds_lfht *cds_lfht_new(cds_lfht_hash_fct hash_fct,
+ cds_lfht_compare_fct compare_fct,
+ unsigned long hash_seed,
+ unsigned long init_size,
+ void (*cds_lfht_call_rcu)(struct rcu_head *head,
void (*func)(struct rcu_head *head)));
/*
- * ht_destroy - destroy a hash table.
+ * cds_lfht_destroy - destroy a hash table.
*/
-int ht_destroy(struct rcu_ht *ht);
+int cds_lfht_destroy(struct cds_lfht *ht);
/*
- * ht_count_nodes - count the number of nodes in the hash table.
+ * cds_lfht_count_nodes - count the number of nodes in the hash table.
*
* Call with rcu_read_lock held.
*/
-void ht_count_nodes(struct rcu_ht *ht,
- unsigned long *count,
- unsigned long *removed);
+void cds_lfht_count_nodes(struct cds_lfht *ht,
+ unsigned long *count,
+ unsigned long *removed);
/*
- * ht_lookup - lookup a node by key.
+ * cds_lfht_lookup - lookup a node by key.
*
* Returns NULL if not found.
* Call with rcu_read_lock held.
*/
-struct rcu_ht_node *ht_lookup(struct rcu_ht *ht, void *key, size_t key_len);
+struct cds_lfht_node *cds_lfht_lookup(struct cds_lfht *ht, void *key, size_t key_len);
/*
- * ht_next - get the next item with same key (after a lookup).
+ * cds_lfht_next - get the next item with same key (after a lookup).
*
* Returns NULL if no following node exists with same key.
- * RCU read-side lock must be held across ht_lookup and ht_next calls, and also
- * between ht_next calls using the node returned by a previous ht_next.
+ * RCU read-side lock must be held across cds_lfht_lookup and cds_lfht_next calls, and also
+ * between cds_lfht_next calls using the node returned by a previous cds_lfht_next.
* Call with rcu_read_lock held.
*/
-struct rcu_ht_node *ht_next(struct rcu_ht *ht, struct rcu_ht_node *node);
+struct cds_lfht_node *cds_lfht_next(struct cds_lfht *ht, struct cds_lfht_node *node);
/*
- * ht_add - add a node to the hash table.
+ * cds_lfht_add - add a node to the hash table.
*
* Call with rcu_read_lock held.
*/
-void ht_add(struct rcu_ht *ht, struct rcu_ht_node *node);
+void cds_lfht_add(struct cds_lfht *ht, struct cds_lfht_node *node);
/*
- * ht_add_unique - add a node to hash table, if key is not present.
+ * cds_lfht_add_unique - add a node to hash table, if key is not present.
*
* Returns the node added upon success.
- * Returns the unique node already present upon failure. If ht_add_unique fails,
+ * Returns the unique node already present upon failure. If cds_lfht_add_unique fails,
* the node passed as parameter should be freed by the caller.
* Call with rcu_read_lock held.
*/
-struct rcu_ht_node *ht_add_unique(struct rcu_ht *ht, struct rcu_ht_node *node);
+struct cds_lfht_node *cds_lfht_add_unique(struct cds_lfht *ht, struct cds_lfht_node *node);
/*
- * ht_remove - remove node from hash table.
+ * cds_lfht_remove - remove node from hash table.
*
- * Node can be looked up with ht_lookup. RCU read-side lock must be held between
+ * Node can be looked up with cds_lfht_lookup. RCU read-side lock must be held between
* lookup and removal.
* Call with rcu_read_lock held.
*/
-int ht_remove(struct rcu_ht *ht, struct rcu_ht_node *node);
+int cds_lfht_remove(struct cds_lfht *ht, struct cds_lfht_node *node);
/*
- * ht_resize - Force a hash table resize
+ * cds_lfht_resize - Force a hash table resize
* @growth: growth order (current size is multiplied by 2^growth)
*
* Currently, only expand operation is supported (growth >= 0).
*/
-void ht_resize(struct rcu_ht *ht, int growth);
+void cds_lfht_resize(struct cds_lfht *ht, int growth);
#ifdef __cplusplus
}
projects / urcu.git / blobdiff