| Index: testing/libfuzzer/fuzzers/brotli_fuzzer.cc
|
| diff --git a/testing/libfuzzer/fuzzers/brotli_fuzzer.cc b/testing/libfuzzer/fuzzers/brotli_fuzzer.cc
|
| deleted file mode 100644
|
| index 4689416a9b6a427b2bcbe69c426362f39f84b15b..0000000000000000000000000000000000000000
|
| --- a/testing/libfuzzer/fuzzers/brotli_fuzzer.cc
|
| +++ /dev/null
|
| @@ -1,45 +0,0 @@
|
| -// Copyright 2015 The Chromium Authors. All rights reserved.
|
| -// Use of this source code is governed by a BSD-style license that can be
|
| -// found in the LICENSE file.
|
| -
|
| -#include <stddef.h>
|
| -#include <stdint.h>
|
| -
|
| -#include "third_party/brotli/include/brotli/decode.h"
|
| -
|
| -// Entry point for LibFuzzer.
|
| -extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
|
| - size_t addend = 0;
|
| - if (size > 0)
|
| - addend = data[size - 1] & 7;
|
| - const uint8_t* next_in = data;
|
| -
|
| - const int kBufferSize = 1024;
|
| - uint8_t* buffer = new uint8_t[kBufferSize];
|
| - BrotliDecoderState* state = BrotliDecoderCreateInstance(0, 0, 0);
|
| -
|
| - if (addend == 0)
|
| - addend = size;
|
| - /* Test both fast (addend == size) and slow (addend <= 7) decoding paths. */
|
| - for (size_t i = 0; i < size;) {
|
| - size_t next_i = i + addend;
|
| - if (next_i > size)
|
| - next_i = size;
|
| - size_t avail_in = next_i - i;
|
| - i = next_i;
|
| - BrotliDecoderResult result = BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT;
|
| - while (result == BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT) {
|
| - size_t avail_out = kBufferSize;
|
| - uint8_t* next_out = buffer;
|
| - size_t total_out;
|
| - result = BrotliDecoderDecompressStream(
|
| - state, &avail_in, &next_in, &avail_out, &next_out, &total_out);
|
| - }
|
| - if (result != BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT)
|
| - break;
|
| - }
|
| -
|
| - BrotliDecoderDestroyInstance(state);
|
| - delete[] buffer;
|
| - return 0;
|
| -}
|
|
|