123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139 |
- // Copyright Oliver Kowalke 2013.
- // 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)
- //
- // This test is based on the tests of Boost.Thread
- #include <cstdlib>
- #include <iostream>
- #include <map>
- #include <stdexcept>
- #include <vector>
- #include <boost/chrono.hpp>
- #include <boost/test/unit_test.hpp>
- #include <boost/thread/barrier.hpp>
- #include <boost/thread/thread.hpp>
- #include <boost/fiber/all.hpp>
- typedef boost::chrono::nanoseconds ns;
- typedef boost::chrono::milliseconds ms;
- int value1 = 0;
- int value2 = 0;
- template< typename Mtx >
- void g( boost::barrier & b, Mtx & m) {
- b.wait();
- m.lock();
- value1 = 3;
- m.unlock();
- }
- template< typename Mtx >
- void f( boost::barrier & b, Mtx & m) {
- b.wait();
- m.lock();
- value2 = 7;
- m.unlock();
- }
- template< typename Mtx >
- void fn1( boost::barrier & b, Mtx & m) {
- boost::fibers::fiber( boost::fibers::launch::dispatch, g< Mtx >, std::ref( b), std::ref( m) ).join();
- }
- template< typename Mtx >
- void fn2( boost::barrier & b, Mtx & m) {
- boost::fibers::fiber( boost::fibers::launch::dispatch, f< Mtx >, std::ref( b), std::ref( m) ).join();
- }
- void test_mutex() {
- for ( int i = 0; i < 10; ++i) {
- boost::fibers::mutex mtx;
- mtx.lock();
- boost::barrier b( 3);
- boost::thread t1( fn1< boost::fibers::mutex >, std::ref( b), std::ref( mtx) );
- boost::thread t2( fn2< boost::fibers::mutex >, std::ref( b), std::ref( mtx) );
- b.wait();
- boost::this_thread::sleep_for( ms( 250) );
- mtx.unlock();
- t1.join();
- t2.join();
- BOOST_CHECK( 3 == value1);
- BOOST_CHECK( 7 == value2);
- }
- }
- void test_recursive_mutex() {
- for ( int i = 0; i < 10; ++i) {
- boost::fibers::recursive_mutex mtx;
- mtx.lock();
- boost::barrier b( 3);
- boost::thread t1( fn1< boost::fibers::recursive_mutex >, std::ref( b), std::ref( mtx) );
- boost::thread t2( fn2< boost::fibers::recursive_mutex >, std::ref( b), std::ref( mtx) );
- b.wait();
- boost::this_thread::sleep_for( ms( 250) );
- mtx.unlock();
- t1.join();
- t2.join();
- BOOST_CHECK( 3 == value1);
- BOOST_CHECK( 7 == value2);
- }
- }
- void test_timed_mutex() {
- for ( int i = 0; i < 10; ++i) {
- boost::fibers::timed_mutex mtx;
- mtx.lock();
- boost::barrier b( 3);
- boost::thread t1( fn1< boost::fibers::timed_mutex >, std::ref( b), std::ref( mtx) );
- boost::thread t2( fn2< boost::fibers::timed_mutex >, std::ref( b), std::ref( mtx) );
- b.wait();
- boost::this_thread::sleep_for( ms( 250) );
- mtx.unlock();
- t1.join();
- t2.join();
- BOOST_CHECK( 3 == value1);
- BOOST_CHECK( 7 == value2);
- }
- }
- void test_recursive_timed_mutex() {
- for ( int i = 0; i < 10; ++i) {
- boost::fibers::recursive_timed_mutex mtx;
- mtx.lock();
- boost::barrier b( 3);
- boost::thread t1( fn1< boost::fibers::recursive_timed_mutex >, std::ref( b), std::ref( mtx) );
- boost::thread t2( fn2< boost::fibers::recursive_timed_mutex >, std::ref( b), std::ref( mtx) );
- b.wait();
- boost::this_thread::sleep_for( ms( 250) );
- mtx.unlock();
- t1.join();
- t2.join();
- BOOST_CHECK( 3 == value1);
- BOOST_CHECK( 7 == value2);
- }
- }
- void test_dummy() {
- }
- boost::unit_test::test_suite * init_unit_test_suite( int, char* []) {
- boost::unit_test::test_suite * test =
- BOOST_TEST_SUITE("Boost.Fiber: multithreaded mutex test suite");
- #if ! defined(BOOST_FIBERS_NO_ATOMICS)
- test->add( BOOST_TEST_CASE( & test_mutex) );
- test->add( BOOST_TEST_CASE( & test_recursive_mutex) );
- test->add( BOOST_TEST_CASE( & test_timed_mutex) );
- test->add( BOOST_TEST_CASE( & test_recursive_timed_mutex) );
- #else
- test->add( BOOST_TEST_CASE( & test_dummy) );
- #endif
- return test;
- }
|