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

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