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.cc 10 kB

5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261
  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 "coder/graph.h"
  17. #include <queue>
  18. #include <deque>
  19. #include <string>
  20. #include <memory>
  21. #include <algorithm>
  22. #include <set>
  23. #include "coder/log.h"
  24. #include "coder/opcoders/op_coder_register.h"
  25. #include "coder/utils/type_cast.h"
  26. #include "schema/inner/model_generated.h"
  27. #include "securec/include/securec.h"
  28. #include "src/common/prim_util.h"
  29. namespace mindspore::lite::micro {
  30. CoderGraph::~CoderGraph() {
  31. model_->Free();
  32. delete model_;
  33. for (auto &tensor : all_tensors_) {
  34. delete tensor;
  35. }
  36. }
  37. int CoderGraph::ConvertTensors() {
  38. if (model_ == nullptr) {
  39. MS_LOG(ERROR) << "Graph model is nullptr";
  40. return RET_ERROR;
  41. }
  42. std::vector<Tensor *> all_tensors;
  43. auto clear_tensors = [&all_tensors]() {
  44. std::for_each(all_tensors.begin(), all_tensors.end(), [](Tensor *&t) {
  45. delete t;
  46. t = nullptr;
  47. });
  48. all_tensors.clear();
  49. };
  50. auto check_dim = [](int dim) -> int {
  51. MS_CHECK_TRUE(dim > 0, "invalid dim value!");
  52. return RET_OK;
  53. };
  54. // deal with allTensors
  55. uint32_t tensorCount = model_->all_tensors_.size();
  56. for (uint32_t i = 0; i < tensorCount; ++i) {
  57. schema::Tensor *origin_tensor = model_->all_tensors_.at(i);
  58. MS_CHECK_PTR_WITH_EXE(origin_tensor, clear_tensors());
  59. // tensor dims
  60. std::vector<int> shape;
  61. if (origin_tensor->nodeType() == NodeType_ValueNode) {
  62. if (origin_tensor->dims() != nullptr) {
  63. for (uint32_t j = 0; j < origin_tensor->dims()->size(); j++) {
  64. MS_CHECK_PTR(origin_tensor->dims()->data());
  65. int dim = static_cast<int>(origin_tensor->dims()->data()[j]);
  66. MS_CHECK_RET_CODE_WITH_EXE(check_dim(dim), "parse shape failed!", clear_tensors());
  67. shape.push_back(dim);
  68. }
  69. }
  70. }
  71. // tensor Datatype
  72. if (shape.empty()) {
  73. shape.push_back(1);
  74. }
  75. int origin_data_type = static_cast<int>(origin_tensor->dataType());
  76. Tensor *dstTensor = new (std::nothrow)
  77. lite::Tensor(TypeId(origin_data_type), shape, origin_tensor->format(), TensorCategory(origin_tensor));
  78. MS_CHECK_PTR(dstTensor);
  79. if (origin_tensor->nodeType() == NodeType_ValueNode && origin_tensor->data() != nullptr &&
  80. origin_tensor->data()->size() > 0) {
  81. // copy data, this is weight && bias
  82. MS_CHECK_TRUE_WITH_EXE(origin_tensor->data()->size() > 0, "invalid meta_tensor data size.", delete dstTensor);
  83. auto data_size = static_cast<size_t>(origin_tensor->data()->size());
  84. MS_CHECK_RET_CODE_WITH_EXE(dstTensor->MallocData(), "dst tensor malloc data failed!", delete dstTensor);
  85. void *dst_data = dstTensor->data_c();
  86. MS_CHECK_RET_CODE_WITH_EXE(memcpy_s(dst_data, dstTensor->Size(), origin_tensor->data()->data(), data_size),
  87. "memcpy_s copy data failed!", delete dstTensor);
  88. dstTensor->set_data(dst_data);
  89. }
  90. if (origin_tensor->name() != nullptr) {
  91. dstTensor->set_tensor_name(origin_tensor->name()->str());
  92. }
  93. auto quant_params = origin_tensor->quantParams();
  94. if (quant_params != nullptr) {
  95. for (int j = 0; j < static_cast<int>(quant_params->size()); j++) {
  96. QuantArg quant_arg{};
  97. quant_arg.bitNum = quant_params->Get(j)->numBits();
  98. quant_arg.scale = quant_params->Get(j)->scale();
  99. quant_arg.zeroPoint = quant_params->Get(j)->zeroPoint();
  100. quant_arg.var_corr = quant_params->Get(j)->varCorr();
  101. quant_arg.mean_corr = quant_params->Get(j)->meanCorr();
  102. quant_arg.inited = quant_params->Get(j)->inited();
  103. quant_arg.roundType = quant_params->Get(j)->roundType();
  104. quant_arg.multiplier = quant_params->Get(j)->multiplier();
  105. quant_arg.dstDtype = quant_params->Get(j)->dstDtype();
  106. dstTensor->AddQuantParam(quant_arg);
  107. }
  108. }
  109. all_tensors.emplace_back(dstTensor);
  110. }
  111. SetAllTensors(all_tensors);
  112. return RET_OK;
  113. }
  114. int CoderGraph::InitGraphInOutTensors() {
  115. if (model_ == nullptr) {
  116. return RET_ERROR;
  117. }
  118. std::vector<size_t> graph_input_node_indexes = lite::GetGraphInputNodes(model_);
  119. std::vector<uint32_t> input_indices;
  120. for (auto in_node_index : graph_input_node_indexes) {
  121. in_node_index = static_cast<uint32_t>(in_node_index);
  122. auto in_node = model_->all_nodes_.at(in_node_index);
  123. MS_CHECK_PTR(in_node);
  124. for (uint32_t i = 0; i < in_node->input_indices_.size(); i++) {
  125. auto in_tensor_index = size_t(in_node->input_indices_.at(i));
  126. bool is_graph_input = false;
  127. for (uint32_t j = 0; j < model_->sub_graphs_.at(0)->input_indices_.size(); j++) {
  128. if (in_tensor_index == size_t(model_->sub_graphs_.at(0)->input_indices_.at(j))) {
  129. input_indices.push_back(static_cast<uint32_t>(in_tensor_index));
  130. is_graph_input = true;
  131. break;
  132. }
  133. }
  134. if (!is_graph_input) {
  135. continue;
  136. }
  137. if (in_tensor_index < all_tensors_.size()) {
  138. lite::Tensor *in_tensor = all_tensors_.at(in_tensor_index);
  139. AddInputMap(in_node->name_, in_tensor);
  140. }
  141. }
  142. }
  143. SetInputIndices(input_indices);
  144. std::vector<uint32_t> output_indices;
  145. auto graph_output_node_indexes = lite::GetGraphOutputNodes(model_);
  146. for (auto out_node_index : graph_output_node_indexes) {
  147. out_node_index = static_cast<uint32_t>(out_node_index);
  148. auto *out_node = model_->all_nodes_.at(out_node_index);
  149. for (uint32_t i = 0; i < out_node->output_indices_.size(); i++) {
  150. auto out_tensor_index = size_t(out_node->output_indices_.at(i));
  151. bool is_graph_output = false;
  152. for (uint32_t j = 0; j < model_->sub_graphs_.at(0)->output_indices_.size(); j++) {
  153. if (out_tensor_index == size_t(model_->sub_graphs_.at(0)->output_indices_.at(j))) {
  154. output_indices.push_back(static_cast<uint32_t>(out_tensor_index));
  155. is_graph_output = true;
  156. break;
  157. }
  158. }
  159. if (!is_graph_output) {
  160. continue;
  161. }
  162. if (out_tensor_index < all_tensors_.size()) {
  163. lite::Tensor *out_tensor = all_tensors_.at(out_tensor_index);
  164. if (out_tensor == nullptr) {
  165. MS_LOG(ERROR) << "can not find any output tensor in all_tensors";
  166. return RET_ERROR;
  167. }
  168. AddOutputMap(out_node->name_, out_tensor);
  169. }
  170. }
  171. }
  172. SetOutputIndices(output_indices);
  173. InitInputs();
  174. InitOutputs();
  175. return RET_OK;
  176. }
  177. std::vector<lite::Tensor *> CoderGraph::input_tensors() const { return input_tensors_; }
  178. std::vector<lite::Tensor *> CoderGraph::output_tensors() const { return output_tensors_; }
  179. void CoderGraph::InitInputs() {
  180. for (const auto &pair : inputs_map_) {
  181. std::vector<Tensor *> tensors = pair.second;
  182. input_tensors_.insert(input_tensors_.end(), tensors.begin(), tensors.end());
  183. }
  184. // remove duplicate tensors
  185. std::set<lite::Tensor *> unique;
  186. unique.insert(input_tensors_.begin(), input_tensors_.end());
  187. input_tensors_.clear();
  188. input_tensors_.insert(input_tensors_.end(), unique.begin(), unique.end());
  189. }
  190. void CoderGraph::InitOutputs() {
  191. std::transform(output_indices_.begin(), output_indices_.end(), std::back_inserter(output_tensors_),
  192. [&](uint32_t a) { return this->all_tensors_.at(a); });
  193. }
  194. void CoderGraph::SetAllTensors(const std::vector<Tensor *> &all_tensors) {
  195. all_tensors_.insert(all_tensors_.end(), all_tensors.begin(), all_tensors.end());
  196. }
  197. void CoderGraph::SetInputIndices(const std::vector<uint32_t> &input_indices) {
  198. input_indices_.insert(input_indices_.end(), input_indices.begin(), input_indices.end());
  199. }
  200. void CoderGraph::SetOutputIndices(const std::vector<uint32_t> &output_indices) {
  201. output_indices_.insert(output_indices_.end(), output_indices.begin(), output_indices.end());
  202. }
  203. void CoderGraph::AddInputMap(const std::string &node_id, Tensor *input_tensor) {
  204. if (!input_tensor) {
  205. MS_LOG(ERROR) << "input tensor is nullptr, can not added to coder_graph";
  206. return;
  207. }
  208. this->inputs_map_[node_id].emplace_back(input_tensor);
  209. }
  210. void CoderGraph::AddOutputMap(const std::string &node_id, Tensor *output_tensor) {
  211. if (!output_tensor) {
  212. MS_LOG(ERROR) << "output tensor is nullptr, can not added to coder_graph";
  213. return;
  214. }
  215. this->outputs_map_[node_id].emplace_back(output_tensor);
  216. }
  217. std::vector<lite::Tensor *> CoderGraph::all_tensors() const { return this->all_tensors_; }
  218. const std::map<std::string, std::vector<lite::Tensor *>> &CoderGraph::GetOutputsMap() const { return outputs_map_; }
  219. std::vector<uint32_t> CoderGraph::input_indices() const { return this->input_indices_; }
  220. std::vector<uint32_t> CoderGraph::output_indices() const { return this->output_indices_; }
  221. void CoderGraph::DumpUnSupportLayer(Target target) {
  222. std::cerr << "==========dump all unsupported layer for codegen=====" << std::endl;
  223. std::for_each(model_->all_nodes_.begin(), model_->all_nodes_.end(), [this, target](const Model::Node *node) {
  224. if (node->primitive_ == nullptr) {
  225. return;
  226. }
  227. // fake create opcoders
  228. uint32_t input_idx = node->input_indices_.at(0);
  229. Tensor *t = all_tensors_.at(input_idx);
  230. TypeId dtype = t->data_type();
  231. int pt = GetPrimitiveType(node->primitive_);
  232. CoderKey key(target, dtype, pt);
  233. // search from the opcoder registry
  234. if (OpCoderFactory::GetInstance()->FindOpCoder(key) == nullptr) {
  235. std::cerr << node->name_ << ", primitive type: "
  236. << mindspore::schema::EnumNamePrimitiveType(static_cast<schema::PrimitiveType>(pt))
  237. << ", data_type: " << EnumNameDataType(dtype) << std::endl;
  238. }
  239. });
  240. }
  241. } // namespace mindspore::lite::micro