From 8ad9ea921a355ed07b013cd1763a530b33426720 Mon Sep 17 00:00:00 2001
From: zhou_lili <zhoulili20@huawei.com>
Date: Wed, 13 Jan 2021 11:17:09 +0800
Subject: [PATCH] add check of ut

---
 ...data_nodes_with_common_input_pass_unittest.cc | 16 ++++++++++++++--
 ...o_data_out_const_elimination_pass_unittest.cc |  7 +++++++
 2 files changed, 21 insertions(+), 2 deletions(-)

diff --git a/tests/ut/ge/graph/passes/fuse_data_nodes_with_common_input_pass_unittest.cc b/tests/ut/ge/graph/passes/fuse_data_nodes_with_common_input_pass_unittest.cc
index 1660b3c6..aa69f6a3 100644
--- a/tests/ut/ge/graph/passes/fuse_data_nodes_with_common_input_pass_unittest.cc
+++ b/tests/ut/ge/graph/passes/fuse_data_nodes_with_common_input_pass_unittest.cc
@@ -58,8 +58,6 @@ public:
 ///       netoutput
 ///        ...
 ///      data0      data1       data2
-///         |          \         /
-///      conv               add
 TEST_F(UtestFuseDataNodesWithCommonInputPass, graph_with_subgraph1) {
   PassManager pass_manager;
   pass_manager.AddPass("FuseDataNodesWithCommonInputPass", new (std::nothrow) FuseDataNodesWithCommonInputPass);
@@ -81,6 +79,11 @@ TEST_F(UtestFuseDataNodesWithCommonInputPass, graph_with_subgraph1) {
   GraphUtils::AddEdge(parent_const->GetOutDataAnchor(0), parent_case->GetInDataAnchor(2));
   GraphUtils::AddEdge(parent_case->GetOutDataAnchor(0), parent_output->GetInDataAnchor(0));
 
+  auto case_node = parent_graph->FindNode("parent_case");
+  EXPECT_NE(case_node, nullptr);
+  size_t input_data_node_num = case_node->GetInDataNodes().size();
+  EXPECT_EQ(input_data_node_num, 3);
+
   ComputeGraphPtr sub_graph = std::make_shared<ComputeGraph>("sub_graph");
   auto data0 = MakeNode(parent_graph, 1, 1, "data0", "Data");
   data0->GetOpDesc()->UpdateInputDesc(0, tensor_desc);
@@ -98,6 +101,12 @@ TEST_F(UtestFuseDataNodesWithCommonInputPass, graph_with_subgraph1) {
   sub_graph->SetParentNode(parent_case);
   sub_graph->SetParentGraph(parent_graph);
   EXPECT_EQ(pass_manager.Run(sub_graph), SUCCESS);
+  // after pass, data1 and data2 are fused to data0
+  auto data1_node = sub_graph->FindNode("data1");
+  EXPECT_EQ(data1_node, nullptr);
+  auto data2_node = sub_graph->FindNode("data2");
+  EXPECT_EQ(data2_node, nullptr);
+
 }
 
 /// graph with subgraph
@@ -152,5 +161,8 @@ TEST_F(UtestFuseDataNodesWithCommonInputPass, graph_with_subgraph2) {
   sub_graph->SetParentNode(parent_case);
   sub_graph->SetParentGraph(parent_graph);
   EXPECT_EQ(pass_manager.Run(sub_graph), SUCCESS);
+  // after pass, data1 is fused to data0
+  auto data1_node = sub_graph->FindNode("data1");
+  EXPECT_EQ(data1_node, nullptr);
 }
 }  // namespace ge
diff --git a/tests/ut/ge/graph/passes/no_data_out_const_elimination_pass_unittest.cc b/tests/ut/ge/graph/passes/no_data_out_const_elimination_pass_unittest.cc
index c102f5c2..2fa80e2f 100644
--- a/tests/ut/ge/graph/passes/no_data_out_const_elimination_pass_unittest.cc
+++ b/tests/ut/ge/graph/passes/no_data_out_const_elimination_pass_unittest.cc
@@ -70,6 +70,13 @@ TEST_F(UtestNoDataOutConstEliminationPass, succ_graph1) {
   NamesToPass node_pass;
   NoDataOutConstEliminationPass no_data_out_const_elimination_pass;
   node_pass.emplace_back("NoDataOutConstEliminationPass", &no_data_out_const_elimination_pass);
+  auto const1 = graph->FindNode("const_node1");
+  EXPECT_NE(const1, nullptr);
+  EXPECT_TRUE(const1->GetInDataNodes().empty());
+  EXPECT_TRUE(const1->GetOutDataNodes().empty());
   EXPECT_EQ(pass.Run(node_pass), SUCCESS);
+  // after pass, const1 will be delete
+  const1 = graph->FindNode("const_node1");
+  EXPECT_EQ(const1, nullptr);
 }
 }  // namespace ge