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
|
/*
* Copyright (C) 2001-2012 Jacek Sieka, arnetheduck on gmail point com
* Copyright (C) 2009-2020 EiskaltDC++ developers
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#pragma once
#include <mutex>
#if !defined(__APPLE__) && !defined(__MACH__)
namespace dcpp {
typedef std::recursive_mutex CriticalSection;
typedef std::mutex FastCriticalSection;
typedef std::unique_lock<std::recursive_mutex> Lock;
typedef std::lock_guard<std::mutex> FastLock;
} // namespace dcpp
#else // !defined(__APPLE__) && !defined(__MACH__)
namespace dcpp {
class CriticalSection
{
public:
CriticalSection() noexcept {
pthread_mutexattr_init(&ma);
pthread_mutexattr_settype(&ma, PTHREAD_MUTEX_RECURSIVE);
pthread_mutex_init(&mtx, &ma);
}
~CriticalSection() noexcept {
pthread_mutex_destroy(&mtx);
pthread_mutexattr_destroy(&ma);
}
void lock() noexcept { pthread_mutex_lock(&mtx); }
void unlock() noexcept { pthread_mutex_unlock(&mtx); }
pthread_mutex_t& getMutex() { return mtx; }
private:
CriticalSection(const CriticalSection&);
CriticalSection& operator=(const CriticalSection&);
pthread_mutex_t mtx;
pthread_mutexattr_t ma;
};
// A fast, non-recursive and unfair implementation of the Critical Section.
// It is meant to be used in situations where the risk for lock conflict is very low,
// i.e. locks that are held for a very short time. The lock is _not_ recursive, i e if
// the same thread will try to grab the lock it'll hang in a never-ending loop. The lock
// is not fair, i e the first to try to lock a locked lock is not guaranteed to be the
// first to get it when it's freed...
class FastCriticalSection {
public:
void lock() { mtx.lock(); }
void unlock() { mtx.unlock(); }
private:
typedef std::mutex mutex_t;
mutex_t mtx;
};
template<class T>
class LockBase {
public:
LockBase(T& aCs) noexcept : cs(aCs) { cs.lock(); }
~LockBase() noexcept { cs.unlock(); }
private:
LockBase& operator=(const LockBase&);
T& cs;
};
typedef LockBase<CriticalSection> Lock;
typedef LockBase<FastCriticalSection> FastLock;
}
#endif // !defined(__APPLE__) && !defined(__MACH__)
|
