/src/libjpeg-turbo.main/fuzz/transform.cc
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright (C)2021-2025 D. R. Commander. All Rights Reserved. |
3 | | * |
4 | | * Redistribution and use in source and binary forms, with or without |
5 | | * modification, are permitted provided that the following conditions are met: |
6 | | * |
7 | | * - Redistributions of source code must retain the above copyright notice, |
8 | | * this list of conditions and the following disclaimer. |
9 | | * - Redistributions in binary form must reproduce the above copyright notice, |
10 | | * this list of conditions and the following disclaimer in the documentation |
11 | | * and/or other materials provided with the distribution. |
12 | | * - Neither the name of the libjpeg-turbo Project nor the names of its |
13 | | * contributors may be used to endorse or promote products derived from this |
14 | | * software without specific prior written permission. |
15 | | * |
16 | | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS", |
17 | | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
18 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
19 | | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE |
20 | | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
21 | | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
22 | | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
23 | | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
24 | | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
25 | | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
26 | | * POSSIBILITY OF SUCH DAMAGE. |
27 | | */ |
28 | | |
29 | | #include <turbojpeg.h> |
30 | | #include <stdlib.h> |
31 | | #include <stdint.h> |
32 | | #include <string.h> |
33 | | |
34 | | |
35 | | extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) |
36 | 5.74k | { |
37 | 5.74k | tjhandle handle = NULL; |
38 | 5.74k | unsigned char *dstBufs[1] = { NULL }; |
39 | 5.74k | size_t dstSizes[1] = { 0 }, maxBufSize, i; |
40 | 5.74k | int width = 0, height = 0, jpegSubsamp; |
41 | 5.74k | tjtransform transforms[1]; |
42 | | |
43 | 5.74k | if ((handle = tj3Init(TJINIT_TRANSFORM)) == NULL) |
44 | 0 | goto bailout; |
45 | | |
46 | | /* We ignore the return value of tj3DecompressHeader(), because malformed |
47 | | JPEG images that might expose issues in libjpeg-turbo might also have |
48 | | header errors that cause tj3DecompressHeader() to fail. */ |
49 | 5.74k | tj3DecompressHeader(handle, data, size); |
50 | 5.74k | width = tj3Get(handle, TJPARAM_JPEGWIDTH); |
51 | 5.74k | height = tj3Get(handle, TJPARAM_JPEGHEIGHT); |
52 | 5.74k | jpegSubsamp = tj3Get(handle, TJPARAM_SUBSAMP); |
53 | | /* Let the transform options dictate the entropy coding algorithm. */ |
54 | 5.74k | tj3Set(handle, TJPARAM_ARITHMETIC, 0); |
55 | 5.74k | tj3Set(handle, TJPARAM_PROGRESSIVE, 0); |
56 | 5.74k | tj3Set(handle, TJPARAM_OPTIMIZE, 0); |
57 | | |
58 | | /* Ignore 0-pixel images and images larger than 1 Megapixel. Casting width |
59 | | to (uint64_t) prevents integer overflow if width * height > INT_MAX. */ |
60 | 5.74k | if (width < 1 || height < 1 || (uint64_t)width * height > 1048576) |
61 | 1.70k | goto bailout; |
62 | | |
63 | 4.04k | tj3Set(handle, TJPARAM_SCANLIMIT, 500); |
64 | | |
65 | 4.04k | if (jpegSubsamp < 0 || jpegSubsamp >= TJ_NUMSAMP) |
66 | 504 | jpegSubsamp = TJSAMP_444; |
67 | | |
68 | 4.04k | memset(&transforms[0], 0, sizeof(tjtransform)); |
69 | | |
70 | 4.04k | transforms[0].op = TJXOP_NONE; |
71 | 4.04k | transforms[0].options = TJXOPT_PROGRESSIVE | TJXOPT_COPYNONE; |
72 | 4.04k | dstSizes[0] = maxBufSize = tj3TransformBufSize(handle, &transforms[0]); |
73 | 4.04k | if (dstSizes[0] == 0 || |
74 | 4.04k | (dstBufs[0] = (unsigned char *)tj3Alloc(dstSizes[0])) == NULL) |
75 | 0 | goto bailout; |
76 | | |
77 | 4.04k | tj3Set(handle, TJPARAM_NOREALLOC, 1); |
78 | 4.04k | if (tj3Transform(handle, data, size, 1, dstBufs, dstSizes, |
79 | 4.04k | transforms) == 0) { |
80 | | /* Touch all of the output pixels in order to catch uninitialized reads |
81 | | when using MemorySanitizer. */ |
82 | 61 | size_t sum = 0; |
83 | | |
84 | 454k | for (i = 0; i < dstSizes[0]; i++) |
85 | 454k | sum += dstBufs[0][i]; |
86 | | |
87 | | /* Prevent the code above from being optimized out. This test should |
88 | | never be true, but the compiler doesn't know that. */ |
89 | 61 | if (sum > 255 * maxBufSize) |
90 | 0 | goto bailout; |
91 | 61 | } |
92 | | |
93 | 4.04k | free(dstBufs[0]); |
94 | 4.04k | dstBufs[0] = NULL; |
95 | | |
96 | 4.04k | transforms[0].r.w = (height + 1) / 2; |
97 | 4.04k | transforms[0].r.h = (width + 1) / 2; |
98 | 4.04k | transforms[0].op = TJXOP_TRANSPOSE; |
99 | 4.04k | transforms[0].options = TJXOPT_GRAY | TJXOPT_CROP | TJXOPT_COPYNONE | |
100 | 4.04k | TJXOPT_OPTIMIZE; |
101 | 4.04k | dstSizes[0] = maxBufSize = tj3TransformBufSize(handle, &transforms[0]); |
102 | 4.04k | if (dstSizes[0] == 0 || |
103 | 4.04k | (dstBufs[0] = (unsigned char *)tj3Alloc(dstSizes[0])) == NULL) |
104 | 0 | goto bailout; |
105 | | |
106 | 4.04k | if (tj3Transform(handle, data, size, 1, dstBufs, dstSizes, |
107 | 4.04k | transforms) == 0) { |
108 | 43 | size_t sum = 0; |
109 | | |
110 | 169k | for (i = 0; i < dstSizes[0]; i++) |
111 | 169k | sum += dstBufs[0][i]; |
112 | | |
113 | 43 | if (sum > 255 * maxBufSize) |
114 | 0 | goto bailout; |
115 | 43 | } |
116 | | |
117 | 4.04k | free(dstBufs[0]); |
118 | 4.04k | dstBufs[0] = NULL; |
119 | | |
120 | 4.04k | transforms[0].op = TJXOP_ROT90; |
121 | 4.04k | transforms[0].options = TJXOPT_TRIM | TJXOPT_ARITHMETIC; |
122 | 4.04k | dstSizes[0] = maxBufSize = tj3TransformBufSize(handle, &transforms[0]); |
123 | 4.04k | if (dstSizes[0] == 0 || |
124 | 4.04k | (dstBufs[0] = (unsigned char *)tj3Alloc(dstSizes[0])) == NULL) |
125 | 0 | goto bailout; |
126 | | |
127 | 4.04k | if (tj3Transform(handle, data, size, 1, dstBufs, dstSizes, |
128 | 4.04k | transforms) == 0) { |
129 | 69 | size_t sum = 0; |
130 | | |
131 | 805k | for (i = 0; i < dstSizes[0]; i++) |
132 | 805k | sum += dstBufs[0][i]; |
133 | | |
134 | 69 | if (sum > 255 * maxBufSize) |
135 | 0 | goto bailout; |
136 | 69 | } |
137 | | |
138 | 4.04k | free(dstBufs[0]); |
139 | 4.04k | dstBufs[0] = NULL; |
140 | | |
141 | 4.04k | transforms[0].op = TJXOP_NONE; |
142 | 4.04k | transforms[0].options = TJXOPT_PROGRESSIVE; |
143 | 4.04k | dstSizes[0] = 0; |
144 | | |
145 | 4.04k | tj3Set(handle, TJPARAM_NOREALLOC, 0); |
146 | 4.04k | if (tj3Transform(handle, data, size, 1, dstBufs, dstSizes, |
147 | 4.04k | transforms) == 0) { |
148 | 60 | size_t sum = 0; |
149 | | |
150 | 453k | for (i = 0; i < dstSizes[0]; i++) |
151 | 453k | sum += dstBufs[0][i]; |
152 | | |
153 | 60 | if (sum > 255 * maxBufSize) |
154 | 0 | goto bailout; |
155 | 60 | } |
156 | | |
157 | 5.74k | bailout: |
158 | 5.74k | free(dstBufs[0]); |
159 | 5.74k | tj3Destroy(handle); |
160 | 5.74k | return 0; |
161 | 4.04k | } |