Commit 0c6f69a5 authored by NeilBrown's avatar NeilBrown Committed by David S. Miller

rhashtable: remove outdated comments about grow_decision etc

grow_decision and shink_decision no longer exist, so remove
the remaining references to them.
Acked-by: default avatarHerbert Xu <herbert@gondor.apana.org.au>
Signed-off-by: default avatarNeilBrown <neilb@suse.com>
Signed-off-by: default avatarDavid S. Miller <davem@davemloft.net>
parent 8c2320e8
...@@ -836,9 +836,8 @@ static inline void *__rhashtable_insert_fast( ...@@ -836,9 +836,8 @@ static inline void *__rhashtable_insert_fast(
* *
* It is safe to call this function from atomic context. * It is safe to call this function from atomic context.
* *
* Will trigger an automatic deferred table resizing if the size grows * Will trigger an automatic deferred table resizing if residency in the
* beyond the watermark indicated by grow_decision() which can be passed * table grows beyond 70%.
* to rhashtable_init().
*/ */
static inline int rhashtable_insert_fast( static inline int rhashtable_insert_fast(
struct rhashtable *ht, struct rhash_head *obj, struct rhashtable *ht, struct rhash_head *obj,
...@@ -866,9 +865,8 @@ static inline int rhashtable_insert_fast( ...@@ -866,9 +865,8 @@ static inline int rhashtable_insert_fast(
* *
* It is safe to call this function from atomic context. * It is safe to call this function from atomic context.
* *
* Will trigger an automatic deferred table resizing if the size grows * Will trigger an automatic deferred table resizing if residency in the
* beyond the watermark indicated by grow_decision() which can be passed * table grows beyond 70%.
* to rhashtable_init().
*/ */
static inline int rhltable_insert_key( static inline int rhltable_insert_key(
struct rhltable *hlt, const void *key, struct rhlist_head *list, struct rhltable *hlt, const void *key, struct rhlist_head *list,
...@@ -890,9 +888,8 @@ static inline int rhltable_insert_key( ...@@ -890,9 +888,8 @@ static inline int rhltable_insert_key(
* *
* It is safe to call this function from atomic context. * It is safe to call this function from atomic context.
* *
* Will trigger an automatic deferred table resizing if the size grows * Will trigger an automatic deferred table resizing if residency in the
* beyond the watermark indicated by grow_decision() which can be passed * table grows beyond 70%.
* to rhashtable_init().
*/ */
static inline int rhltable_insert( static inline int rhltable_insert(
struct rhltable *hlt, struct rhlist_head *list, struct rhltable *hlt, struct rhlist_head *list,
...@@ -922,9 +919,8 @@ static inline int rhltable_insert( ...@@ -922,9 +919,8 @@ static inline int rhltable_insert(
* *
* It is safe to call this function from atomic context. * It is safe to call this function from atomic context.
* *
* Will trigger an automatic deferred table resizing if the size grows * Will trigger an automatic deferred table resizing if residency in the
* beyond the watermark indicated by grow_decision() which can be passed * table grows beyond 70%.
* to rhashtable_init().
*/ */
static inline int rhashtable_lookup_insert_fast( static inline int rhashtable_lookup_insert_fast(
struct rhashtable *ht, struct rhash_head *obj, struct rhashtable *ht, struct rhash_head *obj,
...@@ -981,9 +977,8 @@ static inline void *rhashtable_lookup_get_insert_fast( ...@@ -981,9 +977,8 @@ static inline void *rhashtable_lookup_get_insert_fast(
* *
* Lookups may occur in parallel with hashtable mutations and resizing. * Lookups may occur in parallel with hashtable mutations and resizing.
* *
* Will trigger an automatic deferred table resizing if the size grows * Will trigger an automatic deferred table resizing if residency in the
* beyond the watermark indicated by grow_decision() which can be passed * table grows beyond 70%.
* to rhashtable_init().
* *
* Returns zero on success. * Returns zero on success.
*/ */
...@@ -1134,8 +1129,8 @@ static inline int __rhashtable_remove_fast( ...@@ -1134,8 +1129,8 @@ static inline int __rhashtable_remove_fast(
* walk the bucket chain upon removal. The removal operation is thus * walk the bucket chain upon removal. The removal operation is thus
* considerable slow if the hash table is not correctly sized. * considerable slow if the hash table is not correctly sized.
* *
* Will automatically shrink the table via rhashtable_expand() if the * Will automatically shrink the table if permitted when residency drops
* shrink_decision function specified at rhashtable_init() returns true. * below 30%.
* *
* Returns zero on success, -ENOENT if the entry could not be found. * Returns zero on success, -ENOENT if the entry could not be found.
*/ */
...@@ -1156,8 +1151,8 @@ static inline int rhashtable_remove_fast( ...@@ -1156,8 +1151,8 @@ static inline int rhashtable_remove_fast(
* walk the bucket chain upon removal. The removal operation is thus * walk the bucket chain upon removal. The removal operation is thus
* considerable slow if the hash table is not correctly sized. * considerable slow if the hash table is not correctly sized.
* *
* Will automatically shrink the table via rhashtable_expand() if the * Will automatically shrink the table if permitted when residency drops
* shrink_decision function specified at rhashtable_init() returns true. * below 30%
* *
* Returns zero on success, -ENOENT if the entry could not be found. * Returns zero on success, -ENOENT if the entry could not be found.
*/ */
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment