Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(448)

Unified Diff: components/scheduler/child/task_queue_impl.cc

Issue 1277923002: Revert of Explicitly track the scheduler task enqueueing order in a new field (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Created 5 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
« no previous file with comments | « components/scheduler/child/task_queue_impl.h ('k') | components/scheduler/child/task_queue_manager.h » ('j') | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
Index: components/scheduler/child/task_queue_impl.cc
diff --git a/components/scheduler/child/task_queue_impl.cc b/components/scheduler/child/task_queue_impl.cc
index 17a32b0197aaac773cc531228ce3589cd8e24194..c422abd4634a17904fbb990b9d29eb502cc6611a 100644
--- a/components/scheduler/child/task_queue_impl.cc
+++ b/components/scheduler/child/task_queue_impl.cc
@@ -17,6 +17,7 @@
: thread_id_(base::PlatformThread::CurrentId()),
task_queue_manager_(task_queue_manager),
pump_policy_(spec.pump_policy),
+ delayed_task_sequence_number_(0),
name_(spec.name),
disabled_by_default_tracing_category_(
disabled_by_default_tracing_category),
@@ -29,36 +30,12 @@
TaskQueueImpl::~TaskQueueImpl() {}
-TaskQueueImpl::Task::Task()
- : PendingTask(tracked_objects::Location(),
- base::Closure(),
- base::TimeTicks(),
- true),
-#ifndef NDEBUG
- enqueue_order_set_(false),
-#endif
- enqueue_order_(0) {
- sequence_num = 0;
-}
-
-TaskQueueImpl::Task::Task(const tracked_objects::Location& posted_from,
- const base::Closure& task,
- int sequence_number,
- bool nestable)
- : PendingTask(posted_from, task, base::TimeTicks(), nestable),
-#ifndef NDEBUG
- enqueue_order_set_(false),
-#endif
- enqueue_order_(0) {
- sequence_num = sequence_number;
-}
-
void TaskQueueImpl::WillDeleteTaskQueueManager() {
base::AutoLock lock(lock_);
task_queue_manager_ = nullptr;
- delayed_task_queue_ = std::priority_queue<Task>();
- incoming_queue_ = std::queue<Task>();
- work_queue_ = std::queue<Task>();
+ delayed_task_queue_ = base::DelayedTaskQueue();
+ incoming_queue_ = base::TaskQueue();
+ work_queue_ = base::TaskQueue();
}
bool TaskQueueImpl::RunsTasksOnCurrentThread() const {
@@ -115,14 +92,14 @@
TaskType task_type) {
lock_.AssertAcquired();
DCHECK(task_queue_manager_);
- Task pending_task(from_here, task,
- task_queue_manager_->GetNextSequenceNumber(),
- task_type != TaskType::NON_NESTABLE);
+
+ base::PendingTask pending_task(from_here, task, base::TimeTicks(),
+ task_type != TaskType::NON_NESTABLE);
task_queue_manager_->DidQueueTask(pending_task);
if (!desired_run_time.is_null()) {
pending_task.delayed_run_time = std::max(lazy_now->Now(), desired_run_time);
- // TODO(alexclarke): consider emplace() when C++11 library features allowed.
+ pending_task.sequence_num = delayed_task_sequence_number_++;
delayed_task_queue_.push(pending_task);
TraceQueueSize(true);
// If we changed the topmost task, then it is time to reschedule.
@@ -130,8 +107,7 @@
ScheduleDelayedWorkLocked(lazy_now);
return true;
}
- pending_task.set_enqueue_order(pending_task.sequence_num);
- EnqueueTaskLocked(pending_task, EnqueueOrderPolicy::DONT_SET_ENQUEUE_ORDER);
+ EnqueueTaskLocked(pending_task);
return true;
}
@@ -153,9 +129,7 @@
delayed_task_queue_.top().delayed_run_time <= lazy_now->Now()) {
in_flight_kick_delayed_tasks_.erase(
delayed_task_queue_.top().delayed_run_time);
- // TODO(alexclarke): consider std::move() when allowed.
- EnqueueTaskLocked(delayed_task_queue_.top(),
- EnqueueOrderPolicy::SET_ENQUEUE_ORDER);
+ EnqueueTaskLocked(delayed_task_queue_.top());
delayed_task_queue_.pop();
}
TraceQueueSize(true);
@@ -207,7 +181,7 @@
}
}
-bool TaskQueueImpl::TaskIsOlderThanQueuedTasks(const Task* task) {
+bool TaskQueueImpl::TaskIsOlderThanQueuedTasks(const base::PendingTask* task) {
lock_.AssertAcquired();
// A null task is passed when UpdateQueue is called before any task is run.
// In this case we don't want to pump an after_wakeup queue, so return true
@@ -219,12 +193,19 @@
if (incoming_queue_.empty())
return false;
- const TaskQueueImpl::Task& oldest_queued_task = incoming_queue_.front();
- return task->enqueue_order() < oldest_queued_task.enqueue_order();
-}
-
-bool TaskQueueImpl::ShouldAutoPumpQueueLocked(bool should_trigger_wakeup,
- const Task* previous_task) {
+ base::PendingTask oldest_queued_task = incoming_queue_.front();
+ DCHECK(oldest_queued_task.delayed_run_time.is_null());
+ DCHECK(task->delayed_run_time.is_null());
+
+ // Note: the comparison is correct due to the fact that the PendingTask
+ // operator inverts its comparison operation in order to work well in a heap
+ // based priority queue.
+ return oldest_queued_task < *task;
+}
+
+bool TaskQueueImpl::ShouldAutoPumpQueueLocked(
+ bool should_trigger_wakeup,
+ const base::PendingTask* previous_task) {
lock_.AssertAcquired();
if (pump_policy_ == PumpPolicy::MANUAL)
return false;
@@ -247,13 +228,13 @@
void TaskQueueImpl::UpdateWorkQueue(LazyNow* lazy_now,
bool should_trigger_wakeup,
- const Task* previous_task) {
+ const base::PendingTask* previous_task) {
DCHECK(work_queue_.empty());
base::AutoLock lock(lock_);
if (!ShouldAutoPumpQueueLocked(should_trigger_wakeup, previous_task))
return;
MoveReadyDelayedTasksToIncomingQueueLocked(lazy_now);
- std::swap(work_queue_, incoming_queue_);
+ work_queue_.Swap(&incoming_queue_);
// |incoming_queue_| is now empty so TaskQueueManager::UpdateQueues no
// longer needs to consider this queue for reloading.
task_queue_manager_->UnregisterAsUpdatableTaskQueue(this);
@@ -264,9 +245,8 @@
}
}
-TaskQueueImpl::Task TaskQueueImpl::TakeTaskFromWorkQueue() {
- // TODO(alexclarke): consider std::move() when allowed.
- Task pending_task = work_queue_.front();
+base::PendingTask TaskQueueImpl::TakeTaskFromWorkQueue() {
+ base::PendingTask pending_task = work_queue_.front();
work_queue_.pop();
DCHECK(task_queue_manager_);
task_queue_manager_->selector_.GetTaskQueueSets()->OnPopQueue(this);
@@ -291,8 +271,7 @@
lock_.Release();
}
-void TaskQueueImpl::EnqueueTaskLocked(const Task& pending_task,
- EnqueueOrderPolicy enqueue_order_policy) {
+void TaskQueueImpl::EnqueueTaskLocked(const base::PendingTask& pending_task) {
lock_.AssertAcquired();
if (!task_queue_manager_)
return;
@@ -300,11 +279,14 @@
task_queue_manager_->RegisterAsUpdatableTaskQueue(this);
if (pump_policy_ == PumpPolicy::AUTO && incoming_queue_.empty())
task_queue_manager_->MaybePostDoWorkOnMainRunner();
- // TODO(alexclarke): consider std::move() when allowed.
incoming_queue_.push(pending_task);
- if (enqueue_order_policy == EnqueueOrderPolicy::SET_ENQUEUE_ORDER) {
- incoming_queue_.back().set_enqueue_order(
- task_queue_manager_->GetNextSequenceNumber());
+ incoming_queue_.back().sequence_num =
+ task_queue_manager_->GetNextSequenceNumber();
+
+ if (!pending_task.delayed_run_time.is_null()) {
+ // Clear the delayed run time because we've already applied the delay
+ // before getting here.
+ incoming_queue_.back().delayed_run_time = base::TimeTicks();
}
TraceQueueSize(true);
}
@@ -327,7 +309,6 @@
bool was_empty = work_queue_.empty();
while (!incoming_queue_.empty()) {
- // TODO(alexclarke): consider std::move() when allowed.
work_queue_.push(incoming_queue_.front());
incoming_queue_.pop();
}
@@ -350,15 +331,15 @@
return name_;
}
-bool TaskQueueImpl::GetWorkQueueFrontTaskEnqueueOrder(
- int* enqueue_order) const {
+bool TaskQueueImpl::GetWorkQueueFrontTaskAge(int* age) const {
if (work_queue_.empty())
return false;
- *enqueue_order = work_queue_.front().enqueue_order();
+ *age = work_queue_.front().sequence_num;
return true;
}
-void TaskQueueImpl::PushTaskOntoWorkQueueForTest(const Task& task) {
+void TaskQueueImpl::PushTaskOntoWorkQueueForTest(
+ const base::PendingTask& task) {
work_queue_.push(task);
}
@@ -452,9 +433,9 @@
}
// static
-void TaskQueueImpl::QueueAsValueInto(const std::queue<Task>& queue,
+void TaskQueueImpl::QueueAsValueInto(const base::TaskQueue& queue,
base::trace_event::TracedValue* state) {
- std::queue<Task> queue_copy(queue);
+ base::TaskQueue queue_copy(queue);
while (!queue_copy.empty()) {
TaskAsValueInto(queue_copy.front(), state);
queue_copy.pop();
@@ -462,9 +443,9 @@
}
// static
-void TaskQueueImpl::QueueAsValueInto(const std::priority_queue<Task>& queue,
+void TaskQueueImpl::QueueAsValueInto(const base::DelayedTaskQueue& queue,
base::trace_event::TracedValue* state) {
- std::priority_queue<Task> queue_copy(queue);
+ base::DelayedTaskQueue queue_copy(queue);
while (!queue_copy.empty()) {
TaskAsValueInto(queue_copy.top(), state);
queue_copy.pop();
@@ -472,11 +453,10 @@
}
// static
-void TaskQueueImpl::TaskAsValueInto(const Task& task,
+void TaskQueueImpl::TaskAsValueInto(const base::PendingTask& task,
base::trace_event::TracedValue* state) {
state->BeginDictionary();
state->SetString("posted_from", task.posted_from.ToString());
- state->SetInteger("enqueue_order", task.enqueue_order());
state->SetInteger("sequence_num", task.sequence_num);
state->SetBoolean("nestable", task.nestable);
state->SetBoolean("is_high_res", task.is_high_res);
« no previous file with comments | « components/scheduler/child/task_queue_impl.h ('k') | components/scheduler/child/task_queue_manager.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698