extern "C" {
#endif
+/*
+ * Duplicate nodes with the same key are chained into a singly-linked
+ * list. The last item of this list has a NULL next pointer.
+ */
struct cds_ja_node {
- /* Linked list of nodes with same key */
- struct cds_hlist_node list;
- /* delayed reclaim */
- struct rcu_head head;
+ struct cds_ja_node *next;
};
struct cds_ja;
{
}
-struct cds_hlist_head cds_ja_lookup(struct cds_ja *ja, uint64_t key);
+/*
+ * cds_ja_lookup - look up by key.
+ * @ja: the Judy array.
+ * @key: key to look up.
+ *
+ * Returns the first node of a duplicate chain if a match is found, else
+ * returns NULL.
+ * A RCU read-side lock should be held across call to this function and
+ * use of its return value.
+ */
+struct cds_ja_node *cds_ja_lookup(struct cds_ja *ja, uint64_t key);
+
+/*
+ * cds_ja_lookup_lower_equal - look up first node with key <= @key.
+ * @ja: the Judy array.
+ * @key: key to look up.
+ *
+ * Returns the first node of a duplicate chain if a node is present in
+ * the tree which has a key lower or equal to @key, else returns NULL.
+ * A RCU read-side lock should be held across call to this function and
+ * use of its return value.
+ */
+struct cds_ja_node *cds_ja_lookup_lower_equal(struct cds_ja *ja,
+ uint64_t key);
int cds_ja_add(struct cds_ja *ja, uint64_t key,
struct cds_ja_node *new_node);
+struct cds_ja_node *cds_ja_add_unique(struct cds_ja *ja, uint64_t key,
+ struct cds_ja_node *new_node);
+
int cds_ja_del(struct cds_ja *ja, uint64_t key,
struct cds_ja_node *node);
}
int cds_ja_destroy(struct cds_ja *ja,
- void (*free_node_cb)(struct rcu_head *head));
+ void (*rcu_free_node_cb)(struct cds_ja_node *node));
+
+/*
+ * Iterate through duplicates returned by cds_ja_lookup*()
+ * This must be done while rcu_read_lock() is held.
+ * Receives a struct cds_ja_node * as parameter, which is used as start
+ * of duplicate list and loop cursor.
+ */
+#define cds_ja_for_each_duplicate_rcu(pos) \
+ for (; (pos) != NULL; (pos) = rcu_dereference((pos)->next))
#ifdef __cplusplus
}