195 lines
3.5 KiB
C++
195 lines
3.5 KiB
C++
// Copyright (C) 2011 Tim Blechmann
|
|
//
|
|
// Distributed under the Boost Software License, Version 1.0. (See
|
|
// accompanying file LICENSE_1_0.txt or copy at
|
|
// http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#include <boost/lockfree/lockfree_forward.hpp>
|
|
|
|
#include <boost/lockfree/queue.hpp>
|
|
#include <boost/thread.hpp>
|
|
|
|
#define BOOST_TEST_MAIN
|
|
#ifdef BOOST_LOCKFREE_INCLUDE_TESTS
|
|
#include <boost/test/included/unit_test.hpp>
|
|
#else
|
|
#include <boost/test/unit_test.hpp>
|
|
#endif
|
|
|
|
#include <memory>
|
|
|
|
#include "test_helpers.hpp"
|
|
|
|
using namespace boost;
|
|
using namespace boost::lockfree;
|
|
using namespace std;
|
|
|
|
BOOST_AUTO_TEST_CASE( simple_queue_test )
|
|
{
|
|
queue<int> f(64);
|
|
|
|
BOOST_WARN(f.is_lock_free());
|
|
|
|
BOOST_REQUIRE(f.empty());
|
|
f.push(1);
|
|
f.push(2);
|
|
|
|
int i1(0), i2(0);
|
|
|
|
BOOST_REQUIRE(f.pop(i1));
|
|
BOOST_REQUIRE_EQUAL(i1, 1);
|
|
|
|
BOOST_REQUIRE(f.pop(i2));
|
|
BOOST_REQUIRE_EQUAL(i2, 2);
|
|
BOOST_REQUIRE(f.empty());
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE( simple_queue_test_capacity )
|
|
{
|
|
queue<int, capacity<64> > f;
|
|
|
|
BOOST_WARN(f.is_lock_free());
|
|
|
|
BOOST_REQUIRE(f.empty());
|
|
f.push(1);
|
|
f.push(2);
|
|
|
|
int i1(0), i2(0);
|
|
|
|
BOOST_REQUIRE(f.pop(i1));
|
|
BOOST_REQUIRE_EQUAL(i1, 1);
|
|
|
|
BOOST_REQUIRE(f.pop(i2));
|
|
BOOST_REQUIRE_EQUAL(i2, 2);
|
|
BOOST_REQUIRE(f.empty());
|
|
}
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE( unsafe_queue_test )
|
|
{
|
|
queue<int> f(64);
|
|
|
|
BOOST_WARN(f.is_lock_free());
|
|
BOOST_REQUIRE(f.empty());
|
|
|
|
int i1(0), i2(0);
|
|
|
|
f.unsynchronized_push(1);
|
|
f.unsynchronized_push(2);
|
|
|
|
BOOST_REQUIRE(f.unsynchronized_pop(i1));
|
|
BOOST_REQUIRE_EQUAL(i1, 1);
|
|
|
|
BOOST_REQUIRE(f.unsynchronized_pop(i2));
|
|
BOOST_REQUIRE_EQUAL(i2, 2);
|
|
BOOST_REQUIRE(f.empty());
|
|
}
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE( queue_consume_one_test )
|
|
{
|
|
queue<int> f(64);
|
|
|
|
BOOST_WARN(f.is_lock_free());
|
|
BOOST_REQUIRE(f.empty());
|
|
|
|
f.push(1);
|
|
f.push(2);
|
|
|
|
#ifdef BOOST_NO_CXX11_LAMBDAS
|
|
bool success1 = f.consume_one(test_equal(1));
|
|
bool success2 = f.consume_one(test_equal(2));
|
|
#else
|
|
bool success1 = f.consume_one([] (int i) {
|
|
BOOST_REQUIRE_EQUAL(i, 1);
|
|
});
|
|
|
|
bool success2 = f.consume_one([] (int i) {
|
|
BOOST_REQUIRE_EQUAL(i, 2);
|
|
});
|
|
#endif
|
|
|
|
BOOST_REQUIRE(success1);
|
|
BOOST_REQUIRE(success2);
|
|
|
|
BOOST_REQUIRE(f.empty());
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE( queue_consume_all_test )
|
|
{
|
|
queue<int> f(64);
|
|
|
|
BOOST_WARN(f.is_lock_free());
|
|
BOOST_REQUIRE(f.empty());
|
|
|
|
f.push(1);
|
|
f.push(2);
|
|
|
|
#ifdef BOOST_NO_CXX11_LAMBDAS
|
|
size_t consumed = f.consume_all(dummy_functor());
|
|
#else
|
|
size_t consumed = f.consume_all([] (int i) {
|
|
});
|
|
#endif
|
|
|
|
BOOST_REQUIRE_EQUAL(consumed, 2u);
|
|
|
|
BOOST_REQUIRE(f.empty());
|
|
}
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE( queue_convert_pop_test )
|
|
{
|
|
queue<int*> f(128);
|
|
BOOST_REQUIRE(f.empty());
|
|
f.push(new int(1));
|
|
f.push(new int(2));
|
|
f.push(new int(3));
|
|
f.push(new int(4));
|
|
|
|
{
|
|
int * i1;
|
|
|
|
BOOST_REQUIRE(f.pop(i1));
|
|
BOOST_REQUIRE_EQUAL(*i1, 1);
|
|
delete i1;
|
|
}
|
|
|
|
|
|
{
|
|
boost::shared_ptr<int> i2;
|
|
BOOST_REQUIRE(f.pop(i2));
|
|
BOOST_REQUIRE_EQUAL(*i2, 2);
|
|
}
|
|
|
|
{
|
|
#ifdef BOOST_NO_AUTO_PTR
|
|
unique_ptr<int> i3;
|
|
#else
|
|
auto_ptr<int> i3;
|
|
#endif
|
|
BOOST_REQUIRE(f.pop(i3));
|
|
|
|
BOOST_REQUIRE_EQUAL(*i3, 3);
|
|
}
|
|
|
|
{
|
|
boost::shared_ptr<int> i4;
|
|
BOOST_REQUIRE(f.pop(i4));
|
|
|
|
BOOST_REQUIRE_EQUAL(*i4, 4);
|
|
}
|
|
|
|
|
|
BOOST_REQUIRE(f.empty());
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE( reserve_test )
|
|
{
|
|
typedef boost::lockfree::queue< void* > memory_queue;
|
|
|
|
memory_queue ms(1);
|
|
ms.reserve(1);
|
|
ms.reserve_unsafe(1);
|
|
}
|