git subrepo clone --branch=20.41.6 git@github.com:ETLCPP/etl.git components/etl
subrepo: subdir: "components/etl" merged: "be5537ec" upstream: origin: "git@github.com:ETLCPP/etl.git" branch: "20.41.6" commit: "be5537ec" git-subrepo: version: "0.4.9" origin: "???" commit: "???"
This commit is contained in:
parent
931c4def56
commit
11c24647ea
GPG key ID:
BD0C6214E68FB5CF
1296 changed files with 801882 additions and 0 deletions
462
components/etl/test/test_queue_spsc_atomic.cpp
Normal file
462
components/etl/test/test_queue_spsc_atomic.cpp
Normal file
|
|
@ -0,0 +1,462 @@
|
|||
/******************************************************************************
|
||||
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.
|
||||
******************************************************************************/
|
||||
|
||||
#include "unit_test_framework.h"
|
||||
|
||||
#include <thread>
|
||||
#include <chrono>
|
||||
#include <vector>
|
||||
|
||||
#include "etl/queue_spsc_atomic.h"
|
||||
|
||||
#include "data.h"
|
||||
|
||||
#if ETL_HAS_ATOMIC
|
||||
|
||||
#if defined(ETL_TARGET_OS_WINDOWS)
|
||||
#include <Windows.h>
|
||||
#endif
|
||||
|
||||
#define REALTIME_TEST 0
|
||||
|
||||
namespace
|
||||
{
|
||||
struct Data
|
||||
{
|
||||
Data(int a_, int b_ = 2, int c_ = 3, int d_ = 4)
|
||||
: a(a_),
|
||||
b(b_),
|
||||
c(c_),
|
||||
d(d_)
|
||||
{
|
||||
}
|
||||
|
||||
Data()
|
||||
: a(0),
|
||||
b(0),
|
||||
c(0),
|
||||
d(0)
|
||||
{
|
||||
}
|
||||
|
||||
int a;
|
||||
int b;
|
||||
int c;
|
||||
int d;
|
||||
};
|
||||
|
||||
bool operator ==(const Data& lhs, const Data& rhs)
|
||||
{
|
||||
return (lhs.a == rhs.a) && (lhs.b == rhs.b) && (lhs.c == rhs.c) && (lhs.d == rhs.d);
|
||||
}
|
||||
|
||||
using ItemM = TestDataM<int>;
|
||||
|
||||
SUITE(test_queue_atomic)
|
||||
{
|
||||
//*************************************************************************
|
||||
TEST(test_constructor)
|
||||
{
|
||||
etl::queue_spsc_atomic<int, 4> queue;
|
||||
|
||||
CHECK_EQUAL(4U, queue.max_size());
|
||||
CHECK_EQUAL(4U, queue.capacity());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_size_push_pop)
|
||||
{
|
||||
etl::queue_spsc_atomic<int, 4> queue;
|
||||
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
|
||||
CHECK_EQUAL(4U, queue.available());
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
|
||||
queue.push(1);
|
||||
CHECK_EQUAL(1U, queue.size());
|
||||
CHECK_EQUAL(3U, queue.available());
|
||||
|
||||
queue.push(2);
|
||||
CHECK_EQUAL(2U, queue.size());
|
||||
CHECK_EQUAL(2U, queue.available());
|
||||
|
||||
queue.push(3);
|
||||
CHECK_EQUAL(3U, queue.size());
|
||||
CHECK_EQUAL(1U, queue.available());
|
||||
|
||||
queue.push(4);
|
||||
CHECK_EQUAL(4U, queue.size());
|
||||
CHECK_EQUAL(0U, queue.available());
|
||||
|
||||
// Queue full.
|
||||
CHECK(!queue.push(5));
|
||||
|
||||
queue.pop();
|
||||
// Queue not full (buffer rollover)
|
||||
CHECK(queue.push(5));
|
||||
|
||||
// Queue full.
|
||||
CHECK(!queue.push(6));
|
||||
|
||||
queue.pop();
|
||||
// Queue not full (buffer rollover)
|
||||
CHECK(queue.push(6));
|
||||
|
||||
int i;
|
||||
|
||||
CHECK(queue.pop(i));
|
||||
CHECK_EQUAL(3, i);
|
||||
CHECK_EQUAL(3U, queue.size());
|
||||
|
||||
CHECK(queue.pop(i));
|
||||
CHECK_EQUAL(4, i);
|
||||
CHECK_EQUAL(2U, queue.size());
|
||||
|
||||
CHECK(queue.pop(i));
|
||||
CHECK_EQUAL(5, i);
|
||||
CHECK_EQUAL(1U, queue.size());
|
||||
|
||||
CHECK(queue.pop(i));
|
||||
CHECK_EQUAL(6, i);
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
|
||||
CHECK(!queue.pop(i));
|
||||
CHECK(!queue.pop(i));
|
||||
}
|
||||
|
||||
#if !defined(ETL_FORCE_TEST_CPP03_IMPLEMENTATION)
|
||||
//*************************************************************************
|
||||
TEST(test_move_push_pop)
|
||||
{
|
||||
etl::queue_spsc_atomic<ItemM, 4, etl::memory_model::MEMORY_MODEL_SMALL> queue;
|
||||
|
||||
ItemM p1(1);
|
||||
ItemM p2(2);
|
||||
ItemM p3(3);
|
||||
ItemM p4(4);
|
||||
|
||||
queue.push(std::move(p1));
|
||||
queue.push(std::move(p2));
|
||||
queue.push(std::move(p3));
|
||||
queue.push(std::move(p4));
|
||||
|
||||
CHECK(!bool(p1));
|
||||
CHECK(!bool(p2));
|
||||
CHECK(!bool(p3));
|
||||
CHECK(!bool(p4));
|
||||
|
||||
ItemM pr(0);
|
||||
|
||||
queue.pop(pr);
|
||||
CHECK_EQUAL(1, pr.value);
|
||||
|
||||
queue.pop(pr);
|
||||
CHECK_EQUAL(2, pr.value);
|
||||
|
||||
queue.pop(pr);
|
||||
CHECK_EQUAL(3, pr.value);
|
||||
|
||||
queue.pop(pr);
|
||||
CHECK_EQUAL(4, pr.value);
|
||||
}
|
||||
#endif
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_size_push_pop_iqueue)
|
||||
{
|
||||
etl::queue_spsc_atomic<int, 4> queue;
|
||||
|
||||
etl::iqueue_spsc_atomic<int>& iqueue = queue;
|
||||
|
||||
CHECK_EQUAL(0U, iqueue.size());
|
||||
|
||||
iqueue.push(1);
|
||||
CHECK_EQUAL(1U, iqueue.size());
|
||||
|
||||
iqueue.push(2);
|
||||
CHECK_EQUAL(2U, iqueue.size());
|
||||
|
||||
iqueue.push(3);
|
||||
CHECK_EQUAL(3U, iqueue.size());
|
||||
|
||||
iqueue.push(4);
|
||||
CHECK_EQUAL(4U, iqueue.size());
|
||||
|
||||
CHECK(!iqueue.push(5));
|
||||
CHECK(!iqueue.push(5));
|
||||
|
||||
int i;
|
||||
|
||||
CHECK(iqueue.pop(i));
|
||||
CHECK_EQUAL(1, i);
|
||||
CHECK_EQUAL(3U, iqueue.size());
|
||||
|
||||
CHECK(iqueue.pop(i));
|
||||
CHECK_EQUAL(2, i);
|
||||
CHECK_EQUAL(2U, iqueue.size());
|
||||
|
||||
CHECK(iqueue.pop(i));
|
||||
CHECK_EQUAL(3, i);
|
||||
CHECK_EQUAL(1U, iqueue.size());
|
||||
|
||||
CHECK(iqueue.pop(i));
|
||||
CHECK_EQUAL(4, i);
|
||||
CHECK_EQUAL(0U, iqueue.size());
|
||||
|
||||
CHECK(!iqueue.pop(i));
|
||||
CHECK(!iqueue.pop(i));
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_size_push_pop_void)
|
||||
{
|
||||
etl::queue_spsc_atomic<int, 4> queue;
|
||||
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
|
||||
queue.push(1);
|
||||
CHECK_EQUAL(1U, queue.size());
|
||||
|
||||
queue.push(2);
|
||||
CHECK_EQUAL(2U, queue.size());
|
||||
|
||||
queue.push(3);
|
||||
CHECK_EQUAL(3U, queue.size());
|
||||
|
||||
queue.push(4);
|
||||
CHECK_EQUAL(4U, queue.size());
|
||||
|
||||
CHECK(!queue.push(5));
|
||||
CHECK(!queue.push(5));
|
||||
|
||||
CHECK(queue.pop());
|
||||
CHECK_EQUAL(3U, queue.size());
|
||||
|
||||
CHECK(queue.pop());
|
||||
CHECK_EQUAL(2U, queue.size());
|
||||
|
||||
CHECK(queue.pop());
|
||||
CHECK_EQUAL(1U, queue.size());
|
||||
|
||||
CHECK(queue.pop());
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
|
||||
CHECK(!queue.pop());
|
||||
CHECK(!queue.pop());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_size_push_front_pop)
|
||||
{
|
||||
etl::queue_spsc_atomic<int, 4> queue;
|
||||
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
|
||||
queue.push(1);
|
||||
queue.push(2);
|
||||
queue.push(3);
|
||||
queue.push(4);
|
||||
CHECK_EQUAL(4U, queue.size());
|
||||
|
||||
CHECK_EQUAL(1, queue.front());
|
||||
CHECK_EQUAL(4U, queue.size());
|
||||
|
||||
CHECK_EQUAL(1, queue.front());
|
||||
CHECK_EQUAL(4U, queue.size());
|
||||
|
||||
CHECK(queue.pop());
|
||||
CHECK_EQUAL(3U, queue.size());
|
||||
|
||||
CHECK(queue.pop());
|
||||
CHECK_EQUAL(2U, queue.size());
|
||||
|
||||
CHECK(queue.pop());
|
||||
CHECK_EQUAL(1U, queue.size());
|
||||
|
||||
CHECK_EQUAL(4, queue.front());
|
||||
CHECK_EQUAL(1U, queue.size());
|
||||
|
||||
CHECK_EQUAL(4, queue.front());
|
||||
CHECK_EQUAL(1U, queue.size());
|
||||
|
||||
CHECK(queue.pop());
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_multiple_emplace)
|
||||
{
|
||||
etl::queue_spsc_atomic<Data, 5> queue;
|
||||
|
||||
queue.emplace();
|
||||
queue.emplace(1);
|
||||
queue.emplace(1, 2);
|
||||
queue.emplace(1, 2, 3);
|
||||
queue.emplace(1, 2, 3, 4);
|
||||
|
||||
CHECK_EQUAL(5U, queue.size());
|
||||
|
||||
Data popped;
|
||||
|
||||
queue.pop(popped);
|
||||
CHECK(popped == Data(0, 0, 0, 0));
|
||||
queue.pop(popped);
|
||||
CHECK(popped == Data(1, 2, 3, 4));
|
||||
queue.pop(popped);
|
||||
CHECK(popped == Data(1, 2, 3, 4));
|
||||
queue.pop(popped);
|
||||
CHECK(popped == Data(1, 2, 3, 4));
|
||||
queue.pop(popped);
|
||||
CHECK(popped == Data(1, 2, 3, 4));
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_clear)
|
||||
{
|
||||
etl::queue_spsc_atomic<int, 4> queue;
|
||||
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
|
||||
queue.push(1);
|
||||
queue.push(2);
|
||||
queue.clear();
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
|
||||
// Do it again to check that clear() didn't screw up the internals.
|
||||
queue.push(1);
|
||||
queue.push(2);
|
||||
CHECK_EQUAL(2U, queue.size());
|
||||
queue.clear();
|
||||
CHECK_EQUAL(0U, queue.size());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_empty)
|
||||
{
|
||||
etl::queue_spsc_atomic<int, 4> queue;
|
||||
CHECK(queue.empty());
|
||||
|
||||
queue.push(1);
|
||||
CHECK(!queue.empty());
|
||||
|
||||
queue.clear();
|
||||
CHECK(queue.empty());
|
||||
|
||||
queue.push(1);
|
||||
CHECK(!queue.empty());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
TEST(test_full)
|
||||
{
|
||||
etl::queue_spsc_atomic<int, 4> queue;
|
||||
CHECK(!queue.full());
|
||||
|
||||
queue.push(1);
|
||||
queue.push(2);
|
||||
queue.push(3);
|
||||
queue.push(4);
|
||||
CHECK(queue.full());
|
||||
|
||||
queue.clear();
|
||||
CHECK(!queue.full());
|
||||
|
||||
queue.push(1);
|
||||
queue.push(2);
|
||||
queue.push(3);
|
||||
queue.push(4);
|
||||
CHECK(queue.full());
|
||||
}
|
||||
|
||||
//*************************************************************************
|
||||
#if REALTIME_TEST && defined(ETL_COMPILER_MICROSOFT)
|
||||
#if defined(ETL_TARGET_OS_WINDOWS) // Only Windows priority is currently supported
|
||||
#define FIX_PROCESSOR_AFFINITY1 SetThreadAffinityMask(GetCurrentThread(), 1);
|
||||
#define FIX_PROCESSOR_AFFINITY2 SetThreadAffinityMask(GetCurrentThread(), 2);
|
||||
#else
|
||||
#error No thread priority modifier defined
|
||||
#endif
|
||||
|
||||
size_t ticks = 0UL;
|
||||
|
||||
etl::queue_spsc_atomic<int, 10> queue;
|
||||
|
||||
const size_t LENGTH = 1000000UL;
|
||||
|
||||
void timer_event()
|
||||
{
|
||||
FIX_PROCESSOR_AFFINITY1;
|
||||
|
||||
const size_t TICK = 1UL;
|
||||
size_t tick = TICK;
|
||||
ticks = 1;
|
||||
|
||||
while (ticks <= LENGTH)
|
||||
{
|
||||
if (queue.push(ticks))
|
||||
{
|
||||
++ticks;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
TEST(queue_threads)
|
||||
{
|
||||
FIX_PROCESSOR_AFFINITY2;
|
||||
|
||||
std::vector<int> tick_list;
|
||||
tick_list.reserve(LENGTH);
|
||||
|
||||
std::thread t1(timer_event);
|
||||
|
||||
while (tick_list.size() < LENGTH)
|
||||
{
|
||||
int i;
|
||||
|
||||
if (queue.pop(i))
|
||||
{
|
||||
tick_list.push_back(i);
|
||||
}
|
||||
}
|
||||
|
||||
// Join the thread with the main thread
|
||||
t1.join();
|
||||
|
||||
CHECK_EQUAL(LENGTH, tick_list.size());
|
||||
|
||||
for (size_t i = 0UL; i < LENGTH; ++i)
|
||||
{
|
||||
CHECK_EQUAL(i + 1, tick_list[i]);
|
||||
}
|
||||
}
|
||||
#endif
|
||||
};
|
||||
}
|
||||
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue