1======================================================= 2libFuzzer – a library for coverage-guided fuzz testing. 3======================================================= 4.. contents:: 5 :local: 6 :depth: 1 7 8Introduction 9============ 10 11LibFuzzer is in-process, coverage-guided, evolutionary fuzzing engine. 12 13LibFuzzer is linked with the library under test, and feeds fuzzed inputs to the 14library via a specific fuzzing entrypoint (aka "target function"); the fuzzer 15then tracks which areas of the code are reached, and generates mutations on the 16corpus of input data in order to maximize the code coverage. 17The code coverage 18information for libFuzzer is provided by LLVM's SanitizerCoverage_ 19instrumentation. 20 21Contact: libfuzzer(#)googlegroups.com 22 23Versions 24======== 25 26LibFuzzer is under active development so you will need the current 27(or at least a very recent) version of the Clang compiler. 28 29(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: 32 33.. code-block:: console 34 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 41This installs the Clang binary as 42``./third_party/llvm-build/Release+Asserts/bin/clang``) 43 44The 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. 49 50 51Getting Started 52=============== 53 54.. contents:: 55 :local: 56 :depth: 1 57 58Fuzz Target 59----------- 60 61The 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: 65 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 74Note that this fuzz target does not depend on libFuzzer in any way 75and so it is possible and even desirable to use it with other fuzzing engines 76e.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. 83* It may use threads but ideally all threads should be joined at the end of the function. 84* 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. 86* Ideally, it should not modify any global state (although that's not strict). 87* 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. 88 89 90Building 91-------- 92 93Next, build the libFuzzer library as a static archive, without any sanitizer 94options. Note that the libFuzzer library contains the ``main()`` function: 95 96.. code-block:: console 97 98 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 99 ./Fuzzer/build.sh # Produces libFuzzer.a 100 101Then build the fuzzing target function and the library under test using 102the SanitizerCoverage_ option, which instruments the code so that the fuzzer 103can retrieve code coverage information (to guide the fuzzing). Linking with 104the libFuzzer code then gives a fuzzer executable. 105 106You should also enable one or more of the *sanitizers*, which help to expose 107latent bugs by making incorrect behavior generate errors at runtime: 108 109 - AddressSanitizer_ (ASAN) detects memory access errors. Use `-fsanitize=address`. 110 - UndefinedBehaviorSanitizer_ (UBSAN) detects the use of various features of C/C++ that are explicitly 111 listed as resulting in undefined behavior. Use `-fsanitize=undefined -fno-sanitize-recover=undefined` 112 or any individual UBSAN check, e.g. `-fsanitize=signed-integer-overflow -fno-sanitize-recover=undefined`. 113 You may combine ASAN and UBSAN in one build. 114 - MemorySanitizer_ (MSAN) detects uninitialized reads: code whose behavior relies on memory 115 contents that have not been initialized to a specific value. Use `-fsanitize=memory`. 116 MSAN can not be combined with other sanirizers and should be used as a seprate build. 117 118Finally, link with ``libFuzzer.a``:: 119 120 clang -fsanitize-coverage=trace-pc-guard -fsanitize=address your_lib.cc fuzz_target.cc libFuzzer.a -o my_fuzzer 121 122Corpus 123------ 124 125Coverage-guided fuzzers like libFuzzer rely on a corpus of sample inputs for the 126code under test. This corpus should ideally be seeded with a varied collection 127of valid and invalid inputs for the code under test; for example, for a graphics 128library the initial corpus might hold a variety of different small PNG/JPG/GIF 129files. The fuzzer generates random mutations based around the sample inputs in 130the current corpus. If a mutation triggers execution of a previously-uncovered 131path in the code under test, then that mutation is saved to the corpus for 132future variations. 133 134LibFuzzer will work without any initial seeds, but will be less 135efficient if the library under test accepts complex, 136structured inputs. 137 138The corpus can also act as a sanity/regression check, to confirm that the 139fuzzing entrypoint still works and that all of the sample inputs run through 140the code under test without problems. 141 142If you have a large corpus (either generated by fuzzing or acquired by other means) 143you may want to minimize it while still preserving the full coverage. One way to do that 144is to use the `-merge=1` flag: 145 146.. code-block:: console 147 148 mkdir NEW_CORPUS_DIR # Store minimized corpus here. 149 ./my_fuzzer -merge=1 NEW_CORPUS_DIR FULL_CORPUS_DIR 150 151You may use the same flag to add more interesting items to an existing corpus. 152Only the inputs that trigger new coverage will be added to the first corpus. 153 154.. code-block:: console 155 156 ./my_fuzzer -merge=1 CURRENT_CORPUS_DIR NEW_POTENTIALLY_INTERESTING_INPUTS_DIR 157 158 159Running 160------- 161 162To run the fuzzer, first create a Corpus_ directory that holds the 163initial "seed" sample inputs: 164 165.. code-block:: console 166 167 mkdir CORPUS_DIR 168 cp /some/input/samples/* CORPUS_DIR 169 170Then run the fuzzer on the corpus directory: 171 172.. code-block:: console 173 174 ./my_fuzzer CORPUS_DIR # -max_len=1000 -jobs=20 ... 175 176As the fuzzer discovers new interesting test cases (i.e. test cases that 177trigger coverage of new paths through the code under test), those test cases 178will be added to the corpus directory. 179 180By default, the fuzzing process will continue indefinitely – at least until 181a bug is found. Any crashes or sanitizer failures will be reported as usual, 182stopping the fuzzing process, and the particular input that triggered the bug 183will be written to disk (typically as ``crash-<sha1>``, ``leak-<sha1>``, 184or ``timeout-<sha1>``). 185 186 187Parallel Fuzzing 188---------------- 189 190Each libFuzzer process is single-threaded, unless the library under test starts 191its own threads. However, it is possible to run multiple libFuzzer processes in 192parallel with a shared corpus directory; this has the advantage that any new 193inputs found by one fuzzer process will be available to the other fuzzer 194processes (unless you disable this with the ``-reload=0`` option). 195 196This is primarily controlled by the ``-jobs=N`` option, which indicates that 197that `N` fuzzing jobs should be run to completion (i.e. until a bug is found or 198time/iteration limits are reached). These jobs will be run across a set of 199worker processes, by default using half of the available CPU cores; the count of 200worker processes can be overridden by the ``-workers=N`` option. For example, 201running with ``-jobs=30`` on a 12-core machine would run 6 workers by default, 202with each worker averaging 5 bugs by completion of the entire process. 203 204 205Options 206======= 207 208To run the fuzzer, pass zero or more corpus directories as command line 209arguments. The fuzzer will read test inputs from each of these corpus 210directories, and any new test inputs that are generated will be written 211back to the first corpus directory: 212 213.. code-block:: console 214 215 ./fuzzer [-flag1=val1 [-flag2=val2 ...] ] [dir1 [dir2 ...] ] 216 217If a list of files (rather than directories) are passed to the fuzzer program, 218then it will re-run those files as test inputs but will not perform any fuzzing. 219In this mode the fuzzer binary can be used as a regression test (e.g. on a 220continuous integration system) to check the target function and saved inputs 221still work. 222 223The most important command line options are: 224 225``-help`` 226 Print help message. 227``-seed`` 228 Random seed. If 0 (the default), the seed is generated. 229``-runs`` 230 Number of individual test runs, -1 (the default) to run indefinitely. 231``-max_len`` 232 Maximum length of a test input. If 0 (the default), libFuzzer tries to guess 233 a good value based on the corpus (and reports it). 234``-timeout`` 235 Timeout in seconds, default 1200. If an input takes longer than this timeout, 236 the process is treated as a failure case. 237``-rss_limit_mb`` 238 Memory usage limit in Mb, default 2048. Use 0 to disable the limit. 239 If an input requires more than this amount of RSS memory to execute, 240 the process is treated as a failure case. 241 The limit is checked in a separate thread every second. 242 If running w/o ASAN/MSAN, you may use 'ulimit -v' instead. 243``-timeout_exitcode`` 244 Exit code (default 77) used if libFuzzer reports a timeout. 245``-error_exitcode`` 246 Exit code (default 77) used if libFuzzer itself (not a sanitizer) reports a bug (leak, OOM, etc). 247``-max_total_time`` 248 If positive, indicates the maximum total time in seconds to run the fuzzer. 249 If 0 (the default), run indefinitely. 250``-merge`` 251 If set to 1, any corpus inputs from the 2nd, 3rd etc. corpus directories 252 that trigger new code coverage will be merged into the first corpus 253 directory. Defaults to 0. This flag can be used to minimize a corpus. 254``-minimize_crash`` 255 If 1, minimizes the provided crash input. 256 Use with -runs=N or -max_total_time=N to limit the number of attempts. 257``-reload`` 258 If set to 1 (the default), the corpus directory is re-read periodically to 259 check for new inputs; this allows detection of new inputs that were discovered 260 by other fuzzing processes. 261``-jobs`` 262 Number of fuzzing jobs to run to completion. Default value is 0, which runs a 263 single fuzzing process until completion. If the value is >= 1, then this 264 number of jobs performing fuzzing are run, in a collection of parallel 265 separate worker processes; each such worker process has its 266 ``stdout``/``stderr`` redirected to ``fuzz-<JOB>.log``. 267``-workers`` 268 Number of simultaneous worker processes to run the fuzzing jobs to completion 269 in. If 0 (the default), ``min(jobs, NumberOfCpuCores()/2)`` is used. 270``-dict`` 271 Provide a dictionary of input keywords; see Dictionaries_. 272``-use_counters`` 273 Use `coverage counters`_ to generate approximate counts of how often code 274 blocks are hit; defaults to 1. 275``-use_value_profile`` 276 Use `value profile`_ to guide corpus expansion; defaults to 0. 277``-only_ascii`` 278 If 1, generate only ASCII (``isprint``+``isspace``) inputs. Defaults to 0. 279``-artifact_prefix`` 280 Provide a prefix to use when saving fuzzing artifacts (crash, timeout, or 281 slow inputs) as ``$(artifact_prefix)file``. Defaults to empty. 282``-exact_artifact_path`` 283 Ignored if empty (the default). If non-empty, write the single artifact on 284 failure (crash, timeout) as ``$(exact_artifact_path)``. This overrides 285 ``-artifact_prefix`` and will not use checksum in the file name. Do not use 286 the same path for several parallel processes. 287``-print_pcs`` 288 If 1, print out newly covered PCs. Defaults to 0. 289``-print_final_stats`` 290 If 1, print statistics at exit. Defaults to 0. 291``-detect_leaks`` 292 If 1 (default) and if LeakSanitizer is enabled 293 try to detect memory leaks during fuzzing (i.e. not only at shut down). 294``-close_fd_mask`` 295 Indicate output streams to close at startup. Be careful, this will 296 remove diagnostic output from target code (e.g. messages on assert failure). 297 298 - 0 (default): close neither ``stdout`` nor ``stderr`` 299 - 1 : close ``stdout`` 300 - 2 : close ``stderr`` 301 - 3 : close both ``stdout`` and ``stderr``. 302 303For the full list of flags run the fuzzer binary with ``-help=1``. 304 305Output 306====== 307 308During operation the fuzzer prints information to ``stderr``, for example:: 309 310 INFO: Seed: 1523017872 311 INFO: Loaded 1 modules (16 guards): [0x744e60, 0x744ea0), 312 INFO: -max_len is not provided, using 64 313 INFO: A corpus is not provided, starting from an empty corpus 314 #0 READ units: 1 315 #1 INITED cov: 3 ft: 2 corp: 1/1b exec/s: 0 rss: 24Mb 316 #3811 NEW cov: 4 ft: 3 corp: 2/2b exec/s: 0 rss: 25Mb L: 1 MS: 5 ChangeBit-ChangeByte-ChangeBit-ShuffleBytes-ChangeByte- 317 #3827 NEW cov: 5 ft: 4 corp: 3/4b exec/s: 0 rss: 25Mb L: 2 MS: 1 CopyPart- 318 #3963 NEW cov: 6 ft: 5 corp: 4/6b exec/s: 0 rss: 25Mb L: 2 MS: 2 ShuffleBytes-ChangeBit- 319 #4167 NEW cov: 7 ft: 6 corp: 5/9b exec/s: 0 rss: 25Mb L: 3 MS: 1 InsertByte- 320 ... 321 322The early parts of the output include information about the fuzzer options and 323configuration, including the current random seed (in the ``Seed:`` line; this 324can be overridden with the ``-seed=N`` flag). 325 326Further output lines have the form of an event code and statistics. The 327possible event codes are: 328 329``READ`` 330 The fuzzer has read in all of the provided input samples from the corpus 331 directories. 332``INITED`` 333 The fuzzer has completed initialization, which includes running each of 334 the initial input samples through the code under test. 335``NEW`` 336 The fuzzer has created a test input that covers new areas of the code 337 under test. This input will be saved to the primary corpus directory. 338``pulse`` 339 The fuzzer has generated 2\ :sup:`n` inputs (generated periodically to reassure 340 the user that the fuzzer is still working). 341``DONE`` 342 The fuzzer has completed operation because it has reached the specified 343 iteration limit (``-runs``) or time limit (``-max_total_time``). 344``RELOAD`` 345 The fuzzer is performing a periodic reload of inputs from the corpus 346 directory; this allows it to discover any inputs discovered by other 347 fuzzer processes (see `Parallel Fuzzing`_). 348 349Each output line also reports the following statistics (when non-zero): 350 351``cov:`` 352 Total number of code blocks or edges covered by the executing the current 353 corpus. 354``ft:`` 355 libFuzzer uses different signals to evaluate the code coverage: 356 edge coverage, edge counters, value profiles, indirect caller/callee pairs, etc. 357 These signals combined are called *features* (`ft:`). 358``corp:`` 359 Number of entries in the current in-memory test corpus and its size in bytes. 360``exec/s:`` 361 Number of fuzzer iterations per second. 362``rss:`` 363 Current memory consumption. 364 365For ``NEW`` events, the output line also includes information about the mutation 366operation that produced the new input: 367 368``L:`` 369 Size of the new input in bytes. 370``MS: <n> <operations>`` 371 Count and list of the mutation operations used to generate the input. 372 373 374Examples 375======== 376.. contents:: 377 :local: 378 :depth: 1 379 380Toy example 381----------- 382 383A simple function that does something interesting if it receives the input 384"HI!":: 385 386 cat << EOF > test_fuzzer.cc 387 #include <stdint.h> 388 #include <stddef.h> 389 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) { 390 if (size > 0 && data[0] == 'H') 391 if (size > 1 && data[1] == 'I') 392 if (size > 2 && data[2] == '!') 393 __builtin_trap(); 394 return 0; 395 } 396 EOF 397 # Build test_fuzzer.cc with asan and link against libFuzzer.a 398 clang++ -fsanitize=address -fsanitize-coverage=trace-pc-guard test_fuzzer.cc libFuzzer.a 399 # Run the fuzzer with no corpus. 400 ./a.out 401 402You should get an error pretty quickly:: 403 404 INFO: Seed: 1523017872 405 INFO: Loaded 1 modules (16 guards): [0x744e60, 0x744ea0), 406 INFO: -max_len is not provided, using 64 407 INFO: A corpus is not provided, starting from an empty corpus 408 #0 READ units: 1 409 #1 INITED cov: 3 ft: 2 corp: 1/1b exec/s: 0 rss: 24Mb 410 #3811 NEW cov: 4 ft: 3 corp: 2/2b exec/s: 0 rss: 25Mb L: 1 MS: 5 ChangeBit-ChangeByte-ChangeBit-ShuffleBytes-ChangeByte- 411 #3827 NEW cov: 5 ft: 4 corp: 3/4b exec/s: 0 rss: 25Mb L: 2 MS: 1 CopyPart- 412 #3963 NEW cov: 6 ft: 5 corp: 4/6b exec/s: 0 rss: 25Mb L: 2 MS: 2 ShuffleBytes-ChangeBit- 413 #4167 NEW cov: 7 ft: 6 corp: 5/9b exec/s: 0 rss: 25Mb L: 3 MS: 1 InsertByte- 414 ==31511== ERROR: libFuzzer: deadly signal 415 ... 416 artifact_prefix='./'; Test unit written to ./crash-b13e8756b13a00cf168300179061fb4b91fefbed 417 418 419More examples 420------------- 421 422Examples of real-life fuzz targets and the bugs they find can be found 423at http://tutorial.libfuzzer.info. Among other things you can learn how 424to detect Heartbleed_ in one second. 425 426 427Advanced features 428================= 429.. contents:: 430 :local: 431 :depth: 1 432 433Dictionaries 434------------ 435LibFuzzer supports user-supplied dictionaries with input language keywords 436or other interesting byte sequences (e.g. multi-byte magic values). 437Use ``-dict=DICTIONARY_FILE``. For some input languages using a dictionary 438may significantly improve the search speed. 439The dictionary syntax is similar to that used by AFL_ for its ``-x`` option:: 440 441 # Lines starting with '#' and empty lines are ignored. 442 443 # Adds "blah" (w/o quotes) to the dictionary. 444 kw1="blah" 445 # Use \\ for backslash and \" for quotes. 446 kw2="\"ac\\dc\"" 447 # Use \xAB for hex values 448 kw3="\xF7\xF8" 449 # the name of the keyword followed by '=' may be omitted: 450 "foo\x0Abar" 451 452 453 454Tracing CMP instructions 455------------------------ 456 457With an additional compiler flag ``-fsanitize-coverage=trace-cmp`` 458(see SanitizerCoverageTraceDataFlow_) 459libFuzzer will intercept CMP instructions and guide mutations based 460on the arguments of intercepted CMP instructions. This may slow down 461the fuzzing but is very likely to improve the results. 462 463Value Profile 464------------- 465 466*EXPERIMENTAL*. 467With ``-fsanitize-coverage=trace-cmp`` 468and extra run-time flag ``-use_value_profile=1`` the fuzzer will 469collect value profiles for the parameters of compare instructions 470and treat some new values as new coverage. 471 472The current imlpementation does roughly the following: 473 474* The compiler instruments all CMP instructions with a callback that receives both CMP arguments. 475* The callback computes `(caller_pc&4095) | (popcnt(Arg1 ^ Arg2) << 12)` and uses this value to set a bit in a bitset. 476* Every new observed bit in the bitset is treated as new coverage. 477 478 479This feature has a potential to discover many interesting inputs, 480but there are two downsides. 481First, the extra instrumentation may bring up to 2x additional slowdown. 482Second, the corpus may grow by several times. 483 484Fuzzer-friendly build mode 485--------------------------- 486Sometimes the code under test is not fuzzing-friendly. Examples: 487 488 - The target code uses a PRNG seeded e.g. by system time and 489 thus two consequent invocations may potentially execute different code paths 490 even if the end result will be the same. This will cause a fuzzer to treat 491 two similar inputs as significantly different and it will blow up the test corpus. 492 E.g. libxml uses ``rand()`` inside its hash table. 493 - The target code uses checksums to protect from invalid inputs. 494 E.g. png checks CRC for every chunk. 495 496In many cases it makes sense to build a special fuzzing-friendly build 497with certain fuzzing-unfriendly features disabled. We propose to use a common build macro 498for all such cases for consistency: ``FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION``. 499 500.. code-block:: c++ 501 502 void MyInitPRNG() { 503 #ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION 504 // In fuzzing mode the behavior of the code should be deterministic. 505 srand(0); 506 #else 507 srand(time(0)); 508 #endif 509 } 510 511 512 513AFL compatibility 514----------------- 515LibFuzzer can be used together with AFL_ on the same test corpus. 516Both fuzzers expect the test corpus to reside in a directory, one file per input. 517You can run both fuzzers on the same corpus, one after another: 518 519.. code-block:: console 520 521 ./afl-fuzz -i testcase_dir -o findings_dir /path/to/program @@ 522 ./llvm-fuzz testcase_dir findings_dir # Will write new tests to testcase_dir 523 524Periodically restart both fuzzers so that they can use each other's findings. 525Currently, there is no simple way to run both fuzzing engines in parallel while sharing the same corpus dir. 526 527You may also use AFL on your target function ``LLVMFuzzerTestOneInput``: 528see an example `here <https://github.com/llvm-mirror/llvm/blob/master/lib/Fuzzer/afl/afl_driver.cpp>`__. 529 530How good is my fuzzer? 531---------------------- 532 533Once you implement your target function ``LLVMFuzzerTestOneInput`` and fuzz it to death, 534you will want to know whether the function or the corpus can be improved further. 535One easy to use metric is, of course, code coverage. 536You can get the coverage for your corpus like this: 537 538.. code-block:: console 539 540 ASAN_OPTIONS=coverage=1 ./fuzzer CORPUS_DIR -runs=0 541 542This will run all tests in the CORPUS_DIR but will not perform any fuzzing. 543At the end of the process it will dump a single ``.sancov`` file with coverage 544information. See SanitizerCoverage_ for details on querying the file using the 545``sancov`` tool. 546 547You may also use other ways to visualize coverage, 548e.g. using `Clang coverage <http://clang.llvm.org/docs/SourceBasedCodeCoverage.html>`_, 549but those will require 550you to rebuild the code with different compiler flags. 551 552User-supplied mutators 553---------------------- 554 555LibFuzzer allows to use custom (user-supplied) mutators, 556see FuzzerInterface.h_ 557 558Startup initialization 559---------------------- 560If the library being tested needs to be initialized, there are several options. 561 562The simplest way is to have a statically initialized global object inside 563`LLVMFuzzerTestOneInput` (or in global scope if that works for you): 564 565.. code-block:: c++ 566 567 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { 568 static bool Initialized = DoInitialization(); 569 ... 570 571Alternatively, you may define an optional init function and it will receive 572the program arguments that you can read and modify. Do this **only** if you 573realy need to access ``argv``/``argc``. 574 575.. code-block:: c++ 576 577 extern "C" int LLVMFuzzerInitialize(int *argc, char ***argv) { 578 ReadAndMaybeModify(argc, argv); 579 return 0; 580 } 581 582 583Leaks 584----- 585 586Binaries built with AddressSanitizer_ or LeakSanitizer_ will try to detect 587memory leaks at the process shutdown. 588For in-process fuzzing this is inconvenient 589since the fuzzer needs to report a leak with a reproducer as soon as the leaky 590mutation is found. However, running full leak detection after every mutation 591is expensive. 592 593By default (``-detect_leaks=1``) libFuzzer will count the number of 594``malloc`` and ``free`` calls when executing every mutation. 595If the numbers don't match (which by itself doesn't mean there is a leak) 596libFuzzer will invoke the more expensive LeakSanitizer_ 597pass and if the actual leak is found, it will be reported with the reproducer 598and the process will exit. 599 600If your target has massive leaks and the leak detection is disabled 601you will eventually run out of RAM (see the ``-rss_limit_mb`` flag). 602 603 604Developing libFuzzer 605==================== 606 607Building libFuzzer as a part of LLVM project and running its test requires 608fresh clang as the host compiler and special CMake configuration: 609 610.. code-block:: console 611 612 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 613 ninja check-fuzzer 614 615 616Fuzzing components of LLVM 617========================== 618.. contents:: 619 :local: 620 :depth: 1 621 622To build any of the LLVM fuzz targets use the build instructions above. 623 624clang-format-fuzzer 625------------------- 626The inputs are random pieces of C++-like text. 627 628.. code-block:: console 629 630 ninja clang-format-fuzzer 631 mkdir CORPUS_DIR 632 ./bin/clang-format-fuzzer CORPUS_DIR 633 634Optionally build other kinds of binaries (ASan+Debug, MSan, UBSan, etc). 635 636Tracking bug: https://llvm.org/bugs/show_bug.cgi?id=23052 637 638clang-fuzzer 639------------ 640 641The behavior is very similar to ``clang-format-fuzzer``. 642 643Tracking bug: https://llvm.org/bugs/show_bug.cgi?id=23057 644 645llvm-as-fuzzer 646-------------- 647 648Tracking bug: https://llvm.org/bugs/show_bug.cgi?id=24639 649 650llvm-mc-fuzzer 651-------------- 652 653This tool fuzzes the MC layer. Currently it is only able to fuzz the 654disassembler but it is hoped that assembly, and round-trip verification will be 655added in future. 656 657When run in dissassembly mode, the inputs are opcodes to be disassembled. The 658fuzzer will consume as many instructions as possible and will stop when it 659finds an invalid instruction or runs out of data. 660 661Please note that the command line interface differs slightly from that of other 662fuzzers. The fuzzer arguments should follow ``--fuzzer-args`` and should have 663a single dash, while other arguments control the operation mode and target in a 664similar manner to ``llvm-mc`` and should have two dashes. For example: 665 666.. code-block:: console 667 668 llvm-mc-fuzzer --triple=aarch64-linux-gnu --disassemble --fuzzer-args -max_len=4 -jobs=10 669 670Buildbot 671-------- 672 673A buildbot continuously runs the above fuzzers for LLVM components, with results 674shown at http://lab.llvm.org:8011/builders/sanitizer-x86_64-linux-fuzzer . 675 676FAQ 677========================= 678 679Q. Why doesn't libFuzzer use any of the LLVM support? 680----------------------------------------------------- 681 682There are two reasons. 683 684First, we want this library to be used outside of the LLVM without users having to 685build the rest of LLVM. This may sound unconvincing for many LLVM folks, 686but in practice the need for building the whole LLVM frightens many potential 687users -- and we want more users to use this code. 688 689Second, there is a subtle technical reason not to rely on the rest of LLVM, or 690any other large body of code (maybe not even STL). When coverage instrumentation 691is enabled, it will also instrument the LLVM support code which will blow up the 692coverage set of the process (since the fuzzer is in-process). In other words, by 693using more external dependencies we will slow down the fuzzer while the main 694reason for it to exist is extreme speed. 695 696Q. What about Windows then? The fuzzer contains code that does not build on Windows. 697------------------------------------------------------------------------------------ 698 699Volunteers are welcome. 700 701Q. When libFuzzer is not a good solution for a problem? 702--------------------------------------------------------- 703 704* If the test inputs are validated by the target library and the validator 705 asserts/crashes on invalid inputs, in-process fuzzing is not applicable. 706* Bugs in the target library may accumulate without being detected. E.g. a memory 707 corruption that goes undetected at first and then leads to a crash while 708 testing another input. This is why it is highly recommended to run this 709 in-process fuzzer with all sanitizers to detect most bugs on the spot. 710* It is harder to protect the in-process fuzzer from excessive memory 711 consumption and infinite loops in the target library (still possible). 712* The target library should not have significant global state that is not 713 reset between the runs. 714* Many interesting target libraries are not designed in a way that supports 715 the in-process fuzzer interface (e.g. require a file path instead of a 716 byte array). 717* If a single test run takes a considerable fraction of a second (or 718 more) the speed benefit from the in-process fuzzer is negligible. 719* If the target library runs persistent threads (that outlive 720 execution of one test) the fuzzing results will be unreliable. 721 722Q. So, what exactly this Fuzzer is good for? 723-------------------------------------------- 724 725This Fuzzer might be a good choice for testing libraries that have relatively 726small inputs, each input takes < 10ms to run, and the library code is not expected 727to crash on invalid inputs. 728Examples: regular expression matchers, text or binary format parsers, compression, 729network, crypto. 730 731Trophies 732======== 733* GLIBC: https://sourceware.org/glibc/wiki/FuzzingLibc 734 735* 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>`__ 736 737* `pugixml <https://github.com/zeux/pugixml/issues/39>`_ 738 739* PCRE: Search for "LLVM fuzzer" in http://vcs.pcre.org/pcre2/code/trunk/ChangeLog?view=markup; 740 also in `bugzilla <https://bugs.exim.org/buglist.cgi?bug_status=__all__&content=libfuzzer&no_redirect=1&order=Importance&product=PCRE&query_format=specific>`_ 741 742* `ICU <http://bugs.icu-project.org/trac/ticket/11838>`_ 743 744* `Freetype <https://savannah.nongnu.org/search/?words=LibFuzzer&type_of_search=bugs&Search=Search&exact=1#options>`_ 745 746* `Harfbuzz <https://github.com/behdad/harfbuzz/issues/139>`_ 747 748* `SQLite <http://www3.sqlite.org/cgi/src/info/088009efdd56160b>`_ 749 750* `Python <http://bugs.python.org/issue25388>`_ 751 752* 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>`_ 753 754* `Libxml2 755 <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) 756 757* `Linux Kernel's BPF verifier <https://github.com/iovisor/bpf-fuzzer>`_ 758 759* Capstone: `[1] <https://github.com/aquynh/capstone/issues/600>`__ `[2] <https://github.com/aquynh/capstone/commit/6b88d1d51eadf7175a8f8a11b690684443b11359>`__ 760 761* 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>`__ 762 763* Radare2: `[1] <https://github.com/revskills?tab=contributions&from=2016-04-09>`__ 764 765* 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>`__ 766 767* WOFF2: `[1] <https://github.com/google/woff2/commit/a15a8ab>`__ 768 769* 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. 770 771* Tensorflow: `[1] <https://github.com/tensorflow/tensorflow/commit/7231d01fcb2cd9ef9ffbfea03b724892c8a4026e>`__ 772 773* 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>`__ 774 775.. _pcre2: http://www.pcre.org/ 776.. _AFL: http://lcamtuf.coredump.cx/afl/ 777.. _Radamsa: https://github.com/aoh/radamsa 778.. _SanitizerCoverage: http://clang.llvm.org/docs/SanitizerCoverage.html 779.. _SanitizerCoverageTraceDataFlow: http://clang.llvm.org/docs/SanitizerCoverage.html#tracing-data-flow 780.. _AddressSanitizer: http://clang.llvm.org/docs/AddressSanitizer.html 781.. _LeakSanitizer: http://clang.llvm.org/docs/LeakSanitizer.html 782.. _Heartbleed: http://en.wikipedia.org/wiki/Heartbleed 783.. _FuzzerInterface.h: https://github.com/llvm-mirror/llvm/blob/master/lib/Fuzzer/FuzzerInterface.h 784.. _3.7.0: http://llvm.org/releases/3.7.0/docs/LibFuzzer.html 785.. _building Clang from trunk: http://clang.llvm.org/get_started.html 786.. _MemorySanitizer: http://clang.llvm.org/docs/MemorySanitizer.html 787.. _UndefinedBehaviorSanitizer: http://clang.llvm.org/docs/UndefinedBehaviorSanitizer.html 788.. _`coverage counters`: http://clang.llvm.org/docs/SanitizerCoverage.html#coverage-counters 789.. _`value profile`: #value-profile 790.. _`caller-callee pairs`: http://clang.llvm.org/docs/SanitizerCoverage.html#caller-callee-coverage 791.. _BoringSSL: https://boringssl.googlesource.com/boringssl/ 792.. _`fuzz various parts of LLVM itself`: `Fuzzing components of LLVM`_ 793