[dpdk-dev] Need your thoughts on DPDK hash table / DPDK lookup/insert API's

[Yeddula, Avinash]

Hello All,


1.      I've a scenario where I need to walk the entire Hash table to retrieve the data.  I'm currently using DPDK extensible bucket hash in the rte_table library of packet framework.

Since I'll not be storing the keys anywhere else, I don't have a way to walk hash table.

I'm planning to write one for my application, but just wanted to check with the DPDK community on their thoughts.



2.      I have a scenario where the components whose are not part of the pipeline needs to call the DPDK lookup/add apis. Moreover they are interested in lookup/insert one entry at a time. With the current approach, I know everything works in bursts to achieve more/better performance.



Currently a lookup api's looks like this.

static int rte_table_array_lookup( void *table,    struct rte_mbuf **pkts,    uint64_t pkts_mask,    uint64_t *lookup_hit_mask,    void **entries)



New addition to the existing lookup,  I would like it to be something like this (not exactly, something similar).   With this the outside guy doesn't have to construct "rte_mbuf and put the key in the metadata for the DPDK lookup API to act "

static int rte_table_array_single_pkt_lookup( void *table,   void *key,   void *entry)



Any thoughts on  adding these 2 items officially to dpdk library.



Thanks

-Avinash