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

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