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

4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557
  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 "common/op/ge_op_utils.h"
  20. #include "graph/ge_context.h"
  21. #include "graph/build/memory/var_mem_assign_util.h"
  22. #include "graph/debug/ge_attr_define.h"
  23. #include "graph/load/model_manager/model_utils.h"
  24. #include "graph/load/model_manager/model_manager.h"
  25. #include "graph/manager/graph_var_manager.h"
  26. #include "graph/manager/host_mem_manager.h"
  27. #include "graph/manager/trans_var_data_utils.h"
  28. #include "graph/manager/graph_mem_manager.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 int kDecimal = 10;
  44. const uint8_t kStreamActiveIdx = 0;
  45. const uint8_t kStreamActiveNum = 1;
  46. const uint8_t kStreamSwitchIdx = 1;
  47. const uint8_t kStreamSwitchNum = 2;
  48. const uint32_t kStringHeadElems = 2;
  49. const char *const kOwnerGraphIsUnknown = "OwnerGraphIsUnknown";
  50. const char *const kProfilingGraph = "ProfilingGraph";
  51. const char *const kProfilingFpNode = "ProfilingFpNode";
  52. const char *const kProfilingBpNode = "ProfilingBpNode";
  53. const char *const kProfilingEndNode = "ProfilingEndNode";
  54. const char *const kProfilingArNode = "ProfilingAllReduceNode";
  55. const char *const kEngineNameRts = "DNN_VM_RTS_OP_STORE";
  56. const char *const kForceInfershape = "_force_infershape_when_running";
  57. Status SetOutputNameAttr(ComputeGraph &graph) {
  58. vector<string> output_names;
  59. for (const auto &node : graph.GetDirectNode()) {
  60. auto op_desc = node->GetOpDesc();
  61. if (op_desc == nullptr) {
  62. continue;
  63. }
  64. auto op_type = op_desc->GetType();
  65. if (op_type == NETOUTPUT) {
  66. for (InDataAnchorPtr &in_data_anchor : node->GetAllInDataAnchors()) {
  67. const OutDataAnchorPtr &peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  68. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  69. NodePtr in_node = peer_out_anchor->GetOwnerNode();
  70. GE_CHECK_NOTNULL(in_node);
  71. output_names.push_back(in_node->GetName());
  72. }
  73. }
  74. }
  75. GE_CHK_BOOL_EXEC(ge::AttrUtils::SetListStr(&graph, ATTR_MODEL_OUT_NODES_NAME, output_names),
  76. GELOGE(FAILED, "[Invoke][SetListStr] failed, graph:%s name:%s.", graph.GetName().c_str(),
  77. ATTR_MODEL_OUT_NODES_NAME.c_str());
  78. REPORT_CALL_ERROR("E19999", "SetListStr failed, graph:%s name:%s.", graph.GetName().c_str(),
  79. ATTR_MODEL_OUT_NODES_NAME.c_str());
  80. return FAILED);
  81. return SUCCESS;
  82. }
  83. int64_t CalcVarSizeInBytes(const GeTensorDesc &desc) {
  84. int64_t var_size = 0;
  85. auto data_type = desc.GetDataType();
  86. if (data_type == DT_STRING) {
  87. (void) TensorUtils::GetSize(desc, var_size);
  88. return var_size;
  89. }
  90. if (TensorUtils::GetTensorMemorySizeInBytes(desc, var_size) != GRAPH_SUCCESS) {
  91. GELOGW("Failed to calc var data size");
  92. return -1;
  93. }
  94. return var_size;
  95. }
  96. Status CollectDependenciesForFusedGraph(NodeItem &node_item, std::set<OpDesc *> &data_ops) {
  97. for (const auto &node : node_item.fused_subgraph->nodes) {
  98. auto op_desc = node->GetOpDesc();
  99. GE_CHECK_NOTNULL(op_desc);
  100. const auto &depends = op_desc->GetOpInferDepends();
  101. if (depends.empty()) {
  102. continue;
  103. }
  104. for (auto &input_name : depends) {
  105. auto input_index = op_desc->GetInputIndexByName(input_name);
  106. auto src_node = NodeUtils::GetInDataNodeByIndex(*node, input_index);
  107. GE_CHECK_NOTNULL(src_node);
  108. auto src_op_desc = src_node->GetOpDesc();
  109. GE_CHECK_NOTNULL(src_op_desc);
  110. if (src_node->GetType() != DATA_TYPE) {
  111. GELOGE(UNSUPPORTED, "[Check][NodeType][%s::%s] Node in fused subgraph can only depend on Data nodes,"
  112. "but depend on %s actually", node_item.NodeName().c_str(), node->GetName().c_str(),
  113. src_node->GetType().c_str());
  114. REPORT_INNER_ERROR("E19999", "[%s::%s] Node in fused subgraph can only depend on Data nodes,"
  115. "but depend on %s actually.", node_item.NodeName().c_str(), node->GetName().c_str(),
  116. src_node->GetType().c_str());
  117. return UNSUPPORTED;
  118. }
  119. data_ops.emplace(src_op_desc.get());
  120. }
  121. }
  122. return SUCCESS;
  123. }
  124. } // namespace
  125. HybridModelBuilder::HybridModelBuilder(HybridModel &hybrid_model)
  126. : hybrid_model_(hybrid_model), runtime_param_(hybrid_model.root_runtime_param_) {
  127. ge_root_model_ = hybrid_model_.ge_root_model_;
  128. }
  129. Status HybridModelBuilder::Build() {
  130. GE_CHK_STATUS_RET(ValidateParams(), "[Invoke][ValidateParams] failed, model_name_:[%s]", GetGraphName());
  131. hybrid_model_.model_name_ = ge_root_model_->GetModelName();
  132. GELOGI("[%s] Start to build hybrid model.", GetGraphName());
  133. GE_CHK_STATUS_RET(InitRuntimeParams(), "[Invoke][InitRuntimeParams] failed, model_name_:[%s]", GetGraphName());
  134. GE_CHK_STATUS_RET(RecoverGraphUnknownFlag(),
  135. "[Invoke][RecoverGraphUnknownFlag] failed, model_name_:[%s]", GetGraphName());
  136. GE_CHK_STATUS_RET(IndexSpecialNodes(), "[Invoke][IndexSpecialNodes] failed, model_name_:[%s]", GetGraphName());
  137. GE_CHK_STATUS_RET(IndexTaskDefs(), "[Invoke][IndexTaskDefs] failed, model_name_:[%s]", GetGraphName());
  138. GE_CHK_STATUS_RET(InitWeights(), "[Invoke][InitWeights] failed, model_name_:[%s]", GetGraphName());
  139. GE_CHK_STATUS_RET(LoadGraph(), "[Invoke][LoadGraph] failed, model_name_:[%s]", GetGraphName());
  140. GE_CHK_STATUS_RET(AssignUninitializedConstantOps(),
  141. "[Invoke][AssignUninitializedConstantOps] failed, model_name_:[%s]", GetGraphName());
  142. GE_CHK_STATUS_RET(TransAllVarData(), "[Invoke][TransAllVarData] failed, model_name_:[%s]", GetGraphName());
  143. GE_CHK_STATUS_RET(CopyVarData(), "[Invoke][CopyVarData] failed, model_name_:[%s]", GetGraphName());
  144. GE_CHK_STATUS_RET(InitModelMem(), "[Invoke][InitModelMem] failed, model_name_:[%s]", GetGraphName());
  145. GE_CHK_STATUS_RET(InitConstantOps(), "[Invoke][InitConstantOps] failed, model_name_:[%s]", GetGraphName());
  146. GE_CHK_STATUS_RET(InitVariableTensors(), "[Invoke][InitVariableTensors], model_name_:[%s]", GetGraphName());
  147. GE_CHK_STATUS_RET(LoadTasks(), "[Invoke][LoadTasks] failed, model_name_:[%s]", GetGraphName());
  148. GE_CHK_STATUS_RET(OptimizeDependenciesForConstantInputs(),
  149. "[Invoke][OptimizeDependenciesForConstantInputs] failed, model_name_:[%s]",
  150. GetGraphName());
  151. GELOGI("[%s] Done building hybrid model successfully.", GetGraphName());
  152. return SUCCESS;
  153. }
  154. Status HybridModelBuilder::BuildForSingleOp() {
  155. GE_CHK_STATUS_RET(ValidateParams(), "[Invoke][ValidateParams] failed, model_name_:[%s]", GetGraphName());
  156. hybrid_model_.model_name_ = ge_root_model_->GetRootGraph()->GetName();
  157. GELOGI("[%s] Start to build hybrid model.", GetGraphName());
  158. auto ret = ge_root_model_->GetSubgraphInstanceNameToModel();
  159. const GeModelPtr ge_model = ret[ge_root_model_->GetRootGraph()->GetName()];
  160. GE_CHK_STATUS_RET(IndexTaskDefs(ge_root_model_->GetRootGraph(), ge_model),
  161. "[Invoke][IndexTaskDefs] failed, model_name_:[%s]", GetGraphName());
  162. GE_CHK_STATUS_RET(LoadGraph(), "[Invoke][LoadGraph] failed, model_name_:[%s]", GetGraphName());
  163. GE_CHK_STATUS_RET(InitWeights(), "[Invoke][InitWeights] failed, model_name_:[%s]", GetGraphName());
  164. GE_CHK_STATUS_RET(LoadTasks(), "[Invoke][LoadTasks] failed, model_name_:[%s]", GetGraphName());
  165. GELOGI("[%s] Done building hybrid model for single op successfully.", GetGraphName());
  166. return SUCCESS;
  167. }
  168. Status HybridModelBuilder::ValidateParams() {
  169. GE_CHECK_NOTNULL(ge_root_model_);
  170. GE_CHECK_NOTNULL(ge_root_model_->GetRootGraph());
  171. return SUCCESS;
  172. }
  173. Status HybridModelBuilder::BuildNodeItem(const NodePtr &node, NodeItem &node_item) {
  174. auto op_desc = node->GetOpDesc();
  175. GE_CHK_STATUS_RET(ParseForceInfershapeNodes(node, node_item),
  176. "[Invoke][ParseForceInfershapeNodes]failed, node:[%s].",
  177. node_item.NodeName().c_str());
  178. vector<string> dependencies = node->GetOpDesc()->GetOpInferDepends();
  179. GE_CHK_STATUS_RET(ParseDependentInputNodes(node_item, dependencies),
  180. "[Invoke][ParseDependentInputNodes]failed, node:[%s].",
  181. node_item.NodeName().c_str());
  182. node_item.outputs.resize(node_item.num_outputs);
  183. for (int i = 0; i < node_item.num_outputs; ++i) {
  184. auto out_data_anchor = node->GetOutDataAnchor(i);
  185. if (out_data_anchor == nullptr) {
  186. GELOGE(INTERNAL_ERROR, "[Get][OutDataAnchor]out anchor[%d] of node %s is nullptr", i, node->GetName().c_str());
  187. REPORT_CALL_ERROR("E19999", "out anchor[%d] of node %s is nullptr.", i, node->GetName().c_str());
  188. return INTERNAL_ERROR;
  189. }
  190. for (auto &dst_in_anchor: out_data_anchor->GetPeerInDataAnchors()) {
  191. auto dst_node = dst_in_anchor->GetOwnerNode();
  192. if (dst_node == nullptr) {
  193. GELOGW("dst node is nullptr. out anchor = %d", out_data_anchor->GetIdx());
  194. continue;
  195. }
  196. NodeItem *dst_node_item = nullptr;
  197. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  198. "[GetOrCreate][NodeItem] failed, dst_node:[%s].", dst_node->GetName().c_str());
  199. int canonical_index;
  200. GE_CHK_STATUS_RET(dst_node_item->GetCanonicalInputIndex(dst_in_anchor->GetIdx(), canonical_index),
  201. "[Invoke][GetCanonicalInputIndex] failed, dst_node:[%s].", dst_node->GetName().c_str());
  202. node_item.outputs[i].emplace_back(canonical_index, dst_node_item);
  203. node_item.SetDataSend(dst_node_item, dst_in_anchor->GetIdx());
  204. }
  205. }
  206. GE_CHK_STATUS_RET_NOLOG(ResolveRefIo(node_item));
  207. return SUCCESS;
  208. }
  209. Status HybridModelBuilder::ResolveRefIo(NodeItem &node_item) {
  210. bool is_ref = false;
  211. auto &op_desc = *node_item.op_desc;
  212. (void) AttrUtils::GetBool(op_desc, ATTR_NAME_REFERENCE, is_ref);
  213. if (!is_ref) {
  214. return SUCCESS;
  215. }
  216. auto inputs = op_desc.GetAllInputName();
  217. auto outputs = op_desc.GetAllOutputName();
  218. for (auto &output : outputs) {
  219. for (auto &input : inputs) {
  220. if (input.first == output.first) {
  221. int input_idx;
  222. GE_CHK_STATUS_RET_NOLOG(node_item.GetCanonicalInputIndex(input.second, input_idx));
  223. auto output_idx = static_cast<int>(output.second);
  224. node_item.reuse_inputs[output_idx] = input_idx;
  225. GELOGD("[%s] Output[%d] reuse input[%d]", node_item.NodeName().c_str(), output_idx, input_idx);
  226. }
  227. }
  228. }
  229. return SUCCESS;
  230. }
  231. Status HybridModelBuilder::GetOrCreateNodeItem(const NodePtr &node, NodeItem **node_item) {
  232. auto &node_items = hybrid_model_.node_items_;
  233. auto it = node_items.find(node);
  234. if (it != node_items.end()) {
  235. *node_item = it->second.get();
  236. return SUCCESS;
  237. }
  238. if (node->GetType() == MEMCPYASYNC) { // Convert MemcpyAsync to Identity.
  239. node->GetOpDesc()->SetType(IDENTITY);
  240. }
  241. std::unique_ptr<NodeItem> new_node;
  242. GE_CHK_STATUS_RET(NodeItem::Create(node, new_node), "[Invoke][Create] failed, model_name_:[%s]", GetGraphName());
  243. GE_CHK_STATUS_RET_NOLOG(NodeExecutorManager::GetInstance().GetExecutor(*node, &new_node->node_executor));
  244. // we do not need L2 Buffer
  245. const char *const kIsFirstNode = "is_first_node";
  246. const char *const kIsLastNode = "is_last_node";
  247. (void) AttrUtils::SetBool(new_node->op_desc, kIsFirstNode, false);
  248. (void) AttrUtils::SetBool(new_node->op_desc, kIsLastNode, false);
  249. new_node->node_id = static_cast<int>(new_node->op_desc->GetId());
  250. NodeExecutorManager::ExecutorType executor_type = NodeExecutorManager::GetInstance().ResolveExecutorType(*node);
  251. new_node->is_profiling_report = (executor_type == NodeExecutorManager::ExecutorType::AICORE) ||
  252. (executor_type == NodeExecutorManager::ExecutorType::AICPU_TF) ||
  253. (executor_type == NodeExecutorManager::ExecutorType::AICPU_CUSTOM);
  254. *node_item = new_node.get();
  255. node_items[node] = std::move(new_node);
  256. return SUCCESS;
  257. }
  258. Status HybridModelBuilder::ParseForceInfershapeNodes(const NodePtr &node, NodeItem &node_item) {
  259. auto op_desc = node->GetOpDesc();
  260. GE_CHECK_NOTNULL(op_desc);
  261. // not care result, if no this attr, stand for the op does not need force infershape
  262. (void) AttrUtils::GetBool(op_desc, kForceInfershape, node_item.is_need_force_infershape);
  263. GELOGD("node [%s] is need do infershape, flag is %d",
  264. op_desc->GetName().c_str(),
  265. node_item.is_need_force_infershape);
  266. return SUCCESS;
  267. }
  268. Status HybridModelBuilder::ParseDependencies(NodeItem &node_item, const std::vector<string> &dependencies,
  269. std::set<NodePtr> &dependent_for_shape_inference) {
  270. for (const auto &input_name : dependencies) {
  271. int input_index = node_item.op_desc->GetInputIndexByName(input_name);
  272. if (input_index < 0) {
  273. GELOGE(INTERNAL_ERROR, "[Get][InputIndex]failed, node:[%s] inputname: %s.",
  274. node_item.NodeName().c_str(), input_name.c_str());
  275. REPORT_CALL_ERROR("E19999", "GetInputIndexByName failed, node:[%s] inputname: %s.",
  276. node_item.NodeName().c_str(), input_name.c_str());
  277. return INTERNAL_ERROR;
  278. }
  279. const auto &in_anchor = node_item.node->GetInDataAnchor(input_index);
  280. GE_CHECK_NOTNULL(in_anchor);
  281. const auto &peer_out_anchor = in_anchor->GetPeerOutAnchor();
  282. GE_CHECK_NOTNULL(peer_out_anchor);
  283. const auto &src_node = peer_out_anchor->GetOwnerNode();
  284. GE_CHECK_NOTNULL(src_node);
  285. auto src_node_item = MutableNodeItem(src_node);
  286. GE_CHECK_NOTNULL(src_node_item);
  287. if (src_node_item->NodeType() == DATA) {
  288. auto op_desc = src_node_item->GetOpDesc();
  289. GE_CHECK_NOTNULL(op_desc);
  290. auto tensor = op_desc->MutableInputDesc(0);
  291. if (AttrUtils::HasAttr(tensor, ATTR_NAME_VALUE)) {
  292. GELOGD("Skip d2h memcpy, get hostmem from node %s.", src_node_item->NodeName().c_str());
  293. continue;
  294. }
  295. }
  296. src_node_item->to_const_output_id_list.emplace(peer_out_anchor->GetIdx());
  297. dependent_for_shape_inference.emplace(src_node);
  298. host_input_value_dependencies_[&node_item].emplace_back(peer_out_anchor->GetIdx(), src_node_item);
  299. GELOGD("[%s] Dependent added from output of [%s:%d]",
  300. node_item.NodeName().c_str(),
  301. src_node_item->NodeName().c_str(),
  302. peer_out_anchor->GetIdx());
  303. }
  304. return SUCCESS;
  305. }
  306. Status HybridModelBuilder::ParseDependentInputNodes(NodeItem &node_item, const std::vector<string> &dependencies) {
  307. std::set<NodePtr> dependent_for_shape_inference;
  308. std::set<NodePtr> dependent_for_execution;
  309. auto &ge_node = node_item.node;
  310. bool is_hccl_op = node_item.IsHcclOp();
  311. // The input tensors become valid after computation is done for parent nodes of type DEPEND_COMPUTE.
  312. // Wait for these parent nodes before execution.
  313. for (const auto &in_anchor : ge_node->GetAllInDataAnchors()) {
  314. const auto &peer_anchor = in_anchor->GetPeerOutAnchor();
  315. if (peer_anchor == nullptr) {
  316. GELOGD("[%s] Input[%d] do not have peer anchor", node_item.NodeName().c_str(), in_anchor->GetIdx());
  317. continue;
  318. }
  319. auto src_node = peer_anchor->GetOwnerNode();
  320. GE_CHECK_NOTNULL(src_node);
  321. NodeItem *src_node_item = nullptr;
  322. GE_CHK_STATUS_RET(GetOrCreateNodeItem(src_node, &src_node_item),
  323. "[%s] failed to get or create node item", src_node->GetName().c_str());
  324. if (src_node_item->shape_inference_type == DEPEND_COMPUTE || is_hccl_op || src_node_item->IsHcclOp()) {
  325. GELOGD("[%s](%s) Add input data dependent node [%s](%s), shape inference type = %d",
  326. ge_node->GetName().c_str(),
  327. ge_node->GetType().c_str(),
  328. src_node->GetName().c_str(),
  329. src_node->GetType().c_str(),
  330. static_cast<int>(src_node_item->shape_inference_type));
  331. src_node_item->has_observer = true;
  332. dependent_for_execution.emplace(src_node);
  333. }
  334. if (src_node_item->shape_inference_type == DEPEND_SHAPE_RANGE) {
  335. GELOGD("[%s] Add input shape dependent node [%s] due to inference type = DEPEND_SHAPE_RANGE",
  336. node_item.NodeName().c_str(),
  337. src_node_item->NodeName().c_str());
  338. src_node_item->has_observer = true;
  339. dependent_for_shape_inference.emplace(src_node);
  340. }
  341. }
  342. if (node_item.node_type == NETOUTPUT) {
  343. for (const auto &src_node : ge_node->GetInControlNodes()) {
  344. auto src_node_item = MutableNodeItem(src_node);
  345. if ((src_node_item != nullptr) && src_node_item->IsHcclOp()) {
  346. GELOGD("[%s](%s) Add input control dependent node [%s](%s)",
  347. ge_node->GetName().c_str(),
  348. ge_node->GetType().c_str(),
  349. src_node->GetName().c_str(),
  350. src_node->GetType().c_str());
  351. dependent_for_execution.emplace(src_node);
  352. }
  353. }
  354. }
  355. // cond or branch need to be prepared before the execution of IF or CASE
  356. if (node_item.node_type == IF || node_item.node_type == STATELESSIF || node_item.node_type == CASE) {
  357. auto src_node = NodeUtils::GetInDataNodeByIndex(*ge_node, 0); // cond input
  358. GE_CHECK_NOTNULL(src_node);
  359. auto src_node_item = MutableNodeItem(src_node);
  360. GE_CHECK_NOTNULL(src_node_item);
  361. dependent_for_execution.emplace(src_node);
  362. GELOGD("[%s] Dependent added from %s for control op's cond/branch",
  363. node_item.NodeName().c_str(),
  364. src_node_item->NodeName().c_str());
  365. }
  366. GE_CHK_STATUS_RET(ParseDependencies(node_item, dependencies, dependent_for_shape_inference));
  367. GE_CHK_STATUS_RET(ParseDependentForFusedSubgraph(node_item, dependent_for_shape_inference));
  368. for (const auto &dep_node : dependent_for_shape_inference) {
  369. auto src_node_item = MutableNodeItem(dep_node);
  370. GE_CHECK_NOTNULL(src_node_item);
  371. src_node_item->has_observer = true;
  372. node_item.dependents_for_shape_inference.emplace_back(dep_node);
  373. }
  374. for (const auto &dep_node : dependent_for_execution) {
  375. auto src_node_item = MutableNodeItem(dep_node);
  376. GE_CHECK_NOTNULL(src_node_item);
  377. src_node_item->has_observer = true;
  378. node_item.dependents_for_execution.emplace_back(dep_node);
  379. }
  380. return SUCCESS;
  381. }
  382. Status HybridModelBuilder::ParseDependentForFusedSubgraph(NodeItem &node_item, std::set<ge::NodePtr> &dependencies) {
  383. if (node_item.fused_subgraph == nullptr) {
  384. return SUCCESS;
  385. }
  386. std::set<OpDesc *> data_ops;
  387. GE_CHK_STATUS_RET_NOLOG(CollectDependenciesForFusedGraph(node_item, data_ops));
  388. for (auto &op_desc : data_ops) {
  389. uint32_t parent_index = 0;
  390. if (!AttrUtils::GetInt(*op_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  391. GELOGE(INTERNAL_ERROR, "[Invoke][GetInt] failed, node:[%s] attr:[%s]",
  392. op_desc->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  393. REPORT_CALL_ERROR("E19999", "invoke GetInt failed, node:[%s] attr:[%s]",
  394. op_desc->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  395. return INTERNAL_ERROR;
  396. }
  397. const auto &in_anchor = node_item.node->GetInDataAnchor(parent_index);
  398. GE_CHECK_NOTNULL(in_anchor);
  399. const auto &peer_out_anchor = in_anchor->GetPeerOutAnchor();
  400. GE_CHECK_NOTNULL(peer_out_anchor);
  401. const auto &src_node = peer_out_anchor->GetOwnerNode();
  402. GE_CHECK_NOTNULL(src_node);
  403. NodeItem *src_node_item = nullptr;
  404. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(src_node, &src_node_item));
  405. op_desc->SetId(src_node_item->op_desc->GetId());
  406. GELOGD("[%s::%s] Node id was set to that of outer src node's, src_node = %s",
  407. node_item.NodeName().c_str(),
  408. op_desc->GetName().c_str(),
  409. src_node_item->NodeName().c_str());
  410. src_node_item->to_const_output_id_list.emplace(peer_out_anchor->GetIdx());
  411. dependencies.emplace(src_node);
  412. GELOGD("[%s] Dependent added from output of [%s:%d]",
  413. node_item.NodeName().c_str(),
  414. src_node_item->NodeName().c_str(),
  415. peer_out_anchor->GetIdx());
  416. }
  417. return SUCCESS;
  418. }
  419. Status HybridModelBuilder::UpdateAnchorStatus(const NodePtr &node) {
  420. if (NodeUtils::SetAllAnchorStatus(node) != GRAPH_SUCCESS) {
  421. GELOGE(INTERNAL_ERROR, "[Invoke][SetAllAnchorStatus] failed, node:[%s].", node->GetName().c_str());
  422. REPORT_CALL_ERROR("E19999", "[%s] NodeUtils::SetAllAnchorStatus failed.", node->GetName().c_str());
  423. return INTERNAL_ERROR;
  424. }
  425. for (auto &anchor : node->GetAllInDataAnchors()) {
  426. auto peer_anchor = anchor->GetPeerOutAnchor();
  427. if (peer_anchor == nullptr) {
  428. if (AnchorUtils::SetStatus(anchor, ANCHOR_SUSPEND) != GRAPH_SUCCESS) {
  429. GELOGE(INTERNAL_ERROR, "[Invoke][SetStatus] failed to set ANCHOR_SUSPEND, node:[%s].",
  430. node->GetName().c_str());
  431. REPORT_CALL_ERROR("E19999", "SetStatus failed to set ANCHOR_SUSPEND, node:[%s].", node->GetName().c_str());
  432. return INTERNAL_ERROR;
  433. }
  434. } else if (peer_anchor->GetOwnerNode()->GetType() == CONSTANT) {
  435. if (AnchorUtils::SetStatus(anchor, ANCHOR_CONST) != GRAPH_SUCCESS) {
  436. GELOGE(INTERNAL_ERROR, "[Invoke][SetStatus] failed to set ANCHOR_CONST, node:[%s].", node->GetName().c_str());
  437. REPORT_CALL_ERROR("E19999", "SetStatus failed to set ANCHOR_CONST, node:[%s].", node->GetName().c_str());
  438. return INTERNAL_ERROR;
  439. }
  440. } else {
  441. if (AnchorUtils::SetStatus(anchor, ANCHOR_DATA) != GRAPH_SUCCESS) {
  442. GELOGE(INTERNAL_ERROR, "[Invoke][SetStatus] failed to set ANCHOR_DATA, node:[%s].", node->GetName().c_str());
  443. REPORT_CALL_ERROR("E19999", "SetStatus failed to set ANCHOR_DATA, node:[%s].", node->GetName().c_str());
  444. return INTERNAL_ERROR;
  445. }
  446. }
  447. }
  448. return SUCCESS;
  449. }
  450. Status HybridModelBuilder::DoUnlinkDataAnchors(const OutDataAnchorPtr &out_data_anchor,
  451. const InDataAnchorPtr &in_data_anchor) {
  452. GE_CHK_GRAPH_STATUS_RET(out_data_anchor->Unlink(in_data_anchor),
  453. "[Invoke][Unlink] failed to unlink %s:%d from %s:%d",
  454. out_data_anchor->GetOwnerNode()->GetName().c_str(), out_data_anchor->GetIdx(),
  455. in_data_anchor->GetOwnerNode()->GetName().c_str(), in_data_anchor->GetIdx());
  456. GELOGD("Succeeded in unlinking %s:%d from %s:%d",
  457. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  458. out_data_anchor->GetIdx(),
  459. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  460. in_data_anchor->GetIdx());
  461. return SUCCESS;
  462. }
  463. Status HybridModelBuilder::DoLinkDataAnchors(OutDataAnchorPtr &out_data_anchor, InDataAnchorPtr &in_data_anchor) {
  464. GE_CHK_GRAPH_STATUS_RET(out_data_anchor->LinkTo(in_data_anchor), "[Invoke][LinkTo]Failed to link %s:%d to %s:%d",
  465. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  466. out_data_anchor->GetIdx(),
  467. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  468. in_data_anchor->GetIdx());
  469. GELOGD("Succeeded in linking %s:%d to %s:%d",
  470. out_data_anchor->GetOwnerNode()->GetName().c_str(),
  471. out_data_anchor->GetIdx(),
  472. in_data_anchor->GetOwnerNode()->GetName().c_str(),
  473. in_data_anchor->GetIdx());
  474. return SUCCESS;
  475. }
  476. Status HybridModelBuilder::MergeInputNodes(ComputeGraph &graph) {
  477. const auto &wrapped_node = graph.GetParentNode();
  478. std::set<NodePtr> root_nodes;
  479. for (const auto &node : graph.GetDirectNode()) {
  480. GE_CHECK_NOTNULL(node);
  481. if (node->GetType() != DATA_TYPE) {
  482. if (node->GetInDataNodes().empty()) {
  483. root_nodes.emplace(node);
  484. }
  485. continue;
  486. }
  487. auto data_op_desc = node->GetOpDesc();
  488. GE_CHECK_NOTNULL(data_op_desc);
  489. uint32_t parent_index = 0;
  490. if (!AttrUtils::GetInt(data_op_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  491. GELOGE(FAILED, "[Invoke][GetInt] failed, node:[%s] attr:[%s]",
  492. data_op_desc->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  493. REPORT_CALL_ERROR("E19999", "GetInt failed, node:[%s] attr:[%s]",
  494. data_op_desc->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  495. return FAILED;
  496. }
  497. auto wrapped_node_in_anchor = wrapped_node->GetInDataAnchor(parent_index);
  498. GE_CHECK_NOTNULL(wrapped_node_in_anchor);
  499. auto src_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  500. if (src_out_anchor == nullptr || src_out_anchor->GetOwnerNode() == nullptr) {
  501. continue;
  502. }
  503. wrapped_node_in_anchor->UnlinkAll();
  504. // link src to outputs of DataNode
  505. for (auto &out_data_anchor : node->GetAllOutDataAnchors()) {
  506. GE_CHECK_NOTNULL(out_data_anchor);
  507. for (auto &peer_in_data_anchor : out_data_anchor->GetPeerInDataAnchors()) {
  508. auto dst_node = peer_in_data_anchor->GetOwnerNode();
  509. GE_CHECK_NOTNULL(dst_node);
  510. root_nodes.emplace(dst_node);
  511. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(out_data_anchor, peer_in_data_anchor));
  512. GE_CHK_STATUS_RET_NOLOG(DoLinkDataAnchors(src_out_anchor, peer_in_data_anchor));
  513. }
  514. }
  515. }
  516. // transfer in control edges to all root nodes
  517. for (auto &root_node : root_nodes) {
  518. auto in_nodes = root_node->GetInAllNodes();
  519. std::set<NodePtr> in_node_set(in_nodes.begin(), in_nodes.end());
  520. for (auto &in_control_node : wrapped_node->GetInControlNodes()) {
  521. if (in_node_set.count(in_control_node) == 0) {
  522. GELOGD("[%s] Restore control edge to [%s]", in_control_node->GetName().c_str(), root_node->GetName().c_str());
  523. GE_CHECK_NOTNULL(in_control_node->GetOutControlAnchor());
  524. (void) in_control_node->GetOutControlAnchor()->LinkTo(root_node->GetInControlAnchor());
  525. }
  526. }
  527. }
  528. wrapped_node->GetInControlAnchor()->UnlinkAll();
  529. return SUCCESS;
  530. }
  531. Status HybridModelBuilder::MergeNetOutputNode(ComputeGraph &graph) {
  532. const auto &parent_node = graph.GetParentNode();
  533. const NodePtr &net_output_node = graph.FindFirstNodeMatchType(NETOUTPUT);
  534. if (net_output_node == nullptr) {
  535. GELOGD("Graph has no netoutput no need to merge");
  536. return SUCCESS;
  537. }
  538. const auto &net_output_desc = net_output_node->GetOpDesc();
  539. GE_CHECK_NOTNULL(net_output_desc);
  540. auto all_in_nodes = net_output_node->GetInAllNodes();
  541. auto all_out_nodes = parent_node->GetOutAllNodes();
  542. net_output_node->GetInControlAnchor()->UnlinkAll();
  543. parent_node->GetOutControlAnchor()->UnlinkAll();
  544. for (const auto &in_data_anchor : net_output_node->GetAllInDataAnchors()) {
  545. auto src_out_anchor = in_data_anchor->GetPeerOutAnchor();
  546. GE_CHECK_NOTNULL(src_out_anchor);
  547. GE_CHECK_NOTNULL(src_out_anchor->GetOwnerNode());
  548. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(src_out_anchor, in_data_anchor));
  549. auto index = in_data_anchor->GetIdx();
  550. auto input_desc = net_output_desc->MutableInputDesc(index);
  551. if (input_desc == nullptr) {
  552. GELOGE(INTERNAL_ERROR, "[Invoke][MutableInputDesc][%s] Failed to get input desc[%d]",
  553. net_output_desc->GetName().c_str(), index);
  554. REPORT_CALL_ERROR("E19999", "[%s] Failed to get input desc[%d].", net_output_desc->GetName().c_str(), index);
  555. return INTERNAL_ERROR;
  556. }
  557. uint32_t parent_index = 0;
  558. if (!AttrUtils::GetInt(input_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  559. GELOGW("SubGraph: %s NetOutput input tensor %d, attr %s not found.",
  560. graph.GetName().c_str(), index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  561. continue;
  562. }
  563. const OutDataAnchorPtr &parent_out_anchor = parent_node->GetOutDataAnchor(parent_index);
  564. GE_CHECK_NOTNULL(parent_out_anchor);
  565. for (InDataAnchorPtr &dst_in_anchor : parent_out_anchor->GetPeerInDataAnchors()) {
  566. if (dst_in_anchor == nullptr) {
  567. continue;
  568. }
  569. GE_CHECK_NOTNULL(dst_in_anchor->GetOwnerNode());
  570. GE_CHK_STATUS_RET_NOLOG(DoUnlinkDataAnchors(parent_out_anchor, dst_in_anchor));
  571. GE_CHK_STATUS_RET_NOLOG(DoLinkDataAnchors(src_out_anchor, dst_in_anchor));
  572. }
  573. }
  574. // transfer out control edges
  575. std::set<NodePtr> in_node_set(all_in_nodes.begin(), all_in_nodes.end());
  576. std::set<NodePtr> out_node_set(all_out_nodes.begin(), all_out_nodes.end());
  577. for (auto &src_node : in_node_set) {
  578. GELOGD("[%s] process in node.", src_node->GetName().c_str());
  579. auto out_nodes = src_node->GetOutAllNodes();
  580. std::set<NodePtr> node_set(out_nodes.begin(), out_nodes.end());
  581. for (auto &dst_node : out_node_set) {
  582. if (node_set.count(dst_node) == 0) {
  583. src_node->GetOutControlAnchor()->LinkTo(dst_node->GetInControlAnchor());
  584. GELOGD("[%s] Restore control edge to [%s]", src_node->GetName().c_str(), dst_node->GetName().c_str());
  585. }
  586. }
  587. }
  588. return SUCCESS;
  589. }
  590. Status HybridModelBuilder::UnfoldSubgraphs(ComputeGraphPtr &root_graph, ComputeGraphPtr &merged_graph) {
  591. merged_graph = MakeShared<ComputeGraph>("MergedGraph");
  592. merged_graph->SetGraphUnknownFlag(root_graph->GetGraphUnknownFlag());
  593. for (const auto &node : root_graph->GetDirectNode()) {
  594. GE_CHECK_NOTNULL(node);
  595. auto op_desc = node->GetOpDesc();
  596. GE_CHECK_NOTNULL(op_desc);
  597. const auto &op_type = node->GetType();
  598. if (op_type != PARTITIONEDCALL) {
  599. merged_graph->AddNode(node);
  600. GELOGD("[%s] Node added to merged graph.", op_desc->GetName().c_str());
  601. continue;
  602. }
  603. auto subgraph = NodeUtils::GetSubgraph(*node, kSubgraphIndex);
  604. GE_CHECK_NOTNULL(subgraph);
  605. bool is_unknown_shape = subgraph->GetGraphUnknownFlag();
  606. if (!is_unknown_shape) {
  607. merged_graph->AddNode(node);
  608. GELOGD("[%s] Known shape partitioned call added to merged graph.", op_desc->GetName().c_str());
  609. continue;
  610. }
  611. if (op_desc->HasAttr(ATTR_STAGE_LEVEL)) {
  612. uint32_t stage_level = UINT32_MAX;
  613. if (AttrUtils::GetInt(node->GetOpDesc(), ATTR_STAGE_LEVEL, stage_level)) {
  614. for (const auto &stage_node : subgraph->GetAllNodes()) {
  615. GELOGD("Set ATTR_STAGE_LEVEL on node %s, stage_level=%u", stage_node->GetName().c_str(), stage_level);
  616. (void)AttrUtils::SetInt(stage_node->GetOpDesc(), ATTR_STAGE_LEVEL, stage_level);
  617. }
  618. }
  619. }
  620. GE_CHK_GRAPH_STATUS_RET(UnfoldSubgraph(root_graph, merged_graph, *subgraph),
  621. "[Invoke][UnfoldSubgraph][%s] Failed to merge subgraph.",
  622. subgraph->GetName().c_str());
  623. }
  624. // invoke before adding subgraphs. in case modify node id in known-shaped subgraphs.
  625. GE_CHK_GRAPH_STATUS_RET(merged_graph->TopologicalSorting(),
  626. "[Invoke][TopologicalSorting]Failed to invoke TopologicalSorting on merged graph.");
  627. GE_DUMP(merged_graph, "hybrid_merged_graph_BeforeStageSort");
  628. merged_graph->TopologicalSorting([](const NodePtr &a, const NodePtr &b) -> bool {
  629. uint32_t a_level = UINT32_MAX;
  630. (void)AttrUtils::GetInt(a->GetOpDesc(), ATTR_STAGE_LEVEL, a_level);
  631. uint32_t b_level = UINT32_MAX;
  632. (void)AttrUtils::GetInt(b->GetOpDesc(), ATTR_STAGE_LEVEL, b_level);
  633. return a_level < b_level;
  634. });
  635. for (auto &remained_subgraph : root_graph->GetAllSubgraphs()) {
  636. GELOGD("Adding subgraph [%s] to merged-graph.", remained_subgraph->GetName().c_str());
  637. GE_CHK_GRAPH_STATUS_RET(merged_graph->AddSubgraph(remained_subgraph),
  638. "[Invoke][AddSubgraph]Failed to add subgraph [%s]",
  639. remained_subgraph->GetName().c_str());
  640. remained_subgraph->SetParentGraph(merged_graph);
  641. }
  642. return SUCCESS;
  643. }
  644. Status HybridModelBuilder::UnfoldSubgraph(ComputeGraphPtr &root_graph,
  645. ComputeGraphPtr &parent_graph,
  646. ComputeGraph &sub_graph) {
  647. auto parent_node = sub_graph.GetParentNode();
  648. GE_CHECK_NOTNULL(parent_node);
  649. GE_CHK_STATUS_RET(MergeInputNodes(sub_graph),
  650. "[Invoke][MergeInputNodes][%s] Failed to merge data nodes for subgraph",
  651. sub_graph.GetName().c_str());
  652. GE_CHK_STATUS_RET(MergeNetOutputNode(sub_graph),
  653. "[Invoke][MergeNetOutputNode][%s] Failed to merge net output nodes for subgraph",
  654. sub_graph.GetName().c_str());
  655. GELOGD("[%s] Done merging subgraph inputs and outputs successfully", sub_graph.GetName().c_str());
  656. for (auto &sub_node : sub_graph.GetDirectNode()) {
  657. auto sub_op_type = sub_node->GetType();
  658. if (sub_op_type == DATA_TYPE || sub_op_type == NETOUTPUT) {
  659. continue;
  660. }
  661. if (sub_op_type == PARTITIONEDCALL) {
  662. auto sub_sub_graph = NodeUtils::GetSubgraph(*sub_node, kSubgraphIndex);
  663. GE_CHECK_NOTNULL(sub_sub_graph);
  664. if (sub_sub_graph->GetGraphUnknownFlag()) {
  665. GE_CHK_STATUS_RET(UnfoldSubgraph(root_graph, parent_graph, *sub_sub_graph),
  666. "[Invoke][UnfoldSubgraph][%s] Failed to merge subgraph",
  667. sub_sub_graph->GetName().c_str());
  668. continue;
  669. }
  670. }
  671. if (!sub_node->GetOpDesc()->GetSubgraphInstanceNames().empty()) {
  672. for (size_t i = 0; i < sub_node->GetOpDesc()->GetSubgraphInstanceNames().size(); ++i) {
  673. auto sub_sub_graph = NodeUtils::GetSubgraph(*sub_node, i);
  674. GE_CHECK_NOTNULL(sub_sub_graph);
  675. sub_sub_graph->SetParentGraph(parent_graph);
  676. }
  677. }
  678. parent_graph->AddNode(sub_node);
  679. GELOGD("[%s::%s] added to parent graph: [%s].",
  680. sub_graph.GetName().c_str(),
  681. sub_node->GetName().c_str(),
  682. parent_graph->GetName().c_str());
  683. sub_node->SetOwnerComputeGraph(parent_graph);
  684. }
  685. GELOGD("[%s] Done merging subgraph. remove it from root graph", sub_graph.GetName().c_str());
  686. root_graph->RemoveSubgraph(sub_graph.GetName());
  687. return SUCCESS;
  688. }
  689. Status HybridModelBuilder::BuildOutputMapping(GraphItem &graph_item,
  690. const NodeItem &node_item,
  691. bool is_root_graph) {
  692. auto output_size = node_item.num_inputs;
  693. graph_item.output_edges_.resize(output_size);
  694. for (auto &in_data_anchor : node_item.node->GetAllInDataAnchors()) {
  695. auto peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  696. GE_CHECK_NOTNULL(peer_out_anchor);
  697. auto src_node = peer_out_anchor->GetOwnerNode();
  698. GE_CHECK_NOTNULL(src_node);
  699. auto src_node_item = GetNodeItem(src_node);
  700. GE_CHECK_NOTNULL(src_node_item);
  701. auto output_idx = in_data_anchor->GetIdx();
  702. auto output_offset = src_node_item->output_start + peer_out_anchor->GetIdx();
  703. GELOGI("Output[%d], node = %s, output_index = %d, output_offset = %d ",
  704. output_idx,
  705. src_node_item->NodeName().c_str(),
  706. peer_out_anchor->GetIdx(),
  707. output_offset);
  708. GE_CHECK_LE(output_idx, output_size - 1);
  709. graph_item.output_edges_[output_idx] = {src_node_item, peer_out_anchor->GetIdx()};
  710. }
  711. if (!is_root_graph) {
  712. for (uint32_t i = 0; i < static_cast<uint32_t>(output_size); ++i) {
  713. uint32_t p_index = i;
  714. // Net output of Subgraph of while do not have parent index
  715. if (AttrUtils::GetInt(node_item.op_desc->GetInputDesc(i), ATTR_NAME_PARENT_NODE_INDEX, p_index)) {
  716. GELOGD("[%s] Parent index not set for input[%u].", node_item.NodeName().c_str(), i);
  717. }
  718. graph_item.output_index_mapping_.emplace_back(p_index);
  719. }
  720. }
  721. return SUCCESS;
  722. }
  723. Status HybridModelBuilder::LoadGraph() {
  724. auto root_graph = ge_root_model_->GetRootGraph();
  725. if (!GetContext().GetHostExecFlag()) {
  726. std::shared_ptr<ComputeGraph> merged_graph;
  727. GELOGI("Before merging subgraphs DirectNodesSize = %zu, GetAllNodesSize = %zu",
  728. root_graph->GetDirectNodesSize(),
  729. root_graph->GetAllNodesSize());
  730. GE_CHK_GRAPH_STATUS_RET(UnfoldSubgraphs(root_graph, merged_graph),
  731. "[Invoke][UnfoldSubgraphs]Failed to unfold subgraphs, model_name_:%s.", GetGraphName());
  732. root_graph = std::move(merged_graph);
  733. GELOGI("After merging subgraphs DirectNodesSize = %zu, GetAllNodesSize = %zu",
  734. root_graph->GetDirectNodesSize(),
  735. root_graph->GetAllNodesSize());
  736. }
  737. hybrid_model_.root_graph_ = root_graph;
  738. GE_CHK_STATUS_RET(RelinkNextIteration(), "[%s] Relink NextIteration failed", GetGraphName());
  739. // Reset node id by topological order across all subgraphs
  740. int64_t index = 0;
  741. for (const auto &node : root_graph->GetAllNodes()) {
  742. GE_CHECK_NOTNULL(node);
  743. auto parent_graph = node->GetOwnerComputeGraph();
  744. // No need to update nodes in known subgraph
  745. if (parent_graph != nullptr && !parent_graph->GetGraphUnknownFlag()) {
  746. continue;
  747. }
  748. auto op_desc = node->GetOpDesc();
  749. GE_CHECK_NOTNULL(op_desc);
  750. op_desc->SetId(index++);
  751. }
  752. GE_DUMP(root_graph, "hybrid_merged_graph");
  753. GE_CHK_STATUS_RET(LoadDynamicSubgraph(*root_graph, true),
  754. "[Invoke][LoadDynamicSubgraph]Failed to load root graph, model_name_:%s.", GetGraphName());
  755. GELOGD("Done loading root graph successfully.");
  756. GE_CHK_STATUS_RET(hybrid_model_.root_graph_item_->GroupNodes(),
  757. "[Invoke][GroupNodes]Failed to group nodes for root graph, model_name_:%s.", GetGraphName());
  758. for (auto &sub_graph : root_graph->GetAllSubgraphs()) {
  759. GE_CHECK_NOTNULL(sub_graph);
  760. GELOGD("Start to load subgraph [%s]", sub_graph->GetName().c_str());
  761. auto parent_node = sub_graph->GetParentNode();
  762. GE_CHECK_NOTNULL(parent_node);
  763. auto parent_node_item = MutableNodeItem(parent_node);
  764. // parent node is in another known subgraph
  765. if (parent_node_item == nullptr) {
  766. GELOGD("[%s] Subgraph is in another known shaped subgraph, skip it.", sub_graph->GetName().c_str());
  767. continue;
  768. }
  769. if (sub_graph->GetGraphUnknownFlag()) {
  770. GE_CHK_STATUS_RET(LoadDynamicSubgraph(*sub_graph, false),
  771. "[Invoke][LoadDynamicSubgraph]Failed to load subgraph: [%s]",
  772. sub_graph->GetName().c_str());
  773. } else {
  774. // if parent is function control op. need add a virtual partitioned call
  775. if (parent_node_item->IsControlFlowV2Op()) {
  776. GE_CHK_STATUS_RET(LoadKnownShapedSubgraph(*sub_graph, parent_node_item),
  777. "[Invoke][LoadKnownShapedSubgraph]Failed to load function control op subgraph [%s]",
  778. sub_graph->GetName().c_str());
  779. }
  780. }
  781. }
  782. for (auto &it : hybrid_model_.known_shape_sub_models_) {
  783. auto node_item = MutableNodeItem(it.first);
  784. AscendString graph_name;
  785. GE_CHK_GRAPH_STATUS_RET(it.second->GetGraph().GetName(graph_name), "Failed to get subgraph name");
  786. auto subgraph = hybrid_model_.GetRootGraph()->GetSubgraph(graph_name.GetString());
  787. GE_CHECK_NOTNULL(subgraph);
  788. GE_CHK_STATUS_RET(IdentifyVariableOutputs(*node_item, subgraph),
  789. "[Invoke][IdentifyVariableOutputs][%s] Failed to identify ref outputs.",
  790. node_item->NodeName().c_str());
  791. }
  792. GE_CHK_STATUS_RET(ParseDependentByParallelGroup(),
  793. "[Invoke][ParseDependentByParallelGroup]Failed to establish dependencies for hccl ops,"
  794. "model_name_:%s.", GetGraphName());
  795. GELOGI("Done loading all subgraphs successfully.");
  796. return SUCCESS;
  797. }
  798. const NodeItem *HybridModelBuilder::GetNodeItem(const NodePtr &node) const {
  799. return hybrid_model_.GetNodeItem(node);
  800. }
  801. NodeItem *HybridModelBuilder::MutableNodeItem(const NodePtr &node) {
  802. return hybrid_model_.MutableNodeItem(node);
  803. }
  804. Status HybridModelBuilder::VarNodeToTensor(const NodePtr &var_node, std::unique_ptr<TensorValue> &tensor) {
  805. string var_name = var_node->GetName();
  806. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  807. uint8_t *var_logic = nullptr;
  808. GE_CHK_STATUS_RET(var_manager_->GetVarAddr(var_name, *tensor_desc, &var_logic),
  809. "[Invoke][GetVarAddr]Failed to get var addr. var_name = %s, session_id = %ld",
  810. var_name.c_str(),
  811. hybrid_model_.GetSessionId());
  812. rtMemType_t memory_type = RT_MEMORY_HBM;
  813. uint32_t mem_type = 0;
  814. if (AttrUtils::GetInt(var_node->GetOpDesc(), ATTR_OUTPUT_MEMORY_TYPE, mem_type) && (mem_type == 1)) {
  815. memory_type = RT_MEMORY_RDMA_HBM;
  816. }
  817. uint8_t *dev_mem = var_manager_->GetVarMemoryAddr(var_logic, memory_type);
  818. if (dev_mem == nullptr) {
  819. GELOGE(INTERNAL_ERROR, "[Invoke][GetVarMemoryAddr]Failed to copy var %s from device,"
  820. "cant not get var addr from logic addr %p", var_node->GetName().c_str(), var_logic);
  821. REPORT_CALL_ERROR("E19999", "GetVarMemoryAddr failed, Failed to copy var %s from device,"
  822. "cant not get var addr from logic addr %p", var_node->GetName().c_str(), var_logic);
  823. return INTERNAL_ERROR;
  824. }
  825. int64_t var_size = CalcVarSizeInBytes(*tensor_desc);
  826. // var size is only for checking, will not allocate any memory by it
  827. tensor.reset(new(std::nothrow)TensorValue(dev_mem, static_cast<size_t>(var_size)));
  828. GE_CHECK_NOTNULL(tensor);
  829. GELOGI("Get var memory addr %p for node %s, size = %ld, mem_type=%u", dev_mem, var_name.c_str(), var_size, mem_type);
  830. return SUCCESS;
  831. }
  832. Status HybridModelBuilder::HandleDtString(const GeTensor &tensor, void *var_addr) {
  833. auto desc = tensor.GetTensorDesc();
  834. if (desc.GetDataType() == DT_STRING) {
  835. GeShape tensor_shape = desc.GetShape();
  836. /// if tensor is a scaler, it's shape size if zero, according ge_tensor.cc.
  837. /// the logic of GetShapeSize is wrong, the scaler tensor's GetShapeSize is zero
  838. /// and that of unknown shape is zero too.
  839. /// unknown shape will not appear here, so we can use zero judge a tensor is scalar or not
  840. int64_t elem_num = tensor_shape.GetShapeSize();
  841. if (elem_num == 0 && tensor_shape.GetDims().empty()) {
  842. elem_num = 1;
  843. }
  844. auto &mutable_tensor = const_cast<GeTensor &>(tensor);
  845. uint64_t *buff = reinterpret_cast<uint64_t *>(mutable_tensor.MutableData().data());
  846. GE_CHK_BOOL_RET_STATUS(ge::CheckInt64Uint32MulOverflow(elem_num, kBytes * kStringHeadElems) == SUCCESS, FAILED,
  847. "[Invoke][CheckInt64Uint32MulOverflow] failed because Shape size is invalid.");
  848. auto offset = static_cast<uint64_t>(elem_num * kBytes * kStringHeadElems);
  849. auto hbm_raw_data_base_addr =
  850. static_cast<uint64_t>(reinterpret_cast<uintptr_t>(var_addr) + offset);
  851. for (int64_t i = elem_num - 1; i >= 0; --i) {
  852. buff[i * kStringHeadElems] = hbm_raw_data_base_addr + (buff[i * kStringHeadElems] - buff[0]);
  853. }
  854. }
  855. return SUCCESS;
  856. }
  857. Status HybridModelBuilder::AssignUninitializedConstantOps() {
  858. if (GetContext().GetHostExecFlag()) {
  859. GELOGI("no need to assign when exec on host.");
  860. return SUCCESS;
  861. }
  862. for (auto &it : constant_op_nodes_) {
  863. const string &var_name = it.first;
  864. const NodePtr &var_node = it.second;
  865. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  866. if (!var_manager_->IsVarExist(var_name, *tensor_desc)) {
  867. // allocate constant
  868. GELOGD("[%s] Constant not allocated during graph building. now allocate it.", var_name.c_str());
  869. GE_CHK_STATUS_RET(var_manager_->AssignVarMem(var_name, *tensor_desc, RT_MEMORY_HBM));
  870. GE_CHK_STATUS_RET(var_manager_->SetAllocatedGraphId(var_name, runtime_param_.graph_id));
  871. }
  872. }
  873. for (auto &it : hybrid_model_.device_variable_nodes_) {
  874. const string &var_name = it.first;
  875. const NodePtr &var_node = it.second;
  876. auto tensor_desc = var_node->GetOpDesc()->MutableOutputDesc(0);
  877. if (!var_manager_->IsVarExist(var_name, *tensor_desc)) {
  878. // allocate constant
  879. GELOGD("[%s] Constant not allocated during graph building. now allocate it.", var_name.c_str());
  880. GE_CHK_STATUS_RET(var_manager_->AssignVarMem(var_name, *tensor_desc, RT_MEMORY_HBM));
  881. GE_CHK_STATUS_RET(VarMemAssignUtil::AssignData2Fp32Var(var_node, runtime_param_.session_id))
  882. GE_CHK_STATUS_RET(var_manager_->SetAllocatedGraphId(var_name, runtime_param_.graph_id));
  883. }
  884. }
  885. return SUCCESS;
  886. }
  887. Status HybridModelBuilder::InitConstantOps() {
  888. for (auto &it : constant_op_nodes_) {
  889. const string &var_name = it.first;
  890. const NodePtr &var_node = it.second;
  891. auto op_desc = var_node->GetOpDesc();
  892. auto v_weights = ModelUtils::GetWeights(op_desc);
  893. if (v_weights.empty()) {
  894. GELOGE(INTERNAL_ERROR, "[Check][Size][%s] Constant op has no weight", var_node->GetName().c_str());
  895. return INTERNAL_ERROR;
  896. }
  897. auto *ge_tensor = const_cast<GeTensor *>(v_weights[0].get());
  898. std::unique_ptr<TensorValue> var_tensor;
  899. if (GetContext().GetHostExecFlag()) {
  900. GE_CHECK_NOTNULL(ge_tensor);
  901. // Address for eigen kernel should be aligned with 16 bytes
  902. // Tensors return by api GetWeights share data with proto, whose addr is not confirmed to be aligned
  903. GeTensor aligned_tensor = ge_tensor->Clone();
  904. GELOGD("Init tensor with host constant %s size = %zu", var_name.c_str(), aligned_tensor.MutableData().GetSize());
  905. if (aligned_tensor.GetData().size() > 0) {
  906. if (MemManager::Instance().HostMemInstance(RT_MEMORY_HBM).Malloc(aligned_tensor.GetAlignedPtr(),
  907. aligned_tensor.GetData().size()) == nullptr) {
  908. GELOGE(MEMALLOC_FAILED, "[Malloc][HostMemory] for an existed GeTensor failed, model_name_:%s.",
  909. GetGraphName());
  910. return MEMALLOC_FAILED;
  911. }
  912. var_tensor.reset(new(std::nothrow)TensorValue(aligned_tensor.MutableData().data(),
  913. aligned_tensor.GetData().size()));
  914. } else {
  915. var_tensor.reset(new(std::nothrow)TensorValue(nullptr, 0));
  916. }
  917. } else {
  918. GE_CHK_STATUS_RET_NOLOG(VarNodeToTensor(var_node, var_tensor));
  919. GELOGD("Init const op tensor. name = %s, size = %ld", var_name.c_str(), var_tensor->GetSize());
  920. var_tensor->SetName("ConstOp_" + var_name);
  921. auto v_output_size = var_tensor->GetSize();
  922. auto v_output_addr = var_tensor->MutableData();
  923. if (ge_tensor->GetData().size() > 0) {
  924. GE_CHK_STATUS_RET_NOLOG(HandleDtString(*ge_tensor, v_output_addr));
  925. GELOGI("[IMAS]InitConstant memcpy graph_%u type[V] name[%s] output[%d] memaddr[%p]"
  926. "mem_size[%zu] datasize[%zu]",
  927. runtime_param_.graph_id, op_desc->GetName().c_str(), 0, v_output_addr, v_output_size,
  928. ge_tensor->GetData().size());
  929. GE_CHK_RT_RET(rtMemcpy(v_output_addr, v_output_size, ge_tensor->GetData().data(), ge_tensor->GetData().size(),
  930. RT_MEMCPY_HOST_TO_DEVICE));
  931. } else {
  932. GELOGI("[%s] Const op has no weight data.", op_desc->GetName().c_str());
  933. }
  934. }
  935. hybrid_model_.variable_tensors_.emplace(var_name, std::move(var_tensor));
  936. }
  937. return SUCCESS;
  938. }
  939. Status HybridModelBuilder::InitVariableTensors() {
  940. for (auto &it : hybrid_model_.device_variable_nodes_) {
  941. string var_name = it.first;
  942. NodePtr &var_node = it.second;
  943. std::unique_ptr<TensorValue> tensor;
  944. GE_CHK_STATUS_RET_NOLOG(VarNodeToTensor(var_node, tensor));
  945. GELOGD("Init variable tensor. name = %s, size = %ld, addr = %p",
  946. var_name.c_str(),
  947. tensor->GetSize(),
  948. tensor->GetData());
  949. tensor->SetName("Var_" + var_name);
  950. hybrid_model_.variable_tensors_.emplace(var_name, std::move(tensor));
  951. }
  952. for (const auto &it : hybrid_model_.host_variable_nodes_) {
  953. auto op_desc = it.second->GetOpDesc();
  954. GE_CHECK_NOTNULL(op_desc);
  955. GeTensorDesc output_tensor = op_desc->GetOutputDesc(0);
  956. int64_t tensor_size = 0;
  957. if (TensorUtils::CalcTensorMemSize(output_tensor.GetShape(), output_tensor.GetFormat(),
  958. output_tensor.GetDataType(), tensor_size) != SUCCESS) {
  959. REPORT_CALL_ERROR("E19999", "CalcTensorMemSize failed, node name:%s", it.first.c_str());
  960. GELOGE(INTERNAL_ERROR, "[Calculate][TensorMemSize] failed, node name:%s", it.first.c_str());
  961. return INTERNAL_ERROR;
  962. }
  963. SharedMemInfo mem_info(it.first, tensor_size);
  964. if (HostMemManager::Instance().MallocSharedMemory(mem_info) != SUCCESS) {
  965. GELOGE(GE_GRAPH_MALLOC_FAILED, "[Malloc][SharedMemory] failed, Host variable [%s].", it.first.c_str());
  966. return GE_GRAPH_MALLOC_FAILED;
  967. }
  968. if (MemManager::Instance().HostMemInstance(RT_MEMORY_HBM).Malloc(mem_info.host_aligned_ptr,
  969. tensor_size) == nullptr) {
  970. GELOGE(MEMALLOC_FAILED, "[Malloc][HostMem] for an existed GeTensor failed, Host variable [%s].",
  971. it.first.c_str());
  972. return MEMALLOC_FAILED;
  973. }
  974. GELOGD("Host variable [%s] malloc success, size=%ld.", it.first.c_str(), tensor_size);
  975. std::unique_ptr<TensorValue> tensor(new (std::nothrow) TensorValue(mem_info.host_aligned_ptr->MutableGet(),
  976. tensor_size));
  977. GE_CHECK_NOTNULL(tensor);
  978. hybrid_model_.variable_tensors_.emplace(it.first, std::move(tensor));
  979. }
  980. return SUCCESS;
  981. }
  982. Status HybridModelBuilder::InitWeights() {
  983. // For constant in root graph
  984. for (const auto &subgraph_model : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  985. const auto &weight_buffer = subgraph_model.second->GetWeight();
  986. if (weight_buffer.GetSize() == 0) {
  987. GELOGD("weight is empty");
  988. return SUCCESS;
  989. }
  990. auto allocator = NpuMemoryAllocator::GetAllocator();
  991. GE_CHECK_NOTNULL(allocator);
  992. auto sub_weight_buffer = TensorBuffer::Create(allocator, weight_buffer.size());
  993. GE_CHECK_NOTNULL(sub_weight_buffer);
  994. auto weight_base = reinterpret_cast<uint8_t *>(sub_weight_buffer->GetData());
  995. GE_CHK_RT_RET(rtMemcpy(weight_base,
  996. sub_weight_buffer->GetSize(),
  997. weight_buffer.GetData(),
  998. weight_buffer.GetSize(),
  999. RT_MEMCPY_HOST_TO_DEVICE));
  1000. GELOGI("Init weight mem successfully, weight base %p, weight size = %zu",
  1001. weight_base,
  1002. sub_weight_buffer->GetSize());
  1003. auto subgraph = GraphUtils::GetComputeGraph(subgraph_model.second->GetGraph());
  1004. if (subgraph != ge_root_model_->GetRootGraph()) {
  1005. subgraph = ge_root_model_->GetRootGraph()->GetSubgraph(subgraph_model.first);
  1006. }
  1007. GE_CHECK_NOTNULL(subgraph);
  1008. hybrid_model_.weight_buffer_map_.emplace(subgraph->GetName(), std::move(sub_weight_buffer));
  1009. for (auto &node : subgraph->GetDirectNode()) {
  1010. if (node->GetType() != CONSTANT) {
  1011. continue;
  1012. }
  1013. auto op_desc = node->GetOpDesc();
  1014. auto v_weights = ModelUtils::GetWeights(op_desc);
  1015. if (v_weights.empty()) {
  1016. GELOGE(INTERNAL_ERROR, "[Invoke][GetWeights][%s] Constant has no value", node->GetName().c_str());
  1017. REPORT_CALL_ERROR("E19999", "[%s] Constant has no value.", node->GetName().c_str());
  1018. return INTERNAL_ERROR;
  1019. }
  1020. auto *ge_tensor = const_cast<GeTensor *>(v_weights[0].get());
  1021. GE_CHECK_NOTNULL(ge_tensor);
  1022. const GeTensorDesc &tensor_desc = ge_tensor->GetTensorDesc();
  1023. int64_t tensor_size = 0;
  1024. GE_CHK_GRAPH_STATUS_RET(TensorUtils::GetSize(*op_desc->MutableOutputDesc(0), tensor_size),
  1025. "[Invoke][GetSize][%s] Failed to get output tensor size",
  1026. node->GetName().c_str());
  1027. int64_t data_offset = 0;
  1028. GE_CHK_GRAPH_STATUS_RET(TensorUtils::GetDataOffset(tensor_desc, data_offset),
  1029. "[Invoke][GetDataOffset][%s] Failed to get data offset",
  1030. node->GetName().c_str());
  1031. GELOGD("[%s] Start to init Constant node [%s], size = %ld, offset = %ld",
  1032. GetGraphName(),
  1033. node->GetName().c_str(),
  1034. tensor_size,
  1035. data_offset);
  1036. auto tensor_buffer = TensorBuffer::Create(weight_base + data_offset, tensor_size);
  1037. GE_CHECK_NOTNULL(tensor_buffer);
  1038. std::unique_ptr<TensorValue> constant_tensor(new (std::nothrow)TensorValue(std::move(tensor_buffer)));
  1039. GE_CHECK_NOTNULL(constant_tensor);
  1040. constant_tensor->SetName("Constant_" + op_desc->GetName());
  1041. hybrid_model_.constant_tensors_.emplace(node, std::move(constant_tensor));
  1042. GELOGD("[%s] Constant node [%s] added, size = %ld", GetGraphName(), node->GetName().c_str(), tensor_size);
  1043. }
  1044. }
  1045. return SUCCESS;
  1046. }
  1047. Status HybridModelBuilder::LoadTask(NodeItem &node_item) {
  1048. auto &node_ptr = node_item.node;
  1049. GELOGD("[%s] Start to build kernel task", node_ptr->GetName().c_str());
  1050. auto load_ret = node_item.node_executor->LoadTask(hybrid_model_,
  1051. node_ptr,
  1052. node_item.kernel_task);
  1053. if (load_ret != UNSUPPORTED && load_ret != SUCCESS) {
  1054. GELOGE(load_ret, "[Invoke][LoadTask][%s] Failed to load task", node_ptr->GetName().c_str());
  1055. REPORT_CALL_ERROR("E19999", "[%s] Failed to load task", node_ptr->GetName().c_str());
  1056. return load_ret;
  1057. }
  1058. GELOGD("[%s] Done loading task successfully.", node_ptr->GetName().c_str());
  1059. return SUCCESS;
  1060. }
  1061. Status HybridModelBuilder::LoadTasks() {
  1062. GE_CHK_STATUS_RET(CheckAicpuOpList(), "[Check][AicpuOpList] failed.");
  1063. std::map<int, std::map<std::string, NodeItem *>> ordered_partitioned_calls;
  1064. for (auto &it : hybrid_model_.node_items_) {
  1065. auto &node_item = it.second;
  1066. if (node_item->node_type == NETOUTPUT) {
  1067. continue;
  1068. }
  1069. if (node_item->node_type == PARTITIONEDCALL) {
  1070. ordered_partitioned_calls[node_item->node_id][node_item->node_name] = node_item.get();
  1071. continue;
  1072. }
  1073. GE_CHK_STATUS_RET_NOLOG(LoadTask(*node_item));
  1074. }
  1075. // HCCL operators need to be loaded in the same order across different processes
  1076. for (auto &it : ordered_partitioned_calls) {
  1077. for (auto &it2 : it.second) {
  1078. GE_CHK_STATUS_RET_NOLOG(LoadTask(*it2.second));
  1079. }
  1080. }
  1081. return SUCCESS;
  1082. }
  1083. Status HybridModelBuilder::LoadGeModel(ComputeGraph &sub_graph, const GeModelPtr &ge_model) {
  1084. auto parent_node = sub_graph.GetParentNode();
  1085. GE_CHECK_NOTNULL(parent_node);
  1086. auto op_type = parent_node->GetType();
  1087. if (IsControlFlowV2Op(op_type)) {
  1088. GELOGD("Set ge_model for control op subgraph: [%s], task_size = %d",
  1089. sub_graph.GetName().c_str(),
  1090. ge_model->GetModelTaskDefPtr()->task_size());
  1091. subgraph_models_.emplace(sub_graph.GetName(), ge_model);
  1092. } else {
  1093. GELOGD("Set ge_model for subgraph: [%s], task_size = %d",
  1094. sub_graph.GetName().c_str(),
  1095. ge_model->GetModelTaskDefPtr()->task_size());
  1096. hybrid_model_.known_shape_sub_models_.emplace(parent_node, ge_model);
  1097. }
  1098. return SUCCESS;
  1099. }
  1100. Status HybridModelBuilder::IndexTaskDefs(const ComputeGraphPtr &sub_graph, const GeModelPtr &ge_model) {
  1101. // index task defs
  1102. GELOGD("To index tasks for subgraph: %s", sub_graph->GetName().c_str());
  1103. std::unordered_map<int64_t, NodePtr> node_map;
  1104. for (const auto &node : sub_graph->GetDirectNode()) {
  1105. GE_CHECK_NOTNULL(node);
  1106. GE_CHECK_NOTNULL(node->GetOpDesc());
  1107. auto node_id = node->GetOpDesc()->GetId();
  1108. GELOGD("op_index = %ld, node_name = %s", node_id, node->GetName().c_str());
  1109. node_map.emplace(node_id, node);
  1110. }
  1111. auto tasks = ge_model->GetModelTaskDefPtr()->task();
  1112. for (int i = 0; i < tasks.size(); ++i) {
  1113. const domi::TaskDef &task_def = tasks[i];
  1114. GELOGI("Task id = %d, task type = %d", i, task_def.type());
  1115. auto task_type = static_cast<rtModelTaskType_t>(task_def.type());
  1116. uint32_t op_index = -1;
  1117. if (task_type == RT_MODEL_TASK_KERNEL) {
  1118. op_index = task_def.kernel().context().op_index();
  1119. } else if (task_type == RT_MODEL_TASK_KERNEL_EX) {
  1120. op_index = task_def.kernel_ex().op_index();
  1121. } else if (task_type == RT_MODEL_TASK_HCCL) {
  1122. op_index = task_def.kernel_hccl().op_index();
  1123. } else if (task_type == RT_MODEL_TASK_ALL_KERNEL) {
  1124. op_index = task_def.kernel_with_handle().context().op_index();
  1125. } else {
  1126. GELOGD("Skip task type: %d", static_cast<int>(task_type));
  1127. continue;
  1128. }
  1129. GELOGD("op_index = %u, task_type = %d", op_index, task_type);
  1130. auto iter = node_map.find(op_index);
  1131. if (iter == node_map.end()) {
  1132. GELOGE(INTERNAL_ERROR, "[Find][Node]Failed to get node by op_index = %u", op_index);
  1133. REPORT_INNER_ERROR("E19999", "Failed to get node by op_index = %u.", op_index);
  1134. return INTERNAL_ERROR;
  1135. }
  1136. auto &node = iter->second;
  1137. if (task_type == RT_MODEL_TASK_KERNEL || task_type == RT_MODEL_TASK_ALL_KERNEL) {
  1138. ge_model->GetTBEKernelStore().LoadTBEKernelBinToOpDesc(node->GetOpDesc());
  1139. }
  1140. GELOGD("Task loaded for node: %s, task type = %d, op_index = %u", node->GetName().c_str(), task_type, op_index);
  1141. hybrid_model_.task_defs_[node].emplace_back(task_def);
  1142. }
  1143. return SUCCESS;
  1144. }
  1145. Status HybridModelBuilder::IndexTaskDefs() {
  1146. const auto &root_graph = ge_root_model_->GetRootGraph();
  1147. if (SetOutputNameAttr(*root_graph) != SUCCESS) {
  1148. GELOGW("Set output name attr failed.");
  1149. }
  1150. for (auto &it : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  1151. auto &name = it.first;
  1152. auto &ge_model = it.second;
  1153. GE_CHECK_NOTNULL(ge_model);
  1154. const auto &sub_graph = root_graph->GetSubgraph(name);
  1155. if (sub_graph == nullptr) {
  1156. continue;
  1157. }
  1158. bool is_unknown_shape = sub_graph->GetGraphUnknownFlag();
  1159. if (!is_unknown_shape) {
  1160. GE_CHK_STATUS_RET_NOLOG(LoadGeModel(*sub_graph, ge_model));
  1161. continue;
  1162. }
  1163. // index task defs
  1164. GELOGD("To index tasks for subgraph: %s", name.c_str());
  1165. std::unordered_map<int64_t, NodePtr> node_map;
  1166. for (const auto &node : sub_graph->GetDirectNode()) {
  1167. GE_CHECK_NOTNULL(node);
  1168. GE_CHECK_NOTNULL(node->GetOpDesc());
  1169. auto node_id = node->GetOpDesc()->GetId();
  1170. GELOGD("op_index = %ld, node_name = %s", node_id, node->GetName().c_str());
  1171. node_map.emplace(node_id, node);
  1172. }
  1173. auto tasks = ge_model->GetModelTaskDefPtr()->task();
  1174. for (int i = 0; i < tasks.size(); ++i) {
  1175. const domi::TaskDef &task_def = tasks[i];
  1176. GELOGI("Task id = %d, task type = %d", i, task_def.type());
  1177. auto task_type = static_cast<rtModelTaskType_t>(task_def.type());
  1178. uint32_t op_index = -1;
  1179. if (task_type == RT_MODEL_TASK_KERNEL) {
  1180. op_index = task_def.kernel().context().op_index();
  1181. } else if (task_type == RT_MODEL_TASK_KERNEL_EX) {
  1182. op_index = task_def.kernel_ex().op_index();
  1183. } else if (task_type == RT_MODEL_TASK_HCCL) {
  1184. op_index = task_def.kernel_hccl().op_index();
  1185. } else if (task_type == RT_MODEL_TASK_ALL_KERNEL) {
  1186. op_index = task_def.kernel_with_handle().context().op_index();
  1187. } else {
  1188. GELOGD("Skip task type: %d", static_cast<int>(task_type));
  1189. continue;
  1190. }
  1191. auto iter = node_map.find(op_index);
  1192. if (iter == node_map.end()) {
  1193. GELOGE(INTERNAL_ERROR, "[Find][Node]Failed to get node by index = %u.", op_index);
  1194. REPORT_INNER_ERROR("E19999", "Failed to get node by index = %u.", op_index);
  1195. return INTERNAL_ERROR;
  1196. }
  1197. auto &node = iter->second;
  1198. if (task_type == RT_MODEL_TASK_KERNEL || task_type == RT_MODEL_TASK_ALL_KERNEL) {
  1199. ge_model->GetTBEKernelStore().LoadTBEKernelBinToOpDesc(node->GetOpDesc());
  1200. }
  1201. GELOGD("Task loaded for node: %s, task type = %d, op_index = %u", node->GetName().c_str(), task_type, op_index);
  1202. hybrid_model_.task_defs_[node].emplace_back(task_def);
  1203. }
  1204. }
  1205. return SUCCESS;
  1206. }
  1207. Status HybridModelBuilder::IndexSpecialNodes() {
  1208. GELOGD("Start to index special nodes");
  1209. const auto &root_graph = ge_root_model_->GetRootGraph();
  1210. for (auto &node : root_graph->GetAllNodes()) {
  1211. GE_CHECK_NOTNULL(node);
  1212. GE_CHECK_NOTNULL(node->GetOpDesc());
  1213. auto op_type = node->GetType();
  1214. GELOGD("node name = %s, node type = %s", node->GetName().c_str(), node->GetType().c_str());
  1215. if (op_type == VARIABLE) {
  1216. string placement;
  1217. (void) AttrUtils::GetStr(node->GetOpDesc(), ATTR_VARIABLE_PLACEMENT, placement);
  1218. if (placement == "host") {
  1219. hybrid_model_.host_variable_nodes_.emplace(node->GetName(), node);
  1220. } else {
  1221. hybrid_model_.device_variable_nodes_.emplace(node->GetName(), node);
  1222. }
  1223. } else if (op_type == CONSTANTOP) {
  1224. constant_op_nodes_.emplace(node->GetName(), node);
  1225. } else if (op_type == STREAMMERGE) {
  1226. stream_merge_op_nodes_.emplace(node->GetName(), node);
  1227. } else if (op_type == NEXTITERATION || op_type == REFNEXTITERATION) {
  1228. next_iteration_op_nodes_.emplace(node->GetName(), node);
  1229. } else if (op_type == DATA && node->GetOwnerComputeGraph() != root_graph) {
  1230. NodePtr src_node;
  1231. int peer_out_index = -1;
  1232. GE_CHK_STATUS_RET_NOLOG(GetPeerNodeAcrossSubGraphs(node, src_node, peer_out_index));
  1233. GELOGD("Got peer node for data node %s, peer node = %s(%s)",
  1234. node->GetName().c_str(),
  1235. src_node->GetName().c_str(),
  1236. src_node->GetType().c_str());
  1237. auto src_op_type = src_node->GetType();
  1238. if (src_op_type == CONSTANTOP || src_op_type == VARIABLE) {
  1239. for (auto &dst_node_and_in_anchor : node->GetOutDataNodesAndAnchors()) {
  1240. auto &dst_node = dst_node_and_in_anchor.first;
  1241. auto &in_anchor = dst_node_and_in_anchor.second;
  1242. node_ref_inputs_[dst_node].emplace_back(std::make_pair(in_anchor->GetIdx(), src_node));
  1243. }
  1244. }
  1245. }
  1246. }
  1247. return SUCCESS;
  1248. }
  1249. Status HybridModelBuilder::GetPeerNodeAcrossSubGraphs(const NodePtr &data_node,
  1250. NodePtr &peer_node,
  1251. int &peer_out_index) {
  1252. auto sub_graph = data_node->GetOwnerComputeGraph();
  1253. GE_CHECK_NOTNULL(sub_graph);
  1254. GELOGD("To get peer node of %s::%s", sub_graph->GetName().c_str(), data_node->GetName().c_str());
  1255. auto wrapped_node = data_node->GetOwnerComputeGraph()->GetParentNode();
  1256. if (wrapped_node == nullptr) {
  1257. REPORT_INNER_ERROR("E19999", "[%s] Node is in root graph.", data_node->GetName().c_str());
  1258. GELOGE(INTERNAL_ERROR, "[Invoke][GetParentNode][%s] Node is in root graph.", data_node->GetName().c_str());
  1259. return INTERNAL_ERROR;
  1260. }
  1261. auto data_op_desc = data_node->GetOpDesc();
  1262. uint32_t parent_index = 0;
  1263. if (!AttrUtils::GetInt(data_op_desc, ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  1264. REPORT_CALL_ERROR("E19999", "[%s] Failed to get attr [%s].", data_op_desc->GetName().c_str(),
  1265. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1266. GELOGE(INTERNAL_ERROR, "[Invoke][GetInt][%s] Failed to get attr [%s]",
  1267. data_op_desc->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1268. return INTERNAL_ERROR;
  1269. }
  1270. auto wrapped_node_in_anchor = wrapped_node->GetInDataAnchor(parent_index);
  1271. GE_CHECK_NOTNULL(wrapped_node_in_anchor);
  1272. auto src_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  1273. if (src_out_anchor == nullptr || src_out_anchor->GetOwnerNode() == nullptr) {
  1274. REPORT_INNER_ERROR("E19999", "[%s] Parent node do not have peer anchor.", data_node->GetName().c_str());
  1275. GELOGE(INTERNAL_ERROR,
  1276. "[Check][ParentNode][%s] Parent node do not have peer anchor.", data_node->GetName().c_str());
  1277. return INTERNAL_ERROR;
  1278. }
  1279. auto src_wrapped_node_out_anchor = wrapped_node_in_anchor->GetPeerOutAnchor();
  1280. GE_CHECK_NOTNULL(src_wrapped_node_out_anchor);
  1281. auto src_wrapped_node = src_wrapped_node_out_anchor->GetOwnerNode();
  1282. GE_CHECK_NOTNULL(src_wrapped_node);
  1283. // connected to root-graph's DATA
  1284. auto src_node_type = src_wrapped_node->GetType();
  1285. if (src_node_type != PARTITIONEDCALL) {
  1286. peer_node = src_wrapped_node;
  1287. peer_out_index = kVarOutputIndex;
  1288. GELOGD("[%s] Node is connected to root graph's node: %s",
  1289. data_node->GetName().c_str(),
  1290. peer_node->GetName().c_str());
  1291. return SUCCESS;
  1292. }
  1293. auto src_graph = NodeUtils::GetSubgraph(*src_wrapped_node, kSubgraphIndex);
  1294. GE_CHECK_NOTNULL(src_graph);
  1295. auto src_net_output_node = src_graph->FindFirstNodeMatchType(NETOUTPUT);
  1296. if (src_net_output_node == nullptr) {
  1297. REPORT_INNER_ERROR("E19999", "Failed to find NetOutput in subgraph: %s", src_graph->GetName().c_str());
  1298. GELOGE(INTERNAL_ERROR, "[Invoke][FindFirstNodeMatchType]Failed to find NetOutput in subgraph: %s",
  1299. src_graph->GetName().c_str());
  1300. return INTERNAL_ERROR;
  1301. }
  1302. auto net_output_desc = src_net_output_node->GetOpDesc();
  1303. GE_CHECK_NOTNULL(net_output_desc);
  1304. auto out_index = static_cast<uint32_t>(src_wrapped_node_out_anchor->GetIdx());
  1305. GELOGD("src graph = %s, src parent output index = %u", src_graph->GetName().c_str(), out_index);
  1306. // link src to outputs of DataNode
  1307. auto input_size = net_output_desc->GetAllInputsSize();
  1308. GE_CHECK_LE(input_size, UINT32_MAX);
  1309. for (uint32_t i = 0; i < static_cast<uint32_t>(input_size); ++i) {
  1310. uint32_t p_index = 0;
  1311. if (!AttrUtils::GetInt(net_output_desc->GetInputDesc(i), ATTR_NAME_PARENT_NODE_INDEX, p_index)) {
  1312. GELOGW("SubGraph: %s input tensor %u attr %s not found.",
  1313. src_graph->GetName().c_str(), i, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1314. continue;
  1315. }
  1316. GELOGD("NetOutput's input[%u], parent_node_index = %u", i, p_index);
  1317. if (p_index == out_index) {
  1318. auto in_anchor = src_net_output_node->GetInDataAnchor(i);
  1319. GE_CHECK_NOTNULL(in_anchor);
  1320. auto peer_out_anchor = in_anchor->GetPeerOutAnchor();
  1321. GE_CHECK_NOTNULL(peer_out_anchor);
  1322. peer_node = peer_out_anchor->GetOwnerNode();
  1323. GE_CHECK_NOTNULL(peer_node);
  1324. peer_out_index = peer_out_anchor->GetIdx();
  1325. GELOGD("Found peer node of Data node: %s::%s is %s::%s",
  1326. sub_graph->GetName().c_str(),
  1327. data_node->GetName().c_str(),
  1328. src_graph->GetName().c_str(),
  1329. peer_node->GetName().c_str());
  1330. return SUCCESS;
  1331. }
  1332. }
  1333. GELOGE(FAILED, "[Get][PeerNode]Failed to find peer node for %s::%s", sub_graph->GetName().c_str(),
  1334. data_node->GetName().c_str());
  1335. REPORT_INNER_ERROR("E19999", "Failed to find peer node for %s::%s.",
  1336. sub_graph->GetName().c_str(), data_node->GetName().c_str());
  1337. return FAILED;
  1338. }
  1339. Status HybridModelBuilder::InitRuntimeParams() {
  1340. int64_t value = 0;
  1341. bool ret = false;
  1342. if (ge_root_model_->GetSubgraphInstanceNameToModel().empty()) {
  1343. GELOGE(INTERNAL_ERROR, "[Get][SubModel]Root model has no sub model, model:%s.", GetGraphName());
  1344. REPORT_INNER_ERROR("E19999", "Root model has no sub model, model:%s.", GetGraphName());
  1345. return INTERNAL_ERROR;
  1346. }
  1347. // session id and var size is same for every model
  1348. auto first_model = ge_root_model_->GetSubgraphInstanceNameToModel().begin()->second;
  1349. ret = ge::AttrUtils::GetInt(first_model, ge::MODEL_ATTR_SESSION_ID, value);
  1350. runtime_param_.session_id = ret ? static_cast<uint64_t>(value) : 0;
  1351. ret = ge::AttrUtils::GetInt(first_model, ATTR_MODEL_TASK_GEN_VAR_ADDR, value);
  1352. runtime_param_.logic_var_base = ret ? static_cast<uint64_t>(value) : 0;
  1353. runtime_param_.graph_id = ge_root_model_->GetRootGraph()->GetGraphID();
  1354. value = 0;
  1355. for (auto &it : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  1356. (void) ge::AttrUtils::GetInt(it.second, ATTR_MODEL_VAR_SIZE, value);
  1357. if (value > 0) {
  1358. runtime_param_.var_size = static_cast<uint64_t>(value);
  1359. break;
  1360. }
  1361. }
  1362. GELOGI("InitRuntimeParams(), session_id:%lu, var_size:%lu. graph_id = %u",
  1363. runtime_param_.session_id, runtime_param_.var_size, runtime_param_.graph_id);
  1364. var_manager_ = VarManager::Instance(runtime_param_.session_id);
  1365. GE_CHECK_NOTNULL(var_manager_);
  1366. return SUCCESS;
  1367. }
  1368. Status HybridModelBuilder::IdentifyVariableOutputs(NodeItem &node_item, const ComputeGraphPtr &subgraph) {
  1369. GELOGD("Start to parse outputs of node: %s", node_item.NodeName().c_str());
  1370. auto net_output_node = subgraph->FindFirstNodeMatchType(NETOUTPUT);
  1371. if (net_output_node == nullptr) {
  1372. GELOGD("[%s] Subgraph do not got net output", subgraph->GetName().c_str());
  1373. return SUCCESS;
  1374. }
  1375. auto net_output_desc = net_output_node->GetOpDesc();
  1376. GE_CHECK_NOTNULL(net_output_desc);
  1377. // constants connected to net output
  1378. for (const auto &in_data_anchor : net_output_node->GetAllInDataAnchors()) {
  1379. auto src_node = GetPeerNode(in_data_anchor);
  1380. GE_CHECK_NOTNULL(src_node);
  1381. auto src_op_type = src_node->GetType();
  1382. if (src_op_type == CONSTANTOP || src_op_type == CONSTANT) {
  1383. known_subgraph_constant_output_refs_[&node_item].emplace(in_data_anchor->GetIdx(), src_node);
  1384. }
  1385. }
  1386. // Data nodes marked with REF_VAR_SRC_VAR_NAME
  1387. // Using variable tensor as data's output
  1388. for (auto &node : subgraph->GetDirectNode()) {
  1389. if (node->GetType() != DATA) {
  1390. continue;
  1391. }
  1392. string ref_var_name;
  1393. (void) AttrUtils::GetStr(node->GetOpDesc(), REF_VAR_SRC_VAR_NAME, ref_var_name);
  1394. if (ref_var_name.empty()) {
  1395. continue;
  1396. }
  1397. GELOGD("Data node ref to variable: %s", ref_var_name.c_str());
  1398. NodePtr src_node;
  1399. auto var_node = hybrid_model_.GetVariableNode(ref_var_name);
  1400. GE_CHECK_NOTNULL(var_node);
  1401. GELOGD("Found var node [%s] by ref_var_name [%s]", var_node->GetName().c_str(), ref_var_name.c_str());
  1402. int peer_output_index = -1;
  1403. GE_CHK_STATUS_RET_NOLOG(GetPeerNodeAcrossSubGraphs(node, src_node, peer_output_index));
  1404. auto src_node_item = MutableNodeItem(src_node);
  1405. GE_CHECK_NOTNULL(src_node_item);
  1406. src_node_item->ref_outputs.emplace(peer_output_index, var_node);
  1407. }
  1408. return SUCCESS;
  1409. }
  1410. NodePtr HybridModelBuilder::GetPeerNode(const InDataAnchorPtr &in_data_anchor) {
  1411. auto peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  1412. if (peer_out_anchor != nullptr) {
  1413. return peer_out_anchor->GetOwnerNode();
  1414. }
  1415. return nullptr;
  1416. }
  1417. Status HybridModelBuilder::GetParentNodeOutputIndex(const OpDesc &op_desc, int index, uint32_t &out_index) {
  1418. auto input_desc = op_desc.MutableInputDesc(index);
  1419. GE_CHECK_NOTNULL(input_desc);
  1420. if (!AttrUtils::GetInt(input_desc, ATTR_NAME_PARENT_NODE_INDEX, out_index)) {
  1421. GELOGE(INTERNAL_ERROR, "[Invoke][GetInt]NetOutput %s input tensor %d, attr %s not found.",
  1422. op_desc.GetName().c_str(), index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1423. REPORT_CALL_ERROR("E19999", "NetOutput %s input tensor %d, attr %s not found.",
  1424. op_desc.GetName().c_str(), index, ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1425. return INTERNAL_ERROR;
  1426. }
  1427. return SUCCESS;
  1428. }
  1429. Status HybridModelBuilder::InitModelMem() {
  1430. hybrid_model_.var_mem_base_ = var_manager_->GetVarMemoryBase(RT_MEMORY_HBM);
  1431. auto total_var_size = hybrid_model_.TotalVarMemSize();
  1432. if (total_var_size == 0 && !constant_op_nodes_.empty()) {
  1433. total_var_size = var_manager_->GetVarMemSize(RT_MEMORY_HBM) > 0 ? var_manager_->GetVarMemMaxSize() : 0;
  1434. GELOGD("Model var size = 0. but got uninitialized constant. set var size to %zu.", total_var_size);
  1435. }
  1436. if (total_var_size > 0 && hybrid_model_.var_mem_base_ == nullptr) {
  1437. GE_CHK_STATUS_RET(var_manager_->MallocVarMemory(total_var_size),
  1438. "[Malloc][VarMemory] failed, size:%zu.", total_var_size);
  1439. hybrid_model_.var_mem_base_ = var_manager_->GetVarMemoryBase(RT_MEMORY_HBM);
  1440. }
  1441. runtime_param_.var_base = hybrid_model_.var_mem_base_;
  1442. auto allocator = NpuMemoryAllocator::GetAllocator();
  1443. GE_CHECK_NOTNULL(allocator);
  1444. hybrid_model_.global_step_ = TensorBuffer::Create(allocator, sizeof(int64_t));
  1445. GE_CHECK_NOTNULL(hybrid_model_.global_step_);
  1446. return SUCCESS;
  1447. }
  1448. Status HybridModelBuilder::TransAllVarData() {
  1449. GELOGI("TransAllVarData start: session_id:%lu, graph_id: %u.", runtime_param_.session_id, runtime_param_.graph_id);
  1450. rtContext_t ctx = nullptr;
  1451. rtError_t rt_ret = rtCtxGetCurrent(&ctx);
  1452. if (rt_ret != RT_ERROR_NONE) {
  1453. GELOGE(RT_FAILED, "[Invoke][rtCtxGetCurrent]Failed to get current context, error_code is: 0x%X.", rt_ret);
  1454. REPORT_CALL_ERROR("E19999", "rtCtxGetCurrent failed, error_code: 0x%X.", rt_ret);
  1455. return RT_FAILED;
  1456. }
  1457. std::vector<NodePtr> variable_node_list;
  1458. for (auto &it : hybrid_model_.device_variable_nodes_) {
  1459. variable_node_list.emplace_back(it.second);
  1460. GELOGD("[%s] added for trans var data", it.first.c_str());
  1461. }
  1462. GE_CHK_STATUS_RET(TransVarDataUtils::TransAllVarData(variable_node_list,
  1463. runtime_param_.session_id,
  1464. ctx,
  1465. runtime_param_.graph_id),
  1466. "[Invoke][TransAllVarData] failed.");
  1467. GELOGI("TransAllVarData success.");
  1468. return SUCCESS;
  1469. }
  1470. Status HybridModelBuilder::CopyVarData() {
  1471. GE_CHK_STATUS_RET(TransVarDataUtils::CopyVarData(ge_root_model_->GetRootGraph(),
  1472. runtime_param_.session_id,
  1473. hybrid_model_.device_id_),
  1474. "[Invoke][CopyVarData] failed.");
  1475. GELOGI("CopyVarData success.");
  1476. return SUCCESS;
  1477. }
  1478. Status HybridModelBuilder::LoadKnownShapedSubgraph(ComputeGraph &graph, NodeItem *parent_node_item) {
  1479. GELOGD("Start to load known shaped subgraph [%s]", graph.GetName().c_str());
  1480. auto graph_item = std::unique_ptr<GraphItem>(new(std::nothrow)GraphItem());
  1481. GE_CHECK_NOTNULL(graph_item);
  1482. graph_item->is_dynamic_ = false;
  1483. auto subgraph_name = graph.GetName();
  1484. auto wrapper_op_desc = MakeShared<OpDesc>(subgraph_name + "_partitioned_call", PARTITIONEDCALL);
  1485. GE_CHECK_NOTNULL(wrapper_op_desc);
  1486. for (auto &node : graph.GetDirectNode()) {
  1487. GE_CHECK_NOTNULL(node);
  1488. auto op_desc = node->GetOpDesc();
  1489. GE_CHECK_NOTNULL(op_desc);
  1490. const auto &op_type = node->GetType();
  1491. if (op_type == DATA) {
  1492. int32_t data_index = 0;
  1493. if (!AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1494. GELOGE(FAILED,
  1495. "[Invoke][GetInt][%s] Failed to get attr [%s]",
  1496. node->GetName().c_str(),
  1497. ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1498. return FAILED;
  1499. }
  1500. (void) wrapper_op_desc->AddInputDesc(op_desc->GetInputDesc(0));
  1501. graph_item->input_index_mapping_.emplace_back(data_index);
  1502. } else if (op_type == NETOUTPUT) {
  1503. int output_index = 0;
  1504. for (const auto &output_desc : op_desc->GetAllInputsDescPtr()) {
  1505. int32_t data_index = output_index++;
  1506. if (!AttrUtils::GetInt(output_desc, ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1507. GELOGI("[%s] Failed to get attr [%s]", node->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1508. }
  1509. GE_CHK_GRAPH_STATUS_RET(wrapper_op_desc->AddOutputDesc(*output_desc),
  1510. "[Invoke][AddOutputDesc][%s] Failed to add output desc. output index = %d",
  1511. graph.GetName().c_str(),
  1512. output_index);
  1513. graph_item->output_index_mapping_.emplace_back(data_index);
  1514. }
  1515. }
  1516. }
  1517. auto temp_graph = MakeShared<ComputeGraph>("temp");
  1518. GE_CHECK_NOTNULL(temp_graph);
  1519. auto wrapper_node = temp_graph->AddNode(wrapper_op_desc);
  1520. wrapper_op_desc->SetId(parent_node_item->node_id);
  1521. GeModelPtr ge_model = subgraph_models_[subgraph_name];
  1522. GE_CHECK_NOTNULL(ge_model);
  1523. hybrid_model_.known_shape_sub_models_.emplace(wrapper_node, ge_model);
  1524. NodeItem *node_item = nullptr;
  1525. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(wrapper_node, &node_item));
  1526. node_item->input_start = 0;
  1527. node_item->output_start = 0;
  1528. node_item->outputs.resize(node_item->num_outputs);
  1529. graph_item->node_items_.emplace_back(node_item);
  1530. graph_item->output_node_ = node_item;
  1531. graph_item->total_inputs_ = node_item->num_inputs;
  1532. graph_item->total_outputs_ = node_item->num_outputs;
  1533. GELOGD("NodeItem create for known shape subgraph [%s], NodeItem = %s",
  1534. graph.GetName().c_str(),
  1535. node_item->DebugString().c_str());
  1536. GELOGD("Done parse known shape subgraph successfully. graph = [%s]", graph.GetName().c_str());
  1537. graph_item->SetName(graph.GetName());
  1538. GELOGD("Done loading known shape subgraph: [%s]", graph_item->GetName().c_str());
  1539. hybrid_model_.subgraph_items_.emplace(graph.GetName(), std::move(graph_item));
  1540. return SUCCESS;
  1541. }
  1542. Status HybridModelBuilder::RecoverGraphUnknownFlag() {
  1543. const auto &root_graph = ge_root_model_->GetRootGraph();
  1544. for (auto &sub_graph : root_graph->GetAllSubgraphs()) {
  1545. GE_CHECK_NOTNULL(sub_graph);
  1546. for (const auto &node : sub_graph->GetDirectNode()) {
  1547. bool is_unknown_shape = false;
  1548. (void)AttrUtils::GetBool(node->GetOpDesc(), kOwnerGraphIsUnknown, is_unknown_shape);
  1549. sub_graph->SetGraphUnknownFlag(is_unknown_shape);
  1550. break;
  1551. }
  1552. }
  1553. return SUCCESS;
  1554. }
  1555. Status HybridModelBuilder::GenerateFpProfilingTask(const OpDescPtr &op_desc, vector<domi::TaskDef> &task_def_list) {
  1556. uint64_t jobid_log_id = ge::GetContext().TraceId();
  1557. GELOGD("The first FP operator is %s,, job_id %lu", op_desc->GetName().c_str(), jobid_log_id);
  1558. TaskDef job_task_def;
  1559. job_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1560. job_task_def.set_stream_id(op_desc->GetStreamId());
  1561. LogTimeStampDef *job_log_def = job_task_def.mutable_log_timestamp();
  1562. if (job_log_def != nullptr) {
  1563. job_log_def->set_logid(jobid_log_id);
  1564. job_log_def->set_notify(false);
  1565. }
  1566. task_def_list.emplace_back(job_task_def);
  1567. TaskDef fp_task_def;
  1568. fp_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1569. fp_task_def.set_stream_id(op_desc->GetStreamId());
  1570. LogTimeStampDef *fp_log_def = fp_task_def.mutable_log_timestamp();
  1571. if (fp_log_def != nullptr) {
  1572. fp_log_def->set_logid(kProfilingFpStartLogid);
  1573. fp_log_def->set_notify(false);
  1574. }
  1575. task_def_list.emplace_back(fp_task_def);
  1576. return SUCCESS;
  1577. }
  1578. Status HybridModelBuilder::GenerateArProfilingTask(const OpDescPtr &op_desc, int64_t log_id,
  1579. vector<domi::TaskDef> &task_def_list) {
  1580. TaskDef ar_task_def;
  1581. ar_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1582. ar_task_def.set_stream_id(op_desc->GetStreamId());
  1583. LogTimeStampDef *ar_log_def = ar_task_def.mutable_log_timestamp();
  1584. if (ar_log_def != nullptr) {
  1585. ar_log_def->set_logid(log_id);
  1586. ar_log_def->set_notify(false);
  1587. }
  1588. task_def_list.emplace_back(ar_task_def);
  1589. return SUCCESS;
  1590. }
  1591. Status HybridModelBuilder::GenerateBpProfilingTask(const OpDescPtr &op_desc, vector<domi::TaskDef> &task_def_list) {
  1592. TaskDef bp_task_def;
  1593. bp_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1594. bp_task_def.set_stream_id(op_desc->GetStreamId());
  1595. LogTimeStampDef *bp_log_def = bp_task_def.mutable_log_timestamp();
  1596. GE_CHECK_NOTNULL(bp_log_def);
  1597. bp_log_def->set_logid(kProfilingBpEndLogid);
  1598. bp_log_def->set_notify(false);
  1599. task_def_list.emplace_back(bp_task_def);
  1600. return SUCCESS;
  1601. }
  1602. Status HybridModelBuilder::GenerateEndProfilingTask(const OpDescPtr &op_desc, vector<domi::TaskDef> &task_def_list) {
  1603. TaskDef end_task_def;
  1604. end_task_def.set_type(RT_MODEL_TASK_PROFILER_TRACE);
  1605. end_task_def.set_stream_id(op_desc->GetStreamId());
  1606. LogTimeStampDef *end_log_def = end_task_def.mutable_log_timestamp();
  1607. GE_CHECK_NOTNULL(end_log_def);
  1608. end_log_def->set_logid(kProfilingIterEndLogid);
  1609. end_log_def->set_notify(true);
  1610. task_def_list.emplace_back(end_task_def);
  1611. return SUCCESS;
  1612. }
  1613. Status HybridModelBuilder::CreateProfilingNodeBefore(GraphItem &graph_item, const NodePtr &node, uint32_t &prev_num) {
  1614. GE_CHECK_NOTNULL(node);
  1615. const OpDescPtr &op_desc = node->GetOpDesc();
  1616. GE_CHECK_NOTNULL(op_desc);
  1617. const auto &compute_graph = MakeShared<ComputeGraph>(kProfilingGraph);
  1618. GE_CHECK_NOTNULL(compute_graph);
  1619. NodePtr node_ptr = nullptr;
  1620. map<NodePtr, vector<domi::TaskDef>> node_task_map;
  1621. // create fp node
  1622. bool is_insert_fp_profiling_task = false;
  1623. (void)ge::AttrUtils::GetBool(op_desc, ATTR_NAME_INSERT_FP_PROFILILNG_TASK, is_insert_fp_profiling_task);
  1624. if (is_insert_fp_profiling_task) {
  1625. vector<domi::TaskDef> task_def_list;
  1626. (void)GenerateFpProfilingTask(op_desc, task_def_list);
  1627. auto fp_desc = MakeShared<OpDesc>(kProfilingFpNode, PROFILINGTRAININGTRACE);
  1628. GE_CHECK_NOTNULL(fp_desc);
  1629. fp_desc->SetOpKernelLibName(kEngineNameRts);
  1630. node_ptr = compute_graph->AddNode(fp_desc);
  1631. GE_CHECK_NOTNULL(node_ptr);
  1632. node_task_map[node_ptr] = task_def_list;
  1633. GELOGD("Create fp profiling node success before.");
  1634. }
  1635. // creat all reduce start node
  1636. bool is_insert_bp_profiling_task = false;
  1637. (void)ge::AttrUtils::GetBool(op_desc, ATTR_NAME_INSERT_BP_PROFILILNG_TASK, is_insert_bp_profiling_task);
  1638. bool is_all_reduce = (op_desc->GetType() == HCOMALLREDUCE || op_desc->GetType() == HVDCALLBACKALLREDUCE);
  1639. if (is_all_reduce && is_insert_bp_profiling_task) {
  1640. vector<domi::TaskDef> task_def_list;
  1641. int64_t log_id = 0;
  1642. (void)ge::AttrUtils::GetInt(op_desc, ATTR_NAME_INSERT_PROFILILNG_TASK_LOG_ID, log_id);
  1643. GELOGD("All reduce node profiling task log id: %ld before", log_id);
  1644. (void) GenerateArProfilingTask(op_desc, log_id, task_def_list);
  1645. string op_name = string(kProfilingArNode) + std::to_string(log_id);
  1646. auto ar_desc_start = MakeShared<OpDesc>(op_name, PROFILINGTRAININGTRACE);
  1647. GE_CHECK_NOTNULL(ar_desc_start);
  1648. ar_desc_start->SetOpKernelLibName(kEngineNameRts);
  1649. node_ptr = compute_graph->AddNode(ar_desc_start);
  1650. GE_CHECK_NOTNULL(node_ptr);
  1651. node_task_map[node_ptr] = task_def_list;
  1652. GELOGD("Create all reduce start profiling node success before.");
  1653. }
  1654. if (!node_task_map.empty()) {
  1655. for (const auto &node_task : node_task_map) {
  1656. NodePtr profiling_node = node_task.first;
  1657. const vector<domi::TaskDef> &task_def_lists = node_task.second;
  1658. for (const auto &task_def : task_def_lists) {
  1659. hybrid_model_.task_defs_[profiling_node].emplace_back(task_def);
  1660. }
  1661. if (op_desc->HasAttr(ATTR_STAGE_LEVEL)) {
  1662. uint32_t stage_level = UINT32_MAX;
  1663. (void)ge::AttrUtils::GetInt(op_desc, ATTR_STAGE_LEVEL, stage_level);
  1664. (void)ge::AttrUtils::SetInt(node_ptr->GetOpDesc(), ATTR_STAGE_LEVEL, stage_level);
  1665. }
  1666. NodeItem *node_item = nullptr;
  1667. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(profiling_node, &node_item));
  1668. GE_CHECK_NOTNULL(node_item);
  1669. node_item->input_start = 0;
  1670. node_item->output_start = 0;
  1671. graph_item.node_items_.emplace_back(node_item);
  1672. ++prev_num;
  1673. }
  1674. } else {
  1675. GELOGD("No need to create profiling node before.");
  1676. }
  1677. return SUCCESS;
  1678. }
  1679. Status HybridModelBuilder::CreateProfilingNodeAfter(GraphItem &graph_item, const NodePtr &node, uint32_t &post_num) {
  1680. GE_CHECK_NOTNULL(node);
  1681. const OpDescPtr &op_desc = node->GetOpDesc();
  1682. GE_CHECK_NOTNULL(op_desc);
  1683. const auto &compute_graph = MakeShared<ComputeGraph>(kProfilingGraph);
  1684. GE_CHECK_NOTNULL(compute_graph);
  1685. NodePtr node_ptr = nullptr;
  1686. map<NodePtr, vector<domi::TaskDef>> node_task_map;
  1687. // Create all reduce end node
  1688. bool is_insert_bp_profiling_task = false;
  1689. (void)ge::AttrUtils::GetBool(op_desc, ATTR_NAME_INSERT_BP_PROFILILNG_TASK, is_insert_bp_profiling_task);
  1690. bool is_all_reduce = (op_desc->GetType() == HCOMALLREDUCE || op_desc->GetType() == HVDCALLBACKALLREDUCE);
  1691. if (is_all_reduce && is_insert_bp_profiling_task) {
  1692. vector<domi::TaskDef> task_def_list;
  1693. int64_t log_id = 0;
  1694. (void)ge::AttrUtils::GetInt(op_desc, ATTR_NAME_INSERT_PROFILILNG_TASK_LOG_ID, log_id);
  1695. GELOGD("All reduce node profiling task log id: %ld after", log_id);
  1696. (void) GenerateArProfilingTask(op_desc, log_id + 1, task_def_list);
  1697. string op_name = string(kProfilingArNode) + std::to_string(log_id + 1);
  1698. auto ar_desc_end = MakeShared<OpDesc>(op_name, PROFILINGTRAININGTRACE);
  1699. GE_CHECK_NOTNULL(ar_desc_end);
  1700. ar_desc_end->SetOpKernelLibName(kEngineNameRts);
  1701. node_ptr = compute_graph->AddNode(ar_desc_end);
  1702. GE_CHECK_NOTNULL(node_ptr);
  1703. node_task_map[node_ptr] = task_def_list;
  1704. GELOGD("Create all reduce end profiling node success after.");
  1705. }
  1706. // create bp node
  1707. if (!is_all_reduce && is_insert_bp_profiling_task) {
  1708. vector<domi::TaskDef> task_def_list;
  1709. (void) GenerateBpProfilingTask(op_desc, task_def_list);
  1710. auto bp_op_desc = MakeShared<OpDesc>(kProfilingBpNode, PROFILINGTRAININGTRACE);
  1711. GE_CHECK_NOTNULL(bp_op_desc);
  1712. bp_op_desc->SetOpKernelLibName(kEngineNameRts);
  1713. node_ptr = compute_graph->AddNode(bp_op_desc);
  1714. GE_CHECK_NOTNULL(node_ptr);
  1715. node_task_map[node_ptr] = task_def_list;
  1716. GELOGD("Create bp profiling node success after.");
  1717. }
  1718. // create end node
  1719. bool is_insert_end_profiling_task = false;
  1720. (void)ge::AttrUtils::GetBool(op_desc, ATTR_NAME_INSERT_END_PROFILILNG_TASK, is_insert_end_profiling_task);
  1721. if (is_insert_end_profiling_task) {
  1722. vector<domi::TaskDef> task_def_list;
  1723. (void)GenerateEndProfilingTask(op_desc, task_def_list);
  1724. auto end_desc = MakeShared<OpDesc>(kProfilingEndNode, PROFILINGTRAININGTRACE);
  1725. GE_CHECK_NOTNULL(end_desc);
  1726. end_desc->SetOpKernelLibName(kEngineNameRts);
  1727. node_ptr = compute_graph->AddNode(end_desc);
  1728. GE_CHECK_NOTNULL(node_ptr);
  1729. node_task_map[node_ptr] = task_def_list;
  1730. GELOGD("Create end profiling node success after.");
  1731. }
  1732. if (!node_task_map.empty()) {
  1733. for (const auto &node_task : node_task_map) {
  1734. NodePtr profiling_node = node_task.first;
  1735. const vector<domi::TaskDef> &task_def_lists = node_task.second;
  1736. for (const auto &task_def : task_def_lists) {
  1737. hybrid_model_.task_defs_[profiling_node].emplace_back(task_def);
  1738. }
  1739. if (op_desc->HasAttr(ATTR_STAGE_LEVEL)) {
  1740. uint32_t stage_level = UINT32_MAX;
  1741. (void)ge::AttrUtils::GetInt(op_desc, ATTR_STAGE_LEVEL, stage_level);
  1742. (void)ge::AttrUtils::SetInt(profiling_node->GetOpDesc(), ATTR_STAGE_LEVEL, stage_level);
  1743. }
  1744. NodeItem *node_item = nullptr;
  1745. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(profiling_node, &node_item));
  1746. GE_CHECK_NOTNULL(node_item);
  1747. node_item->input_start = 0;
  1748. node_item->output_start = 0;
  1749. graph_item.node_items_.emplace_back(node_item);
  1750. ++post_num;
  1751. }
  1752. } else {
  1753. GELOGD("No need to create profiling node after.");
  1754. }
  1755. return SUCCESS;
  1756. }
  1757. Status HybridModelBuilder::LoadDynamicSubgraph(ComputeGraph &graph, bool is_root_graph) {
  1758. GELOGD("Start to load subgraph [%s]", graph.GetName().c_str());
  1759. // for known partitioned call, load all nodes
  1760. auto graph_item = std::unique_ptr<GraphItem>(new(std::nothrow)GraphItem());
  1761. GE_CHECK_NOTNULL(graph_item);
  1762. graph_item->is_dynamic_ = true;
  1763. graph_item->node_items_.reserve(graph.GetDirectNodesSize());
  1764. int input_start = 0;
  1765. int output_start = 0;
  1766. std::vector<NodeItem *> data_nodes;
  1767. std::map<size_t, std::pair<uint32_t, uint32_t>> profiling_nodes;
  1768. for (auto &node : graph.GetDirectNode()) {
  1769. GE_CHECK_NOTNULL(node);
  1770. GE_CHECK_NOTNULL(node->GetOpDesc());
  1771. const auto &op_type = node->GetType();
  1772. NodeItem *node_item = nullptr;
  1773. GE_CHK_STATUS_RET_NOLOG(GetOrCreateNodeItem(node, &node_item));
  1774. GE_CHK_STATUS_RET_NOLOG(BuildNodeItem(node, *node_item));
  1775. GE_CHK_STATUS_RET_NOLOG(UpdateAnchorStatus(node)); // needed by FE generate task
  1776. GE_CHK_STATUS_RET_NOLOG(BuildControlFlowGroup(*graph_item, node, node_item));
  1777. if (node->GetInAllNodes().empty()) {
  1778. graph_item->root_items_.emplace_back(node_item);
  1779. GELOGD("[%s] add to root node list", node->GetName().c_str());
  1780. }
  1781. node_item->input_start = input_start;
  1782. node_item->output_start = output_start;
  1783. input_start += node_item->num_inputs;
  1784. output_start += node_item->num_outputs;
  1785. if (op_type == DATA_TYPE || op_type == AIPP_DATA_TYPE) {
  1786. data_nodes.emplace_back(node_item);
  1787. } else if (op_type == NETOUTPUT) {
  1788. graph_item->output_node_ = node_item;
  1789. GE_CHK_STATUS_RET_NOLOG(BuildOutputMapping(*graph_item, *node_item, is_root_graph));
  1790. }
  1791. uint32_t prev_num = 0;
  1792. uint32_t post_num = 0;
  1793. GE_CHK_STATUS_RET_NOLOG(CreateProfilingNodeBefore(*graph_item, node, prev_num));
  1794. size_t node_index = graph_item->node_items_.size();
  1795. graph_item->node_items_.emplace_back(node_item);
  1796. GE_CHK_STATUS_RET_NOLOG(CreateProfilingNodeAfter(*graph_item, node, post_num));
  1797. if (prev_num > 0 || post_num > 0) {
  1798. profiling_nodes[node_index] = { prev_num, post_num };
  1799. }
  1800. // parse var outputs
  1801. GE_CHK_STATUS_RET_NOLOG(ParseVarOutputs(*node_item));
  1802. GELOGD("NodeItem created: %s", node_item->DebugString().c_str());
  1803. }
  1804. graph_item->total_inputs_ = input_start;
  1805. graph_item->total_outputs_ = output_start;
  1806. GE_CHK_STATUS_RET_NOLOG(BuildInputMapping(*graph_item, data_nodes, is_root_graph));
  1807. GE_CHK_STATUS_RET_NOLOG(BuildProfilingControl(*graph_item, profiling_nodes));
  1808. if (is_root_graph) {
  1809. graph_item->SetName("Root-Graph");
  1810. GELOGD("Done loading dynamic subgraph: [%s]", graph_item->GetName().c_str());
  1811. hybrid_model_.root_graph_item_ = std::move(graph_item);
  1812. } else {
  1813. graph_item->SetName(graph.GetName());
  1814. GELOGD("Done loading dynamic subgraph: [%s]", graph_item->GetName().c_str());
  1815. hybrid_model_.subgraph_items_.emplace(graph.GetName(), std::move(graph_item));
  1816. }
  1817. return SUCCESS;
  1818. }
  1819. Status HybridModelBuilder::ParseVarOutputs(NodeItem &node_item) {
  1820. for (int i = 0; i < node_item.num_outputs; ++i) {
  1821. auto output_tensor_desc = node_item.op_desc->GetOutputDesc(i);
  1822. std::string var_name;
  1823. (void) AttrUtils::GetStr(output_tensor_desc, ASSIGN_VAR_NAME, var_name);
  1824. if (!var_name.empty()) {
  1825. auto var_node = hybrid_model_.GetVariableNode(var_name);
  1826. GE_CHECK_NOTNULL(var_node);
  1827. node_item.ref_outputs.emplace(i, var_node);
  1828. }
  1829. }
  1830. return SUCCESS;
  1831. }
  1832. Status HybridModelBuilder::BuildInputMapping(GraphItem &graph_item,
  1833. vector<NodeItem *> &data_nodes,
  1834. bool is_root_graph) {
  1835. uint32_t data_op_index = 0;
  1836. for (auto &node_item : data_nodes) {
  1837. auto node = node_item->node;
  1838. int data_index = data_op_index;
  1839. if (is_root_graph) {
  1840. if (AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_INDEX, data_index)) {
  1841. GELOGI("ge_train: get new index %u, old %u", data_index, data_op_index);
  1842. }
  1843. data_op_index++;
  1844. } else {
  1845. if (!AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, data_index)) {
  1846. GELOGE(FAILED, "[Invoke][GetInt][%s] Failed to get attr [%s]",
  1847. node->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1848. REPORT_CALL_ERROR("E19999", "call GetInt failed, [%s] Failed to get attr [%s]",
  1849. node->GetName().c_str(), ATTR_NAME_PARENT_NODE_INDEX.c_str());
  1850. return FAILED;
  1851. }
  1852. }
  1853. if (graph_item.input_nodes_.size() <= static_cast<size_t>(data_index)) {
  1854. graph_item.input_nodes_.resize(data_index + 1);
  1855. }
  1856. graph_item.input_nodes_[data_index] = node_item;
  1857. }
  1858. return SUCCESS;
  1859. }
  1860. Status HybridModelBuilder::CheckAicpuOpList() {
  1861. std::vector<std::string> aicpu_optype_list;
  1862. std::vector<std::string> aicpu_tf_optype_list;
  1863. std::set<std::string> aicpu_optype_set;
  1864. std::set<std::string> aicpu_tf_optype_set;
  1865. for (auto &it : ge_root_model_->GetSubgraphInstanceNameToModel()) {
  1866. auto &ge_model = it.second;
  1867. GE_CHECK_NOTNULL(ge_model);
  1868. if (ge::AttrUtils::GetListStr(*ge_model, "needCheckCpu", aicpu_optype_list)) {
  1869. aicpu_optype_set.insert(aicpu_optype_list.begin(), aicpu_optype_list.end());
  1870. }
  1871. if (ge::AttrUtils::GetListStr(*ge_model, "needCheckTf", aicpu_tf_optype_list)) {
  1872. aicpu_tf_optype_set.insert(aicpu_tf_optype_list.begin(), aicpu_tf_optype_list.end());
  1873. }
  1874. }
  1875. // reset list with set
  1876. aicpu_optype_list.assign(aicpu_optype_set.begin(), aicpu_optype_set.end());
  1877. aicpu_tf_optype_list.assign(aicpu_tf_optype_set.begin(), aicpu_tf_optype_set.end());
  1878. GE_CHK_STATUS_RET(ModelManager::GetInstance()->LaunchKernelCheckAicpuOp(aicpu_optype_list, aicpu_tf_optype_list),
  1879. "[Launch][KernelCheckAicpuOp] failed.");
  1880. return SUCCESS;
  1881. }
  1882. Status HybridModelBuilder::CollectParallelGroups(NodeItem *node_item) {
  1883. const auto &node = node_item->node;
  1884. auto executor_type = NodeExecutorManager::GetInstance().ResolveExecutorType(*node);
  1885. if (executor_type == NodeExecutorManager::ExecutorType::HCCL) {
  1886. std::string parallel_group;
  1887. if (AttrUtils::GetStr(node->GetOpDesc(), ATTR_NAME_PARALLEL_GROUP, parallel_group)) {
  1888. GELOGD("[%s] Got parallel group = [%s]", node_item->NodeName().c_str(), parallel_group.c_str());
  1889. parallel_group_to_nodes_[parallel_group].emplace(node_item);
  1890. std::set<std::string> group{parallel_group};
  1891. node_to_parallel_groups_[node_item].emplace(parallel_group);
  1892. }
  1893. } else if (executor_type == NodeExecutorManager::ExecutorType::COMPILED_SUBGRAPH) {
  1894. std::set<std::string> parallel_groups;
  1895. GELOGD("[%s] To collect parallel group for known-shaped subgraph", node_item->NodeName().c_str());
  1896. for (const auto &subgraph_name : node->GetOpDesc()->GetSubgraphInstanceNames()) {
  1897. GELOGD("[%s] Start to get parallel group from subgraph: %s",
  1898. node_item->NodeName().c_str(),
  1899. subgraph_name.c_str());
  1900. auto subgraph = hybrid_model_.root_graph_->GetSubgraph(subgraph_name);
  1901. GE_CHECK_NOTNULL(subgraph);
  1902. for (const auto &sub_node : subgraph->GetAllNodes()) {
  1903. std::string parallel_group;
  1904. if (AttrUtils::GetStr(sub_node->GetOpDesc(), ATTR_NAME_PARALLEL_GROUP, parallel_group)) {
  1905. GELOGD("[%s::%s] Got parallel group = %s",
  1906. subgraph_name.c_str(),
  1907. sub_node->GetName().c_str(),
  1908. parallel_group.c_str());
  1909. parallel_groups.emplace(parallel_group);
  1910. }
  1911. }
  1912. }
  1913. if (!parallel_groups.empty()) {
  1914. for (const auto &parallel_group : parallel_groups) {
  1915. parallel_group_to_nodes_[parallel_group].emplace(node_item);
  1916. GELOGD("[%s] has parallel group: %s", node_item->NodeName().c_str(), parallel_group.c_str());
  1917. }
  1918. node_to_parallel_groups_.emplace(node_item, std::move(parallel_groups));
  1919. }
  1920. }
  1921. return SUCCESS;
  1922. }
  1923. Status HybridModelBuilder::ParseDependentByParallelGroup() {
  1924. for (auto &it : hybrid_model_.node_items_) {
  1925. GE_CHK_STATUS_RET_NOLOG(CollectParallelGroups(it.second.get()));
  1926. }
  1927. for (const auto &it : node_to_parallel_groups_) {
  1928. auto node_item = it.first;
  1929. auto dst_executor_type = NodeExecutorManager::GetInstance().ResolveExecutorType(*node_item->node);
  1930. for (const auto &parallel_group : it.second) {
  1931. auto &dependent_nodes = parallel_group_to_nodes_[parallel_group];
  1932. NodeItem *nearest_dep_node = nullptr;
  1933. int max_id = -1;
  1934. for (auto &dep_node : dependent_nodes) {
  1935. if (dep_node->node_id < node_item->node_id && dep_node->node_id > max_id) {
  1936. nearest_dep_node = dep_node;
  1937. max_id = dep_node->node_id;
  1938. }
  1939. }
  1940. if (nearest_dep_node != nullptr) {
  1941. GELOGD("[%s] Nearest node = [%s]", node_item->NodeName().c_str(), nearest_dep_node->NodeName().c_str());
  1942. auto src_engine_type = NodeExecutorManager::GetInstance().ResolveExecutorType(*nearest_dep_node->node);
  1943. if (src_engine_type == dst_executor_type) {
  1944. GELOGD("No need to add dependency for nodes with same executor type");
  1945. continue;
  1946. }
  1947. auto &deps = node_item->dependents_for_execution;
  1948. if (std::find(deps.begin(), deps.end(), nearest_dep_node->node) != deps.end()) {
  1949. GELOGD("%s->%s Already has dependency, skip it",
  1950. nearest_dep_node->node->GetName().c_str(),
  1951. node_item->NodeName().c_str());
  1952. continue;
  1953. }
  1954. nearest_dep_node->has_observer = true;
  1955. deps.emplace_back(nearest_dep_node->node);
  1956. GELOGD("Add dependency for nodes with the same parallel group[%s], src = [%s], dst = [%s]",
  1957. parallel_group.c_str(),
  1958. nearest_dep_node->NodeName().c_str(),
  1959. node_item->NodeName().c_str());
  1960. }
  1961. }
  1962. }
  1963. return SUCCESS;
  1964. }
  1965. Status HybridModelBuilder::OptimizeDependenciesForConstantInputs() {
  1966. std::map<NodePtr, std::set<uint32_t>> converted;
  1967. for (auto &it : host_input_value_dependencies_) {
  1968. auto node_item = it.first;
  1969. std::map<NodeItem *, int> ref_counts;
  1970. bool changed = false;
  1971. for (auto output_idx_and_node : it.second) {
  1972. auto output_idx = output_idx_and_node.first;
  1973. auto src_node_item = output_idx_and_node.second;
  1974. ++ref_counts[src_node_item];
  1975. NodePtr constant_node;
  1976. if (src_node_item->node_type == CONSTANT || src_node_item->node_type == CONSTANTOP) {
  1977. constant_node = src_node_item->node;
  1978. GELOGD("src node [%s] is a constant", src_node_item->NodeName().c_str());
  1979. } else {
  1980. auto iter = known_subgraph_constant_output_refs_.find(src_node_item);
  1981. if (iter != known_subgraph_constant_output_refs_.end()) {
  1982. constant_node = iter->second[output_idx];
  1983. if (constant_node != nullptr) {
  1984. GELOGD("Output[%u] of subgraph [%s] is a constant", output_idx, src_node_item->NodeName().c_str());
  1985. }
  1986. }
  1987. }
  1988. if (constant_node == nullptr) {
  1989. GELOGD("Output[%u] of [%s] is not a constant", output_idx, src_node_item->NodeName().c_str());
  1990. continue;
  1991. }
  1992. if (converted[constant_node].count(output_idx) == 0) {
  1993. GE_CHK_STATUS_RET(Convert2HostTensor(constant_node, src_node_item->node_id, output_idx),
  1994. "[%s] Failed to convert constant to host tensor", constant_node->GetName().c_str());
  1995. converted[constant_node].emplace(output_idx);
  1996. }
  1997. src_node_item->to_const_output_id_list.erase(output_idx);
  1998. --ref_counts[src_node_item];
  1999. changed = true;
  2000. }
  2001. if (changed) {
  2002. std::vector<NodePtr> depends_to_keep;
  2003. for (auto &ref_count_it : ref_counts) {
  2004. if (ref_count_it.second == 0) {
  2005. GELOGD("[%s] no longer depends on [%s] for shape inference",
  2006. node_item->NodeName().c_str(),
  2007. ref_count_it.first->NodeName().c_str());
  2008. } else {
  2009. depends_to_keep.emplace_back(ref_count_it.first->node);
  2010. }
  2011. }
  2012. node_item->dependents_for_shape_inference.swap(depends_to_keep);
  2013. }
  2014. }
  2015. return SUCCESS;
  2016. }
  2017. Status HybridModelBuilder::Convert2HostTensor(const NodePtr &node, int node_id, uint32_t output_idx) {
  2018. auto tensor_value = hybrid_model_.GetTensor(node);
  2019. GE_CHECK_NOTNULL(tensor_value);
  2020. auto tensor_desc = node->GetOpDesc()->MutableOutputDesc(0);
  2021. GE_CHECK_NOTNULL(tensor_desc);
  2022. Tensor tensor(TensorAdapter::GeTensorDesc2TensorDesc(*tensor_desc));
  2023. int64_t tensor_size = -1;
  2024. GE_CHK_GRAPH_STATUS_RET(TensorUtils::GetTensorSizeInBytes(*tensor_desc, tensor_size),
  2025. "[%s] Failed to get tensor size", node->GetName().c_str());
  2026. if (tensor_size > 0) {
  2027. auto copy_size = static_cast<size_t>(tensor_size);
  2028. GE_CHECK_GE(tensor_value->GetSize(), copy_size);
  2029. std::vector<uint8_t> buffer(copy_size);
  2030. GE_CHK_RT_RET(rtMemcpy(buffer.data(),
  2031. copy_size,
  2032. tensor_value->GetData(),
  2033. copy_size,
  2034. RT_MEMCPY_DEVICE_TO_HOST));
  2035. tensor.SetData(std::move(buffer));
  2036. GELOGD("[%s] Copy constant tensor to host successfully, size = %zu", node->GetName().c_str(), copy_size);
  2037. }
  2038. hybrid_model_.host_tensors_[node_id].emplace_back(output_idx, std::move(tensor));
  2039. return SUCCESS;
  2040. }
  2041. Status HybridModelBuilder::RelinkNextIteration() {
  2042. for (const auto &item : stream_merge_op_nodes_) {
  2043. const auto &merge = item.second;
  2044. std::string node_name;
  2045. if (!AttrUtils::GetStr(merge->GetOpDesc(), ATTR_NAME_NEXT_ITERATION, node_name)) {
  2046. GELOGD("[%s] no attribute[%s], not in while loop", merge->GetName().c_str(), ATTR_NAME_NEXT_ITERATION.c_str());
  2047. continue;
  2048. }
  2049. const auto it = next_iteration_op_nodes_.find(node_name);
  2050. if (it == next_iteration_op_nodes_.end()) {
  2051. GELOGE(INTERNAL_ERROR, "[%s] expect NextIteration[%s] not found", merge->GetName().c_str(), node_name.c_str());
  2052. return INTERNAL_ERROR;
  2053. }
  2054. const auto &iteration = it->second;
  2055. if (GraphUtils::AddEdge(iteration->GetOutDataAnchor(0), merge->GetInDataAnchor(1)) != GRAPH_SUCCESS) {
  2056. GELOGE(INTERNAL_ERROR, "[%s] -> [%s] Add edge failed", node_name.c_str(), merge->GetName().c_str());
  2057. return INTERNAL_ERROR;
  2058. }
  2059. }
  2060. stream_merge_op_nodes_.clear();
  2061. next_iteration_op_nodes_.clear();
  2062. return SUCCESS;
  2063. }
  2064. Status HybridModelBuilder::BuildProfilingControl(GraphItem &graph_item,
  2065. const std::map<size_t, std::pair<uint32_t, uint32_t>> &nodes) {
  2066. const auto node_size = graph_item.node_items_.size();
  2067. for (const auto &item : nodes) {
  2068. const auto node_index = item.first;
  2069. GE_CHK_BOOL_RET_STATUS(node_index < node_size, FAILED, "node index invalid");
  2070. const auto &node_item = graph_item.node_items_[node_index];
  2071. if (item.second.first > 0) {
  2072. const auto prev_num = item.second.first;
  2073. if (node_index == prev_num) {
  2074. // Profiling Before root node.
  2075. for (uint32_t i = 1; i <= prev_num; ++i) {
  2076. GE_CHK_BOOL_RET_STATUS(node_index - i < node_size, FAILED, "prev index invalid");
  2077. const auto &curr_item = graph_item.node_items_[node_index - i];
  2078. graph_item.root_items_.emplace(graph_item.root_items_.begin(), curr_item);
  2079. }
  2080. } else {
  2081. GE_CHK_BOOL_RET_STATUS((node_index - prev_num) - 1 < node_size, FAILED, "prev index invalid");
  2082. const auto &prev_item = graph_item.node_items_[(node_index - prev_num) - 1];
  2083. for (uint32_t i = 1; i <= prev_num; ++i) {
  2084. GE_CHK_BOOL_RET_STATUS(node_index - i < node_size, FAILED, "prev index invalid");
  2085. const auto &curr_item = graph_item.node_items_[node_index - i];
  2086. prev_item->SetCtrlSend(curr_item, UINT32_MAX);
  2087. curr_item->SetCtrlSend(node_item, UINT32_MAX);
  2088. }
  2089. }
  2090. }
  2091. if (item.second.second > 0) {
  2092. const auto post_num = item.second.second;
  2093. if (node_size == node_index + post_num + 1) {
  2094. // Profiling After last node.
  2095. for (uint32_t i = 1; i <= post_num; ++i) {
  2096. GE_CHK_BOOL_RET_STATUS(node_index + i < node_size, FAILED, "post index invalid");
  2097. const auto &curr_item = graph_item.node_items_[node_index + i];
  2098. node_item->SetCtrlSend(curr_item, UINT32_MAX);
  2099. }
  2100. } else {
  2101. GE_CHK_BOOL_RET_STATUS((node_index + post_num) + 1 < node_size, FAILED, "post index invalid");
  2102. const auto &post_item = graph_item.node_items_[(node_index + post_num) + 1];
  2103. for (uint32_t i = 1; i <= post_num; ++i) {
  2104. GE_CHK_BOOL_RET_STATUS(node_index + i < node_size, FAILED, "post index invalid");
  2105. const auto &curr_item = graph_item.node_items_[node_index + i];
  2106. node_item->SetCtrlSend(curr_item, UINT32_MAX);
  2107. curr_item->SetCtrlSend(post_item, UINT32_MAX);
  2108. }
  2109. }
  2110. }
  2111. }
  2112. return SUCCESS;
  2113. }
  2114. Status HybridModelBuilder::BuildControlFlowGroup(GraphItem &graph_item, const NodePtr &node, NodeItem *node_item) {
  2115. GELOGD("Build control flow for node %s", node->GetName().c_str());
  2116. using GroupBuilder = std::function<Status(HybridModelBuilder *, const NodePtr &, NodeItem *)>;
  2117. static const std::map<std::string, GroupBuilder> control_flow{
  2118. { STREAMACTIVE, &HybridModelBuilder::CreateStreamActiveGroup },
  2119. { STREAMSWITCH, &HybridModelBuilder::CreateStreamSwitchGroup },
  2120. { STREAMSWITCHN, &HybridModelBuilder::CreateStreamSwitchNGroup },
  2121. { NEXTITERATION, &HybridModelBuilder::CreateNextIterationGroup },
  2122. { REFNEXTITERATION, &HybridModelBuilder::CreateNextIterationGroup },
  2123. { SWITCH, &HybridModelBuilder::CreateSwitchGroup },
  2124. { REFSWITCH, &HybridModelBuilder::CreateSwitchGroup },
  2125. { LABELSET, &HybridModelBuilder::CreateLabelSetGroup },
  2126. { LABELGOTO, &HybridModelBuilder::CreateLabelGotoGroup },
  2127. { LABELGOTOEX, &HybridModelBuilder::CreateLabelGotoGroup },
  2128. { LABELSWITCH, &HybridModelBuilder::CreateLabelSwitchGroup },
  2129. { LABELSWITCHBYINDEX, &HybridModelBuilder::CreateLabelSwitchGroup }
  2130. };
  2131. Status ret = SUCCESS;
  2132. auto it = control_flow.find(node_item->node_type);
  2133. if (it == control_flow.end()) {
  2134. ret = CreateNormalNodeGroup(node, node_item);
  2135. } else {
  2136. graph_item.has_ctrl_flow_op_ = true;
  2137. ret = it->second(this, node, node_item);
  2138. }
  2139. GELOGD("Node: %s, control by: %zu, control for: %zu, switch group: %zu", node->GetName().c_str(),
  2140. node_item->ctrl_recv_.size(), node_item->ctrl_send_.size(), node_item->switch_groups_.size());
  2141. return ret;
  2142. }
  2143. Status HybridModelBuilder::CreateNormalNodeGroup(const NodePtr &node, NodeItem *node_item) {
  2144. const auto out_ctrl_anchor = node->GetOutControlAnchor();
  2145. for (const auto &peer_in_anchor : out_ctrl_anchor->GetPeerInControlAnchors()) {
  2146. const auto &dst_node = peer_in_anchor->GetOwnerNode();
  2147. GE_CHECK_NOTNULL(dst_node);
  2148. NodeItem *dst_node_item = nullptr;
  2149. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  2150. "[%s] failed to get or create node item", dst_node->GetName().c_str());
  2151. node_item->SetCtrlSend(dst_node_item, UINT32_MAX);
  2152. }
  2153. return SUCCESS;
  2154. }
  2155. Status HybridModelBuilder::CreateStreamActiveGroup(const NodePtr &node, NodeItem *node_item) {
  2156. if (node_item->node_type != STREAMACTIVE) {
  2157. GELOGE(INTERNAL_ERROR, "Called by %s is invalid", node_item->node_type.c_str());
  2158. return INTERNAL_ERROR;
  2159. }
  2160. node_item->switch_groups_.resize(kStreamActiveNum);
  2161. const auto &out_ctrl_anchor = node->GetOutControlAnchor();
  2162. for (const auto &peer_in_anchor : out_ctrl_anchor->GetPeerInControlAnchors()) {
  2163. const auto &dst_node = peer_in_anchor->GetOwnerNode();
  2164. GE_CHECK_NOTNULL(dst_node);
  2165. if (dst_node->GetType() == STREAMMERGE) {
  2166. GELOGI("[%s] skip control node: %s", node->GetName().c_str(), dst_node->GetName().c_str());
  2167. continue;
  2168. }
  2169. NodeItem *dst_node_item = nullptr;
  2170. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  2171. "[%s] failed to get or create node item", dst_node->GetName().c_str());
  2172. node_item->SetCtrlSend(dst_node_item, kStreamActiveIdx);
  2173. }
  2174. return SUCCESS;
  2175. }
  2176. Status HybridModelBuilder::CreateStreamSwitchGroup(const NodePtr &node, NodeItem *node_item) {
  2177. if (node_item->node_type != STREAMSWITCH) {
  2178. GELOGE(INTERNAL_ERROR, "Called by %s is invalid", node_item->node_type.c_str());
  2179. return INTERNAL_ERROR;
  2180. }
  2181. // Consider as two groups, group[0] set empty for false, group[1] for true.
  2182. node_item->switch_groups_.resize(kStreamSwitchNum);
  2183. const auto &out_ctrl_anchor = node->GetOutControlAnchor();
  2184. for (const auto &peer_in_anchor : out_ctrl_anchor->GetPeerInControlAnchors()) {
  2185. const auto &dst_node = peer_in_anchor->GetOwnerNode();
  2186. GE_CHECK_NOTNULL(dst_node);
  2187. NodeItem *dst_node_item = nullptr;
  2188. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  2189. "[%s] failed to get or create node item", dst_node->GetName().c_str());
  2190. node_item->SetCtrlSend(dst_node_item, kStreamSwitchIdx);
  2191. }
  2192. return SUCCESS;
  2193. }
  2194. Status HybridModelBuilder::CreateStreamSwitchNGroup(const NodePtr &node, NodeItem *node_item) {
  2195. if (node_item->node_type != STREAMSWITCHN) {
  2196. GELOGE(INTERNAL_ERROR, "Called by %s is invalid", node->GetName().c_str());
  2197. return INTERNAL_ERROR;
  2198. }
  2199. uint32_t batch_num = 0;
  2200. if (!AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_BATCH_NUM, batch_num)) {
  2201. GELOGE(INTERNAL_ERROR, "[%s] Get ATTR_NAME_BATCH_NUM failed", node->GetName().c_str());
  2202. return INTERNAL_ERROR;
  2203. }
  2204. if (batch_num == 0) {
  2205. GELOGW("[%s] Got empty branch for SwitchN, Please check.", node->GetName().c_str());
  2206. return SUCCESS;
  2207. }
  2208. node_item->switch_groups_.resize(batch_num);
  2209. const auto &out_ctrl_anchor = node->GetOutControlAnchor();
  2210. for (const auto &peer_in_anchor : out_ctrl_anchor->GetPeerInControlAnchors()) {
  2211. const auto &dst_node = peer_in_anchor->GetOwnerNode();
  2212. GE_CHECK_NOTNULL(dst_node);
  2213. std::string batch_label;
  2214. if (!AttrUtils::GetStr(node->GetOpDesc(), ATTR_NAME_BATCH_LABEL, batch_label)) {
  2215. GELOGE(INTERNAL_ERROR, "[%s] Get ATTR_NAME_BATCH_LABEL failed", node->GetName().c_str());
  2216. return INTERNAL_ERROR;
  2217. }
  2218. std::string::size_type pos = batch_label.rfind("_");
  2219. if (pos == std::string::npos) {
  2220. GELOGW("[%s] Separator not found in batch label: %s.", node->GetName().c_str(), batch_label.c_str());
  2221. continue;
  2222. }
  2223. ++pos; // Skip Separator
  2224. uint64_t batch_index = std::strtoul(batch_label.data() + pos, nullptr, kDecimal);
  2225. if (batch_index >= batch_num) {
  2226. GELOGW("batch label: %s, batch index: %lu great than batch num: %u", batch_label.c_str(), batch_index, batch_num);
  2227. continue;
  2228. }
  2229. NodeItem *dst_node_item = nullptr;
  2230. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  2231. "[%s] failed to get or create node item", dst_node->GetName().c_str());
  2232. node_item->SetCtrlSend(dst_node_item, batch_index);
  2233. }
  2234. return SUCCESS;
  2235. }
  2236. Status HybridModelBuilder::CreateNextIterationGroup(const NodePtr &node, NodeItem *node_item) {
  2237. if (node_item->node_type != NEXTITERATION && node_item->node_type != REFNEXTITERATION) {
  2238. GELOGE(INTERNAL_ERROR, "Called by %s is invalid", node->GetName().c_str());
  2239. return INTERNAL_ERROR;
  2240. }
  2241. return SUCCESS;
  2242. }
  2243. Status HybridModelBuilder::CreateSwitchGroup(const NodePtr &node, NodeItem *node_item) {
  2244. if (node_item->node_type != SWITCH && node_item->node_type != REFSWITCH) {
  2245. GELOGE(INTERNAL_ERROR, "Called by %s is invalid", node->GetName().c_str());
  2246. return INTERNAL_ERROR;
  2247. }
  2248. const auto &out_ctrl_anchor = node->GetOutControlAnchor();
  2249. for (const auto &peer_in_anchor : out_ctrl_anchor->GetPeerInControlAnchors()) {
  2250. const auto &dst_node = peer_in_anchor->GetOwnerNode();
  2251. GE_CHECK_NOTNULL(dst_node);
  2252. NodeItem *dst_node_item = nullptr;
  2253. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  2254. "[%s] failed to get or create node item", dst_node->GetName().c_str());
  2255. node_item->SetCtrlSend(dst_node_item, UINT32_MAX);
  2256. }
  2257. // Group switch flow by out put data.
  2258. node_item->switch_groups_.resize(SWITCH_OUTPUT_NUM);
  2259. for (uint32_t i = 0; i < SWITCH_OUTPUT_NUM; ++i) {
  2260. const auto &out_anchor = node->GetOutDataAnchor(i);
  2261. for (const auto &peer_in_anchor : out_anchor->GetPeerInDataAnchors()) {
  2262. const auto &dst_node = peer_in_anchor->GetOwnerNode();
  2263. GE_CHECK_NOTNULL(dst_node);
  2264. NodeItem *dst_node_item = nullptr;
  2265. GE_CHK_STATUS_RET(GetOrCreateNodeItem(dst_node, &dst_node_item),
  2266. "[%s] failed to get or create node item", dst_node->GetName().c_str());
  2267. node_item->SetCtrlSend(dst_node_item, i); // take switch data as ctrl.
  2268. }
  2269. }
  2270. return SUCCESS;
  2271. }
  2272. Status HybridModelBuilder::CreateLabelSetGroup(const NodePtr &node, NodeItem *node_item) {
  2273. if (node_item->node_type != LABELSET) {
  2274. GELOGE(INTERNAL_ERROR, "Called by %s is invalid", node->GetName().c_str());
  2275. return INTERNAL_ERROR;
  2276. }
  2277. GELOGE(UNSUPPORTED, "[%s] Not implemented.", node->GetName().c_str());
  2278. return UNSUPPORTED;
  2279. }
  2280. Status HybridModelBuilder::CreateLabelGotoGroup(const NodePtr &node, NodeItem *node_item) {
  2281. if (node_item->node_type != LABELGOTO && node_item->node_type != LABELGOTOEX) {
  2282. GELOGE(INTERNAL_ERROR, "Called by %s is invalid", node->GetName().c_str());
  2283. return INTERNAL_ERROR;
  2284. }
  2285. GELOGE(UNSUPPORTED, "[%s] Not implemented.", node->GetName().c_str());
  2286. return UNSUPPORTED;
  2287. }
  2288. Status HybridModelBuilder::CreateLabelSwitchGroup(const NodePtr &node, NodeItem *node_item) {
  2289. if (node_item->node_type != LABELSWITCH && node_item->node_type != LABELSWITCHBYINDEX) {
  2290. GELOGE(INTERNAL_ERROR, "Called by %s is invalid", node->GetName().c_str());
  2291. return INTERNAL_ERROR;
  2292. }
  2293. GELOGE(UNSUPPORTED, "[%s] Not implemented.", node->GetName().c_str());
  2294. return UNSUPPORTED;
  2295. }
  2296. } // namespace hybrid
  2297. } // namespace ge

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