forked from pingcap/tiflash
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
This is an automated cherry-pick of pingcap#9393
Signed-off-by: ti-chi-bot <[email protected]>
- Loading branch information
1 parent
e98915d
commit 70c7aed
Showing
5 changed files
with
288 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,194 @@ | ||
| // Copyright 2024 PingCAP, Inc. | ||
| // | ||
| // 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 <IO/IOThreadPools.h> | ||
| #include <gtest/gtest.h> | ||
|
|
||
| #include <exception> | ||
| #include <ext/scope_guard.h> | ||
| #include <future> | ||
| #include <random> | ||
|
|
||
| namespace DB::tests | ||
| { | ||
| namespace | ||
| { | ||
| using SPtr = std::shared_ptr<std::atomic<int>>; | ||
| using WPtr = std::weak_ptr<std::atomic<int>>; | ||
|
|
||
| void buildReadTasks(bool throw_in_build_read_tasks, bool throw_in_build_task, WPtr wp, SPtr invalid_count) | ||
| { | ||
| auto async_build_read_task = [=]() { | ||
| return BuildReadTaskPool::get().scheduleWithFuture([=]() { | ||
| std::random_device rd; | ||
| std::mt19937 gen(rd()); | ||
| auto sleep_ms = gen() % 100 + 1; // 1~100 | ||
| std::this_thread::sleep_for(std::chrono::milliseconds(sleep_ms)); | ||
|
|
||
| if (auto sp = wp.lock(); sp) | ||
| sp->fetch_add(1); | ||
| else | ||
| invalid_count->fetch_add(1); | ||
|
|
||
| if (throw_in_build_task) | ||
| throw Exception("From build_read_task"); | ||
| }); | ||
| }; | ||
|
|
||
| IOPoolHelper::FutureContainer futures(Logger::get("buildReadTasks")); | ||
| for (int i = 0; i < 10; i++) | ||
| { | ||
| futures.add(async_build_read_task()); | ||
| if (i >= 5 && throw_in_build_read_tasks) | ||
| throw Exception("From buildReadTasks"); | ||
| } | ||
| futures.getAllResults(); | ||
| } | ||
|
|
||
| void buildReadTasksForTables( | ||
| bool throw_in_build_read_tasks_for_tables, | ||
| bool throw_in_build_read_tasks, | ||
| bool throw_in_build_task, | ||
| WPtr wp, | ||
| SPtr invalid_count) | ||
| { | ||
| auto async_build_read_tasks_for_table = [=]() { | ||
| return BuildReadTaskForWNTablePool::get().scheduleWithFuture( | ||
| [=]() { buildReadTasks(throw_in_build_read_tasks, throw_in_build_task, wp, invalid_count); }); | ||
| }; | ||
|
|
||
| IOPoolHelper::FutureContainer futures(Logger::get("buildReadTasksForTables")); | ||
| for (int i = 0; i < 10; i++) | ||
| { | ||
| futures.add(async_build_read_tasks_for_table()); | ||
| if (i >= 5 && throw_in_build_read_tasks_for_tables) | ||
| throw Exception("From buildReadTasksForTables"); | ||
| } | ||
| futures.getAllResults(); | ||
| } | ||
|
|
||
| void buildReadTasksForWNs( | ||
| bool throw_in_build_read_tasks_for_wns, | ||
| bool throw_in_build_read_tasks_for_tables, | ||
| bool throw_in_build_read_tasks, | ||
| bool throw_in_build_task) | ||
| { | ||
| auto log = Logger::get("buildReadTasksForWNs"); | ||
| LOG_INFO( | ||
| log, | ||
| "throw_in_build_read_tasks_for_wns={}, " | ||
| "throw_in_build_read_tasks_for_tables={}, throw_in_build_read_tasks={}, throw_in_build_task={}", | ||
| throw_in_build_read_tasks_for_wns, | ||
| throw_in_build_read_tasks_for_tables, | ||
| throw_in_build_read_tasks, | ||
| throw_in_build_task); | ||
| auto sp = std::make_shared<std::atomic<int>>(0); | ||
| auto invalid_count = std::make_shared<std::atomic<int>>(0); | ||
| // Use weak_ptr to simulate capture by reference. | ||
| auto async_build_tasks_for_wn = [wp = WPtr{sp}, | ||
| invalid_count, | ||
| throw_in_build_read_tasks_for_tables, | ||
| throw_in_build_read_tasks, | ||
| throw_in_build_task]() { | ||
| return BuildReadTaskForWNPool::get().scheduleWithFuture([=]() { | ||
| buildReadTasksForTables( | ||
| throw_in_build_read_tasks_for_tables, | ||
| throw_in_build_read_tasks, | ||
| throw_in_build_task, | ||
| wp, | ||
| invalid_count); | ||
| }); | ||
| }; | ||
|
|
||
| try | ||
| { | ||
| IOPoolHelper::FutureContainer futures(log); | ||
| SCOPE_EXIT({ | ||
| if (!throw_in_build_read_tasks_for_wns && !throw_in_build_read_tasks_for_tables | ||
| && !throw_in_build_read_tasks) | ||
| ASSERT_EQ(*sp, 10 * 10 * 10); | ||
| ASSERT_EQ(*invalid_count, 0); | ||
| }); | ||
| for (int i = 0; i < 10; i++) | ||
| { | ||
| futures.add(async_build_tasks_for_wn()); | ||
| if (i >= 5 && throw_in_build_read_tasks_for_wns) | ||
| throw Exception("From buildReadTasksForWNs"); | ||
| } | ||
| futures.getAllResults(); | ||
| } | ||
| catch (...) | ||
| { | ||
| tryLogCurrentException(log); | ||
| } | ||
| } | ||
| } // namespace | ||
|
|
||
| TEST(IOThreadPool, TaskChain) | ||
| { | ||
| constexpr std::array<bool, 2> arr{false, true}; | ||
| for (auto a : arr) | ||
| for (auto b : arr) | ||
| for (auto c : arr) | ||
| for (auto d : arr) | ||
| buildReadTasksForWNs(a, b, c, d); | ||
| } | ||
|
|
||
| TEST(IOThreadPool, WaitTimeout) | ||
| { | ||
| auto & thread_pool = BuildReadTaskPool::get(); | ||
| const auto queue_size = thread_pool.getQueueSize(); | ||
| std::atomic<bool> stop_flag{false}; | ||
| IOPoolHelper::FutureContainer futures(Logger::get()); | ||
| auto loop_until_stop = [&]() { | ||
| while (!stop_flag) | ||
| std::this_thread::sleep_for(std::chrono::seconds(1)); | ||
| }; | ||
| for (size_t i = 0; i < queue_size; ++i) | ||
| { | ||
| auto f = thread_pool.scheduleWithFuture(loop_until_stop); | ||
| futures.add(std::move(f)); | ||
| } | ||
| ASSERT_EQ(thread_pool.active(), queue_size); | ||
|
|
||
| auto try_result = thread_pool.trySchedule(loop_until_stop); | ||
| ASSERT_FALSE(try_result); | ||
|
|
||
| try | ||
| { | ||
| auto f = thread_pool.scheduleWithFuture(loop_until_stop); | ||
| futures.add(std::move(f)); | ||
| FAIL() << "Should throw exception."; | ||
| } | ||
| catch (Exception & e) | ||
| { | ||
| ASSERT_TRUE(e.message().starts_with("Cannot schedule a task: no free thread (timeout=0)")); | ||
| } | ||
|
|
||
| try | ||
| { | ||
| auto f = thread_pool.scheduleWithFuture(loop_until_stop, 10000); | ||
| futures.add(std::move(f)); | ||
| FAIL() << "Should throw exception."; | ||
| } | ||
| catch (Exception & e) | ||
| { | ||
| ASSERT_TRUE(e.message().starts_with("Cannot schedule a task: no free thread (timeout=10000)")); | ||
| } | ||
|
|
||
| stop_flag.store(true); | ||
| futures.getAllResults(); | ||
| } | ||
| } // namespace DB::tests |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters