blob: 0cb29aa49aa0ab916be501e776daec7ee37721c4 (
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
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
|
// counters.h
/*
* 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/>.
*/
#pragma once
#include "../../pch.h"
#include "../jsobj.h"
#include "../../util/net/message.h"
#include "../../util/processinfo.h"
#include "../../util/concurrency/spin_lock.h"
namespace mongo {
/**
* for storing operation counters
* note: not thread safe. ok with that for speed
*/
class OpCounters {
public:
OpCounters();
AtomicUInt * getInsert() { return _insert; }
AtomicUInt * getQuery() { return _query; }
AtomicUInt * getUpdate() { return _update; }
AtomicUInt * getDelete() { return _delete; }
AtomicUInt * getGetMore() { return _getmore; }
AtomicUInt * getCommand() { return _command; }
void incInsertInWriteLock(int n) { _insert->x += n; }
void gotInsert() { _insert[0]++; }
void gotQuery() { _query[0]++; }
void gotUpdate() { _update[0]++; }
void gotDelete() { _delete[0]++; }
void gotGetMore() { _getmore[0]++; }
void gotCommand() { _command[0]++; }
void gotOp( int op , bool isCommand );
BSONObj& getObj();
private:
BSONObj _obj;
// todo: there will be a lot of cache line contention on these. need to do something
// else eventually.
AtomicUInt * _insert;
AtomicUInt * _query;
AtomicUInt * _update;
AtomicUInt * _delete;
AtomicUInt * _getmore;
AtomicUInt * _command;
};
extern OpCounters globalOpCounters;
extern OpCounters replOpCounters;
class IndexCounters {
public:
IndexCounters();
// used without a mutex intentionally (can race)
void btree( char * node ) {
if ( ! _memSupported )
return;
if ( _sampling++ % _samplingrate )
return;
btree( _pi.blockInMemory( node ) );
}
void btree( bool memHit ) {
if ( memHit )
_btreeMemHits++;
else
_btreeMemMisses++;
_btreeAccesses++;
}
void btreeHit() { _btreeMemHits++; _btreeAccesses++; }
void btreeMiss() { _btreeMemMisses++; _btreeAccesses++; }
void append( BSONObjBuilder& b );
private:
ProcessInfo _pi;
bool _memSupported;
int _sampling;
int _samplingrate;
int _resets;
long long _maxAllowed;
long long _btreeMemMisses;
long long _btreeMemHits;
long long _btreeAccesses;
};
extern IndexCounters globalIndexCounters;
class FlushCounters {
public:
FlushCounters();
void flushed(int ms);
void append( BSONObjBuilder& b );
private:
long long _total_time;
long long _flushes;
int _last_time;
Date_t _last;
};
extern FlushCounters globalFlushCounters;
class GenericCounter {
public:
GenericCounter() : _mutex("GenericCounter") { }
void hit( const string& name , int count=0 );
BSONObj getObj();
private:
map<string,long long> _counts; // TODO: replace with thread safe map
mongo::mutex _mutex;
};
class NetworkCounter {
public:
NetworkCounter() : _bytesIn(0), _bytesOut(0), _requests(0), _overflows(0) {}
void hit( long long bytesIn , long long bytesOut );
void append( BSONObjBuilder& b );
private:
long long _bytesIn;
long long _bytesOut;
long long _requests;
long long _overflows;
SpinLock _lock;
};
extern NetworkCounter networkCounter;
}
|
