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
|
// top.h : DB usage monitor.
//
/**
* Copyright (C) 2009 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,
* 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 <boost/date_time/posix_time/posix_time.hpp>
namespace mongo {
// Records per namespace utilization of the mongod process.
// No two functions of this class may be called concurrently.
class Top {
public:
typedef boost::posix_time::ptime T;
typedef boost::posix_time::time_duration D;
static void clientStart( const char *client ) {
clientStop();
currentStart_ = currentTime();
current_ = client;
}
static void setRead() { read_ = true; }
static void setWrite() { write_ = true; }
static void clientStop() {
if ( currentStart_ == T() )
return;
D d = currentTime() - currentStart_;
recordUsage( current_, d );
currentStart_ = T();
read_ = false;
write_ = false;
}
struct Usage { string ns; D time; double pct; int reads; int writes; int calls; };
static void usage( vector< Usage > &res ) {
// Populate parent namespaces
UsageMap snapshot;
UsageMap totalUsage;
fillParentNamespaces( snapshot, snapshot_ );
fillParentNamespaces( totalUsage, totalUsage_ );
multimap< D, string, more > sorted;
for( UsageMap::iterator i = snapshot.begin(); i != snapshot.end(); ++i )
sorted.insert( make_pair( i->second.get<0>(), i->first ) );
for( multimap< D, string, more >::iterator i = sorted.begin(); i != sorted.end(); ++i ) {
if ( trivialNs( i->second.c_str() ) )
continue;
Usage u;
u.ns = i->second;
u.time = totalUsage[ u.ns ].get<0>();
u.pct = snapshotDuration_ != D() ? 100.0 * i->first.ticks() / snapshotDuration_.ticks() : 0;
u.reads = snapshot[ u.ns ].get<1>();
u.writes = snapshot[ u.ns ].get<2>();
u.calls = snapshot[ u.ns ].get<3>();
res.push_back( u );
}
for( UsageMap::iterator i = totalUsage.begin(); i != totalUsage.end(); ++i ) {
if ( snapshot.count( i->first ) != 0 || trivialNs( i->first.c_str() ) )
continue;
Usage u;
u.ns = i->first;
u.time = i->second.get<0>();
u.pct = 0;
u.reads = 0;
u.writes = 0;
u.calls = 0;
res.push_back( u );
}
}
static void completeSnapshot() {
if ( &snapshot_ == &snapshotA_ ) {
snapshot_ = snapshotB_;
nextSnapshot_ = snapshotA_;
} else {
snapshot_ = snapshotA_;
nextSnapshot_ = snapshotB_;
}
snapshotDuration_ = currentTime() - snapshotStart_;
snapshotStart_ = currentTime();
nextSnapshot_.clear();
}
private:
static bool trivialNs( const char *ns ) {
const char *ret = strrchr( ns, '.' );
return ret && ret[ 1 ] == '\0';
}
typedef map< string, boost::tuple< D, int, int, int > > UsageMap; // duration, # reads, # writes, # total calls
static T currentTime() {
return boost::posix_time::microsec_clock::universal_time();
}
static void recordUsage( const string &client, D duration ) {
recordUsageForMap( totalUsage_, client, duration );
recordUsageForMap( nextSnapshot_, client, duration );
}
static void recordUsageForMap( UsageMap &map, const string &client, D duration ) {
map[ client ].get< 0 >() += duration;
if ( read_ && !write_ )
map[ client ].get< 1 >()++;
else if ( !read_ && write_ )
map[ client ].get< 2 >()++;
map[ client ].get< 3 >()++;
}
static void fillParentNamespaces( UsageMap &to, const UsageMap &from ) {
for( UsageMap::const_iterator i = from.begin(); i != from.end(); ++i ) {
string current = i->first;
size_t dot = current.rfind( "." );
if ( dot == string::npos || dot != current_.length() - 1 ) {
inc( to[ current ], i->second );
}
while( dot != string::npos ) {
current = current.substr( 0, dot );
inc( to[ current ], i->second );
dot = current.rfind( "." );
}
}
}
static void inc( boost::tuple< D, int, int, int > &to, const boost::tuple< D, int, int, int > &from ) {
to.get<0>() += from.get<0>();
to.get<1>() += from.get<1>();
to.get<2>() += from.get<2>();
to.get<3>() += from.get<3>();
}
struct more { bool operator()( const D &a, const D &b ) { return a > b; } };
static string current_;
static T currentStart_;
static T snapshotStart_;
static D snapshotDuration_;
static UsageMap totalUsage_;
static UsageMap snapshotA_;
static UsageMap snapshotB_;
static UsageMap &snapshot_;
static UsageMap &nextSnapshot_;
static bool read_;
static bool write_;
};
} // namespace mongo
|
