summaryrefslogtreecommitdiff
path: root/indra/llcommon/llmutex.h
blob: 6e8cf9643bdda23ee2cfbb200b14a26ecb2a94e7 (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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
/**
 * @file llmutex.h
 * @brief Base classes for mutex and condition handling.
 *
 * $LicenseInfo:firstyear=2004&license=viewerlgpl$
 * Second Life Viewer Source Code
 * Copyright (C) 2012, Linden Research, Inc.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation;
 * version 2.1 of the License only.
 *
 * This library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 *
 * Linden Research, Inc., 945 Battery Street, San Francisco, CA  94111  USA
 * $/LicenseInfo$
 */

#ifndef LL_LLMUTEX_H
#define LL_LLMUTEX_H

#include "stdtypes.h"
#include "llthread.h"
#include <boost/noncopyable.hpp>

#include "mutex.h"
#include <shared_mutex>
#include <unordered_map>
#include <condition_variable>

//============================================================================

//#define MUTEX_DEBUG (LL_DEBUG || LL_RELEASE_WITH_DEBUG_INFO)
#define MUTEX_DEBUG 0 //disable mutex debugging as it's interfering with profiles

#if MUTEX_DEBUG
#include <map>
#endif

class LL_COMMON_API LLMutex
{
public:
    LLMutex();
    virtual ~LLMutex();

    void lock();        // blocks
    bool trylock();     // non-blocking, returns true if lock held.
    void unlock();      // undefined behavior when called on mutex not being held
    bool isLocked();    // non-blocking, but does do a lock/unlock so not free
    bool isSelfLocked(); //return true if locked in a same thread
    LLThread::id_t lockingThread() const; //get ID of locking thread

protected:
    std::mutex          mMutex;
    mutable U32         mCount;
    mutable LLThread::id_t  mLockingThread;

#if MUTEX_DEBUG
    std::unordered_map<LLThread::id_t, bool> mIsLocked;
#endif
};

//============================================================================

class LL_COMMON_API LLSharedMutex
{
public:
    LLSharedMutex();

    bool isLocked() const;
    bool isThreadLocked() const;
    bool isShared() const { return mIsShared; }

    void lockShared();
    void lockExclusive();
    template<bool SHARED> void lock();

    bool trylockShared();
    bool trylockExclusive();
    template<bool SHARED> bool trylock();

    void unlockShared();
    void unlockExclusive();
    template<bool SHARED> void unlock();

private:
    std::shared_mutex mSharedMutex;
    mutable std::mutex mLockMutex;
    std::unordered_map<LLThread::id_t, U32> mLockingThreads;
    bool mIsShared;

    using iterator = std::unordered_map<LLThread::id_t, U32>::iterator;
    using const_iterator = std::unordered_map<LLThread::id_t, U32>::const_iterator;
};

template<>
inline void LLSharedMutex::lock<true>()
{
    lockShared();
}

template<>
inline void LLSharedMutex::lock<false>()
{
    lockExclusive();
}

template<>
inline bool LLSharedMutex::trylock<true>()
{
    return trylockShared();
}

template<>
inline bool LLSharedMutex::trylock<false>()
{
    return trylockExclusive();
}

template<>
inline void LLSharedMutex::unlock<true>()
{
    unlockShared();
}

template<>
inline void LLSharedMutex::unlock<false>()
{
    unlockExclusive();
}

// Actually a condition/mutex pair (since each condition needs to be associated with a mutex).
class LL_COMMON_API LLCondition : public LLMutex
{
public:
    LLCondition();
    ~LLCondition();

    void wait();        // blocks
    void signal();
    void broadcast();

protected:
    std::condition_variable mCond;
};

//============================================================================

class LLMutexLock
{
public:
    LLMutexLock(LLMutex* mutex)
    {
        mMutex = mutex;

        if (mMutex)
            mMutex->lock();
    }

    ~LLMutexLock()
    {
        if (mMutex)
            mMutex->unlock();
    }

private:
    LLMutex* mMutex;
};

//============================================================================

template<bool SHARED>
class LLSharedMutexLockTemplate
{
public:
    LLSharedMutexLockTemplate(LLSharedMutex* mutex)
    : mSharedMutex(mutex)
    {
        if (mSharedMutex)
            mSharedMutex->lock<SHARED>();
    }

    ~LLSharedMutexLockTemplate()
    {
        if (mSharedMutex)
            mSharedMutex->unlock<SHARED>();
    }

private:
    LLSharedMutex* mSharedMutex;
};

using LLSharedMutexLock = LLSharedMutexLockTemplate<true>;
using LLExclusiveMutexLock = LLSharedMutexLockTemplate<false>;

//============================================================================

// Scoped locking class similar in function to LLMutexLock but uses
// the trylock() method to conditionally acquire lock without
// blocking.  Caller resolves the resulting condition by calling
// the isLocked() method and either punts or continues as indicated.
//
// Mostly of interest to callers needing to avoid stalls who can
// guarantee another attempt at a later time.

class LLMutexTrylock
{
public:
    LLMutexTrylock(LLMutex* mutex);
    LLMutexTrylock(LLMutex* mutex, U32 aTries, U32 delay_ms = 10);
    ~LLMutexTrylock();

    bool isLocked() const
    {
        return mLocked;
    }

private:
    LLMutex*    mMutex;
    bool        mLocked;
};

//============================================================================

/**
* @class LLScopedLock
* @brief Small class to help lock and unlock mutexes.
*
* The constructor handles the lock, and the destructor handles
* the unlock. Instances of this class are <b>not</b> thread safe.
*/
class LL_COMMON_API LLScopedLock : private boost::noncopyable
{
public:
    /**
    * @brief Constructor which accepts a mutex, and locks it.
    *
    * @param mutex An allocated mutex. If you pass in NULL,
    * this wrapper will not lock.
    */
    LLScopedLock(std::mutex* mutex);

    /**
    * @brief Destructor which unlocks the mutex if still locked.
    */
    ~LLScopedLock();

    /**
    * @brief Check lock.
    */
    bool isLocked() const { return mLocked; }

    /**
    * @brief This method unlocks the mutex.
    */
    void unlock();

protected:
    bool mLocked;
    std::mutex* mMutex;
};

#endif // LL_LLMUTEX_H