Index: cc/resources/worker_pool.h |
diff --git a/cc/resources/worker_pool.h b/cc/resources/worker_pool.h |
old mode 100644 |
new mode 100755 |
index cc8c39f3642a0997bc990ba9484aab87612909df..d6381d058e1f57a9d986c30f6e0ee79bd7ac4613 |
--- a/cc/resources/worker_pool.h |
+++ b/cc/resources/worker_pool.h |
@@ -108,7 +108,6 @@ class CC_EXPORT WorkerPool { |
// Force a check for completed tasks. |
virtual void CheckForCompletedTasks(); |
- protected: |
// A task graph contains a unique set of tasks with edges between |
// dependencies pointing in the direction of the dependents. Each task |
// need to be assigned a unique priority and a run count that matches |
@@ -116,7 +115,9 @@ class CC_EXPORT WorkerPool { |
typedef base::ScopedPtrHashMap<internal::WorkerPoolTask*, internal::GraphNode> |
GraphNodeMap; |
typedef GraphNodeMap TaskGraph; |
+ typedef std::vector<scoped_refptr<internal::WorkerPoolTask> > TaskVector; |
+ protected: |
WorkerPool(size_t num_threads, const std::string& thread_name_prefix); |
reveman
2013/12/27 14:57:13
|num_threads| and |thread_name_prefix| are no long
sohanjg
2013/12/28 09:15:17
Done.
|
// Schedule running of tasks in |graph|. Any previously scheduled tasks |
@@ -125,17 +126,9 @@ class CC_EXPORT WorkerPool { |
void SetTaskGraph(TaskGraph* graph); |
private: |
- class Inner; |
- friend class Inner; |
- |
- typedef std::vector<scoped_refptr<internal::WorkerPoolTask> > TaskVector; |
- |
void ProcessCompletedTasks(const TaskVector& completed_tasks); |
bool in_dispatch_completion_callbacks_; |
- |
- // Hide the gory details of the worker pool in |inner_|. |
- const scoped_ptr<Inner> inner_; |
}; |
} // namespace cc |