2017-11-30 22:03:06 +00:00
|
|
|
// Copyright (c) 2017 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.
|
|
|
|
|
2018-08-03 19:06:09 +00:00
|
|
|
#include "source/opt/scalar_replacement_pass.h"
|
2017-11-30 22:03:06 +00:00
|
|
|
|
2018-08-03 19:06:09 +00:00
|
|
|
#include <algorithm>
|
2017-11-30 22:03:06 +00:00
|
|
|
#include <queue>
|
2017-12-08 20:33:19 +00:00
|
|
|
#include <tuple>
|
2018-08-03 19:06:09 +00:00
|
|
|
#include <utility>
|
|
|
|
|
|
|
|
#include "source/enum_string_mapping.h"
|
|
|
|
#include "source/extensions.h"
|
|
|
|
#include "source/opt/reflect.h"
|
|
|
|
#include "source/opt/types.h"
|
2018-08-14 16:44:54 +00:00
|
|
|
#include "source/util/make_unique.h"
|
2017-11-30 22:03:06 +00:00
|
|
|
|
|
|
|
namespace spvtools {
|
|
|
|
namespace opt {
|
|
|
|
|
2018-07-12 13:08:45 +00:00
|
|
|
Pass::Status ScalarReplacementPass::Process() {
|
2017-11-30 22:03:06 +00:00
|
|
|
Status status = Status::SuccessWithoutChange;
|
|
|
|
for (auto& f : *get_module()) {
|
|
|
|
Status functionStatus = ProcessFunction(&f);
|
|
|
|
if (functionStatus == Status::Failure)
|
|
|
|
return functionStatus;
|
|
|
|
else if (functionStatus == Status::SuccessWithChange)
|
|
|
|
status = functionStatus;
|
|
|
|
}
|
|
|
|
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
Pass::Status ScalarReplacementPass::ProcessFunction(Function* function) {
|
|
|
|
std::queue<Instruction*> worklist;
|
|
|
|
BasicBlock& entry = *function->begin();
|
2017-11-30 22:03:06 +00:00
|
|
|
for (auto iter = entry.begin(); iter != entry.end(); ++iter) {
|
|
|
|
// Function storage class OpVariables must appear as the first instructions
|
|
|
|
// of the entry block.
|
|
|
|
if (iter->opcode() != SpvOpVariable) break;
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* varInst = &*iter;
|
2017-11-30 22:03:06 +00:00
|
|
|
if (CanReplaceVariable(varInst)) {
|
|
|
|
worklist.push(varInst);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Status status = Status::SuccessWithoutChange;
|
|
|
|
while (!worklist.empty()) {
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* varInst = worklist.front();
|
2017-11-30 22:03:06 +00:00
|
|
|
worklist.pop();
|
|
|
|
|
2019-07-26 16:33:40 +00:00
|
|
|
Status var_status = ReplaceVariable(varInst, &worklist);
|
|
|
|
if (var_status == Status::Failure)
|
|
|
|
return var_status;
|
|
|
|
else if (var_status == Status::SuccessWithChange)
|
|
|
|
status = var_status;
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
2019-07-26 16:33:40 +00:00
|
|
|
Pass::Status ScalarReplacementPass::ReplaceVariable(
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* inst, std::queue<Instruction*>* worklist) {
|
|
|
|
std::vector<Instruction*> replacements;
|
2019-05-15 13:29:28 +00:00
|
|
|
if (!CreateReplacementVariables(inst, &replacements)) {
|
2019-07-26 16:33:40 +00:00
|
|
|
return Status::Failure;
|
2019-05-15 13:29:28 +00:00
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
std::vector<Instruction*> dead;
|
2019-08-21 17:12:42 +00:00
|
|
|
bool replaced_all_uses = get_def_use_mgr()->WhileEachUser(
|
|
|
|
inst, [this, &replacements, &dead](Instruction* user) {
|
|
|
|
if (!IsAnnotationInst(user->opcode())) {
|
|
|
|
switch (user->opcode()) {
|
|
|
|
case SpvOpLoad:
|
|
|
|
if (ReplaceWholeLoad(user, replacements)) {
|
|
|
|
dead.push_back(user);
|
|
|
|
} else {
|
|
|
|
return false;
|
2018-01-12 20:05:53 +00:00
|
|
|
}
|
2019-08-21 17:12:42 +00:00
|
|
|
break;
|
|
|
|
case SpvOpStore:
|
|
|
|
if (ReplaceWholeStore(user, replacements)) {
|
|
|
|
dead.push_back(user);
|
|
|
|
} else {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case SpvOpAccessChain:
|
|
|
|
case SpvOpInBoundsAccessChain:
|
|
|
|
if (ReplaceAccessChain(user, replacements))
|
|
|
|
dead.push_back(user);
|
|
|
|
else
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case SpvOpName:
|
|
|
|
case SpvOpMemberName:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
assert(false && "Unexpected opcode");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
});
|
|
|
|
|
|
|
|
if (replaced_all_uses) {
|
2019-07-26 16:33:40 +00:00
|
|
|
dead.push_back(inst);
|
2019-08-21 17:12:42 +00:00
|
|
|
} else {
|
|
|
|
return Status::Failure;
|
|
|
|
}
|
2019-07-26 16:33:40 +00:00
|
|
|
|
|
|
|
// If there are no dead instructions to clean up, return with no changes.
|
|
|
|
if (dead.empty()) return Status::SuccessWithoutChange;
|
2017-11-30 22:03:06 +00:00
|
|
|
|
|
|
|
// Clean up some dead code.
|
|
|
|
while (!dead.empty()) {
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* toKill = dead.back();
|
2017-11-30 22:03:06 +00:00
|
|
|
dead.pop_back();
|
|
|
|
context()->KillInst(toKill);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Attempt to further scalarize.
|
|
|
|
for (auto var : replacements) {
|
2018-05-11 21:02:57 +00:00
|
|
|
if (var->opcode() == SpvOpVariable) {
|
|
|
|
if (get_def_use_mgr()->NumUsers(var) == 0) {
|
|
|
|
context()->KillInst(var);
|
|
|
|
} else if (CanReplaceVariable(var)) {
|
|
|
|
worklist->push(var);
|
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-07-26 16:33:40 +00:00
|
|
|
return Status::SuccessWithChange;
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
|
2019-08-21 17:12:42 +00:00
|
|
|
bool ScalarReplacementPass::ReplaceWholeLoad(
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* load, const std::vector<Instruction*>& replacements) {
|
2017-11-30 22:03:06 +00:00
|
|
|
// Replaces the load of the entire composite with a load from each replacement
|
|
|
|
// variable followed by a composite construction.
|
2018-07-12 19:14:43 +00:00
|
|
|
BasicBlock* block = context()->get_instr_block(load);
|
|
|
|
std::vector<Instruction*> loads;
|
2017-11-30 22:03:06 +00:00
|
|
|
loads.reserve(replacements.size());
|
2018-07-12 19:14:43 +00:00
|
|
|
BasicBlock::iterator where(load);
|
2017-11-30 22:03:06 +00:00
|
|
|
for (auto var : replacements) {
|
|
|
|
// Create a load of each replacement variable.
|
2018-05-11 21:02:57 +00:00
|
|
|
if (var->opcode() != SpvOpVariable) {
|
|
|
|
loads.push_back(var);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* type = GetStorageType(var);
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t loadId = TakeNextId();
|
2019-08-21 17:12:42 +00:00
|
|
|
if (loadId == 0) {
|
|
|
|
return false;
|
|
|
|
}
|
2018-07-12 19:14:43 +00:00
|
|
|
std::unique_ptr<Instruction> newLoad(
|
|
|
|
new Instruction(context(), SpvOpLoad, type->result_id(), loadId,
|
|
|
|
std::initializer_list<Operand>{
|
|
|
|
{SPV_OPERAND_TYPE_ID, {var->result_id()}}}));
|
2017-11-30 22:03:06 +00:00
|
|
|
// Copy memory access attributes which start at index 1. Index 0 is the
|
|
|
|
// pointer to load.
|
|
|
|
for (uint32_t i = 1; i < load->NumInOperands(); ++i) {
|
2018-07-12 19:14:43 +00:00
|
|
|
Operand copy(load->GetInOperand(i));
|
2017-11-30 22:03:06 +00:00
|
|
|
newLoad->AddOperand(std::move(copy));
|
|
|
|
}
|
|
|
|
where = where.InsertBefore(std::move(newLoad));
|
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(&*where);
|
|
|
|
context()->set_instr_block(&*where, block);
|
|
|
|
loads.push_back(&*where);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Construct a new composite.
|
|
|
|
uint32_t compositeId = TakeNextId();
|
2019-08-21 17:12:42 +00:00
|
|
|
if (compositeId == 0) {
|
|
|
|
return false;
|
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
where = load;
|
2018-07-12 19:14:43 +00:00
|
|
|
std::unique_ptr<Instruction> compositeConstruct(new Instruction(
|
2017-11-30 22:03:06 +00:00
|
|
|
context(), SpvOpCompositeConstruct, load->type_id(), compositeId, {}));
|
|
|
|
for (auto l : loads) {
|
2018-07-12 19:14:43 +00:00
|
|
|
Operand op(SPV_OPERAND_TYPE_ID,
|
|
|
|
std::initializer_list<uint32_t>{l->result_id()});
|
2017-11-30 22:03:06 +00:00
|
|
|
compositeConstruct->AddOperand(std::move(op));
|
|
|
|
}
|
|
|
|
where = where.InsertBefore(std::move(compositeConstruct));
|
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(&*where);
|
|
|
|
context()->set_instr_block(&*where, block);
|
|
|
|
context()->ReplaceAllUsesWith(load->result_id(), compositeId);
|
2019-08-21 17:12:42 +00:00
|
|
|
return true;
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
|
2019-08-21 17:12:42 +00:00
|
|
|
bool ScalarReplacementPass::ReplaceWholeStore(
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* store, const std::vector<Instruction*>& replacements) {
|
2017-11-30 22:03:06 +00:00
|
|
|
// Replaces a store to the whole composite with a series of extract and stores
|
|
|
|
// to each element.
|
|
|
|
uint32_t storeInput = store->GetSingleWordInOperand(1u);
|
2018-07-12 19:14:43 +00:00
|
|
|
BasicBlock* block = context()->get_instr_block(store);
|
|
|
|
BasicBlock::iterator where(store);
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t elementIndex = 0;
|
|
|
|
for (auto var : replacements) {
|
|
|
|
// Create the extract.
|
2018-05-11 21:02:57 +00:00
|
|
|
if (var->opcode() != SpvOpVariable) {
|
|
|
|
elementIndex++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* type = GetStorageType(var);
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t extractId = TakeNextId();
|
2019-08-21 17:12:42 +00:00
|
|
|
if (extractId == 0) {
|
|
|
|
return false;
|
|
|
|
}
|
2018-07-12 19:14:43 +00:00
|
|
|
std::unique_ptr<Instruction> extract(new Instruction(
|
2017-11-30 22:03:06 +00:00
|
|
|
context(), SpvOpCompositeExtract, type->result_id(), extractId,
|
2018-07-12 19:14:43 +00:00
|
|
|
std::initializer_list<Operand>{
|
2017-11-30 22:03:06 +00:00
|
|
|
{SPV_OPERAND_TYPE_ID, {storeInput}},
|
|
|
|
{SPV_OPERAND_TYPE_LITERAL_INTEGER, {elementIndex++}}}));
|
|
|
|
auto iter = where.InsertBefore(std::move(extract));
|
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(&*iter);
|
|
|
|
context()->set_instr_block(&*iter, block);
|
|
|
|
|
|
|
|
// Create the store.
|
2018-07-12 19:14:43 +00:00
|
|
|
std::unique_ptr<Instruction> newStore(
|
|
|
|
new Instruction(context(), SpvOpStore, 0, 0,
|
|
|
|
std::initializer_list<Operand>{
|
|
|
|
{SPV_OPERAND_TYPE_ID, {var->result_id()}},
|
|
|
|
{SPV_OPERAND_TYPE_ID, {extractId}}}));
|
2017-11-30 22:03:06 +00:00
|
|
|
// Copy memory access attributes which start at index 2. Index 0 is the
|
|
|
|
// pointer and index 1 is the data.
|
|
|
|
for (uint32_t i = 2; i < store->NumInOperands(); ++i) {
|
2018-07-12 19:14:43 +00:00
|
|
|
Operand copy(store->GetInOperand(i));
|
2017-11-30 22:03:06 +00:00
|
|
|
newStore->AddOperand(std::move(copy));
|
|
|
|
}
|
|
|
|
iter = where.InsertBefore(std::move(newStore));
|
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(&*iter);
|
|
|
|
context()->set_instr_block(&*iter, block);
|
|
|
|
}
|
2019-08-21 17:12:42 +00:00
|
|
|
return true;
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool ScalarReplacementPass::ReplaceAccessChain(
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* chain, const std::vector<Instruction*>& replacements) {
|
2017-11-30 22:03:06 +00:00
|
|
|
// Replaces the access chain with either another access chain (with one fewer
|
|
|
|
// indexes) or a direct use of the replacement variable.
|
|
|
|
uint32_t indexId = chain->GetSingleWordInOperand(1u);
|
2018-07-12 19:14:43 +00:00
|
|
|
const Instruction* index = get_def_use_mgr()->GetDef(indexId);
|
2019-07-31 19:39:33 +00:00
|
|
|
int64_t indexValue = context()
|
|
|
|
->get_constant_mgr()
|
|
|
|
->GetConstantFromInst(index)
|
|
|
|
->GetSignExtendedValue();
|
|
|
|
if (indexValue < 0 ||
|
|
|
|
indexValue >= static_cast<int64_t>(replacements.size())) {
|
2019-07-26 16:33:40 +00:00
|
|
|
// Out of bounds access, this is illegal IR. Notice that OpAccessChain
|
|
|
|
// indexing is 0-based, so we should also reject index == size-of-array.
|
2017-11-30 22:03:06 +00:00
|
|
|
return false;
|
|
|
|
} else {
|
2019-04-26 16:52:23 +00:00
|
|
|
const Instruction* var = replacements[static_cast<size_t>(indexValue)];
|
2017-11-30 22:03:06 +00:00
|
|
|
if (chain->NumInOperands() > 2) {
|
|
|
|
// Replace input access chain with another access chain.
|
2018-07-12 19:14:43 +00:00
|
|
|
BasicBlock::iterator chainIter(chain);
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t replacementId = TakeNextId();
|
2019-08-21 17:12:42 +00:00
|
|
|
if (replacementId == 0) {
|
|
|
|
return false;
|
|
|
|
}
|
2018-07-12 19:14:43 +00:00
|
|
|
std::unique_ptr<Instruction> replacementChain(new Instruction(
|
2017-11-30 22:03:06 +00:00
|
|
|
context(), chain->opcode(), chain->type_id(), replacementId,
|
2018-07-12 19:14:43 +00:00
|
|
|
std::initializer_list<Operand>{
|
2017-11-30 22:03:06 +00:00
|
|
|
{SPV_OPERAND_TYPE_ID, {var->result_id()}}}));
|
|
|
|
// Add the remaining indexes.
|
|
|
|
for (uint32_t i = 2; i < chain->NumInOperands(); ++i) {
|
2018-07-12 19:14:43 +00:00
|
|
|
Operand copy(chain->GetInOperand(i));
|
2017-11-30 22:03:06 +00:00
|
|
|
replacementChain->AddOperand(std::move(copy));
|
|
|
|
}
|
|
|
|
auto iter = chainIter.InsertBefore(std::move(replacementChain));
|
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(&*iter);
|
|
|
|
context()->set_instr_block(&*iter, context()->get_instr_block(chain));
|
|
|
|
context()->ReplaceAllUsesWith(chain->result_id(), replacementId);
|
|
|
|
} else {
|
|
|
|
// Replace with a use of the variable.
|
|
|
|
context()->ReplaceAllUsesWith(chain->result_id(), var->result_id());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2019-05-15 13:29:28 +00:00
|
|
|
bool ScalarReplacementPass::CreateReplacementVariables(
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* inst, std::vector<Instruction*>* replacements) {
|
|
|
|
Instruction* type = GetStorageType(inst);
|
2018-05-11 21:02:57 +00:00
|
|
|
|
2019-07-31 19:39:33 +00:00
|
|
|
std::unique_ptr<std::unordered_set<int64_t>> components_used =
|
2018-05-11 21:02:57 +00:00
|
|
|
GetUsedComponents(inst);
|
|
|
|
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t elem = 0;
|
|
|
|
switch (type->opcode()) {
|
|
|
|
case SpvOpTypeStruct:
|
2018-05-11 21:02:57 +00:00
|
|
|
type->ForEachInOperand(
|
|
|
|
[this, inst, &elem, replacements, &components_used](uint32_t* id) {
|
|
|
|
if (!components_used || components_used->count(elem)) {
|
|
|
|
CreateVariable(*id, inst, elem, replacements);
|
|
|
|
} else {
|
|
|
|
replacements->push_back(CreateNullConstant(*id));
|
|
|
|
}
|
|
|
|
elem++;
|
|
|
|
});
|
2017-11-30 22:03:06 +00:00
|
|
|
break;
|
|
|
|
case SpvOpTypeArray:
|
|
|
|
for (uint32_t i = 0; i != GetArrayLength(type); ++i) {
|
2018-05-11 21:02:57 +00:00
|
|
|
if (!components_used || components_used->count(i)) {
|
|
|
|
CreateVariable(type->GetSingleWordInOperand(0u), inst, i,
|
|
|
|
replacements);
|
|
|
|
} else {
|
|
|
|
replacements->push_back(
|
|
|
|
CreateNullConstant(type->GetSingleWordInOperand(0u)));
|
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SpvOpTypeMatrix:
|
|
|
|
case SpvOpTypeVector:
|
|
|
|
for (uint32_t i = 0; i != GetNumElements(type); ++i) {
|
|
|
|
CreateVariable(type->GetSingleWordInOperand(0u), inst, i, replacements);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
assert(false && "Unexpected type.");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
TransferAnnotations(inst, replacements);
|
2019-05-15 13:29:28 +00:00
|
|
|
return std::find(replacements->begin(), replacements->end(), nullptr) ==
|
|
|
|
replacements->end();
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ScalarReplacementPass::TransferAnnotations(
|
2018-07-12 19:14:43 +00:00
|
|
|
const Instruction* source, std::vector<Instruction*>* replacements) {
|
2017-11-30 22:03:06 +00:00
|
|
|
// Only transfer invariant and restrict decorations on the variable. There are
|
|
|
|
// no type or member decorations that are necessary to transfer.
|
|
|
|
for (auto inst :
|
|
|
|
get_decoration_mgr()->GetDecorationsFor(source->result_id(), false)) {
|
|
|
|
assert(inst->opcode() == SpvOpDecorate);
|
|
|
|
uint32_t decoration = inst->GetSingleWordInOperand(1u);
|
|
|
|
if (decoration == SpvDecorationInvariant ||
|
|
|
|
decoration == SpvDecorationRestrict) {
|
|
|
|
for (auto var : *replacements) {
|
2019-08-16 17:15:17 +00:00
|
|
|
if (var == nullptr) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
std::unique_ptr<Instruction> annotation(
|
|
|
|
new Instruction(context(), SpvOpDecorate, 0, 0,
|
|
|
|
std::initializer_list<Operand>{
|
|
|
|
{SPV_OPERAND_TYPE_ID, {var->result_id()}},
|
|
|
|
{SPV_OPERAND_TYPE_DECORATION, {decoration}}}));
|
2017-11-30 22:03:06 +00:00
|
|
|
for (uint32_t i = 2; i < inst->NumInOperands(); ++i) {
|
2018-07-12 19:14:43 +00:00
|
|
|
Operand copy(inst->GetInOperand(i));
|
2017-11-30 22:03:06 +00:00
|
|
|
annotation->AddOperand(std::move(copy));
|
|
|
|
}
|
|
|
|
context()->AddAnnotationInst(std::move(annotation));
|
|
|
|
get_def_use_mgr()->AnalyzeInstUse(&*--context()->annotation_end());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ScalarReplacementPass::CreateVariable(
|
2018-07-12 19:14:43 +00:00
|
|
|
uint32_t typeId, Instruction* varInst, uint32_t index,
|
|
|
|
std::vector<Instruction*>* replacements) {
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t ptrId = GetOrCreatePointerType(typeId);
|
|
|
|
uint32_t id = TakeNextId();
|
2019-08-16 17:15:17 +00:00
|
|
|
|
|
|
|
if (id == 0) {
|
|
|
|
replacements->push_back(nullptr);
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
std::unique_ptr<Instruction> variable(new Instruction(
|
2017-11-30 22:03:06 +00:00
|
|
|
context(), SpvOpVariable, ptrId, id,
|
2018-07-12 19:14:43 +00:00
|
|
|
std::initializer_list<Operand>{
|
2017-11-30 22:03:06 +00:00
|
|
|
{SPV_OPERAND_TYPE_STORAGE_CLASS, {SpvStorageClassFunction}}}));
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
BasicBlock* block = context()->get_instr_block(varInst);
|
2017-11-30 22:03:06 +00:00
|
|
|
block->begin().InsertBefore(std::move(variable));
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* inst = &*block->begin();
|
2017-11-30 22:03:06 +00:00
|
|
|
|
|
|
|
// If varInst was initialized, make sure to initialize its replacement.
|
|
|
|
GetOrCreateInitialValue(varInst, index, inst);
|
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(inst);
|
|
|
|
context()->set_instr_block(inst, block);
|
|
|
|
|
2019-08-07 16:17:26 +00:00
|
|
|
// Copy decorations from the member to the new variable.
|
|
|
|
Instruction* typeInst = GetStorageType(varInst);
|
|
|
|
for (auto dec_inst :
|
|
|
|
get_decoration_mgr()->GetDecorationsFor(typeInst->result_id(), false)) {
|
|
|
|
uint32_t decoration;
|
|
|
|
if (dec_inst->opcode() != SpvOpMemberDecorate) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (dec_inst->GetSingleWordInOperand(1) != index) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
decoration = dec_inst->GetSingleWordInOperand(2u);
|
|
|
|
switch (decoration) {
|
|
|
|
case SpvDecorationRelaxedPrecision: {
|
|
|
|
std::unique_ptr<Instruction> new_dec_inst(
|
|
|
|
new Instruction(context(), SpvOpDecorate, 0, 0, {}));
|
|
|
|
new_dec_inst->AddOperand(Operand(SPV_OPERAND_TYPE_ID, {id}));
|
|
|
|
for (uint32_t i = 2; i < dec_inst->NumInOperandWords(); ++i) {
|
|
|
|
new_dec_inst->AddOperand(Operand(dec_inst->GetInOperand(i)));
|
|
|
|
}
|
|
|
|
context()->AddAnnotationInst(std::move(new_dec_inst));
|
|
|
|
} break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-11-30 22:03:06 +00:00
|
|
|
replacements->push_back(inst);
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t ScalarReplacementPass::GetOrCreatePointerType(uint32_t id) {
|
|
|
|
auto iter = pointee_to_pointer_.find(id);
|
|
|
|
if (iter != pointee_to_pointer_.end()) return iter->second;
|
|
|
|
|
2017-12-08 20:33:19 +00:00
|
|
|
analysis::Type* pointeeTy;
|
|
|
|
std::unique_ptr<analysis::Pointer> pointerTy;
|
|
|
|
std::tie(pointeeTy, pointerTy) =
|
|
|
|
context()->get_type_mgr()->GetTypeAndPointerType(id,
|
|
|
|
SpvStorageClassFunction);
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t ptrId = 0;
|
2018-12-19 17:07:29 +00:00
|
|
|
if (pointeeTy->IsUniqueType()) {
|
2017-12-08 20:33:19 +00:00
|
|
|
// Non-ambiguous type, just ask the type manager for an id.
|
|
|
|
ptrId = context()->get_type_mgr()->GetTypeInstruction(pointerTy.get());
|
|
|
|
pointee_to_pointer_[id] = ptrId;
|
|
|
|
return ptrId;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ambiguous type. We must perform a linear search to try and find the right
|
|
|
|
// type.
|
2017-11-30 22:03:06 +00:00
|
|
|
for (auto global : context()->types_values()) {
|
|
|
|
if (global.opcode() == SpvOpTypePointer &&
|
|
|
|
global.GetSingleWordInOperand(0u) == SpvStorageClassFunction &&
|
|
|
|
global.GetSingleWordInOperand(1u) == id) {
|
2018-05-25 17:20:31 +00:00
|
|
|
if (get_decoration_mgr()->GetDecorationsFor(id, false).empty()) {
|
|
|
|
// Only reuse a decoration-less pointer of the correct type.
|
2017-11-30 22:03:06 +00:00
|
|
|
ptrId = global.result_id();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ptrId != 0) {
|
|
|
|
pointee_to_pointer_[id] = ptrId;
|
|
|
|
return ptrId;
|
|
|
|
}
|
|
|
|
|
|
|
|
ptrId = TakeNextId();
|
2018-07-12 19:14:43 +00:00
|
|
|
context()->AddType(MakeUnique<Instruction>(
|
2017-11-30 22:03:06 +00:00
|
|
|
context(), SpvOpTypePointer, 0, ptrId,
|
2018-07-12 19:14:43 +00:00
|
|
|
std::initializer_list<Operand>{
|
2017-11-30 22:03:06 +00:00
|
|
|
{SPV_OPERAND_TYPE_STORAGE_CLASS, {SpvStorageClassFunction}},
|
|
|
|
{SPV_OPERAND_TYPE_ID, {id}}}));
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* ptr = &*--context()->types_values_end();
|
2017-11-30 22:03:06 +00:00
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(ptr);
|
|
|
|
pointee_to_pointer_[id] = ptrId;
|
2017-12-08 20:33:19 +00:00
|
|
|
// Register with the type manager if necessary.
|
|
|
|
context()->get_type_mgr()->RegisterType(ptrId, *pointerTy);
|
2017-11-30 22:03:06 +00:00
|
|
|
|
|
|
|
return ptrId;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
void ScalarReplacementPass::GetOrCreateInitialValue(Instruction* source,
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t index,
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* newVar) {
|
2017-11-30 22:03:06 +00:00
|
|
|
assert(source->opcode() == SpvOpVariable);
|
|
|
|
if (source->NumInOperands() < 2) return;
|
|
|
|
|
|
|
|
uint32_t initId = source->GetSingleWordInOperand(1u);
|
|
|
|
uint32_t storageId = GetStorageType(newVar)->result_id();
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* init = get_def_use_mgr()->GetDef(initId);
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t newInitId = 0;
|
|
|
|
// TODO(dnovillo): Refactor this with constant propagation.
|
|
|
|
if (init->opcode() == SpvOpConstantNull) {
|
|
|
|
// Initialize to appropriate NULL.
|
|
|
|
auto iter = type_to_null_.find(storageId);
|
|
|
|
if (iter == type_to_null_.end()) {
|
|
|
|
newInitId = TakeNextId();
|
|
|
|
type_to_null_[storageId] = newInitId;
|
2018-07-12 19:14:43 +00:00
|
|
|
context()->AddGlobalValue(
|
|
|
|
MakeUnique<Instruction>(context(), SpvOpConstantNull, storageId,
|
|
|
|
newInitId, std::initializer_list<Operand>{}));
|
|
|
|
Instruction* newNull = &*--context()->types_values_end();
|
2017-11-30 22:03:06 +00:00
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(newNull);
|
|
|
|
} else {
|
|
|
|
newInitId = iter->second;
|
|
|
|
}
|
2018-07-12 19:14:43 +00:00
|
|
|
} else if (IsSpecConstantInst(init->opcode())) {
|
2017-11-30 22:03:06 +00:00
|
|
|
// Create a new constant extract.
|
|
|
|
newInitId = TakeNextId();
|
2018-07-12 19:14:43 +00:00
|
|
|
context()->AddGlobalValue(MakeUnique<Instruction>(
|
2017-11-30 22:03:06 +00:00
|
|
|
context(), SpvOpSpecConstantOp, storageId, newInitId,
|
2018-07-12 19:14:43 +00:00
|
|
|
std::initializer_list<Operand>{
|
2017-11-30 22:03:06 +00:00
|
|
|
{SPV_OPERAND_TYPE_SPEC_CONSTANT_OP_NUMBER, {SpvOpCompositeExtract}},
|
|
|
|
{SPV_OPERAND_TYPE_ID, {init->result_id()}},
|
|
|
|
{SPV_OPERAND_TYPE_LITERAL_INTEGER, {index}}}));
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* newSpecConst = &*--context()->types_values_end();
|
2017-11-30 22:03:06 +00:00
|
|
|
get_def_use_mgr()->AnalyzeInstDefUse(newSpecConst);
|
|
|
|
} else if (init->opcode() == SpvOpConstantComposite) {
|
|
|
|
// Get the appropriate index constant.
|
|
|
|
newInitId = init->GetSingleWordInOperand(index);
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* element = get_def_use_mgr()->GetDef(newInitId);
|
2017-11-30 22:03:06 +00:00
|
|
|
if (element->opcode() == SpvOpUndef) {
|
|
|
|
// Undef is not a valid initializer for a variable.
|
|
|
|
newInitId = 0;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (newInitId != 0) {
|
|
|
|
newVar->AddOperand({SPV_OPERAND_TYPE_ID, {newInitId}});
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-04-26 16:52:23 +00:00
|
|
|
uint64_t ScalarReplacementPass::GetArrayLength(
|
2018-07-12 19:14:43 +00:00
|
|
|
const Instruction* arrayType) const {
|
2017-11-30 22:03:06 +00:00
|
|
|
assert(arrayType->opcode() == SpvOpTypeArray);
|
2018-07-12 19:14:43 +00:00
|
|
|
const Instruction* length =
|
2017-11-30 22:03:06 +00:00
|
|
|
get_def_use_mgr()->GetDef(arrayType->GetSingleWordInOperand(1u));
|
2019-07-31 19:39:33 +00:00
|
|
|
return context()
|
|
|
|
->get_constant_mgr()
|
|
|
|
->GetConstantFromInst(length)
|
|
|
|
->GetZeroExtendedValue();
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
|
2019-04-26 16:52:23 +00:00
|
|
|
uint64_t ScalarReplacementPass::GetNumElements(const Instruction* type) const {
|
2017-11-30 22:03:06 +00:00
|
|
|
assert(type->opcode() == SpvOpTypeVector ||
|
|
|
|
type->opcode() == SpvOpTypeMatrix);
|
2018-07-12 19:14:43 +00:00
|
|
|
const Operand& op = type->GetInOperand(1u);
|
2017-11-30 22:03:06 +00:00
|
|
|
assert(op.words.size() <= 2);
|
2019-04-26 16:52:23 +00:00
|
|
|
uint64_t len = 0;
|
|
|
|
for (size_t i = 0; i != op.words.size(); ++i) {
|
|
|
|
len |= (static_cast<uint64_t>(op.words[i]) << (32ull * i));
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
2018-10-04 13:00:24 +00:00
|
|
|
bool ScalarReplacementPass::IsSpecConstant(uint32_t id) const {
|
|
|
|
const Instruction* inst = get_def_use_mgr()->GetDef(id);
|
|
|
|
assert(inst);
|
|
|
|
return spvOpcodeIsSpecConstant(inst->opcode());
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* ScalarReplacementPass::GetStorageType(
|
|
|
|
const Instruction* inst) const {
|
2017-11-30 22:03:06 +00:00
|
|
|
assert(inst->opcode() == SpvOpVariable);
|
|
|
|
|
|
|
|
uint32_t ptrTypeId = inst->type_id();
|
|
|
|
uint32_t typeId =
|
|
|
|
get_def_use_mgr()->GetDef(ptrTypeId)->GetSingleWordInOperand(1u);
|
|
|
|
return get_def_use_mgr()->GetDef(typeId);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ScalarReplacementPass::CanReplaceVariable(
|
2018-07-12 19:14:43 +00:00
|
|
|
const Instruction* varInst) const {
|
2017-11-30 22:03:06 +00:00
|
|
|
assert(varInst->opcode() == SpvOpVariable);
|
|
|
|
|
|
|
|
// Can only replace function scope variables.
|
2019-08-07 16:17:26 +00:00
|
|
|
if (varInst->GetSingleWordInOperand(0u) != SpvStorageClassFunction) {
|
2017-11-30 22:03:06 +00:00
|
|
|
return false;
|
2019-08-07 16:17:26 +00:00
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
|
2019-08-07 16:17:26 +00:00
|
|
|
if (!CheckTypeAnnotations(get_def_use_mgr()->GetDef(varInst->type_id()))) {
|
2017-11-30 22:03:06 +00:00
|
|
|
return false;
|
2019-08-07 16:17:26 +00:00
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
const Instruction* typeInst = GetStorageType(varInst);
|
2019-08-07 16:17:26 +00:00
|
|
|
if (!CheckType(typeInst)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!CheckAnnotations(varInst)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!CheckUses(varInst)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
bool ScalarReplacementPass::CheckType(const Instruction* typeInst) const {
|
2019-08-07 16:17:26 +00:00
|
|
|
if (!CheckTypeAnnotations(typeInst)) {
|
|
|
|
return false;
|
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
|
|
|
|
switch (typeInst->opcode()) {
|
|
|
|
case SpvOpTypeStruct:
|
|
|
|
// Don't bother with empty structs or very large structs.
|
|
|
|
if (typeInst->NumInOperands() == 0 ||
|
2019-08-07 16:17:26 +00:00
|
|
|
IsLargerThanSizeLimit(typeInst->NumInOperands())) {
|
2017-11-30 22:03:06 +00:00
|
|
|
return false;
|
2019-08-07 16:17:26 +00:00
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
return true;
|
|
|
|
case SpvOpTypeArray:
|
2018-10-04 13:00:24 +00:00
|
|
|
if (IsSpecConstant(typeInst->GetSingleWordInOperand(1u))) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (IsLargerThanSizeLimit(GetArrayLength(typeInst))) {
|
|
|
|
return false;
|
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
return true;
|
2018-04-16 13:58:00 +00:00
|
|
|
// TODO(alanbaker): Develop some heuristics for when this should be
|
|
|
|
// re-enabled.
|
|
|
|
//// Specifically including matrix and vector in an attempt to reduce the
|
|
|
|
//// number of vector registers required.
|
|
|
|
// case SpvOpTypeMatrix:
|
|
|
|
// case SpvOpTypeVector:
|
|
|
|
// if (IsLargerThanSizeLimit(GetNumElements(typeInst))) return false;
|
|
|
|
// return true;
|
2017-11-30 22:03:06 +00:00
|
|
|
|
|
|
|
case SpvOpTypeRuntimeArray:
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ScalarReplacementPass::CheckTypeAnnotations(
|
2018-07-12 19:14:43 +00:00
|
|
|
const Instruction* typeInst) const {
|
2017-11-30 22:03:06 +00:00
|
|
|
for (auto inst :
|
|
|
|
get_decoration_mgr()->GetDecorationsFor(typeInst->result_id(), false)) {
|
|
|
|
uint32_t decoration;
|
|
|
|
if (inst->opcode() == SpvOpDecorate) {
|
|
|
|
decoration = inst->GetSingleWordInOperand(1u);
|
|
|
|
} else {
|
|
|
|
assert(inst->opcode() == SpvOpMemberDecorate);
|
|
|
|
decoration = inst->GetSingleWordInOperand(2u);
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (decoration) {
|
|
|
|
case SpvDecorationRowMajor:
|
|
|
|
case SpvDecorationColMajor:
|
|
|
|
case SpvDecorationArrayStride:
|
|
|
|
case SpvDecorationMatrixStride:
|
|
|
|
case SpvDecorationCPacked:
|
|
|
|
case SpvDecorationInvariant:
|
|
|
|
case SpvDecorationRestrict:
|
|
|
|
case SpvDecorationOffset:
|
|
|
|
case SpvDecorationAlignment:
|
|
|
|
case SpvDecorationAlignmentId:
|
|
|
|
case SpvDecorationMaxByteOffset:
|
2019-08-07 16:17:26 +00:00
|
|
|
case SpvDecorationRelaxedPrecision:
|
2017-11-30 22:03:06 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
bool ScalarReplacementPass::CheckAnnotations(const Instruction* varInst) const {
|
2017-11-30 22:03:06 +00:00
|
|
|
for (auto inst :
|
|
|
|
get_decoration_mgr()->GetDecorationsFor(varInst->result_id(), false)) {
|
|
|
|
assert(inst->opcode() == SpvOpDecorate);
|
|
|
|
uint32_t decoration = inst->GetSingleWordInOperand(1u);
|
|
|
|
switch (decoration) {
|
|
|
|
case SpvDecorationInvariant:
|
|
|
|
case SpvDecorationRestrict:
|
|
|
|
case SpvDecorationAlignment:
|
|
|
|
case SpvDecorationAlignmentId:
|
|
|
|
case SpvDecorationMaxByteOffset:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
bool ScalarReplacementPass::CheckUses(const Instruction* inst) const {
|
2017-11-30 22:03:06 +00:00
|
|
|
VariableStats stats = {0, 0};
|
|
|
|
bool ok = CheckUses(inst, &stats);
|
|
|
|
|
2018-02-07 02:54:58 +00:00
|
|
|
// TODO(alanbaker/greg-lunarg): Add some meaningful heuristics about when
|
|
|
|
// SRoA is costly, such as when the structure has many (unaccessed?)
|
|
|
|
// members.
|
2017-11-30 22:03:06 +00:00
|
|
|
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
bool ScalarReplacementPass::CheckUses(const Instruction* inst,
|
2017-11-30 22:03:06 +00:00
|
|
|
VariableStats* stats) const {
|
2019-08-21 17:12:42 +00:00
|
|
|
uint64_t max_legal_index = GetMaxLegalIndex(inst);
|
|
|
|
|
2017-11-30 22:03:06 +00:00
|
|
|
bool ok = true;
|
2019-08-21 17:12:42 +00:00
|
|
|
get_def_use_mgr()->ForEachUse(inst, [this, max_legal_index, stats, &ok](
|
|
|
|
const Instruction* user,
|
|
|
|
uint32_t index) {
|
|
|
|
// Annotations are check as a group separately.
|
|
|
|
if (!IsAnnotationInst(user->opcode())) {
|
|
|
|
switch (user->opcode()) {
|
|
|
|
case SpvOpAccessChain:
|
|
|
|
case SpvOpInBoundsAccessChain:
|
|
|
|
if (index == 2u && user->NumInOperands() > 1) {
|
|
|
|
uint32_t id = user->GetSingleWordInOperand(1u);
|
|
|
|
const Instruction* opInst = get_def_use_mgr()->GetDef(id);
|
|
|
|
const auto* constant =
|
|
|
|
context()->get_constant_mgr()->GetConstantFromInst(opInst);
|
|
|
|
if (!constant) {
|
2017-11-30 22:03:06 +00:00
|
|
|
ok = false;
|
2019-08-21 17:12:42 +00:00
|
|
|
} else if (constant->GetZeroExtendedValue() >= max_legal_index) {
|
|
|
|
ok = false;
|
|
|
|
} else {
|
|
|
|
if (!CheckUsesRelaxed(user)) ok = false;
|
|
|
|
}
|
|
|
|
stats->num_partial_accesses++;
|
|
|
|
} else {
|
|
|
|
ok = false;
|
2017-11-30 22:03:06 +00:00
|
|
|
}
|
2019-08-21 17:12:42 +00:00
|
|
|
break;
|
|
|
|
case SpvOpLoad:
|
|
|
|
if (!CheckLoad(user, index)) ok = false;
|
|
|
|
stats->num_full_accesses++;
|
|
|
|
break;
|
|
|
|
case SpvOpStore:
|
|
|
|
if (!CheckStore(user, index)) ok = false;
|
|
|
|
stats->num_full_accesses++;
|
|
|
|
break;
|
|
|
|
case SpvOpName:
|
|
|
|
case SpvOpMemberName:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ok = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
});
|
2017-11-30 22:03:06 +00:00
|
|
|
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
bool ScalarReplacementPass::CheckUsesRelaxed(const Instruction* inst) const {
|
2017-11-30 22:03:06 +00:00
|
|
|
bool ok = true;
|
|
|
|
get_def_use_mgr()->ForEachUse(
|
2018-07-12 19:14:43 +00:00
|
|
|
inst, [this, &ok](const Instruction* user, uint32_t index) {
|
2017-11-30 22:03:06 +00:00
|
|
|
switch (user->opcode()) {
|
|
|
|
case SpvOpAccessChain:
|
|
|
|
case SpvOpInBoundsAccessChain:
|
|
|
|
if (index != 2u) {
|
|
|
|
ok = false;
|
|
|
|
} else {
|
|
|
|
if (!CheckUsesRelaxed(user)) ok = false;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case SpvOpLoad:
|
|
|
|
if (!CheckLoad(user, index)) ok = false;
|
|
|
|
break;
|
|
|
|
case SpvOpStore:
|
|
|
|
if (!CheckStore(user, index)) ok = false;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ok = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
});
|
|
|
|
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
bool ScalarReplacementPass::CheckLoad(const Instruction* inst,
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t index) const {
|
|
|
|
if (index != 2u) return false;
|
|
|
|
if (inst->NumInOperands() >= 2 &&
|
|
|
|
inst->GetSingleWordInOperand(1u) & SpvMemoryAccessVolatileMask)
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
bool ScalarReplacementPass::CheckStore(const Instruction* inst,
|
2017-11-30 22:03:06 +00:00
|
|
|
uint32_t index) const {
|
|
|
|
if (index != 0u) return false;
|
|
|
|
if (inst->NumInOperands() >= 3 &&
|
|
|
|
inst->GetSingleWordInOperand(2u) & SpvMemoryAccessVolatileMask)
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
2019-04-26 16:52:23 +00:00
|
|
|
bool ScalarReplacementPass::IsLargerThanSizeLimit(uint64_t length) const {
|
2018-04-16 13:58:00 +00:00
|
|
|
if (max_num_elements_ == 0) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return length > max_num_elements_;
|
|
|
|
}
|
2017-11-30 22:03:06 +00:00
|
|
|
|
2019-07-31 19:39:33 +00:00
|
|
|
std::unique_ptr<std::unordered_set<int64_t>>
|
2018-07-12 19:14:43 +00:00
|
|
|
ScalarReplacementPass::GetUsedComponents(Instruction* inst) {
|
2019-07-31 19:39:33 +00:00
|
|
|
std::unique_ptr<std::unordered_set<int64_t>> result(
|
|
|
|
new std::unordered_set<int64_t>());
|
2018-05-11 21:02:57 +00:00
|
|
|
|
|
|
|
analysis::DefUseManager* def_use_mgr = context()->get_def_use_mgr();
|
|
|
|
|
|
|
|
def_use_mgr->WhileEachUser(inst, [&result, def_use_mgr,
|
2018-07-12 19:14:43 +00:00
|
|
|
this](Instruction* use) {
|
2018-05-11 21:02:57 +00:00
|
|
|
switch (use->opcode()) {
|
|
|
|
case SpvOpLoad: {
|
|
|
|
// Look for extract from the load.
|
|
|
|
std::vector<uint32_t> t;
|
2018-07-12 19:14:43 +00:00
|
|
|
if (def_use_mgr->WhileEachUser(use, [&t](Instruction* use2) {
|
2019-09-24 20:19:31 +00:00
|
|
|
if (use2->opcode() != SpvOpCompositeExtract ||
|
|
|
|
use2->NumInOperands() <= 1) {
|
2018-05-11 21:02:57 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
t.push_back(use2->GetSingleWordInOperand(1));
|
|
|
|
return true;
|
|
|
|
})) {
|
|
|
|
result->insert(t.begin(), t.end());
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
result.reset(nullptr);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
2018-12-19 17:07:29 +00:00
|
|
|
case SpvOpName:
|
|
|
|
case SpvOpMemberName:
|
2018-05-11 21:02:57 +00:00
|
|
|
case SpvOpStore:
|
2018-12-19 17:07:29 +00:00
|
|
|
// No components are used.
|
2018-05-11 21:02:57 +00:00
|
|
|
return true;
|
|
|
|
case SpvOpAccessChain:
|
|
|
|
case SpvOpInBoundsAccessChain: {
|
|
|
|
// Add the first index it if is a constant.
|
|
|
|
// TODO: Could be improved by checking if the address is used in a load.
|
|
|
|
analysis::ConstantManager* const_mgr = context()->get_constant_mgr();
|
|
|
|
uint32_t index_id = use->GetSingleWordInOperand(1);
|
|
|
|
const analysis::Constant* index_const =
|
|
|
|
const_mgr->FindDeclaredConstant(index_id);
|
|
|
|
if (index_const) {
|
2019-07-31 19:39:33 +00:00
|
|
|
result->insert(index_const->GetSignExtendedValue());
|
|
|
|
return true;
|
2018-05-11 21:02:57 +00:00
|
|
|
} else {
|
|
|
|
// Could be any element. Assuming all are used.
|
|
|
|
result.reset(nullptr);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
// We do not know what is happening. Have to assume the worst.
|
|
|
|
result.reset(nullptr);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
});
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* ScalarReplacementPass::CreateNullConstant(uint32_t type_id) {
|
2018-05-11 21:02:57 +00:00
|
|
|
analysis::TypeManager* type_mgr = context()->get_type_mgr();
|
|
|
|
analysis::ConstantManager* const_mgr = context()->get_constant_mgr();
|
|
|
|
|
|
|
|
const analysis::Type* type = type_mgr->GetType(type_id);
|
|
|
|
const analysis::Constant* null_const = const_mgr->GetConstant(type, {});
|
2018-07-12 19:14:43 +00:00
|
|
|
Instruction* null_inst =
|
2018-07-04 17:17:30 +00:00
|
|
|
const_mgr->GetDefiningInstruction(null_const, type_id);
|
2019-05-15 13:29:28 +00:00
|
|
|
if (null_inst != nullptr) {
|
|
|
|
context()->UpdateDefUse(null_inst);
|
|
|
|
}
|
2018-05-11 21:02:57 +00:00
|
|
|
return null_inst;
|
|
|
|
}
|
|
|
|
|
2019-08-21 17:12:42 +00:00
|
|
|
uint64_t ScalarReplacementPass::GetMaxLegalIndex(
|
|
|
|
const Instruction* var_inst) const {
|
|
|
|
assert(var_inst->opcode() == SpvOpVariable &&
|
|
|
|
"|var_inst| must be a variable instruction.");
|
|
|
|
Instruction* type = GetStorageType(var_inst);
|
|
|
|
switch (type->opcode()) {
|
|
|
|
case SpvOpTypeStruct:
|
|
|
|
return type->NumInOperands();
|
|
|
|
case SpvOpTypeArray:
|
|
|
|
return GetArrayLength(type);
|
|
|
|
case SpvOpTypeMatrix:
|
|
|
|
case SpvOpTypeVector:
|
|
|
|
return GetNumElements(type);
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-11-30 22:03:06 +00:00
|
|
|
} // namespace opt
|
|
|
|
} // namespace spvtools
|