qequeue.hpp

Go to the documentation of this file.

 
#ifndef QEQUEUE_HPP
#define QEQUEUE_HPP
 
 
#ifndef QF_EQUEUE_CTR_SIZE
 
    #define QF_EQUEUE_CTR_SIZE 1U
#endif
 
 
namespace QP {
 
#if (QF_EQUEUE_CTR_SIZE == 1U)
    using QEQueueCtr = std::uint8_t;
#elif (QF_EQUEUE_CTR_SIZE == 2U)
    using QEQueueCtr = std::uint16_t;
#elif (QF_EQUEUE_CTR_SIZE == 4U)
    using QEQueueCtr = std::uint32_t;
#else
    #error "QF_EQUEUE_CTR_SIZE defined incorrectly, expected 1U, 2U, or 4U"
#endif
 
 
//****************************************************************************
class QEQueue {
private:
 
    QEvt const * volatile m_frontEvt;
 
    QEvt const **m_ring;
 
    QEQueueCtr m_end;
 
    QEQueueCtr volatile m_head;
 
    QEQueueCtr volatile m_tail;
 
    QEQueueCtr volatile m_nFree;
 
    QEQueueCtr m_nMin;
 
public:
    QEQueue(void) noexcept;
 
    void init(QEvt const *qSto[], std::uint_fast16_t const qLen) noexcept;
 
    bool post(QEvt const * const e, std::uint_fast16_t const margin,
              std::uint_fast8_t const qs_id) noexcept;
 
    void postLIFO(QEvt const * const e,
                  std::uint_fast8_t const qs_id) noexcept;
 
    QEvt const *get(std::uint_fast8_t const qs_id) noexcept;
 
    QEQueueCtr getNFree(void) const noexcept {
        return m_nFree;
    }
 
    QEQueueCtr getNMin(void) const noexcept {
        return m_nMin;
    }
 
    bool isEmpty(void) const noexcept {
        return m_frontEvt == nullptr;
    }
 
private:
    QEQueue(QEQueue const &) = delete;
 
    QEQueue & operator=(QEQueue const &) = delete;
 
    friend class QF;
    friend class QActive;
    friend class QXThread;
    friend class QTicker;
    friend class QS;
};
 
} // namespace QP
 
#endif // QEQUEUE_HPP