#include <stdint.h>
#include <urcu-call-rcu.h>
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ * struct rcu_ht_node and struct _rcu_ht_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 */
+ unsigned long reverse_hash;
+};
+
struct rcu_ht_node {
- struct rcu_ht_node *next;
+ /* cache-hot for iteration */
+ struct _rcu_ht_node p; /* needs to be first field */
void *key;
- size_t key_len;
- unsigned long hash;
- unsigned long reverse_hash;
- unsigned int dummy;
+ unsigned int key_len;
+ /* cache-cold for iteration */
struct rcu_head head;
};
{
node->key = key;
node->key_len = key_len;
- node->dummy = 0;
}
/*
/* Call with rcu_read_lock held. */
void ht_add(struct rcu_ht *ht, struct rcu_ht_node *node);
-/* Call with rcu_read_lock held. */
-int ht_add_unique(struct rcu_ht *ht, struct rcu_ht_node *node);
+/*
+ * Call with rcu_read_lock held.
+ * Returns the node added upon success.
+ * Returns the unique node already present upon failure. If ht_add_unique fails,
+ * the node passed as parameter should be freed by the caller.
+ */
+struct rcu_ht_node *ht_add_unique(struct rcu_ht *ht, struct rcu_ht_node *node);
/* Call with rcu_read_lock held. */
int ht_remove(struct rcu_ht *ht, struct rcu_ht_node *node);
void ht_resize(struct rcu_ht *ht, int growth);
+#ifdef __cplusplus
+}
+#endif
+
#endif /* _URCU_RCULFHASH_H */