线程安全ring buffer
  MJlmRDrYd0Ow 2023年11月02日 68 0


#include <iostream>
#include <string>
#include <vector>
#include <atomic>
struct SpinLock {
SpinLock(std::atomic_flag &flag) : flag_(flag) {
while (true == flag_.test_and_set(std::memory_order_acquire)) {
}
}
~SpinLock() {
flag_.clear(std::memory_order_release);
}
private:
std::atomic_flag &flag_;
};
template <class T>
struct BufferBase {
virtual ~BufferBase() = default;
virtual bool try_push(const T &&) = 0;
virtual bool try_pop(T &) = 0;
};
class StringRingBuffer : public BufferBase<std::string> {
public:
struct Item {
Item() : written(false) , flag{ATOMIC_FLAG_INIT} {

}
bool written;
std::string data;
std::atomic_flag flag;
};
public:
StringRingBuffer(size_t size = 1024) : size_(size){
if (0 == size_ || size_ > max_capacity_) {
size_ = max_capacity_;
}
try {
ring_ = new Item[size_];
}
catch (std::exception &e) {
ring_ = nullptr;
std::cerr << e.what() << std::endl;
::exit(-1);
}
}
virtual ~StringRingBuffer() {
if (nullptr != ring_) {
delete []ring_;
ring_ = nullptr;
}
}
public:
virtual bool try_push(const std::string &&data) override {
Item &item = ring_[written_index_];
SpinLock lock(item.flag);
if (true == item.written) {
return false;
}
item.data = std::move(data);
written_index_ = (written_index_ + 1) % size_;
item.written = true;
return true;
}
virtual bool try_pop(std::string &data) override {
Item &item = ring_[read_index_ % size_];
SpinLock lock(item.flag);
if (false == item.written) {
return false;
}
data = std::move(item.data);
item.written = false;
read_index_ = (read_index_ + 1) % size_;
return true;
}
void set_max_capacity(size_t cap) {
max_capacity_ = cap;
}
private:
size_t size_;
size_t written_index_ = 0;
size_t read_index_ = 0;
Item *ring_ = nullptr;
private:
size_t max_capacity_ = 1024 * 1024;
};
int main() {
StringRingBuffer buffer;
std::string data;
std::cout << buffer.try_push("hello world") << std::endl;
std::cout << buffer.try_pop(data) << std::endl;
std::cout << data << std::endl;

return 0;
}

 

【版权声明】本文内容来自摩杜云社区用户原创、第三方投稿、转载,内容版权归原作者所有。本网站的目的在于传递更多信息,不拥有版权,亦不承担相应法律责任。如果您发现本社区中有涉嫌抄袭的内容,欢迎发送邮件进行举报,并提供相关证据,一经查实,本社区将立刻删除涉嫌侵权内容,举报邮箱: cloudbbs@moduyun.com

  1. 分享:
最后一次编辑于 2023年11月08日 0

暂无评论

推荐阅读
MJlmRDrYd0Ow
最新推荐 更多