junrushao1994 commented on a change in pull request #5962: URL: https://github.com/apache/incubator-tvm/pull/5962#discussion_r449933549
########## File path: src/ansor/loop_state.cc ########## @@ -0,0 +1,447 @@ +/* + * 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 + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * 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. + */ + +/*! + * \file ansor/loop_state.cc + * \brief An lightweight IR (intermediate representation) for loop structures. + * see ansor/loop_state.h for more explanation. + */ + +#include "loop_state.h" + +#include <tvm/runtime/registry.h> +#include <tvm/te/operation.h> + +#include <utility> + +#include "transform_step.h" +#include "utils.h" + +namespace tvm { +namespace ansor { + +TVM_REGISTER_OBJECT_TYPE(StepNode); +TVM_REGISTER_NODE_TYPE(StageNode); +TVM_REGISTER_NODE_TYPE(StateNode); +TVM_REGISTER_NODE_TYPE(IteratorNode); + +/********** Iterator **********/ +Iterator::Iterator(String name, Range range, IteratorType iter_type, + IteratorAnnotation annotation) { + auto node = make_object<IteratorNode>(); + node->name = std::move(name); + node->range = std::move(range); + node->iter_type = iter_type; + node->annotation = annotation; + data_ = std::move(node); +} + +/********** Stage **********/ +Stage::Stage(te::Operation op) { + auto node = make_object<StageNode>(); + if (op->IsInstance<te::ComputeOpNode>()) { + node->op_type = kCompute; + auto* pop = op.as<te::ComputeOpNode>(); + for (const auto& axis : pop->axis) { + node->iters.push_back(Iterator(CleanName(axis->var->name_hint), axis->dom, kSpace, kNone)); + } + for (const auto& axis : pop->reduce_axis) { + node->iters.push_back(Iterator(CleanName(axis->var->name_hint), axis->dom, kReduce, kNone)); + } + } else if (op->IsInstance<te::PlaceholderOpNode>()) { + node->op_type = kPlaceholder; + } else { + LOG(FATAL) << "Unsupported operator type" << op->_type_key; + } + + node->compute_at = kRoot; + node->op = std::move(op); + node->attrs.auto_unroll_max_step = 0; + node->attrs.storage_offset = 0; + data_ = std::move(node); +} + +Stage::Stage(te::Operation op, StageType op_type, const Array<Iterator>& iters, + ComputeAtType compute_at, StageAttributes attrs) { + auto node = make_object<StageNode>(); + node->op = std::move(op); + node->op_type = op_type; + node->iters = iters; + node->compute_at = compute_at; + node->attrs = attrs; + data_ = std::move(node); +} + +Stage::Stage(te::Operation op, StageType op_type, Array<Iterator>&& iters, ComputeAtType compute_at, + StageAttributes attrs) { + auto node = make_object<StageNode>(); + node->op = std::move(op); + node->op_type = op_type; + node->iters = std::move(iters); + node->compute_at = compute_at; + node->attrs = attrs; + data_ = std::move(node); +} + +/********** State **********/ +State::State(const Array<te::Operation>& ops) { + auto node = make_object<StateNode>(); + for (const auto& op : ops) { + node->stages.push_back(Stage(op)); + } + node->complete = true; + data_ = std::move(node); +} + +/********** Schedule primitives apis for state **********/ +void State::reorder(int stage_id, const Array<Iterator>& order) { + const Stage& stage = operator->()->stages[stage_id]; + CHECK_EQ(order.size(), stage->iters.size()) << "The order of all iterators " + << "should be specified"; + Array<Integer> after_ids; + GetIndices(stage->iters, order, &after_ids); + ReorderStep step = ReorderStep(stage_id, after_ids); + CopyOnWrite()->transform_steps.push_back(step); + DoReorderStep(step); +} + +Array<Iterator> State::split(int stage_id, const Iterator& it, const Array<Integer>& lengths, + bool inner_to_outer) { + const Stage& stage = operator->()->stages[stage_id]; + SplitStep step = + SplitStep(stage_id, GetIndex(stage->iters, it), + it->range.defined() ? it->range->extent : PrimExpr(), lengths, inner_to_outer); + CopyOnWrite()->transform_steps.push_back(step); + return DoSplitStep(step); +} + +Iterator State::fuse(int stage_id, const Array<Iterator>& iters) { + const Stage& stage = operator->()->stages[stage_id]; + Array<Integer> indices; + GetIndices(stage->iters, iters, &indices); + FuseStep step = FuseStep(stage_id, indices); + CopyOnWrite()->transform_steps.push_back(step); + return DoFuseStep(step); +} + +/********** Step implementations for state **********/ +void State::DoReorderStep(const ReorderStep& step) { + const Stage& stage = operator->()->stages[step->stage_id]; + Array<Iterator> iters; + for (auto x : step->after_ids) { + iters.push_back(stage->iters[x]); + } + StateNode* pstate = CopyOnWrite(); + pstate->stages.Set(step->stage_id, Stage(stage->op, stage->op_type, std::move(iters), + stage->compute_at, stage->attrs)); +} + +// common part for DoSplitStep, DoFollowSplitStep, and DoFollowFusedSplitStep +Array<Iterator> State::DoSplitStepCommon(int stage_id, int iter_id, const Array<Integer>& lengths, + bool inner_to_outer) { + const Stage& stage = operator->()->stages[stage_id]; + const Iterator& it = stage->iters[iter_id]; + + PrimExpr tosplit_min, tosplit_extent; Review comment: “Optional” makes the “nullable” semantics more explicit. To convert an “Optional” to its not-nullable type, use “.value()” :-) ---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: us...@infra.apache.org
