Home
last modified time | relevance | path

Searched refs:node_to_start_time (Results 1 – 2 of 2) sorted by relevance

/external/tensorflow/tensorflow/core/graph/
Dgraph_partition_test.cc544 std::unordered_map<const NodeDef*, int64> node_to_start_time; in TEST() local
546 TopologicalSortNodesWithTimePriority(&gdef, &nodes, &node_to_start_time)); in TEST()
595 std::unordered_map<const NodeDef*, int64> node_to_start_time; in TEST() local
597 TopologicalSortNodesWithTimePriority(&gdef, &nodes, &node_to_start_time)); in TEST()
603 EXPECT_EQ(i + 1, node_to_start_time[node]); in TEST()
611 EXPECT_EQ(50 - (square_index + 1), node_to_start_time[node]); in TEST()
615 EXPECT_EQ(50, node_to_start_time[nodes.back().first]); in TEST()
683 std::unordered_map<const NodeDef*, int64> node_to_start_time; in TEST() local
685 TopologicalSortNodesWithTimePriority(&gdef, &nodes, &node_to_start_time)); in TEST()
693 EXPECT_EQ(i + 1, node_to_start_time[node]); in TEST()
[all …]
Dgraph_partition.cc818 std::unordered_map<const NodeDef*, int64> node_to_start_time; in TopologicalSortNodesWithTimePriority() local
819 auto enqueue = [&q, &node_to_start_time](const NodeDef* node) { in TopologicalSortNodesWithTimePriority()
820 const int64 start_time = node_to_start_time[node]; in TopologicalSortNodesWithTimePriority()
835 node_to_start_time[ndef] = start_time; in TopologicalSortNodesWithTimePriority()
869 auto& output_start_time = node_to_start_time[n]; in TopologicalSortNodesWithTimePriority()
881 node_to_start_time_out->swap(node_to_start_time); in TopologicalSortNodesWithTimePriority()
895 std::unordered_map<const NodeDef*, int64> node_to_start_time; in AddControlEdges() local
897 &node_to_start_time); in AddControlEdges()
933 const int64 start_time = node_to_start_time[ndef]; in AddControlEdges()