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.

assert_pass.cc 3.5 kB

5 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107
  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/assert_pass.h"
  17. #include <map>
  18. #include <queue>
  19. #include <string>
  20. #include <vector>
  21. #include "framework/common/debug/ge_log.h"
  22. #include "framework/common/ge_inner_error_codes.h"
  23. #include "framework/common/util.h"
  24. namespace ge {
  25. // aicpu not support string type, so current implemention is Upward traversal
  26. Status AssertPass::Run(NodePtr &node) {
  27. GELOGD("AssertPass running");
  28. if (node == nullptr) {
  29. REPORT_INNER_ERROR("E19999", "Param node is nullptr, check invalid");
  30. GELOGE(PARAM_INVALID, "param [node] must not be null.");
  31. return PARAM_INVALID;
  32. }
  33. if (node->GetOpDesc() == nullptr) {
  34. REPORT_INNER_ERROR("E19999", "Param op_desc of node is nullptr, check invalid");
  35. GELOGE(PARAM_INVALID, "[Get][OpDesc] param [node] [opDesc] must not be null.");
  36. return PARAM_INVALID;
  37. }
  38. std::string op_type = node->GetOpDesc()->GetType();
  39. if (op_type == ASSERT) {
  40. GELOGD("op type is assert.");
  41. std::vector<NodePtr> nodes_unused;
  42. // collect assert and other unused ops
  43. CollectUnusedNode(node, nodes_unused);
  44. // remove unused node
  45. Status status = RemoveUnusedNode(nodes_unused);
  46. if (status != SUCCESS) {
  47. GELOGE(status, "[Remove][UnusedNode] failed, ret:%d.", status);
  48. return status;
  49. }
  50. }
  51. return SUCCESS;
  52. }
  53. void AssertPass::CollectUnusedNode(const NodePtr &assert_node, vector<NodePtr> &nodes_unused) {
  54. std::map<Node *, uint32_t> invalid_outdata_info;
  55. std::queue<NodePtr> node_queue;
  56. node_queue.push(assert_node);
  57. while (!node_queue.empty()) {
  58. NodePtr cur_node = node_queue.front();
  59. if (cur_node == nullptr) {
  60. continue;
  61. }
  62. node_queue.pop();
  63. nodes_unused.push_back(cur_node);
  64. for (const auto &src_node : cur_node->GetInDataNodes()) {
  65. if (src_node != nullptr && src_node->GetOpDesc() != nullptr) {
  66. auto size = ++invalid_outdata_info[src_node.get()];
  67. // src_node need to be deleted
  68. if (src_node->GetOutDataNodesSize() == size && src_node->GetOpDesc()->GetType() != DATA &&
  69. src_node->GetOpDesc()->GetType() != AIPPDATA) {
  70. node_queue.push(src_node);
  71. }
  72. }
  73. }
  74. }
  75. }
  76. Status AssertPass::RemoveUnusedNode(std::vector<NodePtr> &nodes_unused) {
  77. for (NodePtr &node : nodes_unused) {
  78. if (node == nullptr) {
  79. continue;
  80. }
  81. std::vector<int> assert_io_map;
  82. size_t out_nums = node->GetAllOutDataAnchorsSize();
  83. while (out_nums > 0) {
  84. assert_io_map.push_back(-1);
  85. out_nums--;
  86. }
  87. if (IsolateAndDeleteNode(node, assert_io_map) != SUCCESS) {
  88. REPORT_CALL_ERROR("E19999", "Isolate and delete node:%s(%s) failed",
  89. node->GetName().c_str(), node->GetType().c_str());
  90. GELOGE(FAILED, "[Call][IsolateAndDeleteNode] for node:%s(%s) failed",
  91. node->GetName().c_str(), node->GetType().c_str());
  92. return FAILED;
  93. }
  94. }
  95. return SUCCESS;
  96. }
  97. } // namespace ge

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