You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

hybrid_model_builder.cc 62 kB

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

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