OLD | NEW |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 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 #ifndef THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_WORK_QUEUE_SETS_H_ | 5 #ifndef THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_WORK_QUEUE_SETS_H_ |
6 #define THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_WORK_QUEUE_SETS_H_ | 6 #define THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_WORK_QUEUE_SETS_H_ |
7 | 7 |
8 #include <stddef.h> | 8 #include <stddef.h> |
9 | 9 |
10 #include <map> | 10 #include <map> |
11 #include <vector> | 11 #include <vector> |
12 | 12 |
13 #include "base/logging.h" | 13 #include "base/logging.h" |
14 #include "base/macros.h" | 14 #include "base/macros.h" |
15 #include "base/trace_event/trace_event_argument.h" | 15 #include "base/trace_event/trace_event_argument.h" |
16 #include "platform/scheduler/base/intrusive_heap.h" | 16 #include "platform/scheduler/base/intrusive_heap.h" |
17 #include "platform/scheduler/base/task_queue_impl.h" | 17 #include "platform/scheduler/base/task_queue_impl.h" |
18 #include "platform/scheduler/base/work_queue.h" | 18 #include "platform/scheduler/base/work_queue.h" |
19 #include "public/platform/WebCommon.h" | 19 #include "public/platform/WebCommon.h" |
20 | 20 |
21 namespace blink { | 21 namespace blink { |
22 namespace scheduler { | 22 namespace scheduler { |
23 namespace internal { | 23 namespace internal { |
24 class TaskQueueImpl; | |
25 | 24 |
26 // There is a WorkQueueSet for each scheduler priority and each WorkQueueSet | 25 // There is a WorkQueueSet for each scheduler priority and each WorkQueueSet |
27 // uses a EnqueueOrderToWorkQueueMap to keep track of which queue in the set has | 26 // uses a EnqueueOrderToWorkQueueMap to keep track of which queue in the set has |
28 // the oldest task (i.e. the one that should be run next if the | 27 // the oldest task (i.e. the one that should be run next if the |
29 // TaskQueueSelector chooses to run a task a given priority). The reason this | 28 // TaskQueueSelector chooses to run a task a given priority). The reason this |
30 // works is because std::map is a tree based associative container and all the | 29 // works is because std::map is a tree based associative container and all the |
31 // values are kept in sorted order. | 30 // values are kept in sorted order. |
32 class BLINK_PLATFORM_EXPORT WorkQueueSets { | 31 class BLINK_PLATFORM_EXPORT WorkQueueSets { |
33 public: | 32 public: |
34 WorkQueueSets(size_t num_sets, const char* name); | 33 WorkQueueSets(size_t num_sets, const char* name); |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
84 const char* name_; | 83 const char* name_; |
85 | 84 |
86 DISALLOW_COPY_AND_ASSIGN(WorkQueueSets); | 85 DISALLOW_COPY_AND_ASSIGN(WorkQueueSets); |
87 }; | 86 }; |
88 | 87 |
89 } // namespace internal | 88 } // namespace internal |
90 } // namespace scheduler | 89 } // namespace scheduler |
91 } // namespace blink | 90 } // namespace blink |
92 | 91 |
93 #endif // THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_WORK_QUEUE_SETS_H_ | 92 #endif // THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_WORK_QUEUE_SETS_H_ |
OLD | NEW |