2019-05-27 13:34:55 +00:00
|
|
|
// 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/fuzzer.h"
|
|
|
|
|
|
|
|
#include <cassert>
|
2019-09-23 15:29:19 +00:00
|
|
|
#include <memory>
|
2019-05-27 13:34:55 +00:00
|
|
|
#include <sstream>
|
|
|
|
|
2019-10-22 17:05:35 +00:00
|
|
|
#include "fuzzer_pass_adjust_memory_operands_masks.h"
|
2019-05-27 13:34:55 +00:00
|
|
|
#include "source/fuzz/fact_manager.h"
|
|
|
|
#include "source/fuzz/fuzzer_context.h"
|
2019-06-05 07:02:16 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_add_dead_breaks.h"
|
2019-07-25 12:50:33 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_add_dead_continues.h"
|
2019-10-11 08:15:47 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_add_no_contraction_decorations.h"
|
2019-06-04 13:55:00 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_add_useful_constructs.h"
|
2019-10-11 06:10:47 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_adjust_function_controls.h"
|
2019-10-10 12:34:38 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_adjust_loop_controls.h"
|
2019-10-08 10:25:34 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_adjust_selection_controls.h"
|
2019-09-18 19:47:08 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_apply_id_synonyms.h"
|
2019-10-08 13:04:10 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_construct_composites.h"
|
2019-09-11 22:45:20 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_copy_objects.h"
|
2019-06-18 17:41:08 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_obfuscate_constants.h"
|
2019-05-31 08:59:06 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_permute_blocks.h"
|
2019-05-29 15:42:46 +00:00
|
|
|
#include "source/fuzz/fuzzer_pass_split_blocks.h"
|
2019-05-27 13:34:55 +00:00
|
|
|
#include "source/fuzz/protobufs/spirvfuzz_protobufs.h"
|
|
|
|
#include "source/fuzz/pseudo_random_generator.h"
|
|
|
|
#include "source/opt/build_module.h"
|
|
|
|
#include "source/spirv_fuzzer_options.h"
|
|
|
|
#include "source/util/make_unique.h"
|
|
|
|
|
|
|
|
namespace spvtools {
|
|
|
|
namespace fuzz {
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
const uint32_t kIdBoundGap = 100;
|
2019-09-23 15:29:19 +00:00
|
|
|
|
|
|
|
const uint32_t kTransformationLimit = 500;
|
|
|
|
|
|
|
|
const uint32_t kChanceOfApplyingAnotherPass = 85;
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
void MaybeAddPass(
|
|
|
|
std::vector<std::unique_ptr<FuzzerPass>>* passes,
|
|
|
|
opt::IRContext* ir_context, FactManager* fact_manager,
|
|
|
|
FuzzerContext* fuzzer_context,
|
|
|
|
protobufs::TransformationSequence* transformation_sequence_out) {
|
|
|
|
if (fuzzer_context->ChooseEven()) {
|
|
|
|
passes->push_back(MakeUnique<T>(ir_context, fact_manager, fuzzer_context,
|
|
|
|
transformation_sequence_out));
|
|
|
|
}
|
2019-05-27 13:34:55 +00:00
|
|
|
}
|
|
|
|
|
2019-09-23 15:29:19 +00:00
|
|
|
} // namespace
|
|
|
|
|
2019-05-27 13:34:55 +00:00
|
|
|
struct Fuzzer::Impl {
|
|
|
|
explicit Impl(spv_target_env env) : target_env(env) {}
|
|
|
|
|
|
|
|
const spv_target_env target_env; // Target environment.
|
|
|
|
MessageConsumer consumer; // Message consumer.
|
|
|
|
};
|
|
|
|
|
|
|
|
Fuzzer::Fuzzer(spv_target_env env) : impl_(MakeUnique<Impl>(env)) {}
|
|
|
|
|
|
|
|
Fuzzer::~Fuzzer() = default;
|
|
|
|
|
|
|
|
void Fuzzer::SetMessageConsumer(MessageConsumer c) {
|
|
|
|
impl_->consumer = std::move(c);
|
|
|
|
}
|
|
|
|
|
|
|
|
Fuzzer::FuzzerResultStatus Fuzzer::Run(
|
|
|
|
const std::vector<uint32_t>& binary_in,
|
|
|
|
const protobufs::FactSequence& initial_facts,
|
2019-07-07 07:55:30 +00:00
|
|
|
spv_const_fuzzer_options options, std::vector<uint32_t>* binary_out,
|
|
|
|
protobufs::TransformationSequence* transformation_sequence_out) const {
|
2019-05-27 13:34:55 +00:00
|
|
|
// Check compatibility between the library version being linked with and the
|
|
|
|
// header files being used.
|
|
|
|
GOOGLE_PROTOBUF_VERIFY_VERSION;
|
|
|
|
|
|
|
|
spvtools::SpirvTools tools(impl_->target_env);
|
2019-07-07 07:55:30 +00:00
|
|
|
tools.SetMessageConsumer(impl_->consumer);
|
2019-05-27 13:34:55 +00:00
|
|
|
if (!tools.IsValid()) {
|
|
|
|
impl_->consumer(SPV_MSG_ERROR, nullptr, {},
|
|
|
|
"Failed to create SPIRV-Tools interface; stopping.");
|
|
|
|
return Fuzzer::FuzzerResultStatus::kFailedToCreateSpirvToolsInterface;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Initial binary should be valid.
|
|
|
|
if (!tools.Validate(&binary_in[0], binary_in.size())) {
|
|
|
|
impl_->consumer(SPV_MSG_ERROR, nullptr, {},
|
|
|
|
"Initial binary is invalid; stopping.");
|
|
|
|
return Fuzzer::FuzzerResultStatus::kInitialBinaryInvalid;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Build the module from the input binary.
|
|
|
|
std::unique_ptr<opt::IRContext> ir_context = BuildModule(
|
|
|
|
impl_->target_env, impl_->consumer, binary_in.data(), binary_in.size());
|
|
|
|
assert(ir_context);
|
|
|
|
|
|
|
|
// Make a PRNG, either from a given seed or from a random device.
|
|
|
|
PseudoRandomGenerator random_generator(
|
|
|
|
options->has_random_seed ? options->random_seed
|
2019-06-05 07:02:16 +00:00
|
|
|
: static_cast<uint32_t>(std::random_device()()));
|
2019-05-27 13:34:55 +00:00
|
|
|
|
|
|
|
// The fuzzer will introduce new ids into the module. The module's id bound
|
|
|
|
// gives the smallest id that can be used for this purpose. We add an offset
|
|
|
|
// to this so that there is a sizeable gap between the ids used in the
|
|
|
|
// original module and the ids used for fuzzing, as a readability aid.
|
|
|
|
//
|
|
|
|
// TODO(https://github.com/KhronosGroup/SPIRV-Tools/issues/2541) consider the
|
|
|
|
// case where the maximum id bound is reached.
|
|
|
|
auto minimum_fresh_id = ir_context->module()->id_bound() + kIdBoundGap;
|
|
|
|
FuzzerContext fuzzer_context(&random_generator, minimum_fresh_id);
|
|
|
|
|
|
|
|
FactManager fact_manager;
|
2019-06-26 15:40:19 +00:00
|
|
|
fact_manager.AddFacts(impl_->consumer, initial_facts, ir_context.get());
|
2019-05-27 13:34:55 +00:00
|
|
|
|
2019-06-04 13:55:00 +00:00
|
|
|
// Add some essential ingredients to the module if they are not already
|
|
|
|
// present, such as boolean constants.
|
|
|
|
FuzzerPassAddUsefulConstructs(ir_context.get(), &fact_manager,
|
|
|
|
&fuzzer_context, transformation_sequence_out)
|
|
|
|
.Apply();
|
|
|
|
|
2019-05-29 15:42:46 +00:00
|
|
|
// Apply some semantics-preserving passes.
|
2019-09-23 15:29:19 +00:00
|
|
|
std::vector<std::unique_ptr<FuzzerPass>> passes;
|
|
|
|
while (passes.empty()) {
|
|
|
|
MaybeAddPass<FuzzerPassAddDeadBreaks>(&passes, ir_context.get(),
|
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
|
|
|
MaybeAddPass<FuzzerPassAddDeadContinues>(&passes, ir_context.get(),
|
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
|
|
|
MaybeAddPass<FuzzerPassApplyIdSynonyms>(&passes, ir_context.get(),
|
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
2019-10-08 13:04:10 +00:00
|
|
|
MaybeAddPass<FuzzerPassConstructComposites>(&passes, ir_context.get(),
|
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
2019-09-23 15:29:19 +00:00
|
|
|
MaybeAddPass<FuzzerPassCopyObjects>(&passes, ir_context.get(),
|
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
|
|
|
MaybeAddPass<FuzzerPassObfuscateConstants>(&passes, ir_context.get(),
|
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
|
|
|
MaybeAddPass<FuzzerPassPermuteBlocks>(&passes, ir_context.get(),
|
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
|
|
|
MaybeAddPass<FuzzerPassSplitBlocks>(&passes, ir_context.get(),
|
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
|
|
|
}
|
2019-05-31 08:59:06 +00:00
|
|
|
|
2019-09-23 15:29:19 +00:00
|
|
|
bool is_first = true;
|
|
|
|
while (static_cast<uint32_t>(
|
|
|
|
transformation_sequence_out->transformation_size()) <
|
|
|
|
kTransformationLimit &&
|
|
|
|
(is_first ||
|
|
|
|
fuzzer_context.ChoosePercentage(kChanceOfApplyingAnotherPass))) {
|
|
|
|
is_first = false;
|
|
|
|
passes[fuzzer_context.RandomIndex(passes)]->Apply();
|
|
|
|
}
|
2019-05-31 08:59:06 +00:00
|
|
|
|
2019-10-08 10:25:34 +00:00
|
|
|
// Now apply some passes that it does not make sense to apply repeatedly,
|
|
|
|
// as they do not unlock other passes.
|
2019-10-11 06:10:47 +00:00
|
|
|
std::vector<std::unique_ptr<FuzzerPass>> final_passes;
|
2019-10-22 17:05:35 +00:00
|
|
|
MaybeAddPass<FuzzerPassAdjustFunctionControls>(
|
|
|
|
&final_passes, ir_context.get(), &fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
|
|
|
MaybeAddPass<FuzzerPassAdjustLoopControls>(&final_passes, ir_context.get(),
|
2019-10-11 06:10:47 +00:00
|
|
|
&fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
2019-10-22 17:05:35 +00:00
|
|
|
MaybeAddPass<FuzzerPassAdjustMemoryOperandsMasks>(
|
|
|
|
&final_passes, ir_context.get(), &fact_manager, &fuzzer_context,
|
|
|
|
transformation_sequence_out);
|
2019-10-11 06:10:47 +00:00
|
|
|
MaybeAddPass<FuzzerPassAdjustSelectionControls>(
|
2019-10-22 17:05:35 +00:00
|
|
|
&final_passes, ir_context.get(), &fact_manager, &fuzzer_context,
|
2019-10-11 06:10:47 +00:00
|
|
|
transformation_sequence_out);
|
|
|
|
for (auto& pass : final_passes) {
|
|
|
|
pass->Apply();
|
2019-10-08 10:25:34 +00:00
|
|
|
}
|
|
|
|
|
2019-10-11 08:15:47 +00:00
|
|
|
if (fuzzer_context.ChooseEven()) {
|
|
|
|
FuzzerPassAddNoContractionDecorations(ir_context.get(), &fact_manager,
|
|
|
|
&fuzzer_context,
|
|
|
|
transformation_sequence_out)
|
|
|
|
.Apply();
|
|
|
|
}
|
|
|
|
|
2019-05-27 13:34:55 +00:00
|
|
|
// Encode the module as a binary.
|
|
|
|
ir_context->module()->ToBinary(binary_out, false);
|
|
|
|
|
|
|
|
return Fuzzer::FuzzerResultStatus::kComplete;
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace fuzz
|
|
|
|
} // namespace spvtools
|