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.

graph_builder.cc 36 kB

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
4 years ago
4 years ago
4 years ago
4 years ago
5 years ago
5 years ago
4 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796
  1. /**
  2. * Copyright 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 "graph/build/graph_builder.h"
  17. #include "graph/build/memory/graph_mem_assigner.h"
  18. #include "common/ge/ge_util.h"
  19. #include "common/helper/model_helper.h"
  20. #include "graph/build/logical_stream_allocator.h"
  21. #include "graph/build/run_context.h"
  22. #include "graph/build/stream_graph_optimizer.h"
  23. #include "graph/common/ge_call_wrapper.h"
  24. #include "graph/ge_context.h"
  25. #include "graph/manager/graph_var_manager.h"
  26. #include "graph/passes/mark_same_addr_pass.h"
  27. #include "graph/utils/node_utils.h"
  28. #include "graph/utils/type_utils.h"
  29. #include "init/gelib.h"
  30. #include "model/ge_model.h"
  31. #include "graph/ge_context.h"
  32. #include "opskernel_manager/ops_kernel_builder_manager.h"
  33. #include "graph/utils/op_desc_utils.h"
  34. using domi::BuildMode;
  35. namespace {
  36. const int32_t kInvalidPerfLevel = -1;
  37. const int64_t kProfilingArStep = 2;
  38. const int64_t kProfilingArStartLogid = 3;
  39. enum NodeType { kSubgraphData, kSubgraphNode, kOthers };
  40. } // namespace
  41. namespace ge {
  42. NodeType TransferNodeType(const NodePtr &node) {
  43. const std::string type = node->GetType();
  44. if (type == ge::DATA) {
  45. if (node->GetOwnerComputeGraph()->GetParentNode() == nullptr) {
  46. GELOGD("access src data node:%s", node->GetName().c_str());
  47. return kOthers;
  48. }
  49. GELOGD("access subgraph input node:%s", node->GetName().c_str());
  50. return kSubgraphData;
  51. } else if (type == PARTITIONEDCALL) {
  52. GELOGD("access subgraph node:%s", node->GetName().c_str());
  53. return kSubgraphNode;
  54. }
  55. GELOGD("access other node:%s", node->GetName().c_str());
  56. return kOthers;
  57. }
  58. Status HandleSubgraphNode(NodePtr &src_node, OutDataAnchorPtr &src_out_anchor) {
  59. auto subgraph = NodeUtils::GetSubgraph(*src_node, 0);
  60. GE_CHECK_NOTNULL(subgraph);
  61. const NodePtr &net_output_node = subgraph->FindFirstNodeMatchType(NETOUTPUT);
  62. GE_CHECK_NOTNULL(net_output_node);
  63. const InDataAnchorPtr &in_data_anchor = net_output_node->GetInDataAnchor(src_out_anchor->GetIdx());
  64. GE_CHECK_NOTNULL(in_data_anchor);
  65. const OutDataAnchorPtr &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  66. GE_CHECK_NOTNULL(peer_out_anchor);
  67. src_node = peer_out_anchor->GetOwnerNode();
  68. src_out_anchor = peer_out_anchor;
  69. return SUCCESS;
  70. }
  71. Status HandleSubgraphDataNode(NodePtr &src_node, OutDataAnchorPtr &src_out_anchor) {
  72. uint32_t index = 0;
  73. if (!AttrUtils::GetInt(src_node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, index)) {
  74. REPORT_INNER_ERROR("E19999", "get attr:%s failed from node:%s",
  75. ATTR_NAME_PARENT_NODE_INDEX.c_str(), src_node->GetName().c_str());
  76. GELOGE(FAILED, "Get attr ATTR_NAME_PARENT_NODE_INDEX failed, node:%s.", src_node->GetName().c_str());
  77. return FAILED;
  78. }
  79. const NodePtr &parent_node = src_node->GetOwnerComputeGraph()->GetParentNode();
  80. GE_CHECK_NOTNULL(parent_node);
  81. const InDataAnchorPtr &in_data_anchor = parent_node->GetInDataAnchor(index);
  82. GE_CHECK_NOTNULL(in_data_anchor);
  83. const OutDataAnchorPtr &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  84. GE_CHECK_NOTNULL(peer_out_anchor);
  85. src_node = peer_out_anchor->GetOwnerNode();
  86. src_out_anchor = peer_out_anchor;
  87. return SUCCESS;
  88. }
  89. GraphBuilder::GraphBuilder() : build_mode_(BuildMode::GEN_TASK_WITH_FUSION), hcom_parallel_(false) {}
  90. void GraphBuilder::SetOptions(const ge::GraphManagerOptions &options) {
  91. stream_max_parallel_num_ = options.stream_max_parallel_num;
  92. hcom_parallel_ = options.hcom_parallel;
  93. if (options.perf_level == kInvalidPerfLevel) {
  94. build_mode_ = static_cast<int>(BuildMode::GEN_TASK_WITH_FUSION);
  95. } else {
  96. build_mode_ = options.perf_level;
  97. }
  98. }
  99. Status GraphBuilder::CalcOpParam(const ge::ComputeGraphPtr &graph) {
  100. GE_CHECK_NOTNULL(graph);
  101. auto instance_ptr = ge::GELib::GetInstance();
  102. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  103. REPORT_INNER_ERROR("E19999", "check gelib instance null, graph:%s",
  104. graph->GetName().c_str());
  105. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "GraphBuilder: GE is not initialized");
  106. return GE_CLI_GE_NOT_INITIALIZED;
  107. }
  108. for (const auto &node_ptr : graph->GetNodes(graph->GetGraphUnknownFlag())) {
  109. GE_CHECK_NOTNULL(node_ptr->GetOpDesc());
  110. std::string kernel_lib_name = node_ptr->GetOpDesc()->GetOpKernelLibName();
  111. if (kernel_lib_name.empty()) {
  112. // reset op kernel lib
  113. (void)instance_ptr->DNNEngineManagerObj().GetDNNEngineName(node_ptr);
  114. kernel_lib_name = node_ptr->GetOpDesc()->GetOpKernelLibName();
  115. if (kernel_lib_name.empty()) {
  116. REPORT_INNER_ERROR("E19999", "op kernel lib is empty in node:%s(%s)",
  117. node_ptr->GetName().c_str(), node_ptr->GetType().c_str());
  118. GELOGE(INTERNAL_ERROR, "Get node:%s(%s) kernel lib failed.", node_ptr->GetName().c_str(),
  119. node_ptr->GetType().c_str());
  120. return INTERNAL_ERROR;
  121. }
  122. }
  123. auto ret = SetInputSize(node_ptr);
  124. if (ret != SUCCESS) {
  125. REPORT_CALL_ERROR("E19999", "Set node:%s(%s) inputDesc size failed",
  126. node_ptr->GetName().c_str(), node_ptr->GetType().c_str());
  127. GELOGE(ret, "Set node inputDesc size failed, node name is %s", node_ptr->GetName().c_str());
  128. return ret;
  129. }
  130. ret = OpsKernelBuilderManager::Instance().CalcOpRunningParam(*node_ptr);
  131. if (ret != SUCCESS) {
  132. REPORT_CALL_ERROR("E19999", "Call Calculate op:%s(%s) running param failed",
  133. node_ptr->GetName().c_str(), node_ptr->GetType().c_str());
  134. GELOGE(ret, "Calculate op running param failed, node name is %s", node_ptr->GetName().c_str());
  135. return ret;
  136. }
  137. GE_CHK_STATUS_RET(AddOutputMemTypeForNode(node_ptr));
  138. }
  139. auto parent_node = graph->GetParentNode();
  140. if (parent_node == nullptr) {
  141. return SUCCESS;
  142. }
  143. GE_CHK_STATUS_RET(UpdateParentNodeOutputSize(graph, parent_node));
  144. GELOGI("Success to calculate op running param.");
  145. return SUCCESS;
  146. }
  147. Status GraphBuilder::UpdateParentNodeOutputSize(const ge::ComputeGraphPtr &graph, ge::NodePtr &parent_node_ptr) {
  148. GELOGI("Begin to update parent node[%s] of graph[%s] output size.", parent_node_ptr->GetName().c_str(),
  149. graph->GetName().c_str());
  150. auto parent_op_desc = parent_node_ptr->GetOpDesc();
  151. GE_CHECK_NOTNULL(parent_op_desc);
  152. bool is_unknown_shape = graph->GetGraphUnknownFlag();
  153. if (is_unknown_shape) {
  154. GELOGI("Current graph[%s] is unknown, no need to update parent node[%s] output size.", graph->GetName().c_str(),
  155. parent_node_ptr->GetName().c_str());
  156. return SUCCESS;
  157. }
  158. for (const auto &node_ptr : graph->GetDirectNode()) {
  159. if (node_ptr->GetType() != NETOUTPUT) {
  160. continue;
  161. }
  162. auto op_desc = node_ptr->GetOpDesc();
  163. GE_CHECK_NOTNULL(op_desc);
  164. for (const auto &in_data_anchor : node_ptr->GetAllInDataAnchors()) {
  165. auto index = in_data_anchor->GetIdx();
  166. ge::GeTensorDesc desc_temp = op_desc->GetInputDesc(index);
  167. uint32_t parent_index = 0;
  168. if (!AttrUtils::GetInt(desc_temp, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  169. GELOGI("NetOutput input tensor %d, attr %s not found.", index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  170. continue;
  171. }
  172. int64_t size = 0;
  173. GE_IF_BOOL_EXEC(ge::TensorUtils::GetSize(desc_temp, size) != SUCCESS, GELOGI("Get size failed!"));
  174. ge::GeTensorDesc parent_desc_temp = parent_op_desc->GetOutputDesc(parent_index);
  175. ge::TensorUtils::SetSize(parent_desc_temp, size);
  176. GE_CHK_STATUS_RET(parent_op_desc->UpdateOutputDesc(parent_index, parent_desc_temp));
  177. GELOGI("Update parent node[%s] output index[%u] to size[%ld].", parent_node_ptr->GetName().c_str(), parent_index,
  178. size);
  179. }
  180. }
  181. return SUCCESS;
  182. }
  183. Status GraphBuilder::Build(ComputeGraphPtr &comp_graph, GeRootModelPtr &ge_root_model_ptr, uint64_t session_id) {
  184. if (comp_graph == nullptr) {
  185. REPORT_INNER_ERROR("E19999", "check compute_graph nullptr, session_id:%lu", session_id);
  186. GELOGE(GE_GRAPH_PARAM_NULLPTR, "Graph build comp_graph is null.");
  187. return GE_GRAPH_PARAM_NULLPTR;
  188. }
  189. ge_root_model_ptr = MakeShared<ge::GeRootModel>(comp_graph);
  190. if (ge_root_model_ptr == nullptr) {
  191. return MEMALLOC_FAILED;
  192. }
  193. GeModelPtr ge_model_ptr = nullptr;
  194. bool is_dynamic_shape = false;
  195. // To be compatible with the old process, do not verify the return value temporarily.
  196. (void)AttrUtils::GetBool(comp_graph, ATTR_NAME_DYNAMIC_SHAPE_PARTITIONED, is_dynamic_shape);
  197. if (is_dynamic_shape || comp_graph->GetGraphUnknownFlag()) {
  198. GE_CHK_STATUS_RET(
  199. BuildForDynamicShapeGraph(comp_graph, ge_root_model_ptr, ge_model_ptr, session_id),
  200. "Build for dynamic shape graph failed.");
  201. return SUCCESS;
  202. }
  203. GE_CHK_STATUS_RET(BuildForKnownShapeGraph(comp_graph, ge_model_ptr, session_id),
  204. "Build for known shape graph failed.");
  205. ge_root_model_ptr->SetSubgraphInstanceNameToModel(comp_graph->GetName(), ge_model_ptr);
  206. return SUCCESS;
  207. }
  208. Status GraphBuilder::BuildForKnownShapeGraph(ComputeGraphPtr &comp_graph,
  209. GeModelPtr &ge_model_ptr, uint64_t session_id) {
  210. if (ge::GetContext().GetHostExecFlag()) {
  211. GE_CHK_STATUS_RET(BuildForHostCpuGraph(comp_graph, ge_model_ptr, session_id), "Build for host-cpu graph failed.");
  212. return SUCCESS;
  213. }
  214. ErrorManager::GetInstance().SetStage(ErrorMessage::kModelCompile, ErrorMessage::kPreBuild);
  215. GELOGI("Begin to build known shape graph[%s].", comp_graph->GetName().c_str());
  216. Status ret = SecondPartition(comp_graph);
  217. GE_CHK_STATUS_RET(ret, "Graph[%s] second partition Failed.", comp_graph->GetName().c_str());
  218. auto subgraph_map = graph_partitioner_.GetSubGraphMap();
  219. GE_TIMESTAMP_START(BuildSubgraph);
  220. ge::ModelBuilder builder(session_id, comp_graph, subgraph_map, stream_max_parallel_num_, hcom_parallel_, build_mode_);
  221. GE_DUMP(comp_graph, "BeforePreBuildModel");
  222. GE_TIMESTAMP_START(PreBuildModel);
  223. GE_CHK_STATUS_RET(builder.PreBuildModel(), "Graph[%s] builder PreBuildModel() return fail.",
  224. comp_graph->GetName().c_str());
  225. GE_TIMESTAMP_END(PreBuildModel, "GraphBuilder::PreBuildModel");
  226. GE_DUMP(comp_graph, "AfterPreBuildModel");
  227. GE_TIMESTAMP_START(CalcOpParam);
  228. GE_CHK_STATUS_RET(CalcOpParam(comp_graph), "Graph[%s] builder CalcOpParam() return fail.",
  229. comp_graph->GetName().c_str());
  230. GE_TIMESTAMP_END(CalcOpParam, "GraphBuilder::CalcOpParam");
  231. GE_DUMP(comp_graph, "AfterCalcOpParam");
  232. ModelPtr model_ptr = MakeShared<ge::Model>();
  233. if (model_ptr == nullptr) {
  234. return MEMALLOC_FAILED;
  235. }
  236. GE_TIMESTAMP_START(BuildModelForGetTask);
  237. GE_CHK_STATUS_RET(builder.BuildModelForGetTask(*model_ptr), "Graph[%s] builder BuildModelForGetTask() return fail.",
  238. comp_graph->GetName().c_str());
  239. GE_TIMESTAMP_END(BuildModelForGetTask, "GraphBuilder::BuildModelForGetTask");
  240. GE_DUMP(comp_graph, "AfterBuildModel");
  241. ErrorManager::GetInstance().SetStage(ErrorMessage::kModelCompile, ErrorMessage::kTaskGenerate);
  242. GE_TIMESTAMP_START(GetTaskInfo);
  243. ret = GetTaskInfo(builder, model_ptr, comp_graph, subgraph_map, session_id);
  244. GE_TIMESTAMP_END(GetTaskInfo, "GraphBuilder::GetTaskInfo");
  245. GE_DUMP(comp_graph, "AfterGetTask");
  246. if (ret != SUCCESS) {
  247. GELOGE(ret, "Graph[%s] builder GetTaskInfo() return fail.", comp_graph->GetName().c_str());
  248. return ret;
  249. }
  250. ErrorManager::GetInstance().SetStage(ErrorMessage::kModelCompile, ErrorMessage::kOther);
  251. ge_model_ptr = MakeShared<ge::GeModel>();
  252. if (ge_model_ptr == nullptr) {
  253. return MEMALLOC_FAILED;
  254. }
  255. GE_CHK_STATUS_RET(builder.SaveDataToModel(*model_ptr, *ge_model_ptr),
  256. "Graph[%s] builder SaveDataToModel() return fail.", comp_graph->GetName().c_str());
  257. GELOGD("Success to build graph[%s] model.", comp_graph->GetName().c_str());
  258. GE_TIMESTAMP_END(BuildSubgraph, "GraphBuilder::Build");
  259. return SUCCESS;
  260. }
  261. Status GraphBuilder::SetConstantInputOffset(ComputeGraphPtr &comp_graph) {
  262. for (auto &node : comp_graph->GetDirectNode()) {
  263. GE_CHECK_NOTNULL(node);
  264. auto op_desc = node->GetOpDesc();
  265. GE_CHECK_NOTNULL(op_desc);
  266. auto num_inputs = op_desc->GetInputsSize();
  267. std::vector<int64_t> input_offsets(num_inputs, 0);
  268. int valid_input_index = -1;
  269. for (uint32_t i = 0; i < node->GetAllInDataAnchorsSize(); ++i) {
  270. auto in_anchor = node->GetInDataAnchor(i);
  271. auto peer_out_anchor = in_anchor->GetPeerOutAnchor();
  272. if (peer_out_anchor == nullptr) {
  273. continue;
  274. }
  275. ++valid_input_index;
  276. auto peer_node = peer_out_anchor->GetOwnerNode();
  277. if (peer_node == nullptr) {
  278. continue;
  279. }
  280. if (peer_node->GetType() != CONSTANT) {
  281. continue;
  282. }
  283. std::vector<GeTensorPtr> weights = OpDescUtils::MutableWeights(peer_node);
  284. if (weights.empty()) {
  285. REPORT_INNER_ERROR("E19999", "check weights size of node %s(%s) is empty",
  286. node->GetName().c_str(), node->GetType().c_str());
  287. GELOGE(FAILED, "weights size of node %s is empty", node->GetName().c_str());
  288. return FAILED;
  289. }
  290. GeTensorPtr weight = weights[0];
  291. GE_CHECK_NOTNULL(weight);
  292. int64_t input_offset = 0;
  293. (void) TensorUtils::GetDataOffset(weight->MutableTensorDesc(), input_offset);
  294. // valid_input_index must smaller than num_inputs
  295. input_offsets[valid_input_index] = input_offset;
  296. GELOGD("[%s] input[%u] is const, offset = %ld", node->GetName().c_str(), valid_input_index, input_offset);
  297. }
  298. op_desc->SetInputOffset(input_offsets);
  299. std::vector<int64_t> output_offsets(op_desc->GetOutputsSize(), 0);
  300. op_desc->SetOutputOffset(output_offsets);
  301. }
  302. return SUCCESS;
  303. }
  304. Status GraphBuilder::BuildForUnknownShapeGraph(ComputeGraphPtr &comp_graph, GeModelPtr &ge_model_ptr,
  305. uint64_t session_id) {
  306. ErrorManager::GetInstance().SetStage(ErrorMessage::kModelCompile, ErrorMessage::kPreBuild);
  307. GELOGI("Begin to build unknown shape graph[%s].", comp_graph->GetName().c_str());
  308. Graph2SubGraphInfoList subgraph_map;
  309. ge::ModelBuilder builder(session_id, comp_graph, subgraph_map, stream_max_parallel_num_, hcom_parallel_, build_mode_);
  310. GE_DUMP(comp_graph, "BeforePreBuildModel");
  311. GE_TIMESTAMP_START(PreBuildModel);
  312. GE_CHK_STATUS_RET(builder.PreBuildModel(), "Graph[%s] builder PreBuildModel() return fail.",
  313. comp_graph->GetName().c_str());
  314. GE_TIMESTAMP_END(PreBuildModel, "GraphBuilder::PreBuildModel");
  315. GE_DUMP(comp_graph, "AfterPreBuildModel");
  316. GE_TIMESTAMP_START(CalcOpParam);
  317. GE_CHK_STATUS_RET(CalcOpParam(comp_graph), "Graph[%s] builder CalcOpParam() return fail.",
  318. comp_graph->GetName().c_str());
  319. GE_TIMESTAMP_END(CalcOpParam, "GraphBuilder::CalcOpParam");
  320. GE_DUMP(comp_graph, "AfterCalcOpParam");
  321. GE_TIMESTAMP_START(SetConstantInputOffset);
  322. GE_CHK_STATUS_RET(SetConstantInputOffset(comp_graph),
  323. "Graph[%s] failed to set constant input offset.", comp_graph->GetName().c_str());
  324. GE_TIMESTAMP_END(SetConstantInputOffset, "GraphBuilder::SetConstantInputOffset");
  325. GE_TIMESTAMP_START(MergeWeights);
  326. GE_CHK_STATUS_RET(builder.MergeWeights(), "Graph[%s] failed to merge weights.", comp_graph->GetName().c_str());
  327. GE_TIMESTAMP_END(MergeWeights, "GraphBuilder::MergeWeights");
  328. ModelPtr model_ptr = MakeShared<ge::Model>();
  329. if (model_ptr == nullptr) {
  330. return MEMALLOC_FAILED;
  331. }
  332. GE_TIMESTAMP_START(BuildModelForGetDynShapeTask);
  333. GE_CHK_STATUS_RET(builder.BuildModelForGetDynShapeTask(*model_ptr),
  334. "Graph[%s] builder BuildModelForGetDynShapeTask() return fail.", comp_graph->GetName().c_str());
  335. GE_TIMESTAMP_END(BuildModelForGetDynShapeTask, "GraphBuilder::BuildModelForGetDynShapeTask");
  336. ErrorManager::GetInstance().SetStage(ErrorMessage::kModelCompile, ErrorMessage::kTaskGenerate);
  337. GE_TIMESTAMP_START(GetTaskInfo);
  338. Status ret = GetTaskInfo(builder, model_ptr, comp_graph, subgraph_map, session_id);
  339. GE_TIMESTAMP_END(GetTaskInfo, "GraphBuilder::GetTaskInfo");
  340. ErrorManager::GetInstance().SetStage(ErrorMessage::kModelCompile, ErrorMessage::kOther);
  341. GraphUtils::DumpGEGraph(comp_graph, "AfterGetTask");
  342. GraphUtils::DumpGEGraphToOnnx(*comp_graph, "AfterGetTask");
  343. if (ret != SUCCESS) {
  344. GELOGE(ret, "Graph[%s] builder GetTaskInfo() return fail.", comp_graph->GetName().c_str());
  345. return ret;
  346. }
  347. ge_model_ptr = MakeShared<ge::GeModel>();
  348. if (ge_model_ptr == nullptr) {
  349. return MEMALLOC_FAILED;
  350. }
  351. GE_CHK_STATUS_RET(builder.SaveDataToModel(*model_ptr, *ge_model_ptr),
  352. "Graph[%s] builder SaveDataToModel() return fail.", comp_graph->GetName().c_str());
  353. GELOGD("Success to build graph[%s] model.", comp_graph->GetName().c_str());
  354. return SUCCESS;
  355. }
  356. Status GraphBuilder::BuildForHostCpuGraph(ComputeGraphPtr &comp_graph, GeModelPtr &ge_model_ptr, uint64_t session_id) {
  357. return BuildForUnknownShapeGraph(comp_graph, ge_model_ptr, session_id);
  358. }
  359. static Status InsertMemcpyNode(const ComputeGraphPtr &graph, const OutDataAnchorPtr &out_anchor,
  360. const std::vector<InDataAnchorPtr> &in_anchors, const std::string &name) {
  361. GE_CHECK_NOTNULL(out_anchor);
  362. NodePtr in_node = out_anchor->GetOwnerNode();
  363. GE_CHECK_NOTNULL(in_node);
  364. OpDescBuilder op_desc_builder(name, MEMCPYASYNC);
  365. OpDescPtr op_desc = op_desc_builder.AddInput("x", in_node->GetOpDesc()->GetOutputDesc(0))
  366. .AddOutput("y", in_node->GetOpDesc()->GetOutputDesc(0))
  367. .Build();
  368. (void)AttrUtils::SetBool(op_desc, ATTR_NO_NEED_CONSTANT_FOLDING, false);
  369. if (GraphUtils::InsertNodeAfter(out_anchor, in_anchors, graph->AddNode(op_desc)) != GRAPH_SUCCESS) {
  370. REPORT_CALL_ERROR("E19999", "Insert IDENTITY node %s after %s failed", name.c_str(), in_node->GetName().c_str());
  371. GELOGE(FAILED, "Insert IDENTITY node %s after %s failed.", name.c_str(), in_node->GetName().c_str());
  372. return FAILED;
  373. }
  374. return SUCCESS;
  375. }
  376. Status GraphBuilder::MarkFpBpProfilingTaskAttr(ComputeGraphPtr &com_graph) {
  377. bool original_unknown_shape_flag = com_graph->GetGraphUnknownFlag();
  378. com_graph->SetGraphUnknownFlag(false);
  379. GELOGD("Start to mark profiling task attr for fp and bp.");
  380. TaskGenerator task_generator;
  381. ProfilingPoint profiling_point;
  382. std::vector<uint32_t> all_reduce_node_index;
  383. Status ret = task_generator.FindProfilingNodeIndex(com_graph, profiling_point, all_reduce_node_index);
  384. com_graph->SetGraphUnknownFlag(original_unknown_shape_flag);
  385. if (ret != SUCCESS) {
  386. GELOGW("Find profiling node index failed.");
  387. }
  388. if (profiling_point.fp_index == 0 || profiling_point.bp_index == 0 || profiling_point.end_index.empty()) {
  389. GELOGD("No need to mark fp bp profiling task attr.");
  390. return SUCCESS;
  391. }
  392. // mark profiling task attr for node
  393. uint32_t node_index = 0;
  394. for (const auto &node : com_graph->GetAllNodes()) {
  395. OpDescPtr op_desc = node->GetOpDesc();
  396. GE_CHECK_NOTNULL(node->GetOpDesc());
  397. node_index++;
  398. if (profiling_point.fp_index == node_index) {
  399. GELOGI("The first fp node of dynamic graph is %s, idx %u", op_desc->GetName().c_str(), node_index);
  400. (void)ge::AttrUtils::SetBool(op_desc, ATTR_NAME_INSERT_FP_PROFILILNG_TASK, true);
  401. }
  402. if (profiling_point.bp_index == node_index) {
  403. GELOGI("The bp node of dynamic graph is %s, idx %u", op_desc->GetName().c_str(), node_index);
  404. (void)ge::AttrUtils::SetBool(op_desc, ATTR_NAME_INSERT_BP_PROFILILNG_TASK, true);
  405. }
  406. for (size_t i = 0; i < all_reduce_node_index.size(); i++) {
  407. if (all_reduce_node_index[i] == node_index) {
  408. GELOGI("The all reduce node of dynamic graph is %s, idx %u", op_desc->GetName().c_str(), node_index);
  409. (void)ge::AttrUtils::SetBool(op_desc, ATTR_NAME_INSERT_BP_PROFILILNG_TASK, true);
  410. GE_IF_BOOL_EXEC(TypeUtils::CheckUint64MulOverflow(i, kProfilingArStep),
  411. REPORT_INNER_ERROR("E19999", "Multiply result is out of range when calc profiling ar log id "
  412. "for node:%s(%s)", op_desc->GetName().c_str(), op_desc->GetType().c_str());
  413. GELOGE(FAILED, "Multiply result is out of range.");
  414. return FAILED);
  415. int64_t log_id = i * kProfilingArStep + kProfilingArStartLogid;
  416. (void)ge::AttrUtils::SetInt(op_desc, ATTR_NAME_INSERT_PROFILILNG_TASK_LOG_ID, log_id);
  417. continue;
  418. }
  419. }
  420. if (profiling_point.end_index.find(node_index) != profiling_point.end_index.end()) {
  421. GELOGI("The end node of dynamic graph is %s, idx %u", op_desc->GetName().c_str(), node_index);
  422. (void)ge::AttrUtils::SetBool(op_desc, ATTR_NAME_INSERT_END_PROFILILNG_TASK, true);
  423. }
  424. }
  425. return SUCCESS;
  426. }
  427. Status GraphBuilder::BuildForDynamicShapeGraph(ComputeGraphPtr &comp_graph,
  428. GeRootModelPtr &ge_root_model_ptr, GeModelPtr &ge_model_ptr,
  429. uint64_t session_id) {
  430. GELOGI("Start to build BuildForDynamicShape for dynamic shape.");
  431. // Update Root Graph Data size
  432. for (auto &node : comp_graph->GetDirectNode()) {
  433. auto op_desc = node->GetOpDesc();
  434. GE_CHECK_NOTNULL(op_desc);
  435. op_desc->SetStreamId(kInvalidStream);
  436. if (node->GetType() == DATA) {
  437. GE_CHK_STATUS_RET(CalcDynShapeRootGraphDataSize(op_desc), "Calc dynamic shape root graph data[%s] size failed.",
  438. op_desc->GetName().c_str());
  439. }
  440. }
  441. // Set fp bp profiling task attr for graph
  442. if (MarkFpBpProfilingTaskAttr(comp_graph) != SUCCESS) {
  443. GELOGE(FAILED, "Set fp bp profiling task attr for graph.");
  444. return FAILED;
  445. }
  446. auto all_graphs = comp_graph->GetAllSubgraphs();
  447. if (all_graphs.empty()) {
  448. all_graphs.push_back(comp_graph);
  449. }
  450. for (auto &sub_graph : all_graphs) {
  451. // exclude functional subgraph in known subgraph
  452. if (sub_graph->GetParentGraph() != nullptr && sub_graph->GetParentGraph() != comp_graph &&
  453. !sub_graph->GetParentGraph()->GetGraphUnknownFlag()) {
  454. continue;
  455. }
  456. if (sub_graph->GetGraphUnknownFlag()) {
  457. // unknown shape build flow
  458. GE_CHK_STATUS_RET(BuildForUnknownShapeGraph(sub_graph, ge_model_ptr, session_id),
  459. "Build for unknown shape graph failed.");
  460. } else {
  461. // reset functional subgraph parent graph as known subgraph
  462. for (const auto &node : sub_graph->GetDirectNode()) {
  463. for (const auto &sub_graph_name : node->GetOpDesc()->GetSubgraphInstanceNames()) {
  464. auto sub_sub_graph = comp_graph->GetSubgraph(sub_graph_name);
  465. GE_CHK_STATUS_RET(sub_graph->AddSubgraph(sub_sub_graph), "Failed add subgraph to known graph.");
  466. }
  467. }
  468. // known shape build flow
  469. GE_CHK_STATUS_RET(BuildForKnownShapeGraph(sub_graph, ge_model_ptr, session_id),
  470. "Build for known shape graph failed.");
  471. }
  472. ge_root_model_ptr->SetSubgraphInstanceNameToModel(sub_graph->GetName(), ge_model_ptr);
  473. }
  474. return SUCCESS;
  475. }
  476. Status GraphBuilder::GetTaskInfo(const ge::ModelBuilder &builder, const ModelPtr &model_ptr,
  477. ComputeGraphPtr &comp_graph, Graph2SubGraphInfoList &subgraph_map,
  478. uint64_t session_id) {
  479. GE_CHECK_NOTNULL(model_ptr);
  480. GE_CHECK_NOTNULL(comp_graph);
  481. int64_t memory_size = 0;
  482. if (!AttrUtils::GetInt(model_ptr, ATTR_MODEL_MEMORY_SIZE, memory_size)) {
  483. REPORT_INNER_ERROR("E19999", "Get Attr:%s fail in model", ATTR_MODEL_MEMORY_SIZE.c_str());
  484. GELOGE(INTERNAL_ERROR, "Get memory size fail.");
  485. return INTERNAL_ERROR;
  486. }
  487. int64_t p2p_memory_size = 0;
  488. if (!AttrUtils::GetInt(model_ptr, ATTR_MODEL_P2P_MEMORY_SIZE, p2p_memory_size)) {
  489. REPORT_INNER_ERROR("E19999", "Get Attr:%s fail in model", ATTR_MODEL_P2P_MEMORY_SIZE.c_str());
  490. GELOGE(INTERNAL_ERROR, "Get p2p memory size fail.");
  491. return INTERNAL_ERROR;
  492. }
  493. int64_t weight_size = 0;
  494. if (!AttrUtils::GetInt(model_ptr, ATTR_MODEL_WEIGHT_SIZE, weight_size)) {
  495. REPORT_INNER_ERROR("E19999", "Get Attr:%s fail in model", ATTR_MODEL_WEIGHT_SIZE.c_str());
  496. GELOGE(INTERNAL_ERROR, "Get weight memory size fail.");
  497. return INTERNAL_ERROR;
  498. }
  499. auto var_manager = VarManager::Instance(session_id);
  500. // since var_mem_logic_base_ = graph_mem_max_size_ + kGraphMemoryBuffer in graph_var_manager.cc,
  501. // get_mem_base should not bigger than kGraphMemoryBuffer
  502. auto *get_mem_base = reinterpret_cast<uint8_t *>(reinterpret_cast<uintptr_t>(kGraphMemoryBuffer>>1));
  503. uint8_t *get_weight_mem_base = get_mem_base;
  504. if (weight_size > 0) {
  505. get_weight_mem_base = get_mem_base + memory_size + p2p_memory_size;
  506. }
  507. std::map<int64_t, uint8_t *> mem_type_to_data_mem_base;
  508. mem_type_to_data_mem_base[RT_MEMORY_HBM] = get_mem_base;
  509. if (p2p_memory_size == 0) {
  510. mem_type_to_data_mem_base[RT_MEMORY_P2P_DDR] = nullptr;
  511. } else {
  512. mem_type_to_data_mem_base[RT_MEMORY_P2P_DDR] = get_mem_base + memory_size;
  513. }
  514. std::map<int64_t, uint64_t> mem_type_to_data_mem_size;
  515. mem_type_to_data_mem_size[RT_MEMORY_HBM] = memory_size;
  516. mem_type_to_data_mem_size[RT_MEMORY_P2P_DDR] = p2p_memory_size;
  517. RunContextUtil run_context;
  518. Status ret = run_context.InitMemInfo(get_mem_base, memory_size, mem_type_to_data_mem_base, mem_type_to_data_mem_size,
  519. get_weight_mem_base, weight_size);
  520. if (ret != SUCCESS) {
  521. GELOGE(ret, "task_generator init mem info fail.");
  522. return ret;
  523. }
  524. auto weight_buffer = builder.GetWeightBuffer();
  525. ret = run_context.CreateRunContext(*model_ptr, comp_graph, weight_buffer, session_id);
  526. if (ret != SUCCESS) {
  527. GELOGE(ret, "runContext create run context fail.");
  528. return ret;
  529. }
  530. StreamGraphOptimizer stream_optimizer;
  531. ret = stream_optimizer.OptimizeStreamedSubGraph(comp_graph, subgraph_map, run_context.GetRunContext());
  532. if (ret != SUCCESS) {
  533. GELOGE(ret, "Optimize streamed subGraph fail.");
  534. return ret;
  535. }
  536. GE_DUMP(comp_graph, "AfterOptimizeStreamedSubGraph");
  537. auto *get_var_mem_base = reinterpret_cast<uint8_t *>(reinterpret_cast<uintptr_t>(var_manager->GetVarMemLogicBase()));
  538. uint64_t var_size = (var_manager->GetVarMemSize(RT_MEMORY_HBM) > 0) ? var_manager->GetVarMemMaxSize() : 0;
  539. TaskGenerator task_generator(get_var_mem_base, var_size);
  540. ret = task_generator.GetTaskInfo(*model_ptr, comp_graph, session_id, run_context.GetRunContext());
  541. return ret;
  542. }
  543. Status GraphBuilder::SetInputSize(const ge::NodePtr &node_ptr) {
  544. // Set the size of input_desc to 'src_node.output_desc.size'
  545. if (node_ptr->GetType() == DATA) {
  546. bool is_unknown_shape = false;
  547. GE_CHK_STATUS_RET(ge::NodeUtils::GetNodeUnknownShapeStatus(*node_ptr, is_unknown_shape),
  548. "Get data node[%s] shape status failed!", node_ptr->GetName().c_str());
  549. if (is_unknown_shape) {
  550. GELOGD("data node: %s is unknown shape, do not set input size!", node_ptr->GetName().c_str());
  551. return SUCCESS;
  552. }
  553. if (UpdateDataInputSize(node_ptr) != SUCCESS) {
  554. GELOGE(FAILED, "Update data input size failed.");
  555. return FAILED;
  556. }
  557. }
  558. for (const auto &in_data_anchor : node_ptr->GetAllInDataAnchors()) {
  559. const auto &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  560. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  561. const auto &src_node = peer_out_anchor->GetOwnerNode();
  562. const auto &src_op = src_node->GetOpDesc();
  563. GE_IF_BOOL_EXEC(src_op == nullptr, continue);
  564. auto node_op_desc = node_ptr->GetOpDesc();
  565. GE_IF_BOOL_EXEC(node_op_desc == nullptr, continue);
  566. // Set the input_desc of dst_node to 'src_node.output_desc'
  567. auto output_desc = src_op->GetOutputDescPtr(peer_out_anchor->GetIdx());
  568. int64_t size = 0;
  569. GE_IF_BOOL_EXEC(ge::TensorUtils::GetSize(*output_desc, size) != SUCCESS, GELOGI("Get size failed!"));
  570. GELOGD("src node %s output desc, dim_size: %zu, mem_size: %ld, format: %s, type: %s.", src_node->GetName().c_str(),
  571. output_desc->GetShape().GetDimNum(), size, TypeUtils::FormatToSerialString(output_desc->GetFormat()).c_str(),
  572. TypeUtils::DataTypeToSerialString(output_desc->GetDataType()).c_str());
  573. for (size_t i = 0; i < output_desc->GetShape().GetDimNum(); ++i) {
  574. GELOGD("dims[%zu]: %ld", i, output_desc->GetShape().GetDim(i));
  575. }
  576. auto input_desc = node_op_desc->MutableInputDesc(in_data_anchor->GetIdx());
  577. GE_CHECK_NOTNULL(input_desc);
  578. (void) ge::TensorUtils::SetSize(*input_desc, size);
  579. GELOGD("%s input desc, dim_size: %zu, mem_size: %ld, format: %s, type: %s.", node_ptr->GetName().c_str(),
  580. input_desc->GetShape().GetDimNum(), size, TypeUtils::FormatToSerialString(input_desc->GetFormat()).c_str(),
  581. TypeUtils::DataTypeToSerialString(input_desc->GetDataType()).c_str());
  582. // inherit some attr
  583. int64_t tensor_size_attr;
  584. if (AttrUtils::GetInt(output_desc, ATTR_NAME_SPECIAL_OUTPUT_SIZE, tensor_size_attr) && (tensor_size_attr > 0)) {
  585. GE_IF_BOOL_EXEC(!AttrUtils::SetInt(*input_desc, ATTR_NAME_SPECIAL_OUTPUT_SIZE, tensor_size_attr),
  586. GELOGW("Set size attr failed!"); continue);
  587. GELOGD("node[%s] [%d]th output has sepcial size[%ld], and update to node[%s] [%d]th input",
  588. src_op->GetName().c_str(), peer_out_anchor->GetIdx(), tensor_size_attr,
  589. node_op_desc->GetName().c_str(), in_data_anchor->GetIdx());
  590. }
  591. }
  592. return SUCCESS;
  593. }
  594. Status GraphBuilder::UpdateDataInputSize(const ge::NodePtr &node_ptr) {
  595. const auto &op_desc = node_ptr->GetOpDesc();
  596. if (op_desc == nullptr) {
  597. REPORT_INNER_ERROR("E19999", "check op_desc is nullptr");
  598. GELOGE(FAILED, "Op desc is nullptr.");
  599. return FAILED;
  600. }
  601. // data op only has one output anchor
  602. ge::GeTensorDesc output_desc = op_desc->GetOutputDesc(0);
  603. int64_t output_size = 0;
  604. if (ge::TensorUtils::GetSize(output_desc, output_size) != SUCCESS) {
  605. GELOGW("Get size failed!");
  606. }
  607. if (output_size > 0) {
  608. GELOGI("No need to update data input size.");
  609. return SUCCESS;
  610. } else {
  611. int64_t real_dim_size = 0;
  612. ge::graphStatus graph_status = TensorUtils::GetTensorSizeInBytes(output_desc, real_dim_size);
  613. if (graph_status != GRAPH_SUCCESS) {
  614. REPORT_CALL_ERROR("E19999", "Get tensor size in bytes failed for op:%s(%s) index:0",
  615. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  616. GELOGE(FAILED, "Get tensor size in bytes failed.");
  617. return FAILED;
  618. }
  619. // data op only has one input anchor
  620. ge::GeTensorDesc input_desc = op_desc->GetInputDesc(0);
  621. ge::TensorUtils::SetSize(input_desc, real_dim_size);
  622. if (op_desc->UpdateInputDesc(0, input_desc) != GRAPH_SUCCESS) {
  623. REPORT_CALL_ERROR("E19999", "Update input desc size failed for op:%s(%s) index:0",
  624. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  625. GELOGE(FAILED, "Update input desc size failed.");
  626. return FAILED;
  627. }
  628. }
  629. return SUCCESS;
  630. }
  631. Status GraphBuilder::CalcDynShapeRootGraphDataSize(const ge::OpDescPtr &op_desc) {
  632. GELOGI("Begin to calc dynamic shape graph data[%s] size.", op_desc->GetName().c_str());
  633. // data op only has one output anchor
  634. ge::GeTensorDesc output_desc = op_desc->GetOutputDesc(0);
  635. if (output_desc.MutableShape().IsUnknownShape()) {
  636. GELOGI("No need to update dynamic shape graph data output size for unknown shape data.");
  637. return SUCCESS;
  638. }
  639. int64_t output_size = 0;
  640. if (ge::TensorUtils::GetSize(output_desc, output_size) != SUCCESS) {
  641. GELOGW("Get size failed!");
  642. }
  643. if (output_size > 0) {
  644. GELOGI("No need to update dynamic shape graph data output size[%ld].", output_size);
  645. return SUCCESS;
  646. } else {
  647. int64_t real_dim_size = 0;
  648. ge::graphStatus graph_status = TensorUtils::GetTensorSizeInBytes(output_desc, real_dim_size);
  649. if (graph_status != GRAPH_SUCCESS) {
  650. REPORT_CALL_ERROR("E19999", "Get tensor size in bytes failed for op:%s(%s) index:0 ",
  651. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  652. GELOGE(FAILED, "Get tensor size in bytes failed.");
  653. return FAILED;
  654. }
  655. ge::TensorUtils::SetSize(output_desc, real_dim_size);
  656. GELOGI("Update dynamic shape graph data output size to [%ld].", real_dim_size);
  657. if (op_desc->UpdateOutputDesc(0, output_desc) != GRAPH_SUCCESS) {
  658. REPORT_CALL_ERROR("E19999", "Update output desc size failed for op:%s(%s) index:0 ",
  659. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  660. GELOGE(FAILED, "Update dynamic shape graph data output desc size failed.");
  661. return FAILED;
  662. }
  663. }
  664. return SUCCESS;
  665. }
  666. Status GraphBuilder::SecondPartition(ge::ComputeGraphPtr &comp_graph) {
  667. GE_TIMESTAMP_START(GraphPartition2);
  668. auto ret = graph_partitioner_.Partition(comp_graph, GraphPartitioner::kSecondPartitioning);
  669. if (ret != SUCCESS) {
  670. GELOGE(ret, "Graph partition Failed");
  671. return ret;
  672. }
  673. GE_CHK_STATUS_RET(ret, "Graph partition Failed.");
  674. const auto &graph_2_subgraphlist = graph_partitioner_.GetSubGraphMap();
  675. if (graph_2_subgraphlist.find(comp_graph) == graph_2_subgraphlist.end()) {
  676. REPORT_INNER_ERROR("E19999", "find subgraphlis in graph:%s failed",
  677. comp_graph->GetName().c_str());
  678. GELOGE(FAILED, "Find subgraph failed.");
  679. return FAILED;
  680. }
  681. GE_TIMESTAMP_END(GraphPartition2, "GraphPartitioner::Partition2");
  682. return ret;
  683. }
  684. Status GraphBuilder::AddOutputMemTypeForNode(const NodePtr &node) {
  685. auto op_desc = node->GetOpDesc();
  686. GE_CHECK_NOTNULL(op_desc);
  687. uint32_t mem_type;
  688. if (!AttrUtils::GetInt(op_desc, ATTR_INPUT_MEMORY_TYPE, mem_type)) {
  689. return SUCCESS;
  690. }
  691. GELOGD("[%s] has attr input_memory_type %u", op_desc->GetName().c_str(), mem_type);
  692. for (const auto &in_data_anchor : node->GetAllInDataAnchors()) {
  693. const auto &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  694. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  695. bool valid_flag = false;
  696. auto src_node = peer_out_anchor->GetOwnerNode();
  697. auto src_out_anchor = peer_out_anchor;
  698. while (true) {
  699. const auto &src_desc = src_node->GetOpDesc();
  700. GE_IF_BOOL_EXEC(src_desc == nullptr, continue);
  701. GELOGD("[%s:%u] set attr output_memory_type %d", src_desc->GetName().c_str(), src_out_anchor->GetIdx(),
  702. mem_type);
  703. if (!AttrUtils::SetInt(src_desc->MutableOutputDesc(src_out_anchor->GetIdx()), ATTR_OUTPUT_MEMORY_TYPE,
  704. mem_type)) {
  705. REPORT_INNER_ERROR("E19999", "Set Attr:%s for node:%s(%s) out_index:%u failed",
  706. ATTR_OUTPUT_MEMORY_TYPE.c_str(), src_desc->GetName().c_str(), src_desc->GetType().c_str(),
  707. src_out_anchor->GetIdx());
  708. GELOGE(INTERNAL_ERROR, "Set out_memory_type attr for [%s:%d] failed.", src_desc->GetName().c_str(),
  709. src_out_anchor->GetIdx());
  710. return INTERNAL_ERROR;
  711. }
  712. switch (TransferNodeType(src_node)) {
  713. case kSubgraphNode:
  714. GE_CHK_STATUS_RET(HandleSubgraphNode(src_node, src_out_anchor), "Handle subgraph node %s failed",
  715. src_node->GetName().c_str());
  716. break;
  717. case kSubgraphData:
  718. GE_CHK_STATUS_RET(HandleSubgraphDataNode(src_node, src_out_anchor), "Handle Data node %s in subgraph failed",
  719. src_node->GetName().c_str());
  720. break;
  721. case kOthers:
  722. default:
  723. valid_flag = true;
  724. break;
  725. }
  726. if (valid_flag) {
  727. break;
  728. }
  729. }
  730. }
  731. return SUCCESS;
  732. }
  733. } // namespace ge

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