* [dpdk-dev] Efficient deletion in rte_hash
@ 2021-01-27 14:59 Tom Barbette
0 siblings, 0 replies; only message in thread
From: Tom Barbette @ 2021-01-27 14:59 UTC (permalink / raw)
To: dpdk-dev; +Cc: Yipeng Wang, Sameh Gobriel, Bruce Richardson
[-- Attachment #1: Type: text/plain, Size: 398 bytes --]
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2021-01-27 14:59 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2021-01-27 14:59 [dpdk-dev] Efficient deletion in rte_hash Tom Barbette
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).