Shared Raster Worker Threads

cc/resources/worker_pool.h

 // Copyright 2013 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 CC_RESOURCES_WORKER_POOL_H_
 #define CC_RESOURCES_WORKER_POOL_H_
 
 #include <deque>
 #include <string>
 #include <vector>
@@ skipping 90 matching lines @@
  public:
   virtual ~WorkerPool();
 
   // Tells the worker pool to shutdown and returns once all pending tasks have
   // completed.
   virtual void Shutdown();
 
   // Force a check for completed tasks.
   virtual void CheckForCompletedTasks();
 
+  // Changed the access specifier to be available for Lazy Instance
+  class Inner;
+  friend class Inner;

[reveman, 2013/11/15 17:21:41]

I don't think it should be a subclass anymore if you need to move it here.

+
  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
   // the number of dependencies.
   typedef base::ScopedPtrHashMap<internal::WorkerPoolTask*, internal::GraphNode>
       GraphNodeMap;
   typedef GraphNodeMap TaskGraph;
 
   WorkerPool(size_t num_threads, const std::string& thread_name_prefix);
 
   // Schedule running of tasks in |graph|. Any previously scheduled tasks
   // that are not already running will be canceled. Canceled tasks don't run
   // but completion of them is still processed.
   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
 
 #endif  // CC_RESOURCES_WORKER_POOL_H_