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

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

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