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
|
/* This file is part of the Spring engine (GPL v2 or later), see LICENSE.html */
#ifndef SYNCHRO_H
#define SYNCHRO_H
#include "Rendering/GL/myGL.h"
#include <boost/version.hpp>
#include <boost/thread/recursive_mutex.hpp>
namespace Threading {
typedef boost::recursive_mutex RecursiveMutex;
class RecursiveScopedLock {
char sl_lock[sizeof(boost::recursive_mutex::scoped_lock)];
#if GML_DEBUG_MUTEX
boost::recursive_mutex* m1;
#endif
public:
RecursiveScopedLock(boost::recursive_mutex& m, bool locked = true) {
// NOTE the "new (...) ..." syntax is called "placement new", and is
// described here: http://en.wikipedia.org/wiki/Placement_syntax
#if (BOOST_VERSION >= 103500)
if (locked) {
new (sl_lock) boost::recursive_mutex::scoped_lock(m);
} else {
new (sl_lock) boost::recursive_mutex::scoped_lock(m, boost::defer_lock);
}
#else
new (sl_lock) boost::recursive_mutex::scoped_lock(m, locked);
#endif
#if GML_DEBUG_MUTEX
if (locked) {
m1 = &m;
GML_STDMUTEX_LOCK(lm);
std::map<boost::recursive_mutex*, int>& lockmmap = lockmmaps[GML::ThreadNumber()];
std::map<boost::recursive_mutex*, int>::iterator locki = lockmmap.find(m1);
if (locki == lockmmap.end()) {
lockmmap[m1] = 1;
} else {
lockmmap[m1] = (*locki).second + 1;
}
} else {
m1 = NULL;
}
#endif
}
virtual ~RecursiveScopedLock() {
#if (BOOST_VERSION >= 103500)
((boost::recursive_mutex::scoped_lock*)sl_lock)->~unique_lock();
#else
((boost::recursive_mutex::scoped_lock*)sl_lock)->~scoped_lock();
#endif
#if GML_DEBUG_MUTEX
if (m1) {
GML_STDMUTEX_LOCK(lm);
std::map<boost::recursive_mutex*, int>& lockmmap = lockmmaps[GML::ThreadNumber()];
lockmmap[m1] = (*lockmmap.find(m1)).second - 1;
}
#endif
}
};
};
#endif // SYNCHRO_H
|
