| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | filter_fusion_test.cc | 52 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter1", output)); in TEST()
53 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter2", output)); in TEST()
77 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter1", output)); in TEST()
78 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter2", output)); in TEST()
79 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter3", output)); in TEST()
|
| D | map_fusion_test.cc | 52 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
53 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map2", output)); in TEST()
77 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
78 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map2", output)); in TEST()
79 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map3", output)); in TEST()
|
| D | map_and_filter_fusion_test.cc | 54 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
55 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter", output)); in TEST()
85 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
86 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter", output)); in TEST()
118 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
119 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter", output)); in TEST()
167 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
168 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("filter", output)); in TEST()
|
| D | graph_utils_test.cc | 44 EXPECT_TRUE(ContainsGraphNodeWithName(bool_node->name(), *graph.graph())); in TEST()
52 EXPECT_TRUE(ContainsGraphNodeWithName(double_node->name(), *graph.graph())); in TEST()
60 EXPECT_TRUE(ContainsGraphNodeWithName(float_node->name(), *graph.graph())); in TEST()
68 EXPECT_TRUE(ContainsGraphNodeWithName(int_node->name(), *graph.graph())); in TEST()
76 EXPECT_TRUE(ContainsGraphNodeWithName(int64_node->name(), *graph.graph())); in TEST()
84 EXPECT_TRUE(ContainsGraphNodeWithName(string_node->name(), *graph.graph())); in TEST()
104 TEST(GraphUtilsTest, ContainsGraphNodeWithName) { in TEST() argument
107 EXPECT_TRUE(!ContainsGraphNodeWithName("A", *graph.graph())); in TEST()
110 EXPECT_TRUE(ContainsGraphNodeWithName("A", *graph.graph())); in TEST()
113 EXPECT_TRUE(!ContainsGraphNodeWithName("A", *graph.graph())); in TEST()
|
| D | map_parallelization_test.cc | 53 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
54 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map2", output)); in TEST()
79 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
80 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map2", output)); in TEST()
|
| D | noop_elimination_test.cc | 96 EXPECT_EQ(graph_utils::ContainsGraphNodeWithName(node->name(), output), in TEST_P()
137 EXPECT_EQ(graph_utils::ContainsGraphNodeWithName(node->name(), output), in TEST_P()
140 graph_utils::ContainsGraphNodeWithName(cache_node->name(), output)); in TEST_P()
198 graph_utils::ContainsGraphNodeWithName(noop_node_name, output)); in TEST_P()
201 graph_utils::ContainsGraphNodeWithName(cache_node->name(), output)); in TEST_P()
249 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName(noop_node_name, output)); in TEST_P()
|
| D | make_sloppy_test.cc | 59 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName("interleave", output)); in TEST()
84 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName("map", output)); in TEST()
107 EXPECT_TRUE(graph_utils::ContainsGraphNodeWithName("parse_example", output)); in TEST()
|
| D | map_and_batch_fusion_test.cc | 84 graph_utils::ContainsGraphNodeWithName(map_node->name(), output)); in TEST()
86 graph_utils::ContainsGraphNodeWithName(batch_node->name(), output)); in TEST()
170 graph_utils::ContainsGraphNodeWithName(map_node->name(), output)); in TEST()
172 graph_utils::ContainsGraphNodeWithName(batch_node->name(), output)); in TEST()
254 graph_utils::ContainsGraphNodeWithName(map_node->name(), output)); in TEST()
256 graph_utils::ContainsGraphNodeWithName(batch_node->name(), output)); in TEST()
|
| D | make_numa_aware_test.cc | 59 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map_and_batch", output)); in TEST()
94 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map_and_batch", output)); in TEST()
|
| D | shuffle_and_repeat_fusion_test.cc | 75 graph_utils::ContainsGraphNodeWithName(shuffle_node->name(), output)); in TEST()
77 graph_utils::ContainsGraphNodeWithName(repeat_node->name(), output)); in TEST()
|
| D | hoist_random_uniform_test.cc | 53 EXPECT_FALSE(graph_utils::ContainsGraphNodeWithName("map1", output)); in TEST()
|
| D | graph_utils.h | 86 bool ContainsGraphNodeWithName(StringPiece name, const GraphDef& graph);
|
| D | graph_utils.cc | 195 bool ContainsGraphNodeWithName(StringPiece name, const GraphDef& graph) { in ContainsGraphNodeWithName() function
246 while (ContainsGraphNodeWithName(name, *graph)) { in SetUniqueGraphNodeName()
|