You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

model_builder_unittest.cc 10 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236
  1. /**
  2. * Copyright 2019-2020 Huawei Technologies Co., Ltd
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #include <gtest/gtest.h>
  17. #include <memory>
  18. #include "graph/anchor.h"
  19. #include "graph/attr_value.h"
  20. #include "graph/debug/ge_attr_define.h"
  21. #include "graph/utils/graph_utils.h"
  22. #include "graph/utils/node_utils.h"
  23. #include "graph/utils/op_desc_utils.h"
  24. #include "graph/utils/tensor_utils.h"
  25. #include "omg/omg_inner_types.h"
  26. #include "../passes/graph_builder_utils.h"
  27. #define protected public
  28. #define private public
  29. #include "graph/build/model_builder.h"
  30. #include "memory/memory_assigner.h"
  31. #undef protected
  32. #undef private
  33. using namespace std;
  34. using namespace testing;
  35. using namespace ge;
  36. using domi::GetContext;
  37. class UtestModelBuilderTest : public testing::Test {
  38. public:
  39. ge::OpDescPtr CreateOpWithWsSize(const string &name, int64_t wsByte, const string &type = "some") {
  40. ge::OpDescPtr op_def = make_shared<ge::OpDesc>(name, type);
  41. auto desc_temp_ptr = make_shared<ge::GeTensorDesc>();
  42. auto desc_temp = *desc_temp_ptr;
  43. TensorUtils::SetSize(desc_temp, 1024);
  44. op_def->AddInputDesc(desc_temp);
  45. op_def->AddOutputDesc(desc_temp);
  46. std::vector<int64_t> workspace_bytes;
  47. workspace_bytes.push_back(wsByte);
  48. op_def->SetWorkspaceBytes(workspace_bytes);
  49. return op_def;
  50. }
  51. ge::OpDescPtr CreateRefOpWithWsSize(const string &name, int64_t wsByte, const string &type = "some") {
  52. ge::OpDescPtr op_def = make_shared<ge::OpDesc>(name, type);
  53. auto desc_temp_ptr = make_shared<ge::GeTensorDesc>();
  54. auto desc_temp = *desc_temp_ptr;
  55. TensorUtils::SetSize(desc_temp, 1024);
  56. op_def->AddInputDesc(desc_temp);
  57. auto desc_output_ptr = make_shared<ge::GeTensorDesc>();
  58. auto desc_output = *desc_output_ptr;
  59. TensorUtils::SetSize(desc_output, 6500);
  60. ge::TensorUtils::SetReuseInput(desc_output, true);
  61. ge::TensorUtils::SetReuseInputIndex(desc_output, 0);
  62. op_def->AddOutputDesc(desc_output);
  63. std::vector<int64_t> workspace_bytes;
  64. workspace_bytes.push_back(wsByte);
  65. op_def->SetWorkspaceBytes(workspace_bytes);
  66. return op_def;
  67. }
  68. void MakeGraph(ge::ComputeGraphPtr &graph) {
  69. ge::OpDescPtr op_def_a = CreateOpWithWsSize("A", 6000);
  70. op_def_a->SetStreamId(0);
  71. ge::OpDescPtr op_def_b = CreateOpWithWsSize("B", 120000);
  72. op_def_b->SetStreamId(0);
  73. ge::OpDescPtr op_def_c = CreateOpWithWsSize("C", 16000);
  74. op_def_c->SetStreamId(1);
  75. ge::OpDescPtr op_def_d = CreateOpWithWsSize("D", 24000);
  76. op_def_d->SetStreamId(2);
  77. ge::OpDescPtr op_def_e = CreateOpWithWsSize("E", 24000);
  78. op_def_e->SetStreamId(3);
  79. ge::OpDescPtr op_def_f = CreateOpWithWsSize("F", 30000);
  80. op_def_f->SetStreamId(2);
  81. ge::OpDescPtr op_def_g = CreateOpWithWsSize("G", 32000);
  82. op_def_g->SetStreamId(3);
  83. ge::OpDescPtr op_def_h = CreateOpWithWsSize("H", 48000);
  84. op_def_h->SetStreamId(2);
  85. ge::OpDescPtr op_def_i = CreateOpWithWsSize("I", 60000);
  86. op_def_i->SetStreamId(2);
  87. ge::OpDescPtr op_def_j = CreateOpWithWsSize("J", 256000, NETOUTPUT);
  88. op_def_j->SetStreamId(3);
  89. // add node
  90. ge::NodePtr node_a = graph->AddNode(op_def_a);
  91. ge::NodePtr node_b = graph->AddNode(op_def_b);
  92. ge::NodePtr node_c = graph->AddNode(op_def_c);
  93. ge::NodePtr node_d = graph->AddNode(op_def_d);
  94. ge::NodePtr node_e = graph->AddNode(op_def_e);
  95. ge::NodePtr node_f = graph->AddNode(op_def_f);
  96. ge::NodePtr node_g = graph->AddNode(op_def_g);
  97. ge::NodePtr node_h = graph->AddNode(op_def_h);
  98. ge::NodePtr node_i = graph->AddNode(op_def_i);
  99. ge::NodePtr node_j = graph->AddNode(op_def_j);
  100. // add edge
  101. ge::GraphUtils::AddEdge(node_a->GetOutDataAnchor(0), node_b->GetInDataAnchor(0));
  102. ge::GraphUtils::AddEdge(node_a->GetOutDataAnchor(0), node_c->GetInDataAnchor(0));
  103. ge::GraphUtils::AddEdge(node_b->GetOutDataAnchor(0), node_d->GetInDataAnchor(0));
  104. ge::GraphUtils::AddEdge(node_b->GetOutDataAnchor(0), node_e->GetInDataAnchor(0));
  105. ge::GraphUtils::AddEdge(node_c->GetOutDataAnchor(0), node_g->GetInDataAnchor(0));
  106. ge::GraphUtils::AddEdge(node_d->GetOutDataAnchor(0), node_f->GetInDataAnchor(0));
  107. ge::GraphUtils::AddEdge(node_e->GetOutDataAnchor(0), node_g->GetInDataAnchor(1));
  108. ge::GraphUtils::AddEdge(node_f->GetOutDataAnchor(0), node_h->GetInDataAnchor(0));
  109. ge::GraphUtils::AddEdge(node_g->GetOutDataAnchor(0), node_j->GetInDataAnchor(0));
  110. ge::GraphUtils::AddEdge(node_h->GetOutDataAnchor(0), node_i->GetInDataAnchor(0));
  111. ge::GraphUtils::AddEdge(node_i->GetOutDataAnchor(0), node_j->GetInDataAnchor(1));
  112. GetContext().out_nodes_map["H"] = {0};
  113. GetContext().out_nodes_map["I"] = {0};
  114. GetContext().out_nodes_map["J"] = {0};
  115. graph->TopologicalSorting();
  116. }
  117. void MakeSessionScopeReuseGraph(ge::ComputeGraphPtr graph) {
  118. ge::OpDescPtr op_def_a = CreateOpWithWsSize("A", 512);
  119. ge::OpDescPtr op_def_b = CreateOpWithWsSize("B", 0);
  120. ge::OpDescPtr op_def_c = CreateOpWithWsSize("C", 512);
  121. ge::OpDescPtr op_def_d = CreateOpWithWsSize("D", 512);
  122. ge::OpDescPtr op_def_e = CreateOpWithWsSize("E", 1024);
  123. ge::OpDescPtr op_def_f = CreateOpWithWsSize("F", 512);
  124. ge::OpDescPtr op_def_g = CreateOpWithWsSize("G", 0);
  125. std::vector<int64_t> workspace_bytes;
  126. workspace_bytes.push_back(1024);
  127. workspace_bytes.push_back(512);
  128. op_def_c->SetWorkspaceBytes(workspace_bytes);
  129. vector<int32_t> workspace_no_reuse_scope = { 0 , 1 };
  130. (void)ge::AttrUtils::SetListInt(op_def_c, ATTR_NAME_WORKSPACE_MEMORY_NO_REUSE_SCOPE, workspace_no_reuse_scope);
  131. vector<int32_t> workspace_no_reuse_scope_e = { 1 };
  132. (void)ge::AttrUtils::SetListInt(op_def_e, ATTR_NAME_WORKSPACE_MEMORY_NO_REUSE_SCOPE, workspace_no_reuse_scope_e);
  133. ge::NodePtr node_a = graph->AddNode(op_def_a);
  134. ge::NodePtr node_b = graph->AddNode(op_def_b);
  135. ge::NodePtr node_c = graph->AddNode(op_def_c);
  136. ge::NodePtr node_d = graph->AddNode(op_def_d);
  137. ge::NodePtr node_e = graph->AddNode(op_def_e);
  138. ge::NodePtr node_f = graph->AddNode(op_def_f);
  139. ge::NodePtr node_g = graph->AddNode(op_def_g);
  140. ge::GraphUtils::AddEdge(node_a->GetOutDataAnchor(0), node_b->GetInDataAnchor(0));
  141. ge::GraphUtils::AddEdge(node_b->GetOutDataAnchor(0), node_c->GetInDataAnchor(0));
  142. ge::GraphUtils::AddEdge(node_c->GetOutDataAnchor(0), node_d->GetInDataAnchor(0));
  143. ge::GraphUtils::AddEdge(node_d->GetOutDataAnchor(0), node_e->GetInDataAnchor(0));
  144. ge::GraphUtils::AddEdge(node_e->GetOutDataAnchor(0), node_f->GetInDataAnchor(0));
  145. ge::GraphUtils::AddEdge(node_f->GetOutDataAnchor(0), node_g->GetInDataAnchor(0));
  146. graph->TopologicalSorting();
  147. }
  148. protected:
  149. void SetUp() {}
  150. void TearDown() { GetContext().out_nodes_map.clear(); }
  151. };
  152. // when check GetMemoryRanges return fail, Assign return fail
  153. TEST_F(UtestModelBuilderTest, SetInputIsConst) {
  154. Graph2SubGraphInfoList subgraphs;
  155. std::map<std::string, int> stream_max_parallel_num;
  156. ge::ComputeGraphPtr graph = make_shared<ge::ComputeGraph>("");
  157. MakeGraph(graph);
  158. graph->TopologicalSorting();
  159. ge::ModelBuilder builder(0, graph, subgraphs, stream_max_parallel_num, false);
  160. EXPECT_EQ(builder.PreBuildModel(), SUCCESS);
  161. }
  162. TEST_F(UtestModelBuilderTest, test_save_atomic_bin) {
  163. Graph2SubGraphInfoList subgraphs;
  164. std::map<std::string, int> stream_max_parallel_num;
  165. ge::ComputeGraphPtr graph = make_shared<ge::ComputeGraph>("");
  166. ge::ModelBuilder builder(0, graph, subgraphs, stream_max_parallel_num, false);
  167. auto atomic_op_desc = make_shared<OpDesc>("Atomic", "Atomic");
  168. auto kernel_buffer = static_cast<GeAttrValue::BYTES>(Buffer(10));
  169. AttrUtils::SetStr(atomic_op_desc, ATTR_NAME_TBE_KERNEL_NAME, "Atomic");
  170. AttrUtils::SetBytes(atomic_op_desc, ATTR_NAME_TBE_KERNEL_BUFFER, kernel_buffer);
  171. ge::NodePtr atomic_node = graph->AddNode(atomic_op_desc);
  172. auto op_desc = make_shared<OpDesc>("Sum", "Sum");
  173. op_desc->SetExtAttr("atomic_clean_node_ptr", atomic_node);
  174. EXPECT_EQ(builder.SaveAtomicTBEKernel(op_desc), SUCCESS);
  175. }
  176. TEST_F(UtestModelBuilderTest, build_model_for_get_task) {
  177. Graph2SubGraphInfoList subgraphs;
  178. std::map<std::string, int> stream_max_parallel_num;
  179. ge::ComputeGraphPtr graph = make_shared<ge::ComputeGraph>("");
  180. MakeSessionScopeReuseGraph(graph);
  181. std::map<std::string, std::string> option;
  182. ge::ModelBuilder builder(0, graph, subgraphs, stream_max_parallel_num, false);
  183. MemoryAssigner mem_assigner(graph);
  184. EXPECT_EQ(mem_assigner.AssignMemory(false, builder.mem_type_to_mem_offset_, builder.zero_copy_mem_size_), SUCCESS);
  185. ge::Model model;
  186. EXPECT_EQ(builder.BuildModelDef(model), SUCCESS);
  187. int64_t session_scope_mem_offset = 0;
  188. ge::AttrUtils::GetInt(&model, ATTR_MODEL_SESSION_SCOPE_MEMORY_SIZE, session_scope_mem_offset);
  189. EXPECT_EQ(session_scope_mem_offset, 1536);
  190. }
  191. TEST_F(UtestModelBuilderTest, test_model_save) {
  192. Graph2SubGraphInfoList subgraphs;
  193. std::map<std::string, int> stream_max_parallel_num;
  194. ge::ComputeGraphPtr graph = make_shared<ge::ComputeGraph>("");
  195. ge::ModelBuilder builder(0, graph, subgraphs, stream_max_parallel_num, false);
  196. auto op_desc = make_shared<OpDesc>("Conv2d", "Conv2d");
  197. auto kernel_buffer = static_cast<GeAttrValue::BYTES>(Buffer(10));
  198. AttrUtils::SetStr(op_desc, ATTR_NAME_TBE_KERNEL_NAME, "Conv2d");
  199. AttrUtils::SetBytes(op_desc, ATTR_NAME_TBE_KERNEL_BUFFER, kernel_buffer);
  200. ge::NodePtr node = graph->AddNode(op_desc);
  201. ge::Model ge_model;
  202. ge::GeModel ge_gemodel;
  203. builder.SaveDataToModel(ge_model, ge_gemodel);
  204. auto tbe_kernel = op_desc->TryGetExtAttr(OP_EXTATTR_NAME_TBE_KERNEL, TBEKernelPtr());
  205. EXPECT_NE(tbe_kernel, nullptr);
  206. }

图引擎模块(GE)是MindSpore的一个子模块,其代码由C++实现,位于前端模块ME和底层硬件之间,起到承接作用。图引擎模块以ME下发的图作为输入,然后进行一系列的深度图优化操作,最后输出一张可以在底层硬件上高效运行的图。GE针对昇腾AI处理器的硬件结构特点,做了特定的优化工作,以此来充分发挥出昇腾AI处理器的强大算力。在进行模型训练/推理时,GE会被自动调用而用户并不感知。GE主要由GE API和GE Core两部分组成,详细的架构图如下所示