2015-01-29 17:58:29 +01:00
|
|
|
//===- FuzzerInternal.h - Internal header for the Fuzzer --------*- C++ -* ===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Define the main class fuzzer::Fuzzer and most functions.
|
|
|
|
//===----------------------------------------------------------------------===//
|
2015-08-10 18:37:40 +02:00
|
|
|
|
|
|
|
#ifndef LLVM_FUZZER_INTERNAL_H
|
|
|
|
#define LLVM_FUZZER_INTERNAL_H
|
|
|
|
|
2016-02-13 04:37:24 +01:00
|
|
|
#include <algorithm>
|
2016-05-27 02:54:15 +02:00
|
|
|
#include <atomic>
|
2015-01-29 17:58:29 +01:00
|
|
|
#include <cassert>
|
|
|
|
#include <chrono>
|
2016-01-22 23:28:27 +01:00
|
|
|
#include <climits>
|
2015-01-29 17:58:29 +01:00
|
|
|
#include <cstddef>
|
|
|
|
#include <cstdlib>
|
2016-01-22 23:28:27 +01:00
|
|
|
#include <random>
|
2016-01-16 04:53:32 +01:00
|
|
|
#include <string.h>
|
2016-01-22 23:28:27 +01:00
|
|
|
#include <string>
|
2015-01-30 00:01:07 +01:00
|
|
|
#include <unordered_set>
|
2016-01-22 23:28:27 +01:00
|
|
|
#include <vector>
|
2015-01-29 17:58:29 +01:00
|
|
|
|
2016-06-02 07:48:02 +02:00
|
|
|
#include "FuzzerExtFunctions.h"
|
2015-02-19 19:45:37 +01:00
|
|
|
#include "FuzzerInterface.h"
|
2016-05-11 01:43:15 +02:00
|
|
|
#include "FuzzerTracePC.h"
|
2015-02-19 19:45:37 +01:00
|
|
|
|
2016-05-20 00:00:33 +02:00
|
|
|
// Platform detection.
|
|
|
|
#ifdef __linux__
|
|
|
|
#define LIBFUZZER_LINUX 1
|
|
|
|
#define LIBFUZZER_APPLE 0
|
|
|
|
#elif __APPLE__
|
|
|
|
#define LIBFUZZER_LINUX 0
|
|
|
|
#define LIBFUZZER_APPLE 1
|
|
|
|
#else
|
|
|
|
#error "Support for your platform has not been implemented"
|
|
|
|
#endif
|
|
|
|
|
2015-01-29 17:58:29 +01:00
|
|
|
namespace fuzzer {
|
2016-05-13 20:04:35 +02:00
|
|
|
|
|
|
|
typedef int (*UserCallback)(const uint8_t *Data, size_t Size);
|
2016-06-02 07:48:02 +02:00
|
|
|
int FuzzerDriver(int *argc, char ***argv, UserCallback Callback);
|
2016-05-13 20:04:35 +02:00
|
|
|
|
2015-01-29 17:58:29 +01:00
|
|
|
using namespace std::chrono;
|
2016-01-16 02:23:12 +01:00
|
|
|
typedef std::vector<uint8_t> Unit;
|
2016-03-18 01:23:29 +01:00
|
|
|
typedef std::vector<Unit> UnitVector;
|
2015-01-29 17:58:29 +01:00
|
|
|
|
2016-01-16 04:53:32 +01:00
|
|
|
// A simple POD sized array of bytes.
|
2016-01-22 23:28:27 +01:00
|
|
|
template <size_t kMaxSize> class FixedWord {
|
|
|
|
public:
|
2016-01-23 00:55:14 +01:00
|
|
|
FixedWord() {}
|
2016-01-16 04:53:32 +01:00
|
|
|
FixedWord(const uint8_t *B, uint8_t S) { Set(B, S); }
|
|
|
|
|
|
|
|
void Set(const uint8_t *B, uint8_t S) {
|
|
|
|
assert(S <= kMaxSize);
|
|
|
|
memcpy(Data, B, S);
|
|
|
|
Size = S;
|
|
|
|
}
|
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
bool operator==(const FixedWord<kMaxSize> &w) const {
|
2016-01-16 04:53:32 +01:00
|
|
|
return Size == w.Size && 0 == memcmp(Data, w.Data, Size);
|
|
|
|
}
|
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
bool operator<(const FixedWord<kMaxSize> &w) const {
|
|
|
|
if (Size != w.Size)
|
|
|
|
return Size < w.Size;
|
2016-01-16 04:53:32 +01:00
|
|
|
return memcmp(Data, w.Data, Size) < 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static size_t GetMaxSize() { return kMaxSize; }
|
|
|
|
const uint8_t *data() const { return Data; }
|
|
|
|
uint8_t size() const { return Size; }
|
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
private:
|
2016-01-23 00:55:14 +01:00
|
|
|
uint8_t Size = 0;
|
2016-01-16 04:53:32 +01:00
|
|
|
uint8_t Data[kMaxSize];
|
|
|
|
};
|
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
typedef FixedWord<27> Word; // 28 bytes.
|
2016-01-16 04:53:32 +01:00
|
|
|
|
2016-02-02 04:03:47 +01:00
|
|
|
bool IsFile(const std::string &Path);
|
2015-03-31 22:13:20 +02:00
|
|
|
std::string FileToString(const std::string &Path);
|
2016-02-18 22:49:10 +01:00
|
|
|
Unit FileToVector(const std::string &Path, size_t MaxSize = 0);
|
2015-05-08 23:30:55 +02:00
|
|
|
void ReadDirToVectorOfUnits(const char *Path, std::vector<Unit> *V,
|
2016-02-18 22:49:10 +01:00
|
|
|
long *Epoch, size_t MaxSize);
|
2015-01-29 17:58:29 +01:00
|
|
|
void WriteToFile(const Unit &U, const std::string &Path);
|
2015-02-04 20:10:20 +01:00
|
|
|
void CopyFileToErr(const std::string &Path);
|
2015-01-29 17:58:29 +01:00
|
|
|
// Returns "Dir/FileName" or equivalent for the current OS.
|
|
|
|
std::string DirPlusFile(const std::string &DirPath,
|
|
|
|
const std::string &FileName);
|
|
|
|
|
2016-03-18 21:58:29 +01:00
|
|
|
void DupAndCloseStderr();
|
|
|
|
void CloseStdout();
|
2015-05-23 03:07:46 +02:00
|
|
|
void Printf(const char *Fmt, ...);
|
2016-01-14 00:46:01 +01:00
|
|
|
void PrintHexArray(const Unit &U, const char *PrintAfter = "");
|
|
|
|
void PrintHexArray(const uint8_t *Data, size_t Size,
|
|
|
|
const char *PrintAfter = "");
|
2016-01-12 03:36:59 +01:00
|
|
|
void PrintASCII(const uint8_t *Data, size_t Size, const char *PrintAfter = "");
|
2015-01-29 17:58:29 +01:00
|
|
|
void PrintASCII(const Unit &U, const char *PrintAfter = "");
|
2016-01-16 04:53:32 +01:00
|
|
|
void PrintASCII(const Word &W, const char *PrintAfter = "");
|
2015-01-29 17:58:29 +01:00
|
|
|
std::string Hash(const Unit &U);
|
|
|
|
void SetTimer(int Seconds);
|
2016-03-01 23:19:21 +01:00
|
|
|
void SetSigSegvHandler();
|
|
|
|
void SetSigBusHandler();
|
|
|
|
void SetSigAbrtHandler();
|
|
|
|
void SetSigIllHandler();
|
|
|
|
void SetSigFpeHandler();
|
|
|
|
void SetSigIntHandler();
|
2016-03-24 22:03:58 +01:00
|
|
|
void SetSigTermHandler();
|
2015-12-04 23:29:39 +01:00
|
|
|
std::string Base64(const Unit &U);
|
2015-11-12 02:02:01 +01:00
|
|
|
int ExecuteCommand(const std::string &Command);
|
2016-02-26 23:42:23 +01:00
|
|
|
size_t GetPeakRSSMb();
|
2015-01-29 17:58:29 +01:00
|
|
|
|
2015-05-15 00:41:49 +02:00
|
|
|
// Private copy of SHA1 implementation.
|
|
|
|
static const int kSHA1NumBytes = 20;
|
|
|
|
// Computes SHA1 hash of 'Len' bytes in 'Data', writes kSHA1NumBytes to 'Out'.
|
|
|
|
void ComputeSHA1(const uint8_t *Data, size_t Len, uint8_t *Out);
|
|
|
|
|
2015-08-11 03:44:42 +02:00
|
|
|
// Changes U to contain only ASCII (isprint+isspace) characters.
|
|
|
|
// Returns true iff U has been changed.
|
2016-02-13 18:56:51 +01:00
|
|
|
bool ToASCII(uint8_t *Data, size_t Size);
|
2015-09-02 21:08:08 +02:00
|
|
|
bool IsASCII(const Unit &U);
|
2016-05-26 22:03:02 +02:00
|
|
|
bool IsASCII(const uint8_t *Data, size_t Size);
|
2015-08-11 03:44:42 +02:00
|
|
|
|
2015-05-12 20:51:57 +02:00
|
|
|
int NumberOfCpuCores();
|
2015-10-17 01:04:31 +02:00
|
|
|
int GetPid();
|
2016-05-07 01:38:07 +02:00
|
|
|
void SleepSeconds(int Seconds);
|
2015-05-12 20:51:57 +02:00
|
|
|
|
2016-02-13 04:00:53 +01:00
|
|
|
class Random {
|
2016-02-13 03:39:30 +01:00
|
|
|
public:
|
2016-02-13 04:00:53 +01:00
|
|
|
Random(unsigned int seed) : R(seed) {}
|
|
|
|
size_t Rand() { return R(); }
|
|
|
|
size_t RandBool() { return Rand() % 2; }
|
2016-02-13 03:39:30 +01:00
|
|
|
size_t operator()(size_t n) { return n ? Rand() % n : 0; }
|
2016-02-13 04:25:16 +01:00
|
|
|
std::mt19937 &Get_mt19937() { return R; }
|
2016-02-13 03:39:30 +01:00
|
|
|
private:
|
2016-02-13 04:00:53 +01:00
|
|
|
std::mt19937 R;
|
2016-02-13 03:39:30 +01:00
|
|
|
};
|
|
|
|
|
2015-09-03 22:23:46 +02:00
|
|
|
// Dictionary.
|
|
|
|
|
|
|
|
// Parses one dictionary entry.
|
|
|
|
// If successfull, write the enty to Unit and returns true,
|
|
|
|
// otherwise returns false.
|
|
|
|
bool ParseOneDictionaryEntry(const std::string &Str, Unit *U);
|
|
|
|
// Parses the dictionary file, fills Units, returns true iff all lines
|
|
|
|
// were parsed succesfully.
|
|
|
|
bool ParseDictionaryFile(const std::string &Text, std::vector<Unit> *Units);
|
|
|
|
|
2016-02-13 04:37:24 +01:00
|
|
|
class DictionaryEntry {
|
|
|
|
public:
|
|
|
|
DictionaryEntry() {}
|
|
|
|
DictionaryEntry(Word W) : W(W) {}
|
|
|
|
DictionaryEntry(Word W, size_t PositionHint) : W(W), PositionHint(PositionHint) {}
|
|
|
|
const Word &GetW() const { return W; }
|
|
|
|
|
|
|
|
bool HasPositionHint() const { return PositionHint != std::numeric_limits<size_t>::max(); }
|
|
|
|
size_t GetPositionHint() const {
|
|
|
|
assert(HasPositionHint());
|
|
|
|
return PositionHint;
|
|
|
|
}
|
|
|
|
void IncUseCount() { UseCount++; }
|
|
|
|
void IncSuccessCount() { SuccessCount++; }
|
|
|
|
size_t GetUseCount() const { return UseCount; }
|
|
|
|
size_t GetSuccessCount() const {return SuccessCount; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
Word W;
|
|
|
|
size_t PositionHint = std::numeric_limits<size_t>::max();
|
|
|
|
size_t UseCount = 0;
|
|
|
|
size_t SuccessCount = 0;
|
|
|
|
};
|
|
|
|
|
|
|
|
class Dictionary {
|
|
|
|
public:
|
|
|
|
static const size_t kMaxDictSize = 1 << 14;
|
|
|
|
|
|
|
|
bool ContainsWord(const Word &W) const {
|
|
|
|
return std::any_of(begin(), end(), [&](const DictionaryEntry &DE) {
|
|
|
|
return DE.GetW() == W;
|
|
|
|
});
|
|
|
|
}
|
|
|
|
const DictionaryEntry *begin() const { return &DE[0]; }
|
|
|
|
const DictionaryEntry *end() const { return begin() + Size; }
|
|
|
|
DictionaryEntry & operator[] (size_t Idx) {
|
|
|
|
assert(Idx < Size);
|
|
|
|
return DE[Idx];
|
|
|
|
}
|
|
|
|
void push_back(DictionaryEntry DE) {
|
|
|
|
if (Size < kMaxDictSize)
|
|
|
|
this->DE[Size++] = DE;
|
|
|
|
}
|
|
|
|
void clear() { Size = 0; }
|
|
|
|
bool empty() const { return Size == 0; }
|
|
|
|
size_t size() const { return Size; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
DictionaryEntry DE[kMaxDictSize];
|
|
|
|
size_t Size = 0;
|
|
|
|
};
|
|
|
|
|
2016-06-23 22:44:48 +02:00
|
|
|
struct FuzzingOptions {
|
|
|
|
int Verbosity = 1;
|
|
|
|
size_t MaxLen = 0;
|
|
|
|
int UnitTimeoutSec = 300;
|
|
|
|
int TimeoutExitCode = 77;
|
|
|
|
int ErrorExitCode = 77;
|
|
|
|
int MaxTotalTimeSec = 0;
|
|
|
|
int RssLimitMb = 0;
|
|
|
|
bool DoCrossOver = true;
|
|
|
|
int MutateDepth = 5;
|
|
|
|
bool UseCounters = false;
|
|
|
|
bool UseIndirCalls = true;
|
|
|
|
bool UseTraces = false;
|
|
|
|
bool UseMemcmp = true;
|
2016-07-16 01:27:19 +02:00
|
|
|
bool UseMemmem = true;
|
2016-06-23 22:44:48 +02:00
|
|
|
bool UseFullCoverageSet = false;
|
|
|
|
bool Reload = true;
|
|
|
|
bool ShuffleAtStartUp = true;
|
|
|
|
bool PreferSmall = true;
|
|
|
|
size_t MaxNumberOfRuns = ULONG_MAX;
|
|
|
|
int ReportSlowUnits = 10;
|
|
|
|
bool OnlyASCII = false;
|
|
|
|
std::string OutputCorpus;
|
|
|
|
std::string ArtifactPrefix = "./";
|
|
|
|
std::string ExactArtifactPath;
|
|
|
|
bool SaveArtifacts = true;
|
|
|
|
bool PrintNEW = true; // Print a status line when new units are found;
|
|
|
|
bool OutputCSV = false;
|
|
|
|
bool PrintNewCovPcs = false;
|
|
|
|
bool PrintFinalStats = false;
|
|
|
|
bool DetectLeaks = true;
|
|
|
|
bool TruncateUnits = false;
|
|
|
|
bool PruneCorpus = true;
|
|
|
|
};
|
|
|
|
|
2016-01-16 01:04:36 +01:00
|
|
|
class MutationDispatcher {
|
2016-01-22 23:28:27 +01:00
|
|
|
public:
|
2016-06-23 22:44:48 +02:00
|
|
|
MutationDispatcher(Random &Rand, const FuzzingOptions &Options);
|
2016-02-13 04:37:24 +01:00
|
|
|
~MutationDispatcher() {}
|
2016-01-16 01:04:36 +01:00
|
|
|
/// Indicate that we are about to start a new sequence of mutations.
|
|
|
|
void StartMutationSequence();
|
|
|
|
/// Print the current sequence of mutations.
|
|
|
|
void PrintMutationSequence();
|
|
|
|
/// Indicate that the current sequence of mutations was successfull.
|
|
|
|
void RecordSuccessfulMutationSequence();
|
2016-06-03 23:34:29 +02:00
|
|
|
/// Mutates data by invoking user-provided mutator.
|
|
|
|
size_t Mutate_Custom(uint8_t *Data, size_t Size, size_t MaxSize);
|
2016-06-07 22:22:15 +02:00
|
|
|
/// Mutates data by invoking user-provided crossover.
|
|
|
|
size_t Mutate_CustomCrossOver(uint8_t *Data, size_t Size, size_t MaxSize);
|
2016-01-16 01:04:36 +01:00
|
|
|
/// Mutates data by shuffling bytes.
|
|
|
|
size_t Mutate_ShuffleBytes(uint8_t *Data, size_t Size, size_t MaxSize);
|
|
|
|
/// Mutates data by erasing a byte.
|
|
|
|
size_t Mutate_EraseByte(uint8_t *Data, size_t Size, size_t MaxSize);
|
|
|
|
/// Mutates data by inserting a byte.
|
|
|
|
size_t Mutate_InsertByte(uint8_t *Data, size_t Size, size_t MaxSize);
|
|
|
|
/// Mutates data by chanding one byte.
|
|
|
|
size_t Mutate_ChangeByte(uint8_t *Data, size_t Size, size_t MaxSize);
|
|
|
|
/// Mutates data by chanding one bit.
|
|
|
|
size_t Mutate_ChangeBit(uint8_t *Data, size_t Size, size_t MaxSize);
|
|
|
|
|
|
|
|
/// Mutates data by adding a word from the manual dictionary.
|
|
|
|
size_t Mutate_AddWordFromManualDictionary(uint8_t *Data, size_t Size,
|
|
|
|
size_t MaxSize);
|
|
|
|
|
|
|
|
/// Mutates data by adding a word from the temporary automatic dictionary.
|
|
|
|
size_t Mutate_AddWordFromTemporaryAutoDictionary(uint8_t *Data, size_t Size,
|
|
|
|
size_t MaxSize);
|
|
|
|
|
|
|
|
/// Mutates data by adding a word from the persistent automatic dictionary.
|
|
|
|
size_t Mutate_AddWordFromPersistentAutoDictionary(uint8_t *Data, size_t Size,
|
|
|
|
size_t MaxSize);
|
|
|
|
|
|
|
|
/// Tries to find an ASCII integer in Data, changes it to another ASCII int.
|
|
|
|
size_t Mutate_ChangeASCIIInteger(uint8_t *Data, size_t Size, size_t MaxSize);
|
|
|
|
|
|
|
|
/// CrossOver Data with some other element of the corpus.
|
|
|
|
size_t Mutate_CrossOver(uint8_t *Data, size_t Size, size_t MaxSize);
|
|
|
|
|
2016-06-03 23:34:29 +02:00
|
|
|
/// Applies one of the configured mutations.
|
2016-01-16 01:04:36 +01:00
|
|
|
/// Returns the new size of data which could be up to MaxSize.
|
|
|
|
size_t Mutate(uint8_t *Data, size_t Size, size_t MaxSize);
|
2016-06-03 23:34:29 +02:00
|
|
|
/// Applies one of the default mutations. Provided as a service
|
|
|
|
/// to mutation authors.
|
|
|
|
size_t DefaultMutate(uint8_t *Data, size_t Size, size_t MaxSize);
|
2016-01-16 01:04:36 +01:00
|
|
|
|
|
|
|
/// Creates a cross-over of two pieces of Data, returns its size.
|
|
|
|
size_t CrossOver(const uint8_t *Data1, size_t Size1, const uint8_t *Data2,
|
|
|
|
size_t Size2, uint8_t *Out, size_t MaxOutSize);
|
|
|
|
|
2016-01-16 04:53:32 +01:00
|
|
|
void AddWordToManualDictionary(const Word &W);
|
2016-01-16 01:04:36 +01:00
|
|
|
|
2016-07-16 01:27:19 +02:00
|
|
|
void AddWordToAutoDictionary(DictionaryEntry DE);
|
2016-01-16 01:04:36 +01:00
|
|
|
void ClearAutoDictionary();
|
|
|
|
void PrintRecommendedDictionary();
|
|
|
|
|
2016-02-13 04:37:24 +01:00
|
|
|
void SetCorpus(const std::vector<Unit> *Corpus) { this->Corpus = Corpus; }
|
2016-01-16 01:04:36 +01:00
|
|
|
|
2016-02-13 04:25:16 +01:00
|
|
|
Random &GetRand() { return Rand; }
|
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
private:
|
2016-02-13 04:37:24 +01:00
|
|
|
|
|
|
|
struct Mutator {
|
|
|
|
size_t (MutationDispatcher::*Fn)(uint8_t *Data, size_t Size, size_t Max);
|
|
|
|
const char *Name;
|
|
|
|
};
|
|
|
|
|
|
|
|
size_t AddWordFromDictionary(Dictionary &D, uint8_t *Data, size_t Size,
|
|
|
|
size_t MaxSize);
|
2016-06-03 23:34:29 +02:00
|
|
|
size_t MutateImpl(uint8_t *Data, size_t Size, size_t MaxSize,
|
|
|
|
const std::vector<Mutator> &Mutators);
|
|
|
|
|
2016-02-13 04:00:53 +01:00
|
|
|
Random &Rand;
|
2016-06-23 22:44:48 +02:00
|
|
|
const FuzzingOptions Options;
|
|
|
|
|
2016-02-13 04:37:24 +01:00
|
|
|
// Dictionary provided by the user via -dict=DICT_FILE.
|
|
|
|
Dictionary ManualDictionary;
|
|
|
|
// Temporary dictionary modified by the fuzzer itself,
|
|
|
|
// recreated periodically.
|
|
|
|
Dictionary TempAutoDictionary;
|
|
|
|
// Persistent dictionary modified by the fuzzer, consists of
|
|
|
|
// entries that led to successfull discoveries in the past mutations.
|
|
|
|
Dictionary PersistentAutoDictionary;
|
|
|
|
std::vector<Mutator> CurrentMutatorSequence;
|
|
|
|
std::vector<DictionaryEntry *> CurrentDictionaryEntrySequence;
|
|
|
|
const std::vector<Unit> *Corpus = nullptr;
|
2016-02-13 18:56:51 +01:00
|
|
|
std::vector<uint8_t> MutateInPlaceHere;
|
2016-02-13 04:46:26 +01:00
|
|
|
|
2016-06-03 23:34:29 +02:00
|
|
|
std::vector<Mutator> Mutators;
|
|
|
|
std::vector<Mutator> DefaultMutators;
|
2016-01-16 01:04:36 +01:00
|
|
|
};
|
|
|
|
|
2015-01-29 17:58:29 +01:00
|
|
|
class Fuzzer {
|
2016-01-22 23:28:27 +01:00
|
|
|
public:
|
2016-05-11 01:43:15 +02:00
|
|
|
|
|
|
|
// Aggregates all available coverage measurements.
|
|
|
|
struct Coverage {
|
|
|
|
Coverage() { Reset(); }
|
|
|
|
|
|
|
|
void Reset() {
|
|
|
|
BlockCoverage = 0;
|
|
|
|
CallerCalleeCoverage = 0;
|
|
|
|
PcMapBits = 0;
|
|
|
|
CounterBitmapBits = 0;
|
|
|
|
PcBufferLen = 0;
|
|
|
|
CounterBitmap.clear();
|
|
|
|
PCMap.Reset();
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string DebugString() const;
|
|
|
|
|
|
|
|
size_t BlockCoverage;
|
|
|
|
size_t CallerCalleeCoverage;
|
|
|
|
|
|
|
|
size_t PcBufferLen;
|
|
|
|
// Precalculated number of bits in CounterBitmap.
|
|
|
|
size_t CounterBitmapBits;
|
|
|
|
std::vector<uint8_t> CounterBitmap;
|
|
|
|
// Precalculated number of bits in PCMap.
|
|
|
|
size_t PcMapBits;
|
|
|
|
PcCoverageMap PCMap;
|
|
|
|
};
|
|
|
|
|
2016-02-13 04:25:16 +01:00
|
|
|
Fuzzer(UserCallback CB, MutationDispatcher &MD, FuzzingOptions Options);
|
2016-01-22 23:28:27 +01:00
|
|
|
void AddToCorpus(const Unit &U) {
|
|
|
|
Corpus.push_back(U);
|
|
|
|
UpdateCorpusDistribution();
|
|
|
|
}
|
2015-11-12 02:02:01 +01:00
|
|
|
size_t ChooseUnitIdxToMutate();
|
|
|
|
const Unit &ChooseUnitToMutate() { return Corpus[ChooseUnitIdxToMutate()]; };
|
2016-05-25 01:14:29 +02:00
|
|
|
void TruncateUnits(std::vector<Unit> *NewCorpus);
|
2015-09-08 19:30:35 +02:00
|
|
|
void Loop();
|
2015-11-12 02:02:01 +01:00
|
|
|
void Drill();
|
2015-01-29 17:58:29 +01:00
|
|
|
void ShuffleAndMinimize();
|
2015-05-11 23:16:27 +02:00
|
|
|
void InitializeTraceState();
|
2016-01-14 00:02:30 +01:00
|
|
|
void AssignTaintLabels(uint8_t *Data, size_t Size);
|
2015-01-29 17:58:29 +01:00
|
|
|
size_t CorpusSize() const { return Corpus.size(); }
|
2016-03-12 02:57:04 +01:00
|
|
|
size_t MaxUnitSizeInCorpus() const;
|
2016-02-18 22:49:10 +01:00
|
|
|
void ReadDir(const std::string &Path, long *Epoch, size_t MaxSize) {
|
2015-10-24 03:16:40 +02:00
|
|
|
Printf("Loading corpus: %s\n", Path.c_str());
|
2016-02-18 22:49:10 +01:00
|
|
|
ReadDirToVectorOfUnits(Path.c_str(), &Corpus, Epoch, MaxSize);
|
2015-01-29 17:58:29 +01:00
|
|
|
}
|
2016-03-12 02:57:04 +01:00
|
|
|
void RereadOutputCorpus(size_t MaxSize);
|
2015-01-29 17:58:29 +01:00
|
|
|
// Save the current corpus to OutputCorpus.
|
|
|
|
void SaveCorpus();
|
|
|
|
|
2015-02-05 00:42:42 +01:00
|
|
|
size_t secondsSinceProcessStartUp() {
|
|
|
|
return duration_cast<seconds>(system_clock::now() - ProcessStartTime)
|
|
|
|
.count();
|
|
|
|
}
|
2016-02-26 23:42:23 +01:00
|
|
|
size_t execPerSec() {
|
|
|
|
size_t Seconds = secondsSinceProcessStartUp();
|
|
|
|
return Seconds ? TotalNumberOfRuns / Seconds : 0;
|
|
|
|
}
|
2015-02-05 00:42:42 +01:00
|
|
|
|
|
|
|
size_t getTotalNumberOfRuns() { return TotalNumberOfRuns; }
|
|
|
|
|
2015-03-31 22:13:20 +02:00
|
|
|
static void StaticAlarmCallback();
|
2016-03-01 23:19:21 +01:00
|
|
|
static void StaticCrashSignalCallback();
|
|
|
|
static void StaticInterruptCallback();
|
2015-03-31 22:13:20 +02:00
|
|
|
|
2016-02-13 18:56:51 +01:00
|
|
|
void ExecuteCallback(const uint8_t *Data, size_t Size);
|
2016-05-04 22:44:50 +02:00
|
|
|
bool RunOne(const uint8_t *Data, size_t Size);
|
2015-01-29 17:58:29 +01:00
|
|
|
|
2015-10-24 03:16:40 +02:00
|
|
|
// Merge Corpora[1:] into Corpora[0].
|
|
|
|
void Merge(const std::vector<std::string> &Corpora);
|
2016-03-18 01:23:29 +01:00
|
|
|
// Returns a subset of 'Extra' that adds coverage to 'Initial'.
|
|
|
|
UnitVector FindExtraUnits(const UnitVector &Initial, const UnitVector &Extra);
|
2016-02-13 07:24:18 +01:00
|
|
|
MutationDispatcher &GetMD() { return MD; }
|
2016-02-26 23:42:23 +01:00
|
|
|
void PrintFinalStats();
|
2016-03-12 02:57:04 +01:00
|
|
|
void SetMaxLen(size_t MaxLen);
|
2016-05-07 01:38:07 +02:00
|
|
|
void RssLimitCallback();
|
2015-10-24 03:16:40 +02:00
|
|
|
|
2016-05-25 01:14:29 +02:00
|
|
|
// Public for tests.
|
|
|
|
void ResetCoverage();
|
|
|
|
|
2016-05-26 23:32:30 +02:00
|
|
|
bool InFuzzingThread() const { return IsMyThread; }
|
2016-05-27 00:17:32 +02:00
|
|
|
size_t GetCurrentUnitInFuzzingThead(const uint8_t **Data) const;
|
2016-05-26 23:32:30 +02:00
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
private:
|
2015-03-31 22:13:20 +02:00
|
|
|
void AlarmCallback();
|
2016-03-01 23:19:21 +01:00
|
|
|
void CrashCallback();
|
|
|
|
void InterruptCallback();
|
2015-12-19 03:49:09 +01:00
|
|
|
void MutateAndTestOne();
|
2015-10-23 00:50:47 +02:00
|
|
|
void ReportNewCoverage(const Unit &U);
|
2016-02-13 18:56:51 +01:00
|
|
|
bool RunOne(const Unit &U) { return RunOne(U.data(), U.size()); }
|
2016-05-26 22:03:02 +02:00
|
|
|
void RunOneAndUpdateCorpus(const uint8_t *Data, size_t Size);
|
2015-01-29 17:58:29 +01:00
|
|
|
void WriteToOutputCorpus(const Unit &U);
|
2015-07-23 20:37:22 +02:00
|
|
|
void WriteUnitToFileWithPrefix(const Unit &U, const char *Prefix);
|
2015-10-23 00:56:45 +02:00
|
|
|
void PrintStats(const char *Where, const char *End = "\n");
|
2015-11-12 02:02:01 +01:00
|
|
|
void PrintStatusForNewUnit(const Unit &U);
|
2016-03-18 01:23:29 +01:00
|
|
|
void ShuffleCorpus(UnitVector *V);
|
2016-05-26 22:25:49 +02:00
|
|
|
void TryDetectingAMemoryLeak(const uint8_t *Data, size_t Size,
|
|
|
|
bool DuringInitialCorpusExecution);
|
2016-03-18 01:23:29 +01:00
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
// Updates the probability distribution for the units in the corpus.
|
|
|
|
// Must be called whenever the corpus or unit weights are changed.
|
|
|
|
void UpdateCorpusDistribution();
|
2015-01-29 17:58:29 +01:00
|
|
|
|
2016-05-11 01:43:15 +02:00
|
|
|
bool UpdateMaxCoverage();
|
2015-10-23 00:50:47 +02:00
|
|
|
|
2015-05-07 23:02:11 +02:00
|
|
|
// Trace-based fuzzing: we run a unit with some kind of tracing
|
|
|
|
// enabled and record potentially useful mutations. Then
|
|
|
|
// We apply these mutations one by one to the unit and run it again.
|
|
|
|
|
|
|
|
// Start tracing; forget all previously proposed mutations.
|
|
|
|
void StartTraceRecording();
|
2016-01-09 04:08:58 +01:00
|
|
|
// Stop tracing.
|
|
|
|
void StopTraceRecording();
|
2015-05-07 23:02:11 +02:00
|
|
|
|
2015-01-29 17:58:29 +01:00
|
|
|
void SetDeathCallback();
|
2015-03-31 22:13:20 +02:00
|
|
|
static void StaticDeathCallback();
|
2016-03-01 23:19:21 +01:00
|
|
|
void DumpCurrentUnit(const char *Prefix);
|
2015-03-31 22:13:20 +02:00
|
|
|
void DeathCallback();
|
2016-01-14 00:46:01 +01:00
|
|
|
|
2016-05-27 02:21:33 +02:00
|
|
|
void LazyAllocateCurrentUnitData();
|
|
|
|
uint8_t *CurrentUnitData = nullptr;
|
2016-05-27 02:54:15 +02:00
|
|
|
std::atomic<size_t> CurrentUnitSize;
|
2015-01-29 17:58:29 +01:00
|
|
|
|
|
|
|
size_t TotalNumberOfRuns = 0;
|
2016-02-26 23:42:23 +01:00
|
|
|
size_t NumberOfNewUnitsAdded = 0;
|
2015-01-29 17:58:29 +01:00
|
|
|
|
2016-04-20 02:24:21 +02:00
|
|
|
bool HasMoreMallocsThanFrees = false;
|
2016-04-27 21:52:34 +02:00
|
|
|
size_t NumberOfLeakDetectionAttempts = 0;
|
2016-04-20 02:24:21 +02:00
|
|
|
|
2015-01-29 17:58:29 +01:00
|
|
|
std::vector<Unit> Corpus;
|
2015-05-19 03:06:07 +02:00
|
|
|
std::unordered_set<std::string> UnitHashesAddedToCorpus;
|
2016-02-13 18:56:51 +01:00
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
std::piecewise_constant_distribution<double> CorpusDistribution;
|
2016-02-13 04:25:16 +01:00
|
|
|
UserCallback CB;
|
|
|
|
MutationDispatcher &MD;
|
2015-01-29 17:58:29 +01:00
|
|
|
FuzzingOptions Options;
|
|
|
|
system_clock::time_point ProcessStartTime = system_clock::now();
|
2015-03-31 22:13:20 +02:00
|
|
|
system_clock::time_point UnitStartTime;
|
2015-03-31 01:04:35 +02:00
|
|
|
long TimeOfLongestUnitInSeconds = 0;
|
2015-05-08 23:30:55 +02:00
|
|
|
long EpochOfLastReadOfOutputCorpus = 0;
|
2016-05-11 01:43:15 +02:00
|
|
|
|
|
|
|
// Maximum recorded coverage.
|
|
|
|
Coverage MaxCoverage;
|
2016-05-26 23:32:30 +02:00
|
|
|
|
|
|
|
// Need to know our own thread.
|
|
|
|
static thread_local bool IsMyThread;
|
2015-01-29 17:58:29 +01:00
|
|
|
};
|
|
|
|
|
2016-06-08 01:32:50 +02:00
|
|
|
// Global interface to functions that may or may not be available.
|
|
|
|
extern ExternalFunctions *EF;
|
|
|
|
|
2016-01-22 23:28:27 +01:00
|
|
|
}; // namespace fuzzer
|
2015-08-10 18:37:40 +02:00
|
|
|
|
|
|
|
#endif // LLVM_FUZZER_INTERNAL_H
|