1*c217d954SCole Faust /* 2*c217d954SCole Faust * Copyright (c) 2018-2019 Arm Limited. 3*c217d954SCole Faust * 4*c217d954SCole Faust * SPDX-License-Identifier: MIT 5*c217d954SCole Faust * 6*c217d954SCole Faust * Permission is hereby granted, free of charge, to any person obtaining a copy 7*c217d954SCole Faust * of this software and associated documentation files (the "Software"), to 8*c217d954SCole Faust * deal in the Software without restriction, including without limitation the 9*c217d954SCole Faust * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or 10*c217d954SCole Faust * sell copies of the Software, and to permit persons to whom the Software is 11*c217d954SCole Faust * furnished to do so, subject to the following conditions: 12*c217d954SCole Faust * 13*c217d954SCole Faust * The above copyright notice and this permission notice shall be included in all 14*c217d954SCole Faust * copies or substantial portions of the Software. 15*c217d954SCole Faust * 16*c217d954SCole Faust * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 17*c217d954SCole Faust * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 18*c217d954SCole Faust * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 19*c217d954SCole Faust * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 20*c217d954SCole Faust * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 21*c217d954SCole Faust * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 22*c217d954SCole Faust * SOFTWARE. 23*c217d954SCole Faust */ 24*c217d954SCole Faust #ifndef ARM_COMPUTE_GRAPH_PASSMANAGER_H 25*c217d954SCole Faust #define ARM_COMPUTE_GRAPH_PASSMANAGER_H 26*c217d954SCole Faust 27*c217d954SCole Faust #include "arm_compute/graph/IGraphMutator.h" 28*c217d954SCole Faust 29*c217d954SCole Faust #include <memory> 30*c217d954SCole Faust #include <vector> 31*c217d954SCole Faust 32*c217d954SCole Faust namespace arm_compute 33*c217d954SCole Faust { 34*c217d954SCole Faust namespace graph 35*c217d954SCole Faust { 36*c217d954SCole Faust // Forward declarations 37*c217d954SCole Faust class Graph; 38*c217d954SCole Faust 39*c217d954SCole Faust /** Pass manager 40*c217d954SCole Faust * 41*c217d954SCole Faust * Responsible for performing the mutating graph passes with a given order 42*c217d954SCole Faust **/ 43*c217d954SCole Faust class PassManager final 44*c217d954SCole Faust { 45*c217d954SCole Faust public: 46*c217d954SCole Faust /** Constructor */ 47*c217d954SCole Faust PassManager(); 48*c217d954SCole Faust /** Prevent instances of this class from being copied (As this class contains pointers) */ 49*c217d954SCole Faust PassManager(const PassManager &) = delete; 50*c217d954SCole Faust /** Default move constructor */ 51*c217d954SCole Faust PassManager(PassManager &&) = default; 52*c217d954SCole Faust /** Prevent instances of this class from being copied (As this class contains pointers) */ 53*c217d954SCole Faust PassManager &operator=(const PassManager &) = delete; 54*c217d954SCole Faust /** Default move assignment operator */ 55*c217d954SCole Faust PassManager &operator=(PassManager &&) = default; 56*c217d954SCole Faust /** Mutation passes accessors 57*c217d954SCole Faust * 58*c217d954SCole Faust * @return Returns the vector with the mutation passes that are to be executed on a graph 59*c217d954SCole Faust */ 60*c217d954SCole Faust const std::vector<std::unique_ptr<IGraphMutator>> &passes() const; 61*c217d954SCole Faust /** Accessor of a pass at a given index 62*c217d954SCole Faust * 63*c217d954SCole Faust * @param[in] index Index of the requested pass 64*c217d954SCole Faust * 65*c217d954SCole Faust * @return A pointer to the given pass if exists else nullptr 66*c217d954SCole Faust */ 67*c217d954SCole Faust IGraphMutator *pass(size_t index); 68*c217d954SCole Faust /** Appends a mutation pass 69*c217d954SCole Faust * 70*c217d954SCole Faust * @param[in] pass Pass to append 71*c217d954SCole Faust * @param[in] conditional (Optional) Append pass if true else false. Defaults to true. 72*c217d954SCole Faust */ 73*c217d954SCole Faust void append(std::unique_ptr<IGraphMutator> pass, bool conditional = true); 74*c217d954SCole Faust /** Clears all the passes */ 75*c217d954SCole Faust void clear(); 76*c217d954SCole Faust /** Runs all the mutation passes on a given graph 77*c217d954SCole Faust * 78*c217d954SCole Faust * @param[in, out] g Graph to run the mutations on 79*c217d954SCole Faust */ 80*c217d954SCole Faust void run_all(Graph &g); 81*c217d954SCole Faust /** Runs a mutation passes of a specific type on a given graph 82*c217d954SCole Faust * 83*c217d954SCole Faust * @param[in, out] g Graph to run the mutation on 84*c217d954SCole Faust * @param[in] type Type of the mutations to execute 85*c217d954SCole Faust */ 86*c217d954SCole Faust void run_type(Graph &g, IGraphMutator::MutationType type); 87*c217d954SCole Faust /** Runs a specific mutation pass on a given graph 88*c217d954SCole Faust * 89*c217d954SCole Faust * @param[in, out] g Graph to run the mutation on 90*c217d954SCole Faust * @param[in] index Index of the mutation to execute 91*c217d954SCole Faust */ 92*c217d954SCole Faust void run_index(Graph &g, size_t index); 93*c217d954SCole Faust 94*c217d954SCole Faust private: 95*c217d954SCole Faust std::vector<std::unique_ptr<IGraphMutator>> _passes; /**< Vector of graph passes */ 96*c217d954SCole Faust }; 97*c217d954SCole Faust } // namespace graph 98*c217d954SCole Faust } // namespace arm_compute 99*c217d954SCole Faust #endif /* ARM_COMPUTE_GRAPH_PASSMANAGER_H */ 100