Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 /* | |
| 2 * Copyright (C) 2006 Apple Computer, Inc. | |
| 3 * Copyright (C) Research In Motion Limited 2009-2010. All rights reserved. | |
| 4 * | |
| 5 * Portions are Copyright (C) 2001 mozilla.org | |
| 6 * | |
| 7 * Other contributors: | |
| 8 * Stuart Parmenter <stuart@mozilla.com> | |
| 9 * | |
| 10 * This library is free software; you can redistribute it and/or | |
| 11 * modify it under the terms of the GNU Lesser General Public | |
| 12 * License as published by the Free Software Foundation; either | |
| 13 * version 2.1 of the License, or (at your option) any later version. | |
| 14 * | |
| 15 * This library is distributed in the hope that it will be useful, | |
| 16 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 18 * Lesser General Public License for more details. | |
| 19 * | |
| 20 * You should have received a copy of the GNU Lesser General Public | |
| 21 * License along with this library; if not, write to the Free Software | |
| 22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 US A | |
| 23 * | |
| 24 * Alternatively, the contents of this file may be used under the terms | |
| 25 * of either the Mozilla Public License Version 1.1, found at | |
| 26 * http://www.mozilla.org/MPL/ (the "MPL") or the GNU General Public | |
| 27 * License Version 2.0, found at http://www.fsf.org/copyleft/gpl.html | |
| 28 * (the "GPL"), in which case the provisions of the MPL or the GPL are | |
| 29 * applicable instead of those above. If you wish to allow use of your | |
| 30 * version of this file only under the terms of one of those two | |
| 31 * licenses (the MPL or the GPL) and not to allow others to use your | |
| 32 * version of this file under the LGPL, indicate your decision by | |
| 33 * deletingthe provisions above and replace them with the notice and | |
| 34 * other provisions required by the MPL or the GPL, as the case may be. | |
| 35 * If you do not delete the provisions above, a recipient may use your | |
| 36 * version of this file under any of the LGPL, the MPL or the GPL. | |
| 37 */ | |
| 38 | |
| 39 #include "platform/image-decoders/png/PNGImageReader.h" | |
| 40 | |
| 41 #include "platform/image-decoders/png/PNGImageDecoder.h" | |
| 42 #include "platform/image-decoders/FastSharedBufferReader.h" | |
| 43 #include "png.h" | |
| 44 #include "wtf/PtrUtil.h" | |
| 45 #include <memory> | |
| 46 | |
| 47 #if !defined(PNG_LIBPNG_VER_MAJOR) || !defined(PNG_LIBPNG_VER_MINOR) | |
| 48 #error version error: compile against a versioned libpng. | |
| 49 #endif | |
| 50 #if USE(QCMSLIB) | |
| 51 #include "qcms.h" | |
| 52 #endif | |
| 53 | |
| 54 #if PNG_LIBPNG_VER_MAJOR > 1 || (PNG_LIBPNG_VER_MAJOR == 1 && PNG_LIBPNG_VER_MIN OR >= 4) | |
| 55 #define JMPBUF(png_ptr) png_jmpbuf(png_ptr) | |
| 56 #else | |
| 57 #define JMPBUF(png_ptr) png_ptr->jmpbuf | |
| 58 #endif | |
| 59 | |
| 60 namespace { | |
| 61 | |
| 62 inline blink::PNGImageDecoder* imageDecoder(png_structp png) | |
| 63 { | |
| 64 return static_cast<blink::PNGImageDecoder*>(png_get_progressive_ptr(png)); | |
| 65 } | |
| 66 | |
| 67 void PNGAPI pngHeaderAvailable(png_structp png, png_infop) | |
| 68 { | |
| 69 imageDecoder(png)->headerAvailable(); | |
| 70 } | |
| 71 | |
| 72 void PNGAPI pngRowAvailable(png_structp png, png_bytep row, | |
| 73 png_uint_32 rowIndex, int state) | |
| 74 { | |
| 75 imageDecoder(png)->rowAvailable(row, rowIndex, state); | |
| 76 } | |
| 77 | |
| 78 void PNGAPI pngComplete(png_structp png, png_infop) | |
| 79 { | |
| 80 imageDecoder(png)->complete(); | |
| 81 } | |
| 82 | |
| 83 void PNGAPI pngFailed(png_structp png, png_const_charp err) | |
| 84 { | |
| 85 longjmp(JMPBUF(png), 1); | |
| 86 } | |
| 87 | |
| 88 } // namespace | |
| 89 | |
| 90 namespace blink { | |
| 91 | |
| 92 // This is the callback function for unknown PNG chunks, which is used to | |
| 93 // extract the animation chunks. | |
| 94 static int readAnimationChunk(png_structp png_ptr, png_unknown_chunkp chunk) | |
| 95 { | |
| 96 PNGImageReader* reader = (PNGImageReader*) png_get_user_chunk_ptr(png_ptr); | |
| 97 reader->parseAnimationChunk((const char*) chunk->name, chunk->data, | |
| 98 chunk->size); | |
| 99 return 1; | |
| 100 } | |
| 101 | |
| 102 PNGImageReader::PNGImageReader(PNGImageDecoder* decoder, size_t initialOffset) | |
| 103 : m_decoder(decoder) | |
| 104 , m_initialOffset(initialOffset) | |
| 105 , m_readOffset(initialOffset) | |
| 106 , m_progressiveDecodeOffset(0) | |
| 107 , m_idatOffset(0) | |
| 108 , m_hasAlpha(false) | |
| 109 , m_idatIsPartOfAnimation(false) | |
| 110 , m_isAnimated(false) | |
| 111 , m_parsedSignature(false) | |
| 112 , m_parseCompleted(false) | |
| 113 #if USE(QCMSLIB) | |
| 114 , m_rowBuffer() | |
| 115 #endif | |
| 116 { | |
| 117 m_png = png_create_read_struct(PNG_LIBPNG_VER_STRING, 0, pngFailed, 0); | |
| 118 m_info = png_create_info_struct(m_png); | |
| 119 png_set_progressive_read_fn(m_png, m_decoder, pngHeaderAvailable, | |
| 120 pngRowAvailable, pngComplete); | |
| 121 | |
| 122 // Keep the chunks which are of interest for APNG. We don't need to keep | |
| 123 // the fdAT chunks, since they are converted to IDAT's by the frame decoder. | |
| 124 png_byte apngChunks[] = {"acTL\0fcTL\0"}; | |
| 125 png_set_keep_unknown_chunks(m_png, PNG_HANDLE_CHUNK_NEVER, apngChunks, 2); | |
| 126 png_set_read_user_chunk_fn(m_png, (png_voidp) this, readAnimationChunk); | |
| 127 } | |
| 128 | |
| 129 PNGImageReader::~PNGImageReader() | |
| 130 { | |
| 131 png_destroy_read_struct(m_png ? &m_png : 0, m_info ? &m_info : 0, 0); | |
| 132 ASSERT(!m_png && !m_info); | |
| 133 } | |
| 134 | |
| 135 // This method reads from the FastSharedBufferReader, starting at offset, | |
| 136 // and returns |length| bytes in the form of a pointer to a const png_byte*. | |
| 137 // This function is used to make it easy to access data from the reader in a | |
| 138 // png friendly way, and pass it to libpng for decoding. | |
| 139 // | |
| 140 // Pre-conditions before using this: | |
| 141 // - |reader|.size() >= |readOffset| + |length| | |
| 142 // - |buffer|.size() >= |length| | |
| 143 // - |length| <= |kBufferSize| | |
| 144 // | |
| 145 // The reason for the last two precondition is that currently the png signature | |
| 146 // plus IHDR chunk (8B + 25B = 33B) is the largest chunk that is read using this | |
| 147 // method. If the data is not consecutive, it is stored in |buffer|, which must | |
| 148 // have the size of (at least) |length|, but there's no need for it to be larger | |
| 149 // than |kBufferSize|. | |
| 150 static constexpr size_t kBufferSize = 33; | |
| 151 const png_byte* readAsConstPngBytep(const FastSharedBufferReader& reader, | |
| 152 size_t readOffset, size_t length, | |
| 153 char* buffer) | |
| 154 { | |
| 155 ASSERT(length <= kBufferSize); | |
| 156 return reinterpret_cast<const png_byte*>( | |
| 157 reader.getConsecutiveData(readOffset, length, buffer)); | |
| 158 } | |
| 159 | |
| 160 // This is used as a value for the byteLength of a frameInfo struct to | |
| 161 // indicate that it is the first frame, and we still need to set byteLength | |
| 162 // to the correct value as soon as the parser knows it. 1 is a safe value | |
| 163 // since the byteLength field of a frame is at least 12, in the case of an | |
| 164 // empty fdAT or IDAT chunk. | |
| 165 static constexpr size_t kFirstFrameIndicator = 1; | |
| 166 | |
| 167 void PNGImageReader::decode(SegmentReader& data, size_t index) | |
| 168 { | |
| 169 if (index >= m_frameInfo.size()) | |
| 170 return; | |
| 171 | |
| 172 // When decoding by libpng fails in either the non-animated branch or the | |
| 173 // animated branch, the decoder needs to be set to the failed state. | |
| 174 if (setjmp(JMPBUF(m_png))) { | |
| 175 m_decoder->setFailed(); | |
| 176 return; | |
| 177 } | |
| 178 | |
| 179 // For non animated PNGs, resume decoding where we left off in parse(), at | |
| 180 // the beginning of the IDAT chunk. Recreating a png struct would either | |
| 181 // result in wasted work, by reprocessing all header bytes, or decoding the | |
| 182 // wrong data. | |
| 183 if (!m_isAnimated) { | |
| 184 m_progressiveDecodeOffset += processData( | |
| 185 data, m_frameInfo[0].startOffset + m_progressiveDecodeOffset, 0); | |
| 186 return; | |
| 187 } | |
| 188 | |
| 189 // Progressive decoding is only done if both of the following are true: | |
| 190 // - It is the first frame, thus |index| == 0, AND | |
| 191 // - The byteLength of the first frame is not yet known, *or* it is known | |
| 192 // but we're only partway in a progressive decode, started earlier. | |
| 193 bool firstFrameLengthKnown = m_frameInfo[0].byteLength | |
| 194 != kFirstFrameIndicator; | |
| 195 bool progressiveDecodingAlreadyStarted = m_progressiveDecodeOffset > 0; | |
| 196 bool progressiveDecode = (index == 0 | |
| 197 && (!firstFrameLengthKnown || progressiveDecodingAlreadyStarted)); | |
| 198 | |
| 199 // Initialize a new png struct for this frame. For a progressive decode of | |
| 200 // the first frame, we only need to do this once. | |
| 201 // @FIXME(joostouwerling) check if the existing png struct can be reused. | |
| 202 if (!progressiveDecode || !progressiveDecodingAlreadyStarted) | |
| 203 startFrameDecoding(data, index); | |
| 204 | |
| 205 bool decodedFrameCompletely; | |
| 206 if (progressiveDecode) { | |
| 207 decodedFrameCompletely = progressivelyDecodeFirstFrame(data); | |
| 208 // If progressive decoding processed all data for this frame, reset | |
| 209 // |m_progressiveDecodeOffset|, so |progressiveDecodingAlreadyStarted| | |
| 210 // will be false for later calls to decode frame 0. | |
| 211 if (decodedFrameCompletely) | |
| 212 m_progressiveDecodeOffset = 0; | |
| 213 } else { | |
| 214 decodeFrame(data, index); | |
| 215 // For a non-progressive decode, we already have all the data we are | |
| 216 // going to get, so consider the frame complete. | |
| 217 decodedFrameCompletely = true; | |
| 218 } | |
| 219 | |
| 220 // Send the IEND chunk if the frame is completely decoded, so the complete | |
| 221 // callback in |m_decoder| will be called. | |
| 222 if (decodedFrameCompletely) | |
| 223 endFrameDecoding(); | |
| 224 } | |
| 225 | |
| 226 void PNGImageReader::startFrameDecoding(SegmentReader& data, size_t index) | |
| 227 { | |
| 228 // Each frame is processed as if it were a complete, single frame png image. | |
| 229 // To accomplish this, destroy the current |m_png| and |m_info| structs and | |
| 230 // create new ones. CRC errors are ignored, so fdAT chunks can be processed | |
| 231 // as IDATs without recalculating the CRC value. | |
| 232 png_destroy_read_struct(m_png ? &m_png : 0, m_info ? &m_info : 0, 0); | |
| 233 m_png = png_create_read_struct(PNG_LIBPNG_VER_STRING, 0, pngFailed, 0); | |
| 234 m_info = png_create_info_struct(m_png); | |
| 235 png_set_crc_action(m_png, PNG_CRC_QUIET_USE, PNG_CRC_QUIET_USE); | |
| 236 png_set_progressive_read_fn(m_png, m_decoder, pngHeaderAvailable, | |
| 237 pngRowAvailable, pngComplete); | |
| 238 | |
| 239 // If the frame is the size of the whole image, we don't need to modify any | |
| 240 // data in the IHDR chunk. This means it suffices to re-process all header | |
| 241 // data up to the first frame, for mimicking a png image. | |
| 242 const IntRect& frameRect = m_frameInfo[index].frameRect; | |
| 243 if (frameRect.location() == IntPoint() | |
| 244 && frameRect.size() == m_decoder->size()) { | |
| 245 processData(data, m_initialOffset, m_idatOffset); | |
| 246 return; | |
| 247 } | |
| 248 | |
| 249 // Process the IHDR chunk, but change the width and height so it reflects | |
| 250 // the frame's width and height. Image Decoder will apply the x,y offset. | |
| 251 // This step is omitted if the width and height are equal to the image size, | |
| 252 // which is done in the block above. | |
| 253 FastSharedBufferReader reader(&data); | |
| 254 char readBuffer[kBufferSize]; | |
| 255 | |
| 256 // |headerSize| is equal to |kBufferSize|, but adds more semantic insight. | |
| 257 constexpr size_t headerSize = 33; | |
| 258 png_byte header[headerSize]; | |
| 259 const png_byte* chunk = readAsConstPngBytep(reader, m_initialOffset, | |
| 260 headerSize, readBuffer); | |
| 261 memcpy(header, chunk, headerSize); | |
| 262 | |
| 263 // Write the unclipped width and height. Clipping happens in the decoder. | |
| 264 png_save_uint_32(header + 16, frameRect.width()); | |
| 265 png_save_uint_32(header + 20, frameRect.height()); | |
| 266 png_process_data(m_png, m_info, header, headerSize); | |
| 267 | |
| 268 // Process the rest of the header chunks. Start after the PNG signature and | |
| 269 // IHDR chunk, 33B, and process up to the first data chunk. The number of | |
| 270 // bytes up to the first data chunk is stored in |m_idatOffset|. | |
| 271 processData(data, m_initialOffset + headerSize, m_idatOffset - headerSize); | |
| 272 } | |
| 273 | |
| 274 // Determine if the bytes 4 to 7 of |chunk| indicate that it is a |tag| chunk. | |
| 275 // - The length of |chunk| must be >= 8 | |
| 276 // - The length of |tag| must be = 4 | |
| 277 static inline bool isChunk(const png_byte* chunk, const char* tag) | |
| 278 { | |
| 279 return memcmp(chunk + 4, tag, 4) == 0; | |
| 280 } | |
| 281 | |
| 282 bool PNGImageReader::progressivelyDecodeFirstFrame(SegmentReader& data) | |
| 283 { | |
| 284 FastSharedBufferReader reader(&data); | |
| 285 char readBuffer[8]; // large enough to identify a chunk. | |
| 286 size_t offset = m_frameInfo[0].startOffset; | |
| 287 | |
| 288 // Loop while there is enough data to do progressive decoding. | |
| 289 while (data.size() >= offset + 8) { | |
| 290 | |
| 291 // At the beginning of each loop, the offset is at the start of a chunk. | |
| 292 const png_byte* chunk = readAsConstPngBytep(reader, offset, 8, | |
| 293 readBuffer); | |
| 294 const png_uint_32 length = png_get_uint_32(chunk); | |
| 295 | |
| 296 // When an fcTL or IEND chunk is encountered, the frame data has ended. | |
| 297 // Return true, since all frame data is decoded. | |
| 298 if (isChunk(chunk, "fcTL") || isChunk(chunk, "IEND")) | |
| 299 return true; | |
| 300 | |
| 301 // If this chunk was already decoded, move on to the next. | |
| 302 if (m_progressiveDecodeOffset >= offset + length + 12) { | |
| 303 offset += length + 12; | |
| 304 continue; | |
| 305 } | |
| 306 | |
| 307 // At this point, three scenarios are possible: | |
| 308 // 1) Some bytes of this chunk were already decoded in a previous call, | |
| 309 // so we need to continue from there. | |
| 310 // 2) This is an fdAT chunk, so we need to convert it to an IDAT chunk | |
| 311 // before we can decode it. | |
| 312 // 3) This is any other chunk, most likely an IDAT chunk. | |
| 313 // | |
| 314 // In each scenario, we want to decode as much data as possible. In each | |
| 315 // one, do the scenario specific work and set |offset| to where decoding | |
| 316 // needs to continue. From there, decode until the end of the chunk, if | |
| 317 // possible. If the whole chunk is decoded, continue to the next loop. | |
| 318 // Otherwise, store how far we've come in |m_progressiveDecodeOffset| and | |
| 319 // return false to indicate to the caller that the frame is partially | |
| 320 // decoded. | |
| 321 | |
| 322 size_t endOffsetChunk = offset + length + 12; | |
| 323 | |
| 324 // Scenario 1: |m_progressiveDecodeOffset| is ahead of the chunk tag. | |
| 325 if (m_progressiveDecodeOffset >= offset + 8) { | |
| 326 offset = m_progressiveDecodeOffset; | |
| 327 | |
| 328 // Scenario 2: we need to convert the fdAT to an IDAT chunk. For an | |
| 329 // explanation of the numbers, see the comments in decodeFrame(). | |
| 330 } else if (isChunk(chunk, "fdAT")) { | |
| 331 png_byte chunkIDAT[] = {0, 0, 0, 0, 'I', 'D', 'A', 'T'}; | |
| 332 png_save_uint_32(chunkIDAT, length - 4); | |
| 333 png_process_data(m_png, m_info, chunkIDAT, 8); | |
| 334 // Skip the sequence number | |
| 335 offset += 12; | |
| 336 | |
| 337 // Scenario 3: for any other chunk type, process the first 8 bytes. | |
| 338 } else { | |
| 339 png_process_data(m_png, m_info, const_cast<png_byte*>(chunk), 8); | |
| 340 offset += 8; | |
| 341 } | |
| 342 | |
| 343 size_t bytesLeftInChunk = endOffsetChunk - offset; | |
| 344 size_t bytesDecoded = processData(data, offset, bytesLeftInChunk); | |
| 345 m_progressiveDecodeOffset = offset + bytesDecoded; | |
| 346 if (bytesDecoded < bytesLeftInChunk) | |
| 347 return false; | |
| 348 offset += bytesDecoded; | |
| 349 } | |
| 350 | |
| 351 return false; | |
| 352 } | |
| 353 | |
| 354 void PNGImageReader::decodeFrame(SegmentReader& data, size_t index) | |
| 355 { | |
| 356 // From the frame info that was gathered during parsing, it is known at | |
| 357 // what offset the frame data starts and how many bytes are in the stream | |
| 358 // before the frame ends. Using this, we process all chunks that fall in | |
| 359 // this interval. We catch every fdAT chunk and transform it to an IDAT | |
| 360 // chunk, so libpng will decode it like a non-animated PNG image. | |
| 361 size_t offset = m_frameInfo[index].startOffset; | |
| 362 size_t endOffset = offset + m_frameInfo[index].byteLength; | |
| 363 char readBuffer[8]; | |
| 364 FastSharedBufferReader reader(&data); | |
| 365 | |
| 366 while (offset < endOffset) { | |
| 367 const png_byte* chunk = readAsConstPngBytep(reader, offset, 8, readBuffer); | |
| 368 const png_uint_32 length = png_get_uint_32(chunk); | |
| 369 if (isChunk(chunk, "fdAT")) { | |
| 370 // An fdAT chunk is build up as follows: | |
| 371 // - |length| (4B) | |
| 372 // - fdAT tag (4B) | |
| 373 // - sequence number (4B) | |
| 374 // - frame data (|length| - 4B) | |
| 375 // - CRC (4B) | |
| 376 // Thus, to reformat this into an IDAT chunk, we need to: | |
| 377 // - write |length| - 4 as the new length, since the sequence number | |
| 378 // must be removed. | |
| 379 // - change the tag to IDAT. | |
| 380 // - omit the sequence number from the data part of the chunk. | |
| 381 png_byte chunkIDAT[] = {0, 0, 0, 0, 'I', 'D', 'A', 'T'}; | |
| 382 png_save_uint_32(chunkIDAT, length - 4); | |
| 383 png_process_data(m_png, m_info, chunkIDAT, 8); | |
| 384 // The frame data and the CRC span |length| bytes, so skip the | |
| 385 // sequence number and process |length| bytes to decode the frame. | |
| 386 processData(data, offset + 12, length); | |
| 387 } else { | |
| 388 png_process_data(m_png, m_info, const_cast<png_byte*>(chunk), 8); | |
| 389 processData(data, offset + 8, length + 4); | |
| 390 } | |
| 391 offset += 12 + length; | |
| 392 } | |
| 393 } | |
| 394 | |
| 395 void PNGImageReader::endFrameDecoding() | |
| 396 { | |
| 397 png_byte IEND[12] = {0, 0, 0, 0, 'I', 'E', 'N', 'D', 174, 66, 96, 130}; | |
| 398 png_process_data(m_png, m_info, IEND, 12); | |
| 399 } | |
| 400 | |
| 401 bool PNGImageReader::parse(SegmentReader& data, | |
| 402 PNGImageDecoder::PNGParseQuery query) | |
| 403 { | |
| 404 if (m_parseCompleted) | |
| 405 return true; | |
| 406 | |
| 407 if (setjmp(JMPBUF(m_png))) | |
| 408 return m_decoder->setFailed(); | |
| 409 | |
| 410 // If the size has not been parsed, do that first, since it's necessary | |
| 411 // for both the Size and MetaData query. If parseSize returns false, | |
| 412 // it failed because of a lack of data so we can return false at this point. | |
| 413 if (!m_decoder->isDecodedSizeAvailable() && !parseSize(data)) | |
| 414 return false; | |
| 415 | |
| 416 if (query == PNGImageDecoder::PNGParseQuery::PNGSizeQuery) | |
| 417 return m_decoder->isDecodedSizeAvailable(); | |
| 418 | |
| 419 // For non animated images (identified by no acTL chunk before the IDAT), | |
| 420 // we create one frame. This saves some processing time since we don't need | |
| 421 // to go over the stream to find chunks. | |
| 422 if (!m_isAnimated) { | |
| 423 if (m_frameInfo.isEmpty()) { | |
| 424 FrameInfo frame; | |
| 425 // This needs to be plus 8 since the first 8 bytes of the IDAT chunk | |
| 426 // are already processed in parseSize(). | |
| 427 frame.startOffset = m_readOffset + 8; | |
| 428 frame.frameRect = IntRect(IntPoint(), m_decoder->size()); | |
| 429 frame.duration = 0; | |
| 430 frame.alphaBlend = ImageFrame::AlphaBlendSource::BlendAtopBgcolor; | |
| 431 frame.disposalMethod = ImageFrame::DisposalMethod::DisposeNotSpecified; | |
| 432 m_frameInfo.append(frame); | |
| 433 // When the png is not animated, no extra parsing is necessary. | |
| 434 m_parseCompleted = true; | |
| 435 } | |
| 436 return true; | |
| 437 } | |
| 438 | |
| 439 FastSharedBufferReader reader(&data); | |
| 440 char readBuffer[kBufferSize]; | |
| 441 | |
| 442 // At this point, the query is FrameMetaDataQuery. Loop over the data and | |
| 443 // register all frames we can find. A frame is registered on the next fcTL | |
| 444 // chunk or when the IEND chunk is found. This ensures that only complete | |
| 445 // frames are reported, unless there is an error in the stream. | |
| 446 while (reader.size() >= m_readOffset + 8) { | |
| 447 const png_byte* chunk = readAsConstPngBytep(reader, m_readOffset, 8, | |
| 448 readBuffer); | |
| 449 const size_t length = png_get_uint_32(chunk); | |
| 450 | |
| 451 // When we find an IDAT chunk (when the IDAT is part of the animation), | |
| 452 // or an fdAT chunk, and the readOffset field of the newFrame is 0, | |
| 453 // we have found the beginning of a new block of frame data. | |
| 454 const bool isFrameData = isChunk(chunk, "fdAT") | |
| 455 || (isChunk(chunk, "IDAT") && m_idatIsPartOfAnimation); | |
| 456 if (m_newFrame.startOffset == 0 && isFrameData) { | |
| 457 m_newFrame.startOffset = m_readOffset; | |
| 458 | |
| 459 // When the |frameInfo| vector is empty, the first frame needs to be | |
| 460 // reported as soon as possible, even before all frame data is in | |
| 461 // |data|, so the first frame can be decoded progressively. | |
| 462 if (m_frameInfo.isEmpty()) { | |
| 463 m_newFrame.byteLength = kFirstFrameIndicator; | |
| 464 m_frameInfo.append(m_newFrame); | |
| 465 } | |
| 466 | |
| 467 // An fcTL or IEND marks the end of the previous frame. Thus, the | |
| 468 // FrameInfo data in m_newFrame is submitted to the m_frameInfo vector. | |
| 469 // | |
| 470 // Furthermore, an fcTL chunk indicates a new frame is coming, | |
| 471 // so the m_newFrame variable is prepared accordingly by setting the | |
| 472 // readOffset field to 0, which indicates that the frame control info | |
| 473 // is available but that we haven't seen any frame data yet. | |
| 474 } else if (isChunk(chunk, "fcTL") || isChunk(chunk, "IEND")) { | |
| 475 if (m_newFrame.startOffset != 0) { | |
| 476 m_newFrame.byteLength = m_readOffset - m_newFrame.startOffset; | |
| 477 if (m_frameInfo[0].byteLength == kFirstFrameIndicator) | |
| 478 m_frameInfo[0].byteLength = m_newFrame.byteLength; | |
| 479 else | |
| 480 m_frameInfo.append(m_newFrame); | |
| 481 | |
| 482 m_newFrame.startOffset = 0; | |
| 483 } | |
| 484 | |
| 485 if (reader.size() < m_readOffset + 12 + length) | |
| 486 return false; | |
| 487 | |
| 488 if (isChunk(chunk, "IEND")) { | |
| 489 // The PNG image ends at the IEND chunk, so all parsing is completed. | |
| 490 m_parseCompleted = true; | |
| 491 return true; | |
| 492 } | |
| 493 | |
| 494 // At this point, we're dealing with an fcTL chunk, since the above | |
| 495 // statement already returns on IEND chunks. | |
| 496 | |
| 497 // If the fcTL chunk is not 26 bytes long, we can't process it. | |
| 498 if (length != 26) | |
| 499 return m_decoder->setFailed(); | |
| 500 | |
| 501 chunk = readAsConstPngBytep(reader, m_readOffset + 8, length, readBuffer); | |
| 502 parseFrameInfo(chunk); | |
| 503 | |
| 504 } | |
| 505 m_readOffset += 12 + length; | |
| 506 } | |
| 507 return false; | |
| 508 } | |
| 509 | |
| 510 // If |length| == 0, read until the stream ends. | |
| 511 // @return: number of bytes processed. | |
| 512 size_t PNGImageReader::processData(SegmentReader& data, size_t offset, | |
| 513 size_t length) | |
| 514 { | |
| 515 const char* segment; | |
| 516 size_t totalProcessedBytes = 0; | |
| 517 while (size_t segmentLength = data.getSomeData(segment, offset)) { | |
| 518 if (length > 0 && segmentLength + totalProcessedBytes > length) | |
| 519 segmentLength = length - totalProcessedBytes; | |
| 520 | |
| 521 png_process_data(m_png, m_info, | |
| 522 reinterpret_cast<png_byte*>(const_cast<char*>(segment)), | |
| 523 segmentLength); | |
| 524 offset += segmentLength; | |
| 525 totalProcessedBytes += segmentLength; | |
| 526 if (totalProcessedBytes == length) | |
| 527 return length; | |
| 528 } | |
| 529 return totalProcessedBytes; | |
| 530 } | |
| 531 | |
| 532 // This methods reads through the stream until it has parsed the image size. | |
| 533 // @return true when it succeeds in parsing the size. | |
| 534 // false when: | |
| 535 // A) not enough data is provided | |
| 536 // B) decoding by libpng fails. In the this case, it will also call | |
| 537 // setFailed on m_decoder. | |
| 538 bool PNGImageReader::parseSize(SegmentReader &data) | |
|
scroggo_chromium
2016/11/11 21:31:06
SegmentReader& data
joostouwerling
2016/11/21 20:27:44
Done.
| |
| 539 { | |
| 540 FastSharedBufferReader reader(&data); | |
| 541 char readBuffer[kBufferSize]; | |
| 542 | |
| 543 // Process the PNG signature and the IHDR with libpng, such that this code | |
| 544 // does not need to be bothered with parsing the contents. This also enables | |
| 545 // the reader to use the existing headerAvailable callback in the decoder. | |
| 546 // | |
| 547 // When we already have decoded the signature, we don't need to do it again. | |
| 548 // By setting a flag for this we allow for byte by byte parsing. | |
| 549 if (!m_parsedSignature) { | |
| 550 if (reader.size() < m_readOffset + 8) | |
| 551 return false; | |
| 552 | |
| 553 const png_byte* chunk = readAsConstPngBytep(reader, m_readOffset, 8, | |
| 554 readBuffer); | |
| 555 png_process_data(m_png, m_info, const_cast<png_byte*>(chunk), 8); | |
| 556 m_readOffset += 8; | |
| 557 m_parsedSignature = true; | |
| 558 // Initialize the newFrame by setting the readOffset to 0. | |
| 559 m_newFrame.startOffset = 0; | |
| 560 } | |
| 561 | |
| 562 // This loop peeks at the chunk tag until the IDAT chunk is found. When | |
| 563 // a different tag is encountered, pass it on to libpng for general parsing. | |
| 564 // We can peek at chunks by looking at the first 8 bytes, which contain the | |
| 565 // length and the chunk tag. | |
| 566 // | |
| 567 // When an fcTL (frame control) is encountered before the IDAT, the frame | |
| 568 // data in the IDAT chunk is part of the animation. This case is flagged | |
| 569 // and the frame info is stored by parsing the fcTL chunk. | |
| 570 while (reader.size() >= m_readOffset + 8) { | |
| 571 const png_byte* chunk = readAsConstPngBytep(reader, m_readOffset, 8, | |
| 572 readBuffer); | |
| 573 const png_uint_32 length = png_get_uint_32(chunk); | |
| 574 | |
| 575 // If we encounter the IDAT chunk, we're done with the png header | |
| 576 // chunks. Indicate this to libpng by sending the beginning of the IDAT | |
| 577 // chunk, which will trigger libpng to call the headerAvailable | |
| 578 // callback on m_decoder. This provides the size to the decoder. | |
| 579 if (isChunk(chunk, "IDAT")) { | |
| 580 m_idatOffset = m_readOffset; | |
| 581 png_process_data(m_png, m_info, const_cast<png_byte*>(chunk), 8); | |
| 582 return true; | |
| 583 } | |
| 584 | |
| 585 // Consider the PNG image animated if an acTL chunk of the correct | |
| 586 // length is present. Parsing the acTL content is done by | |
| 587 // parseAnimationControl, called by libpng's png_process_data. | |
| 588 if (isChunk(chunk, "acTL") && length == 8) | |
| 589 m_isAnimated = true; | |
| 590 | |
| 591 // We don't need to check for |length| here, because the decoder will | |
| 592 // fail later on for invalid fcTL chunks. | |
| 593 if (isChunk(chunk, "fcTL")) | |
| 594 m_idatIsPartOfAnimation = true; | |
| 595 | |
| 596 // 12 is the length, tag and crc part of the chunk, which are all 4B. | |
| 597 if (reader.size() < m_readOffset + length + 12) | |
| 598 break; | |
| 599 | |
| 600 png_process_data(m_png, m_info, const_cast<png_byte*>(chunk), 8); | |
| 601 processData(data, m_readOffset + 8, length + 4); | |
| 602 m_readOffset += length + 12; | |
| 603 } | |
| 604 | |
| 605 // If we end up here, not enough data was available for the IDAT chunk | |
| 606 // So libpng would not have called headerAvailable yet. | |
| 607 return false; | |
| 608 } | |
| 609 | |
| 610 | |
| 611 void PNGImageReader::parseAnimationChunk(const char tag[], | |
| 612 const void* data_chunk, | |
| 613 size_t length) | |
| 614 { | |
| 615 const png_byte* data = static_cast<const png_byte*>(data_chunk); | |
| 616 | |
| 617 // The number of frames as indicated in the animation control chunk (acTL) | |
| 618 // is ignored, and the number of frames that are actually present is used. | |
| 619 // For now, when the number of indicated frames is different from the | |
| 620 // number of supplied frames, the number of supplied frames is what is | |
| 621 // provided to the decoder. Therefore, it does not add any benefit of | |
| 622 // looking at the value of the indicated framecount. A note here is that | |
| 623 // there may be optimisations available, for example, prescaling vectors. | |
| 624 if (strcmp(tag, "acTL") == 0 && length == 8) { | |
| 625 png_uint_32 repetitionCount = png_get_uint_32(data + 4); | |
| 626 m_decoder->setRepetitionCount(repetitionCount); | |
| 627 | |
| 628 // For fcTL, decoding fails if it does not have the correct length. It is | |
| 629 // impossible to make a guess about the frame if not all data is available. | |
| 630 // Use longjmp to get back to parse(), which is necessary since this method | |
| 631 // is called by a libpng callback. | |
| 632 } else if (strcmp(tag, "fcTL") == 0) { | |
| 633 if (length != 26) | |
| 634 longjmp(JMPBUF(m_png), 1); | |
| 635 parseFrameInfo(data); | |
| 636 } | |
| 637 } | |
| 638 | |
| 639 void PNGImageReader::clearDecodeState(size_t frameIndex) { | |
| 640 if (frameIndex == 0) | |
| 641 m_progressiveDecodeOffset = 0; | |
| 642 } | |
| 643 | |
| 644 size_t PNGImageReader::frameCount() const | |
| 645 { | |
| 646 return m_frameInfo.size(); | |
| 647 } | |
| 648 | |
| 649 const PNGImageReader::FrameInfo& PNGImageReader::frameInfo(size_t index) const | |
| 650 { | |
| 651 ASSERT(index < m_frameInfo.size()); | |
| 652 return m_frameInfo[index]; | |
| 653 } | |
| 654 | |
| 655 // Extract the frame control info and store it in m_newFrame. The length check | |
| 656 // on the data chunk has been done in parseAnimationChunk. | |
| 657 // The fcTL specification used can be found at: | |
| 658 // https://wiki.mozilla.org/APNG_Specification#.60fcTL.60:_The_Frame_Control_Chu nk | |
| 659 void PNGImageReader::parseFrameInfo(const png_byte* data) | |
| 660 { | |
| 661 png_uint_32 width, height, xOffset, yOffset; | |
| 662 png_uint_16 delayNumerator, delayDenominator; | |
| 663 width = png_get_uint_32(data + 4); | |
| 664 height = png_get_uint_32(data + 8); | |
| 665 xOffset = png_get_uint_32(data + 12); | |
| 666 yOffset = png_get_uint_32(data + 16); | |
| 667 delayNumerator = png_get_uint_16(data + 20); | |
| 668 delayDenominator = png_get_uint_16(data + 22); | |
| 669 | |
| 670 m_newFrame.duration = (delayDenominator == 0) ? delayNumerator * 10 | |
| 671 : delayNumerator * 1000 / delayDenominator; | |
| 672 m_newFrame.frameRect = IntRect(xOffset, yOffset, width, height); | |
| 673 m_newFrame.disposalMethod = data[24]; | |
| 674 m_newFrame.alphaBlend = data[25]; | |
| 675 } | |
| 676 | |
| 677 }; // namespace blink | |
| OLD | NEW |