€•Oƒ      Œsphinx.addnodes”Œdocument”“”)”}”(Œ	rawsource”Œ ”Œchildren”]”(Œtranslations”ŒLanguagesNode”“”)”}”(hhh]”(h Œpending_xref”“”)”}”(hhh]”Œdocutils.nodes”ŒText”“”ŒChinese (Simplified)”…””}”Œparent”hsbaŒ
attributes”}”(Œids”]”Œclasses”]”Œnames”]”Œdupnames”]”Œbackrefs”]”Œ	refdomain”Œstd”Œreftype”Œdoc”Œ	reftarget”Œ-/translations/zh_CN/core-api/circular-buffers”Œmodname”NŒ	classname”NŒrefexplicit”ˆuŒtagname”hhhubh)”}”(hhh]”hŒChinese (Traditional)”…””}”hh2sbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ-/translations/zh_TW/core-api/circular-buffers”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒItalian”…””}”hhFsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ-/translations/it_IT/core-api/circular-buffers”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒJapanese”…””}”hhZsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ-/translations/ja_JP/core-api/circular-buffers”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒKorean”…””}”hhnsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ-/translations/ko_KR/core-api/circular-buffers”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒSpanish”…””}”hh‚sbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ-/translations/sp_SP/core-api/circular-buffers”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubeh}”(h]”h ]”h"]”h$]”h&]”Œcurrent_language”ŒEnglish”uh1h
hhŒ	_document”hŒsource”NŒline”NubhŒsection”“”)”}”(hhh]”(hŒtitle”“”)”}”(hŒCircular Buffers”h]”hŒCircular Buffers”…””}”(hh¨hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hh£hžhhŸŒG/var/lib/git/docbuild/linux/Documentation/core-api/circular-buffers.rst”h KubhŒ
field_list”“”)”}”(hhh]”(hŒfield”“”)”}”(hhh]”(hŒ
field_name”“”)”}”(hŒAuthor”h]”hŒAuthor”…””}”(hhÃhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÁhh¾hŸh¶h K ubhŒ
field_body”“”)”}”(hŒ#David Howells <dhowells@redhat.com>”h]”hŒ	paragraph”“”)”}”(hhÕh]”(hŒDavid Howells <”…””}”(hhÙhžhhŸNh NubhŒ	reference”“”)”}”(hŒdhowells@redhat.com”h]”hŒdhowells@redhat.com”…””}”(hhâhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”Œmailto:dhowells@redhat.com”uh1hàhhÙubhŒ>”…””}”(hhÙhžhhŸNh Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KhhÓubah}”(h]”h ]”h"]”h$]”h&]”uh1hÑhh¾ubeh}”(h]”h ]”h"]”h$]”h&]”uh1h¼hŸh¶h Khh¹hžhubh½)”}”(hhh]”(hÂ)”}”(hŒAuthor”h]”hŒAuthor”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÁhj  hŸh¶h K ubhÒ)”}”(hŒ*Paul E. McKenney <paulmck@linux.ibm.com>

”h]”hØ)”}”(hŒ(Paul E. McKenney <paulmck@linux.ibm.com>”h]”(hŒPaul E. McKenney <”…””}”(hj  hžhhŸNh Nubhá)”}”(hŒpaulmck@linux.ibm.com”h]”hŒpaulmck@linux.ibm.com”…””}”(hj%  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”Œmailto:paulmck@linux.ibm.com”uh1hàhj  ubhŒ>”…””}”(hj  hžhhŸNh Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Khj  ubah}”(h]”h ]”h"]”h$]”h&]”uh1hÑhj  ubeh}”(h]”h ]”h"]”h$]”h&]”uh1h¼hŸh¶h Khh¹hžhubeh}”(h]”h ]”h"]”h$]”h&]”uh1h·hh£hžhhŸh¶h KubhØ)”}”(hŒ{Linux provides a number of features that can be used to implement circular
buffering.  There are two sets of such features:”h]”hŒ{Linux provides a number of features that can be used to implement circular
buffering.  There are two sets of such features:”…””}”(hjQ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K	hh£hžhubhŒblock_quote”“”)”}”(hŒÏ(1) Convenience functions for determining information about power-of-2 sized
    buffers.

(2) Memory barriers for when the producer and the consumer of objects in the
    buffer don't want to share a lock.
”h]”hŒenumerated_list”“”)”}”(hhh]”(hŒ	list_item”“”)”}”(hŒRConvenience functions for determining information about power-of-2 sized
buffers.
”h]”hØ)”}”(hŒQConvenience functions for determining information about power-of-2 sized
buffers.”h]”hŒQConvenience functions for determining information about power-of-2 sized
buffers.”…””}”(hjp  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Khjl  ubah}”(h]”h ]”h"]”h$]”h&]”uh1jj  hjg  ubjk  )”}”(hŒlMemory barriers for when the producer and the consumer of objects in the
buffer don't want to share a lock.
”h]”hØ)”}”(hŒkMemory barriers for when the producer and the consumer of objects in the
buffer don't want to share a lock.”h]”hŒmMemory barriers for when the producer and the consumer of objects in the
buffer donâ€™t want to share a lock.”…””}”(hjˆ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Khj„  ubah}”(h]”h ]”h"]”h$]”h&]”uh1jj  hjg  ubeh}”(h]”h ]”h"]”h$]”h&]”Œenumtype”Œarabic”Œprefix”Œ(”Œsuffix”Œ)”uh1je  hja  ubah}”(h]”h ]”h"]”h$]”h&]”uh1j_  hŸh¶h Khh£hžhubhØ)”}”(hŒßTo use these facilities, as discussed below, there needs to be just one
producer and just one consumer.  It is possible to handle multiple producers by
serialising them, and to handle multiple consumers by serialising them.”h]”hŒßTo use these facilities, as discussed below, there needs to be just one
producer and just one consumer.  It is possible to handle multiple producers by
serialising them, and to handle multiple consumers by serialising them.”…””}”(hj®  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Khh£hžhubhŒcomment”“”)”}”(hŒ¦Contents:

(*) What is a circular buffer?

(*) Measuring power-of-2 buffers.

(*) Using memory barriers with circular buffers.
    - The producer.
    - The consumer.”h]”hŒ¦Contents:

(*) What is a circular buffer?

(*) Measuring power-of-2 buffers.

(*) Using memory barriers with circular buffers.
    - The producer.
    - The consumer.”…””}”hj¾  sbah}”(h]”h ]”h"]”h$]”h&]”Œ	xml:space”Œpreserve”uh1j¼  hh£hžhhŸh¶h K"ubh¢)”}”(hhh]”(h§)”}”(hŒWhat is a circular buffer?”h]”hŒWhat is a circular buffer?”…””}”(hjÑ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hjÎ  hžhhŸh¶h K$ubhØ)”}”(hŒFirst of all, what is a circular buffer?  A circular buffer is a buffer of
fixed, finite size into which there are two indices:”h]”hŒFirst of all, what is a circular buffer?  A circular buffer is a buffer of
fixed, finite size into which there are two indices:”…””}”(hjß  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K&hjÎ  hžhubj`  )”}”(hŒµ(1) A 'head' index - the point at which the producer inserts items into the
    buffer.

(2) A 'tail' index - the point at which the consumer finds the next item in
    the buffer.
”h]”jf  )”}”(hhh]”(jk  )”}”(hŒPA 'head' index - the point at which the producer inserts items into the
buffer.
”h]”hØ)”}”(hŒOA 'head' index - the point at which the producer inserts items into the
buffer.”h]”hŒSA â€˜headâ€™ index - the point at which the producer inserts items into the
buffer.”…””}”(hjø  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K)hjô  ubah}”(h]”h ]”h"]”h$]”h&]”uh1jj  hjñ  ubjk  )”}”(hŒTA 'tail' index - the point at which the consumer finds the next item in
the buffer.
”h]”hØ)”}”(hŒSA 'tail' index - the point at which the consumer finds the next item in
the buffer.”h]”hŒWA â€˜tailâ€™ index - the point at which the consumer finds the next item in
the buffer.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K,hj  ubah}”(h]”h ]”h"]”h$]”h&]”uh1jj  hjñ  ubeh}”(h]”h ]”h"]”h$]”h&]”j¢  j£  j¤  j¥  j¦  j§  uh1je  hjí  ubah}”(h]”h ]”h"]”h$]”h&]”uh1j_  hŸh¶h K)hjÎ  hžhubhØ)”}”(hŒ¢Typically when the tail pointer is equal to the head pointer, the buffer is
empty; and the buffer is full when the head pointer is one less than the tail
pointer.”h]”hŒ¢Typically when the tail pointer is equal to the head pointer, the buffer is
empty; and the buffer is full when the head pointer is one less than the tail
pointer.”…””}”(hj0  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K/hjÎ  hžhubhØ)”}”(hX$  The head index is incremented when items are added, and the tail index when
items are removed.  The tail index should never jump the head index, and both
indices should be wrapped to 0 when they reach the end of the buffer, thus
allowing an infinite amount of data to flow through the buffer.”h]”hX$  The head index is incremented when items are added, and the tail index when
items are removed.  The tail index should never jump the head index, and both
indices should be wrapped to 0 when they reach the end of the buffer, thus
allowing an infinite amount of data to flow through the buffer.”…””}”(hj>  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K3hjÎ  hžhubhØ)”}”(hX­  Typically, items will all be of the same unit size, but this isn't strictly
required to use the techniques below.  The indices can be increased by more
than 1 if multiple items or variable-sized items are to be included in the
buffer, provided that neither index overtakes the other.  The implementer must
be careful, however, as a region more than one unit in size may wrap the end of
the buffer and be broken into two segments.”h]”hX¯  Typically, items will all be of the same unit size, but this isnâ€™t strictly
required to use the techniques below.  The indices can be increased by more
than 1 if multiple items or variable-sized items are to be included in the
buffer, provided that neither index overtakes the other.  The implementer must
be careful, however, as a region more than one unit in size may wrap the end of
the buffer and be broken into two segments.”…””}”(hjL  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K8hjÎ  hžhubeh}”(h]”Œwhat-is-a-circular-buffer”ah ]”h"]”Œwhat is a circular buffer?”ah$]”h&]”uh1h¡hh£hžhhŸh¶h K$ubh¢)”}”(hhh]”(h§)”}”(hŒMeasuring power-of-2 buffers”h]”hŒMeasuring power-of-2 buffers”…””}”(hje  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hjb  hžhhŸh¶h K@ubhØ)”}”(hX)  Calculation of the occupancy or the remaining capacity of an arbitrarily sized
circular buffer would normally be a slow operation, requiring the use of a
modulus (divide) instruction.  However, if the buffer is of a power-of-2 size,
then a much quicker bitwise-AND instruction can be used instead.”h]”hX)  Calculation of the occupancy or the remaining capacity of an arbitrarily sized
circular buffer would normally be a slow operation, requiring the use of a
modulus (divide) instruction.  However, if the buffer is of a power-of-2 size,
then a much quicker bitwise-AND instruction can be used instead.”…””}”(hjs  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KBhjb  hžhubhØ)”}”(hŒgLinux provides a set of macros for handling power-of-2 circular buffers.  These
can be made use of by::”h]”hŒfLinux provides a set of macros for handling power-of-2 circular buffers.  These
can be made use of by:”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KGhjb  hžhubhŒliteral_block”“”)”}”(hŒ#include <linux/circ_buf.h>”h]”hŒ#include <linux/circ_buf.h>”…””}”hj‘  sbah}”(h]”h ]”h"]”h$]”h&]”jÌ  jÍ  uh1j  hŸh¶h KJhjb  hžhubhØ)”}”(hŒThe macros are:”h]”hŒThe macros are:”…””}”(hjŸ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KLhjb  hžhubj`  )”}”(hXÂ  (#) Measure the remaining capacity of a buffer::

       CIRC_SPACE(head_index, tail_index, buffer_size);

    This returns the amount of space left in the buffer[1] into which items
    can be inserted.


(#) Measure the maximum consecutive immediate space in a buffer::

       CIRC_SPACE_TO_END(head_index, tail_index, buffer_size);

    This returns the amount of consecutive space left in the buffer[1] into
    which items can be immediately inserted without having to wrap back to the
    beginning of the buffer.


(#) Measure the occupancy of a buffer::

       CIRC_CNT(head_index, tail_index, buffer_size);

    This returns the number of items currently occupying a buffer[2].


(#) Measure the non-wrapping occupancy of a buffer::

       CIRC_CNT_TO_END(head_index, tail_index, buffer_size);

    This returns the number of consecutive items[2] that can be extracted from
    the buffer without having to wrap back to the beginning of the buffer.

”h]”jf  )”}”(hhh]”(jk  )”}”(hŒ½Measure the remaining capacity of a buffer::

   CIRC_SPACE(head_index, tail_index, buffer_size);

This returns the amount of space left in the buffer[1] into which items
can be inserted.

”h]”(hØ)”}”(hŒ,Measure the remaining capacity of a buffer::”h]”hŒ+Measure the remaining capacity of a buffer:”…””}”(hj¸  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KNhj´  ubj  )”}”(hŒ0CIRC_SPACE(head_index, tail_index, buffer_size);”h]”hŒ0CIRC_SPACE(head_index, tail_index, buffer_size);”…””}”hjÆ  sbah}”(h]”h ]”h"]”h$]”h&]”jÌ  jÍ  uh1j  hŸh¶h KPhj´  ubhØ)”}”(hŒXThis returns the amount of space left in the buffer[1] into which items
can be inserted.”h]”hŒXThis returns the amount of space left in the buffer[1] into which items
can be inserted.”…””}”(hjÔ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KRhj´  ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj±  ubjk  )”}”(hX(  Measure the maximum consecutive immediate space in a buffer::

   CIRC_SPACE_TO_END(head_index, tail_index, buffer_size);

This returns the amount of consecutive space left in the buffer[1] into
which items can be immediately inserted without having to wrap back to the
beginning of the buffer.

”h]”(hØ)”}”(hŒ=Measure the maximum consecutive immediate space in a buffer::”h]”hŒ<Measure the maximum consecutive immediate space in a buffer:”…””}”(hjì  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KVhjè  ubj  )”}”(hŒ7CIRC_SPACE_TO_END(head_index, tail_index, buffer_size);”h]”hŒ7CIRC_SPACE_TO_END(head_index, tail_index, buffer_size);”…””}”hjú  sbah}”(h]”h ]”h"]”h$]”h&]”jÌ  jÍ  uh1j  hŸh¶h KXhjè  ubhØ)”}”(hŒ«This returns the amount of consecutive space left in the buffer[1] into
which items can be immediately inserted without having to wrap back to the
beginning of the buffer.”h]”hŒ«This returns the amount of consecutive space left in the buffer[1] into
which items can be immediately inserted without having to wrap back to the
beginning of the buffer.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KZhjè  ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj±  ubjk  )”}”(hŒ›Measure the occupancy of a buffer::

   CIRC_CNT(head_index, tail_index, buffer_size);

This returns the number of items currently occupying a buffer[2].

”h]”(hØ)”}”(hŒ#Measure the occupancy of a buffer::”h]”hŒ"Measure the occupancy of a buffer:”…””}”(hj   hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K_hj  ubj  )”}”(hŒ.CIRC_CNT(head_index, tail_index, buffer_size);”h]”hŒ.CIRC_CNT(head_index, tail_index, buffer_size);”…””}”hj.  sbah}”(h]”h ]”h"]”h$]”h&]”jÌ  jÍ  uh1j  hŸh¶h Kahj  ubhØ)”}”(hŒAThis returns the number of items currently occupying a buffer[2].”h]”hŒAThis returns the number of items currently occupying a buffer[2].”…””}”(hj<  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Kchj  ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj±  ubjk  )”}”(hŒÿMeasure the non-wrapping occupancy of a buffer::

   CIRC_CNT_TO_END(head_index, tail_index, buffer_size);

This returns the number of consecutive items[2] that can be extracted from
the buffer without having to wrap back to the beginning of the buffer.

”h]”(hØ)”}”(hŒ0Measure the non-wrapping occupancy of a buffer::”h]”hŒ/Measure the non-wrapping occupancy of a buffer:”…””}”(hjT  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KfhjP  ubj  )”}”(hŒ5CIRC_CNT_TO_END(head_index, tail_index, buffer_size);”h]”hŒ5CIRC_CNT_TO_END(head_index, tail_index, buffer_size);”…””}”hjb  sbah}”(h]”h ]”h"]”h$]”h&]”jÌ  jÍ  uh1j  hŸh¶h KhhjP  ubhØ)”}”(hŒ‘This returns the number of consecutive items[2] that can be extracted from
the buffer without having to wrap back to the beginning of the buffer.”h]”hŒ‘This returns the number of consecutive items[2] that can be extracted from
the buffer without having to wrap back to the beginning of the buffer.”…””}”(hjp  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KjhjP  ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj±  ubeh}”(h]”h ]”h"]”h$]”h&]”j¢  j£  j¤  j¥  j¦  j§  uh1je  hj­  ubah}”(h]”h ]”h"]”h$]”h&]”uh1j_  hŸh¶h KNhjb  hžhubhØ)”}”(hŒXEach of these macros will nominally return a value between 0 and buffer_size-1,
however:”h]”hŒXEach of these macros will nominally return a value between 0 and buffer_size-1,
however:”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Knhjb  hžhubj`  )”}”(hXä  (1) CIRC_SPACE*() are intended to be used in the producer.  To the producer
    they will return a lower bound as the producer controls the head index,
    but the consumer may still be depleting the buffer on another CPU and
    moving the tail index.

    To the consumer it will show an upper bound as the producer may be busy
    depleting the space.

(2) CIRC_CNT*() are intended to be used in the consumer.  To the consumer they
    will return a lower bound as the consumer controls the tail index, but the
    producer may still be filling the buffer on another CPU and moving the
    head index.

    To the producer it will show an upper bound as the consumer may be busy
    emptying the buffer.

(3) To a third party, the order in which the writes to the indices by the
    producer and consumer become visible cannot be guaranteed as they are
    independent and may be made on different CPUs - so the result in such a
    situation will merely be a guess, and may even be negative.
”h]”jf  )”}”(hhh]”(jk  )”}”(hXK  CIRC_SPACE*() are intended to be used in the producer.  To the producer
they will return a lower bound as the producer controls the head index,
but the consumer may still be depleting the buffer on another CPU and
moving the tail index.

To the consumer it will show an upper bound as the producer may be busy
depleting the space.
”h]”(hØ)”}”(hŒìCIRC_SPACE*() are intended to be used in the producer.  To the producer
they will return a lower bound as the producer controls the head index,
but the consumer may still be depleting the buffer on another CPU and
moving the tail index.”h]”hŒìCIRC_SPACE*() are intended to be used in the producer.  To the producer
they will return a lower bound as the producer controls the head index,
but the consumer may still be depleting the buffer on another CPU and
moving the tail index.”…””}”(hj©  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Kqhj¥  ubhØ)”}”(hŒ\To the consumer it will show an upper bound as the producer may be busy
depleting the space.”h]”hŒ\To the consumer it will show an upper bound as the producer may be busy
depleting the space.”…””}”(hj·  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Kvhj¥  ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj¢  ubjk  )”}”(hXG  CIRC_CNT*() are intended to be used in the consumer.  To the consumer they
will return a lower bound as the consumer controls the tail index, but the
producer may still be filling the buffer on another CPU and moving the
head index.

To the producer it will show an upper bound as the consumer may be busy
emptying the buffer.
”h]”(hØ)”}”(hŒèCIRC_CNT*() are intended to be used in the consumer.  To the consumer they
will return a lower bound as the consumer controls the tail index, but the
producer may still be filling the buffer on another CPU and moving the
head index.”h]”hŒèCIRC_CNT*() are intended to be used in the consumer.  To the consumer they
will return a lower bound as the consumer controls the tail index, but the
producer may still be filling the buffer on another CPU and moving the
head index.”…””}”(hjÏ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KyhjË  ubhØ)”}”(hŒ\To the producer it will show an upper bound as the consumer may be busy
emptying the buffer.”h]”hŒ\To the producer it will show an upper bound as the consumer may be busy
emptying the buffer.”…””}”(hjÝ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K~hjË  ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj¢  ubjk  )”}”(hX  To a third party, the order in which the writes to the indices by the
producer and consumer become visible cannot be guaranteed as they are
independent and may be made on different CPUs - so the result in such a
situation will merely be a guess, and may even be negative.
”h]”hØ)”}”(hX  To a third party, the order in which the writes to the indices by the
producer and consumer become visible cannot be guaranteed as they are
independent and may be made on different CPUs - so the result in such a
situation will merely be a guess, and may even be negative.”h]”hX  To a third party, the order in which the writes to the indices by the
producer and consumer become visible cannot be guaranteed as they are
independent and may be made on different CPUs - so the result in such a
situation will merely be a guess, and may even be negative.”…””}”(hjõ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Khjñ  ubah}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj¢  ubeh}”(h]”h ]”h"]”h$]”h&]”j¢  j£  j¤  j¥  j¦  j§  uh1je  hjž  ubah}”(h]”h ]”h"]”h$]”h&]”uh1j_  hŸh¶h Kqhjb  hžhubeh}”(h]”Œmeasuring-power-of-2-buffers”ah ]”h"]”Œmeasuring power-of-2 buffers”ah$]”h&]”uh1h¡hh£hžhhŸh¶h K@ubh¢)”}”(hhh]”(h§)”}”(hŒ+Using memory barriers with circular buffers”h]”hŒ+Using memory barriers with circular buffers”…””}”(hj   hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hj  hžhhŸh¶h K‡ubhØ)”}”(hŒYBy using memory barriers in conjunction with circular buffers, you can avoid
the need to:”h]”hŒYBy using memory barriers in conjunction with circular buffers, you can avoid
the need to:”…””}”(hj.  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K‰hj  hžhubj`  )”}”(hŒ³(1) use a single lock to govern access to both ends of the buffer, thus
    allowing the buffer to be filled and emptied at the same time; and

(2) use atomic counter operations.
”h]”jf  )”}”(hhh]”(jk  )”}”(hŒ‡use a single lock to govern access to both ends of the buffer, thus
allowing the buffer to be filled and emptied at the same time; and
”h]”hØ)”}”(hŒ†use a single lock to govern access to both ends of the buffer, thus
allowing the buffer to be filled and emptied at the same time; and”h]”hŒ†use a single lock to govern access to both ends of the buffer, thus
allowing the buffer to be filled and emptied at the same time; and”…””}”(hjG  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KŒhjC  ubah}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj@  ubjk  )”}”(hŒuse atomic counter operations.
”h]”hØ)”}”(hŒuse atomic counter operations.”h]”hŒuse atomic counter operations.”…””}”(hj_  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Khj[  ubah}”(h]”h ]”h"]”h$]”h&]”uh1jj  hj@  ubeh}”(h]”h ]”h"]”h$]”h&]”j¢  j£  j¤  j¥  j¦  j§  uh1je  hj<  ubah}”(h]”h ]”h"]”h$]”h&]”uh1j_  hŸh¶h KŒhj  hžhubhØ)”}”(hX  There are two sides to this: the producer that fills the buffer, and the
consumer that empties it.  Only one thing should be filling a buffer at any one
time, and only one thing should be emptying a buffer at any one time, but the
two sides can operate simultaneously.”h]”hX  There are two sides to this: the producer that fills the buffer, and the
consumer that empties it.  Only one thing should be filling a buffer at any one
time, and only one thing should be emptying a buffer at any one time, but the
two sides can operate simultaneously.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K‘hj  hžhubh¢)”}”(hhh]”(h§)”}”(hŒThe producer”h]”hŒThe producer”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hj  hžhhŸh¶h K˜ubhØ)”}”(hŒ,The producer will look something like this::”h]”hŒ+The producer will look something like this:”…””}”(hjž  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Kšhj  hžhubj  )”}”(hX_  spin_lock(&producer_lock);

unsigned long head = buffer->head;
/* The spin_unlock() and next spin_lock() provide needed ordering. */
unsigned long tail = READ_ONCE(buffer->tail);

if (CIRC_SPACE(head, tail, buffer->size) >= 1) {
        /* insert one item into the buffer */
        struct item *item = buffer[head];

        produce_item(item);

        smp_store_release(buffer->head,
                          (head + 1) & (buffer->size - 1));

        /* wake_up() will make sure that the head is committed before
         * waking anyone up */
        wake_up(consumer);
}

spin_unlock(&producer_lock);”h]”hX_  spin_lock(&producer_lock);

unsigned long head = buffer->head;
/* The spin_unlock() and next spin_lock() provide needed ordering. */
unsigned long tail = READ_ONCE(buffer->tail);

if (CIRC_SPACE(head, tail, buffer->size) >= 1) {
        /* insert one item into the buffer */
        struct item *item = buffer[head];

        produce_item(item);

        smp_store_release(buffer->head,
                          (head + 1) & (buffer->size - 1));

        /* wake_up() will make sure that the head is committed before
         * waking anyone up */
        wake_up(consumer);
}

spin_unlock(&producer_lock);”…””}”hj¬  sbah}”(h]”h ]”h"]”h$]”h&]”jÌ  jÍ  uh1j  hŸh¶h Kœhj  hžhubhØ)”}”(hŒêThis will instruct the CPU that the contents of the new item must be written
before the head index makes it available to the consumer and then instructs the
CPU that the revised head index must be written before the consumer is woken.”h]”hŒêThis will instruct the CPU that the contents of the new item must be written
before the head index makes it available to the consumer and then instructs the
CPU that the revised head index must be written before the consumer is woken.”…””}”(hjº  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K²hj  hžhubhØ)”}”(hXP  Note that wake_up() does not guarantee any sort of barrier unless something
is actually awakened.  We therefore cannot rely on it for ordering.  However,
there is always one element of the array left empty.  Therefore, the
producer must produce two elements before it could possibly corrupt the
element currently being read by the consumer.  Therefore, the unlock-lock
pair between consecutive invocations of the consumer provides the necessary
ordering between the read of the index indicating that the consumer has
vacated a given element and the write by the producer to that same element.”h]”hXP  Note that wake_up() does not guarantee any sort of barrier unless something
is actually awakened.  We therefore cannot rely on it for ordering.  However,
there is always one element of the array left empty.  Therefore, the
producer must produce two elements before it could possibly corrupt the
element currently being read by the consumer.  Therefore, the unlock-lock
pair between consecutive invocations of the consumer provides the necessary
ordering between the read of the index indicating that the consumer has
vacated a given element and the write by the producer to that same element.”…””}”(hjÈ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h K¶hj  hžhubeh}”(h]”Œthe-producer”ah ]”h"]”Œthe producer”ah$]”h&]”uh1h¡hj  hžhhŸh¶h K˜ubh¢)”}”(hhh]”(h§)”}”(hŒThe Consumer”h]”hŒThe Consumer”…””}”(hjá  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hjÞ  hžhhŸh¶h KÁubhØ)”}”(hŒ,The consumer will look something like this::”h]”hŒ+The consumer will look something like this:”…””}”(hjï  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KÃhjÞ  hžhubj  )”}”(hX  spin_lock(&consumer_lock);

/* Read index before reading contents at that index. */
unsigned long head = smp_load_acquire(buffer->head);
unsigned long tail = buffer->tail;

if (CIRC_CNT(head, tail, buffer->size) >= 1) {

        /* extract one item from the buffer */
        struct item *item = buffer[tail];

        consume_item(item);

        /* Finish reading descriptor before incrementing tail. */
        smp_store_release(buffer->tail,
                          (tail + 1) & (buffer->size - 1));
}

spin_unlock(&consumer_lock);”h]”hX  spin_lock(&consumer_lock);

/* Read index before reading contents at that index. */
unsigned long head = smp_load_acquire(buffer->head);
unsigned long tail = buffer->tail;

if (CIRC_CNT(head, tail, buffer->size) >= 1) {

        /* extract one item from the buffer */
        struct item *item = buffer[tail];

        consume_item(item);

        /* Finish reading descriptor before incrementing tail. */
        smp_store_release(buffer->tail,
                          (tail + 1) & (buffer->size - 1));
}

spin_unlock(&consumer_lock);”…””}”hjý  sbah}”(h]”h ]”h"]”h$]”h&]”jÌ  jÍ  uh1j  hŸh¶h KÅhjÞ  hžhubhØ)”}”(hŒàThis will instruct the CPU to make sure the index is up to date before reading
the new item, and then it shall make sure the CPU has finished reading the item
before it writes the new tail pointer, which will erase the item.”h]”hŒàThis will instruct the CPU to make sure the index is up to date before reading
the new item, and then it shall make sure the CPU has finished reading the item
before it writes the new tail pointer, which will erase the item.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KÙhjÞ  hžhubhØ)”}”(hXu  Note the use of READ_ONCE() and smp_load_acquire() to read the
opposition index.  This prevents the compiler from discarding and
reloading its cached value.  This isn't strictly needed if you can
be sure that the opposition index will _only_ be used the once.
The smp_load_acquire() additionally forces the CPU to order against
subsequent memory references.  Similarly, smp_store_release() is used
in both algorithms to write the thread's index.  This documents the
fact that we are writing to something that can be read concurrently,
prevents the compiler from tearing the store, and enforces ordering
against previous accesses.”h]”hXy  Note the use of READ_ONCE() and smp_load_acquire() to read the
opposition index.  This prevents the compiler from discarding and
reloading its cached value.  This isnâ€™t strictly needed if you can
be sure that the opposition index will _only_ be used the once.
The smp_load_acquire() additionally forces the CPU to order against
subsequent memory references.  Similarly, smp_store_release() is used
in both algorithms to write the threadâ€™s index.  This documents the
fact that we are writing to something that can be read concurrently,
prevents the compiler from tearing the store, and enforces ordering
against previous accesses.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h KÝhjÞ  hžhubeh}”(h]”Œthe-consumer”ah ]”h"]”Œthe consumer”ah$]”h&]”uh1h¡hj  hžhhŸh¶h KÁubeh}”(h]”Œ+using-memory-barriers-with-circular-buffers”ah ]”h"]”Œ+using memory barriers with circular buffers”ah$]”h&]”uh1h¡hh£hžhhŸh¶h K‡ubh¢)”}”(hhh]”(h§)”}”(hŒFurther reading”h]”hŒFurther reading”…””}”(hj:  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hj7  hžhhŸh¶h KêubhØ)”}”(hŒbSee also Documentation/memory-barriers.txt for a description of Linux's memory
barrier facilities.”h]”hŒdSee also Documentation/memory-barriers.txt for a description of Linuxâ€™s memory
barrier facilities.”…””}”(hjH  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h×hŸh¶h Kìhj7  hžhubeh}”(h]”Œfurther-reading”ah ]”h"]”Œfurther reading”ah$]”h&]”uh1h¡hh£hžhhŸh¶h Kêubeh}”(h]”Œcircular-buffers”ah ]”h"]”Œcircular buffers”ah$]”h&]”uh1h¡hhhžhhŸh¶h Kubeh}”(h]”h ]”h"]”h$]”h&]”Œsource”h¶uh1hŒcurrent_source”NŒcurrent_line”NŒsettings”Œdocutils.frontend”ŒValues”“”)”}”(h¦NŒ	generator”NŒ	datestamp”NŒsource_link”NŒ
source_url”NŒtoc_backlinks”Œentry”Œfootnote_backlinks”KŒsectnum_xform”KŒstrip_comments”NŒstrip_elements_with_classes”NŒstrip_classes”NŒreport_level”KŒ
halt_level”KŒexit_status_level”KŒdebug”NŒwarning_stream”NŒ	traceback”ˆŒinput_encoding”Œ	utf-8-sig”Œinput_encoding_error_handler”Œstrict”Œoutput_encoding”Œutf-8”Œoutput_encoding_error_handler”j‰  Œerror_encoding”Œutf-8”Œerror_encoding_error_handler”Œbackslashreplace”Œlanguage_code”Œen”Œrecord_dependencies”NŒconfig”NŒ	id_prefix”hŒauto_id_prefix”Œid”Œdump_settings”NŒdump_internals”NŒdump_transforms”NŒdump_pseudo_xml”NŒexpose_internals”NŒstrict_visitor”NŒ_disable_config”NŒ_source”h¶Œ_destination”NŒ_config_files”]”Œ7/var/lib/git/docbuild/linux/Documentation/docutils.conf”aŒfile_insertion_enabled”ˆŒraw_enabled”KŒline_length_limit”M'Œpep_references”NŒpep_base_url”Œhttps://peps.python.org/”Œpep_file_url_template”Œpep-%04d”Œrfc_references”NŒrfc_base_url”Œ&https://datatracker.ietf.org/doc/html/”Œ	tab_width”KŒtrim_footnote_reference_space”‰Œsyntax_highlight”Œlong”Œsmart_quotes”ˆŒsmartquotes_locales”]”Œcharacter_level_inline_markup”‰Œdoctitle_xform”‰Œdocinfo_xform”KŒsectsubtitle_xform”‰Œimage_loading”Œlink”Œembed_stylesheet”‰Œcloak_email_addresses”ˆŒsection_self_link”‰Œenv”NubŒreporter”NŒindirect_targets”]”Œsubstitution_defs”}”Œsubstitution_names”}”Œrefnames”}”Œrefids”}”Œnameids”}”(jc  j`  j_  j\  j  j  j4  j1  jÛ  jØ  j,  j)  j[  jX  uŒ	nametypes”}”(jc  ‰j_  ‰j  ‰j4  ‰jÛ  ‰j,  ‰j[  ‰uh}”(j`  h£j\  jÎ  j  jb  j1  j  jØ  j  j)  jÞ  jX  j7  uŒfootnote_refs”}”Œcitation_refs”}”Œautofootnotes”]”Œautofootnote_refs”]”Œsymbol_footnotes”]”Œsymbol_footnote_refs”]”Œ	footnotes”]”Œ	citations”]”Œautofootnote_start”KŒsymbol_footnote_start”K Œ
id_counter”Œcollections”ŒCounter”“”}”…”R”Œparse_messages”]”Œtransform_messages”]”Œtransformer”NŒinclude_log”]”Œ
decoration”Nhžhub.