rht_for_each(9)

✨ NAME ✨

rht_for_each — iterate over hash chain. This is the rht_for_each(9) page from the Kernel API Manual, bestie, and it's lowkey here to make hash-chain looping make sense. 💅 No cap, the vibe is traversal.

🌸 SYNOPSIS 🌸

okay so the shape of the call is literally this, and you should keep it exact:

rht_for_each (pos , tbl , hash );

🎀 ARGUMENTS 🎀

• pos — the struct rhash_head to use as a loop cursor. main character energy for the loop, fr fr.
• tbl — the struct bucket_table. iconic bucket-table energy.
• hash — the hash value / bucket index. iykyk 💜

🦋 SEE ALSO 🦋

Kernel file: ./include/linux/rhashtable.h — the source-file lore. Then here are all the related pages, in original order, bestie:

• struct bucket_table(9)
• rht_grow_above_75(9)
• rht_shrink_below_30(9)
• rht_grow_above_100(9)
• rht_grow_above_max(9)
• rht_for_each_from(9)
• rht_for_each_entry_from(9)
• rht_for_each_entry(9)
• rht_for_each_entry_safe(9)
• rht_for_each_rcu_from(9)
• rht_for_each_rcu(9)
• rht_for_each_entry_rcu_from(9)
• rht_for_each_entry_rcu(9)
• rhl_for_each_rcu(9)
• rhl_for_each_entry_rcu(9)
• rhashtable_lookup(9)
• rhashtable_lookup_fast(9)
• rhltable_lookup(9)
• rhashtable_insert_fast(9)
• rhltable_insert_key(9)
• rhltable_insert(9)
• rhashtable_lookup_insert_fast(9)
• rhashtable_lookup_get_insert_fast(9)
• rhashtable_lookup_insert_key(9)
• rhashtable_lookup_get_insert_key(9)
• rhashtable_remove_fast(9)
• rhltable_remove(9)
• rhashtable_replace_fast(9)
• rhltable_walk_enter(9)
• rhltable_free_and_destroy(9)

okay that's the whole page, bestie — slay ✨ Source/version: ./include/linux · date: October 2026. 🫶💅