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.

ref_relation.h 2.2 kB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879
  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 COMMON_GRAPH_REF_RELATION_H_
  17. #define COMMON_GRAPH_REF_RELATION_H_
  18. #include <deque>
  19. #include <string>
  20. #include <unordered_map>
  21. #include <vector>
  22. #include "graph/compute_graph.h"
  23. #include "graph/types.h"
  24. #include "graph/ge_error_codes.h"
  25. #include "node.h"
  26. namespace ge {
  27. enum InOutFlag {
  28. NODE_IN = 0, // input flag
  29. NODE_OUT = 1, // output flag
  30. };
  31. struct RefCell {
  32. std::string node_name;
  33. ge::NodePtr node = nullptr;
  34. InOutFlag in_out = NODE_IN;
  35. int in_out_idx = 0;
  36. bool operator==(const RefCell &c) const {
  37. return node_name == c.node_name && node == c.node && in_out == c.in_out && in_out_idx == c.in_out_idx;
  38. }
  39. RefCell() = default;
  40. RefCell(std::string name, ge::NodePtr node_ptr, InOutFlag in_out_flag, int idx) {
  41. node_name = name;
  42. node = node_ptr;
  43. in_out = in_out_flag;
  44. in_out_idx = idx;
  45. };
  46. ~RefCell() = default;
  47. };
  48. struct RefCellHash {
  49. size_t operator()(const RefCell &c) const {
  50. unsigned long number = static_cast<unsigned long>(reinterpret_cast<uintptr_t>(c.node.get()));
  51. string tmp = c.node_name + std::to_string(c.in_out) + std::to_string(c.in_out_idx) + std::to_string(number);
  52. return std::hash<string>()(tmp);
  53. }
  54. };
  55. class RefRelations {
  56. public:
  57. graphStatus LookUpRefRelations(const RefCell &key, std::unordered_set<RefCell, RefCellHash> &result);
  58. graphStatus BuildRefRelations(ge::ComputeGraph &root_graph);
  59. graphStatus Clear();
  60. RefRelations();
  61. ~RefRelations() = default;
  62. public:
  63. class Impl;
  64. std::shared_ptr<Impl> impl_ = nullptr;
  65. };
  66. } // namespace ge
  67. #endif // COMMON_GRAPH_REF_RELATION_H_

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