Home
last modified time | relevance | path

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

/external/tensorflow/tensorflow/core/grappler/utils/
Dtopological_sort_test.cc69 std::vector<const NodeDef*> topo_order; in TEST_F() local
70 TF_EXPECT_OK(ComputeTopologicalOrder(graph, &topo_order)); in TEST_F()
74 ASSERT_EQ(topo_order.size(), order.size()); in TEST_F()
75 for (int i = 0; i < topo_order.size(); ++i) { in TEST_F()
76 const NodeDef* node = topo_order[i]; in TEST_F()
81 for (int i = 0; i < topo_order.size(); i++) { in TEST_F()
96 std::vector<const NodeDef*> topo_order; in TEST_F() local
97 TF_EXPECT_OK(ComputeTopologicalOrder(graph, &topo_order)); in TEST_F()
101 ASSERT_EQ(topo_order.size(), order.size()); in TEST_F()
102 for (int i = 0; i < topo_order.size(); ++i) { in TEST_F()
[all …]
Dtopological_sort.cc116 std::vector<const NodeDef*>* topo_order) { in ComputeTopologicalOrder() argument
121 topo_order->reserve(ready_nodes.size()); in ComputeTopologicalOrder()
123 topo_order->emplace_back(&graph.node(ready_node_idx)); in ComputeTopologicalOrder()
130 std::vector<const NodeDef*>* topo_order) { in ComputeTopologicalOrder() argument
131 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.cc475 explicit TopoQueue(const std::vector<const NodeDef*>& topo_order) in TopoQueue() argument
476 : topo_order_(TopoOrder(topo_order)) {} in TopoQueue()
502 const std::vector<const NodeDef*>& topo_order) const { in TopoOrder()
504 map.reserve(topo_order.size()); in TopoOrder()
505 for (int i = 0, topo_order_size = topo_order.size(); i < topo_order_size; in TopoOrder()
507 map.emplace(topo_order[i], i); in TopoOrder()
2545 std::vector<const NodeDef*> topo_order; in InferStatically() local
2546 Status s = ComputeTopologicalOrder(item_.graph, extra_deps, &topo_order); in InferStatically()
2555 TF_RETURN_IF_ERROR(ComputeTopologicalOrder(item_.graph, &topo_order)); in InferStatically()
2564 TopoQueue new_shapes(topo_order); in InferStatically()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dmemory_optimizer.cc620 std::unordered_map<const NodeDef*, int> topo_order; in SchedulingPass() local
622 DfsCallbacks::PostOrder([&topo_order](const NodeDef* n) { in SchedulingPass()
623 int topo_index = static_cast<int>(topo_order.size()); in SchedulingPass()
624 topo_order[n] = topo_index; in SchedulingPass()
633 input_topo_index.push_back(topo_order.at(node)); in SchedulingPass()