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

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