blob: 8d2a89ee216f21101f6a4c693798d13ceec8f82b [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>
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020015#include <memory>
Danil Chapovalov6f09ae22017-10-12 14:39:25 +020016#include <utility>
tommic06b1332016-05-14 11:31:40 -070017
Karl Wiberg918f50c2018-07-05 11:40:33 +020018#include "absl/memory/memory.h"
Danil Chapovalov959e9b62019-01-14 14:29:18 +010019#include "api/task_queue/queued_task.h"
Danil Chapovalovd00405f2019-02-25 15:06:13 +010020#include "api/task_queue/task_queue_base.h"
21#include "api/task_queue/task_queue_factory.h"
Steve Anton10542f22019-01-11 09:11:00 -080022#include "rtc_base/constructor_magic.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// ...
Danil Chapovalovad895282019-03-11 10:28:05 +000064// queue_.PostDelayedTask(absl::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 explicit TaskQueue(const char* queue_name,
84 Priority priority = Priority::NORMAL);
85 ~TaskQueue();
86
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020087 // Used for DCHECKing the current queue.
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020088 bool IsCurrent() const;
89
Danil Chapovalovf3280e92019-02-28 10:39:04 +010090 // Returns non-owning pointer to the task queue implementation.
91 webrtc::TaskQueueBase* Get() { return impl_; }
92
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020093 // TODO(tommi): For better debuggability, implement RTC_FROM_HERE.
94
95 // Ownership of the task is passed to PostTask.
Danil Chapovalov471783f2019-03-11 14:26:02 +010096 void PostTask(std::unique_ptr<webrtc::QueuedTask> task);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +020097
98 // Schedules a task to execute a specified number of milliseconds from when
99 // the call is made. The precision should be considered as "best effort"
100 // and in some cases, such as on Windows when all high precision timers have
101 // been used up, can be off by as much as 15 millseconds (although 8 would be
102 // more likely). This can be mitigated by limiting the use of delayed tasks.
Danil Chapovalov471783f2019-03-11 14:26:02 +0100103 void PostDelayedTask(std::unique_ptr<webrtc::QueuedTask> task,
104 uint32_t milliseconds);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200105
eladalonffe2e142017-08-31 04:36:05 -0700106 // std::enable_if is used here to make sure that calls to PostTask() with
107 // std::unique_ptr<SomeClassDerivedFromQueuedTask> would not end up being
108 // caught by this template.
109 template <class Closure,
Danil Chapovalov6f09ae22017-10-12 14:39:25 +0200110 typename std::enable_if<!std::is_convertible<
111 Closure,
Danil Chapovalov471783f2019-03-11 14:26:02 +0100112 std::unique_ptr<webrtc::QueuedTask>>::value>::type* = nullptr>
Danil Chapovalov6f09ae22017-10-12 14:39:25 +0200113 void PostTask(Closure&& closure) {
Danil Chapovalov1aa75812019-03-05 11:11:35 +0100114 PostTask(webrtc::ToQueuedTask(std::forward<Closure>(closure)));
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200115 }
116
117 // See documentation above for performance expectations.
Danil Chapovalov6f09ae22017-10-12 14:39:25 +0200118 template <class Closure,
119 typename std::enable_if<!std::is_convertible<
120 Closure,
Danil Chapovalov471783f2019-03-11 14:26:02 +0100121 std::unique_ptr<webrtc::QueuedTask>>::value>::type* = nullptr>
Danil Chapovalov6f09ae22017-10-12 14:39:25 +0200122 void PostDelayedTask(Closure&& closure, uint32_t milliseconds) {
Danil Chapovalov1aa75812019-03-05 11:11:35 +0100123 PostDelayedTask(webrtc::ToQueuedTask(std::forward<Closure>(closure)),
124 milliseconds);
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200125 }
126
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200127 private:
Danil Chapovalovd00405f2019-02-25 15:06:13 +0100128 webrtc::TaskQueueBase* const impl_;
Henrik Kjellanderec78f1c2017-06-29 07:52:50 +0200129
130 RTC_DISALLOW_COPY_AND_ASSIGN(TaskQueue);
131};
132
133} // namespace rtc
tommic06b1332016-05-14 11:31:40 -0700134
Mirko Bonadei92ea95e2017-09-15 06:47:31 +0200135#endif // RTC_BASE_TASK_QUEUE_H_