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