rb_find_add_rcu(9)

✨ rb_find_add_rcu — the kernel API manual, bestie edition ✨

Okay so bestie, gather round, because we're talking about rb_find_add_rcu from the Kernel API Manual and honestly? It's giving efficient. 💅

---

🌸 NAME 🌸

rb_find_add_rcu — find the equivalent @node in @tree, or add @node 🫶

---

🎀 SYNOPSIS 🎀

struct rb_node * rb_find_add_rcu (struct rb_node *node , struct rb_root
*tree , int (*cmp)(struct rb_node *, const struct rb_node *) );

---

🦋 ARGUMENTS 🦋

• node — the node to look-for / insert ✨ literally both jobs, she's versatile
• tree — the tree to search / modify 🌳 search first, modify if needed, main character energy
• cmp — the operator defining the node order 🧚 this is the vibe check that decides who goes where

---

💖 DESCRIPTION 💖

So what does it do? It adds a Store-Release for link_node. No cap. 🔥

It returns the rb_node matching node, or NULL when no match is found and node is inserted. So like, either you get your match back, or you get NULL and she's already been slotted into the tree. Periodt. 💀

---

🌈 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(9)
• rb_find_rcu(9)
• rb_find_first(9)
• rb_next_match(9)
• rb_for_each(9)

---

💜 That's the whole page, bestie — every flag, every argument, every reference, all intact. Go forth and rbtree responsibly. 🍓

---

Mwah 💋 — this page lives under ./include/linux, dropped October 2026, and that's the tea. See you in the next manpage, babe! 🎀✨