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.cc 2.2 kB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
  1. /**
  2. * Copyright 2021 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 "easy_graph/graph/graph.h"
  17. #include "easy_graph/graph/graph_visitor.h"
  18. #include "easy_graph/layout/graph_layout.h"
  19. #include <algorithm>
  20. EG_NS_BEGIN
  21. Graph::Graph(const std::string &name) : name_(name) {}
  22. std::string Graph::GetName() const {
  23. return name_;
  24. }
  25. Node *Graph::AddNode(const Node &node) {
  26. auto result = nodes_.emplace(node.GetId(), node);
  27. return &(result.first->second);
  28. }
  29. Edge *Graph::AddEdge(const Edge &edge) {
  30. auto result = edges_.emplace(edge);
  31. return &(const_cast<Edge &>(*(result.first)));
  32. }
  33. Node *Graph::FindNode(const NodeId &id) {
  34. auto it = nodes_.find(id);
  35. if (it == nodes_.end()) {
  36. return nullptr;
  37. }
  38. return &(it->second);
  39. }
  40. const Node *Graph::FindNode(const NodeId &id) const {
  41. return const_cast<Graph &>(*this).FindNode(id);
  42. }
  43. std::pair<const Node *, const Node *> Graph::FindNodePair(const Edge &edge) const {
  44. return std::make_pair(FindNode(edge.GetSrc().getNodeId()), FindNode(edge.GetDst().getNodeId()));
  45. }
  46. std::pair<Node *, Node *> Graph::FindNodePair(const Edge &edge) {
  47. return std::make_pair(FindNode(edge.GetSrc().getNodeId()), FindNode(edge.GetDst().getNodeId()));
  48. }
  49. void Graph::Accept(GraphVisitor &visitor) const {
  50. visitor.Visit(*this);
  51. std::for_each(nodes_.begin(), nodes_.end(), [&visitor](const auto &node) { visitor.Visit(node.second); });
  52. std::for_each(edges_.begin(), edges_.end(), [&visitor](const auto &edge) { visitor.Visit(edge); });
  53. }
  54. Status Graph::Layout(const LayoutOption *option) const {
  55. return GraphLayout::GetInstance().Layout(*this, option);
  56. }
  57. EG_NS_END

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