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.h 4.1 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
5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. /**
  2. * Copyright 2019-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 INC_EXTERNAL_GRAPH_GRAPH_H_
  17. #define INC_EXTERNAL_GRAPH_GRAPH_H_
  18. #include <memory>
  19. #include <string>
  20. #include <utility>
  21. #include <vector>
  22. #include "./operator.h"
  23. #include "./gnode.h"
  24. namespace ge {
  25. class Graph;
  26. class GraphImpl;
  27. using GraphImplPtr = std::shared_ptr<GraphImpl>;
  28. using GraphPtr = std::shared_ptr<Graph>;
  29. class GE_FUNC_DEV_VISIBILITY GE_FUNC_HOST_VISIBILITY Graph {
  30. friend class GraphUtils;
  31. public:
  32. ATTRIBUTED_DEPRECATED(Graph(const char *))
  33. explicit Graph(const std::string &name);
  34. explicit Graph(const char *name);
  35. Graph() = default;
  36. ~Graph() = default;
  37. Graph &SetInputs(const std::vector<Operator> &inputs);
  38. Graph &SetOutputs(const std::vector<Operator> &outputs);
  39. Graph &SetOutputs(const std::vector<std::pair<Operator, std::vector<size_t>>> &output_indexs);
  40. ATTRIBUTED_DEPRECATED(Graph &SetOutputs(const std::vector < std::pair < ge::Operator, AscendString) &)
  41. Graph &SetOutputs(const std::vector<std::pair<ge::Operator, std::string>> &outputs);
  42. Graph &SetOutputs(const std::vector<std::pair<ge::Operator, AscendString>> &outputs);
  43. Graph &SetTargets(const std::vector<Operator> &targets);
  44. bool IsValid() const;
  45. graphStatus AddOp(const ge::Operator &op);
  46. ATTRIBUTED_DEPRECATED(graphStatus FindOpByName(const char *, ge::Operator &))
  47. graphStatus FindOpByName(const std::string &name, ge::Operator &op) const;
  48. graphStatus FindOpByName(const char *name, ge::Operator &op) const;
  49. ATTRIBUTED_DEPRECATED(graphStatus FindOpByType(const char *, std::vector<ge::Operator> &))
  50. graphStatus FindOpByType(const std::string &type, std::vector<ge::Operator> &ops) const;
  51. graphStatus FindOpByType(const char *type, std::vector<ge::Operator> &ops) const;
  52. ATTRIBUTED_DEPRECATED(graphStatus GetAllOpName(std::vector<AscendString> &) const)
  53. graphStatus GetAllOpName(std::vector<std::string> &op_name) const;
  54. graphStatus GetAllOpName(std::vector<AscendString> &names) const;
  55. ATTRIBUTED_DEPRECATED(graphStatus SaveToFile(const char *file_name) const)
  56. graphStatus SaveToFile(const std::string &file_name) const;
  57. graphStatus SaveToFile(const char *file_name) const;
  58. ATTRIBUTED_DEPRECATED(graphStatus LoadFromFile(const char *))
  59. graphStatus LoadFromFile(const std::string &file_name);
  60. graphStatus LoadFromFile(const char *file_name);
  61. ATTRIBUTED_DEPRECATED(graphStatus GetName(AscendString &) const)
  62. const std::string &GetName() const;
  63. graphStatus GetName(AscendString &name) const;
  64. ///
  65. /// Set is need train iteration.
  66. /// If set true, it means this graph need to be run iteration some
  67. /// times(according variant "npu_runconfig/iterations_per_loop").
  68. /// @param need_iteration need_iteration:whether to set iteration or not
  69. ///
  70. void SetNeedIteration(bool need_iteration);
  71. std::vector<GNode> GetAllNodes() const;
  72. std::vector<GNode> GetDirectNode() const;
  73. graphStatus RemoveNode(GNode &node);
  74. graphStatus RemoveEdge(GNode &src_node, const int32_t src_port_index, GNode &dst_node, const int32_t dst_port_index);
  75. GNode AddNodeByOp(const Operator &op);
  76. graphStatus AddDataEdge(GNode &src_node, const int32_t src_port_index, GNode &dst_node, const int32_t dst_port_index);
  77. graphStatus AddControlEdge(GNode &src_node, GNode &dst_node);
  78. static GraphPtr ConstructFromInputs(const std::vector<Operator> &inputs, const AscendString &name);
  79. private:
  80. GraphImplPtr impl_{nullptr};
  81. };
  82. } // namespace ge
  83. #endif // INC_EXTERNAL_GRAPH_GRAPH_H_

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