> -Original Message-
> From: Ola Liljedahl [mailto:ola.liljed...@arm.com]
> Sent: Saturday, June 15, 2019 4:00 PM
> To: Honnappa Nagarahalli ; Richardson,
> Bruce ; Eads, Gage ;
> dev@dpdk.org
> Cc: nd
> Subject: Re: [RFC,v2] lfring: lock-free ring buffer
>
> On Wed, 2019-06-05 at 18:21
On Wed, 2019-06-05 at 18:21 +, Eads, Gage wrote:
> Hi Ola,
>
> Is it possible to add burst enqueue and dequeue functions as well, so we can
> plug this into a mempool handler?
Proper burst enqueue is difficult or at least not very efficient.
> Besides the mempool handler, I think the all-or-
Hi Ola,
Is it possible to add burst enqueue and dequeue functions as well, so we can
plug this into a mempool handler? Besides the mempool handler, I think the
all-or-nothing semantics would be useful for applications. Besides that, this
RFC looks good at a high level.
For a complete submissio
Lock-free MP/MC ring buffer with SP/SC options.
The ring buffer metadata only maintains one set of head and tail
indexes. Tail is updated on enqueue, head is updated on dequeue.
The ring slots between head and tail always contains valid (unconsumed)
slots.
Each ring slot consists of a struct of dat
4 matches
Mail list logo
