[dpdk-dev] [PATCH] mempool: improbe cache search

On 30/06/15 12:58, Olivier MATZ wrote: > Hi Zoltan, > > On 06/25/2015 08:48 PM, Zoltan Kiss wrote: >> The current way has a few problems: >> >> - if cache->len < n, we copy our elements into the cache first, then >>into obj_table, that's unnecessary >> - if n >= cache_size (or the backfill fa

[dpdk-dev] [PATCH] mempool: improbe cache search

Hi Zoltan, On 06/25/2015 08:48 PM, Zoltan Kiss wrote: > The current way has a few problems: > > - if cache->len < n, we copy our elements into the cache first, then >into obj_table, that's unnecessary > - if n >= cache_size (or the backfill fails), and we can't fulfil the >request from the

[dpdk-dev] [PATCH] mempool: improbe cache search

The current way has a few problems: - if cache->len < n, we copy our elements into the cache first, then into obj_table, that's unnecessary - if n >= cache_size (or the backfill fails), and we can't fulfil the request from the ring alone, we don't try to combine with the cache - if refill fail