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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
// top.cpp
/*
* Copyright (C) 2010 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 "mongo/pch.h"
#include "mongo/db/stats/top.h"
#include "mongo/db/auth/action_set.h"
#include "mongo/db/auth/action_type.h"
#include "mongo/db/auth/privilege.h"
#include "mongo/util/net/message.h"
#include "mongo/db/commands.h"
namespace mongo {
Top::UsageData::UsageData( const UsageData& older , const UsageData& newer ) {
// this won't be 100% accurate on rollovers and drop(), but at least it won't be negative
time = (newer.time >= older.time) ? (newer.time - older.time) : newer.time;
count = (newer.count >= older.count) ? (newer.count - older.count) : newer.count;
}
Top::CollectionData::CollectionData( const CollectionData& older , const CollectionData& newer )
: total( older.total , newer.total ) ,
readLock( older.readLock , newer.readLock ) ,
writeLock( older.writeLock , newer.writeLock ) ,
queries( older.queries , newer.queries ) ,
getmore( older.getmore , newer.getmore ) ,
insert( older.insert , newer.insert ) ,
update( older.update , newer.update ) ,
remove( older.remove , newer.remove ),
commands( older.commands , newer.commands ) {
}
void Top::record( const StringData& ns , int op , int lockType , long long micros , bool command ) {
if ( ns[0] == '?' )
return;
//cout << "record: " << ns << "\t" << op << "\t" << command << endl;
SimpleMutex::scoped_lock lk(_lock);
if ( ( command || op == dbQuery ) && ns == _lastDropped ) {
_lastDropped = "";
return;
}
CollectionData& coll = _usage[ns];
_record( coll , op , lockType , micros , command );
_record( _global , op , lockType , micros , command );
}
void Top::_record( CollectionData& c , int op , int lockType , long long micros , bool command ) {
c.total.inc( micros );
if ( lockType > 0 )
c.writeLock.inc( micros );
else if ( lockType < 0 )
c.readLock.inc( micros );
switch ( op ) {
case 0:
// use 0 for unknown, non-specific
break;
case dbUpdate:
c.update.inc( micros );
break;
case dbInsert:
c.insert.inc( micros );
break;
case dbQuery:
if ( command )
c.commands.inc( micros );
else
c.queries.inc( micros );
break;
case dbGetMore:
c.getmore.inc( micros );
break;
case dbDelete:
c.remove.inc( micros );
break;
case dbKillCursors:
break;
case opReply:
case dbMsg:
log() << "unexpected op in Top::record: " << op << endl;
break;
default:
log() << "unknown op in Top::record: " << op << endl;
}
}
void Top::collectionDropped( const string& ns ) {
//cout << "collectionDropped: " << ns << endl;
SimpleMutex::scoped_lock lk(_lock);
_usage.erase(ns);
_lastDropped = ns;
}
void Top::cloneMap(Top::UsageMap& out) const {
SimpleMutex::scoped_lock lk(_lock);
out = _usage;
}
void Top::append( BSONObjBuilder& b ) {
SimpleMutex::scoped_lock lk( _lock );
_appendToUsageMap( b , _usage );
}
void Top::_appendToUsageMap( BSONObjBuilder& b , const UsageMap& map ) const {
// pull all the names into a vector so we can sort them for the user
vector<string> names;
for ( UsageMap::const_iterator i = map.begin(); i != map.end(); ++i ) {
names.push_back( i->first );
}
std::sort( names.begin(), names.end() );
for ( size_t i=0; i<names.size(); i++ ) {
BSONObjBuilder bb( b.subobjStart( names[i] ) );
const CollectionData& coll = map.find(names[i])->second;
_appendStatsEntry( b , "total" , coll.total );
_appendStatsEntry( b , "readLock" , coll.readLock );
_appendStatsEntry( b , "writeLock" , coll.writeLock );
_appendStatsEntry( b , "queries" , coll.queries );
_appendStatsEntry( b , "getmore" , coll.getmore );
_appendStatsEntry( b , "insert" , coll.insert );
_appendStatsEntry( b , "update" , coll.update );
_appendStatsEntry( b , "remove" , coll.remove );
_appendStatsEntry( b , "commands" , coll.commands );
bb.done();
}
}
void Top::_appendStatsEntry( BSONObjBuilder& b , const char * statsName , const UsageData& map ) const {
BSONObjBuilder bb( b.subobjStart( statsName ) );
bb.appendNumber( "time" , map.time );
bb.appendNumber( "count" , map.count );
bb.done();
}
class TopCmd : public Command {
public:
TopCmd() : Command( "top", true ) {}
virtual bool slaveOk() const { return true; }
virtual bool adminOnly() const { return true; }
virtual LockType locktype() const { return NONE; }
virtual void help( stringstream& help ) const { help << "usage by collection, in micros "; }
virtual void addRequiredPrivileges(const std::string& dbname,
const BSONObj& cmdObj,
std::vector<Privilege>* out) {
ActionSet actions;
actions.addAction(ActionType::top);
out->push_back(Privilege(AuthorizationManager::SERVER_RESOURCE_NAME, actions));
}
virtual bool run(const string& , BSONObj& cmdObj, int, string& errmsg, BSONObjBuilder& result, bool fromRepl) {
{
BSONObjBuilder b( result.subobjStart( "totals" ) );
b.append( "note" , "all times in microseconds" );
Top::global.append( b );
b.done();
}
return true;
}
} topCmd;
Top Top::global;
}
|
