// Copyright (c) 2021 CINN Authors. All Rights Reserved. // // Licensed 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. #pragma once #include #include #include #include #include #include #include "paddle/cinn/common/common.h" #include "paddle/cinn/ir/tensor.h" #include "paddle/cinn/poly/graph.h" #include "paddle/cinn/poly/isl_utils.h" #include "paddle/cinn/poly/map.h" #include "paddle/cinn/poly/schedule.h" #include "paddle/cinn/poly/stage.h" namespace cinn { namespace poly { /** * Schedule a single group with iterator domain considered and follow the stage order. */ class PolyGroupScheduler : public SchedulerBase { public: //! Constructor, this will build a DAG based on the stages. explicit PolyGroupScheduler(const std::vector &stages); //! Build the schedule, that is set the time schedule following each edge. std::vector> Build(); private: const std::vector &stages_; }; /** * PolyScheduler - Perform schedule on polyhedral model. * It takes a normal schedule as input, merge two stages automatically if they have the same domain. */ class PolyScheduler : public SchedulerBase { public: /** * Constructor. * @param schedule A normal isl schedule, such as '{ S[i,j] -> [i,j] }' * * The schedule input can be transformed, that's ok, such as * '{ S[i,j] -> [i_outer, i_inner, j]: i_outer=floor(i/4) and i_inner=i%4 }' * that's OK. */ explicit PolyScheduler(const std::vector &stages, const std::vector> &extra_links = {}); /** * Build and create schedule. */ std::unique_ptr BuildSchedule(); private: //! Partition the graph into several groups. std::vector PartitionGroups(DataFlowGraph *graph); //! Schedule a single group. void ScheduleAGroup(ScheduleGroup *group); //! Schedule all the groups. void ScheduleGroups(); std::unique_ptr dfg_; //! The groups of ScheduleNode groups. std::vector schedule_groups_; }; } // namespace poly } // namespace cinn