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_optimize.cc 15 kB

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
4 years ago
4 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340
  1. /**
  2. * Copyright 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 "graph/optimize/graph_optimize.h"
  17. #include "graph/ge_context.h"
  18. #include "graph/common/local_context.h"
  19. #include "graph/passes/dimension_adjust_pass.h"
  20. #include "inc/pass_manager.h"
  21. #include "init/gelib.h"
  22. namespace {
  23. const char *const kVectorCore = "VectorCore";
  24. const char *const kVectorEngine = "VectorEngine";
  25. const char *const kAicoreEngine = "AIcoreEngine";
  26. } // namespace
  27. namespace ge {
  28. GraphOptimize::GraphOptimize()
  29. : optimize_type_(domi::FrameworkType::TENSORFLOW),
  30. cal_config_(""),
  31. insert_op_config_(""),
  32. core_type_("") {}
  33. void AddNodeInputProperty(ComputeGraphPtr &compute_graph) {
  34. if (compute_graph == nullptr) {
  35. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[AddNodeInputProperty]: compute_graph is nullptr.");
  36. return;
  37. }
  38. for (ge::NodePtr &node : compute_graph->GetDirectNode()) {
  39. auto node_op_desc = node->GetOpDesc();
  40. GE_IF_BOOL_EXEC(node_op_desc == nullptr, GELOGW("node_op_desc is nullptr!"); return );
  41. auto in_control_anchor = node->GetInControlAnchor();
  42. vector<string> src_name_list;
  43. vector<string> input_name_list;
  44. vector<int64_t> src_index_list;
  45. GE_IF_BOOL_EXEC(
  46. in_control_anchor != nullptr, string src_name_temp; for (auto &out_control_anchor
  47. : in_control_anchor->GetPeerOutControlAnchors()) {
  48. ge::NodePtr src_node = out_control_anchor->GetOwnerNode();
  49. GE_IF_BOOL_EXEC(src_node == nullptr, GELOGW("src_node is nullptr!"); continue);
  50. src_name_temp = src_name_temp == "" ? src_node->GetName() : src_name_temp + ":" + src_node->GetName();
  51. } GE_IF_BOOL_EXEC(src_name_temp != "", src_name_list.emplace_back(src_name_temp);
  52. node_op_desc->SetSrcName(src_name_list);))
  53. for (auto &in_data_anchor : node->GetAllInDataAnchors()) {
  54. auto peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  55. GE_IF_BOOL_EXEC(
  56. peer_out_anchor == nullptr, GELOGW("peer_out_anchor is nullptr! node: %s", node->GetName().c_str()); continue);
  57. ge::NodePtr src_node = peer_out_anchor->GetOwnerNode();
  58. src_index_list = node_op_desc->GetSrcIndex();
  59. src_name_list.emplace_back(src_node->GetName());
  60. src_index_list.emplace_back(peer_out_anchor->GetIdx());
  61. node_op_desc->SetSrcName(src_name_list);
  62. node_op_desc->SetSrcIndex(src_index_list);
  63. GE_IF_BOOL_EXEC(!(node_op_desc->GetType() == NETOUTPUT && GetLocalOmgContext().type == domi::TENSORFLOW),
  64. ge::NodePtr peer_owner_node = peer_out_anchor->GetOwnerNode();
  65. input_name_list.emplace_back(
  66. peer_owner_node->GetName() +
  67. (peer_out_anchor->GetIdx() == 0 ? "" : ": " + to_string(peer_out_anchor->GetIdx())));
  68. node_op_desc->SetInputName(input_name_list);)
  69. }
  70. }
  71. }
  72. Status GraphOptimize::OptimizeSubGraph(ComputeGraphPtr &compute_graph, const std::string &engine_name) {
  73. if (compute_graph == nullptr) {
  74. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeSubGraph]: compute_graph is nullptr.");
  75. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  76. }
  77. Status ret = SUCCESS;
  78. vector<GraphOptimizerPtr> graph_optimizer;
  79. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  80. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  81. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "GraphOptimzer: GE is not initialized");
  82. return GE_CLI_GE_NOT_INITIALIZED;
  83. }
  84. if (instance_ptr->DNNEngineManagerObj().IsEngineRegistered(engine_name)) {
  85. instance_ptr->OpsKernelManagerObj().GetGraphOptimizerByEngine(engine_name, graph_optimizer);
  86. AddNodeInputProperty(compute_graph);
  87. if (compute_graph->GetDirectNode().size() == 0) {
  88. GELOGW("[OptimizeSubGraph] compute_graph do not has any node.");
  89. return SUCCESS;
  90. }
  91. if (build_mode_ == BUILD_MODE_TUNING &&
  92. (build_step_ == BUILD_STEP_AFTER_UB_MATCH || build_step_ == BUILD_STEP_AFTER_MERGE)) {
  93. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  94. Status ret = (*iter)->OptimizeFusedGraphAfterGraphSlice(*(compute_graph));
  95. if (ret != SUCCESS) {
  96. GELOGE(ret, "[OptimizeSubGraph][OptimizeFusedGraphAfterGraphSlice]: graph optimize failed, ret:%d", ret);
  97. return ret;
  98. }
  99. }
  100. return SUCCESS;
  101. }
  102. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  103. ret = (*iter)->OptimizeFusedGraph(*(compute_graph));
  104. if (ret != SUCCESS) {
  105. GELOGE(ret, "[OptimizeSubGraph][OptimizeFusedGraph]: graph optimize failed, ret:%d", ret);
  106. return ret;
  107. }
  108. }
  109. } else {
  110. GELOGI("Engine: %s is not registered. do nothing in subGraph Optimize by ATC.", engine_name.c_str());
  111. }
  112. return ret;
  113. }
  114. Status GraphOptimize::OptimizeOriginalGraph(ComputeGraphPtr &compute_graph) {
  115. if (compute_graph == nullptr) {
  116. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeOriginalGraph]: compute_graph is nullptr.");
  117. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  118. }
  119. Status ret = SUCCESS;
  120. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  121. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  122. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeOriginalGraph failed.");
  123. return GE_CLI_GE_NOT_INITIALIZED;
  124. }
  125. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  126. GELOGI("optimize by opskernel in original graph optimize phase. num of graph_optimizer is %lu.",
  127. graph_optimizer.size());
  128. string exclude_core_Type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  129. GELOGD("[OptimizeOriginalGraph]: engine type will exclude: %s", exclude_core_Type.c_str());
  130. if (graph_optimizer.size() != 0) {
  131. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  132. if (iter->first == exclude_core_Type) {
  133. continue;
  134. }
  135. ret = (iter->second)->OptimizeOriginalGraph(*compute_graph);
  136. if (ret != SUCCESS) {
  137. GELOGE(ret, "[OptimizeOriginalGraph]: graph optimize failed, ret:%d", ret);
  138. return ret;
  139. }
  140. }
  141. }
  142. return ret;
  143. }
  144. Status GraphOptimize::OptimizeOriginalGraphJudgeInsert(ComputeGraphPtr &compute_graph) {
  145. GELOGD("OptimizeOriginalGraphJudgeInsert in");
  146. if (GetContext().GetHostExecFlag()) {
  147. // graph exec on host, no need OptimizeOriginalGraph
  148. return SUCCESS;
  149. }
  150. GE_CHECK_NOTNULL(compute_graph);
  151. Status ret = SUCCESS;
  152. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  153. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  154. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeOriginalGraph failed.");
  155. return GE_CLI_GE_NOT_INITIALIZED;
  156. }
  157. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  158. GELOGI("optimize by opskernel in original graph optimize phase. num of graph_optimizer is %lu.",
  159. graph_optimizer.size());
  160. string exclude_core_Type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  161. if (graph_optimizer.size() != 0) {
  162. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  163. if (iter->first == exclude_core_Type) {
  164. GELOGI("[OptimizeOriginalGraphJudgeInsert]: engine type will exclude: %s", exclude_core_Type.c_str());
  165. continue;
  166. }
  167. GELOGI("Begin to refine running format by engine %s", iter->first.c_str());
  168. ret = (iter->second)->OptimizeOriginalGraphJudgeInsert(*compute_graph);
  169. if (ret != SUCCESS) {
  170. GELOGE(ret, "[OptimizeOriginalGraphJudgeInsert]: graph optimize failed, ret:%d", ret);
  171. return ret;
  172. }
  173. }
  174. }
  175. return ret;
  176. }
  177. Status GraphOptimize::OptimizeOriginalGraphForQuantize(ComputeGraphPtr &compute_graph) {
  178. if (compute_graph == nullptr) {
  179. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeOriginalGraph]: compute_graph is nullptr.");
  180. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  181. }
  182. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  183. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  184. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeOriginalGraph failed.");
  185. return GE_CLI_GE_NOT_INITIALIZED;
  186. }
  187. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  188. GELOGI("optimize by opskernel in original graph optimize quantize phase. num of graph_optimizer is %zu.",
  189. graph_optimizer.size());
  190. Status ret = SUCCESS;
  191. string exclude_core_Type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  192. GELOGD("[OptimizeOriginalGraphForQuantize]: engine type will exclude: %s", exclude_core_Type.c_str());
  193. if (graph_optimizer.size() != 0) {
  194. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  195. if (iter->first == exclude_core_Type || iter->second == nullptr) {
  196. continue;
  197. }
  198. ret = iter->second->OptimizeGraphPrepare(*compute_graph);
  199. if (ret != SUCCESS) {
  200. GELOGE(ret, "[OptimizeOriginalGraphForQuantize]: graph optimize failed, ret:%u", ret);
  201. return ret;
  202. }
  203. }
  204. }
  205. return ret;
  206. }
  207. Status GraphOptimize::OptimizeGraphBeforeBuildForRts(ComputeGraphPtr &compute_graph) {
  208. if (compute_graph == nullptr) {
  209. GELOGE(GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL, "[OptimizeGraphBeforeBuildForRts]: compute_graph is nullptr.");
  210. return GE_GRAPH_OPTIMIZE_COMPUTE_GRAPH_NULL;
  211. }
  212. std::shared_ptr<GELib> instance_ptr = ge::GELib::GetInstance();
  213. if (instance_ptr == nullptr || !instance_ptr->InitFlag()) {
  214. GELOGE(GE_CLI_GE_NOT_INITIALIZED, "OptimizeGraphBeforeBuildForRts failed.");
  215. return GE_CLI_GE_NOT_INITIALIZED;
  216. }
  217. auto graph_optimizer = instance_ptr->OpsKernelManagerObj().GetAllGraphOptimizerObjsByPriority();
  218. GELOGI("optimize by opskernel in graph optimize before build phase. num of graph_optimizer is %zu.",
  219. graph_optimizer.size());
  220. Status ret = SUCCESS;
  221. string exclude_core_Type = (core_type_ == kVectorCore) ? kAicoreEngine : kVectorEngine;
  222. GELOGI("[OptimizeGraphBeforeBuildForRts]: engine type will exclude: %s, core_type_: %s",
  223. exclude_core_Type.c_str(), core_type_.c_str());
  224. if (graph_optimizer.size() != 0) {
  225. for (auto iter = graph_optimizer.begin(); iter != graph_optimizer.end(); ++iter) {
  226. if (iter->first == exclude_core_Type || iter->second == nullptr) {
  227. continue;
  228. }
  229. ret = iter->second->OptimizeGraphBeforeBuild(*compute_graph);
  230. if (ret != SUCCESS) {
  231. GELOGE(ret, "[OptimizeGraphBeforeBuildForRts]: graph optimize failed, ret:%u", ret);
  232. return ret;
  233. }
  234. }
  235. }
  236. return ret;
  237. }
  238. Status GraphOptimize::SetOptions(const ge::GraphManagerOptions &options) {
  239. if (options.framework_type >= static_cast<int32_t>(domi::FrameworkType::FRAMEWORK_RESERVED)) {
  240. GELOGE(GE_GRAPH_OPTIONS_INVALID, "Optimize Type %d invalid.", options.framework_type);
  241. return GE_GRAPH_OPTIONS_INVALID;
  242. }
  243. optimize_type_ = static_cast<domi::FrameworkType>(options.framework_type);
  244. cal_config_ = options.calibration_conf_file;
  245. insert_op_config_ = options.insert_op_file;
  246. train_graph_flag_ = options.train_graph_flag;
  247. local_fmk_op_flag_ = options.local_fmk_op_flag;
  248. func_bin_path_ = options.func_bin_path;
  249. core_type_ = options.core_type;
  250. build_mode_ = options.build_mode;
  251. build_step_ = options.build_step;
  252. return SUCCESS;
  253. }
  254. void GraphOptimize::TranFrameOp(ComputeGraphPtr &compute_graph) {
  255. GE_CHECK_NOTNULL_JUST_RETURN(compute_graph);
  256. vector<string> local_framework_op_vec = {
  257. "TensorDataset", "QueueDataset", "DeviceQueueDataset", "ParallelMapDataset", "BatchDatasetV2",
  258. "IteratorV2", "MakeIterator", "IteratorGetNext", "FilterDataset", "MapAndBatchDatasetV2"};
  259. for (auto &nodePtr : compute_graph->GetAllNodes()) {
  260. OpDescPtr op = nodePtr->GetOpDesc();
  261. GE_IF_BOOL_EXEC(op == nullptr, GELOGW("op is nullptr!"); continue);
  262. // fwkop black-white sheet
  263. vector<string>::iterator iter =
  264. std::find(local_framework_op_vec.begin(), local_framework_op_vec.end(), op->GetType());
  265. if (iter != local_framework_op_vec.end()) {
  266. // set - original_type
  267. if (!AttrUtils::SetStr(op, ATTR_NAME_FRAMEWORK_ORIGINAL_TYPE, op->GetType())) {
  268. GELOGW("TranFrameOp SetStr ATTR_NAME_FRAMEWORK_ORIGINAL_TYPE failed");
  269. }
  270. // set - framework_type
  271. // [No need to verify return value]
  272. op->SetType("FrameworkOp");
  273. if (!AttrUtils::SetInt(op, ATTR_NAME_FRAMEWORK_FWK_TYPE, domi::FrameworkType::TENSORFLOW)) {
  274. GELOGW("TranFrameOp SetInt ATTR_NAME_FRAMEWORK_FWK_TYPE failed");
  275. }
  276. }
  277. }
  278. }
  279. Status GraphOptimize::IdentifyReference(ComputeGraphPtr &compute_graph) {
  280. for (auto &node : compute_graph->GetAllNodes()) {
  281. GE_CHECK_NOTNULL(node);
  282. auto op_desc = node->GetOpDesc();
  283. GE_CHECK_NOTNULL(op_desc);
  284. auto input_name_index = op_desc->GetAllInputName();
  285. bool is_ref = false;
  286. for (const auto &name_index : input_name_index) {
  287. const int out_index = op_desc->GetOutputIndexByName(name_index.first);
  288. if (out_index != -1) {
  289. auto input_desc = op_desc->GetInputDesc(name_index.second);
  290. input_desc.SetRefPortByIndex({name_index.second});
  291. op_desc->UpdateInputDesc(name_index.second, input_desc);
  292. GELOGI("SetRefPort: set op[%s] input desc[%u-%s] ref.",
  293. op_desc->GetName().c_str(), name_index.second, name_index.first.c_str());
  294. auto output_desc = op_desc->GetOutputDesc(static_cast<uint32_t>(out_index));
  295. output_desc.SetRefPortByIndex({name_index.second});
  296. op_desc->UpdateOutputDesc(static_cast<uint32_t>(out_index), output_desc);
  297. GELOGI("SetRefPort: set op[%s] output desc[%u-%s] ref.",
  298. op_desc->GetName().c_str(), out_index, name_index.first.c_str());
  299. is_ref = true;
  300. }
  301. }
  302. if (is_ref) {
  303. AttrUtils::SetBool(op_desc, ATTR_NAME_REFERENCE, is_ref);
  304. GELOGI("param [node] %s is reference node, set attribute %s to be true.",
  305. node->GetName().c_str(), ATTR_NAME_REFERENCE.c_str());
  306. }
  307. }
  308. return SUCCESS;
  309. }
  310. } // namespace ge

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