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

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