memory barriers in rte_ring
Hi,
The commit 286bd05bf7 [1] removed the memory barriers in the ring functions. This patch is present in DPDK since version 1.4.0r0, so I guess it does not cause any issue.
But after checking the excellent Linux kernel documentation about memory barriers [2], I'm wondering why memory barriers would not be required in that case.
To illustrate the previous behavior (before dpdk 1.4):
ring_enqueue()
- move producer_head to reserve space in ring (atomically if multi producers)
- write objects between producer_head and producer_tail
- wmb() to ensure that STORE operations are issued
- write producer_tail
ring_dequeue()
- move consumer_head (atomically if multi consumers)
- rmb() to ensure that LOAD operations are issued: the read of consumer_head must occur before the reading of objects ptrs. In fact, rmb() is probably not needed here because knowing the value of consumer_head is required before reading the objects table.
- read objects between consumer_head and consumer_tail
- write consumer_tail
The memory barriers have been removed, but in my understanding at least the wmb() would be needed according to the generic memory barrier documentation. Maybe this is not needed on newest Intel processors? Could anyone from Intel enlight me on this?
Thanks & regards,
Olivier
[2] http://lxr.free-electrons.com/source/Documentation/memory-barriers.txt
A message that is not in the archive (sent off-list or not yet received): [email protected]
Quoted 34 lines · On Thu, 27 Mar 2014 17:48:21 +0100 Olivier MATZ…
Hi,
The commit
286bd05bf7[1] removed the memory barriers in the ring functions. This patch is present in DPDK since version 1.4.0r0, so I guess it does not cause any issue.But after checking the excellent Linux kernel documentation about memory barriers [2], I'm wondering why memory barriers would not be required in that case.
To illustrate the previous behavior (before dpdk 1.4):
ring_enqueue()
- moveproducer_headto reserve space in ring (atomically if multi producers)
- write objects betweenproducer_headandproducer_tail
-wmb()to ensure that STORE operations are issued
- writeproducer_tail
ring_dequeue()
- moveconsumer_head(atomically if multi consumers)
-rmb()to ensure that LOAD operations are issued: the read ofconsumer_headmust occur before the reading of objects ptrs. In fact,rmb()is probably not needed here because knowing the value ofconsumer_headis required before reading the objects table.
- read objects betweenconsumer_headandconsumer_tail
- writeconsumer_tailThe memory barriers have been removed, but in my understanding at least the
wmb()would be needed according to the generic memory barrier documentation. Maybe this is not needed on newest Intel processors? Could anyone from Intel enlight me on this?
Quoted 8 lines
Thanks & regards,
Olivier[2] http://lxr.free-electrons.com/source/Documentation/memory-barriers.txt
Short answer, only a compiler barrier is necessary.
Long answer: for the multple CPU access ring, it is equivalent to smp_wmb and smp_rmb
in Linux kernel. For x86 where DPDK is used, this can normally be replaced by simpler compiler barrier. In kernel there is a special flage X86_OOSTORE which is only enabled for a few special cases, for most cases it is not. When cpu doesnt do out of order stores, there are no cases where other cpu will see wrong state.
Hi Stephen,
Quoted 5 lines · Stephen Hemminger
Long answer: for the multple CPU access ring, it is equivalent to
smp_wmbandsmp_rmb
in Linux kernel. For x86 where DPDK is used, this can normally be replaced by simpler compiler barrier. In kernel there is a special flageX86_OOSTOREwhich is only enabled for a few special cases, for most cases it is not. When cpu doesnt do out of order stores, there are no cases where other cpu will see wrong state.
Thank you for this clarification.
So, if I understand properly, all usages of rte_*mb() sequencing memory operations between CPUs could be replaced by a compiler barrier. On the other hand, if the memory is also accessed by a device, a memory barrier has to be used.
Olivier
A message that is not in the archive (sent off-list or not yet received): [email protected]
Quoted 9 lines · On Thu, 27 Mar 2014 20:47:37 +0100 Olivier MATZ…
Hi Stephen,
Quoted 5 lines · Stephen Hemminger
Long answer: for the multple CPU access ring, it is equivalent to
smp_wmbandsmp_rmb
in Linux kernel. For x86 where DPDK is used, this can normally be replaced by simpler compiler barrier. In kernel there is a special flageX86_OOSTOREwhich is only enabled for a few special cases, for most cases it is not. When cpu doesnt do out of order stores, there are no cases where other cpu will see wrong state.
Quoted 9 lines
Thank you for this clarification.
So, if I understand properly, all usages of rte_*mb() sequencing memory operations between CPUs could be replaced by a compiler barrier. On the other hand, if the memory is also accessed by a device, a memory barrier has to be used.
Olivier
I think so for the current architecture that DPDK runs on. It might be good to abstract this in some way for eventual users in other environments.
One caveat - a compiler_barrier should be enough when both sides are using strongly-ordered memory operations (as in the case of the rings). Weakly ordered operations will still need fencing.
-Venky
-----Original Message-----
From: dev [mailto:[email protected]] On Behalf Of Stephen Hemminger
Sent: Thursday, March 27, 2014 1:20 PM
To: Olivier MATZ
Cc: [email protected]
Subject: Re: [dpdk-dev] memory barriers in rte_ring
Quoted 9 lines · On Thu, 27 Mar 2014 20:47:37 +0100 Olivier MATZ…
Hi Stephen,
Quoted 5 lines · Stephen Hemminger
Long answer: for the multple CPU access ring, it is equivalent to
smp_wmbandsmp_rmb
in Linux kernel. For x86 where DPDK is used, this can normally be replaced by simpler compiler barrier. In kernel there is a special flageX86_OOSTOREwhich is only enabled for a few special cases, for most cases it is not. When cpu doesnt do out of order stores, there are no cases where other cpu will see wrong state.
Quoted 9 lines
Thank you for this clarification.
So, if I understand properly, all usages of rte_*mb() sequencing memory operations between CPUs could be replaced by a compiler barrier. On the other hand, if the memory is also accessed by a device, a memory barrier has to be used.
Olivier
I think so for the current architecture that DPDK runs on. It might be good to abstract this in some way for eventual users in other environments.