rb_add(9)

💖 rb_add(9) 💖

okay so bestie, welcome to rb_add(9) from the Kernel API Manual — this is the red-black tree girlie's insert function and she is literally here to drop one node into one tree. no cap. 🌸

---

✨ NAME ✨

rb_add — insert @node into @tree 🎀

like that's it, that's the whole job, and she does it flawlessly 💅

---

🌈 SYNOPSIS 🌈

void rb_add (struct rb_node *node , struct rb_root *tree , bool
       (*less)(struct rb_node *, const struct rb_node *) );

look at her. iconic signature. three little arguments and a whole lot of tree energy 🦋

---

💜 ARGUMENTS 💜

• node — the node you wanna insert. your main character. she's going in the tree, periodt. ✨
• tree — the tree you're inserting node into. the venue. the group chat. the whole vibe. 🌳
• less — the operator that defines the (partial) node order. so like, this is the function pointer that tells everything how to sort itself out, and yes bestie it's a partial order, that's what the man page says, don't come for me 🙈

ngl less being a function pointer with struct rb_node * and const struct rb_node * as its params is giving "i know exactly what i'm doing" energy and honestly? she does 👑

---

🫶 SEE ALSO 🫶

okay so if you're obsessed with this one (and you should be), the whole friend group is right here:

• Kernel file ./tools/include/linux/rbtree.h — go read the source bestie, it's right there 🍓
• rbtree_postorder_for_each_entry_safe(9)
• rb_add_cached(9)
• rb_find_add(9)
• rb_find(9)
• rb_find_first(9)
• rb_next_match(9)
• rb_for_each(9)

every single one of them, no skips, we don't leave the squad behind 💀💖

---

and that's the page!! mwah 💋 this little masterpiece lives in ./tools/include/linux and the date on it is October 2026 — so yeah, she's from the future, she's from the kernel, she's rb_add(9) and she ate. 🌟👑🎀