boost_unordered 0.1.0

Boost C++ library boost_unordered packaged using Zanbil
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

// 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 m, int n )
{
    std::printf( "Thread %d of %d started.\n", k, m );

    for( int i = 0; i < n; ++i )
    {
        int oldc;

        for( ;; )
        {
            {
                boost::compat::shared_lock<rw_spinlock> lock( sp );
                oldc = count;
            }

            if( oldc % m == k ) break;
        }

        {
            std::lock_guard<rw_spinlock> lock( sp );
            if( count == oldc ) ++count;
        }
    }

    std::printf( "Thread %d of %d finished.\n", k, m );
}

int main()
{
    int const N = 100;    // total iterations
    int const M = 4;      // threads

    std::thread th[ M ];

    for( int i = 0; i < M; ++i )
    {
        th[ i ] = std::thread( f, i, M, N );
    }

    for( int i = 0; i < M; ++i )
    {
        th[ i ].join();
    }

    BOOST_TEST_EQ( count, N * M );

    return boost::report_errors();
}