Searched refs:TaskGraph (Results 1 - 17 of 17) sorted by relevance
| /external/chromium_org/cc/resources/ |
| H A D | raster_worker_pool.h | 59 TaskGraph* graph);
62 // that represents |task| in |graph|. See TaskGraph definition for valid
64 static void InsertNodeForTask(TaskGraph* graph,
72 TaskGraph* graph,
|
| H A D | task_graph_runner.cc | 19 DependentIterator(TaskGraph* graph, const Task* task)
24 TaskGraph::Node& operator->() const {
31 TaskGraph::Node& operator*() const {
48 TaskGraph::Node::Vector::iterator it =
51 TaskGraph::Node::TaskComparator(
62 TaskGraph* graph_;
65 TaskGraph::Node* current_node_;
70 explicit DependencyMismatchComparator(const TaskGraph* graph)
73 bool operator()(const TaskGraph::Node& node) const {
86 bool operator()(const TaskGraph
120 TaskGraph::TaskGraph() {} function in class:cc::TaskGraph
[all...] |
| H A D | raster_worker_pool.cc | 227 TaskGraph* graph) {
230 for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin();
233 TaskGraph::Node& node = *it;
245 void RasterWorkerPool::InsertNodeForTask(TaskGraph* graph,
251 TaskGraph::Node::TaskComparator(task)) ==
253 graph->nodes.push_back(TaskGraph::Node(task, priority, dependencies));
258 TaskGraph* graph,
277 TaskGraph::Node::Vector::iterator decode_it =
280 TaskGraph::Node::TaskComparator(decode_task));
284 graph->edges.push_back(TaskGraph
[all...] |
| H A D | task_graph_runner.h | 42 struct CC_EXPORT TaskGraph { struct in namespace:cc
74 TaskGraph();
75 ~TaskGraph();
77 void Swap(TaskGraph* other);
119 void ScheduleTasks(NamespaceToken token, TaskGraph* graph);
160 TaskGraph graph;
|
| H A D | task_graph_runner_perftest.cc | 72 TaskGraph graph;
102 TaskGraph graph;
116 TaskGraph empty;
144 TaskGraph graph;
162 TaskGraph empty;
187 TaskGraph graph;
233 TaskGraph* graph) {
240 graph->nodes.push_back(TaskGraph::Node(it->get(), 0u, 0u));
246 graph->nodes.push_back(TaskGraph::Node(it->get(), 0u, leaf_tasks.size()));
251 graph->edges.push_back(TaskGraph
[all...] |
| H A D | direct_raster_worker_pool.cc | 53 TaskGraph empty;
99 graph_.edges.push_back(TaskGraph::Edge(
106 TaskGraph::Edge(task, new_raster_finished_task.get()));
|
| H A D | image_raster_worker_pool.cc | 45 TaskGraph empty;
94 graph_.edges.push_back(TaskGraph::Edge(
101 TaskGraph::Edge(task, new_raster_finished_task.get()));
|
| H A D | direct_raster_worker_pool.h | 71 TaskGraph graph_;
|
| H A D | image_raster_worker_pool.h | 66 TaskGraph graph_;
|
| H A D | image_copy_raster_worker_pool.h | 102 TaskGraph graph_;
|
| H A D | task_graph_runner_unittest.cc | 83 TaskGraph new_graph;
91 TaskGraph::Node(new_task.get(), it->priority, 0u));
97 TaskGraph::Node(new_dependent_task.get(), it->priority, 1u));
99 TaskGraph::Edge(new_task.get(), new_dependent_task.get()));
|
| H A D | image_copy_raster_worker_pool.cc | 54 TaskGraph empty;
105 graph_.edges.push_back(TaskGraph::Edge(
112 TaskGraph::Edge(task, new_raster_finished_task.get()));
|
| H A D | pixel_buffer_raster_worker_pool.h | 128 TaskGraph graph_;
|
| H A D | pixel_buffer_raster_worker_pool.cc | 87 TaskGraph empty;
595 graph_.edges.push_back(TaskGraph::Edge(
622 TaskGraph::Edge(*it, new_raster_finished_task.get()));
|
| /external/chromium_org/cc/test/ |
| H A D | pixel_test.cc | 156 TaskGraph graph;
158 TaskGraph::Node(on_demand_raster_task,
|
| /external/chromium_org/cc/debug/ |
| H A D | rasterize_and_record_benchmark_impl.cc | 180 TaskGraph graph;
183 TaskGraph::Node(benchmark_raster_task,
|
| /external/chromium_org/cc/trees/ |
| H A D | layer_tree_host_impl.cc | 2814 TaskGraph graph;
2816 TaskGraph::Node(on_demand_raster_task,
|
Completed in 136 milliseconds