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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
// Copyright 2022 The gRPC Authors
//
// 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/core/lib/event_engine/thread_pool.h"
#include <stdlib.h>
#include <chrono>
#include <thread>
#include "gtest/gtest.h"
#include <grpc/support/log.h>
#include "src/core/lib/gprpp/notification.h"
namespace grpc_event_engine {
namespace experimental {
TEST(ThreadPoolTest, CanRunClosure) {
ThreadPool p;
grpc_core::Notification n;
p.Run([&n] { n.Notify(); });
n.WaitForNotification();
p.Quiesce();
}
TEST(ThreadPoolTest, CanDestroyInsideClosure) {
auto p = std::make_shared<ThreadPool>();
grpc_core::Notification n;
p->Run([p, &n]() mutable {
std::this_thread::sleep_for(std::chrono::seconds(1));
// This should delete the thread pool and not deadlock
p->Quiesce();
p.reset();
n.Notify();
});
// Make sure we're not keeping the thread pool alive from outside the loop
p.reset();
n.WaitForNotification();
}
TEST(ThreadPoolTest, CanSurviveFork) {
ThreadPool p;
grpc_core::Notification n;
gpr_log(GPR_INFO, "run callback 1");
p.Run([&n, &p] {
std::this_thread::sleep_for(std::chrono::seconds(1));
gpr_log(GPR_INFO, "run callback 2");
p.Run([&n] {
std::this_thread::sleep_for(std::chrono::seconds(1));
gpr_log(GPR_INFO, "notify");
n.Notify();
});
});
gpr_log(GPR_INFO, "prepare fork");
p.PrepareFork();
gpr_log(GPR_INFO, "wait for notification");
n.WaitForNotification();
gpr_log(GPR_INFO, "postfork child");
p.PostforkChild();
grpc_core::Notification n2;
gpr_log(GPR_INFO, "run callback 3");
p.Run([&n2] {
gpr_log(GPR_INFO, "notify");
n2.Notify();
});
gpr_log(GPR_INFO, "wait for notification");
n2.WaitForNotification();
p.Quiesce();
}
void ScheduleSelf(ThreadPool* p) {
p->Run([p] { ScheduleSelf(p); });
}
TEST(ThreadPoolDeathTest, CanDetectStucknessAtFork) {
ASSERT_DEATH_IF_SUPPORTED(
[] {
gpr_set_log_verbosity(GPR_LOG_SEVERITY_ERROR);
ThreadPool p;
ScheduleSelf(&p);
std::thread terminator([] {
std::this_thread::sleep_for(std::chrono::seconds(10));
abort();
});
p.PrepareFork();
}(),
"Waiting for thread pool to idle before forking");
}
void ScheduleTwiceUntilZero(ThreadPool* p, int n) {
if (n == 0) return;
p->Run([p, n] {
ScheduleTwiceUntilZero(p, n - 1);
ScheduleTwiceUntilZero(p, n - 1);
});
}
TEST(ThreadPoolTest, CanStartLotsOfClosures) {
ThreadPool p;
// Our first thread pool implementation tried to create ~1M threads for this
// test.
ScheduleTwiceUntilZero(&p, 20);
p.Quiesce();
}
} // namespace experimental
} // namespace grpc_event_engine
int main(int argc, char** argv) {
gpr_log_verbosity_init();
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}
|
