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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
|
// @file d_concurrency.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/>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the GNU Affero General Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#include "mongo/pch.h"
#include "mongo/db/d_concurrency.h"
#include "mongo/db/client.h"
#include "mongo/db/commands/server_status.h"
#include "mongo/db/curop.h"
#include "mongo/db/d_globals.h"
#include "mongo/db/storage/mmap_v1/dur.h"
#include "mongo/db/lockstat.h"
#include "mongo/db/namespace_string.h"
#include "mongo/server.h"
#include "mongo/util/assert_util.h"
#include "mongo/util/concurrency/mapsf.h"
#include "mongo/util/concurrency/qlock.h"
#include "mongo/util/concurrency/rwlock.h"
#include "mongo/util/concurrency/threadlocal.h"
#include "mongo/util/stacktrace.h"
// oplog locking
// no top level read locks
// system.profile writing
// oplog now
// yielding
// commitIfNeeded
namespace mongo {
inline LockState& lockState() {
return cc().lockState();
}
char threadState() {
return lockState().threadState();
}
class DBTryLockTimeoutException : public std::exception {
public:
DBTryLockTimeoutException() {}
virtual ~DBTryLockTimeoutException() throw() { }
};
/* dbname->lock
Currently these are never deleted - will linger if db was closed. (that should be fine.)
We don't put the lock inside the Database object as those can come and go with open and
closes and that would just add complexity.
Note there is no path concept for where the database is; if somehow you had two db's open
in different directories with the same name, it will be ok but they are sharing a lock
then.
*/
typedef mapsf< StringMap<WrapperForRWLock*> > DBLocksMap;
static DBLocksMap dblocks;
/* we don't want to touch dblocks too much as a mutex is involved. thus party for that,
this is here...
*/
WrapperForRWLock *nestableLocks[] = {
0,
new WrapperForRWLock("local"),
new WrapperForRWLock("admin")
};
LockStat* Lock::nestableLockStat( Nestable db ) {
return &nestableLocks[db]->getStats();
}
class WrapperForQLock {
QLock q;
public:
LockStat stats;
void lock_r() {
verify( threadState() == 0 );
lockState().lockedStart( 'r' );
q.lock_r();
}
void lock_w() {
verify( threadState() == 0 );
getDur().commitIfNeeded();
lockState().lockedStart( 'w' );
q.lock_w();
}
void lock_R() {
LockState& ls = lockState();
massert(16103, str::stream() << "can't lock_R, threadState=" << (int) ls.threadState(), ls.threadState() == 0);
ls.lockedStart( 'R' );
q.lock_R();
}
void lock_W() {
LockState& ls = lockState();
if( ls.threadState() ) {
log() << "can't lock_W, threadState=" << (int) ls.threadState() << endl;
fassert(16114,false);
}
getDur().commitIfNeeded(); // check before locking - will use an R lock for the commit if need to do one, which is better than W
ls.lockedStart( 'W' );
{
q.lock_W();
}
}
// how to count try's that fail is an interesting question. we should get rid of try().
bool lock_R_try(int millis) {
verify( threadState() == 0 );
bool got = q.lock_R_try(millis);
if( got )
lockState().lockedStart( 'R' );
return got;
}
bool lock_W_try(int millis) {
verify( threadState() == 0 );
bool got = q.lock_W_try(millis);
if( got ) {
lockState().lockedStart( 'W' );
}
return got;
}
void unlock_r() {
wassert( threadState() == 'r' );
lockState().unlocked();
q.unlock_r();
}
void unlock_w() {
wassert( threadState() == 'w' );
lockState().unlocked();
q.unlock_w();
}
void unlock_R() { _unlock_R(); }
void unlock_W() {
wassert( threadState() == 'W' );
lockState().unlocked();
q.unlock_W();
}
// todo timing stats? :
void W_to_R() { q.W_to_R(); }
void R_to_W() { q.R_to_W(); }
bool w_to_X() { return q.w_to_X(); }
void X_to_w() { q.X_to_w(); }
private:
void _unlock_R() {
wassert( threadState() == 'R' );
lockState().unlocked();
q.unlock_R();
}
};
static WrapperForQLock& qlk = *new WrapperForQLock();
LockStat* Lock::globalLockStat() {
return &qlk.stats;
}
int Lock::isLocked() {
return threadState();
}
int Lock::isReadLocked() {
return threadState() == 'R' || threadState() == 'r';
}
int Lock::somethingWriteLocked() {
return threadState() == 'W' || threadState() == 'w';
}
bool Lock::isRW() {
return threadState() == 'W' || threadState() == 'R';
}
bool Lock::isW() {
return threadState() == 'W';
}
bool Lock::isR() {
return threadState() == 'R';
}
bool Lock::nested() {
// note this doesn't tell us much actually, it tells us if we are nesting locks but
// they could be the a global lock twice or a global and a specific or two specifics
// (such as including local)
return lockState().recursiveCount() > 1;
}
bool Lock::isWriteLocked(const StringData& ns) {
LockState &ls = lockState();
if( ls.threadState() == 'W' )
return true;
if( ls.threadState() != 'w' )
return false;
return ls.isLocked( ns );
}
bool Lock::atLeastReadLocked(const StringData& ns)
{
LockState &ls = lockState();
if( ls.threadState() == 'R' || ls.threadState() == 'W' )
return true; // global
if( ls.threadState() == 0 )
return false;
return ls.isLocked( ns );
}
void Lock::assertAtLeastReadLocked(const StringData& ns) {
if( !atLeastReadLocked(ns) ) {
LockState &ls = lockState();
log() << "error expected " << ns << " to be locked " << endl;
ls.dump();
msgasserted(16104, str::stream() << "expected to be read locked for " << ns);
}
}
void Lock::assertWriteLocked(const StringData& ns) {
if( !Lock::isWriteLocked(ns) ) {
lockState().dump();
msgasserted(16105, str::stream() << "expected to be write locked for " << ns);
}
}
RWLockRecursive &Lock::ParallelBatchWriterMode::_batchLock = *(new RWLockRecursive("special"));
void Lock::ParallelBatchWriterMode::iAmABatchParticipant() {
lockState()._batchWriter = true;
}
Lock::ScopedLock::ParallelBatchWriterSupport::ParallelBatchWriterSupport() {
relock();
}
void Lock::ScopedLock::ParallelBatchWriterSupport::tempRelease() {
_lk.reset( 0 );
}
void Lock::ScopedLock::ParallelBatchWriterSupport::relock() {
LockState& ls = lockState();
if ( ! ls._batchWriter ) {
AcquiringParallelWriter a(ls);
_lk.reset( new RWLockRecursive::Shared(ParallelBatchWriterMode::_batchLock) );
}
}
Lock::ScopedLock::ScopedLock( char type )
: _type(type), _stat(0) {
LockState& ls = lockState();
ls.enterScopedLock( this );
}
Lock::ScopedLock::~ScopedLock() {
LockState& ls = lockState();
int prevCount = ls.recursiveCount();
Lock::ScopedLock* what = ls.leaveScopedLock();
fassert( 16171 , prevCount != 1 || what == this );
}
long long Lock::ScopedLock::acquireFinished( LockStat* stat ) {
long long acquisitionTime = _timer.micros();
_timer.reset();
_stat = stat;
// increment the operation level statistics
cc().curop()->lockStat().recordAcquireTimeMicros( _type , acquisitionTime );
return acquisitionTime;
}
void Lock::ScopedLock::tempRelease() {
long long micros = _timer.micros();
_tempRelease();
_pbws_lk.tempRelease();
_recordTime( micros ); // might as well do after we unlock
}
void Lock::ScopedLock::_recordTime( long long micros ) {
if ( _stat )
_stat->recordLockTimeMicros( _type , micros );
cc().curop()->lockStat().recordLockTimeMicros( _type , micros );
}
void Lock::ScopedLock::recordTime() {
_recordTime(_timer.micros());
}
void Lock::ScopedLock::resetTime() {
_timer.reset();
}
void Lock::ScopedLock::relock() {
_pbws_lk.relock();
resetTime();
_relock();
}
Lock::TempRelease::TempRelease() : cant( Lock::nested() )
{
if( cant )
return;
LockState& ls = lockState();
fassert( 16116, ls.recursiveCount() == 1 );
fassert( 16117, ls.threadState() != 0 );
scopedLk = ls.leaveScopedLock();
fassert( 16118, scopedLk );
scopedLk->tempRelease();
}
Lock::TempRelease::~TempRelease()
{
if( cant )
return;
LockState& ls = lockState();
fassert( 16119, scopedLk );
fassert( 16120 , ls.threadState() == 0 );
ls.enterScopedLock( scopedLk );
scopedLk->relock();
}
void Lock::GlobalWrite::_tempRelease() {
fassert(16121, !noop);
char ts = threadState();
fassert(16122, ts != 'R'); // indicates downgraded; not allowed with temprelease
fassert(16123, ts == 'W');
qlk.unlock_W();
}
void Lock::GlobalWrite::_relock() {
fassert(16125, !noop);
char ts = threadState();
fassert(16126, ts == 0);
Acquiring a(this,lockState());
qlk.lock_W();
}
void Lock::GlobalRead::_tempRelease() {
fassert(16127, !noop);
char ts = threadState();
fassert(16128, ts == 'R');
qlk.unlock_R();
}
void Lock::GlobalRead::_relock() {
fassert(16129, !noop);
char ts = threadState();
fassert(16130, ts == 0);
Acquiring a(this,lockState());
qlk.lock_R();
}
void Lock::DBWrite::_tempRelease() {
unlockDB();
}
void Lock::DBWrite::_relock() {
lockDB(_what);
}
void Lock::DBRead::_tempRelease() {
unlockDB();
}
void Lock::DBRead::_relock() {
lockDB(_what);
}
Lock::GlobalWrite::GlobalWrite(bool sg, int timeoutms)
: ScopedLock('W') {
char ts = threadState();
noop = false;
if( ts == 'W' ) {
noop = true;
return;
}
dassert( ts == 0 );
Acquiring a(this,lockState());
if ( timeoutms != -1 ) {
bool success = qlk.lock_W_try( timeoutms );
if ( !success ) throw DBTryLockTimeoutException();
}
else {
qlk.lock_W();
}
}
Lock::GlobalWrite::~GlobalWrite() {
if( noop ) {
return;
}
recordTime(); // for lock stats
if( threadState() == 'R' ) { // we downgraded
qlk.unlock_R();
}
else {
qlk.unlock_W();
}
}
void Lock::GlobalWrite::downgrade() {
verify( !noop );
verify( threadState() == 'W' );
qlk.W_to_R();
lockState().changeLockState( 'R' );
}
// you will deadlock if 2 threads doing this
void Lock::GlobalWrite::upgrade() {
verify( !noop );
verify( threadState() == 'R' );
qlk.R_to_W();
lockState().changeLockState( 'W' );
}
Lock::GlobalRead::GlobalRead( int timeoutms )
: ScopedLock( 'R' ) {
LockState& ls = lockState();
char ts = ls.threadState();
noop = false;
if( ts == 'R' || ts == 'W' ) {
noop = true;
return;
}
Acquiring a(this,ls);
if ( timeoutms != -1 ) {
bool success = qlk.lock_R_try( timeoutms );
if ( !success ) throw DBTryLockTimeoutException();
}
else {
qlk.lock_R(); // we are unlocked in the qlock/top sense. lock_R will assert if we are in an in compatible state
}
}
Lock::GlobalRead::~GlobalRead() {
if( !noop ) {
recordTime(); // for lock stats
qlk.unlock_R();
}
}
void Lock::DBWrite::lockNestable(Nestable db) {
_nested = true;
LockState& ls = lockState();
if( ls.nestableCount() ) {
if( db != ls.whichNestable() ) {
error() << "can't lock local and admin db at the same time " << (int) db << ' ' << (int) ls.whichNestable() << endl;
fassert(16131,false);
}
verify( ls.nestableCount() > 0 );
}
else {
fassert(16132,_weLocked==0);
ls.lockedNestable(db, 1);
_weLocked = nestableLocks[db];
_weLocked->lock();
}
}
void Lock::DBRead::lockNestable(Nestable db) {
_nested = true;
LockState& ls = lockState();
if( ls.nestableCount() ) {
// we are nested in our locking of local. previous lock could be read OR write lock on local.
}
else {
ls.lockedNestable(db,-1);
fassert(16133,_weLocked==0);
_weLocked = nestableLocks[db];
_weLocked->lock_shared();
}
}
void Lock::DBWrite::lockOther(const StringData& db) {
fassert(16252, !db.empty());
LockState& ls = lockState();
// we do checks first, as on assert destructor won't be called so don't want to be half finished with our work.
if (ls.otherCount()) {
// nested. if/when we do temprelease with DBWrite we will need to increment here
// (so we can not release or assert if nested).
massert(16106, str::stream() << "internal error tried to lock two databases at the same time. old:" << ls.otherName() << " new:" << db, db == ls.otherName());
return;
}
// first lock for this db. check consistent order with local db lock so we never deadlock. local always comes last
massert(16098, str::stream() << "can't dblock:" << db << " when local or admin is already locked", ls.nestableCount() == 0);
if (db != ls.otherName()) {
DBLocksMap::ref r(dblocks);
WrapperForRWLock*& lock = r[db];
if (lock == NULL) {
lock = new WrapperForRWLock(db);
}
ls.lockedOther( db , 1 , lock );
}
else {
DEV OCCASIONALLY { dassert( dblocks.get(db) == ls.otherLock() ); }
ls.lockedOther(1);
}
fassert(16134,_weLocked==0);
ls.otherLock()->lock();
_weLocked = ls.otherLock();
}
static Lock::Nestable n(const StringData& db) {
if( db == "local" )
return Lock::local;
if( db == "admin" )
return Lock::admin;
return Lock::notnestable;
}
void Lock::DBWrite::lockDB(const string& ns) {
fassert( 16253, !ns.empty() );
LockState& ls = lockState();
Acquiring a(this,ls);
_locked_W=false;
_locked_w=false;
_weLocked=0;
massert( 16186 , "can't get a DBWrite while having a read lock" , ! ls.hasAnyReadLock() );
if( ls.isW() )
return;
StringData db = nsToDatabaseSubstring( ns );
Nestable nested = n(db);
if( nested == admin ) {
// we can't nestedly lock both admin and local as implemented. so lock_W.
qlk.lock_W();
_locked_W = true;
return;
}
if( !nested )
lockOther(db);
lockTop(ls);
if( nested )
lockNestable(nested);
}
void Lock::DBRead::lockDB(const string& ns) {
fassert( 16254, !ns.empty() );
LockState& ls = lockState();
Acquiring a(this,ls);
_locked_r=false;
_weLocked=0;
if ( ls.isRW() )
return;
StringData db = nsToDatabaseSubstring(ns);
Nestable nested = n(db);
if( !nested )
lockOther(db);
lockTop(ls);
if( nested )
lockNestable(nested);
}
Lock::DBWrite::DBWrite(LockState* lockState, const StringData& ns)
: ScopedLock( 'w' ), _what(ns.toString()), _nested(false) {
lockDB( _what );
}
Lock::DBRead::DBRead(LockState* lockState, const StringData& ns)
: ScopedLock( 'r' ), _what(ns.toString()), _nested(false) {
lockDB( _what );
}
Lock::DBWrite::~DBWrite() {
unlockDB();
}
Lock::DBRead::~DBRead() {
unlockDB();
}
void Lock::DBWrite::unlockDB() {
if( _weLocked ) {
recordTime(); // for lock stats
if ( _nested )
lockState().unlockedNestable();
else
lockState().unlockedOther();
_weLocked->unlock();
}
if( _locked_w ) {
qlk.unlock_w();
}
if( _locked_W ) {
qlk.unlock_W();
}
_weLocked = 0;
_locked_W = _locked_w = false;
}
void Lock::DBRead::unlockDB() {
if( _weLocked ) {
recordTime(); // for lock stats
if( _nested )
lockState().unlockedNestable();
else
lockState().unlockedOther();
_weLocked->unlock_shared();
}
if( _locked_r ) {
qlk.unlock_r();
}
_weLocked = 0;
_locked_r = false;
}
void Lock::DBWrite::lockTop(LockState& ls) {
switch( ls.threadState() ) {
case 'w':
break;
default:
verify(false);
case 0 :
qlk.lock_w();
_locked_w = true;
}
}
void Lock::DBRead::lockTop(LockState& ls) {
switch( ls.threadState() ) {
case 'r':
case 'w':
break;
default:
verify(false);
case 0 :
qlk.lock_r();
_locked_r = true;
}
}
void Lock::DBRead::lockOther(const StringData& db) {
fassert( 16255, !db.empty() );
LockState& ls = lockState();
// we do checks first, as on assert destructor won't be called so don't want to be half finished with our work.
if( ls.otherCount() ) {
// nested. prev could be read or write. if/when we do temprelease with DBRead/DBWrite we will need to increment/decrement here
// (so we can not release or assert if nested). temprelease we should avoid if we can though, it's a bit of an anti-pattern.
massert(16099, str::stream() << "internal error tried to lock two databases at the same time. old:" << ls.otherName() << " new:" << db, db == ls.otherName() );
return;
}
// first lock for this db. check consistent order with local db lock so we never deadlock. local always comes last
massert(16100, str::stream() << "can't dblock:" << db << " when local or admin is already locked", ls.nestableCount() == 0);
if (db != ls.otherName()) {
DBLocksMap::ref r(dblocks);
WrapperForRWLock*& lock = r[db];
if (lock == NULL) {
lock = new WrapperForRWLock(db);
}
ls.lockedOther( db , -1 , lock );
}
else {
DEV OCCASIONALLY { dassert( dblocks.get(db) == ls.otherLock() ); }
ls.lockedOther(-1);
}
fassert(16135,_weLocked==0);
ls.otherLock()->lock_shared();
_weLocked = ls.otherLock();
}
Lock::UpgradeGlobalLockToExclusive::UpgradeGlobalLockToExclusive() {
fassert( 16187, lockState().threadState() == 'w' );
// We're about to temporarily drop w, so stop the lock time stopwatch
lockState().recordLockTime();
_gotUpgrade = qlk.w_to_X();
if ( _gotUpgrade ) {
lockState().changeLockState('W');
lockState().resetLockTime();
}
}
Lock::UpgradeGlobalLockToExclusive::~UpgradeGlobalLockToExclusive() {
if ( _gotUpgrade ) {
fassert( 16188, lockState().threadState() == 'W' );
lockState().recordLockTime();
qlk.X_to_w();
lockState().changeLockState('w');
}
else {
fassert( 16189, lockState().threadState() == 'w' );
}
// Start recording lock time again
lockState().resetLockTime();
}
writelocktry::writelocktry( int tryms ) :
_got( false ),
_dbwlock( NULL )
{
try {
_dbwlock.reset(new Lock::GlobalWrite( false, tryms ));
}
catch ( DBTryLockTimeoutException & ) {
return;
}
_got = true;
}
writelocktry::~writelocktry() {
}
// note: the 'already' concept here might be a bad idea as a temprelease wouldn't notice it is nested then
readlocktry::readlocktry( int tryms ) :
_got( false ),
_dbrlock( NULL )
{
try {
_dbrlock.reset(new Lock::GlobalRead( tryms ));
}
catch ( DBTryLockTimeoutException & ) {
return;
}
_got = true;
}
readlocktry::~readlocktry() {
}
class GlobalLockServerStatusSection : public ServerStatusSection {
public:
GlobalLockServerStatusSection() : ServerStatusSection( "globalLock" ){
_started = curTimeMillis64();
}
virtual bool includeByDefault() const { return true; }
virtual BSONObj generateSection( const BSONElement& configElement ) const {
BSONObjBuilder t;
t.append( "totalTime" , (long long)(1000 * ( curTimeMillis64() - _started ) ) );
t.append( "lockTime" , Lock::globalLockStat()->getTimeLocked( 'W' ) );
{
BSONObjBuilder ttt( t.subobjStart( "currentQueue" ) );
int w=0, r=0;
Client::recommendedYieldMicros( &w , &r, true );
ttt.append( "total" , w + r );
ttt.append( "readers" , r );
ttt.append( "writers" , w );
ttt.done();
}
{
BSONObjBuilder ttt( t.subobjStart( "activeClients" ) );
int w=0, r=0;
Client::getActiveClientCount( w , r );
ttt.append( "total" , w + r );
ttt.append( "readers" , r );
ttt.append( "writers" , w );
ttt.done();
}
return t.obj();
}
private:
unsigned long long _started;
} globalLockServerStatusSection;
class LockStatsServerStatusSection : public ServerStatusSection {
public:
LockStatsServerStatusSection() : ServerStatusSection( "locks" ){}
virtual bool includeByDefault() const { return true; }
BSONObj generateSection( const BSONElement& configElement ) const {
BSONObjBuilder b;
b.append(".", qlk.stats.report());
b.append("admin", nestableLocks[Lock::admin]->getStats().report());
b.append("local", nestableLocks[Lock::local]->getStats().report());
{
DBLocksMap::ref r(dblocks);
for( DBLocksMap::const_iterator i = r.r.begin(); i != r.r.end(); ++i ) {
b.append(i->first, i->second->getStats().report());
}
}
return b.obj();
}
} lockStatsServerStatusSection;
}
|