Loading...
Searching...
No Matches
queue_spsc_locked.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) 2019 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_LOCKED_INCLUDED
#define ETL_SPSC_QUEUE_LOCKED_INCLUDED
#include "platform.h"
#include "function.h"
#include "integral_limits.h"
#include "memory.h"
#include "memory_model.h"
#include "parameter_type.h"
#include "placement_new.h"
#include "utility.h"
#include <stddef.h>
namespace etl
{
//***************************************************************************
//***************************************************************************
class queue_spsc_locked_exception : public exception
{
public:
queue_spsc_locked_exception(string_type reason_, string_type file_name_, numeric_type line_number_)
: exception(reason_, file_name_, line_number_)
{
}
};
//***************************************************************************
//***************************************************************************
class queue_spsc_locked_empty : public queue_spsc_locked_exception
{
public:
queue_spsc_locked_empty(string_type file_name_, numeric_type line_number_)
: queue_spsc_locked_exception(ETL_ERROR_TEXT("queue_spsc_locked:empty", ETL_QUEUE_SPSC_LOCKED_FILE_ID"A"), file_name_, line_number_)
{
}
};
template <size_t MEMORY_MODEL = etl::memory_model::MEMORY_MODEL_LARGE>
class iqueue_spsc_locked_base
{
public:
typedef typename etl::size_type_lookup<MEMORY_MODEL>::type size_type;
//*************************************************************************
//*************************************************************************
size_type available_from_unlocked() const
{
return available_implementation();
}
//*************************************************************************
//*************************************************************************
bool full_from_unlocked() const
{
return full_implementation();
}
//*************************************************************************
//*************************************************************************
size_type size_from_unlocked() const
{
return size_implementation();
}
//*************************************************************************
//*************************************************************************
bool empty_from_unlocked() const
{
return empty_implementation();
}
//*************************************************************************
//*************************************************************************
size_type capacity() const
{
return MAX_SIZE;
}
//*************************************************************************
//*************************************************************************
size_type max_size() const
{
return MAX_SIZE;
}
protected:
iqueue_spsc_locked_base(size_type max_size_)
: write_index(0)
, read_index(0)
, current_size(0)
, MAX_SIZE(max_size_)
{
}
//*************************************************************************
//*************************************************************************
static size_type get_next_index(size_type index, size_type maximum)
{
++index;
if (index == maximum) ETL_UNLIKELY
{
index = 0;
}
return index;
}
size_type write_index;
size_type read_index;
size_type current_size;
const size_type MAX_SIZE;
protected:
//*************************************************************************
//*************************************************************************
size_type available_implementation() const
{
return MAX_SIZE - current_size;
}
//*************************************************************************
//*************************************************************************
bool full_implementation() const
{
return (current_size == MAX_SIZE);
}
//*************************************************************************
//*************************************************************************
size_type size_implementation() const
{
return current_size;
}
//*************************************************************************
//*************************************************************************
bool empty_implementation() const
{
return (current_size == 0);
}
//*************************************************************************
//*************************************************************************
#if defined(ETL_POLYMORPHIC_SPSC_QUEUE_ISR) || defined(ETL_POLYMORPHIC_CONTAINERS)
public:
virtual ~iqueue_spsc_locked_base() {}
#else
protected:
~iqueue_spsc_locked_base() {}
#endif
};
//***************************************************************************
//***************************************************************************
template <typename T, const size_t MEMORY_MODEL = etl::memory_model::MEMORY_MODEL_LARGE>
class iqueue_spsc_locked : public iqueue_spsc_locked_base<MEMORY_MODEL>
{
private:
typedef iqueue_spsc_locked_base<MEMORY_MODEL> base_t;
public:
typedef T value_type;
typedef T& reference;
typedef const T& const_reference;
#if ETL_USING_CPP11
typedef T&& rvalue_reference;
#endif
typedef typename base_t::size_type size_type;
//*************************************************************************
//*************************************************************************
bool push_from_unlocked(const_reference value)
{
return push_implementation(value);
}
//*************************************************************************
//*************************************************************************
bool push(const_reference value)
{
lock();
bool result = push_implementation(value);
unlock();
return result;
}
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_QUEUE_LOCKED_FORCE_CPP03_IMPLEMENTATION)
//*************************************************************************
//*************************************************************************
bool push_from_unlocked(rvalue_reference value)
{
return push_implementation(etl::move(value));
}
//*************************************************************************
//*************************************************************************
bool push(rvalue_reference value)
{
lock();
bool result = push_implementation(etl::move(value));
unlock();
return result;
}
#endif
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_QUEUE_LOCKED_FORCE_CPP03_IMPLEMENTATION)
//*************************************************************************
//*************************************************************************
template <typename... Args>
bool emplace_from_unlocked(Args&&... args)
{
return emplace_implementation(etl::forward<Args>(args)...);
}
//*************************************************************************
//*************************************************************************
template <typename... Args>
bool emplace(Args&&... args)
{
lock();
bool result = emplace_implementation(etl::forward<Args>(args)...);
unlock();
return result;
}
#else
//*************************************************************************
//*************************************************************************
template <typename T1>
bool emplace_from_unlocked(const T1& value1)
{
return emplace_implementation(value1);
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2>
bool emplace_from_unlocked(const T1& value1, const T2& value2)
{
return emplace_implementation(value1, value2);
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2, typename T3>
bool emplace_from_unlocked(const T1& value1, const T2& value2, const T3& value3)
{
return emplace_implementation(value1, value2, value3);
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2, typename T3, typename T4>
bool emplace_from_unlocked(const T1& value1, const T2& value2, const T3& value3, const T4& value4)
{
return emplace_implementation(value1, value2, value3, value4);
}
//*************************************************************************
//*************************************************************************
bool emplace()
{
lock();
bool result = emplace_implementation();
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
template <typename T1>
bool emplace(const T1& value1)
{
lock();
bool result = emplace_implementation(value1);
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2>
bool emplace(const T1& value1, const T2& value2)
{
lock();
bool result = emplace_implementation(value1, value2);
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2, typename T3>
bool emplace(const T1& value1, const T2& value2, const T3& value3)
{
lock();
bool result = emplace_implementation(value1, value2, value3);
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)
{
lock();
bool result = emplace_implementation(value1, value2, value3, value4);
unlock();
return result;
}
#endif
//*************************************************************************
//*************************************************************************
bool pop_from_unlocked(reference value)
{
return pop_implementation(value);
}
//*************************************************************************
//*************************************************************************
bool pop(reference value)
{
lock();
bool result = pop_implementation(value);
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
bool pop_from_unlocked()
{
return pop_implementation();
}
//*************************************************************************
//*************************************************************************
bool pop()
{
lock();
bool result = pop_implementation();
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
reference front_from_unlocked()
{
return front_implementation();
}
//*************************************************************************
//*************************************************************************
const_reference front_from_unlocked() const
{
return front_implementation();
}
//*************************************************************************
//*************************************************************************
reference front()
{
#if ETL_CHECKING_EXTRA
lock();
if (!this->empty_from_unlocked())
{
reference inner_result = front_implementation();
unlock();
return inner_result;
}
else
{
unlock();
ETL_ASSERT_FAIL(ETL_ERROR(queue_spsc_locked_empty));
// fall through to return something to satisfy the compiler, even
// though this should never be reached due to undefined behaviour.
}
#endif
lock();
reference result = front_implementation();
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
const_reference front() const
{
#if ETL_CHECKING_EXTRA
lock();
if (!this->empty_from_unlocked())
{
const_reference inner_result = front_implementation();
unlock();
return inner_result;
}
else
{
unlock();
ETL_ASSERT_FAIL(ETL_ERROR(queue_spsc_locked_empty));
// fall through to return something to satisfy the compiler, even
// though this should never be reached due to undefined behaviour.
}
#endif
lock();
const_reference result = front_implementation();
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
void clear_from_unlocked()
{
while (pop_implementation())
{
// Do nothing.
}
}
//*************************************************************************
//*************************************************************************
void clear()
{
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_implementation())
{
// Do nothing.
}
}
unlock();
}
//*************************************************************************
//*************************************************************************
size_type available() const
{
lock();
size_type result = this->available_implementation();
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
bool full() const
{
lock();
size_type result = this->full_implementation();
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
size_type size() const
{
lock();
size_type result = this->size_implementation();
unlock();
return result;
}
//*************************************************************************
//*************************************************************************
bool empty() const
{
lock();
bool result = this->empty_implementation();
unlock();
return result;
}
protected:
//*************************************************************************
//*************************************************************************
iqueue_spsc_locked(T* p_buffer_, size_type max_size_, const etl::ifunction<void>& lock_, const etl::ifunction<void>& unlock_)
: base_t(max_size_)
, p_buffer(p_buffer_)
, lock(lock_)
, unlock(unlock_)
{
}
private:
//*************************************************************************
//*************************************************************************
bool push_implementation(const_reference value)
{
if (this->current_size != this->MAX_SIZE)
{
::new (&p_buffer[this->write_index]) T(value);
this->write_index = this->get_next_index(this->write_index, this->MAX_SIZE);
++this->current_size;
return true;
}
// Queue is full.
return false;
}
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_QUEUE_LOCKED_FORCE_CPP03_IMPLEMENTATION)
//*************************************************************************
//*************************************************************************
bool push_implementation(rvalue_reference value)
{
if (this->current_size != this->MAX_SIZE)
{
::new (&p_buffer[this->write_index]) T(etl::move(value));
this->write_index = this->get_next_index(this->write_index, this->MAX_SIZE);
++this->current_size;
return true;
}
// Queue is full.
return false;
}
#endif
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_QUEUE_LOCKED_FORCE_CPP03_IMPLEMENTATION)
//*************************************************************************
//*************************************************************************
template <typename... Args>
bool emplace_implementation(Args&&... args)
{
if (this->current_size != this->MAX_SIZE)
{
::new (&p_buffer[this->write_index]) T(etl::forward<Args>(args)...);
this->write_index = this->get_next_index(this->write_index, this->MAX_SIZE);
++this->current_size;
return true;
}
// Queue is full.
return false;
}
#else
//*************************************************************************
//*************************************************************************
bool emplace_implementation()
{
if (this->current_size != this->MAX_SIZE)
{
::new (&p_buffer[this->write_index]) T();
this->write_index = this->get_next_index(this->write_index, this->MAX_SIZE);
++this->current_size;
return true;
}
// Queue is full.
return false;
}
//*************************************************************************
//*************************************************************************
template <typename T1>
bool emplace_implementation(const T1& value1)
{
if (this->current_size != this->MAX_SIZE)
{
::new (&p_buffer[this->write_index]) T(value1);
this->write_index = this->get_next_index(this->write_index, this->MAX_SIZE);
++this->current_size;
return true;
}
// Queue is full.
return false;
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2>
bool emplace_implementation(const T1& value1, const T2& value2)
{
if (this->current_size != this->MAX_SIZE)
{
::new (&p_buffer[this->write_index]) T(value1, value2);
this->write_index = this->get_next_index(this->write_index, this->MAX_SIZE);
++this->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 (this->current_size != this->MAX_SIZE)
{
::new (&p_buffer[this->write_index]) T(value1, value2, value3);
this->write_index = this->get_next_index(this->write_index, this->MAX_SIZE);
++this->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 (this->current_size != this->MAX_SIZE)
{
::new (&p_buffer[this->write_index]) T(value1, value2, value3, value4);
this->write_index = this->get_next_index(this->write_index, this->MAX_SIZE);
++this->current_size;
return true;
}
// Queue is full.
return false;
}
#endif
//*************************************************************************
//*************************************************************************
bool pop_implementation(reference value)
{
if (this->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[this->read_index]);
#else
value = p_buffer[this->read_index];
#endif
p_buffer[this->read_index].~T();
this->read_index = this->get_next_index(this->read_index, this->MAX_SIZE);
--this->current_size;
return true;
}
//*************************************************************************
//*************************************************************************
reference front_implementation()
{
return p_buffer[this->read_index];
}
//*************************************************************************
//*************************************************************************
const_reference front_implementation() const
{
return p_buffer[this->read_index];
}
//*************************************************************************
//*************************************************************************
bool pop_implementation()
{
if (this->current_size == 0)
{
// Queue is empty
return false;
}
p_buffer[this->read_index].~T();
this->read_index = this->get_next_index(this->read_index, this->MAX_SIZE);
--this->current_size;
return true;
}
// Disable copy construction and assignment.
iqueue_spsc_locked(const iqueue_spsc_locked&) ETL_DELETE;
iqueue_spsc_locked& operator=(const iqueue_spsc_locked&) ETL_DELETE;
#if ETL_USING_CPP11
iqueue_spsc_locked(iqueue_spsc_locked&&) = delete;
iqueue_spsc_locked& operator=(iqueue_spsc_locked&&) = delete;
#endif
T* p_buffer;
const etl::ifunction<void>& lock;
const etl::ifunction<void>& unlock;
};
//***************************************************************************
//***************************************************************************
template <typename T, size_t SIZE, const size_t MEMORY_MODEL = etl::memory_model::MEMORY_MODEL_LARGE>
class queue_spsc_locked : public etl::iqueue_spsc_locked<T, MEMORY_MODEL>
{
private:
typedef etl::iqueue_spsc_locked<T, 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_locked(const etl::ifunction<void>& lock_, const etl::ifunction<void>& unlock_)
: base_t(reinterpret_cast<T*>(buffer.raw), MAX_SIZE, lock_, unlock_)
{
}
//*************************************************************************
//*************************************************************************
~queue_spsc_locked()
{
base_t::clear();
}
private:
queue_spsc_locked(const queue_spsc_locked&) ETL_DELETE;
queue_spsc_locked& operator=(const queue_spsc_locked&) ETL_DELETE;
#if ETL_USING_CPP11
queue_spsc_locked(queue_spsc_locked&&) = delete;
queue_spsc_locked& operator=(queue_spsc_locked&&) = delete;
#endif
etl::uninitialized_buffer_of<T, MAX_SIZE> buffer;
};
template <typename T, size_t SIZE, const size_t MEMORY_MODEL>
ETL_CONSTANT typename queue_spsc_locked<T, SIZE, MEMORY_MODEL>::size_type queue_spsc_locked<T, SIZE, MEMORY_MODEL>::MAX_SIZE;
} // namespace etl
#endif
etl::iqueue_spsc_locked_base
Definition queue_spsc_locked.h:77
etl::iqueue_spsc_locked_base::available_from_unlocked
size_type available_from_unlocked() const
How much free space available in the queue.
Definition queue_spsc_locked.h:86
etl::iqueue_spsc_locked_base< MEMORY_MODEL >::MAX_SIZE
const size_type MAX_SIZE
Definition queue_spsc_locked.h:159
etl::iqueue_spsc_locked_base::empty_implementation
bool empty_implementation() const
Is the queue empty?
Definition queue_spsc_locked.h:190
etl::iqueue_spsc_locked_base::available_implementation
size_type available_implementation() const
How much free space available in the queue.
Definition queue_spsc_locked.h:166
etl::iqueue_spsc_locked_base::full_from_unlocked
bool full_from_unlocked() const
Is the queue full?
Definition queue_spsc_locked.h:94
etl::iqueue_spsc_locked_base::empty_from_unlocked
bool empty_from_unlocked() const
Is the queue empty?
Definition queue_spsc_locked.h:110
etl::iqueue_spsc_locked_base::max_size
size_type max_size() const
How many items can the queue hold.
Definition queue_spsc_locked.h:126
etl::iqueue_spsc_locked_base::size_from_unlocked
size_type size_from_unlocked() const
How many items in the queue?
Definition queue_spsc_locked.h:102
etl::iqueue_spsc_locked_base::current_size
size_type current_size
The current size of the queue.
Definition queue_spsc_locked.h:158
etl::iqueue_spsc_locked_base::write_index
size_type write_index
Where to input new data.
Definition queue_spsc_locked.h:156
etl::iqueue_spsc_locked_base::full_implementation
bool full_implementation() const
Is the queue full?
Definition queue_spsc_locked.h:174
etl::iqueue_spsc_locked_base::size_type
etl::size_type_lookup< MEMORY_MODEL >::type size_type
The type used for determining the size of queue.
Definition queue_spsc_locked.h:81
etl::iqueue_spsc_locked_base::capacity
size_type capacity() const
How many items can the queue hold.
Definition queue_spsc_locked.h:118
etl::iqueue_spsc_locked_base::~iqueue_spsc_locked_base
~iqueue_spsc_locked_base()
Destructor.
Definition queue_spsc_locked.h:207
etl::iqueue_spsc_locked_base::get_next_index
static size_type get_next_index(size_type index, size_type maximum)
Calculate the next index.
Definition queue_spsc_locked.h:144
etl::iqueue_spsc_locked_base::read_index
size_type read_index
Where to get the oldest data.
Definition queue_spsc_locked.h:157
etl::iqueue_spsc_locked_base::size_implementation
size_type size_implementation() const
How many items in the queue?
Definition queue_spsc_locked.h:182
etl::iqueue_spsc_locked
This is the base for all queue_spsc_locked that contain a particular type.
Definition queue_spsc_locked.h:222
etl::iqueue_spsc_locked::emplace
bool emplace(const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4)
Definition queue_spsc_locked.h:429
etl::iqueue_spsc_locked::emplace
bool emplace(const T1 &value1)
Definition queue_spsc_locked.h:378
etl::iqueue_spsc_locked::pop_from_unlocked
bool pop_from_unlocked()
Definition queue_spsc_locked.h:468
etl::iqueue_spsc_locked::emplace_from_unlocked
bool emplace_from_unlocked(const T1 &value1)
Definition queue_spsc_locked.h:318
etl::iqueue_spsc_locked::front_from_unlocked
reference front_from_unlocked()
Definition queue_spsc_locked.h:491
etl::iqueue_spsc_locked::emplace
bool emplace(const T1 &value1, const T2 &value2, const T3 &value3)
Definition queue_spsc_locked.h:412
etl::iqueue_spsc_locked::emplace
bool emplace(const T1 &value1, const T2 &value2)
Definition queue_spsc_locked.h:395
etl::iqueue_spsc_locked::emplace_from_unlocked
bool emplace_from_unlocked(const T1 &value1, const T2 &value2)
Definition queue_spsc_locked.h:329
etl::iqueue_spsc_locked::iqueue_spsc_locked
iqueue_spsc_locked(T *p_buffer_, size_type max_size_, const etl::ifunction< void > &lock_, const etl::ifunction< void > &unlock_)
The constructor that is called from derived classes.
Definition queue_spsc_locked.h:659
etl::iqueue_spsc_locked::reference
T & reference
A reference to the type used in the queue.
Definition queue_spsc_locked.h:230
etl::iqueue_spsc_locked::pop
bool pop()
Pop a value from the queue and discard.
Definition queue_spsc_locked.h:476
etl::iqueue_spsc_locked::pop
bool pop(reference value)
Pop a value from the queue.
Definition queue_spsc_locked.h:453
etl::iqueue_spsc_locked::clear
void clear()
Clear the queue.
Definition queue_spsc_locked.h:577
etl::iqueue_spsc_locked::emplace_from_unlocked
bool emplace_from_unlocked(const T1 &value1, const T2 &value2, const T3 &value3)
Definition queue_spsc_locked.h:340
etl::iqueue_spsc_locked::front
reference front()
Definition queue_spsc_locked.h:510
etl::iqueue_spsc_locked::value_type
T value_type
The type stored in the queue.
Definition queue_spsc_locked.h:229
etl::iqueue_spsc_locked::const_reference
const T & const_reference
A const reference to the type used in the queue.
Definition queue_spsc_locked.h:231
etl::iqueue_spsc_locked::front_from_unlocked
const_reference front_from_unlocked() const
Definition queue_spsc_locked.h:500
etl::iqueue_spsc_locked::empty
bool empty() const
Is the queue empty?
Definition queue_spsc_locked.h:643
etl::iqueue_spsc_locked::size
size_type size() const
How many items in the queue?
Definition queue_spsc_locked.h:629
etl::iqueue_spsc_locked::push_from_unlocked
bool push_from_unlocked(const_reference value)
Push a value to the queue.
Definition queue_spsc_locked.h:240
etl::iqueue_spsc_locked::emplace
bool emplace()
Definition queue_spsc_locked.h:361
etl::iqueue_spsc_locked::size_type
base_t::size_type size_type
The type used for determining the size of the queue.
Definition queue_spsc_locked.h:235
etl::iqueue_spsc_locked::emplace_from_unlocked
bool emplace_from_unlocked(const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4)
Definition queue_spsc_locked.h:351
etl::iqueue_spsc_locked::front
const_reference front() const
Definition queue_spsc_locked.h:539
etl::iqueue_spsc_locked::full
bool full() const
Is the queue full?
Definition queue_spsc_locked.h:615
etl::iqueue_spsc_locked::clear_from_unlocked
void clear_from_unlocked()
Clear the queue from the ISR.
Definition queue_spsc_locked.h:566
etl::iqueue_spsc_locked::push
bool push(const_reference value)
Push a value to the queue.
Definition queue_spsc_locked.h:248
etl::iqueue_spsc_locked::available
size_type available() const
How much free space available in the queue.
Definition queue_spsc_locked.h:601
etl::iqueue_spsc_locked::pop_from_unlocked
bool pop_from_unlocked(reference value)
Definition queue_spsc_locked.h:445
etl::size_type
etl::queue_spsc_locked
Definition queue_spsc_locked.h:933
etl::queue_spsc_locked::queue_spsc_locked
queue_spsc_locked(const etl::ifunction< void > &lock_, const etl::ifunction< void > &unlock_)
Default constructor.
Definition queue_spsc_locked.h:950
etl::queue_spsc_locked::~queue_spsc_locked
~queue_spsc_locked()
Destructor.
Definition queue_spsc_locked.h:958
function.h
etl::uninitialized_buffer_of
Definition memory.h:3153
etl::exception::exception
ETL_EXCEPTION_CONSTEXPR exception(string_type reason_, string_type, numeric_type)
Constructor.
Definition exception.h:81
etl::ifunction
Definition function.h:54
etl::integral_limits
Definition integral_limits.h:517
etl::queue_spsc_locked_empty
Definition queue_spsc_locked.h:66
integral_limits.h
memory.h
memory_model.h
etl
Definition absolute.h:40
parameter_type.h
placement_new.h
platform.h
etl::size_type_lookup
Definition memory_model.h:50
utility.h