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.

weight_compress_option.cc 2.4 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
  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 "attr_options.h"
  17. #include <fstream>
  18. #include <iostream>
  19. #include <sstream>
  20. #include <vector>
  21. #include "graph/debug/ge_attr_define.h"
  22. #include "framework/common/util.h"
  23. #include "common/util/error_manager/error_manager.h"
  24. namespace ge {
  25. graphStatus WeightCompressFunc(ComputeGraphPtr &graph, const string &cfg_path) {
  26. GE_CHECK_NOTNULL(graph);
  27. if (cfg_path.empty()) {
  28. return GRAPH_SUCCESS;
  29. }
  30. std::string real_path = RealPath(cfg_path.c_str());
  31. if (real_path.empty()) {
  32. GELOGE(GRAPH_PARAM_INVALID, "Can not get real path for %s.", cfg_path.c_str());
  33. return GRAPH_PARAM_INVALID;
  34. }
  35. std::ifstream ifs(real_path);
  36. if (!ifs.is_open()) {
  37. GELOGE(GRAPH_FAILED, "Open file %s failed", cfg_path.c_str());
  38. return GRAPH_FAILED;
  39. }
  40. std::string compress_nodes;
  41. ifs >> compress_nodes;
  42. ifs.close();
  43. GELOGI("Compress weight of nodes: %s", compress_nodes.c_str());
  44. vector<string> compress_node_vec = StringUtils::Split(compress_nodes, ';');
  45. for (size_t i = 0; i < compress_node_vec.size(); ++i) {
  46. bool is_find = false;
  47. for (auto &node_ptr : graph->GetDirectNode()) {
  48. GE_CHECK_NOTNULL(node_ptr);
  49. auto op_desc = node_ptr->GetOpDesc();
  50. GE_CHECK_NOTNULL(op_desc);
  51. if ((op_desc->GetName() == compress_node_vec[i]) || IsOriginalOpFind(op_desc, compress_node_vec[i])) {
  52. is_find = true;
  53. if (!ge::AttrUtils::SetBool(op_desc, ge::ATTR_NAME_COMPRESS_WEIGHT, true)) {
  54. GELOGE(GRAPH_FAILED, "node %s SetBool failed.", compress_node_vec[i].c_str());
  55. return GRAPH_FAILED;
  56. }
  57. }
  58. }
  59. if (!is_find) {
  60. GELOGW("node %s is not in graph", compress_node_vec[i].c_str());
  61. }
  62. }
  63. return GRAPH_SUCCESS;
  64. }
  65. } // namespace ge

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