mirror of
https://github.com/boostorg/unordered.git
synced 2025-05-10 07:34:00 +00:00
63 lines
1.2 KiB
C++
63 lines
1.2 KiB
C++
// Copyright 2023 Peter Dimov
|
|
// Distributed under the Boost Software License, Version 1.0.
|
|
// https://www.boost.org/LICENSE_1_0.txt
|
|
|
|
#include <boost/unordered/detail/foa/rw_spinlock.hpp>
|
|
#include <boost/compat/shared_lock.hpp>
|
|
#include <boost/core/lightweight_test.hpp>
|
|
#include <mutex>
|
|
#include <thread>
|
|
#include <cstdio>
|
|
|
|
using boost::unordered::detail::foa::rw_spinlock;
|
|
|
|
static int count = 0;
|
|
static rw_spinlock sp;
|
|
|
|
void f( int k, int n )
|
|
{
|
|
std::printf( "Thread %d started.\n", k );
|
|
|
|
int i = 0;
|
|
|
|
for( ;; ++i )
|
|
{
|
|
int oldc;
|
|
|
|
{
|
|
boost::compat::shared_lock<rw_spinlock> lock( sp );
|
|
if( count >= n ) break;
|
|
oldc = count;
|
|
}
|
|
|
|
{
|
|
std::lock_guard<rw_spinlock> lock( sp );
|
|
if( count == oldc ) ++count;
|
|
}
|
|
}
|
|
|
|
std::printf( "Thread %d finished (%i iterations).\n", k, i );
|
|
}
|
|
|
|
int main()
|
|
{
|
|
int const N = 1000000; // total iterations
|
|
int const M = 8; // threads
|
|
|
|
std::thread th[ M ];
|
|
|
|
for( int i = 0; i < M; ++i )
|
|
{
|
|
th[ i ] = std::thread( f, i, N );
|
|
}
|
|
|
|
for( int i = 0; i < M; ++i )
|
|
{
|
|
th[ i ].join();
|
|
}
|
|
|
|
BOOST_TEST_EQ( count, N );
|
|
|
|
return boost::report_errors();
|
|
}
|