[dpdk-dev] [PATCH v2] mempool: improve cache search

2015-07-15 Thread Olivier MATZ
04 AM >>> To: dev at dpdk.org >>> Subject: [dpdk-dev] [PATCH v2] mempool: improve cache search >>> >>> The current way has a few problems: >>> >>> - if cache->len < n, we copy our elements into the cache first, then >>>into obj_ta

[dpdk-dev] [PATCH v2] mempool: improve cache search

2015-07-08 Thread Bruce Richardson
, July 01, 2015 10:04 AM > >>To: dev at dpdk.org > >>Subject: [dpdk-dev] [PATCH v2] mempool: improve cache search > >> > >>The current way has a few problems: > >> > >>- if cache->len < n, we copy our elements into the cache first, then >

[dpdk-dev] [PATCH v2] mempool: improve cache search

2015-07-07 Thread Zoltan Kiss
On 02/07/15 18:07, Ananyev, Konstantin wrote: > > >> -Original Message- >> From: dev [mailto:dev-bounces at dpdk.org] On Behalf Of Zoltan Kiss >> Sent: Wednesday, July 01, 2015 10:04 AM >> To: dev at dpdk.org >> Subject: [dpdk-dev] [PAT

[dpdk-dev] [PATCH v2] mempool: improve cache search

2015-07-03 Thread Olivier MATZ
On 07/03/2015 03:32 PM, Olivier MATZ wrote: > > > On 07/01/2015 11:03 AM, 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

[dpdk-dev] [PATCH v2] mempool: improve cache search

2015-07-03 Thread Olivier MATZ
On 07/01/2015 11:03 AM, 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 ring

[dpdk-dev] [PATCH v2] mempool: improve cache search

2015-07-02 Thread Ananyev, Konstantin
> -Original Message- > From: dev [mailto:dev-bounces at dpdk.org] On Behalf Of Zoltan Kiss > Sent: Wednesday, July 01, 2015 10:04 AM > To: dev at dpdk.org > Subject: [dpdk-dev] [PATCH v2] mempool: improve cache search > > The current way has a few problems: > &

[dpdk-dev] [PATCH v2] mempool: improve cache search

2015-07-01 Thread Zoltan Kiss
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