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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/* Fuzz testing target. */
/*
* Copyright (c) 2023 Genome Research Ltd.
* Author(s): James Bonfield
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the names Genome Research Ltd and Wellcome Trust Sanger
* Institute nor the names of its contributors may be used to endorse
* or promote products derived from this software without specific
* prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY GENOME RESEARCH LTD AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GENOME RESEARCH
* LTD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#include <fcntl.h>
#include <ctype.h>
#include "htscodecs/fqzcomp_qual.h"
#ifndef MAX_REC
#define MAX_REC 5000
#endif
#ifndef MAX_SEQ
# define MAX_SEQ 5000
#endif
static unsigned int slice_len[MAX_REC];
static unsigned int slice_flags[MAX_REC];
static fqz_slice fixed_slice = {0};
fqz_slice *fake_slice(size_t buf_len, int nrec) {
fixed_slice.len = slice_len;
fixed_slice.flags = slice_flags;
fixed_slice.num_records = nrec;
// 1 long record
if (nrec == 1) {
slice_len[0] = buf_len;
slice_flags[0] = 0; // FIXME
return &fixed_slice;
}
// N 1-byte records
if (nrec == buf_len) {
int i;
for (i = 0; i < buf_len; i++) {
slice_len[i] = 1;
slice_flags[i] = 0; // FIXME
}
return &fixed_slice;
}
// Otherwise variable length records
// Reproducability of randomness
int seed = rand();
srand(0);
int nlen = buf_len/10+1;
int i, l, n = 0;
for (i = 0; i < buf_len; i+=l, n++) {
l = rand() % (nlen+1);
l += l==0;
slice_len[n] = i+l < buf_len ? l : buf_len-i;
slice_flags[n] = 0; // FIXME
}
fixed_slice.num_records = n;
srand(seed); // new random state
return &fixed_slice;
}
int LLVMFuzzerTestOneInput(uint8_t *in, size_t in_size) {
size_t c_size, u_size;
int mode = 0;
for (mode = 0; mode < 3; mode++) {
int mval[3] = {0,1,in_size};
fqz_slice *s = fake_slice(in_size, mval[mode]);
// Semi random strat, but based on a few bits of input data
// for reproducability.
// This lets the fuzzer explore the parameter space itself.
int strat = in_size ? in[0] & 3 : 0;
char *comp = fqz_compress(3, s, (char *)in, in_size, &c_size,
strat, NULL);
if (!comp) {
fprintf(stderr, "REJECT FQZ %d to (null)n", (int)in_size);
return -1;
}
char *uncomp = fqz_decompress(comp, c_size, &u_size, NULL, 0);
if (!uncomp)
abort();
if (in_size != u_size)
abort();
if (memcmp(uncomp, in, in_size) != 0)
abort();
free(comp);
free(uncomp);
}
return 0;
}
|
