[dpdk-dev] Efficient deletion in rte_hash

[Tom Barbette]

Hi all,

In an ageing scenario, is there a faster way than calling 
rte_hash_del_key() to delete an entry when we have the position (the 
result of rte_hash_lookup()) on hand?

Particularly, with and without CONCURRENCY_LF set.

For instance, is it correct to call rte_hash_free_key_with_position() 
with the position (the result of rte_hash_lookup())? I guess not.

Thanks,

Tom