1 =======================================================
2 libFuzzer – a library for coverage-guided fuzz testing.
3 =======================================================
11 LibFuzzer is in-process, coverage-guided, evolutionary fuzzing engine.
13 LibFuzzer is linked with the library under test, and feeds fuzzed inputs to the
14 library via a specific fuzzing entrypoint (aka "target function"); the fuzzer
15 then tracks which areas of the code are reached, and generates mutations on the
16 corpus of input data in order to maximize the code coverage.
18 information for libFuzzer is provided by LLVM's SanitizerCoverage_
21 Contact: libfuzzer(#)googlegroups.com
26 LibFuzzer is under active development so you will need the current
27 (or at least a very recent) version of the Clang compiler (see `building Clang from trunk`_)
29 Refer to https://releases.llvm.org/5.0.0/docs/LibFuzzer.html for documentation on the older version.
42 The first step in using libFuzzer on a library is to implement a
43 *fuzz target* -- a function that accepts an array of bytes and
44 does something interesting with these bytes using the API under test.
50 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
51 DoSomethingInterestingWithMyAPI(Data, Size);
52 return 0; // Non-zero return values are reserved for future use.
55 Note that this fuzz target does not depend on libFuzzer in any way
56 and so it is possible and even desirable to use it with other fuzzing engines
57 e.g. AFL_ and/or Radamsa_.
59 Some important things to remember about fuzz targets:
61 * The fuzzing engine will execute the fuzz target many times with different inputs in the same process.
62 * It must tolerate any kind of input (empty, huge, malformed, etc).
63 * It must not `exit()` on any input.
64 * It may use threads but ideally all threads should be joined at the end of the function.
65 * It must be as deterministic as possible. Non-determinism (e.g. random decisions not based on the input bytes) will make fuzzing inefficient.
66 * It must be fast. Try avoiding cubic or greater complexity, logging, or excessive memory consumption.
67 * Ideally, it should not modify any global state (although that's not strict).
68 * Usually, the narrower the target the better. E.g. if your target can parse several data formats, split it into several targets, one per format.
74 Recent versions of Clang (starting from 6.0) include libFuzzer, and no extra installation is necessary.
76 In order to build your fuzzer binary, use the `-fsanitize=fuzzer` flag during the
77 compilation and linking. In most cases you may want to combine libFuzzer with
78 AddressSanitizer_ (ASAN), UndefinedBehaviorSanitizer_ (UBSAN), or both::
80 clang -g -O1 -fsanitize=fuzzer mytarget.c # Builds the fuzz target w/o sanitizers
81 clang -g -O1 -fsanitize=fuzzer,address mytarget.c # Builds the fuzz target with ASAN
82 clang -g -O1 -fsanitize=fuzzer,signed-integer-overflow mytarget.c # Builds the fuzz target with a part of UBSAN
84 This will perform the necessary instrumentation, as well as linking with the libFuzzer library.
85 Note that ``-fsanitize=fuzzer`` links in the libFuzzer's ``main()`` symbol.
87 If modifying ``CFLAGS`` of a large project, which also compiles executables
88 requiring their own ``main`` symbol, it may be desirable to request just the
89 instrumentation without linking::
91 clang -fsanitize=fuzzer-no-link mytarget.c
93 Then libFuzzer can be linked to the desired driver by passing in
94 ``-fsanitize=fuzzer`` during the linking stage.
96 Using MemorySanitizer_ (MSAN) with libFuzzer is possible too, but tricky.
97 The exact details are out of scope, we expect to simplify this in future
100 .. _libfuzzer-corpus:
105 Coverage-guided fuzzers like libFuzzer rely on a corpus of sample inputs for the
106 code under test. This corpus should ideally be seeded with a varied collection
107 of valid and invalid inputs for the code under test; for example, for a graphics
108 library the initial corpus might hold a variety of different small PNG/JPG/GIF
109 files. The fuzzer generates random mutations based around the sample inputs in
110 the current corpus. If a mutation triggers execution of a previously-uncovered
111 path in the code under test, then that mutation is saved to the corpus for
114 LibFuzzer will work without any initial seeds, but will be less
115 efficient if the library under test accepts complex,
118 The corpus can also act as a sanity/regression check, to confirm that the
119 fuzzing entrypoint still works and that all of the sample inputs run through
120 the code under test without problems.
122 If you have a large corpus (either generated by fuzzing or acquired by other means)
123 you may want to minimize it while still preserving the full coverage. One way to do that
124 is to use the `-merge=1` flag:
126 .. code-block:: console
128 mkdir NEW_CORPUS_DIR # Store minimized corpus here.
129 ./my_fuzzer -merge=1 NEW_CORPUS_DIR FULL_CORPUS_DIR
131 You may use the same flag to add more interesting items to an existing corpus.
132 Only the inputs that trigger new coverage will be added to the first corpus.
134 .. code-block:: console
136 ./my_fuzzer -merge=1 CURRENT_CORPUS_DIR NEW_POTENTIALLY_INTERESTING_INPUTS_DIR
141 To run the fuzzer, first create a Corpus_ directory that holds the
142 initial "seed" sample inputs:
144 .. code-block:: console
147 cp /some/input/samples/* CORPUS_DIR
149 Then run the fuzzer on the corpus directory:
151 .. code-block:: console
153 ./my_fuzzer CORPUS_DIR # -max_len=1000 -jobs=20 ...
155 As the fuzzer discovers new interesting test cases (i.e. test cases that
156 trigger coverage of new paths through the code under test), those test cases
157 will be added to the corpus directory.
159 By default, the fuzzing process will continue indefinitely – at least until
160 a bug is found. Any crashes or sanitizer failures will be reported as usual,
161 stopping the fuzzing process, and the particular input that triggered the bug
162 will be written to disk (typically as ``crash-<sha1>``, ``leak-<sha1>``,
163 or ``timeout-<sha1>``).
169 Each libFuzzer process is single-threaded, unless the library under test starts
170 its own threads. However, it is possible to run multiple libFuzzer processes in
171 parallel with a shared corpus directory; this has the advantage that any new
172 inputs found by one fuzzer process will be available to the other fuzzer
173 processes (unless you disable this with the ``-reload=0`` option).
175 This is primarily controlled by the ``-jobs=N`` option, which indicates that
176 that `N` fuzzing jobs should be run to completion (i.e. until a bug is found or
177 time/iteration limits are reached). These jobs will be run across a set of
178 worker processes, by default using half of the available CPU cores; the count of
179 worker processes can be overridden by the ``-workers=N`` option. For example,
180 running with ``-jobs=30`` on a 12-core machine would run 6 workers by default,
181 with each worker averaging 5 bugs by completion of the entire process.
187 Merging large corpora may be time consuming, and it is often desirable to do it
188 on preemptable VMs, where the process may be killed at any time.
189 In order to seamlessly resume the merge, use the ``-merge_control_file`` flag
190 and use ``killall -SIGUSR1 /path/to/fuzzer/binary`` to stop the merge gracefully. Example:
192 .. code-block:: console
194 % rm -f SomeLocalPath
195 % ./my_fuzzer CORPUS1 CORPUS2 -merge=1 -merge_control_file=SomeLocalPath
197 MERGE-INNER: using the control file 'SomeLocalPath'
199 # While this is running, do `killall -SIGUSR1 my_fuzzer` in another console
200 ==9015== INFO: libFuzzer: exiting as requested
202 # This will leave the file SomeLocalPath with the partial state of the merge.
203 # Now, you can continue the merge by executing the same command. The merge
204 # will continue from where it has been interrupted.
205 % ./my_fuzzer CORPUS1 CORPUS2 -merge=1 -merge_control_file=SomeLocalPath
207 MERGE-OUTER: non-empty control file provided: 'SomeLocalPath'
208 MERGE-OUTER: control file ok, 32 files total, first not processed file 20
214 To run the fuzzer, pass zero or more corpus directories as command line
215 arguments. The fuzzer will read test inputs from each of these corpus
216 directories, and any new test inputs that are generated will be written
217 back to the first corpus directory:
219 .. code-block:: console
221 ./fuzzer [-flag1=val1 [-flag2=val2 ...] ] [dir1 [dir2 ...] ]
223 If a list of files (rather than directories) are passed to the fuzzer program,
224 then it will re-run those files as test inputs but will not perform any fuzzing.
225 In this mode the fuzzer binary can be used as a regression test (e.g. on a
226 continuous integration system) to check the target function and saved inputs
229 The most important command line options are:
234 Random seed. If 0 (the default), the seed is generated.
236 Number of individual test runs, -1 (the default) to run indefinitely.
238 Maximum length of a test input. If 0 (the default), libFuzzer tries to guess
239 a good value based on the corpus (and reports it).
241 Timeout in seconds, default 1200. If an input takes longer than this timeout,
242 the process is treated as a failure case.
244 Memory usage limit in Mb, default 2048. Use 0 to disable the limit.
245 If an input requires more than this amount of RSS memory to execute,
246 the process is treated as a failure case.
247 The limit is checked in a separate thread every second.
248 If running w/o ASAN/MSAN, you may use 'ulimit -v' instead.
250 If non-zero, the fuzzer will exit if the target tries to allocate this
251 number of Mb with one malloc call.
252 If zero (default) same limit as rss_limit_mb is applied.
253 ``-timeout_exitcode``
254 Exit code (default 77) used if libFuzzer reports a timeout.
256 Exit code (default 77) used if libFuzzer itself (not a sanitizer) reports a bug (leak, OOM, etc).
258 If positive, indicates the maximum total time in seconds to run the fuzzer.
259 If 0 (the default), run indefinitely.
261 If set to 1, any corpus inputs from the 2nd, 3rd etc. corpus directories
262 that trigger new code coverage will be merged into the first corpus
263 directory. Defaults to 0. This flag can be used to minimize a corpus.
264 ``-merge_control_file``
265 Specify a control file used for the merge proccess.
266 If a merge process gets killed it tries to leave this file in a state
267 suitable for resuming the merge. By default a temporary file will be used.
269 If 1, minimizes the provided crash input.
270 Use with -runs=N or -max_total_time=N to limit the number of attempts.
272 If set to 1 (the default), the corpus directory is re-read periodically to
273 check for new inputs; this allows detection of new inputs that were discovered
274 by other fuzzing processes.
276 Number of fuzzing jobs to run to completion. Default value is 0, which runs a
277 single fuzzing process until completion. If the value is >= 1, then this
278 number of jobs performing fuzzing are run, in a collection of parallel
279 separate worker processes; each such worker process has its
280 ``stdout``/``stderr`` redirected to ``fuzz-<JOB>.log``.
282 Number of simultaneous worker processes to run the fuzzing jobs to completion
283 in. If 0 (the default), ``min(jobs, NumberOfCpuCores()/2)`` is used.
285 Provide a dictionary of input keywords; see Dictionaries_.
287 Use `coverage counters`_ to generate approximate counts of how often code
288 blocks are hit; defaults to 1.
290 Try to reduce the size of inputs while preserving their full feature sets;
292 ``-use_value_profile``
293 Use `value profile`_ to guide corpus expansion; defaults to 0.
295 If 1, generate only ASCII (``isprint``+``isspace``) inputs. Defaults to 0.
297 Provide a prefix to use when saving fuzzing artifacts (crash, timeout, or
298 slow inputs) as ``$(artifact_prefix)file``. Defaults to empty.
299 ``-exact_artifact_path``
300 Ignored if empty (the default). If non-empty, write the single artifact on
301 failure (crash, timeout) as ``$(exact_artifact_path)``. This overrides
302 ``-artifact_prefix`` and will not use checksum in the file name. Do not use
303 the same path for several parallel processes.
305 If 1, print out newly covered PCs. Defaults to 0.
306 ``-print_final_stats``
307 If 1, print statistics at exit. Defaults to 0.
309 If 1 (default) and if LeakSanitizer is enabled
310 try to detect memory leaks during fuzzing (i.e. not only at shut down).
312 Indicate output streams to close at startup. Be careful, this will
313 remove diagnostic output from target code (e.g. messages on assert failure).
315 - 0 (default): close neither ``stdout`` nor ``stderr``
316 - 1 : close ``stdout``
317 - 2 : close ``stderr``
318 - 3 : close both ``stdout`` and ``stderr``.
320 For the full list of flags run the fuzzer binary with ``-help=1``.
325 During operation the fuzzer prints information to ``stderr``, for example::
327 INFO: Seed: 1523017872
328 INFO: Loaded 1 modules (16 guards): [0x744e60, 0x744ea0),
329 INFO: -max_len is not provided, using 64
330 INFO: A corpus is not provided, starting from an empty corpus
332 #1 INITED cov: 3 ft: 2 corp: 1/1b exec/s: 0 rss: 24Mb
333 #3811 NEW cov: 4 ft: 3 corp: 2/2b exec/s: 0 rss: 25Mb L: 1 MS: 5 ChangeBit-ChangeByte-ChangeBit-ShuffleBytes-ChangeByte-
334 #3827 NEW cov: 5 ft: 4 corp: 3/4b exec/s: 0 rss: 25Mb L: 2 MS: 1 CopyPart-
335 #3963 NEW cov: 6 ft: 5 corp: 4/6b exec/s: 0 rss: 25Mb L: 2 MS: 2 ShuffleBytes-ChangeBit-
336 #4167 NEW cov: 7 ft: 6 corp: 5/9b exec/s: 0 rss: 25Mb L: 3 MS: 1 InsertByte-
339 The early parts of the output include information about the fuzzer options and
340 configuration, including the current random seed (in the ``Seed:`` line; this
341 can be overridden with the ``-seed=N`` flag).
343 Further output lines have the form of an event code and statistics. The
344 possible event codes are:
347 The fuzzer has read in all of the provided input samples from the corpus
350 The fuzzer has completed initialization, which includes running each of
351 the initial input samples through the code under test.
353 The fuzzer has created a test input that covers new areas of the code
354 under test. This input will be saved to the primary corpus directory.
356 The fuzzer has found a better (smaller) input that triggers previously
357 discovered features (set ``-reduce_inputs=0`` to disable).
359 The fuzzer has generated 2\ :sup:`n` inputs (generated periodically to reassure
360 the user that the fuzzer is still working).
362 The fuzzer has completed operation because it has reached the specified
363 iteration limit (``-runs``) or time limit (``-max_total_time``).
365 The fuzzer is performing a periodic reload of inputs from the corpus
366 directory; this allows it to discover any inputs discovered by other
367 fuzzer processes (see `Parallel Fuzzing`_).
369 Each output line also reports the following statistics (when non-zero):
372 Total number of code blocks or edges covered by executing the current corpus.
374 libFuzzer uses different signals to evaluate the code coverage:
375 edge coverage, edge counters, value profiles, indirect caller/callee pairs, etc.
376 These signals combined are called *features* (`ft:`).
378 Number of entries in the current in-memory test corpus and its size in bytes.
380 Current limit on the length of new entries in the corpus. Increases over time
381 until the max length (``-max_len``) is reached.
383 Number of fuzzer iterations per second.
385 Current memory consumption.
387 For ``NEW`` events, the output line also includes information about the mutation
388 operation that produced the new input:
391 Size of the new input in bytes.
392 ``MS: <n> <operations>``
393 Count and list of the mutation operations used to generate the input.
405 A simple function that does something interesting if it receives the input
408 cat << EOF > test_fuzzer.cc
411 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
412 if (size > 0 && data[0] == 'H')
413 if (size > 1 && data[1] == 'I')
414 if (size > 2 && data[2] == '!')
419 # Build test_fuzzer.cc with asan and link against libFuzzer.a
420 clang++ -fsanitize=address -fsanitize-coverage=trace-pc-guard test_fuzzer.cc libFuzzer.a
421 # Run the fuzzer with no corpus.
424 You should get an error pretty quickly::
426 INFO: Seed: 1523017872
427 INFO: Loaded 1 modules (16 guards): [0x744e60, 0x744ea0),
428 INFO: -max_len is not provided, using 64
429 INFO: A corpus is not provided, starting from an empty corpus
431 #1 INITED cov: 3 ft: 2 corp: 1/1b exec/s: 0 rss: 24Mb
432 #3811 NEW cov: 4 ft: 3 corp: 2/2b exec/s: 0 rss: 25Mb L: 1 MS: 5 ChangeBit-ChangeByte-ChangeBit-ShuffleBytes-ChangeByte-
433 #3827 NEW cov: 5 ft: 4 corp: 3/4b exec/s: 0 rss: 25Mb L: 2 MS: 1 CopyPart-
434 #3963 NEW cov: 6 ft: 5 corp: 4/6b exec/s: 0 rss: 25Mb L: 2 MS: 2 ShuffleBytes-ChangeBit-
435 #4167 NEW cov: 7 ft: 6 corp: 5/9b exec/s: 0 rss: 25Mb L: 3 MS: 1 InsertByte-
436 ==31511== ERROR: libFuzzer: deadly signal
438 artifact_prefix='./'; Test unit written to ./crash-b13e8756b13a00cf168300179061fb4b91fefbed
444 Examples of real-life fuzz targets and the bugs they find can be found
445 at http://tutorial.libfuzzer.info. Among other things you can learn how
446 to detect Heartbleed_ in one second.
457 LibFuzzer supports user-supplied dictionaries with input language keywords
458 or other interesting byte sequences (e.g. multi-byte magic values).
459 Use ``-dict=DICTIONARY_FILE``. For some input languages using a dictionary
460 may significantly improve the search speed.
461 The dictionary syntax is similar to that used by AFL_ for its ``-x`` option::
463 # Lines starting with '#' and empty lines are ignored.
465 # Adds "blah" (w/o quotes) to the dictionary.
467 # Use \\ for backslash and \" for quotes.
469 # Use \xAB for hex values
471 # the name of the keyword followed by '=' may be omitted:
476 Tracing CMP instructions
477 ------------------------
479 With an additional compiler flag ``-fsanitize-coverage=trace-cmp``
480 (on by default as part of ``-fsanitize=fuzzer``, see SanitizerCoverageTraceDataFlow_)
481 libFuzzer will intercept CMP instructions and guide mutations based
482 on the arguments of intercepted CMP instructions. This may slow down
483 the fuzzing but is very likely to improve the results.
488 With ``-fsanitize-coverage=trace-cmp``
489 and extra run-time flag ``-use_value_profile=1`` the fuzzer will
490 collect value profiles for the parameters of compare instructions
491 and treat some new values as new coverage.
493 The current imlpementation does roughly the following:
495 * The compiler instruments all CMP instructions with a callback that receives both CMP arguments.
496 * The callback computes `(caller_pc&4095) | (popcnt(Arg1 ^ Arg2) << 12)` and uses this value to set a bit in a bitset.
497 * Every new observed bit in the bitset is treated as new coverage.
500 This feature has a potential to discover many interesting inputs,
501 but there are two downsides.
502 First, the extra instrumentation may bring up to 2x additional slowdown.
503 Second, the corpus may grow by several times.
505 Fuzzer-friendly build mode
506 ---------------------------
507 Sometimes the code under test is not fuzzing-friendly. Examples:
509 - The target code uses a PRNG seeded e.g. by system time and
510 thus two consequent invocations may potentially execute different code paths
511 even if the end result will be the same. This will cause a fuzzer to treat
512 two similar inputs as significantly different and it will blow up the test corpus.
513 E.g. libxml uses ``rand()`` inside its hash table.
514 - The target code uses checksums to protect from invalid inputs.
515 E.g. png checks CRC for every chunk.
517 In many cases it makes sense to build a special fuzzing-friendly build
518 with certain fuzzing-unfriendly features disabled. We propose to use a common build macro
519 for all such cases for consistency: ``FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION``.
524 #ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
525 // In fuzzing mode the behavior of the code should be deterministic.
536 LibFuzzer can be used together with AFL_ on the same test corpus.
537 Both fuzzers expect the test corpus to reside in a directory, one file per input.
538 You can run both fuzzers on the same corpus, one after another:
540 .. code-block:: console
542 ./afl-fuzz -i testcase_dir -o findings_dir /path/to/program @@
543 ./llvm-fuzz testcase_dir findings_dir # Will write new tests to testcase_dir
545 Periodically restart both fuzzers so that they can use each other's findings.
546 Currently, there is no simple way to run both fuzzing engines in parallel while sharing the same corpus dir.
548 You may also use AFL on your target function ``LLVMFuzzerTestOneInput``:
549 see an example `here <https://github.com/llvm-mirror/compiler-rt/tree/master/lib/fuzzer/afl>`__.
551 How good is my fuzzer?
552 ----------------------
554 Once you implement your target function ``LLVMFuzzerTestOneInput`` and fuzz it to death,
555 you will want to know whether the function or the corpus can be improved further.
556 One easy to use metric is, of course, code coverage.
559 `Clang Coverage <http://clang.llvm.org/docs/SourceBasedCodeCoverage.html>`_,
560 to visualize and study your code coverage
561 (`example <https://github.com/google/fuzzer-test-suite/blob/master/tutorial/libFuzzerTutorial.md#visualizing-coverage>`_).
564 User-supplied mutators
565 ----------------------
567 LibFuzzer allows to use custom (user-supplied) mutators,
568 see FuzzerInterface.h_
570 Startup initialization
571 ----------------------
572 If the library being tested needs to be initialized, there are several options.
574 The simplest way is to have a statically initialized global object inside
575 `LLVMFuzzerTestOneInput` (or in global scope if that works for you):
579 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
580 static bool Initialized = DoInitialization();
583 Alternatively, you may define an optional init function and it will receive
584 the program arguments that you can read and modify. Do this **only** if you
585 really need to access ``argv``/``argc``.
589 extern "C" int LLVMFuzzerInitialize(int *argc, char ***argv) {
590 ReadAndMaybeModify(argc, argv);
598 Binaries built with AddressSanitizer_ or LeakSanitizer_ will try to detect
599 memory leaks at the process shutdown.
600 For in-process fuzzing this is inconvenient
601 since the fuzzer needs to report a leak with a reproducer as soon as the leaky
602 mutation is found. However, running full leak detection after every mutation
605 By default (``-detect_leaks=1``) libFuzzer will count the number of
606 ``malloc`` and ``free`` calls when executing every mutation.
607 If the numbers don't match (which by itself doesn't mean there is a leak)
608 libFuzzer will invoke the more expensive LeakSanitizer_
609 pass and if the actual leak is found, it will be reported with the reproducer
610 and the process will exit.
612 If your target has massive leaks and the leak detection is disabled
613 you will eventually run out of RAM (see the ``-rss_limit_mb`` flag).
619 LibFuzzer is built as a part of LLVM project by default on macos and Linux.
620 Users of other operating systems can explicitly request compilation using
621 ``-DLIBFUZZER_ENABLE=YES`` flag.
622 Tests are run using ``check-fuzzer`` target from the build directory
623 which was configured with ``-DLIBFUZZER_ENABLE_TESTS=ON`` flag.
625 .. code-block:: console
631 =========================
633 Q. Why doesn't libFuzzer use any of the LLVM support?
634 -----------------------------------------------------
636 There are two reasons.
638 First, we want this library to be used outside of the LLVM without users having to
639 build the rest of LLVM. This may sound unconvincing for many LLVM folks,
640 but in practice the need for building the whole LLVM frightens many potential
641 users -- and we want more users to use this code.
643 Second, there is a subtle technical reason not to rely on the rest of LLVM, or
644 any other large body of code (maybe not even STL). When coverage instrumentation
645 is enabled, it will also instrument the LLVM support code which will blow up the
646 coverage set of the process (since the fuzzer is in-process). In other words, by
647 using more external dependencies we will slow down the fuzzer while the main
648 reason for it to exist is extreme speed.
650 Q. What about Windows then? The fuzzer contains code that does not build on Windows.
651 ------------------------------------------------------------------------------------
653 Volunteers are welcome.
655 Q. When libFuzzer is not a good solution for a problem?
656 ---------------------------------------------------------
658 * If the test inputs are validated by the target library and the validator
659 asserts/crashes on invalid inputs, in-process fuzzing is not applicable.
660 * Bugs in the target library may accumulate without being detected. E.g. a memory
661 corruption that goes undetected at first and then leads to a crash while
662 testing another input. This is why it is highly recommended to run this
663 in-process fuzzer with all sanitizers to detect most bugs on the spot.
664 * It is harder to protect the in-process fuzzer from excessive memory
665 consumption and infinite loops in the target library (still possible).
666 * The target library should not have significant global state that is not
667 reset between the runs.
668 * Many interesting target libraries are not designed in a way that supports
669 the in-process fuzzer interface (e.g. require a file path instead of a
671 * If a single test run takes a considerable fraction of a second (or
672 more) the speed benefit from the in-process fuzzer is negligible.
673 * If the target library runs persistent threads (that outlive
674 execution of one test) the fuzzing results will be unreliable.
676 Q. So, what exactly this Fuzzer is good for?
677 --------------------------------------------
679 This Fuzzer might be a good choice for testing libraries that have relatively
680 small inputs, each input takes < 10ms to run, and the library code is not expected
681 to crash on invalid inputs.
682 Examples: regular expression matchers, text or binary format parsers, compression,
688 * Thousands of bugs found on OSS-Fuzz: https://opensource.googleblog.com/2017/05/oss-fuzz-five-months-later-and.html
690 * GLIBC: https://sourceware.org/glibc/wiki/FuzzingLibc
692 * MUSL LIBC: `[1] <http://git.musl-libc.org/cgit/musl/commit/?id=39dfd58417ef642307d90306e1c7e50aaec5a35c>`__ `[2] <http://www.openwall.com/lists/oss-security/2015/03/30/3>`__
694 * `pugixml <https://github.com/zeux/pugixml/issues/39>`_
696 * PCRE: Search for "LLVM fuzzer" in http://vcs.pcre.org/pcre2/code/trunk/ChangeLog?view=markup;
697 also in `bugzilla <https://bugs.exim.org/buglist.cgi?bug_status=__all__&content=libfuzzer&no_redirect=1&order=Importance&product=PCRE&query_format=specific>`_
699 * `ICU <http://bugs.icu-project.org/trac/ticket/11838>`_
701 * `Freetype <https://savannah.nongnu.org/search/?words=LibFuzzer&type_of_search=bugs&Search=Search&exact=1#options>`_
703 * `Harfbuzz <https://github.com/behdad/harfbuzz/issues/139>`_
705 * `SQLite <http://www3.sqlite.org/cgi/src/info/088009efdd56160b>`_
707 * `Python <http://bugs.python.org/issue25388>`_
709 * OpenSSL/BoringSSL: `[1] <https://boringssl.googlesource.com/boringssl/+/cb852981cd61733a7a1ae4fd8755b7ff950e857d>`_ `[2] <https://openssl.org/news/secadv/20160301.txt>`_ `[3] <https://boringssl.googlesource.com/boringssl/+/2b07fa4b22198ac02e0cee8f37f3337c3dba91bc>`_ `[4] <https://boringssl.googlesource.com/boringssl/+/6b6e0b20893e2be0e68af605a60ffa2cbb0ffa64>`_ `[5] <https://github.com/openssl/openssl/pull/931/commits/dd5ac557f052cc2b7f718ac44a8cb7ac6f77dca8>`_ `[6] <https://github.com/openssl/openssl/pull/931/commits/19b5b9194071d1d84e38ac9a952e715afbc85a81>`_
712 <https://bugzilla.gnome.org/buglist.cgi?bug_status=__all__&content=libFuzzer&list_id=68957&order=Importance&product=libxml2&query_format=specific>`_ and `[HT206167] <https://support.apple.com/en-gb/HT206167>`_ (CVE-2015-5312, CVE-2015-7500, CVE-2015-7942)
714 * `Linux Kernel's BPF verifier <https://github.com/iovisor/bpf-fuzzer>`_
716 * `Linux Kernel's Crypto code <https://www.spinics.net/lists/stable/msg199712.html>`_
718 * Capstone: `[1] <https://github.com/aquynh/capstone/issues/600>`__ `[2] <https://github.com/aquynh/capstone/commit/6b88d1d51eadf7175a8f8a11b690684443b11359>`__
720 * file:`[1] <http://bugs.gw.com/view.php?id=550>`__ `[2] <http://bugs.gw.com/view.php?id=551>`__ `[3] <http://bugs.gw.com/view.php?id=553>`__ `[4] <http://bugs.gw.com/view.php?id=554>`__
722 * Radare2: `[1] <https://github.com/revskills?tab=contributions&from=2016-04-09>`__
724 * gRPC: `[1] <https://github.com/grpc/grpc/pull/6071/commits/df04c1f7f6aec6e95722ec0b023a6b29b6ea871c>`__ `[2] <https://github.com/grpc/grpc/pull/6071/commits/22a3dfd95468daa0db7245a4e8e6679a52847579>`__ `[3] <https://github.com/grpc/grpc/pull/6071/commits/9cac2a12d9e181d130841092e9d40fa3309d7aa7>`__ `[4] <https://github.com/grpc/grpc/pull/6012/commits/82a91c91d01ce9b999c8821ed13515883468e203>`__ `[5] <https://github.com/grpc/grpc/pull/6202/commits/2e3e0039b30edaf89fb93bfb2c1d0909098519fa>`__ `[6] <https://github.com/grpc/grpc/pull/6106/files>`__
726 * WOFF2: `[1] <https://github.com/google/woff2/commit/a15a8ab>`__
728 * LLVM: `Clang <https://llvm.org/bugs/show_bug.cgi?id=23057>`_, `Clang-format <https://llvm.org/bugs/show_bug.cgi?id=23052>`_, `libc++ <https://llvm.org/bugs/show_bug.cgi?id=24411>`_, `llvm-as <https://llvm.org/bugs/show_bug.cgi?id=24639>`_, `Demangler <https://bugs.chromium.org/p/chromium/issues/detail?id=606626>`_, Disassembler: http://reviews.llvm.org/rL247405, http://reviews.llvm.org/rL247414, http://reviews.llvm.org/rL247416, http://reviews.llvm.org/rL247417, http://reviews.llvm.org/rL247420, http://reviews.llvm.org/rL247422.
730 * Tensorflow: `[1] <https://da-data.blogspot.com/2017/01/finding-bugs-in-tensorflow-with.html>`__
732 * Ffmpeg: `[1] <https://github.com/FFmpeg/FFmpeg/commit/c92f55847a3d9cd12db60bfcd0831ff7f089c37c>`__ `[2] <https://github.com/FFmpeg/FFmpeg/commit/25ab1a65f3acb5ec67b53fb7a2463a7368f1ad16>`__ `[3] <https://github.com/FFmpeg/FFmpeg/commit/85d23e5cbc9ad6835eef870a5b4247de78febe56>`__ `[4] <https://github.com/FFmpeg/FFmpeg/commit/04bd1b38ee6b8df410d0ab8d4949546b6c4af26a>`__
734 * `Wireshark <https://bugs.wireshark.org/bugzilla/buglist.cgi?bug_status=UNCONFIRMED&bug_status=CONFIRMED&bug_status=IN_PROGRESS&bug_status=INCOMPLETE&bug_status=RESOLVED&bug_status=VERIFIED&f0=OP&f1=OP&f2=product&f3=component&f4=alias&f5=short_desc&f7=content&f8=CP&f9=CP&j1=OR&o2=substring&o3=substring&o4=substring&o5=substring&o6=substring&o7=matches&order=bug_id%20DESC&query_format=advanced&v2=libfuzzer&v3=libfuzzer&v4=libfuzzer&v5=libfuzzer&v6=libfuzzer&v7=%22libfuzzer%22>`_
736 * `QEMU <https://researchcenter.paloaltonetworks.com/2017/09/unit42-palo-alto-networks-discovers-new-qemu-vulnerability/>`_
738 .. _pcre2: http://www.pcre.org/
739 .. _AFL: http://lcamtuf.coredump.cx/afl/
740 .. _Radamsa: https://github.com/aoh/radamsa
741 .. _SanitizerCoverage: http://clang.llvm.org/docs/SanitizerCoverage.html
742 .. _SanitizerCoverageTraceDataFlow: http://clang.llvm.org/docs/SanitizerCoverage.html#tracing-data-flow
743 .. _AddressSanitizer: http://clang.llvm.org/docs/AddressSanitizer.html
744 .. _LeakSanitizer: http://clang.llvm.org/docs/LeakSanitizer.html
745 .. _Heartbleed: http://en.wikipedia.org/wiki/Heartbleed
746 .. _FuzzerInterface.h: https://github.com/llvm-mirror/compiler-rt/blob/master/lib/fuzzer/FuzzerInterface.h
747 .. _3.7.0: http://llvm.org/releases/3.7.0/docs/LibFuzzer.html
748 .. _building Clang from trunk: http://clang.llvm.org/get_started.html
749 .. _MemorySanitizer: http://clang.llvm.org/docs/MemorySanitizer.html
750 .. _UndefinedBehaviorSanitizer: http://clang.llvm.org/docs/UndefinedBehaviorSanitizer.html
751 .. _`coverage counters`: http://clang.llvm.org/docs/SanitizerCoverage.html#coverage-counters
752 .. _`value profile`: #value-profile
753 .. _`caller-callee pairs`: http://clang.llvm.org/docs/SanitizerCoverage.html#caller-callee-coverage
754 .. _BoringSSL: https://boringssl.googlesource.com/boringssl/