| OLD | NEW |
|---|
| 1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 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/synchronous_task_graph_runner.h" | 5 #include "cc/raster/synchronous_task_graph_runner.h" |
| 6 | 6 |
| 7 #include <stdint.h> | 7 #include <stdint.h> |
| 8 | 8 |
| 9 #include <algorithm> | 9 #include <algorithm> |
| 10 #include <utility> | 10 #include <utility> |
| (...skipping 67 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 78 pair) { return !pair.second.empty(); }); | 78 pair) { return !pair.second.empty(); }); |
| 79 | 79 |
| 80 if (found == ready_to_run_namespaces.cend()) { | 80 if (found == ready_to_run_namespaces.cend()) { |
| 81 return false; | 81 return false; |
| 82 } | 82 } |
| 83 | 83 |
| 84 const uint16_t category = found->first; | 84 const uint16_t category = found->first; |
| 85 auto prioritized_task = work_queue_.GetNextTaskToRun(category); | 85 auto prioritized_task = work_queue_.GetNextTaskToRun(category); |
| 86 | 86 |
| 87 Task* task = prioritized_task.task; | 87 Task* task = prioritized_task.task; |
| 88 task->WillRun(); | |
| 89 task->RunOnWorkerThread(); | 88 task->RunOnWorkerThread(); |
| 90 task->DidRun(); | |
| 91 | 89 |
| 92 work_queue_.CompleteTask(prioritized_task); | 90 work_queue_.CompleteTask(prioritized_task); |
| 93 | 91 |
| 94 return true; | 92 return true; |
| 95 } | 93 } |
| 96 | 94 |
| 97 } // namespace cc | 95 } // namespace cc |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 1903733003:
cc: Implement states for Task for stricter control. (Closed)
Base URL: https://chromium.googlesource.com/chromium/src.git@land_merge_tile_task_runner