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

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