int_set.cc 8.98 KB
Newer Older
1 2 3 4 5 6 7 8 9
/*!
 *  Copyright (c) 2016 by Contributors
 * \file int_set.cc
 * \brief The integer set functions
 */
#include <tvm/ir.h>
#include "./int_set.h"

namespace tvm {
10
namespace schedule {
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124

using namespace ir;

/*!
 * \brief Internal node container of int set.
 */
class IntSetNode : public Node {
 public:
  /*! \brief The base range scope */
  Range base;
  /*! \brief additional strided domain */
  Array<Range> domain;
  /*! \brief The stride of each strided domain */
  Array<Expr> stride;
  /*!
   * \brief The concrete set,
   *  used when concrete execution is enabled.
   */
  std::vector<int32_t> concrete;

  void VisitAttrs(AttrVisitor* v) final {
    v->Visit("base", &base);
    v->Visit("domain", &domain);
    v->Visit("stride", &stride);
  }

  static constexpr const char* _type_key = "IntSet";
  TVM_DECLARE_NODE_TYPE_INFO(IntSetNode);
};

TVM_REGISTER_NODE_TYPE(IntSetNode);

namespace {

inline bool Match(const Expr& e, int64_t value) {
  const ir::IntImm* v = e.as<ir::IntImm>();
  return v != nullptr && v->value;
}

// whether a exactly matches b.
inline bool Match(const IntSet& a,
                  const Range& b) {
  if (a->base == b &&
      a->domain.size() == 0 &&
      a->concrete.size() == 0) {
    return true;
  } else {
    return false;
  }
}

// whether a exactly matches b.
inline bool Match(const IntSet& a,
                  const Expr& b) {
  if (a->domain.size() == 0 &&
      a->concrete.size() == 0) {
    return Match(a->base->extent, 1) && a->base->min.same_as(b);
  } else {
    return false;
  }
}

inline bool IsNumber(const IntSet& s) {
  if (s->domain.size() != 0) return false;
  if (s->concrete.size() != 0) {
    return s->concrete.size() == 1;
  }
  return Match(s->base->extent, 1);
}

inline Expr AsNumber(const IntSet& s) {
  return s->base->min;
}

// set combination rule by operators
template<typename T>
inline IntSet BinaryCombine(IntSet a, IntSet b) {
  LOG(WARNING) << "cannot evaluate binary op " << T::_type_key;
  return IntSet::make_all_set();
}

template<>
inline IntSet BinaryCombine<Add>(IntSet a, IntSet b) {
  auto n = std::make_shared<IntSetNode>(*(a.operator->()));
  for (size_t i = 0; i < b->domain.size(); ++i) {
    n->domain.push_back(b->domain[i]);
    n->stride.push_back(b->stride[i]);
  }

  if (IsNumber(a)) {
    n->base = Range::make_with_min_extent(
        a->base->min + b->base->min,
        b->base->extent);
  } else if (IsNumber(b)) {
    n->base = Range::make_with_min_extent(
        a->base->min + b->base->min,
        a->base->extent);
  } else {
    n->base = Range::make_with_min_extent(
        a->base->min + b->base->min,
        a->base->extent + b->base->extent - 1);
  }
  return IntSet(n);
}

inline Range Negation(Range a) {
  if (Match(a->extent, 1)) {
    return Range::make_with_min_extent(-a->min, a->extent);
  } else {
    return Range::make_with_min_extent(-(a->min + a->extent - 1), a->extent);
  }
}

inline IntSet Negation(IntSet a) {
tqchen committed
125
  CHECK_EQ(a->concrete.size(), 0U);
126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184
  auto n = std::make_shared<IntSetNode>();
  n->base = Negation(a->base);
  for (size_t i = 0; i < a->domain.size(); ++i) {
    n->domain.push_back(Negation(a->domain[i]));
    n->stride.push_back(a->stride[i]);
  }
  return IntSet(a);
}

template<>
inline IntSet BinaryCombine<Sub>(IntSet a, IntSet b) {
  return BinaryCombine<Add>(a, Negation(b));
}

inline IntSet BinaryMul(IntSet a, Expr b) {
  // copy construct
  if (Match(b, 1)) return a;
  if (Match(b, -1)) return Negation(a);
  auto n = std::make_shared<IntSetNode>();
  n->base = Range::make_with_min_extent(0, 1);
  n->domain.push_back(a->base);
  n->stride.push_back(b);
  for (size_t i = 0; i < a->domain.size(); ++i) {
    n->domain.push_back(a->domain[i]);
    n->stride.push_back(a->stride[i] * b);
  }
  return IntSet(a);
}

template<>
inline IntSet BinaryCombine<Mul>(IntSet a, IntSet b) {
  if (IsNumber(a)) {
    return BinaryMul(a, AsNumber(b));
  } else if (IsNumber(b)) {
    return BinaryMul(b, AsNumber(a));
  } else {
    return IntSet::make_all_set();
  }
}

}  // namespace

inline const IntSetNode* IntSet::operator->() const {
  return static_cast<const IntSetNode*>(node_.get());
}

TVM_STATIC_IR_FUNCTOR(IRPrinter, vtable)
.set_dispatch<IntSetNode>([](const IntSetNode *op, IRPrinter *p) {
    p->stream << "int-set(base=";
    p->print(op->base);
    p->stream << ')';
  });

IntSet IntSet::make(Range dom) {
  auto n = std::make_shared<IntSetNode>();
  n->base = dom;
  return IntSet(n);
}

tqchen committed
185 186 187 188 189
IntSet IntSet::make_all_set() {
  LOG(FATAL) << "TODO";
  return IntSet();
}

190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345
void PassUp(const SplitNode* s,
            const std::unordered_map<IterVar, Range>& dom_map,
            const IntSet& outer,
            const IntSet& inner,
            IntSet* parent) {
  if (dom_map.count(s->outer) &&
      dom_map.count(s->inner) &&
      dom_map.count(s->parent) &&
      Match(outer, dom_map.at(s->outer)) &&
      Match(inner, dom_map.at(s->inner))) {
    *parent = IntSet::make(dom_map.at(s->parent));
    return;
  }
  // copy construct
  auto n = std::make_shared<IntSetNode>(*(inner.operator->()));

  if (IsNumber(outer)) {
    // shift the base offset
    n->base = Range::make_with_min_extent(
        AsNumber(outer) * s->factor + inner->base->min,
        inner->base->extent);
    *parent = IntSet(n);
  } else {
    // default use all domains in the data.
    n->domain.push_back(outer->base);
    n->stride.push_back(s->factor);
    for (size_t i = 0; i < outer->domain.size(); ++i) {
      n->domain.push_back(outer->domain[i]);
      n->stride.push_back(outer->stride[i] * s->factor);
    }
  }
}

void PassUp(const FuseNode* s,
            const std::unordered_map<IterVar, Range>& dom_map,
            const IntSet& fused,
            IntSet* outer,
            IntSet* inner) {
  CHECK(dom_map.count(s->outer));
  CHECK(dom_map.count(s->inner));
  CHECK(dom_map.count(s->fused));

  if (Match(fused, dom_map.at(s->fused))) {
    *outer = IntSet::make(dom_map.at(s->outer));
    *inner = IntSet::make(dom_map.at(s->inner));
    return;
  }

  if (IsNumber(fused)) {
    Expr value = AsNumber(fused);
    Expr factor = dom_map.at(s->outer)->extent;
    *outer = IntSet::make(Range::make_with_min_extent(value / factor, 1));
    *inner = IntSet::make(Range::make_with_min_extent(value % factor, 1));
  } else {
    LOG(WARNING) << "use fallback inference rule in fuse";
    // simply use the entire set, this rule can be enhanced.
    *outer = IntSet::make(dom_map.at(s->outer));
    *inner = IntSet::make(dom_map.at(s->inner));
    return;
  }
}

namespace {
// evaluator to evaluate the int set
class IRSetEvaluator {
 public:
  inline IntSet Eval(Expr expr) {
    static const FType& f = vtable();
    if (f.can_dispatch(expr)) {
      return f(expr, expr, this);
    } else {
      LOG(WARNING) << "cannot evaluate set type " << expr->type_key();
      return IntSet::make_all_set();
    }
  }

  using FType = tvm::IRFunctor<IntSet (const NodeRef&, const Expr&, IRSetEvaluator *)>;
  static FType& vtable() {  // NOLINT(*)
    static FType inst; return inst;
  }

  std::unordered_map<const Variable*, IntSet> dom_map;
};

inline IntSet ConstOp(const NodeRef&, const Expr& e, IRSetEvaluator*) {
  return IntSet::make(Range::make_with_min_extent(e, 1));
}

TVM_STATIC_IR_FUNCTOR(IRSetEvaluator, vtable)
.set_dispatch<IntImm>(ConstOp)
.set_dispatch<UIntImm>(ConstOp)
.set_dispatch<FloatImm>(ConstOp);

TVM_STATIC_IR_FUNCTOR(IRSetEvaluator, vtable)
.set_dispatch<Variable>([](const Variable* op, const Expr& e, IRSetEvaluator* m) {
    auto it = m->dom_map.find(op);
    if (it != m->dom_map.end()) {
      return it->second;
    } else {
      return IntSet::make(Range::make_with_min_extent(e, 1));
    }
  });

// binary operator
template<typename T>
inline IntSet Binary(const T* op, const Expr& e, IRSetEvaluator* m) {
  IntSet a = m->Eval(op->a);
  IntSet b = m->Eval(op->b);
  if (IsNumber(a) && IsNumber(b)) {
    if (Match(a, op->a) &&
        Match(b, op->b)) {
      return IntSet::make(Range::make_with_min_extent(e, 1));
    } else {
      return IntSet::make(Range::make_with_min_extent(
          T::make(AsNumber(a), AsNumber(b)), 1));
    }
  } else {
    return BinaryCombine<T>(a, b);
  }
}

TVM_STATIC_IR_FUNCTOR(IRSetEvaluator, vtable)
.set_dispatch<Add>(Binary<Add>)
.set_dispatch<Sub>(Binary<Sub>)
.set_dispatch<Mul>(Binary<Mul>)
.set_dispatch<Div>(Binary<Div>)
.set_dispatch<Mod>(Binary<Mod>)
.set_dispatch<Min>(Binary<Min>)
.set_dispatch<Max>(Binary<Max>);

// use simply bound for logical expressions for now.
inline IntSet Logical(const NodeRef&, const Expr& e, IRSetEvaluator*) {
  return IntSet::make(Range::make_with_min_extent(0, 2));
}

TVM_STATIC_IR_FUNCTOR(IRSetEvaluator, vtable)
.set_dispatch<EQ>(Logical)
.set_dispatch<NE>(Logical)
.set_dispatch<LT>(Logical)
.set_dispatch<LE>(Logical)
.set_dispatch<GT>(Logical)
.set_dispatch<GE>(Logical)
.set_dispatch<And>(Logical)
.set_dispatch<Or>(Logical);

}  // namespace

IntSet Eval(Expr e,
            const std::unordered_map<IterVar, IntSet>& dom_map) {
  IRSetEvaluator m;
  for (auto kv : dom_map) {
    m.dom_map[kv.first->var.as<Variable>()] = kv.second;
  }
  return m.Eval(e);
}

346
}  // namespace schedule
347
}  // namespace tvm