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_builder.cc 2.5 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
  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/builder/graph_builder.h"
  17. #include "easy_graph/graph/endpoint.h"
  18. #include "easy_graph/builder/link.h"
  19. #include "easy_graph/infra/log.h"
  20. EG_NS_BEGIN
  21. namespace {
  22. PortId getPortIdBy(const EdgeType &type, const PortId &specifiedPortId, PortId &reservedPortId) {
  23. if (type == EdgeType::CTRL)
  24. return 0;
  25. if (specifiedPortId == UNDEFINED_PORT_ID)
  26. return reservedPortId++;
  27. if (specifiedPortId < reservedPortId)
  28. return specifiedPortId;
  29. reservedPortId = specifiedPortId;
  30. return reservedPortId++;
  31. }
  32. } // namespace
  33. GraphBuilder::GraphBuilder(const std::string &name) : graph_(name) {}
  34. GraphBuilder::NodeInfo *GraphBuilder::FindNode(const NodeId &id) {
  35. auto it = nodes_.find(id);
  36. if (it == nodes_.end()) {
  37. return nullptr;
  38. }
  39. return &(it->second);
  40. }
  41. const GraphBuilder::NodeInfo *GraphBuilder::FindNode(const NodeId &id) const {
  42. return const_cast<GraphBuilder &>(*this).FindNode(id);
  43. }
  44. Node *GraphBuilder::BuildNode(const Node &node) {
  45. auto it = nodes_.find(node.GetId());
  46. if (it == nodes_.end()) {
  47. nodes_.emplace(std::make_pair(node.GetId(), NodeInfo()));
  48. }
  49. return graph_.AddNode(node);
  50. }
  51. Edge *GraphBuilder::BuildEdge(const Node &src, const Node &dst, const Link &link) {
  52. NodeInfo *srcInfo = FindNode(src.GetId());
  53. NodeInfo *dstInfo = FindNode(dst.GetId());
  54. if (!srcInfo || !dstInfo) {
  55. EG_ERR("link edge{%d : %s} error!", link.type_, link.label_.c_str());
  56. return nullptr;
  57. }
  58. PortId srcPortId = getPortIdBy(link.type_, link.src_port_id_, srcInfo->outPortMax);
  59. PortId dstPortId = getPortIdBy(link.type_, link.dst_port_id_, dstInfo->inPortMax);
  60. EG_DBG("link edge(%d) from (%s:%d) to (%s:%d)", link.type_, src.GetId().c_str(), srcPortId, dst.GetId().c_str(),
  61. dstPortId);
  62. return graph_.AddEdge(
  63. Edge(link.type_, link.label_, Endpoint(src.GetId(), srcPortId), Endpoint(dst.GetId(), dstPortId)));
  64. }
  65. EG_NS_END

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