OLD | NEW |
1 // Copyright 2016 The Chromium Authors. All rights reserved. | 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "base/task_scheduler/utils.h" | 5 #include "base/task_scheduler/utils.h" |
6 | 6 |
7 #include <utility> | 7 #include <utility> |
8 | 8 |
9 #include "base/logging.h" | 9 #include "base/logging.h" |
10 #include "base/memory/ptr_util.h" | 10 #include "base/memory/ptr_util.h" |
| 11 #include "base/task_scheduler/delayed_task_manager.h" |
11 #include "base/task_scheduler/priority_queue.h" | 12 #include "base/task_scheduler/priority_queue.h" |
12 #include "base/task_scheduler/scheduler_task_executor.h" | 13 #include "base/task_scheduler/scheduler_task_executor.h" |
13 #include "base/task_scheduler/sequence_sort_key.h" | 14 #include "base/task_scheduler/sequence_sort_key.h" |
14 #include "base/task_scheduler/task_tracker.h" | 15 #include "base/task_scheduler/task_tracker.h" |
15 #include "base/time/time.h" | 16 #include "base/time/time.h" |
16 | 17 |
17 namespace base { | 18 namespace base { |
18 namespace internal { | 19 namespace internal { |
19 | 20 |
20 bool PostTaskToExecutor(std::unique_ptr<Task> task, | 21 bool PostTaskToExecutor(std::unique_ptr<Task> task, |
21 scoped_refptr<Sequence> sequence, | 22 scoped_refptr<Sequence> sequence, |
22 SchedulerTaskExecutor* executor, | 23 SchedulerTaskExecutor* executor, |
23 TaskTracker* task_tracker) { | 24 TaskTracker* task_tracker, |
| 25 DelayedTaskManager* delayed_task_manager) { |
24 DCHECK(task); | 26 DCHECK(task); |
25 DCHECK(sequence); | 27 DCHECK(sequence); |
26 DCHECK(executor); | 28 DCHECK(executor); |
27 DCHECK(task_tracker); | 29 DCHECK(task_tracker); |
28 | 30 DCHECK(delayed_task_manager); |
29 // TODO(fdoray): Support delayed tasks. | |
30 DCHECK(task->delayed_run_time.is_null()); | |
31 | 31 |
32 if (!task_tracker->WillPostTask(task.get())) | 32 if (!task_tracker->WillPostTask(task.get())) |
33 return false; | 33 return false; |
34 | 34 |
35 executor->PostTaskWithSequence(std::move(task), std::move(sequence)); | 35 if (task->delayed_run_time.is_null()) { |
| 36 executor->PostTaskWithSequence(std::move(task), std::move(sequence)); |
| 37 } else { |
| 38 delayed_task_manager->AddDelayedTask(std::move(task), std::move(sequence), |
| 39 executor); |
| 40 } |
| 41 |
36 return true; | 42 return true; |
37 } | 43 } |
38 | 44 |
39 bool AddTaskToSequenceAndPriorityQueue(std::unique_ptr<Task> task, | 45 bool AddTaskToSequenceAndPriorityQueue(std::unique_ptr<Task> task, |
40 scoped_refptr<Sequence> sequence, | 46 scoped_refptr<Sequence> sequence, |
41 PriorityQueue* priority_queue) { | 47 PriorityQueue* priority_queue) { |
42 DCHECK(task); | 48 DCHECK(task); |
43 DCHECK(sequence); | 49 DCHECK(sequence); |
44 DCHECK(priority_queue); | 50 DCHECK(priority_queue); |
45 | 51 |
(...skipping 13 matching lines...) Expand all Loading... |
59 priority_queue->BeginTransaction()->Push( | 65 priority_queue->BeginTransaction()->Push( |
60 WrapUnique(new PriorityQueue::SequenceAndSortKey(std::move(sequence), | 66 WrapUnique(new PriorityQueue::SequenceAndSortKey(std::move(sequence), |
61 sequence_sort_key))); | 67 sequence_sort_key))); |
62 } | 68 } |
63 | 69 |
64 return sequence_was_empty; | 70 return sequence_was_empty; |
65 } | 71 } |
66 | 72 |
67 } // namespace internal | 73 } // namespace internal |
68 } // namespace base | 74 } // namespace base |
OLD | NEW |