hash: fix false zero signature key hit lookup
This commit fixes a corner case scenario. When a key is deleted, its signature in the hash table gets clear, which should prevent a lookup of that same key, unless the signature of the key is all zeroes. In that case, there will be a match, and key would be compared against the key that is in the table (which does not get cleared, as the performance penalty would be high), resulting in a wrong hit. To prevent this from happening, the key index associated to that entry should be set to zero when deleting it, so in case that same key is looked up just after a deletion, it will point to the dummy key slot, which guarantees a miss. Fixes: 48a399119619 ("hash: replace with cuckoo hash implementation") Signed-off-by: Pablo de Lara <pablo.de.lara.guarch@intel.com> Acked-by: Saikrishna Edupuganti <saikrishna.edupuganti@intel.com>
This commit is contained in:
parent
1621f69abb
commit
24c20a7221
@ -816,6 +816,7 @@ __rte_hash_del_key_with_hash(const struct rte_hash *h, const void *key,
|
||||
unsigned i;
|
||||
struct rte_hash_bucket *bkt;
|
||||
struct rte_hash_key *k, *keys = h->key_store;
|
||||
int32_t ret;
|
||||
|
||||
bucket_idx = sig & h->bucket_bitmask;
|
||||
bkt = &h->buckets[bucket_idx];
|
||||
@ -833,7 +834,9 @@ __rte_hash_del_key_with_hash(const struct rte_hash *h, const void *key,
|
||||
* Return index where key is stored,
|
||||
* substracting the first dummy index
|
||||
*/
|
||||
return bkt->key_idx[i] - 1;
|
||||
ret = bkt->key_idx[i] - 1;
|
||||
bkt->key_idx[i] = 0;
|
||||
return ret;
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -856,7 +859,9 @@ __rte_hash_del_key_with_hash(const struct rte_hash *h, const void *key,
|
||||
* Return index where key is stored,
|
||||
* substracting the first dummy index
|
||||
*/
|
||||
return bkt->key_idx[i] - 1;
|
||||
ret = bkt->key_idx[i] - 1;
|
||||
bkt->key_idx[i] = 0;
|
||||
return ret;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
Loading…
x
Reference in New Issue
Block a user