* [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 --]
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.
^ 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
DPDK patches and discussions
This inbox may be cloned and mirrored by anyone:
git clone --mirror https://inbox.dpdk.org/dev/0 dev/git/0.git
# If you have public-inbox 1.1+ installed, you may
# initialize and index your mirror using the following commands:
public-inbox-init -V2 dev dev/ https://inbox.dpdk.org/dev \
Example config snippet for mirrors.
Newsgroup available over NNTP:
AGPL code for this site: git clone https://public-inbox.org/public-inbox.git