rb_find_add_cached(9)

💖 rb_find_add_cached(9) 💖

okay so bestie, welcome to rb_find_add_cached — this is from the Kernel API Manual and it's genuinely one of those little red-black tree functions that just gets it. the whole vibe is: find the equivalent @node in @tree, or just add @node if it's not there. boom. iconic. ✨

---

🌸 SYNOPSIS 🌸

struct rb_node * rb_find_add_cached (struct rb_node *node , struct
rb_root_cached *tree , int (*cmp)(const struct rb_node *new, const
struct rb_node *exist) );

like, look at that signature. it's giving main character energy fr fr. 💅

---

🎀 ARGUMENTS 🎀

• node — the node you're looking for, or the one you're about to insert. it's doing double duty and honestly? we love that for it. 🫶
• tree — the tree you're searching through / modifying. your little red-black kingdom 👑
• cmp — the operator that defines the node order. it's the vibe check for your nodes, lowkey. it takes const struct rb_node *new and const struct rb_node *exist. 😌

---

🦋 DESCRIPTION 🦋

so here's the whole tea ☕: it returns the rb_node that matches node — and if there's no match? it returns NULL and node gets inserted. no cap. that's the entire plot and it ate. 🔥

lowkey the neat part: you don't have to check-then-insert yourself, the function handles the "not found, so add it" branch for you. highkey convenient. ✨

---

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

the whole rb squad is here and they're all slaying in their own way 💜

---

k bye bestie, go touch some trees (red-black ones, obviously) 🌳✨

source: ./include/linux · October 2026 · rb_find_add_cached(9) — mwah, catch you in the next manpage 💋🎀