/
index_catalog_impl.cpp
1514 lines (1283 loc) · 59.9 KB
/
index_catalog_impl.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
/**
* Copyright (C) 2018-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* 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
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* 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 Server Side 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.
*/
#define MONGO_LOG_DEFAULT_COMPONENT ::mongo::logger::LogComponent::kIndex
#include "mongo/platform/basic.h"
#include "mongo/db/catalog/index_catalog_impl.h"
#include <vector>
#include "mongo/base/init.h"
#include "mongo/bson/simple_bsonelement_comparator.h"
#include "mongo/bson/simple_bsonobj_comparator.h"
#include "mongo/db/audit.h"
#include "mongo/db/background.h"
#include "mongo/db/catalog/collection.h"
#include "mongo/db/catalog/collection_catalog_entry.h"
#include "mongo/db/catalog/database_catalog_entry.h"
#include "mongo/db/catalog/index_catalog_entry_impl.h"
#include "mongo/db/catalog/index_key_validate.h"
#include "mongo/db/client.h"
#include "mongo/db/clientcursor.h"
#include "mongo/db/curop.h"
#include "mongo/db/field_ref.h"
#include "mongo/db/index/index_access_method.h"
#include "mongo/db/index/index_descriptor.h"
#include "mongo/db/index_legacy.h"
#include "mongo/db/index_names.h"
#include "mongo/db/jsobj.h"
#include "mongo/db/keypattern.h"
#include "mongo/db/logical_clock.h"
#include "mongo/db/matcher/expression.h"
#include "mongo/db/operation_context.h"
#include "mongo/db/ops/delete.h"
#include "mongo/db/query/collation/collation_spec.h"
#include "mongo/db/query/collation/collator_factory_interface.h"
#include "mongo/db/query/internal_plans.h"
#include "mongo/db/repl/replication_coordinator.h"
#include "mongo/db/server_options.h"
#include "mongo/db/service_context.h"
#include "mongo/db/storage/storage_engine_init.h"
#include "mongo/util/assert_util.h"
#include "mongo/util/log.h"
#include "mongo/util/mongoutils/str.h"
#include "mongo/util/represent_as.h"
namespace mongo {
using std::endl;
using std::string;
using std::unique_ptr;
using std::vector;
using IndexVersion = IndexDescriptor::IndexVersion;
static const int INDEX_CATALOG_INIT = 283711;
static const int INDEX_CATALOG_UNINIT = 654321;
const BSONObj IndexCatalogImpl::_idObj = BSON("_id" << 1);
// -------------
IndexCatalogImpl::IndexCatalogImpl(Collection* collection, int maxNumIndexesAllowed)
: _magic(INDEX_CATALOG_UNINIT),
_collection(collection),
_maxNumIndexesAllowed(maxNumIndexesAllowed) {}
IndexCatalogImpl::~IndexCatalogImpl() {
if (_magic != INDEX_CATALOG_UNINIT) {
// only do this check if we haven't been initialized
_checkMagic();
}
_magic = 123456;
}
Status IndexCatalogImpl::init(OperationContext* opCtx) {
vector<string> indexNames;
_collection->getCatalogEntry()->getAllIndexes(opCtx, &indexNames);
for (size_t i = 0; i < indexNames.size(); i++) {
const string& indexName = indexNames[i];
BSONObj spec = _collection->getCatalogEntry()->getIndexSpec(opCtx, indexName).getOwned();
if (!_collection->getCatalogEntry()->isIndexReady(opCtx, indexName)) {
_unfinishedIndexes.push_back(spec);
continue;
}
BSONObj keyPattern = spec.getObjectField("key");
auto descriptor =
stdx::make_unique<IndexDescriptor>(_collection, _getAccessMethodName(keyPattern), spec);
const bool initFromDisk = true;
const bool isReadyIndex = true;
IndexCatalogEntry* entry =
_setupInMemoryStructures(opCtx, std::move(descriptor), initFromDisk, isReadyIndex);
fassert(17340, entry->isReady(opCtx));
}
if (_unfinishedIndexes.size()) {
// if there are left over indexes, we don't let anyone add/drop indexes
// until someone goes and fixes them
log() << "found " << _unfinishedIndexes.size()
<< " index(es) that wasn't finished before shutdown";
}
_magic = INDEX_CATALOG_INIT;
return Status::OK();
}
IndexCatalogEntry* IndexCatalogImpl::_setupInMemoryStructures(
OperationContext* opCtx,
std::unique_ptr<IndexDescriptor> descriptor,
bool initFromDisk,
bool isReadyIndex) {
Status status = _isSpecOk(opCtx, descriptor->infoObj());
if (!status.isOK() && status != ErrorCodes::IndexAlreadyExists) {
severe() << "Found an invalid index " << descriptor->infoObj() << " on the "
<< _collection->ns() << " collection: " << redact(status);
fassertFailedNoTrace(28782);
}
auto* const descriptorPtr = descriptor.get();
auto entry = std::make_shared<IndexCatalogEntryImpl>(opCtx,
_collection->ns().ns(),
_collection->getCatalogEntry(),
std::move(descriptor),
_collection->infoCache());
std::unique_ptr<IndexAccessMethod> accessMethod(
_collection->dbce()->getIndex(opCtx, _collection->getCatalogEntry(), entry.get()));
entry->init(std::move(accessMethod));
IndexCatalogEntry* save = entry.get();
if (isReadyIndex) {
_readyIndexes.add(std::move(entry));
} else {
_buildingIndexes.add(std::move(entry));
}
if (!initFromDisk) {
opCtx->recoveryUnit()->onRollback(
[ this, opCtx, isReadyIndex, descriptor = descriptorPtr ] {
// Need to preserve indexName as descriptor no longer exists after remove().
const std::string indexName = descriptor->indexName();
if (isReadyIndex) {
_readyIndexes.remove(descriptor);
} else {
_buildingIndexes.remove(descriptor);
}
_collection->infoCache()->droppedIndex(opCtx, indexName);
});
}
return save;
}
bool IndexCatalogImpl::ok() const {
return (_magic == INDEX_CATALOG_INIT);
}
void IndexCatalogImpl::_checkMagic() const {
if (ok()) {
return;
}
log() << "IndexCatalog::_magic wrong, is : " << _magic;
fassertFailed(17198);
}
Status IndexCatalogImpl::checkUnfinished() const {
if (_unfinishedIndexes.size() == 0)
return Status::OK();
return Status(ErrorCodes::InternalError,
str::stream() << "IndexCatalog has left over indexes that must be cleared"
<< " ns: "
<< _collection->ns());
}
std::unique_ptr<IndexCatalog::IndexIterator> IndexCatalogImpl::getIndexIterator(
OperationContext* const opCtx, const bool includeUnfinishedIndexes) const {
if (!includeUnfinishedIndexes) {
// If the caller only wants the ready indexes, we return an iterator over the catalog's
// ready indexes vector. When the user advances this iterator, it will filter out any
// indexes that were not ready at the OperationContext's read timestamp.
return std::make_unique<ReadyIndexesIterator>(
opCtx, _readyIndexes.begin(), _readyIndexes.end());
}
// If the caller wants all indexes, for simplicity of implementation, we copy the pointers to
// a new vector. The vector's ownership is passed to the iterator. The query code path from an
// external client is not expected to hit this case so the cost isn't paid by the important
// code path.
auto allIndexes = std::make_unique<std::vector<IndexCatalogEntry*>>();
for (auto it = _readyIndexes.begin(); it != _readyIndexes.end(); ++it) {
allIndexes->push_back(it->get());
}
for (auto it = _buildingIndexes.begin(); it != _buildingIndexes.end(); ++it) {
allIndexes->push_back(it->get());
}
return std::make_unique<AllIndexesIterator>(opCtx, std::move(allIndexes));
}
string IndexCatalogImpl::_getAccessMethodName(const BSONObj& keyPattern) const {
string pluginName = IndexNames::findPluginName(keyPattern);
// This assert will be triggered when downgrading from a future version that
// supports an index plugin unsupported by this version.
uassert(17197,
str::stream() << "Invalid index type '" << pluginName << "' "
<< "in index "
<< keyPattern,
IndexNames::isKnownName(pluginName));
return pluginName;
}
// ---------------------------
StatusWith<BSONObj> IndexCatalogImpl::prepareSpecForCreate(OperationContext* opCtx,
const BSONObj& original) const {
Status status = _isSpecOk(opCtx, original);
if (!status.isOK())
return StatusWith<BSONObj>(status);
auto fixed = _fixIndexSpec(opCtx, _collection, original);
if (!fixed.isOK()) {
return fixed;
}
// we double check with new index spec
status = _isSpecOk(opCtx, fixed.getValue());
if (!status.isOK())
return StatusWith<BSONObj>(status);
status = _doesSpecConflictWithExisting(opCtx, fixed.getValue());
if (!status.isOK())
return StatusWith<BSONObj>(status);
return fixed;
}
std::vector<BSONObj> IndexCatalogImpl::removeExistingIndexes(
OperationContext* const opCtx,
const std::vector<BSONObj>& indexSpecsToBuild,
bool throwOnErrors) const {
std::vector<BSONObj> result;
for (const auto& spec : indexSpecsToBuild) {
auto prepareResult = prepareSpecForCreate(opCtx, spec);
if (prepareResult == ErrorCodes::IndexAlreadyExists) {
continue;
}
// Intentionally ignoring other error codes unless 'throwOnErrors' is true.
if (throwOnErrors) {
uassertStatusOK(prepareResult);
}
result.push_back(spec);
}
return result;
}
StatusWith<BSONObj> IndexCatalogImpl::createIndexOnEmptyCollection(OperationContext* opCtx,
BSONObj spec) {
invariant(opCtx->lockState()->isCollectionLockedForMode(_collection->ns().toString(), MODE_X));
invariant(_collection->numRecords(opCtx) == 0,
str::stream() << "Collection must be empty. Collection: " << _collection->ns()
<< " UUID: "
<< _collection->uuid()
<< " Count: "
<< _collection->numRecords(opCtx));
_checkMagic();
Status status = checkUnfinished();
if (!status.isOK())
return status;
StatusWith<BSONObj> statusWithSpec = prepareSpecForCreate(opCtx, spec);
status = statusWithSpec.getStatus();
if (!status.isOK())
return status;
spec = statusWithSpec.getValue();
// now going to touch disk
IndexBuildBlock indexBuildBlock(opCtx, _collection, this, spec, IndexBuildMethod::kForeground);
status = indexBuildBlock.init();
if (!status.isOK())
return status;
// sanity checks, etc...
IndexCatalogEntry* entry = indexBuildBlock.getEntry();
invariant(entry);
IndexDescriptor* descriptor = entry->descriptor();
invariant(descriptor);
invariant(entry == _buildingIndexes.find(descriptor));
status = entry->accessMethod()->initializeAsEmpty(opCtx);
if (!status.isOK())
return status;
indexBuildBlock.success();
// sanity check
invariant(_collection->getCatalogEntry()->isIndexReady(opCtx, descriptor->indexName()));
return spec;
}
namespace {
// While technically recursive, only current possible with 2 levels.
Status _checkValidFilterExpressions(MatchExpression* expression, int level = 0) {
if (!expression)
return Status::OK();
switch (expression->matchType()) {
case MatchExpression::AND:
if (level > 0)
return Status(ErrorCodes::CannotCreateIndex,
"$and only supported in partialFilterExpression at top level");
for (size_t i = 0; i < expression->numChildren(); i++) {
Status status = _checkValidFilterExpressions(expression->getChild(i), level + 1);
if (!status.isOK())
return status;
}
return Status::OK();
case MatchExpression::EQ:
case MatchExpression::LT:
case MatchExpression::LTE:
case MatchExpression::GT:
case MatchExpression::GTE:
case MatchExpression::EXISTS:
case MatchExpression::TYPE_OPERATOR:
return Status::OK();
default:
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "unsupported expression in partial index: "
<< expression->toString());
}
}
} // namespace
Status IndexCatalogImpl::_isSpecOk(OperationContext* opCtx, const BSONObj& spec) const {
const NamespaceString& nss = _collection->ns();
BSONElement vElt = spec["v"];
if (!vElt) {
return {ErrorCodes::InternalError,
str::stream()
<< "An internal operation failed to specify the 'v' field, which is a required "
"property of an index specification: "
<< spec};
}
if (!vElt.isNumber()) {
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "non-numeric value for \"v\" field: " << vElt);
}
auto vEltAsInt = representAs<int>(vElt.number());
if (!vEltAsInt) {
return {ErrorCodes::CannotCreateIndex,
str::stream() << "Index version must be representable as a 32-bit integer, but got "
<< vElt.toString(false, false)};
}
auto indexVersion = static_cast<IndexVersion>(*vEltAsInt);
if (indexVersion >= IndexVersion::kV2) {
auto status = index_key_validate::validateIndexSpecFieldNames(spec);
if (!status.isOK()) {
return status;
}
}
if (!IndexDescriptor::isIndexVersionSupported(indexVersion)) {
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "this version of mongod cannot build new indexes "
<< "of version number "
<< static_cast<int>(indexVersion));
}
if (nss.isOplog())
return Status(ErrorCodes::CannotCreateIndex, "cannot have an index on the oplog");
if (nss.coll() == "$freelist") {
// this isn't really proper, but we never want it and its not an error per se
return Status(ErrorCodes::IndexAlreadyExists, "cannot index freelist");
}
const BSONElement specNamespace = spec["ns"];
if (specNamespace.type() != String)
return Status(ErrorCodes::CannotCreateIndex,
"the index spec is missing a \"ns\" string field");
if (nss.ns() != specNamespace.valueStringData())
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "the \"ns\" field of the index spec '"
<< specNamespace.valueStringData()
<< "' does not match the collection name '"
<< nss
<< "'");
// logical name of the index
const BSONElement nameElem = spec["name"];
if (nameElem.type() != String)
return Status(ErrorCodes::CannotCreateIndex, "index name must be specified as a string");
const StringData name = nameElem.valueStringData();
if (name.find('\0') != std::string::npos)
return Status(ErrorCodes::CannotCreateIndex, "index name cannot contain NUL bytes");
if (name.empty())
return Status(ErrorCodes::CannotCreateIndex, "index name cannot be empty");
// Drop pending collections are internal to the server and will not be exported to another
// storage engine. The indexes contained in these collections are not subject to the same
// namespace length constraints as the ones in created by users.
//
// Index names do not limit the maximum allowable length of the target namespace under FCV 4.2
// and above.
const auto checkIndexNamespace =
serverGlobalParams.featureCompatibility.isVersionInitialized() &&
serverGlobalParams.featureCompatibility.getVersion() !=
ServerGlobalParams::FeatureCompatibility::Version::kFullyUpgradedTo42;
if (checkIndexNamespace && !nss.isDropPendingNamespace()) {
auto indexNamespace = nss.makeIndexNamespace(name);
if (indexNamespace.size() > NamespaceString::MaxNsLen)
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "namespace name generated from index name \""
<< indexNamespace
<< "\" is too long (127 byte max)");
}
const BSONObj key = spec.getObjectField("key");
const Status keyStatus = index_key_validate::validateKeyPattern(key, indexVersion);
if (!keyStatus.isOK()) {
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "bad index key pattern " << key << ": "
<< keyStatus.reason());
}
const string pluginName = IndexNames::findPluginName(key);
std::unique_ptr<CollatorInterface> collator;
BSONElement collationElement = spec.getField("collation");
if (collationElement) {
if (collationElement.type() != BSONType::Object) {
return Status(ErrorCodes::CannotCreateIndex,
"\"collation\" for an index must be a document");
}
auto statusWithCollator = CollatorFactoryInterface::get(opCtx->getServiceContext())
->makeFromBSON(collationElement.Obj());
if (!statusWithCollator.isOK()) {
return statusWithCollator.getStatus();
}
collator = std::move(statusWithCollator.getValue());
if (!collator) {
return {ErrorCodes::InternalError,
str::stream() << "An internal operation specified the collation "
<< CollationSpec::kSimpleSpec
<< " explicitly, which should instead be implied by omitting the "
"'collation' field from the index specification"};
}
if (static_cast<IndexVersion>(vElt.numberInt()) < IndexVersion::kV2) {
return {ErrorCodes::CannotCreateIndex,
str::stream() << "Index version " << vElt.fieldNameStringData() << "="
<< vElt.numberInt()
<< " does not support the '"
<< collationElement.fieldNameStringData()
<< "' option"};
}
if ((pluginName != IndexNames::BTREE) && (pluginName != IndexNames::GEO_2DSPHERE) &&
(pluginName != IndexNames::HASHED) && (pluginName != IndexNames::WILDCARD)) {
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "Index type '" << pluginName
<< "' does not support collation: "
<< collator->getSpec().toBSON());
}
}
const bool isSparse = spec["sparse"].trueValue();
if (pluginName == IndexNames::WILDCARD) {
if (isSparse) {
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "Index type '" << pluginName
<< "' does not support the sparse option");
}
if (spec["unique"].trueValue()) {
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "Index type '" << pluginName
<< "' does not support the unique option");
}
if (spec.getField("expireAfterSeconds")) {
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "Index type '" << pluginName
<< "' cannot be a TTL index");
}
}
// Ensure if there is a filter, its valid.
BSONElement filterElement = spec.getField("partialFilterExpression");
if (filterElement) {
if (isSparse) {
return Status(ErrorCodes::CannotCreateIndex,
"cannot mix \"partialFilterExpression\" and \"sparse\" options");
}
if (filterElement.type() != Object) {
return Status(ErrorCodes::CannotCreateIndex,
"\"partialFilterExpression\" for an index must be a document");
}
// The collator must outlive the constructed MatchExpression.
boost::intrusive_ptr<ExpressionContext> expCtx(
new ExpressionContext(opCtx, collator.get()));
// Parsing the partial filter expression is not expected to fail here since the
// expression would have been successfully parsed upstream during index creation.
StatusWithMatchExpression statusWithMatcher =
MatchExpressionParser::parse(filterElement.Obj(),
std::move(expCtx),
ExtensionsCallbackNoop(),
MatchExpressionParser::kBanAllSpecialFeatures);
if (!statusWithMatcher.isOK()) {
return statusWithMatcher.getStatus();
}
const std::unique_ptr<MatchExpression> filterExpr = std::move(statusWithMatcher.getValue());
Status status = _checkValidFilterExpressions(filterExpr.get());
if (!status.isOK()) {
return status;
}
}
if (IndexDescriptor::isIdIndexPattern(key)) {
BSONElement uniqueElt = spec["unique"];
if (uniqueElt && !uniqueElt.trueValue()) {
return Status(ErrorCodes::CannotCreateIndex, "_id index cannot be non-unique");
}
if (filterElement) {
return Status(ErrorCodes::CannotCreateIndex, "_id index cannot be a partial index");
}
if (isSparse) {
return Status(ErrorCodes::CannotCreateIndex, "_id index cannot be sparse");
}
if (collationElement &&
!CollatorInterface::collatorsMatch(collator.get(), _collection->getDefaultCollator())) {
return Status(ErrorCodes::CannotCreateIndex,
"_id index must have the collection default collation");
}
} else {
// for non _id indexes, we check to see if replication has turned off all indexes
// we _always_ created _id index
if (!repl::ReplicationCoordinator::get(opCtx)->buildsIndexes()) {
// this is not exactly the right error code, but I think will make the most sense
return Status(ErrorCodes::IndexAlreadyExists, "no indexes per repl");
}
}
// --- only storage engine checks allowed below this ----
BSONElement storageEngineElement = spec.getField("storageEngine");
if (storageEngineElement.eoo()) {
return Status::OK();
}
if (storageEngineElement.type() != mongo::Object) {
return Status(ErrorCodes::CannotCreateIndex,
"\"storageEngine\" options must be a document if present");
}
BSONObj storageEngineOptions = storageEngineElement.Obj();
if (storageEngineOptions.isEmpty()) {
return Status(ErrorCodes::CannotCreateIndex,
"Empty \"storageEngine\" options are invalid. "
"Please remove the field or include valid options.");
}
Status storageEngineStatus = validateStorageOptions(
opCtx->getServiceContext(), storageEngineOptions, [](const auto& x, const auto& y) {
return x->validateIndexStorageOptions(y);
});
if (!storageEngineStatus.isOK()) {
return storageEngineStatus;
}
return Status::OK();
}
Status IndexCatalogImpl::_doesSpecConflictWithExisting(OperationContext* opCtx,
const BSONObj& spec) const {
const char* name = spec.getStringField("name");
invariant(name[0]);
const BSONObj key = spec.getObjectField("key");
const BSONObj collation = spec.getObjectField("collation");
{
// Check both existing and in-progress indexes (2nd param = true)
const IndexDescriptor* desc = findIndexByName(opCtx, name, true);
if (desc) {
// index already exists with same name
if (SimpleBSONObjComparator::kInstance.evaluate(desc->keyPattern() == key) &&
SimpleBSONObjComparator::kInstance.evaluate(
desc->infoObj().getObjectField("collation") != collation)) {
// key patterns are equal but collations differ.
return Status(ErrorCodes::IndexOptionsConflict,
str::stream()
<< "An index with the same key pattern, but a different "
<< "collation already exists with the same name. Try again with "
<< "a unique name. "
<< "Existing index: "
<< desc->infoObj()
<< " Requested index: "
<< spec);
}
if (SimpleBSONObjComparator::kInstance.evaluate(desc->keyPattern() != key) ||
SimpleBSONObjComparator::kInstance.evaluate(
desc->infoObj().getObjectField("collation") != collation)) {
return Status(ErrorCodes::IndexKeySpecsConflict,
str::stream() << "Index must have unique name."
<< "The existing index: "
<< desc->infoObj()
<< " has the same name as the requested index: "
<< spec);
}
IndexDescriptor temp(_collection, _getAccessMethodName(key), spec);
if (!desc->areIndexOptionsEquivalent(&temp))
return Status(ErrorCodes::IndexOptionsConflict,
str::stream() << "Index with name: " << name
<< " already exists with different options");
// Index already exists with the same options, so no need to build a new
// one (not an error). Most likely requested by a client using ensureIndex.
return Status(ErrorCodes::IndexAlreadyExists,
str::stream() << "Identical index already exists: " << name);
}
}
{
// Check both existing and in-progress indexes.
const bool findInProgressIndexes = true;
const IndexDescriptor* desc =
findIndexByKeyPatternAndCollationSpec(opCtx, key, collation, findInProgressIndexes);
if (desc) {
LOG(2) << "index already exists with diff name " << name << " pattern: " << key
<< " collation: " << collation;
IndexDescriptor temp(_collection, _getAccessMethodName(key), spec);
if (!desc->areIndexOptionsEquivalent(&temp))
return Status(ErrorCodes::IndexOptionsConflict,
str::stream() << "Index: " << spec
<< " already exists with different options: "
<< desc->infoObj());
return Status(ErrorCodes::IndexAlreadyExists,
str::stream() << "index already exists with different name: " << name);
}
}
if (numIndexesTotal(opCtx) >= _maxNumIndexesAllowed) {
string s = str::stream() << "add index fails, too many indexes for " << _collection->ns()
<< " key:" << key;
log() << s;
return Status(ErrorCodes::CannotCreateIndex, s);
}
// Refuse to build text index if another text index exists or is in progress.
// Collections should only have one text index.
string pluginName = IndexNames::findPluginName(key);
if (pluginName == IndexNames::TEXT) {
vector<const IndexDescriptor*> textIndexes;
const bool includeUnfinishedIndexes = true;
findIndexByType(opCtx, IndexNames::TEXT, textIndexes, includeUnfinishedIndexes);
if (textIndexes.size() > 0) {
return Status(ErrorCodes::CannotCreateIndex,
str::stream() << "only one text index per collection allowed, "
<< "found existing text index \""
<< textIndexes[0]->indexName()
<< "\"");
}
}
return Status::OK();
}
BSONObj IndexCatalogImpl::getDefaultIdIndexSpec() const {
dassert(_idObj["_id"].type() == NumberInt);
const auto indexVersion = IndexDescriptor::getDefaultIndexVersion();
BSONObjBuilder b;
b.append("v", static_cast<int>(indexVersion));
b.append("name", "_id_");
b.append("ns", _collection->ns().ns());
b.append("key", _idObj);
if (_collection->getDefaultCollator() && indexVersion >= IndexVersion::kV2) {
// Creating an index with the "collation" option requires a v=2 index.
b.append("collation", _collection->getDefaultCollator()->getSpec().toBSON());
}
return b.obj();
}
void IndexCatalogImpl::dropAllIndexes(OperationContext* opCtx,
bool includingIdIndex,
stdx::function<void(const IndexDescriptor*)> onDropFn) {
invariant(opCtx->lockState()->isCollectionLockedForMode(_collection->ns().toString(), MODE_X));
BackgroundOperation::assertNoBgOpInProgForNs(_collection->ns().ns());
// make sure nothing in progress
massert(17348,
"cannot dropAllIndexes when index builds in progress",
numIndexesTotal(opCtx) == numIndexesReady(opCtx));
bool haveIdIndex = false;
invariant(_buildingIndexes.size() == 0);
vector<string> indexNamesToDrop;
{
int seen = 0;
std::unique_ptr<IndexIterator> ii = getIndexIterator(opCtx, true);
while (ii->more()) {
seen++;
const IndexDescriptor* desc = ii->next()->descriptor();
if (desc->isIdIndex() && includingIdIndex == false) {
haveIdIndex = true;
continue;
}
indexNamesToDrop.push_back(desc->indexName());
}
invariant(seen == numIndexesTotal(opCtx));
}
for (size_t i = 0; i < indexNamesToDrop.size(); i++) {
string indexName = indexNamesToDrop[i];
const IndexDescriptor* desc = findIndexByName(opCtx, indexName, true);
invariant(desc);
LOG(1) << "\t dropAllIndexes dropping: " << desc->toString();
IndexCatalogEntry* entry = _readyIndexes.find(desc);
invariant(entry);
// If the onDrop function creates an oplog entry, it should run first so that the drop is
// timestamped at the same optime.
if (onDropFn) {
onDropFn(desc);
}
invariant(_dropIndex(opCtx, entry).isOK());
}
// verify state is sane post cleaning
long long numIndexesInCollectionCatalogEntry =
_collection->getCatalogEntry()->getTotalIndexCount(opCtx);
if (haveIdIndex) {
fassert(17324, numIndexesTotal(opCtx) == 1);
fassert(17325, numIndexesReady(opCtx) == 1);
fassert(17326, numIndexesInCollectionCatalogEntry == 1);
fassert(17336, _readyIndexes.size() == 1);
} else {
if (numIndexesTotal(opCtx) || numIndexesInCollectionCatalogEntry || _readyIndexes.size()) {
error() << "About to fassert - "
<< " numIndexesTotal(): " << numIndexesTotal(opCtx)
<< " numSystemIndexesEntries: " << numIndexesInCollectionCatalogEntry
<< " _readyIndexes.size(): " << _readyIndexes.size()
<< " indexNamesToDrop: " << indexNamesToDrop.size()
<< " haveIdIndex: " << haveIdIndex;
}
fassert(17327, numIndexesTotal(opCtx) == 0);
fassert(17328, numIndexesInCollectionCatalogEntry == 0);
fassert(17337, _readyIndexes.size() == 0);
}
}
void IndexCatalogImpl::dropAllIndexes(OperationContext* opCtx, bool includingIdIndex) {
dropAllIndexes(opCtx, includingIdIndex, {});
}
Status IndexCatalogImpl::dropIndex(OperationContext* opCtx, const IndexDescriptor* desc) {
invariant(opCtx->lockState()->isCollectionLockedForMode(_collection->ns().toString(), MODE_X));
BackgroundOperation::assertNoBgOpInProgForNs(_collection->ns().ns());
invariant(_buildingIndexes.size() == 0);
IndexCatalogEntry* entry = _readyIndexes.find(desc);
if (!entry)
return Status(ErrorCodes::InternalError, "cannot find index to delete");
if (!entry->isReady(opCtx))
return Status(ErrorCodes::InternalError, "cannot delete not ready index");
return _dropIndex(opCtx, entry);
}
namespace {
class IndexRemoveChange final : public RecoveryUnit::Change {
public:
IndexRemoveChange(OperationContext* opCtx,
Collection* collection,
IndexCatalogEntryContainer* entries,
std::shared_ptr<IndexCatalogEntry> entry)
: _opCtx(opCtx), _collection(collection), _entries(entries), _entry(std::move(entry)) {}
void commit(boost::optional<Timestamp> commitTime) final {
// Ban reading from this collection on committed reads on snapshots before now.
if (!commitTime) {
// This is called when we refresh the index catalog entry, which does not always have
// a commit timestamp. We use the cluster time since it's guaranteed to be greater
// than the time of the index removal. It is possible the cluster time could be in the
// future, and we will need to do another write to reach the minimum visible snapshot.
commitTime = LogicalClock::getClusterTimeForReplicaSet(_opCtx).asTimestamp();
}
_collection->setMinimumVisibleSnapshot(commitTime.get());
}
void rollback() final {
_collection->infoCache()->addedIndex(_opCtx, _entry->descriptor());
_entries->add(std::move(_entry));
}
private:
OperationContext* _opCtx;
Collection* _collection;
IndexCatalogEntryContainer* _entries;
std::shared_ptr<IndexCatalogEntry> _entry;
};
} // namespace
Status IndexCatalogImpl::_dropIndex(OperationContext* opCtx, IndexCatalogEntry* entry) {
// ----- SANITY CHECKS -------------
if (!entry)
return Status(ErrorCodes::BadValue, "IndexCatalog::_dropIndex passed NULL");
_checkMagic();
Status status = checkUnfinished();
if (!status.isOK())
return status;
// Pulling indexName/indexNamespace out as they are needed post descriptor release.
string indexName = entry->descriptor()->indexName();
string indexNamespace = entry->descriptor()->indexNamespace();
// --------- START REAL WORK ----------
audit::logDropIndex(&cc(), indexName, _collection->ns().ns());
auto released = _readyIndexes.release(entry->descriptor());
if (released) {
invariant(released.get() == entry);
opCtx->recoveryUnit()->registerChange(
new IndexRemoveChange(opCtx, _collection, &_readyIndexes, std::move(released)));
} else {
released = _buildingIndexes.release(entry->descriptor());
invariant(released.get() == entry);
opCtx->recoveryUnit()->registerChange(
new IndexRemoveChange(opCtx, _collection, &_buildingIndexes, std::move(released)));
}
_collection->infoCache()->droppedIndex(opCtx, indexName);
entry = nullptr;
_deleteIndexFromDisk(opCtx, indexName, indexNamespace);
_checkMagic();
return Status::OK();
}
void IndexCatalogImpl::_deleteIndexFromDisk(OperationContext* opCtx,
const string& indexName,
const string& indexNamespace) {
Status status = _collection->getCatalogEntry()->removeIndex(opCtx, indexName);
if (status.code() == ErrorCodes::NamespaceNotFound) {
// this is ok, as we may be partially through index creation
} else if (!status.isOK()) {
warning() << "couldn't drop index " << indexName << " on collection: " << _collection->ns()
<< " because of " << redact(status);
}
}
vector<BSONObj> IndexCatalogImpl::getAndClearUnfinishedIndexes(OperationContext* opCtx) {
vector<BSONObj> toReturn = _unfinishedIndexes;
_unfinishedIndexes.clear();
for (size_t i = 0; i < toReturn.size(); i++) {
BSONObj spec = toReturn[i];
BSONObj keyPattern = spec.getObjectField("key");
IndexDescriptor desc(_collection, _getAccessMethodName(keyPattern), spec);
_deleteIndexFromDisk(opCtx, desc.indexName(), desc.indexNamespace());
}
return toReturn;
}
bool IndexCatalogImpl::isMultikey(OperationContext* opCtx, const IndexDescriptor* idx) {
IndexCatalogEntry* entry = _readyIndexes.find(idx);
invariant(entry);
return entry->isMultikey(opCtx);
}
MultikeyPaths IndexCatalogImpl::getMultikeyPaths(OperationContext* opCtx,
const IndexDescriptor* idx) {
IndexCatalogEntry* entry = _readyIndexes.find(idx);
invariant(entry);
return entry->getMultikeyPaths(opCtx);
}
void IndexCatalogImpl::setMultikeyPaths(OperationContext* const opCtx,
const IndexDescriptor* desc,
const MultikeyPaths& multikeyPaths) {
IndexCatalogEntry* entry = _readyIndexes.find(desc);
if (!entry) {
entry = _buildingIndexes.find(desc);
}
invariant(entry);
entry->setMultikey(opCtx, multikeyPaths);
};
// ---------------------------
bool IndexCatalogImpl::haveAnyIndexes() const {
return _readyIndexes.size() > 0 || _buildingIndexes.size() > 0;
}
int IndexCatalogImpl::numIndexesTotal(OperationContext* opCtx) const {
int count = _readyIndexes.size() + _buildingIndexes.size() + _unfinishedIndexes.size();
dassert(_collection->getCatalogEntry()->getTotalIndexCount(opCtx) == count);
return count;
}
int IndexCatalogImpl::numIndexesReady(OperationContext* opCtx) const {
std::vector<const IndexDescriptor*> itIndexes;
std::unique_ptr<IndexIterator> ii = getIndexIterator(opCtx, /*includeUnfinished*/ false);
while (ii->more()) {
itIndexes.push_back(ii->next()->descriptor());
}
DEV {
std::vector<std::string> completedIndexes;
_collection->getCatalogEntry()->getReadyIndexes(opCtx, &completedIndexes);
// There is a potential inconistency where the index information in the collection catalog
// entry and the index catalog differ. Log as much information as possible here.
if (itIndexes.size() != completedIndexes.size()) {
log() << "index catalog reports: ";
for (const IndexDescriptor* i : itIndexes) {
log() << " index: " << i->toString();
}
log() << "collection catalog reports: ";
for (auto const& i : completedIndexes) {
log() << " index: " << i;
}
invariant(itIndexes.size() == completedIndexes.size(),
"The number of ready indexes reported in the collection metadata catalog did "
"not match the number of ready indexes reported by the index catalog.");
}
}
return itIndexes.size();
}
bool IndexCatalogImpl::haveIdIndex(OperationContext* opCtx) const {
return findIdIndex(opCtx) != nullptr;
}
const IndexDescriptor* IndexCatalogImpl::findIdIndex(OperationContext* opCtx) const {
std::unique_ptr<IndexIterator> ii = getIndexIterator(opCtx, false);