blob: 32165227c225b1d61def2e5245af53e8d7def3e3 [file] [log] [blame]
george.karpenkov29efa6d2017-08-21 23:25:50 +00001//===- FuzzerMutate.h - Internal header for the Fuzzer ----------*- C++ -* ===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9// fuzzer::MutationDispatcher
10//===----------------------------------------------------------------------===//
11
12#ifndef LLVM_FUZZER_MUTATE_H
13#define LLVM_FUZZER_MUTATE_H
14
15#include "FuzzerDefs.h"
16#include "FuzzerDictionary.h"
17#include "FuzzerOptions.h"
18#include "FuzzerRandom.h"
19
20namespace fuzzer {
21
22class MutationDispatcher {
23public:
24 MutationDispatcher(Random &Rand, const FuzzingOptions &Options);
25 ~MutationDispatcher() {}
26 /// Indicate that we are about to start a new sequence of mutations.
27 void StartMutationSequence();
28 /// Print the current sequence of mutations.
29 void PrintMutationSequence();
sylvestrea9eb8572018-03-13 14:35:10 +000030 /// Indicate that the current sequence of mutations was successful.
george.karpenkov29efa6d2017-08-21 23:25:50 +000031 void RecordSuccessfulMutationSequence();
32 /// Mutates data by invoking user-provided mutator.
33 size_t Mutate_Custom(uint8_t *Data, size_t Size, size_t MaxSize);
34 /// Mutates data by invoking user-provided crossover.
35 size_t Mutate_CustomCrossOver(uint8_t *Data, size_t Size, size_t MaxSize);
36 /// Mutates data by shuffling bytes.
37 size_t Mutate_ShuffleBytes(uint8_t *Data, size_t Size, size_t MaxSize);
38 /// Mutates data by erasing bytes.
39 size_t Mutate_EraseBytes(uint8_t *Data, size_t Size, size_t MaxSize);
40 /// Mutates data by inserting a byte.
41 size_t Mutate_InsertByte(uint8_t *Data, size_t Size, size_t MaxSize);
42 /// Mutates data by inserting several repeated bytes.
43 size_t Mutate_InsertRepeatedBytes(uint8_t *Data, size_t Size, size_t MaxSize);
44 /// Mutates data by chanding one byte.
45 size_t Mutate_ChangeByte(uint8_t *Data, size_t Size, size_t MaxSize);
46 /// Mutates data by chanding one bit.
47 size_t Mutate_ChangeBit(uint8_t *Data, size_t Size, size_t MaxSize);
48 /// Mutates data by copying/inserting a part of data into a different place.
49 size_t Mutate_CopyPart(uint8_t *Data, size_t Size, size_t MaxSize);
50
51 /// Mutates data by adding a word from the manual dictionary.
52 size_t Mutate_AddWordFromManualDictionary(uint8_t *Data, size_t Size,
53 size_t MaxSize);
54
55 /// Mutates data by adding a word from the TORC.
56 size_t Mutate_AddWordFromTORC(uint8_t *Data, size_t Size, size_t MaxSize);
57
58 /// Mutates data by adding a word from the persistent automatic dictionary.
59 size_t Mutate_AddWordFromPersistentAutoDictionary(uint8_t *Data, size_t Size,
60 size_t MaxSize);
61
62 /// Tries to find an ASCII integer in Data, changes it to another ASCII int.
63 size_t Mutate_ChangeASCIIInteger(uint8_t *Data, size_t Size, size_t MaxSize);
64 /// Change a 1-, 2-, 4-, or 8-byte integer in interesting ways.
65 size_t Mutate_ChangeBinaryInteger(uint8_t *Data, size_t Size, size_t MaxSize);
66
67 /// CrossOver Data with some other element of the corpus.
68 size_t Mutate_CrossOver(uint8_t *Data, size_t Size, size_t MaxSize);
69
70 /// Applies one of the configured mutations.
71 /// Returns the new size of data which could be up to MaxSize.
72 size_t Mutate(uint8_t *Data, size_t Size, size_t MaxSize);
73 /// Applies one of the default mutations. Provided as a service
74 /// to mutation authors.
75 size_t DefaultMutate(uint8_t *Data, size_t Size, size_t MaxSize);
76
77 /// Creates a cross-over of two pieces of Data, returns its size.
78 size_t CrossOver(const uint8_t *Data1, size_t Size1, const uint8_t *Data2,
79 size_t Size2, uint8_t *Out, size_t MaxOutSize);
80
81 void AddWordToManualDictionary(const Word &W);
82
83 void PrintRecommendedDictionary();
84
85 void SetCorpus(const InputCorpus *Corpus) { this->Corpus = Corpus; }
86
87 Random &GetRand() { return Rand; }
88
morehousecfe1f442018-07-09 20:17:52 +000089 void PrintMutationStats();
george.karpenkov29efa6d2017-08-21 23:25:50 +000090
morehousecfe1f442018-07-09 20:17:52 +000091 void RecordUsefulMutations();
92
93private:
george.karpenkov29efa6d2017-08-21 23:25:50 +000094 struct Mutator {
95 size_t (MutationDispatcher::*Fn)(uint8_t *Data, size_t Size, size_t Max);
96 const char *Name;
97 };
98
99 size_t AddWordFromDictionary(Dictionary &D, uint8_t *Data, size_t Size,
100 size_t MaxSize);
101 size_t MutateImpl(uint8_t *Data, size_t Size, size_t MaxSize,
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000102 Vector<Mutator> &Mutators);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000103
104 size_t InsertPartOf(const uint8_t *From, size_t FromSize, uint8_t *To,
105 size_t ToSize, size_t MaxToSize);
106 size_t CopyPartOf(const uint8_t *From, size_t FromSize, uint8_t *To,
107 size_t ToSize);
108 size_t ApplyDictionaryEntry(uint8_t *Data, size_t Size, size_t MaxSize,
109 DictionaryEntry &DE);
110
111 template <class T>
112 DictionaryEntry MakeDictionaryEntryFromCMP(T Arg1, T Arg2,
113 const uint8_t *Data, size_t Size);
114 DictionaryEntry MakeDictionaryEntryFromCMP(const Word &Arg1, const Word &Arg2,
115 const uint8_t *Data, size_t Size);
116 DictionaryEntry MakeDictionaryEntryFromCMP(const void *Arg1, const void *Arg2,
117 const void *Arg1Mutation,
118 const void *Arg2Mutation,
119 size_t ArgSize,
120 const uint8_t *Data, size_t Size);
121
122 Random &Rand;
123 const FuzzingOptions Options;
124
125 // Dictionary provided by the user via -dict=DICT_FILE.
126 Dictionary ManualDictionary;
127 // Temporary dictionary modified by the fuzzer itself,
128 // recreated periodically.
129 Dictionary TempAutoDictionary;
130 // Persistent dictionary modified by the fuzzer, consists of
sylvestrea9eb8572018-03-13 14:35:10 +0000131 // entries that led to successful discoveries in the past mutations.
george.karpenkov29efa6d2017-08-21 23:25:50 +0000132 Dictionary PersistentAutoDictionary;
133
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000134 Vector<DictionaryEntry *> CurrentDictionaryEntrySequence;
morehousecfe1f442018-07-09 20:17:52 +0000135 Vector<size_t> CurrentMutatorIdxSequence;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000136
137 static const size_t kCmpDictionaryEntriesDequeSize = 16;
138 DictionaryEntry CmpDictionaryEntriesDeque[kCmpDictionaryEntriesDequeSize];
139 size_t CmpDictionaryEntriesDequeIdx = 0;
140
141 const InputCorpus *Corpus = nullptr;
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000142 Vector<uint8_t> MutateInPlaceHere;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000143 // CustomCrossOver needs its own buffer as a custom implementation may call
144 // LLVMFuzzerMutate, which in turn may resize MutateInPlaceHere.
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000145 Vector<uint8_t> CustomCrossOverInPlaceHere;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000146
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000147 Vector<Mutator> Mutators;
148 Vector<Mutator> DefaultMutators;
morehousecfe1f442018-07-09 20:17:52 +0000149
150 // A total count of each mutation used in the fuzzing process.
151 Vector<uint64_t> TotalMutations;
152 // The number of each mutation that resulted in new coverage.
153 Vector<uint64_t> UsefulMutations;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000154};
155
156} // namespace fuzzer
157
158#endif // LLVM_FUZZER_MUTATE_H