blob: b561ccce003438a4dcf01be7d059f36496a13ac5 (
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
|
// vars.cpp
/**
* Copyright (C) 2008 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,b
* 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 "mutex.h"
#include "value.h"
namespace mongo {
// intentional leak. otherwise destructor orders can be problematic at termination.
MutexDebugger &mutexDebugger = *(new MutexDebugger());
MutexDebugger::MutexDebugger() :
x( *(new boost::mutex()) ), magic(0x12345678) {
// optional way to debug lock order
/*
a = "a_lock";
b = "b_lock";
*/
}
void MutexDebugger::programEnding() {
if( logLevel>=1 && followers.size() ) {
std::cout << followers.size() << " mutexes in program" << endl;
for( map< mid, set<mid> >::iterator i = followers.begin(); i != followers.end(); i++ ) {
cout << i->first;
if( maxNest[i->first] > 1 )
cout << " maxNest:" << maxNest[i->first];
cout << '\n';
for( set<mid>::iterator j = i->second.begin(); j != i->second.end(); j++ )
cout << " " << *j << '\n';
}
cout.flush();
}
}
}
|
