|
16 | 16 |
|
17 | 17 | #include <sys/syscall.h>
|
18 | 18 |
|
19 |
| -#include <algorithm> |
20 | 19 | #include <csignal>
|
21 | 20 | #include <memory>
|
22 |
| -#include <vector> |
23 | 21 |
|
24 | 22 | #include "absl/base/call_once.h"
|
25 | 23 | #include "absl/flags/flag.h"
|
@@ -139,46 +137,27 @@ void DeadlineManager::Run() {
|
139 | 137 | return (!queue_.empty() && next_deadline != (*queue_.begin())->deadline) ||
|
140 | 138 | cancelled_;
|
141 | 139 | };
|
142 |
| - for (;;) { |
143 |
| - std::vector<DeadlineRegistration::Data*> to_be_notified; |
144 |
| - { |
145 |
| - absl::MutexLock lock(&queue_mutex_); |
146 |
| - if (cancelled_) { |
147 |
| - break; |
148 |
| - } |
149 |
| - next_deadline = absl::InfiniteFuture(); |
150 |
| - if (!queue_.empty()) { |
151 |
| - next_deadline = (*queue_.begin())->deadline; |
152 |
| - } |
153 |
| - if (queue_mutex_.AwaitWithDeadline( |
154 |
| - absl::Condition(&next_deadline_changed_or_cancelled), |
155 |
| - next_deadline)) { |
156 |
| - continue; |
157 |
| - } |
158 |
| - absl::Time current = std::max(absl::Now(), next_deadline); |
159 |
| - while (!queue_.empty() && (*queue_.begin())->deadline <= current) { |
160 |
| - to_be_notified.push_back(*queue_.begin()); |
161 |
| - queue_.erase(queue_.begin()); |
162 |
| - } |
| 140 | + absl::MutexLock lock(&queue_mutex_); |
| 141 | + while (!cancelled_) { |
| 142 | + next_deadline = absl::InfiniteFuture(); |
| 143 | + if (!queue_.empty()) { |
| 144 | + next_deadline = (*queue_.begin())->deadline; |
| 145 | + } |
| 146 | + if (queue_mutex_.AwaitWithDeadline( |
| 147 | + absl::Condition(&next_deadline_changed_or_cancelled), |
| 148 | + next_deadline)) { |
| 149 | + continue; |
163 | 150 | }
|
164 |
| - std::vector<DeadlineRegistration::Data*> to_reinsert; |
165 |
| - absl::Time next_notification_time = |
166 |
| - RoundUpTo(absl::Now() + kResolution, kResolution); |
167 |
| - for (DeadlineRegistration::Data* entry : to_be_notified) { |
| 151 | + absl::Time next_notification_time = RoundUpTo(absl::Now(), kResolution); |
| 152 | + while (!queue_.empty() && (*queue_.begin())->deadline <= next_deadline) { |
| 153 | + DeadlineRegistration::Data* entry = *queue_.begin(); |
| 154 | + queue_.erase(queue_.begin()); |
168 | 155 | absl::MutexLock lock(&entry->mutex);
|
169 | 156 | entry->expired = true;
|
170 | 157 | if (entry->in_blocking_fn) {
|
171 | 158 | util::Syscall(__NR_tgkill, getpid(), entry->tid, signal_nr_);
|
172 | 159 | entry->deadline = next_notification_time;
|
173 |
| - to_reinsert.push_back(entry); |
174 |
| - } |
175 |
| - } |
176 |
| - { |
177 |
| - absl::MutexLock lock(&queue_mutex_); |
178 |
| - for (DeadlineRegistration::Data* entry : to_reinsert) { |
179 |
| - if (entry->deadline != absl::InfiniteFuture()) { |
180 |
| - queue_.insert(entry); |
181 |
| - } |
| 160 | + queue_.insert(entry); |
182 | 161 | }
|
183 | 162 | }
|
184 | 163 | }
|
|
0 commit comments