mirror of
https://github.com/KhronosGroup/SPIRV-Tools
synced 2024-10-18 19:20:05 +00:00
67f4838659
The fact manager maintains an equivalence relation on data descriptors that tracks when one data descriptor could be used in place of another. An algorithm to compute the closure of such facts allows deducing new synonym facts from existing facts. E.g., for two 2D vectors u and v it is known that u.x is synonymous with v.x and u.y is synonymous with v.y, it can be deduced that u and v are synonymous. The closure computation algorithm is very expensive if we get large equivalence relations. This change addresses this in three ways: - The size of equivalence relations is reduced by limiting the extent to which the components of a composite are recursively noted as being equivalent, so that when we have large synonymous arrays we do not record all array elements as being pairwise equivalent. - When computing the closure of facts, equivalence classes above a certain size are simply skipped (which can lead to missed facts) - The closure computation is performed less frequently - it is invoked explicitly before fuzzer passes that will benefit from data synonym facts. A new transformation is used to control its invocation, so that fuzzing and replaying do not get out of sync. The change also tidies up the order in which some getters are declared in FuzzerContext.
221 lines
12 KiB
C++
221 lines
12 KiB
C++
// Copyright (c) 2019 Google LLC
|
|
//
|
|
// 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.
|
|
|
|
#include "source/fuzz/transformation.h"
|
|
|
|
#include <cassert>
|
|
|
|
#include "source/fuzz/fuzzer_util.h"
|
|
#include "source/fuzz/transformation_access_chain.h"
|
|
#include "source/fuzz/transformation_add_constant_boolean.h"
|
|
#include "source/fuzz/transformation_add_constant_composite.h"
|
|
#include "source/fuzz/transformation_add_constant_null.h"
|
|
#include "source/fuzz/transformation_add_constant_scalar.h"
|
|
#include "source/fuzz/transformation_add_dead_block.h"
|
|
#include "source/fuzz/transformation_add_dead_break.h"
|
|
#include "source/fuzz/transformation_add_dead_continue.h"
|
|
#include "source/fuzz/transformation_add_function.h"
|
|
#include "source/fuzz/transformation_add_global_undef.h"
|
|
#include "source/fuzz/transformation_add_global_variable.h"
|
|
#include "source/fuzz/transformation_add_local_variable.h"
|
|
#include "source/fuzz/transformation_add_no_contraction_decoration.h"
|
|
#include "source/fuzz/transformation_add_type_array.h"
|
|
#include "source/fuzz/transformation_add_type_boolean.h"
|
|
#include "source/fuzz/transformation_add_type_float.h"
|
|
#include "source/fuzz/transformation_add_type_function.h"
|
|
#include "source/fuzz/transformation_add_type_int.h"
|
|
#include "source/fuzz/transformation_add_type_matrix.h"
|
|
#include "source/fuzz/transformation_add_type_pointer.h"
|
|
#include "source/fuzz/transformation_add_type_struct.h"
|
|
#include "source/fuzz/transformation_add_type_vector.h"
|
|
#include "source/fuzz/transformation_composite_construct.h"
|
|
#include "source/fuzz/transformation_composite_extract.h"
|
|
#include "source/fuzz/transformation_compute_data_synonym_fact_closure.h"
|
|
#include "source/fuzz/transformation_copy_object.h"
|
|
#include "source/fuzz/transformation_equation_instruction.h"
|
|
#include "source/fuzz/transformation_function_call.h"
|
|
#include "source/fuzz/transformation_load.h"
|
|
#include "source/fuzz/transformation_merge_blocks.h"
|
|
#include "source/fuzz/transformation_move_block_down.h"
|
|
#include "source/fuzz/transformation_outline_function.h"
|
|
#include "source/fuzz/transformation_permute_function_parameters.h"
|
|
#include "source/fuzz/transformation_replace_boolean_constant_with_constant_binary.h"
|
|
#include "source/fuzz/transformation_replace_constant_with_uniform.h"
|
|
#include "source/fuzz/transformation_replace_id_with_synonym.h"
|
|
#include "source/fuzz/transformation_set_function_control.h"
|
|
#include "source/fuzz/transformation_set_loop_control.h"
|
|
#include "source/fuzz/transformation_set_memory_operands_mask.h"
|
|
#include "source/fuzz/transformation_set_selection_control.h"
|
|
#include "source/fuzz/transformation_split_block.h"
|
|
#include "source/fuzz/transformation_store.h"
|
|
#include "source/fuzz/transformation_swap_commutable_operands.h"
|
|
#include "source/fuzz/transformation_toggle_access_chain_instruction.h"
|
|
#include "source/fuzz/transformation_vector_shuffle.h"
|
|
#include "source/util/make_unique.h"
|
|
|
|
namespace spvtools {
|
|
namespace fuzz {
|
|
|
|
Transformation::~Transformation() = default;
|
|
|
|
std::unique_ptr<Transformation> Transformation::FromMessage(
|
|
const protobufs::Transformation& message) {
|
|
switch (message.transformation_case()) {
|
|
case protobufs::Transformation::TransformationCase::kAccessChain:
|
|
return MakeUnique<TransformationAccessChain>(message.access_chain());
|
|
case protobufs::Transformation::TransformationCase::kAddConstantBoolean:
|
|
return MakeUnique<TransformationAddConstantBoolean>(
|
|
message.add_constant_boolean());
|
|
case protobufs::Transformation::TransformationCase::kAddConstantComposite:
|
|
return MakeUnique<TransformationAddConstantComposite>(
|
|
message.add_constant_composite());
|
|
case protobufs::Transformation::TransformationCase::kAddConstantNull:
|
|
return MakeUnique<TransformationAddConstantNull>(
|
|
message.add_constant_null());
|
|
case protobufs::Transformation::TransformationCase::kAddConstantScalar:
|
|
return MakeUnique<TransformationAddConstantScalar>(
|
|
message.add_constant_scalar());
|
|
case protobufs::Transformation::TransformationCase::kAddDeadBlock:
|
|
return MakeUnique<TransformationAddDeadBlock>(message.add_dead_block());
|
|
case protobufs::Transformation::TransformationCase::kAddDeadBreak:
|
|
return MakeUnique<TransformationAddDeadBreak>(message.add_dead_break());
|
|
case protobufs::Transformation::TransformationCase::kAddDeadContinue:
|
|
return MakeUnique<TransformationAddDeadContinue>(
|
|
message.add_dead_continue());
|
|
case protobufs::Transformation::TransformationCase::kAddFunction:
|
|
return MakeUnique<TransformationAddFunction>(message.add_function());
|
|
case protobufs::Transformation::TransformationCase::kAddGlobalUndef:
|
|
return MakeUnique<TransformationAddGlobalUndef>(
|
|
message.add_global_undef());
|
|
case protobufs::Transformation::TransformationCase::kAddGlobalVariable:
|
|
return MakeUnique<TransformationAddGlobalVariable>(
|
|
message.add_global_variable());
|
|
case protobufs::Transformation::TransformationCase::kAddLocalVariable:
|
|
return MakeUnique<TransformationAddLocalVariable>(
|
|
message.add_local_variable());
|
|
case protobufs::Transformation::TransformationCase::
|
|
kAddNoContractionDecoration:
|
|
return MakeUnique<TransformationAddNoContractionDecoration>(
|
|
message.add_no_contraction_decoration());
|
|
case protobufs::Transformation::TransformationCase::kAddTypeArray:
|
|
return MakeUnique<TransformationAddTypeArray>(message.add_type_array());
|
|
case protobufs::Transformation::TransformationCase::kAddTypeBoolean:
|
|
return MakeUnique<TransformationAddTypeBoolean>(
|
|
message.add_type_boolean());
|
|
case protobufs::Transformation::TransformationCase::kAddTypeFloat:
|
|
return MakeUnique<TransformationAddTypeFloat>(message.add_type_float());
|
|
case protobufs::Transformation::TransformationCase::kAddTypeFunction:
|
|
return MakeUnique<TransformationAddTypeFunction>(
|
|
message.add_type_function());
|
|
case protobufs::Transformation::TransformationCase::kAddTypeInt:
|
|
return MakeUnique<TransformationAddTypeInt>(message.add_type_int());
|
|
case protobufs::Transformation::TransformationCase::kAddTypeMatrix:
|
|
return MakeUnique<TransformationAddTypeMatrix>(message.add_type_matrix());
|
|
case protobufs::Transformation::TransformationCase::kAddTypePointer:
|
|
return MakeUnique<TransformationAddTypePointer>(
|
|
message.add_type_pointer());
|
|
case protobufs::Transformation::TransformationCase::kAddTypeStruct:
|
|
return MakeUnique<TransformationAddTypeStruct>(message.add_type_struct());
|
|
case protobufs::Transformation::TransformationCase::kAddTypeVector:
|
|
return MakeUnique<TransformationAddTypeVector>(message.add_type_vector());
|
|
case protobufs::Transformation::TransformationCase::kCompositeConstruct:
|
|
return MakeUnique<TransformationCompositeConstruct>(
|
|
message.composite_construct());
|
|
case protobufs::Transformation::TransformationCase::kCompositeExtract:
|
|
return MakeUnique<TransformationCompositeExtract>(
|
|
message.composite_extract());
|
|
case protobufs::Transformation::TransformationCase::
|
|
kComputeDataSynonymFactClosure:
|
|
return MakeUnique<TransformationComputeDataSynonymFactClosure>(
|
|
message.compute_data_synonym_fact_closure());
|
|
case protobufs::Transformation::TransformationCase::kCopyObject:
|
|
return MakeUnique<TransformationCopyObject>(message.copy_object());
|
|
case protobufs::Transformation::TransformationCase::kEquationInstruction:
|
|
return MakeUnique<TransformationEquationInstruction>(
|
|
message.equation_instruction());
|
|
case protobufs::Transformation::TransformationCase::kFunctionCall:
|
|
return MakeUnique<TransformationFunctionCall>(message.function_call());
|
|
case protobufs::Transformation::TransformationCase::kLoad:
|
|
return MakeUnique<TransformationLoad>(message.load());
|
|
case protobufs::Transformation::TransformationCase::kMergeBlocks:
|
|
return MakeUnique<TransformationMergeBlocks>(message.merge_blocks());
|
|
case protobufs::Transformation::TransformationCase::kMoveBlockDown:
|
|
return MakeUnique<TransformationMoveBlockDown>(message.move_block_down());
|
|
case protobufs::Transformation::TransformationCase::kOutlineFunction:
|
|
return MakeUnique<TransformationOutlineFunction>(
|
|
message.outline_function());
|
|
case protobufs::Transformation::TransformationCase::
|
|
kPermuteFunctionParameters:
|
|
return MakeUnique<TransformationPermuteFunctionParameters>(
|
|
message.permute_function_parameters());
|
|
case protobufs::Transformation::TransformationCase::
|
|
kReplaceBooleanConstantWithConstantBinary:
|
|
return MakeUnique<TransformationReplaceBooleanConstantWithConstantBinary>(
|
|
message.replace_boolean_constant_with_constant_binary());
|
|
case protobufs::Transformation::TransformationCase::
|
|
kReplaceConstantWithUniform:
|
|
return MakeUnique<TransformationReplaceConstantWithUniform>(
|
|
message.replace_constant_with_uniform());
|
|
case protobufs::Transformation::TransformationCase::kReplaceIdWithSynonym:
|
|
return MakeUnique<TransformationReplaceIdWithSynonym>(
|
|
message.replace_id_with_synonym());
|
|
case protobufs::Transformation::TransformationCase::kSetFunctionControl:
|
|
return MakeUnique<TransformationSetFunctionControl>(
|
|
message.set_function_control());
|
|
case protobufs::Transformation::TransformationCase::kSetLoopControl:
|
|
return MakeUnique<TransformationSetLoopControl>(
|
|
message.set_loop_control());
|
|
case protobufs::Transformation::TransformationCase::kSetMemoryOperandsMask:
|
|
return MakeUnique<TransformationSetMemoryOperandsMask>(
|
|
message.set_memory_operands_mask());
|
|
case protobufs::Transformation::TransformationCase::kSetSelectionControl:
|
|
return MakeUnique<TransformationSetSelectionControl>(
|
|
message.set_selection_control());
|
|
case protobufs::Transformation::TransformationCase::kSplitBlock:
|
|
return MakeUnique<TransformationSplitBlock>(message.split_block());
|
|
case protobufs::Transformation::TransformationCase::kStore:
|
|
return MakeUnique<TransformationStore>(message.store());
|
|
case protobufs::Transformation::TransformationCase::kSwapCommutableOperands:
|
|
return MakeUnique<TransformationSwapCommutableOperands>(
|
|
message.swap_commutable_operands());
|
|
case protobufs::Transformation::TransformationCase::
|
|
kToggleAccessChainInstruction:
|
|
return MakeUnique<TransformationToggleAccessChainInstruction>(
|
|
message.toggle_access_chain_instruction());
|
|
case protobufs::Transformation::TransformationCase::kVectorShuffle:
|
|
return MakeUnique<TransformationVectorShuffle>(message.vector_shuffle());
|
|
case protobufs::Transformation::TRANSFORMATION_NOT_SET:
|
|
assert(false && "An unset transformation was encountered.");
|
|
return nullptr;
|
|
}
|
|
assert(false && "Should be unreachable as all cases must be handled above.");
|
|
return nullptr;
|
|
}
|
|
|
|
bool Transformation::CheckIdIsFreshAndNotUsedByThisTransformation(
|
|
uint32_t id, opt::IRContext* ir_context,
|
|
std::set<uint32_t>* ids_used_by_this_transformation) {
|
|
if (!fuzzerutil::IsFreshId(ir_context, id)) {
|
|
return false;
|
|
}
|
|
if (ids_used_by_this_transformation->count(id) != 0) {
|
|
return false;
|
|
}
|
|
ids_used_by_this_transformation->insert(id);
|
|
return true;
|
|
}
|
|
|
|
} // namespace fuzz
|
|
} // namespace spvtools
|