Home
last modified time | relevance | path

Searched refs:topo_order (Results 1 – 7 of 7) sorted by relevance

/external/tensorflow/tensorflow/core/grappler/utils/
Dtopological_sort_test.cc68 std::vector<const NodeDef*> topo_order; in TEST_F() local
69 TF_EXPECT_OK(ComputeTopologicalOrder(graph, &topo_order)); in TEST_F()
73 ASSERT_EQ(topo_order.size(), order.size()); in TEST_F()
74 for (int i = 0; i < topo_order.size(); ++i) { in TEST_F()
75 const NodeDef* node = topo_order[i]; in TEST_F()
80 for (int i = 0; i < topo_order.size(); i++) { in TEST_F()
95 std::vector<const NodeDef*> topo_order; in TEST_F() local
96 TF_EXPECT_OK(ComputeTopologicalOrder(graph, &topo_order)); in TEST_F()
100 ASSERT_EQ(topo_order.size(), order.size()); in TEST_F()
101 for (int i = 0; i < topo_order.size(); ++i) { in TEST_F()
[all …]
Dtopological_sort.cc104 std::vector<const NodeDef*>* topo_order) { in ComputeTopologicalOrder() argument
109 topo_order->reserve(ready_nodes.size()); in ComputeTopologicalOrder()
111 topo_order->emplace_back(&graph.node(ready_node_idx)); in ComputeTopologicalOrder()
118 std::vector<const NodeDef*>* topo_order) { in ComputeTopologicalOrder() argument
119 return ComputeTopologicalOrder(graph, {}, topo_order); in ComputeTopologicalOrder()
Dtopological_sort.h45 std::vector<const NodeDef*>* topo_order);
47 std::vector<const NodeDef*>* topo_order);
/external/tensorflow/tensorflow/core/grappler/verifiers/
Dstructure_verifier.cc43 std::vector<const NodeDef*> topo_order; in Verify() local
44 status_group.Update(ComputeTopologicalOrder(graph, &topo_order)); in Verify()
/external/tensorflow/tensorflow/core/grappler/costs/
Dgraph_properties.cc423 explicit TopoQueue(const std::vector<const NodeDef*>& topo_order) in TopoQueue() argument
424 : topo_order_(TopoOrder(topo_order)) {} in TopoQueue()
450 const std::vector<const NodeDef*>& topo_order) const { in TopoOrder()
452 map.reserve(topo_order.size()); in TopoOrder()
453 for (int i = 0; i < topo_order.size(); ++i) { in TopoOrder()
454 map.emplace(topo_order[i], i); in TopoOrder()
2110 std::vector<const NodeDef*> topo_order; in InferStatically() local
2111 Status s = ComputeTopologicalOrder(item_.graph, extra_deps, &topo_order); in InferStatically()
2120 TF_RETURN_IF_ERROR(ComputeTopologicalOrder(item_.graph, &topo_order)); in InferStatically()
2127 TopoQueue new_shapes(topo_order); in InferStatically()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dmemory_optimizer.cc593 std::unordered_map<const NodeDef*, int> topo_order; in SchedulingPass() local
595 DfsCallbacks::PostOrder([&topo_order](const NodeDef* n) { in SchedulingPass()
596 int topo_index = static_cast<int>(topo_order.size()); in SchedulingPass()
597 topo_order[n] = topo_index; in SchedulingPass()
606 input_topo_index.push_back(topo_order.at(node)); in SchedulingPass()
/external/tensorflow/tensorflow/python/grappler/
Dhierarchical_controller.py433 topo_order = [op.name for op in self.important_ops]
437 for idx, x in enumerate(topo_order):
507 for idx, op_name in enumerate(topo_order):