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.

task_generator_unittest.cc 8.8 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233
  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 "init/gelib.h"
  30. #include "ge/opskernel_manager/ops_kernel_builder_manager.h"
  31. #include "graph/build/task_generator.h"
  32. #include "graph/manager/graph_mem_manager.h"
  33. #include "graph/manager/graph_var_manager.h"
  34. #undef protected
  35. #undef private
  36. using namespace std;
  37. using namespace testing;
  38. using namespace ge;
  39. namespace {
  40. const char *const kIsInputVar = "INPUT_IS_VAR";
  41. const char *const kIsOutputVar = "OUTPUT_IS_VAR";
  42. const char *const kKernelInfoNameHccl = "ops_kernel_info_hccl";
  43. } // namespace
  44. class UtestTaskGeneratorTest : public testing::Test {
  45. public:
  46. struct FakeOpsKernelBuilder : OpsKernelBuilder {
  47. FakeOpsKernelBuilder(){};
  48. private:
  49. Status Initialize(const map<std::string, std::string> &options) override {
  50. return SUCCESS;
  51. };
  52. Status Finalize() override {
  53. return SUCCESS;
  54. };
  55. Status CalcOpRunningParam(Node &node) override {
  56. return SUCCESS;
  57. };
  58. Status GenerateTask(const Node &node, RunContext &context, std::vector<domi::TaskDef> &tasks) override {
  59. domi::TaskDef task_def;
  60. tasks.push_back(task_def);
  61. return SUCCESS;
  62. };
  63. };
  64. struct FakeOpsKernelInfoStore : OpsKernelInfoStore {
  65. FakeOpsKernelInfoStore() = default;
  66. private:
  67. Status Initialize(const std::map<std::string, std::string> &options) override {
  68. return SUCCESS;
  69. };
  70. Status Finalize() override {
  71. return SUCCESS;
  72. };
  73. bool CheckSupported(const OpDescPtr &op_desc, std::string &reason) const override {
  74. return true;
  75. };
  76. void GetAllOpsKernelInfo(std::map<std::string, ge::OpInfo> &infos) const override{};
  77. };
  78. ge::ComputeGraphPtr BuildGraphFpProfiling() {
  79. ge::ut::GraphBuilder builder("graph");
  80. auto data = builder.AddNode("data", "phony", 1, 1);
  81. auto addn1 = builder.AddNode("addn1", "AddN", 1, 1);
  82. auto netoutput = builder.AddNode("netoutput", "NetOutput", 2, 0);
  83. auto op_desc = data->GetOpDesc();
  84. (void)AttrUtils::SetStr(op_desc, ATTR_NAME_FRAMEWORK_ORIGINAL_TYPE, "IteratorV2");
  85. op_desc->SetOpKernelLibName("GE");
  86. builder.AddDataEdge(data, 0, addn1, 0);
  87. builder.AddDataEdge(addn1, 0, netoutput, 0);
  88. return builder.GetGraph();
  89. }
  90. ge::ComputeGraphPtr BuildGraphBpProfiling() {
  91. ge::ut::GraphBuilder builder("graph");
  92. auto data = builder.AddNode("data", "phony", 1, 1);
  93. auto addn1 = builder.AddNode("addn1", "AddN", 1, 1);
  94. auto netoutput = builder.AddNode("Node_Output", "NetOutput", 2, 0);
  95. auto data_desc = data->GetOpDesc();
  96. (void)AttrUtils::SetStr(data_desc, ATTR_NAME_FRAMEWORK_ORIGINAL_TYPE, "IteratorV2");
  97. data_desc->SetOpKernelLibName("GE");
  98. auto output_desc = netoutput->GetOpDesc();
  99. output_desc->SetOpKernelLibName("output");
  100. builder.AddDataEdge(data, 0, addn1, 0);
  101. builder.AddControlEdge(addn1, netoutput);
  102. return builder.GetGraph();
  103. }
  104. ge::ComputeGraphPtr BuildGraphWithVar(int64_t session_id) {
  105. // init
  106. MemManager::Instance().Initialize(std::vector<rtMemType_t>({RT_MEMORY_HBM}));
  107. VarManager::Instance(session_id)->Init(0, 0, 0, 0);
  108. ge::ut::GraphBuilder builder("graph");
  109. auto var_input = builder.AddNode("var", "Variable", 1, 1);
  110. auto const_input = builder.AddNode("const", "Const", 1, 1);
  111. auto assign = builder.AddNode("assgin", "Assign", 2, 1);
  112. // add link
  113. builder.AddDataEdge(var_input, 0, assign, 0);
  114. builder.AddDataEdge(const_input, 0, assign, 1);
  115. // set offset
  116. var_input->GetOpDesc()->SetOutputOffset({10000});
  117. const_input->GetOpDesc()->SetOutputOffset({1000});
  118. assign->GetOpDesc()->SetInputOffset({10100, 1000});
  119. assign->GetOpDesc()->SetOutputOffset({10100});
  120. // set inner offset
  121. int64_t inner_offset = 100;
  122. ge::AttrUtils::SetInt(assign->GetOpDesc()->MutableInputDesc(0), ATTR_NAME_INNER_OFFSET, inner_offset);
  123. ge::AttrUtils::SetInt(assign->GetOpDesc()->MutableOutputDesc(0), ATTR_NAME_INNER_OFFSET, inner_offset);
  124. // add var addr
  125. VarManager::Instance(session_id)->var_resource_->var_offset_map_.emplace(10000, RT_MEMORY_HBM);
  126. return builder.GetGraph();
  127. }
  128. ge::ComputeGraphPtr BuildHcclGraph() {
  129. ge::ut::GraphBuilder builder("graph");
  130. auto hccl_node = builder.AddNode("hccl_phony_node", "HCCL_PHONY", 0, 0);
  131. auto op_desc = hccl_node->GetOpDesc();
  132. op_desc->SetOpKernelLibName(kKernelInfoNameHccl);
  133. op_desc->SetStreamId(0);
  134. return builder.GetGraph();
  135. }
  136. protected:
  137. void SetUp() {}
  138. void TearDown() {}
  139. };
  140. TEST_F(UtestTaskGeneratorTest, AutoFindFpOpIndex) {
  141. auto graph = BuildGraphFpProfiling();
  142. TaskGenerator task_generator(nullptr, 0);
  143. ProfilingPoint profiling_point;
  144. profiling_point.fp_index = -1;
  145. EXPECT_EQ(task_generator.AutoFindFpOpIndex(graph, profiling_point), SUCCESS);
  146. // addn1 is fp
  147. EXPECT_EQ(profiling_point.fp_index, 2);
  148. }
  149. TEST_F(UtestTaskGeneratorTest, FindLastBpFromBpNode) {
  150. auto graph = BuildGraphBpProfiling();
  151. TaskGenerator task_generator(nullptr, 0);
  152. auto net_output = graph->FindNode("Node_Output");
  153. // netoutput has no data input, return default value 0
  154. uint32_t bp_index = 0;
  155. EXPECT_EQ(task_generator.FindLastBpFromBpNode(graph, net_output, bp_index), 0);
  156. EXPECT_EQ(bp_index, 2);
  157. }
  158. TEST_F(UtestTaskGeneratorTest, UpdateOpIsVarAttr) {
  159. int64_t session_id = 0;
  160. ge::ComputeGraphPtr graph = BuildGraphWithVar(session_id);
  161. graph->SetSessionID(session_id);
  162. TaskGenerator task_generator(nullptr, 0);
  163. auto assign = graph->FindNode("assgin");
  164. task_generator.UpdateOpIsVarAttr(assign->GetOpDesc(), session_id);
  165. // input
  166. vector<bool> input_var;
  167. AttrUtils::GetListBool(assign->GetOpDesc(), kIsInputVar, input_var);
  168. EXPECT_EQ(input_var.size(), 2);
  169. EXPECT_EQ(input_var[0], true);
  170. EXPECT_EQ(input_var[1], false);
  171. // output
  172. vector<bool> output_var;
  173. AttrUtils::GetListBool(assign->GetOpDesc(), kIsOutputVar, output_var);
  174. EXPECT_EQ(output_var.size(), 1);
  175. EXPECT_EQ(output_var[0], true);
  176. MemManager::Instance().Finalize();
  177. }
  178. TEST_F(UtestTaskGeneratorTest, AutoFindBpOpIndex) {
  179. auto graph = BuildGraphBpProfiling();
  180. TaskGenerator task_generator(nullptr, 0);
  181. auto net_output = graph->FindNode("Node_Output");
  182. ProfilingPoint profiling_point;
  183. vector<uint32_t> all_reduce_nodes;
  184. EXPECT_EQ(task_generator.AutoFindBpOpIndex(graph, profiling_point, all_reduce_nodes), SUCCESS);
  185. auto output_desc = net_output->GetOpDesc();
  186. output_desc->SetType("HcomAllReduce");
  187. output_desc->SetName("hcom");
  188. EXPECT_EQ(task_generator.AutoFindBpOpIndex(graph, profiling_point, all_reduce_nodes), SUCCESS);
  189. }
  190. TEST_F(UtestTaskGeneratorTest, GenerateTask) {
  191. map<string, string> options;
  192. Status ret = ge::GELib::Initialize(options);
  193. EXPECT_EQ(ret, SUCCESS);
  194. shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  195. EXPECT_NE(instance_ptr, nullptr);
  196. OpsKernelInfoStorePtr ops_kernel_info_store_ptr = MakeShared<FakeOpsKernelInfoStore>();
  197. instance_ptr->opsManager_.ops_kernel_store_.insert(make_pair(kKernelInfoNameHccl, ops_kernel_info_store_ptr));
  198. OpsKernelBuilderManager &builder_manager_instance_ptr = ge::OpsKernelBuilderManager::Instance();
  199. OpsKernelBuilderPtr fake_builder = MakeShared<FakeOpsKernelBuilder>();
  200. builder_manager_instance_ptr.ops_kernel_builders_[kKernelInfoNameHccl] = fake_builder;
  201. auto graph = BuildHcclGraph();
  202. TaskGenerator task_generator(nullptr, 0);
  203. RunContext run_context;
  204. run_context.graphStreamList.push_back(static_cast<void *>(ops_kernel_info_store_ptr.get()));
  205. vector<uint32_t> all_reduce_nodes;
  206. vector<domi::TaskDef> task_def_list;
  207. map<uint32_t, string> op_name_map;
  208. EXPECT_EQ(task_generator.GenerateTask(run_context, graph, task_def_list, op_name_map), SUCCESS);
  209. EXPECT_EQ(task_def_list.size(), 1);
  210. EXPECT_EQ(task_def_list[0].ops_kernel_store_ptr(), reinterpret_cast<uintptr_t>(ops_kernel_info_store_ptr.get()));
  211. }

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