blob: 091726c0b0a09117eec5d56af674bc6d50cab197 (
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
// btree_stats.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,
* 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/btree_stats.h"
namespace mongo {
IndexCounters::IndexCounters()
: ServerStatusSection( "indexCounters" ) {
_memSupported = ProcessInfo().blockCheckSupported();
_btreeMemHits = 0;
_btreeMemMisses = 0;
_btreeAccesses = 0;
_maxAllowed = ( numeric_limits< long long >::max() ) / 2;
_resets = 0;
}
IndexCounters::~IndexCounters(){
}
BSONObj IndexCounters::generateSection(const BSONElement& configElement) const {
if ( ! _memSupported ) {
return BSON( "note" << "not supported on this platform" );
}
BSONObjBuilder bb;
bb.appendNumber( "accesses" , _btreeAccesses );
bb.appendNumber( "hits" , _btreeMemHits );
bb.appendNumber( "misses" , _btreeMemMisses );
bb.append( "resets" , _resets );
bb.append( "missRatio" , (_btreeAccesses ? (_btreeMemMisses / (double)_btreeAccesses) : 0) );
return bb.obj();
}
void IndexCounters::_roll() {
_btreeAccesses = 0;
_btreeMemMisses = 0;
_btreeMemHits = 0;
_resets++;
}
IndexCounters globalIndexCounters;
}
|
