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.

var_mem_assign_util.cc 18 kB

5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
4 years ago
4 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384
  1. /**
  2. * Copyright 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 "graph/build/memory/var_mem_assign_util.h"
  17. #include <vector>
  18. #include "common/types.h"
  19. #include "framework/common/debug/ge_log.h"
  20. #include "graph/common/transop_util.h"
  21. #include "graph/debug/ge_attr_define.h"
  22. #include "graph/manager/graph_mem_allocator.h"
  23. #include "graph/manager/graph_var_manager.h"
  24. #include "graph/tensor.h"
  25. #include "graph/types.h"
  26. #include "graph/utils/attr_utils.h"
  27. #include "graph/utils/graph_utils.h"
  28. #include "graph/utils/tensor_utils.h"
  29. using std::string;
  30. using std::vector;
  31. namespace ge {
  32. Status VarMemAssignUtil::AssignVarMemory(ge::ComputeGraphPtr &compute_graph) {
  33. return AssignMemory2VariableNode(compute_graph);
  34. }
  35. Status VarMemAssignUtil::AssignConstantOpMemory(ge::ComputeGraphPtr &compute_graph) {
  36. return AssignStaticMemory2Node(compute_graph);
  37. }
  38. Status VarMemAssignUtil::AssignMemory2VariableNode(ge::ComputeGraphPtr &compute_graph) {
  39. return AssignStaticMemory2Node(compute_graph);
  40. }
  41. Status VarMemAssignUtil::AssignStaticMemory2Node(ge::ComputeGraphPtr &compute_graph) {
  42. GE_IF_BOOL_EXEC(compute_graph == nullptr, return FAILED);
  43. for (const ge::NodePtr &n : compute_graph->GetAllNodes()) {
  44. GE_IF_BOOL_EXEC((n->GetType() != VARIABLE) && (n->GetType() != CONSTANTOP), continue);
  45. string ref_var_src_var_name;
  46. GE_CHECK_NOTNULL(n->GetOpDesc());
  47. GE_IF_BOOL_EXEC(ge::AttrUtils::GetStr(n->GetOpDesc(), REF_VAR_SRC_VAR_NAME, ref_var_src_var_name), continue);
  48. string node_name = n->GetName();
  49. GE_IF_BOOL_EXEC(n->GetOpDesc()->GetAllOutputsDesc().empty(),
  50. REPORT_INNER_ERROR("E19999", "check node:%s has no OutputDesc",
  51. n->GetName().c_str());
  52. GELOGE(FAILED, "node:%s has no OutputDesc.", n->GetName().c_str());
  53. return FAILED);
  54. ge::ConstGeTensorDescPtr tensor_desc = n->GetOpDesc()->GetOutputDescPtr(0);
  55. GE_CHECK_NOTNULL(tensor_desc);
  56. rtMemType_t memory_type = RT_MEMORY_HBM;
  57. uint32_t mem_type = 0;
  58. if (AttrUtils::GetInt(n->GetOpDesc(), ATTR_OUTPUT_MEMORY_TYPE, mem_type) && (mem_type == 1)) {
  59. memory_type = RT_MEMORY_RDMA_HBM;
  60. }
  61. if (!VarManager::Instance(compute_graph->GetSessionID())->IsVarExist(node_name, *tensor_desc)) {
  62. GE_CHK_STATUS_RET(
  63. VarManager::Instance(compute_graph->GetSessionID())->AssignVarMem(node_name, *tensor_desc, memory_type));
  64. GE_IF_BOOL_EXEC(n->GetType() == VARIABLE,
  65. GE_CHK_STATUS_RET(AssignData2Fp32Var(n, compute_graph->GetSessionID())));
  66. GE_CHK_STATUS_RET(VarManager::Instance(compute_graph->GetSessionID())
  67. ->SetAllocatedGraphId(node_name, compute_graph->GetGraphID()));
  68. }
  69. uint8_t *dev_ptr = nullptr;
  70. GE_CHK_STATUS_RET(VarManager::Instance(compute_graph->GetSessionID())
  71. ->GetVarAddr(node_name, *tensor_desc, &dev_ptr, memory_type));
  72. vector<int64_t> output_list = n->GetOpDesc()->GetOutputOffset();
  73. GE_IF_BOOL_EXEC(output_list.empty(), return FAILED);
  74. output_list[0] = static_cast<int64_t>(reinterpret_cast<intptr_t>(dev_ptr));
  75. n->GetOpDesc()->SetOutputOffset(output_list);
  76. }
  77. return SUCCESS;
  78. }
  79. Status VarMemAssignUtil::AssignData2Fp32Var(const ge::NodePtr &node, uint64_t session_id) {
  80. string src_var_name;
  81. GE_CHECK_NOTNULL(node->GetOpDesc());
  82. if (ge::AttrUtils::GetStr(node->GetOpDesc(), VAR_ATTR_SRC_VAR_NAME, src_var_name)) {
  83. ge::GeTensorDesc cur_tensor_desc;
  84. uint8_t *dev_ptr = nullptr;
  85. rtMemType_t memory_type = RT_MEMORY_HBM;
  86. GE_CHK_STATUS_RET(VarManager::Instance(session_id)->GetCurVarDesc(src_var_name, cur_tensor_desc));
  87. GE_CHK_STATUS_RET(
  88. VarManager::Instance(session_id)->GetVarAddr(src_var_name, cur_tensor_desc, &dev_ptr, memory_type));
  89. GE_CHK_STATUS_RET(
  90. VarManager::Instance(session_id)->SetVarAddr(node->GetName(), cur_tensor_desc, dev_ptr, memory_type));
  91. }
  92. return SUCCESS;
  93. }
  94. Status VarMemAssignUtil::AssignVarAttr2Nodes(ge::ComputeGraphPtr &compute_graph) {
  95. for (const ge::NodePtr &node : compute_graph->GetAllNodes()) {
  96. GE_IF_BOOL_EXEC(node->GetType() != VARIABLE, continue);
  97. string ref_var_src_var_name;
  98. GE_CHECK_NOTNULL(node->GetOpDesc());
  99. GE_IF_BOOL_EXEC(ge::AttrUtils::GetStr(node->GetOpDesc(), REF_VAR_SRC_VAR_NAME, ref_var_src_var_name), continue);
  100. GE_CHK_STATUS_RET(DealVariableNode(compute_graph->GetGraphID(), node, compute_graph->GetSessionID()));
  101. }
  102. return SUCCESS;
  103. }
  104. Status VarMemAssignUtil::SetOutVariableAttr(const ge::NodePtr &node, const ge::NodePtr &var_node, int index,
  105. uint64_t session_id) {
  106. vector<int64_t> output_list;
  107. uint8_t *dev_ptr = nullptr;
  108. GE_CHECK_NOTNULL(node->GetOpDesc());
  109. output_list = node->GetOpDesc()->GetOutputOffset();
  110. if (output_list.empty()) {
  111. REPORT_INNER_ERROR("E19999", "check node:%s output_offset_list is empty",
  112. node->GetName().c_str());
  113. GELOGE(PARAM_INVALID, "Output_list is empty");
  114. return PARAM_INVALID;
  115. }
  116. GE_CHECK_NOTNULL(var_node->GetOpDesc());
  117. GeTensorDesc var_tensor_desc = var_node->GetOpDesc()->GetOutputDesc(0);
  118. rtMemType_t memory_type = RT_MEMORY_HBM;
  119. GE_CHK_STATUS_RET(
  120. VarManager::Instance(session_id)->GetVarAddr(var_node->GetName(), var_tensor_desc, &dev_ptr, memory_type));
  121. int out_list_size = static_cast<int>(output_list.size());
  122. if (index >= out_list_size) {
  123. REPORT_INNER_ERROR("E19999", "param index:%d >= output_list.size() %d in node %s, check invalid",
  124. index, out_list_size, node->GetName().c_str());
  125. GELOGE(FAILED, "index %d >= output_list.size() %d", index, out_list_size);
  126. return FAILED;
  127. }
  128. output_list[index] = static_cast<int64_t>(reinterpret_cast<intptr_t>(dev_ptr));
  129. GELOGI("Assign node outputOffset[index] is: %ld", output_list[index]);
  130. node->GetOpDesc()->SetOutputOffset(output_list);
  131. return SUCCESS;
  132. }
  133. Status VarMemAssignUtil::DealExportVariableNode(const ge::NodePtr &node, const ge::NodePtr &var_node,
  134. uint64_t session_id) {
  135. ge::OutDataAnchorPtr var_out_anchor = node->GetOutDataAnchor(0);
  136. GE_IF_BOOL_EXEC(var_out_anchor == nullptr, return FAILED);
  137. for (const ge::InDataAnchorPtr &dst_in_var_anchor : var_out_anchor->GetPeerInDataAnchors()) {
  138. ge::NodePtr dst_node = dst_in_var_anchor->GetOwnerNode();
  139. if ((dst_node->GetType() == ASSIGN) || (dst_node->GetType() == ASSIGNADD) || (dst_node->GetType() == ASSIGNSUB)) {
  140. if (dst_in_var_anchor == dst_node->GetInDataAnchor(0)) {
  141. GE_CHK_STATUS_RET(DealExportVariableNode(dst_node, var_node, session_id));
  142. }
  143. }
  144. }
  145. GE_CHK_STATUS_RET(SetOutVariableAttr(node, var_node, 0, session_id));
  146. return SUCCESS;
  147. }
  148. Status VarMemAssignUtil::DealBroadCastNode(uint32_t graph_id, const ge::NodePtr &node,
  149. const ge::InDataAnchorPtr &in_data_anchor, const ge::NodePtr &var_node,
  150. uint64_t session_id) {
  151. VarBroadCastInfo broad_cast_info;
  152. broad_cast_info.idx = in_data_anchor->GetIdx();
  153. broad_cast_info.var_name = var_node->GetName();
  154. broad_cast_info.broadcast_name = node->GetName();
  155. auto op_desc = node->GetOpDesc();
  156. GE_CHK_BOOL_RET_STATUS(op_desc != nullptr, FAILED, "Get broadcast op %s desc is nullptr", node->GetName().c_str());
  157. GE_IF_BOOL_EXEC(broad_cast_info.idx < 0,
  158. GELOGI("Broadcast input index must be positive, actual %d", broad_cast_info.idx);
  159. return INTERNAL_ERROR);
  160. auto broad_cast_index = static_cast<size_t>(broad_cast_info.idx);
  161. auto input_tensor_desc_ptr_vistor = op_desc->GetAllInputsDescPtr();
  162. if (input_tensor_desc_ptr_vistor.size() <= broad_cast_index) {
  163. REPORT_INNER_ERROR("E19999", "Get broadcast op %s input tensor desc size [%zu] < idx [%d]",
  164. node->GetName().c_str(), input_tensor_desc_ptr_vistor.size(), broad_cast_info.idx);
  165. GELOGE(FAILED, "Get broadcast op %s input tensor desc size [%zu] < idx [%d]", node->GetName().c_str(),
  166. input_tensor_desc_ptr_vistor.size(), broad_cast_info.idx);
  167. return FAILED;
  168. }
  169. const ge::GeTensorDescPtr input_tensor_desc =
  170. input_tensor_desc_ptr_vistor.at(static_cast<size_t>(broad_cast_info.idx));
  171. int64_t input_size = 0;
  172. GE_CHK_STATUS(TensorUtils::GetSize(*input_tensor_desc, input_size), "get input size failed.");
  173. broad_cast_info.input_size = input_size;
  174. vector<int64_t> output_list = op_desc->GetOutputOffset();
  175. GE_CHK_BOOL_RET_STATUS(output_list.size() > broad_cast_index, FAILED,
  176. "Get broadcast op %s output_list size [%zu] < idx [%d]", node->GetName().c_str(),
  177. output_list.size(), broad_cast_info.idx);
  178. broad_cast_info.input_offset = output_list[broad_cast_info.idx];
  179. broad_cast_info.output_offset = output_list[broad_cast_info.idx];
  180. op_desc->SetInputOffset(output_list);
  181. auto output_tensor_desc_ptr_vistor = op_desc->GetAllOutputsDescPtr();
  182. GE_CHK_BOOL_RET_STATUS(output_tensor_desc_ptr_vistor.size() > broad_cast_index, FAILED,
  183. "Get broadcast op %s output tensor desc size [%zu] < idx [%d]", node->GetName().c_str(),
  184. output_tensor_desc_ptr_vistor.size(), broad_cast_info.idx);
  185. const ge::GeTensorDescPtr output_tensor_desc =
  186. output_tensor_desc_ptr_vistor.at(static_cast<size_t>(broad_cast_info.idx));
  187. int64_t output_size = 0;
  188. GE_CHK_STATUS(TensorUtils::GetSize(*output_tensor_desc, output_size), "get input size failed.");
  189. broad_cast_info.output_size = output_size;
  190. GE_CHK_BOOL_RET_STATUS(broad_cast_info.output_size == broad_cast_info.input_size, FAILED,
  191. "Broadcast op input size[%lu] is not equal output size[%lu]", broad_cast_info.input_size,
  192. broad_cast_info.output_size);
  193. GE_CHK_STATUS_RET(VarManager::Instance(session_id)->SaveBroadCastInfo(graph_id, broad_cast_info));
  194. return SUCCESS;
  195. }
  196. Status VarMemAssignUtil::DealVariableNode(uint32_t graph_id, const ge::NodePtr &node, uint64_t session_id) {
  197. GE_CHK_STATUS_RET(SetOutVariableAttr(node, node, 0, session_id));
  198. for (const ge::OutDataAnchorPtr &var_out_data_anchor : node->GetAllOutDataAnchors()) {
  199. for (const ge::InDataAnchorPtr &dst_in_data_anchor : var_out_data_anchor->GetPeerInDataAnchors()) {
  200. ge::NodePtr dst_node = dst_in_data_anchor->GetOwnerNode();
  201. if (dst_node->GetType() == HCOMBROADCAST || dst_node->GetType() == HVDCALLBACKBROADCAST) {
  202. GE_CHK_STATUS_RET(DealBroadCastNode(graph_id, dst_node, dst_in_data_anchor, node, session_id));
  203. continue;
  204. }
  205. if ((dst_node->GetType() == ASSIGN) || (dst_node->GetType() == ASSIGNADD) || (dst_node->GetType() == ASSIGNSUB)) {
  206. if (dst_in_data_anchor == dst_node->GetInDataAnchor(0)) {
  207. GE_CHK_STATUS_RET(DealExportVariableNode(dst_node, node, session_id));
  208. }
  209. }
  210. auto dst_type = dst_node->GetType();
  211. bool is_trans_node =
  212. (dst_type == TRANSDATA) || (dst_type == CAST) || (dst_type == TRANSPOSE) || (dst_type == PERMUTE);
  213. if (is_trans_node) {
  214. NodePtr final_trans_node = GetFinalTransNode(dst_node);
  215. GE_CHK_STATUS_RET(DealTransNode(final_trans_node));
  216. }
  217. }
  218. }
  219. return SUCCESS;
  220. }
  221. ge::NodePtr VarMemAssignUtil::GetFinalTransNode(const ge::NodePtr &trans_node) {
  222. NodePtr final_ref_node = trans_node;
  223. OutDataAnchorPtr trans_out_data_anchor = trans_node->GetOutDataAnchor(0);
  224. GE_IF_BOOL_EXEC(trans_out_data_anchor == nullptr, return final_ref_node);
  225. for (const auto &dst_in_anchor : trans_out_data_anchor->GetPeerInDataAnchors()) {
  226. NodePtr dst_node = dst_in_anchor->GetOwnerNode();
  227. auto dst_type = dst_node->GetType();
  228. bool is_trans_node =
  229. (dst_type == TRANSDATA) || (dst_type == CAST) || (dst_type == TRANSPOSE) || (dst_type == PERMUTE);
  230. if (is_trans_node && (dst_in_anchor->GetIdx() == 0)) {
  231. final_ref_node = GetFinalTransNode(dst_node);
  232. }
  233. }
  234. GELOGI("Final writable node is %s", final_ref_node->GetName().c_str());
  235. return final_ref_node;
  236. }
  237. Status VarMemAssignUtil::DealTransNode(const ge::NodePtr &final_trans_node) {
  238. ge::OutDataAnchorPtr final_trans_out_anchor = final_trans_node->GetOutDataAnchor(0);
  239. GE_IF_BOOL_EXEC(final_trans_out_anchor == nullptr, return SUCCESS);
  240. for (const ge::InDataAnchorPtr &dst_in_var_anchor : final_trans_out_anchor->GetPeerInDataAnchors()) {
  241. ge::NodePtr dst_node = dst_in_var_anchor->GetOwnerNode();
  242. if ((dst_node->GetType() == ASSIGN) || (dst_node->GetType() == ASSIGNADD) || (dst_node->GetType() == ASSIGNSUB)) {
  243. GE_CHK_STATUS_RET(DealExportTransNode(dst_node, final_trans_node));
  244. }
  245. }
  246. return SUCCESS;
  247. }
  248. Status VarMemAssignUtil::DealExportTransNode(const ge::NodePtr &node, const ge::NodePtr &final_trans_node) {
  249. ge::OutDataAnchorPtr node_out_anchor = node->GetOutDataAnchor(0);
  250. GE_CHECK_NOTNULL(node_out_anchor);
  251. for (const ge::InDataAnchorPtr &dst_in_var_anchor : node_out_anchor->GetPeerInDataAnchors()) {
  252. ge::NodePtr dst_node = dst_in_var_anchor->GetOwnerNode();
  253. if ((dst_node->GetType() == ASSIGN) || (dst_node->GetType() == ASSIGNADD) || (dst_node->GetType() == ASSIGNSUB)) {
  254. GE_CHK_STATUS_RET(DealExportTransNode(dst_node, final_trans_node));
  255. }
  256. }
  257. GE_CHK_STATUS_RET(SetOutTransNodeToAssign(node, final_trans_node, 0));
  258. return SUCCESS;
  259. }
  260. Status VarMemAssignUtil::SetOutTransNodeToAssign(const ge::NodePtr &node, const ge::NodePtr &final_trans_node,
  261. size_t index) {
  262. GE_CHECK_NOTNULL(node->GetOpDesc());
  263. GE_CHECK_NOTNULL(final_trans_node->GetOpDesc());
  264. // get final_trans_node outputOffset
  265. vector<int64_t> final_trans_output_list = final_trans_node->GetOpDesc()->GetOutputOffset();
  266. GE_CHECK_SIZE(final_trans_output_list.size());
  267. // get assign_node outputOffset
  268. vector<int64_t> output_list = node->GetOpDesc()->GetOutputOffset();
  269. auto out_list_size = output_list.size();
  270. GE_CHECK_SIZE(out_list_size);
  271. GE_CHK_BOOL_RET_STATUS(index < out_list_size, FAILED, "index %zu >= output_list.size() %zu", index, out_list_size);
  272. // final_trans_node outputOffset[0] to assign_node outputOffset[0]
  273. GELOGI("final_trans_node outputOffset[0] is: %ld", final_trans_output_list[0]);
  274. output_list[index] = final_trans_output_list[0];
  275. GELOGI("Assign node outputOffset[0] is: %ld", output_list[index]);
  276. node->GetOpDesc()->SetOutputOffset(output_list);
  277. return SUCCESS;
  278. }
  279. Status VarMemAssignUtil::AssignMemory2HasRefAttrNode(ge::ComputeGraphPtr &compute_graph) {
  280. GraphToNodeMap graph_to_node;
  281. for (const ge::NodePtr &n : compute_graph->GetAllNodes()) {
  282. string ref_var_src_var_name;
  283. auto op_desc = n->GetOpDesc();
  284. GE_CHECK_NOTNULL(op_desc);
  285. for (uint32_t idx = 0; idx < op_desc->GetOutputsSize(); idx += 1) {
  286. const auto out_desc = op_desc->MutableOutputDesc(idx);
  287. if (ge::AttrUtils::GetStr(out_desc, REF_VAR_SRC_VAR_NAME, ref_var_src_var_name)) {
  288. GE_CHK_STATUS_RET(
  289. AssignData2VarRef(n, ref_var_src_var_name, compute_graph->GetSessionID(), idx, graph_to_node));
  290. }
  291. }
  292. }
  293. return SUCCESS;
  294. }
  295. Status VarMemAssignUtil::AssignData2VarRef(const ge::NodePtr &has_ref_attr_node, const string &src_var_name,
  296. uint64_t session_id, uint32_t out_index,
  297. GraphToNodeMap &graph_to_node) {
  298. // Get ref_var_src_var address
  299. auto root_graph = GraphUtils::FindRootGraph(has_ref_attr_node->GetOwnerComputeGraph());
  300. GE_CHECK_NOTNULL(root_graph);
  301. // Cache mapping (name to nodeptr) simproves query performance
  302. auto &name_to_node = graph_to_node[root_graph];
  303. if (name_to_node.empty()) {
  304. for (const ge::NodePtr &n : root_graph->GetDirectNode()) {
  305. name_to_node.emplace(n->GetName(), n);
  306. }
  307. for (auto sub_graph : root_graph->GetAllSubgraphs()) {
  308. auto &name_to_node_sub = graph_to_node[sub_graph];
  309. if (name_to_node_sub.empty()) {
  310. for (const ge::NodePtr &n : sub_graph->GetDirectNode()) {
  311. name_to_node_sub.emplace(n->GetName(), n);
  312. }
  313. }
  314. }
  315. }
  316. ge::NodePtr var_ref_src_var = nullptr;
  317. auto it = name_to_node.find(src_var_name);
  318. if ((it != name_to_node.end()) && (it->second != nullptr)) {
  319. var_ref_src_var = it->second;
  320. } else {
  321. for (auto sub_graph : root_graph->GetAllSubgraphs()) {
  322. auto &name_to_node_sub = graph_to_node[sub_graph];
  323. it = name_to_node_sub.find(src_var_name);
  324. if ((it != name_to_node_sub.end()) && (it->second != nullptr)) {
  325. var_ref_src_var = it->second;
  326. break;
  327. }
  328. }
  329. }
  330. GE_IF_BOOL_EXEC(var_ref_src_var == nullptr || var_ref_src_var->GetOpDesc() == nullptr, return FAILED);
  331. GeTensorDesc src_tensor_desc = var_ref_src_var->GetOpDesc()->GetOutputDesc(0);
  332. uint8_t *dev_ptr = nullptr;
  333. GE_CHK_STATUS_RET(VarManager::Instance(session_id)->GetVarAddr(src_var_name, src_tensor_desc, &dev_ptr));
  334. GE_CHECK_NOTNULL(has_ref_attr_node->GetOpDesc());
  335. vector<int64_t> ref_attr_node_output_list = has_ref_attr_node->GetOpDesc()->GetOutputOffset();
  336. GE_CHECK_SIZE(ref_attr_node_output_list.size());
  337. GE_CHK_BOOL_RET_STATUS(out_index < ref_attr_node_output_list.size(), FAILED,
  338. "out_index %u >= ref_attr_node_output_list.size() %zu", out_index,
  339. ref_attr_node_output_list.size());
  340. ref_attr_node_output_list[out_index] = static_cast<int64_t>(reinterpret_cast<uintptr_t>(dev_ptr));
  341. has_ref_attr_node->GetOpDesc()->SetOutputOffset(ref_attr_node_output_list);
  342. GELOGI("Refresh address successfully, ref node: [%s], addr: [%ld]", has_ref_attr_node->GetName().c_str(),
  343. ref_attr_node_output_list[out_index]);
  344. return SUCCESS;
  345. }
  346. } // namespace ge

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