pass_manager.cc 18.6 KB
Newer Older
1 2 3 4 5 6 7 8
/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
9
 *
10
 *   http://www.apache.org/licenses/LICENSE-2.0
11
 *
12 13 14 15 16 17 18 19
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */

Zhi committed
20 21 22 23 24
/*!
 * Copyright (c) 2019 by Contributors
 * \file src/relay/pass/pass_manager.cc
 * \brief Relay pass manager implementation.
 */
25
#include <dmlc/thread_local.h>
Zhi committed
26
#include <tvm/relay/expr_functor.h>
27
#include <tvm/relay/transform.h>
28 29 30 31 32
#include <tvm/runtime/device_api.h>

#include <algorithm>
#include <stack>
#include <unordered_set>
Zhi committed
33 34 35

namespace tvm {
namespace relay {
36
namespace transform {
Zhi committed
37 38 39

using tvm::IRPrinter;

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
struct RelayPassContextThreadLocalEntry {
  /*! \brief The default pass context. */
  PassContext default_context;

  /*! \brief The current pass context. */
  std::stack<PassContext> context_stack;

  RelayPassContextThreadLocalEntry() {
    default_context = PassContext(make_node<PassContextNode>());
  }
};

/*! \brief Thread local store to hold the pass context. */
typedef dmlc::ThreadLocalStore<RelayPassContextThreadLocalEntry>
    RelayPassContextThreadLocalStore;

void PassContext::EnterWithScope() {
  RelayPassContextThreadLocalEntry* entry =
      RelayPassContextThreadLocalStore::Get();
  entry->context_stack.push(*this);
}

void PassContext::ExitWithScope() {
  RelayPassContextThreadLocalEntry* entry =
      RelayPassContextThreadLocalStore::Get();
  CHECK(!entry->context_stack.empty());
  CHECK(entry->context_stack.top().same_as(*this));
  entry->context_stack.pop();
}

PassContext PassContext::Current() {
  RelayPassContextThreadLocalEntry* entry =
      RelayPassContextThreadLocalStore::Get();
  if (!entry->context_stack.empty()) {
    return entry->context_stack.top();
  } else {
    return entry->default_context;
  }
}

80 81 82 83
PassContext PassContext::Create() {
  return PassContext(make_node<PassContextNode>());
}

Zhi committed
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
class ModulePass;

/*!
 * \brief Module-level passes are designed to implement global
 * analysis/optimizations, i.e. interprocedural optimizations (IPO), etc. Passes
 * at this level have the full control of a given Relay program including
 * addition and deletion of functions.
 */
class ModulePassNode : public PassNode {
 public:
  /* \brief The pass meta data.*/
  PassInfo pass_info;

  /*! \brief The pass function sketches the real optimization. For example,
   * we may need to perform dead code elimination on the module level. We could
   * implement the algorithm in the `pass_func` and let it run on a module. It
   * will then remove the dead code including the unused functions in the module.
   */
  runtime::TypedPackedFunc<Module(Module, PassContext)> pass_func;

  ModulePassNode() = default;

  void VisitAttrs(tvm::AttrVisitor* v) final {
    v->Visit("pass_info", &pass_info);
  }

  /*!
111
   * \brief Run a module pass on given pass context.
Zhi committed
112
   *
113 114
   * \param mod The module that an optimization pass is applied on.
   * \param mod The context that an optimization pass executes on.
Zhi committed
115 116 117
   *
   * \return Return the updated module.
   */
118
  Module operator()(const Module& mod, const PassContext& pass_ctx) const final;
Zhi committed
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

  /*!
   * \brief Get the pass information/meta data.
   */
  PassInfo Info() const { return pass_info; }

  TVM_DLL static ModulePass make(
      runtime::TypedPackedFunc<Module(Module, PassContext)> pass_func,
      PassInfo pass_info);

  static constexpr const char* _type_key = "relay.ModulePass";
  TVM_DECLARE_NODE_TYPE_INFO(ModulePassNode, PassNode);
};

RELAY_DEFINE_NODE_REF(ModulePass, ModulePassNode, Pass);

class FunctionPass;

/*!
 * \brief Function-level passes are used to implement various global
 * optimizations for a given Relay module. It fetches one function at a time
 * from the function list in the module for optimization.
 *
 * Note that the scope of passes at this level is a Relay function. Therefore,
 * we cannot add or delete a function through these passes as they are not aware
 * of the global information.
 */
class FunctionPassNode : public PassNode {
 public:
  /* \brief The pass meta data.*/
  PassInfo pass_info;

  /*! \brief The packed pass function sketches the real optimization. For
   * instance, we can implement a pass that works on a Relay function as a
   * `pass_func` and let it run on a given module. The same `pass_func` will
   * then be applied on each function in the module.
   */
156
  runtime::TypedPackedFunc<Function(Function, Module, PassContext)> pass_func;
Zhi committed
157 158 159 160 161 162 163 164

  FunctionPassNode() = default;

  void VisitAttrs(tvm::AttrVisitor* v) final {
    v->Visit("pass_info", &pass_info);
  }

  /*!
165
   * \brief Run a function pass on given pass context.
Zhi committed
166
   *
167 168
   * \param mod The module that an optimization pass is applied on.
   * \param mod The context that an optimization pass executes on.
Zhi committed
169 170 171
   *
   * \return Return the updated module.
   */
172
  Module operator()(const Module& mod, const PassContext& pass_ctx) const final;
Zhi committed
173 174 175 176 177 178 179

  /*!
   * \brief Get the pass information/meta data.
   */
  PassInfo Info() const { return pass_info; }

  TVM_DLL static FunctionPass make(
180
      runtime::TypedPackedFunc<Function(Function, Module, PassContext)> pass_func,
Zhi committed
181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
      PassInfo pass_info);

  static constexpr const char* _type_key = "relay.FunctionPass";
  TVM_DECLARE_NODE_TYPE_INFO(FunctionPassNode, PassNode);

 private:
  /*
   * \brief Check if a function should be skipped for optimization.
   *
   * \param func The target function to be checked.
   *
   * \return Return true if the function will be skipped, otherwise false.
   */
  bool SkipFunction(const Function& func) const;
};

RELAY_DEFINE_NODE_REF(FunctionPass, FunctionPassNode, Pass);

/*!
200
 * \brief The SequentialNode contains a set of passes that transform Relay
Zhi committed
201 202 203 204 205 206
 * programs from one AST to another semantically equivalent one.
 *
 * One example of this level of pass is that the pass manager needs to correctly
 * perform a host of optimizations with a given optimization level and disabled
 * passes.
 */
207
class SequentialNode : public PassNode {
Zhi committed
208 209 210 211
 public:
  /* \brief The pass meta data.*/
  PassInfo pass_info;

212 213
  /*! \brief A list of passes that used to compose a sequential pass. */
  tvm::Array<Pass> passes;
214

Zhi committed
215 216 217 218 219 220 221 222 223 224 225
  void VisitAttrs(tvm::AttrVisitor* v) final {
    v->Visit("pass_info", &pass_info);
    v->Visit("passes", &passes);
  }

  /*!
   * \brief Get the pass information/meta data.
   */
  PassInfo Info() const { return pass_info; }

  /*!
226 227
   * \brief Check if a pass is enabled.
   *
228
   * \param info The pass information.
229 230 231
   *
   * \return true if the pass is enabled. Otherwise, false.
   */
232
  bool PassEnabled(const PassInfo& info) const;
233 234

  /*!
Zhi committed
235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253
   * \brief Resolve the pass dependency. It globs all required passes by
   *        a given pass and executes them.
   *
   * \param mod The module that an optimization pass runs on.
   *
   * \return The updated module after resolving pass dependencies.
   *
   * TODO(zhiics) Build a dependency graph among the passes using provided
   * metadata, i.e. required_passes. Likely, we can have a data structure, i.e.
   * PassInfo, to store the relevant information including the parent passes.
   */
  void ResolveDependency(const Module& mod);

  /*!
   * \brief Perform optimizations on a series of passes. The aforementioned
   *        typical pass manager jobs could be done by it. This function could
   *        be overloaded to focus on different metrics, i.e. performance,
   *        memory footprint, etc.
   *
254 255
   * \param mod The module that these passes are applied on.
   * \param pass_ctx The context that these passes execute on.
Zhi committed
256 257 258
   *
   * \return Return the updated module.
   */
259
  Module operator()(const Module& mod, const PassContext& pass_ctx) const final;
Zhi committed
260

261 262
  static constexpr const char* _type_key = "relay.Sequential";
  TVM_DECLARE_NODE_TYPE_INFO(SequentialNode, PassNode);
Zhi committed
263 264
};

265 266
PassInfo PassInfoNode::make(int opt_level,
                            std::string name,
Zhi committed
267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
                            tvm::Array<tvm::Expr> required) {
  auto pass_info = make_node<PassInfoNode>();
  pass_info->opt_level = opt_level;
  pass_info->name = std::move(name);
  pass_info->required = std::move(required);
  return PassInfo(pass_info);
}

ModulePass ModulePassNode::make(
    runtime::TypedPackedFunc<Module(Module, PassContext)> pass_func,
    PassInfo pass_info) {
  auto n = make_node<ModulePassNode>();
  n->pass_func = std::move(pass_func);
  n->pass_info = std::move(pass_info);
  return ModulePass(n);
}

// Module -> Module optimizations.
285 286
Module ModulePassNode::operator()(const Module& mod,
                                  const PassContext& pass_ctx) const {
287 288 289 290 291
  const PassInfo& pass_info = Info();
  DLOG(INFO) << "Executing module pass : "
             << pass_info->name
             << " with opt level: "
             << pass_info->opt_level;
Zhi committed
292
  CHECK(mod.defined());
293
  Module updated_mod = pass_func(mod, pass_ctx);
Zhi committed
294 295 296 297 298
  CHECK(updated_mod.defined());
  return updated_mod;
}

FunctionPass FunctionPassNode::make(
299
    runtime::TypedPackedFunc<Function(Function, Module, PassContext)> pass_func,
Zhi committed
300 301 302 303 304 305 306 307
    PassInfo pass_info) {
  auto n = make_node<FunctionPassNode>();
  n->pass_func = std::move(pass_func);
  n->pass_info = std::move(pass_info);
  return FunctionPass(n);
}

// Perform Module -> Module optimizations at the Function level.
308 309
Module FunctionPassNode::operator()(const Module& mod,
                                    const PassContext& pass_ctx) const {
310
  const PassInfo& pass_info = Info();
Zhi committed
311
  CHECK(mod.defined());
312
  DLOG(INFO) << "Executing function pass : "
313 314 315
             << pass_info->name
             << " with opt level: "
             << pass_info->opt_level;
316

317
  Module updated_mod = mod;
318
  // Execute the pass function and return a new module.
319
  std::vector<std::pair<GlobalVar, Function> > updates;
320 321
  auto original = mod->functions;
  for (const auto& it : original) {
322 323 324
    auto updated_func = SkipFunction(it.second)
                            ? it.second
                            : pass_func(it.second, updated_mod, pass_ctx);
325 326 327 328 329
    updates.push_back({it.first, updated_func});
  }

  for (const auto& pair : updates) {
    updated_mod->Add(pair.first, pair.second, true);
Zhi committed
330
  }
331
  return updated_mod;
Zhi committed
332 333 334 335 336 337 338 339 340 341
}

// TODO(zhiics) Create an enum attribute for FunctionNode
// enum Attribute {kPrimitive, kSkipOptimization}
bool FunctionPassNode::SkipFunction(const Function& func) const {
  NodeRef res = FunctionGetAttr(func, "SkipOptimization");
  const ir::IntImm* pval = res.as<ir::IntImm>();
  return pval && pval->value != 0;
}

342
Sequential::Sequential(tvm::Array<Pass> passes, PassInfo pass_info) {
343
  auto n = make_node<SequentialNode>();
Zhi committed
344 345
  n->passes = std::move(passes);
  n->pass_info = std::move(pass_info);
346 347 348
  node_ = std::move(n);
}

349 350 351 352 353 354
Sequential::Sequential(tvm::Array<Pass> passes, std::string name) {
  auto n = make_node<SequentialNode>();
  n->passes = std::move(passes);
  PassInfo pass_info = PassInfoNode::make(2, std::move(name), {});
  n->pass_info = std::move(pass_info);
  node_ = std::move(n);
Zhi committed
355 356
}

357 358
const SequentialNode* Sequential::operator->() const {
  return static_cast<const SequentialNode*>(this->node_.get());
Zhi committed
359 360
}

361
void SequentialNode::ResolveDependency(const Module& mod) {
Zhi committed
362 363 364 365 366 367 368 369
  // TODO(zhiics) Implement it.
  // 1. Consider the required passes for each pass.
  // 2. Only resolve the enabled passes.
  // 3. Build a dependency graph. Probably we need to update the pass list.
  LOG(FATAL) << "Pass dependency has not been resolved yet."
             << "\n";
}

370 371 372 373 374 375 376
// linearly scan the pass array to match pass_name
inline bool PassArrayContains(const Array<tvm::Expr>& pass_array,
                              const std::string& pass_name) {
  for (auto x : pass_array) {
    auto* str_name = x.as<ir::StringImm>();
    CHECK(str_name) << "pass name must be str";
    if (str_name->value == pass_name) return true;
Zhi committed
377
  }
378
  return false;
Zhi committed
379 380
}

381
bool SequentialNode::PassEnabled(const PassInfo& info) const {
382 383
  PassContext ctx = PassContext::Current();

384
  if (PassArrayContains(ctx->disabled_pass, info->name)) {
385 386 387
    return false;
  }

388
  if (PassArrayContains(ctx->required_pass, info->name)) {
389 390
    return true;
  }
391 392

  return ctx->opt_level >= info->opt_level;
393 394
}

395 396 397 398 399 400 401 402 403
Pass GetPass(const std::string& pass_name) {
  using tvm::runtime::Registry;
  std::string fpass_name = "relay._transform." + pass_name;
  const auto* f = Registry::Get(fpass_name);
  CHECK(f != nullptr) << "Cannot find " << fpass_name
                      << "to create the pass " << pass_name;
  return (*f)();
}

404 405
// TODO(zhiics): we currenlty only sequentially execute each pass in
// a Sequential without the consideration of their orders. The phase
406
// ordering problem needs to be handled in the future.
407 408 409 410 411
Module SequentialNode::operator()(const Module& module,
                                  const PassContext& pass_ctx) const {
  Module mod = module;
  for (const Pass& pass : passes) {
    CHECK(pass.defined()) << "Found undefined pass for optimization.";
412 413 414 415 416 417 418
    const PassInfo& pass_info = pass->Info();
    if (!PassEnabled(pass_info))  continue;
    // resolve dependencies
    for (const auto& it : pass_info->required) {
      const auto* name = it.as<tvm::ir::StringImm>();
      CHECK(name);
      mod = GetPass(name->value)(mod, pass_ctx);
419
    }
420
    mod = pass(mod, pass_ctx);
421 422
  }
  return mod;
Zhi committed
423 424 425 426 427 428 429 430 431 432 433 434
}

Pass CreateModulePass(
    const runtime::TypedPackedFunc<Module(Module, PassContext)>& pass_func,
    int opt_level,
    const std::string& name,
    const tvm::Array<tvm::Expr>& required) {
  PassInfo pass_info = PassInfoNode::make(opt_level, name, required);
  return ModulePassNode::make(pass_func, pass_info);
}

Pass CreateFunctionPass(
435
    const runtime::TypedPackedFunc<Function(Function, Module, PassContext)>& pass_func,
Zhi committed
436 437 438 439 440 441 442 443 444
    int opt_level,
    const std::string& name,
    const tvm::Array<tvm::Expr>& required) {
  PassInfo pass_info = PassInfoNode::make(opt_level, name, required);
  return FunctionPassNode::make(pass_func, pass_info);
}

TVM_REGISTER_NODE_TYPE(PassInfoNode);

445
TVM_REGISTER_API("relay._transform.PassInfo")
446
.set_body_typed(PassInfoNode::make);
Zhi committed
447

448
TVM_REGISTER_API("relay._transform.Info")
Zhi committed
449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469
.set_body([](TVMArgs args, TVMRetValue* ret) {
  Pass pass = args[0];
  *ret = pass->Info();
});

TVM_STATIC_IR_FUNCTOR_REGISTER(IRPrinter, vtable)
.set_dispatch<PassInfoNode>([](const PassInfoNode* node,
                                tvm::IRPrinter* p) {
  p->stream << "The meta data of the pass: ";
  p->stream << "pass name: " << node->name;
  p->stream << "opt_level: " << node->opt_level;
  p->stream << "required passes: [" << "\n";
  for (const auto& it : node->required) {
    const auto* str = it.as<tvm::ir::StringImm>();
    p->stream << str->value << ", ";
  }
  p->stream << "]\n";
});

TVM_REGISTER_NODE_TYPE(ModulePassNode);

470 471
TVM_REGISTER_API("relay._transform.MakeModulePass")
.set_body_typed(ModulePassNode::make);
Zhi committed
472

473
TVM_REGISTER_API("relay._transform.RunPass")
Zhi committed
474
.set_body([](TVMArgs args, TVMRetValue* ret) {
475 476 477
  Pass pass = args[0];
  Module mod = args[1];
  *ret = pass(mod);
Zhi committed
478 479 480 481 482
});

TVM_STATIC_IR_FUNCTOR_REGISTER(IRPrinter, vtable)
.set_dispatch<ModulePassNode>([](const ModulePassNode* node,
                                 tvm::IRPrinter* p) {
483 484 485
  const PassInfo info = node->Info();
  p->stream << "Run Module pass: " << info->name
            << " at the optimization level " << info->opt_level;
Zhi committed
486 487 488 489
});

TVM_REGISTER_NODE_TYPE(FunctionPassNode);

490 491
TVM_REGISTER_API("relay._transform.MakeFunctionPass")
.set_body_typed(FunctionPassNode::make);
Zhi committed
492 493 494 495

TVM_STATIC_IR_FUNCTOR_REGISTER(IRPrinter, vtable)
.set_dispatch<FunctionPassNode>([](const FunctionPassNode* node,
                                   tvm::IRPrinter* p) {
496 497 498
  const PassInfo info = node->Info();
  p->stream << "Run Function pass: " << info->name
            << " at the optimization level " << info->opt_level;
Zhi committed
499 500
});

501
TVM_REGISTER_NODE_TYPE(SequentialNode);
Zhi committed
502

503
TVM_REGISTER_API("relay._transform.Sequential")
Zhi committed
504 505 506 507 508 509
.set_body([](TVMArgs args, TVMRetValue* ret) {
  tvm::Array<Pass> passes = args[0];
  int opt_level = args[1];
  std::string name = args[2];
  tvm::Array<tvm::Expr> required = args[3];
  PassInfo pass_info = PassInfoNode::make(opt_level, name, required);
510
  *ret = Sequential(passes, pass_info);
Zhi committed
511 512 513
});

TVM_STATIC_IR_FUNCTOR_REGISTER(IRPrinter, vtable)
514 515
.set_dispatch<SequentialNode>([](const SequentialNode* node,
                                 tvm::IRPrinter* p) {
516 517 518
  const PassInfo info = node->Info();
  p->stream << "Run Sequential pass: " << info->name
            << " at the optimization level " << info->opt_level << ". ";
Zhi committed
519 520
  p->stream << "The passes will be executed are: [";
  for (const auto& it : node->passes) {
521 522
    const PassInfo pass_info = it->Info();
    p->stream << pass_info->name << " ";
Zhi committed
523 524 525 526 527 528
  }
  p->stream << "]";
});

TVM_REGISTER_NODE_TYPE(PassContextNode);

529
TVM_REGISTER_API("relay._transform.PassContext")
530
.set_body([](TVMArgs args, TVMRetValue* ret) {
531
  auto pctx = PassContext::Create();
532 533 534 535
  int opt_level = args[0];
  int fallback_device = args[1];
  tvm::Array<tvm::Expr> required = args[2];
  tvm::Array<tvm::Expr> disabled = args[3];
536 537 538 539 540
  pctx->opt_level = opt_level;
  pctx->fallback_device = fallback_device;
  pctx->required_pass = std::move(required);
  pctx->disabled_pass = std::move(disabled);
  *ret = pctx;
541
});
Zhi committed
542 543 544

TVM_STATIC_IR_FUNCTOR_REGISTER(IRPrinter, vtable)
.set_dispatch<PassContextNode>([](const PassContextNode* node,
545 546 547
                               tvm::IRPrinter* p) {
  p->stream << "Pass context information: " << "\n";
  p->stream << "\topt_level: " << node->opt_level << "\n";
548 549
  p->stream << "\tfallback device: "
            << runtime::DeviceName(node->fallback_device)
550 551 552 553 554 555 556 557 558 559 560 561 562
            << "\n";

  p->stream << "\trequired passes: [" << node->opt_level;
  for (const auto& it : node->required_pass) {
    p->stream << it << " ";
  }
  p->stream << "]\n";

  p->stream << "\tdisabled passes: [" << node->opt_level;
  for (const auto& it : node->disabled_pass) {
    p->stream << it << " ";
  }
  p->stream << "]";
Zhi committed
563 564
});

565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584
class PassContext::Internal {
 public:
  static void EnterScope(PassContext pass_ctx) {
    pass_ctx.EnterWithScope();
  }

  static void ExitScope(PassContext pass_ctx) {
    pass_ctx.ExitWithScope();
  }
};

TVM_REGISTER_API("relay._transform.GetCurrentPassContext")
.set_body_typed(PassContext::Current);

TVM_REGISTER_API("relay._transform.EnterPassContext")
.set_body_typed(PassContext::Internal::EnterScope);

TVM_REGISTER_API("relay._transform.ExitPassContext")
.set_body_typed(PassContext::Internal::ExitScope);

585
}  // namespace transform
Zhi committed
586 587
}  // namespace relay
}  // namespace tvm