blob: 4aeace134dd183a0de0f22375a9d2b5024d2f6d1 [file] [log] [blame]
Kostya Serebryany79677382015-03-31 21:39:38 +00001========================================================
Kostya Serebryany35ce8632015-03-30 23:05:30 +00002LibFuzzer -- a library for coverage-guided fuzz testing.
3========================================================
Kostya Serebryany79677382015-03-31 21:39:38 +00004.. contents::
5 :local:
6 :depth: 4
7
8Introduction
9============
Kostya Serebryany35ce8632015-03-30 23:05:30 +000010
11This library is intended primarily for in-process coverage-guided fuzz testing
12(fuzzing) of other libraries. The typical workflow looks like this:
13
14* Build the Fuzzer library as a static archive (or just a set of .o files).
15 Note that the Fuzzer contains the main() function.
16 Preferably do *not* use sanitizers while building the Fuzzer.
Alexey Samsonov21a33812015-05-07 23:33:24 +000017* Build the library you are going to test with
Kostya Serebryany2adfa3b2015-05-20 21:03:03 +000018 `-fsanitize-coverage={bb,edge}[,indirect-calls,8bit-counters]`
Kostya Serebryany35ce8632015-03-30 23:05:30 +000019 and one of the sanitizers. We recommend to build the library in several
20 different modes (e.g. asan, msan, lsan, ubsan, etc) and even using different
21 optimizations options (e.g. -O0, -O1, -O2) to diversify testing.
22* Build a test driver using the same options as the library.
23 The test driver is a C/C++ file containing interesting calls to the library
Kostya Serebryany566bc5a2015-05-06 22:19:00 +000024 inside a single function ``extern "C" void LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size);``
Kostya Serebryany35ce8632015-03-30 23:05:30 +000025* Link the Fuzzer, the library and the driver together into an executable
26 using the same sanitizer options as for the library.
27* Collect the initial corpus of inputs for the
28 fuzzer (a directory with test inputs, one file per input).
29 The better your inputs are the faster you will find something interesting.
30 Also try to keep your inputs small, otherwise the Fuzzer will run too slow.
Kostya Serebryanyc5f905c2015-05-26 19:32:52 +000031 By default, the Fuzzer limits the size of every input to 64 bytes
Kostya Serebryany2adfa3b2015-05-20 21:03:03 +000032 (use ``-max_len=N`` to override).
Kostya Serebryany35ce8632015-03-30 23:05:30 +000033* Run the fuzzer with the test corpus. As new interesting test cases are
34 discovered they will be added to the corpus. If a bug is discovered by
35 the sanitizer (asan, etc) it will be reported as usual and the reproducer
36 will be written to disk.
37 Each Fuzzer process is single-threaded (unless the library starts its own
Alexey Samsonov675e5392015-04-27 22:50:06 +000038 threads). You can run the Fuzzer on the same corpus in multiple processes
Kostya Serebryany2adfa3b2015-05-20 21:03:03 +000039 in parallel.
Kostya Serebryany35ce8632015-03-30 23:05:30 +000040
41
Kostya Serebryany79677382015-03-31 21:39:38 +000042The Fuzzer is similar in concept to AFL_,
Kostya Serebryany35ce8632015-03-30 23:05:30 +000043but uses in-process Fuzzing, which is more fragile, more restrictive, but
44potentially much faster as it has no overhead for process start-up.
Kostya Serebryany79677382015-03-31 21:39:38 +000045It uses LLVM's SanitizerCoverage_ instrumentation to get in-process
46coverage-feedback
Kostya Serebryany35ce8632015-03-30 23:05:30 +000047
Kostya Serebryany79677382015-03-31 21:39:38 +000048The code resides in the LLVM repository, requires the fresh Clang compiler to build
49and is used to fuzz various parts of LLVM,
50but the Fuzzer itself does not (and should not) depend on any
51part of LLVM and can be used for other projects w/o requiring the rest of LLVM.
Kostya Serebryany35ce8632015-03-30 23:05:30 +000052
Kostya Serebryany2adfa3b2015-05-20 21:03:03 +000053Flags
54=====
55The most important flags are::
56
57 seed 0 Random seed. If 0, seed is generated.
58 runs -1 Number of individual test runs (-1 for infinite runs).
Kostya Serebryanyc5f905c2015-05-26 19:32:52 +000059 max_len 64 Maximum length of the test input.
Kostya Serebryany2adfa3b2015-05-20 21:03:03 +000060 cross_over 1 If 1, cross over inputs.
61 mutate_depth 5 Apply this number of consecutive mutations to each input.
Kostya Serebryany316b5712015-05-26 20:57:47 +000062 timeout 1200 Timeout in seconds (if positive). If one unit runs more than this number of seconds the process will abort.
Kostya Serebryany2adfa3b2015-05-20 21:03:03 +000063 help 0 Print help.
64 save_minimized_corpus 0 If 1, the minimized corpus is saved into the first input directory
65 jobs 0 Number of jobs to run. If jobs >= 1 we spawn this number of jobs in separate worker processes with stdout/stderr redirected to fuzz-JOB.log.
66 workers 0 Number of simultaneous worker processes to run the jobs. If zero, "min(jobs,NumberOfCpuCores()/2)" is used.
67 tokens 0 Use the file with tokens (one token per line) to fuzz a token based input language.
68 apply_tokens 0 Read the given input file, substitute bytes with tokens and write the result to stdout.
69 sync_command 0 Execute an external command "<sync_command> <test_corpus>" to synchronize the test corpus.
Kostya Serebryanyc5f905c2015-05-26 19:32:52 +000070 sync_timeout 600 Minimum timeout between syncs.
Kostya Serebryanyb17e2982015-07-31 21:48:10 +000071 use_traces 0 Experimental: use instruction traces
Kostya Serebryanybc7c0ad2015-08-11 01:44:42 +000072 only_ascii 0 If 1, generate only ASCII (isprint+isspace) inputs.
Kostya Serebryanyb17e2982015-07-31 21:48:10 +000073
Kostya Serebryany2adfa3b2015-05-20 21:03:03 +000074
75For the full list of flags run the fuzzer binary with ``-help=1``.
76
Kostya Serebryany79677382015-03-31 21:39:38 +000077Usage examples
78==============
79
80Toy example
81-----------
82
83A simple function that does something interesting if it receives the input "HI!"::
84
85 cat << EOF >> test_fuzzer.cc
Kostya Serebryany566bc5a2015-05-06 22:19:00 +000086 extern "C" void LLVMFuzzerTestOneInput(const unsigned char *data, unsigned long size) {
Kostya Serebryany79677382015-03-31 21:39:38 +000087 if (size > 0 && data[0] == 'H')
88 if (size > 1 && data[1] == 'I')
89 if (size > 2 && data[2] == '!')
90 __builtin_trap();
91 }
92 EOF
93 # Get lib/Fuzzer. Assuming that you already have fresh clang in PATH.
94 svn co http://llvm.org/svn/llvm-project/llvm/trunk/lib/Fuzzer
95 # Build lib/Fuzzer files.
96 clang -c -g -O2 -std=c++11 Fuzzer/*.cpp -IFuzzer
97 # Build test_fuzzer.cc with asan and link against lib/Fuzzer.
Alexey Samsonov21a33812015-05-07 23:33:24 +000098 clang++ -fsanitize=address -fsanitize-coverage=edge test_fuzzer.cc Fuzzer*.o
Kostya Serebryany79677382015-03-31 21:39:38 +000099 # Run the fuzzer with no corpus.
100 ./a.out
101
102You should get ``Illegal instruction (core dumped)`` pretty quickly.
103
104PCRE2
105-----
106
107Here we show how to use lib/Fuzzer on something real, yet simple: pcre2_::
108
Alexey Samsonov21a33812015-05-07 23:33:24 +0000109 COV_FLAGS=" -fsanitize-coverage=edge,indirect-calls,8bit-counters"
Kostya Serebryany79677382015-03-31 21:39:38 +0000110 # Get PCRE2
111 svn co svn://vcs.exim.org/pcre2/code/trunk pcre
112 # Get lib/Fuzzer. Assuming that you already have fresh clang in PATH.
113 svn co http://llvm.org/svn/llvm-project/llvm/trunk/lib/Fuzzer
114 # Build PCRE2 with AddressSanitizer and coverage.
115 (cd pcre; ./autogen.sh; CC="clang -fsanitize=address $COV_FLAGS" ./configure --prefix=`pwd`/../inst && make -j && make install)
116 # Build lib/Fuzzer files.
117 clang -c -g -O2 -std=c++11 Fuzzer/*.cpp -IFuzzer
Eric Christopher572e03a2015-06-19 01:53:21 +0000118 # Build the actual function that does something interesting with PCRE2.
Kostya Serebryany79677382015-03-31 21:39:38 +0000119 cat << EOF > pcre_fuzzer.cc
120 #include <string.h>
121 #include "pcre2posix.h"
Kostya Serebryany566bc5a2015-05-06 22:19:00 +0000122 extern "C" void LLVMFuzzerTestOneInput(const unsigned char *data, size_t size) {
Kostya Serebryany79677382015-03-31 21:39:38 +0000123 if (size < 1) return;
124 char *str = new char[size+1];
125 memcpy(str, data, size);
126 str[size] = 0;
127 regex_t preg;
128 if (0 == regcomp(&preg, str, 0)) {
129 regexec(&preg, str, 0, 0, 0);
130 regfree(&preg);
131 }
132 delete [] str;
133 }
134 EOF
135 clang++ -g -fsanitize=address $COV_FLAGS -c -std=c++11 -I inst/include/ pcre_fuzzer.cc
136 # Link.
137 clang++ -g -fsanitize=address -Wl,--whole-archive inst/lib/*.a -Wl,-no-whole-archive Fuzzer*.o pcre_fuzzer.o -o pcre_fuzzer
138
139This will give you a binary of the fuzzer, called ``pcre_fuzzer``.
140Now, create a directory that will hold the test corpus::
141
142 mkdir -p CORPUS
143
144For simple input languages like regular expressions this is all you need.
145For more complicated inputs populate the directory with some input samples.
146Now run the fuzzer with the corpus dir as the only parameter::
147
148 ./pcre_fuzzer ./CORPUS
149
150You will see output like this::
151
152 Seed: 1876794929
153 #0 READ cov 0 bits 0 units 1 exec/s 0
154 #1 pulse cov 3 bits 0 units 1 exec/s 0
155 #1 INITED cov 3 bits 0 units 1 exec/s 0
156 #2 pulse cov 208 bits 0 units 1 exec/s 0
157 #2 NEW cov 208 bits 0 units 2 exec/s 0 L: 64
158 #3 NEW cov 217 bits 0 units 3 exec/s 0 L: 63
159 #4 pulse cov 217 bits 0 units 3 exec/s 0
160
161* The ``Seed:`` line shows you the current random seed (you can change it with ``-seed=N`` flag).
162* The ``READ`` line shows you how many input files were read (since you passed an empty dir there were inputs, but one dummy input was synthesised).
163* The ``INITED`` line shows you that how many inputs will be fuzzed.
164* The ``NEW`` lines appear with the fuzzer finds a new interesting input, which is saved to the CORPUS dir. If multiple corpus dirs are given, the first one is used.
165* The ``pulse`` lines appear periodically to show the current status.
166
167Now, interrupt the fuzzer and run it again the same way. You will see::
168
169 Seed: 1879995378
170 #0 READ cov 0 bits 0 units 564 exec/s 0
171 #1 pulse cov 502 bits 0 units 564 exec/s 0
172 ...
173 #512 pulse cov 2933 bits 0 units 564 exec/s 512
174 #564 INITED cov 2991 bits 0 units 344 exec/s 564
175 #1024 pulse cov 2991 bits 0 units 344 exec/s 1024
176 #1455 NEW cov 2995 bits 0 units 345 exec/s 1455 L: 49
177
178This time you were running the fuzzer with a non-empty input corpus (564 items).
179As the first step, the fuzzer minimized the set to produce 344 interesting items (the ``INITED`` line)
180
Kostya Serebryanyfb2f3312015-05-13 22:42:28 +0000181It is quite convenient to store test corpuses in git.
182As an example, here is a git repository with test inputs for the above PCRE2 fuzzer::
183
184 git clone https://github.com/kcc/fuzzing-with-sanitizers.git
185 ./pcre_fuzzer ./fuzzing-with-sanitizers/pcre2/C1/
186
Kostya Serebryany79677382015-03-31 21:39:38 +0000187You may run ``N`` independent fuzzer jobs in parallel on ``M`` CPUs::
188
189 N=100; M=4; ./pcre_fuzzer ./CORPUS -jobs=$N -workers=$M
190
Kostya Serebryany9690fcf2015-05-12 18:51:57 +0000191By default (``-reload=1``) the fuzzer processes will periodically scan the CORPUS directory
192and reload any new tests. This way the test inputs found by one process will be picked up
193by all others.
Kostya Serebryany79677382015-03-31 21:39:38 +0000194
Kostya Serebryany9690fcf2015-05-12 18:51:57 +0000195If ``-workers=$M`` is not supplied, ``min($N,NumberOfCpuCore/2)`` will be used.
Kostya Serebryany79677382015-03-31 21:39:38 +0000196
Kostya Serebryany5e593a42015-04-08 06:16:11 +0000197Heartbleed
198----------
199Remember Heartbleed_?
200As it was recently `shown <https://blog.hboeck.de/archives/868-How-Heartbleed-couldve-been-found.html>`_,
201fuzzing with AddressSanitizer can find Heartbleed. Indeed, here are the step-by-step instructions
202to find Heartbleed with LibFuzzer::
203
204 wget https://www.openssl.org/source/openssl-1.0.1f.tar.gz
205 tar xf openssl-1.0.1f.tar.gz
Alexey Samsonov21a33812015-05-07 23:33:24 +0000206 COV_FLAGS="-fsanitize-coverage=edge,indirect-calls" # -fsanitize-coverage=8bit-counters
Kostya Serebryany5e593a42015-04-08 06:16:11 +0000207 (cd openssl-1.0.1f/ && ./config &&
208 make -j 32 CC="clang -g -fsanitize=address $COV_FLAGS")
209 # Get and build LibFuzzer
210 svn co http://llvm.org/svn/llvm-project/llvm/trunk/lib/Fuzzer
211 clang -c -g -O2 -std=c++11 Fuzzer/*.cpp -IFuzzer
212 # Get examples of key/pem files.
213 git clone https://github.com/hannob/selftls
214 cp selftls/server* . -v
215 cat << EOF > handshake-fuzz.cc
216 #include <openssl/ssl.h>
217 #include <openssl/err.h>
218 #include <assert.h>
219 SSL_CTX *sctx;
220 int Init() {
221 SSL_library_init();
222 SSL_load_error_strings();
223 ERR_load_BIO_strings();
224 OpenSSL_add_all_algorithms();
225 assert (sctx = SSL_CTX_new(TLSv1_method()));
226 assert (SSL_CTX_use_certificate_file(sctx, "server.pem", SSL_FILETYPE_PEM));
227 assert (SSL_CTX_use_PrivateKey_file(sctx, "server.key", SSL_FILETYPE_PEM));
228 return 0;
229 }
Kostya Serebryany566bc5a2015-05-06 22:19:00 +0000230 extern "C" void LLVMFuzzerTestOneInput(unsigned char *Data, size_t Size) {
Kostya Serebryany5e593a42015-04-08 06:16:11 +0000231 static int unused = Init();
232 SSL *server = SSL_new(sctx);
233 BIO *sinbio = BIO_new(BIO_s_mem());
234 BIO *soutbio = BIO_new(BIO_s_mem());
235 SSL_set_bio(server, sinbio, soutbio);
236 SSL_set_accept_state(server);
237 BIO_write(sinbio, Data, Size);
238 SSL_do_handshake(server);
239 SSL_free(server);
240 }
241 EOF
242 # Build the fuzzer.
243 clang++ -g handshake-fuzz.cc -fsanitize=address \
244 openssl-1.0.1f/libssl.a openssl-1.0.1f/libcrypto.a Fuzzer*.o
245 # Run 20 independent fuzzer jobs.
246 ./a.out -jobs=20 -workers=20
247
248Voila::
249
250 #1048576 pulse cov 3424 bits 0 units 9 exec/s 24385
251 =================================================================
252 ==17488==ERROR: AddressSanitizer: heap-buffer-overflow on address 0x629000004748 at pc 0x00000048c979 bp 0x7fffe3e864f0 sp 0x7fffe3e85ca8
253 READ of size 60731 at 0x629000004748 thread T0
254 #0 0x48c978 in __asan_memcpy
255 #1 0x4db504 in tls1_process_heartbeat openssl-1.0.1f/ssl/t1_lib.c:2586:3
256 #2 0x580be3 in ssl3_read_bytes openssl-1.0.1f/ssl/s3_pkt.c:1092:4
257
Kostya Serebryany043ab1c2015-04-01 21:33:20 +0000258Advanced features
259=================
260
261Tokens
262------
263
264By default, the fuzzer is not aware of complexities of the input language
265and when fuzzing e.g. a C++ parser it will mostly stress the lexer.
266It is very hard for the fuzzer to come up with something like ``reinterpret_cast<int>``
267from a test corpus that doesn't have it.
268See a detailed discussion of this topic at
269http://lcamtuf.blogspot.com/2015/01/afl-fuzz-making-up-grammar-with.html.
270
271lib/Fuzzer implements a simple technique that allows to fuzz input languages with
272long tokens. All you need is to prepare a text file containing up to 253 tokens, one token per line,
273and pass it to the fuzzer as ``-tokens=TOKENS_FILE.txt``.
274Three implicit tokens are added: ``" "``, ``"\t"``, and ``"\n"``.
275The fuzzer itself will still be mutating a string of bytes
276but before passing this input to the target library it will replace every byte ``b`` with the ``b``-th token.
277If there are less than ``b`` tokens, a space will be added instead.
278
Kostya Serebryanyb17e2982015-07-31 21:48:10 +0000279Data-flow-guided fuzzing
280------------------------
281
282*EXPERIMENTAL*.
283With an additional compiler flag ``-fsanitize-coverage=trace-cmp`` (see SanitizerCoverageTraceDataFlow_)
284and extra run-time flag ``-use_traces=1`` the fuzzer will try to apply *data-flow-guided fuzzing*.
285That is, the fuzzer will record the inputs to comparison instructions, switch statements,
Kostya Serebryany7f4227d2015-08-05 18:23:01 +0000286and several libc functions (``memcmp``, ``strcmp``, ``strncmp``, etc).
Kostya Serebryanyb17e2982015-07-31 21:48:10 +0000287It will later use those recorded inputs during mutations.
288
289This mode can be combined with DataFlowSanitizer_ to achieve better sensitivity.
290
Kostya Serebryany6bd016b2015-04-10 05:44:43 +0000291AFL compatibility
292-----------------
293LibFuzzer can be used in parallel with AFL_ on the same test corpus.
294Both fuzzers expect the test corpus to reside in a directory, one file per input.
295You can run both fuzzers on the same corpus in parallel::
296
297 ./afl-fuzz -i testcase_dir -o findings_dir /path/to/program -r @@
298 ./llvm-fuzz testcase_dir findings_dir # Will write new tests to testcase_dir
299
300Periodically restart both fuzzers so that they can use each other's findings.
Kostya Serebryany79677382015-03-31 21:39:38 +0000301
Kostya Serebryanycd073d52015-04-10 06:32:29 +0000302How good is my fuzzer?
303----------------------
304
Kostya Serebryany566bc5a2015-05-06 22:19:00 +0000305Once you implement your target function ``LLVMFuzzerTestOneInput`` and fuzz it to death,
Kostya Serebryanycd073d52015-04-10 06:32:29 +0000306you will want to know whether the function or the corpus can be improved further.
307One easy to use metric is, of course, code coverage.
308You can get the coverage for your corpus like this::
309
310 ASAN_OPTIONS=coverage_pcs=1 ./fuzzer CORPUS_DIR -runs=0
311
312This will run all the tests in the CORPUS_DIR but will not generate any new tests
313and dump covered PCs to disk before exiting.
314Then you can subtract the set of covered PCs from the set of all instrumented PCs in the binary,
315see SanitizerCoverage_ for details.
316
Kostya Serebryany926b9bd2015-05-22 22:43:05 +0000317User-supplied mutators
318----------------------
319
320LibFuzzer allows to use custom (user-supplied) mutators,
321see FuzzerInterface.h_
322
Kostya Serebryany79677382015-03-31 21:39:38 +0000323Fuzzing components of LLVM
324==========================
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000325
326clang-format-fuzzer
327-------------------
328The inputs are random pieces of C++-like text.
329
330Build (make sure to use fresh clang as the host compiler)::
331
332 cmake -GNinja -DCMAKE_C_COMPILER=clang -DCMAKE_CXX_COMPILER=clang++ -DLLVM_USE_SANITIZER=Address -DLLVM_USE_SANITIZE_COVERAGE=YES -DCMAKE_BUILD_TYPE=Release /path/to/llvm
333 ninja clang-format-fuzzer
334 mkdir CORPUS_DIR
335 ./bin/clang-format-fuzzer CORPUS_DIR
336
337Optionally build other kinds of binaries (asan+Debug, msan, ubsan, etc).
338
339TODO: commit the pre-fuzzed corpus to svn (?).
340
Kostya Serebryany79677382015-03-31 21:39:38 +0000341Tracking bug: https://llvm.org/bugs/show_bug.cgi?id=23052
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000342
Kostya Serebryany79677382015-03-31 21:39:38 +0000343clang-fuzzer
344------------
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000345
Kostya Serebryany79677382015-03-31 21:39:38 +0000346The default behavior is very similar to ``clang-format-fuzzer``.
Kostya Serebryany043ab1c2015-04-01 21:33:20 +0000347Clang can also be fuzzed with Tokens_ using ``-tokens=$LLVM/lib/Fuzzer/cxx_fuzzer_tokens.txt`` option.
Kostya Serebryany79677382015-03-31 21:39:38 +0000348
349Tracking bug: https://llvm.org/bugs/show_bug.cgi?id=23057
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000350
Kostya Serebryanyfb2f3312015-05-13 22:42:28 +0000351Buildbot
352--------
353
354We have a buildbot that runs the above fuzzers for LLVM components
35524/7/365 at http://lab.llvm.org:8011/builders/sanitizer-x86_64-linux-fuzzer .
356
357Pre-fuzzed test inputs in git
358-----------------------------
359
360The buildbot occumulates large test corpuses over time.
361The corpuses are stored in git on github and can be used like this::
362
363 git clone https://github.com/kcc/fuzzing-with-sanitizers.git
364 bin/clang-format-fuzzer fuzzing-with-sanitizers/llvm/clang-format/C1
365 bin/clang-fuzzer fuzzing-with-sanitizers/llvm/clang/C1/
366 bin/clang-fuzzer fuzzing-with-sanitizers/llvm/clang/TOK1 -tokens=$LLVM/llvm/lib/Fuzzer/cxx_fuzzer_tokens.txt
367
368
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000369FAQ
370=========================
371
372Q. Why Fuzzer does not use any of the LLVM support?
373---------------------------------------------------
374
375There are two reasons.
376
377First, we want this library to be used outside of the LLVM w/o users having to
378build the rest of LLVM. This may sound unconvincing for many LLVM folks,
379but in practice the need for building the whole LLVM frightens many potential
380users -- and we want more users to use this code.
381
382Second, there is a subtle technical reason not to rely on the rest of LLVM, or
383any other large body of code (maybe not even STL). When coverage instrumentation
384is enabled, it will also instrument the LLVM support code which will blow up the
385coverage set of the process (since the fuzzer is in-process). In other words, by
386using more external dependencies we will slow down the fuzzer while the main
387reason for it to exist is extreme speed.
388
389Q. What about Windows then? The Fuzzer contains code that does not build on Windows.
390------------------------------------------------------------------------------------
391
392The sanitizer coverage support does not work on Windows either as of 01/2015.
393Once it's there, we'll need to re-implement OS-specific parts (I/O, signals).
394
395Q. When this Fuzzer is not a good solution for a problem?
396---------------------------------------------------------
397
398* If the test inputs are validated by the target library and the validator
399 asserts/crashes on invalid inputs, the in-process fuzzer is not applicable
400 (we could use fork() w/o exec, but it comes with extra overhead).
401* Bugs in the target library may accumulate w/o being detected. E.g. a memory
402 corruption that goes undetected at first and then leads to a crash while
403 testing another input. This is why it is highly recommended to run this
404 in-process fuzzer with all sanitizers to detect most bugs on the spot.
405* It is harder to protect the in-process fuzzer from excessive memory
406 consumption and infinite loops in the target library (still possible).
407* The target library should not have significant global state that is not
408 reset between the runs.
409* Many interesting target libs are not designed in a way that supports
410 the in-process fuzzer interface (e.g. require a file path instead of a
411 byte array).
412* If a single test run takes a considerable fraction of a second (or
413 more) the speed benefit from the in-process fuzzer is negligible.
414* If the target library runs persistent threads (that outlive
415 execution of one test) the fuzzing results will be unreliable.
416
417Q. So, what exactly this Fuzzer is good for?
418--------------------------------------------
419
420This Fuzzer might be a good choice for testing libraries that have relatively
421small inputs, each input takes < 1ms to run, and the library code is not expected
422to crash on invalid inputs.
423Examples: regular expression matchers, text or binary format parsers.
424
Kostya Serebryany79677382015-03-31 21:39:38 +0000425.. _pcre2: http://www.pcre.org/
426
427.. _AFL: http://lcamtuf.coredump.cx/afl/
428
Alexey Samsonov675e5392015-04-27 22:50:06 +0000429.. _SanitizerCoverage: http://clang.llvm.org/docs/SanitizerCoverage.html
Kostya Serebryanyb17e2982015-07-31 21:48:10 +0000430.. _SanitizerCoverageTraceDataFlow: http://clang.llvm.org/docs/SanitizerCoverage.html#tracing-data-flow
431.. _DataFlowSanitizer: http://clang.llvm.org/docs/DataFlowSanitizer.html
Kostya Serebryany5e593a42015-04-08 06:16:11 +0000432
433.. _Heartbleed: http://en.wikipedia.org/wiki/Heartbleed
Kostya Serebryany926b9bd2015-05-22 22:43:05 +0000434
435.. _FuzzerInterface.h: https://github.com/llvm-mirror/llvm/blob/master/lib/Fuzzer/FuzzerInterface.h