mirror of
https://github.com/mutouyun/cpp-ipc.git
synced 2025-12-06 16:56:45 +08:00
116 lines
2.9 KiB
C++
116 lines
2.9 KiB
C++
#pragma once
|
|
|
|
#include <type_traits>
|
|
#include <new>
|
|
#include <utility>
|
|
#include <algorithm>
|
|
#include <atomic>
|
|
#include <tuple>
|
|
#include <thread>
|
|
#include <chrono>
|
|
|
|
#include "def.h"
|
|
#include "rw_lock.h"
|
|
#include "circ_elem_array.h"
|
|
|
|
namespace ipc {
|
|
|
|
template <typename T,
|
|
typename Policy = ipc::prod_cons_circ<relat::single, relat::multi, trans::broadcast>>
|
|
class queue {
|
|
public:
|
|
using elems_t = circ::elem_array<sizeof(T), Policy>;
|
|
using policy_t = typename elems_t::policy_t;
|
|
|
|
private:
|
|
elems_t* elems_ = nullptr;
|
|
decltype(std::declval<elems_t>().cursor()) cursor_ = 0;
|
|
std::atomic_bool connected_ { false };
|
|
|
|
public:
|
|
queue() = default;
|
|
|
|
explicit queue(elems_t* els) : queue() {
|
|
attach(els);
|
|
}
|
|
|
|
queue(const queue&) = delete;
|
|
queue& operator=(const queue&) = delete;
|
|
queue(queue&&) = delete;
|
|
queue& operator=(queue&&) = delete;
|
|
|
|
constexpr elems_t * elems() const noexcept {
|
|
return elems_;
|
|
}
|
|
|
|
std::size_t connect() noexcept {
|
|
if (elems_ == nullptr) return invalid_value;
|
|
if (connected_.exchange(true, std::memory_order_acq_rel)) {
|
|
// if it's already connected, just return an error count
|
|
return invalid_value;
|
|
}
|
|
return elems_->connect();
|
|
}
|
|
|
|
std::size_t disconnect() noexcept {
|
|
if (elems_ == nullptr) return invalid_value;
|
|
if (!connected_.exchange(false, std::memory_order_acq_rel)) {
|
|
// if it's already disconnected, just return an error count
|
|
return invalid_value;
|
|
}
|
|
return elems_->disconnect();
|
|
}
|
|
|
|
std::size_t conn_count() const noexcept {
|
|
return (elems_ == nullptr) ? invalid_value : elems_->conn_count();
|
|
}
|
|
|
|
bool empty() const noexcept {
|
|
return (elems_ == nullptr) ? true : (cursor_ == elems_->cursor());
|
|
}
|
|
|
|
bool connected() const noexcept {
|
|
return connected_.load(std::memory_order_acquire);
|
|
}
|
|
|
|
elems_t* attach(elems_t* els) noexcept {
|
|
if (els == nullptr) return nullptr;
|
|
auto old = elems_;
|
|
elems_ = els;
|
|
cursor_ = elems_->cursor();
|
|
return old;
|
|
}
|
|
|
|
elems_t* detach() noexcept {
|
|
if (elems_ == nullptr) return nullptr;
|
|
auto old = elems_;
|
|
elems_ = nullptr;
|
|
return old;
|
|
}
|
|
|
|
template <typename... P>
|
|
auto push(P&&... params) noexcept {
|
|
if (elems_ == nullptr) return false;
|
|
return elems_->push([&](void* p) {
|
|
::new (p) T(std::forward<P>(params)...);
|
|
});
|
|
}
|
|
|
|
T pop() noexcept {
|
|
if (elems_ == nullptr) {
|
|
return {};
|
|
}
|
|
T item;
|
|
for (unsigned k = 0;;) {
|
|
if (elems_->pop(cursor_, [&item](void* p) {
|
|
::new (&item) T(std::move(*static_cast<T*>(p)));
|
|
})) {
|
|
return item;
|
|
}
|
|
ipc::sleep(k);
|
|
}
|
|
}
|
|
};
|
|
|
|
} // namespace ipc
|