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