Commit 8db2509f authored by Jonathan Neuschäfer's avatar Jonathan Neuschäfer Committed by Jakub Kicinski
Browse files

rhashtable: Improve grammar 



Change "a" to "an" according to the usual rules, fix an "if" that
was mistyped as "in", improve grammar in "considerable slow" ->
"considerably slower".

Signed-off-by: default avatarJonathan Neuschäfer <j.neuschaefer@gmx.net>
Reviewed-by: default avatarRandy Dunlap <rdunlap@infradead.org>
Link: https://lore.kernel.org/r/20240329-misc-rhashtable-v1-1-5862383ff798@gmx.net


Signed-off-by: default avatarJakub Kicinski <kuba@kernel.org>
parent d6d647d7

include/linux/rhashtable.h

+5 −5
Original line number Diff line number Diff line
@@ -633,7 +633,7 @@ static inline struct rhash_head *__rhashtable_lookup( 
 * @params:	hash table parameters

 *

 * Computes the hash value for the key and traverses the bucket chain looking

 * for a entry with an identical key. The first matching entry is returned.

 * for an entry with an identical key. The first matching entry is returned.

 *

 * This must only be called under the RCU read lock.

 *
@@ -655,7 +655,7 @@ static inline void *rhashtable_lookup( 
 * @params:	hash table parameters

 *

 * Computes the hash value for the key and traverses the bucket chain looking

 * for a entry with an identical key. The first matching entry is returned.

 * for an entry with an identical key. The first matching entry is returned.

 *

 * Only use this function when you have other mechanisms guaranteeing

 * that the object won't go away after the RCU read lock is released.
@@ -682,7 +682,7 @@ static inline void *rhashtable_lookup_fast( 
 * @params:	hash table parameters

 *

 * Computes the hash value for the key and traverses the bucket chain looking

 * for a entry with an identical key.  All matching entries are returned

 * for an entry with an identical key.  All matching entries are returned

 * in a list.

 *

 * This must only be called under the RCU read lock.
@@ -699,7 +699,7 @@ static inline struct rhlist_head *rhltable_lookup( 
}



/* Internal function, please use rhashtable_insert_fast() instead. This

 * function returns the existing element already in hashes in there is a clash,

 * function returns the existing element already in hashes if there is a clash,

 * otherwise it returns an error via ERR_PTR().

 */

static inline void *__rhashtable_insert_fast(
@@ -1130,7 +1130,7 @@ static inline int rhashtable_remove_fast( 
 *

 * Since the hash chain is single linked, the removal operation needs to

 * walk the bucket chain upon removal. The removal operation is thus

 * considerable slow if the hash table is not correctly sized.

 * considerably slower if the hash table is not correctly sized.

 *

 * Will automatically shrink the table if permitted when residency drops

 * below 30%