befs_bt_keylen_index(9)

💖 NAME 💖

okay so this is the manual page for befs_bt_keylen_index(9) from the Kernel API Manual, and the function is befs_bt_keylen_index — Finds start of keylen index in a node. no cap, that's the whole quest. ✨

🌸 SYNOPSIS 🌸

fs16 * befs_bt_keylen_index (struct befs_btree_node *node );

🎀 ARGUMENTS 🎀

• node — Pointer to the node structure to find the keylen index within. you hand over the node, it goes looking inside. 💅

🦋 DESCRIPTION 🦋

It returns a pointer to the start of the key length index array of the B+tree node *node. that's it, that's the vibe. 🫶

And here's the iconic quote, kept exactly as it is:

"The length of all the keys in the node is added to the size of the header and then rounded up to a multiple of four to get the beginning of the key length index" (p.88, practical filesystem design).

except plot twist, bestie: rounding up to 8 works, and rounding up to 4 doesn't. 😭 so yeah, that's the little chaos detail. not me side-eyeing a multiple of four. 💀

🌈 SEE ALSO 🌈

Kernel file ./fs/befs/btree.c, plus the whole little friend group:

• befs_bt_read_super(9)
• befs_bt_read_node(9)
• befs_btree_find(9)
• befs_find_key(9)
• befs_btree_read(9)
• befs_btree_seekleaf(9)
• befs_leafnode(9)
• befs_bt_valarray(9)
• befs_bt_keydata(9)
• befs_bt_get_key(9)
• befs_compare_strings(9)

🫶 source/version: ./fs/befs · date: October 2026 · bye bestie, slay responsibly 💅