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.

pattern.h 9.3 kB

5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279
  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. #ifndef MINDSPORE_CCSRC_FRONTEND_OPTIMIZER_PATTERN_H_
  17. #define MINDSPORE_CCSRC_FRONTEND_OPTIMIZER_PATTERN_H_
  18. #include <string>
  19. #include <memory>
  20. #include <vector>
  21. #include <unordered_map>
  22. #include "base/base.h"
  23. #include "ir/anf.h"
  24. #include "ir/tensor.h"
  25. #include "pybind_api/ir/primitive_py.h"
  26. #include "pybind_api/ir/tensor_py.h"
  27. namespace mindspore {
  28. namespace opt {
  29. namespace python_pass {
  30. using std::string;
  31. using std::vector;
  32. class MatchResult;
  33. using MatchResultPtr = std::shared_ptr<MatchResult>;
  34. class Pattern;
  35. using PatternPtr = std::shared_ptr<Pattern>;
  36. class Prim;
  37. using PrimPtr = std::shared_ptr<Prim>;
  38. class Call;
  39. using CallPtr = std::shared_ptr<Call>;
  40. class NewTensor;
  41. using NewTensorPtr = std::shared_ptr<NewTensor>;
  42. class NewParameter;
  43. using NewParameterPtr = std::shared_ptr<NewParameter>;
  44. class Imm;
  45. using ImmPtr = std::shared_ptr<Imm>;
  46. struct PatternHasher;
  47. struct PatternEqual;
  48. using PatternNodeMap = std::unordered_map<PatternPtr, AnfNodePtr, PatternHasher, PatternEqual>;
  49. class Pattern : public Base {
  50. public:
  51. Pattern() : unique_name_(std::to_string(g_id_++)) {}
  52. ~Pattern() = default;
  53. virtual MatchResultPtr match(const AnfNodePtr &node) { return nullptr; }
  54. virtual bool operator==(const Pattern &other) const { return unique_name_ == other.unique_name_; }
  55. string unique_name() const { return unique_name_; }
  56. vector<PatternPtr> inputs() { return inputs_; }
  57. virtual void reset() {}
  58. static void reset_gid() { g_id_ = 0; }
  59. protected:
  60. static int g_id_;
  61. // NOTE: To ensure uniqueness of the name, raise g_id_ by 1 every time a pattern got constructed
  62. string unique_name_;
  63. vector<PatternPtr> inputs_;
  64. };
  65. struct PatternEqual {
  66. bool operator()(PatternPtr const &p1, PatternPtr const &p2) const {
  67. MS_EXCEPTION_IF_NULL(p1);
  68. MS_EXCEPTION_IF_NULL(p2);
  69. return p1->unique_name() == p2->unique_name();
  70. }
  71. };
  72. struct PatternHasher {
  73. std::size_t operator()(PatternPtr const &p) const {
  74. MS_EXCEPTION_IF_NULL(p);
  75. return std::hash<string>()(p->unique_name());
  76. }
  77. };
  78. class Prim : public Pattern {
  79. public:
  80. Prim() { unique_name_ = std::to_string(g_id_++); }
  81. ~Prim() = default;
  82. Prim(vector<PrimitivePyPtr> prims, string name) : primitives_(prims), name_(name) {
  83. unique_name_ = std::to_string(g_id_++) + "Prim_" + name;
  84. // Default using the first prim to build target
  85. matched_prim_ = primitives_[0];
  86. }
  87. Prim(vector<string> types, string name) : types_(types), name_(name) {
  88. unique_name_ = std::to_string(g_id_++) + "Prim_" + name;
  89. // Make primitives_
  90. for (auto &iter : types) {
  91. primitives_.push_back(std::make_shared<PrimitivePy>(iter, py::cast(nullptr)));
  92. }
  93. // Default using the first prim to build target
  94. matched_prim_ = primitives_[0];
  95. }
  96. MS_DECLARE_PARENT(Prim, Pattern);
  97. MatchResultPtr match(const AnfNodePtr &node) override;
  98. PrimitivePyPtr matched_primitive() { return matched_prim_; }
  99. void reset() override {
  100. // Init before reset
  101. MS_EXCEPTION_IF_NULL(matched_prim_);
  102. matched_prim_ = primitives_[0];
  103. }
  104. private:
  105. vector<string> types_;
  106. vector<PrimitivePyPtr> primitives_;
  107. string name_;
  108. PrimitivePyPtr matched_prim_{nullptr};
  109. };
  110. class Call : public Pattern {
  111. public:
  112. Call() { unique_name_ = std::to_string(g_id_++); }
  113. ~Call() = default;
  114. Call(PatternPtr prim_pattern, vector<PatternPtr> inputs) {
  115. // NOTE: should_replace is ignored in this case, since each sub-pattern has its own setting
  116. prim_pattern_ = prim_pattern;
  117. unique_name_ = std::to_string(g_id_++) + "Call_" + prim_pattern->unique_name();
  118. inputs_ = inputs;
  119. }
  120. Call(PrimitivePyPtr prim, vector<PatternPtr> inputs) {
  121. prim_ = prim;
  122. unique_name_ = std::to_string(g_id_++) + "Call_" + prim_->ToString();
  123. inputs_ = inputs;
  124. }
  125. Call(string prim_str, vector<PatternPtr> inputs) {
  126. prim_ = std::make_shared<PrimitivePy>(prim_str, py::cast(nullptr));
  127. unique_name_ = std::to_string(g_id_++) + "CallStr_" + prim_->ToString();
  128. inputs_ = inputs;
  129. }
  130. MS_DECLARE_PARENT(Call, Pattern);
  131. MatchResultPtr match(const AnfNodePtr &node) override;
  132. PrimitivePtr prim_value() { return prim_; }
  133. PatternPtr prim_pattern() { return prim_pattern_; }
  134. private:
  135. PatternPtr prim_pattern_ = nullptr;
  136. PrimitivePtr prim_ = nullptr;
  137. vector<string> types_;
  138. string name_;
  139. };
  140. class OneOf : public Pattern {
  141. public:
  142. OneOf() { unique_name_ = std::to_string(g_id_++); }
  143. ~OneOf() = default;
  144. explicit OneOf(vector<PatternPtr> patterns) : patterns_(patterns) {
  145. unique_name_ = std::to_string(g_id_++) + "OneOf";
  146. for (auto &iter : patterns) {
  147. unique_name_ = unique_name_ + "_" + iter->unique_name();
  148. }
  149. }
  150. MS_DECLARE_PARENT(OneOf, Pattern);
  151. MatchResultPtr match(const AnfNodePtr &node) override;
  152. private:
  153. vector<PatternPtr> patterns_;
  154. };
  155. class NoneOf : public Pattern {
  156. public:
  157. NoneOf() { unique_name_ = std::to_string(g_id_++); }
  158. ~NoneOf() = default;
  159. explicit NoneOf(vector<PatternPtr> patterns) : patterns_(patterns) {
  160. unique_name_ = std::to_string(g_id_++) + "NoneOf";
  161. for (auto &iter : patterns) {
  162. unique_name_ = unique_name_ + "_" + iter->unique_name();
  163. }
  164. }
  165. MS_DECLARE_PARENT(NoneOf, Pattern);
  166. MatchResultPtr match(const AnfNodePtr &node) override;
  167. private:
  168. vector<PatternPtr> patterns_;
  169. };
  170. class Any : public Pattern {
  171. public:
  172. Any() { unique_name_ = std::to_string(g_id_++) + "_Any"; }
  173. ~Any() = default;
  174. MS_DECLARE_PARENT(Any, Pattern);
  175. MatchResultPtr match(const AnfNodePtr &node) override;
  176. };
  177. class NewTensor : public Pattern {
  178. public:
  179. NewTensor() { unique_name_ = std::to_string(g_id_++); }
  180. ~NewTensor() = default;
  181. explicit NewTensor(tensor::TensorPtr input_tensor) : input_tensor_(input_tensor) {
  182. unique_name_ = std::to_string(g_id_++) + "NewTensor";
  183. }
  184. MS_DECLARE_PARENT(NewTensor, Pattern);
  185. MatchResultPtr match(const AnfNodePtr &node) override {
  186. MS_LOG(EXCEPTION) << "Find NewTensor in pattern, NewTensor should only appear in the target.\n";
  187. }
  188. tensor::TensorPtr input_tensor() { return input_tensor_; }
  189. private:
  190. tensor::TensorPtr input_tensor_;
  191. };
  192. class NewParameter : public Pattern {
  193. public:
  194. NewParameter() { unique_name_ = std::to_string(g_id_++); }
  195. explicit NewParameter(string para_name, tensor::TensorPtr default_tensor, bool requires_grad, bool layerwise_parallel)
  196. : para_name_(para_name), requires_grad_(requires_grad), layerwise_parallel_(layerwise_parallel) {
  197. unique_name_ = std::to_string(g_id_++) + "NewParameter_" + para_name;
  198. default_tensor_ = std::make_shared<tensor::Tensor>(*default_tensor.get());
  199. built_ = false;
  200. }
  201. ~NewParameter() = default;
  202. MS_DECLARE_PARENT(NewParameter, Pattern);
  203. MatchResultPtr match(const AnfNodePtr &node) override {
  204. MS_LOG(EXCEPTION) << "Find NewParameter in pattern, NewParameter should only appear in the target.\n";
  205. }
  206. string para_name() { return para_name_; }
  207. tensor::TensorPtr default_tensor() { return default_tensor_; }
  208. bool requires_grad() { return requires_grad_; }
  209. bool layerwise_parallel() { return layerwise_parallel_; }
  210. bool built() { return built_; }
  211. void set_built(bool built) { built_ = built; }
  212. void reset() override { built_ = false; }
  213. bool should_last() { return last_across_passes_; }
  214. void set_last(bool last) { last_across_passes_ = last; }
  215. private:
  216. string para_name_;
  217. bool requires_grad_;
  218. bool layerwise_parallel_;
  219. bool last_across_passes_{false};
  220. bool built_;
  221. tensor::TensorPtr default_tensor_;
  222. };
  223. class Imm : public Pattern {
  224. public:
  225. Imm() { unique_name_ = std::to_string(g_id_++); }
  226. explicit Imm(int value) : value_(value) { unique_name_ = std::to_string(g_id_++) + "Imm_" + std::to_string(value); }
  227. ~Imm() = default;
  228. MS_DECLARE_PARENT(Imm, Pattern);
  229. MatchResultPtr match(const AnfNodePtr &node) override;
  230. int value() { return value_; }
  231. private:
  232. int value_;
  233. };
  234. class MatchResult {
  235. public:
  236. MatchResult() {}
  237. ~MatchResult() = default;
  238. void add_entry(PatternPtr pattern, AnfNodePtr node) { match_result_[pattern] = node; }
  239. const PatternNodeMap &result() { return match_result_; }
  240. AnfNodePtr get_node(const PatternPtr &pattern);
  241. void merge(const MatchResultPtr &other_result);
  242. void clear() { match_result_.clear(); }
  243. void dump() {
  244. MS_LOG(DEBUG) << "match_result_.size: " + std::to_string(match_result_.size()) + "\n";
  245. for (auto &iter : match_result_) {
  246. MS_LOG(DEBUG) << "Pattern : " + iter.first->unique_name() + " , node : " + iter.second->ToString() + "\n";
  247. }
  248. }
  249. private:
  250. PatternNodeMap match_result_;
  251. };
  252. } // namespace python_pass
  253. } // namespace opt
  254. } // namespace mindspore
  255. #endif // MINDSPORE_CCSRC_FRONTEND_OPTIMIZER_PATTERN_H_