OLD | NEW |
---|---|
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 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 CC_RESOURCES_WORKER_POOL_H_ | 5 #ifndef CC_RESOURCES_WORKER_POOL_H_ |
6 #define CC_RESOURCES_WORKER_POOL_H_ | 6 #define CC_RESOURCES_WORKER_POOL_H_ |
7 | 7 |
8 #include <deque> | 8 #include <deque> |
9 #include <string> | 9 #include <string> |
10 #include <vector> | 10 #include <vector> |
(...skipping 90 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
101 public: | 101 public: |
102 virtual ~WorkerPool(); | 102 virtual ~WorkerPool(); |
103 | 103 |
104 // Tells the worker pool to shutdown and returns once all pending tasks have | 104 // Tells the worker pool to shutdown and returns once all pending tasks have |
105 // completed. | 105 // completed. |
106 virtual void Shutdown(); | 106 virtual void Shutdown(); |
107 | 107 |
108 // Force a check for completed tasks. | 108 // Force a check for completed tasks. |
109 virtual void CheckForCompletedTasks(); | 109 virtual void CheckForCompletedTasks(); |
110 | 110 |
111 protected: | 111 // Implemented in RWP to avoid circular dependency. |
112 static int GetNumRasterThreads(); | |
reveman
2014/01/06 20:01:35
Use the comment from RasterWorkerPool here instead
sohanjg
2014/01/07 08:35:23
Done.
| |
113 | |
112 // A task graph contains a unique set of tasks with edges between | 114 // A task graph contains a unique set of tasks with edges between |
113 // dependencies pointing in the direction of the dependents. Each task | 115 // dependencies pointing in the direction of the dependents. Each task |
114 // need to be assigned a unique priority and a run count that matches | 116 // need to be assigned a unique priority and a run count that matches |
115 // the number of dependencies. | 117 // the number of dependencies. |
116 typedef base::ScopedPtrHashMap<internal::WorkerPoolTask*, internal::GraphNode> | 118 typedef base::ScopedPtrHashMap<internal::WorkerPoolTask*, internal::GraphNode> |
117 GraphNodeMap; | 119 GraphNodeMap; |
118 typedef GraphNodeMap TaskGraph; | 120 typedef GraphNodeMap TaskGraph; |
121 typedef std::vector<scoped_refptr<internal::WorkerPoolTask> > TaskVector; | |
119 | 122 |
120 WorkerPool(size_t num_threads, const std::string& thread_name_prefix); | 123 protected: |
124 WorkerPool(); | |
121 | 125 |
122 // Schedule running of tasks in |graph|. Any previously scheduled tasks | 126 // Schedule running of tasks in |graph|. Any previously scheduled tasks |
123 // that are not already running will be canceled. Canceled tasks don't run | 127 // that are not already running will be canceled. Canceled tasks don't run |
124 // but completion of them is still processed. | 128 // but completion of them is still processed. |
125 void SetTaskGraph(TaskGraph* graph); | 129 void SetTaskGraph(TaskGraph* graph); |
126 | 130 |
127 private: | 131 private: |
128 class Inner; | |
129 friend class Inner; | |
130 | |
131 typedef std::vector<scoped_refptr<internal::WorkerPoolTask> > TaskVector; | |
132 | |
133 void ProcessCompletedTasks(const TaskVector& completed_tasks); | 132 void ProcessCompletedTasks(const TaskVector& completed_tasks); |
134 | 133 |
135 bool in_dispatch_completion_callbacks_; | 134 bool in_dispatch_completion_callbacks_; |
136 | |
137 // Hide the gory details of the worker pool in |inner_|. | |
138 const scoped_ptr<Inner> inner_; | |
139 }; | 135 }; |
140 | 136 |
141 } // namespace cc | 137 } // namespace cc |
142 | 138 |
143 #endif // CC_RESOURCES_WORKER_POOL_H_ | 139 #endif // CC_RESOURCES_WORKER_POOL_H_ |
OLD | NEW |