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
|
// Copyright 2022 Huawei Cloud Computing Technology Co., Ltd.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "src/buildtool/multithreading/async_map.hpp"
#include <string>
#include "catch2/catch_test_macros.hpp"
#include "src/buildtool/multithreading/task_system.hpp"
TEST_CASE("Single-threaded: nodes only created once", "[async_map]") {
AsyncMap<std::string, int> map;
auto* key_node = map.GetOrCreateNode("key");
CHECK(key_node != nullptr);
auto* other_node = map.GetOrCreateNode("otherkey");
CHECK(other_node != nullptr);
auto* should_be_key_node = map.GetOrCreateNode("key");
CHECK(should_be_key_node != nullptr);
CHECK(key_node != other_node);
CHECK(key_node == should_be_key_node);
}
TEST_CASE("Nodes only created once and survive the map destruction",
"[async_map]") {
using NodePtr = typename AsyncMap<std::string, int>::NodePtr;
NodePtr key_node{nullptr};
NodePtr other_node{nullptr};
NodePtr should_be_key_node{nullptr};
{
AsyncMap<std::string, int> map;
{
TaskSystem ts;
ts.QueueTask([&key_node, &map]() {
auto* node = map.GetOrCreateNode("key");
CHECK(node != nullptr);
key_node = node;
});
ts.QueueTask([&other_node, &map]() {
auto* node = map.GetOrCreateNode("otherkey");
CHECK(node != nullptr);
other_node = node;
});
ts.QueueTask([&should_be_key_node, &map]() {
auto* node = map.GetOrCreateNode("key");
CHECK(node != nullptr);
should_be_key_node = node;
});
}
}
CHECK(key_node != nullptr);
CHECK(other_node != nullptr);
CHECK(should_be_key_node != nullptr);
CHECK(key_node != other_node);
CHECK(key_node == should_be_key_node);
}
|