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

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
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
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020
  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/model_manager/model_utils.h"
  23. #include "graph/load/model_manager/model_manager.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/manager/graph_mem_allocator.h"
  28. #include "graph/manager/host_mem_allocator.h"
  29. #include "graph/utils/graph_utils.h"
  30. #include "hybrid/common/npu_memory_allocator.h"
  31. #include "hybrid/node_executor/node_executor.h"
  32. namespace ge {
  33. namespace hybrid {
  34. using domi::LogTimeStampDef;
  35. using domi::TaskDef;
  36. namespace {
  37. const uint32_t kSubgraphIndex = 0U;
  38. const uint32_t kVarOutputIndex = 0U;
  39. const uint64_t kProfilingFpStartLogid = 1U;
  40. const uint64_t kProfilingBpEndLogid = 2U;
  41. const uint64_t kProfilingIterEndLogid = 65535U;
  42. const int kBytes = 8;
  43. const uint32_t kStringHeadElems = 2;
  44. const char *const kOwnerGraphIsUnknown = "OwnerGraphIsUnknown";
  45. const char *const kProfilingGraph = "ProfilingGraph";
  46. const char *const kProfilingFpNode = "ProfilingFpNode";
  47. const char *const kProfilingBpNode = "ProfilingBpNode";
  48. const char *const kProfilingEndNode = "ProfilingEndNode";
  49. const char *const kProfilingArNode = "ProfilingAllReduceNode";
  50. const char *const kEngineNameRts = "DNN_VM_RTS_OP_STORE";
  51. const char *const kForceInfershape = "_force_infershape_when_running";
  52. Status SetOutputNameAttr(ComputeGraph &graph) {
  53. vector<string> output_names;
  54. for (const auto &node : graph.GetDirectNode()) {
  55. auto op_desc = node->GetOpDesc();
  56. if (op_desc == nullptr) {
  57. continue;
  58. }
  59. auto op_type = op_desc->GetType();
  60. if (op_type == NETOUTPUT) {
  61. for (InDataAnchorPtr &in_data_anchor : node->GetAllInDataAnchors()) {
  62. const OutDataAnchorPtr &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  63. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  64. NodePtr in_node = peer_out_anchor->GetOwnerNode();
  65. GE_CHECK_NOTNULL(in_node);
  66. output_names.push_back(in_node->GetName());
  67. }
  68. }
  69. }
  70. GE_CHK_BOOL_EXEC(ge::AttrUtils::SetListStr(&graph, ATTR_MODEL_OUT_NODES_NAME, output_names),
  71. GELOGE(FAILED, "SetListStr of ATTR_MODEL_OUT_NODES_NAME failed.");
  72. return FAILED);
  73. return SUCCESS;
  74. }
  75. int64_t CalcVarSizeInBytes(const GeTensorDesc &desc) {
  76. int64_t var_size = 0;
  77. auto data_type = desc.GetDataType();
  78. if (data_type == DT_STRING) {
  79. (void) TensorUtils::GetSize(desc, var_size);
  80. return var_size;
  81. }
  82. if (TensorUtils::GetTensorMemorySizeInBytes(desc, var_size) != GRAPH_SUCCESS) {
  83. GELOGW("Failed to calc var data size");
  84. return -1;
  85. }
  86. return var_size;
  87. }
  88. Status CollectDependenciesForFusedGraph(NodeItem &node_item, std::set<OpDesc *> &data_ops) {
  89. for (const auto &node : node_item.fused_subgraph->nodes) {
  90. auto op_desc = node->GetOpDesc();
  91. GE_CHECK_NOTNULL(op_desc);
  92. const auto &depends = op_desc->GetOpInferDepends();
  93. if (depends.empty()) {
  94. continue;
  95. }
  96. for (auto &input_name : depends) {
  97. auto input_index = op_desc->GetInputIndexByName(input_name);
  98. auto src_node = NodeUtils::GetInDataNodeByIndex(*node, input_index);
  99. GE_CHECK_NOTNULL(src_node);
  100. auto src_op_desc = src_node->GetOpDesc();
  101. GE_CHECK_NOTNULL(src_op_desc);
  102. if (src_node->GetType() != DATA_TYPE) {
  103. GELOGE(UNSUPPORTED,
  104. "[%s::%s] Node in fused subgraph can only depend on Data nodes, but depend on %s",
  105. node_item.NodeName().c_str(),
  106. node->GetName().c_str(),
  107. src_node->GetType().c_str());
  108. return UNSUPPORTED;
  109. }
  110. data_ops.emplace(src_op_desc.get());
  111. }
  112. }
  113. return SUCCESS;
  114. }
  115. } // namespace
  116. HybridModelBuilder::HybridModelBuilder(HybridModel &hybrid_model)
  117. : hybrid_model_(hybrid_model), runtime_param_(hybrid_model.root_runtime_param_) {
  118. ge_root_model_ = hybrid_model_.ge_root_model_;
  119. }
  120. Status HybridModelBuilder::Build() {
  121. GE_CHK_STATUS_RET(ValidateParams(), "Failed to validate GeRootModel");
  122. hybrid_model_.model_name_ = ge_root_model_->GetRootGraph()->GetName();
  123. GELOGI("[%s] Start to build hybrid model.", GetGraphName());
  124. GE_CHK_STATUS_RET(InitRuntimeParams(), "[%s] Failed to InitRuntimeParams", GetGraphName());
  125. GE_CHK_STATUS_RET(RecoverGraphUnknownFlag(), "[%s] Failed to RecoverGraphUnknownFlag", GetGraphName());
  126. GE_CHK_STATUS_RET(IndexSpecialNodes(), "[%s] Failed to index nodes", GetGraphName());
  127. GE_CHK_STATUS_RET(IndexTaskDefs(), "[%s] Failed to index task defs", GetGraphName());
  128. GE_CHK_STATUS_RET(LoadGraph(), "[%s] Failed to load graph", GetGraphName());
  129. GE_CHK_STATUS_RET(AssignUninitializedConstantOps(), "[%s] Failed to assign uninitialized constants", GetGraphName());
  130. GE_CHK_STATUS_RET(TransAllVarData(), "[%s] Failed to trans all var data", GetGraphName());
  131. GE_CHK_STATUS_RET(CopyVarData(), "[%s] Failed to copy var data", GetGraphName());
  132. GE_CHK_STATUS_RET(InitModelMem(), "[%s] Failed to init memory", GetGraphName());
  133. GE_CHK_STATUS_RET(InitWeights(), "[%s] Failed to init weights", GetGraphName());
  134. GE_CHK_STATUS_RET(InitConstantOps(), "[%s] Failed to init constant op", GetGraphName());
  135. GE_CHK_STATUS_RET(InitVariableTensors(), "[%s] Failed to init variables", GetGraphName());
  136. GE_CHK_STATUS_RET(LoadTasks(), "[%s] Failed to load tasks", GetGraphName());
  137. GELOGI("[%s] Done building hybrid model successfully.", GetGraphName());
  138. return SUCCESS;
  139. }
  140. Status HybridModelBuilder::BuildForSingleOp() {
  141. GE_CHK_STATUS_RET(ValidateParams(), "Failed to validate GeRootModel");
  142. hybrid_model_.model_name_ = ge_root_model_->GetRootGraph()->GetName();
  143. GELOGI("[%s] Start to build hybrid model.", GetGraphName());
  144. auto ret = ge_root_model_->GetSubgraphInstanceNameToModel();
  145. const GeModelPtr ge_model = ret[ge_root_model_->GetRootGraph()->GetName()];
  146. GE_CHK_STATUS_RET(IndexTaskDefs(ge_root_model_->GetRootGraph(), ge_model),
  147. "[%s] Failed to index task defs", GetGraphName());
  148. GE_CHK_STATUS_RET(LoadGraph(), "[%s] Failed to load graph", GetGraphName());
  149. GE_CHK_STATUS_RET(InitWeights(), "[%s] Failed to init weights", GetGraphName());
  150. GE_CHK_STATUS_RET(LoadTasks(), "[%s] Failed to load tasks", GetGraphName());
  151. GELOGI("[%s] Done building hybrid model for single op successfully.", GetGraphName());
  152. return SUCCESS;
  153. }
  154. Status HybridModelBuilder::ValidateParams() {
  155. GE_CHECK_NOTNULL(ge_root_model_);
  156. GE_CHECK_NOTNULL(ge_root_model_->GetRootGraph());
  157. return SUCCESS;
  158. }
  159. Status HybridModelBuilder::BuildNodeItem(const NodePtr &node, NodeItem &node_item) {
  160. auto op_desc = node->GetOpDesc();
  161. GE_CHK_STATUS_RET(ParseForceInfershapeNodes(node, node_item),
  162. "[%s] Failed to parse force_infershape node.",
  163. node_item.NodeName().c_str());
  164. vector<string> dependencies = node->GetOpDesc()->GetOpInferDepends();
  165. GE_CHK_STATUS_RET(ParseDependentInputNodes(node_item, dependencies),
  166. "[%s] Failed to parse node dependencies.",
  167. node_item.NodeName().c_str());
  168. node_item.outputs.resize(node_item.num_outputs);
  169. for (int i = 0; i < node_item.num_outputs; ++i) {
  170. auto out_data_anchor = node->GetOutDataAnchor(i);
  171. if (out_data_anchor == nullptr) {
  172. GELOGE(INTERNAL_ERROR, "out anchor[%d] of node %s is nullptr", i, node->GetName().c_str());
  173. return INTERNAL_ERROR;
  174. }
  175. for (auto &dst_in_anchor: out_data_anchor->GetPeerInDataAnchors()) {
  176. auto dst_node = dst_in_anchor->GetOwnerNode();
  177. if (dst_node == nullptr) {
  178. GELOGW("dst node is nullptr. out anchor = %d", out_data_anchor->GetIdx());
  179. continue;
  180. }
  181. NodeItem *dst_node_item = nullptr;
  182. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  183. "[%s] Failed to get or create node item.",
  184. dst_node->GetName().c_str());
  185. int canonical_index;
  186. GE_CHK_STATUS_RET(dst_node_item->GetCanonicalInputIndex(dst_in_anchor->GetIdx(), canonical_index),
  187. "[%s] Failed to canonical input index",
  188. dst_node->GetName().c_str());
  189. node_item.outputs[i].emplace_back(canonical_index, dst_node_item);
  190. }
  191. }
  192. GE_CHK_STATUS_RET_NOLOG(ResolveRefIo(node_item));
  193. return SUCCESS;
  194. }
  195. Status HybridModelBuilder::ResolveRefIo(NodeItem &node_item) {
  196. bool is_ref = false;
  197. auto &op_desc = *node_item.op_desc;
  198. (void) AttrUtils::GetBool(op_desc, ATTR_NAME_REFERENCE, is_ref);
  199. if (!is_ref) {
  200. return SUCCESS;
  201. }
  202. auto inputs = op_desc.GetAllInputName();
  203. auto outputs = op_desc.GetAllOutputName();
  204. for (auto &output : outputs) {
  205. for (auto &input : inputs) {
  206. if (input.first == output.first) {
  207. int input_idx;
  208. GE_CHK_STATUS_RET_NOLOG(node_item.GetCanonicalInputIndex(input.second, input_idx));
  209. auto output_idx = static_cast<int>(output.second);
  210. node_item.reuse_inputs[output_idx] = input_idx;
  211. GELOGD("[%s] Output[%d] reuse input[%d]", node_item.NodeName().c_str(), output_idx, input_idx);
  212. }
  213. }
  214. }
  215. return SUCCESS;
  216. }
  217. Status HybridModelBuilder::GetOrCreateNodeItem(const NodePtr &node, NodeItem **node_item) {
  218. auto &node_items = hybrid_model_.node_items_;
  219. auto it = node_items.find(node);
  220. if (it != node_items.end()) {
  221. *node_item = it->second.get();
  222. return SUCCESS;
  223. }
  224. std::unique_ptr<NodeItem> new_node;
  225. GE_CHK_STATUS_RET(NodeItem::Create(node, new_node), "Failed to create node item");
  226. GE_CHK_STATUS_RET_NOLOG(NodeExecutorManager::GetInstance().GetExecutor(*node, &new_node->node_executor));
  227. // we do not need L2 Buffer
  228. const char *const kIsFirstNode = "is_first_node";
  229. const char *const kIsLastNode = "is_last_node";
  230. (void) AttrUtils::SetBool(new_node->op_desc, kIsFirstNode, false);
  231. (void) AttrUtils::SetBool(new_node->op_desc, kIsLastNode, false);
  232. new_node->node_id = node_index;
  233. new_node->op_desc->SetId(node_index);
  234. node_index += 1;
  235. NodeExecutorManager::ExecutorType executor_type = NodeExecutorManager::GetInstance().ResolveExecutorType(*node);
  236. new_node->is_profiling_report = (executor_type == NodeExecutorManager::ExecutorType::AICORE) ||
  237. (executor_type == NodeExecutorManager::ExecutorType::AICPU_TF) ||
  238. (executor_type == NodeExecutorManager::ExecutorType::AICPU_CUSTOM);
  239. *node_item = new_node.get();
  240. node_items[node] = std::move(new_node);
  241. return SUCCESS;
  242. }
  243. Status HybridModelBuilder::ParseForceInfershapeNodes(const NodePtr &node, NodeItem &node_item) {
  244. auto op_desc = node->GetOpDesc();
  245. GE_CHECK_NOTNULL(op_desc);
  246. // not care result, if no this attr, stand for the op does not need force infershape
  247. (void)AttrUtils::GetBool(op_desc, kForceInfershape, node_item.is_need_force_infershape);
  248. GELOGD("node [%s] is need do infershape , flag is %d",
  249. op_desc->GetName().c_str(),
  250. node_item.is_need_force_infershape);
  251. return SUCCESS;
  252. }
  253. Status HybridModelBuilder::ParseDependentInputNodes(NodeItem &node_item, const std::vector<string> &dependencies) {
  254. std::set<NodePtr> dependent_input_nodes;
  255. auto &ge_node = node_item.node;
  256. bool is_hccl_op =
  257. NodeExecutorManager::GetInstance().ResolveExecutorType(*ge_node) == NodeExecutorManager::ExecutorType::HCCL;
  258. // The input tensors become valid after computation is done for parent nodes of type DEPEND_COMPUTE.
  259. // Wait for these parent nodes before execution.
  260. for (const auto &in_anchor : ge_node->GetAllInDataAnchors()) {
  261. const auto &peer_anchor = in_anchor->GetPeerOutAnchor();
  262. if (peer_anchor == nullptr) {
  263. GELOGD("[%s] Input[%d] do not have peer anchor", node_item.NodeName().c_str(), in_anchor->GetIdx());
  264. continue;
  265. }
  266. auto src_node = peer_anchor->GetOwnerNode();
  267. GE_CHECK_NOTNULL(src_node);
  268. auto src_node_item = MutableNodeItem(src_node);
  269. GE_CHECK_NOTNULL(src_node_item);
  270. if (is_hccl_op) {
  271. GELOGD("[%s] Add input data dependent node [%s] due to engine type is HCCL",
  272. node_item.NodeName().c_str(),
  273. src_node_item->NodeName().c_str());
  274. src_node_item->has_observer = true;
  275. node_item.dependents_for_execution.emplace_back(src_node);
  276. node_item.has_observer = true;
  277. for (auto &dst_node : ge_node->GetOutNodes()) {
  278. if (dst_node == nullptr) {
  279. continue;
  280. }
  281. NodeItem *dst_node_item = nullptr;
  282. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(dst_node, &dst_node_item));
  283. dst_node_item->dependents_for_execution.emplace_back(ge_node);
  284. }
  285. } else if (src_node_item->shape_inference_type == DEPEND_COMPUTE) {
  286. GELOGD("[%s] Add input data dependent node [%s] due to inference type = DEPEND_COMPUTE",
  287. node_item.NodeName().c_str(),
  288. src_node_item->NodeName().c_str());
  289. src_node_item->has_observer = true;
  290. node_item.dependents_for_execution.emplace_back(src_node);
  291. }
  292. if (src_node_item->shape_inference_type == DEPEND_SHAPE_RANGE) {
  293. GELOGD("[%s] Add input shape dependent node [%s] due to inference type = DEPEND_SHAPE_RANGE",
  294. node_item.NodeName().c_str(),
  295. src_node_item->NodeName().c_str());
  296. src_node_item->has_observer = true;
  297. dependent_input_nodes.emplace(src_node);
  298. }
  299. }
  300. // cond or branch need to be prepared before the execution of IF or CASE
  301. if (node_item.node_type == IF || node_item.node_type == STATELESSIF || node_item.node_type == CASE) {
  302. const auto &in_anchor = ge_node->GetInDataAnchor(0);
  303. GE_CHECK_NOTNULL(in_anchor);
  304. const auto &peer_anchor = in_anchor->GetPeerOutAnchor();
  305. GE_CHECK_NOTNULL(peer_anchor);
  306. auto src_node = peer_anchor->GetOwnerNode();
  307. GE_CHECK_NOTNULL(src_node);
  308. auto src_node_item = MutableNodeItem(src_node);
  309. GE_CHECK_NOTNULL(src_node_item);
  310. src_node_item->has_observer = true;
  311. node_item.dependents_for_execution.emplace_back(src_node);
  312. GELOGD("[%s] Dependent added from %s for control op's cond/branch",
  313. node_item.NodeName().c_str(),
  314. src_node_item->NodeName().c_str());
  315. }
  316. for (const auto &input_name : dependencies) {
  317. int input_index = node_item.op_desc->GetInputIndexByName(input_name);
  318. if (input_index < 0) {
  319. GELOGE(INTERNAL_ERROR,
  320. "[%s] Failed to get input index by name: %s",
  321. node_item.NodeName().c_str(),
  322. input_name.c_str());
  323. return INTERNAL_ERROR;
  324. }
  325. const auto &in_anchor = ge_node->GetInDataAnchor(input_index);
  326. GE_CHECK_NOTNULL(in_anchor);
  327. const auto &peer_out_anchor = in_anchor->GetPeerOutAnchor();
  328. GE_CHECK_NOTNULL(peer_out_anchor);
  329. const auto &src_node = peer_out_anchor->GetOwnerNode();
  330. GE_CHECK_NOTNULL(src_node);
  331. auto src_node_item = MutableNodeItem(src_node);
  332. src_node_item->to_const_output_id_list.emplace(peer_out_anchor->GetIdx());
  333. src_node_item->has_observer = true;
  334. dependent_input_nodes.emplace(src_node);
  335. GELOGD("[%s] Dependent added from output of [%s:%d]",
  336. node_item.NodeName().c_str(),
  337. src_node_item->NodeName().c_str(),
  338. peer_out_anchor->GetIdx());
  339. }
  340. for (const auto &dep_node : dependent_input_nodes) {
  341. node_item.dependents_for_shape_inference.emplace_back(dep_node);
  342. }
  343. GE_CHK_STATUS_RET(ParseDependentForFusedSubgraph(node_item));
  344. return SUCCESS;
  345. }
  346. Status HybridModelBuilder::ParseDependentForFusedSubgraph(NodeItem &node_item) {
  347. if (node_item.fused_subgraph == nullptr) {
  348. return SUCCESS;
  349. }
  350. std::set<OpDesc *> data_ops;
  351. GE_CHK_STATUS_RET_NOLOG(CollectDependenciesForFusedGraph(node_item, data_ops));
  352. for (auto &op_desc : data_ops) {
  353. uint32_t parent_index = 0;
  354. if (!AttrUtils::GetInt(*op_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  355. GELOGE(INTERNAL_ERROR,
  356. "[%s] Failed to get attr [%s]",
  357. op_desc->GetName().c_str(),
  358. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  359. return INTERNAL_ERROR;
  360. }
  361. const auto &in_anchor = node_item.node->GetInDataAnchor(parent_index);
  362. GE_CHECK_NOTNULL(in_anchor);
  363. const auto &peer_out_anchor = in_anchor->GetPeerOutAnchor();
  364. GE_CHECK_NOTNULL(peer_out_anchor);
  365. const auto &src_node = peer_out_anchor->GetOwnerNode();
  366. GE_CHECK_NOTNULL(src_node);
  367. NodeItem *src_node_item = nullptr;
  368. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(src_node, &src_node_item));
  369. op_desc->SetId(src_node_item->op_desc->GetId());
  370. GELOGD("[%s::%s] Node id was set to that of outer src node's, src_node = %s",
  371. node_item.NodeName().c_str(),
  372. op_desc->GetName().c_str(),
  373. src_node_item->NodeName().c_str());
  374. src_node_item->has_observer = true;
  375. src_node_item->to_const_output_id_list.emplace(peer_out_anchor->GetIdx());
  376. auto &depends = node_item.dependents_for_shape_inference;
  377. if (std::find(depends.begin(), depends.end(), src_node) == depends.end()) {
  378. depends.emplace_back(src_node);
  379. GELOGD("[%s] Dependent added from output of [%s:%d]",
  380. node_item.NodeName().c_str(),
  381. src_node_item->NodeName().c_str(),
  382. peer_out_anchor->GetIdx());
  383. }
  384. }
  385. return SUCCESS;
  386. }
  387. Status HybridModelBuilder::UpdateAnchorStatus(const NodePtr &node) {
  388. if (NodeUtils::SetAllAnchorStatus(node) != GRAPH_SUCCESS) {
  389. GELOGE(INTERNAL_ERROR, "[%s] NodeUtils::SetAllAnchorStatus failed.", node->GetName().c_str());
  390. return INTERNAL_ERROR;
  391. }
  392. for (auto &anchor : node->GetAllInDataAnchors()) {
  393. auto peer_anchor = anchor->GetPeerOutAnchor();
  394. if (peer_anchor == nullptr) {
  395. if (AnchorUtils::SetStatus(anchor, ANCHOR_SUSPEND) != GRAPH_SUCCESS) {
  396. GELOGE(INTERNAL_ERROR, "[%s] AnchorUtils::SetStatus failed.", node->GetName().c_str());
  397. return INTERNAL_ERROR;
  398. }
  399. } else if (peer_anchor->GetOwnerNode()->GetType() == CONSTANT) {
  400. if (AnchorUtils::SetStatus(anchor, ANCHOR_CONST) != GRAPH_SUCCESS) {
  401. GELOGE(INTERNAL_ERROR, "[%s] AnchorUtils::SetStatus failed.", node->GetName().c_str());
  402. return INTERNAL_ERROR;
  403. }
  404. } else {
  405. if (AnchorUtils::SetStatus(anchor, ANCHOR_DATA) != GRAPH_SUCCESS) {
  406. GELOGE(INTERNAL_ERROR, "[%s] AnchorUtils::SetStatus failed.", node->GetName().c_str());
  407. return INTERNAL_ERROR;
  408. }
  409. }
  410. }
  411. return SUCCESS;
  412. }
  413. Status HybridModelBuilder::DoUnlinkDataAnchors(const OutDataAnchorPtr &out_data_anchor,
  414. const InDataAnchorPtr &in_data_anchor) {
  415. GE_CHK_GRAPH_STATUS_RET(out_data_anchor->Unlink(in_data_anchor), "Failed to unlink %s:%d from %s:%d",
  416. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  417. out_data_anchor->GetIdx(),
  418. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  419. in_data_anchor->GetIdx());
  420. GELOGD("Succeeded in unlinking %s:%d from %s:%d",
  421. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  422. out_data_anchor->GetIdx(),
  423. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  424. in_data_anchor->GetIdx());
  425. return SUCCESS;
  426. }
  427. Status HybridModelBuilder::DoLinkDataAnchors(OutDataAnchorPtr &out_data_anchor, InDataAnchorPtr &in_data_anchor) {
  428. GE_CHK_GRAPH_STATUS_RET(out_data_anchor->LinkTo(in_data_anchor), "Failed to link %s:%d to %s:%d",
  429. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  430. out_data_anchor->GetIdx(),
  431. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  432. in_data_anchor->GetIdx());
  433. GELOGD("Succeeded in linking %s:%d to %s:%d",
  434. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  435. out_data_anchor->GetIdx(),
  436. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  437. in_data_anchor->GetIdx());
  438. return SUCCESS;
  439. }
  440. Status HybridModelBuilder::MergeInputNodes(ComputeGraph &graph) {
  441. const auto &wrapped_node = graph.GetParentNode();
  442. std::set<NodePtr> root_nodes;
  443. for (const auto &node : graph.GetDirectNode()) {
  444. GE_CHECK_NOTNULL(node);
  445. if (node->GetType() != DATA_TYPE) {
  446. if (node->GetInDataNodes().empty()) {
  447. root_nodes.emplace(node);
  448. }
  449. continue;
  450. }
  451. auto data_op_desc = node->GetOpDesc();
  452. GE_CHECK_NOTNULL(data_op_desc);
  453. uint32_t parent_index = 0;
  454. if (!AttrUtils::GetInt(data_op_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  455. GELOGE(FAILED,
  456. "[%s] Failed to get attr [%s]",
  457. data_op_desc->GetName().c_str(),
  458. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  459. return FAILED;
  460. }
  461. auto wrapped_node_in_anchor = wrapped_node->GetInDataAnchor(parent_index);
  462. GE_CHECK_NOTNULL(wrapped_node_in_anchor);
  463. auto src_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  464. if (src_out_anchor == nullptr || src_out_anchor->GetOwnerNode() == nullptr) {
  465. continue;
  466. }
  467. wrapped_node_in_anchor->UnlinkAll();
  468. // link src to outputs of DataNode
  469. for (auto &out_data_anchor : node->GetAllOutDataAnchors()) {
  470. GE_CHECK_NOTNULL(out_data_anchor);
  471. for (auto &peer_in_data_anchor : out_data_anchor->GetPeerInDataAnchors()) {
  472. auto dst_node = peer_in_data_anchor->GetOwnerNode();
  473. GE_CHECK_NOTNULL(dst_node);
  474. root_nodes.emplace(dst_node);
  475. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(out_data_anchor, peer_in_data_anchor));
  476. GE_CHK_STATUS_RET_NOLOG(DoLinkDataAnchors(src_out_anchor, peer_in_data_anchor));
  477. }
  478. }
  479. }
  480. // transfer in control edges to all root nodes
  481. for (auto &root_node : root_nodes) {
  482. auto in_nodes = root_node->GetInAllNodes();
  483. std::set<NodePtr> in_node_set(in_nodes.begin(), in_nodes.end());
  484. for (auto &in_control_node : wrapped_node->GetInControlNodes()) {
  485. if (in_node_set.count(in_control_node) == 0) {
  486. GELOGD("[%s] Restore control edge to [%s]", in_control_node->GetName().c_str(), root_node->GetName().c_str());
  487. GE_CHECK_NOTNULL(in_control_node->GetOutControlAnchor());
  488. (void) in_control_node->GetOutControlAnchor()->LinkTo(root_node->GetInControlAnchor());
  489. }
  490. }
  491. }
  492. wrapped_node->GetInControlAnchor()->UnlinkAll();
  493. return SUCCESS;
  494. }
  495. Status HybridModelBuilder::MergeNetOutputNode(ComputeGraph &graph) {
  496. const auto &parent_node = graph.GetParentNode();
  497. const NodePtr &net_output_node = graph.FindFirstNodeMatchType(NETOUTPUT);
  498. if (net_output_node == nullptr) {
  499. GELOGD("Graph has no netoutput no need to merge.");
  500. return SUCCESS;
  501. }
  502. const auto &net_output_desc = net_output_node->GetOpDesc();
  503. GE_CHECK_NOTNULL(net_output_desc);
  504. auto all_in_nodes = net_output_node->GetInAllNodes();
  505. auto all_out_nodes = parent_node->GetOutAllNodes();
  506. net_output_node->GetInControlAnchor()->UnlinkAll();
  507. parent_node->GetOutControlAnchor()->UnlinkAll();
  508. for (const auto &in_data_anchor : net_output_node->GetAllInDataAnchors()) {
  509. auto src_out_anchor = in_data_anchor->GetPeerOutAnchor();
  510. GE_CHECK_NOTNULL(src_out_anchor);
  511. GE_CHECK_NOTNULL(src_out_anchor->GetOwnerNode());
  512. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(src_out_anchor, in_data_anchor));
  513. auto index = in_data_anchor->GetIdx();
  514. auto input_desc = net_output_desc->MutableInputDesc(index);
  515. if (input_desc == nullptr) {
  516. GELOGE(INTERNAL_ERROR, "[%s] Failed to get input desc[%d]", net_output_desc->GetName().c_str(), index);
  517. return INTERNAL_ERROR;
  518. }
  519. uint32_t parent_index = 0;
  520. if (!AttrUtils::GetInt(input_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  521. GELOGW("SubGraph: %s NetOutput input tensor %d, attr %s not found.",
  522. graph.GetName().c_str(), index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  523. continue;
  524. }
  525. const OutDataAnchorPtr &parent_out_anchor = parent_node->GetOutDataAnchor(parent_index);
  526. GE_CHECK_NOTNULL(parent_out_anchor);
  527. for (InDataAnchorPtr &dst_in_anchor : parent_out_anchor->GetPeerInDataAnchors()) {
  528. if (dst_in_anchor == nullptr) {
  529. continue;
  530. }
  531. GE_CHECK_NOTNULL(dst_in_anchor->GetOwnerNode());
  532. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(parent_out_anchor, dst_in_anchor));
  533. GE_CHK_STATUS_RET_NOLOG(DoLinkDataAnchors(src_out_anchor, dst_in_anchor));
  534. }
  535. }
  536. // transfer out control edges
  537. std::set<NodePtr> in_node_set(all_in_nodes.begin(), all_in_nodes.end());
  538. std::set<NodePtr> out_node_set(all_out_nodes.begin(), all_out_nodes.end());
  539. for (auto &src_node : in_node_set) {
  540. GELOGD("[%s] process in node.", src_node->GetName().c_str());
  541. auto out_nodes = src_node->GetOutAllNodes();
  542. std::set<NodePtr> node_set(out_nodes.begin(), out_nodes.end());
  543. for (auto &dst_node : out_node_set) {
  544. if (node_set.count(dst_node) == 0) {
  545. src_node->GetOutControlAnchor()->LinkTo(dst_node->GetInControlAnchor());
  546. GELOGD("[%s] Restore control edge to [%s]", src_node->GetName().c_str(), dst_node->GetName().c_str());
  547. }
  548. }
  549. }
  550. return SUCCESS;
  551. }
  552. Status HybridModelBuilder::UnfoldSubgraphs(ComputeGraph &root_graph, ComputeGraphPtr &merged_graph) {
  553. merged_graph = MakeShared<ComputeGraph>("MergedGraph");
  554. for (const auto &node : root_graph.GetDirectNode()) {
  555. GE_CHECK_NOTNULL(node);
  556. auto op_desc = node->GetOpDesc();
  557. GE_CHECK_NOTNULL(op_desc);
  558. const auto &op_type = node->GetType();
  559. if (op_type != PARTITIONEDCALL) {
  560. merged_graph->AddNode(node);
  561. GELOGD("[%s] Node added to merged graph.", op_desc->GetName().c_str());
  562. continue;
  563. }
  564. auto subgraph = NodeUtils::GetSubgraph(*node, kSubgraphIndex);
  565. GE_CHECK_NOTNULL(subgraph);
  566. bool is_unknown_shape = subgraph->GetGraphUnknownFlag();
  567. if (!is_unknown_shape) {
  568. merged_graph->AddNode(node);
  569. GELOGD("[%s] Known shape partitioned call added to merged graph.", op_desc->GetName().c_str());
  570. continue;
  571. }
  572. if (op_desc->HasAttr(ATTR_STAGE_LEVEL)) {
  573. uint32_t stage_level = UINT32_MAX;
  574. if (AttrUtils::GetInt(node->GetOpDesc(), ATTR_STAGE_LEVEL, stage_level)) {
  575. for (const auto &stage_node : subgraph->GetAllNodes()) {
  576. GELOGD("Set ATTR_STAGE_LEVEL on node %s, stage_level=%u", stage_node->GetName().c_str(), stage_level);
  577. (void)AttrUtils::SetInt(stage_node->GetOpDesc(), ATTR_STAGE_LEVEL, stage_level);
  578. }
  579. }
  580. }
  581. GE_CHK_GRAPH_STATUS_RET(UnfoldSubgraph(root_graph, *merged_graph, *subgraph),
  582. "[%s] Failed to merge subgraph.",
  583. subgraph->GetName().c_str());
  584. }
  585. // invoke before adding subgraphs. in case modify node id in known-shaped subgraphs.
  586. GE_CHK_GRAPH_STATUS_RET(merged_graph->TopologicalSorting(), "Failed to invoke TopologicalSorting on merged graph.");
  587. GE_DUMP(merged_graph, "hybrid_merged_graph_BeforeStageSort");
  588. merged_graph->TopologicalSorting([](const NodePtr &a, const NodePtr &b) -> bool {
  589. uint32_t a_level = UINT32_MAX;
  590. (void)AttrUtils::GetInt(a->GetOpDesc(), ATTR_STAGE_LEVEL, a_level);
  591. uint32_t b_level = UINT32_MAX;
  592. (void)AttrUtils::GetInt(b->GetOpDesc(), ATTR_STAGE_LEVEL, b_level);
  593. return a_level < b_level;
  594. });
  595. for (auto &remained_subgraph : root_graph.GetAllSubgraphs()) {
  596. GELOGD("Adding subgraph [%s] to merged-graph.", remained_subgraph->GetName().c_str());
  597. GE_CHK_GRAPH_STATUS_RET(merged_graph->AddSubgraph(remained_subgraph),
  598. "Failed to add subgraph [%s]",
  599. remained_subgraph->GetName().c_str());
  600. }
  601. return SUCCESS;
  602. }
  603. Status HybridModelBuilder::UnfoldSubgraph(ComputeGraph &root_graph,
  604. ComputeGraph &parent_graph,
  605. ComputeGraph &sub_graph) {
  606. auto parent_node = sub_graph.GetParentNode();
  607. GE_CHECK_NOTNULL(parent_node);
  608. GE_CHK_STATUS_RET(MergeInputNodes(sub_graph),
  609. "[%s] Failed to merge data nodes for subgraph",
  610. sub_graph.GetName().c_str());
  611. GE_CHK_STATUS_RET(MergeNetOutputNode(sub_graph),
  612. "[%s] Failed to merge net output nodes for subgraph",
  613. sub_graph.GetName().c_str());
  614. GELOGD("[%s] Done merging subgraph inputs and outputs successfully.", sub_graph.GetName().c_str());
  615. for (auto &sub_node : sub_graph.GetDirectNode()) {
  616. auto sub_op_type = sub_node->GetType();
  617. if (sub_op_type == DATA_TYPE || sub_op_type == NETOUTPUT) {
  618. continue;
  619. }
  620. if (sub_op_type == PARTITIONEDCALL) {
  621. auto sub_sub_graph = NodeUtils::GetSubgraph(*sub_node, kSubgraphIndex);
  622. GE_CHECK_NOTNULL(sub_sub_graph);
  623. if (sub_sub_graph->GetGraphUnknownFlag()) {
  624. GE_CHK_STATUS_RET(UnfoldSubgraph(root_graph, parent_graph, *sub_sub_graph),
  625. "[%s] Failed to merge subgraph",
  626. sub_sub_graph->GetName().c_str());
  627. continue;
  628. }
  629. }
  630. parent_graph.AddNode(sub_node);
  631. GELOGD("[%s::%s] added to parent graph: [%s].",
  632. sub_graph.GetName().c_str(),
  633. sub_node->GetName().c_str(),
  634. parent_graph.GetName().c_str());
  635. }
  636. GELOGD("[%s] Done merging subgraph. remove it from root graph.", sub_graph.GetName().c_str());
  637. root_graph.RemoveSubgraph(sub_graph.GetName());
  638. return SUCCESS;
  639. }
  640. Status HybridModelBuilder::BuildOutputMapping(GraphItem &graph_item,
  641. const NodeItem &node_item,
  642. bool is_root_graph) {
  643. auto output_size = node_item.num_inputs;
  644. graph_item.output_edges_.resize(output_size);
  645. for (auto &in_data_anchor : node_item.node->GetAllInDataAnchors()) {
  646. auto peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  647. GE_CHECK_NOTNULL(peer_out_anchor);
  648. auto src_node = peer_out_anchor->GetOwnerNode();
  649. GE_CHECK_NOTNULL(src_node);
  650. auto src_node_item = GetNodeItem(src_node);
  651. GE_CHECK_NOTNULL(src_node_item);
  652. auto output_idx = in_data_anchor->GetIdx();
  653. auto output_offset = src_node_item->output_start + peer_out_anchor->GetIdx();
  654. GELOGI("Output[%d], node = %s, output_index = %d, output_offset = %d ",
  655. output_idx,
  656. src_node_item->NodeName().c_str(),
  657. peer_out_anchor->GetIdx(),
  658. output_offset);
  659. GE_CHECK_LE(output_idx, output_size - 1);
  660. graph_item.output_edges_[output_idx] = {src_node_item, peer_out_anchor->GetIdx()};
  661. }
  662. if (!is_root_graph) {
  663. for (uint32_t i = 0; i < static_cast<uint32_t>(output_size); ++i) {
  664. uint32_t p_index = i;
  665. // Net output of Subgraph of while do not have parent index
  666. if (AttrUtils::GetInt(node_item.op_desc->GetInputDesc(i), ATTR_NAME_PARENT_NODE_INDEX, p_index)) {
  667. GELOGD("[%s] Parent index not set for input[%u].", node_item.NodeName().c_str(), i);
  668. }
  669. graph_item.output_index_mapping_.emplace_back(p_index);
  670. }
  671. }
  672. return SUCCESS;
  673. }
  674. Status HybridModelBuilder::LoadGraph() {
  675. auto root_graph = ge_root_model_->GetRootGraph();
  676. if (!GetContext().GetHostExecFlag()) {
  677. std::shared_ptr<ComputeGraph> merged_graph;
  678. GELOGI("Before merging subgraphs DirectNodesSize = %zu, GetAllNodesSize = %zu",
  679. root_graph->GetDirectNodesSize(),
  680. root_graph->GetAllNodesSize());
  681. GE_CHK_GRAPH_STATUS_RET(UnfoldSubgraphs(*root_graph, merged_graph), "Failed to unfold subgraphs.");
  682. root_graph = std::move(merged_graph);
  683. GELOGI("After merging subgraphs DirectNodesSize = %zu, GetAllNodesSize = %zu",
  684. root_graph->GetDirectNodesSize(),
  685. root_graph->GetAllNodesSize());
  686. GE_DUMP(root_graph, "hybrid_merged_graph");
  687. }
  688. GE_CHK_STATUS_RET(LoadDynamicSubgraph(*root_graph, true), "Failed to load root graph.");
  689. GELOGD("Done loading root graph successfully.");
  690. GE_CHK_STATUS_RET(hybrid_model_.root_graph_item_->GroupNodes(), "Failed to group nodes for root graph");
  691. for (auto &sub_graph : root_graph->GetAllSubgraphs()) {
  692. GE_CHECK_NOTNULL(sub_graph);
  693. GELOGD("Start to load subgraph [%s]", sub_graph->GetName().c_str());
  694. auto parent_node = sub_graph->GetParentNode();
  695. GE_CHECK_NOTNULL(parent_node);
  696. auto parent_node_item = MutableNodeItem(parent_node);
  697. // parent node is in another known subgraph
  698. if (parent_node_item == nullptr) {
  699. GELOGD("[%s] Subgraph is in another known shaped subgraph, skip it.", sub_graph->GetName().c_str());
  700. continue;
  701. }
  702. if (sub_graph->GetGraphUnknownFlag()) {
  703. GE_CHK_STATUS_RET(LoadDynamicSubgraph(*sub_graph, false),
  704. "Failed to load subgraph: [%s]",
  705. sub_graph->GetName().c_str());
  706. } else {
  707. GE_CHK_STATUS_RET(IdentifyVariableOutputs(*parent_node_item),
  708. "[%s] Failed to identify ref outputs.",
  709. parent_node_item->NodeName().c_str());
  710. GE_CHK_STATUS_RET(IdentifySameInputs(*parent_node_item),
  711. "[%s] Failed to identify same outputs.",
  712. parent_node_item->NodeName().c_str());
  713. // if parent is function control op. need add a virtual partitioned call
  714. if (parent_node_item->IsControlOp()) {
  715. GE_CHK_STATUS_RET(LoadKnownShapedSubgraph(*sub_graph, parent_node_item),
  716. "Failed to load function control op subgraph [%s]",
  717. sub_graph->GetName().c_str());
  718. }
  719. }
  720. }
  721. GELOGI("Done loading all subgraphs successfully.");
  722. return SUCCESS;
  723. }
  724. const NodeItem *HybridModelBuilder::GetNodeItem(const NodePtr &node) const {
  725. return hybrid_model_.GetNodeItem(node);
  726. }
  727. NodeItem *HybridModelBuilder::MutableNodeItem(const NodePtr &node) {
  728. return hybrid_model_.MutableNodeItem(node);
  729. }
  730. Status HybridModelBuilder::VarNodeToTensor(const NodePtr &var_node, std::unique_ptr<TensorValue> &tensor) {
  731. string var_name = var_node->GetName();
  732. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  733. uint8_t *var_logic = nullptr;
  734. GE_CHK_STATUS_RET(var_manager_->GetVarAddr(var_name, *tensor_desc, &var_logic),
  735. "Failed to get var addr. var_name = %s, session_id = %ld",
  736. var_name.c_str(),
  737. hybrid_model_.GetSessionId());
  738. rtMemType_t memory_type = RT_MEMORY_HBM;
  739. uint32_t mem_type = 0;
  740. if (AttrUtils::GetInt(var_node->GetOpDesc(), ATTR_OUTPUT_MEMORY_TYPE, mem_type) && (mem_type == 1)) {
  741. memory_type = RT_MEMORY_RDMA_HBM;
  742. }
  743. uint8_t *dev_mem = var_manager_->GetVarMemoryAddr(var_logic, memory_type);
  744. if (dev_mem == nullptr) {
  745. GELOGE(INTERNAL_ERROR,
  746. "Failed to copy var %s from device, cant not get "
  747. "var addr from logic addr %p",
  748. var_node->GetName().c_str(), var_logic);
  749. return INTERNAL_ERROR;
  750. }
  751. int64_t var_size = CalcVarSizeInBytes(*tensor_desc);
  752. // var size is only for checking, will not allocate any memory by it
  753. tensor.reset(new(std::nothrow)TensorValue(dev_mem, static_cast<size_t>(var_size)));
  754. GE_CHECK_NOTNULL(tensor);
  755. GELOGI("Get var memory addr %p for node %s, size = %ld, mem_type=%u", dev_mem, var_name.c_str(), var_size, mem_type);
  756. return SUCCESS;
  757. }
  758. Status HybridModelBuilder::HandleDtString(const GeTensor &tensor, void *var_addr) {
  759. auto desc = tensor.GetTensorDesc();
  760. if (desc.GetDataType() == DT_STRING) {
  761. GeShape tensor_shape = desc.GetShape();
  762. /// if tensor is a scaler, it's shape size if zero, according ge_tensor.cc.
  763. /// the logic of GetShapeSize is wrong, the scaler tensor's GetShapeSize is zero
  764. /// and that of unknown shape is zero too.
  765. /// unknown shape will not appear here, so we can use zero judge a tensor is scalar or not
  766. int64_t elem_num = tensor_shape.GetShapeSize();
  767. if (elem_num == 0 && tensor_shape.GetDims().empty()) {
  768. elem_num = 1;
  769. }
  770. auto &mutable_tensor = const_cast<GeTensor &>(tensor);
  771. uint64_t *buff = reinterpret_cast<uint64_t *>(mutable_tensor.MutableData().data());
  772. GE_CHK_BOOL_RET_STATUS(ge::CheckInt64Uint32MulOverflow(elem_num, kBytes * kStringHeadElems) == SUCCESS, FAILED,
  773. "Shape size is invalid");
  774. auto offset = static_cast<uint64_t>(elem_num * kBytes * kStringHeadElems);
  775. auto hbm_raw_data_base_addr =
  776. static_cast<uint64_t>(reinterpret_cast<uintptr_t>(var_addr) + offset);
  777. for (int64_t i = elem_num - 1; i >= 0; --i) {
  778. buff[i * kStringHeadElems] = hbm_raw_data_base_addr + (buff[i * kStringHeadElems] - buff[0]);
  779. }
  780. }
  781. return SUCCESS;
  782. }
  783. Status HybridModelBuilder::AssignUninitializedConstantOps() {
  784. if (GetContext().GetHostExecFlag()) {
  785. GELOGI("no need to assign when exec on host.");
  786. return SUCCESS;
  787. }
  788. for (auto &it : constant_op_nodes_) {
  789. const string &var_name = it.first;
  790. const NodePtr &var_node = it.second;
  791. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  792. if (!var_manager_->IsVarExist(var_name, *tensor_desc)) {
  793. // allocate constant
  794. GELOGD("[%s] Constant not allocated during graph building. now allocate it.", var_name.c_str());
  795. GE_CHK_STATUS_RET(var_manager_->AssignVarMem(var_name, *tensor_desc, RT_MEMORY_HBM));
  796. GE_CHK_STATUS_RET(var_manager_->SetAllocatedGraphId(var_name, runtime_param_.graph_id));
  797. }
  798. }
  799. for (auto &it : hybrid_model_.device_variable_nodes_) {
  800. const string &var_name = it.first;
  801. const NodePtr &var_node = it.second;
  802. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  803. if (!var_manager_->IsVarExist(var_name, *tensor_desc)) {
  804. // allocate constant
  805. GELOGD("[%s] Constant not allocated during graph building. now allocate it.", var_name.c_str());
  806. GE_CHK_STATUS_RET(var_manager_->AssignVarMem(var_name, *tensor_desc, RT_MEMORY_HBM));
  807. GE_CHK_STATUS_RET(VarMemAssignUtil::AssignData2Fp32Var(var_node, runtime_param_.session_id))
  808. GE_CHK_STATUS_RET(var_manager_->SetAllocatedGraphId(var_name, runtime_param_.graph_id));
  809. }
  810. }
  811. return SUCCESS;
  812. }
  813. Status HybridModelBuilder::InitConstantOps() {
  814. for (auto &it : constant_op_nodes_) {
  815. const string &var_name = it.first;
  816. const NodePtr &var_node = it.second;
  817. auto op_desc = var_node->GetOpDesc();
  818. auto v_weights = ModelUtils::GetWeights(op_desc);
  819. if (v_weights.empty()) {
  820. GELOGE(INTERNAL_ERROR, "[%s] Constant no not have value", var_node->GetName().c_str());
  821. return INTERNAL_ERROR;
  822. }
  823. auto *ge_tensor = const_cast<GeTensor *>(v_weights[0].get());
  824. std::unique_ptr<TensorValue> var_tensor;
  825. if (GetContext().GetHostExecFlag()) {
  826. GE_CHECK_NOTNULL(ge_tensor);
  827. // Address for eigen kernel should be aligned with 16 bytes
  828. // Tensors return by api GetWeights share data with proto, whose addr is not confirmed to be aligned
  829. GeTensor aligned_tensor = ge_tensor->Clone();
  830. GELOGD("Init tensor with host constant %s size = %zu", var_name.c_str(), aligned_tensor.MutableData().GetSize());
  831. if (MemManager::Instance().HostMemInstance(RT_MEMORY_HBM).Malloc(aligned_tensor.GetAlignedPtr(),
  832. aligned_tensor.GetData().size()) == nullptr) {
  833. GELOGE(MEMALLOC_FAILED, "Malloc host memory for an existed GeTensor failed.");
  834. return MEMALLOC_FAILED;
  835. }
  836. var_tensor.reset(new(std::nothrow)TensorValue(aligned_tensor.MutableData().data(),
  837. aligned_tensor.GetData().size()));
  838. } else {
  839. GE_CHK_STATUS_RET_NOLOG(VarNodeToTensor(var_node, var_tensor));
  840. GELOGD("Init const op tensor. name = %s, size = %ld", var_name.c_str(), var_tensor->GetSize());
  841. var_tensor->SetName("ConstOp_" + var_name);
  842. auto v_output_size = var_tensor->GetSize();
  843. auto v_output_addr = var_tensor->MutableData();
  844. if (ge_tensor->GetData().size() > 0) {
  845. GE_CHK_STATUS_RET_NOLOG(HandleDtString(*ge_tensor, v_output_addr));
  846. GELOGI("[IMAS]InitConstant memcpy graph_%u type[V] name[%s] output[%d] memaddr[%p] mem_size[%zu] datasize[%zu]",
  847. runtime_param_.graph_id, op_desc->GetName().c_str(), 0, v_output_addr, v_output_size,
  848. ge_tensor->GetData().size());
  849. GE_CHK_RT_RET(rtMemcpy(v_output_addr, v_output_size, ge_tensor->GetData().data(), ge_tensor->GetData().size(),
  850. RT_MEMCPY_HOST_TO_DEVICE));
  851. } else {
  852. GELOGI("[%s] Const op has no weight data.", op_desc->GetName().c_str());
  853. }
  854. }
  855. hybrid_model_.variable_tensors_.emplace(var_name, std::move(var_tensor));
  856. }
  857. return SUCCESS;
  858. }
  859. Status HybridModelBuilder::InitVariableTensors() {
  860. for (auto &it : hybrid_model_.device_variable_nodes_) {
  861. string var_name = it.first;
  862. NodePtr &var_node = it.second;
  863. std::unique_ptr<TensorValue> tensor;
  864. GE_CHK_STATUS_RET_NOLOG(VarNodeToTensor(var_node, tensor));
  865. GELOGD("Init variable tensor. name = %s, size = %ld, addr = %p",
  866. var_name.c_str(),
  867. tensor->GetSize(),
  868. tensor->GetData());
  869. tensor->SetName("Var_" + var_name);
  870. hybrid_model_.variable_tensors_.emplace(var_name, std::move(tensor));
  871. }
  872. for (const auto &it : hybrid_model_.host_variable_nodes_) {
  873. auto op_desc = it.second->GetOpDesc();
  874. GE_CHECK_NOTNULL(op_desc);
  875. GeTensorDesc output_tensor = op_desc->GetOutputDesc(0);
  876. int64_t tensor_size = 0;
  877. if (TensorUtils::CalcTensorMemSize(output_tensor.GetShape(), output_tensor.GetFormat(), output_tensor.GetDataType(),
  878. tensor_size) != SUCCESS) {
  879. GELOGE(INTERNAL_ERROR, "Calculate variable size failed, node name:%s", it.first.c_str());
  880. return INTERNAL_ERROR;
  881. }
  882. SharedMemInfo mem_info(it.first, tensor_size);
  883. if (HostMemManager::Instance().MallocSharedMemory(mem_info) != SUCCESS) {
  884. GELOGE(GE_GRAPH_MALLOC_FAILED, "Host variable [%s] malloc failed.", it.first.c_str());
  885. return GE_GRAPH_MALLOC_FAILED;
  886. }
  887. if (MemManager::Instance().HostMemInstance(RT_MEMORY_HBM).Malloc(mem_info.host_aligned_ptr,
  888. tensor_size) == nullptr) {
  889. GELOGE(MEMALLOC_FAILED, "Malloc host memory for an existed GeTensor failed.");
  890. return MEMALLOC_FAILED;
  891. }
  892. GELOGD("Host variable [%s] malloc success, size=%ld.", it.first.c_str(), tensor_size);
  893. std::unique_ptr<TensorValue> tensor(new (std::nothrow) TensorValue(mem_info.host_aligned_ptr->MutableGet(),
  894. tensor_size));
  895. GE_CHECK_NOTNULL(tensor);
  896. hybrid_model_.variable_tensors_.emplace(it.first, std::move(tensor));
  897. }
  898. return SUCCESS;
  899. }
  900. Status HybridModelBuilder::InitWeights() {
  901. // For constant in root graph
  902. const auto &root_graph = ge_root_model_->GetRootGraph();
  903. const auto &subgraph_models = ge_root_model_->GetSubgraphInstanceNameToModel();
  904. auto iter = subgraph_models.find(root_graph->GetName());
  905. if (iter == subgraph_models.end()) {
  906. GELOGD("Root graph model not found");
  907. return SUCCESS;
  908. }
  909. auto &root_model = iter->second;
  910. const auto &weight_buffer = root_model->GetWeight();
  911. if (weight_buffer.GetSize() == 0) {
  912. GELOGD("weight is empty");
  913. return SUCCESS;
  914. }
  915. auto allocator = NpuMemoryAllocator::GetAllocator();
  916. GE_CHECK_NOTNULL(allocator);
  917. hybrid_model_.weight_buffer_ = TensorBuffer::Create(allocator, weight_buffer.size());
  918. GE_CHECK_NOTNULL(hybrid_model_.weight_buffer_);
  919. auto weight_base = reinterpret_cast<uint8_t *>(hybrid_model_.weight_buffer_->GetData());
  920. GE_CHK_RT_RET(rtMemcpy(weight_base,
  921. hybrid_model_.weight_buffer_->GetSize(),
  922. weight_buffer.GetData(),
  923. weight_buffer.GetSize(),
  924. RT_MEMCPY_HOST_TO_DEVICE));
  925. GELOGI("Init weight mem successfully, weight base %p, weight size = %zu",
  926. weight_base,
  927. hybrid_model_.weight_buffer_->GetSize());
  928. for (auto &node : root_graph->GetDirectNode()) {
  929. if (node->GetType() != CONSTANT) {
  930. continue;
  931. }
  932. auto op_desc = node->GetOpDesc();
  933. auto v_weights = ModelUtils::GetWeights(op_desc);
  934. if (v_weights.empty()) {
  935. GELOGE(INTERNAL_ERROR, "[%s] Constant has no value", node->GetName().c_str());
  936. return INTERNAL_ERROR;
  937. }
  938. auto *ge_tensor = const_cast<GeTensor *>(v_weights[0].get());
  939. GE_CHECK_NOTNULL(ge_tensor);
  940. const GeTensorDesc &tensor_desc = ge_tensor->GetTensorDesc();
  941. int64_t tensor_size = 0;
  942. GE_CHK_GRAPH_STATUS_RET(TensorUtils::GetSize(*op_desc->MutableOutputDesc(0), tensor_size),
  943. "[%s] Failed to get tensor size",
  944. node->GetName().c_str());
  945. int64_t data_offset = 0;
  946. GE_CHK_GRAPH_STATUS_RET(TensorUtils::GetDataOffset(tensor_desc, data_offset),
  947. "[%s] Failed to get data offset",
  948. node->GetName().c_str());
  949. GELOGD("[%s] Start to init Constant node [%s], size = %ld, offset = %ld",
  950. GetGraphName(),
  951. node->GetName().c_str(),
  952. tensor_size,
  953. data_offset);
  954. auto tensor_buffer = TensorBuffer::Create(weight_base + data_offset, tensor_size);
  955. GE_CHECK_NOTNULL(tensor_buffer);
  956. std::unique_ptr<TensorValue> constant_tensor(new (std::nothrow)TensorValue(std::move(tensor_buffer)));
  957. GE_CHECK_NOTNULL(constant_tensor);
  958. constant_tensor->SetName("Constant_" + op_desc->GetName());
  959. hybrid_model_.constant_tensors_.emplace(node, std::move(constant_tensor));
  960. GELOGD("[%s] Constant node [%s] added, size = %ld", GetGraphName(), node->GetName().c_str(), tensor_size);
  961. }
  962. return SUCCESS;
  963. }
  964. Status HybridModelBuilder::LoadTasks() {
  965. GE_CHK_STATUS_RET(CheckAicpuOpList(), "Check Aicpu op failed.");
  966. for (auto &it : hybrid_model_.node_items_) {
  967. auto &node_item = it.second;
  968. auto &node_ptr = node_item->node;
  969. if (node_item->node_type == NETOUTPUT) {
  970. continue;
  971. }
  972. GELOGD("[%s] Start to build kernel task", node_ptr->GetName().c_str());
  973. auto load_ret = node_item->node_executor->LoadTask(hybrid_model_,
  974. node_ptr,
  975. node_item->kernel_task);
  976. if (load_ret != UNSUPPORTED && load_ret != SUCCESS) {
  977. GELOGE(load_ret, "[%s] Failed to load task", node_ptr->GetName().c_str());
  978. return load_ret;
  979. }
  980. GELOGD("[%s] Done loading task successfully.", node_ptr->GetName().c_str());
  981. }
  982. return SUCCESS;
  983. }
  984. Status HybridModelBuilder::LoadGeModel(ComputeGraph &sub_graph, const GeModelPtr &ge_model) {
  985. auto parent_node = sub_graph.GetParentNode();
  986. GE_CHECK_NOTNULL(parent_node);
  987. auto op_type = parent_node->GetType();
  988. if (IsControlOp(op_type)) {
  989. GELOGD("Set ge_model for control op subgraph: [%s], task_size = %d",
  990. sub_graph.GetName().c_str(),
  991. ge_model->GetModelTaskDefPtr()->task_size());
  992. subgraph_models_.emplace(sub_graph.GetName(), ge_model);
  993. } else {
  994. GELOGD("Set ge_model for subgraph: [%s], task_size = %d",
  995. sub_graph.GetName().c_str(),
  996. ge_model->GetModelTaskDefPtr()->task_size());
  997. hybrid_model_.known_shape_sub_models_.emplace(parent_node, ge_model);
  998. }
  999. return SUCCESS;
  1000. }
  1001. Status HybridModelBuilder::IndexTaskDefs(const ComputeGraphPtr &sub_graph, const GeModelPtr &ge_model) {
  1002. // index task defs
  1003. GELOGD("To index tasks for subgraph: %s", sub_graph->GetName().c_str());
  1004. std::unordered_map<int64_t, NodePtr> node_map;
  1005. for (const auto &node : sub_graph->GetDirectNode()) {
  1006. GE_CHECK_NOTNULL(node);
  1007. GE_CHECK_NOTNULL(node->GetOpDesc());
  1008. auto node_id = node->GetOpDesc()->GetId();
  1009. GELOGD("op_index = %ld, node_name = %s", node_id, node->GetName().c_str());
  1010. node_map.emplace(node_id, node);
  1011. }
  1012. auto tasks = ge_model->GetModelTaskDefPtr()->task();
  1013. for (int i = 0; i < tasks.size(); ++i) {
  1014. const domi::TaskDef &task_def = tasks[i];
  1015. GELOGI("Task id = %d, task type = %d", i, task_def.type());
  1016. auto task_type = static_cast<rtModelTaskType_t>(task_def.type());
  1017. uint32_t op_index = -1;
  1018. if (task_type == RT_MODEL_TASK_KERNEL) {
  1019. op_index = task_def.kernel().context().op_index();
  1020. } else if (task_type == RT_MODEL_TASK_KERNEL_EX) {
  1021. op_index = task_def.kernel_ex().op_index();
  1022. } else if (task_type == RT_MODEL_TASK_HCCL) {
  1023. op_index = task_def.kernel_hccl().op_index();
  1024. } else if (task_type == RT_MODEL_TASK_ALL_KERNEL) {
  1025. op_index = task_def.kernel_with_handle().context().op_index();
  1026. } else {
  1027. GELOGD("Skip task type: %d", static_cast<int>(task_type));
  1028. continue;
  1029. }
  1030. GELOGD("op_index = %u, task_type = %d.", op_index, task_type);
  1031. auto iter = node_map.find(op_index);
  1032. if (iter == node_map.end()) {
  1033. GELOGE(INTERNAL_ERROR, "Failed to get node by op_index = %u.", op_index);
  1034. return INTERNAL_ERROR;
  1035. }
  1036. auto &node = iter->second;
  1037. if (task_type == RT_MODEL_TASK_KERNEL || task_type == RT_MODEL_TASK_ALL_KERNEL) {
  1038. ge_model->GetTBEKernelStore().LoadTBEKernelBinToOpDesc(node->GetOpDesc());
  1039. }
  1040. GELOGD("Task loaded for node: %s, task type = %d, op_index = %u.", node->GetName().c_str(), task_type, op_index);
  1041. hybrid_model_.task_defs_[node].emplace_back(task_def);
  1042. }
  1043. return SUCCESS;
  1044. }
  1045. Status HybridModelBuilder::IndexTaskDefs() {
  1046. const auto &root_graph = ge_root_model_->GetRootGraph();
  1047. if (SetOutputNameAttr(*root_graph) != SUCCESS) {
  1048. GELOGW("Set output name attr failed.");
  1049. }
  1050. for (auto &it : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  1051. auto &name = it.first;
  1052. auto &ge_model = it.second;
  1053. GE_CHECK_NOTNULL(ge_model);
  1054. const auto &sub_graph = root_graph->GetSubgraph(name);
  1055. if (sub_graph == nullptr) {
  1056. continue;
  1057. }
  1058. bool is_unknown_shape = sub_graph->GetGraphUnknownFlag();
  1059. if (!is_unknown_shape) {
  1060. GE_CHK_STATUS_RET_NOLOG(LoadGeModel(*sub_graph, ge_model));
  1061. continue;
  1062. }
  1063. // index task defs
  1064. GELOGD("To index tasks for subgraph: %s", name.c_str());
  1065. std::unordered_map<int64_t, NodePtr> node_map;
  1066. for (const auto &node : sub_graph->GetDirectNode()) {
  1067. GE_CHECK_NOTNULL(node);
  1068. GE_CHECK_NOTNULL(node->GetOpDesc());
  1069. auto node_id = node->GetOpDesc()->GetId();
  1070. GELOGD("op_index = %ld, node_name = %s", node_id, node->GetName().c_str());
  1071. node_map.emplace(node_id, node);
  1072. }
  1073. auto tasks = ge_model->GetModelTaskDefPtr()->task();
  1074. for (int i = 0; i < tasks.size(); ++i) {
  1075. const domi::TaskDef &task_def = tasks[i];
  1076. GELOGI("Task id = %d, task type = %d", i, task_def.type());
  1077. auto task_type = static_cast<rtModelTaskType_t>(task_def.type());
  1078. uint32_t op_index = -1;
  1079. if (task_type == RT_MODEL_TASK_KERNEL) {
  1080. op_index = task_def.kernel().context().op_index();
  1081. } else if (task_type == RT_MODEL_TASK_KERNEL_EX) {
  1082. op_index = task_def.kernel_ex().op_index();
  1083. } else if (task_type == RT_MODEL_TASK_HCCL) {
  1084. op_index = task_def.kernel_hccl().op_index();
  1085. } else if (task_type == RT_MODEL_TASK_ALL_KERNEL) {
  1086. op_index = task_def.kernel_with_handle().context().op_index();
  1087. } else {
  1088. GELOGD("Skip task type: %d", static_cast<int>(task_type));
  1089. continue;
  1090. }
  1091. auto iter = node_map.find(op_index);
  1092. if (iter == node_map.end()) {
  1093. GELOGE(INTERNAL_ERROR, "Failed to get node by index = %u", op_index);
  1094. return INTERNAL_ERROR;
  1095. }
  1096. auto &node = iter->second;
  1097. if (task_type == RT_MODEL_TASK_KERNEL || task_type == RT_MODEL_TASK_ALL_KERNEL) {
  1098. ge_model->GetTBEKernelStore().LoadTBEKernelBinToOpDesc(node->GetOpDesc());
  1099. }
  1100. GELOGD("Task loaded for node: %s, task type = %d, op_index = %u", node->GetName().c_str(), task_type, op_index);
  1101. hybrid_model_.task_defs_[node].emplace_back(task_def);
  1102. }
  1103. }
  1104. return SUCCESS;
  1105. }
  1106. Status HybridModelBuilder::IndexSpecialNodes() {
  1107. GELOGD("Start to index special nodes");
  1108. const auto &root_graph = ge_root_model_->GetRootGraph();
  1109. for (auto &node : root_graph->GetAllNodes()) {
  1110. GE_CHECK_NOTNULL(node);
  1111. GE_CHECK_NOTNULL(node->GetOpDesc());
  1112. auto op_type = node->GetType();
  1113. GELOGD("node name = %s, node type = %s", node->GetName().c_str(), node->GetType().c_str());
  1114. if (op_type == VARIABLE) {
  1115. string placement;
  1116. (void) AttrUtils::GetStr(node->GetOpDesc(), ATTR_VARIABLE_PLACEMENT, placement);
  1117. if (placement == "host") {
  1118. hybrid_model_.host_variable_nodes_.emplace(node->GetName(), node);
  1119. } else {
  1120. hybrid_model_.device_variable_nodes_.emplace(node->GetName(), node);
  1121. }
  1122. } else if (op_type == CONSTANTOP) {
  1123. constant_op_nodes_.emplace(node->GetName(), node);
  1124. } else if (op_type == DATA && node->GetOwnerComputeGraph() != root_graph) {
  1125. NodePtr src_node;
  1126. int peer_out_index = -1;
  1127. GE_CHK_STATUS_RET_NOLOG(GetPeerNodeAcrossSubGraphs(node, src_node, peer_out_index));
  1128. GELOGD("Got peer node for data node %s, peer node = %s(%s)",
  1129. node->GetName().c_str(),
  1130. src_node->GetName().c_str(),
  1131. src_node->GetType().c_str());
  1132. auto src_op_type = src_node->GetType();
  1133. if (src_op_type == CONSTANTOP || src_op_type == VARIABLE) {
  1134. for (auto &dst_node_and_in_anchor : node->GetOutDataNodesAndAnchors()) {
  1135. auto &dst_node = dst_node_and_in_anchor.first;
  1136. auto &in_anchor = dst_node_and_in_anchor.second;
  1137. node_ref_inputs_[dst_node].emplace_back(std::make_pair(in_anchor->GetIdx(), src_node));
  1138. }
  1139. }
  1140. }
  1141. }
  1142. return SUCCESS;
  1143. }
  1144. Status HybridModelBuilder::GetPeerNodeAcrossSubGraphs(const NodePtr &data_node,
  1145. NodePtr &peer_node,
  1146. int &peer_out_index) {
  1147. auto sub_graph = data_node->GetOwnerComputeGraph();
  1148. GE_CHECK_NOTNULL(sub_graph);
  1149. GELOGD("To get peer node of %s::%s", sub_graph->GetName().c_str(), data_node->GetName().c_str());
  1150. auto wrapped_node = data_node->GetOwnerComputeGraph()->GetParentNode();
  1151. if (wrapped_node == nullptr) {
  1152. GELOGE(INTERNAL_ERROR, "[%s] Node is in root graph.", data_node->GetName().c_str());
  1153. return INTERNAL_ERROR;
  1154. }
  1155. auto data_op_desc = data_node->GetOpDesc();
  1156. uint32_t parent_index = 0;
  1157. if (!AttrUtils::GetInt(data_op_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  1158. GELOGE(INTERNAL_ERROR,
  1159. "[%s] Failed to get attr [%s]",
  1160. data_op_desc->GetName().c_str(),
  1161. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1162. return INTERNAL_ERROR;
  1163. }
  1164. auto wrapped_node_in_anchor = wrapped_node->GetInDataAnchor(parent_index);
  1165. GE_CHECK_NOTNULL(wrapped_node_in_anchor);
  1166. auto src_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  1167. if (src_out_anchor == nullptr || src_out_anchor->GetOwnerNode() == nullptr) {
  1168. GELOGE(INTERNAL_ERROR, "[%s] Parent node do not have peer anchor.", data_node->GetName().c_str());
  1169. return INTERNAL_ERROR;
  1170. }
  1171. auto src_wrapped_node_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  1172. GE_CHECK_NOTNULL(src_wrapped_node_out_anchor);
  1173. auto src_wrapped_node = src_wrapped_node_out_anchor->GetOwnerNode();
  1174. GE_CHECK_NOTNULL(src_wrapped_node);
  1175. // connected to root-graph's DATA
  1176. auto src_node_type = src_wrapped_node->GetType();
  1177. if (src_node_type != PARTITIONEDCALL) {
  1178. peer_node = src_wrapped_node;
  1179. peer_out_index = kVarOutputIndex;
  1180. GELOGD("[%s] Node is connected to root graph's node: %s",
  1181. data_node->GetName().c_str(),
  1182. peer_node->GetName().c_str());
  1183. return SUCCESS;
  1184. }
  1185. auto src_graph = NodeUtils::GetSubgraph(*src_wrapped_node, kSubgraphIndex);
  1186. GE_CHECK_NOTNULL(src_graph);
  1187. auto src_net_output_node = src_graph->FindFirstNodeMatchType(NETOUTPUT);
  1188. GE_CHK_BOOL_TRUE_EXEC_WITH_LOG(src_net_output_node == nullptr,
  1189. return INTERNAL_ERROR,
  1190. "Failed to find NetOutput in subgraph: %s",
  1191. src_graph->GetName().c_str());
  1192. auto net_output_desc = src_net_output_node->GetOpDesc();
  1193. GE_CHECK_NOTNULL(net_output_desc);
  1194. auto out_index = static_cast<uint32_t>(src_wrapped_node_out_anchor->GetIdx());
  1195. GELOGD("src graph = %s, src parent output index = %u", src_graph->GetName().c_str(), out_index);
  1196. // link src to outputs of DataNode
  1197. auto input_size = net_output_desc->GetAllInputsSize();
  1198. GE_CHECK_LE(input_size, UINT32_MAX);
  1199. for (uint32_t i = 0; i < static_cast<uint32_t>(input_size); ++i) {
  1200. uint32_t p_index = 0;
  1201. if (!AttrUtils::GetInt(net_output_desc->GetInputDesc(i), ATTR_NAME_PARENT_NODE_INDEX, p_index)) {
  1202. GELOGW("SubGraph: %s input tensor %u attr %s not found.",
  1203. src_graph->GetName().c_str(), i, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1204. continue;
  1205. }
  1206. GELOGD("NetOutput's input[%u], parent_node_index = %u", i, p_index);
  1207. if (p_index == out_index) {
  1208. auto in_anchor = src_net_output_node->GetInDataAnchor(i);
  1209. GE_CHECK_NOTNULL(in_anchor);
  1210. auto peer_out_anchor = in_anchor->GetPeerOutAnchor();
  1211. GE_CHECK_NOTNULL(peer_out_anchor);
  1212. peer_node = peer_out_anchor->GetOwnerNode();
  1213. GE_CHECK_NOTNULL(peer_node);
  1214. peer_out_index = peer_out_anchor->GetIdx();
  1215. GELOGD("Found peer node of Data node: %s::%s is %s::%s",
  1216. sub_graph->GetName().c_str(),
  1217. data_node->GetName().c_str(),
  1218. src_graph->GetName().c_str(),
  1219. peer_node->GetName().c_str());
  1220. return SUCCESS;
  1221. }
  1222. }
  1223. GELOGE(FAILED,
  1224. "Failed to find peer node for %s::%s",
  1225. sub_graph->GetName().c_str(),
  1226. data_node->GetName().c_str());
  1227. return FAILED;
  1228. }
  1229. Status HybridModelBuilder::InitRuntimeParams() {
  1230. int64_t value = 0;
  1231. bool ret = false;
  1232. if (ge_root_model_->GetSubgraphInstanceNameToModel().empty()) {
  1233. GELOGE(INTERNAL_ERROR, "Root model has no sub model");
  1234. return INTERNAL_ERROR;
  1235. }
  1236. // session id and var size is same for every model
  1237. auto first_model = ge_root_model_->GetSubgraphInstanceNameToModel().begin()->second;
  1238. ret = ge::AttrUtils::GetInt(first_model, ge::MODEL_ATTR_SESSION_ID, value);
  1239. runtime_param_.session_id = ret ? static_cast<uint64_t>(value) : 0;
  1240. ret = ge::AttrUtils::GetInt(first_model, ATTR_MODEL_TASK_GEN_VAR_ADDR, value);
  1241. runtime_param_.logic_var_base = ret ? static_cast<uint64_t>(value) : 0;
  1242. runtime_param_.graph_id = ge_root_model_->GetRootGraph()->GetGraphID();
  1243. value = 0;
  1244. for (auto &it : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  1245. (void) ge::AttrUtils::GetInt(it.second, ATTR_MODEL_VAR_SIZE, value);
  1246. if (value > 0) {
  1247. runtime_param_.var_size = static_cast<uint64_t>(value);
  1248. break;
  1249. }
  1250. }
  1251. GELOGI("InitRuntimeParams(), session_id:%lu, var_size:%lu. graph_id = %u",
  1252. runtime_param_.session_id, runtime_param_.var_size, runtime_param_.graph_id);
  1253. var_manager_ = VarManager::Instance(runtime_param_.session_id);
  1254. GE_CHECK_NOTNULL(var_manager_);
  1255. return SUCCESS;
  1256. }
  1257. Status HybridModelBuilder::IdentifySameInputs(NodeItem &node_item) {
  1258. GELOGD("Start to parse same inputs on net output: %s", node_item.NodeName().c_str());
  1259. auto subgraph = NodeUtils::GetSubgraph(*node_item.node, kSubgraphIndex);
  1260. GE_CHECK_NOTNULL(subgraph);
  1261. auto net_output_node = subgraph->FindFirstNodeMatchType(NETOUTPUT);
  1262. if (net_output_node == nullptr) {
  1263. GELOGD("Subgraph [%s] does not have net output", subgraph->GetName().c_str());
  1264. return SUCCESS;
  1265. }
  1266. auto net_output_desc = net_output_node->GetOpDesc();
  1267. GE_CHECK_NOTNULL(net_output_desc);
  1268. std::map<std::string, int> connected_inputs;
  1269. for (const auto &in_data_anchor : net_output_node->GetAllInDataAnchors()) {
  1270. auto out_data_anchor = in_data_anchor->GetPeerOutAnchor();
  1271. if (out_data_anchor == nullptr) {
  1272. continue;
  1273. }
  1274. auto src_node = out_data_anchor->GetOwnerNode();
  1275. GE_CHECK_NOTNULL(src_node);
  1276. auto op_desc = src_node->GetOpDesc();
  1277. GE_CHECK_NOTNULL(op_desc);
  1278. std::string input_key = std::to_string(op_desc->GetId()) + "_" + std::to_string(out_data_anchor->GetIdx());
  1279. auto it = connected_inputs.find(input_key);
  1280. if (it == connected_inputs.end()) {
  1281. connected_inputs.emplace(input_key, in_data_anchor->GetIdx());
  1282. } else {
  1283. GELOGD("[%s] output [%d] reuse output [%d] input node = %s, idx = %d.", node_item.NodeName().c_str(),
  1284. in_data_anchor->GetIdx(),
  1285. it->second,
  1286. src_node->GetName().c_str(),
  1287. out_data_anchor->GetIdx());
  1288. node_item.reuse_outputs.emplace(in_data_anchor->GetIdx(), it->second);
  1289. }
  1290. }
  1291. return SUCCESS;
  1292. }
  1293. Status HybridModelBuilder::IdentifyVariableOutputs(NodeItem &node_item) {
  1294. GELOGD("Start to parse outputs of node: %s", node_item.NodeName().c_str());
  1295. auto subgraph = NodeUtils::GetSubgraph(*node_item.node, kSubgraphIndex);
  1296. GE_CHECK_NOTNULL(subgraph);
  1297. auto net_output_node = subgraph->FindFirstNodeMatchType(NETOUTPUT);
  1298. if (net_output_node == nullptr) {
  1299. GELOGD("[%s] Subgraph do not got net output", subgraph->GetName().c_str());
  1300. return SUCCESS;
  1301. }
  1302. auto net_output_desc = net_output_node->GetOpDesc();
  1303. GE_CHECK_NOTNULL(net_output_desc);
  1304. // constant/variable connected to net output
  1305. for (const auto &in_data_anchor : net_output_node->GetAllInDataAnchors()) {
  1306. auto src_node = GetPeerNode(in_data_anchor);
  1307. GE_CHECK_NOTNULL(src_node);
  1308. auto src_op_type = src_node->GetType();
  1309. GELOGD("Node %s, output %d, src node = %s, src node type = %s",
  1310. node_item.NodeName().c_str(),
  1311. in_data_anchor->GetIdx(),
  1312. src_node->GetName().c_str(),
  1313. src_op_type.c_str());
  1314. if (src_op_type != CONSTANTOP && src_op_type != VARIABLE) {
  1315. continue;
  1316. }
  1317. uint32_t parent_index = 0;
  1318. GE_CHK_STATUS_RET_NOLOG(GetParentNodeOutputIndex(*net_output_desc, in_data_anchor->GetIdx(), parent_index));
  1319. GELOGD("Got parent output index = %u", parent_index);
  1320. GE_CHECK_LE(parent_index, INT32_MAX);
  1321. node_item.ref_outputs.emplace(static_cast<int>(parent_index), src_node);
  1322. }
  1323. // Data nodes marked with REF_VAR_SRC_VAR_NAME
  1324. // Using variable tensor as data's output
  1325. for (auto &node : subgraph->GetDirectNode()) {
  1326. if (node->GetType() != DATA) {
  1327. continue;
  1328. }
  1329. string ref_var_name;
  1330. (void) AttrUtils::GetStr(node->GetOpDesc(), REF_VAR_SRC_VAR_NAME, ref_var_name);
  1331. if (ref_var_name.empty()) {
  1332. continue;
  1333. }
  1334. GELOGD("Data node ref to variable: %s", ref_var_name.c_str());
  1335. NodePtr src_node;
  1336. auto var_node = hybrid_model_.GetVariableNode(ref_var_name);
  1337. GE_CHECK_NOTNULL(var_node);
  1338. GELOGD("Found var node [%s] by ref_var_name [%s]", var_node->GetName().c_str(), ref_var_name.c_str());
  1339. int peer_output_index = -1;
  1340. GE_CHK_STATUS_RET_NOLOG(GetPeerNodeAcrossSubGraphs(node, src_node, peer_output_index));
  1341. auto src_node_item = MutableNodeItem(src_node);
  1342. GE_CHECK_NOTNULL(src_node_item);
  1343. src_node_item->ref_outputs.emplace(peer_output_index, var_node);
  1344. }
  1345. return SUCCESS;
  1346. }
  1347. NodePtr HybridModelBuilder::GetPeerNode(const InDataAnchorPtr &in_data_anchor) {
  1348. auto peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  1349. if (peer_out_anchor != nullptr) {
  1350. return peer_out_anchor->GetOwnerNode();
  1351. }
  1352. return nullptr;
  1353. }
  1354. Status HybridModelBuilder::GetParentNodeOutputIndex(const OpDesc &op_desc, int index, uint32_t &out_index) {
  1355. auto input_desc = op_desc.MutableInputDesc(index);
  1356. GE_CHECK_NOTNULL(input_desc);
  1357. if (!AttrUtils::GetInt(input_desc, ATTR_NAME_PARENT_NODE_INDEX, out_index)) {
  1358. GELOGE(INTERNAL_ERROR, "NetOutput input tensor %d, attr %s not found.",
  1359. index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1360. return INTERNAL_ERROR;
  1361. }
  1362. return SUCCESS;
  1363. }
  1364. Status HybridModelBuilder::InitModelMem() {
  1365. hybrid_model_.var_mem_base_ = var_manager_->GetVarMemoryBase(RT_MEMORY_HBM);
  1366. auto total_var_size = hybrid_model_.TotalVarMemSize();
  1367. if (total_var_size == 0 && !constant_op_nodes_.empty()) {
  1368. total_var_size = var_manager_->GetVarMemSize(RT_MEMORY_HBM) > 0 ? var_manager_->GetVarMemMaxSize() : 0;
  1369. GELOGD("Model var size = 0. but got uninitialized constant. set var size to %zu.", total_var_size);
  1370. }
  1371. if (total_var_size > 0 && hybrid_model_.var_mem_base_ == nullptr) {
  1372. GE_CHK_STATUS_RET(var_manager_->MallocVarMemory(total_var_size),
  1373. "Malloc Var Memory Fail.");
  1374. hybrid_model_.var_mem_base_ = var_manager_->GetVarMemoryBase(RT_MEMORY_HBM);
  1375. }
  1376. runtime_param_.var_base = hybrid_model_.var_mem_base_;
  1377. return SUCCESS;
  1378. }
  1379. Status HybridModelBuilder::TransAllVarData() {
  1380. GELOGI("TransAllVarData start: session_id:%lu, graph_id: %u.", runtime_param_.session_id, runtime_param_.graph_id);
  1381. rtContext_t ctx = nullptr;
  1382. rtError_t rt_ret = rtCtxGetCurrent(&ctx);
  1383. if (rt_ret != RT_ERROR_NONE) {
  1384. GELOGE(RT_FAILED, "Failed to get current context, error_code is: 0x%X.", rt_ret);
  1385. return RT_FAILED;
  1386. }
  1387. std::vector<NodePtr> variable_node_list;
  1388. for (auto &it : hybrid_model_.device_variable_nodes_) {
  1389. variable_node_list.emplace_back(it.second);
  1390. GELOGD("[%s] added for trans var data", it.first.c_str());
  1391. }
  1392. GE_CHK_STATUS_RET(TransVarDataUtils::TransAllVarData(variable_node_list,
  1393. runtime_param_.session_id,
  1394. ctx,
  1395. runtime_param_.graph_id),
  1396. "TransAllVarData failed.");
  1397. GELOGI("TransAllVarData success.");
  1398. return SUCCESS;
  1399. }
  1400. Status HybridModelBuilder::CopyVarData() {
  1401. GE_CHK_STATUS_RET(TransVarDataUtils::CopyVarData(ge_root_model_->GetRootGraph(),
  1402. runtime_param_.session_id,
  1403. hybrid_model_.device_id_),
  1404. "CopyVarData failed.");
  1405. GELOGI("CopyVarData success.");
  1406. return SUCCESS;
  1407. }
  1408. Status HybridModelBuilder::LoadKnownShapedSubgraph(ComputeGraph &graph, NodeItem *parent_node_item) {
  1409. GELOGD("Start to load known shaped subgraph [%s]", graph.GetName().c_str());
  1410. auto graph_item = std::unique_ptr<GraphItem>(new(std::nothrow)GraphItem());
  1411. GE_CHECK_NOTNULL(graph_item);
  1412. graph_item->is_dynamic_ = false;
  1413. auto subgraph_name = graph.GetName();
  1414. auto wrapper_op_desc = MakeShared<OpDesc>(subgraph_name + "_partitioned_call", PARTITIONEDCALL);
  1415. GE_CHECK_NOTNULL(wrapper_op_desc);
  1416. for (auto &node : graph.GetDirectNode()) {
  1417. GE_CHECK_NOTNULL(node);
  1418. auto op_desc = node->GetOpDesc();
  1419. GE_CHECK_NOTNULL(op_desc);
  1420. const auto &op_type = node->GetType();
  1421. if (op_type == DATA) {
  1422. int32_t data_index = 0;
  1423. if (!AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1424. GELOGE(FAILED,
  1425. "[%s] Failed to get attr [%s]",
  1426. node->GetName().c_str(),
  1427. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1428. return FAILED;
  1429. }
  1430. (void) wrapper_op_desc->AddInputDesc(op_desc->GetInputDesc(0));
  1431. graph_item->input_index_mapping_.emplace_back(data_index);
  1432. } else if (op_type == NETOUTPUT) {
  1433. int output_index = 0;
  1434. for (const auto &output_desc : op_desc->GetAllInputsDescPtr()) {
  1435. int32_t data_index = output_index++;
  1436. if (!AttrUtils::GetInt(output_desc, ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1437. GELOGI("[%s] Failed to get attr [%s]", node->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1438. }
  1439. GE_CHK_GRAPH_STATUS_RET(wrapper_op_desc->AddOutputDesc(*output_desc),
  1440. "[%s] Failed to add output desc. output index = %d",
  1441. graph.GetName().c_str(),
  1442. output_index);
  1443. graph_item->output_index_mapping_.emplace_back(data_index);
  1444. }
  1445. }
  1446. }
  1447. auto temp_graph = MakeShared<ComputeGraph>("temp");
  1448. GE_CHECK_NOTNULL(temp_graph);
  1449. auto wrapper_node = temp_graph->AddNode(wrapper_op_desc);
  1450. GeModelPtr ge_model = subgraph_models_[subgraph_name];
  1451. GE_CHECK_NOTNULL(ge_model);
  1452. hybrid_model_.known_shape_sub_models_.emplace(wrapper_node, ge_model);
  1453. NodeItem *node_item = nullptr;
  1454. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(wrapper_node, &node_item));
  1455. node_item->input_start = 0;
  1456. node_item->output_start = 0;
  1457. node_item->outputs.resize(node_item->num_outputs);
  1458. graph_item->node_items_.emplace_back(node_item);
  1459. graph_item->output_node_ = node_item;
  1460. graph_item->total_inputs_ = node_item->num_inputs;
  1461. graph_item->total_outputs_ = node_item->num_outputs;
  1462. GELOGD("NodeItem create for known shape subgraph [%s], NodeItem = %s",
  1463. graph.GetName().c_str(),
  1464. node_item->DebugString().c_str());
  1465. GELOGD("Done parse known shape subgraph successfully. graph = [%s]", graph.GetName().c_str());
  1466. graph_item->SetName(graph.GetName());
  1467. GELOGD("Done loading known shape subgraph: [%s]", graph_item->GetName().c_str());
  1468. hybrid_model_.subgraph_items_.emplace(graph.GetName(), std::move(graph_item));
  1469. return SUCCESS;
  1470. }
  1471. Status HybridModelBuilder::RecoverGraphUnknownFlag() {
  1472. const auto &root_graph = ge_root_model_->GetRootGraph();
  1473. for (auto &sub_graph : root_graph->GetAllSubgraphs()) {
  1474. GE_CHECK_NOTNULL(sub_graph);
  1475. for (const auto &node : sub_graph->GetDirectNode()) {
  1476. bool is_unknown_shape = false;
  1477. (void)AttrUtils::GetBool(node->GetOpDesc(), kOwnerGraphIsUnknown, is_unknown_shape);
  1478. sub_graph->SetGraphUnknownFlag(is_unknown_shape);
  1479. break;
  1480. }
  1481. }
  1482. return SUCCESS;
  1483. }
  1484. Status HybridModelBuilder::GenerateFpProfilingTask(const OpDescPtr &op_desc, vector<domi::TaskDef> &task_def_list) {
  1485. uint64_t jobid_log_id = ge::GetContext().TraceId();
  1486. GELOGD("The first FP operator is %s,, job_id %lu", op_desc->GetName().c_str(), jobid_log_id);
  1487. TaskDef job_task_def;
  1488. job_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1489. job_task_def.set_stream_id(op_desc->GetStreamId());
  1490. LogTimeStampDef *job_log_def = job_task_def.mutable_log_timestamp();
  1491. if (job_log_def != nullptr) {
  1492. job_log_def->set_logid(jobid_log_id);
  1493. job_log_def->set_notify(false);
  1494. }
  1495. task_def_list.emplace_back(job_task_def);
  1496. TaskDef fp_task_def;
  1497. fp_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1498. fp_task_def.set_stream_id(op_desc->GetStreamId());
  1499. LogTimeStampDef *fp_log_def = fp_task_def.mutable_log_timestamp();
  1500. if (fp_log_def != nullptr) {
  1501. fp_log_def->set_logid(kProfilingFpStartLogid);
  1502. fp_log_def->set_notify(false);
  1503. }
  1504. task_def_list.emplace_back(fp_task_def);
  1505. return SUCCESS;
  1506. }
  1507. Status HybridModelBuilder::GenerateArProfilingTask(const OpDescPtr &op_desc, int64_t log_id,
  1508. vector<domi::TaskDef> &task_def_list) {
  1509. TaskDef ar_task_def;
  1510. ar_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1511. ar_task_def.set_stream_id(op_desc->GetStreamId());
  1512. LogTimeStampDef *ar_log_def = ar_task_def.mutable_log_timestamp();
  1513. if (ar_log_def != nullptr) {
  1514. ar_log_def->set_logid(log_id);
  1515. ar_log_def->set_notify(false);
  1516. }
  1517. task_def_list.emplace_back(ar_task_def);
  1518. return SUCCESS;
  1519. }
  1520. Status HybridModelBuilder::GenerateBpProfilingTask(const OpDescPtr &op_desc, vector<domi::TaskDef> &task_def_list) {
  1521. TaskDef bp_task_def;
  1522. bp_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1523. bp_task_def.set_stream_id(op_desc->GetStreamId());
  1524. LogTimeStampDef *bp_log_def = bp_task_def.mutable_log_timestamp();
  1525. GE_CHECK_NOTNULL(bp_log_def);
  1526. bp_log_def->set_logid(kProfilingBpEndLogid);
  1527. bp_log_def->set_notify(false);
  1528. task_def_list.emplace_back(bp_task_def);
  1529. return SUCCESS;
  1530. }
  1531. Status HybridModelBuilder::GenerateEndProfilingTask(const OpDescPtr &op_desc, vector<domi::TaskDef> &task_def_list) {
  1532. TaskDef end_task_def;
  1533. end_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1534. end_task_def.set_stream_id(op_desc->GetStreamId());
  1535. LogTimeStampDef *end_log_def = end_task_def.mutable_log_timestamp();
  1536. GE_CHECK_NOTNULL(end_log_def);
  1537. end_log_def->set_logid(kProfilingIterEndLogid);
  1538. end_log_def->set_notify(true);
  1539. task_def_list.emplace_back(end_task_def);
  1540. return SUCCESS;
  1541. }
  1542. Status HybridModelBuilder::CreateProfilingNodeBefore(GraphItem &graph_item, const NodePtr &node) {
  1543. GE_CHECK_NOTNULL(node);
  1544. const OpDescPtr &op_desc = node->GetOpDesc();
  1545. GE_CHECK_NOTNULL(op_desc);
  1546. const auto &compute_graph = MakeShared<ComputeGraph>(kProfilingGraph);
  1547. GE_CHECK_NOTNULL(compute_graph);
  1548. NodePtr node_ptr = nullptr;
  1549. map<NodePtr, vector<domi::TaskDef>> node_task_map;
  1550. // create fp node
  1551. bool is_insert_fp_profiling_task = false;
  1552. (void)ge::AttrUtils::GetBool(op_desc, ATTR_NAME_INSERT_FP_PROFILILNG_TASK, is_insert_fp_profiling_task);
  1553. if (is_insert_fp_profiling_task) {
  1554. vector<domi::TaskDef> task_def_list;
  1555. (void)GenerateFpProfilingTask(op_desc, task_def_list);
  1556. auto fp_desc = MakeShared<OpDesc>(kProfilingFpNode, PROFILINGTRAININGTRACE);
  1557. GE_CHECK_NOTNULL(fp_desc);
  1558. fp_desc->SetOpKernelLibName(kEngineNameRts);
  1559. node_ptr = compute_graph->AddNode(fp_desc);
  1560. GE_CHECK_NOTNULL(node_ptr);
  1561. node_task_map[node_ptr] = task_def_list;
  1562. GELOGD("Create fp profiling node success before.");
  1563. }
  1564. // creat all reduce start node
  1565. bool is_insert_bp_profiling_task = false;
  1566. (void)ge::AttrUtils::GetBool(op_desc, ATTR_NAME_INSERT_BP_PROFILILNG_TASK, is_insert_bp_profiling_task);
  1567. bool is_all_reduce = (op_desc->GetType() == HCOMALLREDUCE || op_desc->GetType() == HVDCALLBACKALLREDUCE);
  1568. if (is_all_reduce && is_insert_bp_profiling_task) {
  1569. vector<domi::TaskDef> task_def_list;
  1570. int64_t log_id = 0;
  1571. (void)ge::AttrUtils::GetInt(op_desc, ATTR_NAME_INSERT_PROFILILNG_TASK_LOG_ID, log_id);
  1572. GELOGD("All reduce node profiling task log id: %ld before", log_id);
  1573. (void) GenerateArProfilingTask(op_desc, log_id, task_def_list);
  1574. string op_name = string(kProfilingArNode) + std::to_string(log_id);
  1575. auto ar_desc_start = MakeShared<OpDesc>(op_name, PROFILINGTRAININGTRACE);
  1576. GE_CHECK_NOTNULL(ar_desc_start);
  1577. ar_desc_start->SetOpKernelLibName(kEngineNameRts);
  1578. node_ptr = compute_graph->AddNode(ar_desc_start);
  1579. GE_CHECK_NOTNULL(node_ptr);
  1580. node_task_map[node_ptr] = task_def_list;
  1581. GELOGD("Create all reduce start profiling node success before.");
  1582. }
  1583. if (!node_task_map.empty()) {
  1584. for (const auto &node_task : node_task_map) {
  1585. NodePtr profiling_node = node_task.first;
  1586. vector<domi::TaskDef> task_def_lists = node_task.second;
  1587. for (const auto &task_def : task_def_lists) {
  1588. hybrid_model_.task_defs_[profiling_node].emplace_back(task_def);
  1589. }
  1590. if (op_desc->HasAttr(ATTR_STAGE_LEVEL)) {
  1591. uint32_t stage_level = UINT32_MAX;
  1592. (void)ge::AttrUtils::GetInt(op_desc, ATTR_STAGE_LEVEL, stage_level);
  1593. (void)ge::AttrUtils::SetInt(node_ptr->GetOpDesc(), ATTR_STAGE_LEVEL, stage_level);
  1594. }
  1595. NodeItem *node_item = nullptr;
  1596. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(profiling_node, &node_item));
  1597. GE_CHECK_NOTNULL(node_item);
  1598. node_item->input_start = 0;
  1599. node_item->output_start = 0;
  1600. graph_item.node_items_.emplace_back(node_item);
  1601. }
  1602. } else {
  1603. GELOGD("No need to create profiling node before.");
  1604. }
  1605. return SUCCESS;
  1606. }
  1607. Status HybridModelBuilder::CreateProfilingNodeAfter(GraphItem &graph_item, const NodePtr &node) {
  1608. GE_CHECK_NOTNULL(node);
  1609. const OpDescPtr &op_desc = node->GetOpDesc();
  1610. GE_CHECK_NOTNULL(op_desc);
  1611. const auto &compute_graph = MakeShared<ComputeGraph>(kProfilingGraph);
  1612. GE_CHECK_NOTNULL(compute_graph);
  1613. NodePtr node_ptr = nullptr;
  1614. map<NodePtr, vector<domi::TaskDef>> node_task_map;
  1615. // Create all reduce end node
  1616. bool is_insert_bp_profiling_task = false;
  1617. (void)ge::AttrUtils::GetBool(op_desc, ATTR_NAME_INSERT_BP_PROFILILNG_TASK, is_insert_bp_profiling_task);
  1618. bool is_all_reduce = (op_desc->GetType() == HCOMALLREDUCE || op_desc->GetType() == HVDCALLBACKALLREDUCE);
  1619. if (is_all_reduce && is_insert_bp_profiling_task) {
  1620. vector<domi::TaskDef> task_def_list;
  1621. int64_t log_id = 0;
  1622. (void)ge::AttrUtils::GetInt(op_desc, ATTR_NAME_INSERT_PROFILILNG_TASK_LOG_ID, log_id);
  1623. GELOGD("All reduce node profiling task log id: %ld after", log_id);
  1624. (void) GenerateArProfilingTask(op_desc, log_id + 1, task_def_list);
  1625. string op_name = string(kProfilingArNode) + std::to_string(log_id + 1);
  1626. auto ar_desc_end = MakeShared<OpDesc>(op_name, PROFILINGTRAININGTRACE);
  1627. GE_CHECK_NOTNULL(ar_desc_end);
  1628. ar_desc_end->SetOpKernelLibName(kEngineNameRts);
  1629. node_ptr = compute_graph->AddNode(ar_desc_end);
  1630. GE_CHECK_NOTNULL(node_ptr);
  1631. node_task_map[node_ptr] = task_def_list;
  1632. GELOGD("Create all reduce end profiling node success after.");
  1633. }
  1634. // create bp node
  1635. if (!is_all_reduce && is_insert_bp_profiling_task) {
  1636. vector<domi::TaskDef> task_def_list;
  1637. (void) GenerateBpProfilingTask(op_desc, task_def_list);
  1638. auto bp_op_desc = MakeShared<OpDesc>(kProfilingBpNode, PROFILINGTRAININGTRACE);
  1639. GE_CHECK_NOTNULL(bp_op_desc);
  1640. bp_op_desc->SetOpKernelLibName(kEngineNameRts);
  1641. node_ptr = compute_graph->AddNode(bp_op_desc);
  1642. GE_CHECK_NOTNULL(node_ptr);
  1643. node_task_map[node_ptr] = task_def_list;
  1644. GELOGD("Create bp profiling node success after.");
  1645. }
  1646. // create end node
  1647. bool is_insert_end_profiling_task = false;
  1648. (void)ge::AttrUtils::GetBool(op_desc, ATTR_NAME_INSERT_END_PROFILILNG_TASK, is_insert_end_profiling_task);
  1649. if (is_insert_end_profiling_task) {
  1650. vector<domi::TaskDef> task_def_list;
  1651. (void)GenerateEndProfilingTask(op_desc, task_def_list);
  1652. auto end_desc = MakeShared<OpDesc>(kProfilingEndNode, PROFILINGTRAININGTRACE);
  1653. GE_CHECK_NOTNULL(end_desc);
  1654. end_desc->SetOpKernelLibName(kEngineNameRts);
  1655. node_ptr = compute_graph->AddNode(end_desc);
  1656. GE_CHECK_NOTNULL(node_ptr);
  1657. node_task_map[node_ptr] = task_def_list;
  1658. GELOGD("Create end profiling node success after.");
  1659. }
  1660. if (!node_task_map.empty()) {
  1661. for (const auto &node_task : node_task_map) {
  1662. NodePtr profiling_node = node_task.first;
  1663. vector<domi::TaskDef> task_def_lists = node_task.second;
  1664. for (const auto &task_def : task_def_lists) {
  1665. hybrid_model_.task_defs_[profiling_node].emplace_back(task_def);
  1666. }
  1667. if (op_desc->HasAttr(ATTR_STAGE_LEVEL)) {
  1668. uint32_t stage_level = UINT32_MAX;
  1669. (void)ge::AttrUtils::GetInt(op_desc, ATTR_STAGE_LEVEL, stage_level);
  1670. (void)ge::AttrUtils::SetInt(profiling_node->GetOpDesc(), ATTR_STAGE_LEVEL, stage_level);
  1671. }
  1672. NodeItem *node_item = nullptr;
  1673. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(profiling_node, &node_item));
  1674. GE_CHECK_NOTNULL(node_item);
  1675. node_item->input_start = 0;
  1676. node_item->output_start = 0;
  1677. graph_item.node_items_.emplace_back(node_item);
  1678. }
  1679. } else {
  1680. GELOGD("No need to create profiling node after.");
  1681. }
  1682. return SUCCESS;
  1683. }
  1684. Status HybridModelBuilder::LoadDynamicSubgraph(ComputeGraph &graph, bool is_root_graph) {
  1685. GELOGD("Start to load subgraph [%s]", graph.GetName().c_str());
  1686. // for known partitioned call, load all nodes
  1687. auto graph_item = std::unique_ptr<GraphItem>(new(std::nothrow)GraphItem());
  1688. GE_CHECK_NOTNULL(graph_item);
  1689. graph_item->is_dynamic_ = true;
  1690. graph_item->node_items_.reserve(graph.GetDirectNodesSize());
  1691. int input_start = 0;
  1692. int output_start = 0;
  1693. std::vector<NodeItem *> data_nodes;
  1694. for (auto &node : graph.GetDirectNode()) {
  1695. GE_CHECK_NOTNULL(node);
  1696. GE_CHECK_NOTNULL(node->GetOpDesc());
  1697. const auto &op_type = node->GetType();
  1698. if (op_type == NOOP) {
  1699. GELOGD("[%s] Skip NoOp", node->GetName().c_str());
  1700. continue;
  1701. }
  1702. NodeItem *node_item = nullptr;
  1703. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(node, &node_item));
  1704. GE_CHK_STATUS_RET_NOLOG(BuildNodeItem(node, *node_item));
  1705. GE_CHK_STATUS_RET_NOLOG(UpdateAnchorStatus(node)); // needed by FE generate task
  1706. node_item->input_start = input_start;
  1707. node_item->output_start = output_start;
  1708. input_start += node_item->num_inputs;
  1709. output_start += node_item->num_outputs;
  1710. if (op_type == DATA_TYPE || op_type == AIPP_DATA_TYPE) {
  1711. data_nodes.emplace_back(node_item);
  1712. } else if (op_type == NETOUTPUT) {
  1713. graph_item->output_node_ = node_item;
  1714. GE_CHK_STATUS_RET_NOLOG(BuildOutputMapping(*graph_item, *node_item, is_root_graph));
  1715. }
  1716. GE_CHK_STATUS_RET_NOLOG(CreateProfilingNodeBefore(*graph_item, node));
  1717. graph_item->node_items_.emplace_back(node_item);
  1718. GE_CHK_STATUS_RET_NOLOG(CreateProfilingNodeAfter(*graph_item, node));
  1719. // parse var outputs
  1720. GE_CHK_STATUS_RET_NOLOG(ParseVarOutputs(*node_item));
  1721. GELOGD("NodeItem created: %s", node_item->DebugString().c_str());
  1722. }
  1723. graph_item->total_inputs_ = input_start;
  1724. graph_item->total_outputs_ = output_start;
  1725. GE_CHK_STATUS_RET_NOLOG(BuildInputMapping(*graph_item, data_nodes, is_root_graph));
  1726. if (is_root_graph) {
  1727. graph_item->SetName("Root-Graph");
  1728. GELOGD("Done loading dynamic subgraph: [%s]", graph_item->GetName().c_str());
  1729. hybrid_model_.root_graph_item_ = std::move(graph_item);
  1730. } else {
  1731. graph_item->SetName(graph.GetName());
  1732. GELOGD("Done loading dynamic subgraph: [%s]", graph_item->GetName().c_str());
  1733. hybrid_model_.subgraph_items_.emplace(graph.GetName(), std::move(graph_item));
  1734. }
  1735. return SUCCESS;
  1736. }
  1737. Status HybridModelBuilder::ParseVarOutputs(NodeItem &node_item) {
  1738. for (int i = 0; i < node_item.num_outputs; ++i) {
  1739. auto output_tensor_desc = node_item.op_desc->GetOutputDesc(i);
  1740. std::string var_name;
  1741. (void) AttrUtils::GetStr(output_tensor_desc, ASSIGN_VAR_NAME, var_name);
  1742. if (!var_name.empty()) {
  1743. auto var_node = hybrid_model_.GetVariableNode(var_name);
  1744. GE_CHECK_NOTNULL(var_node);
  1745. node_item.ref_outputs.emplace(i, var_node);
  1746. }
  1747. }
  1748. return SUCCESS;
  1749. }
  1750. Status HybridModelBuilder::BuildInputMapping(GraphItem &graph_item,
  1751. vector<NodeItem *> &data_nodes,
  1752. bool is_root_graph) {
  1753. uint32_t data_op_index = 0;
  1754. for (auto &node_item : data_nodes) {
  1755. auto node = node_item->node;
  1756. int data_index = data_op_index;
  1757. if (is_root_graph) {
  1758. if (AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_INDEX, data_index)) {
  1759. GELOGI("ge_train: get new index %u, old %u", data_index, data_op_index);
  1760. }
  1761. data_op_index++;
  1762. } else {
  1763. if (!AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1764. GELOGE(FAILED,
  1765. "[%s] Failed to get attr [%s]",
  1766. node->GetName().c_str(),
  1767. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1768. return FAILED;
  1769. }
  1770. }
  1771. if (graph_item.input_nodes_.size() <= static_cast<size_t>(data_index)) {
  1772. graph_item.input_nodes_.resize(data_index + 1);
  1773. }
  1774. graph_item.input_nodes_[data_index] = node_item;
  1775. }
  1776. return SUCCESS;
  1777. }
  1778. Status HybridModelBuilder::CheckAicpuOpList() {
  1779. std::vector<std::string> aicpu_optype_list;
  1780. std::vector<std::string> aicpu_tf_optype_list;
  1781. std::set<std::string> aicpu_optype_set;
  1782. std::set<std::string> aicpu_tf_optype_set;
  1783. for (auto &it : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  1784. auto &ge_model = it.second;
  1785. GE_CHECK_NOTNULL(ge_model);
  1786. if (ge::AttrUtils::GetListStr(*ge_model, "needCheckCpu", aicpu_optype_list)) {
  1787. aicpu_optype_set.insert(aicpu_optype_list.begin(), aicpu_optype_list.end());
  1788. }
  1789. if (ge::AttrUtils::GetListStr(*ge_model, "needCheckTf", aicpu_tf_optype_list)) {
  1790. aicpu_tf_optype_set.insert(aicpu_tf_optype_list.begin(), aicpu_tf_optype_list.end());
  1791. }
  1792. }
  1793. // reset list with set
  1794. aicpu_optype_list.assign(aicpu_optype_set.begin(), aicpu_optype_set.end());
  1795. aicpu_tf_optype_list.assign(aicpu_tf_optype_set.begin(), aicpu_tf_optype_set.end());
  1796. GE_CHK_STATUS_RET(ModelManager::GetInstance()->LaunchKernelCheckAicpuOp(aicpu_optype_list, aicpu_tf_optype_list),
  1797. "Launch check aicpu op type failed.");
  1798. return SUCCESS;
  1799. }
  1800. } // namespace hybrid
  1801. } // namespace ge

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