blob: 563fbf4c30dfcdc70d528ec8ac5cf2a5b5a04e4c [file] [log] [blame]
Aaron Ballmanef116982015-01-29 16:58:29 +00001//===- FuzzerLoop.cpp - Fuzzer's main loop --------------------------------===//
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's main loop.
10//===----------------------------------------------------------------------===//
11
12#include "FuzzerInternal.h"
Kostya Serebryany4b96ce92015-02-03 19:42:05 +000013#include <sanitizer/coverage_interface.h>
Aaron Ballmanef116982015-01-29 16:58:29 +000014#include <algorithm>
Aaron Ballmanef116982015-01-29 16:58:29 +000015#include <iostream>
Aaron Ballmanef116982015-01-29 16:58:29 +000016
Aaron Ballmanef116982015-01-29 16:58:29 +000017namespace fuzzer {
18
19// static
20Unit Fuzzer::CurrentUnit;
21system_clock::time_point Fuzzer::UnitStartTime;
22
23void Fuzzer::SetDeathCallback() {
24 __sanitizer_set_death_callback(DeathCallback);
25}
26
27void Fuzzer::DeathCallback() {
28 std::cerr << "DEATH: " << std::endl;
29 Print(CurrentUnit, "\n");
30 PrintASCII(CurrentUnit, "\n");
31 WriteToCrash(CurrentUnit, "crash-");
32}
33
34void Fuzzer::AlarmCallback() {
35 size_t Seconds =
36 duration_cast<seconds>(system_clock::now() - UnitStartTime).count();
37 std::cerr << "ALARM: working on the last Unit for " << Seconds << " seconds"
38 << std::endl;
39 if (Seconds >= 3) {
40 Print(CurrentUnit, "\n");
41 PrintASCII(CurrentUnit, "\n");
42 WriteToCrash(CurrentUnit, "timeout-");
43 }
44 exit(1);
45}
46
47void Fuzzer::ShuffleAndMinimize() {
Kostya Serebryany92e04762015-02-04 23:42:42 +000048 bool PreferSmall =
49 (Options.PreferSmallDuringInitialShuffle == 1 ||
50 (Options.PreferSmallDuringInitialShuffle == -1 && rand() % 2));
Aaron Ballmanef116982015-01-29 16:58:29 +000051 if (Options.Verbosity)
Kostya Serebryany92e04762015-02-04 23:42:42 +000052 std::cerr << "Shuffle: Size: " << Corpus.size()
53 << " prefer small: " << PreferSmall
54 << "\n";
Aaron Ballmanef116982015-01-29 16:58:29 +000055 std::vector<Unit> NewCorpus;
Kostya Serebryany92e04762015-02-04 23:42:42 +000056 std::random_shuffle(Corpus.begin(), Corpus.end());
57 if (PreferSmall)
58 std::stable_sort(
59 Corpus.begin(), Corpus.end(),
60 [](const Unit &A, const Unit &B) { return A.size() < B.size(); });
Aaron Ballmanef116982015-01-29 16:58:29 +000061 size_t MaxCov = 0;
62 Unit &U = CurrentUnit;
63 for (const auto &C : Corpus) {
64 for (size_t First = 0; First < 1; First++) {
65 U.clear();
66 size_t Last = std::min(First + Options.MaxLen, C.size());
67 U.insert(U.begin(), C.begin() + First, C.begin() + Last);
68 size_t NewCoverage = RunOne(U);
69 if (NewCoverage) {
70 MaxCov = NewCoverage;
71 NewCorpus.push_back(U);
72 if (Options.Verbosity >= 2)
Kostya Serebryany92e04762015-02-04 23:42:42 +000073 std::cerr << "NEW0: " << NewCoverage
74 << " L " << U.size()
75 << "\n";
Aaron Ballmanef116982015-01-29 16:58:29 +000076 }
77 }
78 }
79 Corpus = NewCorpus;
80 if (Options.Verbosity)
81 std::cerr << "Shuffle done: " << Corpus.size() << " IC: " << MaxCov << "\n";
82}
83
84size_t Fuzzer::RunOne(const Unit &U) {
85 UnitStartTime = system_clock::now();
86 TotalNumberOfRuns++;
Kostya Serebryany2c1b33b2015-01-29 23:01:07 +000087 if (Options.UseFullCoverageSet)
88 return RunOneMaximizeFullCoverageSet(U);
Kostya Serebryany2e3622b2015-02-20 03:02:37 +000089 if (Options.UseCoveragePairs)
90 return RunOneMaximizeCoveragePairs(U);
Kostya Serebryany2c1b33b2015-01-29 23:01:07 +000091 return RunOneMaximizeTotalCoverage(U);
92}
93
94static uintptr_t HashOfArrayOfPCs(uintptr_t *PCs, uintptr_t NumPCs) {
95 uintptr_t Res = 0;
96 for (uintptr_t i = 0; i < NumPCs; i++) {
97 Res = (Res + PCs[i]) * 7;
98 }
99 return Res;
100}
101
Kostya Serebryany2e3622b2015-02-20 03:02:37 +0000102// Experimental. Does not yet scale.
103// Fuly reset the current coverage state, run a single unit,
104// collect all coverage pairs and return non-zero if a new pair is observed.
105size_t Fuzzer::RunOneMaximizeCoveragePairs(const Unit &U) {
106 __sanitizer_reset_coverage();
107 Callback(U.data(), U.size());
108 uintptr_t *PCs;
109 uintptr_t NumPCs = __sanitizer_get_coverage_guards(&PCs);
110 bool HasNewPairs = false;
111 for (uintptr_t i = 0; i < NumPCs; i++) {
112 if (!PCs[i]) continue;
113 for (uintptr_t j = 0; j < NumPCs; j++) {
114 if (!PCs[j]) continue;
115 uint64_t Pair = (i << 32) | j;
116 HasNewPairs |= CoveragePairs.insert(Pair).second;
117 }
118 }
119 if (HasNewPairs)
120 return CoveragePairs.size();
121 return 0;
122}
123
124// Experimental.
Kostya Serebryany2c1b33b2015-01-29 23:01:07 +0000125// Fuly reset the current coverage state, run a single unit,
126// compute a hash function from the full coverage set,
127// return non-zero if the hash value is new.
128// This produces tons of new units and as is it's only suitable for small tests,
129// e.g. test/FullCoverageSetTest.cpp. FIXME: make it scale.
130size_t Fuzzer::RunOneMaximizeFullCoverageSet(const Unit &U) {
131 __sanitizer_reset_coverage();
Kostya Serebryany016852c2015-02-19 18:45:37 +0000132 Callback(U.data(), U.size());
Kostya Serebryany2c1b33b2015-01-29 23:01:07 +0000133 uintptr_t *PCs;
134 uintptr_t NumPCs =__sanitizer_get_coverage_guards(&PCs);
135 if (FullCoverageSets.insert(HashOfArrayOfPCs(PCs, NumPCs)).second)
136 return FullCoverageSets.size();
137 return 0;
138}
139
140size_t Fuzzer::RunOneMaximizeTotalCoverage(const Unit &U) {
Kostya Serebryanybe5e0ed2015-03-03 23:27:02 +0000141 size_t NumCounters = __sanitizer_get_number_of_counters();
142 if (Options.UseCounters) {
143 CounterBitmap.resize(NumCounters);
144 __sanitizer_update_counter_bitset_and_clear_counters(0);
145 }
Aaron Ballmanef116982015-01-29 16:58:29 +0000146 size_t OldCoverage = __sanitizer_get_total_unique_coverage();
Kostya Serebryany016852c2015-02-19 18:45:37 +0000147 Callback(U.data(), U.size());
Aaron Ballmanef116982015-01-29 16:58:29 +0000148 size_t NewCoverage = __sanitizer_get_total_unique_coverage();
Kostya Serebryanybe5e0ed2015-03-03 23:27:02 +0000149 size_t NumNewBits = 0;
150 if (Options.UseCounters)
151 NumNewBits = __sanitizer_update_counter_bitset_and_clear_counters(
152 CounterBitmap.data());
153
Aaron Ballmanef116982015-01-29 16:58:29 +0000154 if (!(TotalNumberOfRuns & (TotalNumberOfRuns - 1)) && Options.Verbosity) {
Kostya Serebryany92e04762015-02-04 23:42:42 +0000155 size_t Seconds = secondsSinceProcessStartUp();
Aaron Ballmanef116982015-01-29 16:58:29 +0000156 std::cerr
157 << "#" << TotalNumberOfRuns
158 << "\tcov: " << NewCoverage
Kostya Serebryanybe5e0ed2015-03-03 23:27:02 +0000159 << "\tbits: " << TotalBits()
Aaron Ballmanef116982015-01-29 16:58:29 +0000160 << "\texec/s: " << (Seconds ? TotalNumberOfRuns / Seconds : 0) << "\n";
161 }
Kostya Serebryanybe5e0ed2015-03-03 23:27:02 +0000162 if (NewCoverage > OldCoverage || NumNewBits)
Aaron Ballmanef116982015-01-29 16:58:29 +0000163 return NewCoverage;
164 return 0;
165}
166
167void Fuzzer::WriteToOutputCorpus(const Unit &U) {
168 if (Options.OutputCorpus.empty()) return;
169 std::string Path = DirPlusFile(Options.OutputCorpus, Hash(U));
170 WriteToFile(U, Path);
171 if (Options.Verbosity >= 2)
172 std::cerr << "Written to " << Path << std::endl;
173}
174
175void Fuzzer::WriteToCrash(const Unit &U, const char *Prefix) {
176 std::string Path = Prefix + Hash(U);
177 WriteToFile(U, Path);
178 std::cerr << "CRASHED; file written to " << Path << std::endl;
179}
180
181void Fuzzer::SaveCorpus() {
182 if (Options.OutputCorpus.empty()) return;
183 for (const auto &U : Corpus)
184 WriteToFile(U, DirPlusFile(Options.OutputCorpus, Hash(U)));
185 if (Options.Verbosity)
186 std::cerr << "Written corpus of " << Corpus.size() << " files to "
187 << Options.OutputCorpus << "\n";
188}
189
190size_t Fuzzer::MutateAndTestOne(Unit *U) {
191 size_t NewUnits = 0;
Kostya Serebryany5b266a82015-02-04 19:10:20 +0000192 for (int i = 0; i < Options.MutateDepth; i++) {
Kostya Serebryany33f86692015-02-04 22:20:09 +0000193 if (TotalNumberOfRuns >= Options.MaxNumberOfRuns)
194 return NewUnits;
Aaron Ballmanef116982015-01-29 16:58:29 +0000195 Mutate(U, Options.MaxLen);
Aaron Ballmanef116982015-01-29 16:58:29 +0000196 size_t NewCoverage = RunOne(*U);
197 if (NewCoverage) {
198 Corpus.push_back(*U);
199 NewUnits++;
200 if (Options.Verbosity) {
201 std::cerr << "#" << TotalNumberOfRuns
202 << "\tNEW: " << NewCoverage
Kostya Serebryanybe5e0ed2015-03-03 23:27:02 +0000203 << " B: " << TotalBits()
Aaron Ballmanef116982015-01-29 16:58:29 +0000204 << " L: " << U->size()
Kostya Serebryanyfe43aa82015-02-04 01:22:57 +0000205 << " S: " << Corpus.size()
Kostya Serebryany5b266a82015-02-04 19:10:20 +0000206 << " I: " << i
Aaron Ballmanef116982015-01-29 16:58:29 +0000207 << "\t";
208 if (U->size() < 30) {
209 PrintASCII(*U);
210 std::cerr << "\t";
211 Print(*U);
212 }
213 std::cerr << "\n";
214 }
215 WriteToOutputCorpus(*U);
216 if (Options.ExitOnFirst)
217 exit(0);
218 }
219 }
220 return NewUnits;
221}
222
223size_t Fuzzer::Loop(size_t NumIterations) {
224 size_t NewUnits = 0;
225 for (size_t i = 1; i <= NumIterations; i++) {
Kostya Serebryany33f86692015-02-04 22:20:09 +0000226 for (size_t J1 = 0; J1 < Corpus.size(); J1++) {
227 if (TotalNumberOfRuns >= Options.MaxNumberOfRuns)
228 return NewUnits;
229 // First, simply mutate the unit w/o doing crosses.
230 CurrentUnit = Corpus[J1];
231 NewUnits += MutateAndTestOne(&CurrentUnit);
232 // Now, cross with others.
233 if (Options.DoCrossOver) {
Aaron Ballmanef116982015-01-29 16:58:29 +0000234 for (size_t J2 = 0; J2 < Corpus.size(); J2++) {
235 CurrentUnit.clear();
236 CrossOver(Corpus[J1], Corpus[J2], &CurrentUnit, Options.MaxLen);
237 NewUnits += MutateAndTestOne(&CurrentUnit);
238 }
239 }
Aaron Ballmanef116982015-01-29 16:58:29 +0000240 }
241 }
242 return NewUnits;
243}
244
245} // namespace fuzzer