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

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