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

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

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