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.

ctrl_edge_transfer_pass.cc 2.7 kB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
  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. #include "graph/passes/ctrl_edge_transfer_pass.h"
  17. #include "framework/common/debug/ge_log.h"
  18. #include "framework/common/ge_inner_error_codes.h"
  19. #include "framework/common/util.h"
  20. #include "graph/utils/graph_utils.h"
  21. namespace ge {
  22. /* Pass Explaination:
  23. *
  24. * After optimizing such as constant folding, it will form the following ctrl relationship
  25. * The sceno like this is unreasonable and when unknown shape, it will be error because
  26. * constant does not generate task. So when graph is stability, transfer the ctrl edge to
  27. * next op and guatantee the timing relationship
  28. *
  29. * A(ctrl edge)----constant------(ctrl edge)B or A(ctrl edge)----constant-----(data edge)B
  30. *
  31. * when after process, it will be like as follows:
  32. *
  33. * A constant
  34. * \ /
  35. * B
  36. */
  37. Status CtrlEdgeTransferPass::Run(ge::ComputeGraphPtr graph) {
  38. GELOGD("CtrlEdgeTransferPass start running");
  39. GE_CHECK_NOTNULL(graph);
  40. for (ge::NodePtr &n : graph->GetDirectNode()) {
  41. auto op_desc = n->GetOpDesc();
  42. if (op_desc == nullptr) {
  43. continue;
  44. }
  45. auto op_type = op_desc->GetType();
  46. if (op_type == CONSTANT || op_type == CONSTANTOP) {
  47. if (n->GetInAllNodes().empty()) {
  48. GELOGD("[CtrlEdgeTransferPass] node [%s] in nodes is empty", n->GetName().c_str());
  49. continue;
  50. }
  51. GELOGD("start to tranfer ctrl edge for const node [%s]", n->GetName().c_str());
  52. for (auto &in_control_node : n->GetInControlNodes()) {
  53. GE_CHECK_NOTNULL(in_control_node);
  54. GE_CHK_STATUS_RET(ge::GraphUtils::RemoveEdge(in_control_node->GetOutControlAnchor(), n->GetInControlAnchor()),
  55. "remove edge failed");
  56. for (auto &out_node : n->GetOutNodes()) {
  57. if (out_node == nullptr) {
  58. continue;
  59. }
  60. GE_CHK_STATUS_RET(
  61. ge::GraphUtils::AddEdge(in_control_node->GetOutControlAnchor(), out_node->GetInControlAnchor()),
  62. "add edge failed.");
  63. }
  64. }
  65. }
  66. }
  67. GELOGD("CtrlEdgeTransferPass running success!");
  68. return SUCCESS;
  69. }
  70. } // namespace ge

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