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.

reshape_remove_pass.cc 2.8 kB

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
  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/reshape_remove_pass.h"
  17. #include <map>
  18. #include <string>
  19. #include "framework/common/util.h"
  20. #include "framework/common/types.h"
  21. #include "graph/passes/pass_utils.h"
  22. #include "graph/utils/node_utils.h"
  23. namespace ge {
  24. namespace {
  25. const int kReshapeDataIndex = 0;
  26. enum OpHashValue {
  27. kReshapeType = 0,
  28. kReformatType = 1,
  29. kOpNoDelete = -1
  30. };
  31. std::map<std::string, OpHashValue> kToBeDeleteOp = {
  32. {RESHAPE, kReshapeType},
  33. {REFORMAT, kReformatType}
  34. };
  35. }
  36. Status ReshapeRemovePass::Run(NodePtr &node) {
  37. GE_CHECK_NOTNULL(node);
  38. GE_CHECK_NOTNULL(node->GetOpDesc());
  39. int key = kToBeDeleteOp.find(node->GetType()) == kToBeDeleteOp.end() ? kOpNoDelete : kToBeDeleteOp[node->GetType()];
  40. switch (key) {
  41. case kReshapeType: {
  42. bool is_in_unknown_shape_graph = false;
  43. bool forced_unknown = false;
  44. for (const auto &node : graph->GetDirectNode()) {
  45. GE_CHK_GRAPH_STATUS_RET(ge::NodeUtils::GetNodeUnknownShapeStatus(*node, is_in_unknown_shape_graph),
  46. "[Get][ShapeStatus] of node[%s] failed!", node->GetName().c_str());
  47. if (is_in_unknown_shape_graph) {
  48. break;
  49. }
  50. if (AttrUtils::GetBool(node->GetOpDesc(), ATTR_NAME_FORCE_UNKNOWN_SHAPE, forced_unknown) && forced_unknown) {
  51. GELOGD("node %s was marked as unknown shape.", node->GetName().c_str());
  52. is_in_unknown_shape_graph = true;
  53. break;
  54. }
  55. }
  56. if (is_in_unknown_shape_graph) {
  57. GELOGI("op:%s is in unknown shape graph, can not be deleted.", node->GetName().c_str());
  58. return SUCCESS;
  59. }
  60. bool is_shape_unknown = false;
  61. if (NodeUtils::GetNodeUnknownShapeStatus(*node, is_shape_unknown) == GRAPH_SUCCESS) {
  62. if (is_shape_unknown) {
  63. GELOGI("op:%s is unknown shape, can not be deleted.",
  64. node->GetName().c_str());
  65. return SUCCESS;
  66. }
  67. }
  68. break;
  69. }
  70. case kReformatType:
  71. break;
  72. default:
  73. return SUCCESS;
  74. }
  75. GELOGI("Remove %s node %s", node->GetType().c_str(), node->GetName().c_str());
  76. return IsolateAndDeleteNode(node, {kReshapeDataIndex});
  77. }
  78. } // namespace ge

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