btree_last(9)

💖 NAME 💖

okay so this is the btree_last(9) page from the Kernel API Manual, and it is literally here to help you get the last entry in a btree. Bestie, it’s giving “find the final one” energy. ✨

btree_last — get last entry in btree

---

✨ SYNOPSIS ✨

void * btree_last (struct btree_head *head , struct btree_geo *geo ,
unsigned long *key );

---

🎀 ARGUMENTS 🎀

• head — the btree head, aka the main character of this whole tree situation.
• geo — the btree geometry. Yes, geometry. It’s the shape-related info for the btree. 🦋
• key — the last key; when there’s a last entry, its key gets stored here.

---

🦋 DESCRIPTION 🦋

So btree_last() returns the last entry in the btree, and it sets key to the key of that entry. Slay. 👑

If the tree is empty, it returns NULL — and in that case, key is not changed. Not even a little. 💅

---

🌈 SEE ALSO 🌈

Kernel file ./include/linux/btree.h is right here in the mix, bestie:

• B+Tree basics(9)
• struct btree_head(9)
• btree_alloc(9)
• btree_free(9)
• btree_init_mempool(9)
• btree_init(9)
• btree_destroy(9)
• btree_lookup(9)
• btree_insert(9)
• btree_update(9)
• btree_remove(9)
• btree_merge(9)
• btree_get_prev(9)

---

Signing off from the ./include/linux source, October 2026 edition — and that’s the whole btree_last(9) moment, periodt. 🫶💖