blob: a496af26630e4bdecc8f1d8d3df5bb230ab76860 [file] [log] [blame]
Kostya Serebryany7456af52016-04-28 15:19:05 +00001=======================================================
2libFuzzer a library for coverage-guided fuzz testing.
3=======================================================
Kostya Serebryany79677382015-03-31 21:39:38 +00004.. contents::
5 :local:
Kostya Serebryanyd11dc172016-03-12 02:56:25 +00006 :depth: 1
Kostya Serebryany79677382015-03-31 21:39:38 +00007
8Introduction
9============
Kostya Serebryany35ce8632015-03-30 23:05:30 +000010
Kostya Serebryany8b6af7a2016-10-26 01:55:17 +000011LibFuzzer is in-process, coverage-guided, evolutionary fuzzing engine.
Kostya Serebryany35ce8632015-03-30 23:05:30 +000012
Kostya Serebryany8b6af7a2016-10-26 01:55:17 +000013LibFuzzer is linked with the library under test, and feeds fuzzed inputs to the
Kostya Serebryany7456af52016-04-28 15:19:05 +000014library via a specific fuzzing entrypoint (aka "target function"); the fuzzer
15then tracks which areas of the code are reached, and generates mutations on the
Kostya Serebryany8b6af7a2016-10-26 01:55:17 +000016corpus of input data in order to maximize the code coverage.
17The code coverage
Kostya Serebryany7456af52016-04-28 15:19:05 +000018information for libFuzzer is provided by LLVM's SanitizerCoverage_
19instrumentation.
Kostya Serebryany35ce8632015-03-30 23:05:30 +000020
Kostya Serebryany9ded49e2016-06-02 05:45:42 +000021Contact: libfuzzer(#)googlegroups.com
Kostya Serebryany35ce8632015-03-30 23:05:30 +000022
Kostya Serebryany7456af52016-04-28 15:19:05 +000023Versions
24========
Kostya Serebryanyd11dc172016-03-12 02:56:25 +000025
Kostya Serebryany8b6af7a2016-10-26 01:55:17 +000026LibFuzzer is under active development so you will need the current
27(or at least a very recent) version of the Clang compiler.
Kostya Serebryany35ce8632015-03-30 23:05:30 +000028
Kostya Serebryany7456af52016-04-28 15:19:05 +000029(If `building Clang from trunk`_ is too time-consuming or difficult, then
30the Clang binaries that the Chromium developers build are likely to be
31fairly recent:
Kostya Serebryany35ce8632015-03-30 23:05:30 +000032
Kostya Serebryany7456af52016-04-28 15:19:05 +000033.. code-block:: console
Kostya Serebryany9e1a2382016-03-29 23:07:36 +000034
35 mkdir TMP_CLANG
36 cd TMP_CLANG
37 git clone https://chromium.googlesource.com/chromium/src/tools/clang
38 cd ..
39 TMP_CLANG/clang/scripts/update.py
40
Kostya Serebryany7456af52016-04-28 15:19:05 +000041This installs the Clang binary as
42``./third_party/llvm-build/Release+Asserts/bin/clang``)
Kostya Serebryany9e1a2382016-03-29 23:07:36 +000043
Kostya Serebryany7456af52016-04-28 15:19:05 +000044The libFuzzer code resides in the LLVM repository, and requires a recent Clang
45compiler to build (and is used to `fuzz various parts of LLVM itself`_).
46However the fuzzer itself does not (and should not) depend on any part of LLVM
47infrastructure and can be used for other projects without requiring the rest
48of LLVM.
Kostya Serebryanybfbe7fc2016-02-02 03:03:47 +000049
Kostya Serebryanybfbe7fc2016-02-02 03:03:47 +000050
Kostya Serebryany7456af52016-04-28 15:19:05 +000051Getting Started
52===============
53
54.. contents::
55 :local:
56 :depth: 1
57
Kostya Serebryanycbefff72016-10-27 20:45:35 +000058Fuzz Target
59-----------
Kostya Serebryany7456af52016-04-28 15:19:05 +000060
Kostya Serebryanycbefff72016-10-27 20:45:35 +000061The first step in using libFuzzer on a library is to implement a
62*fuzz target* -- a function that accepts an array of bytes and
63does something interesting with these bytes using the API under test.
64Like this:
Kostya Serebryany7456af52016-04-28 15:19:05 +000065
66.. code-block:: c++
67
68 // fuzz_target.cc
69 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
70 DoSomethingInterestingWithMyAPI(Data, Size);
71 return 0; // Non-zero return values are reserved for future use.
72 }
73
Kostya Serebryanycbefff72016-10-27 20:45:35 +000074Note that this fuzz target does not depend on libFuzzer in any way
Kostya Serebryanyb5064662016-11-08 21:57:37 +000075and so it is possible and even desirable to use it with other fuzzing engines
Kostya Serebryanycbefff72016-10-27 20:45:35 +000076e.g. AFL_ and/or Radamsa_.
77
78Some important things to remember about fuzz targets:
79
80* The fuzzing engine will execute the fuzz target many times with different inputs in the same process.
81* It must tolerate any kind of input (empty, huge, malformed, etc).
82* It must not `exit()` on any input.
Kostya Serebryany82ff4e72016-10-28 16:55:29 +000083* It may use threads but ideally all threads should be joined at the end of the function.
Kostya Serebryanyb5064662016-11-08 21:57:37 +000084* It must be as deterministic as possible. Non-determinism (e.g. random decisions not based on the input bytes) will make fuzzing inefficient.
85* It must be fast. Try avoiding cubic or greater complexity, logging, or excessive memory consumption.
Kostya Serebryanycbefff72016-10-27 20:45:35 +000086* Ideally, it should not modify any global state (although that's not strict).
87
88
89Building
90--------
91
Kostya Serebryany7456af52016-04-28 15:19:05 +000092Next, build the libFuzzer library as a static archive, without any sanitizer
93options. Note that the libFuzzer library contains the ``main()`` function:
94
95.. code-block:: console
96
Kostya Serebryanyc1708b02016-10-27 21:03:48 +000097 svn co http://llvm.org/svn/llvm-project/llvm/trunk/lib/Fuzzer # or git clone https://chromium.googlesource.com/chromium/llvm-project/llvm/lib/Fuzzer
Kostya Serebryany8b6af7a2016-10-26 01:55:17 +000098 ./Fuzzer/build.sh # Produces libFuzzer.a
Kostya Serebryany7456af52016-04-28 15:19:05 +000099
100Then build the fuzzing target function and the library under test using
101the SanitizerCoverage_ option, which instruments the code so that the fuzzer
102can retrieve code coverage information (to guide the fuzzing). Linking with
Kostya Serebryany8b6af7a2016-10-26 01:55:17 +0000103the libFuzzer code then gives a fuzzer executable.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000104
105You should also enable one or more of the *sanitizers*, which help to expose
106latent bugs by making incorrect behavior generate errors at runtime:
107
Kostya Serebryanyca9694b2016-05-09 21:02:36 +0000108 - AddressSanitizer_ (ASAN) detects memory access errors. Use `-fsanitize=address`.
109 - UndefinedBehaviorSanitizer_ (UBSAN) detects the use of various features of C/C++ that are explicitly
110 listed as resulting in undefined behavior. Use `-fsanitize=undefined -fno-sanitize-recover=undefined`
111 or any individual UBSAN check, e.g. `-fsanitize=signed-integer-overflow -fno-sanitize-recover=undefined`.
112 You may combine ASAN and UBSAN in one build.
113 - MemorySanitizer_ (MSAN) detects uninitialized reads: code whose behavior relies on memory
114 contents that have not been initialized to a specific value. Use `-fsanitize=memory`.
115 MSAN can not be combined with other sanirizers and should be used as a seprate build.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000116
117Finally, link with ``libFuzzer.a``::
118
Kostya Serebryanyc1708b02016-10-27 21:03:48 +0000119 clang -fsanitize-coverage=trace-pc-guard -fsanitize=address your_lib.cc fuzz_target.cc libFuzzer.a -o my_fuzzer
Kostya Serebryany7456af52016-04-28 15:19:05 +0000120
Kostya Serebryanyabfac462016-05-09 19:29:53 +0000121Corpus
Kostya Serebryanya2dfae12016-05-09 19:32:10 +0000122------
Kostya Serebryanyabfac462016-05-09 19:29:53 +0000123
124Coverage-guided fuzzers like libFuzzer rely on a corpus of sample inputs for the
125code under test. This corpus should ideally be seeded with a varied collection
126of valid and invalid inputs for the code under test; for example, for a graphics
127library the initial corpus might hold a variety of different small PNG/JPG/GIF
128files. The fuzzer generates random mutations based around the sample inputs in
129the current corpus. If a mutation triggers execution of a previously-uncovered
130path in the code under test, then that mutation is saved to the corpus for
131future variations.
132
133LibFuzzer will work without any initial seeds, but will be less
134efficient if the library under test accepts complex,
135structured inputs.
136
137The corpus can also act as a sanity/regression check, to confirm that the
138fuzzing entrypoint still works and that all of the sample inputs run through
139the code under test without problems.
140
141If you have a large corpus (either generated by fuzzing or acquired by other means)
142you may want to minimize it while still preserving the full coverage. One way to do that
143is to use the `-merge=1` flag:
144
145.. code-block:: console
146
147 mkdir NEW_CORPUS_DIR # Store minimized corpus here.
148 ./my_fuzzer -merge=1 NEW_CORPUS_DIR FULL_CORPUS_DIR
149
150You may use the same flag to add more interesting items to an existing corpus.
151Only the inputs that trigger new coverage will be added to the first corpus.
152
153.. code-block:: console
154
155 ./my_fuzzer -merge=1 CURRENT_CORPUS_DIR NEW_POTENTIALLY_INTERESTING_INPUTS_DIR
156
157
Kostya Serebryany7456af52016-04-28 15:19:05 +0000158Running
159-------
160
161To run the fuzzer, first create a Corpus_ directory that holds the
162initial "seed" sample inputs:
163
164.. code-block:: console
165
166 mkdir CORPUS_DIR
167 cp /some/input/samples/* CORPUS_DIR
168
169Then run the fuzzer on the corpus directory:
170
171.. code-block:: console
172
173 ./my_fuzzer CORPUS_DIR # -max_len=1000 -jobs=20 ...
174
175As the fuzzer discovers new interesting test cases (i.e. test cases that
176trigger coverage of new paths through the code under test), those test cases
177will be added to the corpus directory.
178
179By default, the fuzzing process will continue indefinitely – at least until
180a bug is found. Any crashes or sanitizer failures will be reported as usual,
181stopping the fuzzing process, and the particular input that triggered the bug
Kostya Serebryany2fe93042016-04-29 18:49:55 +0000182will be written to disk (typically as ``crash-<sha1>``, ``leak-<sha1>``,
183or ``timeout-<sha1>``).
Kostya Serebryany7456af52016-04-28 15:19:05 +0000184
185
186Parallel Fuzzing
187----------------
188
189Each libFuzzer process is single-threaded, unless the library under test starts
190its own threads. However, it is possible to run multiple libFuzzer processes in
191parallel with a shared corpus directory; this has the advantage that any new
192inputs found by one fuzzer process will be available to the other fuzzer
193processes (unless you disable this with the ``-reload=0`` option).
194
195This is primarily controlled by the ``-jobs=N`` option, which indicates that
196that `N` fuzzing jobs should be run to completion (i.e. until a bug is found or
197time/iteration limits are reached). These jobs will be run across a set of
198worker processes, by default using half of the available CPU cores; the count of
199worker processes can be overridden by the ``-workers=N`` option. For example,
200running with ``-jobs=30`` on a 12-core machine would run 6 workers by default,
201with each worker averaging 5 bugs by completion of the entire process.
202
203
204Options
205=======
206
207To run the fuzzer, pass zero or more corpus directories as command line
208arguments. The fuzzer will read test inputs from each of these corpus
209directories, and any new test inputs that are generated will be written
210back to the first corpus directory:
211
212.. code-block:: console
213
214 ./fuzzer [-flag1=val1 [-flag2=val2 ...] ] [dir1 [dir2 ...] ]
215
216If a list of files (rather than directories) are passed to the fuzzer program,
217then it will re-run those files as test inputs but will not perform any fuzzing.
218In this mode the fuzzer binary can be used as a regression test (e.g. on a
219continuous integration system) to check the target function and saved inputs
220still work.
221
222The most important command line options are:
223
224``-help``
225 Print help message.
226``-seed``
227 Random seed. If 0 (the default), the seed is generated.
228``-runs``
229 Number of individual test runs, -1 (the default) to run indefinitely.
230``-max_len``
231 Maximum length of a test input. If 0 (the default), libFuzzer tries to guess
232 a good value based on the corpus (and reports it).
233``-timeout``
234 Timeout in seconds, default 1200. If an input takes longer than this timeout,
235 the process is treated as a failure case.
Kostya Serebryany8b8f7a32016-05-06 23:38:07 +0000236``-rss_limit_mb``
237 Memory usage limit in Mb, default 2048. Use 0 to disable the limit.
238 If an input requires more than this amount of RSS memory to execute,
239 the process is treated as a failure case.
240 The limit is checked in a separate thread every second.
241 If running w/o ASAN/MSAN, you may use 'ulimit -v' instead.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000242``-timeout_exitcode``
Kostya Serebryany8a569172016-11-03 19:31:18 +0000243 Exit code (default 77) used if libFuzzer reports a timeout.
244``-error_exitcode``
245 Exit code (default 77) used if libFuzzer itself (not a sanitizer) reports a bug (leak, OOM, etc).
Kostya Serebryany7456af52016-04-28 15:19:05 +0000246``-max_total_time``
247 If positive, indicates the maximum total time in seconds to run the fuzzer.
248 If 0 (the default), run indefinitely.
249``-merge``
250 If set to 1, any corpus inputs from the 2nd, 3rd etc. corpus directories
251 that trigger new code coverage will be merged into the first corpus
Kostya Serebryany61b07ac2016-05-09 19:11:36 +0000252 directory. Defaults to 0. This flag can be used to minimize a corpus.
Kostya Serebryanydec39492016-09-08 22:21:13 +0000253``-minimize_crash``
254 If 1, minimizes the provided crash input.
Kostya Serebryany5c04bd22016-09-09 01:17:03 +0000255 Use with -runs=N or -max_total_time=N to limit the number of attempts.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000256``-reload``
257 If set to 1 (the default), the corpus directory is re-read periodically to
258 check for new inputs; this allows detection of new inputs that were discovered
259 by other fuzzing processes.
260``-jobs``
261 Number of fuzzing jobs to run to completion. Default value is 0, which runs a
262 single fuzzing process until completion. If the value is >= 1, then this
263 number of jobs performing fuzzing are run, in a collection of parallel
264 separate worker processes; each such worker process has its
265 ``stdout``/``stderr`` redirected to ``fuzz-<JOB>.log``.
266``-workers``
267 Number of simultaneous worker processes to run the fuzzing jobs to completion
268 in. If 0 (the default), ``min(jobs, NumberOfCpuCores()/2)`` is used.
269``-dict``
270 Provide a dictionary of input keywords; see Dictionaries_.
271``-use_counters``
272 Use `coverage counters`_ to generate approximate counts of how often code
273 blocks are hit; defaults to 1.
Kostya Serebryanyb5dad1e2016-08-23 23:36:21 +0000274``-use_value_profile``
275 Use `value profile`_ to guide corpus expansion; defaults to 0.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000276``-only_ascii``
277 If 1, generate only ASCII (``isprint``+``isspace``) inputs. Defaults to 0.
278``-artifact_prefix``
279 Provide a prefix to use when saving fuzzing artifacts (crash, timeout, or
280 slow inputs) as ``$(artifact_prefix)file``. Defaults to empty.
281``-exact_artifact_path``
282 Ignored if empty (the default). If non-empty, write the single artifact on
283 failure (crash, timeout) as ``$(exact_artifact_path)``. This overrides
284 ``-artifact_prefix`` and will not use checksum in the file name. Do not use
285 the same path for several parallel processes.
Kostya Serebryany0f0fa4f2016-08-25 22:35:08 +0000286``-print_pcs``
287 If 1, print out newly covered PCs. Defaults to 0.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000288``-print_final_stats``
289 If 1, print statistics at exit. Defaults to 0.
Kostya Serebryany5d70d822016-08-12 20:42:24 +0000290``-detect_leaks``
Kostya Serebryanydced5d32016-04-29 19:28:24 +0000291 If 1 (default) and if LeakSanitizer is enabled
292 try to detect memory leaks during fuzzing (i.e. not only at shut down).
Kostya Serebryany7456af52016-04-28 15:19:05 +0000293``-close_fd_mask``
Kostya Serebryany470d0442016-05-27 21:46:22 +0000294 Indicate output streams to close at startup. Be careful, this will
295 remove diagnostic output from target code (e.g. messages on assert failure).
Kostya Serebryany7456af52016-04-28 15:19:05 +0000296
297 - 0 (default): close neither ``stdout`` nor ``stderr``
298 - 1 : close ``stdout``
299 - 2 : close ``stderr``
300 - 3 : close both ``stdout`` and ``stderr``.
Kostya Serebryany2adfa3b2015-05-20 21:03:03 +0000301
302For the full list of flags run the fuzzer binary with ``-help=1``.
303
Kostya Serebryany7456af52016-04-28 15:19:05 +0000304Output
305======
306
307During operation the fuzzer prints information to ``stderr``, for example::
308
Kostya Serebryanyc1708b02016-10-27 21:03:48 +0000309 INFO: Seed: 1523017872
310 INFO: Loaded 1 modules (16 guards): [0x744e60, 0x744ea0),
Kostya Serebryany7456af52016-04-28 15:19:05 +0000311 INFO: -max_len is not provided, using 64
Kostya Serebryanyc1708b02016-10-27 21:03:48 +0000312 INFO: A corpus is not provided, starting from an empty corpus
313 #0 READ units: 1
314 #1 INITED cov: 3 ft: 2 corp: 1/1b exec/s: 0 rss: 24Mb
315 #3811 NEW cov: 4 ft: 3 corp: 2/2b exec/s: 0 rss: 25Mb L: 1 MS: 5 ChangeBit-ChangeByte-ChangeBit-ShuffleBytes-ChangeByte-
316 #3827 NEW cov: 5 ft: 4 corp: 3/4b exec/s: 0 rss: 25Mb L: 2 MS: 1 CopyPart-
317 #3963 NEW cov: 6 ft: 5 corp: 4/6b exec/s: 0 rss: 25Mb L: 2 MS: 2 ShuffleBytes-ChangeBit-
318 #4167 NEW cov: 7 ft: 6 corp: 5/9b exec/s: 0 rss: 25Mb L: 3 MS: 1 InsertByte-
Kostya Serebryany7456af52016-04-28 15:19:05 +0000319 ...
320
321The early parts of the output include information about the fuzzer options and
322configuration, including the current random seed (in the ``Seed:`` line; this
323can be overridden with the ``-seed=N`` flag).
324
325Further output lines have the form of an event code and statistics. The
326possible event codes are:
327
328``READ``
329 The fuzzer has read in all of the provided input samples from the corpus
330 directories.
331``INITED``
332 The fuzzer has completed initialization, which includes running each of
333 the initial input samples through the code under test.
334``NEW``
335 The fuzzer has created a test input that covers new areas of the code
336 under test. This input will be saved to the primary corpus directory.
337``pulse``
338 The fuzzer has generated 2\ :sup:`n` inputs (generated periodically to reassure
339 the user that the fuzzer is still working).
340``DONE``
341 The fuzzer has completed operation because it has reached the specified
342 iteration limit (``-runs``) or time limit (``-max_total_time``).
343``MIN<n>``
344 The fuzzer is minimizing the combination of input corpus directories into
345 a single unified corpus (due to the ``-merge`` command line option).
346``RELOAD``
347 The fuzzer is performing a periodic reload of inputs from the corpus
348 directory; this allows it to discover any inputs discovered by other
349 fuzzer processes (see `Parallel Fuzzing`_).
350
351Each output line also reports the following statistics (when non-zero):
352
353``cov:``
354 Total number of code blocks or edges covered by the executing the current
355 corpus.
Kostya Serebryanyc1708b02016-10-27 21:03:48 +0000356``ft:``
357 libFuzzer uses different signals to evaluate the code coverage:
358 edge coverage, edge counters, value profiles, indirect caller/callee pairs, etc.
359 These signals combined are called *features* (`ft:`).
360``corp:``
361 Number of entries in the current in-memory test corpus and its size in bytes.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000362``exec/s:``
363 Number of fuzzer iterations per second.
Kostya Serebryanyc1708b02016-10-27 21:03:48 +0000364``rss:``
365 Current memory consumption.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000366
367For ``NEW`` events, the output line also includes information about the mutation
368operation that produced the new input:
369
370``L:``
371 Size of the new input in bytes.
372``MS: <n> <operations>``
373 Count and list of the mutation operations used to generate the input.
374
375
376Examples
377========
Kostya Serebryanyd11dc172016-03-12 02:56:25 +0000378.. contents::
379 :local:
380 :depth: 1
Kostya Serebryany79677382015-03-31 21:39:38 +0000381
382Toy example
383-----------
384
Kostya Serebryany7456af52016-04-28 15:19:05 +0000385A simple function that does something interesting if it receives the input
386"HI!"::
Kostya Serebryany79677382015-03-31 21:39:38 +0000387
Kostya Serebryany3a486362016-05-10 23:52:47 +0000388 cat << EOF > test_fuzzer.cc
Kostya Serebryany1c80b9d2015-11-26 00:12:57 +0000389 #include <stdint.h>
390 #include <stddef.h>
391 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
Kostya Serebryany79677382015-03-31 21:39:38 +0000392 if (size > 0 && data[0] == 'H')
393 if (size > 1 && data[1] == 'I')
394 if (size > 2 && data[2] == '!')
395 __builtin_trap();
Kostya Serebryany20bb5e72015-10-02 23:34:06 +0000396 return 0;
Kostya Serebryany79677382015-03-31 21:39:38 +0000397 }
398 EOF
Kostya Serebryanyabca88e2016-03-12 03:05:37 +0000399 # Build test_fuzzer.cc with asan and link against libFuzzer.a
Kostya Serebryanyc1708b02016-10-27 21:03:48 +0000400 clang++ -fsanitize=address -fsanitize-coverage=trace-pc-guard test_fuzzer.cc libFuzzer.a
Kostya Serebryany79677382015-03-31 21:39:38 +0000401 # Run the fuzzer with no corpus.
402 ./a.out
403
Kostya Serebryanyabca88e2016-03-12 03:05:37 +0000404You should get an error pretty quickly::
405
Kostya Serebryanyc1708b02016-10-27 21:03:48 +0000406 INFO: Seed: 1523017872
407 INFO: Loaded 1 modules (16 guards): [0x744e60, 0x744ea0),
408 INFO: -max_len is not provided, using 64
409 INFO: A corpus is not provided, starting from an empty corpus
410 #0 READ units: 1
411 #1 INITED cov: 3 ft: 2 corp: 1/1b exec/s: 0 rss: 24Mb
412 #3811 NEW cov: 4 ft: 3 corp: 2/2b exec/s: 0 rss: 25Mb L: 1 MS: 5 ChangeBit-ChangeByte-ChangeBit-ShuffleBytes-ChangeByte-
413 #3827 NEW cov: 5 ft: 4 corp: 3/4b exec/s: 0 rss: 25Mb L: 2 MS: 1 CopyPart-
414 #3963 NEW cov: 6 ft: 5 corp: 4/6b exec/s: 0 rss: 25Mb L: 2 MS: 2 ShuffleBytes-ChangeBit-
415 #4167 NEW cov: 7 ft: 6 corp: 5/9b exec/s: 0 rss: 25Mb L: 3 MS: 1 InsertByte-
Kostya Serebryanyabca88e2016-03-12 03:05:37 +0000416 ==31511== ERROR: libFuzzer: deadly signal
417 ...
418 artifact_prefix='./'; Test unit written to ./crash-b13e8756b13a00cf168300179061fb4b91fefbed
419
Kostya Serebryany79677382015-03-31 21:39:38 +0000420
Kostya Serebryanyaf67fd12016-10-27 20:14:03 +0000421More examples
422-------------
Kostya Serebryany79677382015-03-31 21:39:38 +0000423
Kostya Serebryanyaf67fd12016-10-27 20:14:03 +0000424Examples of real-life fuzz targets and the bugs they find can be found
425at http://tutorial.libfuzzer.info. Among other things you can learn how
426to detect Heartbleed_ in one second.
Kostya Serebryany79677382015-03-31 21:39:38 +0000427
Kostya Serebryany1c80b9d2015-11-26 00:12:57 +0000428
Kostya Serebryany043ab1c2015-04-01 21:33:20 +0000429Advanced features
430=================
Kostya Serebryanyd11dc172016-03-12 02:56:25 +0000431.. contents::
432 :local:
433 :depth: 1
Kostya Serebryany043ab1c2015-04-01 21:33:20 +0000434
Kostya Serebryany7d211662015-09-04 00:12:11 +0000435Dictionaries
436------------
Kostya Serebryany7d211662015-09-04 00:12:11 +0000437LibFuzzer supports user-supplied dictionaries with input language keywords
438or other interesting byte sequences (e.g. multi-byte magic values).
439Use ``-dict=DICTIONARY_FILE``. For some input languages using a dictionary
440may significantly improve the search speed.
441The dictionary syntax is similar to that used by AFL_ for its ``-x`` option::
442
443 # Lines starting with '#' and empty lines are ignored.
444
445 # Adds "blah" (w/o quotes) to the dictionary.
446 kw1="blah"
447 # Use \\ for backslash and \" for quotes.
448 kw2="\"ac\\dc\""
449 # Use \xAB for hex values
450 kw3="\xF7\xF8"
451 # the name of the keyword followed by '=' may be omitted:
452 "foo\x0Abar"
453
Kostya Serebryanyb5dad1e2016-08-23 23:36:21 +0000454Value Profile
455---------------
456
457*EXPERIMENTAL*.
458With an additional compiler flag ``-fsanitize-coverage=trace-cmp``
459(see SanitizerCoverageTraceDataFlow_)
460and extra run-time flag ``-use_value_profile=1`` the fuzzer will
461collect value profiles for the parameters of compare instructions
462and treat some new values as new coverage.
463
464The current imlpementation does roughly the following:
465
466* The compiler instruments all CMP instructions with a callback that receives both CMP arguments.
467* The callback computes `(caller_pc&4095) | (popcnt(Arg1 ^ Arg2) << 12)` and uses this value to set a bit in a bitset.
468* Every new observed bit in the bitset is treated as new coverage.
469
470
471This feature has a potential to discover many interesting inputs,
472but there are two downsides.
473First, the extra instrumentation may bring up to 2x additional slowdown.
474Second, the corpus may grow by several times.
475
Kostya Serebryany05576752016-05-25 18:41:53 +0000476Fuzzer-friendly build mode
477---------------------------
478Sometimes the code under test is not fuzzing-friendly. Examples:
479
480 - The target code uses a PRNG seeded e.g. by system time and
481 thus two consequent invocations may potentially execute different code paths
482 even if the end result will be the same. This will cause a fuzzer to treat
483 two similar inputs as significantly different and it will blow up the test corpus.
484 E.g. libxml uses ``rand()`` inside its hash table.
485 - The target code uses checksums to protect from invalid inputs.
486 E.g. png checks CRC for every chunk.
487
488In many cases it makes sense to build a special fuzzing-friendly build
489with certain fuzzing-unfriendly features disabled. We propose to use a common build macro
490for all such cases for consistency: ``FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION``.
491
492.. code-block:: c++
493
494 void MyInitPRNG() {
495 #ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
496 // In fuzzing mode the behavior of the code should be deterministic.
497 srand(0);
498 #else
499 srand(time(0));
500 #endif
501 }
502
503
504
Kostya Serebryany6bd016b2015-04-10 05:44:43 +0000505AFL compatibility
506-----------------
Kostya Serebryany9e1a2382016-03-29 23:07:36 +0000507LibFuzzer can be used together with AFL_ on the same test corpus.
Kostya Serebryany6bd016b2015-04-10 05:44:43 +0000508Both fuzzers expect the test corpus to reside in a directory, one file per input.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000509You can run both fuzzers on the same corpus, one after another:
510
511.. code-block:: console
Kostya Serebryany6bd016b2015-04-10 05:44:43 +0000512
Kostya Serebryany9e1a2382016-03-29 23:07:36 +0000513 ./afl-fuzz -i testcase_dir -o findings_dir /path/to/program @@
Kostya Serebryany6bd016b2015-04-10 05:44:43 +0000514 ./llvm-fuzz testcase_dir findings_dir # Will write new tests to testcase_dir
515
516Periodically restart both fuzzers so that they can use each other's findings.
Kostya Serebryany9e1a2382016-03-29 23:07:36 +0000517Currently, there is no simple way to run both fuzzing engines in parallel while sharing the same corpus dir.
Kostya Serebryany79677382015-03-31 21:39:38 +0000518
Kostya Serebryany3a486362016-05-10 23:52:47 +0000519You may also use AFL on your target function ``LLVMFuzzerTestOneInput``:
520see an example `here <https://github.com/llvm-mirror/llvm/blob/master/lib/Fuzzer/afl/afl_driver.cpp>`__.
521
Kostya Serebryanycd073d52015-04-10 06:32:29 +0000522How good is my fuzzer?
523----------------------
524
Kostya Serebryany566bc5a2015-05-06 22:19:00 +0000525Once you implement your target function ``LLVMFuzzerTestOneInput`` and fuzz it to death,
Kostya Serebryanycd073d52015-04-10 06:32:29 +0000526you will want to know whether the function or the corpus can be improved further.
527One easy to use metric is, of course, code coverage.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000528You can get the coverage for your corpus like this:
529
530.. code-block:: console
Kostya Serebryanycd073d52015-04-10 06:32:29 +0000531
Mike Aizatsky81166cf2016-09-30 21:07:04 +0000532 ASAN_OPTIONS=coverage=1 ./fuzzer CORPUS_DIR -runs=0
Kostya Serebryanycd073d52015-04-10 06:32:29 +0000533
Kostya Serebryanyec77af32016-05-05 18:07:09 +0000534This will run all tests in the CORPUS_DIR but will not perform any fuzzing.
Mike Aizatsky81166cf2016-09-30 21:07:04 +0000535At the end of the process it will dump a single ``.sancov`` file with coverage
536information. See SanitizerCoverage_ for details on querying the file using the
537``sancov`` tool.
Kostya Serebryanyec77af32016-05-05 18:07:09 +0000538
539You may also use other ways to visualize coverage,
Kostya Serebryany9a293ca2016-06-07 23:13:54 +0000540e.g. using `Clang coverage <http://clang.llvm.org/docs/SourceBasedCodeCoverage.html>`_,
541but those will require
542you to rebuild the code with different compiler flags.
Kostya Serebryanycd073d52015-04-10 06:32:29 +0000543
Kostya Serebryany926b9bd2015-05-22 22:43:05 +0000544User-supplied mutators
545----------------------
546
547LibFuzzer allows to use custom (user-supplied) mutators,
548see FuzzerInterface.h_
549
Kostya Serebryanyaca76962016-01-16 01:23:12 +0000550Startup initialization
551----------------------
552If the library being tested needs to be initialized, there are several options.
553
Kostya Serebryanyceca4762016-05-06 23:51:28 +0000554The simplest way is to have a statically initialized global object inside
555`LLVMFuzzerTestOneInput` (or in global scope if that works for you):
Kostya Serebryany7456af52016-04-28 15:19:05 +0000556
557.. code-block:: c++
Kostya Serebryanyaca76962016-01-16 01:23:12 +0000558
Kostya Serebryanyceca4762016-05-06 23:51:28 +0000559 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
560 static bool Initialized = DoInitialization();
561 ...
Kostya Serebryanyaca76962016-01-16 01:23:12 +0000562
563Alternatively, you may define an optional init function and it will receive
Kostya Serebryanyceca4762016-05-06 23:51:28 +0000564the program arguments that you can read and modify. Do this **only** if you
565realy need to access ``argv``/``argc``.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000566
567.. code-block:: c++
Kostya Serebryanyaca76962016-01-16 01:23:12 +0000568
569 extern "C" int LLVMFuzzerInitialize(int *argc, char ***argv) {
570 ReadAndMaybeModify(argc, argv);
571 return 0;
572 }
573
Kostya Serebryanyaca76962016-01-16 01:23:12 +0000574
Kostya Serebryany9e1a2382016-03-29 23:07:36 +0000575Leaks
576-----
577
Kostya Serebryany2fe93042016-04-29 18:49:55 +0000578Binaries built with AddressSanitizer_ or LeakSanitizer_ will try to detect
579memory leaks at the process shutdown.
580For in-process fuzzing this is inconvenient
581since the fuzzer needs to report a leak with a reproducer as soon as the leaky
582mutation is found. However, running full leak detection after every mutation
583is expensive.
Kostya Serebryany9e1a2382016-03-29 23:07:36 +0000584
Kostya Serebryany2fe93042016-04-29 18:49:55 +0000585By default (``-detect_leaks=1``) libFuzzer will count the number of
586``malloc`` and ``free`` calls when executing every mutation.
587If the numbers don't match (which by itself doesn't mean there is a leak)
588libFuzzer will invoke the more expensive LeakSanitizer_
589pass and if the actual leak is found, it will be reported with the reproducer
590and the process will exit.
591
592If your target has massive leaks and the leak detection is disabled
Kostya Serebryany1ed1aea2016-05-06 23:41:11 +0000593you will eventually run out of RAM (see the ``-rss_limit_mb`` flag).
Kostya Serebryany9e1a2382016-03-29 23:07:36 +0000594
Kostya Serebryany9e1a2382016-03-29 23:07:36 +0000595
Mike Aizatskyab885c52016-05-24 22:25:46 +0000596Developing libFuzzer
597====================
598
Kostya Serebryanyd4ae23b2016-06-08 01:31:40 +0000599Building libFuzzer as a part of LLVM project and running its test requires
600fresh clang as the host compiler and special CMake configuration:
Mike Aizatskyab885c52016-05-24 22:25:46 +0000601
602.. code-block:: console
603
Kostya Serebryanyd4ae23b2016-06-08 01:31:40 +0000604 cmake -GNinja -DCMAKE_C_COMPILER=clang -DCMAKE_CXX_COMPILER=clang++ -DLLVM_USE_SANITIZER=Address -DLLVM_USE_SANITIZE_COVERAGE=YES -DCMAKE_BUILD_TYPE=Release -DLLVM_ENABLE_ASSERTIONS=ON /path/to/llvm
Mike Aizatskyab885c52016-05-24 22:25:46 +0000605 ninja check-fuzzer
606
607
Kostya Serebryany79677382015-03-31 21:39:38 +0000608Fuzzing components of LLVM
609==========================
Kostya Serebryanyd11dc172016-03-12 02:56:25 +0000610.. contents::
611 :local:
612 :depth: 1
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000613
Kostya Serebryanyd4ae23b2016-06-08 01:31:40 +0000614To build any of the LLVM fuzz targets use the build instructions above.
615
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000616clang-format-fuzzer
617-------------------
618The inputs are random pieces of C++-like text.
619
Kostya Serebryany7456af52016-04-28 15:19:05 +0000620.. code-block:: console
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000621
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000622 ninja clang-format-fuzzer
623 mkdir CORPUS_DIR
624 ./bin/clang-format-fuzzer CORPUS_DIR
625
Kostya Serebryany7456af52016-04-28 15:19:05 +0000626Optionally build other kinds of binaries (ASan+Debug, MSan, UBSan, etc).
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000627
Kostya Serebryany79677382015-03-31 21:39:38 +0000628Tracking bug: https://llvm.org/bugs/show_bug.cgi?id=23052
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000629
Kostya Serebryany79677382015-03-31 21:39:38 +0000630clang-fuzzer
631------------
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000632
Kostya Serebryany866e0d12015-09-02 22:44:46 +0000633The behavior is very similar to ``clang-format-fuzzer``.
Kostya Serebryany79677382015-03-31 21:39:38 +0000634
635Tracking bug: https://llvm.org/bugs/show_bug.cgi?id=23057
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000636
Kostya Serebryanyb98e3272015-08-31 18:57:24 +0000637llvm-as-fuzzer
638--------------
639
640Tracking bug: https://llvm.org/bugs/show_bug.cgi?id=24639
641
Daniel Sanders5151b202015-09-18 10:47:45 +0000642llvm-mc-fuzzer
643--------------
644
645This tool fuzzes the MC layer. Currently it is only able to fuzz the
646disassembler but it is hoped that assembly, and round-trip verification will be
647added in future.
648
649When run in dissassembly mode, the inputs are opcodes to be disassembled. The
650fuzzer will consume as many instructions as possible and will stop when it
651finds an invalid instruction or runs out of data.
652
Daniel Sanders4fe1c8b2015-09-26 17:09:01 +0000653Please note that the command line interface differs slightly from that of other
654fuzzers. The fuzzer arguments should follow ``--fuzzer-args`` and should have
655a single dash, while other arguments control the operation mode and target in a
Kostya Serebryany7456af52016-04-28 15:19:05 +0000656similar manner to ``llvm-mc`` and should have two dashes. For example:
657
658.. code-block:: console
Daniel Sanders5151b202015-09-18 10:47:45 +0000659
Daniel Sanders4fe1c8b2015-09-26 17:09:01 +0000660 llvm-mc-fuzzer --triple=aarch64-linux-gnu --disassemble --fuzzer-args -max_len=4 -jobs=10
Daniel Sanders5151b202015-09-18 10:47:45 +0000661
Kostya Serebryanyfb2f3312015-05-13 22:42:28 +0000662Buildbot
663--------
664
Kostya Serebryany7456af52016-04-28 15:19:05 +0000665A buildbot continuously runs the above fuzzers for LLVM components, with results
666shown at http://lab.llvm.org:8011/builders/sanitizer-x86_64-linux-fuzzer .
Kostya Serebryanyfb2f3312015-05-13 22:42:28 +0000667
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000668FAQ
669=========================
670
Kostya Serebryany7456af52016-04-28 15:19:05 +0000671Q. Why doesn't libFuzzer use any of the LLVM support?
672-----------------------------------------------------
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000673
674There are two reasons.
675
Kostya Serebryany7456af52016-04-28 15:19:05 +0000676First, we want this library to be used outside of the LLVM without users having to
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000677build the rest of LLVM. This may sound unconvincing for many LLVM folks,
678but in practice the need for building the whole LLVM frightens many potential
679users -- and we want more users to use this code.
680
681Second, there is a subtle technical reason not to rely on the rest of LLVM, or
682any other large body of code (maybe not even STL). When coverage instrumentation
683is enabled, it will also instrument the LLVM support code which will blow up the
684coverage set of the process (since the fuzzer is in-process). In other words, by
685using more external dependencies we will slow down the fuzzer while the main
686reason for it to exist is extreme speed.
687
Kostya Serebryany7456af52016-04-28 15:19:05 +0000688Q. What about Windows then? The fuzzer contains code that does not build on Windows.
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000689------------------------------------------------------------------------------------
690
Kostya Serebryany241fb612016-03-12 03:23:02 +0000691Volunteers are welcome.
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000692
Kostya Serebryany8b6af7a2016-10-26 01:55:17 +0000693Q. When libFuzzer is not a good solution for a problem?
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000694---------------------------------------------------------
695
696* If the test inputs are validated by the target library and the validator
Kostya Serebryany241fb612016-03-12 03:23:02 +0000697 asserts/crashes on invalid inputs, in-process fuzzing is not applicable.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000698* Bugs in the target library may accumulate without being detected. E.g. a memory
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000699 corruption that goes undetected at first and then leads to a crash while
700 testing another input. This is why it is highly recommended to run this
701 in-process fuzzer with all sanitizers to detect most bugs on the spot.
702* It is harder to protect the in-process fuzzer from excessive memory
703 consumption and infinite loops in the target library (still possible).
704* The target library should not have significant global state that is not
705 reset between the runs.
Kostya Serebryany7456af52016-04-28 15:19:05 +0000706* Many interesting target libraries are not designed in a way that supports
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000707 the in-process fuzzer interface (e.g. require a file path instead of a
708 byte array).
709* If a single test run takes a considerable fraction of a second (or
710 more) the speed benefit from the in-process fuzzer is negligible.
711* If the target library runs persistent threads (that outlive
712 execution of one test) the fuzzing results will be unreliable.
713
714Q. So, what exactly this Fuzzer is good for?
715--------------------------------------------
716
717This Fuzzer might be a good choice for testing libraries that have relatively
Kostya Serebryany241fb612016-03-12 03:23:02 +0000718small inputs, each input takes < 10ms to run, and the library code is not expected
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000719to crash on invalid inputs.
Kostya Serebryany241fb612016-03-12 03:23:02 +0000720Examples: regular expression matchers, text or binary format parsers, compression,
721network, crypto.
Kostya Serebryany35ce8632015-03-30 23:05:30 +0000722
Kostya Serebryanyfab4fba2015-08-11 01:53:45 +0000723Trophies
724========
725* GLIBC: https://sourceware.org/glibc/wiki/FuzzingLibc
Kostya Serebryanyfdf44182015-08-11 04:16:37 +0000726
Kostya Serebryany6128fcf2016-06-02 06:06:34 +0000727* 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>`__
Kostya Serebryanyfdf44182015-08-11 04:16:37 +0000728
Kostya Serebryany928eb332015-10-12 18:15:42 +0000729* `pugixml <https://github.com/zeux/pugixml/issues/39>`_
Kostya Serebryanyfdf44182015-08-11 04:16:37 +0000730
Kostya Serebryany45dac2a2015-10-10 02:14:18 +0000731* PCRE: Search for "LLVM fuzzer" in http://vcs.pcre.org/pcre2/code/trunk/ChangeLog?view=markup;
Kostya Serebryany928eb332015-10-12 18:15:42 +0000732 also in `bugzilla <https://bugs.exim.org/buglist.cgi?bug_status=__all__&content=libfuzzer&no_redirect=1&order=Importance&product=PCRE&query_format=specific>`_
Kostya Serebryanyfdf44182015-08-11 04:16:37 +0000733
Kostya Serebryany928eb332015-10-12 18:15:42 +0000734* `ICU <http://bugs.icu-project.org/trac/ticket/11838>`_
Kostya Serebryanyed483772015-08-11 20:34:48 +0000735
Kostya Serebryany928eb332015-10-12 18:15:42 +0000736* `Freetype <https://savannah.nongnu.org/search/?words=LibFuzzer&type_of_search=bugs&Search=Search&exact=1#options>`_
Kostya Serebryany62921282015-09-11 16:34:14 +0000737
Kostya Serebryany928eb332015-10-12 18:15:42 +0000738* `Harfbuzz <https://github.com/behdad/harfbuzz/issues/139>`_
739
Kostya Serebryany240a1592015-11-11 05:25:24 +0000740* `SQLite <http://www3.sqlite.org/cgi/src/info/088009efdd56160b>`_
Kostya Serebryany65e71262015-11-11 05:20:55 +0000741
Kostya Serebryany12fa3b52015-11-13 02:44:16 +0000742* `Python <http://bugs.python.org/issue25388>`_
743
Kostya Serebryanyfece6742016-04-18 18:41:25 +0000744* 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>`_
Kostya Serebryany064a6722015-12-05 02:23:49 +0000745
Kostya Serebryany928eb332015-10-12 18:15:42 +0000746* `Libxml2
Kostya Serebryany0d234c32016-03-29 23:13:25 +0000747 <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)
Kostya Serebryany45dac2a2015-10-10 02:14:18 +0000748
Kostya Serebryany240a1592015-11-11 05:25:24 +0000749* `Linux Kernel's BPF verifier <https://github.com/iovisor/bpf-fuzzer>`_
Kostya Serebryany62921282015-09-11 16:34:14 +0000750
Kostya Serebryany6128fcf2016-06-02 06:06:34 +0000751* Capstone: `[1] <https://github.com/aquynh/capstone/issues/600>`__ `[2] <https://github.com/aquynh/capstone/commit/6b88d1d51eadf7175a8f8a11b690684443b11359>`__
752
753* 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>`__
Kostya Serebryanyc138b642016-04-19 22:37:44 +0000754
755* Radare2: `[1] <https://github.com/revskills?tab=contributions&from=2016-04-09>`__
756
757* 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>`__
758
Kostya Serebryany62023f22016-05-06 20:14:48 +0000759* WOFF2: `[1] <https://github.com/google/woff2/commit/a15a8ab>`__
760
Kostya Serebryanyf5bb42c2016-08-13 00:12:32 +0000761* 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.
Kostya Serebryanyfab4fba2015-08-11 01:53:45 +0000762
Kostya Serebryany42909a62016-10-21 20:01:45 +0000763* Tensorflow: `[1] <https://github.com/tensorflow/tensorflow/commit/7231d01fcb2cd9ef9ffbfea03b724892c8a4026e>`__
764
Kostya Serebryany85502382016-10-28 22:03:54 +0000765* 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>`__
766
Kostya Serebryany79677382015-03-31 21:39:38 +0000767.. _pcre2: http://www.pcre.org/
Kostya Serebryany79677382015-03-31 21:39:38 +0000768.. _AFL: http://lcamtuf.coredump.cx/afl/
Kostya Serebryanycbefff72016-10-27 20:45:35 +0000769.. _Radamsa: https://github.com/aoh/radamsa
Alexey Samsonov675e5392015-04-27 22:50:06 +0000770.. _SanitizerCoverage: http://clang.llvm.org/docs/SanitizerCoverage.html
Kostya Serebryanyb17e2982015-07-31 21:48:10 +0000771.. _SanitizerCoverageTraceDataFlow: http://clang.llvm.org/docs/SanitizerCoverage.html#tracing-data-flow
Kostya Serebryany9e1a2382016-03-29 23:07:36 +0000772.. _AddressSanitizer: http://clang.llvm.org/docs/AddressSanitizer.html
Kostya Serebryany2fe93042016-04-29 18:49:55 +0000773.. _LeakSanitizer: http://clang.llvm.org/docs/LeakSanitizer.html
Kostya Serebryany5e593a42015-04-08 06:16:11 +0000774.. _Heartbleed: http://en.wikipedia.org/wiki/Heartbleed
Kostya Serebryany926b9bd2015-05-22 22:43:05 +0000775.. _FuzzerInterface.h: https://github.com/llvm-mirror/llvm/blob/master/lib/Fuzzer/FuzzerInterface.h
Kostya Serebryany7456af52016-04-28 15:19:05 +0000776.. _3.7.0: http://llvm.org/releases/3.7.0/docs/LibFuzzer.html
777.. _building Clang from trunk: http://clang.llvm.org/get_started.html
778.. _MemorySanitizer: http://clang.llvm.org/docs/MemorySanitizer.html
779.. _UndefinedBehaviorSanitizer: http://clang.llvm.org/docs/UndefinedBehaviorSanitizer.html
780.. _`coverage counters`: http://clang.llvm.org/docs/SanitizerCoverage.html#coverage-counters
Kostya Serebryanyaafa0b02016-08-23 23:43:08 +0000781.. _`value profile`: #value-profile
Kostya Serebryany7456af52016-04-28 15:19:05 +0000782.. _`caller-callee pairs`: http://clang.llvm.org/docs/SanitizerCoverage.html#caller-callee-coverage
783.. _BoringSSL: https://boringssl.googlesource.com/boringssl/
784.. _`fuzz various parts of LLVM itself`: `Fuzzing components of LLVM`_