rhashtable_l...p_insert_key(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

🌸 rhashtable_l...p_insert_key(9) 🌸

okay so bestie, this is a page straight out of the Kernel API Manual β€” yes, the real one, section 9, kernel-space girlies only πŸ’… β€” and it's all about rhashtable_lookup_insert_key. Cute name, right? It literally says what it does: look it up, insert it, with an explicit key. Periodt.


✨ NAME ✨

rhashtable_lookup_insert_key β€” search and insert object to hash table with explicit key πŸ”βž•

Like, you're doing both things. At once. Main character energy.


πŸŽ€ SYNOPSIS πŸŽ€

int rhashtable_lookup_insert_key (struct rhashtable *ht , const void
*key , struct rhash_head *obj , const struct rhashtable_params params );

She returns an int, she takes four things, she's booked and busy πŸ¦‹


πŸ’– ARGUMENTS πŸ’–

  • ht β€” hash table. the vibes container, the whole point 🫢
  • key β€” key. the key. the thing you're keying on. iconic behavior honestly
  • obj β€” pointer to hash head inside object. note: inside the object, bestie, it's embedded, don't go allocating a separate one 😭
  • params β€” hash table parameters. the settings, the config, the little rules of the universe this table lives in ✨

🌈 DESCRIPTION 🌈

Lookups may occur in parallel with hashtable mutations and resizing. no cap β€” she's built concurrent, so reading and messing with the table can happen at the same time πŸ’€πŸ”₯

Will trigger an automatic deferred table resizing if residency in the table grows beyond 70%. that's the threshold, and she will act on it πŸ™ˆ

Returns zero on success. zero = slay, we love that for you πŸ‘‘


πŸ¦‹ SEE ALSO πŸ¦‹

okay this list is long, hydrate first πŸ“ β€” from the Kernel file ./include/linux/rhashtable.h:

go read all thirty of them. i'll wait. mwah πŸ’œ


source: ./include/linux  Β·  date: October 2026  Β·  manual: rhashtable_l...p_insert_key(9) β€” that's the whole page bestie, go forth and insert responsibly πŸ§šβ€β™€οΈβ­πŸ’…

πŸ“¦ where this page comes from