1 2 3 4 5 6 7 8 9 10 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 125 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 185 186 187 188 189 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 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404
|
#pragma once
#include <torch/csrc/jit/tensorexpr/ir.h>
#include <torch/csrc/jit/tensorexpr/ir_visitor.h>
#include <torch/csrc/jit/tensorexpr/stmt.h>
#include <torch/csrc/jit/tensorexpr/tensor.h>
namespace torch {
namespace jit {
namespace tensorexpr {
class HasRand : public IRVisitor {
public:
HasRand(StmtPtr stmt) : stmt_(stmt) {
stmt_->accept(this);
}
bool has_rand() const {
return has_rand_;
}
private:
void visit(IntrinsicsPtr v) override {
if (v->op_type() == IntrinsicsOp::kRand) {
has_rand_ = true;
} else {
IRVisitor::visit(v);
}
}
StmtPtr stmt_;
bool has_rand_ = false;
};
template <typename Op>
// NOLINTNEXTLINE(cppcoreguidelines-pro-type-member-init)
class NodeFinder : public IRVisitor {
public:
void visit(NodePtr<Op> v) override {
nodes.push_back((NodePtr<Op>)v);
IRVisitor::visit(v);
}
static std::vector<NodePtr<Op>> find(StmtPtr s) {
NodeFinder<Op> nf;
s->accept(&nf);
return nf.nodes;
}
static std::vector<NodePtr<Op>> find(ExprPtr e) {
NodeFinder<Op> nf;
e->accept(&nf);
return nf.nodes;
}
std::vector<NodePtr<Op>> nodes;
};
// NOLINTNEXTLINE(cppcoreguidelines-pro-type-member-init)
class VarFinder : public IRVisitor {
public:
void visit(VarPtr v) override {
vars_.insert(v);
IRVisitor::visit(v);
}
static std::unordered_set<VarPtr> find(StmtPtr s) {
VarFinder nf;
s->accept(&nf);
return nf.vars();
}
static std::unordered_set<VarPtr> find(ExprPtr e) {
VarFinder nf;
e->accept(&nf);
return nf.vars();
}
const std::unordered_set<VarPtr>& vars() {
return vars_;
}
private:
std::unordered_set<VarPtr> vars_;
};
class BufFinder : public IRVisitor {
public:
void visit(BufPtr v) override {
bufs_.insert(v);
IRVisitor::visit(v);
}
static std::unordered_set<BufPtr> find(StmtPtr s) {
BufFinder nf;
s->accept(&nf);
return nf.bufs();
}
static std::unordered_set<BufPtr> find(ExprPtr e) {
BufFinder nf;
e->accept(&nf);
return nf.bufs();
}
const std::unordered_set<BufPtr>& bufs() {
return bufs_;
}
private:
std::unordered_set<BufPtr> bufs_;
};
// Finds all kinds of write operations to the provided Buf.
class WritesToBuf : public IRVisitor {
public:
// NOLINTNEXTLINE(cppcoreguidelines-pro-type-member-init)
WritesToBuf(BufPtr target) : target_(target) {}
std::vector<StmtPtr> writes() {
return writes_;
}
static std::vector<StmtPtr> find(StmtPtr s, BufPtr b) {
WritesToBuf finder(b);
s->accept(&finder);
return finder.writes();
}
private:
void visit(StorePtr v) override {
if (v->buf() == target_) {
writes_.push_back(v);
}
}
void visit(AtomicAddPtr v) override {
if (v->buf() == target_) {
writes_.push_back(v);
}
}
BufPtr target_;
std::vector<StmtPtr> writes_;
};
class StmtsReadingBuf : public IRVisitor {
public:
// NOLINTNEXTLINE(cppcoreguidelines-pro-type-member-init)
StmtsReadingBuf(BufPtr target) : target_(target) {}
std::vector<StmtPtr> reads() {
return reads_;
}
static std::vector<StmtPtr> find(StmtPtr s, BufPtr b) {
StmtsReadingBuf finder(b);
s->accept(&finder);
return finder.reads();
}
private:
bool readsBuffer(StmtPtr s) {
auto loads = NodeFinder<Load>::find(s);
for (auto l : loads) {
if (l->buf() == target_) {
return true;
}
}
return false;
}
void visit(StorePtr v) override {
if (readsBuffer(v)) {
reads_.push_back(v);
}
}
void visit(LetPtr v) override {
if (readsBuffer(v)) {
reads_.push_back(v);
}
}
void visit(CondPtr v) override {
if (readsBuffer(v)) {
reads_.push_back(v);
}
}
void visit(AtomicAddPtr v) override {
if (readsBuffer(v)) {
reads_.push_back(v);
}
}
BufPtr target_;
std::vector<StmtPtr> reads_;
};
class ExternalAllocBufFinder : public IRVisitor {
public:
void visit(ExternalCallWithAllocPtr v) override {
const auto& bufs_out = v->buf_out_args();
bufs_.insert(bufs_out.begin(), bufs_out.end());
IRVisitor::visit(v);
}
static std::unordered_set<BufPtr> find(StmtPtr s) {
ExternalAllocBufFinder f;
s->accept(&f);
return f.bufs();
}
static std::unordered_set<BufPtr> find(ExprPtr e) {
ExternalAllocBufFinder f;
e->accept(&f);
return f.bufs();
}
const std::unordered_set<BufPtr>& bufs() {
return bufs_;
}
private:
std::unordered_set<BufPtr> bufs_;
};
// Traverses the IR to determine if a particular Var is modified within it.
class ModifiesVarChecker : public IRVisitor {
public:
ModifiesVarChecker(VarPtr v) : var_(v) {}
static bool check(StmtPtr s, VarPtr v) {
ModifiesVarChecker checker(v);
s->accept(&checker);
return checker.found();
}
bool found() {
return found_;
}
private:
void visit(StorePtr v) override {
if (v->buf()->base_handle() == var_) {
found_ = true;
return;
}
IRVisitor::visit(v);
}
void visit(AtomicAddPtr v) override {
if (v->buf()->base_handle() == var_) {
found_ = true;
return;
}
IRVisitor::visit(v);
}
void visit(LetPtr v) override {
if (v->var() == var_) {
found_ = true;
return;
}
IRVisitor::visit(v);
}
void visit(ForPtr v) override {
if (v->var() == var_) {
found_ = true;
return;
}
IRVisitor::visit(v);
}
VarPtr var_;
bool found_{false};
};
// Traverse the Block stmt to identify the live range of the specified buf. The
// live range, indicated by a pair of integers, specifies the first and last
// stmt in block stmts that access to the buf.
class BufLiveRange : public IRVisitor {
public:
BufLiveRange(BufPtr b) : buf_(b) {}
static std::tuple<int32_t, int32_t> liveRange(StmtPtr s, BufPtr b) {
BlockPtr block = to<Block>(s);
// We Only analze buffer live ranges for block stmts.
if (!block) {
return std::make_tuple(0, 0);
}
BufLiveRange analyzer(b);
block->accept(&analyzer);
return analyzer.getLiveRange();
}
private:
std::tuple<int32_t, int32_t> getLiveRange() {
return std::make_tuple(begin_, end_);
}
bool hasBufReads(StmtPtr s) {
auto loads1 = NodeFinder<Load>::find(s);
for (auto l : loads1) {
if (l->buf() == buf_) {
return true;
}
}
auto loads2 = NodeFinder<ExternalCall>::find(s);
for (auto l : loads2) {
for (auto lb : l->buf_args()) {
if (lb == buf_) {
return true;
}
}
}
auto loads3 = NodeFinder<ExternalCallWithAlloc>::find(s);
for (auto l : loads3) {
for (auto lb : l->buf_args()) {
if (lb == buf_) {
return true;
}
}
}
return false;
}
bool hasBufWrites(StmtPtr s) {
auto writes1 = NodeFinder<Store>::find(s);
for (auto w : writes1) {
if (w->buf() == buf_) {
return true;
}
}
auto writes2 = NodeFinder<ExternalCall>::find(s);
for (auto w : writes2) {
if (w->buf() == buf_) {
return true;
}
}
auto writes3 = NodeFinder<ExternalCallWithAlloc>::find(s);
for (auto w : writes3) {
for (auto wb : w->buf_out_args()) {
if (wb == buf_) {
return true;
}
}
}
return false;
}
void findAccAndUpdateLiveRange(StmtPtr s) {
bool has_reads = hasBufReads(s), has_writes = hasBufWrites(s);
if (has_reads || has_writes) {
if (begin_ == -1) {
begin_ = curr_index_;
};
end_ = curr_index_;
}
}
void visit(BlockPtr v) {
for (StmtPtr s : *v) {
curr_index_ += 1;
findAccAndUpdateLiveRange(s);
}
}
BufPtr buf_;
int32_t begin_ = -1;
int32_t end_ = -1;
int32_t curr_index_ = -1;
};
// A class that analyzes the given program relevant for Block backend
// It creates a map of multi dim buffers and their flat verions
class CreateBufferMap : public IRVisitor {
public:
const std::unordered_map<std::string, BufPtr>& getBufferMap() const {
return map_input_to_tensor_bufs_;
}
private:
void visit(StorePtr v) override {
auto load_node = to<Load>(v->value());
if (load_node) {
auto t_buf = load_node->buf();
map_input_to_tensor_bufs_.emplace(t_buf->name_hint(), v->buf());
} else {
auto add_node = to<Add>(v->value());
auto mul_node = to<Mul>(v->value());
// This means for now, v->value() can be Add or Mul
TORCH_INTERNAL_ASSERT(add_node || mul_node, buildErrorMessage());
map_input_to_tensor_bufs_.emplace(v->buf()->name_hint(), v->buf());
}
v->value()->accept(this);
}
std::unordered_map<std::string, BufPtr> map_input_to_tensor_bufs_;
};
} // namespace tensorexpr
} // namespace jit
} // namespace torch
|