// sorted_data_interface_test_dupkeycheck.cpp /** * Copyright (C) 2014 MongoDB 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 . * * 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/db/storage/sorted_data_interface_test_harness.h" #include #include "mongo/db/storage/sorted_data_interface.h" #include "mongo/unittest/unittest.h" namespace mongo { // Insert a key and verify that dupKeyCheck() returns a non-OK status for // the same key. When dupKeyCheck() is called with the exact (key, RecordId) // pair that was inserted, it should still return an OK status. TEST(SortedDataInterface, DupKeyCheckAfterInsert) { const std::unique_ptr harnessHelper(newHarnessHelper()); const std::unique_ptr sorted(harnessHelper->newSortedDataInterface(true)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT(sorted->isEmpty(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert(opCtx.get(), key1, loc1, false)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->dupKeyCheck(opCtx.get(), key1, loc1)); ASSERT_NOT_OK(sorted->dupKeyCheck(opCtx.get(), key1, RecordId::min())); uow.commit(); } } } // Verify that dupKeyCheck() returns an OK status for a key that does // not exist in the index. TEST(SortedDataInterface, DupKeyCheckEmpty) { const std::unique_ptr harnessHelper(newHarnessHelper()); const std::unique_ptr sorted(harnessHelper->newSortedDataInterface(true)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT(sorted->isEmpty(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->dupKeyCheck(opCtx.get(), key1, loc1)); uow.commit(); } } } // Insert a key and verify that dupKeyCheck() acknowledges the duplicate key, even // when the insert key is located at a RecordId that comes after the one specified. TEST(SortedDataInterface, DupKeyCheckWhenDiskLocBefore) { const std::unique_ptr harnessHelper(newHarnessHelper()); const std::unique_ptr sorted(harnessHelper->newSortedDataInterface(true)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT(sorted->isEmpty(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert(opCtx.get(), key1, loc1, true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_NOT_OK(sorted->dupKeyCheck(opCtx.get(), key1, RecordId::min())); uow.commit(); } } } // Insert a key and verify that dupKeyCheck() acknowledges the duplicate key, even // when the insert key is located at a RecordId that comes before the one specified. TEST(SortedDataInterface, DupKeyCheckWhenDiskLocAfter) { const std::unique_ptr harnessHelper(newHarnessHelper()); const std::unique_ptr sorted(harnessHelper->newSortedDataInterface(true)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT(sorted->isEmpty(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert(opCtx.get(), key1, loc1, true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_NOT_OK(sorted->dupKeyCheck(opCtx.get(), key1, RecordId::max())); uow.commit(); } } } } // namespace mongo