Chromium Code Reviews| Index: base/task_scheduler/sequence.h |
| diff --git a/base/task_scheduler/sequence.h b/base/task_scheduler/sequence.h |
| new file mode 100644 |
| index 0000000000000000000000000000000000000000..8931bd9169f6cc6b283d33a6c1b8909630d3a0bb |
| --- /dev/null |
| +++ b/base/task_scheduler/sequence.h |
| @@ -0,0 +1,69 @@ |
| +// Copyright 2016 The Chromium Authors. All rights reserved. |
| +// Use of this source code is governed by a BSD-style license that can be |
| +// found in the LICENSE file. |
| + |
| +#ifndef BASE_TASK_SCHEDULER_SEQUENCE_H_ |
| +#define BASE_TASK_SCHEDULER_SEQUENCE_H_ |
| + |
| +#include <stddef.h> |
| + |
| +#include <queue> |
| + |
| +#include "base/base_export.h" |
| +#include "base/macros.h" |
| +#include "base/memory/ref_counted.h" |
| +#include "base/memory/scoped_ptr.h" |
| +#include "base/task_scheduler/scheduler_lock.h" |
| +#include "base/task_scheduler/sequence_sort_key.h" |
| +#include "base/task_scheduler/task.h" |
| +#include "base/task_scheduler/task_traits.h" |
| + |
| +namespace base { |
| +namespace internal { |
| + |
| +// A sequence holds tasks that must be executed in posting order. This class is |
| +// thread-safe. |
| +class BASE_EXPORT Sequence : public RefCountedThreadSafe<Sequence> { |
| + public: |
| + Sequence(); |
| + |
| + // Adds |task| at the end of the sequence's queue. Returns true if the |
| + // sequence was empty right before the push. |
|
gab
2016/02/18 20:22:34
s/right before the push/before this operation/
fdoray
2016/02/18 20:52:04
Done.
|
| + bool PushTask(scoped_ptr<Task> task); |
| + |
| + // Returns the task in front of the sequence's queue, if any. |
| + const Task* PeekTask(); |
|
gab
2016/02/18 20:28:10
const method (you can make |lock_| mutable)
fdoray
2016/02/18 20:52:04
Done.
|
| + |
| + // Removes the task in front of the sequence's queue. Returns true if the |
| + // sequence is empty right after the pop. Cannot be called on an empty |
|
gab
2016/02/18 20:22:34
s/right after the pop/after this operation/
fdoray
2016/02/18 20:52:04
Done.
|
| + // sequence. |
| + bool PopTask(); |
| + |
| + // Returns a SequenceSortKey to use when inserting the sequence in a priority |
| + // queue. Cannot be called on an empty sequence. |
| + SequenceSortKey GetSortKey(); |
|
gab
2016/02/18 20:28:10
const method as well
fdoray
2016/02/18 20:52:04
Done.
|
| + |
| + private: |
| + friend class RefCountedThreadSafe<Sequence>; |
| + ~Sequence(); |
| + |
| + // Controls access to all members. |
| + SchedulerLock lock_; |
| + |
| + // Queue of tasks to execute. |
| + std::queue<scoped_ptr<Task>> queue_; |
| + |
| + // Number of task priorities in the TaskPriority enum. |
| + static const size_t kNumTaskPriorities = |
| + static_cast<TaskPriorityUnderlyingType>(TaskPriority::HIGHEST) + 1; |
| + |
| + // Number of tasks contained in the sequence for each priority. |
| + size_t num_tasks_per_priority_[kNumTaskPriorities] = {}; |
| + |
| + DISALLOW_COPY_AND_ASSIGN(Sequence); |
| +}; |
| + |
| +} // namespace internal |
| +} // namespace base |
| + |
| +#endif // BASE_TASK_SCHEDULER_SEQUENCE_H_ |