mirror of
https://github.com/KhronosGroup/SPIRV-Tools
synced 2024-11-30 15:00:06 +00:00
a1f9e1342e
The following passes are updated to preserve the inst-to-block and def-use analysies: private-to-local aggressive dead-code elimination dead branch elimination local-single-block elimination local-single-store elimination reduce load size compact ids (inst-to-block only) merge block dead-insert elimination ccp The one execption is that compact ids still kills the def-use manager. This is because it changes so many ids it is faster to kill and rebuild. Does everything in https://github.com/KhronosGroup/SPIRV-Tools/issues/1593 except for the changes to merge return.
92 lines
3.3 KiB
C++
92 lines
3.3 KiB
C++
// Copyright (c) 2018 The Khronos Group Inc.
|
|
// Copyright (c) 2018 Valve Corporation
|
|
// Copyright (c) 2018 LunarG 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 LIBSPIRV_OPT_DEAD_INSERT_ELIM_PASS_H_
|
|
#define LIBSPIRV_OPT_DEAD_INSERT_ELIM_PASS_H_
|
|
|
|
#include <algorithm>
|
|
#include <map>
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
#include <utility>
|
|
|
|
#include "basic_block.h"
|
|
#include "def_use_manager.h"
|
|
#include "ir_context.h"
|
|
#include "mem_pass.h"
|
|
#include "module.h"
|
|
|
|
namespace spvtools {
|
|
namespace opt {
|
|
|
|
// See optimizer.hpp for documentation.
|
|
class DeadInsertElimPass : public MemPass {
|
|
public:
|
|
DeadInsertElimPass();
|
|
const char* name() const override { return "eliminate-dead-inserts"; }
|
|
Status Process(ir::IRContext*) override;
|
|
virtual ir::IRContext::Analysis GetPreservedAnalyses() override {
|
|
return ir::IRContext::kAnalysisDefUse |
|
|
ir::IRContext::kAnalysisInstrToBlockMapping |
|
|
ir::IRContext::kAnalysisDecorations |
|
|
ir::IRContext::kAnalysisCombinators | ir::IRContext::kAnalysisCFG |
|
|
ir::IRContext::kAnalysisDominatorAnalysis |
|
|
ir::IRContext::kAnalysisNameMap;
|
|
}
|
|
|
|
private:
|
|
// Return the number of subcomponents in the composite type |typeId|.
|
|
// Return 0 if not a composite type or number of components is not a
|
|
// 32-bit constant.
|
|
uint32_t NumComponents(ir::Instruction* typeInst);
|
|
|
|
// Mark all inserts in instruction chain ending at |insertChain| with
|
|
// indices that intersect with extract indices |extIndices| starting with
|
|
// index at |extOffset|. Chains are composed solely of Inserts and Phis.
|
|
// Mark all inserts in chain if |extIndices| is nullptr.
|
|
void MarkInsertChain(ir::Instruction* insertChain,
|
|
std::vector<uint32_t>* extIndices, uint32_t extOffset,
|
|
std::unordered_set<uint32_t>* visited_phis);
|
|
|
|
// Perform EliminateDeadInsertsOnePass(|func|) until no modification is
|
|
// made. Return true if modified.
|
|
bool EliminateDeadInserts(ir::Function* func);
|
|
|
|
// DCE all dead struct, matrix and vector inserts in |func|. An insert is
|
|
// dead if the value it inserts is never used. Replace any reference to the
|
|
// insert with its original composite. Return true if modified. Dead inserts
|
|
// in dependence cycles are not currently eliminated. Dead inserts into
|
|
// arrays are not currently eliminated.
|
|
bool EliminateDeadInsertsOnePass(ir::Function* func);
|
|
|
|
// Return true if all extensions in this module are allowed by this pass.
|
|
bool AllExtensionsSupported() const;
|
|
|
|
void Initialize(ir::IRContext* c);
|
|
Pass::Status ProcessImpl();
|
|
|
|
// Live inserts
|
|
std::unordered_set<uint32_t> liveInserts_;
|
|
|
|
// Visited phis as insert chain is traversed; used to avoid infinite loop
|
|
std::unordered_map<uint32_t, bool> visitedPhis_;
|
|
};
|
|
|
|
} // namespace opt
|
|
} // namespace spvtools
|
|
|
|
#endif // LIBSPIRV_OPT_DEAD_INSERT_ELIM_PASS_H_
|