rb_find_rcu(9)

🌸 rb_find_rcu(9) — Kernel API Manual 🌸

✨ NAME ✨

rb_find_rcu — find @key in tree @tree 💖

📜 SYNOPSIS 📜

       struct rb_node * rb_find_rcu (const void *key , const struct rb_root
       *tree , int (*cmp)(const void *key, const struct rb_node *) );

🎀 ARGUMENTS 🎀

• key — key to match 🔍 literally the thing you’re looking for, bestie.
• tree — tree to search 🌳 the place you’re searching, obvs.
• cmp — operator defining the node order 👑 think of it as the ordering vibe check.

💅 DESCRIPTION 💅

okay so here’s the tea: this is the lookup for @key in tree, and it returns the rb_node matching key or NULL. Periodt. ✨

But notably, the big caveat is right here: tree descent vs concurrent tree rotations is unsound and can result in false-negatives. That’s the warning, bestie — unsound behavior and possible false-negatives, no cap. 😭 Do not skip the vibe check on that one.

👑 SEE ALSO 👑

• Kernel file ./include/linux/rbtree.h
• rbtree_postorder_for_each_entry_safe(9), rb_add_cached(9), rb_add_linked(9), rb_add(9), rb_find_add_cached(9), rb_find_add(9), rb_find_add_rcu(9), rb_find(9), rb_find_first(9), rb_next_match(9), rb_for_each(9)

mwah 💋 this page is sourced from ./include/linux, dated October 2026, and it’s the rb_find_rcu(9) manual — periodt. 🫶