/* * Copyright (c) 2021, The OpenThread Authors. * All rights reserved. * * 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. * 3. Neither the name of the copyright holder nor the * names of its contributors may be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 THE COPYRIGHT HOLDER 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. */ /** * @file * This file defines the Task Runner that executes tasks on the mainloop. */ #ifndef OTBR_COMMON_TASK_RUNNER_HPP_ #define OTBR_COMMON_TASK_RUNNER_HPP_ #include #include #include #include #include #include #include #include "common/code_utils.hpp" #include "common/mainloop.hpp" #include "common/time.hpp" namespace otbr { /** * This class implements the Task Runner that executes * tasks on the mainloop. * */ class TaskRunner : public MainloopProcessor, private NonCopyable { public: /** * This type represents the generic executable task. * */ template using Task = std::function; /** * This type represents a unique task ID to an delayed task. * * Note: A valid task ID is never zero. * */ typedef uint64_t TaskId; /** * This constructor initializes the Task Runner instance. * */ TaskRunner(void); /** * This destructor destroys the Task Runner instance. * */ ~TaskRunner(void) override; /** * This method posts a task to the task runner and returns immediately. * * Tasks are executed sequentially and follow the First-Come-First-Serve rule. * It is safe to call this method in different threads concurrently. * * @param[in] aTask The task to be executed. * */ void Post(Task aTask); /** * This method posts a task to the task runner and returns immediately. * * The task will be executed on the mainloop after `aDelay` milliseconds from now. * It is safe to call this method in different threads concurrently. * * @param[in] aDelay The delay before executing the task (in milliseconds). * @param[in] aTask The task to be executed. * * @returns The unique task ID of the delayed task. * */ TaskId Post(Milliseconds aDelay, Task aTask); /** * This method cancels a delayed task from the task runner. * It is safe to call this method in different threads concurrently. * * @param[in] aTaskId The unique task ID of the delayed task to cancel. * */ void Cancel(TaskId aTaskId); /** * This method posts a task and waits for the completion of the task. * * Tasks are executed sequentially and follow the First-Come-First-Serve rule. * This method must be called in a thread other than the mainloop thread. Otherwise, * the caller will be blocked forever. * * @returns The result returned by the task @p aTask. * */ template T PostAndWait(const Task &aTask) { std::promise pro; Post([&pro, &aTask]() { pro.set_value(aTask()); }); return pro.get_future().get(); } void Update(MainloopContext &aMainloop) override; void Process(const MainloopContext &aMainloop) override; private: enum { kRead = 0, kWrite = 1, }; struct DelayedTask { friend class Comparator; struct Comparator { bool operator()(const DelayedTask &aLhs, const DelayedTask &aRhs) const { return aRhs < aLhs; } }; DelayedTask(TaskId aTaskId, Milliseconds aDelay, Task aTask) : mTaskId(aTaskId) , mDeadline(Clock::now() + aDelay) , mTask(std::move(aTask)) { } bool operator<(const DelayedTask &aOther) const { return mDeadline <= aOther.mDeadline || (mDeadline == aOther.mDeadline && mTaskId < aOther.mTaskId); } Timepoint GetTimeExecute(void) const { return mDeadline; } TaskId mTaskId; Timepoint mDeadline; Task mTask; }; TaskId PushTask(Milliseconds aDelay, Task aTask); void PopTasks(void); // The event fds which are used to wakeup the mainloop // when there are pending tasks in the task queue. int mEventFd[2]; std::priority_queue, DelayedTask::Comparator> mTaskQueue; std::set mActiveTaskIds; TaskId mNextTaskId = 1; // The mutex which protects the `mTaskQueue` from being // simultaneously accessed by multiple threads. std::mutex mTaskQueueMutex; }; } // namespace otbr #endif // OTBR_COMMON_TASK_RUNNER_HPP_