summaryrefslogtreecommitdiff
path: root/dbtests/spin_lock_test.cpp
blob: 01eb7b371212ab839ecd079625d77bebc738a394 (plain)
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
// spin_lock_test.cpp : spin_lcok.{h, cpp} unit test

/**
 *    Copyright (C) 2010 10gen Inc.
 *
 *    This program is free software: you can redistribute it and/or  modify
 *    it under the terms of the GNU Affero General Public License, version 3,
 *    as published by the Free Software Foundation.
 *
 *    This program is distributed in the hope that it will be useful,
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *    GNU Affero General Public License for more details.
 *
 *    You should have received a copy of the GNU Affero General Public License
 *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#include "../pch.h"
#include <boost/thread/thread.hpp>

#include "dbtests.h"
#include "../util/concurrency/spin_lock.h"

namespace {

    using mongo::SpinLock;

    class LockTester {
    public:
        LockTester( SpinLock* spin, int* counter )
            : _spin(spin), _counter(counter), _requests(0) {}

        ~LockTester() {
            delete _t;
        }

        void start( int increments ) {
            _t = new boost::thread( boost::bind(&LockTester::test, this, increments) );
        }

        void join() {
            if ( _t ) _t->join();
        }

        int requests() const {
            return _requests;
        }

    private:
        SpinLock*      _spin;     // not owned here
        int*           _counter;  // not owned here
        int            _requests;
        boost::thread* _t;

        void test( int increments ) {
            while ( increments-- > 0 ) {
                _spin->lock();
                ++(*_counter);
                ++_requests;
                _spin->unlock();
            }
        }

        LockTester( LockTester& );
        LockTester& operator=( LockTester& );
    };

    class ConcurrentIncs {
    public:
        void run() {

#if defined(__GCC_HAVE_SYNC_COMPARE_AND_SWAP_4)

            SpinLock spin;
            int counter = 0;

            const int threads = 64;
            const int incs = 10000;
            LockTester* testers[threads];

            for ( int i = 0; i < threads; i++ ) {
                testers[i] = new LockTester( &spin, &counter );
            }
            for ( int i = 0; i < threads; i++ ) {
                testers[i]->start( incs );
            }
            for ( int i = 0; i < threads; i++ ) {
                testers[i]->join();
                ASSERT_EQUALS( testers[i]->requests(), incs );
                delete testers[i];
            }

            ASSERT_EQUALS( counter, threads*incs );
#else

            // WARNING "TODO Missing spin lock in this platform."
            ASSERT( true );


#endif

        }
    };

    class SpinLockSuite : public Suite {
    public:
        SpinLockSuite() : Suite( "spinlock" ) {}

        void setupTests() {
            add< ConcurrentIncs >();
        }
    } spinLockSuite;

}  // anonymous namespace