__rhashtable_walk_find_next(9)

📦 version 7.3.1, in nixpkgs unstable

✨ __rhashtable_walk_find_next ✨

okay bestie, so we're deep in the Kernel API Manual today 🫶 this one's a (9) section page, and it's literally about finding the next element in a hash table while you're walking it. short page, big main character energy. let's go 💅

🌸 NAME 🌸

__rhashtable_walk_find_next — Find the next element in a table (or the first one in case of a new walk).

no cap, that's the whole vibe: next element, or the very first one if you're just starting the walk. 🎀

🦋 SYNOPSIS 🦋

void * __rhashtable_walk_find_next (struct rhashtable_iter *iter );

that's it. one function, one argument, and it hands you back a void *. slay ✨

💖 ARGUMENTS 💖

  • iter — Hash table iterator. that's your iterator bestie, the thing that keeps track of where you are in the walk. it's a struct rhashtable_iter *, so you're passing a pointer to it, not a copy. periodt. 👑

🔥 DESCRIPTION 🔥

So here's the tea ☕ — this function returns the found object, or NULL when the end of the table is reached. that's the "we're done here, nothing left" signal 🫶

and then it also returns -EAGAIN if a resize event occurred. yes, from a void * function, yes that's what the docs say, and yes i'm as obsessed with it as you are 😭 that's the "the table changed shape under you, try again" situation. don't ignore it ngl.

💀 lowkey important: NULL = end of table. -EAGAIN = a resize happened. two completely different vibes, don't mix them up bestie.

🌈 SEE ALSO 🌈

like, the whole rhashtable walk friend group fr fr 🧚💜 go read them too, iykyk.

and that's the page!! mwah 💋 this one lives under ./lib, dated October 2026, and it's filed as __rhashtable_walk_find_next(9) — so if you need to find it again, you know exactly where to look 🌟 bye bestie, happy walking 🎀💖

📦 where this page comes from