Re-land: cc: Add raster finished signals to RasterWorkerPool.

cc/resources/worker_pool_unittest.cc

 // 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.
 
 #include "cc/resources/worker_pool.h"
 
 #include <vector>
 
 #include "cc/base/completion_event.h"
 #include "testing/gtest/include/gtest/gtest.h"
@@ skipping 59 matching lines @@
   void ScheduleTasks(const std::vector<Task>& tasks) {
     TaskVector new_tasks;
     TaskVector new_dependents;
     TaskGraph new_graph;
 
     scoped_refptr<FakeWorkerPoolTaskImpl> new_completion_task(
         new FakeWorkerPoolTaskImpl(
             base::Bind(&FakeWorkerPool::OnTasksCompleted,
                        base::Unretained(this)),
             base::Closure()));
-    scoped_ptr<GraphNode> completion_node(new GraphNode);
-    completion_node->set_task(new_completion_task.get());
+    scoped_ptr<internal::GraphNode> completion_node(
+        new internal::GraphNode(new_completion_task.get(), 0u));
 
     for (std::vector<Task>::const_iterator it = tasks.begin();
          it != tasks.end(); ++it) {
       scoped_refptr<FakeWorkerPoolTaskImpl> new_task(
           new FakeWorkerPoolTaskImpl(it->callback, it->reply));
-      scoped_ptr<GraphNode> node(new GraphNode);
-      node->set_task(new_task.get());
-      node->set_priority(it->priority);
+      scoped_ptr<internal::GraphNode> node(
+          new internal::GraphNode(new_task.get(), it->priority));
 
       DCHECK(it->dependent_count);
       for (unsigned i = 0; i < it->dependent_count; ++i) {
         scoped_refptr<FakeWorkerPoolTaskImpl> new_dependent_task(
             new FakeWorkerPoolTaskImpl(it->dependent, base::Closure()));
-        scoped_ptr<GraphNode> dependent_node(new GraphNode);
-        dependent_node->set_task(new_dependent_task.get());
-        dependent_node->set_priority(it->priority);
+        scoped_ptr<internal::GraphNode> dependent_node(
+            new internal::GraphNode(new_dependent_task.get(), it->priority));
         dependent_node->add_dependent(completion_node.get());
         completion_node->add_dependency();
         node->add_dependent(dependent_node.get());
         dependent_node->add_dependency();
         new_graph.set(new_dependent_task.get(), dependent_node.Pass());
         new_dependents.push_back(new_dependent_task.get());
       }
 
       new_graph.set(new_task.get(), node.Pass());
       new_tasks.push_back(new_task.get());
@@ skipping 279 matching lines @@
   EXPECT_EQ(1u, run_task_ids()[2]);
   ASSERT_EQ(3u, on_task_completed_ids().size());
   EXPECT_EQ(2u, on_task_completed_ids()[0]);
   EXPECT_EQ(1u, on_task_completed_ids()[1]);
   EXPECT_EQ(0u, on_task_completed_ids()[2]);
 }
 
 }  // namespace
 
 }  // namespace cc