Merge #10471: Denote functions CNode::GetRecvVersion() and CNode::GetRefCount() ...
[bitcoinplatinum.git] / src / sync.h
blob9274f50d8b46928c879600e12d432c5624cd40bc
1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2016 The Bitcoin Core developers
3 // Distributed under the MIT software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
6 #ifndef BITCOIN_SYNC_H
7 #define BITCOIN_SYNC_H
9 #include "threadsafety.h"
11 #include <boost/thread/condition_variable.hpp>
12 #include <boost/thread/locks.hpp>
13 #include <boost/thread/mutex.hpp>
14 #include <boost/thread/recursive_mutex.hpp>
17 ////////////////////////////////////////////////
18 // //
19 // THE SIMPLE DEFINITION, EXCLUDING DEBUG CODE //
20 // //
21 ////////////////////////////////////////////////
24 CCriticalSection mutex;
25 boost::recursive_mutex mutex;
27 LOCK(mutex);
28 boost::unique_lock<boost::recursive_mutex> criticalblock(mutex);
30 LOCK2(mutex1, mutex2);
31 boost::unique_lock<boost::recursive_mutex> criticalblock1(mutex1);
32 boost::unique_lock<boost::recursive_mutex> criticalblock2(mutex2);
34 TRY_LOCK(mutex, name);
35 boost::unique_lock<boost::recursive_mutex> name(mutex, boost::try_to_lock_t);
37 ENTER_CRITICAL_SECTION(mutex); // no RAII
38 mutex.lock();
40 LEAVE_CRITICAL_SECTION(mutex); // no RAII
41 mutex.unlock();
44 ///////////////////////////////
45 // //
46 // THE ACTUAL IMPLEMENTATION //
47 // //
48 ///////////////////////////////
50 /**
51 * Template mixin that adds -Wthread-safety locking
52 * annotations to a subset of the mutex API.
54 template <typename PARENT>
55 class LOCKABLE AnnotatedMixin : public PARENT
57 public:
58 void lock() EXCLUSIVE_LOCK_FUNCTION()
60 PARENT::lock();
63 void unlock() UNLOCK_FUNCTION()
65 PARENT::unlock();
68 bool try_lock() EXCLUSIVE_TRYLOCK_FUNCTION(true)
70 return PARENT::try_lock();
74 #ifdef DEBUG_LOCKORDER
75 void EnterCritical(const char* pszName, const char* pszFile, int nLine, void* cs, bool fTry = false);
76 void LeaveCritical();
77 std::string LocksHeld();
78 void AssertLockHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs);
79 void DeleteLock(void* cs);
80 #else
81 void static inline EnterCritical(const char* pszName, const char* pszFile, int nLine, void* cs, bool fTry = false) {}
82 void static inline LeaveCritical() {}
83 void static inline AssertLockHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs) {}
84 void static inline DeleteLock(void* cs) {}
85 #endif
86 #define AssertLockHeld(cs) AssertLockHeldInternal(#cs, __FILE__, __LINE__, &cs)
88 /**
89 * Wrapped boost mutex: supports recursive locking, but no waiting
90 * TODO: We should move away from using the recursive lock by default.
92 class CCriticalSection : public AnnotatedMixin<boost::recursive_mutex>
94 public:
95 ~CCriticalSection() {
96 DeleteLock((void*)this);
100 /** Wrapped boost mutex: supports waiting but not recursive locking */
101 typedef AnnotatedMixin<boost::mutex> CWaitableCriticalSection;
103 /** Just a typedef for boost::condition_variable, can be wrapped later if desired */
104 typedef boost::condition_variable CConditionVariable;
106 #ifdef DEBUG_LOCKCONTENTION
107 void PrintLockContention(const char* pszName, const char* pszFile, int nLine);
108 #endif
110 /** Wrapper around boost::unique_lock<Mutex> */
111 template <typename Mutex>
112 class SCOPED_LOCKABLE CMutexLock
114 private:
115 boost::unique_lock<Mutex> lock;
117 void Enter(const char* pszName, const char* pszFile, int nLine)
119 EnterCritical(pszName, pszFile, nLine, (void*)(lock.mutex()));
120 #ifdef DEBUG_LOCKCONTENTION
121 if (!lock.try_lock()) {
122 PrintLockContention(pszName, pszFile, nLine);
123 #endif
124 lock.lock();
125 #ifdef DEBUG_LOCKCONTENTION
127 #endif
130 bool TryEnter(const char* pszName, const char* pszFile, int nLine)
132 EnterCritical(pszName, pszFile, nLine, (void*)(lock.mutex()), true);
133 lock.try_lock();
134 if (!lock.owns_lock())
135 LeaveCritical();
136 return lock.owns_lock();
139 public:
140 CMutexLock(Mutex& mutexIn, const char* pszName, const char* pszFile, int nLine, bool fTry = false) EXCLUSIVE_LOCK_FUNCTION(mutexIn) : lock(mutexIn, boost::defer_lock)
142 if (fTry)
143 TryEnter(pszName, pszFile, nLine);
144 else
145 Enter(pszName, pszFile, nLine);
148 CMutexLock(Mutex* pmutexIn, const char* pszName, const char* pszFile, int nLine, bool fTry = false) EXCLUSIVE_LOCK_FUNCTION(pmutexIn)
150 if (!pmutexIn) return;
152 lock = boost::unique_lock<Mutex>(*pmutexIn, boost::defer_lock);
153 if (fTry)
154 TryEnter(pszName, pszFile, nLine);
155 else
156 Enter(pszName, pszFile, nLine);
159 ~CMutexLock() UNLOCK_FUNCTION()
161 if (lock.owns_lock())
162 LeaveCritical();
165 operator bool()
167 return lock.owns_lock();
171 typedef CMutexLock<CCriticalSection> CCriticalBlock;
173 #define PASTE(x, y) x ## y
174 #define PASTE2(x, y) PASTE(x, y)
176 #define LOCK(cs) CCriticalBlock PASTE2(criticalblock, __COUNTER__)(cs, #cs, __FILE__, __LINE__)
177 #define LOCK2(cs1, cs2) CCriticalBlock criticalblock1(cs1, #cs1, __FILE__, __LINE__), criticalblock2(cs2, #cs2, __FILE__, __LINE__)
178 #define TRY_LOCK(cs, name) CCriticalBlock name(cs, #cs, __FILE__, __LINE__, true)
180 #define ENTER_CRITICAL_SECTION(cs) \
182 EnterCritical(#cs, __FILE__, __LINE__, (void*)(&cs)); \
183 (cs).lock(); \
186 #define LEAVE_CRITICAL_SECTION(cs) \
188 (cs).unlock(); \
189 LeaveCritical(); \
192 class CSemaphore
194 private:
195 boost::condition_variable condition;
196 boost::mutex mutex;
197 int value;
199 public:
200 CSemaphore(int init) : value(init) {}
202 void wait()
204 boost::unique_lock<boost::mutex> lock(mutex);
205 while (value < 1) {
206 condition.wait(lock);
208 value--;
211 bool try_wait()
213 boost::unique_lock<boost::mutex> lock(mutex);
214 if (value < 1)
215 return false;
216 value--;
217 return true;
220 void post()
223 boost::unique_lock<boost::mutex> lock(mutex);
224 value++;
226 condition.notify_one();
230 /** RAII-style semaphore lock */
231 class CSemaphoreGrant
233 private:
234 CSemaphore* sem;
235 bool fHaveGrant;
237 public:
238 void Acquire()
240 if (fHaveGrant)
241 return;
242 sem->wait();
243 fHaveGrant = true;
246 void Release()
248 if (!fHaveGrant)
249 return;
250 sem->post();
251 fHaveGrant = false;
254 bool TryAcquire()
256 if (!fHaveGrant && sem->try_wait())
257 fHaveGrant = true;
258 return fHaveGrant;
261 void MoveTo(CSemaphoreGrant& grant)
263 grant.Release();
264 grant.sem = sem;
265 grant.fHaveGrant = fHaveGrant;
266 fHaveGrant = false;
269 CSemaphoreGrant() : sem(NULL), fHaveGrant(false) {}
271 CSemaphoreGrant(CSemaphore& sema, bool fTry = false) : sem(&sema), fHaveGrant(false)
273 if (fTry)
274 TryAcquire();
275 else
276 Acquire();
279 ~CSemaphoreGrant()
281 Release();
284 operator bool()
286 return fHaveGrant;
290 #endif // BITCOIN_SYNC_H