summaryrefslogtreecommitdiff
path: root/lib/fuzzing/fuzz_lzxpress_huffman_compress.c
blob: d92131d3a8b2ee99ae3dfb9ee066fd9f59ae9c03 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/*
   Fuzzing for lzxpress_huffman_compress_talloc
   Copyright (C) Michael Hanselmann 2019
   Copyright (C) Douglas Bagnall 2022 <dbagnall@samba.org>

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 3 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#include "includes.h"
#include "fuzzing/fuzzing.h"
#include "compression/lzxpress_huffman.h"

int LLVMFuzzerInitialize(int *argc, char ***argv)
{
	return 0;
}


#define MAX_SIZE (1024 * 1024)

int LLVMFuzzerTestOneInput(uint8_t *buf, size_t len)
{
	static uint8_t *output;
	size_t output_len;
	TALLOC_CTX *mem_ctx = NULL;
	struct lzxhuff_compressor_mem cmp_mem;

	/*
	 * The round-trip fuzzer checks the compressor with an unconstrained
	 * output buffer; here we see what happens if the buffer is possibly too
	 * small.
	 */
	if (len < 3) {
		return 0;
	}
	output_len = MIN(MAX_SIZE, buf[0] | (buf[1] << 8) | (buf[2] << 16));
	buf += 3;
	len -= 3;
	mem_ctx = talloc_new(NULL);

	output = talloc_array(mem_ctx, uint8_t, output_len);

	lzxpress_huffman_compress(&cmp_mem, buf, len, output, output_len);

	talloc_free(mem_ctx);
	return 0;
}