1*0ac9a9daSXin Li
2*0ac9a9daSXin Li /* A test program written to test robustness to decompression of
3*0ac9a9daSXin Li corrupted data. Usage is
4*0ac9a9daSXin Li unzcrash filename
5*0ac9a9daSXin Li and the program will read the specified file, compress it (in memory),
6*0ac9a9daSXin Li and then repeatedly decompress it, each time with a different bit of
7*0ac9a9daSXin Li the compressed data inverted, so as to test all possible one-bit errors.
8*0ac9a9daSXin Li This should not cause any invalid memory accesses. If it does,
9*0ac9a9daSXin Li I want to know about it!
10*0ac9a9daSXin Li
11*0ac9a9daSXin Li PS. As you can see from the above description, the process is
12*0ac9a9daSXin Li incredibly slow. A file of size eg 5KB will cause it to run for
13*0ac9a9daSXin Li many hours.
14*0ac9a9daSXin Li */
15*0ac9a9daSXin Li
16*0ac9a9daSXin Li /* ------------------------------------------------------------------
17*0ac9a9daSXin Li This file is part of bzip2/libbzip2, a program and library for
18*0ac9a9daSXin Li lossless, block-sorting data compression.
19*0ac9a9daSXin Li
20*0ac9a9daSXin Li bzip2/libbzip2 version 1.0.8 of 13 July 2019
21*0ac9a9daSXin Li Copyright (C) 1996-2019 Julian Seward <[email protected]>
22*0ac9a9daSXin Li
23*0ac9a9daSXin Li Please read the WARNING, DISCLAIMER and PATENTS sections in the
24*0ac9a9daSXin Li README file.
25*0ac9a9daSXin Li
26*0ac9a9daSXin Li This program is released under the terms of the license contained
27*0ac9a9daSXin Li in the file LICENSE.
28*0ac9a9daSXin Li ------------------------------------------------------------------ */
29*0ac9a9daSXin Li
30*0ac9a9daSXin Li
31*0ac9a9daSXin Li #include <stdio.h>
32*0ac9a9daSXin Li #include <assert.h>
33*0ac9a9daSXin Li #include "bzlib.h"
34*0ac9a9daSXin Li
35*0ac9a9daSXin Li #define M_BLOCK 1000000
36*0ac9a9daSXin Li
37*0ac9a9daSXin Li typedef unsigned char uchar;
38*0ac9a9daSXin Li
39*0ac9a9daSXin Li #define M_BLOCK_OUT (M_BLOCK + 1000000)
40*0ac9a9daSXin Li uchar inbuf[M_BLOCK];
41*0ac9a9daSXin Li uchar outbuf[M_BLOCK_OUT];
42*0ac9a9daSXin Li uchar zbuf[M_BLOCK + 600 + (M_BLOCK / 100)];
43*0ac9a9daSXin Li
44*0ac9a9daSXin Li int nIn, nOut, nZ;
45*0ac9a9daSXin Li
46*0ac9a9daSXin Li static char *bzerrorstrings[] = {
47*0ac9a9daSXin Li "OK"
48*0ac9a9daSXin Li ,"SEQUENCE_ERROR"
49*0ac9a9daSXin Li ,"PARAM_ERROR"
50*0ac9a9daSXin Li ,"MEM_ERROR"
51*0ac9a9daSXin Li ,"DATA_ERROR"
52*0ac9a9daSXin Li ,"DATA_ERROR_MAGIC"
53*0ac9a9daSXin Li ,"IO_ERROR"
54*0ac9a9daSXin Li ,"UNEXPECTED_EOF"
55*0ac9a9daSXin Li ,"OUTBUFF_FULL"
56*0ac9a9daSXin Li ,"???" /* for future */
57*0ac9a9daSXin Li ,"???" /* for future */
58*0ac9a9daSXin Li ,"???" /* for future */
59*0ac9a9daSXin Li ,"???" /* for future */
60*0ac9a9daSXin Li ,"???" /* for future */
61*0ac9a9daSXin Li ,"???" /* for future */
62*0ac9a9daSXin Li };
63*0ac9a9daSXin Li
flip_bit(int bit)64*0ac9a9daSXin Li void flip_bit ( int bit )
65*0ac9a9daSXin Li {
66*0ac9a9daSXin Li int byteno = bit / 8;
67*0ac9a9daSXin Li int bitno = bit % 8;
68*0ac9a9daSXin Li uchar mask = 1 << bitno;
69*0ac9a9daSXin Li //fprintf ( stderr, "(byte %d bit %d mask %d)",
70*0ac9a9daSXin Li // byteno, bitno, (int)mask );
71*0ac9a9daSXin Li zbuf[byteno] ^= mask;
72*0ac9a9daSXin Li }
73*0ac9a9daSXin Li
main(int argc,char ** argv)74*0ac9a9daSXin Li int main ( int argc, char** argv )
75*0ac9a9daSXin Li {
76*0ac9a9daSXin Li FILE* f;
77*0ac9a9daSXin Li int r;
78*0ac9a9daSXin Li int bit;
79*0ac9a9daSXin Li int i;
80*0ac9a9daSXin Li
81*0ac9a9daSXin Li if (argc != 2) {
82*0ac9a9daSXin Li fprintf ( stderr, "usage: unzcrash filename\n" );
83*0ac9a9daSXin Li return 1;
84*0ac9a9daSXin Li }
85*0ac9a9daSXin Li
86*0ac9a9daSXin Li f = fopen ( argv[1], "r" );
87*0ac9a9daSXin Li if (!f) {
88*0ac9a9daSXin Li fprintf ( stderr, "unzcrash: can't open %s\n", argv[1] );
89*0ac9a9daSXin Li return 1;
90*0ac9a9daSXin Li }
91*0ac9a9daSXin Li
92*0ac9a9daSXin Li nIn = fread ( inbuf, 1, M_BLOCK, f );
93*0ac9a9daSXin Li fprintf ( stderr, "%d bytes read\n", nIn );
94*0ac9a9daSXin Li
95*0ac9a9daSXin Li nZ = M_BLOCK;
96*0ac9a9daSXin Li r = BZ2_bzBuffToBuffCompress (
97*0ac9a9daSXin Li zbuf, &nZ, inbuf, nIn, 9, 0, 30 );
98*0ac9a9daSXin Li
99*0ac9a9daSXin Li assert (r == BZ_OK);
100*0ac9a9daSXin Li fprintf ( stderr, "%d after compression\n", nZ );
101*0ac9a9daSXin Li
102*0ac9a9daSXin Li for (bit = 0; bit < nZ*8; bit++) {
103*0ac9a9daSXin Li fprintf ( stderr, "bit %d ", bit );
104*0ac9a9daSXin Li flip_bit ( bit );
105*0ac9a9daSXin Li nOut = M_BLOCK_OUT;
106*0ac9a9daSXin Li r = BZ2_bzBuffToBuffDecompress (
107*0ac9a9daSXin Li outbuf, &nOut, zbuf, nZ, 0, 0 );
108*0ac9a9daSXin Li fprintf ( stderr, " %d %s ", r, bzerrorstrings[-r] );
109*0ac9a9daSXin Li
110*0ac9a9daSXin Li if (r != BZ_OK) {
111*0ac9a9daSXin Li fprintf ( stderr, "\n" );
112*0ac9a9daSXin Li } else {
113*0ac9a9daSXin Li if (nOut != nIn) {
114*0ac9a9daSXin Li fprintf(stderr, "nIn/nOut mismatch %d %d\n", nIn, nOut );
115*0ac9a9daSXin Li return 1;
116*0ac9a9daSXin Li } else {
117*0ac9a9daSXin Li for (i = 0; i < nOut; i++)
118*0ac9a9daSXin Li if (inbuf[i] != outbuf[i]) {
119*0ac9a9daSXin Li fprintf(stderr, "mismatch at %d\n", i );
120*0ac9a9daSXin Li return 1;
121*0ac9a9daSXin Li }
122*0ac9a9daSXin Li if (i == nOut) fprintf(stderr, "really ok!\n" );
123*0ac9a9daSXin Li }
124*0ac9a9daSXin Li }
125*0ac9a9daSXin Li
126*0ac9a9daSXin Li flip_bit ( bit );
127*0ac9a9daSXin Li }
128*0ac9a9daSXin Li
129*0ac9a9daSXin Li #if 0
130*0ac9a9daSXin Li assert (nOut == nIn);
131*0ac9a9daSXin Li for (i = 0; i < nOut; i++) {
132*0ac9a9daSXin Li if (inbuf[i] != outbuf[i]) {
133*0ac9a9daSXin Li fprintf ( stderr, "difference at %d !\n", i );
134*0ac9a9daSXin Li return 1;
135*0ac9a9daSXin Li }
136*0ac9a9daSXin Li }
137*0ac9a9daSXin Li #endif
138*0ac9a9daSXin Li
139*0ac9a9daSXin Li fprintf ( stderr, "all ok\n" );
140*0ac9a9daSXin Li return 0;
141*0ac9a9daSXin Li }
142