// Copyright (c) 2016 Google Inc. // // 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. #ifndef SOURCE_OPT_PASS_H_ #define SOURCE_OPT_PASS_H_ #include <algorithm> #include <map> #include <unordered_map> #include <unordered_set> #include <utility> #include "source/opt/basic_block.h" #include "source/opt/def_use_manager.h" #include "source/opt/ir_context.h" #include "source/opt/module.h" #include "spirv-tools/libspirv.hpp" #include "types.h" // Avoid unused variable warning/error on Linux #ifndef NDEBUG #define USE_ASSERT(x) … #else #define USE_ASSERT … #endif namespace spvtools { namespace opt { // Abstract class of a pass. All passes should implement this abstract class // and all analysis and transformation is done via the Process() method. class Pass { … }; inline Pass::Status CombineStatus(Pass::Status a, Pass::Status b) { … } } // namespace opt } // namespace spvtools #endif // SOURCE_OPT_PASS_H_