Avi Drissman | e4622aa | 2022-09-08 20:36:06 | [diff] [blame] | 1 | // Copyright 2019 The Chromium Authors |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
| 4 | |
Gabriel Charette | 52fa3ae | 2019-04-15 21:44:37 | [diff] [blame] | 5 | #ifndef BASE_TASK_THREAD_POOL_TASK_SOURCE_H_ |
| 6 | #define BASE_TASK_THREAD_POOL_TASK_SOURCE_H_ |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 7 | |
| 8 | #include <stddef.h> |
| 9 | |
| 10 | #include "base/base_export.h" |
Patrick Monette | 8a0eaaa | 2021-10-01 20:53:00 | [diff] [blame] | 11 | #include "base/containers/intrusive_heap.h" |
David Sanders | fc1f17fa | 2022-04-15 00:15:49 | [diff] [blame] | 12 | #include "base/dcheck_is_on.h" |
Keishi Hattori | 777c131a | 2024-04-18 10:57:49 | [diff] [blame] | 13 | #include "base/memory/raw_ptr_exclusion.h" |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 14 | #include "base/memory/ref_counted.h" |
Bartek Nowierski | ccca8de | 2024-04-11 13:53:27 | [diff] [blame] | 15 | #include "base/memory/stack_allocated.h" |
Etienne Pierre-doray | 31246215 | 2019-03-19 16:10:17 | [diff] [blame] | 16 | #include "base/sequence_token.h" |
Gabriel Charette | d3564838 | 2019-04-30 21:10:59 | [diff] [blame] | 17 | #include "base/task/common/checked_lock.h" |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 18 | #include "base/task/task_traits.h" |
Gabriel Charette | 52fa3ae | 2019-04-15 21:44:37 | [diff] [blame] | 19 | #include "base/task/thread_pool/task.h" |
Etienne Pierre-doray | eed6683 | 2020-09-02 01:47:11 | [diff] [blame] | 20 | #include "base/task/thread_pool/task_source_sort_key.h" |
Etienne Pierre-doray | 31246215 | 2019-03-19 16:10:17 | [diff] [blame] | 21 | #include "base/threading/sequence_local_storage_map.h" |
Abdias Dagbekpo | f0a619d | 2022-08-10 02:06:20 | [diff] [blame] | 22 | #include "base/time/time.h" |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 23 | |
| 24 | namespace base { |
| 25 | namespace internal { |
| 26 | |
Etienne Pierre-doray | f7f59c3 | 2019-05-24 16:50:53 | [diff] [blame] | 27 | class TaskTracker; |
| 28 | |
Etienne Pierre-doray | 45fd5d5 | 2019-03-28 15:19:55 | [diff] [blame] | 29 | enum class TaskSourceExecutionMode { |
| 30 | kParallel, |
| 31 | kSequenced, |
| 32 | kSingleThread, |
Etienne Pierre-doray | 36afadeb | 2019-07-12 21:19:41 | [diff] [blame] | 33 | kJob, |
| 34 | kMax = kJob, |
Etienne Pierre-doray | 45fd5d5 | 2019-03-28 15:19:55 | [diff] [blame] | 35 | }; |
| 36 | |
Etienne Pierre-doray | 31246215 | 2019-03-19 16:10:17 | [diff] [blame] | 37 | struct BASE_EXPORT ExecutionEnvironment { |
Bartek Nowierski | d34494f3b | 2024-04-11 17:12:36 | [diff] [blame] | 38 | STACK_ALLOCATED(); |
| 39 | |
| 40 | public: |
Etienne Pierre-doray | 173345c | 2024-01-09 21:14:41 | [diff] [blame] | 41 | ExecutionEnvironment(SequenceToken token) : token(token) {} |
| 42 | |
| 43 | ExecutionEnvironment(SequenceToken token, |
| 44 | SequenceLocalStorageMap* sequence_local_storage, |
| 45 | SingleThreadTaskRunner* single_thread_task_runner) |
| 46 | : token(token), |
| 47 | sequence_local_storage(sequence_local_storage), |
| 48 | single_thread_task_runner(single_thread_task_runner) {} |
| 49 | |
| 50 | ExecutionEnvironment(SequenceToken token, |
| 51 | SequenceLocalStorageMap* sequence_local_storage, |
| 52 | SequencedTaskRunner* sequenced_task_runner) |
| 53 | : token(token), |
| 54 | sequence_local_storage(sequence_local_storage), |
| 55 | sequenced_task_runner(sequenced_task_runner) {} |
| 56 | ~ExecutionEnvironment(); |
| 57 | |
| 58 | const SequenceToken token; |
Bartek Nowierski | d34494f3b | 2024-04-11 17:12:36 | [diff] [blame] | 59 | SequenceLocalStorageMap* const sequence_local_storage = nullptr; |
| 60 | SingleThreadTaskRunner* const single_thread_task_runner = nullptr; |
| 61 | SequencedTaskRunner* const sequenced_task_runner = nullptr; |
Etienne Pierre-doray | 31246215 | 2019-03-19 16:10:17 | [diff] [blame] | 62 | }; |
| 63 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 64 | // A TaskSource is a virtual class that provides a series of Tasks that must be |
Etienne Pierre-doray | 72ed28cb | 2022-12-01 01:20:16 | [diff] [blame] | 65 | // executed immediately or in the future. |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 66 | // |
Etienne Pierre-doray | 72ed28cb | 2022-12-01 01:20:16 | [diff] [blame] | 67 | // When a task source has delayed tasks but no immediate tasks, the scheduler |
| 68 | // must call OnBecomeReady() after HasReadyTasks(now) == true, which is |
| 69 | // guaranteed once now >= GetDelayedSortKey(). |
| 70 | // |
| 71 | // A task source is registered when it's ready to be added to the immediate |
| 72 | // queue. A task source is ready to be queued when either: |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 73 | // 1- It has new tasks that can run concurrently as a result of external |
Etienne Pierre-doray | 72ed28cb | 2022-12-01 01:20:16 | [diff] [blame] | 74 | // operations, e.g. posting a new immediate task to an empty Sequence or |
| 75 | // increasing max concurrency of a JobTaskSource; |
Abdias Dagbekpo | f0a619d | 2022-08-10 02:06:20 | [diff] [blame] | 76 | // 2- A worker finished running a task from it and both DidProcessTask() and |
| 77 | // WillReEnqueue() returned true; or |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 78 | // 3- A worker is about to run a task from it and WillRunTask() returned |
| 79 | // kAllowedNotSaturated. |
Etienne Pierre-doray | 72ed28cb | 2022-12-01 01:20:16 | [diff] [blame] | 80 | // 4- A delayed task became ready and OnBecomeReady() returns true. |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 81 | // |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 82 | // A worker may perform the following sequence of operations on a |
| 83 | // RegisteredTaskSource after obtaining it from the queue: |
| 84 | // 1- Check whether a task can run with WillRunTask() (and register/enqueue the |
| 85 | // task source again if not saturated). |
Etienne Pierre-doray | 388014e | 2019-09-13 18:40:52 | [diff] [blame] | 86 | // 2- (optional) Iff (1) determined that a task can run, access the next task |
| 87 | // with TakeTask(). |
| 88 | // 3- (optional) Execute the task. |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 89 | // 4- Inform the task source that a task was processed with DidProcessTask(), |
Abdias Dagbekpo | f0a619d | 2022-08-10 02:06:20 | [diff] [blame] | 90 | // and re-enqueue the task source iff requested. The task source is ready to |
| 91 | // run immediately iff WillReEnqueue() returns true. |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 92 | // When a task source is registered multiple times, many overlapping chains of |
| 93 | // operations may run concurrently, as permitted by WillRunTask(). This allows |
| 94 | // tasks from the same task source to run in parallel. |
| 95 | // However, the following invariants are kept: |
| 96 | // - The number of workers concurrently running tasks never goes over the |
| 97 | // intended concurrency. |
| 98 | // - If the task source has more tasks that can run concurrently, it must be |
| 99 | // queued. |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 100 | // |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 101 | // Note: there is a known refcounted-ownership cycle in the ThreadPool |
Etienne Pierre-doray | 36afadeb | 2019-07-12 21:19:41 | [diff] [blame] | 102 | // architecture: TaskSource -> TaskRunner -> TaskSource -> ... This is okay so |
| 103 | // long as the other owners of TaskSource (PriorityQueue and WorkerThread in |
Sean Maher | 36f23b5 | 2023-12-05 07:57:27 | [diff] [blame] | 104 | // alternation and ThreadGroup::WorkerThreadDelegateImpl::GetWork() |
Etienne Pierre-doray | 36afadeb | 2019-07-12 21:19:41 | [diff] [blame] | 105 | // temporarily) keep running it (and taking Tasks from it as a result). A |
| 106 | // dangling reference cycle would only occur should they release their reference |
| 107 | // to it while it's not empty. In other words, it is only correct for them to |
| 108 | // release it when DidProcessTask() returns false. |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 109 | // |
| 110 | // This class is thread-safe. |
| 111 | class BASE_EXPORT TaskSource : public RefCountedThreadSafe<TaskSource> { |
| 112 | public: |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 113 | // Indicates whether WillRunTask() allows TakeTask() to be called on a |
| 114 | // RegisteredTaskSource. |
| 115 | enum class RunStatus { |
| 116 | // TakeTask() cannot be called. |
| 117 | kDisallowed, |
Etienne Pierre-doray | 388014e | 2019-09-13 18:40:52 | [diff] [blame] | 118 | // TakeTask() may called, and the TaskSource has not reached its maximum |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 119 | // concurrency (i.e. the TaskSource still needs to be queued). |
| 120 | kAllowedNotSaturated, |
Etienne Pierre-doray | 388014e | 2019-09-13 18:40:52 | [diff] [blame] | 121 | // TakeTask() may called, and the TaskSource has reached its maximum |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 122 | // concurrency (i.e. the TaskSource no longer needs to be queued). |
| 123 | kAllowedSaturated, |
Etienne Pierre-doray | a57964d | 2019-07-08 22:04:55 | [diff] [blame] | 124 | }; |
| 125 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 126 | // A Transaction can perform multiple operations atomically on a |
| 127 | // TaskSource. While a Transaction is alive, it is guaranteed that nothing |
| 128 | // else will access the TaskSource; the TaskSource's lock is held for the |
Etienne Pierre-doray | 5c37231a | 2023-02-22 03:41:37 | [diff] [blame] | 129 | // lifetime of the Transaction. No Transaction must be held when ~TaskSource() |
| 130 | // is called. |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 131 | class BASE_EXPORT Transaction { |
Bartek Nowierski | ccca8de | 2024-04-11 13:53:27 | [diff] [blame] | 132 | STACK_ALLOCATED(); |
| 133 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 134 | public: |
| 135 | Transaction(Transaction&& other); |
David Bienvenu | 85cf749b | 2020-10-30 15:10:59 | [diff] [blame] | 136 | Transaction(const Transaction&) = delete; |
| 137 | Transaction& operator=(const Transaction&) = delete; |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 138 | ~Transaction(); |
| 139 | |
Etienne Pierre-doray | a57964d | 2019-07-08 22:04:55 | [diff] [blame] | 140 | operator bool() const { return !!task_source_; } |
| 141 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 142 | // Sets TaskSource priority to |priority|. |
| 143 | void UpdatePriority(TaskPriority priority); |
| 144 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 145 | // Returns the traits of all Tasks in the TaskSource. |
| 146 | TaskTraits traits() const { return task_source_->traits_; } |
| 147 | |
| 148 | TaskSource* task_source() const { return task_source_; } |
| 149 | |
Etienne Pierre-doray | 5c37231a | 2023-02-22 03:41:37 | [diff] [blame] | 150 | void Release(); |
| 151 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 152 | protected: |
| 153 | explicit Transaction(TaskSource* task_source); |
| 154 | |
| 155 | private: |
| 156 | friend class TaskSource; |
| 157 | |
Bartek Nowierski | 782d7bb | 2024-04-11 18:32:25 | [diff] [blame] | 158 | TaskSource* task_source_ = nullptr; |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 159 | }; |
| 160 | |
| 161 | // |traits| is metadata that applies to all Tasks in the TaskSource. |
Peter Kasting | 134ef9af | 2024-12-28 02:30:09 | [diff] [blame] | 162 | TaskSource(const TaskTraits& traits, TaskSourceExecutionMode execution_mode); |
David Bienvenu | 85cf749b | 2020-10-30 15:10:59 | [diff] [blame] | 163 | TaskSource(const TaskSource&) = delete; |
| 164 | TaskSource& operator=(const TaskSource&) = delete; |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 165 | |
| 166 | // Begins a Transaction. This method cannot be called on a thread which has an |
| 167 | // active TaskSource::Transaction. |
Daniel Cheng | 4455c984 | 2022-01-13 23:26:37 | [diff] [blame] | 168 | [[nodiscard]] Transaction BeginTransaction(); |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 169 | |
Etienne Pierre-doray | 31246215 | 2019-03-19 16:10:17 | [diff] [blame] | 170 | virtual ExecutionEnvironment GetExecutionEnvironment() = 0; |
| 171 | |
Etienne Pierre-doray | 36afadeb | 2019-07-12 21:19:41 | [diff] [blame] | 172 | // Thread-safe but the returned value may immediately be obsolete. As such |
| 173 | // this should only be used as a best-effort guess of how many more workers |
Etienne Pierre-doray | 3bca492 | 2019-08-13 20:56:56 | [diff] [blame] | 174 | // are needed. This may be called on an empty task source. |
Etienne Pierre-doray | 36afadeb | 2019-07-12 21:19:41 | [diff] [blame] | 175 | virtual size_t GetRemainingConcurrency() const = 0; |
Etienne Pierre-doray | a57964d | 2019-07-08 22:04:55 | [diff] [blame] | 176 | |
Etienne Pierre-doray | 1f51cc03 | 2020-09-15 17:40:48 | [diff] [blame] | 177 | // Returns a TaskSourceSortKey representing the priority of the TaskSource. |
Etienne Pierre-doray | c64a831 | 2022-08-25 22:02:35 | [diff] [blame] | 178 | virtual TaskSourceSortKey GetSortKey() const = 0; |
Abdias Dagbekpo | d932874 | 2022-08-10 20:31:57 | [diff] [blame] | 179 | // Returns a Timeticks object representing the next delayed runtime of the |
| 180 | // TaskSource. |
| 181 | virtual TimeTicks GetDelayedSortKey() const = 0; |
Etienne Pierre-doray | 72ed28cb | 2022-12-01 01:20:16 | [diff] [blame] | 182 | // Returns true if there are tasks ready to be executed. Thread-safe but the |
| 183 | // returned value may immediately be obsolete. |
| 184 | virtual bool HasReadyTasks(TimeTicks now) const = 0; |
| 185 | // Returns true if the TaskSource should be moved to the immediate queue |
| 186 | // due to ready delayed tasks. Note: Returns false if the TaskSource contains |
| 187 | // ready delayed tasks, but expects to already be in the immediate queue. |
| 188 | virtual bool OnBecomeReady() = 0; |
Etienne Pierre-doray | 1f51cc03 | 2020-09-15 17:40:48 | [diff] [blame] | 189 | |
Abdias Dagbekpo | 91eec58 | 2022-08-22 20:45:52 | [diff] [blame] | 190 | // Support for IntrusiveHeap in ThreadGroup::PriorityQueue. |
| 191 | void SetImmediateHeapHandle(const HeapHandle& handle); |
| 192 | void ClearImmediateHeapHandle(); |
| 193 | HeapHandle GetImmediateHeapHandle() const { |
| 194 | return immediate_pq_heap_handle_; |
| 195 | } |
Chris Hamilton | 9c9ce50 | 2019-08-22 20:53:18 | [diff] [blame] | 196 | |
Abdias Dagbekpo | 91eec58 | 2022-08-22 20:45:52 | [diff] [blame] | 197 | HeapHandle immediate_heap_handle() const { return immediate_pq_heap_handle_; } |
| 198 | |
| 199 | // Support for IntrusiveHeap in ThreadGroup::DelayedPriorityQueue. |
| 200 | void SetDelayedHeapHandle(const HeapHandle& handle); |
| 201 | void ClearDelayedHeapHandle(); |
| 202 | HeapHandle GetDelayedHeapHandle() const { return delayed_pq_heap_handle_; } |
| 203 | |
| 204 | HeapHandle delayed_heap_handle() const { return delayed_pq_heap_handle_; } |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 205 | |
| 206 | // Returns the shutdown behavior of all Tasks in the TaskSource. Can be |
| 207 | // accessed without a Transaction because it is never mutated. |
| 208 | TaskShutdownBehavior shutdown_behavior() const { |
| 209 | return traits_.shutdown_behavior(); |
| 210 | } |
Etienne Pierre-doray | ac368074 | 2019-08-29 17:43:17 | [diff] [blame] | 211 | // Returns a racy priority of the TaskSource. Can be accessed without a |
| 212 | // Transaction but may return an outdated result. |
| 213 | TaskPriority priority_racy() const { |
| 214 | return priority_racy_.load(std::memory_order_relaxed); |
| 215 | } |
| 216 | // Returns the thread policy of the TaskSource. Can be accessed without a |
| 217 | // Transaction because it is never mutated. |
| 218 | ThreadPolicy thread_policy() const { return traits_.thread_policy(); } |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 219 | |
Etienne Pierre-doray | 45fd5d5 | 2019-03-28 15:19:55 | [diff] [blame] | 220 | TaskSourceExecutionMode execution_mode() const { return execution_mode_; } |
| 221 | |
Abdias Dagbekpo | 6148d12 | 2022-08-23 17:36:39 | [diff] [blame] | 222 | void ClearForTesting(); |
| 223 | |
Etienne Bergeron | 872a6a64 | 2025-03-21 19:57:13 | [diff] [blame] | 224 | const TaskTraits& traits() const { return traits_; } |
| 225 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 226 | protected: |
| 227 | virtual ~TaskSource(); |
| 228 | |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 229 | virtual RunStatus WillRunTask() = 0; |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 230 | |
Abdias Dagbekpo | f0a619d | 2022-08-10 02:06:20 | [diff] [blame] | 231 | // Implementations of TakeTask(), DidProcessTask(), WillReEnqueue(), and |
| 232 | // Clear() must ensure proper synchronization iff |transaction| is nullptr. |
Etienne Pierre-doray | d9901d9 | 2019-11-09 03:21:37 | [diff] [blame] | 233 | virtual Task TakeTask(TaskSource::Transaction* transaction) = 0; |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 234 | virtual bool DidProcessTask(TaskSource::Transaction* transaction) = 0; |
Abdias Dagbekpo | f0a619d | 2022-08-10 02:06:20 | [diff] [blame] | 235 | virtual bool WillReEnqueue(TimeTicks now, |
| 236 | TaskSource::Transaction* transaction) = 0; |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 237 | |
| 238 | // This may be called for each outstanding RegisteredTaskSource that's ready. |
| 239 | // The implementation needs to support this being called multiple times; |
| 240 | // unless it guarantees never to hand-out multiple RegisteredTaskSources that |
| 241 | // are concurrently ready. |
Arthur Sonzogni | e5fff99c | 2024-02-21 15:58:24 | [diff] [blame] | 242 | virtual std::optional<Task> Clear(TaskSource::Transaction* transaction) = 0; |
Etienne Pierre-doray | 45fd5d5 | 2019-03-28 15:19:55 | [diff] [blame] | 243 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 244 | // Sets TaskSource priority to |priority|. |
| 245 | void UpdatePriority(TaskPriority priority); |
| 246 | |
| 247 | // The TaskTraits of all Tasks in the TaskSource. |
| 248 | TaskTraits traits_; |
| 249 | |
Etienne Pierre-doray | ac368074 | 2019-08-29 17:43:17 | [diff] [blame] | 250 | // The cached priority for atomic access. |
| 251 | std::atomic<TaskPriority> priority_racy_; |
| 252 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 253 | // Synchronizes access to all members. |
Gabriel Charette | d3564838 | 2019-04-30 21:10:59 | [diff] [blame] | 254 | mutable CheckedLock lock_{UniversalPredecessor()}; |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 255 | |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 256 | private: |
| 257 | friend class RefCountedThreadSafe<TaskSource>; |
| 258 | friend class RegisteredTaskSource; |
| 259 | |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 260 | // The TaskSource's position in its current PriorityQueue. Access is protected |
| 261 | // by the PriorityQueue's lock. |
Abdias Dagbekpo | 91eec58 | 2022-08-22 20:45:52 | [diff] [blame] | 262 | HeapHandle immediate_pq_heap_handle_; |
| 263 | |
| 264 | // The TaskSource's position in its current DelayedPriorityQueue. Access is |
| 265 | // protected by the DelayedPriorityQueue's lock. |
| 266 | HeapHandle delayed_pq_heap_handle_; |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 267 | |
Etienne Pierre-doray | 45fd5d5 | 2019-03-28 15:19:55 | [diff] [blame] | 268 | TaskSourceExecutionMode execution_mode_; |
Etienne Pierre-doray | b38e0fd | 2019-03-18 19:35:38 | [diff] [blame] | 269 | }; |
| 270 | |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 271 | // Wrapper around TaskSource to signify the intent to queue and run it. |
| 272 | // RegisteredTaskSource can only be created with TaskTracker and may only be |
| 273 | // used by a single worker at a time. However, the same task source may be |
| 274 | // registered several times, spawning multiple RegisteredTaskSources. A |
| 275 | // RegisteredTaskSource resets to its initial state when WillRunTask() fails |
Abdias Dagbekpo | f0a619d | 2022-08-10 02:06:20 | [diff] [blame] | 276 | // or after DidProcessTask() and WillReEnqueue(), so it can be used again. |
Etienne Pierre-doray | f7f59c3 | 2019-05-24 16:50:53 | [diff] [blame] | 277 | class BASE_EXPORT RegisteredTaskSource { |
| 278 | public: |
| 279 | RegisteredTaskSource(); |
| 280 | RegisteredTaskSource(std::nullptr_t); |
Etienne Pierre-doray | a57964d | 2019-07-08 22:04:55 | [diff] [blame] | 281 | RegisteredTaskSource(RegisteredTaskSource&& other) noexcept; |
David Bienvenu | 85cf749b | 2020-10-30 15:10:59 | [diff] [blame] | 282 | RegisteredTaskSource(const RegisteredTaskSource&) = delete; |
| 283 | RegisteredTaskSource& operator=(const RegisteredTaskSource&) = delete; |
Etienne Pierre-doray | f7f59c3 | 2019-05-24 16:50:53 | [diff] [blame] | 284 | ~RegisteredTaskSource(); |
| 285 | |
| 286 | RegisteredTaskSource& operator=(RegisteredTaskSource&& other); |
| 287 | |
| 288 | operator bool() const { return task_source_ != nullptr; } |
Etienne Pierre-doray | f7f59c3 | 2019-05-24 16:50:53 | [diff] [blame] | 289 | TaskSource* operator->() const { return task_source_.get(); } |
| 290 | TaskSource* get() const { return task_source_.get(); } |
| 291 | |
| 292 | static RegisteredTaskSource CreateForTesting( |
| 293 | scoped_refptr<TaskSource> task_source, |
| 294 | TaskTracker* task_tracker = nullptr); |
| 295 | |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 296 | // Can only be called if this RegisteredTaskSource is in its initial state. |
| 297 | // Returns the underlying task source. An Optional is used in preparation for |
| 298 | // the merge between ThreadPool and TaskQueueManager (in Blink). |
| 299 | // https://crbug.com/783309 |
Etienne Pierre-doray | f7f59c3 | 2019-05-24 16:50:53 | [diff] [blame] | 300 | scoped_refptr<TaskSource> Unregister(); |
| 301 | |
Etienne Pierre-doray | edbacbf | 2019-08-23 01:56:05 | [diff] [blame] | 302 | // Informs this TaskSource that the current worker would like to run a Task |
| 303 | // from it. Can only be called if in its initial state. Returns a RunStatus |
| 304 | // that indicates if the operation is allowed (TakeTask() can be called). |
| 305 | TaskSource::RunStatus WillRunTask(); |
|
|