TaskGraph 172 cc/debug/rasterize_and_record_benchmark_impl.cc internal::TaskGraph graph; TaskGraph 174 cc/debug/rasterize_and_record_benchmark_impl.cc graph.nodes.push_back(internal::TaskGraph::Node( TaskGraph 435 cc/output/direct_renderer.cc internal::TaskGraph graph; TaskGraph 437 cc/output/direct_renderer.cc internal::TaskGraph::Node(on_demand_raster_task, TaskGraph 68 cc/resources/image_raster_worker_pool.cc graph_.edges.push_back(internal::TaskGraph::Edge( TaskGraph 75 cc/resources/image_raster_worker_pool.cc internal::TaskGraph::Edge(task, new_raster_finished_task.get())); TaskGraph 55 cc/resources/image_raster_worker_pool.h internal::TaskGraph graph_; TaskGraph 614 cc/resources/pixel_buffer_raster_worker_pool.cc graph_.edges.push_back(internal::TaskGraph::Edge( TaskGraph 638 cc/resources/pixel_buffer_raster_worker_pool.cc internal::TaskGraph::Edge(*it, new_raster_finished_task.get())); TaskGraph 115 cc/resources/pixel_buffer_raster_worker_pool.h internal::TaskGraph graph_; TaskGraph 312 cc/resources/raster_worker_pool.cc internal::TaskGraph empty; TaskGraph 320 cc/resources/raster_worker_pool.cc void RasterWorkerPool::SetTaskGraph(internal::TaskGraph* graph) { TaskGraph 324 cc/resources/raster_worker_pool.cc for (internal::TaskGraph::Node::Vector::iterator it = graph->nodes.begin(); TaskGraph 327 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node& node = *it; TaskGraph 404 cc/resources/raster_worker_pool.cc void RasterWorkerPool::InsertNodeForTask(internal::TaskGraph* graph, TaskGraph 410 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node::TaskComparator(task)) == TaskGraph 413 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node(task, priority, dependencies)); TaskGraph 418 cc/resources/raster_worker_pool.cc internal::TaskGraph* graph, TaskGraph 438 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node::Vector::iterator decode_it = TaskGraph 441 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node::TaskComparator(decode_task)); TaskGraph 445 cc/resources/raster_worker_pool.cc graph->edges.push_back(internal::TaskGraph::Edge(decode_task, raster_task)); TaskGraph 182 cc/resources/raster_worker_pool.h void SetTaskGraph(internal::TaskGraph* graph); TaskGraph 213 cc/resources/raster_worker_pool.h static void InsertNodeForTask(internal::TaskGraph* graph, TaskGraph 219 cc/resources/raster_worker_pool.h internal::TaskGraph* graph, TaskGraph 20 cc/resources/task_graph_runner.cc DependentIterator(TaskGraph* graph, const Task* task) TaskGraph 25 cc/resources/task_graph_runner.cc TaskGraph::Node& operator->() const { TaskGraph 32 cc/resources/task_graph_runner.cc TaskGraph::Node& operator*() const { TaskGraph 49 cc/resources/task_graph_runner.cc TaskGraph::Node::Vector::iterator it = TaskGraph 52 cc/resources/task_graph_runner.cc TaskGraph::Node::TaskComparator( TaskGraph 63 cc/resources/task_graph_runner.cc TaskGraph* graph_; TaskGraph 66 cc/resources/task_graph_runner.cc TaskGraph::Node* current_node_; TaskGraph 71 cc/resources/task_graph_runner.cc explicit DependencyMismatchComparator(const TaskGraph* graph) TaskGraph 74 cc/resources/task_graph_runner.cc bool operator()(const TaskGraph::Node& node) const { TaskGraph 87 cc/resources/task_graph_runner.cc bool operator()(const TaskGraph::Edge& edge) const { TaskGraph 95 cc/resources/task_graph_runner.cc const TaskGraph* graph_; TaskGraph 112 cc/resources/task_graph_runner.cc TaskGraph::TaskGraph() {} TaskGraph 114 cc/resources/task_graph_runner.cc TaskGraph::~TaskGraph() {} TaskGraph 116 cc/resources/task_graph_runner.cc void TaskGraph::Swap(TaskGraph* other) { TaskGraph 121 cc/resources/task_graph_runner.cc void TaskGraph::Reset() { TaskGraph 154 cc/resources/task_graph_runner.cc void TaskGraphRunner::ScheduleTasks(NamespaceToken token, TaskGraph* graph) { TaskGraph 180 cc/resources/task_graph_runner.cc TaskGraph::Node& node = *node_it; TaskGraph 188 cc/resources/task_graph_runner.cc for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin(); TaskGraph 191 cc/resources/task_graph_runner.cc TaskGraph::Node& node = *it; TaskGraph 196 cc/resources/task_graph_runner.cc TaskGraph::Node::Vector::iterator old_it = TaskGraph 199 cc/resources/task_graph_runner.cc TaskGraph::Node::TaskComparator(node.task)); TaskGraph 233 cc/resources/task_graph_runner.cc for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin(); TaskGraph 236 cc/resources/task_graph_runner.cc TaskGraph::Node& node = *it; TaskGraph 429 cc/resources/task_graph_runner.cc TaskGraph::Node& dependent_node = *it; TaskGraph 41 cc/resources/task_graph_runner.h struct CC_EXPORT TaskGraph { TaskGraph 73 cc/resources/task_graph_runner.h TaskGraph(); TaskGraph 74 cc/resources/task_graph_runner.h ~TaskGraph(); TaskGraph 76 cc/resources/task_graph_runner.h void Swap(TaskGraph* other); TaskGraph 118 cc/resources/task_graph_runner.h void ScheduleTasks(NamespaceToken token, TaskGraph* graph); TaskGraph 159 cc/resources/task_graph_runner.h TaskGraph graph; TaskGraph 72 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph graph; TaskGraph 102 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph graph; TaskGraph 116 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph empty; TaskGraph 144 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph graph; TaskGraph 162 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph empty; TaskGraph 187 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph graph; TaskGraph 233 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph* graph) { TaskGraph 240 cc/resources/task_graph_runner_perftest.cc graph->nodes.push_back(internal::TaskGraph::Node(it->get(), 0u, 0u)); TaskGraph 247 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph::Node(it->get(), 0u, leaf_tasks.size())); TaskGraph 253 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph::Edge(leaf_it->get(), it->get())); TaskGraph 261 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph::Edge(it->get(), top_level_it->get())); TaskGraph 269 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph::Node(it->get(), 0u, tasks.size())); TaskGraph 84 cc/resources/task_graph_runner_unittest.cc internal::TaskGraph new_graph; TaskGraph 92 cc/resources/task_graph_runner_unittest.cc internal::TaskGraph::Node(new_task.get(), it->priority, 0u)); TaskGraph 97 cc/resources/task_graph_runner_unittest.cc new_graph.nodes.push_back(internal::TaskGraph::Node( TaskGraph 99 cc/resources/task_graph_runner_unittest.cc new_graph.edges.push_back(internal::TaskGraph::Edge(