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.

data_pass.cc 3.7 kB

4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  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/passes/data_pass.h"
  17. #include <string>
  18. #include "framework/common/debug/ge_log.h"
  19. #include "graph/utils/graph_utils.h"
  20. #include "register/op_registry.h"
  21. namespace ge {
  22. Status DataPass::Run(ComputeGraphPtr compute_graph) {
  23. GE_CHECK_NOTNULL(compute_graph);
  24. if (compute_graph->GetParentNode() == nullptr) { // for subgraph post process.
  25. return SUCCESS;
  26. }
  27. for (const NodePtr &node : compute_graph->GetDirectNode()) {
  28. GE_CHECK_NOTNULL(node->GetOpDesc());
  29. if (node->GetType() == DATA) {
  30. uint32_t parent_index = 0;
  31. if (!AttrUtils::GetInt(node->GetOpDesc(), ATTR_NAME_PARENT_NODE_INDEX, parent_index)) {
  32. break; // parent_index not set, Graph from IR.
  33. }
  34. return SUCCESS; // Graph from Parser.
  35. }
  36. }
  37. std::string subgraph_name;
  38. const auto &parent_node = compute_graph->GetParentNode();
  39. GE_CHECK_NOTNULL(parent_node->GetOpDesc());
  40. auto func_desc = parent_node->GetOpDesc();
  41. GE_CHK_STATUS_RET(func_desc->GetSubgraphNameByInstanceName(compute_graph->GetName(), subgraph_name),
  42. "Subgraph: %s get subgraph name failed.", compute_graph->GetName().c_str());
  43. GELOGI("Post process for subgraph %s, Subgraph name: %s, Parent name: %s, Parent type: %s.",
  44. compute_graph->GetName().c_str(), subgraph_name.c_str(), parent_node->GetName().c_str(),
  45. parent_node->GetType().c_str());
  46. const auto &parent_graph = compute_graph->GetParentGraph();
  47. GE_CHECK_NOTNULL(parent_graph);
  48. for (const NodePtr &node : compute_graph->GetDirectNode()) {
  49. GE_CHECK_NOTNULL(node->GetOpDesc());
  50. if ((node->GetType() == VARIABLE) || (node->GetType() == VARIABLEV2) || (node->GetType() == NETOUTPUT)) {
  51. continue;
  52. }
  53. node->GetOpDesc()->SetName(parent_node->GetName() + "_" + compute_graph->GetName() + "/" + node->GetName());
  54. }
  55. domi::ParseSubgraphFuncV1 parse_subgraph = nullptr;
  56. auto post_func = domi::OpRegistry::Instance()->GetParseSubgraphPostFunc(parent_node->GetType());
  57. if (post_func == nullptr) {
  58. GELOGW("The subgraph post func for node %s type %s is null.",
  59. parent_node->GetName().c_str(), parent_node->GetType().c_str());
  60. if (domi::OpRegistry::Instance()->GetParseSubgraphPostFunc(parent_node->GetType(), parse_subgraph) != SUCCESS ||
  61. parse_subgraph == nullptr) {
  62. GELOGW("The subgraph new post func for node[%s] type [%s] is null",
  63. parent_node->GetName().c_str(), parent_node->GetType().c_str());
  64. return SUCCESS;
  65. }
  66. }
  67. auto graph = GraphUtils::CreateGraphFromComputeGraph(compute_graph);
  68. Status ret = FAILED;
  69. if (post_func != nullptr) {
  70. ret = post_func(subgraph_name, graph);
  71. } else if (parse_subgraph != nullptr) {
  72. ret = parse_subgraph(subgraph_name.c_str(), graph);
  73. }
  74. if (ret != SUCCESS) {
  75. GELOGE(FAILED, "Failed to post-process subgraph %s on node %s type %s",
  76. graph.GetName().c_str(), parent_node->GetName().c_str(), parent_node->GetType().c_str());
  77. return FAILED;
  78. }
  79. return SUCCESS;
  80. }
  81. } // namespace ge

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