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.

cond_remove_pass.h 2.8 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
  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. #ifndef GE_GRAPH_PASSES_COND_REMOVE_PASS_H
  17. #define GE_GRAPH_PASSES_COND_REMOVE_PASS_H
  18. #include "graph/passes/base_pass.h"
  19. namespace ge {
  20. class CondRemovePass : public BaseNodePass {
  21. public:
  22. Status Run(NodePtr &node) override;
  23. private:
  24. ///
  25. /// @brief Get cond info for if/case node
  26. /// @param [in] node: If/Case op
  27. /// @param [out] graph: owner_graph of if node
  28. /// @param [out] cond_out_anchor: peer_cond_anchor
  29. /// @param [out] cond_in_anchor: cond_input of if
  30. /// @return Status
  31. ///
  32. Status GetCondInfoForIfCase(const NodePtr &node, ComputeGraphPtr &graph, OutDataAnchorPtr &cond_out_anchor,
  33. InDataAnchorPtr &cond_in_anchor);
  34. ///
  35. /// @brief Get cond info for if/case node
  36. /// @param [in] node: If/Case op
  37. /// @param [out] graph: owner_graph of if node
  38. /// @param [out] cond_out_anchor: peer_cond_anchor
  39. /// @param [out] cond_in_anchor: cond_input of if
  40. /// @return Status
  41. ///
  42. Status GetCondInfo(const NodePtr &node, ComputeGraphPtr &graph, OutDataAnchorPtr &cond_out_anchor,
  43. InDataAnchorPtr &cond_in_anchor);
  44. ///
  45. /// @brief Check if condition input is const, for if / case / while
  46. ///
  47. bool CheckIfCondConstInput(const OutDataAnchorPtr &cond_out_anchor, const InDataAnchorPtr &cond_in_anchor,
  48. int32_t &cond_index);
  49. ///
  50. /// @brief Remove if dead branch, for if
  51. ///
  52. Status GetIfChosenBranch(const NodePtr &node, const uint32_t cond_index, ComputeGraphPtr &compute_graph);
  53. ///
  54. /// @brief Remove if dead branch, for case
  55. ///
  56. Status GetCaseChosenBranch(const NodePtr &node, const uint32_t cond_index, ComputeGraphPtr &compute_graph);
  57. ///
  58. /// @brief Remove dead condition input, for if / case / while
  59. ///
  60. Status RemoveDeadCondLink(const int32_t index, const NodePtr &node);
  61. ///
  62. /// @brief Remove if dead branch, for if
  63. ///
  64. Status ReplaceIfCaseNodeWithPartitioncall(const NodePtr &node, const ComputeGraphPtr &save_branch);
  65. OpDescPtr CreateSubgraphOpDesc(const std::string &name, size_t input_num, size_t output_num);
  66. int32_t GetCondIndex(const ConstGeTensorPtr &tensor);
  67. };
  68. } // namespace ge
  69. #endif // GE_GRAPH_PASSES_COND_REMOVE_PASS_H

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