wl_tree_add(9)

📦 version 7.3.1, in nixpkgs unstable

💅 wl_tree_add(9) — the Kernel API Manual page you actually wanna read 🎀

okay so this is wl_tree_add(9) straight out of the Kernel API Manual, and honestly? she's a tiny little function with main character energy. no cap, one job, does it slayfully. let's get into it bestie 🦋

✨ NAME ✨

wl_tree_add — add a wear-leveling entry to a WL RB-tree 💖

like… that's it. that's the whole vibe. she adds one (1) wear-leveling entry to a wear-leveling red-black tree and she goes home. iconic.

🌸 SYNOPSIS 🌸

void wl_tree_add (struct ubi_wl_entry *e , struct rb_root *root );

returns void, meaning she gives you NOTHING back except the satisfaction of a job well done. we respect that fr fr 💅

🎀 ARGUMENTS 🎀

  • e — the wear-leveling entry to add 🫶 this is the little guy going into the tree.
  • root — the root of the tree 🌳 like, the actual struct rb_root she's gonna live in.

⭐ DESCRIPTION ⭐

okay so here's the tea, and it's important so listen up 👑

Note, we use (erase counter, physical eraseblock number) pairs as keys in the ubi->used and ubi->free RB-trees. that's the whole key situation — erase counter first, physical eraseblock number second, and that pair is what sorts everything in those two trees. periodt 💀✨

no like literally, that's the note. it's giving "small but crucial detail" and we're obsessed.

🦋 SEE ALSO 🦋

the kernel file lives at ./drivers/mtd/ubi/wl.c and here is the entire friend group, no one left behind, not a single one 🙈💜

ngl bestie, this page is short but she ate. add your entry, respect the (erase counter, physical eraseblock number) key, and go touch some grass 🌈🌸

mwah 💋 — brought to you by ./drivers/mtd/ubi, October 2026, and the letter "R" for red-black tree. 🧚‍♀️🍓

📦 where this page comes from