mirror of
https://github.com/KhronosGroup/SPIRV-Tools
synced 2024-11-30 15:00:06 +00:00
eda2cfbe12
This Cl cleans up the include paths to be relative to the top level directory. Various include-what-you-use fixes have been added.
164 lines
5.9 KiB
C++
164 lines
5.9 KiB
C++
// Copyright (c) 2017 The Khronos Group Inc.
|
|
// Copyright (c) 2017 Valve Corporation
|
|
// Copyright (c) 2017 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 SOURCE_OPT_MEM_PASS_H_
|
|
#define SOURCE_OPT_MEM_PASS_H_
|
|
|
|
#include <algorithm>
|
|
#include <list>
|
|
#include <map>
|
|
#include <queue>
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
#include <utility>
|
|
|
|
#include "source/opt/basic_block.h"
|
|
#include "source/opt/def_use_manager.h"
|
|
#include "source/opt/dominator_analysis.h"
|
|
#include "source/opt/module.h"
|
|
#include "source/opt/pass.h"
|
|
|
|
namespace spvtools {
|
|
namespace opt {
|
|
|
|
// A common base class for mem2reg-type passes. Provides common
|
|
// utility functions and supporting state.
|
|
class MemPass : public Pass {
|
|
public:
|
|
virtual ~MemPass() = default;
|
|
|
|
// Returns an undef value for the given |var_id|'s type.
|
|
uint32_t GetUndefVal(uint32_t var_id) {
|
|
return Type2Undef(GetPointeeTypeId(get_def_use_mgr()->GetDef(var_id)));
|
|
}
|
|
|
|
// Given a load or store |ip|, return the pointer instruction.
|
|
// Also return the base variable's id in |varId|. If no base variable is
|
|
// found, |varId| will be 0.
|
|
Instruction* GetPtr(Instruction* ip, uint32_t* varId);
|
|
|
|
// Return true if |varId| is a previously identified target variable.
|
|
// Return false if |varId| is a previously identified non-target variable.
|
|
//
|
|
// Non-target variables are variable of function scope of a target type that
|
|
// are accessed with constant-index access chains. not accessed with
|
|
// non-constant-index access chains. Also cache non-target variables.
|
|
//
|
|
// If variable is not cached, return true if variable is a function scope
|
|
// variable of target type, false otherwise. Updates caches of target and
|
|
// non-target variables.
|
|
bool IsTargetVar(uint32_t varId);
|
|
|
|
// Collect target SSA variables. This traverses all the loads and stores in
|
|
// function |func| looking for variables that can be replaced with SSA IDs. It
|
|
// populates the sets |seen_target_vars_| and |seen_non_target_vars_|.
|
|
void CollectTargetVars(Function* func);
|
|
|
|
protected:
|
|
MemPass();
|
|
|
|
// Returns true if |typeInst| is a scalar type
|
|
// or a vector or matrix
|
|
bool IsBaseTargetType(const Instruction* typeInst) const;
|
|
|
|
// Returns true if |typeInst| is a math type or a struct or array
|
|
// of a math type.
|
|
// TODO(): Add more complex types to convert
|
|
bool IsTargetType(const Instruction* typeInst) const;
|
|
|
|
// Returns true if |opcode| is a non-ptr access chain op
|
|
bool IsNonPtrAccessChain(const SpvOp opcode) const;
|
|
|
|
// Given the id |ptrId|, return true if the top-most non-CopyObj is
|
|
// a variable, a non-ptr access chain or a parameter of pointer type.
|
|
bool IsPtr(uint32_t ptrId);
|
|
|
|
// Given the id of a pointer |ptrId|, return the top-most non-CopyObj.
|
|
// Also return the base variable's id in |varId|. If no base variable is
|
|
// found, |varId| will be 0.
|
|
Instruction* GetPtr(uint32_t ptrId, uint32_t* varId);
|
|
|
|
// Return true if all uses of |id| are only name or decorate ops.
|
|
bool HasOnlyNamesAndDecorates(uint32_t id) const;
|
|
|
|
// Kill all instructions in block |bp|. Whether or not to kill the label is
|
|
// indicated by |killLabel|.
|
|
void KillAllInsts(BasicBlock* bp, bool killLabel = true);
|
|
|
|
// Return true if any instruction loads from |varId|
|
|
bool HasLoads(uint32_t varId) const;
|
|
|
|
// Return true if |varId| is not a function variable or if it has
|
|
// a load
|
|
bool IsLiveVar(uint32_t varId) const;
|
|
|
|
// Add stores using |ptr_id| to |insts|
|
|
void AddStores(uint32_t ptr_id, std::queue<Instruction*>* insts);
|
|
|
|
// Delete |inst| and iterate DCE on all its operands if they are now
|
|
// useless. If a load is deleted and its variable has no other loads,
|
|
// delete all its variable's stores.
|
|
void DCEInst(Instruction* inst, const std::function<void(Instruction*)>&);
|
|
|
|
// Call all the cleanup helper functions on |func|.
|
|
bool CFGCleanup(Function* func);
|
|
|
|
// Return true if |op| is supported decorate.
|
|
inline bool IsNonTypeDecorate(uint32_t op) const {
|
|
return (op == SpvOpDecorate || op == SpvOpDecorateId);
|
|
}
|
|
|
|
// Return undef in function for type. Create and insert an undef after the
|
|
// first non-variable in the function if it doesn't already exist. Add
|
|
// undef to function undef map.
|
|
uint32_t Type2Undef(uint32_t type_id);
|
|
|
|
// Cache of verified target vars
|
|
std::unordered_set<uint32_t> seen_target_vars_;
|
|
|
|
// Cache of verified non-target vars
|
|
std::unordered_set<uint32_t> seen_non_target_vars_;
|
|
|
|
private:
|
|
// Return true if all uses of |varId| are only through supported reference
|
|
// operations ie. loads and store. Also cache in supported_ref_vars_.
|
|
// TODO(dnovillo): This function is replicated in other passes and it's
|
|
// slightly different in every pass. Is it possible to make one common
|
|
// implementation?
|
|
bool HasOnlySupportedRefs(uint32_t varId);
|
|
|
|
// Remove all the unreachable basic blocks in |func|.
|
|
bool RemoveUnreachableBlocks(Function* func);
|
|
|
|
// Remove the block pointed by the iterator |*bi|. This also removes
|
|
// all the instructions in the pointed-to block.
|
|
void RemoveBlock(Function::iterator* bi);
|
|
|
|
// Remove Phi operands in |phi| that are coming from blocks not in
|
|
// |reachable_blocks|.
|
|
void RemovePhiOperands(
|
|
Instruction* phi,
|
|
const std::unordered_set<BasicBlock*>& reachable_blocks);
|
|
|
|
// Map from type to undef
|
|
std::unordered_map<uint32_t, uint32_t> type2undefs_;
|
|
};
|
|
|
|
} // namespace opt
|
|
} // namespace spvtools
|
|
|
|
#endif // SOURCE_OPT_MEM_PASS_H_
|