|
| 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 | + |
| 20 | +/*! |
| 21 | + * |
| 22 | + * \file analysis.cc |
| 23 | + * |
| 24 | + * \brief Analysis functions for Relax. |
| 25 | + */ |
| 26 | + |
| 27 | +#include <tvm/relax/analysis.h> |
| 28 | +#include <tvm/relax/expr_functor.h> |
| 29 | + |
| 30 | +namespace tvm { |
| 31 | +namespace relax { |
| 32 | + |
| 33 | +template <typename T> |
| 34 | +struct InsertionSet { |
| 35 | + std::unordered_set<T, ObjectPtrHash, ObjectPtrEqual> set; |
| 36 | + std::vector<T> data; |
| 37 | + void Insert(const T& t) { |
| 38 | + if (set.count(t) == 0) { |
| 39 | + set.insert(t); |
| 40 | + data.push_back(t); |
| 41 | + } |
| 42 | + } |
| 43 | +}; |
| 44 | + |
| 45 | +class VarVisitor : protected ExprVisitor { |
| 46 | + public: |
| 47 | + Array<Var> Free(const Expr& expr) { |
| 48 | + this->VisitExpr(expr); |
| 49 | + Array<Var> ret; |
| 50 | + for (const auto& v : vars_.data) { |
| 51 | + if (bound_vars_.set.count(v) == 0) { |
| 52 | + ret.push_back(v); |
| 53 | + } |
| 54 | + } |
| 55 | + return ret; |
| 56 | + } |
| 57 | + |
| 58 | + Array<Var> Collect() { |
| 59 | + Array<Var> ret; |
| 60 | + for (const auto& v : bound_vars_.data) { |
| 61 | + ret.push_back(v); |
| 62 | + } |
| 63 | + return ret; |
| 64 | + } |
| 65 | + |
| 66 | + Array<Var> Bound(const Expr& expr) { |
| 67 | + this->VisitExpr(expr); |
| 68 | + return Collect(); |
| 69 | + } |
| 70 | + |
| 71 | + Array<Var> All(const Expr& expr) { |
| 72 | + this->VisitExpr(expr); |
| 73 | + Array<Var> ret; |
| 74 | + for (const auto& v : vars_.data) { |
| 75 | + ret.push_back(v); |
| 76 | + } |
| 77 | + return ret; |
| 78 | + } |
| 79 | + |
| 80 | + Array<GlobalVar> AllGlobalVars(const Expr& expr) { |
| 81 | + this->VisitExpr(expr); |
| 82 | + Array<GlobalVar> ret; |
| 83 | + for (const auto& v : global_vars_.data) { |
| 84 | + ret.push_back(v); |
| 85 | + } |
| 86 | + return ret; |
| 87 | + } |
| 88 | + |
| 89 | + Array<GlobalVar> RecGlobalVars(const Expr& expr) { |
| 90 | + this->VisitExpr(expr); |
| 91 | + Array<GlobalVar> ret; |
| 92 | + for (const auto& v : rec_global_vars_.data) { |
| 93 | + ret.push_back(v); |
| 94 | + } |
| 95 | + return ret; |
| 96 | + } |
| 97 | + |
| 98 | + void MarkBounded(const Var& v) { |
| 99 | + bound_vars_.Insert(v); |
| 100 | + vars_.Insert(v); |
| 101 | + } |
| 102 | + |
| 103 | + void VisitExpr_(const VarNode* var) final { vars_.Insert(GetRef<Var>(var)); } |
| 104 | + |
| 105 | + void VisitExpr_(const FunctionNode* op) final { |
| 106 | + for (const auto& param : op->params) { |
| 107 | + MarkBounded(param); |
| 108 | + } |
| 109 | + VisitExpr(op->body); |
| 110 | + } |
| 111 | + void VisitExpr_(const GlobalVarNode* op) final { global_vars_.Insert(GetRef<GlobalVar>(op)); } |
| 112 | + |
| 113 | + void VisitExpr_(const CallNode* call_node) final { |
| 114 | + VisitSpan(call_node->span); |
| 115 | + VisitExpr(call_node->op); |
| 116 | + |
| 117 | + for (Type ty_arg : call_node->type_args) { |
| 118 | + VisitType(ty_arg); |
| 119 | + } |
| 120 | + |
| 121 | + for (Expr arg : call_node->args) { |
| 122 | + VisitExpr(arg); |
| 123 | + } |
| 124 | + |
| 125 | + if (call_node->shape_) { |
| 126 | + VisitExpr(Downcast<Expr>(call_node->shape_.value())); |
| 127 | + } |
| 128 | + |
| 129 | + if (const GlobalVarNode* global_var_node = call_node->op.as<GlobalVarNode>()) { |
| 130 | + rec_global_vars_.Insert(GetRef<GlobalVar>(global_var_node)); |
| 131 | + } |
| 132 | + } |
| 133 | + |
| 134 | + void VisitBinding_(const VarBindingNode* binding) final { |
| 135 | + MarkBounded(binding->var); |
| 136 | + VisitExpr(binding->value); |
| 137 | + VisitVarDef(binding->var); |
| 138 | + } |
| 139 | + |
| 140 | + private: |
| 141 | + InsertionSet<Var> vars_; |
| 142 | + InsertionSet<Var> bound_vars_; |
| 143 | + InsertionSet<GlobalVar> global_vars_; |
| 144 | + InsertionSet<GlobalVar> rec_global_vars_; |
| 145 | +}; |
| 146 | + |
| 147 | +tvm::Array<Var> FreeVars(const Expr& expr) { return VarVisitor().Free(expr); } |
| 148 | + |
| 149 | +tvm::Array<Var> BoundVars(const Expr& expr) { return VarVisitor().Bound(expr); } |
| 150 | + |
| 151 | +tvm::Array<Var> AllVars(const Expr& expr) { return VarVisitor().All(expr); } |
| 152 | + |
| 153 | +tvm::Array<GlobalVar> AllGlobalVars(const Expr& expr) { return VarVisitor().AllGlobalVars(expr); } |
| 154 | + |
| 155 | +tvm::Array<GlobalVar> RecGlobalVars(const Expr& expr) { return VarVisitor().RecGlobalVars(expr); } |
| 156 | + |
| 157 | +TVM_REGISTER_GLOBAL("relax.analysis.free_vars").set_body_typed(FreeVars); |
| 158 | + |
| 159 | +TVM_REGISTER_GLOBAL("relax.analysis.bound_vars").set_body_typed(BoundVars); |
| 160 | + |
| 161 | +TVM_REGISTER_GLOBAL("relax.analysis.all_vars").set_body_typed(AllVars); |
| 162 | + |
| 163 | +TVM_REGISTER_GLOBAL("relax.analysis.all_global_vars").set_body_typed(AllGlobalVars); |
| 164 | + |
| 165 | +TVM_REGISTER_GLOBAL("relax.analysis.rec_global_vars").set_body_typed(RecGlobalVars); |
| 166 | + |
| 167 | +} // namespace relax |
| 168 | +} // namespace tvm |
0 commit comments