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 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352
|
/*
* Copyright (C) 2016 Konstantin Tokavev <annulen@yandex.ru>
* Copyright (C) 2016 Yusuke Suzuki <utatane.tea@gmail.com>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <wtf/RunLoop.h>
#include <wtf/DataLog.h>
#include <wtf/NeverDestroyed.h>
#include <wtf/ProcessID.h>
namespace WTF {
static constexpr bool report = false;
class RunLoop::TimerBase::ScheduledTask : public ThreadSafeRefCounted<ScheduledTask>, public RedBlackTree<ScheduledTask, MonotonicTime>::Node {
WTF_MAKE_FAST_ALLOCATED;
WTF_MAKE_NONCOPYABLE(ScheduledTask);
public:
static Ref<ScheduledTask> create(RunLoop::TimerBase& timer)
{
return adoptRef(*new ScheduledTask(timer));
}
ScheduledTask(RunLoop::TimerBase& timer)
: m_timer(timer)
{
}
void fired()
{
if (!isActive())
return;
if (!m_isRepeating)
deactivate();
if (isActive())
updateReadyTime();
m_timer.fired();
}
MonotonicTime scheduledTimePoint() const
{
return m_scheduledTimePoint;
}
void updateReadyTime()
{
ASSERT(!isScheduled());
m_scheduledTimePoint = MonotonicTime::now();
if (!m_fireInterval)
return;
m_scheduledTimePoint += m_fireInterval;
}
MonotonicTime key() const
{
return scheduledTimePoint();
}
bool isScheduled() const
{
return m_isScheduled;
}
void setScheduled(bool flag)
{
m_isScheduled = flag;
}
bool isActive() const
{
return m_isActive.load();
}
void activate(Seconds interval, bool repeating)
{
m_fireInterval = interval;
m_isRepeating = repeating;
updateReadyTime();
m_isActive.store(true);
}
void deactivate()
{
m_isActive.store(false);
}
private:
RunLoop::TimerBase& m_timer;
MonotonicTime m_scheduledTimePoint;
Seconds m_fireInterval;
std::atomic<bool> m_isActive { };
bool m_isRepeating { };
bool m_isScheduled { };
};
RunLoop::RunLoop()
{
}
RunLoop::~RunLoop()
{
Locker locker { m_loopLock };
m_shutdown = true;
m_readyToRun.notifyOne();
// Here is running main loops. Wait until all the main loops are destroyed.
if (!m_mainLoops.isEmpty())
m_stopCondition.wait(m_loopLock);
}
inline bool RunLoop::populateTasks(RunMode runMode, Status& statusOfThisLoop, Deque<Ref<TimerBase::ScheduledTask>>& firedTimers)
{
Locker locker { m_loopLock };
if (runMode == RunMode::Drain) {
MonotonicTime sleepUntil = MonotonicTime::infinity();
if (!m_schedules.isEmpty())
sleepUntil = m_schedules.first()->scheduledTimePoint();
m_readyToRun.waitUntil(m_loopLock, sleepUntil, [&] {
return m_shutdown || m_pendingTasks || statusOfThisLoop == Status::Stopping;
});
}
if (statusOfThisLoop == Status::Stopping || m_shutdown) {
m_mainLoops.removeLast();
if (m_mainLoops.isEmpty())
m_stopCondition.notifyOne();
return false;
}
m_pendingTasks = false;
if (runMode == RunMode::Iterate)
statusOfThisLoop = Status::Stopping;
// Check expired timers.
MonotonicTime now = MonotonicTime::now();
while (!m_schedules.isEmpty()) {
auto task = m_schedules.first();
if (task->scheduledTimePoint() > now)
break;
unscheduleWithLock(*task);
firedTimers.append(Ref(*task));
}
return true;
}
void RunLoop::runImpl(RunMode runMode)
{
ASSERT(this == &RunLoop::current());
if constexpr (report) {
static LazyNeverDestroyed<Timer> reporter;
static std::once_flag onceKey;
std::call_once(onceKey, [&] {
reporter.construct(*this, [this] {
unsigned count = 0;
unsigned active = 0;
for (auto task = m_schedules.first(); task; task = task->successor()) {
count++;
if (task->isActive())
active++;
}
dataLogF("[RunLoop][pid %d main %s] m_schedules size %u active %u\n",
getCurrentProcessID(),
(isMain() ? "true" : "false"),
count,
active);
});
reporter->startRepeating(30_s);
dataLogF("[RunLoop][pid %d main %s] Reporter installed\n",
getCurrentProcessID(),
(isMain() ? "true" : "false"));
});
}
Status statusOfThisLoop = Status::Clear;
{
Locker locker { m_loopLock };
m_mainLoops.append(&statusOfThisLoop);
}
Deque<Ref<TimerBase::ScheduledTask>> firedTimers;
while (true) {
if (!populateTasks(runMode, statusOfThisLoop, firedTimers))
return;
// Dispatch scheduled timers.
while (!firedTimers.isEmpty()) {
auto task = firedTimers.takeFirst();
task->fired();
Locker locker { m_loopLock };
// It is possible the task is already scheduled while executing fired().
if (task->isActive() && !task->isScheduled()) {
// Reschedule because the timer requires repeating.
// Since we will query the timers' time points before sleeping,
// we do not call wakeUp() here.
scheduleWithLock(task.get());
}
}
performWork();
}
}
void RunLoop::run()
{
RunLoop::current().runImpl(RunMode::Drain);
}
void RunLoop::setWakeUpCallback(WTF::Function<void()>&& function)
{
RunLoop::current().m_wakeUpCallback = WTFMove(function);
}
// RunLoop operations are thread-safe. These operations can be called from outside of the RunLoop's thread.
// For example, WorkQueue::{dispatch, dispatchAfter} call the operations of the WorkQueue thread's RunLoop
// from the caller's thread.
void RunLoop::stop()
{
Locker locker { m_loopLock };
if (m_mainLoops.isEmpty())
return;
Status* status = m_mainLoops.last();
if (*status != Status::Stopping) {
*status = Status::Stopping;
m_readyToRun.notifyOne();
}
}
void RunLoop::wakeUpWithLock()
{
m_pendingTasks = true;
m_readyToRun.notifyOne();
if (m_wakeUpCallback)
m_wakeUpCallback();
}
void RunLoop::wakeUp()
{
Locker locker { m_loopLock };
wakeUpWithLock();
}
RunLoop::CycleResult RunLoop::cycle(RunLoopMode)
{
RunLoop::current().runImpl(RunMode::Iterate);
return CycleResult::Continue;
}
void RunLoop::scheduleWithLock(TimerBase::ScheduledTask& task)
{
if (!task.isScheduled()) {
m_schedules.insert(&task);
task.setScheduled(true);
}
}
void RunLoop::unscheduleWithLock(TimerBase::ScheduledTask& task)
{
if (task.isScheduled()) {
m_schedules.remove(&task);
task.setScheduled(false);
}
}
// Since RunLoop does not own the registered TimerBase,
// TimerBase and its owner should manage these lifetime.
RunLoop::TimerBase::TimerBase(Ref<RunLoop>&& runLoop)
: m_runLoop(WTFMove(runLoop))
, m_scheduledTask(ScheduledTask::create(*this))
{
}
RunLoop::TimerBase::~TimerBase()
{
Locker locker { m_runLoop->m_loopLock };
stopWithLock();
}
void RunLoop::TimerBase::start(Seconds interval, bool repeating)
{
Locker locker { m_runLoop->m_loopLock };
stopWithLock();
m_scheduledTask->activate(interval, repeating);
m_runLoop->scheduleWithLock(m_scheduledTask.get());
m_runLoop->wakeUpWithLock();
}
void RunLoop::TimerBase::stopWithLock()
{
m_runLoop->unscheduleWithLock(m_scheduledTask.get());
m_scheduledTask->deactivate();
}
void RunLoop::TimerBase::stop()
{
Locker locker { m_runLoop->m_loopLock };
stopWithLock();
}
bool RunLoop::TimerBase::isActive() const
{
Locker locker { m_runLoop->m_loopLock };
return isActiveWithLock();
}
bool RunLoop::TimerBase::isActiveWithLock() const
{
return m_scheduledTask->isActive();
}
Seconds RunLoop::TimerBase::secondsUntilFire() const
{
Locker locker { m_runLoop->m_loopLock };
if (isActiveWithLock())
return std::max<Seconds>(m_scheduledTask->scheduledTimePoint() - MonotonicTime::now(), 0_s);
return 0_s;
}
} // namespace WTF
|