STRUCT LATCH_TREE_OPS(9)

💅 struct latch_tree_ops(9)

okay so bestie, welcome to the Kernel API Manual — this one's about struct latch_tree_ops, which is literally just the little bundle of function pointers that tells a latch tree how to order itself. no cap, that's the whole vibe. 🎀

---

✨ NAME ✨

struct latch_tree_ops — the operators that define the tree order 🌸

---

🦋 SYNOPSIS 🦋

struct latch_tree_ops {
    bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b);
    int (*comp)(void *key,                 struct latch_tree_node *b);
 };

---

💅 Members 💅

• less — this one's for insertion, periodt. it hands you the (partial) order between two elements. 🫶
• comp — this one's for lookups. it gives you the order between the search key and an element. 🔍

---

👑 Description 👑

ok so these two operators are lowkey in a whole relationship with each other, and it goes like this:

comp(a->key,b) < 0  := less(a,b) comp(a->key,b) > 0  := less(b,a)
comp(a->key,b) == 0 := !less(a,b) && !less(b,a)

heads up though 🚨 — if these operators define a partial order on the elements, we make no guarantee about which of the elements matching the key actually gets found. so like, don't come for us if you get a different one than you expected, mwah. 💋 go look at latch_tree_find if you wanna know more.

---

🔥 SEE ALSO 🔥

• Kernel file ./include/linux/rbtree_latch.h
• latch_tree_insert(9)
• latch_tree_erase(9)
• latch_tree_find(9)

---

k bye bestie, this page lives in ./include/linux, comes from the Kernel API Manual era of October 2026, and it's still serving struct latch_tree_ops(9) energy 💜✨ go slay your rbtree latches 🧚‍♀️