blob: 1798d06b5d720ac921a989c4228a33aec52147f2 [file] [log] [blame]
tommic06b1332016-05-14 11:31:40 -07001/*
2 * Copyright 2016 The WebRTC Project Authors. All rights reserved.
3 *
4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
9 */
10
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020011#ifndef RTC_BASE_TASK_QUEUE_H_
12#define RTC_BASE_TASK_QUEUE_H_
tommic06b1332016-05-14 11:31:40 -070013
Yves Gerey3e707812018-11-28 16:47:49 +010014#include <stdint.h>
Jonas Olssona4d87372019-07-05 19:08:33 +020015
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020016#include <memory>
Danil Chapovalov6f09ae22017-10-12 14:39:25 +020017#include <utility>
tommic06b1332016-05-14 11:31:40 -070018
Karl Wiberg918f50c2018-07-05 11:40:33 +020019#include "absl/memory/memory.h"
Danil Chapovalov959e9b62019-01-14 14:29:18 +010020#include "api/task_queue/queued_task.h"
Danil Chapovalovd00405f2019-02-25 15:06:13 +010021#include "api/task_queue/task_queue_base.h"
22#include "api/task_queue/task_queue_factory.h"
Mirko Bonadei3d255302018-10-11 10:50:45 +020023#include "rtc_base/system/rtc_export.h"
Danil Chapovalov3b548dd2019-03-01 14:58:44 +010024#include "rtc_base/task_utils/to_queued_task.h"
Danil Chapovalov02fddf62018-02-12 12:41:16 +010025#include "rtc_base/thread_annotations.h"
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020026
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020027namespace rtc {
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020028// Implements a task queue that asynchronously executes tasks in a way that
29// guarantees that they're executed in FIFO order and that tasks never overlap.
30// Tasks may always execute on the same worker thread and they may not.
31// To DCHECK that tasks are executing on a known task queue, use IsCurrent().
32//
33// Here are some usage examples:
34//
35// 1) Asynchronously running a lambda:
36//
37// class MyClass {
38// ...
39// TaskQueue queue_("MyQueue");
40// };
41//
42// void MyClass::StartWork() {
43// queue_.PostTask([]() { Work(); });
44// ...
45//
Danil Chapovalov1aa75812019-03-05 11:11:35 +010046// 2) Posting a custom task on a timer. The task posts itself again after
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020047// every running:
48//
49// class TimerTask : public QueuedTask {
50// public:
51// TimerTask() {}
52// private:
53// bool Run() override {
54// ++count_;
Danil Chapovalovad895282019-03-11 10:28:05 +000055// TaskQueueBase::Current()->PostDelayedTask(
56// absl::WrapUnique(this), 1000);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020057// // Ownership has been transferred to the next occurance,
58// // so return false to prevent from being deleted now.
59// return false;
60// }
61// int count_ = 0;
62// };
63// ...
Mirko Bonadei317a1f02019-09-17 17:06:18 +020064// queue_.PostDelayedTask(std::make_unique<TimerTask>(), 1000);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020065//
66// For more examples, see task_queue_unittests.cc.
67//
68// A note on destruction:
69//
70// When a TaskQueue is deleted, pending tasks will not be executed but they will
71// be deleted. The deletion of tasks may happen asynchronously after the
72// TaskQueue itself has been deleted or it may happen synchronously while the
73// TaskQueue instance is being deleted. This may vary from one OS to the next
74// so assumptions about lifetimes of pending tasks should not be made.
Mirko Bonadei3d255302018-10-11 10:50:45 +020075class RTC_LOCKABLE RTC_EXPORT TaskQueue {
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020076 public:
77 // TaskQueue priority levels. On some platforms these will map to thread
78 // priorities, on others such as Mac and iOS, GCD queue priorities.
Danil Chapovalovd00405f2019-02-25 15:06:13 +010079 using Priority = ::webrtc::TaskQueueFactory::Priority;
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020080
Danil Chapovalovf3280e92019-02-28 10:39:04 +010081 explicit TaskQueue(std::unique_ptr<webrtc::TaskQueueBase,
82 webrtc::TaskQueueDeleter> task_queue);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020083 ~TaskQueue();
84
Byoungchan Lee14af7622022-01-12 05:24:58 +090085 TaskQueue(const TaskQueue&) = delete;
86 TaskQueue& operator=(const TaskQueue&) = delete;
87
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020088 // Used for DCHECKing the current queue.
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020089 bool IsCurrent() const;
90
Danil Chapovalovf3280e92019-02-28 10:39:04 +010091 // Returns non-owning pointer to the task queue implementation.
92 webrtc::TaskQueueBase* Get() { return impl_; }
93
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020094 // TODO(tommi): For better debuggability, implement RTC_FROM_HERE.
95
96 // Ownership of the task is passed to PostTask.
Danil Chapovalov471783f2019-03-11 14:26:02 +010097 void PostTask(std::unique_ptr<webrtc::QueuedTask> task);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020098
99 // Schedules a task to execute a specified number of milliseconds from when
100 // the call is made. The precision should be considered as "best effort"
101 // and in some cases, such as on Windows when all high precision timers have
102 // been used up, can be off by as much as 15 millseconds (although 8 would be
103 // more likely). This can be mitigated by limiting the use of delayed tasks.
Danil Chapovalov471783f2019-03-11 14:26:02 +0100104 void PostDelayedTask(std::unique_ptr<webrtc::QueuedTask> task,
105 uint32_t milliseconds);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200106
eladalonffe2e142017-08-31 04:36:05 -0700107 // std::enable_if is used here to make sure that calls to PostTask() with
108 // std::unique_ptr<SomeClassDerivedFromQueuedTask> would not end up being
109 // caught by this template.
110 template <class Closure,
Danil Chapovalov6f09ae22017-10-12 14:39:25 +0200111 typename std::enable_if<!std::is_convertible<
112 Closure,
Danil Chapovalov471783f2019-03-11 14:26:02 +0100113 std::unique_ptr<webrtc::QueuedTask>>::value>::type* = nullptr>
Danil Chapovalov6f09ae22017-10-12 14:39:25 +0200114 void PostTask(Closure&& closure) {
Danil Chapovalov1aa75812019-03-05 11:11:35 +0100115 PostTask(webrtc::ToQueuedTask(std::forward<Closure>(closure)));
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200116 }
117
118 // See documentation above for performance expectations.
Danil Chapovalov6f09ae22017-10-12 14:39:25 +0200119 template <class Closure,
120 typename std::enable_if<!std::is_convertible<
121 Closure,
Danil Chapovalov471783f2019-03-11 14:26:02 +0100122 std::unique_ptr<webrtc::QueuedTask>>::value>::type* = nullptr>
Danil Chapovalov6f09ae22017-10-12 14:39:25 +0200123 void PostDelayedTask(Closure&& closure, uint32_t milliseconds) {
Danil Chapovalov1aa75812019-03-05 11:11:35 +0100124 PostDelayedTask(webrtc::ToQueuedTask(std::forward<Closure>(closure)),
125 milliseconds);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200126 }
127
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200128 private:
Danil Chapovalovd00405f2019-02-25 15:06:13 +0100129 webrtc::TaskQueueBase* const impl_;
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200130};
131
132} // namespace rtc
tommic06b1332016-05-14 11:31:40 -0700133
Mirko Bonadei92ea95e2017-09-15 06:47:31 +0200134#endif // RTC_BASE_TASK_QUEUE_H_