blob: 240b87f093c9f35e3c17507257aecd50043e6c94 (
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
70
71
72
73
74
|
// btree_stats.h
/**
* Copyright (C) 2008-2012 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/>.
*/
#pragma once
#include "mongo/db/commands/server_status.h"
#include "mongo/db/pdfile.h"
#include "mongo/db/storage/record.h"
#include "mongo/util/processinfo.h"
namespace mongo {
class IndexCounters : public ServerStatusSection {
public:
IndexCounters();
virtual ~IndexCounters();
virtual bool includeByDefault() const { return true; }
virtual BSONObj generateSection(const BSONElement& configElement) const;
// used without a mutex intentionally (can race)
void btree( const char* node ) {
if ( ! _memSupported )
return;
btree( Record::likelyInPhysicalMemory( node ) );
}
void btree( bool memHit ) {
if ( memHit )
_btreeMemHits++;
else
_btreeMemMisses++;
if ( _btreeAccesses++ > _maxAllowed )
_roll();
}
void btreeHit() { _btreeMemHits++; _btreeAccesses++; }
void btreeMiss() { _btreeMemMisses++; _btreeAccesses++; }
private:
void _roll();
bool _memSupported;
int _resets;
long long _maxAllowed;
long long _btreeMemMisses;
long long _btreeMemHits;
long long _btreeAccesses;
};
extern IndexCounters* globalIndexCounters;
}
|
