You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
55 lines
1.6 KiB
55 lines
1.6 KiB
4 months ago
|
/*
|
||
|
|
* Copyright 2018 Google, LLC
|
||
|
|
*
|
||
|
|
* Use of this source code is governed by a BSD-style license that can be
|
||
|
|
* found in the LICENSE file.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "SkBitmap.h"
|
||
|
|
#include "SkCodec.h"
|
||
|
|
#include "SkData.h"
|
||
|
|
|
||
|
|
bool FuzzIncrementalImageDecode(sk_sp<SkData> bytes) {
|
||
|
|
auto codec = SkCodec::MakeFromData(bytes);
|
||
|
|
if (!codec) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
SkBitmap bm;
|
||
|
|
if (!bm.tryAllocPixels(codec->getInfo())) {
|
||
|
|
// May fail in memory-constrained fuzzing environments
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
auto result = codec->startIncrementalDecode(bm.info(), bm.getPixels(), bm.rowBytes());
|
||
|
|
if (result != SkCodec::kSuccess) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
// Deliberately uninitialized to verify that incrementalDecode initializes it when it
|
||
|
|
// returns kIncompleteInput or kErrorInInput.
|
||
|
|
int rowsDecoded;
|
||
|
|
result = codec->incrementalDecode(&rowsDecoded);
|
||
|
|
switch (result) {
|
||
|
|
case SkCodec::kIncompleteInput:
|
||
|
|
case SkCodec::kErrorInInput:
|
||
|
|
if (rowsDecoded < bm.height()) {
|
||
|
|
void* dst = SkTAddOffset<void>(bm.getPixels(), rowsDecoded * bm.rowBytes());
|
||
|
|
sk_bzero(dst, (bm.height() - rowsDecoded) * bm.rowBytes());
|
||
|
|
}
|
||
|
|
return true; // decoded a partial image
|
||
|
|
case SkCodec::kSuccess:
|
||
|
|
return true;
|
||
|
|
default:
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#if defined(IS_FUZZING_WITH_LIBFUZZER)
|
||
|
|
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
|
||
|
|
auto bytes = SkData::MakeWithoutCopy(data, size);
|
||
|
|
FuzzIncrementalImageDecode(bytes);
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
#endif
|