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 22 kB

4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560
  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 "register/custom_pass_helper.h"
  115. #include "graph/ops_stub.h"
  116. #include "ge_attr_value.h"
  117. using namespace std;
  118. using namespace testing;
  119. using namespace ge;
  120. using namespace domi;
  121. namespace {
  122. const uint32_t kNotAdded = 0;
  123. const uint32_t kStartAdd = 1;
  124. const uint32_t kDoneAdded = 2;
  125. }
  126. class UtestGraphManagerTest : public testing::Test {
  127. protected:
  128. void SetUp() {}
  129. void TearDown() {}
  130. };
  131. void CreateGraph(Graph &graph) {
  132. TensorDesc desc(ge::Shape({1, 3, 224, 224}));
  133. uint32_t size = desc.GetShape().GetShapeSize();
  134. desc.SetSize(size);
  135. auto data = op::Data("Data").set_attr_index(0);
  136. data.update_input_desc_data(desc);
  137. data.update_output_desc_out(desc);
  138. auto flatten = op::Flatten("Flatten").set_input_x(data, data.name_out_out());
  139. std::vector<Operator> inputs{data};
  140. std::vector<Operator> outputs{flatten};
  141. std::vector<Operator> targets{flatten};
  142. // Graph graph("test_graph");
  143. graph.SetInputs(inputs).SetOutputs(outputs).SetTargets(targets);
  144. }
  145. TEST_F(UtestGraphManagerTest, set_and_get_add_graph_flag) {
  146. GraphId graph_id = 1;
  147. GraphManager graph_manager;
  148. graph_manager.SetAddGraphCondition(graph_id, 1);
  149. uint32_t res = graph_manager.GetAddGraphCondition(graph_id);
  150. EXPECT_EQ(res, 1);
  151. }
  152. TEST_F(UtestGraphManagerTest, test_add_graph_1) {
  153. GraphId graph_id = 1;
  154. GraphManager graph_manager;
  155. // create graph
  156. Graph graph("test_graph");
  157. CreateGraph(graph);
  158. std::map<std::string, std::string> options;
  159. OmgContext context;
  160. Status status = graph_manager.AddGraph(graph_id, graph, options, context);
  161. EXPECT_EQ(status, ge::SUCCESS);
  162. }
  163. TEST_F(UtestGraphManagerTest, test_add_graph_2) {
  164. GraphId graph_id = 1;
  165. GraphManager graph_manager;
  166. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  167. graph_manager.AddGraphNode(graph_id, graph_node);
  168. graph_manager.SetAddGraphCondition(graph_id, kDoneAdded);
  169. Graph graph("test_graph");
  170. CreateGraph(graph);
  171. std::map<std::string, std::string> options;
  172. OmgContext context;
  173. Status status = graph_manager.AddGraph(graph_id, graph, options, context);
  174. EXPECT_EQ(status, ge::SUCCESS);
  175. }
  176. TEST_F(UtestGraphManagerTest, test_add_graph_3) {
  177. GraphId graph_id = 1;
  178. GraphManager graph_manager;
  179. Graph graph("test_graph");
  180. CreateGraph(graph);
  181. std::map<std::string, std::string> options;
  182. OmgContext context;
  183. std::future<Status> fut1 = std::async(std::launch::async,
  184. &GraphManager::AddGraph, &graph_manager, graph_id, graph, options, context);
  185. std::future<Status> fut2 = std::async(std::launch::async,
  186. &GraphManager::AddGraph, &graph_manager, graph_id, graph, options, context);
  187. fut1.wait();
  188. fut2.wait();
  189. Status status1 = fut1.get();
  190. Status status2 = fut2.get();
  191. EXPECT_EQ(status1, ge::SUCCESS);
  192. EXPECT_EQ(status2, ge::SUCCESS);
  193. }
  194. TEST_F(UtestGraphManagerTest, test_add_graph_4) {
  195. GraphId graph_id = 1;
  196. GraphManager graph_manager;
  197. // create graph
  198. Graph graph("test_graph");
  199. CreateGraph(graph);
  200. auto compute_graph = GraphUtils::GetComputeGraph(graph);
  201. (void)AttrUtils::SetBool(*compute_graph, ATTR_NAME_GRAPH_HAS_BEEN_ADDED, true);
  202. std::map<std::string, std::string> options;
  203. OmgContext context;
  204. Status status = graph_manager.AddGraph(graph_id, graph, options, context);
  205. EXPECT_NE(status, ge::SUCCESS);
  206. }
  207. TEST_F(UtestGraphManagerTest, test_add_graph_5) {
  208. Graph graph("test_graph");
  209. auto data = op::Data("Data").set_attr_index(1);
  210. auto flatten = op::Flatten("Flatten").set_input_x(data, data.name_out_out());
  211. std::vector<Operator> inputs{data};
  212. std::vector<Operator> outputs{flatten};
  213. graph.SetInputs(inputs).SetOutputs(outputs);
  214. std::map<std::string, std::string> options = {{"ge.exec.dataInputsShapeRange", "0:[-1]"}};
  215. OmgContext context;
  216. GraphId graph_id = 1;
  217. GraphManager graph_manager;
  218. EXPECT_EQ(graph_manager.AddGraph(graph_id, graph, options, context), GRAPH_PARAM_INVALID);
  219. }
  220. TEST_F(UtestGraphManagerTest, test_add_graph_with_copy_1) {
  221. GraphId graph_id = 1;
  222. GraphManager graph_manager;
  223. // create graph
  224. Graph graph("test_graph");
  225. CreateGraph(graph);
  226. GraphNodePtr graph_node = MakeShared<GraphNode>(graph_id);
  227. graph_manager.graph_map_.insert({1, graph_node});
  228. std::map<std::string, std::string> options;
  229. OmgContext context;
  230. Status status = graph_manager.AddGraphWithCopy(graph_id, graph, options, context);
  231. EXPECT_NE(status, ge::SUCCESS);
  232. }
  233. TEST_F(UtestGraphManagerTest, test_remove_graph_1) {
  234. GraphId graph_id = 1;
  235. GraphManager graph_manager;
  236. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  237. Status status = graph_manager.RemoveGraph(graph_id);
  238. EXPECT_EQ(status, ge::GE_GRAPH_GRAPH_NOT_EXIST);
  239. graph_manager.AddGraphNode(graph_id, graph_node);
  240. graph_node->SetRunFlag(true);
  241. status = graph_manager.RemoveGraph(graph_id);
  242. EXPECT_EQ(status, ge::SUCCESS);
  243. }
  244. TEST_F(UtestGraphManagerTest, test_remove_graph_2) {
  245. GraphId graph_id = 1;
  246. GraphManager graph_manager;
  247. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  248. Graph graph("test_graph");
  249. CreateGraph(graph);
  250. auto compute_graph = GraphUtils::GetComputeGraph(graph);
  251. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  252. auto model_manager = ModelManager::GetInstance();
  253. auto listener = MakeShared<RunAsyncListener>();
  254. shared_ptr<DavinciModel> davinci_model1 = MakeShared<DavinciModel>(1, listener);
  255. davinci_model1->SetId(1);
  256. shared_ptr<DavinciModel> davinci_model2 = MakeShared<DavinciModel>(2, listener);
  257. davinci_model1->SetId(2);
  258. model_manager->InsertModel(1, davinci_model1);
  259. model_manager->InsertModel(2, davinci_model2);
  260. ge_root_model->SetModelId(1);
  261. ge_root_model->SetModelId(2);
  262. graph_node->SetGeRootModel(ge_root_model);
  263. graph_node->SetLoadFlag(true);
  264. graph_manager.AddGraphNode(graph_id, graph_node);
  265. Status status = graph_manager.RemoveGraph(graph_id);
  266. EXPECT_EQ(status, ge::SUCCESS);
  267. }
  268. TEST_F(UtestGraphManagerTest, test_pre_run_thread) {
  269. GraphManager graph_manager;
  270. graph_manager.thread_run_flag_ = true;
  271. GraphId graph_id = 1;
  272. std::vector<ge::Tensor> input_tensor;
  273. uint64_t session_id = 0;
  274. error_message::Context error_context;
  275. GEThreadLocalContext context;
  276. RunAsyncCallback callback;
  277. // PreRunArgs args{graph_id, input_tensor, session_id, error_context, context, callback};
  278. bool ret = graph_manager.prerun_args_q_.Push({graph_id, input_tensor, session_id, error_context, context, callback});
  279. EXPECT_EQ(ret, true);
  280. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  281. graph_manager.AddGraphNode(graph_id, graph_node);
  282. graph_manager.PreRunThread(&graph_manager);
  283. // end with failed
  284. }
  285. TEST_F(UtestGraphManagerTest, test_pre_run_thread_2) {
  286. GraphManager graph_manager;
  287. graph_manager.thread_run_flag_ = true;
  288. GraphId graph_id = 1;
  289. GraphNodePtr graph_node_1 = MakeShared<ge::GraphNode>(graph_id);
  290. graph_manager.AddGraphNode(graph_id, graph_node_1);
  291. graph_manager.IncreaseGraphCount(graph_id);
  292. graph_manager.IncreaseGraphCount(graph_id);
  293. graph_node_1->SetBuildFlag(true);
  294. std::vector<ge::Tensor> input_tensor;
  295. uint64_t session_id = 0;
  296. error_message::Context error_context;
  297. GEThreadLocalContext context;
  298. RunAsyncCallback callback;
  299. // PreRunArgs args{graph_id, input_tensor, session_id, error_context, context, callback};
  300. bool ret = graph_manager.prerun_args_q_.Push({graph_id, input_tensor, session_id, error_context, context, callback});
  301. EXPECT_EQ(ret, true);
  302. graph_id = 2;
  303. GraphNodePtr graph_node_2 = MakeShared<ge::GraphNode>(graph_id);
  304. graph_manager.AddGraphNode(graph_id, graph_node_2);
  305. ret = graph_manager.prerun_args_q_.Push({graph_id, input_tensor, session_id, error_context, context, callback});
  306. EXPECT_EQ(ret, true);
  307. graph_manager.PreRunThread(&graph_manager);
  308. // end with failed
  309. }
  310. TEST_F(UtestGraphManagerTest, test_check_and_release_memory) {
  311. GraphManager graph_manager;
  312. GeModelPtr ge_model = make_shared<GeModel>();
  313. int64_t memory_size = 25 * 1024UL * 1024UL * 1024UL;
  314. int64_t weight_size = 25 * 1024UL * 1024UL * 1024UL;
  315. uint64_t session_id = 0;
  316. ge::AttrUtils::SetInt(ge_model, ATTR_MODEL_MEMORY_SIZE, memory_size);
  317. ge::AttrUtils::SetInt(ge_model, ATTR_MODEL_WEIGHT_SIZE, weight_size);
  318. ge::AttrUtils::SetInt(ge_model, MODEL_ATTR_SESSION_ID, session_id);
  319. GraphId graph_id = 1;
  320. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  321. graph_manager.AddGraphNode(graph_id, graph_node);
  322. graph_manager.IncreaseGraphCount(graph_id);
  323. graph_manager.IncreaseGraphCount(graph_id);
  324. auto model_manager = ModelManager::GetInstance();
  325. auto listener = MakeShared<RunAsyncListener>();
  326. shared_ptr<DavinciModel> davinci_model1 = MakeShared<DavinciModel>(1, listener);
  327. davinci_model1->SetId(1);
  328. shared_ptr<DavinciModel> davinci_model2 = MakeShared<DavinciModel>(2, listener);
  329. davinci_model1->SetId(2);
  330. model_manager->InsertModel(1, davinci_model1);
  331. model_manager->InsertModel(2, davinci_model2);
  332. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  333. bool is_dynamic_shape = false;
  334. (void)AttrUtils::GetBool(compute_graph, ATTR_NAME_DYNAMIC_SHAPE_PARTITIONED, is_dynamic_shape);
  335. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  336. ge_root_model->SetModelId(1);
  337. ge_root_model->SetModelId(2);
  338. graph_node->SetGeRootModel(ge_root_model);
  339. graph_node->SetLoadFlag(true);
  340. Status status = graph_manager.CheckAndReleaseMemory(ge_model, graph_node);
  341. EXPECT_EQ(status, ge::SUCCESS);
  342. }
  343. TEST_F(UtestGraphManagerTest, test_check_incre_build_and_pre_run_1) {
  344. // no need to build
  345. GraphId graph_id = 1;
  346. GraphManager graph_manager;
  347. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  348. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  349. GraphManager::PreRunArgs arg;
  350. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  351. graph_node->SetBuildFlag(true);
  352. Status status = graph_manager.CheckIncreBuildAndPreRun(&graph_manager, arg, graph_node, ge_root_model);
  353. EXPECT_EQ(status, ge::SUCCESS);
  354. }
  355. TEST_F(UtestGraphManagerTest, test_check_incre_build_and_pre_run_2) {
  356. // need build while buildflag is true, var format changed
  357. GraphId graph_id = 1;
  358. GraphManager graph_manager;
  359. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  360. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  361. GraphManager::PreRunArgs arg;
  362. arg.callback = [](Status, std::vector<ge::Tensor> &) {};
  363. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  364. graph_node->SetBuildFlag(true);
  365. graph_node->Lock();
  366. graph_manager.var_acc_ctrl_.graph_ids_need_rebuild_.insert(graph_id);
  367. Status status = graph_manager.CheckIncreBuildAndPreRun(&graph_manager, arg, graph_node, ge_root_model);
  368. EXPECT_EQ(status, ge::PARAM_INVALID);
  369. }
  370. TEST_F(UtestGraphManagerTest, test_check_incre_build_and_pre_run_3) {
  371. // need build while buildflag is false, var format unchanged
  372. GraphId graph_id = 1;
  373. GraphManager graph_manager;
  374. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  375. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  376. GraphManager::PreRunArgs arg;
  377. arg.callback = [](Status, std::vector<ge::Tensor> &) {};
  378. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  379. graph_node->SetBuildFlag(false);
  380. graph_node->Lock();
  381. Status status = graph_manager.CheckIncreBuildAndPreRun(&graph_manager, arg, graph_node, ge_root_model);
  382. EXPECT_NE(status, ge::SUCCESS);
  383. }
  384. TEST_F(UtestGraphManagerTest, test_add_graph_with_copy_success) {
  385. GraphId graph_id = 1;
  386. GraphManager graph_manager;
  387. // create graph
  388. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  389. Graph graph = GraphUtils::CreateGraphFromComputeGraph(compute_graph);
  390. std::map<std::string, std::string> options;
  391. OmgContext context;
  392. Status status = graph_manager.AddGraphWithCopy(graph_id, graph, options, context);
  393. EXPECT_EQ(status, ge::SUCCESS);
  394. }
  395. TEST_F(UtestGraphManagerTest, test_add_graph_with_copy_fail) {
  396. GraphId graph_id = 1;
  397. GraphManager graph_manager;
  398. // create graph
  399. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  400. Graph graph = GraphUtils::CreateGraphFromComputeGraph(compute_graph);
  401. std::map<std::string, std::string> options;
  402. OmgContext context;
  403. Status status = graph_manager.AddGraph(graph_id, graph, options, context);
  404. EXPECT_EQ(status, ge::SUCCESS);
  405. status = graph_manager.RemoveGraph(graph_id);
  406. EXPECT_EQ(status, ge::SUCCESS);
  407. status = graph_manager.AddGraphWithCopy(graph_id, graph, options, context);
  408. EXPECT_NE(status, ge::SUCCESS);
  409. }
  410. TEST_F(UtestGraphManagerTest, ParseInputsDimsForData_success) {
  411. GraphManager graph_manager;
  412. std::vector<ge::Tensor> input_tensors;
  413. ge::Tensor tensor;
  414. input_tensors.emplace_back(tensor);
  415. graph_manager.ParseInputsDimsForData(input_tensors);
  416. }
  417. TEST_F(UtestGraphManagerTest, test_prerunthread_failed_1) {
  418. GraphId graph_id = 1;
  419. GraphManager graph_manager;
  420. graph_manager.thread_run_flag_ = true;
  421. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  422. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  423. GraphManager::PreRunArgs args;
  424. error_message::Context error_ctx{1, "1st_stage", "2nd_stage", "log_header"};
  425. Status st = 0;
  426. args.callback = [&st](Status st_return, std::vector<ge::Tensor> &) { st = st_return; };
  427. args.graph_id = graph_id;
  428. args.session_id = 1;
  429. args.error_context = error_ctx;
  430. args.context = GetThreadLocalContext();
  431. // create graph
  432. Graph graph = GraphUtils::CreateGraphFromComputeGraph(compute_graph);
  433. std::shared_ptr<Graph> graph_ptr = MakeShared<ge::Graph>(graph);
  434. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  435. graph_node->SetGraph(graph_ptr);
  436. graph_manager.options_.local_fmk_op_flag = false;
  437. // need build while buildflag is true, var format changed
  438. graph_node->SetBuildFlag(true);
  439. graph_manager.var_acc_ctrl_.graph_ids_need_rebuild_.insert(graph_id);
  440. graph_manager.graph_map_.insert({graph_id, graph_node});
  441. graph_manager.graph_count_.insert({graph_id, 1});
  442. graph_node->SetRunFlag(false);
  443. // function return.
  444. graph_manager.prerun_args_q_.Push(args);
  445. auto t1 = std::thread(GraphManager::PreRunThread, &graph_manager);
  446. if (t1.joinable()) {
  447. t1.join();
  448. }
  449. EXPECT_EQ(st, ge::PARAM_INVALID);
  450. }
  451. TEST_F(UtestGraphManagerTest, test_prerunthread_failed_2) {
  452. GraphId graph_id = 1;
  453. GraphManager graph_manager;
  454. graph_manager.thread_run_flag_ = true;
  455. ComputeGraphPtr compute_graph = MakeShared<ComputeGraph>("test_graph");
  456. GeRootModelPtr ge_root_model = MakeShared<GeRootModel>(compute_graph);
  457. GraphManager::PreRunArgs args;
  458. error_message::Context error_ctx{1, "1st_stage", "2nd_stage", "log_header"};
  459. Status st;
  460. args.callback = [&st, &graph_manager](Status st_return, std::vector<ge::Tensor> &) { st = st_return;
  461. graph_manager.thread_run_flag_ = false;};
  462. args.graph_id = graph_id;
  463. args.session_id = 1;
  464. args.error_context = error_ctx;
  465. args.context = GetThreadLocalContext();
  466. // create graph
  467. Graph graph = GraphUtils::CreateGraphFromComputeGraph(compute_graph);
  468. std::shared_ptr<Graph> graph_ptr = MakeShared<ge::Graph>(graph);
  469. GraphNodePtr graph_node = MakeShared<ge::GraphNode>(graph_id);
  470. graph_node->SetGraph(graph_ptr);
  471. graph_manager.options_.local_fmk_op_flag = false;
  472. // need build while buildflag is true, var format changed
  473. graph_node->SetBuildFlag(true);
  474. graph_manager.var_acc_ctrl_.graph_ids_need_rebuild_.insert(graph_id);
  475. graph_manager.graph_map_.insert({graph_id, graph_node});
  476. graph_manager.graph_count_.insert({graph_id, 1});
  477. graph_node->SetRunFlag(false);
  478. // function continue
  479. int ret = setenv("ENABLE_NETWORK_ANALYSIS_DEBUG", "1", 1);
  480. EXPECT_EQ(ret, 0);
  481. graph_manager.prerun_args_q_.Push(args);
  482. auto t1 = std::thread(GraphManager::PreRunThread, &graph_manager);
  483. if (t1.joinable()) {
  484. t1.join();
  485. }
  486. EXPECT_EQ(st, ge::PARAM_INVALID);
  487. }
  488. // TEST_F(UtestGraphManagerTest, ParseInputsDimsForGetNexNosinkAndData_success) {
  489. // GraphManager graph_manager;
  490. // ge::ComputeGraphPtr graph = std::make_shared<ge::ComputeGraph>("default");
  491. // // save1
  492. // ge::OpDescPtr save_op = std::make_shared<ge::OpDesc>();
  493. // save_op->SetType("Save");
  494. // save_op->SetName("Save1");
  495. // save_op->AddInputDesc(ge::GeTensorDesc());
  496. // save_op->AddOutputDesc(ge::GeTensorDesc());
  497. // AttrUtils::SetInt(save_op, ATTR_NAME_INDEX, 1);
  498. // ge::NodePtr save_node = graph->AddNode(save_op);
  499. // std::vector<NodePtr> nodes;
  500. // nodes.emplace_back(save_node);
  501. // ge::Tensor tensor;
  502. // std::vector<Tensor> input_tensors;
  503. // input_tensors.emplace_back(tensor);
  504. // auto ret = graph_manager.ParseInputsDimsForGetNexNosinkAndData(nodes, input_tensors);
  505. // EXPECT_EQ(ret, ge::SUCCESS);
  506. // }

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