rb_add_linked(9)

💖 rb_add_linked 💖

okay so bestie, this is rb_add_linked(9) from the Kernel API Manual — and it's literally the moment you slide @node into the leftmost linked tree @tree. Main character insertion energy, no cap. ✨

✨ NAME ✨

rb_add_linked — insert @node into the leftmost linked tree @tree.

🌸 SYNOPSIS 🌸

bool rb_add_linked (struct rb_node_linked *node , struct rb_root_linked
       *tree , bool (*less)(struct rb_node *, const struct rb_node *) );

🦋 ARGUMENTS 🦋

• node — the node to insert. That's your little star, bestie. ⭐
• tree — the linked tree to insert node into. It's giving "put me in, coach" 🌈
• less — the operator defining the (partial) node order. Yep, the vibe-sorter. 💅

🎀 DESCRIPTION 🎀

Returns true when node is the new leftmost, false otherwise. That's the whole tea — no extra lore. 🍓

🫶 SEE ALSO 🫶

Kernel file ./include/linux/rbtree.h — go say hi to the source, iykyk.

• rbtree_postorder_for_each_entry_safe(9)
• rb_add_cached(9)
• rb_add(9)
• rb_find_add_cached(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)

💖 cute sign-off: source/version ./include/linux, dated October 2026, page rb_add_linked(9). Slay and read safely, bestie! 🎀✨