vdo_compute_...forest_pages(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

πŸ’… vdo_compute_new_forest_pages β€” Kernel API Manual ✨

Okay so bestie, we're in the kernel docs, specifically the vdo_compute_...forest_pages(9) page from the Kernel API Manual, and this one is lowkey a math girlie. Let's get into it πŸŽ€


✨ NAME ✨

vdo_compute_new_forest_pages β€” computes the number of pages that have to be allocated at each level so the forest can grow to a new number of entries πŸŒ²πŸ’–


πŸ¦‹ SYNOPSIS πŸ¦‹

block_count_t vdo_compute_new_forest_pages (root_count_t root_count ,
struct boundary *old_sizes , block_count_t entries , struct boundary
*new_sizes );

That's the whole vibe, no cap. Now let's meet the cast πŸ‘‘


🌸 ARGUMENTS 🌸

  • root_count β€” the number of block map roots. Like, how many roots we're working with, periodt 🌱
  • old_sizes β€” the sizes of the old tree segments. The before pics πŸ“Έ
  • entries β€” the new number of entries the block map must address. This is the glow-up target 🎯
  • new_sizes β€” the sizes of the new tree segments. The after pics ✨

🫢 RETURN 🫢

It hands you back the total number of non-leaf pages required. That's it, that's the answer, slay πŸ’…


πŸ‘‘ SEE ALSO πŸ‘‘

Bestie there are so many friends on this list, and they're all in the kernel file ./drivers/md/dm-vdo/encodings.c β€” every single one, here we go:


Mwah πŸ’‹ that's the page! Sending you off with love from ./drivers/md/dm-vdo, dated October 2026, from your fave vdo_compute_...forest_pages(9) girlie. Go grow that forest, bestie πŸŒˆπŸŒ²πŸ’œ

πŸ“¦ where this page comes from