So with DPDK 1.7 there are 2 separate implementations - one is the rte_hash which does not support LRU (at least to my understanding - I could be wrong here) and then there is the librte_table library which has support for LRU in a hash table. I m a little confused as to which one you are referring to Matthew.
-----Original Message----- From: Matthew Hall [mailto:mh...@mhcomputing.net] Sent: Monday, September 22, 2014 6:34 PM To: Saha, Avik (AWS) Cc: dev at dpdk.org Subject: Re: [dpdk-dev] LRU using DPDK 1.7 On Tue, Sep 23, 2014 at 01:08:21AM +0000, Saha, Avik (AWS) wrote: > I was wondering if there is way to use the rte_table_hash_lru without > building a pipeline - Basically using the same hash table like > functionality of add, delete and lookup without setting up a pipeline > and connect it to ports etc. I've been finding that rte_hash is designed only for some very specialized purposes. It doesn't work well if you use unexpected sizes of keys or want behavior that isn't precisely doing what the designers of the hash used it for... it's not very general-purpose. I did try to point out one example of the issue but I didn't get much response yet to my questions about its limitations and whether a more general-purpose table was available, or at least some discussion what rte_hash is for and what it's not for. Matthew.
