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

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

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