mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-11-04 06:09:05 +00:00
[lib/Fuzzer] minor refactoring/simplification, NFC
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@236757 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
308873bcb8
commit
46fa0aabcb
@ -287,4 +287,11 @@ void dfsan_weak_hook_memcmp(void *caller_pc, const void *s1, const void *s2,
|
||||
dfsan_label L2 = dfsan_read_label(s2, n);
|
||||
DFSan->DFSanCmpCallback(PC, n, ICMP_EQ, S1, S2, L1, L2);
|
||||
}
|
||||
|
||||
void __sanitizer_cov_trace_cmp(uint64_t SizeAndType, uint64_t Arg1,
|
||||
uint64_t Arg2) {
|
||||
// This symbol will be present if dfsan is disabled on the given function.
|
||||
// FIXME: implement poor man's taint analysis here (w/o dfsan).
|
||||
}
|
||||
|
||||
} // extern "C"
|
||||
|
@ -61,7 +61,7 @@ class Fuzzer {
|
||||
};
|
||||
Fuzzer(UserCallback Callback, FuzzingOptions Options);
|
||||
void AddToCorpus(const Unit &U) { Corpus.push_back(U); }
|
||||
size_t Loop(size_t NumIterations);
|
||||
void Loop(size_t NumIterations);
|
||||
void ShuffleAndMinimize();
|
||||
void InitializeDFSan();
|
||||
size_t CorpusSize() const { return Corpus.size(); }
|
||||
@ -85,8 +85,10 @@ class Fuzzer {
|
||||
private:
|
||||
void AlarmCallback();
|
||||
void ExecuteCallback(const Unit &U);
|
||||
size_t MutateAndTestOne(Unit *U);
|
||||
void MutateAndTestOne(Unit *U);
|
||||
void ReportNewCoverage(size_t NewCoverage, const Unit &U);
|
||||
size_t RunOne(const Unit &U);
|
||||
void RunOneAndUpdateCorpus(const Unit &U);
|
||||
size_t RunOneMaximizeTotalCoverage(const Unit &U);
|
||||
size_t RunOneMaximizeFullCoverageSet(const Unit &U);
|
||||
size_t RunOneMaximizeCoveragePairs(const Unit &U);
|
||||
|
@ -143,6 +143,12 @@ size_t Fuzzer::RunOne(const Unit &U) {
|
||||
return Res;
|
||||
}
|
||||
|
||||
void Fuzzer::RunOneAndUpdateCorpus(const Unit &U) {
|
||||
if (TotalNumberOfRuns >= Options.MaxNumberOfRuns)
|
||||
return;
|
||||
ReportNewCoverage(RunOne(U), U);
|
||||
}
|
||||
|
||||
static uintptr_t HashOfArrayOfPCs(uintptr_t *PCs, uintptr_t NumPCs) {
|
||||
uintptr_t Res = 0;
|
||||
for (uintptr_t i = 0; i < NumPCs; i++) {
|
||||
@ -259,55 +265,50 @@ void Fuzzer::SaveCorpus() {
|
||||
<< Options.OutputCorpus << "\n";
|
||||
}
|
||||
|
||||
size_t Fuzzer::MutateAndTestOne(Unit *U) {
|
||||
size_t NewUnits = 0;
|
||||
for (int i = 0; i < Options.MutateDepth; i++) {
|
||||
if (TotalNumberOfRuns >= Options.MaxNumberOfRuns)
|
||||
return NewUnits;
|
||||
MutateWithDFSan(U);
|
||||
Mutate(U, Options.MaxLen);
|
||||
size_t NewCoverage = RunOne(*U);
|
||||
if (NewCoverage) {
|
||||
Corpus.push_back(*U);
|
||||
NewUnits++;
|
||||
PrintStats("NEW ", NewCoverage, "");
|
||||
if (Options.Verbosity) {
|
||||
std::cerr << " L: " << U->size();
|
||||
if (U->size() < 30) {
|
||||
std::cerr << " ";
|
||||
PrintUnitInASCIIOrTokens(*U, "\t");
|
||||
Print(*U);
|
||||
}
|
||||
std::cerr << "\n";
|
||||
}
|
||||
WriteToOutputCorpus(*U);
|
||||
if (Options.ExitOnFirst)
|
||||
exit(0);
|
||||
void Fuzzer::ReportNewCoverage(size_t NewCoverage, const Unit &U) {
|
||||
if (!NewCoverage) return;
|
||||
Corpus.push_back(U);
|
||||
PrintStats("NEW ", NewCoverage, "");
|
||||
if (Options.Verbosity) {
|
||||
std::cerr << " L: " << U.size();
|
||||
if (U.size() < 30) {
|
||||
std::cerr << " ";
|
||||
PrintUnitInASCIIOrTokens(U, "\t");
|
||||
Print(U);
|
||||
}
|
||||
std::cerr << "\n";
|
||||
}
|
||||
return NewUnits;
|
||||
WriteToOutputCorpus(U);
|
||||
if (Options.ExitOnFirst)
|
||||
exit(0);
|
||||
}
|
||||
|
||||
size_t Fuzzer::Loop(size_t NumIterations) {
|
||||
size_t NewUnits = 0;
|
||||
void Fuzzer::MutateAndTestOne(Unit *U) {
|
||||
for (int i = 0; i < Options.MutateDepth; i++) {
|
||||
MutateWithDFSan(U);
|
||||
Mutate(U, Options.MaxLen);
|
||||
RunOneAndUpdateCorpus(*U);
|
||||
}
|
||||
}
|
||||
|
||||
void Fuzzer::Loop(size_t NumIterations) {
|
||||
for (size_t i = 1; i <= NumIterations; i++) {
|
||||
for (size_t J1 = 0; J1 < Corpus.size(); J1++) {
|
||||
if (TotalNumberOfRuns >= Options.MaxNumberOfRuns)
|
||||
return NewUnits;
|
||||
return;
|
||||
// First, simply mutate the unit w/o doing crosses.
|
||||
CurrentUnit = Corpus[J1];
|
||||
NewUnits += MutateAndTestOne(&CurrentUnit);
|
||||
MutateAndTestOne(&CurrentUnit);
|
||||
// Now, cross with others.
|
||||
if (Options.DoCrossOver) {
|
||||
for (size_t J2 = 0; J2 < Corpus.size(); J2++) {
|
||||
CurrentUnit.clear();
|
||||
CrossOver(Corpus[J1], Corpus[J2], &CurrentUnit, Options.MaxLen);
|
||||
NewUnits += MutateAndTestOne(&CurrentUnit);
|
||||
MutateAndTestOne(&CurrentUnit);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return NewUnits;
|
||||
}
|
||||
|
||||
} // namespace fuzzer
|
||||
|
Loading…
Reference in New Issue
Block a user