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.

py_pass.cc 13 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  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 "frontend/optimizer/py_pass.h"
  17. #include <unordered_set>
  18. #include <deque>
  19. #include <vector>
  20. #include "ir/func_graph.h"
  21. #include "ir/manager.h"
  22. #include "pybind_api/ir/primitive_py.h"
  23. #include "ir/scalar.h"
  24. #include "ir/graph_utils.h"
  25. #include "pipeline/jit/parse/parse_base.h"
  26. #include "pipeline/jit/resource.h"
  27. #include "frontend/optimizer/py_pass_manager.h"
  28. #include "utils/info.h"
  29. namespace mindspore {
  30. namespace opt {
  31. namespace python_pass {
  32. namespace internal {
  33. const char PARAMETER_MODULE[] = "mindspore.common.parameter";
  34. const char PARAMETER_CLASS[] = "Parameter";
  35. const char SET_PARAM[] = "__setattr__";
  36. AnfNodePtr ProcessSinglePattern(const PatternPtr &pattern, const MatchResultPtr &res, const FuncGraphPtr &func_graph,
  37. const FuncGraphPtr &top_graph);
  38. AnfNodePtr BuildTarget(const PatternPtr &pattern, const FuncGraphPtr &func_graph, const FuncGraphPtr &top_graph,
  39. const MatchResultPtr &res);
  40. void ReflectParamBackToPython(const AnfNodePtr &param, string param_name, tensor::TensorPtr default_input,
  41. bool requires_grad, bool layerwise_parallel);
  42. bool IsTraversable(const AnfNodePtr &node) {
  43. if (node == nullptr) {
  44. return false;
  45. }
  46. if (node->isa<CNode>() || node->isa<Parameter>()) {
  47. return true;
  48. }
  49. if (IsValueNode<FuncGraph>(node) || IsValueNode<RefKey>(node)) {
  50. return true;
  51. }
  52. return false;
  53. }
  54. AnfNodePtr BuildPrimitive(const PatternPtr &pattern, const MatchResultPtr &res) {
  55. // Build up AnfNode from primitive
  56. auto prim_pattern = pattern->cast<PrimPtr>();
  57. MS_EXCEPTION_IF_NULL(prim_pattern);
  58. PrimitivePyPtr prim = prim_pattern->matched_primitive();
  59. MS_EXCEPTION_IF_NULL(prim);
  60. // Make value node out of primitives
  61. return std::make_shared<ValueNode>(prim);
  62. }
  63. AnfNodePtr BuildNewTensor(const PatternPtr &pattern, const MatchResultPtr &res) {
  64. // Build a ValueNode from TensorPtr
  65. auto new_tensor_pattern = pattern->cast<NewTensorPtr>();
  66. MS_EXCEPTION_IF_NULL(new_tensor_pattern);
  67. auto input_tensor = new_tensor_pattern->input_tensor();
  68. MS_EXCEPTION_IF_NULL(input_tensor);
  69. return std::make_shared<ValueNode>(input_tensor);
  70. }
  71. AnfNodePtr BuildPrimitiveValueNode(const PatternPtr &pattern, const MatchResultPtr &res, const FuncGraphPtr &fg,
  72. const FuncGraphPtr &top_graph) {
  73. auto call_pattern = pattern->cast<CallPtr>();
  74. MS_EXCEPTION_IF_NULL(call_pattern);
  75. auto prim = call_pattern->prim_value();
  76. if (prim != nullptr) {
  77. return std::make_shared<ValueNode>(prim);
  78. }
  79. auto prim_pattern = call_pattern->prim_pattern();
  80. MS_EXCEPTION_IF_NULL(prim_pattern);
  81. return ProcessSinglePattern(prim_pattern, res, fg, top_graph);
  82. }
  83. AnfNodePtr BuildNewParameter(const PatternPtr &pattern, const MatchResultPtr &res, const FuncGraphPtr &top_graph) {
  84. auto new_para_pattern = pattern->cast<NewParameterPtr>();
  85. MS_EXCEPTION_IF_NULL(new_para_pattern);
  86. if (!new_para_pattern->built()) {
  87. static int parameter_id = 0;
  88. auto para_name = new_para_pattern->para_name() + new_para_pattern->unique_name() + std::to_string(parameter_id++);
  89. auto para_node = std::make_shared<Parameter>(top_graph);
  90. MS_EXCEPTION_IF_NULL(para_node);
  91. para_node->set_name(para_name);
  92. // Set function graph
  93. para_node->set_func_graph(top_graph);
  94. // Set Debug Info
  95. auto debug_info = std::make_shared<NodeDebugInfo>(para_name);
  96. para_node->set_debug_info(debug_info);
  97. // Set abstract
  98. auto default_value = new_para_pattern->default_tensor();
  99. MS_EXCEPTION_IF_NULL(default_value);
  100. para_node->set_abstract(default_value->ToAbstract()->Broaden());
  101. res->add_entry(pattern, para_node);
  102. top_graph->add_parameter(para_node);
  103. // Reflect back to Cell._params
  104. internal::ReflectParamBackToPython(para_node, para_name, default_value, new_para_pattern->requires_grad(),
  105. new_para_pattern->layerwise_parallel());
  106. MS_LOG(WARNING) << "Adding parameter: " + para_node->ToString() + " parameter name:" + para_node->name();
  107. new_para_pattern->set_built(true);
  108. return para_node;
  109. } else {
  110. // Built, fetch the node
  111. auto para_node = res->get_node(pattern);
  112. MS_EXCEPTION_IF_NULL(para_node);
  113. return para_node;
  114. }
  115. }
  116. AnfNodePtr BuildImmNode(const PatternPtr &pattern, const MatchResultPtr &res) {
  117. auto imm_pattern = pattern->cast<ImmPtr>();
  118. MS_EXCEPTION_IF_NULL(imm_pattern);
  119. auto value = imm_pattern->value();
  120. auto scalar_value_ptr = std::make_shared<Int32Imm>(value);
  121. return std::make_shared<ValueNode>(scalar_value_ptr);
  122. }
  123. AnfNodePtr ProcessSinglePattern(const PatternPtr &pattern, const MatchResultPtr &res, const FuncGraphPtr &func_graph,
  124. const FuncGraphPtr &top_graph) {
  125. auto target_node = res->get_node(pattern);
  126. if (target_node != nullptr) {
  127. // If pattern is NewParameter, check whether it shouldn't last and is not built
  128. auto new_para = pattern->cast<NewParameterPtr>();
  129. if (new_para == nullptr || new_para->should_last() || new_para->built()) {
  130. return target_node;
  131. }
  132. }
  133. // Build up new node from pattern
  134. if (pattern->isa<Prim>()) {
  135. return BuildPrimitive(pattern, res);
  136. } else if (pattern->isa<NewTensor>()) {
  137. return BuildNewTensor(pattern, res);
  138. } else if (pattern->isa<Call>()) {
  139. return BuildPrimitiveValueNode(pattern, res, func_graph, top_graph);
  140. } else if (pattern->isa<NewParameter>()) {
  141. // Add new parameter to top graph instead of current graph
  142. return BuildNewParameter(pattern, res, top_graph);
  143. } else if (pattern->isa<Imm>()) {
  144. return BuildImmNode(pattern, res);
  145. } else {
  146. MS_LOG(EXCEPTION) << "Cannot find or build target node, pattern: " + pattern->unique_name() + "\n";
  147. return nullptr;
  148. }
  149. return nullptr;
  150. }
  151. AnfNodePtr ProcessComplexPatternFirstInput(const PatternPtr &pattern, const MatchResultPtr &res,
  152. const FuncGraphPtr &func_graph, const FuncGraphPtr &top_graph) {
  153. if (pattern->isa<Call>()) {
  154. return BuildPrimitiveValueNode(pattern, res, func_graph, top_graph);
  155. }
  156. return nullptr;
  157. }
  158. AnfNodePtr BuildTarget(const PatternPtr &pattern, const FuncGraphPtr &func_graph, const FuncGraphPtr &top_graph,
  159. const MatchResultPtr &res) {
  160. auto target_inputs = pattern->inputs();
  161. if (target_inputs.size() == 0) {
  162. auto new_node = ProcessSinglePattern(pattern, res, func_graph, top_graph);
  163. if (new_node != nullptr) {
  164. res->add_entry(pattern, new_node);
  165. }
  166. return new_node;
  167. }
  168. // Build up the AnfNode in a recursive manner
  169. std::vector<AnfNodePtr> new_inputs;
  170. auto prim_value_node = ProcessComplexPatternFirstInput(pattern, res, func_graph, top_graph);
  171. MS_EXCEPTION_IF_NULL(prim_value_node);
  172. new_inputs.push_back(prim_value_node);
  173. for (auto &iter : target_inputs) {
  174. if (iter == pattern) {
  175. MS_LOG(EXCEPTION) << "Circle references. Got pattern: " + pattern->unique_name() + "\n";
  176. }
  177. auto input_node = BuildTarget(iter, func_graph, top_graph, res);
  178. if (input_node == nullptr) {
  179. MS_LOG(EXCEPTION) << "Failed to build input node for pattern : " + iter->unique_name() + "\n";
  180. }
  181. new_inputs.push_back(input_node);
  182. }
  183. auto new_node = func_graph->NewCNode(new_inputs);
  184. res->add_entry(pattern, new_node);
  185. return new_node;
  186. }
  187. void ReflectParamBackToPython(const AnfNodePtr &param, string param_name, tensor::TensorPtr default_input,
  188. bool requires_grad, bool layerwise_parallel) {
  189. // 1. Get current cell object
  190. auto ppm = opt::python_pass::PyPassManager::GetInstance();
  191. auto resource = ppm->GetResource();
  192. py::object top_cell = resource->input();
  193. if (py::isinstance<py::none>(top_cell)) {
  194. MS_LOG(EXCEPTION) << "Failed to get top cell from resource.";
  195. }
  196. // 2. Clone default_input tensor
  197. auto default_tensor = std::make_shared<tensor::Tensor>(default_input->data_type(), default_input->shape_c(),
  198. default_input->data_c(), (size_t)default_input->Size());
  199. // 3. New a Parameter object with the above-specified args
  200. py::object parameter_class = py::module::import(PARAMETER_MODULE).attr(PARAMETER_CLASS);
  201. py::object new_parameter = parameter_class(default_tensor, param_name, requires_grad, layerwise_parallel);
  202. // 4. Add the new python Parameter object to Cell's _params atttributes
  203. top_cell.attr(SET_PARAM)(param_name, new_parameter);
  204. // 5. Set default_param for param_node
  205. ValuePtr param_value = nullptr;
  206. bool converted = parse::ConvertData(new_parameter, &param_value, false);
  207. if (!converted) {
  208. MS_LOG(EXCEPTION) << "Failed to convert new parameter to ValuePtr.";
  209. }
  210. MS_EXCEPTION_IF_NULL(param);
  211. auto param_node = param->cast<ParameterPtr>();
  212. MS_EXCEPTION_IF_NULL(param_node);
  213. param_node->set_default_param(param_value);
  214. }
  215. void Reset(PatternPtr pattern) {
  216. if (pattern->isa<Prim>()) {
  217. auto prim_pattern = pattern->cast<PrimPtr>();
  218. prim_pattern->reset();
  219. return;
  220. } else if (pattern->isa<NewParameter>()) {
  221. auto new_param_pattern = pattern->cast<NewParameterPtr>();
  222. new_param_pattern->reset();
  223. return;
  224. } else if (pattern->isa<Call>()) {
  225. auto call_with_pattern = pattern->cast<CallPtr>();
  226. for (auto sub_pattern : call_with_pattern->inputs()) {
  227. Reset(sub_pattern);
  228. }
  229. return;
  230. }
  231. return;
  232. }
  233. } // namespace internal
  234. AnfNodePtr PythonPass::Run(const FuncGraphPtr &func_graph, const FuncGraphPtr &top_graph, const AnfNodePtr &node,
  235. const MatchResultPtr &res) {
  236. auto match_res = src_pattern_->match(node);
  237. if (match_res != nullptr) {
  238. res->merge(match_res);
  239. auto new_node = internal::BuildTarget(dst_pattern_, func_graph, top_graph, res);
  240. internal::Reset(dst_pattern());
  241. return new_node;
  242. }
  243. internal::Reset(src_pattern());
  244. return nullptr;
  245. }
  246. bool PythonPass::Run(const FuncGraphPtr &func_graph, const MatchResultPtr &res) {
  247. MS_EXCEPTION_IF_NULL(func_graph);
  248. MS_EXCEPTION_IF_NULL(dst_pattern_);
  249. if (src_pattern_ == nullptr) {
  250. // Add NewParameter
  251. auto new_para_pattern = dst_pattern_->cast<NewParameterPtr>();
  252. if (new_para_pattern == nullptr) {
  253. MS_LOG(EXCEPTION) << "Expect NewParameter pattern for target if src pattern is null.";
  254. }
  255. auto para_name = new_para_pattern->para_name() + new_para_pattern->unique_name();
  256. auto para_node = std::make_shared<Parameter>(func_graph);
  257. MS_EXCEPTION_IF_NULL(para_node);
  258. para_node->set_name(para_name);
  259. // Set function graph
  260. para_node->set_func_graph(func_graph);
  261. // Set Debug Info
  262. auto debug_info = std::make_shared<NodeDebugInfo>(para_name);
  263. para_node->set_debug_info(debug_info);
  264. // Set abstract
  265. auto default_value = new_para_pattern->default_tensor();
  266. MS_EXCEPTION_IF_NULL(default_value);
  267. para_node->set_abstract(default_value->ToAbstract()->Broaden());
  268. res->add_entry(dst_pattern_, para_node);
  269. func_graph->add_parameter(para_node);
  270. // Reflect back to Cell._params
  271. internal::ReflectParamBackToPython(para_node, para_name, default_value, new_para_pattern->requires_grad(),
  272. new_para_pattern->layerwise_parallel());
  273. MS_LOG(WARNING) << "[Gen]Adding parameter: " + para_node->ToString() + " parameter name:" + para_node->name();
  274. return true;
  275. }
  276. FuncGraphManagerPtr manager = func_graph->manager();
  277. MS_EXCEPTION_IF_NULL(manager);
  278. auto func_graphs = manager->func_graphs();
  279. bool changes = false;
  280. for (auto &fg : func_graphs) {
  281. manager->AddFuncGraph(fg);
  282. auto graph_nodes_sorted = TopoSort(fg->output());
  283. // Traverse once
  284. for (auto &node : graph_nodes_sorted) {
  285. AnfNodePtr new_node = Run(fg, func_graph, node, res);
  286. if (new_node != nullptr && new_node != node) {
  287. MS_LOG(WARNING) << "Matched";
  288. (void)manager->Replace(node, new_node);
  289. changes = true;
  290. }
  291. }
  292. }
  293. return changes;
  294. }
  295. } // namespace python_pass
  296. } // namespace opt
  297. } // namespace mindspore