Home
last modified time | relevance | path

Searched refs:TaskGraph (Results 1 – 25 of 185) sorted by relevance

12345678

/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/cc/raster/
H A Dtask_graph_work_queue_unittest.cc32 TaskGraph graph1; in TEST()
34 graph1.nodes.push_back(TaskGraph::Node(task.get(), 0u, 0u, 0u)); in TEST()
45 TaskGraph graph2; in TEST()
47 graph2.nodes.push_back(TaskGraph::Node(task.get(), 0u, 0u, 1u)); in TEST()
48 graph2.nodes.push_back(TaskGraph::Node(dependency_task.get(), 0u, 0u, 0u)); in TEST()
70 TaskGraph graph; in TEST()
76 graph.nodes.push_back(TaskGraph::Node(task.get(), 0u, 0u, 3u)); in TEST()
131 TaskGraph graph; in TEST()
138 graph.nodes.push_back(TaskGraph::Node(task.get(), 0u, 2u, 3u)); in TEST()
176 TaskGraph graph; in TEST()
[all …]
H A Dtask.cc91 TaskGraph::TaskGraph() = default;
93 TaskGraph::TaskGraph(TaskGraph&& other) = default;
95 TaskGraph::~TaskGraph() = default;
97 TaskGraph::Node::Node(scoped_refptr<Task> task, in Node()
106 TaskGraph::Node::Node(Node&& other) = default;
107 TaskGraph::Node::~Node() = default;
109 void TaskGraph::Swap(TaskGraph* other) { in Swap()
114 void TaskGraph::Reset() { in Reset()
H A Dtask.h107 struct CC_EXPORT TaskGraph { struct
138 TaskGraph(); argument
139 TaskGraph(const TaskGraph&) = delete;
140 TaskGraph(TaskGraph&& other);
141 ~TaskGraph();
143 TaskGraph& operator=(const TaskGraph&) = delete; argument
144 TaskGraph& operator=(TaskGraph&&) = default; argument
146 void Swap(TaskGraph* other);
H A Dtask_graph_work_queue.cc51 DependentIterator(TaskGraph* graph, const Task* task) in DependentIterator()
59 TaskGraph::Node& operator->() const { in operator ->()
66 TaskGraph::Node& operator*() const { in operator *()
97 TaskGraph* graph_;
100 TaskGraph::Node* current_node_;
141 TaskGraph::Node& node = *node_it; in ScheduleTasks()
151 for (const TaskGraph::Node& node : graph->nodes) { in ScheduleTasks()
204 TaskGraph::Node& node = *it; in ScheduleTasks()
308 TaskGraph::Node& dependent_node = *dependent_it; in CompleteTask()
379 for (const TaskGraph::Edge& edge : graph->edges) in DependencyMismatch()
[all …]
H A Dtask_graph_runner_perftest.cc69 TaskGraph graph; in RunBuildTaskGraphTest()
100 TaskGraph graph; in RunScheduleTasksTest()
114 TaskGraph empty; in RunScheduleTasksTest()
139 TaskGraph graph; in RunScheduleAlternateTasksTest()
161 TaskGraph empty; in RunScheduleAlternateTasksTest()
183 TaskGraph graph; in RunScheduleAndExecuteTasksTest()
230 TaskGraph* graph) { in BuildTaskGraph()
/dports/www/chromium-legacy/chromium-88.0.4324.182/cc/raster/
H A Dtask_graph_work_queue_unittest.cc32 TaskGraph graph1; in TEST()
34 graph1.nodes.push_back(TaskGraph::Node(task.get(), 0u, 0u, 0u)); in TEST()
45 TaskGraph graph2; in TEST()
47 graph2.nodes.push_back(TaskGraph::Node(task.get(), 0u, 0u, 1u)); in TEST()
48 graph2.nodes.push_back(TaskGraph::Node(dependency_task.get(), 0u, 0u, 0u)); in TEST()
70 TaskGraph graph; in TEST()
76 graph.nodes.push_back(TaskGraph::Node(task.get(), 0u, 0u, 3u)); in TEST()
131 TaskGraph graph; in TEST()
138 graph.nodes.push_back(TaskGraph::Node(task.get(), 0u, 2u, 3u)); in TEST()
176 TaskGraph graph; in TEST()
[all …]
H A Dtask.cc92 TaskGraph::TaskGraph() = default;
94 TaskGraph::TaskGraph(TaskGraph&& other) = default;
96 TaskGraph::~TaskGraph() = default;
98 TaskGraph::Node::Node(scoped_refptr<Task> task, in Node()
107 TaskGraph::Node::Node(Node&& other) = default;
108 TaskGraph::Node::~Node() = default;
110 void TaskGraph::Swap(TaskGraph* other) { in Swap()
115 void TaskGraph::Reset() { in Reset()
H A Dtask.h107 struct CC_EXPORT TaskGraph { struct
138 TaskGraph(); argument
139 TaskGraph(const TaskGraph&) = delete;
140 TaskGraph(TaskGraph&& other);
141 ~TaskGraph();
143 TaskGraph& operator=(const TaskGraph&) = delete; argument
144 TaskGraph& operator=(TaskGraph&&) = default; argument
146 void Swap(TaskGraph* other);
H A Dtask_graph_work_queue.cc51 DependentIterator(TaskGraph* graph, const Task* task) in DependentIterator()
59 TaskGraph::Node& operator->() const { in operator ->()
66 TaskGraph::Node& operator*() const { in operator *()
97 TaskGraph* graph_;
100 TaskGraph::Node* current_node_;
141 TaskGraph::Node& node = *node_it; in ScheduleTasks()
151 for (const TaskGraph::Node& node : graph->nodes) { in ScheduleTasks()
204 TaskGraph::Node& node = *it; in ScheduleTasks()
308 TaskGraph::Node& dependent_node = *dependent_it; in CompleteTask()
379 for (const TaskGraph::Edge& edge : graph->edges) in DependencyMismatch()
[all …]
H A Dtask_graph_runner_perftest.cc69 TaskGraph graph; in RunBuildTaskGraphTest()
100 TaskGraph graph; in RunScheduleTasksTest()
114 TaskGraph empty; in RunScheduleTasksTest()
139 TaskGraph graph; in RunScheduleAlternateTasksTest()
161 TaskGraph empty; in RunScheduleAlternateTasksTest()
183 TaskGraph graph; in RunScheduleAndExecuteTasksTest()
230 TaskGraph* graph) { in BuildTaskGraph()
H A Draster_buffer_provider_perftest.cc309 void BuildTileTaskGraph(TaskGraph* graph, in BuildTileTaskGraph()
320 [decode_task](const TaskGraph::Node& node) { in BuildTileTaskGraph()
330 TaskGraph::Edge(decode_task.get(), raster_task.get())); in BuildTileTaskGraph()
333 graph->nodes.push_back(TaskGraph::Node( in BuildTileTaskGraph()
428 TaskGraph graph; in RunScheduleTasksTest()
440 TaskGraph empty; in RunScheduleTasksTest()
462 TaskGraph graph; in RunScheduleAlternateTasksTest()
477 TaskGraph empty; in RunScheduleAlternateTasksTest()
497 TaskGraph graph; in RunScheduleAndExecuteTasksTest()
508 TaskGraph empty; in RunScheduleAndExecuteTasksTest()
[all …]
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/intern/
H A Dtask_graph.cc38 struct TaskGraph { struct
65 TaskNode(TaskGraph *task_graph, in TaskNode()
115 TaskGraph *BLI_task_graph_create(void) in BLI_task_graph_create()
117 return new TaskGraph(); in BLI_task_graph_create()
120 void BLI_task_graph_free(TaskGraph *task_graph) in BLI_task_graph_free()
125 void BLI_task_graph_work_and_wait(TaskGraph *task_graph) in BLI_task_graph_work_and_wait()
134 struct TaskNode *BLI_task_graph_node_create(struct TaskGraph *task_graph, in BLI_task_graph_node_create()
/dports/www/firefox-esr/firefox-91.8.0/taskcluster/taskgraph/test/
H A Dtest_taskgraph.py11 from taskgraph.taskgraph import TaskGraph
40 taskgraph = TaskGraph(tasks, graph)
73 graph = TaskGraph(
96 tasks, new_graph = TaskGraph.from_json(graph.to_json())
99 simple_graph = TaskGraph(
H A Dtest_create.py14 from taskgraph.taskgraph import TaskGraph
45 taskgraph = TaskGraph(tasks, graph)
74 taskgraph = TaskGraph(tasks, graph)
97 taskgraph = TaskGraph(tasks, graph)
/dports/lang/spidermonkey60/firefox-60.9.0/taskcluster/taskgraph/test/
H A Dtest_taskgraph.py11 from taskgraph.taskgraph import TaskGraph
33 taskgraph = TaskGraph(tasks, graph)
57 graph = TaskGraph(tasks={
74 tasks, new_graph = TaskGraph.from_json(graph.to_json())
77 simple_graph = TaskGraph(tasks={
H A Dtest_create.py13 from taskgraph.taskgraph import TaskGraph
46 taskgraph = TaskGraph(tasks, graph)
68 taskgraph = TaskGraph(tasks, graph)
84 taskgraph = TaskGraph(tasks, graph)
/dports/www/firefox/firefox-99.0/taskcluster/gecko_taskgraph/test/
H A Dtest_taskgraph.py10 from gecko_taskgraph.taskgraph import TaskGraph
39 taskgraph = TaskGraph(tasks, graph)
72 graph = TaskGraph(
95 tasks, new_graph = TaskGraph.from_json(graph.to_json())
98 simple_graph = TaskGraph(
H A Dtest_create.py13 from gecko_taskgraph.taskgraph import TaskGraph
44 taskgraph = TaskGraph(tasks, graph)
73 taskgraph = TaskGraph(tasks, graph)
96 taskgraph = TaskGraph(tasks, graph)
/dports/mail/thunderbird/thunderbird-91.8.0/taskcluster/taskgraph/test/
H A Dtest_taskgraph.py11 from taskgraph.taskgraph import TaskGraph
40 taskgraph = TaskGraph(tasks, graph)
73 graph = TaskGraph(
96 tasks, new_graph = TaskGraph.from_json(graph.to_json())
99 simple_graph = TaskGraph(
H A Dtest_create.py14 from taskgraph.taskgraph import TaskGraph
45 taskgraph = TaskGraph(tasks, graph)
74 taskgraph = TaskGraph(tasks, graph)
97 taskgraph = TaskGraph(tasks, graph)
/dports/lang/spidermonkey78/firefox-78.9.0/taskcluster/taskgraph/test/
H A Dtest_taskgraph.py11 from taskgraph.taskgraph import TaskGraph
33 taskgraph = TaskGraph(tasks, graph)
59 graph = TaskGraph(tasks={
76 tasks, new_graph = TaskGraph.from_json(graph.to_json())
79 simple_graph = TaskGraph(tasks={
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/
H A DBLI_task.h302 struct TaskGraph;
308 struct TaskGraph *BLI_task_graph_create(void);
309 void BLI_task_graph_work_and_wait(struct TaskGraph *task_graph);
310 void BLI_task_graph_free(struct TaskGraph *task_graph);
311 struct TaskNode *BLI_task_graph_node_create(struct TaskGraph *task_graph,
/dports/www/firefox-legacy/firefox-52.8.0esr/taskcluster/taskgraph/test/
H A Dtest_taskgraph.py12 from ..taskgraph import TaskGraph
32 graph = TaskGraph(tasks={
49 tasks, new_graph = TaskGraph.from_json(graph.to_json())
/dports/science/ascent/ascent-0.7.1-66-gbcf2742a/src/ascent/runtimes/flow_filters/
H A Dascent_runtime_babelflow_comp_utils.cpp621 std::vector<BabelFlow::TaskGraph*> gr_vec{ &m_preProcTaskGr, &m_reduceTaskGr }; in Initialize()
627 …BabelFlow::TaskGraph::registerCallback( 0, BabelFlow::SingleTaskGraph::SINGLE_TASK_CB, bflow_comp:… in Initialize()
628 …BabelFlow::TaskGraph::registerCallback( 1, BabelFlow::KWayReduction::LEAF_TASK_CB, bflow_comp::vol… in Initialize()
629 …BabelFlow::TaskGraph::registerCallback( 1, BabelFlow::KWayReduction::MID_TASK_CB, bflow_comp::comp… in Initialize()
630 …BabelFlow::TaskGraph::registerCallback( 1, BabelFlow::KWayReduction::ROOT_TASK_CB, bflow_comp::wri… in Initialize()
678 std::vector<BabelFlow::TaskGraph*> gr_vec{ &m_preProcTaskGr, &m_binSwapTaskGr }; in Initialize()
684 …BabelFlow::TaskGraph::registerCallback( 0, BabelFlow::SingleTaskGraph::SINGLE_TASK_CB, bflow_comp:… in Initialize()
686 …BabelFlow::TaskGraph::registerCallback( 1, BabelFlow::BinarySwap::MID_TASK_CB, bflow_comp::composi… in Initialize()
757 std::vector<BabelFlow::TaskGraph*> gr_vec{ &m_radixkGr, &m_gatherTaskGr }; in Initialize()
764 …BabelFlow::TaskGraph::registerCallback( 0, BabelFlow::RadixKExchange::MID_TASK_CB, bflow_comp::com… in Initialize()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/cc/test/
H A Dtask_graph_runner_test_template.cc61 TaskGraph new_graph; in ScheduleTasks()
67 TaskGraph::Node(new_task.get(), it->category, it->priority, 0u)); in ScheduleTasks()
72 new_graph.nodes.push_back(TaskGraph::Node( in ScheduleTasks()
75 TaskGraph::Edge(new_task.get(), new_dependent_task.get())); in ScheduleTasks()

12345678