-
Notifications
You must be signed in to change notification settings - Fork 5.6k
/
d_migrate.cpp
1955 lines (1569 loc) · 72.8 KB
/
d_migrate.cpp
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
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// d_migrate.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/>.
*/
/**
these are commands that live in mongod
mostly around shard management and checking
*/
#include "pch.h"
#include <map>
#include <string>
#include <algorithm>
#include <boost/thread/thread.hpp>
#include "mongo/db/dbhelpers.h"
#include "../db/commands.h"
#include "../db/jsobj.h"
#include "../db/cmdline.h"
#include "../db/queryoptimizer.h"
#include "../db/btree.h"
#include "../db/repl_block.h"
#include "../db/dur.h"
#include "../db/clientcursor.h"
#include "../db/pagefault.h"
#include "../db/repl.h"
#include "../client/connpool.h"
#include "../client/distlock.h"
#include "mongo/client/dbclientcursor.h"
#include "../util/queue.h"
#include "../util/startup_test.h"
#include "../util/processinfo.h"
#include "../util/ramlog.h"
#include "shard.h"
#include "d_logic.h"
#include "config.h"
#include "chunk.h"
using namespace std;
namespace mongo {
BSONObj findShardKeyIndexPattern_locked( const string& ns , const BSONObj& shardKeyPattern ) {
verify( Lock::isLocked() );
NamespaceDetails* nsd = nsdetails( ns.c_str() );
verify( nsd );
const IndexDetails* idx = nsd->findIndexByPrefix( shardKeyPattern , true ); /* require single key */
verify( idx );
return idx->keyPattern().getOwned();
}
BSONObj findShardKeyIndexPattern_unlocked( const string& ns , const BSONObj& shardKeyPattern ) {
Client::ReadContext context( ns );
return findShardKeyIndexPattern_locked( ns , shardKeyPattern ).getOwned();
}
Tee* migrateLog = new RamLog( "migrate" );
class MoveTimingHelper {
public:
MoveTimingHelper( const string& where , const string& ns , BSONObj min , BSONObj max , int total , string& cmdErrmsg )
: _where( where ) , _ns( ns ) , _next( 0 ) , _total( total ) , _cmdErrmsg( cmdErrmsg ) {
_nextNote = 0;
_b.append( "min" , min );
_b.append( "max" , max );
}
~MoveTimingHelper() {
// even if logChange doesn't throw, bson does
// sigh
try {
if ( _next != _total ) {
note( "aborted" );
}
if ( _cmdErrmsg.size() ) {
note( _cmdErrmsg );
warning() << "got error doing chunk migrate: " << _cmdErrmsg << endl;
}
configServer.logChange( (string)"moveChunk." + _where , _ns, _b.obj() );
}
catch ( const std::exception& e ) {
warning() << "couldn't record timing for moveChunk '" << _where << "': " << e.what() << migrateLog;
}
}
void done( int step ) {
verify( step == ++_next );
verify( step <= _total );
stringstream ss;
ss << "step" << step << " of " << _total;
string s = ss.str();
CurOp * op = cc().curop();
if ( op )
op->setMessage( s.c_str() );
else
warning() << "op is null in MoveTimingHelper::done" << migrateLog;
_b.appendNumber( s , _t.millis() );
_t.reset();
#if 0
// debugging for memory leak?
ProcessInfo pi;
ss << " v:" << pi.getVirtualMemorySize()
<< " r:" << pi.getResidentSize();
log() << ss.str() << migrateLog;
#endif
}
void note( const string& s ) {
string field = "note";
if ( _nextNote > 0 ) {
StringBuilder buf;
buf << "note" << _nextNote;
field = buf.str();
}
_nextNote++;
_b.append( field , s );
}
private:
Timer _t;
string _where;
string _ns;
int _next;
int _total; // expected # of steps
int _nextNote;
string _cmdErrmsg;
BSONObjBuilder _b;
};
struct OldDataCleanup {
static AtomicUInt _numThreads; // how many threads are doing async cleanup
bool secondaryThrottle;
string ns;
BSONObj min;
BSONObj max;
BSONObj shardKeyPattern;
set<CursorId> initial;
OldDataCleanup(){
_numThreads++;
}
OldDataCleanup( const OldDataCleanup& other ) {
secondaryThrottle = other.secondaryThrottle;
ns = other.ns;
min = other.min.getOwned();
max = other.max.getOwned();
shardKeyPattern = other.shardKeyPattern.getOwned();
initial = other.initial;
_numThreads++;
}
~OldDataCleanup(){
_numThreads--;
}
string toString() const {
return str::stream() << ns << " from " << min << " -> " << max;
}
void doRemove() {
ShardForceVersionOkModeBlock sf;
{
RemoveSaver rs("moveChunk",ns,"post-cleanup");
log() << "moveChunk starting delete for: " << this->toString() << migrateLog;
long long numDeleted =
Helpers::removeRange( ns ,
min ,
max ,
findShardKeyIndexPattern_unlocked( ns , shardKeyPattern ) ,
false , /*maxInclusive*/
secondaryThrottle ,
cmdLine.moveParanoia ? &rs : 0 , /*callback*/
true ); /*fromMigrate*/
log() << "moveChunk deleted " << numDeleted << " documents for "
<< this->toString() << migrateLog;
}
ReplTime lastOpApplied = cc().getLastOp().asDate();
Timer t;
for ( int i=0; i<3600; i++ ) {
if ( opReplicatedEnough( lastOpApplied , ( getSlaveCount() / 2 ) + 1 ) ) {
LOG(t.seconds() < 30 ? 1 : 0) << "moveChunk repl sync took " << t.seconds() << " seconds" << migrateLog;
return;
}
sleepsecs(1);
}
warning() << "moveChunk repl sync timed out after " << t.seconds() << " seconds" << migrateLog;
}
};
AtomicUInt OldDataCleanup::_numThreads = 0;
static const char * const cleanUpThreadName = "cleanupOldData";
class ChunkCommandHelper : public Command {
public:
ChunkCommandHelper( const char * name )
: Command( name ) {
}
virtual void help( stringstream& help ) const {
help << "internal - should not be called directly";
}
virtual bool slaveOk() const { return false; }
virtual bool adminOnly() const { return true; }
virtual LockType locktype() const { return NONE; }
};
bool isInRange( const BSONObj& obj , const BSONObj& min , const BSONObj& max ) {
BSONObj k = obj.extractFields( min, true );
return k.woCompare( min ) >= 0 && k.woCompare( max ) < 0;
}
class MigrateFromStatus {
public:
MigrateFromStatus() : _m("MigrateFromStatus") , _workLock("MigrateFromStatus::workLock") {
_active = false;
_inCriticalSection = false;
_memoryUsed = 0;
}
void start( string ns ,
const BSONObj& min ,
const BSONObj& max ,
const BSONObj& shardKeyPattern ) {
//
// Do not hold _workLock
//
//scoped_lock ll(_workLock);
scoped_lock l(_m); // reads and writes _active
verify( ! _active );
verify( ! min.isEmpty() );
verify( ! max.isEmpty() );
verify( ns.size() );
_ns = ns;
_min = min;
_max = max;
_shardKeyPattern = shardKeyPattern;
verify( _cloneLocs.size() == 0 );
verify( _deleted.size() == 0 );
verify( _reload.size() == 0 );
verify( _memoryUsed == 0 );
_active = true;
}
void done() {
Lock::DBRead lk( _ns );
{
scoped_spinlock lk( _trackerLocks );
_deleted.clear();
_reload.clear();
_cloneLocs.clear();
}
_memoryUsed = 0;
scoped_lock l(_m);
_active = false;
_inCriticalSection = false;
}
void logOp( const char * opstr , const char * ns , const BSONObj& obj , BSONObj * patt ) {
if ( ! _getActive() )
return;
if ( _ns != ns )
return;
// no need to log if this is not an insertion, an update, or an actual deletion
// note: opstr 'db' isn't a deletion but a mention that a database exists (for replication
// machinery mostly)
char op = opstr[0];
if ( op == 'n' || op =='c' || ( op == 'd' && opstr[1] == 'b' ) )
return;
BSONElement ide;
if ( patt )
ide = patt->getField( "_id" );
else
ide = obj["_id"];
if ( ide.eoo() ) {
warning() << "logOpForSharding got mod with no _id, ignoring obj: " << obj << migrateLog;
return;
}
BSONObj it;
switch ( opstr[0] ) {
case 'd': {
if (getThreadName().find(cleanUpThreadName) == 0) {
// we don't want to xfer things we're cleaning
// as then they'll be deleted on TO
// which is bad
return;
}
// can't filter deletes :(
_deleted.push_back( ide.wrap() );
_memoryUsed += ide.size() + 5;
return;
}
case 'i':
it = obj;
break;
case 'u':
if ( ! Helpers::findById( cc() , _ns.c_str() , ide.wrap() , it ) ) {
warning() << "logOpForSharding couldn't find: " << ide << " even though should have" << migrateLog;
return;
}
break;
}
if ( ! isInRange( it , _min , _max ) )
return;
_reload.push_back( ide.wrap() );
_memoryUsed += ide.size() + 5;
}
void xfer( list<BSONObj> * l , BSONObjBuilder& b , const char * name , long long& size , bool explode ) {
const long long maxSize = 1024 * 1024;
if ( l->size() == 0 || size > maxSize )
return;
BSONArrayBuilder arr(b.subarrayStart(name));
list<BSONObj>::iterator i = l->begin();
while ( i != l->end() && size < maxSize ) {
BSONObj t = *i;
if ( explode ) {
BSONObj it;
if ( Helpers::findById( cc() , _ns.c_str() , t, it ) ) {
arr.append( it );
size += it.objsize();
}
}
else {
arr.append( t );
}
i = l->erase( i );
size += t.objsize();
}
arr.done();
}
/**
* called from the dest of a migrate
* transfers mods from src to dest
*/
bool transferMods( string& errmsg , BSONObjBuilder& b ) {
if ( ! _getActive() ) {
errmsg = "no active migration!";
return false;
}
long long size = 0;
{
Client::ReadContext cx( _ns );
xfer( &_deleted , b , "deleted" , size , false );
xfer( &_reload , b , "reload" , size , true );
}
b.append( "size" , size );
return true;
}
/**
* Get the disklocs that belong to the chunk migrated and sort them in _cloneLocs (to avoid seeking disk later)
*
* @param maxChunkSize number of bytes beyond which a chunk's base data (no indices) is considered too large to move
* @param errmsg filled with textual description of error if this call return false
* @return false if approximate chunk size is too big to move or true otherwise
*/
bool storeCurrentLocs( long long maxChunkSize , string& errmsg , BSONObjBuilder& result ) {
Client::ReadContext ctx( _ns );
NamespaceDetails *d = nsdetails( _ns.c_str() );
if ( ! d ) {
errmsg = "ns not found, should be impossible";
return false;
}
const IndexDetails *idx = d->findIndexByPrefix( _shardKeyPattern ,
true ); /* require single key */
if ( idx == NULL ) {
errmsg = (string)"can't find index in storeCurrentLocs" + causedBy( errmsg );
return false;
}
// Assume both min and max non-empty, append MinKey's to make them fit chosen index
BSONObj min = Helpers::modifiedRangeBound( _min , idx->keyPattern() , -1 );
BSONObj max = Helpers::modifiedRangeBound( _max , idx->keyPattern() , -1 );
BtreeCursor* btreeCursor = BtreeCursor::make( d , *idx , min , max , false , 1 );
auto_ptr<ClientCursor> cc(
new ClientCursor( QueryOption_NoCursorTimeout ,
shared_ptr<Cursor>( btreeCursor ) , _ns ) );
// use the average object size to estimate how many objects a full chunk would carry
// do that while traversing the chunk's range using the sharding index, below
// there's a fair amount of slack before we determine a chunk is too large because object sizes will vary
unsigned long long maxRecsWhenFull;
long long avgRecSize;
const long long totalRecs = d->stats.nrecords;
if ( totalRecs > 0 ) {
avgRecSize = d->stats.datasize / totalRecs;
maxRecsWhenFull = maxChunkSize / avgRecSize;
maxRecsWhenFull = std::min( (unsigned long long)(Chunk::MaxObjectPerChunk + 1) , 130 * maxRecsWhenFull / 100 /* slack */ );
}
else {
avgRecSize = 0;
maxRecsWhenFull = Chunk::MaxObjectPerChunk + 1;
}
// do a full traversal of the chunk and don't stop even if we think it is a large chunk
// we want the number of records to better report, in that case
bool isLargeChunk = false;
unsigned long long recCount = 0;;
while ( cc->ok() ) {
DiskLoc dl = cc->currLoc();
if ( ! isLargeChunk ) {
scoped_spinlock lk( _trackerLocks );
_cloneLocs.insert( dl );
}
cc->advance();
// we can afford to yield here because any change to the base data that we might miss is already being
// queued and will be migrated in the 'transferMods' stage
if ( ! cc->yieldSometimes( ClientCursor::DontNeed ) ) {
cc.release();
break;
}
if ( ++recCount > maxRecsWhenFull ) {
isLargeChunk = true;
}
}
if ( isLargeChunk ) {
warning() << "can't move chunk of size (approximately) " << recCount * avgRecSize
<< " because maximum size allowed to move is " << maxChunkSize
<< " ns: " << _ns << " " << _min << " -> " << _max
<< migrateLog;
result.appendBool( "chunkTooBig" , true );
result.appendNumber( "estimatedChunkSize" , (long long)(recCount * avgRecSize) );
errmsg = "chunk too big to move";
return false;
}
{
scoped_spinlock lk( _trackerLocks );
log() << "moveChunk number of documents: " << _cloneLocs.size() << migrateLog;
}
return true;
}
bool clone( string& errmsg , BSONObjBuilder& result ) {
if ( ! _getActive() ) {
errmsg = "not active";
return false;
}
ElapsedTracker tracker (128, 10); // same as ClientCursor::_yieldSometimesTracker
int allocSize;
{
Client::ReadContext ctx( _ns );
NamespaceDetails *d = nsdetails( _ns.c_str() );
verify( d );
scoped_spinlock lk( _trackerLocks );
allocSize = std::min(BSONObjMaxUserSize, (int)((12 + d->averageObjectSize()) * _cloneLocs.size()));
}
BSONArrayBuilder a (allocSize);
while ( 1 ) {
bool filledBuffer = false;
auto_ptr<LockMongoFilesShared> fileLock;
Record* recordToTouch = 0;
{
Client::ReadContext ctx( _ns );
scoped_spinlock lk( _trackerLocks );
set<DiskLoc>::iterator i = _cloneLocs.begin();
for ( ; i!=_cloneLocs.end(); ++i ) {
if (tracker.intervalHasElapsed()) // should I yield?
break;
DiskLoc dl = *i;
Record* r = dl.rec();
if ( ! r->likelyInPhysicalMemory() ) {
fileLock.reset( new LockMongoFilesShared() );
recordToTouch = r;
break;
}
BSONObj o = dl.obj();
// use the builder size instead of accumulating 'o's size so that we take into consideration
// the overhead of BSONArray indices
if ( a.len() + o.objsize() + 1024 > BSONObjMaxUserSize ) {
filledBuffer = true; // break out of outer while loop
break;
}
a.append( o );
}
_cloneLocs.erase( _cloneLocs.begin() , i );
if ( _cloneLocs.empty() || filledBuffer )
break;
}
if ( recordToTouch ) {
// its safe to touch here bceause we have a LockMongoFilesShared
// we can't do where we get the lock because we would have to unlock the main readlock and tne _trackerLocks
// simpler to handle this out there
recordToTouch->touch();
recordToTouch = 0;
}
}
result.appendArray( "objects" , a.arr() );
return true;
}
void aboutToDelete( const Database* db , const DiskLoc& dl ) {
verify(db);
Lock::assertWriteLocked(db->name);
if ( ! _getActive() )
return;
if ( ! db->ownsNS( _ns ) )
return;
// not needed right now
// but trying to prevent a future bug
scoped_spinlock lk( _trackerLocks );
_cloneLocs.erase( dl );
}
long long mbUsed() const { return _memoryUsed / ( 1024 * 1024 ); }
bool getInCriticalSection() const { scoped_lock l(_m); return _inCriticalSection; }
void setInCriticalSection( bool b ) { scoped_lock l(_m); _inCriticalSection = b; }
bool isActive() const { return _getActive(); }
void doRemove( OldDataCleanup& cleanup ) {
int it = 0;
while ( true ) {
if ( it > 20 && it % 10 == 0 ) log() << "doRemote iteration " << it << " for: " << cleanup << endl;
{
scoped_lock ll(_workLock);
if ( ! _active ) {
cleanup.doRemove();
return;
}
}
sleepmillis( 1000 );
}
}
private:
mutable mongo::mutex _m; // protect _inCriticalSection and _active
bool _inCriticalSection;
bool _active;
string _ns;
BSONObj _min;
BSONObj _max;
BSONObj _shardKeyPattern;
// we need the lock in case there is a malicious _migrateClone for example
// even though it shouldn't be needed under normal operation
SpinLock _trackerLocks;
// disk locs yet to be transferred from here to the other side
// no locking needed because built initially by 1 thread in a read lock
// emptied by 1 thread in a read lock
// updates applied by 1 thread in a write lock
set<DiskLoc> _cloneLocs;
list<BSONObj> _reload; // objects that were modified that must be recloned
list<BSONObj> _deleted; // objects deleted during clone that should be deleted later
long long _memoryUsed; // bytes in _reload + _deleted
mutable mongo::mutex _workLock; // this is used to make sure only 1 thread is doing serious work
// for now, this means migrate or removing old chunk data
bool _getActive() const { scoped_lock l(_m); return _active; }
void _setActive( bool b ) { scoped_lock l(_m); _active = b; }
} migrateFromStatus;
struct MigrateStatusHolder {
MigrateStatusHolder( string ns ,
const BSONObj& min ,
const BSONObj& max ,
const BSONObj& shardKeyPattern ) {
migrateFromStatus.start( ns , min , max , shardKeyPattern );
}
~MigrateStatusHolder() {
migrateFromStatus.done();
}
};
void _cleanupOldData( OldDataCleanup cleanup ) {
Client::initThread((string(cleanUpThreadName) + string("-") +
OID::gen().toString()).c_str());
if (!noauth) {
cc().getAuthenticationInfo()->authorize("local", internalSecurity.user);
}
log() << " (start) waiting to cleanup " << cleanup
<< ", # cursors remaining: " << cleanup.initial.size() << migrateLog;
int loops = 0;
Timer t;
while ( t.seconds() < 900 ) { // 15 minutes
verify( !Lock::isLocked() );
sleepmillis( 20 );
set<CursorId> now;
ClientCursor::find( cleanup.ns , now );
set<CursorId> left;
for ( set<CursorId>::iterator i=cleanup.initial.begin(); i!=cleanup.initial.end(); ++i ) {
CursorId id = *i;
if ( now.count(id) )
left.insert( id );
}
if ( left.size() == 0 )
break;
cleanup.initial = left;
if ( ( loops++ % 200 ) == 0 ) {
log() << " (looping " << loops << ") waiting to cleanup " << cleanup.ns << " from " << cleanup.min << " -> " << cleanup.max << " # cursors:" << cleanup.initial.size() << migrateLog;
stringstream ss;
for ( set<CursorId>::iterator i=cleanup.initial.begin(); i!=cleanup.initial.end(); ++i ) {
CursorId id = *i;
ss << id << " ";
}
log() << " cursors: " << ss.str() << migrateLog;
}
}
migrateFromStatus.doRemove( cleanup );
cc().shutdown();
}
void cleanupOldData( OldDataCleanup cleanup ) {
try {
_cleanupOldData( cleanup );
}
catch ( std::exception& e ) {
log() << " error cleaning old data:" << e.what() << migrateLog;
}
catch ( ... ) {
log() << " unknown error cleaning old data" << migrateLog;
}
}
void logOpForSharding( const char * opstr , const char * ns , const BSONObj& obj , BSONObj * patt ) {
migrateFromStatus.logOp( opstr , ns , obj , patt );
}
void aboutToDeleteForSharding( const Database* db , const DiskLoc& dl ) {
migrateFromStatus.aboutToDelete( db , dl );
}
class TransferModsCommand : public ChunkCommandHelper {
public:
TransferModsCommand() : ChunkCommandHelper( "_transferMods" ) {}
bool run(const string& , BSONObj& cmdObj, int, string& errmsg, BSONObjBuilder& result, bool) {
return migrateFromStatus.transferMods( errmsg, result );
}
} transferModsCommand;
class InitialCloneCommand : public ChunkCommandHelper {
public:
InitialCloneCommand() : ChunkCommandHelper( "_migrateClone" ) {}
bool run(const string& , BSONObj& cmdObj, int, string& errmsg, BSONObjBuilder& result, bool) {
return migrateFromStatus.clone( errmsg, result );
}
} initialCloneCommand;
/**
* this is the main entry for moveChunk
* called to initial a move
* usually by a mongos
* this is called on the "from" side
*/
class MoveChunkCommand : public Command {
public:
MoveChunkCommand() : Command( "moveChunk" ) {}
virtual void help( stringstream& help ) const {
help << "should not be calling this directly";
}
virtual bool slaveOk() const { return false; }
virtual bool adminOnly() const { return true; }
virtual LockType locktype() const { return NONE; }
bool run(const string& , BSONObj& cmdObj, int, string& errmsg, BSONObjBuilder& result, bool) {
// 1. parse options
// 2. make sure my view is complete and lock
// 3. start migrate
// in a read lock, get all DiskLoc and sort so we can do as little seeking as possible
// tell to start transferring
// 4. pause till migrate caught up
// 5. LOCK
// a) update my config, essentially locking
// b) finish migrate
// c) update config server
// d) logChange to config server
// 6. wait for all current cursors to expire
// 7. remove data locally
// -------------------------------
// 1.
string ns = cmdObj.firstElement().str();
string to = cmdObj["to"].str();
string from = cmdObj["from"].str(); // my public address, a tad redundant, but safe
// fromShard and toShard needed so that 2.2 mongos can interact with either 2.0 or 2.2 mongod
if( cmdObj["fromShard"].type() == String ){
from = cmdObj["fromShard"].String();
}
if( cmdObj["toShard"].type() == String ){
to = cmdObj["toShard"].String();
}
// if we do a w=2 after very write
bool secondaryThrottle = cmdObj["secondaryThrottle"].trueValue();
if ( secondaryThrottle && ! anyReplEnabled() ) {
secondaryThrottle = false;
warning() << "secondaryThrottle selected but no replication" << endl;
}
BSONObj min = cmdObj["min"].Obj();
BSONObj max = cmdObj["max"].Obj();
BSONElement shardId = cmdObj["shardId"];
BSONElement maxSizeElem = cmdObj["maxChunkSizeBytes"];
if ( ns.empty() ) {
errmsg = "need to specify namespace in command";
return false;
}
if ( to.empty() ) {
errmsg = "need to specify shard to move chunk to";
return false;
}
if ( from.empty() ) {
errmsg = "need to specify shard to move chunk from";
return false;
}
if ( min.isEmpty() ) {
errmsg = "need to specify a min";
return false;
}
if ( max.isEmpty() ) {
errmsg = "need to specify a max";
return false;
}
if ( shardId.eoo() ) {
errmsg = "need shardId";
return false;
}
if ( maxSizeElem.eoo() || ! maxSizeElem.isNumber() ) {
errmsg = "need to specify maxChunkSizeBytes";
return false;
}
const long long maxChunkSize = maxSizeElem.numberLong(); // in bytes
if ( ! shardingState.enabled() ) {
if ( cmdObj["configdb"].type() != String ) {
errmsg = "sharding not enabled";
return false;
}
string configdb = cmdObj["configdb"].String();
shardingState.enable( configdb );
configServer.init( configdb );
}
MoveTimingHelper timing( "from" , ns , min , max , 6 /* steps */ , errmsg );
// Make sure we're as up-to-date as possible with shard information
// This catches the case where we had to previously changed a shard's host by
// removing/adding a shard with the same name
Shard::reloadShardInfo();
// So 2.2 mongod can interact with 2.0 mongos, mongod needs to handle either a conn
// string or a shard in the to/from fields. The Shard constructor handles this,
// eventually we should break the compatibility.
Shard fromShard( from );
Shard toShard( to );
log() << "received moveChunk request: " << cmdObj << migrateLog;
timing.done(1);
// 2.
if ( migrateFromStatus.isActive() ) {
errmsg = "migration already in progress";
return false;
}
DistributedLock lockSetup( ConnectionString( shardingState.getConfigServer() , ConnectionString::SYNC ) , ns );
dist_lock_try dlk;
try{
dlk = dist_lock_try( &lockSetup , (string)"migrate-" + min.toString() );
}
catch( LockException& e ){
errmsg = str::stream() << "error locking distributed lock for migration " << "migrate-" << min.toString() << causedBy( e );
return false;
}
if ( ! dlk.got() ) {
errmsg = str::stream() << "the collection metadata could not be locked with lock " << "migrate-" << min.toString();
result.append( "who" , dlk.other() );
return false;
}
BSONObj chunkInfo = BSON("min" << min << "max" << max << "from" << fromShard.getName() << "to" << toShard.getName() );
configServer.logChange( "moveChunk.start" , ns , chunkInfo );
ShardChunkVersion maxVersion;
ShardChunkVersion startingVersion;
string myOldShard;
{
scoped_ptr<ScopedDbConnection> conn(
ScopedDbConnection::getInternalScopedDbConnection(
shardingState.getConfigServer() ) );
BSONObj x;
BSONObj currChunk;
try{
x = conn->get()->findOne( ShardNS::chunk,
Query( BSON( "ns" << ns ) )
.sort( BSON( "lastmod" << -1 ) ) );
currChunk = conn->get()->findOne( ShardNS::chunk , shardId.wrap( "_id" ) );
}
catch( DBException& e ){
errmsg = str::stream() << "aborted moveChunk because could not get chunk data from config server " << shardingState.getConfigServer() << causedBy( e );
warning() << errmsg << endl;
return false;
}
maxVersion = ShardChunkVersion::fromBSON( x, "lastmod" );
verify( currChunk["shard"].type() );
verify( currChunk["min"].type() );
verify( currChunk["max"].type() );
myOldShard = currChunk["shard"].String();
conn->done();
BSONObj currMin = currChunk["min"].Obj();
BSONObj currMax = currChunk["max"].Obj();
if ( currMin.woCompare( min ) || currMax.woCompare( max ) ) {
errmsg = "boundaries are outdated (likely a split occurred)";
result.append( "currMin" , currMin );
result.append( "currMax" , currMax );
result.append( "requestedMin" , min );
result.append( "requestedMax" , max );
warning() << "aborted moveChunk because" << errmsg << ": " << min << "->" << max
<< " is now " << currMin << "->" << currMax << migrateLog;
return false;
}
if ( myOldShard != fromShard.getName() ) {
errmsg = "location is outdated (likely balance or migrate occurred)";
result.append( "from" , fromShard.getName() );
result.append( "official" , myOldShard );
warning() << "aborted moveChunk because " << errmsg << ": chunk is at " << myOldShard
<< " and not at " << fromShard.getName() << migrateLog;
return false;
}
if ( maxVersion < shardingState.getVersion( ns ) ) {
errmsg = "official version less than mine?";
maxVersion.addToBSON( result, "officialVersion" );
shardingState.getVersion( ns ).addToBSON( result, "myVersion" );
warning() << "aborted moveChunk because " << errmsg << ": official " << maxVersion
<< " mine: " << shardingState.getVersion(ns) << migrateLog;
return false;
}
// since this could be the first call that enable sharding we also make sure to have the chunk manager up to date
shardingState.gotShardName( myOldShard );
// Using the maxVersion we just found will enforce a check - if we use zero version,
// it's possible this shard will be *at* zero version from a previous migrate and
// no refresh will be done
// TODO: Make this less fragile
startingVersion = maxVersion;
shardingState.trySetVersion( ns , startingVersion /* will return updated */ );
log() << "moveChunk request accepted at version " << startingVersion << migrateLog;
}
timing.done(2);
// 3.
ShardChunkManagerPtr chunkManager = shardingState.getShardChunkManager( ns );
verify( chunkManager != NULL );
BSONObj shardKeyPattern = chunkManager->getKey();
if ( shardKeyPattern.isEmpty() ){
errmsg = "no shard key found";
return false;