cc: Correct task graph edges in tile_task_worker_pool_perf_tests.cc.

cc/raster/tile_task_worker_pool_perftest.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 <stddef.h>
 #include <stdint.h>
 
 #include "base/macros.h"
 #include "base/memory/ptr_util.h"
 #include "base/test/test_simple_task_runner.h"
@@ skipping 211 matching lines @@
                           const RasterTaskVector& raster_tasks) {
     uint16_t priority = 0;
 
     for (auto& raster_task : raster_tasks) {
       priority++;
 
       for (auto& decode_task : raster_task->dependencies()) {
         graph->nodes.push_back(
             TaskGraph::Node(decode_task.get(), 0u /* group */, priority, 0u));
         graph->edges.push_back(
-            TaskGraph::Edge(raster_task.get(), decode_task.get()));
+            TaskGraph::Edge(decode_task.get(), raster_task.get()));
       }
 
       graph->nodes.push_back(TaskGraph::Node(
           raster_task.get(), 0u /* group */, priority,
           static_cast<uint32_t>(raster_task->dependencies().size())));
     }
   }
 
  protected:
   scoped_refptr<ContextProvider> context_provider_;
@@ skipping 243 matching lines @@
   RunBuildTileTaskGraphTest("1_0", 1, 0);
   RunBuildTileTaskGraphTest("32_0", 32, 0);
   RunBuildTileTaskGraphTest("1_1", 1, 1);
   RunBuildTileTaskGraphTest("32_1", 32, 1);
   RunBuildTileTaskGraphTest("1_4", 1, 4);
   RunBuildTileTaskGraphTest("32_4", 32, 4);
 }
 
 }  // namespace
 }  // namespace cc