Loading...
Searching...
No Matches
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 "integral_limits.h"
#include "memory_model.h"
#include "parameter_type.h"
#include "placement_new.h"
#include "utility.h"
#include <stddef.h>
namespace etl
{
//***************************************************************************
//***************************************************************************
class queue_spsc_isr_exception : public exception
{
public:
queue_spsc_isr_exception(string_type reason_, string_type file_name_, numeric_type line_number_)
: exception(reason_, file_name_, line_number_)
{
}
};
//***************************************************************************
//***************************************************************************
class queue_spsc_isr_empty : public queue_spsc_isr_exception
{
public:
queue_spsc_isr_empty(string_type file_name_, numeric_type line_number_)
: queue_spsc_isr_exception(ETL_ERROR_TEXT("queue_spsc_isr:empty", ETL_QUEUE_SPSC_ISR_FILE_ID"A"), file_name_, line_number_)
{
}
};
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()
{
ETL_ASSERT_CHECK_EXTRA(!empty_from_isr(), ETL_ERROR(queue_spsc_isr_empty));
return front_implementation();
}
//*************************************************************************
//*************************************************************************
const_reference front_from_isr() const
{
ETL_ASSERT_CHECK_EXTRA(!empty_from_isr(), ETL_ERROR(queue_spsc_isr_empty));
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()
{
#if ETL_CHECKING_EXTRA
TAccess::lock();
if (!this->empty_from_isr())
{
reference inner_result = this->front_implementation();
TAccess::unlock();
return inner_result;
}
else
{
TAccess::unlock();
ETL_ASSERT_FAIL(ETL_ERROR(queue_spsc_isr_empty));
// fall through to return something to satisfy the compiler, even
// though this should never be reached due to undefined behaviour.
}
#endif
TAccess::lock();
reference result = this->front_implementation();
TAccess::unlock();
return result;
}
//*************************************************************************
//*************************************************************************
const_reference front() const
{
#if ETL_CHECKING_EXTRA
TAccess::lock();
if (!this->empty_from_isr())
{
const_reference inner_result = this->front_implementation();
TAccess::unlock();
return inner_result;
}
else
{
TAccess::unlock();
ETL_ASSERT_FAIL(ETL_ERROR(queue_spsc_isr_empty));
// fall through to return something to satisfy the compiler, even
// though this should never be reached due to undefined behaviour.
}
#endif
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();
bool result = (this->current_size == 0);
TAccess::unlock();
return result;
}
//*************************************************************************
//*************************************************************************
bool full() const
{
TAccess::lock();
bool 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;
} // namespace etl
#endif
alignment.h
etl::iqueue_spsc_isr
This is the base for all queue_spsc_isrs that contain a particular type.
Definition queue_spsc_isr.h:532
etl::iqueue_spsc_isr::emplace
bool emplace(const T1 &value1, const T2 &value2)
Definition queue_spsc_isr.h:634
etl::iqueue_spsc_isr::size_type
base_t::size_type size_type
The type used for determining the size of the queue.
Definition queue_spsc_isr.h:545
etl::iqueue_spsc_isr::size
size_type size() const
How many items in the queue?
Definition queue_spsc_isr.h:821
etl::iqueue_spsc_isr::front
const_reference front() const
Definition queue_spsc_isr.h:742
etl::iqueue_spsc_isr::const_reference
base_t::const_reference const_reference
A const reference to the type used in the queue.
Definition queue_spsc_isr.h:541
etl::iqueue_spsc_isr::pop
bool pop()
Pop a value from the queue and discard.
Definition queue_spsc_isr.h:697
etl::iqueue_spsc_isr::available
size_type available() const
How much free space available in the queue.
Definition queue_spsc_isr.h:835
etl::iqueue_spsc_isr::front
reference front()
Definition queue_spsc_isr.h:713
etl::iqueue_spsc_isr::full
bool full() const
Is the queue full?
Definition queue_spsc_isr.h:807
etl::iqueue_spsc_isr::clear
void clear()
Clear the queue.
Definition queue_spsc_isr.h:769
etl::iqueue_spsc_isr::push
bool push(const_reference value)
Push a value to the queue.
Definition queue_spsc_isr.h:550
etl::iqueue_spsc_isr::emplace
bool emplace(const T1 &value1, const T2 &value2, const T3 &value3)
Definition queue_spsc_isr.h:651
etl::iqueue_spsc_isr::value_type
base_t::value_type value_type
The type stored in the queue.
Definition queue_spsc_isr.h:539
etl::iqueue_spsc_isr::iqueue_spsc_isr
iqueue_spsc_isr(T *p_buffer_, size_type max_size_)
The constructor that is called from derived classes.
Definition queue_spsc_isr.h:851
etl::iqueue_spsc_isr::pop
bool pop(reference value)
Pop a value from the queue.
Definition queue_spsc_isr.h:683
etl::iqueue_spsc_isr::emplace
bool emplace(const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4)
Definition queue_spsc_isr.h:668
etl::iqueue_spsc_isr::reference
base_t::reference reference
A reference to the type used in the queue.
Definition queue_spsc_isr.h:540
etl::iqueue_spsc_isr::emplace
bool emplace(const T1 &value1)
Definition queue_spsc_isr.h:617
etl::iqueue_spsc_isr::empty
bool empty() const
Is the queue empty?
Definition queue_spsc_isr.h:793
etl::iqueue_spsc_isr::emplace
bool emplace()
Definition queue_spsc_isr.h:600
etl::size_type
etl::queue_spsc_isr_base
Definition queue_spsc_isr.h:76
etl::queue_spsc_isr_base::emplace_implementation
bool emplace_implementation()
Definition queue_spsc_isr.h:307
etl::queue_spsc_isr_base::full_from_isr
bool full_from_isr() const
Definition queue_spsc_isr.h:194
etl::queue_spsc_isr_base::pop_implementation
bool pop_implementation(reference value)
Pop a value from the queue.
Definition queue_spsc_isr.h:421
etl::queue_spsc_isr_base::push_from_isr
bool push_from_isr(const_reference value)
Push a value to the queue from an ISR.
Definition queue_spsc_isr.h:92
etl::queue_spsc_isr_base::front_from_isr
const_reference front_from_isr() const
Definition queue_spsc_isr.h:154
etl::queue_spsc_isr_base::front_from_isr
reference front_from_isr()
Definition queue_spsc_isr.h:142
etl::queue_spsc_isr_base::emplace_implementation
bool emplace_implementation(const T1 &value1, const T2 &value2)
Definition queue_spsc_isr.h:353
etl::queue_spsc_isr_base::value_type
T value_type
The type stored in the queue.
Definition queue_spsc_isr.h:82
etl::queue_spsc_isr_base::emplace_implementation
bool emplace_implementation(const T1 &value1, const T2 &value2, const T3 &value3)
Definition queue_spsc_isr.h:376
etl::queue_spsc_isr_base::capacity
size_type capacity() const
How many items can the queue hold.
Definition queue_spsc_isr.h:211
etl::queue_spsc_isr_base::emplace_implementation
bool emplace_implementation(const T1 &value1)
Definition queue_spsc_isr.h:330
etl::queue_spsc_isr_base::clear_from_isr
void clear_from_isr()
Clear the queue from the ISR.
Definition queue_spsc_isr.h:173
etl::queue_spsc_isr_base::get_next_index
static size_type get_next_index(size_type index, size_type maximum)
Calculate the next index.
Definition queue_spsc_isr.h:483
etl::queue_spsc_isr_base::available_from_isr
size_type available_from_isr() const
Definition queue_spsc_isr.h:165
etl::queue_spsc_isr_base::~queue_spsc_isr_base
~queue_spsc_isr_base()
Destructor.
Definition queue_spsc_isr.h:515
etl::queue_spsc_isr_base::size_type
etl::size_type_lookup< MEMORY_MODEL >::type size_type
The type used for determining the size of queue.
Definition queue_spsc_isr.h:80
etl::queue_spsc_isr_base::read_index
size_type read_index
Where to get the oldest data.
Definition queue_spsc_isr.h:497
etl::queue_spsc_isr_base::front_implementation
const_reference front_implementation() const
Peek a value at the front of the queue.
Definition queue_spsc_isr.h:455
etl::queue_spsc_isr_base::emplace_implementation
bool emplace_implementation(const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4)
Definition queue_spsc_isr.h:399
etl::queue_spsc_isr_base::max_size
size_type max_size() const
How many items can the queue hold.
Definition queue_spsc_isr.h:219
etl::queue_spsc_isr_base::pop_from_isr
bool pop_from_isr()
Pop a value from the queue from an ISR, and discard.
Definition queue_spsc_isr.h:132
etl::queue_spsc_isr_base::pop_implementation
bool pop_implementation()
Pop a value from the queue and discard.
Definition queue_spsc_isr.h:463
etl::queue_spsc_isr_base::pop_from_isr
bool pop_from_isr(reference value)
Pop a value from the queue from an ISR.
Definition queue_spsc_isr.h:124
etl::queue_spsc_isr_base::write_index
size_type write_index
Where to input new data.
Definition queue_spsc_isr.h:496
etl::queue_spsc_isr_base< T, MEMORY_MODEL >::MAX_SIZE
const size_type MAX_SIZE
Definition queue_spsc_isr.h:499
etl::queue_spsc_isr_base::empty_from_isr
bool empty_from_isr() const
Definition queue_spsc_isr.h:185
etl::queue_spsc_isr_base::p_buffer
T * p_buffer
The internal buffer.
Definition queue_spsc_isr.h:495
etl::queue_spsc_isr_base< T, MEMORY_MODEL >::current_size
size_type current_size
Definition queue_spsc_isr.h:498
etl::queue_spsc_isr_base::reference
T & reference
A reference to the type used in the queue.
Definition queue_spsc_isr.h:83
etl::queue_spsc_isr_base::const_reference
const T & const_reference
A const reference to the type used in the queue.
Definition queue_spsc_isr.h:84
etl::queue_spsc_isr_base::size_from_isr
size_type size_from_isr() const
Definition queue_spsc_isr.h:203
etl::queue_spsc_isr_base::push_implementation
bool push_implementation(const_reference value)
Push a value to the queue.
Definition queue_spsc_isr.h:238
etl::queue_spsc_isr_base::front_implementation
reference front_implementation()
Peek a value at the front of the queue.
Definition queue_spsc_isr.h:447
etl::queue_spsc_isr
Definition queue_spsc_isr.h:882
etl::queue_spsc_isr::queue_spsc_isr
queue_spsc_isr()
Default constructor.
Definition queue_spsc_isr.h:898
etl::queue_spsc_isr::~queue_spsc_isr
~queue_spsc_isr()
Destructor.
Definition queue_spsc_isr.h:906
etl::aligned_storage
Definition alignment.h:251
etl::exception::exception
ETL_EXCEPTION_CONSTEXPR exception(string_type reason_, string_type, numeric_type)
Constructor.
Definition exception.h:81
etl::integral_limits
Definition integral_limits.h:517
etl::queue_spsc_isr_empty
Definition queue_spsc_isr.h:65
integral_limits.h
memory_model.h
etl
Definition absolute.h:40
parameter_type.h
placement_new.h
platform.h
etl::type
etl::size_type_lookup
Definition memory_model.h:50
utility.h