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.

hybrid_model_builder.cc 57 kB

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
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
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
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
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
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393
  1. /**
  2. * Copyright 2019-2020 Huawei Technologies Co., Ltd
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #include "hybrid/model/hybrid_model_builder.h"
  17. #include "common/math/math_util.h"
  18. #include "graph/ge_context.h"
  19. #include "graph/build/memory/var_mem_assign_util.h"
  20. #include "graph/utils/node_utils.h"
  21. #include "graph/debug/ge_attr_define.h"
  22. #include "graph/load/new_model_manager/model_utils.h"
  23. #include "graph/manager/graph_var_manager.h"
  24. #include "graph/manager/host_mem_manager.h"
  25. #include "graph/manager/trans_var_data_utils.h"
  26. #include "graph/utils/graph_utils.h"
  27. #include "graph/utils/type_utils.h"
  28. #include "hybrid/common/npu_memory_allocator.h"
  29. #include "hybrid/node_executor/node_executor.h"
  30. namespace ge {
  31. namespace hybrid {
  32. namespace {
  33. const uint32_t kSubgraphIndex = 0U;
  34. const uint32_t kVarOutputIndex = 0U;
  35. const uint32_t kAlignment = 32;
  36. const int kBytes = 8;
  37. int64_t CalcVarSizeInBytes(const GeTensorDesc &desc) {
  38. int64_t var_size = 0;
  39. auto data_type = desc.GetDataType();
  40. if (data_type == DT_STRING) {
  41. (void) TensorUtils::GetSize(desc, var_size);
  42. } else {
  43. var_size = GetSizeByDataType(data_type);
  44. if (var_size <= 0) {
  45. GELOGW("Failed to calc var data size from data type %s", TypeUtils::DataTypeToSerialString(data_type).c_str());
  46. return -1;
  47. }
  48. auto shape = desc.GetShape();
  49. auto dim_num = shape.GetDimNum();
  50. for (size_t dim_index = 0; dim_index < dim_num; ++dim_index) {
  51. var_size *= shape.GetDim(dim_index);
  52. }
  53. // padding up to multiple of kAlignment, and add extra kAlignment
  54. var_size = (var_size + kAlignment * 2 - 1) / kAlignment * kAlignment;
  55. }
  56. return var_size;
  57. }
  58. } // namespace
  59. HybridModelBuilder::HybridModelBuilder(HybridModel &hybrid_model)
  60. : hybrid_model_(hybrid_model), runtime_param_(hybrid_model.root_runtime_param_) {
  61. ge_root_model_ = hybrid_model_.ge_root_model_;
  62. }
  63. Status HybridModelBuilder::Build() {
  64. GE_CHK_STATUS_RET(ValidateParams(), "Failed to validate GeRootModel");
  65. hybrid_model_.model_name_ = ge_root_model_->GetRootGraph()->GetName();
  66. GELOGI("[%s] Start to build hybrid model.", GetGraphName());
  67. GE_CHK_STATUS_RET(InitRuntimeParams(), "[%s] Failed to InitRuntimeParams", GetGraphName());
  68. GE_CHK_STATUS_RET(IndexSpecialNodes(), "[%s] Failed to index nodes", GetGraphName());
  69. GE_CHK_STATUS_RET(IndexTaskDefs(), "[%s] Failed to index task defs", GetGraphName());
  70. GE_CHK_STATUS_RET(LoadGraph(), "[%s] Failed to load graph", GetGraphName());
  71. GE_CHK_STATUS_RET(AssignUninitializedConstantOps(), "[%s] Failed to assign uninitialized constants", GetGraphName());
  72. GE_CHK_STATUS_RET(TransAllVarData(), "[%s] Failed to trans all var data", GetGraphName());
  73. GE_CHK_STATUS_RET(CopyVarData(), "[%s] Failed to copy var data", GetGraphName());
  74. GE_CHK_STATUS_RET(InitModelMem(), "[%s] Failed to init memory", GetGraphName());
  75. GE_CHK_STATUS_RET(InitWeights(), "[%s] Failed to init weights", GetGraphName());
  76. GE_CHK_STATUS_RET(InitConstantOps(), "[%s] Failed to init constant op", GetGraphName());
  77. GE_CHK_STATUS_RET(InitVariableTensors(), "[%s] Failed to init variables", GetGraphName());
  78. GE_CHK_STATUS_RET(LoadTasks(), "[%s] Failed to load tasks", GetGraphName());
  79. GELOGI("[%s] Done building hybrid model successfully.", GetGraphName());
  80. return SUCCESS;
  81. }
  82. Status HybridModelBuilder::ValidateParams() {
  83. GE_CHECK_NOTNULL(ge_root_model_);
  84. GE_CHECK_NOTNULL(ge_root_model_->GetRootGraph());
  85. return SUCCESS;
  86. }
  87. Status HybridModelBuilder::BuildNodeItem(const NodePtr &node, NodeItem &node_item) {
  88. auto op_desc = node->GetOpDesc();
  89. vector<string> dependencies = node->GetOpDesc()->GetOpInferDepends();
  90. GE_CHK_STATUS_RET(ParseDependentInputNodes(node_item, dependencies),
  91. "[%s] Failed to parse node dependencies.",
  92. node_item.NodeName().c_str());
  93. node_item.outputs.resize(node_item.num_outputs);
  94. for (int i = 0; i < node_item.num_outputs; ++i) {
  95. auto out_data_anchor = node->GetOutDataAnchor(i);
  96. if (out_data_anchor == nullptr) {
  97. GELOGE(INTERNAL_ERROR, "out anchor[%d] of node %s is nullptr", i, node->GetName().c_str());
  98. return INTERNAL_ERROR;
  99. }
  100. for (auto &dst_in_anchor: out_data_anchor->GetPeerInDataAnchors()) {
  101. auto dst_node = dst_in_anchor->GetOwnerNode();
  102. if (dst_node == nullptr) {
  103. GELOGW("dst node is nullptr. out anchor = %d", out_data_anchor->GetIdx());
  104. continue;
  105. }
  106. NodeItem *dst_node_item = nullptr;
  107. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  108. "[%s] Failed to get or create node item.",
  109. dst_node->GetName().c_str());
  110. node_item.outputs[i].emplace_back(dst_in_anchor->GetIdx(), dst_node_item);
  111. }
  112. }
  113. GE_CHK_STATUS_RET_NOLOG(ResolveRefIo(node_item));
  114. return SUCCESS;
  115. }
  116. Status HybridModelBuilder::ResolveRefIo(NodeItem &node_item) {
  117. bool is_ref = false;
  118. auto &op_desc = *node_item.op_desc;
  119. (void) AttrUtils::GetBool(op_desc, ATTR_NAME_REFERENCE, is_ref);
  120. if (!is_ref) {
  121. return SUCCESS;
  122. }
  123. auto inputs = op_desc.GetAllInputName();
  124. auto outputs = op_desc.GetAllOutputName();
  125. for (auto &output : outputs) {
  126. for (auto &input : inputs) {
  127. if (input.first == output.first) {
  128. auto input_idx = static_cast<int>(input.second);
  129. auto output_idx = static_cast<int>(output.second);
  130. node_item.reuse_inputs[output_idx] = input_idx;
  131. GELOGD("[%s] Output[%d] reuse input[%d]", node_item.NodeName().c_str(), output_idx, input_idx);
  132. }
  133. }
  134. }
  135. return SUCCESS;
  136. }
  137. Status HybridModelBuilder::GetOrCreateNodeItem(const NodePtr &node, NodeItem **node_item) {
  138. auto &node_items = hybrid_model_.node_items_;
  139. auto it = node_items.find(node);
  140. if (it != node_items.end()) {
  141. *node_item = it->second.get();
  142. return SUCCESS;
  143. }
  144. auto new_node = std::unique_ptr<NodeItem>(new(std::nothrow) NodeItem(node));
  145. GE_CHECK_NOTNULL(new_node);
  146. GE_CHECK_NOTNULL(new_node->op_desc);
  147. GE_CHK_STATUS_RET(new_node->Init(), "Failed to init NodeItem [%s] .", node->GetName().c_str());
  148. GE_CHK_STATUS_RET_NOLOG(NodeExecutorManager::GetInstance().GetExecutor(*node, &new_node->node_executor));
  149. // we do not need L2 Buffer
  150. const char *const kIsFirstNode = "is_first_node";
  151. const char *const kIsLastNode = "is_last_node";
  152. (void) AttrUtils::SetBool(new_node->op_desc, kIsFirstNode, false);
  153. (void) AttrUtils::SetBool(new_node->op_desc, kIsLastNode, false);
  154. if (new_node->is_dynamic && (new_node->IsControlOp() || new_node->NodeType() == PARTITIONEDCALL)) {
  155. new_node->shape_inference_type = DEPEND_COMPUTE;
  156. }
  157. new_node->node_id = node_index;
  158. new_node->op_desc->SetId(node_index);
  159. node_index += 1;
  160. *node_item = new_node.get();
  161. node_items[node] = std::move(new_node);
  162. return SUCCESS;
  163. }
  164. Status HybridModelBuilder::ParseDependentInputNodes(NodeItem &node_item, const std::vector<string> &dependencies) {
  165. std::set<NodePtr> dependent_input_nodes;
  166. auto &ge_node = node_item.node;
  167. bool is_hccl_op =
  168. NodeExecutorManager::GetInstance().ResolveExecutorType(*ge_node) == NodeExecutorManager::ExecutorType::HCCL;
  169. // The input tensors become valid after computation is done for parent nodes of type DEPEND_COMPUTE.
  170. // Wait for these parent nodes before execution.
  171. for (const auto &in_anchor : ge_node->GetAllInDataAnchors()) {
  172. const auto &peer_anchor = in_anchor->GetPeerOutAnchor();
  173. if (peer_anchor == nullptr) {
  174. GELOGD("[%s] Input[%d] do not have peer anchor", node_item.NodeName().c_str(), in_anchor->GetIdx());
  175. continue;
  176. }
  177. auto src_node = peer_anchor->GetOwnerNode();
  178. GE_CHECK_NOTNULL(src_node);
  179. auto src_node_item = MutableNodeItem(src_node);
  180. GE_CHECK_NOTNULL(src_node_item);
  181. if (is_hccl_op) {
  182. GELOGD("[%s] Add input data dependent node [%s] due to engine type is HCCL",
  183. node_item.NodeName().c_str(),
  184. src_node_item->NodeName().c_str());
  185. src_node_item->has_observer = true;
  186. node_item.dependents_for_execution.emplace_back(src_node);
  187. } else if (src_node_item->shape_inference_type == DEPEND_COMPUTE) {
  188. GELOGD("[%s] Add input data dependent node [%s] due to inference type = DEPEND_COMPUTE",
  189. node_item.NodeName().c_str(),
  190. src_node_item->NodeName().c_str());
  191. src_node_item->has_observer = true;
  192. node_item.dependents_for_execution.emplace_back(src_node);
  193. }
  194. if (src_node_item->shape_inference_type == DEPEND_SHAPE_RANGE) {
  195. GELOGD("[%s] Add input shape dependent node [%s] due to inference type = DEPEND_SHAPE_RANGE",
  196. node_item.NodeName().c_str(),
  197. src_node_item->NodeName().c_str());
  198. src_node_item->has_observer = true;
  199. dependent_input_nodes.emplace(src_node);
  200. }
  201. }
  202. // cond or branch need to be prepared before the execution of IF or CASE
  203. if (node_item.node_type == IF || node_item.node_type == CASE) {
  204. const auto &in_anchor = ge_node->GetInDataAnchor(0);
  205. GE_CHECK_NOTNULL(in_anchor);
  206. const auto &peer_anchor = in_anchor->GetPeerOutAnchor();
  207. GE_CHECK_NOTNULL(peer_anchor);
  208. auto src_node = peer_anchor->GetOwnerNode();
  209. GE_CHECK_NOTNULL(src_node);
  210. auto src_node_item = MutableNodeItem(src_node);
  211. GE_CHECK_NOTNULL(src_node_item);
  212. src_node_item->has_observer = true;
  213. node_item.dependents_for_execution.emplace_back(src_node);
  214. GELOGD("[%s] Dependent added from %s for control op's cond/branch",
  215. node_item.NodeName().c_str(),
  216. src_node_item->NodeName().c_str());
  217. }
  218. for (const auto &input_name : dependencies) {
  219. int input_index = node_item.op_desc->GetInputIndexByName(input_name);
  220. if (input_index < 0) {
  221. GELOGE(INTERNAL_ERROR,
  222. "[%s] Failed to get input index by name: %s",
  223. node_item.NodeName().c_str(),
  224. input_name.c_str());
  225. return INTERNAL_ERROR;
  226. }
  227. const auto &in_anchor = ge_node->GetInDataAnchor(input_index);
  228. GE_CHECK_NOTNULL(in_anchor);
  229. const auto &peer_out_anchor = in_anchor->GetPeerOutAnchor();
  230. GE_CHECK_NOTNULL(peer_out_anchor);
  231. const auto &src_node = peer_out_anchor->GetOwnerNode();
  232. GE_CHECK_NOTNULL(src_node);
  233. auto src_node_item = MutableNodeItem(src_node);
  234. src_node_item->to_const_output_id_list.emplace(peer_out_anchor->GetIdx());
  235. src_node_item->has_observer = true;
  236. dependent_input_nodes.emplace(src_node);
  237. GELOGD("[%s] Dependent added from output of [%s:%d]",
  238. node_item.NodeName().c_str(),
  239. src_node_item->NodeName().c_str(),
  240. peer_out_anchor->GetIdx());
  241. }
  242. for (const auto &dep_node : dependent_input_nodes) {
  243. node_item.dependents_for_shape_inference.emplace_back(dep_node);
  244. }
  245. return SUCCESS;
  246. }
  247. Status HybridModelBuilder::UpdateAnchorStatus(const NodePtr &node) {
  248. if (NodeUtils::SetAllAnchorStatus(node) != GRAPH_SUCCESS) {
  249. GELOGE(INTERNAL_ERROR, "[%s] NodeUtils::SetAllAnchorStatus failed.", node->GetName().c_str());
  250. return INTERNAL_ERROR;
  251. }
  252. for (auto &anchor : node->GetAllInDataAnchors()) {
  253. auto peer_anchor = anchor->GetPeerOutAnchor();
  254. if (peer_anchor == nullptr) {
  255. if (AnchorUtils::SetStatus(anchor, ANCHOR_SUSPEND) != GRAPH_SUCCESS) {
  256. GELOGE(INTERNAL_ERROR, "[%s] AnchorUtils::SetStatus failed.", node->GetName().c_str());
  257. return INTERNAL_ERROR;
  258. }
  259. } else if (peer_anchor->GetOwnerNode()->GetType() == CONSTANT) {
  260. if (AnchorUtils::SetStatus(anchor, ANCHOR_CONST) != GRAPH_SUCCESS) {
  261. GELOGE(INTERNAL_ERROR, "[%s] AnchorUtils::SetStatus failed.", node->GetName().c_str());
  262. return INTERNAL_ERROR;
  263. }
  264. } else {
  265. if (AnchorUtils::SetStatus(anchor, ANCHOR_DATA) != GRAPH_SUCCESS) {
  266. GELOGE(INTERNAL_ERROR, "[%s] AnchorUtils::SetStatus failed.", node->GetName().c_str());
  267. return INTERNAL_ERROR;
  268. }
  269. }
  270. }
  271. return SUCCESS;
  272. }
  273. Status HybridModelBuilder::DoUnlinkDataAnchors(const OutDataAnchorPtr &out_data_anchor,
  274. const InDataAnchorPtr &in_data_anchor) {
  275. GE_CHK_GRAPH_STATUS_RET(out_data_anchor->Unlink(in_data_anchor), "Failed to unlink %s:%d from %s:%d",
  276. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  277. out_data_anchor->GetIdx(),
  278. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  279. in_data_anchor->GetIdx());
  280. GELOGD("Succeeded in unlinking %s:%d from %s:%d",
  281. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  282. out_data_anchor->GetIdx(),
  283. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  284. in_data_anchor->GetIdx());
  285. return SUCCESS;
  286. }
  287. Status HybridModelBuilder::DoLinkDataAnchors(OutDataAnchorPtr &out_data_anchor, InDataAnchorPtr &in_data_anchor) {
  288. GE_CHK_GRAPH_STATUS_RET(out_data_anchor->LinkTo(in_data_anchor), "Failed to link %s:%d to %s:%d",
  289. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  290. out_data_anchor->GetIdx(),
  291. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  292. in_data_anchor->GetIdx());
  293. GELOGD("Succeeded in linking %s:%d to %s:%d",
  294. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  295. out_data_anchor->GetIdx(),
  296. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  297. in_data_anchor->GetIdx());
  298. return SUCCESS;
  299. }
  300. Status HybridModelBuilder::MergeInputNodes(ComputeGraph &graph) {
  301. const auto &wrapped_node = graph.GetParentNode();
  302. std::set<NodePtr> root_nodes;
  303. for (const auto &node : graph.GetDirectNode()) {
  304. GE_CHECK_NOTNULL(node);
  305. if (node->GetType() != DATA_TYPE) {
  306. if (node->GetInDataNodes().empty()) {
  307. root_nodes.emplace(node);
  308. }
  309. continue;
  310. }
  311. auto data_op_desc = node->GetOpDesc();
  312. GE_CHECK_NOTNULL(data_op_desc);
  313. uint32_t parent_index = 0;
  314. if (!AttrUtils::GetInt(data_op_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  315. GELOGE(FAILED,
  316. "[%s] Failed to get attr [%s]",
  317. data_op_desc->GetName().c_str(),
  318. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  319. return FAILED;
  320. }
  321. auto wrapped_node_in_anchor = wrapped_node->GetInDataAnchor(parent_index);
  322. GE_CHECK_NOTNULL(wrapped_node_in_anchor);
  323. auto src_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  324. if (src_out_anchor == nullptr || src_out_anchor->GetOwnerNode() == nullptr) {
  325. continue;
  326. }
  327. auto src_node = wrapped_node_in_anchor->GetPeerOutAnchor()->GetOwnerNode();
  328. wrapped_node_in_anchor->UnlinkAll();
  329. // link src to outputs of DataNode
  330. for (auto &out_data_anchor : node->GetAllOutDataAnchors()) {
  331. GE_CHECK_NOTNULL(out_data_anchor);
  332. for (auto &peer_in_data_anchor : out_data_anchor->GetPeerInDataAnchors()) {
  333. auto dst_node = peer_in_data_anchor->GetOwnerNode();
  334. root_nodes.emplace(dst_node);
  335. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(out_data_anchor, peer_in_data_anchor));
  336. GE_CHK_STATUS_RET_NOLOG(DoLinkDataAnchors(src_out_anchor, peer_in_data_anchor));
  337. }
  338. }
  339. }
  340. // transfer in control edges to all root nodes
  341. for (auto &root_node : root_nodes) {
  342. auto in_nodes = root_node->GetInAllNodes();
  343. std::set<NodePtr> in_node_set(in_nodes.begin(), in_nodes.end());
  344. for (auto &in_control_node : wrapped_node->GetInControlNodes()) {
  345. if (in_node_set.count(in_control_node) == 0) {
  346. GELOGD("[%s] Restore control edge to [%s]", in_control_node->GetName().c_str(), root_node->GetName().c_str());
  347. GE_CHECK_NOTNULL(in_control_node->GetOutControlAnchor());
  348. (void) in_control_node->GetOutControlAnchor()->LinkTo(root_node->GetInControlAnchor());
  349. }
  350. }
  351. }
  352. wrapped_node->GetInControlAnchor()->UnlinkAll();
  353. return SUCCESS;
  354. }
  355. Status HybridModelBuilder::MergeNetOutputNode(ComputeGraph &graph) {
  356. const auto &parent_node = graph.GetParentNode();
  357. const NodePtr &net_output_node = graph.FindFirstNodeMatchType(NETOUTPUT);
  358. if (net_output_node == nullptr) {
  359. GELOGD("Graph has no netoutput no need to merge.");
  360. return SUCCESS;
  361. }
  362. const auto &net_output_desc = net_output_node->GetOpDesc();
  363. GE_CHECK_NOTNULL(net_output_desc);
  364. auto all_in_nodes = net_output_node->GetInAllNodes();
  365. auto all_out_nodes = parent_node->GetOutAllNodes();
  366. net_output_node->GetInControlAnchor()->UnlinkAll();
  367. parent_node->GetOutControlAnchor()->UnlinkAll();
  368. for (const auto &in_data_anchor : net_output_node->GetAllInDataAnchors()) {
  369. auto src_out_anchor = in_data_anchor->GetPeerOutAnchor();
  370. GE_CHECK_NOTNULL(src_out_anchor);
  371. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(src_out_anchor, in_data_anchor));
  372. auto index = in_data_anchor->GetIdx();
  373. auto input_desc = net_output_desc->MutableInputDesc(index);
  374. if (input_desc == nullptr) {
  375. GELOGE(INTERNAL_ERROR, "[%s] Failed to get input desc[%d]", net_output_desc->GetName().c_str(), index);
  376. return INTERNAL_ERROR;
  377. }
  378. uint32_t parent_index = 0;
  379. if (!AttrUtils::GetInt(input_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  380. GELOGW("SubGraph: %s NetOutput input tensor %d, attr %s not found.",
  381. graph.GetName().c_str(), index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  382. continue;
  383. }
  384. const OutDataAnchorPtr &parent_out_anchor = parent_node->GetOutDataAnchor(parent_index);
  385. GE_CHECK_NOTNULL(parent_out_anchor);
  386. for (InDataAnchorPtr &dst_in_anchor : parent_out_anchor->GetPeerInDataAnchors()) {
  387. if (dst_in_anchor == nullptr) {
  388. continue;
  389. }
  390. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(parent_out_anchor, dst_in_anchor));
  391. GE_CHK_STATUS_RET_NOLOG(DoLinkDataAnchors(src_out_anchor, dst_in_anchor));
  392. }
  393. }
  394. // transfer out control edges
  395. std::set<NodePtr> in_node_set(all_in_nodes.begin(), all_in_nodes.end());
  396. std::set<NodePtr> out_node_set(all_out_nodes.begin(), all_out_nodes.end());
  397. for (auto &src_node : in_node_set) {
  398. GELOGD("[%s] process in node.", src_node->GetName().c_str());
  399. auto out_nodes = src_node->GetOutAllNodes();
  400. std::set<NodePtr> node_set(out_nodes.begin(), out_nodes.end());
  401. for (auto &dst_node : out_node_set) {
  402. if (node_set.count(dst_node) == 0) {
  403. src_node->GetOutControlAnchor()->LinkTo(dst_node->GetInControlAnchor());
  404. GELOGD("[%s] Restore control edge to [%s]", src_node->GetName().c_str(), dst_node->GetName().c_str());
  405. }
  406. }
  407. }
  408. return SUCCESS;
  409. }
  410. Status HybridModelBuilder::UnfoldSubgraphs(ComputeGraph &root_graph, ComputeGraphPtr &merged_graph) {
  411. merged_graph = MakeShared<ComputeGraph>("MergedGraph");
  412. for (const auto &node : root_graph.GetDirectNode()) {
  413. GE_CHECK_NOTNULL(node);
  414. auto op_desc = node->GetOpDesc();
  415. GE_CHECK_NOTNULL(op_desc);
  416. const auto &op_type = node->GetType();
  417. if (op_type != PARTITIONEDCALL) {
  418. merged_graph->AddNode(node);
  419. GELOGD("[%s] Node added to merged graph.", op_desc->GetName().c_str());
  420. continue;
  421. }
  422. auto subgraph = NodeUtils::GetSubgraph(*node, kSubgraphIndex);
  423. GE_CHECK_NOTNULL(subgraph);
  424. bool is_unknown_shape = subgraph->GetGraphUnknownFlag();
  425. if (!is_unknown_shape) {
  426. merged_graph->AddNode(node);
  427. GELOGD("[%s] Known shape partitioned call added to merged graph.", op_desc->GetName().c_str());
  428. continue;
  429. }
  430. GE_CHK_GRAPH_STATUS_RET(UnfoldSubgraph(root_graph, *merged_graph, *subgraph),
  431. "[%s] Failed to merge subgraph.",
  432. subgraph->GetName().c_str());
  433. }
  434. // invoke before adding subgraphs. in case modify node id in known-shaped subgraphs.
  435. GE_CHK_GRAPH_STATUS_RET(merged_graph->TopologicalSorting(), "Failed to invoke TopologicalSorting on merged graph.");
  436. for (auto &remained_subgraph : root_graph.GetAllSubgraphs()) {
  437. GELOGD("Adding subgraph [%s] to merged-graph.", remained_subgraph->GetName().c_str());
  438. GE_CHK_GRAPH_STATUS_RET(merged_graph->AddSubgraph(remained_subgraph),
  439. "Failed to add subgraph [%s]",
  440. remained_subgraph->GetName().c_str());
  441. }
  442. return SUCCESS;
  443. }
  444. Status HybridModelBuilder::UnfoldSubgraph(ComputeGraph &root_graph,
  445. ComputeGraph &parent_graph,
  446. ComputeGraph &sub_graph) {
  447. auto parent_node = sub_graph.GetParentNode();
  448. GE_CHECK_NOTNULL(parent_node);
  449. GE_CHK_STATUS_RET(MergeInputNodes(sub_graph),
  450. "[%s] Failed to merge data nodes for subgraph",
  451. sub_graph.GetName().c_str());
  452. GE_CHK_STATUS_RET(MergeNetOutputNode(sub_graph),
  453. "[%s] Failed to merge net output nodes for subgraph",
  454. sub_graph.GetName().c_str());
  455. GELOGD("[%s] Done merging subgraph inputs and outputs successfully.", sub_graph.GetName().c_str());
  456. for (auto &sub_node : sub_graph.GetDirectNode()) {
  457. auto sub_op_type = sub_node->GetType();
  458. if (sub_op_type == DATA_TYPE || sub_op_type == NETOUTPUT) {
  459. continue;
  460. }
  461. if (sub_op_type == PARTITIONEDCALL) {
  462. auto sub_sub_graph = NodeUtils::GetSubgraph(*sub_node, kSubgraphIndex);
  463. GE_CHECK_NOTNULL(sub_sub_graph);
  464. if (sub_sub_graph->GetGraphUnknownFlag()) {
  465. GE_CHK_STATUS_RET(UnfoldSubgraph(root_graph, parent_graph, *sub_sub_graph),
  466. "[%s] Failed to merge subgraph",
  467. sub_sub_graph->GetName().c_str());
  468. continue;
  469. }
  470. }
  471. parent_graph.AddNode(sub_node);
  472. GELOGD("[%s::%s] added to parent graph: [%s].",
  473. sub_graph.GetName().c_str(),
  474. sub_node->GetName().c_str(),
  475. parent_graph.GetName().c_str());
  476. }
  477. GELOGD("[%s] Done merging subgraph. remove it from root graph.", sub_graph.GetName().c_str());
  478. root_graph.RemoveSubgraph(sub_graph.GetName());
  479. return SUCCESS;
  480. }
  481. Status HybridModelBuilder::BuildOutputMapping(GraphItem &graph_item,
  482. const NodeItem &node_item,
  483. bool is_root_graph) {
  484. auto output_size = node_item.op_desc->GetAllInputsSize();
  485. GE_CHECK_LE(output_size, UINT32_MAX);
  486. graph_item.output_edges_.resize(output_size);
  487. for (auto &in_data_anchor : node_item.node->GetAllInDataAnchors()) {
  488. auto peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  489. GE_CHECK_NOTNULL(peer_out_anchor);
  490. auto src_node = peer_out_anchor->GetOwnerNode();
  491. GE_CHECK_NOTNULL(src_node);
  492. auto src_node_item = GetNodeItem(src_node);
  493. GE_CHECK_NOTNULL(src_node_item);
  494. auto output_offset = src_node_item->output_start + peer_out_anchor->GetIdx();
  495. GELOGI("Output[%d], node = %s, output_index = %d, output_offset = %d ",
  496. in_data_anchor->GetIdx(),
  497. src_node_item->NodeName().c_str(),
  498. peer_out_anchor->GetIdx(),
  499. output_offset);
  500. graph_item.output_edges_[in_data_anchor->GetIdx()] = {src_node_item, peer_out_anchor->GetIdx()};
  501. }
  502. if (!is_root_graph) {
  503. for (uint32_t i = 0; i < static_cast<uint32_t>(output_size); ++i) {
  504. uint32_t p_index = i;
  505. // Net output of Subgraph of while do not have parent index
  506. if (AttrUtils::GetInt(node_item.op_desc->GetInputDesc(i), ATTR_NAME_PARENT_NODE_INDEX, p_index)) {
  507. GELOGD("[%s] Parent index not set for input[%u].", node_item.NodeName().c_str(), i);
  508. }
  509. graph_item.output_index_mapping_.emplace_back(p_index);
  510. }
  511. }
  512. return SUCCESS;
  513. }
  514. Status HybridModelBuilder::LoadGraph() {
  515. auto root_graph = ge_root_model_->GetRootGraph();
  516. if (!GetContext().GetHostExecFlag()) {
  517. std::shared_ptr<ComputeGraph> merged_graph;
  518. GELOGI("Before merging subgraphs DirectNodesSize = %zu, GetAllNodesSize = %zu",
  519. root_graph->GetDirectNodesSize(),
  520. root_graph->GetAllNodesSize());
  521. GE_CHK_GRAPH_STATUS_RET(UnfoldSubgraphs(*root_graph, merged_graph), "Failed to unfold subgraphs.");
  522. root_graph = std::move(merged_graph);
  523. GELOGI("After merging subgraphs DirectNodesSize = %zu, GetAllNodesSize = %zu",
  524. root_graph->GetDirectNodesSize(),
  525. root_graph->GetAllNodesSize());
  526. GE_DUMP(root_graph, "hybrid_merged_graph");
  527. }
  528. GE_CHK_STATUS_RET(LoadDynamicSubgraph(*root_graph, true), "Failed to load root graph.");
  529. GELOGD("Done loading root graph successfully.");
  530. for (auto &sub_graph : root_graph->GetAllSubgraphs()) {
  531. GE_CHECK_NOTNULL(sub_graph);
  532. GELOGD("Start to load subgraph [%s]", sub_graph->GetName().c_str());
  533. auto parent_node = sub_graph->GetParentNode();
  534. GE_CHECK_NOTNULL(parent_node);
  535. auto parent_node_item = MutableNodeItem(parent_node);
  536. // parent node is in another known subgraph
  537. if (parent_node_item == nullptr) {
  538. GELOGD("[%s] Subgraph is in another known shaped subgraph, skip it.", sub_graph->GetName().c_str());
  539. continue;
  540. }
  541. if (sub_graph->GetGraphUnknownFlag()) {
  542. GE_CHK_STATUS_RET(LoadDynamicSubgraph(*sub_graph, false),
  543. "Failed to load subgraph: [%s]",
  544. sub_graph->GetName().c_str());
  545. } else {
  546. GE_CHK_STATUS_RET(IdentifyVariableOutputs(*parent_node_item),
  547. "[%s] Failed to identify ref outputs.",
  548. parent_node_item->NodeName().c_str());
  549. // if parent is function control op. need add a virtual partitioned call
  550. if (parent_node_item->IsControlOp()) {
  551. GE_CHK_STATUS_RET(LoadKnownShapedSubgraph(*sub_graph, parent_node_item),
  552. "Failed to load function control op subgraph [%s]",
  553. sub_graph->GetName().c_str());
  554. }
  555. }
  556. }
  557. GELOGI("Done loading all subgraphs successfully.");
  558. return SUCCESS;
  559. }
  560. const NodeItem *HybridModelBuilder::GetNodeItem(const NodePtr &node) const {
  561. return hybrid_model_.GetNodeItem(node);
  562. }
  563. NodeItem *HybridModelBuilder::MutableNodeItem(const NodePtr &node) {
  564. return hybrid_model_.MutableNodeItem(node);
  565. }
  566. Status HybridModelBuilder::VarNodeToTensor(const NodePtr &var_node, std::unique_ptr<TensorValue> &tensor) {
  567. string var_name = var_node->GetName();
  568. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  569. uint8_t *var_logic = nullptr;
  570. GE_CHK_STATUS_RET(var_manager_->GetVarAddr(var_name, *tensor_desc, &var_logic),
  571. "Failed to get var addr. var_name = %s, session_id = %ld",
  572. var_name.c_str(),
  573. hybrid_model_.GetSessionId());
  574. uint8_t *dev_mem = var_manager_->GetVarMemoryAddr(var_logic, RT_MEMORY_HBM);
  575. if (dev_mem == nullptr) {
  576. GELOGE(INTERNAL_ERROR,
  577. "Failed to copy var %s from device, cant not get "
  578. "var addr from logic addr %p",
  579. var_node->GetName().c_str(), var_logic);
  580. return INTERNAL_ERROR;
  581. }
  582. int64_t var_size = CalcVarSizeInBytes(*tensor_desc);
  583. // var size is only for checking, will not allocate any memory by it
  584. tensor.reset(new(std::nothrow)TensorValue(dev_mem, static_cast<size_t>(var_size)));
  585. GE_CHECK_NOTNULL(tensor);
  586. return SUCCESS;
  587. }
  588. Status HybridModelBuilder::HandleDtString(const GeTensor &tensor, void *var_addr) {
  589. auto desc = tensor.GetTensorDesc();
  590. if (desc.GetDataType() == DT_STRING) {
  591. GeShape tensor_shape = desc.GetShape();
  592. /// if tensor is a scaler, it's shape size if zero, according ge_tensor.cc.
  593. /// the logic of GetShapeSize is wrong, the scaler tensor's GetShapeSize is zero
  594. /// and that of unknown shape is zero too.
  595. /// unknown shape will not appear here, so we can use zero judge a tensor is scalar or not
  596. int64_t elem_num = tensor_shape.GetShapeSize();
  597. if (elem_num == 0 && tensor_shape.GetDims().empty()) {
  598. elem_num = 1;
  599. }
  600. auto &mutable_tensor = const_cast<GeTensor &>(tensor);
  601. uint64_t *buff = reinterpret_cast<uint64_t *>(mutable_tensor.MutableData().data());
  602. GE_CHK_BOOL_RET_STATUS(ge::CheckInt64Uint32MulOverflow(elem_num, kBytes) == SUCCESS, FAILED,
  603. "Shape size is invalid");
  604. auto offset = static_cast<uint64_t>(elem_num * kBytes);
  605. auto hbm_raw_data_base_addr =
  606. reinterpret_cast<uint64_t>(reinterpret_cast<uintptr_t>(var_addr) + offset);
  607. for (int64_t i = elem_num - 1; i >= 0; --i) {
  608. buff[i] = hbm_raw_data_base_addr + (buff[i] - buff[0]);
  609. }
  610. }
  611. return SUCCESS;
  612. }
  613. Status HybridModelBuilder::AssignUninitializedConstantOps() {
  614. if (GetContext().GetHostExecFlag()) {
  615. GELOGI("no need to assign when exec on host.");
  616. return SUCCESS;
  617. }
  618. for (auto &it : hybrid_model_.constant_op_nodes_) {
  619. const string &var_name = it.first;
  620. const NodePtr &var_node = it.second;
  621. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  622. if (!var_manager_->IsVarExist(var_name, *tensor_desc)) {
  623. // allocate constant
  624. GELOGD("[%s] Constant not allocated during graph building. now allocate it.", var_name.c_str());
  625. GE_CHK_STATUS_RET(var_manager_->AssignVarMem(var_name, *tensor_desc, RT_MEMORY_HBM));
  626. GE_CHK_STATUS_RET(var_manager_->SetAllocatedGraphId(var_name, runtime_param_.graph_id));
  627. }
  628. }
  629. for (auto &it : hybrid_model_.device_variable_nodes_) {
  630. const string &var_name = it.first;
  631. const NodePtr &var_node = it.second;
  632. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  633. if (!var_manager_->IsVarExist(var_name, *tensor_desc)) {
  634. // allocate constant
  635. GELOGD("[%s] Constant not allocated during graph building. now allocate it.", var_name.c_str());
  636. GE_CHK_STATUS_RET(var_manager_->AssignVarMem(var_name, *tensor_desc, RT_MEMORY_HBM));
  637. GE_CHK_STATUS_RET(VarMemAssignUtil::AssignData2Fp32Var(var_node, runtime_param_.session_id))
  638. GE_CHK_STATUS_RET(var_manager_->SetAllocatedGraphId(var_name, runtime_param_.graph_id));
  639. }
  640. }
  641. return SUCCESS;
  642. }
  643. Status HybridModelBuilder::InitConstantOps() {
  644. for (auto &it : hybrid_model_.constant_op_nodes_) {
  645. const string &var_name = it.first;
  646. const NodePtr &var_node = it.second;
  647. auto op_desc = var_node->GetOpDesc();
  648. auto v_weights = ModelUtils::GetWeights(op_desc);
  649. auto *ge_tensor = const_cast<GeTensor *>(v_weights[0].get());
  650. std::unique_ptr<TensorValue> var_tensor;
  651. if (GetContext().GetHostExecFlag()) {
  652. auto buffer = ge_tensor->MutableData();
  653. GELOGD("Init tensor with host constant. size = %zu", buffer.GetSize());
  654. var_tensor.reset(new(std::nothrow)TensorValue(buffer.GetData(), buffer.GetSize()));
  655. } else {
  656. GE_CHK_STATUS_RET_NOLOG(VarNodeToTensor(var_node, var_tensor));
  657. GELOGD("Init const op tensor. name = %s, size = %ld", var_name.c_str(), var_tensor->GetSize());
  658. var_tensor->SetName("ConstOp_" + var_name);
  659. auto v_output_size = var_tensor->GetSize();
  660. auto v_output_addr = var_tensor->MutableData();
  661. if (ge_tensor->GetData().size() > 0) {
  662. GE_CHK_STATUS_RET_NOLOG(HandleDtString(*ge_tensor, v_output_addr));
  663. GELOGI("[IMAS]InitConstant memcpy graph_%u type[V] name[%s] output[%d] memaddr[%p] mem_size[%zu] datasize[%zu]",
  664. runtime_param_.graph_id, op_desc->GetName().c_str(), 0, v_output_addr, v_output_size,
  665. ge_tensor->GetData().size());
  666. GE_CHK_RT_RET(rtMemcpy(v_output_addr, v_output_size, ge_tensor->GetData().data(), ge_tensor->GetData().size(),
  667. RT_MEMCPY_HOST_TO_DEVICE));
  668. } else {
  669. GELOGI("[%s] Const op has no weight data.", op_desc->GetName().c_str());
  670. }
  671. }
  672. hybrid_model_.variable_tensors_.emplace(var_name, std::move(var_tensor));
  673. }
  674. return SUCCESS;
  675. }
  676. Status HybridModelBuilder::InitVariableTensors() {
  677. for (auto &it : hybrid_model_.device_variable_nodes_) {
  678. string var_name = it.first;
  679. NodePtr &var_node = it.second;
  680. std::unique_ptr<TensorValue> tensor;
  681. GE_CHK_STATUS_RET_NOLOG(VarNodeToTensor(var_node, tensor));
  682. GELOGD("Init variable tensor. name = %s, size = %ld, addr = %p",
  683. var_name.c_str(),
  684. tensor->GetSize(),
  685. tensor->GetData());
  686. tensor->SetName("Var_" + var_name);
  687. hybrid_model_.variable_tensors_.emplace(var_name, std::move(tensor));
  688. }
  689. for (const auto &it : hybrid_model_.host_variable_nodes_) {
  690. auto op_desc = it.second->GetOpDesc();
  691. GE_CHECK_NOTNULL(op_desc);
  692. GeTensorDesc output_tensor = op_desc->GetOutputDesc(0);
  693. int64_t tensor_size = 0;
  694. if (TensorUtils::CalcTensorMemSize(output_tensor.GetShape(), output_tensor.GetFormat(), output_tensor.GetDataType(),
  695. tensor_size) != SUCCESS) {
  696. GELOGE(INTERNAL_ERROR, "Calculate variable size failed, node name:%s", it.first.c_str());
  697. return INTERNAL_ERROR;
  698. }
  699. SharedMemInfo mem_info(it.first, tensor_size);
  700. if (HostMemManager::Instance().MallocSharedMemory(mem_info) != SUCCESS) {
  701. GELOGE(GE_GRAPH_MALLOC_FAILED, "Host variable [%s] malloc failed.", it.first.c_str());
  702. return GE_GRAPH_MALLOC_FAILED;
  703. }
  704. GELOGD("Host variable [%s] malloc success.", it.first.c_str());
  705. std::unique_ptr<TensorValue> tensor(new (std::nothrow) TensorValue(mem_info.host_address, tensor_size));
  706. hybrid_model_.variable_tensors_.emplace(it.first, std::move(tensor));
  707. }
  708. return SUCCESS;
  709. }
  710. Status HybridModelBuilder::InitWeights() {
  711. // Train do not have weight. (only got ConstOp)
  712. return SUCCESS;
  713. }
  714. Status HybridModelBuilder::LoadTasks() {
  715. for (auto &it : hybrid_model_.node_items_) {
  716. auto &node_item = it.second;
  717. auto &node_ptr = node_item->node;
  718. if (node_item->node_type == NETOUTPUT) {
  719. continue;
  720. }
  721. GELOGD("[%s] Start to build kernel task", node_ptr->GetName().c_str());
  722. auto load_ret = node_item->node_executor->LoadTask(hybrid_model_,
  723. node_ptr,
  724. node_item->kernel_task);
  725. if (load_ret != UNSUPPORTED && load_ret != SUCCESS) {
  726. GELOGE(load_ret, "[%s] Failed to load task", node_ptr->GetName().c_str());
  727. return load_ret;
  728. }
  729. GELOGD("[%s] Done loading task successfully.", node_ptr->GetName().c_str());
  730. }
  731. return SUCCESS;
  732. }
  733. Status HybridModelBuilder::LoadGeModel(ComputeGraph &sub_graph, const GeModelPtr &ge_model) {
  734. auto parent_node = sub_graph.GetParentNode();
  735. GE_CHECK_NOTNULL(parent_node);
  736. auto op_type = parent_node->GetType();
  737. if (op_type == IF || op_type == CASE || op_type == WHILE) {
  738. GELOGD("Set ge_model for control op subgraph: [%s], task_size = %d",
  739. sub_graph.GetName().c_str(),
  740. ge_model->GetModelTaskDefPtr()->task_size());
  741. subgraph_models_.emplace(sub_graph.GetName(), ge_model);
  742. } else {
  743. GELOGD("Set ge_model for subgraph: [%s], task_size = %d",
  744. sub_graph.GetName().c_str(),
  745. ge_model->GetModelTaskDefPtr()->task_size());
  746. hybrid_model_.known_shape_sub_models_.emplace(sub_graph.GetParentNode(), ge_model);
  747. }
  748. return SUCCESS;
  749. }
  750. Status HybridModelBuilder::IndexTaskDefs() {
  751. const auto &root_graph = ge_root_model_->GetRootGraph();
  752. for (auto &it : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  753. auto &name = it.first;
  754. auto &ge_model = it.second;
  755. GE_CHECK_NOTNULL(ge_model);
  756. const auto &sub_graph = root_graph->GetSubgraph(name);
  757. if (sub_graph == nullptr) {
  758. continue;
  759. }
  760. bool is_unknown_shape = sub_graph->GetGraphUnknownFlag();
  761. if (!is_unknown_shape) {
  762. GE_CHK_STATUS_RET_NOLOG(LoadGeModel(*sub_graph, ge_model));
  763. continue;
  764. }
  765. // index task defs
  766. GELOGD("To index tasks for subgraph: %s", name.c_str());
  767. unordered_map<int64_t, NodePtr> node_map;
  768. for (const auto &node : sub_graph->GetDirectNode()) {
  769. GE_CHECK_NOTNULL(node);
  770. GE_CHECK_NOTNULL(node->GetOpDesc());
  771. auto node_id = node->GetOpDesc()->GetId();
  772. GELOGD("op_index = %ld, node_name = %s", node_id, node->GetName().c_str());
  773. node_map.emplace(node_id, node);
  774. }
  775. auto tasks = ge_model->GetModelTaskDefPtr()->task();
  776. for (int i = 0; i < tasks.size(); ++i) {
  777. const domi::TaskDef &task_def = tasks[i];
  778. GELOGI("Task id = %d, task type = %d", i, task_def.type());
  779. auto task_type = static_cast<rtModelTaskType_t>(task_def.type());
  780. uint32_t op_index = -1;
  781. if (task_type == RT_MODEL_TASK_KERNEL) {
  782. op_index = task_def.kernel().context().op_index();
  783. } else if (task_type == RT_MODEL_TASK_KERNEL_EX) {
  784. op_index = task_def.kernel_ex().op_index();
  785. } else if (task_type == RT_MODEL_TASK_HCCL) {
  786. op_index = task_def.kernel_hccl().op_index();
  787. } else {
  788. GELOGD("Skip task type: %d", static_cast<int>(task_type));
  789. continue;
  790. }
  791. auto iter = node_map.find(op_index);
  792. if (iter == node_map.end()) {
  793. GELOGE(INTERNAL_ERROR, "Failed to get node by index = %u", op_index);
  794. return INTERNAL_ERROR;
  795. }
  796. auto &node = iter->second;
  797. if (task_type == RT_MODEL_TASK_KERNEL) {
  798. ge_model->GetTBEKernelStore().LoadTBEKernelBinToOpDesc(node->GetOpDesc());
  799. }
  800. GELOGD("Task loaded for node: %s, task type = %d, op_index = %u", node->GetName().c_str(), task_type, op_index);
  801. hybrid_model_.task_defs_[node].emplace_back(task_def);
  802. }
  803. }
  804. return SUCCESS;
  805. }
  806. Status HybridModelBuilder::IndexSpecialNodes() {
  807. GELOGD("Start to index special nodes");
  808. const auto &root_graph = ge_root_model_->GetRootGraph();
  809. for (auto &node : root_graph->GetAllNodes()) {
  810. GE_CHECK_NOTNULL(node);
  811. GE_CHECK_NOTNULL(node->GetOpDesc());
  812. auto op_type = node->GetType();
  813. GELOGD("node name = %s, node type = %s", node->GetName().c_str(), node->GetType().c_str());
  814. if (op_type == VARIABLE) {
  815. string placement;
  816. (void) AttrUtils::GetStr(node->GetOpDesc(), ATTR_VARIABLE_PLACEMENT, placement);
  817. if (placement == "host") {
  818. hybrid_model_.host_variable_nodes_.emplace(node->GetName(), node);
  819. } else {
  820. hybrid_model_.device_variable_nodes_.emplace(node->GetName(), node);
  821. }
  822. } else if (op_type == CONSTANTOP) {
  823. hybrid_model_.constant_op_nodes_.emplace(node->GetName(), node);
  824. } else if (op_type == DATA && node->GetOwnerComputeGraph() != root_graph) {
  825. NodePtr src_node;
  826. int peer_out_index = -1;
  827. GE_CHK_STATUS_RET_NOLOG(GetPeerNodeAcrossSubGraphs(node, src_node, peer_out_index));
  828. GELOGD("Got peer node for data node %s, peer node = %s(%s)",
  829. node->GetName().c_str(),
  830. src_node->GetName().c_str(),
  831. src_node->GetType().c_str());
  832. auto src_op_type = src_node->GetType();
  833. if (src_op_type == CONSTANTOP || src_op_type == VARIABLE) {
  834. for (auto &dst_node_and_in_anchor : node->GetOutDataNodesAndAnchors()) {
  835. auto &dst_node = dst_node_and_in_anchor.first;
  836. auto &in_anchor = dst_node_and_in_anchor.second;
  837. node_ref_inputs_[dst_node].emplace_back(std::make_pair(in_anchor->GetIdx(), src_node));
  838. }
  839. }
  840. }
  841. }
  842. return SUCCESS;
  843. }
  844. Status HybridModelBuilder::GetPeerNodeAcrossSubGraphs(const NodePtr &data_node,
  845. NodePtr &peer_node,
  846. int &peer_out_index) {
  847. auto sub_graph = data_node->GetOwnerComputeGraph();
  848. GE_CHECK_NOTNULL(sub_graph);
  849. GELOGD("To get peer node of %s::%s", sub_graph->GetName().c_str(), data_node->GetName().c_str());
  850. auto wrapped_node = data_node->GetOwnerComputeGraph()->GetParentNode();
  851. if (wrapped_node == nullptr) {
  852. GELOGE(INTERNAL_ERROR, "[%s] Node is in root graph.", data_node->GetName().c_str());
  853. return INTERNAL_ERROR;
  854. }
  855. auto data_op_desc = data_node->GetOpDesc();
  856. uint32_t parent_index = 0;
  857. if (!AttrUtils::GetInt(data_op_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  858. GELOGE(INTERNAL_ERROR,
  859. "[%s] Failed to get attr [%s]",
  860. data_op_desc->GetName().c_str(),
  861. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  862. return INTERNAL_ERROR;
  863. }
  864. auto wrapped_node_in_anchor = wrapped_node->GetInDataAnchor(parent_index);
  865. GE_CHECK_NOTNULL(wrapped_node_in_anchor);
  866. auto src_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  867. if (src_out_anchor == nullptr || src_out_anchor->GetOwnerNode() == nullptr) {
  868. GELOGE(INTERNAL_ERROR, "[%s] Parent node do not have peer anchor.", data_node->GetName().c_str());
  869. return INTERNAL_ERROR;
  870. }
  871. auto src_wrapped_node_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  872. GE_CHECK_NOTNULL(src_wrapped_node_out_anchor);
  873. auto src_wrapped_node = src_wrapped_node_out_anchor->GetOwnerNode();
  874. GE_CHECK_NOTNULL(src_wrapped_node);
  875. // connected to root-graph's DATA
  876. auto src_node_type = src_wrapped_node->GetType();
  877. if (src_node_type != PARTITIONEDCALL) {
  878. peer_node = src_wrapped_node;
  879. peer_out_index = kVarOutputIndex;
  880. GELOGD("[%s] Node is connected to root graph's node: %s",
  881. data_node->GetName().c_str(),
  882. peer_node->GetName().c_str());
  883. return SUCCESS;
  884. }
  885. auto src_graph = NodeUtils::GetSubgraph(*src_wrapped_node, kSubgraphIndex);
  886. GE_CHECK_NOTNULL(src_graph);
  887. auto src_net_output_node = src_graph->FindFirstNodeMatchType(NETOUTPUT);
  888. GE_CHK_BOOL_TRUE_EXEC_WITH_LOG(src_net_output_node == nullptr,
  889. return INTERNAL_ERROR,
  890. "Failed to find NetOutput in subgraph: %s",
  891. src_graph->GetName().c_str());
  892. auto net_output_desc = src_net_output_node->GetOpDesc();
  893. GE_CHECK_NOTNULL(net_output_desc);
  894. auto out_index = static_cast<uint32_t>(src_wrapped_node_out_anchor->GetIdx());
  895. GELOGD("src graph = %s, src parent output index = %d", src_graph->GetName().c_str(), out_index);
  896. // link src to outputs of DataNode
  897. auto input_size = net_output_desc->GetAllInputsSize();
  898. GE_CHECK_LE(input_size, UINT32_MAX);
  899. for (uint32_t i = 0; i < static_cast<uint32_t>(input_size); ++i) {
  900. uint32_t p_index = 0;
  901. if (!AttrUtils::GetInt(net_output_desc->GetInputDesc(i), ATTR_NAME_PARENT_NODE_INDEX, p_index)) {
  902. GELOGW("SubGraph: %s input tensor %u attr %s not found.",
  903. src_graph->GetName().c_str(), i, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  904. continue;
  905. }
  906. GELOGD("NetOutput's input[%u], parent_node_index = %u", i, p_index);
  907. if (p_index == out_index) {
  908. auto in_anchor = src_net_output_node->GetInDataAnchor(i);
  909. GE_CHECK_NOTNULL(in_anchor);
  910. auto peer_out_anchor = in_anchor->GetPeerOutAnchor();
  911. GE_CHECK_NOTNULL(peer_out_anchor);
  912. peer_node = peer_out_anchor->GetOwnerNode();
  913. GE_CHECK_NOTNULL(peer_node);
  914. peer_out_index = peer_out_anchor->GetIdx();
  915. GELOGD("Found peer node of Data node: %s::%s is %s::%s",
  916. sub_graph->GetName().c_str(),
  917. data_node->GetName().c_str(),
  918. src_graph->GetName().c_str(),
  919. peer_node->GetName().c_str());
  920. return SUCCESS;
  921. }
  922. }
  923. GELOGE(FAILED,
  924. "Failed to find peer node for %s::%s",
  925. sub_graph->GetName().c_str(),
  926. data_node->GetName().c_str());
  927. return FAILED;
  928. }
  929. Status HybridModelBuilder::InitRuntimeParams() {
  930. int64_t value = 0;
  931. bool ret = false;
  932. if (ge_root_model_->GetSubgraphInstanceNameToModel().empty()) {
  933. GELOGE(INTERNAL_ERROR, "Root model has no sub model");
  934. return INTERNAL_ERROR;
  935. }
  936. // session id and var size is same for every model
  937. auto first_model = ge_root_model_->GetSubgraphInstanceNameToModel().begin()->second;
  938. ret = ge::AttrUtils::GetInt(first_model, ge::MODEL_ATTR_SESSION_ID, value);
  939. runtime_param_.session_id = ret ? static_cast<uint64_t>(value) : 0;
  940. ret = ge::AttrUtils::GetInt(first_model, ATTR_MODEL_TASK_GEN_VAR_ADDR, value);
  941. runtime_param_.logic_var_base = ret ? static_cast<uint64_t>(value) : 0;
  942. runtime_param_.graph_id = ge_root_model_->GetRootGraph()->GetGraphID();
  943. value = 0;
  944. for (auto &it : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  945. (void) ge::AttrUtils::GetInt(it.second, ATTR_MODEL_VAR_SIZE, value);
  946. if (value > 0) {
  947. runtime_param_.var_size = static_cast<uint64_t>(value);
  948. break;
  949. }
  950. }
  951. GELOGI("InitRuntimeParams(), session_id:%lu, var_size:%lu. graph_id = %u",
  952. runtime_param_.session_id, runtime_param_.var_size, runtime_param_.graph_id);
  953. var_manager_ = VarManager::Instance(runtime_param_.session_id);
  954. GE_CHECK_NOTNULL(var_manager_);
  955. return SUCCESS;
  956. }
  957. Status HybridModelBuilder::IdentifyVariableOutputs(NodeItem &node_item) {
  958. GELOGD("Start to parse outputs of node: %s", node_item.NodeName().c_str());
  959. auto subgraph = NodeUtils::GetSubgraph(*node_item.node, kSubgraphIndex);
  960. GE_CHECK_NOTNULL(subgraph);
  961. auto net_output_node = subgraph->FindFirstNodeMatchType(NETOUTPUT);
  962. if (net_output_node == nullptr) {
  963. GELOGD("[%s] Subgraph do not got net output", subgraph->GetName().c_str());
  964. return SUCCESS;
  965. }
  966. auto net_output_desc = net_output_node->GetOpDesc();
  967. GE_CHECK_NOTNULL(net_output_desc);
  968. // constant/variable connected to net output
  969. for (const auto &in_data_anchor : net_output_node->GetAllInDataAnchors()) {
  970. auto src_node = GetPeerNode(in_data_anchor);
  971. GE_CHECK_NOTNULL(src_node);
  972. auto src_op_type = src_node->GetType();
  973. GELOGD("Node %s, output %d, src node = %s, src node type = %s",
  974. node_item.NodeName().c_str(),
  975. in_data_anchor->GetIdx(),
  976. src_node->GetName().c_str(),
  977. src_op_type.c_str());
  978. if (src_op_type != CONSTANTOP && src_op_type != VARIABLE) {
  979. continue;
  980. }
  981. uint32_t parent_index = 0;
  982. GE_CHK_STATUS_RET_NOLOG(GetParentNodeOutputIndex(*net_output_desc, in_data_anchor->GetIdx(), parent_index));
  983. GELOGD("Got parent output index = %u", parent_index);
  984. node_item.ref_outputs.emplace(parent_index, src_node);
  985. }
  986. // Data nodes marked with REF_VAR_SRC_VAR_NAME
  987. // Using variable tensor as data's output
  988. for (auto &node : subgraph->GetDirectNode()) {
  989. if (node->GetType() != DATA) {
  990. continue;
  991. }
  992. string ref_var_name;
  993. (void) AttrUtils::GetStr(node->GetOpDesc(), REF_VAR_SRC_VAR_NAME, ref_var_name);
  994. if (ref_var_name.empty()) {
  995. continue;
  996. }
  997. GELOGD("Data node ref to variable: %s", ref_var_name.c_str());
  998. NodePtr src_node;
  999. auto var_node = hybrid_model_.GetVariableNode(ref_var_name);
  1000. GE_CHECK_NOTNULL(var_node);
  1001. GELOGD("Found var node [%s] by ref_var_name [%s]", var_node->GetName().c_str(), ref_var_name.c_str());
  1002. int peer_output_index = -1;
  1003. GE_CHK_STATUS_RET_NOLOG(GetPeerNodeAcrossSubGraphs(node, src_node, peer_output_index));
  1004. auto src_node_item = MutableNodeItem(src_node);
  1005. GE_CHECK_NOTNULL(src_node_item);
  1006. src_node_item->ref_outputs.emplace(peer_output_index, var_node);
  1007. }
  1008. return SUCCESS;
  1009. }
  1010. NodePtr HybridModelBuilder::GetPeerNode(const InDataAnchorPtr &in_data_anchor) {
  1011. auto peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  1012. if (peer_out_anchor != nullptr) {
  1013. return peer_out_anchor->GetOwnerNode();
  1014. }
  1015. return nullptr;
  1016. }
  1017. Status HybridModelBuilder::GetParentNodeOutputIndex(const OpDesc &op_desc, int index, uint32_t &out_index) {
  1018. auto input_desc = op_desc.MutableInputDesc(index);
  1019. GE_CHECK_NOTNULL(input_desc);
  1020. if (!AttrUtils::GetInt(input_desc, ATTR_NAME_PARENT_NODE_INDEX, out_index)) {
  1021. GELOGE(INTERNAL_ERROR, "NetOutput input tensor %d, attr %s not found.",
  1022. index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1023. return INTERNAL_ERROR;
  1024. }
  1025. return SUCCESS;
  1026. }
  1027. Status HybridModelBuilder::InitModelMem() {
  1028. hybrid_model_.var_mem_base_ = var_manager_->GetVarMemoryBase(RT_MEMORY_HBM);
  1029. auto total_var_size = hybrid_model_.TotalVarMemSize();
  1030. if (total_var_size == 0 && !hybrid_model_.constant_op_nodes_.empty()) {
  1031. total_var_size = var_manager_->GetVarMemSize(RT_MEMORY_HBM) > 0 ? var_manager_->GetVarMemMaxSize() : 0;
  1032. GELOGD("Model var size = 0. but got uninitialized constant. set var size to %zu.", total_var_size);
  1033. }
  1034. if (total_var_size > 0 && hybrid_model_.var_mem_base_ == nullptr) {
  1035. GE_CHK_STATUS_RET(var_manager_->MallocVarMemory(total_var_size),
  1036. "Malloc Var Memory Fail.");
  1037. hybrid_model_.var_mem_base_ = var_manager_->GetVarMemoryBase(RT_MEMORY_HBM);
  1038. }
  1039. runtime_param_.var_base = hybrid_model_.var_mem_base_;
  1040. return SUCCESS;
  1041. }
  1042. Status HybridModelBuilder::TransAllVarData() {
  1043. GELOGI("TransAllVarData start: session_id:%lu, graph_id: %u.", runtime_param_.session_id, runtime_param_.graph_id);
  1044. rtContext_t ctx = nullptr;
  1045. rtError_t rt_ret = rtCtxGetCurrent(&ctx);
  1046. if (rt_ret != RT_ERROR_NONE) {
  1047. GELOGE(RT_FAILED, "Failed to get current context, error_code is: 0x%X.", rt_ret);
  1048. return RT_FAILED;
  1049. }
  1050. std::vector<NodePtr> variable_node_list;
  1051. for (auto &it : hybrid_model_.device_variable_nodes_) {
  1052. variable_node_list.emplace_back(it.second);
  1053. GELOGD("[%s] added for trans var data", it.first.c_str());
  1054. }
  1055. GE_CHK_STATUS_RET(TransVarDataUtils::TransAllVarData(variable_node_list,
  1056. runtime_param_.session_id,
  1057. ctx,
  1058. runtime_param_.graph_id),
  1059. "TransAllVarData failed.");
  1060. GELOGI("TransAllVarData success.");
  1061. return SUCCESS;
  1062. }
  1063. Status HybridModelBuilder::CopyVarData() {
  1064. GE_CHK_STATUS_RET(TransVarDataUtils::CopyVarData(ge_root_model_->GetRootGraph(),
  1065. runtime_param_.session_id,
  1066. hybrid_model_.device_id_),
  1067. "CopyVarData failed.");
  1068. GELOGI("CopyVarData success.");
  1069. return SUCCESS;
  1070. }
  1071. Status HybridModelBuilder::LoadKnownShapedSubgraph(ComputeGraph &graph, NodeItem *parent_node_item) {
  1072. GELOGD("Start to load known shaped subgraph [%s]", graph.GetName().c_str());
  1073. auto graph_item = std::unique_ptr<GraphItem>(new(std::nothrow)GraphItem());
  1074. GE_CHECK_NOTNULL(graph_item);
  1075. graph_item->is_dynamic_ = false;
  1076. auto subgraph_name = graph.GetName();
  1077. auto wrapper_op_desc = MakeShared<OpDesc>(subgraph_name + "_partitioned_call", PARTITIONEDCALL);
  1078. GE_CHECK_NOTNULL(wrapper_op_desc);
  1079. for (auto &node : graph.GetDirectNode()) {
  1080. GE_CHECK_NOTNULL(node);
  1081. auto op_desc = node->GetOpDesc();
  1082. GE_CHECK_NOTNULL(op_desc);
  1083. const auto &op_type = node->GetType();
  1084. if (op_type == DATA) {
  1085. int32_t data_index = 0;
  1086. if (!AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1087. GELOGE(FAILED,
  1088. "[%s] Failed to get attr [%s]",
  1089. node->GetName().c_str(),
  1090. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1091. return FAILED;
  1092. }
  1093. (void) wrapper_op_desc->AddInputDesc(op_desc->GetInputDesc(0));
  1094. graph_item->input_index_mapping_.emplace_back(data_index);
  1095. } else if (op_type == NETOUTPUT) {
  1096. int output_index = 0;
  1097. for (const auto &output_desc : op_desc->GetAllInputsDescPtr()) {
  1098. int32_t data_index = output_index++;
  1099. if (!AttrUtils::GetInt(output_desc, ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1100. GELOGI("[%s] Failed to get attr [%s]", node->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1101. }
  1102. GE_CHK_GRAPH_STATUS_RET(wrapper_op_desc->AddOutputDesc(*output_desc),
  1103. "[%s] Failed to add output desc. output index = %d",
  1104. graph.GetName().c_str(),
  1105. output_index);
  1106. graph_item->output_index_mapping_.emplace_back(data_index);
  1107. }
  1108. }
  1109. }
  1110. auto temp_graph = MakeShared<ComputeGraph>("temp");
  1111. GE_CHECK_NOTNULL(temp_graph);
  1112. auto wrapper_node = temp_graph->AddNode(wrapper_op_desc);
  1113. GeModelPtr ge_model = subgraph_models_[subgraph_name];
  1114. GE_CHECK_NOTNULL(ge_model);
  1115. hybrid_model_.known_shape_sub_models_.emplace(wrapper_node, ge_model);
  1116. NodeItem *node_item = nullptr;
  1117. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(wrapper_node, &node_item));
  1118. node_item->input_start = 0;
  1119. node_item->output_start = 0;
  1120. node_item->outputs.resize(node_item->num_outputs);
  1121. graph_item->node_items_.emplace_back(node_item);
  1122. graph_item->output_node_ = node_item;
  1123. graph_item->total_inputs_ = node_item->num_inputs;
  1124. graph_item->total_outputs_ = node_item->num_outputs;
  1125. GELOGD("NodeItem create for known shape subgraph [%s], NodeItem = %s",
  1126. graph.GetName().c_str(),
  1127. node_item->DebugString().c_str());
  1128. GELOGD("Done parse known shape subgraph successfully. graph = [%s]", graph.GetName().c_str());
  1129. graph_item->SetName(graph.GetName());
  1130. GELOGD("Done loading known shape subgraph: [%s]", graph_item->GetName().c_str());
  1131. hybrid_model_.subgraph_items_.emplace(graph.GetName(), std::move(graph_item));
  1132. return SUCCESS;
  1133. }
  1134. Status HybridModelBuilder::LoadDynamicSubgraph(ComputeGraph &graph, bool is_root_graph) {
  1135. GELOGD("Start to load subgraph [%s]", graph.GetName().c_str());
  1136. // for known partitioned call, load all nodes
  1137. auto graph_item = std::unique_ptr<GraphItem>(new(std::nothrow)GraphItem());
  1138. GE_CHECK_NOTNULL(graph_item);
  1139. graph_item->is_dynamic_ = true;
  1140. graph_item->node_items_.reserve(graph.GetDirectNodesSize());
  1141. int input_start = 0;
  1142. int output_start = 0;
  1143. std::vector<NodeItem *> data_nodes;
  1144. for (auto &node : graph.GetDirectNode()) {
  1145. GE_CHECK_NOTNULL(node);
  1146. GE_CHECK_NOTNULL(node->GetOpDesc());
  1147. const auto &op_type = node->GetType();
  1148. NodeItem *node_item = nullptr;
  1149. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(node, &node_item));
  1150. GE_CHK_STATUS_RET_NOLOG(BuildNodeItem(node, *node_item));
  1151. GE_CHK_STATUS_RET_NOLOG(UpdateAnchorStatus(node)); // needed by FE generate task
  1152. node_item->input_start = input_start;
  1153. node_item->output_start = output_start;
  1154. input_start += node_item->num_inputs;
  1155. output_start += node_item->num_outputs;
  1156. if (op_type == DATA_TYPE || op_type == AIPP_DATA_TYPE) {
  1157. data_nodes.emplace_back(node_item);
  1158. } else if (op_type == NETOUTPUT) {
  1159. graph_item->output_node_ = node_item;
  1160. GE_CHK_STATUS_RET_NOLOG(BuildOutputMapping(*graph_item, *node_item, is_root_graph));
  1161. }
  1162. graph_item->node_items_.emplace_back(node_item);
  1163. // parse var outputs
  1164. GE_CHK_STATUS_RET_NOLOG(ParseVarOutputs(*node_item));
  1165. GELOGD("NodeItem created: %s", node_item->DebugString().c_str());
  1166. }
  1167. graph_item->total_inputs_ = input_start;
  1168. graph_item->total_outputs_ = output_start;
  1169. GE_CHK_STATUS_RET_NOLOG(BuildInputMapping(*graph_item, data_nodes, is_root_graph));
  1170. if (is_root_graph) {
  1171. graph_item->SetName("Root-Graph");
  1172. GELOGD("Done loading dynamic subgraph: [%s]", graph_item->GetName().c_str());
  1173. hybrid_model_.root_graph_item_ = std::move(graph_item);
  1174. } else {
  1175. graph_item->SetName(graph.GetName());
  1176. GELOGD("Done loading dynamic subgraph: [%s]", graph_item->GetName().c_str());
  1177. hybrid_model_.subgraph_items_.emplace(graph.GetName(), std::move(graph_item));
  1178. }
  1179. return SUCCESS;
  1180. }
  1181. Status HybridModelBuilder::ParseVarOutputs(NodeItem &node_item) {
  1182. for (int i = 0; i < node_item.num_outputs; ++i) {
  1183. auto output_tensor_desc = node_item.op_desc->GetOutputDesc(i);
  1184. std::string var_name;
  1185. (void) AttrUtils::GetStr(output_tensor_desc, ASSIGN_VAR_NAME, var_name);
  1186. if (!var_name.empty()) {
  1187. auto var_node = hybrid_model_.GetVariableNode(var_name);
  1188. GE_CHECK_NOTNULL(var_node);
  1189. node_item.ref_outputs.emplace(i, var_node);
  1190. }
  1191. }
  1192. return SUCCESS;
  1193. }
  1194. Status HybridModelBuilder::BuildInputMapping(GraphItem &graph_item,
  1195. vector<NodeItem *> &data_nodes,
  1196. bool is_root_graph) {
  1197. uint32_t data_op_index = 0;
  1198. for (auto &node_item : data_nodes) {
  1199. auto node = node_item->node;
  1200. int data_index = data_op_index;
  1201. if (is_root_graph) {
  1202. if (AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_INDEX, data_index)) {
  1203. GELOGI("ge_train: get new index %u, old %u", data_index, data_op_index);
  1204. }
  1205. data_op_index++;
  1206. } else {
  1207. if (!AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1208. GELOGE(FAILED,
  1209. "[%s] Failed to get attr [%s]",
  1210. node->GetName().c_str(),
  1211. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1212. return FAILED;
  1213. }
  1214. }
  1215. if (graph_item.input_nodes_.size() <= static_cast<size_t>(data_index)) {
  1216. graph_item.input_nodes_.resize(data_index + 1);
  1217. }
  1218. graph_item.input_nodes_[data_index] = node_item;
  1219. }
  1220. return SUCCESS;
  1221. }
  1222. } // namespace hybrid
  1223. } // namespace ge

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