summaryrefslogtreecommitdiff
path: root/src/mongo/db/commands/rename_collection.cpp
diff options
context:
space:
mode:
authorEliot Horowitz <eliot@10gen.com>2014-08-25 17:25:39 -0400
committerEliot Horowitz <eliot@10gen.com>2014-08-25 18:08:37 -0400
commitf0bb5123f50bb617eb9499539f01779c6e9f5e95 (patch)
tree98cc4abf3c89881691158345435523c5dd6ae37f /src/mongo/db/commands/rename_collection.cpp
parentcb3f5cfa43d9565675d2f36c4b0f7cecbad47a49 (diff)
downloadmongo-f0bb5123f50bb617eb9499539f01779c6e9f5e95.tar.gz
SERVER-13635: OperationContext on read paths
Diffstat (limited to 'src/mongo/db/commands/rename_collection.cpp')
-rw-r--r--src/mongo/db/commands/rename_collection.cpp6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/mongo/db/commands/rename_collection.cpp b/src/mongo/db/commands/rename_collection.cpp
index 872f115377c..0eb4555ad0e 100644
--- a/src/mongo/db/commands/rename_collection.cpp
+++ b/src/mongo/db/commands/rename_collection.cpp
@@ -152,7 +152,7 @@ namespace mongo {
// Ensure that index names do not push the length over the max.
// Iterator includes unfinished indexes.
IndexCatalog::IndexIterator sourceIndIt =
- sourceColl->getIndexCatalog()->getIndexIterator( true );
+ sourceColl->getIndexCatalog()->getIndexIterator( txn, true );
int longestIndexNameLength = 0;
while ( sourceIndIt.more() ) {
int thisLength = sourceIndIt.next()->indexName().length();
@@ -257,7 +257,7 @@ namespace mongo {
{
std::vector<BSONObj> indexesToCopy;
IndexCatalog::IndexIterator sourceIndIt =
- sourceColl->getIndexCatalog()->getIndexIterator( true );
+ sourceColl->getIndexCatalog()->getIndexIterator( txn, true );
while (sourceIndIt.more()) {
const BSONObj currIndex = sourceIndIt.next()->infoObj();
@@ -275,7 +275,7 @@ namespace mongo {
while (!sourceIt->isEOF()) {
txn->checkForInterrupt(false);
- const BSONObj obj = sourceColl->docFor(sourceIt->getNext());
+ const BSONObj obj = sourceColl->docFor(txn, sourceIt->getNext());
WriteUnitOfWork wunit(txn);
// No logOp necessary because the entire renameCollection command is one logOp.