8 /*----------------------------------------------------------------------------*\
9 * CRC-32 version 2.0.0 by Craig Bruce, 2006-04-29.
11 * This program generates the CRC-32 values for the files named in the
12 * command-line arguments. These are the same CRC-32 values used by GZIP,
13 * PKZIP, and ZMODEM. The Crc32_ComputeBuf () can also be detached and
16 * THIS PROGRAM IS PUBLIC-DOMAIN SOFTWARE.
18 * Based on the byte-oriented implementation "File Verification Using CRC"
19 * by Mark R. Nelson in Dr. Dobb's Journal, May 1992, pp. 64-67.
21 * v1.0.0: original release.
22 * v1.0.1: fixed printf formats.
23 * v1.0.2: fixed something else.
24 * v1.0.3: replaced CRC constant table by generator function.
25 * v1.0.4: reformatted code, made ANSI C. 1994-12-05.
26 * v2.0.0: rewrote to use memory buffer & static table, 2006-04-29.
27 \*----------------------------------------------------------------------------*/
29 /*----------------------------------------------------------------------------*\
31 * Crc32_ComputeBuf () - computes the CRC-32 value of a memory buffer
33 * Computes or accumulates the CRC-32 value for a memory buffer.
34 * The 'inCrc32' gives a previously accumulated CRC-32 value to allow
35 * a CRC to be generated for multiple sequential buffer-fuls of data.
36 * The 'inCrc32' for the first buffer must be zero.
38 * inCrc32 - accumulated CRC-32 value, must be 0 on first call
39 * buf - buffer to compute CRC-32 value for
40 * bufLen - number of bytes in buffer
42 * crc32 - computed CRC-32 value
44 * (no errors are possible)
45 \*----------------------------------------------------------------------------*/
48 compute_crc32 (uint32_t in_crc32,
52 static const uint32_t crc_table[256] = {
53 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F,
54 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988,
55 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2,
56 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
57 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9,
58 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172,
59 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C,
60 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
61 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423,
62 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924,
63 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106,
64 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
65 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D,
66 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E,
67 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950,
68 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
69 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7,
70 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0,
71 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA,
72 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
73 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81,
74 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A,
75 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84,
76 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
77 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB,
78 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC,
79 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E,
80 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
81 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55,
82 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236,
83 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28,
84 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
85 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F,
86 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38,
87 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242,
88 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
89 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69,
90 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2,
91 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC,
92 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
93 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693,
94 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94,
95 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
99 unsigned char * byte_buf;
102 /* accumulate crc32 for buffer */
103 crc32 = in_crc32 ^ 0xFFFFFFFF;
104 byte_buf = (unsigned char*) buf;
106 for (i = 0; i < buf_len; i++)
107 crc32 = (crc32 >> 8) ^ crc_table[(crc32 ^ byte_buf[i]) & 0xFF];
109 return (crc32 ^ 0xFFFFFFFF);
112 /* perform endian conversion of pixel data
115 image_endian_swap (pixman_image_t *img, int bpp)
117 int stride = pixman_image_get_stride (img);
118 uint32_t *data = pixman_image_get_data (img);
119 int height = pixman_image_get_height (img);
122 /* swap bytes only on big endian systems */
123 volatile uint16_t endian_check_var = 0x1234;
124 if (*(volatile uint8_t *)&endian_check_var != 0x12)
127 for (i = 0; i < height; i++)
129 uint8_t *line_data = (uint8_t *)data + stride * i;
130 /* swap bytes only for 16, 24 and 32 bpp for now */
134 for (j = 0; j < stride; j++)
137 ((line_data[j] & 0x80) >> 7) |
138 ((line_data[j] & 0x40) >> 5) |
139 ((line_data[j] & 0x20) >> 3) |
140 ((line_data[j] & 0x10) >> 1) |
141 ((line_data[j] & 0x08) << 1) |
142 ((line_data[j] & 0x04) << 3) |
143 ((line_data[j] & 0x02) << 5) |
144 ((line_data[j] & 0x01) << 7);
148 for (j = 0; j < stride; j++)
150 line_data[j] = (line_data[j] >> 4) | (line_data[j] << 4);
154 for (j = 0; j + 2 <= stride; j += 2)
156 char t1 = line_data[j + 0];
157 char t2 = line_data[j + 1];
159 line_data[j + 1] = t1;
160 line_data[j + 0] = t2;
164 for (j = 0; j + 3 <= stride; j += 3)
166 char t1 = line_data[j + 0];
167 char t2 = line_data[j + 1];
168 char t3 = line_data[j + 2];
170 line_data[j + 2] = t1;
171 line_data[j + 1] = t2;
172 line_data[j + 0] = t3;
176 for (j = 0; j + 4 <= stride; j += 4)
178 char t1 = line_data[j + 0];
179 char t2 = line_data[j + 1];
180 char t3 = line_data[j + 2];
181 char t4 = line_data[j + 3];
183 line_data[j + 3] = t1;
184 line_data[j + 2] = t2;
185 line_data[j + 1] = t3;
186 line_data[j + 0] = t4;
196 make_random_bytes (int n_bytes)
198 uint8_t *bytes = malloc (n_bytes);
204 for (i = 0; i < n_bytes; ++i)
205 bytes[i] = lcg_rand () & 0xff;
211 * A function, which can be used as a core part of the test programs,
212 * intended to detect various problems with the help of fuzzing input
213 * to pixman API (according to some templates, aka "smart" fuzzing).
214 * Some general information about such testing can be found here:
215 * http://en.wikipedia.org/wiki/Fuzz_testing
217 * It may help detecting:
218 * - crashes on bad handling of valid or reasonably invalid input to
220 * - deviations from the behavior of older pixman releases.
221 * - deviations from the behavior of the same pixman release, but
222 * configured in a different way (for example with SIMD optimizations
223 * disabled), or running on a different OS or hardware.
225 * The test is performed by calling a callback function a huge number
226 * of times. The callback function is expected to run some snippet of
227 * pixman code with pseudorandom variations to the data feeded to
228 * pixman API. A result of running each callback function should be
229 * some deterministic value which depends on test number (test number
230 * can be used as a seed for PRNG). When 'verbose' argument is nonzero,
231 * callback function is expected to print to stdout some information
232 * about what it does.
234 * Return values from many small tests are accumulated together and
235 * used as final checksum, which can be compared to some expected
236 * value. Running the tests not individually, but in a batch helps
237 * to reduce process start overhead and also allows to parallelize
238 * testing and utilize multiple CPU cores.
240 * The resulting executable can be run without any arguments. In
241 * this case it runs a batch of tests starting from 1 and up to
242 * 'default_number_of_iterations'. The resulting checksum is
243 * compared with 'expected_checksum' and FAIL or PASS verdict
244 * depends on the result of this comparison.
246 * If the executable is run with 2 numbers provided as command line
247 * arguments, they specify the starting and ending numbers for a test
250 * If the executable is run with only one number provided as a command
251 * line argument, then this number is used to call the callback function
252 * once, and also with verbose flag set.
255 fuzzer_test_main (const char *test_name,
256 int default_number_of_iterations,
257 uint32_t expected_checksum,
258 uint32_t (*test_function)(int testnum, int verbose),
262 int i, n1 = 1, n2 = 0;
263 uint32_t checksum = 0;
264 int verbose = getenv ("VERBOSE") != NULL;
272 printf ("invalid test range\n");
279 checksum = test_function (n2, 1);
280 printf ("%d: checksum=%08X\n", n2, checksum);
286 n2 = default_number_of_iterations;
290 #pragma omp parallel for reduction(+:checksum) default(none) \
291 shared(n1, n2, test_function, verbose)
293 for (i = n1; i <= n2; i++)
295 uint32_t crc = test_function (i, 0);
297 printf ("%d: %08X\n", i, crc);
301 if (n1 == 1 && n2 == default_number_of_iterations)
303 if (checksum == expected_checksum)
305 printf ("%s test passed (checksum=%08X)\n",
306 test_name, checksum);
310 printf ("%s test failed! (checksum=%08X, expected %08X)\n",
311 test_name, checksum, expected_checksum);
317 printf ("%d-%d: checksum=%08X\n", n1, n2, checksum);