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

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