Commit cf52d52f authored by Thomas Graf's avatar Thomas Graf Committed by David S. Miller
Browse files

rhashtable: Avoid bucket cross reference after removal 



During a resize, when two buckets in the larger table map to
a single bucket in the smaller table and the new table has already
been (partially) linked to the old table. Removal of an element
may result the bucket in the larger table to point to entries
which all hash to a different value than the bucket index. Thus
causing two buckets to point to the same sub chain after unzipping.
This is not illegal *during* the resize phase but after it has
completed.

Keep the old table around until all of the unzipping is done to
allow the removal code to only search for matching hashed entries
during this special period.

Reported-by: default avatarYing Xue <ying.xue@windriver.com>
Fixes: 97defe1e ("rhashtable: Per bucket locks & deferred expansion/shrinking")
Signed-off-by: default avatarThomas Graf <tgraf@suug.ch>
Signed-off-by: default avatarDavid S. Miller <davem@davemloft.net>
parent 7cd10db8

lib/rhashtable.c

+17 −9
Original line number Diff line number Diff line
@@ -415,12 +415,6 @@ int rhashtable_expand(struct rhashtable *ht) 
		unlock_buckets(new_tbl, old_tbl, new_hash);

	}



	/* Publish the new table pointer. Lookups may now traverse

	 * the new table, but they will not benefit from any

	 * additional efficiency until later steps unzip the buckets.

	 */

	rcu_assign_pointer(ht->tbl, new_tbl);



	/* Unzip interleaved hash chains */

	while (!complete && !ht->being_destroyed) {

		/* Wait for readers. All new readers will see the new
@@ -445,6 +439,7 @@ int rhashtable_expand(struct rhashtable *ht) 
		}

	}



	rcu_assign_pointer(ht->tbl, new_tbl);

	synchronize_rcu();



	bucket_table_free(old_tbl);
@@ -627,14 +622,14 @@ bool rhashtable_remove(struct rhashtable *ht, struct rhash_head *obj) 
{

	struct bucket_table *tbl, *new_tbl, *old_tbl;

	struct rhash_head __rcu **pprev;

	struct rhash_head *he;

	struct rhash_head *he, *he2;

	unsigned int hash, new_hash;

	bool ret = false;



	rcu_read_lock();

	tbl = old_tbl = rht_dereference_rcu(ht->tbl, ht);

	new_tbl = rht_dereference_rcu(ht->future_tbl, ht);

	new_hash = head_hashfn(ht, new_tbl, obj);

	new_hash = obj_raw_hashfn(ht, rht_obj(ht, obj));



	lock_buckets(new_tbl, old_tbl, new_hash);

restart:
@@ -647,8 +642,21 @@ restart: 
		}



		ASSERT_BUCKET_LOCK(ht, tbl, hash);



		if (unlikely(new_tbl != tbl)) {

			rht_for_each_continue(he2, he->next, tbl, hash) {

				if (head_hashfn(ht, tbl, he2) == hash) {

					rcu_assign_pointer(*pprev, he2);

					goto found;

				}

			}



			INIT_RHT_NULLS_HEAD(*pprev, ht, hash);

		} else {

			rcu_assign_pointer(*pprev, obj->next);

		}



found:

		ret = true;

		break;

	}

CRA Git | Maintained and supported by SUSTech CRA and CCSE