cpp-ipc/include/circ_queue.h

#pragma once

#include <type_traits>
#include <new>
#include <exception>
#include <utility>
#include <algorithm>
#include <atomic>
#include <tuple>
#include <thread>
#include <chrono>

#include "def.h"
#include "circ_elem_array.h"

namespace ipc {
namespace circ {

template <typename T>
class queue {
public:
    using array_t = elem_array<sizeof(T)>;

private:
    array_t* elems_ = nullptr;
    typename array_t::u2_t cursor_ = 0;
    std::atomic_bool connected_ { false };

public:
    queue() = default;

    explicit queue(array_t* arr) : queue() {
        attach(arr);
    }

    queue(const queue&) = delete;
    queue& operator=(const queue&) = delete;
    queue(queue&&) = delete;
    queue& operator=(queue&&) = delete;

    constexpr array_t * elems() const {
        return elems_;
    }

    std::size_t connect() {
        if (elems_ == nullptr) return invalid_value;
        if (connected_.exchange(true, std::memory_order_relaxed)) {
            // if it's already connected, just return an error count
            return invalid_value;
        }
        return elems_->connect();
    }

    std::size_t disconnect() {
        if (elems_ == nullptr) return invalid_value;
        if (!connected_.exchange(false, std::memory_order_relaxed)) {
            // if it's already disconnected, just return an error count
            return invalid_value;
        }
        return elems_->disconnect();
    }

    std::size_t conn_count() const {
        return (elems_ == nullptr) ? invalid_value : elems_->conn_count();
    }

    bool connected() const {
        return connected_.load(std::memory_order_relaxed);
    }

    array_t* attach(array_t* arr) {
        if (arr == nullptr) return nullptr;
        auto old = elems_;
        elems_  = arr;
        cursor_ = elems_->cursor();
        return old;
    }

    array_t* detach() {
        if (elems_ == nullptr) return nullptr;
        auto old = elems_;
        elems_ = nullptr;
        return old;
    }

    bool push(T const & item) {
        if (elems_ == nullptr) return false;
        auto ptr = elems_->acquire();
        ::new (ptr) T(item);
        elems_->commit(ptr);
        return true;
    }

    template <typename P>
    auto push(P&& param) // disable this if P is as same as T
     -> Requires<!std::is_same<std::remove_reference_t<P>, T>::value, bool> {
        if (elems_ == nullptr) return false;
        auto ptr = elems_->acquire();
        ::new (ptr) T { std::forward<P>(param) };
        elems_->commit(ptr);
        return true;
    }

    template <typename... P>
    auto push(P&&... params) // some compilers are not support this well
     -> Requires<(sizeof...(P) != 1), bool> {
        if (elems_ == nullptr) return false;
        auto ptr = elems_->acquire();
        ::new (ptr) T { std::forward<P>(params)... };
        elems_->commit(ptr);
        return true;
    }

    template <typename F>
    static queue* multi_wait_for(F&& upd) {
        for (unsigned k = 0;; ++k) {
            auto [ques, size] = upd();
            for (std::size_t i = 0; i < static_cast<std::size_t>(size); ++i) {
                queue* que = ques[i];
                if (que == nullptr) continue;
                if (que->elems_ == nullptr) throw std::logic_error {
                    "This queue hasn't attached any elem_array."
                };
                if (que->cursor_ != que->elems_->cursor()) {
                    return que;
                }
            }
            if (k < 1024) std::this_thread::yield();
            // yielding coarsening
            else std::this_thread::sleep_for(std::chrono::milliseconds(1));
        }
    }

    static T pop(queue* que) {
        if (que == nullptr) throw std::invalid_argument {
            "Invalid ques pointer."
        };
        if (que->elems_ == nullptr) throw std::logic_error {
            "This queue hasn't attached any elem_array."
        };
        auto item_ptr = static_cast<T*>(que->elems_->take(que->cursor_++));
        T item = std::move(*item_ptr);
        que->elems_->put(item_ptr);
        return item;
    }

    T pop() {
        return pop(multi_wait_for([que = this] {
            return std::make_tuple(&que, 1);
        }));
    }
};

} // namespace circ
} // namespace ipc