latch_tree_insert(9)

💖 latch_tree_insert(9) 💖

ok so this is from the Kernel API Manual, bestie — welcome to the latch-tree corner of the kernel, it's giving very demure, very mindful, very lock-free 💅

✨ NAME ✨

latch_tree_insert — insert @node into the trees @root 🌸

🦋 SYNOPSIS 🦋

void latch_tree_insert (struct latch_tree_node *node , struct
       latch_tree_root *root , const struct latch_tree_ops *ops );

like literally that's the whole signature, no notes, she's iconic 👑

🎀 ARGUMENTS 🎀

• node — the node(s) to insert 🫶
• root — the trees you're inserting node into, yes plural, it's a whole vibe 🌈
• ops — the operators that define the node order, i.e. who goes where ✨

💜 DESCRIPTION 💜

okay so here's the tea ☕ — it inserts node into root in an ordered fashion, such that we can always observe one complete tree. no cap. and like, if you want the full lore, see the comment for write_seqcount_latch_begin 👀

the inserts use rcu_assign_pointer to publish the element, so that the tree structure is stored before we can observe the new node. order matters, bestie, it's giving main character energy 🔥

⚠️ and this is the important bit: all modifications (latch_tree_insert, latch_tree_remove) are assumed to be serialized. assumed. don't come crying to me if you skip that part 😭💀

🌟 SEE ALSO 🌟

• Kernel file ./include/linux/rbtree_latch.h 🎀
• struct latch_tree_ops(9) 🦋
• latch_tree_erase(9) 🌸
• latch_tree_find(9) ⭐

ok that's the page, mwah 💋 — sourced from ./include/linux, dated October 2026, and the page itself is latch_tree_insert(9). go forth and insert responsibly, bestie 🫶✨🍓