rhashtable_lookup_fast(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

πŸ’– NAME β€” rhashtable_lookup_fast(9) from the Kernel API Manual πŸ’–

okay so bestie, this is the Kernel API Manual page for rhashtable_lookup_fast, and it does exactly what it says on the tin: search hash table, without RCU read lock. no cap, that's the whole NAME vibe. πŸ¦‹


✨ SYNOPSIS ✨

void * rhashtable_lookup_fast (struct rhashtable *ht , const void *key ,
       const struct rhashtable_params params );

πŸŽ€ ARGUMENTS πŸŽ€

  • ht β€” hash table. the main character. πŸ‘‘
  • key β€” the pointer to the key. literally the pointer to the key. πŸ”‘
  • params β€” hash table parameters. the settings, the vibe config. βš™οΈ

🌸 DESCRIPTION 🌸

okay so here's the tea: it computes the hash value for the key, then traverses the bucket chain looking for an entry with an identical key. the first matching entry is returned. that's it, that's the lookup. πŸ’…

🚨 real talk, bestie: only use this function when you have other mechanisms guaranteeing that the object won't go away after the RCU read lock is released. like, do not just yeet this and hope the object stays alive. that is not the move. πŸ™ˆ

it returns the first entry on which the compare function returned true. periodt. βœ…

🌈 SEE ALSO 🌈

peep the kernel file ./include/linux/rhashtable.h, plus struct bucket_table(9) and the whole squad:

source/version: ./include/linux Β· date: October 2026 Β· page: rhashtable_lookup_fast(9) β€” mwah πŸ’‹

πŸ“¦ where this page comes from