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.

graph_optimize.cc 18 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
4 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
4 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
4 years ago
4 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414
  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/optimize/graph_optimize.h"
  17. #include "graph/ge_context.h"
  18. #include "graph/common/local_context.h"
  19. #include "graph/passes/dimension_adjust_pass.h"
  20. #include "inc/pass_manager.h"
  21. #include "init/gelib.h"
  22. namespace {
  23. const char *const kVectorCore = "VectorCore";
  24. const char *const kVectorEngine = "VectorEngine";
  25. const char *const kAicoreEngine = "AIcoreEngine";
  26. } // namespace
  27. namespace ge {
  28. GraphOptimize::GraphOptimize()
  29. : optimize_type_(domi::FrameworkType::TENSORFLOW),
  30. cal_config_(""),
  31. insert_op_config_(""),
  32. core_type_("") {}
  33. void AddNodeInputProperty(ComputeGraphPtr &compute_graph) {
  34. if (compute_graph == nullptr) {
  35. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[AddNodeInputProperty]: compute_graph is nullptr.");
  36. return;
  37. }
  38. for (ge::NodePtr &node : compute_graph->GetDirectNode()) {
  39. auto node_op_desc = node->GetOpDesc();
  40. GE_IF_BOOL_EXEC(node_op_desc == nullptr, GELOGW("node_op_desc is nullptr!"); return );
  41. auto in_control_anchor = node->GetInControlAnchor();
  42. vector<string> src_name_list;
  43. vector<string> input_name_list;
  44. vector<int64_t> src_index_list;
  45. GE_IF_BOOL_EXEC(
  46. in_control_anchor != nullptr, string src_name_temp; for (auto &out_control_anchor
  47. : in_control_anchor->GetPeerOutControlAnchors()) {
  48. ge::NodePtr src_node = out_control_anchor->GetOwnerNode();
  49. GE_IF_BOOL_EXEC(src_node == nullptr, GELOGW("src_node is nullptr!"); continue);
  50. src_name_temp = src_name_temp == "" ? src_node->GetName() : src_name_temp + ":" + src_node->GetName();
  51. } GE_IF_BOOL_EXEC(src_name_temp != "", src_name_list.emplace_back(src_name_temp);
  52. node_op_desc->SetSrcName(src_name_list);))
  53. for (auto &in_data_anchor : node->GetAllInDataAnchors()) {
  54. auto peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  55. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  56. ge::NodePtr src_node = peer_out_anchor->GetOwnerNode();
  57. src_index_list = node_op_desc->GetSrcIndex();
  58. src_name_list.emplace_back(src_node->GetName());
  59. src_index_list.emplace_back(peer_out_anchor->GetIdx());
  60. node_op_desc->SetSrcName(src_name_list);
  61. node_op_desc->SetSrcIndex(src_index_list);
  62. GE_IF_BOOL_EXEC(!(node_op_desc->GetType() == NETOUTPUT && GetLocalOmgContext().type == domi::TENSORFLOW),
  63. ge::NodePtr peer_owner_node = peer_out_anchor->GetOwnerNode();
  64. input_name_list.emplace_back(
  65. peer_owner_node->GetName() +
  66. (peer_out_anchor->GetIdx() == 0 ? "" : ": " + to_string(peer_out_anchor->GetIdx())));
  67. node_op_desc->SetInputName(input_name_list);)
  68. }
  69. }
  70. }
  71. Status GraphOptimize::OptimizeSubGraph(ComputeGraphPtr &compute_graph, const std::string &engine_name) {
  72. if (compute_graph == nullptr) {
  73. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeSubGraph]: compute_graph is nullptr.");
  74. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  75. }
  76. Status ret = SUCCESS;
  77. vector<GraphOptimizerPtr> graph_optimizer;
  78. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  79. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  80. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "GraphOptimzer: GE is not initialized");
  81. return GE_CLI_GE_NOT_INITIALIZED;
  82. }
  83. if (instance_ptr->DNNEngineManagerObj().IsEngineRegistered(engine_name)) {
  84. instance_ptr->OpsKernelManagerObj().GetGraphOptimizerByEngine(engine_name, graph_optimizer);
  85. AddNodeInputProperty(compute_graph);
  86. if (compute_graph->GetDirectNode().size() == 0) {
  87. GELOGW("[OptimizeSubGraph] compute_graph do not has any node.");
  88. return SUCCESS;
  89. }
  90. if (build_mode_ == BUILD_MODE_TUNING && (build_step_ == BUILD_STEP_AFTER_UB_MATCH
  91. || build_step_ == BUILD_STEP_AFTER_MERGE)) {
  92. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  93. Status ret = (*iter)->OptimizeFusedGraphAfterGraphSlice(*(compute_graph));
  94. if (ret != SUCCESS) {
  95. GELOGE(ret, "[OptimizeSubGraph][OptimizeFusedGraphAfterGraphSlice]: graph optimize failed, ret:%d", ret);
  96. return ret;
  97. }
  98. }
  99. return SUCCESS;
  100. }
  101. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  102. ret = (*iter)->OptimizeFusedGraph(*(compute_graph));
  103. if (ret != SUCCESS) {
  104. GELOGE(ret, "[OptimizeSubGraph][OptimizeFusedGraph]: graph optimize failed, ret:%d", ret);
  105. return ret;
  106. }
  107. }
  108. } else {
  109. GELOGI("Engine: %s is not registered. do nothing in subGraph Optimize by ATC.", engine_name.c_str());
  110. }
  111. return ret;
  112. }
  113. Status GraphOptimize::OptimizeOriginalGraph(ComputeGraphPtr &compute_graph) {
  114. if (GetContext().GetHostExecFlag()) {
  115. // graph exec on host, no need OptimizeOriginalGraph
  116. return SUCCESS;
  117. }
  118. if (compute_graph == nullptr) {
  119. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeOriginalGraph]: compute_graph is nullptr.");
  120. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  121. }
  122. Status ret = SUCCESS;
  123. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  124. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  125. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeOriginalGraph failed.");
  126. return GE_CLI_GE_NOT_INITIALIZED;
  127. }
  128. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  129. GELOGI("optimize by opskernel in original graph optimize phase. num of graph_optimizer is %zu.",
  130. graph_optimizer.size());
  131. string exclude_core_Type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  132. GELOGD("[OptimizeOriginalGraph]: engine type will exclude: %s", exclude_core_Type.c_str());
  133. if (graph_optimizer.size() != 0) {
  134. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  135. if (iter->first == exclude_core_Type) {
  136. continue;
  137. }
  138. ret = (iter->second)->OptimizeOriginalGraph(*compute_graph);
  139. if (ret != SUCCESS) {
  140. GELOGE(ret, "[OptimizeOriginalGraph]: graph optimize failed, ret:%d", ret);
  141. return ret;
  142. }
  143. }
  144. }
  145. return ret;
  146. }
  147. Status GraphOptimize::OptimizeOriginalGraphJudgeInsert(ComputeGraphPtr &compute_graph) {
  148. GELOGD("OptimizeOriginalGraphJudgeInsert in");
  149. if (GetContext().GetHostExecFlag()) {
  150. // graph exec on host, no need OptimizeOriginalGraphJudgeInsert
  151. return SUCCESS;
  152. }
  153. GE_CHECK_NOTNULL(compute_graph);
  154. Status ret = SUCCESS;
  155. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  156. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  157. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeOriginalGraph failed.");
  158. return GE_CLI_GE_NOT_INITIALIZED;
  159. }
  160. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  161. GELOGI("optimize by opskernel in judging insert phase. num of graph_optimizer is %zu.",
  162. graph_optimizer.size());
  163. string exclude_core_Type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  164. if (graph_optimizer.size() != 0) {
  165. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  166. if (iter->first == exclude_core_Type) {
  167. GELOGI("[OptimizeOriginalGraphJudgeInsert]: engine type will exclude: %s", exclude_core_Type.c_str());
  168. continue;
  169. }
  170. GELOGI("Begin to refine running format by engine %s", iter->first.c_str());
  171. ret = (iter->second)->OptimizeOriginalGraphJudgeInsert(*compute_graph);
  172. if (ret != SUCCESS) {
  173. GELOGE(ret, "[OptimizeOriginalGraphJudgeInsert]: graph optimize failed, ret:%d", ret);
  174. return ret;
  175. }
  176. }
  177. }
  178. return ret;
  179. }
  180. Status GraphOptimize::OptimizeOriginalGraphForQuantize(ComputeGraphPtr &compute_graph) {
  181. if (compute_graph == nullptr) {
  182. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeOriginalGraph]: compute_graph is nullptr.");
  183. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  184. }
  185. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  186. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  187. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeOriginalGraph failed.");
  188. return GE_CLI_GE_NOT_INITIALIZED;
  189. }
  190. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  191. GELOGI("optimize by opskernel in original graph optimize quantize phase. num of graph_optimizer is %zu.",
  192. graph_optimizer.size());
  193. Status ret = SUCCESS;
  194. string exclude_core_Type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  195. GELOGD("[OptimizeOriginalGraphForQuantize]: engine type will exclude: %s", exclude_core_Type.c_str());
  196. if (graph_optimizer.size() != 0) {
  197. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  198. if (iter->first == exclude_core_Type || iter->second == nullptr) {
  199. continue;
  200. }
  201. ret = iter->second->OptimizeGraphPrepare(*compute_graph);
  202. if (ret != SUCCESS) {
  203. GELOGE(ret, "[OptimizeOriginalGraphForQuantize]: graph optimize failed, ret:%u", ret);
  204. return ret;
  205. }
  206. }
  207. }
  208. return ret;
  209. }
  210. Status GraphOptimize::OptimizeGraphBeforeBuildForRts(ComputeGraphPtr &compute_graph) {
  211. if (compute_graph == nullptr) {
  212. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeGraphBeforeBuildForRts]: compute_graph is nullptr.");
  213. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  214. }
  215. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  216. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  217. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeGraphBeforeBuildForRts failed.");
  218. return GE_CLI_GE_NOT_INITIALIZED;
  219. }
  220. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  221. GELOGD("optimize by opskernel in graph optimize before build phase. num of graph_optimizer is %zu.",
  222. graph_optimizer.size());
  223. Status ret = SUCCESS;
  224. string exclude_core_Type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  225. GELOGD("[OptimizeGraphBeforeBuildForRts]: engine type will exclude: %s, core_type_: %s",
  226. exclude_core_Type.c_str(), core_type_.c_str());
  227. if (graph_optimizer.size() != 0) {
  228. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  229. if (iter->first == exclude_core_Type || iter->second == nullptr) {
  230. continue;
  231. }
  232. ret = iter->second->OptimizeGraphBeforeBuild(*compute_graph);
  233. if (ret != SUCCESS) {
  234. GELOGE(ret, "[OptimizeGraphBeforeBuildForRts]: graph optimize failed, ret:%u", ret);
  235. return ret;
  236. }
  237. }
  238. }
  239. return ret;
  240. }
  241. Status GraphOptimize::OptimizeAfterStage1(ComputeGraphPtr &compute_graph) {
  242. GE_CHECK_NOTNULL(compute_graph);
  243. GELOGD("OptimizeAfterStage1 in");
  244. if (GetContext().GetHostExecFlag()) {
  245. // graph exec on host, no need OptimizeAfterStage1
  246. return SUCCESS;
  247. }
  248. Status ret = SUCCESS;
  249. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  250. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  251. REPORT_INNER_ERROR("E19999", "Gelib not init before, check invalid");
  252. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeAfterStage1 failed.");
  253. return GE_CLI_GE_NOT_INITIALIZED;
  254. }
  255. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  256. GELOGI("Optimize by ops kernel in after stage1 phase, num of graph_optimizer is %zu.", graph_optimizer.size());
  257. string exclude_core_type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  258. if (graph_optimizer.size() != 0) {
  259. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  260. if (iter->first == exclude_core_type) {
  261. GELOGI("[OptimizeAfterStage1]: engine type will exclude:%s.", exclude_core_type.c_str());
  262. continue;
  263. }
  264. GELOGI("Begin to optimize graph after stage1 by engine %s.", iter->first.c_str());
  265. ret = (iter->second)->OptimizeAfterStage1(*compute_graph);
  266. if (ret != SUCCESS) {
  267. REPORT_INNER_ERROR("E19999", "Call OptimizeAfterStage1 failed, ret:%d, engine_name:%s, "
  268. "graph_name:%s.", ret, iter->first.c_str(), compute_graph->GetName().c_str());
  269. GELOGE(ret, "[OptimizeAfterStage1]: graph optimize failed, ret:%d.", ret);
  270. return ret;
  271. }
  272. }
  273. }
  274. return ret;
  275. }
  276. Status GraphOptimize::SetOptions(const ge::GraphManagerOptions &options) {
  277. if (options.framework_type >= static_cast<int32_t>(domi::FrameworkType::FRAMEWORK_RESERVED)) {
  278. GELOGE(GE_GRAPH_OPTIONS_INVALID, "Optimize Type %d invalid.", options.framework_type);
  279. return GE_GRAPH_OPTIONS_INVALID;
  280. }
  281. optimize_type_ = static_cast<domi::FrameworkType>(options.framework_type);
  282. cal_config_ = options.calibration_conf_file;
  283. insert_op_config_ = options.insert_op_file;
  284. train_graph_flag_ = options.train_graph_flag;
  285. local_fmk_op_flag_ = options.local_fmk_op_flag;
  286. func_bin_path_ = options.func_bin_path;
  287. core_type_ = options.core_type;
  288. build_mode_ = options.build_mode;
  289. build_step_ = options.build_step;
  290. return SUCCESS;
  291. }
  292. void GraphOptimize::TranFrameOp(ComputeGraphPtr &compute_graph) {
  293. GE_CHECK_NOTNULL_JUST_RETURN(compute_graph);
  294. vector<string> local_framework_op_vec = {
  295. "TensorDataset", "QueueDataset", "DeviceQueueDataset", "ParallelMapDataset", "BatchDatasetV2",
  296. "IteratorV2", "MakeIterator", "IteratorGetNext", "FilterDataset", "MapAndBatchDatasetV2"};
  297. for (auto &nodePtr : compute_graph->GetAllNodes()) {
  298. OpDescPtr op = nodePtr->GetOpDesc();
  299. GE_IF_BOOL_EXEC(op == nullptr, GELOGW("op is nullptr!"); continue);
  300. // fwkop black-white sheet
  301. vector<string>::iterator iter =
  302. std::find(local_framework_op_vec.begin(), local_framework_op_vec.end(), op->GetType());
  303. if (iter != local_framework_op_vec.end()) {
  304. // set - original_type
  305. if (!AttrUtils::SetStr(op, ATTR_NAME_FRAMEWORK_ORIGINAL_TYPE, op->GetType())) {
  306. GELOGW("TranFrameOp SetStr ATTR_NAME_FRAMEWORK_ORIGINAL_TYPE failed");
  307. }
  308. // set - framework_type
  309. // [No need to verify return value]
  310. op->SetType("FrameworkOp");
  311. if (!AttrUtils::SetInt(op, ATTR_NAME_FRAMEWORK_FWK_TYPE, domi::FrameworkType::TENSORFLOW)) {
  312. GELOGW("TranFrameOp SetInt ATTR_NAME_FRAMEWORK_FWK_TYPE failed");
  313. }
  314. }
  315. }
  316. }
  317. Status GraphOptimize::IdentifyReference(ComputeGraphPtr &compute_graph) {
  318. for (auto &node : compute_graph->GetAllNodes()) {
  319. GE_CHECK_NOTNULL(node);
  320. auto op_desc = node->GetOpDesc();
  321. GE_CHECK_NOTNULL(op_desc);
  322. auto input_name_index = op_desc->GetAllInputName();
  323. bool is_ref = false;
  324. for (const auto &name_index : input_name_index) {
  325. const int out_index = op_desc->GetOutputIndexByName(name_index.first);
  326. if (out_index != -1) {
  327. auto input_desc = op_desc->GetInputDesc(name_index.second);
  328. input_desc.SetRefPortByIndex({name_index.second});
  329. op_desc->UpdateInputDesc(name_index.second, input_desc);
  330. GELOGI("SetRefPort: set op[%s] input desc[%u-%s] ref.",
  331. op_desc->GetName().c_str(), name_index.second, name_index.first.c_str());
  332. auto output_desc = op_desc->GetOutputDesc(static_cast<uint32_t>(out_index));
  333. output_desc.SetRefPortByIndex({name_index.second});
  334. op_desc->UpdateOutputDesc(static_cast<uint32_t>(out_index), output_desc);
  335. GELOGI("SetRefPort: set op[%s] output desc[%u-%s] ref.",
  336. op_desc->GetName().c_str(), out_index, name_index.first.c_str());
  337. is_ref = true;
  338. }
  339. }
  340. if (is_ref) {
  341. AttrUtils::SetBool(op_desc, ATTR_NAME_REFERENCE, is_ref);
  342. GELOGI("param [node] %s is reference node, set attribute %s to be true.",
  343. node->GetName().c_str(), ATTR_NAME_REFERENCE.c_str());
  344. }
  345. }
  346. return SUCCESS;
  347. }
  348. Status GraphOptimize::OptimizeWholeGraph(ComputeGraphPtr &compute_graph) {
  349. if (compute_graph == nullptr) {
  350. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeWholeGraph]: compute_graph is nullptr.");
  351. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  352. }
  353. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  354. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  355. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeWholeGraph failed.");
  356. return GE_CLI_GE_NOT_INITIALIZED;
  357. }
  358. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  359. GELOGI("optimize by opskernel in OptimizeWholeGraph. num of graph_optimizer is %zu.", graph_optimizer.size());
  360. Status ret = SUCCESS;
  361. string exclude_core_type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  362. GELOGD("[OptimizeWholeGraph]: engine type will exclude: %s", exclude_core_type.c_str());
  363. if (!graph_optimizer.empty()) {
  364. for (auto &iter : graph_optimizer) {
  365. if (iter.first == exclude_core_type || iter.second == nullptr) {
  366. continue;
  367. }
  368. GELOGI("Begin to optimize whole graph by engine %s", iter.first.c_str());
  369. ret = iter.second->OptimizeWholeGraph(*compute_graph);
  370. GE_DUMP(compute_graph, "OptimizeWholeGraph" + iter.first);
  371. if (ret != SUCCESS) {
  372. GELOGE(ret, "[OptimizeWholeGraph]: graph optimize failed, ret:%u", ret);
  373. return ret;
  374. }
  375. }
  376. }
  377. return ret;
  378. }
  379. } // namespace ge

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