We need to use tj3Alloc() (which, when ZERO_BUFFERS is defined, calls calloc() instead of malloc()) to allocate all destination buffers. Otherwise, if the compression/decompression/transform operation fails, then the buffer checksum (which is computed to prevent the compiler from optimizing out the whole test, since the destination buffer is never used otherwise) will depend upon values in the destination buffer that were never written, and MSan will complain.
169 lines
5.5 KiB
C++
169 lines
5.5 KiB
C++
/*
|
|
* Copyright (C)2021-2024 D. R. Commander. All Rights Reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* - Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* - 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.
|
|
* - Neither the name of the libjpeg-turbo Project 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 THE COPYRIGHT HOLDERS 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 THE COPYRIGHT HOLDERS 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 <turbojpeg.h>
|
|
#include <stdlib.h>
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
|
|
|
|
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size)
|
|
{
|
|
tjhandle handle = NULL;
|
|
unsigned char *dstBufs[1] = { NULL };
|
|
size_t dstSizes[1] = { 0 }, maxBufSize;
|
|
int width = 0, height = 0, jpegSubsamp, i;
|
|
tjtransform transforms[1];
|
|
|
|
if ((handle = tj3Init(TJINIT_TRANSFORM)) == NULL)
|
|
goto bailout;
|
|
|
|
/* We ignore the return value of tj3DecompressHeader(), because malformed
|
|
JPEG images that might expose issues in libjpeg-turbo might also have
|
|
header errors that cause tj3DecompressHeader() to fail. */
|
|
tj3DecompressHeader(handle, data, size);
|
|
width = tj3Get(handle, TJPARAM_JPEGWIDTH);
|
|
height = tj3Get(handle, TJPARAM_JPEGHEIGHT);
|
|
jpegSubsamp = tj3Get(handle, TJPARAM_SUBSAMP);
|
|
/* Let the transform options dictate the entropy coding algorithm. */
|
|
tj3Set(handle, TJPARAM_ARITHMETIC, 0);
|
|
tj3Set(handle, TJPARAM_PROGRESSIVE, 0);
|
|
tj3Set(handle, TJPARAM_OPTIMIZE, 0);
|
|
|
|
/* Ignore 0-pixel images and images larger than 1 Megapixel. Casting width
|
|
to (uint64_t) prevents integer overflow if width * height > INT_MAX. */
|
|
if (width < 1 || height < 1 || (uint64_t)width * height > 1048576)
|
|
goto bailout;
|
|
|
|
tj3Set(handle, TJPARAM_SCANLIMIT, 500);
|
|
|
|
if (jpegSubsamp < 0 || jpegSubsamp >= TJ_NUMSAMP)
|
|
jpegSubsamp = TJSAMP_444;
|
|
|
|
memset(&transforms[0], 0, sizeof(tjtransform));
|
|
|
|
transforms[0].op = TJXOP_NONE;
|
|
transforms[0].options = TJXOPT_PROGRESSIVE | TJXOPT_COPYNONE;
|
|
dstBufs[0] =
|
|
(unsigned char *)tj3Alloc(tj3JPEGBufSize(width, height, jpegSubsamp));
|
|
if (!dstBufs[0])
|
|
goto bailout;
|
|
|
|
maxBufSize = tj3JPEGBufSize(width, height, jpegSubsamp);
|
|
|
|
tj3Set(handle, TJPARAM_NOREALLOC, 1);
|
|
if (tj3Transform(handle, data, size, 1, dstBufs, dstSizes,
|
|
transforms) == 0) {
|
|
/* Touch all of the output pixels in order to catch uninitialized reads
|
|
when using MemorySanitizer. */
|
|
int sum = 0;
|
|
|
|
for (i = 0; i < dstSizes[0]; i++)
|
|
sum += dstBufs[0][i];
|
|
|
|
/* Prevent the code above from being optimized out. This test should
|
|
never be true, but the compiler doesn't know that. */
|
|
if (sum > 255 * maxBufSize)
|
|
goto bailout;
|
|
}
|
|
|
|
free(dstBufs[0]);
|
|
dstBufs[0] = NULL;
|
|
|
|
transforms[0].r.w = (height + 1) / 2;
|
|
transforms[0].r.h = (width + 1) / 2;
|
|
transforms[0].op = TJXOP_TRANSPOSE;
|
|
transforms[0].options = TJXOPT_GRAY | TJXOPT_CROP | TJXOPT_COPYNONE |
|
|
TJXOPT_OPTIMIZE;
|
|
dstBufs[0] =
|
|
(unsigned char *)tj3Alloc(tj3JPEGBufSize((height + 1) / 2, (width + 1) / 2,
|
|
jpegSubsamp));
|
|
if (!dstBufs[0])
|
|
goto bailout;
|
|
|
|
maxBufSize = tj3JPEGBufSize((height + 1) / 2, (width + 1) / 2, jpegSubsamp);
|
|
|
|
if (tj3Transform(handle, data, size, 1, dstBufs, dstSizes,
|
|
transforms) == 0) {
|
|
int sum = 0;
|
|
|
|
for (i = 0; i < dstSizes[0]; i++)
|
|
sum += dstBufs[0][i];
|
|
|
|
if (sum > 255 * maxBufSize)
|
|
goto bailout;
|
|
}
|
|
|
|
free(dstBufs[0]);
|
|
dstBufs[0] = NULL;
|
|
|
|
transforms[0].op = TJXOP_ROT90;
|
|
transforms[0].options = TJXOPT_TRIM | TJXOPT_ARITHMETIC;
|
|
dstBufs[0] =
|
|
(unsigned char *)tj3Alloc(tj3JPEGBufSize(height, width, jpegSubsamp));
|
|
if (!dstBufs[0])
|
|
goto bailout;
|
|
|
|
maxBufSize = tj3JPEGBufSize(height, width, jpegSubsamp);
|
|
|
|
if (tj3Transform(handle, data, size, 1, dstBufs, dstSizes,
|
|
transforms) == 0) {
|
|
int sum = 0;
|
|
|
|
for (i = 0; i < dstSizes[0]; i++)
|
|
sum += dstBufs[0][i];
|
|
|
|
if (sum > 255 * maxBufSize)
|
|
goto bailout;
|
|
}
|
|
|
|
free(dstBufs[0]);
|
|
dstBufs[0] = NULL;
|
|
|
|
transforms[0].op = TJXOP_NONE;
|
|
transforms[0].options = TJXOPT_PROGRESSIVE;
|
|
dstSizes[0] = 0;
|
|
|
|
tj3Set(handle, TJPARAM_NOREALLOC, 0);
|
|
if (tj3Transform(handle, data, size, 1, dstBufs, dstSizes,
|
|
transforms) == 0) {
|
|
int sum = 0;
|
|
|
|
for (i = 0; i < dstSizes[0]; i++)
|
|
sum += dstBufs[0][i];
|
|
|
|
if (sum > 255 * maxBufSize)
|
|
goto bailout;
|
|
}
|
|
|
|
bailout:
|
|
free(dstBufs[0]);
|
|
tj3Destroy(handle);
|
|
return 0;
|
|
}
|