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.
+ * cds_ja_lookup_below_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.
+ * the tree which has a key below 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,
+struct cds_ja_node *cds_ja_lookup_below_equal(struct cds_ja *ja,
+ uint64_t key);
+
+/*
+ * cds_ja_lookup_above_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 above 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_above_equal(struct cds_ja *ja,
uint64_t key);
/*
* on the Judy array while it is being destroyed (ensured by the caller).
* There is no need for the @rcu_free_node_cb callback to wait for grace
* periods, since there are no more concurrent users of the Judy array.
+ * RCU read-side lock should _not_ be held when calling this function,
+ * however, QSBR threads need to be online.
*/
int cds_ja_destroy(struct cds_ja *ja,
void (*free_node_cb)(struct cds_ja_node *node));