rht_grow_above_100(9)

💅 rht_grow_above_100

okay so bestie, this is a page from the Kernel API Manual, and honestly? it's a tiny little function but it's iconic in its own way. so let's get into it ✨

✨ NAME ✨

rht_grow_above_100 — returns true if nelems > table-size

like, that's the whole vibe. it answers one (1) question and it answers it with confidence 💁‍♀️

🌸 SYNOPSIS 🌸

bool rht_grow_above_100 (const struct rhashtable *ht , const struct
       bucket_table *tbl );

so it hands you back a bool, and it takes two const pointers — it's not gonna touch ur stuff, it's just gonna look 👀

🎀 ARGUMENTS 🎀

• ht — the hash table. the main character, the whole reason we're here 🫶
• tbl — the current table. like, the table right now, the present-tense one 🦋

💜 SEE ALSO 💜

the whole friend group, fr fr — go say hi to all of them:

• Kernel file ./include/linux/rhashtable.h struct bucket_table(9)
• rht_grow_above_75(9)
• rht_shrink_below_30(9)
• rht_grow_above_max(9)
• rht_for_each_from(9)
• rht_for_each(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)

ok that's literally it, she's short and she knows it 💅 this page lives in ./include/linux, the version vibes are from October 2026, and yes — the page you just read was rht_grow_above_100(9) the whole time 😭💖 go forth and resize ur tables, bestie 🌈⭐