| 1 |
// Copyright 2023 Google Inc. |
| 2 |
// |
| 3 |
// Licensed under the Apache License, Version 2.0 (the "License"); |
| 4 |
// you may not use this file except in compliance with the License. |
| 5 |
// You may obtain a copy of the License at |
| 6 |
// |
| 7 |
// http://www.apache.org/licenses/LICENSE-2.0 |
| 8 |
// |
| 9 |
// Unless required by applicable law or agreed to in writing, software |
| 10 |
// distributed under the License is distributed on an "AS IS" BASIS, |
| 11 |
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 12 |
// See the License for the specific language governing permissions and |
| 13 |
// limitations under the License. |
| 14 |
// |
| 15 |
//////////////////////////////////////////////////////////////////////////////// |
| 16 |
|
| 17 |
#include <cstddef> |
| 18 |
#include <cstdint> |
| 19 |
#include <string_view> |
| 20 |
|
| 21 |
#include "./fuzz_utils.h" |
| 22 |
#include "src/dec/vp8li_dec.h" |
| 23 |
#include "src/utils/bit_reader_utils.h" |
| 24 |
#include "src/utils/huffman_utils.h" |
| 25 |
#include "src/utils/utils.h" |
| 26 |
#include "src/webp/format_constants.h" |
| 27 |
|
| 28 |
namespace { |
| 29 |
|
| 30 |
void HuffmanTest(std::string_view blob) { |
| 31 |
const uint8_t* const data = reinterpret_cast<const uint8_t*>(blob.data()); |
| 32 |
const size_t size = blob.size(); |
| 33 |
|
| 34 |
// Number of bits to initialize data. |
| 35 |
static const int kColorCacheBitsBits = 4; |
| 36 |
// 'num_htree_groups' is contained in the RG channel, hence 16 bits. |
| 37 |
static const int kNumHtreeGroupsBits = 16; |
| 38 |
if (size * sizeof(*data) < kColorCacheBitsBits + kNumHtreeGroupsBits) { |
| 39 |
return; |
| 40 |
} |
| 41 |
|
| 42 |
// A non-NULL mapping brings minor changes that are tested by the normal |
| 43 |
// fuzzer. |
| 44 |
int* const mapping = NULL; |
| 45 |
HuffmanTables huffman_tables; |
| 46 |
memset(&huffman_tables, 0, sizeof(huffman_tables)); |
| 47 |
HTreeGroup* htree_groups = NULL; |
| 48 |
|
| 49 |
int num_htree_groups, num_htree_groups_max, color_cache_bits; |
| 50 |
VP8LBitReader* br; |
| 51 |
VP8LDecoder* dec = VP8LNew(); |
| 52 |
if (dec == NULL) goto Error; |
| 53 |
br = &dec->br_; |
| 54 |
VP8LInitBitReader(br, data, size); |
| 55 |
|
| 56 |
color_cache_bits = VP8LReadBits(br, kColorCacheBitsBits); |
| 57 |
if (color_cache_bits < 1 || color_cache_bits > MAX_CACHE_BITS) goto Error; |
| 58 |
|
| 59 |
num_htree_groups = VP8LReadBits(br, kNumHtreeGroupsBits); |
| 60 |
// 'num_htree_groups' cannot be 0 as it is built from a non-empty image. |
| 61 |
if (num_htree_groups == 0) goto Error; |
| 62 |
// This variable is only useful when mapping is not NULL. |
| 63 |
num_htree_groups_max = num_htree_groups; |
| 64 |
(void)ReadHuffmanCodesHelper(color_cache_bits, num_htree_groups, |
| 65 |
num_htree_groups_max, mapping, dec, |
| 66 |
&huffman_tables, &htree_groups); |
| 67 |
|
| 68 |
Error: |
| 69 |
WebPSafeFree(mapping); |
| 70 |
VP8LHtreeGroupsFree(htree_groups); |
| 71 |
VP8LHuffmanTablesDeallocate(&huffman_tables); |
| 72 |
VP8LDelete(dec); |
| 73 |
} |
| 74 |
|
| 75 |
} // namespace |
| 76 |
|
| 77 |
FUZZ_TEST(Huffman, HuffmanTest).WithDomains(fuzztest::String()); |