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.

mark_same_addr_pass.cc 2.4 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
  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. #include "graph/passes/mark_same_addr_pass.h"
  17. namespace ge {
  18. bool MarkSameAddrPass::IsNextNodeExpected(const ge::NodePtr &cur_node, const vector<string> &next_nodes,
  19. int &out_anchor_idx) {
  20. for (auto out_anchor : cur_node->GetAllOutDataAnchors()) {
  21. if (out_anchor == nullptr) {
  22. continue;
  23. }
  24. for (auto in_anchor : out_anchor->GetPeerInDataAnchors()) {
  25. if (in_anchor == nullptr) {
  26. continue;
  27. }
  28. auto dst_node = in_anchor->GetOwnerNode();
  29. if (dst_node == nullptr) {
  30. continue;
  31. }
  32. if (std::count(next_nodes.begin(), next_nodes.end(), dst_node->GetType()) > 0) {
  33. out_anchor_idx = out_anchor->GetIdx();
  34. GELOGD("Current node is %s, next node is %s.", cur_node->GetName().c_str(), dst_node->GetName().c_str());
  35. return true;
  36. }
  37. }
  38. }
  39. return false;
  40. }
  41. Status MarkSameAddrPass::Run(ComputeGraphPtr graph) {
  42. GELOGD("MarkSameAddrPass begin.");
  43. GE_CHECK_NOTNULL(graph);
  44. if (graph->GetGraphUnknownFlag()) {
  45. GELOGD("Graph[%s] is unknown shape, do not need to set fixed addr attr.", graph->GetName().c_str());
  46. return SUCCESS;
  47. }
  48. int out_anchor_idx = 0;
  49. for (const ge::NodePtr &node : graph->GetDirectNode()) {
  50. auto op_desc = node->GetOpDesc();
  51. GE_CHECK_NOTNULL(op_desc);
  52. vector<string> next_nodes = {STREAMSWITCH, STREAMSWITCHN, LABELSWITCHBYINDEX};
  53. if (IsNextNodeExpected(node, next_nodes, out_anchor_idx)) {
  54. string tensor_name = op_desc->GetOutputNameByIndex(out_anchor_idx);
  55. (void)ge::AttrUtils::SetStr(node->GetOpDesc(), ATTR_DYNAMIC_SHAPE_FIXED_ADDR, tensor_name);
  56. (void)ge::AttrUtils::SetInt(node->GetOpDesc(), ATTR_DYNAMIC_SHAPE_FIXED_ADDR_INDEX, out_anchor_idx);
  57. }
  58. }
  59. GELOGD("MarkSameAddrPass end.");
  60. return SUCCESS;
  61. }
  62. } // namespace ge

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