queue_spsc_isr.h

Go to the documentation of this file.

 
/******************************************************************************
The MIT License(MIT)
 
Embedded Template Library.
https://github.com/ETLCPP/etl
https://www.etlcpp.com
 
Copyright(c) 2018 John Wellbelove
 
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
 
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
 
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
******************************************************************************/
 
#ifndef ETL_SPSC_QUEUE_ISR_INCLUDED
#define ETL_SPSC_QUEUE_ISR_INCLUDED
 
#include "platform.h"
#include "alignment.h"
#include "parameter_type.h"
#include "memory_model.h"
#include "integral_limits.h"
#include "utility.h"
#include "placement_new.h"
 
#include <stddef.h>
#include <stdint.h>
 
namespace etl
{
  template <typename T, const size_t MEMORY_MODEL = etl::memory_model::MEMORY_MODEL_LARGE>
  class queue_spsc_isr_base
  {
  public:

    typedef typename etl::size_type_lookup<MEMORY_MODEL>::type size_type;
 
    typedef T        value_type;      
    typedef T&       reference;       
    typedef const T& const_reference; 
#if ETL_USING_CPP11
    typedef T&&      rvalue_reference;
#endif
 
    //*************************************************************************
    //*************************************************************************
    bool push_from_isr(const_reference value)
    {
      return push_implementation(value);
    }
 
#if ETL_USING_CPP11
    //*************************************************************************
    //*************************************************************************
    bool push_from_isr(rvalue_reference value)
    {
      return push_implementation(etl::move(value));
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_QUEUE_ISR_FORCE_CPP03_IMPLEMENTATION)
    template <typename ... Args>
    bool emplace_from_isr(Args&&... args)
    {
      return emplace_implementation(etl::forward<Args>(args)...);
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    bool pop_from_isr(reference value)
    {
      return pop_implementation(value);
    }
 
    //*************************************************************************
    //*************************************************************************
    bool pop_from_isr()
    {
      return pop_implementation();
    }
 
    //*************************************************************************
    //*************************************************************************
    reference front_from_isr()
    {
      return front_implementation();
    }
 
    //*************************************************************************
    //*************************************************************************
    const_reference front_from_isr() const
    {
      return front_implementation();
    }
 
    //*************************************************************************
    //*************************************************************************
    size_type available_from_isr() const
    {
      return MAX_SIZE - current_size;
    }
 
    //*************************************************************************
    //*************************************************************************
    void clear_from_isr()
    {
      while (pop_implementation())
      {
        // Do nothing.
      }
    }
 
    //*************************************************************************
    //*************************************************************************
    bool empty_from_isr() const
    {
      return (current_size == 0);
    }
 
    //*************************************************************************
    //*************************************************************************
    bool full_from_isr() const
    {
      return (current_size == MAX_SIZE);
    }
 
    //*************************************************************************
    //*************************************************************************
    size_type size_from_isr() const
    {
      return current_size;
    }
 
    //*************************************************************************
    //*************************************************************************
    size_type capacity() const
    {
      return MAX_SIZE;
    }
 
    //*************************************************************************
    //*************************************************************************
    size_type max_size() const
    {
      return MAX_SIZE;
    }
 
  protected:
 
    queue_spsc_isr_base(T* p_buffer_, size_type max_size_)
      : p_buffer(p_buffer_),
        write_index(0),
        read_index(0),
        current_size(0),
        MAX_SIZE(max_size_)
    {
    }
 
    //*************************************************************************
    //*************************************************************************
    bool push_implementation(const_reference value)
    {
      if (current_size != MAX_SIZE)
      {
        ::new (&p_buffer[write_index]) T(value);
 
        write_index = get_next_index(write_index, MAX_SIZE);
 
        ++current_size;
 
        return true;
      }
 
      // Queue is full.
      return false;
    }
 
#if ETL_USING_CPP11
    //*************************************************************************
    //*************************************************************************
    bool push_implementation(rvalue_reference value)
    {
      if (current_size != MAX_SIZE)
      {
        ::new (&p_buffer[write_index]) T(etl::move(value));
 
        write_index = get_next_index(write_index, MAX_SIZE);
 
        ++current_size;
 
        return true;
      }
 
      // Queue is full.
      return false;
    }
#endif
 
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_QUEUE_ISR_FORCE_CPP03_IMPLEMENTATION)
    //*************************************************************************
    //*************************************************************************
    template <typename ... Args>
    bool emplace_implementation(Args&&... args)
    {
      if (current_size != MAX_SIZE)
      {
        ::new (&p_buffer[write_index]) T(etl::forward<Args>(args)...);
 
        write_index = get_next_index(write_index, MAX_SIZE);
 
        ++current_size;
 
        return true;
      }
 
      // Queue is full.
      return false;
    }
#else
    //*************************************************************************
    //*************************************************************************
    bool emplace_implementation()
    {
      if (current_size != MAX_SIZE)
      {
        ::new (&p_buffer[write_index]) T();
 
        write_index = get_next_index(write_index, MAX_SIZE);
 
        ++current_size;
 
        return true;
      }
 
      // Queue is full.
      return false;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename T1>
    bool emplace_implementation(const T1& value1)
    {
      if (current_size != MAX_SIZE)
      {
        ::new (&p_buffer[write_index]) T(value1);
 
        write_index = get_next_index(write_index, MAX_SIZE);
 
        ++current_size;
 
        return true;
      }
 
      // Queue is full.
      return false;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename T1, typename T2>
    bool emplace_implementation(const T1& value1, const T2& value2)
    {
      if (current_size != MAX_SIZE)
      {
        ::new (&p_buffer[write_index]) T(value1, value2);
 
        write_index = get_next_index(write_index, MAX_SIZE);
 
        ++current_size;
 
        return true;
      }
 
      // Queue is full.
      return false;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename T1, typename T2, typename T3>
    bool emplace_implementation(const T1& value1, const T2& value2, const T3& value3)
    {
      if (current_size != MAX_SIZE)
      {
        ::new (&p_buffer[write_index]) T(value1, value2, value3);
 
        write_index = get_next_index(write_index, MAX_SIZE);
 
        ++current_size;
 
        return true;
      }
 
      // Queue is full.
      return false;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename T1, typename T2, typename T3, typename T4>
    bool emplace_implementation(const T1& value1, const T2& value2, const T3& value3, const T4& value4)
    {
      if (current_size != MAX_SIZE)
      {
        ::new (&p_buffer[write_index]) T(value1, value2, value3, value4);
 
        write_index = get_next_index(write_index, MAX_SIZE);
 
        ++current_size;
 
        return true;
      }
 
      // Queue is full.
      return false;
    }
 
#endif
 
    //*************************************************************************
    //*************************************************************************
    bool pop_implementation(reference value)
    {
      if (current_size == 0)
      {
        // Queue is empty
        return false;
      }
 
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_QUEUE_LOCKABLE_FORCE_CPP03_IMPLEMENTATION)
      value = etl::move(p_buffer[read_index]);
#else
      value = p_buffer[read_index];
#endif
 
      p_buffer[read_index].~T();
 
      read_index = get_next_index(read_index, MAX_SIZE);
 
      --current_size;
 
      return true;
    }
 
    //*************************************************************************
    //*************************************************************************
    reference front_implementation()
    {
      return p_buffer[read_index];
    }
 
    //*************************************************************************
    //*************************************************************************
    const_reference front_implementation() const
    {
      return p_buffer[read_index];
    }
 
    //*************************************************************************
    //*************************************************************************
    bool pop_implementation()
    {
      if (current_size == 0)
      {
        // Queue is empty
        return false;
      }
 
      p_buffer[read_index].~T();
 
      read_index = get_next_index(read_index, MAX_SIZE);
 
      --current_size;
 
      return true;
    }
 
    //*************************************************************************
    //*************************************************************************
    static size_type get_next_index(size_type index, size_type maximum)
    {
      ++index;
 
      if (index == maximum) ETL_UNLIKELY
      {
        index = 0;
      }
 
      return index;
    }
 
    T* p_buffer;              
    size_type write_index;    
    size_type read_index;     
    size_type current_size;   
    const size_type MAX_SIZE; 
 
  private:
 
    //*************************************************************************
    //*************************************************************************
#if defined(ETL_POLYMORPHIC_SPSC_QUEUE_ISR) || defined(ETL_POLYMORPHIC_CONTAINERS)
  public:
    virtual ~queue_spsc_isr_base()
    {
    }
#else
  protected:
    ~queue_spsc_isr_base()
    {
    }
#endif
  };
 
  //***************************************************************************
  //***************************************************************************
  template <typename T, typename TAccess, const size_t MEMORY_MODEL = etl::memory_model::MEMORY_MODEL_LARGE>
  class iqueue_spsc_isr : public queue_spsc_isr_base<T, MEMORY_MODEL>
  {
  private:
 
    typedef queue_spsc_isr_base<T, MEMORY_MODEL> base_t;
 
  public:
 
    typedef typename base_t::value_type       value_type;      
    typedef typename base_t::reference        reference;       
    typedef typename base_t::const_reference  const_reference; 
#if ETL_USING_CPP11
    typedef typename base_t::rvalue_reference rvalue_reference;
#endif
    typedef typename base_t::size_type        size_type;       
 
    //*************************************************************************
    //*************************************************************************
    bool push(const_reference value)
    {
      TAccess::lock();
 
      bool result = this->push_implementation(value);
 
      TAccess::unlock();
 
      return result;
    }
 
#if ETL_USING_CPP11
    //*************************************************************************
    //*************************************************************************
    bool push(rvalue_reference value)
    {
      TAccess::lock();
 
      bool result = this->push_implementation(etl::move(value));
 
      TAccess::unlock();
 
      return result;
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_QUEUE_ISR_FORCE_CPP03_IMPLEMENTATION)
    template <typename ... Args>
    bool emplace(Args&&... args)
    {
      TAccess::lock();
 
      bool result = this->emplace_implementation(etl::forward<Args>(args)...);
 
      TAccess::unlock();
 
      return result;
    }
#else
    //*************************************************************************
    //*************************************************************************
    bool emplace()
    {
      TAccess::lock();
 
      bool result = this->emplace_implementation();
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename T1>
    bool emplace(const T1& value1)
    {
      TAccess::lock();
 
      bool result = this->emplace_implementation(value1);
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename T1, typename T2>
    bool emplace(const T1& value1, const T2& value2)
    {
      TAccess::lock();
 
      bool result = this->emplace_implementation(value1, value2);
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename T1, typename T2, typename T3>
    bool emplace(const T1& value1, const T2& value2, const T3& value3)
    {
      TAccess::lock();
 
      bool result = this->emplace_implementation(value1, value2, value3);
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <typename T1, typename T2, typename T3, typename T4>
    bool emplace(const T1& value1, const T2& value2, const T3& value3, const T4& value4)
    {
      TAccess::lock();
 
      bool result = this->emplace_implementation(value1, value2, value3, value4);
 
      TAccess::unlock();
 
      return result;
    }
#endif
 
    //*************************************************************************
    //*************************************************************************
    bool pop(reference value)
    {
      TAccess::lock();
 
      bool result = this->pop_implementation(value);
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    bool pop()
    {
      TAccess::lock();
 
      bool result = this->pop_implementation();
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    reference front()
    {
      TAccess::lock();
 
      reference result = this->front_implementation();
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    const_reference front() const
    {
      TAccess::lock();
 
      const_reference result = this->front_implementation();
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    void clear()
    {
      TAccess::lock();
 
      if ETL_IF_CONSTEXPR(etl::is_trivially_destructible<T>::value)
      {
        this->write_index  = 0;
        this->read_index   = 0;
        this->current_size = 0;
      }
      else
      {
        while (pop())
        {
          // Do nothing.
        }
      }
 
      TAccess::unlock();
    }
 
    //*************************************************************************
    //*************************************************************************
    bool empty() const
    {
      TAccess::lock();
 
      size_type result = (this->current_size == 0);
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    bool full() const
    {
      TAccess::lock();
 
      size_type result = (this->current_size == this->MAX_SIZE);
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    size_type size() const
    {
      TAccess::lock();
 
      size_type result = this->current_size;
 
      TAccess::unlock();
 
      return result;
    }
 
    //*************************************************************************
    //*************************************************************************
    size_type available() const
    {
      TAccess::lock();
 
      size_type result = this->MAX_SIZE - this->current_size;
 
      TAccess::unlock();
 
      return result;
    }
 
  protected:
 
    //*************************************************************************
    //*************************************************************************
    iqueue_spsc_isr(T* p_buffer_, size_type max_size_)
      : base_t(p_buffer_, max_size_)
    {
    }
 
  private:
 
    // Disable copy construction and assignment.
    iqueue_spsc_isr(const iqueue_spsc_isr&) ETL_DELETE;
    iqueue_spsc_isr& operator =(const iqueue_spsc_isr&) ETL_DELETE;
 
#if ETL_USING_CPP11
    iqueue_spsc_isr(iqueue_spsc_isr&&) = delete;
    iqueue_spsc_isr& operator =(iqueue_spsc_isr&&) = delete;
#endif
 
    TAccess access; 
  };
 
  //***************************************************************************
  //***************************************************************************
  template <typename T, size_t SIZE, typename TAccess, const size_t MEMORY_MODEL = etl::memory_model::MEMORY_MODEL_LARGE>
  class queue_spsc_isr : public etl::iqueue_spsc_isr<T, TAccess, MEMORY_MODEL>
  {
  private:
 
    typedef etl::iqueue_spsc_isr<T, TAccess, MEMORY_MODEL> base_t;
 
  public:
 
    typedef typename base_t::size_type size_type;
 
    ETL_STATIC_ASSERT((SIZE <= etl::integral_limits<size_type>::max), "Size too large for memory model");
 
    static ETL_CONSTANT size_type MAX_SIZE = size_type(SIZE);
 
    //*************************************************************************
    //*************************************************************************
    queue_spsc_isr()
      : base_t(reinterpret_cast<T*>(&buffer[0]), MAX_SIZE)
    {
    }
 
    //*************************************************************************
    //*************************************************************************
    ~queue_spsc_isr()
    {
      base_t::clear();
    }
 
  private:
 
    queue_spsc_isr(const queue_spsc_isr&) ETL_DELETE;
    queue_spsc_isr& operator = (const queue_spsc_isr&) ETL_DELETE;
 
#if ETL_USING_CPP11
    queue_spsc_isr(queue_spsc_isr&&) = delete;
    queue_spsc_isr& operator =(queue_spsc_isr&&) = delete;
#endif

    typename etl::aligned_storage<sizeof(T), etl::alignment_of<T>::value>::type buffer[MAX_SIZE];
  };
 
  template <typename T, size_t SIZE, typename TAccess, const size_t MEMORY_MODEL>
  ETL_CONSTANT typename queue_spsc_isr<T, SIZE, TAccess, MEMORY_MODEL>::size_type queue_spsc_isr<T, SIZE, TAccess, MEMORY_MODEL>::MAX_SIZE;
}
 
#endif