| /aosp_15_r20/external/libchrome/base/task/sequence_manager/ |
| H A D | work_queue_unittest.cc | 51 int enqueue_order, in FakeCancelableTaskWithEnqueueOrder() argument
57 EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeCancelableTaskWithEnqueueOrder()
61 TaskQueueImpl::Task FakeTaskWithEnqueueOrder(int enqueue_order) { in FakeTaskWithEnqueueOrder() argument
64 EnqueueOrder(), EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeTaskWithEnqueueOrder()
68 TaskQueueImpl::Task FakeNonNestableTaskWithEnqueueOrder(int enqueue_order) { in FakeNonNestableTaskWithEnqueueOrder() argument
71 EnqueueOrder(), EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeNonNestableTaskWithEnqueueOrder()
96 EnqueueOrder enqueue_order; in TEST_F() local
97 EXPECT_FALSE(work_queue_->GetFrontTaskEnqueueOrder(&enqueue_order)); in TEST_F()
105 EnqueueOrder enqueue_order; in TEST_F() local
106 EXPECT_TRUE(work_queue_->GetFrontTaskEnqueueOrder(&enqueue_order)); in TEST_F()
[all …]
|
| H A D | work_queue_sets.cc | 21 EnqueueOrder enqueue_order; in AddQueue() local
22 bool has_enqueue_order = work_queue->GetFrontTaskEnqueueOrder(&enqueue_order); in AddQueue()
27 work_queue_heaps_[set_index].insert({enqueue_order, work_queue}); in AddQueue()
44 EnqueueOrder enqueue_order; in ChangeSetIndex() local
45 bool has_enqueue_order = work_queue->GetFrontTaskEnqueueOrder(&enqueue_order); in ChangeSetIndex()
53 work_queue_heaps_[set_index].insert({enqueue_order, work_queue}); in ChangeSetIndex()
57 EnqueueOrder enqueue_order; in OnFrontTaskChanged() local
58 bool has_enqueue_order = work_queue->GetFrontTaskEnqueueOrder(&enqueue_order); in OnFrontTaskChanged()
62 {enqueue_order, work_queue}); in OnFrontTaskChanged()
69 EnqueueOrder enqueue_order; in OnTaskPushedToEmptyQueue() local
[all …]
|
| H A D | work_queue.cc | 49 return tasks_.empty() || tasks_.front().enqueue_order() >= fence_; in BlockedByFence()
52 bool WorkQueue::GetFrontTaskEnqueueOrder(EnqueueOrder* enqueue_order) const { in GetFrontTaskEnqueueOrder()
56 DCHECK_LE(tasks_.front().enqueue_order(), tasks_.back().enqueue_order()) in GetFrontTaskEnqueueOrder()
59 *enqueue_order = tasks_.front().enqueue_order(); in GetFrontTaskEnqueueOrder()
70 DCHECK(was_empty || tasks_.rbegin()->enqueue_order() < task.enqueue_order()); in Push()
94 DCHECK_LE(task.enqueue_order(), tasks_.front().enqueue_order()) in PushNonNestableTaskToFront()
218 EnqueueOrder enqueue_order; in ShouldRunBefore() local
220 bool have_task = GetFrontTaskEnqueueOrder(&enqueue_order); in ShouldRunBefore()
225 return enqueue_order < other_enqueue_order; in ShouldRunBefore()
|
| H A D | work_queue_sets_unittest.cc | 46 TaskQueueImpl::Task FakeTaskWithEnqueueOrder(int enqueue_order) { in FakeTaskWithEnqueueOrder() argument
49 EnqueueOrder(), EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeTaskWithEnqueueOrder()
53 TaskQueueImpl::Task FakeNonNestableTaskWithEnqueueOrder(int enqueue_order) { in FakeNonNestableTaskWithEnqueueOrder() argument
56 EnqueueOrder(), EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeNonNestableTaskWithEnqueueOrder()
117 EnqueueOrder enqueue_order; in TEST_F() local
119 set, &selected_work_queue, &enqueue_order)); in TEST_F()
121 EXPECT_EQ(10u, enqueue_order); in TEST_F()
|
| H A D | task_queue_impl.cc | 99 EnqueueOrder enqueue_order) in Task() argument
101 enqueue_order_(enqueue_order) { in Task()
304 EnqueueOrder sequence_number = task.enqueue_order(); in PushOntoImmediateIncomingQueueLocked()
352 main_thread_only().current_fence = task.enqueue_order(); in ReloadEmptyImmediateQueue()
648 immediate_incoming_queue().front().enqueue_order() > previous_fence && in InsertFence()
649 immediate_incoming_queue().front().enqueue_order() < current_fence) { in InsertFence()
679 immediate_incoming_queue().front().enqueue_order() > previous_fence) { in RemoveFence()
702 return immediate_incoming_queue().front().enqueue_order() > in BlockedByFence()
715 bool TaskQueueImpl::CouldTaskRun(EnqueueOrder enqueue_order) const { in CouldTaskRun()
722 return enqueue_order < main_thread_only().current_fence; in CouldTaskRun()
[all …]
|
| H A D | task_queue_impl.h | 116 EnqueueOrder enqueue_order);
126 EnqueueOrder enqueue_order() const { in enqueue_order() function
131 void set_enqueue_order(EnqueueOrder enqueue_order) { in set_enqueue_order() argument
133 enqueue_order_ = enqueue_order; in set_enqueue_order()
215 bool CouldTaskRun(EnqueueOrder enqueue_order) const;
|
| H A D | sequence_manager_impl.cc | 170 internal::EnqueueOrder enqueue_order) { in AddToIncomingImmediateWorkList() argument
178 task_queue->immediate_work_list_storage()->order = enqueue_order; in AddToIncomingImmediateWorkList()
279 internal::EnqueueOrder enqueue_order, in OnQueueHasIncomingImmediateWork() argument
281 if (AddToIncomingImmediateWorkList(queue, enqueue_order) && !queue_is_blocked) in OnQueueHasIncomingImmediateWork()
|
| H A D | sequence_manager_impl.h | 265 internal::EnqueueOrder enqueue_order,
272 internal::EnqueueOrder enqueue_order);
|
| /aosp_15_r20/external/cronet/base/task/sequence_manager/ |
| H A D | work_queue_unittest.cc | 72 Task FakeCancelableTaskWithEnqueueOrder(int enqueue_order, in FakeCancelableTaskWithEnqueueOrder() argument
77 EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeCancelableTaskWithEnqueueOrder()
81 Task FakeTaskWithEnqueueOrder(int enqueue_order) { in FakeTaskWithEnqueueOrder() argument
84 EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeTaskWithEnqueueOrder()
88 Task FakeNonNestableTaskWithEnqueueOrder(int enqueue_order) { in FakeNonNestableTaskWithEnqueueOrder() argument
91 EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeNonNestableTaskWithEnqueueOrder()
101 task_order.enqueue_order(), TimeTicks() + Milliseconds(1)); in FakeTaskWithTaskOrder()
105 Fence CreateFenceWithEnqueueOrder(int enqueue_order) { in CreateFenceWithEnqueueOrder() argument
107 EnqueueOrder::FromIntForTesting(enqueue_order))); in CreateFenceWithEnqueueOrder()
156 EXPECT_EQ(2ull, task_order->enqueue_order()); in TEST_F()
[all …]
|
| H A D | task_order.cc | 24 if (task_order1.enqueue_order() != task_order2.enqueue_order()) in Compare()
25 return cmp(task_order1.enqueue_order(), task_order2.enqueue_order()); in Compare()
38 TaskOrder TaskOrder::CreateForTesting(EnqueueOrder enqueue_order, in CreateForTesting() argument
41 return TaskOrder(enqueue_order, delayed_run_time, sequence_num); in CreateForTesting()
45 TaskOrder TaskOrder::CreateForTesting(EnqueueOrder enqueue_order) { in CreateForTesting() argument
46 return TaskOrder(enqueue_order, TimeTicks(), 0); in CreateForTesting()
49 TaskOrder::TaskOrder(EnqueueOrder enqueue_order, in TaskOrder() argument
52 : enqueue_order_(enqueue_order), in TaskOrder()
|
| H A D | work_queue.cc | 80 DCHECK(was_empty || tasks_.back().enqueue_order() < task.enqueue_order() || in Push()
82 tasks_.back().enqueue_order() == task.enqueue_order())); in Push()
116 work_queue_->tasks_.back().enqueue_order() < task.enqueue_order() || in Push()
118 work_queue_->tasks_.back().enqueue_order() == task.enqueue_order())); in Push()
153 DCHECK(task.enqueue_order() < tasks_.front().enqueue_order() || in PushNonNestableTaskToFront()
155 task.enqueue_order() == tasks_.front().enqueue_order())) in PushNonNestableTaskToFront()
|
| H A D | task_order_unittest.cc | 18 static TaskOrder MakeImmediateTaskOrder(int enqueue_order) { in MakeImmediateTaskOrder() argument
19 return MakeTaskOrder(enqueue_order, TimeTicks(), enqueue_order); in MakeImmediateTaskOrder()
22 static TaskOrder MakeDelayedTaskOrder(int enqueue_order, in MakeDelayedTaskOrder() argument
25 return MakeTaskOrder(enqueue_order, delayed_run_time, sequence_num); in MakeDelayedTaskOrder()
61 static TaskOrder MakeTaskOrder(int enqueue_order, in MakeTaskOrder() argument
65 EnqueueOrder::FromIntForTesting(enqueue_order), delayed_run_time, in MakeTaskOrder()
|
| H A D | fence.cc | 19 DCHECK_NE(task_order_.enqueue_order(), EnqueueOrder::none()); in Fence()
22 Fence::Fence(EnqueueOrder enqueue_order, in Fence() argument
25 : task_order_(enqueue_order, delayed_run_time, sequence_num) {} in Fence()
39 Fence Fence::CreateWithEnqueueOrder(EnqueueOrder enqueue_order) { in CreateWithEnqueueOrder() argument
40 return Fence(enqueue_order, TimeTicks(), 0); in CreateWithEnqueueOrder()
|
| H A D | work_queue_sets_unittest.cc | 70 Task FakeTaskWithEnqueueOrder(int enqueue_order) { in FakeTaskWithEnqueueOrder() argument
73 EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeTaskWithEnqueueOrder()
77 Task FakeNonNestableTaskWithEnqueueOrder(int enqueue_order) { in FakeNonNestableTaskWithEnqueueOrder() argument
80 EnqueueOrder::FromIntForTesting(enqueue_order)); in FakeNonNestableTaskWithEnqueueOrder()
90 task_order.enqueue_order(), TimeTicks() + Milliseconds(1)); in FakeTaskWithTaskOrder()
150 EXPECT_EQ(10u, work_queue_and_task_order->order.enqueue_order()); in TEST_F()
169 queue_and_order->order.enqueue_order()); in TEST_F()
396 EXPECT_EQ(3u, result[0]->enqueue_order()); // The order here isn't important. in TEST_F()
397 EXPECT_EQ(1u, result[1]->enqueue_order()); in TEST_F()
398 EXPECT_EQ(2u, result[2]->enqueue_order()); in TEST_F()
|
| H A D | task_order.h | 55 EnqueueOrder enqueue_order() const { return enqueue_order_; } in enqueue_order() function
62 static TaskOrder CreateForTesting(EnqueueOrder enqueue_order,
65 static TaskOrder CreateForTesting(EnqueueOrder enqueue_order);
75 TaskOrder(EnqueueOrder enqueue_order,
|
| H A D | tasks.h | 106 EnqueueOrder enqueue_order = EnqueueOrder(),
116 EnqueueOrder enqueue_order() const { in enqueue_order() function
121 void set_enqueue_order(EnqueueOrder enqueue_order) { in set_enqueue_order()
123 enqueue_order_ = enqueue_order; in set_enqueue_order()
|
| H A D | fence.h | 45 return task_order_.enqueue_order() == EnqueueOrder::blocking_fence(); in IsBlockingFence()
51 Fence(EnqueueOrder enqueue_order,
57 static Fence CreateWithEnqueueOrder(EnqueueOrder enqueue_order);
|
| H A D | task_queue_selector_unittest.cc | 106 void PushTask(const size_t queue_index, const size_t enqueue_order) { in PushTask() argument
109 EnqueueOrder::FromIntForTesting(enqueue_order))); in PushTask()
319 size_t enqueue_order[] = {10, 1, 2, 9, 4}; in TEST_F() local
321 PushTasksWithEnqueueOrder(queue_order, enqueue_order, 5); in TEST_F()
585 EXPECT_EQ(2u, result[0]->enqueue_order()); // The order here isn't important. in TEST_F()
586 EXPECT_EQ(3u, result[1]->enqueue_order()); in TEST_F()
587 EXPECT_EQ(4u, result[2]->enqueue_order()); in TEST_F()
|
| H A D | task_queue_impl.cc | 692 void TaskQueueImpl::OnWakeUp(LazyNow* lazy_now, EnqueueOrder enqueue_order) { in OnWakeUp() argument
693 MoveReadyDelayedTasksToWorkQueue(lazy_now, enqueue_order); in OnWakeUp()
725 EnqueueOrder enqueue_order) { in MoveReadyDelayedTasksToWorkQueue() argument
759 ready_task.set_enqueue_order(enqueue_order); in MoveReadyDelayedTasksToWorkQueue()
876 main_thread_only().current_fence->task_order().enqueue_order())); in AsValue()
1037 bool TaskQueueImpl::CouldTaskRun(EnqueueOrder enqueue_order) const { in CouldTaskRun()
1048 return enqueue_order < in CouldTaskRun()
1049 main_thread_only().current_fence->task_order().enqueue_order(); in CouldTaskRun()
1052 bool TaskQueueImpl::WasBlockedOrLowPriority(EnqueueOrder enqueue_order) const { in WasBlockedOrLowPriority()
1053 return enqueue_order < in WasBlockedOrLowPriority()
[all …]
|
| H A D | tasks.cc | 14 EnqueueOrder enqueue_order, in Task() argument
31 enqueue_order_(enqueue_order), in Task()
55 enqueue_order(), in task_order()
|
| H A D | task_queue_impl.h | 157 bool CouldTaskRun(EnqueueOrder enqueue_order) const;
162 bool WasBlockedOrLowPriority(EnqueueOrder enqueue_order) const;
221 EnqueueOrder enqueue_order);
223 void OnWakeUp(LazyNow* lazy_now, EnqueueOrder enqueue_order);
|
| H A D | wake_up_queue.cc | 89 EnqueueOrder enqueue_order) { in MoveReadyDelayedTasksToWorkQueues() argument
97 queue->OnWakeUp(lazy_now, enqueue_order); in MoveReadyDelayedTasksToWorkQueues()
|
| H A D | sequence_manager_impl.cc | 550 LOG(INFO) << "#" << static_cast<uint64_t>(task->enqueue_order()) << " " in LogTaskDebugInfo()
565 LOG(INFO) << "#" << static_cast<uint64_t>(task->enqueue_order()) << " " in LogTaskDebugInfo()
580 LOG(INFO) << "#" << static_cast<uint64_t>(task->enqueue_order()) << " " in LogTaskDebugInfo()
587 << static_cast<uint64_t>(skipped_task->enqueue_order()) << " " in LogTaskDebugInfo()
856 executing_task->pending_task.enqueue_order()); in NotifyWillProcessTask()
|
| /aosp_15_r20/out/soong/.intermediates/external/libchrome/libchrome-include/gen/gensrcs/external/libchrome/base/task/sequence_manager/ |
| D | task_queue_impl.h | 119 EnqueueOrder enqueue_order);
129 EnqueueOrder enqueue_order() const { in enqueue_order() function
134 void set_enqueue_order(EnqueueOrder enqueue_order) { in set_enqueue_order() argument
136 enqueue_order_ = enqueue_order; in set_enqueue_order()
218 bool CouldTaskRun(EnqueueOrder enqueue_order) const;
|
| /aosp_15_r20/out/soong/.intermediates/external/libchrome/libchrome-include/gen/5/external/libchrome/base/task/sequence_manager/ |
| D | task_queue_impl.h | 119 EnqueueOrder enqueue_order);
129 EnqueueOrder enqueue_order() const { in enqueue_order() function
134 void set_enqueue_order(EnqueueOrder enqueue_order) { in set_enqueue_order() argument
136 enqueue_order_ = enqueue_order; in set_enqueue_order()
218 bool CouldTaskRun(EnqueueOrder enqueue_order) const;
|