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

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