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_manager_unittest.cc 18 kB

4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482
  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 <gtest/gtest.h>
  17. #include <memory>
  18. #define protected public
  19. #define private public
  20. #include "graph/manager/graph_manager.h"
  21. #include "graph/load/model_manager/model_manager.h"
  22. #include "graph/load/model_manager/davinci_model.h"
  23. #define const
  24. #include "common/helper/model_cache_helper.h"
  25. #undef const
  26. #include "init/gelib.h"
  27. #undef private
  28. #undef public
  29. #include <pthread.h>
  30. #include <algorithm>
  31. #include <future>
  32. #include <set>
  33. #include <sstream>
  34. #include <string>
  35. #include <thread>
  36. #include <future>
  37. #include "common/math/math_util.h"
  38. #include "common/thread_pool.h"
  39. #include "common/dump/dump_manager.h"
  40. #include "analyzer/analyzer.h"
  41. #include "graph/common/ge_call_wrapper.h"
  42. #include "graph/common/local_context.h"
  43. #include "graph/common/transop_util.h"
  44. #include "graph/ge_context.h"
  45. #include "graph/ge_global_options.h"
  46. #include "graph/manager/util/rt_context_util.h"
  47. #include "graph/partition/dynamic_shape_partition.h"
  48. #include "graph/passes/enter_pass.h"
  49. #include "graph/partition/stage_partition.h"
  50. #include "graph/passes/addn_pass.h"
  51. #include "graph/passes/bitcast_pass.h"
  52. #include "graph/passes/assign_remove_pass.h"
  53. #include "graph/passes/inplace_support_check_pass.h"
  54. #include "graph/passes/atomic_addr_clean_pass.h"
  55. #include "graph/passes/attach_stream_label_pass.h"
  56. #include "graph/passes/cast_remove_pass.h"
  57. #include "graph/passes/common_subexpression_elimination_pass.h"
  58. #include "graph/passes/compile_nodes_pass.h"
  59. #include "graph/passes/cond_remove_pass.h"
  60. #include "graph/passes/constant_folding_pass.h"
  61. #include "graph/passes/constant_fuse_same_pass.h"
  62. #include "graph/passes/control_trigger_pass.h"
  63. #include "graph/passes/ctrl_edge_transfer_pass.h"
  64. #include "graph/passes/dimension_adjust_pass.h"
  65. #include "graph/passes/dimension_compute_pass.h"
  66. #include "graph/passes/flow_ctrl_pass.h"
  67. #include "graph/passes/fuse_data_nodes_with_common_input_pass.h"
  68. #include "graph/passes/identity_pass.h"
  69. #include "graph/passes/input_output_connection_identify_pass.h"
  70. #include "graph/passes/iterator_op_pass.h"
  71. #include "graph/passes/link_gen_mask_nodes_pass.h"
  72. #include "graph/passes/mark_graph_unknown_status_pass.h"
  73. #include "graph/passes/merge_pass.h"
  74. #include "graph/passes/merge_input_memcpy_pass.h"
  75. #include "graph/passes/merge_to_stream_merge_pass.h"
  76. #include "graph/passes/multi_batch_pass.h"
  77. #include "graph/passes/next_iteration_pass.h"
  78. #include "graph/passes/permute_pass.h"
  79. #include "graph/passes/prune_pass.h"
  80. #include "graph/passes/ref_identity_delete_op_pass.h"
  81. #include "graph/passes/remove_same_const_pass.h"
  82. #include "graph/passes/reshape_recovery_pass.h"
  83. #include "graph/passes/reshape_remove_pass.h"
  84. #include "graph/passes/same_transdata_breadth_fusion_pass.h"
  85. #include "graph/passes/subgraph_pass.h"
  86. #include "graph/passes/switch_data_edges_bypass.h"
  87. #include "graph/passes/switch_dead_branch_elimination.h"
  88. #include "graph/passes/switch_logic_remove_pass.h"
  89. #include "graph/passes/switch_to_stream_switch_pass.h"
  90. #include "graph/passes/transop_breadth_fusion_pass.h"
  91. #include "graph/passes/transop_nearby_allreduce_fusion_pass.h"
  92. #include "graph/passes/transop_symmetry_elimination_pass.h"
  93. #include "graph/passes/transop_without_reshape_fusion_pass.h"
  94. #include "graph/passes/transpose_transdata_pass.h"
  95. #include "graph/passes/useless_control_out_remove_pass.h"
  96. #include "graph/passes/variable_op_pass.h"
  97. #include "graph/passes/variable_ref_delete_op_pass.h"
  98. #include "graph/passes/variable_ref_useless_control_out_delete_pass.h"
  99. #include "graph/passes/end_of_sequence_add_control_pass.h"
  100. #include "graph/passes/subexpression_migration_pass.h"
  101. #include "graph/passes/subgraph_const_migration_pass.h"
  102. #include "graph/passes/unused_args_clean_pass.h"
  103. #include "graph/passes/global_step_insert_pass.h"
  104. #include "graph/passes/memcpy_addr_async_pass.h"
  105. #include "graph/passes/hccl_continuous_memcpy_pass.h"
  106. #include "graph/build/label_allocator.h"
  107. #include "graph/utils/tensor_adapter.h"
  108. #include "inc/pass_manager.h"
  109. #include "ir_build/option_utils.h"
  110. #include "graph/common/local_context.h"
  111. #include "graph/common/omg_util.h"
  112. #include "common/formats/utils/formats_trans_utils.h"
  113. #include "register/custom_pass_helper.h"
  114. #include "graph/ops_stub.h"
  115. using namespace std;
  116. using namespace testing;
  117. using namespace ge;
  118. using namespace domi;
  119. namespace {
  120. const uint32_t kNotAdded = 0;
  121. const uint32_t kStartAdd = 1;
  122. const uint32_t kDoneAdded = 2;
  123. }
  124. class UtestGraphManagerTest : public testing::Test {
  125. protected:
  126. void SetUp() {}
  127. void TearDown() {}
  128. };
  129. void CreateGraph(Graph &graph) {
  130. TensorDesc desc(ge::Shape({1, 3, 224, 224}));
  131. uint32_t size = desc.GetShape().GetShapeSize();
  132. desc.SetSize(size);
  133. auto data = op::Data("Data").set_attr_index(0);
  134. data.update_input_desc_data(desc);
  135. data.update_output_desc_out(desc);
  136. auto flatten = op::Flatten("Flatten").set_input_x(data, data.name_out_out());
  137. std::vector<Operator> inputs{data};
  138. std::vector<Operator> outputs{flatten};
  139. std::vector<Operator> targets{flatten};
  140. // Graph graph("test_graph");
  141. graph.SetInputs(inputs).SetOutputs(outputs).SetTargets(targets);
  142. }
  143. TEST_F(UtestGraphManagerTest, set_and_get_add_graph_flag) {
  144. GraphId graph_id = 1;
  145. GraphManager graph_manager;
  146. graph_manager.SetAddGraphCondition(graph_id, 1);
  147. uint32_t res = graph_manager.GetAddGraphCondition(graph_id);
  148. EXPECT_EQ(res, 1);
  149. }
  150. TEST_F(UtestGraphManagerTest, test_add_graph_1) {
  151. GraphId graph_id = 1;
  152. GraphManager graph_manager;
  153. // create graph
  154. Graph graph("test_graph");
  155. CreateGraph(graph);
  156. std::map<std::string, std::string> options;
  157. OmgContext context;
  158. Status status = graph_manager.AddGraph(graph_id, graph, options, context);
  159. EXPECT_EQ(status, ge::SUCCESS);
  160. }
  161. TEST_F(UtestGraphManagerTest, test_add_graph_2) {
  162. GraphId graph_id = 1;
  163. GraphManager graph_manager;
  164. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  165. graph_manager.AddGraphNode(graph_id, graph_node);
  166. graph_manager.SetAddGraphCondition(graph_id, kDoneAdded);
  167. Graph graph("test_graph");
  168. CreateGraph(graph);
  169. std::map<std::string, std::string> options;
  170. OmgContext context;
  171. Status status = graph_manager.AddGraph(graph_id, graph, options, context);
  172. EXPECT_EQ(status, ge::SUCCESS);
  173. }
  174. TEST_F(UtestGraphManagerTest, test_add_graph_3) {
  175. GraphId graph_id = 1;
  176. GraphManager graph_manager;
  177. Graph graph("test_graph");
  178. CreateGraph(graph);
  179. std::map<std::string, std::string> options;
  180. OmgContext context;
  181. std::future<Status> fut1 = std::async(std::launch::async,
  182. &GraphManager::AddGraph, &graph_manager, graph_id, graph, options, context);
  183. std::future<Status> fut2 = std::async(std::launch::async,
  184. &GraphManager::AddGraph, &graph_manager, graph_id, graph, options, context);
  185. fut1.wait();
  186. fut2.wait();
  187. Status status1 = fut1.get();
  188. Status status2 = fut2.get();
  189. EXPECT_EQ(status1, ge::SUCCESS);
  190. EXPECT_EQ(status2, ge::SUCCESS);
  191. }
  192. TEST_F(UtestGraphManagerTest, test_add_graph_4) {
  193. GraphId graph_id = 1;
  194. GraphManager graph_manager;
  195. // create graph
  196. Graph graph("test_graph");
  197. CreateGraph(graph);
  198. auto compute_graph = GraphUtils::GetComputeGraph(graph);
  199. (void)AttrUtils::SetBool(*compute_graph, ATTR_NAME_GRAPH_HAS_BEEN_ADDED, true);
  200. std::map<std::string, std::string> options;
  201. OmgContext context;
  202. Status status = graph_manager.AddGraph(graph_id, graph, options, context);
  203. EXPECT_NE(status, ge::SUCCESS);
  204. }
  205. TEST_F(UtestGraphManagerTest, test_add_graph_5) {
  206. Graph graph("test_graph");
  207. auto data = op::Data("Data").set_attr_index(1);
  208. auto flatten = op::Flatten("Flatten").set_input_x(data, data.name_out_out());
  209. std::vector<Operator> inputs{data};
  210. std::vector<Operator> outputs{flatten};
  211. graph.SetInputs(inputs).SetOutputs(outputs);
  212. std::map<std::string, std::string> options = {{"ge.exec.dataInputsShapeRange", "0:[-1]"}};
  213. OmgContext context;
  214. GraphId graph_id = 1;
  215. GraphManager graph_manager;
  216. EXPECT_EQ(graph_manager.AddGraph(graph_id, graph, options, context), GRAPH_PARAM_INVALID);
  217. }
  218. TEST_F(UtestGraphManagerTest, test_add_graph_with_copy_1) {
  219. GraphId graph_id = 1;
  220. GraphManager graph_manager;
  221. // create graph
  222. Graph graph("test_graph");
  223. CreateGraph(graph);
  224. GraphNodePtr graph_node = MakeShared<GraphNode>(graph_id);
  225. graph_manager.graph_map_.insert({1, graph_node});
  226. std::map<std::string, std::string> options;
  227. OmgContext context;
  228. Status status = graph_manager.AddGraphWithCopy(graph_id, graph, options, context);
  229. EXPECT_NE(status, ge::SUCCESS);
  230. }
  231. TEST_F(UtestGraphManagerTest, test_remove_graph_1) {
  232. GraphId graph_id = 1;
  233. GraphManager graph_manager;
  234. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  235. Status status = graph_manager.RemoveGraph(graph_id);
  236. EXPECT_EQ(status, ge::GE_GRAPH_GRAPH_NOT_EXIST);
  237. graph_manager.AddGraphNode(graph_id, graph_node);
  238. graph_node->SetRunFlag(true);
  239. status = graph_manager.RemoveGraph(graph_id);
  240. EXPECT_EQ(status, ge::SUCCESS);
  241. }
  242. TEST_F(UtestGraphManagerTest, test_remove_graph_2) {
  243. GraphId graph_id = 1;
  244. GraphManager graph_manager;
  245. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  246. Graph graph("test_graph");
  247. CreateGraph(graph);
  248. auto compute_graph = GraphUtils::GetComputeGraph(graph);
  249. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  250. auto model_manager = ModelManager::GetInstance();
  251. auto listener = MakeShared<RunAsyncListener>();
  252. shared_ptr<DavinciModel> davinci_model1 = MakeShared<DavinciModel>(1, listener);
  253. davinci_model1->SetId(1);
  254. shared_ptr<DavinciModel> davinci_model2 = MakeShared<DavinciModel>(2, listener);
  255. davinci_model1->SetId(2);
  256. model_manager->InsertModel(1, davinci_model1);
  257. model_manager->InsertModel(2, davinci_model2);
  258. ge_root_model->SetModelId(1);
  259. ge_root_model->SetModelId(2);
  260. graph_node->SetGeRootModel(ge_root_model);
  261. graph_node->SetLoadFlag(true);
  262. graph_manager.AddGraphNode(graph_id, graph_node);
  263. Status status = graph_manager.RemoveGraph(graph_id);
  264. EXPECT_EQ(status, ge::SUCCESS);
  265. }
  266. TEST_F(UtestGraphManagerTest, test_pre_run_thread) {
  267. GraphManager graph_manager;
  268. graph_manager.thread_run_flag_ = true;
  269. GraphId graph_id = 1;
  270. std::vector<ge::Tensor> input_tensor;
  271. uint64_t session_id = 0;
  272. error_message::Context error_context;
  273. GEThreadLocalContext context;
  274. RunAsyncCallback callback;
  275. // PreRunArgs args{graph_id, input_tensor, session_id, error_context, context, callback};
  276. bool ret = graph_manager.prerun_args_q_.Push({graph_id, input_tensor, session_id, error_context, context, callback});
  277. EXPECT_EQ(ret, true);
  278. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  279. graph_manager.AddGraphNode(graph_id, graph_node);
  280. graph_manager.PreRunThread(&graph_manager);
  281. // end with failed
  282. }
  283. TEST_F(UtestGraphManagerTest, test_pre_run_thread_2) {
  284. GraphManager graph_manager;
  285. graph_manager.thread_run_flag_ = true;
  286. GraphId graph_id = 1;
  287. GraphNodePtr graph_node_1 = MakeShared<ge::GraphNode>(graph_id);
  288. graph_manager.AddGraphNode(graph_id, graph_node_1);
  289. graph_manager.IncreaseGraphCount(graph_id);
  290. graph_manager.IncreaseGraphCount(graph_id);
  291. graph_node_1->SetBuildFlag(true);
  292. std::vector<ge::Tensor> input_tensor;
  293. uint64_t session_id = 0;
  294. error_message::Context error_context;
  295. GEThreadLocalContext context;
  296. RunAsyncCallback callback;
  297. // PreRunArgs args{graph_id, input_tensor, session_id, error_context, context, callback};
  298. bool ret = graph_manager.prerun_args_q_.Push({graph_id, input_tensor, session_id, error_context, context, callback});
  299. EXPECT_EQ(ret, true);
  300. graph_id = 2;
  301. GraphNodePtr graph_node_2 = MakeShared<ge::GraphNode>(graph_id);
  302. graph_manager.AddGraphNode(graph_id, graph_node_2);
  303. ret = graph_manager.prerun_args_q_.Push({graph_id, input_tensor, session_id, error_context, context, callback});
  304. EXPECT_EQ(ret, true);
  305. graph_manager.PreRunThread(&graph_manager);
  306. // end with failed
  307. }
  308. TEST_F(UtestGraphManagerTest, test_check_and_release_memory) {
  309. GraphManager graph_manager;
  310. GeModelPtr ge_model = make_shared<GeModel>();
  311. int64_t memory_size = 25 * 1024UL * 1024UL * 1024UL;
  312. int64_t weight_size = 25 * 1024UL * 1024UL * 1024UL;
  313. uint64_t session_id = 0;
  314. ge::AttrUtils::SetInt(ge_model, ATTR_MODEL_MEMORY_SIZE, memory_size);
  315. ge::AttrUtils::SetInt(ge_model, ATTR_MODEL_WEIGHT_SIZE, weight_size);
  316. ge::AttrUtils::SetInt(ge_model, MODEL_ATTR_SESSION_ID, session_id);
  317. GraphId graph_id = 1;
  318. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  319. graph_manager.AddGraphNode(graph_id, graph_node);
  320. graph_manager.IncreaseGraphCount(graph_id);
  321. graph_manager.IncreaseGraphCount(graph_id);
  322. auto model_manager = ModelManager::GetInstance();
  323. auto listener = MakeShared<RunAsyncListener>();
  324. shared_ptr<DavinciModel> davinci_model1 = MakeShared<DavinciModel>(1, listener);
  325. davinci_model1->SetId(1);
  326. shared_ptr<DavinciModel> davinci_model2 = MakeShared<DavinciModel>(2, listener);
  327. davinci_model1->SetId(2);
  328. model_manager->InsertModel(1, davinci_model1);
  329. model_manager->InsertModel(2, davinci_model2);
  330. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  331. bool is_dynamic_shape = false;
  332. (void)AttrUtils::GetBool(compute_graph, ATTR_NAME_DYNAMIC_SHAPE_PARTITIONED, is_dynamic_shape);
  333. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  334. ge_root_model->SetModelId(1);
  335. ge_root_model->SetModelId(2);
  336. graph_node->SetGeRootModel(ge_root_model);
  337. graph_node->SetLoadFlag(true);
  338. Status status = graph_manager.CheckAndReleaseMemory(ge_model, graph_node);
  339. EXPECT_EQ(status, ge::SUCCESS);
  340. }
  341. TEST_F(UtestGraphManagerTest, test_check_incre_build_and_pre_run_1) {
  342. // no need to build
  343. GraphId graph_id = 1;
  344. GraphManager graph_manager;
  345. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  346. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  347. GraphManager::PreRunArgs arg;
  348. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  349. graph_node->SetBuildFlag(true);
  350. Status status = graph_manager.CheckIncreBuildAndPreRun(&graph_manager, arg, graph_node, ge_root_model);
  351. EXPECT_EQ(status, ge::SUCCESS);
  352. }
  353. TEST_F(UtestGraphManagerTest, test_check_incre_build_and_pre_run_2) {
  354. // need build while buildflag is true, var format changed
  355. GraphId graph_id = 1;
  356. GraphManager graph_manager;
  357. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  358. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  359. GraphManager::PreRunArgs arg;
  360. arg.callback = [](Status, std::vector<ge::Tensor> &) {};
  361. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  362. graph_node->SetBuildFlag(true);
  363. graph_node->Lock();
  364. graph_manager.var_acc_ctrl_.graph_ids_need_rebuild_.insert(graph_id);
  365. Status status = graph_manager.CheckIncreBuildAndPreRun(&graph_manager, arg, graph_node, ge_root_model);
  366. EXPECT_EQ(status, ge::PARAM_INVALID);
  367. }
  368. TEST_F(UtestGraphManagerTest, test_check_incre_build_and_pre_run_3) {
  369. // need build while buildflag is false, var format unchanged
  370. GraphId graph_id = 1;
  371. GraphManager graph_manager;
  372. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  373. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  374. GraphManager::PreRunArgs arg;
  375. arg.callback = [](Status, std::vector<ge::Tensor> &) {};
  376. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  377. graph_node->SetBuildFlag(false);
  378. graph_node->Lock();
  379. Status status = graph_manager.CheckIncreBuildAndPreRun(&graph_manager, arg, graph_node, ge_root_model);
  380. EXPECT_NE(status, ge::SUCCESS);
  381. }
  382. TEST_F(UtestGraphManagerTest, test_add_graph_with_copy_success) {
  383. GraphId graph_id = 1;
  384. GraphManager graph_manager;
  385. // create graph
  386. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  387. Graph graph = GraphUtils::CreateGraphFromComputeGraph(compute_graph);
  388. std::map<std::string, std::string> options;
  389. OmgContext context;
  390. Status status = graph_manager.AddGraphWithCopy(graph_id, graph, options, context);
  391. EXPECT_EQ(status, ge::SUCCESS);
  392. }
  393. TEST_F(UtestGraphManagerTest, test_add_graph_with_copy_fail) {
  394. GraphId graph_id = 1;
  395. GraphManager graph_manager;
  396. // create graph
  397. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  398. Graph graph = GraphUtils::CreateGraphFromComputeGraph(compute_graph);
  399. std::map<std::string, std::string> options;
  400. OmgContext context;
  401. Status status = graph_manager.AddGraph(graph_id, graph, options, context);
  402. EXPECT_EQ(status, ge::SUCCESS);
  403. status = graph_manager.RemoveGraph(graph_id);
  404. EXPECT_EQ(status, ge::SUCCESS);
  405. status = graph_manager.AddGraphWithCopy(graph_id, graph, options, context);
  406. EXPECT_NE(status, ge::SUCCESS);
  407. }
  408. TEST_F(UtestGraphManagerTest, ParseInputsDimsForData_success) {
  409. GraphManager graph_manager;
  410. std::vector<ge::Tensor> input_tensors;
  411. ge::Tensor tensor;
  412. input_tensors.emplace_back(tensor);
  413. graph_manager.ParseInputsDimsForData(input_tensors);
  414. }
  415. // TEST_F(UtestGraphManagerTest, ParseInputsDimsForGetNexNosinkAndData_success) {
  416. // GraphManager graph_manager;
  417. // ge::ComputeGraphPtr graph = std::make_shared<ge::ComputeGraph>("default");
  418. // // save1
  419. // ge::OpDescPtr save_op = std::make_shared<ge::OpDesc>();
  420. // save_op->SetType("Save");
  421. // save_op->SetName("Save1");
  422. // save_op->AddInputDesc(ge::GeTensorDesc());
  423. // save_op->AddOutputDesc(ge::GeTensorDesc());
  424. // AttrUtils::SetInt(save_op, ATTR_NAME_INDEX, 1);
  425. // ge::NodePtr save_node = graph->AddNode(save_op);
  426. // std::vector<NodePtr> nodes;
  427. // nodes.emplace_back(save_node);
  428. // ge::Tensor tensor;
  429. // std::vector<Tensor> input_tensors;
  430. // input_tensors.emplace_back(tensor);
  431. // auto ret = graph_manager.ParseInputsDimsForGetNexNosinkAndData(nodes, input_tensors);
  432. // EXPECT_EQ(ret, ge::SUCCESS);
  433. // }

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