/external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
D | disable_intra_op_parallelism_test.cc | 82 NodeDef new_parallelism_val = output.node(graph_utils::FindGraphNodeWithName( in TEST_P() 139 output.node(graph_utils::FindGraphNodeWithName("Sink", output)); in TEST_P() 142 graph_utils::FindGraphNodeWithName(sink_node.input(0), output)); in TEST_P() 146 graph_utils::FindGraphNodeWithName(parallelism_node.input(0), output)); in TEST_P() 149 graph_utils::FindGraphNodeWithName(parallelism_node.input(1), output)); in TEST_P() 183 output.node(graph_utils::FindGraphNodeWithName("Sink", output)); in TEST() 186 graph_utils::FindGraphNodeWithName(sink_node.input(0), output)); in TEST() 190 graph_utils::FindGraphNodeWithName(model_node.input(0), output)); in TEST() 194 graph_utils::FindGraphNodeWithName(parallelism_node.input(0), output)); in TEST() 197 graph_utils::FindGraphNodeWithName(parallelism_node.input(1), output)); in TEST()
|
D | autotune_buffer_sizes_test.cc | 112 graph_utils::FindGraphNodeWithName(prefetch_node.input(0), output)); in TEST_P() 115 graph_utils::FindGraphNodeWithName(prefetch_node.input(1), output)); in TEST_P() 222 output.node(graph_utils::FindGraphNodeWithName("map3", output)); in TEST_P() 225 graph_utils::FindGraphNodeWithName(new_map_node3.input(0), output)); in TEST_P() 233 graph_utils::FindGraphNodeWithName(new_prefetch_node2.input(1), output)); in TEST_P() 237 graph_utils::FindGraphNodeWithName(new_prefetch_node2.input(0), output)); in TEST_P() 241 graph_utils::FindGraphNodeWithName(new_map_node2.input(0), output)); in TEST_P() 249 graph_utils::FindGraphNodeWithName(new_prefetch_node1.input(1), output)); in TEST_P() 253 graph_utils::FindGraphNodeWithName(new_prefetch_node1.input(0), output)); in TEST_P()
|
D | disable_prefetch_legacy_autotune_test.cc | 72 output.node(graph_utils::FindGraphNodeWithName("prefetch1", output)); in TEST_P() 75 output.node(graph_utils::FindGraphNodeWithName("prefetch2", output)); in TEST_P() 78 output.node(graph_utils::FindGraphNodeWithName("prefetch3", output)); in TEST_P()
|
D | make_sloppy_test.cc | 56 int index = graph_utils::FindGraphNodeWithName("interleave", output); in TEST() 82 int index = graph_utils::FindGraphNodeWithName("map", output); in TEST() 106 int index = graph_utils::FindGraphNodeWithName("parse_example", output); in TEST()
|
D | parallel_batch_test.cc | 49 int index = graph_utils::FindGraphNodeWithName("batch", output); in TEST() 71 int index = graph_utils::FindGraphNodeWithName("batch", output); in TEST()
|
D | map_and_batch_fusion_test.cc | 95 graph_utils::FindGraphNodeWithName(map_and_batch_node.input(3), output)); in TEST() 99 graph_utils::FindGraphNodeWithName(map_and_batch_node.input(4), output)); in TEST() 180 graph_utils::FindGraphNodeWithName(map_and_batch_node.input(3), output)); in TEST() 263 graph_utils::FindGraphNodeWithName(map_and_batch_node.input(3), output)); in TEST() 267 graph_utils::FindGraphNodeWithName(map_and_batch_node.input(4), output)); in TEST() 348 graph_utils::FindGraphNodeWithName(map_and_batch_node.input(3), output)); in TEST() 352 graph_utils::FindGraphNodeWithName(map_and_batch_node.input(4), output)); in TEST()
|
D | graph_utils_test.cc | 196 TEST(GraphUtilsTest, FindGraphNodeWithName) { in TEST() argument 199 EXPECT_EQ(FindGraphNodeWithName("A", *graph.graph()), -1); in TEST() 202 EXPECT_NE(FindGraphNodeWithName("A", *graph.graph()), -1); in TEST() 205 EXPECT_EQ(FindGraphNodeWithName("A", *graph.graph()), -1); in TEST() 230 EXPECT_EQ(FindGraphNodeWithName("A2", *graph.graph()), 1); in TEST()
|
D | batch_parallelization_test.cc | 132 item.graph.node(graph_utils::FindGraphNodeWithName("batch", item.graph)); in TEST() 149 graph_utils::FindGraphNodeWithName(parallel_batch.input(2), output)); in TEST()
|
D | enable_gradient_descent_test.cc | 71 output.node(graph_utils::FindGraphNodeWithName("model", output)); in TEST_P()
|
D | batch_parallelization.cc | 41 int index = graph_utils::FindGraphNodeWithName(name, *graph->graph()); in MakeParallelBatch()
|
D | map_parallelization.cc | 40 int index = graph_utils::FindGraphNodeWithName(name, *graph->graph()); in MakeParallelMap()
|
D | noop_elimination_test.cc | 143 graph_utils::FindGraphNodeWithName(cache_node->name(), output)); in TEST_P() 204 graph_utils::FindGraphNodeWithName(cache_node->name(), output)); in TEST_P()
|
D | graph_utils.h | 113 int FindGraphNodeWithName(StringPiece name, const GraphDef& graph);
|
D | graph_utils.cc | 238 return FindGraphNodeWithName(name, graph) != -1; in ContainsGraphNodeWithName() 254 int FindGraphNodeWithName(StringPiece name, const GraphDef& graph) { in FindGraphNodeWithName() function
|