/** * 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 * . * * 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. */ #include "mongo/db/exec/count_scan.h" #include "mongo/db/catalog/index_catalog.h" #include "mongo/db/concurrency/write_conflict_exception.h" #include "mongo/db/exec/scoped_timer.h" #include "mongo/db/index/index_access_method.h" #include "mongo/stdx/memory.h" namespace mongo { namespace { /** * This function replaces field names in *replace* with those from the object * *fieldNames*, preserving field ordering. Both objects must have the same * number of fields. * * Example: * * replaceBSONKeyNames({ 'a': 1, 'b' : 1 }, { '': 'foo', '', 'bar' }) => * * { 'a' : 'foo' }, { 'b' : 'bar' } */ BSONObj replaceBSONFieldNames(const BSONObj& replace, const BSONObj& fieldNames) { invariant(replace.nFields() == fieldNames.nFields()); BSONObjBuilder bob; auto iter = fieldNames.begin(); for (const BSONElement& el : replace) { bob.appendAs(el, (*iter++).fieldNameStringData()); } return bob.obj(); } } using std::unique_ptr; using std::vector; using stdx::make_unique; // static const char* CountScan::kStageType = "COUNT_SCAN"; // When building the CountScan stage we take the keyPattern, index name, and multikey details from // the CountScanParams rather than resolving them via the IndexDescriptor, since these may differ // from the descriptor's contents. CountScan::CountScan(OperationContext* opCtx, CountScanParams params, WorkingSet* workingSet) : PlanStage(kStageType, opCtx), _workingSet(workingSet), _iam(params.accessMethod), _shouldDedup(params.isMultiKey), _params(std::move(params)) { _specificStats.indexName = _params.name; _specificStats.keyPattern = _params.keyPattern; _specificStats.isMultiKey = _params.isMultiKey; _specificStats.multiKeyPaths = _params.multikeyPaths; _specificStats.isUnique = _params.isUnique; _specificStats.isSparse = _params.isSparse; _specificStats.isPartial = _params.isPartial; _specificStats.indexVersion = static_cast(_params.version); _specificStats.collation = _params.collation.getOwned(); // endKey must be after startKey in index order since we only do forward scans. dassert(_params.startKey.woCompare(_params.endKey, Ordering::make(_params.keyPattern), /*compareFieldNames*/ false) <= 0); } PlanStage::StageState CountScan::doWork(WorkingSetID* out) { if (_commonStats.isEOF) return PlanStage::IS_EOF; boost::optional entry; const bool needInit = !_cursor; try { // We don't care about the keys. const auto kWantLoc = SortedDataInterface::Cursor::kWantLoc; if (needInit) { // First call to work(). Perform cursor init. _cursor = _iam->newCursor(getOpCtx()); _cursor->setEndPosition(_params.endKey, _params.endKeyInclusive); entry = _cursor->seek(_params.startKey, _params.startKeyInclusive, kWantLoc); } else { entry = _cursor->next(kWantLoc); } } catch (const WriteConflictException&) { if (needInit) { // Release our cursor and try again next time. _cursor.reset(); } *out = WorkingSet::INVALID_ID; return PlanStage::NEED_YIELD; } ++_specificStats.keysExamined; if (!entry) { _commonStats.isEOF = true; _cursor.reset(); return PlanStage::IS_EOF; } if (_shouldDedup && !_returned.insert(entry->loc).second) { // *loc was already in _returned. return PlanStage::NEED_TIME; } WorkingSetID id = _workingSet->allocate(); _workingSet->transitionToRecordIdAndObj(id); *out = id; return PlanStage::ADVANCED; } bool CountScan::isEOF() { return _commonStats.isEOF; } void CountScan::doSaveState() { if (_cursor) _cursor->save(); } void CountScan::doRestoreState() { if (_cursor) _cursor->restore(); } void CountScan::doDetachFromOperationContext() { if (_cursor) _cursor->detachFromOperationContext(); } void CountScan::doReattachToOperationContext() { if (_cursor) _cursor->reattachToOperationContext(getOpCtx()); } unique_ptr CountScan::getStats() { unique_ptr ret = make_unique(_commonStats, STAGE_COUNT_SCAN); unique_ptr countStats = make_unique(_specificStats); countStats->keyPattern = _specificStats.keyPattern.getOwned(); countStats->startKey = replaceBSONFieldNames(_params.startKey, countStats->keyPattern); countStats->startKeyInclusive = _params.startKeyInclusive; countStats->endKey = replaceBSONFieldNames(_params.endKey, countStats->keyPattern); countStats->endKeyInclusive = _params.endKeyInclusive; ret->specific = std::move(countStats); return ret; } const SpecificStats* CountScan::getSpecificStats() const { return &_specificStats; } } // namespace mongo