diff options
author | reveman@chromium.org <reveman@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98> | 2014-02-09 02:38:55 +0000 |
---|---|---|
committer | reveman@chromium.org <reveman@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98> | 2014-02-09 02:38:55 +0000 |
commit | 2f2ccb15f5d975e120b4750fa0948920ec96e28d (patch) | |
tree | 317ed0edb5aeaa07ae3a62bd0232f893d86cd5d4 /cc/resources/task_graph_runner_perftest.cc | |
parent | fdedd90ef07671d480ef4f310678359d133341ef (diff) | |
download | chromium_src-2f2ccb15f5d975e120b4750fa0948920ec96e28d.zip chromium_src-2f2ccb15f5d975e120b4750fa0948920ec96e28d.tar.gz chromium_src-2f2ccb15f5d975e120b4750fa0948920ec96e28d.tar.bz2 |
cc: Refactor RasterWorkerPool for better testing support.
This makes a number of RasterWorkerPool changes that are necessary
to implement proper performance tests and replaces existing tests
with more useful tests using realistic raster task numbers.
RasterWorkerPool is modified to allow tests to use a different
TaskGraphRunner instance. PixelBufferRasterWorkerPool
implementation is adjusted so repeated calls to ScheduleTasks
doesn't flood the message loop with canceled tasks.
BUG=246546
Review URL: https://codereview.chromium.org/150783004
git-svn-id: svn://svn.chromium.org/chrome/trunk/src@249959 0039d316-1c4b-4281-b951-d872f2087c98
Diffstat (limited to 'cc/resources/task_graph_runner_perftest.cc')
-rw-r--r-- | cc/resources/task_graph_runner_perftest.cc | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/cc/resources/task_graph_runner_perftest.cc b/cc/resources/task_graph_runner_perftest.cc index 7590450..71933f5 100644 --- a/cc/resources/task_graph_runner_perftest.cc +++ b/cc/resources/task_graph_runner_perftest.cc @@ -130,11 +130,11 @@ class TaskGraphRunnerPerfTest : public testing::Test { int num_top_level_tasks, int num_tasks, int num_leaf_tasks) { - const int kNumVersions = 2; + const size_t kNumVersions = 2; PerfTaskImpl::Vector top_level_tasks[kNumVersions]; PerfTaskImpl::Vector tasks[kNumVersions]; PerfTaskImpl::Vector leaf_tasks[kNumVersions]; - for (int i = 0; i < kNumVersions; ++i) { + for (size_t i = 0; i < kNumVersions; ++i) { CreateTasks(num_top_level_tasks, &top_level_tasks[i]); CreateTasks(num_tasks, &tasks[i]); CreateTasks(num_leaf_tasks, &leaf_tasks[i]); @@ -145,7 +145,7 @@ class TaskGraphRunnerPerfTest : public testing::Test { internal::TaskGraph graph; internal::Task::Vector completed_tasks; - int count = 0; + size_t count = 0; timer_.Reset(); do { graph.Reset(); |