| OLD | NEW |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "cc/raster/task_graph_work_queue.h" | 5 #include "cc/raster/task_graph_work_queue.h" |
| 6 | 6 |
| 7 #include <stddef.h> |
| 8 #include <stdint.h> |
| 9 |
| 7 #include <algorithm> | 10 #include <algorithm> |
| 8 #include <map> | 11 #include <map> |
| 9 #include <utility> | 12 #include <utility> |
| 10 | 13 |
| 11 #include "base/trace_event/trace_event.h" | 14 #include "base/trace_event/trace_event.h" |
| 12 | 15 |
| 13 namespace cc { | 16 namespace cc { |
| 14 namespace { | 17 namespace { |
| 15 | 18 |
| 16 bool CompareTaskPriority(const TaskGraphWorkQueue::PrioritizedTask& a, | 19 bool CompareTaskPriority(const TaskGraphWorkQueue::PrioritizedTask& a, |
| (...skipping 269 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 286 | 289 |
| 287 for (const TaskGraph::Node& node : graph->nodes) { | 290 for (const TaskGraph::Node& node : graph->nodes) { |
| 288 if (dependents[node.task] != node.dependencies) | 291 if (dependents[node.task] != node.dependencies) |
| 289 return true; | 292 return true; |
| 290 } | 293 } |
| 291 | 294 |
| 292 return false; | 295 return false; |
| 293 } | 296 } |
| 294 | 297 |
| 295 } // namespace cc | 298 } // namespace cc |
| OLD | NEW |