cc: Implement states for Task for stricter control.

cc/raster/task_graph_runner_perftest.cc

 // Copyright 2014 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 <stddef.h>
 #include <stdint.h>
 
 #include <memory>
 #include <vector>
 
@@ skipping 15 matching lines @@
 
 class PerfTaskImpl : public Task {
  public:
   typedef std::vector<scoped_refptr<PerfTaskImpl>> Vector;
 
   PerfTaskImpl() {}
 
   // Overridden from Task:
   void RunOnWorkerThread() override {}
 
-  void Reset() { did_run_ = false; }
+  void Reset() { state().Reset(); }
 
  private:
   ~PerfTaskImpl() override {}
 
   DISALLOW_COPY_AND_ASSIGN(PerfTaskImpl);
 };
 
 class TaskGraphRunnerPerfTest : public testing::Test {
  public:
   TaskGraphRunnerPerfTest()
@@ skipping 91 matching lines @@
     }
 
     // Avoid unnecessary heap allocations by reusing the same graph and
     // completed tasks vector.
     TaskGraph graph;
     Task::Vector completed_tasks;
 
     size_t count = 0;
     timer_.Reset();
     do {
+      size_t current_version = count % kNumVersions;
       graph.Reset();
-      BuildTaskGraph(top_level_tasks[count % kNumVersions],
-                     tasks[count % kNumVersions],
-                     leaf_tasks[count % kNumVersions],
-                     &graph);
+      // Reset tasks as we are not letting them execute, they get cancelled
+      // when next ScheduleTasks() happens.
+      ResetTasks(&top_level_tasks[current_version]);
+      ResetTasks(&tasks[current_version]);
+      ResetTasks(&leaf_tasks[current_version]);
+      BuildTaskGraph(top_level_tasks[current_version], tasks[current_version],
+                     leaf_tasks[current_version], &graph);
       task_graph_runner_->ScheduleTasks(namespace_token_, &graph);
       CollectCompletedTasks(&completed_tasks);
       completed_tasks.clear();
       ++count;
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     TaskGraph empty;
     task_graph_runner_->ScheduleTasks(namespace_token_, &empty);
     CollectCompletedTasks(&completed_tasks);
@@ skipping 146 matching lines @@
   RunScheduleAndExecuteTasksTest("0_1_0", 0, 1, 0);
   RunScheduleAndExecuteTasksTest("0_32_0", 0, 32, 0);
   RunScheduleAndExecuteTasksTest("2_1_0", 2, 1, 0);
   RunScheduleAndExecuteTasksTest("2_32_0", 2, 32, 0);
   RunScheduleAndExecuteTasksTest("2_1_1", 2, 1, 1);
   RunScheduleAndExecuteTasksTest("2_32_1", 2, 32, 1);
 }
 
 }  // namespace
 }  // namespace cc