mfbt/SPSCQueue.h

   1 /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
   2 /* vim: set ts=8 sts=2 et sw=2 tw=80: */
   3 /* This Source Code Form is subject to the terms of the Mozilla Public
   4  * License, v. 2.0. If a copy of the MPL was not distributed with this
   5  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
   6
   7 /* Single producer single consumer lock-free and wait-free queue. */
   8
   9 #ifndef mozilla_LockFreeQueue_h
  10 #define mozilla_LockFreeQueue_h
  11
  12 #include "mozilla/Assertions.h"
  13 #include "mozilla/Attributes.h"
  14 #include "mozilla/PodOperations.h"
  15 #include <algorithm>
  16 #include <atomic>
  17 #include <cstddef>
  18 #include <limits>
  19 #include <memory>
  20 #include <thread>
  21 #include <type_traits>
  22
  23 namespace mozilla {
  24
  25 namespace detail {
  26 template <typename T, bool IsPod = std::is_trivial<T>::value>
  27 struct MemoryOperations {
  28   /**
  29    * This allows zeroing (using memset) or default-constructing a number of
  30    * elements calling the constructors if necessary.
  31    */
  32   static void ConstructDefault(T* aDestination, size_t aCount);
  33   /**
  34    * This allows either moving (if T supports it) or copying a number of
  35    * elements from a `aSource` pointer to a `aDestination` pointer.
  36    * If it is safe to do so and this call copies, this uses PodCopy. Otherwise,
  37    * constructors and destructors are called in a loop.
  38    */
  39   static void MoveOrCopy(T* aDestination, T* aSource, size_t aCount);
  40 };
  41
  42 template <typename T>
  43 struct MemoryOperations<T, true> {
  44   static void ConstructDefault(T* aDestination, size_t aCount) {
  45     PodZero(aDestination, aCount);
  46   }
  47   static void MoveOrCopy(T* aDestination, T* aSource, size_t aCount) {
  48     PodCopy(aDestination, aSource, aCount);
  49   }
  50 };
  51
  52 template <typename T>
  53 struct MemoryOperations<T, false> {
  54   static void ConstructDefault(T* aDestination, size_t aCount) {
  55     for (size_t i = 0; i < aCount; i++) {
  56       aDestination[i] = T();
  57     }
  58   }
  59   static void MoveOrCopy(T* aDestination, T* aSource, size_t aCount) {
  60     std::move(aSource, aSource + aCount, aDestination);
  61   }
  62 };
  63 }  // namespace detail
  64
  65 /**
  66  * This data structure allows producing data from one thread, and consuming it
  67  * on another thread, safely and without explicit synchronization.
  68  *
  69  * The role for the producer and the consumer must be constant, i.e., the
  70  * producer should always be on one thread and the consumer should always be on
  71  * another thread.
  72  *
  73  * Some words about the inner workings of this class:
  74  * - Capacity is fixed. Only one allocation is performed, in the constructor.
  75  *   When reading and writing, the return value of the method allows checking if
  76  *   the ring buffer is empty or full.
  77  * - We always keep the read index at least one element ahead of the write
  78  *   index, so we can distinguish between an empty and a full ring buffer: an
  79  *   empty ring buffer is when the write index is at the same position as the
  80  *   read index. A full buffer is when the write index is exactly one position
  81  *   before the read index.
  82  * - We synchronize updates to the read index after having read the data, and
  83  *   the write index after having written the data. This means that the each
  84  *   thread can only touch a portion of the buffer that is not touched by the
  85  *   other thread.
  86  * - Callers are expected to provide buffers. When writing to the queue,
  87  *   elements are copied into the internal storage from the buffer passed in.
  88  *   When reading from the queue, the user is expected to provide a buffer.
  89  *   Because this is a ring buffer, data might not be contiguous in memory;
  90  *   providing an external buffer to copy into is an easy way to have linear
  91  *   data for further processing.
  92  */
  93 template <typename T>
  94 class SPSCRingBufferBase {
  95  public:
  96   /**
  97    * Constructor for a ring buffer.
  98    *
  99    * This performs an allocation on the heap, but is the only allocation that
 100    * will happen for the life time of a `SPSCRingBufferBase`.
 101    *
 102    * @param Capacity The maximum number of element this ring buffer will hold.
 103    */
 104   explicit SPSCRingBufferBase(int aCapacity)
 105       : mReadIndex(0),
 106         mWriteIndex(0),
 107         /* One more element to distinguish from empty and full buffer. */
 108         mCapacity(aCapacity + 1) {
 109     MOZ_RELEASE_ASSERT(aCapacity != std::numeric_limits<int>::max());
 110     MOZ_RELEASE_ASSERT(mCapacity > 0);
 111
 112     mData = std::make_unique<T[]>(StorageCapacity());
 113
 114     std::atomic_thread_fence(std::memory_order_seq_cst);
 115   }
 116   /**
 117    * Push `aCount` zero or default constructed elements in the array.
 118    *
 119    * Only safely called on the producer thread.
 120    *
 121    * @param count The number of elements to enqueue.
 122    * @return The number of element enqueued.
 123    */
 124   [[nodiscard]] int EnqueueDefault(int aCount) {
 125     return Enqueue(nullptr, aCount);
 126   }
 127   /**
 128    * @brief Put an element in the queue.
 129    *
 130    * Only safely called on the producer thread.
 131    *
 132    * @param element The element to put in the queue.
 133    *
 134    * @return 1 if the element was inserted, 0 otherwise.
 135    */
 136   [[nodiscard]] int Enqueue(T& aElement) { return Enqueue(&aElement, 1); }
 137   /**
 138    * Push `aCount` elements in the ring buffer.
 139    *
 140    * Only safely called on the producer thread.
 141    *
 142    * @param elements a pointer to a buffer containing at least `count` elements.
 143    * If `elements` is nullptr, zero or default constructed elements are enqueud.
 144    * @param count The number of elements to read from `elements`
 145    * @return The number of elements successfully coped from `elements` and
 146    * inserted into the ring buffer.
 147    */
 148   [[nodiscard]] int Enqueue(T* aElements, int aCount) {
 149 #ifdef DEBUG
 150     AssertCorrectThread(mProducerId);
 151 #endif
 152
 153     int rdIdx = mReadIndex.load(std::memory_order_acquire);
 154     int wrIdx = mWriteIndex.load(std::memory_order_relaxed);
 155
 156     if (IsFull(rdIdx, wrIdx)) {
 157       return 0;
 158     }
 159
 160     int toWrite = std::min(AvailableWriteInternal(rdIdx, wrIdx), aCount);
 161
 162     /* First part, from the write index to the end of the array. */
 163     int firstPart = std::min(StorageCapacity() - wrIdx, toWrite);
 164     /* Second part, from the beginning of the array */
 165     int secondPart = toWrite - firstPart;
 166
 167     if (aElements) {
 168       detail::MemoryOperations<T>::MoveOrCopy(mData.get() + wrIdx, aElements,
 169                                               firstPart);
 170       detail::MemoryOperations<T>::MoveOrCopy(
 171           mData.get(), aElements + firstPart, secondPart);
 172     } else {
 173       detail::MemoryOperations<T>::ConstructDefault(mData.get() + wrIdx,
 174                                                     firstPart);
 175       detail::MemoryOperations<T>::ConstructDefault(mData.get(), secondPart);
 176     }
 177
 178     mWriteIndex.store(IncrementIndex(wrIdx, toWrite),
 179                       std::memory_order_release);
 180
 181     return toWrite;
 182   }
 183   /**
 184    * Retrieve at most `count` elements from the ring buffer, and copy them to
 185    * `elements`, if non-null.
 186    *
 187    * Only safely called on the consumer side.
 188    *
 189    * @param elements A pointer to a buffer with space for at least `count`
 190    * elements. If `elements` is `nullptr`, `count` element will be discarded.
 191    * @param count The maximum number of elements to Dequeue.
 192    * @return The number of elements written to `elements`.
 193    */
 194   [[nodiscard]] int Dequeue(T* elements, int count) {
 195 #ifdef DEBUG
 196     AssertCorrectThread(mConsumerId);
 197 #endif
 198
 199     int wrIdx = mWriteIndex.load(std::memory_order_acquire);
 200     int rdIdx = mReadIndex.load(std::memory_order_relaxed);
 201
 202     if (IsEmpty(rdIdx, wrIdx)) {
 203       return 0;
 204     }
 205
 206     int toRead = std::min(AvailableReadInternal(rdIdx, wrIdx), count);
 207
 208     int firstPart = std::min(StorageCapacity() - rdIdx, toRead);
 209     int secondPart = toRead - firstPart;
 210
 211     if (elements) {
 212       detail::MemoryOperations<T>::MoveOrCopy(elements, mData.get() + rdIdx,
 213                                               firstPart);
 214       detail::MemoryOperations<T>::MoveOrCopy(elements + firstPart, mData.get(),
 215                                               secondPart);
 216     }
 217
 218     mReadIndex.store(IncrementIndex(rdIdx, toRead), std::memory_order_release);
 219
 220     return toRead;
 221   }
 222   /**
 223    * Get the number of available elements for consuming.
 224    *
 225    * This can be less than the actual number of elements in the queue, since the
 226    * mWriteIndex is updated at the very end of the Enqueue method on the
 227    * producer thread, but consequently always returns a number of elements such
 228    * that a call to Dequeue return this number of elements.
 229    *
 230    * @return The number of available elements for reading.
 231    */
 232   int AvailableRead() const {
 233     return AvailableReadInternal(mReadIndex.load(std::memory_order_relaxed),
 234                                  mWriteIndex.load(std::memory_order_relaxed));
 235   }
 236   /**
 237    * Get the number of available elements for writing.
 238    *
 239    * This can be less than than the actual number of slots that are available,
 240    * because mReadIndex is updated at the very end of the Deque method. It
 241    * always returns a number such that a call to Enqueue with this number will
 242    * succeed in enqueuing this number of elements.
 243    *
 244    * @return The number of empty slots in the buffer, available for writing.
 245    */
 246   int AvailableWrite() const {
 247     return AvailableWriteInternal(mReadIndex.load(std::memory_order_relaxed),
 248                                   mWriteIndex.load(std::memory_order_relaxed));
 249   }
 250   /**
 251    * Get the total Capacity, for this ring buffer.
 252    *
 253    * Can be called safely on any thread.
 254    *
 255    * @return The maximum Capacity of this ring buffer.
 256    */
 257   int Capacity() const { return StorageCapacity() - 1; }
 258   /**
 259    * Reset the consumer and producer thread identifier, in case the threads are
 260    * being changed. This has to be externally synchronized. This is no-op when
 261    * asserts are disabled.
 262    */
 263   void ResetThreadIds() {
 264     ResetProducerThreadId();
 265     ResetConsumerThreadId();
 266   }
 267
 268   void ResetConsumerThreadId() {
 269 #ifdef DEBUG
 270     mConsumerId = std::thread::id();
 271 #endif
 272   }
 273
 274   void ResetProducerThreadId() {
 275 #ifdef DEBUG
 276     mProducerId = std::thread::id();
 277 #endif
 278   }
 279
 280  private:
 281   /** Return true if the ring buffer is empty.
 282    *
 283    * This can be called from the consumer or the producer thread.
 284    *
 285    * @param aReadIndex the read index to consider
 286    * @param writeIndex the write index to consider
 287    * @return true if the ring buffer is empty, false otherwise.
 288    **/
 289   bool IsEmpty(int aReadIndex, int aWriteIndex) const {
 290     return aWriteIndex == aReadIndex;
 291   }
 292   /** Return true if the ring buffer is full.
 293    *
 294    * This happens if the write index is exactly one element behind the read
 295    * index.
 296    *
 297    * This can be called from the consummer or the producer thread.
 298    *
 299    * @param aReadIndex the read index to consider
 300    * @param writeIndex the write index to consider
 301    * @return true if the ring buffer is full, false otherwise.
 302    **/
 303   bool IsFull(int aReadIndex, int aWriteIndex) const {
 304     return (aWriteIndex + 1) % StorageCapacity() == aReadIndex;
 305   }
 306   /**
 307    * Return the size of the storage. It is one more than the number of elements
 308    * that can be stored in the buffer.
 309    *
 310    * This can be called from any thread.
 311    *
 312    * @return the number of elements that can be stored in the buffer.
 313    */
 314   int StorageCapacity() const { return mCapacity; }
 315   /**
 316    * Returns the number of elements available for reading.
 317    *
 318    * This can be called from the consummer or producer thread, but see the
 319    * comment in `AvailableRead`.
 320    *
 321    * @return the number of available elements for reading.
 322    */
 323   int AvailableReadInternal(int aReadIndex, int aWriteIndex) const {
 324     if (aWriteIndex >= aReadIndex) {
 325       return aWriteIndex - aReadIndex;
 326     } else {
 327       return aWriteIndex + StorageCapacity() - aReadIndex;
 328     }
 329   }
 330   /**
 331    * Returns the number of empty elements, available for writing.
 332    *
 333    * This can be called from the consummer or producer thread, but see the
 334    * comment in `AvailableWrite`.
 335    *
 336    * @return the number of elements that can be written into the array.
 337    */
 338   int AvailableWriteInternal(int aReadIndex, int aWriteIndex) const {
 339     /* We subtract one element here to always keep at least one sample
 340      * free in the buffer, to distinguish between full and empty array. */
 341     int rv = aReadIndex - aWriteIndex - 1;
 342     if (aWriteIndex >= aReadIndex) {
 343       rv += StorageCapacity();
 344     }
 345     return rv;
 346   }
 347   /**
 348    * Increments an index, wrapping it around the storage.
 349    *
 350    * Incrementing `mWriteIndex` can be done on the producer thread.
 351    * Incrementing `mReadIndex` can be done on the consummer thread.
 352    *
 353    * @param index a reference to the index to increment.
 354    * @param increment the number by which `index` is incremented.
 355    * @return the new index.
 356    */
 357   int IncrementIndex(int aIndex, int aIncrement) const {
 358     MOZ_ASSERT(aIncrement >= 0 && aIncrement < StorageCapacity() &&
 359                aIndex < StorageCapacity());
 360     return (aIndex + aIncrement) % StorageCapacity();
 361   }
 362   /**
 363    * @brief This allows checking that Enqueue (resp. Dequeue) are always
 364    * called by the right thread.
 365    *
 366    * The role of the thread are assigned the first time they call Enqueue or
 367    * Dequeue, and cannot change, except when ResetThreadIds is called..
 368    *
 369    * @param id the id of the thread that has called the calling method first.
 370    */
 371 #ifdef DEBUG
 372   static void AssertCorrectThread(std::thread::id& aId) {
 373     if (aId == std::thread::id()) {
 374       aId = std::this_thread::get_id();
 375       return;
 376     }
 377     MOZ_ASSERT(aId == std::this_thread::get_id());
 378   }
 379 #endif
 380   /** Index at which the oldest element is. */
 381   std::atomic<int> mReadIndex;
 382   /** Index at which to write new elements. `mWriteIndex` is always at
 383    * least one element ahead of `mReadIndex`. */
 384   std::atomic<int> mWriteIndex;
 385   /** Maximum number of elements that can be stored in the ring buffer. */
 386   const int mCapacity;
 387   /** Data storage, of size `mCapacity + 1` */
 388   std::unique_ptr<T[]> mData;
 389 #ifdef DEBUG
 390   /** The id of the only thread that is allowed to read from the queue. */
 391   mutable std::thread::id mConsumerId;
 392   /** The id of the only thread that is allowed to write from the queue. */
 393   mutable std::thread::id mProducerId;
 394 #endif
 395 };
 396
 397 /**
 398  * Instantiation of the `SPSCRingBufferBase` type. This is safe to use
 399  * from two threads, one producer, one consumer (that never change role),
 400  * without explicit synchronization.
 401  */
 402 template <typename T>
 403 using SPSCQueue = SPSCRingBufferBase<T>;
 404
 405 }  // namespace mozilla
 406
 407 #endif  // mozilla_LockFreeQueue_h