Home
last modified time | relevance | path

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

/aosp_15_r20/external/tensorflow/tensorflow/core/graph/
H A Dgraph_partition_test.cc545 std::unordered_map<const NodeDef*, int64_t> node_to_start_time; in TEST() local
547 TopologicalSortNodesWithTimePriority(&gdef, &nodes, &node_to_start_time)); in TEST()
596 std::unordered_map<const NodeDef*, int64_t> node_to_start_time; in TEST() local
598 TopologicalSortNodesWithTimePriority(&gdef, &nodes, &node_to_start_time)); in TEST()
604 EXPECT_EQ(i + 1, node_to_start_time[node]); in TEST()
612 EXPECT_EQ(50 - (square_index + 1), node_to_start_time[node]); in TEST()
616 EXPECT_EQ(50, node_to_start_time[nodes.back().first]); in TEST()
684 std::unordered_map<const NodeDef*, int64_t> node_to_start_time; in TEST() local
686 TopologicalSortNodesWithTimePriority(&gdef, &nodes, &node_to_start_time)); in TEST()
694 EXPECT_EQ(i + 1, node_to_start_time[node]); in TEST()
[all …]
H A Dgraph_partition.cc819 std::unordered_map<const NodeDef*, int64_t> node_to_start_time; in TopologicalSortNodesWithTimePriority() local
820 auto enqueue = [&q, &node_to_start_time](const NodeDef* node) { in TopologicalSortNodesWithTimePriority()
821 const int64_t start_time = node_to_start_time[node]; in TopologicalSortNodesWithTimePriority()
836 node_to_start_time[ndef] = start_time; in TopologicalSortNodesWithTimePriority()
870 auto& output_start_time = node_to_start_time[n]; in TopologicalSortNodesWithTimePriority()
882 node_to_start_time_out->swap(node_to_start_time); in TopologicalSortNodesWithTimePriority()
896 std::unordered_map<const NodeDef*, int64_t> node_to_start_time; in AddControlEdges() local
898 &node_to_start_time); in AddControlEdges()
934 const int64_t start_time = node_to_start_time[ndef]; in AddControlEdges()