cc: Added modifier string to clarify perf tests.

cc/resources/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 "cc/resources/task_graph_runner.h"
 
 #include <vector>
 
 #include "base/time/time.h"
 #include "cc/base/completion_event.h"
@@ skipping 62 matching lines @@
     internal::TaskGraph graph;
 
     timer_.Reset();
     do {
       graph.Reset();
       BuildTaskGraph(top_level_tasks, tasks, leaf_tasks, &graph);
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     perf_test::PrintResult("build_task_graph",
-                           "",
+                           TestModifierString(),
                            test_name,
                            timer_.LapsPerSecond(),
                            "runs/s",
                            true);
   }
 
   void RunScheduleTasksTest(const std::string& test_name,
                             int num_top_level_tasks,
                             int num_tasks,
                             int num_leaf_tasks) {
@@ skipping 18 matching lines @@
       // of tasks.
       DCHECK_EQ(0u, CollectCompletedTasks(&completed_tasks));
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     internal::TaskGraph empty;
     task_graph_runner_->SetTaskGraph(namespace_token_, &empty);
     CollectCompletedTasks(&completed_tasks);
 
     perf_test::PrintResult("schedule_tasks",
-                           "",
+                           TestModifierString(),
                            test_name,
                            timer_.LapsPerSecond(),
                            "runs/s",
                            true);
   }
 
   void RunScheduleAlternateTasksTest(const std::string& test_name,
                                      int num_top_level_tasks,
                                      int num_tasks,
                                      int num_leaf_tasks) {
@@ skipping 25 matching lines @@
       completed_tasks.clear();
       ++count;
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     internal::TaskGraph empty;
     task_graph_runner_->SetTaskGraph(namespace_token_, &empty);
     CollectCompletedTasks(&completed_tasks);
 
     perf_test::PrintResult("schedule_alternate_tasks",
-                           "",
+                           TestModifierString(),
                            test_name,
                            timer_.LapsPerSecond(),
                            "runs/s",
                            true);
   }
 
   void RunScheduleAndExecuteTasksTest(const std::string& test_name,
                                       int num_top_level_tasks,
                                       int num_tasks,
                                       int num_leaf_tasks) {
@@ skipping 17 matching lines @@
       while (task_graph_runner_->RunTaskForTesting())
         continue;
       CollectCompletedTasks(&completed_tasks);
       completed_tasks.clear();
       ResetTasks(&top_level_tasks);
       ResetTasks(&tasks);
       ResetTasks(&leaf_tasks);
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
-    perf_test::PrintResult(
-        "execute_tasks", "", test_name, timer_.LapsPerSecond(), "runs/s", true);
+    perf_test::PrintResult("execute_tasks",
+                           TestModifierString(),
+                           test_name,
+                           timer_.LapsPerSecond(),
+                           "runs/s",
+                           true);
   }
 
  private:
+  static std::string TestModifierString() {
+    return std::string("_task_graph_runner");
+  }
+
   void CreateTasks(int num_tasks, PerfTaskImpl::Vector* tasks) {
     for (int i = 0; i < num_tasks; ++i)
       tasks->push_back(make_scoped_refptr(new PerfTaskImpl));
   }
 
   void ResetTasks(PerfTaskImpl::Vector* tasks) {
     for (PerfTaskImpl::Vector::iterator it = tasks->begin(); it != tasks->end();
          ++it) {
       PerfTaskImpl* task = it->get();
       task->Reset();
@@ skipping 86 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