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 26 kB

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
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
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
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
5 years ago
4 years ago
4 years ago
4 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607
  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 "common/ge/ge_util.h"
  18. #include "common/helper/model_helper.h"
  19. #include "graph/build/logical_stream_allocator.h"
  20. #include "graph/build/run_context.h"
  21. #include "graph/build/stream_graph_optimizer.h"
  22. #include "graph/common/ge_call_wrapper.h"
  23. #include "graph/ge_context.h"
  24. #include "graph/manager/graph_var_manager.h"
  25. #include "graph/passes/mark_same_addr_pass.h"
  26. #include "graph/utils/node_utils.h"
  27. #include "graph/utils/type_utils.h"
  28. #include "init/gelib.h"
  29. #include "model/ge_model.h"
  30. #include "graph/ge_context.h"
  31. #include "opskernel_manager/ops_kernel_builder_manager.h"
  32. using domi::BuildMode;
  33. namespace {
  34. const int32_t kInvalidPerfLevel = -1;
  35. enum NodeType { kSubgraphData, kSubgraphNode, kOthers };
  36. } // namespace
  37. namespace ge {
  38. NodeType TransferNodeType(const NodePtr &node) {
  39. const std::string type = node->GetType();
  40. if (type == ge::DATA) {
  41. if (node->GetOwnerComputeGraph()->GetParentNode() == nullptr) {
  42. GELOGD("access src data node:%s", node->GetName().c_str());
  43. return kOthers;
  44. }
  45. GELOGD("access subgraph input node:%s", node->GetName().c_str());
  46. return kSubgraphData;
  47. } else if (type == PARTITIONEDCALL) {
  48. GELOGD("access subgraph node:%s", node->GetName().c_str());
  49. return kSubgraphNode;
  50. }
  51. GELOGD("access other node:%s", node->GetName().c_str());
  52. return kOthers;
  53. }
  54. Status HandleSubgraphNode(NodePtr &src_node, OutDataAnchorPtr &src_out_anchor) {
  55. auto subgraph = NodeUtils::GetSubgraph(*src_node, 0);
  56. GE_CHECK_NOTNULL(subgraph);
  57. const NodePtr &net_output_node = subgraph->FindFirstNodeMatchType(NETOUTPUT);
  58. GE_CHECK_NOTNULL(net_output_node);
  59. const InDataAnchorPtr &in_data_anchor = net_output_node->GetInDataAnchor(src_out_anchor->GetIdx());
  60. GE_CHECK_NOTNULL(in_data_anchor);
  61. const OutDataAnchorPtr &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  62. GE_CHECK_NOTNULL(peer_out_anchor);
  63. src_node = peer_out_anchor->GetOwnerNode();
  64. src_out_anchor = peer_out_anchor;
  65. return SUCCESS;
  66. }
  67. Status HandleSubgraphDataNode(NodePtr &src_node, OutDataAnchorPtr &src_out_anchor) {
  68. uint32_t index = 0;
  69. if (!AttrUtils::GetInt(src_node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, index)) {
  70. GELOGE(FAILED, "Get attr ATTR_NAME_PARENT_NODE_INDEX failed, node:%s.", src_node->GetName().c_str());
  71. return FAILED;
  72. }
  73. const NodePtr &parent_node = src_node->GetOwnerComputeGraph()->GetParentNode();
  74. GE_CHECK_NOTNULL(parent_node);
  75. const InDataAnchorPtr &in_data_anchor = parent_node->GetInDataAnchor(index);
  76. GE_CHECK_NOTNULL(in_data_anchor);
  77. const OutDataAnchorPtr &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  78. GE_CHECK_NOTNULL(peer_out_anchor);
  79. src_node = peer_out_anchor->GetOwnerNode();
  80. src_out_anchor = peer_out_anchor;
  81. return SUCCESS;
  82. }
  83. GraphBuilder::GraphBuilder() : build_mode_(BuildMode::GEN_TASK_WITH_FUSION), hcom_parallel_(false) {}
  84. void GraphBuilder::SetOptions(const ge::GraphManagerOptions &options) {
  85. stream_max_parallel_num_ = options.stream_max_parallel_num;
  86. hcom_parallel_ = options.hcom_parallel;
  87. if (options.perf_level == kInvalidPerfLevel) {
  88. build_mode_ = static_cast<int>(BuildMode::GEN_TASK_WITH_FUSION);
  89. } else {
  90. build_mode_ = options.perf_level;
  91. }
  92. }
  93. Status GraphBuilder::CalcOpParam(const ge::ComputeGraphPtr &graph) {
  94. GE_CHECK_NOTNULL(graph);
  95. auto instance_ptr = ge::GELib::GetInstance();
  96. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  97. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "GraphBuilder: GE is not initialized");
  98. return GE_CLI_GE_NOT_INITIALIZED;
  99. }
  100. for (const auto &node_ptr : graph->GetNodes(graph->GetGraphUnknownFlag())) {
  101. GE_CHECK_NOTNULL(node_ptr->GetOpDesc());
  102. std::string kernel_lib_name = node_ptr->GetOpDesc()->GetOpKernelLibName();
  103. if (kernel_lib_name.empty()) {
  104. // reset op kernel lib
  105. (void)instance_ptr->DNNEngineManagerObj().GetDNNEngineName(node_ptr);
  106. kernel_lib_name = node_ptr->GetOpDesc()->GetOpKernelLibName();
  107. if (kernel_lib_name.empty()) {
  108. GELOGE(INTERNAL_ERROR, "Get node:%s(%s) kernel lib failed.", node_ptr->GetName().c_str(),
  109. node_ptr->GetType().c_str());
  110. return INTERNAL_ERROR;
  111. }
  112. }
  113. auto ret = SetInputSize(node_ptr);
  114. if (ret != SUCCESS) {
  115. GELOGE(ret, "Set node inputDesc size failed, node name is %s", node_ptr->GetName().c_str());
  116. return ret;
  117. }
  118. ret = OpsKernelBuilderManager::Instance().CalcOpRunningParam(*node_ptr);
  119. if (ret != SUCCESS) {
  120. GELOGE(ret, "Calculate op running param failed, node name is %s", node_ptr->GetName().c_str());
  121. return ret;
  122. }
  123. GE_CHK_STATUS_RET(AddOutputMemTypeForNode(node_ptr));
  124. }
  125. auto parent_node = graph->GetParentNode();
  126. if (parent_node == nullptr) {
  127. return SUCCESS;
  128. }
  129. GE_CHK_STATUS_RET(UpdateParentNodeOutputSize(graph, parent_node));
  130. GELOGI("Success to calculate op running param.");
  131. return SUCCESS;
  132. }
  133. Status GraphBuilder::UpdateParentNodeOutputSize(const ge::ComputeGraphPtr &graph, ge::NodePtr &parent_node_ptr) {
  134. GELOGI("Begin to update parent node[%s] of graph[%s] output size.", parent_node_ptr->GetName().c_str(),
  135. graph->GetName().c_str());
  136. auto parent_op_desc = parent_node_ptr->GetOpDesc();
  137. GE_CHECK_NOTNULL(parent_op_desc);
  138. bool is_unknown_shape = graph->GetGraphUnknownFlag();
  139. if (is_unknown_shape) {
  140. GELOGI("Current graph[%s] is unknown, no need to update parent node[%s] output size.", graph->GetName().c_str(),
  141. parent_node_ptr->GetName().c_str());
  142. return SUCCESS;
  143. }
  144. for (const auto &node_ptr : graph->GetDirectNode()) {
  145. if (node_ptr->GetType() != NETOUTPUT) {
  146. continue;
  147. }
  148. auto op_desc = node_ptr->GetOpDesc();
  149. GE_CHECK_NOTNULL(op_desc);
  150. for (const auto &in_data_anchor : node_ptr->GetAllInDataAnchors()) {
  151. auto index = in_data_anchor->GetIdx();
  152. ge::GeTensorDesc desc_temp = op_desc->GetInputDesc(index);
  153. uint32_t parent_index = 0;
  154. if (!AttrUtils::GetInt(desc_temp, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  155. GELOGI("NetOutput input tensor %d, attr %s not found.", index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  156. continue;
  157. }
  158. int64_t size = 0;
  159. GE_IF_BOOL_EXEC(ge::TensorUtils::GetSize(desc_temp, size) != SUCCESS, GELOGI("Get size failed!"));
  160. ge::GeTensorDesc parent_desc_temp = parent_op_desc->GetOutputDesc(parent_index);
  161. ge::TensorUtils::SetSize(parent_desc_temp, size);
  162. GE_CHK_STATUS_RET(parent_op_desc->UpdateOutputDesc(parent_index, parent_desc_temp));
  163. GELOGI("Update parent node[%s] output index[%u] to size[%ld].", parent_node_ptr->GetName().c_str(), parent_index,
  164. size);
  165. }
  166. }
  167. return SUCCESS;
  168. }
  169. Status GraphBuilder::Build(ComputeGraphPtr &comp_graph, std::vector<SubGraphInfoPtr> &subgraph_ptr_list,
  170. GeRootModelPtr &ge_root_model_ptr, uint64_t session_id) {
  171. if (comp_graph == nullptr) {
  172. GELOGE(GE_GRAPH_PARAM_NULLPTR, "Graph build comp_graph is null.");
  173. return GE_GRAPH_PARAM_NULLPTR;
  174. }
  175. ge_root_model_ptr = MakeShared<ge::GeRootModel>(comp_graph);
  176. if (ge_root_model_ptr == nullptr) {
  177. return MEMALLOC_FAILED;
  178. }
  179. GeModelPtr ge_model_ptr = nullptr;
  180. bool is_dynamic_shape = false;
  181. // To be compatible with the old process, do not verify the return value temporarily.
  182. (void)AttrUtils::GetBool(comp_graph, ATTR_NAME_DYNAMIC_SHAPE_PARTITIONED, is_dynamic_shape);
  183. if (is_dynamic_shape) {
  184. GE_CHK_STATUS_RET(
  185. BuildForDynamicShapeGraph(comp_graph, subgraph_ptr_list, ge_root_model_ptr, ge_model_ptr, session_id),
  186. "Build for dynamic shape graph failed.");
  187. return SUCCESS;
  188. }
  189. GE_CHK_STATUS_RET(BuildForKnownShapeGraph(comp_graph, subgraph_ptr_list, ge_model_ptr, session_id),
  190. "Build for known shape graph failed.");
  191. ge_root_model_ptr->SetSubgraphInstanceNameToModel(comp_graph->GetName(), ge_model_ptr);
  192. return SUCCESS;
  193. }
  194. Status GraphBuilder::BuildForKnownShapeGraph(ComputeGraphPtr &comp_graph, std::vector<SubGraphInfoPtr> &subgraph_list,
  195. GeModelPtr &ge_model_ptr, uint64_t session_id) {
  196. if (ge::GetContext().GetHostExecFlag()) {
  197. GE_CHK_STATUS_RET(BuildForHostCpuGraph(comp_graph, ge_model_ptr, session_id), "Build for host-cpu graph failed.");
  198. return SUCCESS;
  199. }
  200. GELOGI("Begin to build known shape graph[%s].", comp_graph->GetName().c_str());
  201. Status ret = SecondPartition(comp_graph, subgraph_list);
  202. GE_CHK_STATUS_RET(ret, "Graph[%s] second partition Failed.", comp_graph->GetName().c_str());
  203. auto subgraph_map = graph_partitioner_.GetSubGraphMap();
  204. GE_TIMESTAMP_START(BuildSubgraph);
  205. ge::ModelBuilder builder(session_id, comp_graph, subgraph_map, stream_max_parallel_num_, hcom_parallel_, build_mode_);
  206. GE_DUMP(comp_graph, "BeforePreBuildModel");
  207. GE_TIMESTAMP_START(PreBuildModel);
  208. GE_CHK_STATUS_RET(builder.PreBuildModel(), "Graph[%s] builder PreBuildModel() return fail.",
  209. comp_graph->GetName().c_str());
  210. GE_TIMESTAMP_END(PreBuildModel, "GraphBuilder::PreBuildModel");
  211. GE_DUMP(comp_graph, "AfterPreBuildModel");
  212. GE_TIMESTAMP_START(CalcOpParam);
  213. GE_CHK_STATUS_RET(CalcOpParam(comp_graph), "Graph[%s] builder CalcOpParam() return fail.",
  214. comp_graph->GetName().c_str());
  215. GE_TIMESTAMP_END(CalcOpParam, "GraphBuilder::CalcOpParam");
  216. GE_DUMP(comp_graph, "AfterCalcOpParam");
  217. ModelPtr model_ptr = MakeShared<ge::Model>();
  218. if (model_ptr == nullptr) {
  219. return MEMALLOC_FAILED;
  220. }
  221. GE_TIMESTAMP_START(BuildModelForGetTask);
  222. GE_CHK_STATUS_RET(builder.BuildModelForGetTask(*model_ptr), "Graph[%s] builder BuildModelForGetTask() return fail.",
  223. comp_graph->GetName().c_str());
  224. GE_TIMESTAMP_END(BuildModelForGetTask, "GraphBuilder::BuildModelForGetTask");
  225. GE_DUMP(comp_graph, "AfterBuildModel");
  226. GE_TIMESTAMP_START(GetTaskInfo);
  227. ret = GetTaskInfo(builder, model_ptr, comp_graph, subgraph_map, session_id);
  228. GE_TIMESTAMP_END(GetTaskInfo, "GraphBuilder::GetTaskInfo");
  229. GE_DUMP(comp_graph, "AfterGetTask");
  230. if (ret != SUCCESS) {
  231. GELOGE(ret, "Graph[%s] builder GetTaskInfo() return fail.", comp_graph->GetName().c_str());
  232. return ret;
  233. }
  234. ge_model_ptr = MakeShared<ge::GeModel>();
  235. if (ge_model_ptr == nullptr) {
  236. return MEMALLOC_FAILED;
  237. }
  238. GE_CHK_STATUS_RET(builder.SaveDataToModel(*model_ptr, *ge_model_ptr),
  239. "Graph[%s] builder SaveDataToModel() return fail.", comp_graph->GetName().c_str());
  240. GELOGD("Success to build graph[%s] model.", comp_graph->GetName().c_str());
  241. GE_TIMESTAMP_END(BuildSubgraph, "GraphBuilder::Build");
  242. return SUCCESS;
  243. }
  244. Status GraphBuilder::BuildForUnknownShapeGraph(ComputeGraphPtr &comp_graph, GeModelPtr &ge_model_ptr,
  245. uint64_t session_id) {
  246. GELOGI("Begin to build unknown shape graph[%s].", comp_graph->GetName().c_str());
  247. GE_TIMESTAMP_START(CalcOpParam);
  248. GE_CHK_STATUS_RET(CalcOpParam(comp_graph), "Graph[%s] builder CalcOpParam() return fail.",
  249. comp_graph->GetName().c_str());
  250. GE_TIMESTAMP_END(CalcOpParam, "GraphBuilder::CalcOpParam");
  251. GE_DUMP(comp_graph, "AfterCalcOpParam");
  252. Graph2SubGraphInfoList subgraph_map;
  253. ge::ModelBuilder builder(session_id, comp_graph, subgraph_map, stream_max_parallel_num_, hcom_parallel_, build_mode_);
  254. ModelPtr model_ptr = MakeShared<ge::Model>();
  255. if (model_ptr == nullptr) {
  256. return MEMALLOC_FAILED;
  257. }
  258. GE_TIMESTAMP_START(BuildModelForGetDynShapeTask);
  259. GE_CHK_STATUS_RET(builder.BuildModelForGetDynShapeTask(*model_ptr),
  260. "Graph[%s] builder BuildModelForGetDynShapeTask() return fail.", comp_graph->GetName().c_str());
  261. GE_TIMESTAMP_END(BuildModelForGetDynShapeTask, "GraphBuilder::BuildModelForGetDynShapeTask");
  262. GE_TIMESTAMP_START(GetTaskInfo);
  263. Status ret = GetTaskInfo(builder, model_ptr, comp_graph, subgraph_map, session_id);
  264. GE_TIMESTAMP_END(GetTaskInfo, "GraphBuilder::GetTaskInfo");
  265. GraphUtils::DumpGEGraph(comp_graph, "AfterGetTask");
  266. GraphUtils::DumpGEGraphToOnnx(*comp_graph, "AfterGetTask");
  267. if (ret != SUCCESS) {
  268. GELOGE(ret, "Graph[%s] builder GetTaskInfo() return fail.", comp_graph->GetName().c_str());
  269. return ret;
  270. }
  271. ge_model_ptr = MakeShared<ge::GeModel>();
  272. if (ge_model_ptr == nullptr) {
  273. return MEMALLOC_FAILED;
  274. }
  275. GE_CHK_STATUS_RET(builder.SaveDataToModel(*model_ptr, *ge_model_ptr),
  276. "Graph[%s] builder SaveDataToModel() return fail.", comp_graph->GetName().c_str());
  277. GELOGD("Success to build graph[%s] model.", comp_graph->GetName().c_str());
  278. return SUCCESS;
  279. }
  280. Status GraphBuilder::BuildForHostCpuGraph(ComputeGraphPtr &comp_graph, GeModelPtr &ge_model_ptr, uint64_t session_id) {
  281. return BuildForUnknownShapeGraph(comp_graph, ge_model_ptr, session_id);
  282. }
  283. Status GraphBuilder::BuildForDynamicShapeGraph(ComputeGraphPtr &comp_graph,
  284. std::vector<SubGraphInfoPtr> &subgraph_ptr_list,
  285. GeRootModelPtr &ge_root_model_ptr, GeModelPtr &ge_model_ptr,
  286. uint64_t session_id) {
  287. GELOGI("Start to build BuildForDynamicShape for dynamic shape.");
  288. // Update Root Graph Data size
  289. for (auto &node : comp_graph->GetDirectNode()) {
  290. auto op_desc = node->GetOpDesc();
  291. GE_CHECK_NOTNULL(op_desc);
  292. op_desc->SetStreamId(kInvalidStream);
  293. if (node->GetType() == DATA) {
  294. GE_CHK_STATUS_RET(CalcDynShapeRootGraphDataSize(op_desc), "Calc dynamic shape root graph data[%s] size failed.",
  295. op_desc->GetName().c_str());
  296. }
  297. }
  298. //
  299. for (auto &sub_graph : comp_graph->GetAllSubgraphs()) {
  300. // exclude functional subgraph in known subgraph
  301. if (sub_graph->GetParentGraph() != comp_graph && !sub_graph->GetParentGraph()->GetGraphUnknownFlag()) {
  302. continue;
  303. }
  304. if (sub_graph->GetGraphUnknownFlag()) {
  305. // unknown shape build flow
  306. GE_CHK_STATUS_RET(BuildForUnknownShapeGraph(sub_graph, ge_model_ptr, session_id),
  307. "Build for unknown shape graph failed.");
  308. } else {
  309. // reset functional subgraph parent graph as known subgraph
  310. for (const auto &node : sub_graph->GetDirectNode()) {
  311. for (const auto &sub_graph_name : node->GetOpDesc()->GetSubgraphInstanceNames()) {
  312. auto sub_sub_graph = comp_graph->GetSubgraph(sub_graph_name);
  313. GE_CHK_STATUS_RET(sub_graph->AddSubgraph(sub_sub_graph), "Failed add subgraph to known graph.");
  314. }
  315. }
  316. // known shape build flow
  317. GE_CHK_STATUS_RET(BuildForKnownShapeGraph(sub_graph, subgraph_ptr_list, ge_model_ptr, session_id),
  318. "Build for known shape graph failed.");
  319. }
  320. ge_root_model_ptr->SetSubgraphInstanceNameToModel(sub_graph->GetName(), ge_model_ptr);
  321. }
  322. return SUCCESS;
  323. }
  324. Status GraphBuilder::GetTaskInfo(const ge::ModelBuilder &builder, const ModelPtr &model_ptr,
  325. ComputeGraphPtr &comp_graph, Graph2SubGraphInfoList &subgraph_map,
  326. uint64_t session_id) {
  327. GE_CHECK_NOTNULL(model_ptr);
  328. GE_CHECK_NOTNULL(comp_graph);
  329. int64_t memory_size = 0;
  330. if (!AttrUtils::GetInt(model_ptr, ATTR_MODEL_MEMORY_SIZE, memory_size)) {
  331. GELOGE(INTERNAL_ERROR, "Get memory size fail.");
  332. return INTERNAL_ERROR;
  333. }
  334. int64_t p2p_memory_size = 0;
  335. if (!AttrUtils::GetInt(model_ptr, ATTR_MODEL_P2P_MEMORY_SIZE, p2p_memory_size)) {
  336. GELOGE(INTERNAL_ERROR, "Get p2p memory size fail.");
  337. return INTERNAL_ERROR;
  338. }
  339. int64_t weight_size = 0;
  340. if (!AttrUtils::GetInt(model_ptr, ATTR_MODEL_WEIGHT_SIZE, weight_size)) {
  341. GELOGE(INTERNAL_ERROR, "Get weight memory size fail.");
  342. return INTERNAL_ERROR;
  343. }
  344. auto var_manager = VarManager::Instance(session_id);
  345. auto *get_mem_base = reinterpret_cast<uint8_t *>(reinterpret_cast<uintptr_t>(var_manager->GetVarMemMaxSize()));
  346. uint8_t *get_weight_mem_base = get_mem_base;
  347. if (weight_size > 0) {
  348. get_weight_mem_base = get_mem_base + memory_size + p2p_memory_size;
  349. }
  350. std::map<int64_t, uint8_t *> mem_type_to_data_mem_base;
  351. mem_type_to_data_mem_base[RT_MEMORY_HBM] = get_mem_base;
  352. if (p2p_memory_size == 0) {
  353. mem_type_to_data_mem_base[RT_MEMORY_P2P_DDR] = nullptr;
  354. } else {
  355. mem_type_to_data_mem_base[RT_MEMORY_P2P_DDR] = get_mem_base + memory_size;
  356. }
  357. std::map<int64_t, uint64_t> mem_type_to_data_mem_size;
  358. mem_type_to_data_mem_size[RT_MEMORY_HBM] = memory_size;
  359. mem_type_to_data_mem_size[RT_MEMORY_P2P_DDR] = p2p_memory_size;
  360. RunContextUtil run_context;
  361. Status ret = run_context.InitMemInfo(get_mem_base, memory_size, mem_type_to_data_mem_base, mem_type_to_data_mem_size,
  362. get_weight_mem_base, weight_size);
  363. if (ret != SUCCESS) {
  364. GELOGE(ret, "task_generator init mem info fail.");
  365. return ret;
  366. }
  367. auto weight_buffer = builder.GetWeightBuffer();
  368. ret = run_context.CreateRunContext(*model_ptr, comp_graph, weight_buffer, session_id);
  369. if (ret != SUCCESS) {
  370. GELOGE(ret, "runContext create run context fail.");
  371. return ret;
  372. }
  373. StreamGraphOptimizer stream_optimizer;
  374. ret = stream_optimizer.OptimizeStreamedSubGraph(comp_graph, subgraph_map, run_context.GetRunContext());
  375. if (ret != SUCCESS) {
  376. GELOGE(ret, "Optimize streamed subGraph fail.");
  377. return ret;
  378. }
  379. GE_DUMP(comp_graph, "AfterOptimizeStreamedSubGraph");
  380. auto *get_var_mem_base = reinterpret_cast<uint8_t *>(reinterpret_cast<uintptr_t>(var_manager->GetVarMemLogicBase()));
  381. uint64_t var_size = (var_manager->GetVarMemSize(RT_MEMORY_HBM) > 0) ? var_manager->GetVarMemMaxSize() : 0;
  382. TaskGenerator task_generator(get_var_mem_base, var_size);
  383. ret = task_generator.GetTaskInfo(*model_ptr, comp_graph, session_id, run_context.GetRunContext());
  384. return ret;
  385. }
  386. Status GraphBuilder::SetInputSize(const ge::NodePtr &node_ptr) {
  387. // set input_desc.size = src_node.output_desc.size
  388. if (node_ptr->GetType() == DATA) {
  389. bool is_unknown_shape = false;
  390. GE_CHK_STATUS_RET(ge::NodeUtils::GetNodeUnknownShapeStatus(*node_ptr, is_unknown_shape),
  391. "Get data node[%s] shape status failed!", node_ptr->GetName().c_str());
  392. if (is_unknown_shape) {
  393. GELOGD("data node: %s is unknown shape, do not set input size!", node_ptr->GetName().c_str());
  394. return SUCCESS;
  395. }
  396. if (UpdateDataInputSize(node_ptr) != SUCCESS) {
  397. GELOGE(FAILED, "Update data input size failed.");
  398. return FAILED;
  399. }
  400. }
  401. for (const auto &in_data_anchor : node_ptr->GetAllInDataAnchors()) {
  402. const auto &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  403. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  404. const auto &src_node = peer_out_anchor->GetOwnerNode();
  405. const auto &src_op = src_node->GetOpDesc();
  406. GE_IF_BOOL_EXEC(src_op == nullptr, continue);
  407. auto node_op_desc = node_ptr->GetOpDesc();
  408. GE_IF_BOOL_EXEC(node_op_desc == nullptr, continue);
  409. // set dst_node.input_desc = src_node.output_desc
  410. ge::GeTensorDesc desc_temp(src_op->GetOutputDesc(peer_out_anchor->GetIdx()));
  411. int64_t size = 0;
  412. GE_IF_BOOL_EXEC(ge::TensorUtils::GetSize(desc_temp, size) != SUCCESS, GELOGI("Get size failed!"));
  413. GELOGD("src node %s output desc, dim_size: %zu, mem_size: %ld, format: %s, type: %s.", src_node->GetName().c_str(),
  414. desc_temp.GetShape().GetDimNum(), size, TypeUtils::FormatToSerialString(desc_temp.GetFormat()).c_str(),
  415. TypeUtils::DataTypeToSerialString(desc_temp.GetDataType()).c_str());
  416. for (size_t i = 0; i < desc_temp.GetShape().GetDimNum(); ++i) {
  417. GELOGD("dims[%zu]: %ld", i, desc_temp.GetShape().GetDim(i));
  418. }
  419. auto input_desc = node_op_desc->GetInputDescPtr(in_data_anchor->GetIdx());
  420. GE_CHECK_NOTNULL(input_desc);
  421. ge::TensorUtils::SetSize(const_cast<GeTensorDesc &>(*input_desc), size);
  422. GE_CHK_STATUS_RET(node_op_desc->UpdateInputDesc(in_data_anchor->GetIdx(), *input_desc));
  423. GELOGD("%s input desc, dim_size: %zu, mem_size: %ld, format: %s, type: %s.", node_ptr->GetName().c_str(),
  424. input_desc->GetShape().GetDimNum(), size, TypeUtils::FormatToSerialString(input_desc->GetFormat()).c_str(),
  425. TypeUtils::DataTypeToSerialString(input_desc->GetDataType()).c_str());
  426. }
  427. return SUCCESS;
  428. }
  429. Status GraphBuilder::UpdateDataInputSize(const ge::NodePtr &node_ptr) {
  430. const auto &op_desc = node_ptr->GetOpDesc();
  431. if (op_desc == nullptr) {
  432. GELOGE(FAILED, "Op desc is nullptr.");
  433. return FAILED;
  434. }
  435. // data op only has one output anchor
  436. ge::GeTensorDesc output_desc = op_desc->GetOutputDesc(0);
  437. int64_t output_size = 0;
  438. if (ge::TensorUtils::GetSize(output_desc, output_size) != SUCCESS) {
  439. GELOGW("Get size failed!");
  440. }
  441. if (output_size > 0) {
  442. GELOGI("No need to update data input size.");
  443. return SUCCESS;
  444. } else {
  445. int64_t real_dim_size = 0;
  446. ge::graphStatus graph_status = TensorUtils::GetTensorSizeInBytes(output_desc, real_dim_size);
  447. if (graph_status != GRAPH_SUCCESS) {
  448. GELOGE(FAILED, "Get tensor size in bytes failed.");
  449. return FAILED;
  450. }
  451. // data op only has one input anchor
  452. ge::GeTensorDesc input_desc = op_desc->GetInputDesc(0);
  453. ge::TensorUtils::SetSize(input_desc, real_dim_size);
  454. if (op_desc->UpdateInputDesc(0, input_desc) != GRAPH_SUCCESS) {
  455. GELOGE(FAILED, "Update input desc size failed.");
  456. return FAILED;
  457. }
  458. }
  459. return SUCCESS;
  460. }
  461. Status GraphBuilder::CalcDynShapeRootGraphDataSize(const ge::OpDescPtr &op_desc) {
  462. GELOGI("Begin to calc dynamic shape graph data[%s] size.", op_desc->GetName().c_str());
  463. // data op only has one output anchor
  464. ge::GeTensorDesc output_desc = op_desc->GetOutputDesc(0);
  465. if (output_desc.MutableShape().IsUnknownShape()) {
  466. GELOGI("No need to update dynamic shape graph data output size for unknown shape data.");
  467. return SUCCESS;
  468. }
  469. int64_t output_size = 0;
  470. if (ge::TensorUtils::GetSize(output_desc, output_size) != SUCCESS) {
  471. GELOGW("Get size failed!");
  472. }
  473. if (output_size > 0) {
  474. GELOGI("No need to update dynamic shape graph data output size[%ld].", output_size);
  475. return SUCCESS;
  476. } else {
  477. int64_t real_dim_size = 0;
  478. ge::graphStatus graph_status = TensorUtils::GetTensorSizeInBytes(output_desc, real_dim_size);
  479. if (graph_status != GRAPH_SUCCESS) {
  480. GELOGE(FAILED, "Get tensor size in bytes failed.");
  481. return FAILED;
  482. }
  483. ge::TensorUtils::SetSize(output_desc, real_dim_size);
  484. GELOGI("Update dynamic shape graph data output size to [%ld].", real_dim_size);
  485. if (op_desc->UpdateOutputDesc(0, output_desc) != GRAPH_SUCCESS) {
  486. GELOGE(FAILED, "Update dynamic shape graph data output desc size failed.");
  487. return FAILED;
  488. }
  489. }
  490. return SUCCESS;
  491. }
  492. Status GraphBuilder::SecondPartition(ge::ComputeGraphPtr &comp_graph, vector<ge::SubGraphInfoPtr> &subgraph_ptr_list) {
  493. GE_TIMESTAMP_START(GraphPartition2);
  494. auto ret = graph_partitioner_.Partition(comp_graph, GraphPartitioner::kSecondPartitioning);
  495. if (ret != SUCCESS) {
  496. GELOGE(ret, "Graph partition Failed");
  497. return ret;
  498. }
  499. GE_CHK_STATUS_RET(ret, "Graph partition Failed.");
  500. auto graph_2_subgraphlist = graph_partitioner_.GetSubGraphMap();
  501. if (graph_2_subgraphlist.find(comp_graph) != graph_2_subgraphlist.end()) {
  502. subgraph_ptr_list = graph_2_subgraphlist[comp_graph];
  503. } else {
  504. GELOGE(FAILED, "Find subgraph failed.");
  505. return FAILED;
  506. }
  507. GE_TIMESTAMP_END(GraphPartition2, "GraphPartitioner::Partition2");
  508. return ret;
  509. }
  510. Status GraphBuilder::AddOutputMemTypeForNode(const NodePtr &node) {
  511. auto op_desc = node->GetOpDesc();
  512. GE_CHECK_NOTNULL(op_desc);
  513. uint32_t mem_type;
  514. if (!AttrUtils::GetInt(op_desc, ATTR_INPUT_MEMORY_TYPE, mem_type)) {
  515. return SUCCESS;
  516. }
  517. GELOGD("[%s] has attr input_memory_type %ld", op_desc->GetName().c_str(), mem_type);
  518. for (const auto &in_data_anchor : node->GetAllInDataAnchors()) {
  519. const auto &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  520. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  521. bool valid_flag = false;
  522. auto src_node = peer_out_anchor->GetOwnerNode();
  523. auto src_out_anchor = peer_out_anchor;
  524. while (true) {
  525. const auto &src_desc = src_node->GetOpDesc();
  526. GE_IF_BOOL_EXEC(src_desc == nullptr, continue);
  527. GELOGD("[%s:%u] set attr output_memory_type %ld", src_desc->GetName().c_str(), src_out_anchor->GetIdx(),
  528. mem_type);
  529. if (!AttrUtils::SetInt(src_desc->MutableOutputDesc(src_out_anchor->GetIdx()), ATTR_OUTPUT_MEMORY_TYPE,
  530. mem_type)) {
  531. GELOGE(INTERNAL_ERROR, "Set out_memory_type attr for [%s:%d] failed.", src_desc->GetName().c_str(),
  532. src_out_anchor->GetIdx());
  533. return INTERNAL_ERROR;
  534. }
  535. switch (TransferNodeType(src_node)) {
  536. case kSubgraphNode:
  537. GE_CHK_STATUS_RET(HandleSubgraphNode(src_node, src_out_anchor), "Handle subgraph node %s failed",
  538. src_node->GetName().c_str());
  539. break;
  540. case kSubgraphData:
  541. GE_CHK_STATUS_RET(HandleSubgraphDataNode(src_node, src_out_anchor), "Handle Data node %s in subgraph failed",
  542. src_node->GetName().c_str());
  543. break;
  544. case kOthers:
  545. default:
  546. valid_flag = true;
  547. break;
  548. }
  549. if (valid_flag) {
  550. break;
  551. }
  552. }
  553. }
  554. return SUCCESS;
  555. }
  556. } // namespace ge

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