aboutsummaryrefslogtreecommitdiffstats
path: root/Alc/ringbuffer.h
diff options
context:
space:
mode:
authorChris Robinson <[email protected]>2018-12-26 21:22:17 -0800
committerChris Robinson <[email protected]>2018-12-26 21:22:17 -0800
commit8a0295503db394ea895bfa079d1f3eda0d758e61 (patch)
tree21a1a1e63fe148dc087ad2c35ce94a49418ef900 /Alc/ringbuffer.h
parent4f253a935a14e49a77516a56e0d4c6d6177a56b6 (diff)
Clean up the ring buffer struct and use member functions
Diffstat (limited to 'Alc/ringbuffer.h')
-rw-r--r--Alc/ringbuffer.h122
1 files changed, 62 insertions, 60 deletions
diff --git a/Alc/ringbuffer.h b/Alc/ringbuffer.h
index 5111023e..a2871859 100644
--- a/Alc/ringbuffer.h
+++ b/Alc/ringbuffer.h
@@ -15,18 +15,6 @@
* size or count is in 'elements', not bytes. Additionally, it only supports
* single-consumer/single-provider operation.
*/
-struct ll_ringbuffer {
- std::atomic<size_t> write_ptr{0u};
- std::atomic<size_t> read_ptr{0u};
- size_t size{0u};
- size_t size_mask{0u};
- size_t elem_size{0u};
-
- alignas(16) char buf[];
-
- DEF_PLACE_NEWDEL()
-};
-
struct ll_ringbuffer_data {
char *buf;
@@ -35,60 +23,74 @@ struct ll_ringbuffer_data {
using ll_ringbuffer_data_pair = std::pair<ll_ringbuffer_data,ll_ringbuffer_data>;
-/**
- * Create a new ringbuffer to hold at least `sz' elements of `elem_sz' bytes.
- * The number of elements is rounded up to the next power of two (even if it is
- * already a power of two, to ensure the requested amount can be written).
- */
-ll_ringbuffer *ll_ringbuffer_create(size_t sz, size_t elem_sz, int limit_writes);
-/** Reset the read and write pointers to zero. This is not thread safe. */
-void ll_ringbuffer_reset(ll_ringbuffer *rb);
+struct RingBuffer {
+ std::atomic<size_t> mWritePtr{0u};
+ std::atomic<size_t> mReadPtr{0u};
+ size_t mSize{0u};
+ size_t mSizeMask{0u};
+ size_t mElemSize{0u};
+
+ alignas(16) char mBuffer[];
+
+ /** Reset the read and write pointers to zero. This is not thread safe. */
+ void reset() noexcept;
+
+ /**
+ * The non-copying data reader. Returns two ringbuffer data pointers that
+ * hold the current readable data. If the readable data is in one segment
+ * the second segment has zero length.
+ */
+ ll_ringbuffer_data_pair getReadVector() const noexcept;
+ /**
+ * The non-copying data writer. Returns two ringbuffer data pointers that
+ * hold the current writeable data. If the writeable data is in one segment
+ * the second segment has zero length.
+ */
+ ll_ringbuffer_data_pair getWriteVector() const noexcept;
+
+ /**
+ * Return the number of elements available for reading. This is the number
+ * of elements in front of the read pointer and behind the write pointer.
+ */
+ size_t readSpace() const noexcept;
+ /**
+ * The copying data reader. Copy at most `cnt' elements into `dest'.
+ * Returns the actual number of elements copied.
+ */
+ size_t read(void *dest, size_t cnt) noexcept;
+ /**
+ * The copying data reader w/o read pointer advance. Copy at most `cnt'
+ * elements into `dest'. Returns the actual number of elements copied.
+ */
+ size_t peek(void *dest, size_t cnt) const noexcept;
+ /** Advance the read pointer `cnt' places. */
+ void readAdvance(size_t cnt) noexcept;
+
+ /**
+ * Return the number of elements available for writing. This is the number
+ * of elements in front of the write pointer and behind the read pointer.
+ */
+ size_t writeSpace() const noexcept;
+ /**
+ * The copying data writer. Copy at most `cnt' elements from `src'. Returns
+ * the actual number of elements copied.
+ */
+ size_t write(const void *src, size_t cnt) noexcept;
+ /** Advance the write pointer `cnt' places. */
+ void writeAdvance(size_t cnt) noexcept;
-/**
- * The non-copying data reader. Returns two ringbuffer data pointers that hold
- * the current readable data at `rb'. If the readable data is in one segment
- * the second segment has zero length.
- */
-ll_ringbuffer_data_pair ll_ringbuffer_get_read_vector(const ll_ringbuffer *rb);
-/**
- * The non-copying data writer. Returns two ringbuffer data pointers that hold
- * the current writeable data at `rb'. If the writeable data is in one segment
- * the second segment has zero length.
- */
-ll_ringbuffer_data_pair ll_ringbuffer_get_write_vector(const ll_ringbuffer *rb);
+ DEF_PLACE_NEWDEL()
+};
-/**
- * Return the number of elements available for reading. This is the number of
- * elements in front of the read pointer and behind the write pointer.
- */
-size_t ll_ringbuffer_read_space(const ll_ringbuffer *rb);
-/**
- * The copying data reader. Copy at most `cnt' elements from `rb' to `dest'.
- * Returns the actual number of elements copied.
- */
-size_t ll_ringbuffer_read(ll_ringbuffer *rb, void *dest, size_t cnt);
-/**
- * The copying data reader w/o read pointer advance. Copy at most `cnt'
- * elements from `rb' to `dest'. Returns the actual number of elements copied.
- */
-size_t ll_ringbuffer_peek(ll_ringbuffer *rb, void *dest, size_t cnt);
-/** Advance the read pointer `cnt' places. */
-void ll_ringbuffer_read_advance(ll_ringbuffer *rb, size_t cnt);
/**
- * Return the number of elements available for writing. This is the number of
- * elements in front of the write pointer and behind the read pointer.
- */
-size_t ll_ringbuffer_write_space(const ll_ringbuffer *rb);
-/**
- * The copying data writer. Copy at most `cnt' elements to `rb' from `src'.
- * Returns the actual number of elements copied.
+ * Create a new ringbuffer to hold at least `sz' elements of `elem_sz' bytes.
+ * The number of elements is rounded up to the next power of two (even if it is
+ * already a power of two, to ensure the requested amount can be written).
*/
-size_t ll_ringbuffer_write(ll_ringbuffer *rb, const void *src, size_t cnt);
-/** Advance the write pointer `cnt' places. */
-void ll_ringbuffer_write_advance(ll_ringbuffer *rb, size_t cnt);
+RingBuffer *ll_ringbuffer_create(size_t sz, size_t elem_sz, int limit_writes);
-using RingBufferPtr = std::unique_ptr<ll_ringbuffer>;
+using RingBufferPtr = std::unique_ptr<RingBuffer>;
#endif /* RINGBUFFER_H */