rhashtable_walk_enter(9)

🎀 NAME 🎀

okay so bestie, welcome to the Kernel API Manual page for rhashtable_walk_enter — literally the “Initialise an iterator” girlie 💅✨

✨ SYNOPSIS ✨

void rhashtable_walk_enter (struct rhashtable *ht , struct
       rhashtable_iter *iter );

🫶 ARGUMENTS 🫶

• ht — the table you're walking over, bestie 🌸
• iter — your hash table iterator 🎀

💖 DESCRIPTION 💖

This function prepares a hash table walk. It's giving setup era, no cap ✨

⚠️ Note that if you restart a walk after rhashtable_walk_stop you may see the same object twice. Also, you may miss objects if there are removals in between rhashtable_walk_stop and the next call to rhashtable_walk_start. So yeah, the vibe check can get a little wobbly there 😭

For a completely stable walk you should construct your own data structure outside the hash table. That's the move for perfect stability, fr fr 🦋

This function may be called from any process context, including non-preemptible context — but cannot be called from softirq or hardirq context. Nope, not happening, periodt 💀

You must call rhashtable_walk_exit after this function returns. Like, mandatory bestie behavior 🫶

👑 SEE ALSO 👑

Kernel file ./lib/rhashtable.c and these iconic friends:

• rhashtable_shrink(9)
• rhashtable_next_key(9)
• rhashtable_walk_exit(9)
• rhashtable_walk_start_check(9)
• __rhashtable_walk_find_next(9)
• rhashtable_walk_next(9)
• rhashtable_walk_peek(9)
• rhashtable_walk_stop(9)
• rhashtable_free_and_destroy(9)

and that's the page, bestie 💖 source/version: ./lib, date: October 2026, manual page: rhashtable_walk_enter(9) — slay, bye ✨🎀