diff options
author | Kaloian Manassiev <kaloian.manassiev@mongodb.com> | 2014-10-13 17:46:32 -0400 |
---|---|---|
committer | Kaloian Manassiev <kaloian.manassiev@mongodb.com> | 2014-10-15 21:57:36 -0400 |
commit | 58ba874afce49711be39f19352f9b6c35bb33de6 (patch) | |
tree | c670226565d878852a35bf491c2a03524f7febeb /src/mongo/db/concurrency/fast_map_noalloc_test.cpp | |
parent | eb5f7e613c80ae00f2d9a92fbbf4c7548ffc216c (diff) | |
download | mongo-58ba874afce49711be39f19352f9b6c35bb33de6.tar.gz |
SERVER-14425 Implement map with no allocation for the lock manager tracking structures
Diffstat (limited to 'src/mongo/db/concurrency/fast_map_noalloc_test.cpp')
-rw-r--r-- | src/mongo/db/concurrency/fast_map_noalloc_test.cpp | 162 |
1 files changed, 162 insertions, 0 deletions
diff --git a/src/mongo/db/concurrency/fast_map_noalloc_test.cpp b/src/mongo/db/concurrency/fast_map_noalloc_test.cpp new file mode 100644 index 00000000000..84543f3fc03 --- /dev/null +++ b/src/mongo/db/concurrency/fast_map_noalloc_test.cpp @@ -0,0 +1,162 @@ +/** + * 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 <http://www.gnu.org/licenses/>. + * + * 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 <boost/lexical_cast.hpp> +#include <string> + +#include "mongo/db/concurrency/fast_map_noalloc.h" +#include "mongo/db/concurrency/resource_id.h" +#include "mongo/unittest/unittest.h" + + +namespace mongo { + + struct TestStruct { + + void initNew(int newId, const std::string& newValue) { + id = newId; + value = newValue; + } + + int id; + std::string value; + }; + + typedef class FastMapNoAlloc<ResourceId, TestStruct, 6> TestFastMapNoAlloc; + + + TEST(FastMapNoAlloc, Empty) { + TestFastMapNoAlloc map; + ASSERT(map.empty()); + + TestFastMapNoAlloc::Iterator it = map.begin(); + ASSERT(it.finished()); + } + + TEST(FastMapNoAlloc, NotEmpty) { + TestFastMapNoAlloc map; + + map.insert(ResourceId(RESOURCE_DOCUMENT, 1))->initNew(101, "Item101"); + map.insert(ResourceId(RESOURCE_DOCUMENT, 2))->initNew(102, "Item102"); + ASSERT(!map.empty()); + + TestFastMapNoAlloc::Iterator it = map.begin(); + ASSERT(!it.finished()); + ASSERT(!!it); + + ASSERT(it->id == 101); + ASSERT(it->value == "Item101"); + + it.next(); + ASSERT(!it.finished()); + ASSERT(!!it); + + ASSERT(it->id == 102); + ASSERT(it->value == "Item102"); + + // We are at the last element + it.next(); + ASSERT(it.finished()); + ASSERT(!it); + } + + TEST(FastMapNoAlloc, FindNonExisting) { + TestFastMapNoAlloc map; + + ASSERT(!map.find(ResourceId(RESOURCE_DOCUMENT, 0))); + } + + TEST(FastMapNoAlloc, FindAndRemove) { + TestFastMapNoAlloc map; + + for (int i = 0; i < 6; i++) { + map.insert(ResourceId(RESOURCE_DOCUMENT, i))->initNew( + i, "Item" + boost::lexical_cast<std::string>(i)); + } + + for (int i = 0; i < 6; i++) { + ASSERT(!map.find(ResourceId(RESOURCE_DOCUMENT, i)).finished()); + + ASSERT_EQUALS(i, map.find(ResourceId(RESOURCE_DOCUMENT, i))->id); + + ASSERT_EQUALS("Item" + boost::lexical_cast<std::string>(i), + map.find(ResourceId(RESOURCE_DOCUMENT, i))->value); + } + + // Remove a middle entry + map.find(ResourceId(RESOURCE_DOCUMENT, 2)).remove(); + ASSERT(!map.find(ResourceId(RESOURCE_DOCUMENT, 2))); + + // Remove entry after first + map.find(ResourceId(RESOURCE_DOCUMENT, 1)).remove(); + ASSERT(!map.find(ResourceId(RESOURCE_DOCUMENT, 1))); + + // Remove entry before last + map.find(ResourceId(RESOURCE_DOCUMENT, 4)).remove(); + ASSERT(!map.find(ResourceId(RESOURCE_DOCUMENT, 4))); + + // Remove first entry + map.find(ResourceId(RESOURCE_DOCUMENT, 0)).remove(); + ASSERT(!map.find(ResourceId(RESOURCE_DOCUMENT, 0))); + + // Remove last entry + map.find(ResourceId(RESOURCE_DOCUMENT, 5)).remove(); + ASSERT(!map.find(ResourceId(RESOURCE_DOCUMENT, 5))); + + // Remove final entry + map.find(ResourceId(RESOURCE_DOCUMENT, 3)).remove(); + ASSERT(!map.find(ResourceId(RESOURCE_DOCUMENT, 3))); + } + + TEST(FastMapNoAlloc, RemoveAll) { + TestFastMapNoAlloc map; + std::unordered_map<ResourceId, TestStruct> checkMap; + + for (int i = 1; i <= 6; i++) { + map.insert(ResourceId(RESOURCE_DOCUMENT, i))->initNew( + i, "Item" + boost::lexical_cast<std::string>(i)); + + checkMap[ResourceId(RESOURCE_DOCUMENT, i)].initNew( + i, "Item" + boost::lexical_cast<std::string>(i)); + } + + TestFastMapNoAlloc::Iterator it = map.begin(); + while (!it.finished()) { + ASSERT_EQUALS(it->id, checkMap[it.key()].id); + ASSERT_EQUALS( + "Item" + boost::lexical_cast<std::string>(it->id), checkMap[it.key()].value); + + checkMap.erase(it.key()); + it.remove(); + } + + ASSERT(map.empty()); + ASSERT(checkMap.empty()); + } + +} // namespace mongo |