tvm
expr.h
Go to the documentation of this file.
1 /*
2  * Licensed to the Apache Software Foundation (ASF) under one
3  * or more contributor license agreements. See the NOTICE file
4  * distributed with this work for additional information
5  * regarding copyright ownership. The ASF licenses this file
6  * to you under the Apache License, Version 2.0 (the
7  * "License"); you may not use this file except in compliance
8  * with the License. You may obtain a copy of the License at
9  *
10  * http://www.apache.org/licenses/LICENSE-2.0
11  *
12  * Unless required by applicable law or agreed to in writing,
13  * software distributed under the License is distributed on an
14  * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15  * KIND, either express or implied. See the License for the
16  * specific language governing permissions and limitations
17  * under the License.
18  */
19 
24 // Acknowledgement: Many low-level IR nodes originate from Halide.
25 #ifndef TVM_TIR_EXPR_H_
26 #define TVM_TIR_EXPR_H_
27 
28 #include <tvm/ir/expr.h>
29 #include <tvm/node/functor.h>
30 #include <tvm/node/node.h>
35 #include <tvm/runtime/data_type.h>
36 #include <tvm/tir/buffer.h>
37 #include <tvm/tir/var.h>
38 
39 #include <algorithm>
40 #include <iostream>
41 #include <limits>
42 #include <string>
43 #include <unordered_map>
44 #include <utility>
45 
46 namespace tvm {
47 namespace tir {
48 
51 
53 class StringImmNode : public PrimExprNode {
54  public:
57 
59  v->Visit("dtype", &dtype);
60  v->Visit("value", &value);
61  v->Visit("span", &span);
62  }
63 
64  bool SEqualReduce(const StringImmNode* other, SEqualReducer equal) const {
65  return equal(value, other->value);
66  }
67 
68  void SHashReduce(SHashReducer hash_reduce) const { hash_reduce(value); }
69 
70  static constexpr const char* _type_key = "tir.StringImm";
72 };
73 
78 class StringImm : public PrimExpr {
79  public:
80  TVM_DLL StringImm(String value, Span span = Span());
83 };
84 
89 class CastNode : public PrimExprNode {
90  public:
93 
95  v->Visit("dtype", &dtype);
96  v->Visit("value", &value);
97  v->Visit("span", &span);
98  }
99 
100  bool SEqualReduce(const CastNode* other, SEqualReducer equal) const {
101  return equal(dtype, other->dtype) && equal(value, other->value);
102  }
103 
104  void SHashReduce(SHashReducer hash_reduce) const {
105  hash_reduce(dtype);
106  hash_reduce(value);
107  }
108 
109  static constexpr const char* _type_key = "tir.Cast";
111 };
112 
117 class Cast : public PrimExpr {
118  public:
119  TVM_DLL Cast(DataType dtype, PrimExpr value, Span span = Span());
122 };
123 
128 template <typename T>
129 class BinaryOpNode : public PrimExprNode {
130  public:
135 
137  v->Visit("dtype", &(this->dtype));
138  v->Visit("a", &a);
139  v->Visit("b", &b);
140  v->Visit("span", &span);
141  }
142 
143  bool SEqualReduce(const T* other, SEqualReducer equal) const {
144  return equal(dtype, other->dtype) && equal(a, other->a) && equal(b, other->b);
145  }
146 
147  void SHashReduce(SHashReducer hash_reduce) const {
148  hash_reduce(dtype);
149  hash_reduce(a);
150  hash_reduce(b);
151  }
152 
154 };
155 
157 class AddNode : public BinaryOpNode<AddNode> {
158  public:
159  static constexpr const char* _type_key = "tir.Add";
160 };
161 
166 class Add : public PrimExpr {
167  public:
168  TVM_DLL Add(PrimExpr a, PrimExpr b, Span span = Span());
171 };
172 
174 class SubNode : public BinaryOpNode<SubNode> {
175  public:
176  static constexpr const char* _type_key = "tir.Sub";
177 };
178 
183 class Sub : public PrimExpr {
184  public:
185  TVM_DLL Sub(PrimExpr a, PrimExpr b, Span span = Span());
188 };
189 
191 class MulNode : public BinaryOpNode<MulNode> {
192  public:
193  static constexpr const char* _type_key = "tir.Mul";
194 };
195 
200 class Mul : public PrimExpr {
201  public:
202  TVM_DLL Mul(PrimExpr a, PrimExpr b, Span span = Span());
205 };
206 
211 class DivNode : public BinaryOpNode<DivNode> {
212  public:
213  static constexpr const char* _type_key = "tir.Div";
214 };
215 
220 class Div : public PrimExpr {
221  public:
222  TVM_DLL Div(PrimExpr a, PrimExpr b, Span span = Span());
225 };
226 
231 class ModNode : public BinaryOpNode<ModNode> {
232  public:
233  static constexpr const char* _type_key = "tir.Mod";
234 };
235 
240 class Mod : public PrimExpr {
241  public:
242  TVM_DLL Mod(PrimExpr a, PrimExpr b, Span span = Span());
245 };
246 
248 class FloorDivNode : public BinaryOpNode<FloorDivNode> {
249  public:
250  static constexpr const char* _type_key = "tir.FloorDiv";
251 };
252 
257 class FloorDiv : public PrimExpr {
258  public:
259  TVM_DLL FloorDiv(PrimExpr a, PrimExpr b, Span span = Span());
262 };
263 
265 class FloorModNode : public BinaryOpNode<FloorModNode> {
266  public:
267  static constexpr const char* _type_key = "tir.FloorMod";
268 };
269 
274 class FloorMod : public PrimExpr {
275  public:
276  TVM_DLL FloorMod(PrimExpr a, PrimExpr b, Span span = Span());
279 };
280 
282 class MinNode : public BinaryOpNode<MinNode> {
283  public:
284  static constexpr const char* _type_key = "tir.Min";
285 };
286 
291 class Min : public PrimExpr {
292  public:
293  TVM_DLL Min(PrimExpr a, PrimExpr b, Span span = Span());
296 };
297 
299 class MaxNode : public BinaryOpNode<MaxNode> {
300  public:
301  static constexpr const char* _type_key = "tir.Max";
302 };
303 
308 class Max : public PrimExpr {
309  public:
310  TVM_DLL Max(PrimExpr a, PrimExpr b, Span span = Span());
313 };
314 
319 template <typename T>
320 class CmpOpNode : public PrimExprNode {
321  public:
326 
328  v->Visit("dtype", &(this->dtype));
329  v->Visit("a", &a);
330  v->Visit("b", &b);
331  v->Visit("span", &span);
332  }
333 
334  bool SEqualReduce(const T* other, SEqualReducer equal) const {
335  return equal(dtype, other->dtype) && equal(a, other->a) && equal(b, other->b);
336  }
337 
338  void SHashReduce(SHashReducer hash_reduce) const {
339  hash_reduce(dtype);
340  hash_reduce(a);
341  hash_reduce(b);
342  }
343 
345 };
346 
348 class EQNode : public CmpOpNode<EQNode> {
349  public:
350  static constexpr const char* _type_key = "tir.EQ";
351 };
352 
357 class EQ : public PrimExpr {
358  public:
359  TVM_DLL EQ(PrimExpr a, PrimExpr b, Span span = Span());
362 };
363 
365 class NENode : public CmpOpNode<NENode> {
366  public:
367  static constexpr const char* _type_key = "tir.NE";
368 };
369 
374 class NE : public PrimExpr {
375  public:
376  TVM_DLL NE(PrimExpr a, PrimExpr b, Span span = Span());
379 };
380 
382 class LTNode : public CmpOpNode<LTNode> {
383  public:
384  static constexpr const char* _type_key = "tir.LT";
385 };
386 
391 class LT : public PrimExpr {
392  public:
393  TVM_DLL LT(PrimExpr a, PrimExpr b, Span span = Span());
396 };
397 
399 struct LENode : public CmpOpNode<LENode> {
400  public:
401  static constexpr const char* _type_key = "tir.LE";
402 };
403 
408 class LE : public PrimExpr {
409  public:
410  TVM_DLL LE(PrimExpr a, PrimExpr b, Span span = Span());
413 };
414 
416 class GTNode : public CmpOpNode<GTNode> {
417  public:
418  static constexpr const char* _type_key = "tir.GT";
419 };
420 
425 class GT : public PrimExpr {
426  public:
427  TVM_DLL GT(PrimExpr a, PrimExpr b, Span span = Span());
430 };
431 
433 class GENode : public CmpOpNode<GENode> {
434  public:
435  static constexpr const char* _type_key = "tir.GE";
436 };
437 
442 class GE : public PrimExpr {
443  public:
444  TVM_DLL GE(PrimExpr a, PrimExpr b, Span span = Span());
447 };
448 
450 class AndNode : public PrimExprNode {
451  public:
456 
458  v->Visit("dtype", &(this->dtype));
459  v->Visit("a", &a);
460  v->Visit("b", &b);
461  v->Visit("span", &span);
462  }
463 
464  bool SEqualReduce(const AndNode* other, SEqualReducer equal) const {
465  return equal(dtype, other->dtype) && equal(a, other->a) && equal(b, other->b);
466  }
467 
468  void SHashReduce(SHashReducer hash_reduce) const {
469  hash_reduce(dtype);
470  hash_reduce(a);
471  hash_reduce(b);
472  }
473 
474  static constexpr const char* _type_key = "tir.And";
476 };
477 
482 class And : public PrimExpr {
483  public:
484  TVM_DLL And(PrimExpr a, PrimExpr b, Span span = Span());
487 };
488 
490 class OrNode : public PrimExprNode {
491  public:
496 
498  v->Visit("dtype", &dtype);
499  v->Visit("a", &a);
500  v->Visit("b", &b);
501  v->Visit("span", &span);
502  }
503 
504  bool SEqualReduce(const OrNode* other, SEqualReducer equal) const {
505  return equal(dtype, other->dtype) && equal(a, other->a) && equal(b, other->b);
506  }
507 
508  void SHashReduce(SHashReducer hash_reduce) const {
509  hash_reduce(dtype);
510  hash_reduce(a);
511  hash_reduce(b);
512  }
513 
514  static constexpr const char* _type_key = "tir.Or";
516 };
517 
522 class Or : public PrimExpr {
523  public:
524  TVM_DLL Or(PrimExpr a, PrimExpr b, Span span = Span());
527 };
528 
530 class NotNode : public PrimExprNode {
531  public:
534 
536  v->Visit("dtype", &dtype);
537  v->Visit("a", &a);
538  v->Visit("span", &span);
539  }
540 
541  bool SEqualReduce(const NotNode* other, SEqualReducer equal) const {
542  return equal(dtype, other->dtype) && equal(a, other->a);
543  }
544 
545  void SHashReduce(SHashReducer hash_reduce) const {
546  hash_reduce(dtype);
547  hash_reduce(a);
548  }
549 
550  static constexpr const char* _type_key = "tir.Not";
552 };
553 
558 class Not : public PrimExpr {
559  public:
560  TVM_DLL Not(PrimExpr a, Span span = Span());
563 };
564 
572 class SelectNode : public PrimExprNode {
573  public:
580 
582  v->Visit("dtype", &dtype);
583  v->Visit("condition", &condition);
584  v->Visit("true_value", &true_value);
585  v->Visit("false_value", &false_value);
586  v->Visit("span", &span);
587  }
588 
589  bool SEqualReduce(const SelectNode* other, SEqualReducer equal) const {
590  return equal(dtype, other->dtype) && equal(condition, other->condition) &&
591  equal(true_value, other->true_value) && equal(false_value, other->false_value);
592  }
593 
594  void SHashReduce(SHashReducer hash_reduce) const {
595  hash_reduce(dtype);
596  hash_reduce(condition);
597  hash_reduce(true_value);
598  hash_reduce(false_value);
599  }
600 
601  static constexpr const char* _type_key = "tir.Select";
603 };
604 
609 class Select : public PrimExpr {
610  public:
611  TVM_DLL Select(PrimExpr condition, PrimExpr true_value, PrimExpr false_value, Span span = Span());
612 
615 };
616 
627 class BufferLoadNode : public PrimExprNode {
628  public:
633 
635  v->Visit("dtype", &(this->dtype));
636  v->Visit("buffer", &buffer);
637  v->Visit("indices", &indices);
638  v->Visit("span", &span);
639  }
640 
641  bool SEqualReduce(const BufferLoadNode* other, SEqualReducer equal) const {
642  return equal(dtype, other->dtype) && equal(buffer, other->buffer) &&
643  equal(indices, other->indices);
644  }
645 
646  void SHashReduce(SHashReducer hash_reduce) const {
647  hash_reduce(dtype);
648  hash_reduce(buffer);
649  hash_reduce(indices);
650  }
651 
652  static constexpr const char* _type_key = "tir.BufferLoad";
654 
655  private:
665  void LegalizeDType();
666  friend class BufferLoad;
667  friend class CustomDatatypesLowerer;
668  friend class VectorTypeRewriter;
669  friend class Vectorizer;
670 };
671 
676 class BufferLoad : public PrimExpr {
677  public:
678  TVM_DLL explicit BufferLoad(Buffer buffer, Array<PrimExpr> indices, Span span = Span());
681 };
682 
693  public:
698 
700  v->Visit("dtype", &(this->dtype));
701  v->Visit("producer", &producer);
702  v->Visit("indices", &indices);
703  v->Visit("span", &span);
704  }
705 
706  bool SEqualReduce(const ProducerLoadNode* other, SEqualReducer equal) const {
707  return equal(dtype, other->dtype) && equal(producer, other->producer) &&
708  equal(indices, other->indices);
709  }
710 
711  void SHashReduce(SHashReducer hash_reduce) const {
712  hash_reduce(dtype);
713  hash_reduce(producer);
714  hash_reduce(indices);
715  }
716 
717  static constexpr const char* _type_key = "tir.ProducerLoad";
719 };
720 
725 class ProducerLoad : public PrimExpr {
726  public:
727  TVM_DLL explicit ProducerLoad(DataProducer producer, Array<PrimExpr> indices, Span span = Span());
728 
731 };
732 
748 class LoadNode : public PrimExprNode {
749  public:
756 
758  v->Visit("dtype", &dtype);
759  v->Visit("buffer_var", &buffer_var);
760  v->Visit("index", &index);
761  v->Visit("predicate", &predicate);
762  v->Visit("span", &span);
763  }
764 
765  bool SEqualReduce(const LoadNode* other, SEqualReducer equal) const {
766  return equal(dtype, other->dtype) && equal(buffer_var, other->buffer_var) &&
767  equal(index, other->index) && equal(predicate, other->predicate);
768  }
769 
770  void SHashReduce(SHashReducer hash_reduce) const {
771  hash_reduce(dtype);
772  hash_reduce(buffer_var);
773  hash_reduce(index);
774  hash_reduce(predicate);
775  }
776 
777  static constexpr const char* _type_key = "tir.Load";
779 };
780 
785 class Load : public PrimExpr {
786  public:
787  TVM_DLL Load(DataType dtype, Var buffer_var, PrimExpr index, PrimExpr predicate,
788  Span span = Span());
791 };
792 
802 class RampNode : public PrimExprNode {
803  public:
809  int lanes;
810 
812  v->Visit("dtype", &dtype);
813  v->Visit("base", &base);
814  v->Visit("stride", &stride);
815  v->Visit("lanes", &lanes);
816  v->Visit("span", &span);
817  }
818 
819  bool SEqualReduce(const RampNode* other, SEqualReducer equal) const {
820  return equal(dtype, other->dtype) && equal(base, other->base) && equal(stride, other->stride) &&
821  equal(lanes, other->lanes);
822  }
823 
824  void SHashReduce(SHashReducer hash_reduce) const {
825  hash_reduce(dtype);
826  hash_reduce(base);
827  hash_reduce(stride);
828  hash_reduce(lanes);
829  }
830 
831  static constexpr const char* _type_key = "tir.Ramp";
833 };
834 
839 class Ramp : public PrimExpr {
840  public:
841  TVM_DLL Ramp(PrimExpr base, PrimExpr stride, int lanes, Span span = Span());
844 };
845 
847 class BroadcastNode : public PrimExprNode {
848  public:
852  int lanes;
853 
855  v->Visit("dtype", &dtype);
856  v->Visit("value", &value);
857  v->Visit("lanes", &lanes);
858  v->Visit("span", &span);
859  }
860 
861  bool SEqualReduce(const BroadcastNode* other, SEqualReducer equal) const {
862  return equal(dtype, other->dtype) && equal(value, other->value) && equal(lanes, other->lanes);
863  }
864 
865  void SHashReduce(SHashReducer hash_reduce) const {
866  hash_reduce(dtype);
867  hash_reduce(value);
868  hash_reduce(lanes);
869  }
870 
871  static constexpr const char* _type_key = "tir.Broadcast";
873 };
874 
879 class Broadcast : public PrimExpr {
880  public:
881  TVM_DLL Broadcast(PrimExpr value, int lanes, Span span = Span());
884 };
885 
889 class LetNode : public PrimExprNode {
890  public:
897 
899  v->Visit("dtype", &dtype);
900  v->Visit("var", &var);
901  v->Visit("value", &value);
902  v->Visit("body", &body);
903  v->Visit("span", &span);
904  }
905 
906  bool SEqualReduce(const LetNode* other, SEqualReducer equal) const {
907  return equal(dtype, other->dtype) && equal.DefEqual(var, other->var) &&
908  equal(value, other->value) && equal(body, other->body);
909  }
910 
911  void SHashReduce(SHashReducer hash_reduce) const {
912  hash_reduce(dtype);
913  hash_reduce.DefHash(var);
914  hash_reduce(value);
915  hash_reduce(body);
916  }
917 
918  static constexpr const char* _type_key = "tir.Let";
920 };
921 
926 class Let : public PrimExpr {
927  public:
928  TVM_DLL Let(Var var, PrimExpr value, PrimExpr body, Span span = Span());
931 };
932 
936 class CallNode : public PrimExprNode {
937  public:
945 
949  v->Visit("dtype", &dtype);
950  v->Visit("op", &op);
951  v->Visit("args", &args);
952  v->Visit("span", &span);
953  }
954 
955  bool SEqualReduce(const CallNode* other, SEqualReducer equal) const {
956  return equal(dtype, other->dtype) && equal(op, other->op) && equal(args, other->args);
957  }
958 
959  void SHashReduce(SHashReducer hash_reduce) const {
960  hash_reduce(dtype);
961  hash_reduce(op);
962  hash_reduce(args);
963  }
964 
965  static constexpr const char* _type_key = "tir.Call";
967 };
968 
973 class Call : public PrimExpr {
974  public:
975  TVM_DLL Call(DataType dtype, RelayExpr op, Array<PrimExpr> args, Span span = Span());
978 };
979 
985 class ShuffleNode : public PrimExprNode {
986  public:
991 
993  v->Visit("dtype", &dtype);
994  v->Visit("vectors", &vectors);
995  v->Visit("indices", &indices);
996  v->Visit("span", &span);
997  }
998 
999  bool SEqualReduce(const ShuffleNode* other, SEqualReducer equal) const {
1000  return equal(dtype, other->dtype) && equal(vectors, other->vectors) &&
1001  equal(indices, other->indices);
1002  }
1003 
1004  void SHashReduce(SHashReducer hash_reduce) const {
1005  hash_reduce(dtype);
1006  hash_reduce(vectors);
1007  hash_reduce(indices);
1008  }
1009 
1010  static constexpr const char* _type_key = "tir.Shuffle";
1012 };
1013 
1018 class Shuffle : public PrimExpr {
1019  public:
1020  TVM_DLL Shuffle(Array<PrimExpr> vectors, Array<PrimExpr> indices, Span span = Span());
1021  TVM_DLL static PrimExpr Concat(Array<PrimExpr> vectors, Span span = Span());
1022  TVM_DLL static PrimExpr ExtractElement(PrimExpr vector, int index, Span span = Span());
1023 
1026 };
1027 
1028 // Reduce operator
1033 class CommReducerNode : public Object {
1034  public:
1048  Array<PrimExpr> operator()(Array<PrimExpr> a, Array<PrimExpr> b) const;
1053  mutable Span span;
1054 
1056  v->Visit("lhs", &lhs);
1057  v->Visit("rhs", &rhs);
1058  v->Visit("result", &result);
1059  v->Visit("identity_element", &identity_element);
1060  v->Visit("span", &span);
1061  }
1062 
1063  bool SEqualReduce(const CommReducerNode* other, SEqualReducer equal) const {
1064  return equal.DefEqual(lhs, other->lhs) && equal.DefEqual(rhs, other->rhs) &&
1065  equal(result, other->result) && equal(identity_element, other->identity_element);
1066  }
1067 
1068  void SHashReduce(SHashReducer hash_reduce) const {
1069  hash_reduce.DefHash(lhs);
1070  hash_reduce.DefHash(rhs);
1071  hash_reduce(result);
1072  hash_reduce(identity_element);
1073  }
1074 
1075  static constexpr const char* _type_key = "tir.CommReducer";
1076  static constexpr const bool _type_has_method_sequal_reduce = true;
1077  static constexpr const bool _type_has_method_shash_reduce = true;
1079 };
1080 
1085 class CommReducer : public ObjectRef {
1086  public:
1087  TVM_DLL CommReducer(Array<Var> lhs, Array<Var> rhs, Array<PrimExpr> result,
1088  Array<PrimExpr> identity_element, Span span = Span());
1089 
1091 };
1092 
1094 class ReduceNode : public PrimExprNode {
1095  public:
1111 
1113  v->Visit("dtype", &dtype);
1114  v->Visit("combiner", &combiner);
1115  v->Visit("source", &source);
1116  v->Visit("init", &init);
1117  v->Visit("axis", &axis);
1118  v->Visit("condition", &condition);
1119  v->Visit("value_index", &value_index);
1120  v->Visit("span", &span);
1121  }
1122 
1123  bool SEqualReduce(const ReduceNode* other, SEqualReducer equal) const {
1124  // check axis first so IterVars can define the necessary variables.
1125  return equal(dtype, other->dtype) && equal(axis, other->axis) &&
1126  equal(combiner, other->combiner) && equal(source, other->source) &&
1127  equal(init, other->init) && equal(condition, other->condition) &&
1128  equal(value_index, other->value_index);
1129  }
1130 
1131  void SHashReduce(SHashReducer hash_reduce) const {
1132  hash_reduce(dtype);
1133  hash_reduce(axis);
1134  hash_reduce(combiner);
1135  hash_reduce(source);
1136  hash_reduce(init);
1137  hash_reduce(condition);
1138  hash_reduce(value_index);
1139  }
1140 
1141  static constexpr const char* _type_key = "tir.Reduce";
1143 };
1144 
1149 class Reduce : public PrimExpr {
1150  public:
1151  TVM_DLL Reduce(CommReducer combiner, Array<PrimExpr> src, Array<IterVar> rdom, PrimExpr condition,
1152  int value_index, Array<PrimExpr> init, Span span = Span());
1153 
1156 };
1157 
1159 class AnyNode : public PrimExprNode {
1160  public:
1162  v->Visit("dtype", &dtype);
1163  v->Visit("span", &span);
1164  }
1165 
1166  bool SEqualReduce(const AnyNode* other, SEqualReducer equal) const {
1167  return equal(dtype, other->dtype);
1168  }
1169 
1170  void SHashReduce(SHashReducer hash_reduce) const {}
1171 
1173  Var ToVar() const { return Var("any_dim", DataType::Int(32)); }
1174 
1176  SizeVar ToSizeVar() const { return SizeVar("any_dim", DataType::Int(32)); }
1177 
1178  static constexpr const char* _type_key = "tir.Any";
1180 };
1181 
1186 class Any : public PrimExpr {
1187  public:
1188  TVM_DLL Any(Span span = Span());
1189 
1192 };
1193 
1194 /*
1195  * \brief Template function to convert Map to unordered_map
1196  * Sometimes useful for API gluing when internal uses unordered_map
1197  * \param dmap The container map
1198  * \return The corresponding unordered_map.
1199  * \tparam K the key of the Map.
1200  * \tparam V the value of the Map.
1201  */
1202 template <typename K, typename V>
1203 inline std::unordered_map<K, V> as_unordered_map(const Map<K, V>& dmap) {
1204  std::unordered_map<K, V> ret;
1205  for (auto kv : dmap) {
1206  ret[kv.first] = kv.second;
1207  }
1208  return ret;
1209 }
1210 } // namespace tir
1211 } // namespace tvm
1212 
1213 namespace std {
1214 template <>
1215 struct hash<::tvm::tir::IterVar> : public ::tvm::ObjectPtrHash {};
1216 } // namespace std
1217 #endif // TVM_TIR_EXPR_H_
Managed reference to MulNode.
Definition: expr.h:200
tvm::Span Span
Definition: base.h:65
Let binding. Bind var to value then evaluate body.
Definition: expr.h:889
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:457
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:1161
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:1170
bool DefEqual(const ObjectRef &lhs, const ObjectRef &rhs)
Reduce condition to comparison of two definitions, where free vars can be mapped. ...
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:338
Managed reference to CommReducerNode.
Definition: expr.h:1085
PrimExpr body
The result expression.
Definition: expr.h:896
Managed reference to CastNode.
Definition: expr.h:117
Var var
The variable.
Definition: expr.h:892
PrimExpr b
The right operand.
Definition: expr.h:134
PrimExpr predicate
The predicate to mask which lanes would be loaded.
Definition: expr.h:755
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:757
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:811
Definitions and helper macros for IR/AST nodes.
PrimExpr b
The right operand.
Definition: expr.h:495
Managed reference to ReduceNode.
Definition: expr.h:1149
Runtime String container types.
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:898
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:959
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:594
Array< Var > rhs
The right argument of reducer.
Definition: expr.h:1038
Var buffer_var
The buffer variable.
Definition: expr.h:751
A Reducer class to reduce the structural equality result of two objects.
Definition: structural_equal.h:124
PrimExpr a
The left operand.
Definition: expr.h:323
static constexpr const char * _type_key
Definition: expr.h:70
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:711
Base expr nodes in TVM.
static constexpr const bool _type_has_method_shash_reduce
Definition: expr.h:59
Managed reference to LTNode.
Definition: expr.h:391
PrimExpr a
The left operand.
Definition: expr.h:132
runtime implementation for LibTorch/TorchScript.
Definition: analyzer.h:36
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:699
A Reducer class to reduce the structural hash value.
Definition: structural_hash.h:102
PrimExpr value
The value to be binded.
Definition: expr.h:894
Array< PrimExpr > init
The init operand.
Definition: expr.h:1101
Variables in the TIR.
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:824
String constants, only used in asserts.
Definition: expr.h:53
PrimExpr equal(PrimExpr a, PrimExpr b, Span span=Span())
equal
PrimExpr condition
Predicate on the reduction Only add the body to reduction if condition is true.
Definition: expr.h:1108
SizeVar ToSizeVar() const
Convert to SizeVar.
Definition: expr.h:1176
a named variable in TIR
Definition: var.h:88
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:58
Constant floating point literals in the program.
Definition: expr.h:536
Iteration Variable, represents an iteration over an integer interval.
Definition: var.h:301
PrimExpr true_value
value to be returned when condition is true.
Definition: expr.h:577
Managed reference to MinNode.
Definition: expr.h:291
PrimExpr b
The right operand.
Definition: expr.h:455
Definition: loop_state.h:456
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:646
a * b
Definition: expr.h:191
Managed reference to GTNode.
Definition: expr.h:425
bool SEqualReduce(const CallNode *other, SEqualReducer equal) const
Definition: expr.h:955
Managed reference to CallNode.
Definition: expr.h:973
Managed reference to GENode.
Definition: expr.h:442
Array< PrimExpr > identity_element
The identity element of reducer, which leaves other elements unchanged when combined with it...
Definition: expr.h:1046
int lanes
The number of lanes.
Definition: expr.h:852
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:1055
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:327
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:992
bool SEqualReduce(const LoadNode *other, SEqualReducer equal) const
Definition: expr.h:765
bool SEqualReduce(const T *other, SEqualReducer equal) const
Definition: expr.h:143
base class of all object containers.
Definition: object.h:167
Any shape.
Definition: expr.h:1159
Span span
Span that points to the original source code. Reserved debug information.
Definition: expr.h:1053
bool SEqualReduce(const LetNode *other, SEqualReducer equal) const
Definition: expr.h:906
Shuffle instruction. vec = concat(vectors) result = (vec[indices[0]], vec[indices[1]] ...
Definition: expr.h:985
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:104
std::unordered_map< K, V > as_unordered_map(const Map< K, V > &dmap)
Definition: expr.h:1203
Managed reference to FloorModNode.
Definition: expr.h:274
a + b
Definition: expr.h:157
Managed reference to LENode.
Definition: expr.h:408
bool SEqualReduce(const OrNode *other, SEqualReducer equal) const
Definition: expr.h:504
Constant integer literals in the program.
Definition: expr.h:489
PrimExpr base
The base value.
Definition: expr.h:805
PrimExpr index
The index locations to be loaded.
Definition: expr.h:753
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:1112
Var ToVar() const
Convert to var.
Definition: expr.h:1173
PrimExpr a
The input operand.
Definition: expr.h:533
a || b
Definition: expr.h:490
Runtime Array container types.
tvm::tir::Any Any
Definition: type.h:45
Visitor class to get the attributes of an AST/IR node. The content is going to be called for each fie...
Definition: reflection.h:52
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:497
bool SEqualReduce(const SelectNode *other, SEqualReducer equal) const
Definition: expr.h:589
Array< PrimExpr > vectors
the input vectors.
Definition: expr.h:988
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:770
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:68
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:948
Managed reference to AnyNode.
Definition: expr.h:1186
Definition: span.h:115
Managed reference to DivNode.
Definition: expr.h:220
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:147
Managed reference to NENode.
Definition: expr.h:374
Span span
Span that points to the original source code. Reserved debug information.
Definition: expr.h:55
PrimExpr stride
The stride of each step.
Definition: expr.h:807
Managed reference to BroadcastNode.
Definition: expr.h:879
Runtime primitive data type.
Definition: data_type.h:41
bool SEqualReduce(const CommReducerNode *other, SEqualReducer equal) const
Definition: expr.h:1063
Managed reference to ModNode.
Definition: expr.h:240
Base template to implement comparison ops.
Definition: expr.h:320
CommReducer combiner
The commutative combiner.
Definition: expr.h:1097
Array< PrimExpr > source
The source operand.
Definition: expr.h:1099
bool SEqualReduce(const NotNode *other, SEqualReducer equal) const
Definition: expr.h:541
PrimExpr a
The left operand.
Definition: expr.h:453
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:535
Array, container representing a contiguous sequence of ObjectRefs.
Definition: array.h:289
ObjectRef hash functor.
Definition: object.h:624
PrimExpr b
The right operand.
Definition: expr.h:325
static constexpr const bool _type_has_method_sequal_reduce
Definition: expr.h:58
bool SEqualReduce(const T *other, SEqualReducer equal) const
Definition: expr.h:334
Managed reference to AddNode.
Definition: expr.h:166
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:545
bool SEqualReduce(const ProducerLoadNode *other, SEqualReducer equal) const
Definition: expr.h:706
Managed reference to LetNode.
Definition: expr.h:926
Create a vector where all the elements are value.
Definition: expr.h:847
PrimExpr value
Original data type.
Definition: expr.h:92
A commutative reducer node to represent a commutative binary operator with identity element...
Definition: expr.h:1033
Array< PrimExpr > indices
The indices of each element.
Definition: expr.h:990
Managed reference to OrNode.
Definition: expr.h:522
a > b
Definition: expr.h:416
tvm::IntImmNode IntImmNode
Definition: expr.h:49
int value_index
the index of this reduce node
Definition: expr.h:1110
Cast value from one data type to another.
Definition: expr.h:89
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:1068
Reference to string objects.
Definition: string.h:97
LetFrame Let(Var var, PrimExpr value)
The let binding.
Managed reference to RelayExprNode.
Definition: expr.h:431
bool SEqualReduce(const ShuffleNode *other, SEqualReducer equal) const
Definition: expr.h:999
TVM_DECLARE_FINAL_OBJECT_INFO(StringImmNode, PrimExprNode)
Managed reference to MaxNode.
Definition: expr.h:308
bool SEqualReduce(const CastNode *other, SEqualReducer equal) const
Definition: expr.h:100
#define TVM_DEFINE_OBJECT_REF_METHODS(TypeName, ParentType, ObjectName)
Definition: object.h:713
bool SEqualReduce(const BroadcastNode *other, SEqualReducer equal) const
Definition: expr.h:861
Managed reference to LoadNode.
Definition: expr.h:785
Array< Var > lhs
The left argument of reducer.
Definition: expr.h:1036
Managed reference to FloorDivNode.
Definition: expr.h:257
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:94
tvm::FloatImmNode FloatImmNode
Definition: expr.h:50
Array< PrimExpr > indices
The location arguments.
Definition: expr.h:697
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:634
RelayExpr op
The operator(function) being invoked.
Definition: expr.h:944
bool SEqualReduce(const RampNode *other, SEqualReducer equal) const
Definition: expr.h:819
Load the value from buffer_var.
Definition: expr.h:748
Var var(std::string name_hint, DataType t=DataType::Int(32))
Construct a new Var expression.
Defines the Functor data structures.
Managed reference to SubNode.
Definition: expr.h:183
Base class of all object reference.
Definition: object.h:511
#define TVM_DEFINE_OBJECT_REF_COW_METHOD(ObjectName)
Define CopyOnWrite function in an ObjectRef.
Definition: object.h:785
!a
Definition: expr.h:530
a named variable represents a tensor index size
Definition: var.h:144
max(a, b)
Definition: expr.h:299
Managed reference to DataProducerNode.
Definition: buffer.h:293
bool SEqualReduce(const AndNode *other, SEqualReducer equal) const
Definition: expr.h:464
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:911
Buffer is a symbolic n-darray structure. It is a composition of primitive symbolic types...
Definition: buffer.h:160
bool SEqualReduce(const AnyNode *other, SEqualReducer equal) const
Definition: expr.h:1166
Array< IterVar > axis
The reduction axis.
Definition: expr.h:1103
Symbolic n-dimensional array, to represent a memory buffer.
String value
The constant value content.
Definition: expr.h:56
PrimExpr false_value
value to be returned when condition is false.
Definition: expr.h:579
Managed reference to SelectNode.
Definition: expr.h:609
Managed reference to RampNode.
Definition: expr.h:839
Array< PrimExpr > indices
The indices location to be loaded.
Definition: expr.h:632
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:581
Managed reference to ProducerLoadNode.
Definition: expr.h:725
Construct a vector with lanes elements where its i-th element equals base + i * stride. This is useful to construct a index for a continuous vector load.
Definition: expr.h:802
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:136
Array< PrimExpr > result
The result of reducer.
Definition: expr.h:1040
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:508
DataType dtype
The runtime data type of the primitive expression.
Definition: expr.h:101
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:1131
min(a, b)
Definition: expr.h:282
Map container of NodeRef->NodeRef in DSL graph. Map implements copy on write semantics, which means map is mutable but copy will happen when array is referenced in more than two places.
Definition: map.h:1271
PrimExpr ret(PrimExpr value, Span span=Span())
Return the value.
The remainder of the floordiv.
Definition: expr.h:265
Managed reference to AndNode.
Definition: expr.h:482
Runtime Map container types.
a == b
Definition: expr.h:348
a && b
Definition: expr.h:450
DataProducer producer
The buffer producer.
Definition: expr.h:695
Base template to implement binary ops.
Definition: expr.h:129
Managed reference to ShuffleNode.
Definition: expr.h:1018
Managed reference to NotNode.
Definition: expr.h:558
a < b
Definition: expr.h:382
Load value from the high dimension buffer.
Definition: expr.h:627
bool SEqualReduce(const ReduceNode *other, SEqualReducer equal) const
Definition: expr.h:1123
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:468
bool SEqualReduce(const BufferLoadNode *other, SEqualReducer equal) const
Definition: expr.h:641
PrimExpr value
The base value.
Definition: expr.h:850
a % b in the C semnatics.
Definition: expr.h:231
Reference to PrimExprNode.
Definition: expr.h:112
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:1004
PrimExpr a
The left operand.
Definition: expr.h:493
Floor division, floor(a/b)
Definition: expr.h:248
a - b
Definition: expr.h:174
Array< PrimExpr > args
The arguments.
Definition: expr.h:947
Call node.
Definition: expr.h:936
Managed reference to StringImmNode.
Definition: expr.h:78
Buffer buffer
The buffer variable.
Definition: expr.h:630
return true_value if condition is true, otherwise return false_value.
Definition: expr.h:572
Reduction operator operator.
Definition: expr.h:1094
Var Reduce(Range dom, PrimExpr binding, DataType dtype=DataType::Int(32))
The reduced block axis defining function.
#define TVM_DEFINE_NOTNULLABLE_OBJECT_REF_METHODS(TypeName, ParentType, ObjectName)
Definition: object.h:728
a / b in the C semnatics.
Definition: expr.h:211
a <= b
Definition: expr.h:399
Managed reference to EQNode.
Definition: expr.h:357
Load value from the result produced by the producer.
Definition: expr.h:692
void SHashReduce(SHashReducer hash_reduce) const
Definition: expr.h:865
bool SEqualReduce(const StringImmNode *other, SEqualReducer equal) const
Definition: expr.h:64
Array< T > Concat(Array< T > lhs, const Array< T > &rhs)
Concat two Arrays.
Definition: array.h:840
a != b
Definition: expr.h:365
Managed reference to BufferLoadNode.
Definition: expr.h:676
static DataType Int(int bits, int lanes=1)
Construct an int type.
Definition: data_type.h:164
void DefHash(const ObjectRef &key) const
Push hash of key to the current sequence of hash values.
Definition: structural_hash.h:179
Base node of all primitive expressions.
Definition: expr.h:85
int lanes
Total number of lanes.
Definition: expr.h:809
a >= b
Definition: expr.h:433
void VisitAttrs(AttrVisitor *v)
Definition: expr.h:854
PrimExpr condition
The condition.
Definition: expr.h:575