OLD | NEW |
---|---|
1 /* | 1 /* |
2 * Copyright (C) 2006 Apple Computer, Inc. All rights reserved. | 2 * Copyright (C) 2006 Apple Computer, Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
12 * | 12 * |
13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 */ | 24 */ |
25 | 25 |
26 #include "platform/image-decoders/gif/GIFImageDecoder.h" | 26 #include "platform/image-decoders/gif/GIFImageDecoder.h" |
27 | 27 |
28 #include "platform/image-decoders/gif/GIFImageReader.h" | 28 #include "third_party/skia/include/core/SkImageInfo.h" |
29 #include "wtf/NotFound.h" | 29 #include "wtf/NotFound.h" |
30 #include "wtf/PtrUtil.h" | 30 #include "wtf/PtrUtil.h" |
31 #include <limits> | 31 #include <limits> |
32 | 32 |
33 namespace blink { | 33 namespace blink { |
34 | 34 |
35 GIFImageDecoder::GIFImageDecoder(AlphaOption alphaOption, | 35 GIFImageDecoder::GIFImageDecoder(AlphaOption alphaOption, |
36 const ColorBehavior& colorBehavior, | 36 const ColorBehavior& colorBehavior, |
37 size_t maxDecodedBytes) | 37 size_t maxDecodedBytes) |
38 : ImageDecoder(alphaOption, colorBehavior, maxDecodedBytes), | 38 : ImageDecoder(alphaOption, colorBehavior, maxDecodedBytes), |
39 m_repetitionCount(cAnimationLoopOnce) {} | 39 m_codec(), |
40 | 40 m_segmentStream(nullptr) {} |
41 GIFImageDecoder::~GIFImageDecoder() {} | 41 |
42 GIFImageDecoder::~GIFImageDecoder() { | |
43 if (!m_codec) { | |
44 // if we did not create m_codec and thus did not pass ownership to it | |
45 if (m_segmentStream) { | |
46 delete m_segmentStream; | |
47 } | |
48 } | |
49 } | |
42 | 50 |
43 void GIFImageDecoder::onSetData(SegmentReader* data) { | 51 void GIFImageDecoder::onSetData(SegmentReader* data) { |
44 if (m_reader) | 52 if (!m_segmentStream) { |
45 m_reader->setData(data); | 53 m_segmentStream = new SegmentStream(); |
54 } | |
55 | |
56 m_segmentStream->setReader(data, isAllDataReceived()); | |
57 | |
58 // If we don't have a SkCodec yet, create one from the stream | |
59 if (!m_codec) { | |
60 m_codec.reset(SkCodec::NewFromStream(m_segmentStream)); | |
61 if (!m_codec) { | |
62 // m_segmentStream's ownership is passed. It is deleted if SkCodec | |
63 // creation fails. In this case, release our reference so we can create a | |
64 // new SegmentStream later. | |
65 m_segmentStream = nullptr; | |
66 } | |
67 } | |
46 } | 68 } |
47 | 69 |
48 int GIFImageDecoder::repetitionCount() const { | 70 int GIFImageDecoder::repetitionCount() const { |
71 if (!m_codec) { | |
72 return 0; | |
73 } | |
74 | |
49 // This value can arrive at any point in the image data stream. Most GIFs | 75 // This value can arrive at any point in the image data stream. Most GIFs |
50 // in the wild declare it near the beginning of the file, so it usually is | 76 // in the wild declare it near the beginning of the file, so it usually is |
51 // set by the time we've decoded the size, but (depending on the GIF and the | 77 // set by the time we've decoded the size, but (depending on the GIF and the |
52 // packets sent back by the webserver) not always. If the reader hasn't | 78 // packets sent back by the webserver) not always. |
53 // seen a loop count yet, it will return cLoopCountNotSeen, in which case we | |
54 // should default to looping once (the initial value for | |
55 // |m_repetitionCount|). | |
56 // | 79 // |
57 // There are some additional wrinkles here. First, ImageSource::clear() | 80 // SkCodec will parse forward in the file if the repetition count has not been |
58 // may destroy the reader, making the result from the reader _less_ | 81 // seen yet. |
59 // authoritative on future calls if the recreated reader hasn't seen the | 82 |
60 // loop count. We don't need to special-case this because in this case the | 83 int repetitionCount = m_codec->getRepetitionCount(); |
61 // new reader will once again return cLoopCountNotSeen, and we won't | 84 switch (repetitionCount) { |
62 // overwrite the cached correct value. | 85 case 0: |
63 // | 86 return cAnimationNone; |
64 // Second, a GIF might never set a loop count at all, in which case we | 87 case SkCodec::kRepetitionCountInfinite: |
65 // should continue to treat it as a "loop once" animation. We don't need | 88 return cAnimationLoopInfinite; |
66 // special code here either, because in this case we'll never change | 89 default: |
67 // |m_repetitionCount| from its default value. | 90 return repetitionCount; |
68 // | 91 } |
69 // Third, we use the same GIFImageReader for counting frames and we might | |
70 // see the loop count and then encounter a decoding error which happens | |
71 // later in the stream. It is also possible that no frames are in the | |
72 // stream. In these cases we should just loop once. | |
73 if (isAllDataReceived() && parseCompleted() && m_reader->imagesCount() == 1) | |
74 m_repetitionCount = cAnimationNone; | |
75 else if (failed() || (m_reader && (!m_reader->imagesCount()))) | |
76 m_repetitionCount = cAnimationLoopOnce; | |
77 else if (m_reader && m_reader->loopCount() != cLoopCountNotSeen) | |
78 m_repetitionCount = m_reader->loopCount(); | |
79 return m_repetitionCount; | |
80 } | 92 } |
81 | 93 |
82 bool GIFImageDecoder::frameIsCompleteAtIndex(size_t index) const { | 94 bool GIFImageDecoder::frameIsCompleteAtIndex(size_t index) const { |
83 return m_reader && (index < m_reader->imagesCount()) && | 95 if (!m_codec) { |
84 m_reader->frameContext(index)->isComplete(); | 96 return false; |
97 } | |
98 | |
99 std::vector<SkCodec::FrameInfo> frameInfos = m_codec->getFrameInfo(); | |
100 if (frameInfos.size() <= index) { | |
101 return false; | |
102 } | |
103 | |
104 return frameInfos[index].fFullyReceived; | |
85 } | 105 } |
86 | 106 |
87 float GIFImageDecoder::frameDurationAtIndex(size_t index) const { | 107 float GIFImageDecoder::frameDurationAtIndex(size_t index) const { |
88 return (m_reader && (index < m_reader->imagesCount()) && | 108 if (!m_codec) { |
89 m_reader->frameContext(index)->isHeaderDefined()) | 109 return 0; |
90 ? m_reader->frameContext(index)->delayTime() | 110 } |
91 : 0; | 111 |
92 } | 112 std::vector<SkCodec::FrameInfo> frameInfos = m_codec->getFrameInfo(); |
Noel Gordon
2016/12/21 06:16:56
Drive by: std:: container types not allowed in pla
cblume
2016/12/21 08:18:19
Having to copy the vector each time definitely isn
scroggo_chromium
2016/12/21 21:25:15
I do not currently see anything in the blink style
scroggo_chromium
2016/12/22 16:21:31
Thanks for the pointer - I had not seen that doc.
| |
93 | 113 if (frameInfos.size() <= index) { |
94 bool GIFImageDecoder::setFailed() { | 114 return 0; |
95 m_reader.reset(); | 115 } |
96 return ImageDecoder::setFailed(); | 116 |
97 } | 117 return frameInfos[index].fDuration; |
98 | 118 } |
99 bool GIFImageDecoder::haveDecodedRow(size_t frameIndex, | 119 |
100 GIFRow::const_iterator rowBegin, | 120 void GIFImageDecoder::decodeSize() { |
101 size_t width, | 121 CHECK(m_codec); |
102 size_t rowNumber, | 122 |
103 unsigned repeatCount, | 123 SkImageInfo imageInfo = m_codec->getInfo(); |
104 bool writeTransparentPixels) { | 124 setSize(imageInfo.width(), imageInfo.height()); |
105 const GIFFrameContext* frameContext = m_reader->frameContext(frameIndex); | 125 } |
106 // The pixel data and coordinates supplied to us are relative to the frame's | 126 |
107 // origin within the entire image size, i.e. | 127 size_t GIFImageDecoder::decodeFrameCount() { |
108 // (frameContext->xOffset, frameContext->yOffset). There is no guarantee | 128 CHECK(m_codec); |
109 // that width == (size().width() - frameContext->xOffset), so | 129 |
110 // we must ensure we don't run off the end of either the source data or the | 130 std::vector<SkCodec::FrameInfo> frameInfos = m_codec->getFrameInfo(); |
111 // row's X-coordinates. | 131 return frameInfos.size(); |
112 const int xBegin = frameContext->xOffset(); | 132 } |
113 const int yBegin = frameContext->yOffset() + rowNumber; | 133 |
114 const int xEnd = std::min(static_cast<int>(frameContext->xOffset() + width), | 134 void GIFImageDecoder::initializeNewFrame(size_t index) { |
115 size().width()); | 135 if (!m_codec) { |
116 const int yEnd = std::min( | 136 return; |
117 static_cast<int>(frameContext->yOffset() + rowNumber + repeatCount), | 137 } |
118 size().height()); | 138 |
119 if (!width || (xBegin < 0) || (yBegin < 0) || (xEnd <= xBegin) || | 139 ImageFrame& frame = m_frameBufferCache[index]; |
120 (yEnd <= yBegin)) | 140 std::vector<SkCodec::FrameInfo> frameInfos = m_codec->getFrameInfo(); |
121 return true; | 141 |
122 | 142 // FIXME We may not need to fill in all this frame information. |
123 const GIFColorMap::Table& colorTable = | 143 // SkCodec doesn't need it. Check if Blink uses it at all. |
124 frameContext->localColorMap().isDefined() | 144 // If Blink does use it, maybe SkCodec can provide it to us. |
125 ? frameContext->localColorMap().getTable() | 145 IntSize frameSize = size(); |
126 : m_reader->globalColorMap().getTable(); | 146 frame.setOriginalFrameRect(IntRect(IntPoint(), frameSize)); |
127 | 147 frame.setSizeAndColorSpace(frameSize.width(), frameSize.height(), |
128 if (colorTable.isEmpty()) | 148 colorSpaceForSkImages()); |
129 return true; | 149 frame.setDuration(frameInfos[index].fDuration); |
130 | 150 // The disposal method is not required any more, but is left in place |
131 GIFColorMap::Table::const_iterator colorTableIter = colorTable.begin(); | 151 // for the other image decoders that do not yet rely on SkCodec. |
132 | 152 // For now, fill it with DisposeKeep. |
133 // Initialize the frame if necessary. | 153 frame.setDisposalMethod(ImageFrame::DisposeKeep); |
134 ImageFrame& buffer = m_frameBufferCache[frameIndex]; | 154 size_t requiredPreviousFrame = frameInfos[index].fRequiredFrame; |
135 if (!initFrameBuffer(frameIndex)) | 155 if (requiredPreviousFrame == SkCodec::kNone) { |
136 return false; | 156 requiredPreviousFrame = WTF::kNotFound; |
137 | 157 } |
138 const size_t transparentPixel = frameContext->transparentPixel(); | 158 frame.setRequiredPreviousFrameIndex(requiredPreviousFrame); |
139 GIFRow::const_iterator rowEnd = rowBegin + (xEnd - xBegin); | 159 } |
140 ImageFrame::PixelData* currentAddress = buffer.getAddr(xBegin, yBegin); | 160 |
141 | 161 void GIFImageDecoder::decode(size_t index) { |
142 // We may or may not need to write transparent pixels to the buffer. | 162 if (!m_codec) { |
143 // If we're compositing against a previous image, it's wrong, and if | 163 return; |
144 // we're writing atop a cleared, fully transparent buffer, it's | 164 } |
145 // unnecessary; but if we're decoding an interlaced gif and | 165 |
146 // displaying it "Haeberli"-style, we must write these for passes | 166 if (m_frameBufferCache.size() <= index) { |
147 // beyond the first, or the initial passes will "show through" the | 167 // It is a fatal error if all data is received and we have decoded all |
148 // later ones. | 168 // frames available but the file is truncated. |
149 // | 169 if (isAllDataReceived()) { |
150 // The loops below are almost identical. One writes a transparent pixel | 170 setFailed(); |
151 // and one doesn't based on the value of |writeTransparentPixels|. | 171 } |
152 // The condition check is taken out of the loop to enhance performance. | 172 |
153 // This optimization reduces decoding time by about 15% for a 3MB image. | 173 return; |
154 if (writeTransparentPixels) { | 174 } |
155 for (; rowBegin != rowEnd; ++rowBegin, ++currentAddress) { | 175 |
156 const size_t sourceValue = *rowBegin; | 176 updateAggressivePurging(index); |
157 if ((sourceValue != transparentPixel) && | 177 |
158 (sourceValue < colorTable.size())) { | 178 SkImageInfo imageInfo = m_codec->getInfo().makeColorType(kN32_SkColorType); |
159 *currentAddress = colorTableIter[sourceValue]; | 179 |
160 } else { | 180 ImageFrame& frame = m_frameBufferCache[index]; |
161 *currentAddress = 0; | 181 size_t requiredPreviousFrameIndex = frame.requiredPreviousFrameIndex(); |
162 m_currentBufferSawAlpha = true; | 182 |
183 SkCodec::Options options; | |
184 options.fFrameIndex = index; | |
185 options.fHasPriorFrame = false; | |
186 if (requiredPreviousFrameIndex != WTF::kNotFound) { | |
187 options.fHasPriorFrame = true; | |
188 } | |
189 | |
190 if (frame.getStatus() == ImageFrame::FrameEmpty) { | |
191 SkCodec::Result startIncrementalDecodeResult = | |
192 m_codec->startIncrementalDecode(imageInfo, frame.bitmap().getPixels(), | |
193 frame.bitmap().rowBytes(), &options, | |
194 nullptr, nullptr); | |
195 switch (startIncrementalDecodeResult) { | |
196 case SkCodec::kSuccess: | |
197 break; | |
198 case SkCodec::kIncompleteInput: | |
199 return; | |
200 default: | |
201 setFailed(); | |
202 return; | |
203 } | |
204 | |
205 if (requiredPreviousFrameIndex != WTF::kNotFound) { | |
206 ImageFrame& requiredPreviousFrame = | |
207 m_frameBufferCache[requiredPreviousFrameIndex]; | |
208 | |
209 // We try to reuse |requiredPreviousFrame| as starting state to avoid | |
210 // copying. If canReusePreviousFrameBuffer returns false, we must copy | |
211 // the data since |requiredPreviousFrame| is necessary to decode this | |
212 // or later frames. In that case copy the data instead. | |
213 if ((!canReusePreviousFrameBuffer(index) || | |
214 !frame.takeBitmapDataIfWritable(&requiredPreviousFrame)) && | |
215 !frame.copyBitmapData(requiredPreviousFrame)) { | |
216 setFailed(); | |
217 return; | |
163 } | 218 } |
164 } | 219 } |
165 } else { | 220 } |
166 for (; rowBegin != rowEnd; ++rowBegin, ++currentAddress) { | 221 |
167 const size_t sourceValue = *rowBegin; | 222 int rowsDecoded = 0; |
168 if ((sourceValue != transparentPixel) && | 223 SkCodec::Result incrementalDecodeResult = |
169 (sourceValue < colorTable.size())) | 224 m_codec->incrementalDecode(&rowsDecoded); |
170 *currentAddress = colorTableIter[sourceValue]; | 225 switch (incrementalDecodeResult) { |
171 else | 226 case SkCodec::kSuccess: |
172 m_currentBufferSawAlpha = true; | 227 frame.setStatus(ImageFrame::FrameComplete); |
173 } | 228 break; |
174 } | 229 case SkCodec::kIncompleteInput: |
175 | 230 if (frame.getStatus() == ImageFrame::FrameEmpty && index == 0) { |
176 // Tell the frame to copy the row data if need be. | 231 // We want to display the bit of the frame we have decoded only if it is |
177 if (repeatCount > 1) | 232 // the first frame of an animation. That means we need to fill the rest |
178 buffer.copyRowNTimes(xBegin, xEnd, yBegin, yEnd); | 233 // of the image with transparent. |
179 | 234 IntRect remainingRect = frame.originalFrameRect(); |
180 buffer.setPixelsChanged(true); | 235 remainingRect.setHeight(remainingRect.height() - rowsDecoded); |
181 return true; | 236 frame.zeroFillFrameRect(remainingRect); |
182 } | 237 } |
183 | 238 |
184 bool GIFImageDecoder::parseCompleted() const { | 239 frame.setStatus(ImageFrame::FramePartial); |
185 return m_reader && m_reader->parseCompleted(); | 240 break; |
186 } | 241 default: |
187 | |
188 bool GIFImageDecoder::frameComplete(size_t frameIndex) { | |
189 // Initialize the frame if necessary. Some GIFs insert do-nothing frames, | |
190 // in which case we never reach haveDecodedRow() before getting here. | |
191 if (!initFrameBuffer(frameIndex)) | |
192 return false; // initFrameBuffer() has already called setFailed(). | |
193 | |
194 m_frameBufferCache[frameIndex].setStatus(ImageFrame::FrameComplete); | |
195 if (!m_currentBufferSawAlpha) | |
196 correctAlphaWhenFrameBufferSawNoAlpha(frameIndex); | |
197 | |
198 return true; | |
199 } | |
200 | |
201 void GIFImageDecoder::clearFrameBuffer(size_t frameIndex) { | |
202 if (m_reader && | |
203 m_frameBufferCache[frameIndex].getStatus() == ImageFrame::FramePartial) { | |
204 // Reset the state of the partial frame in the reader so that the frame | |
205 // can be decoded again when requested. | |
206 m_reader->clearDecodeState(frameIndex); | |
207 } | |
208 ImageDecoder::clearFrameBuffer(frameIndex); | |
209 } | |
210 | |
211 size_t GIFImageDecoder::decodeFrameCount() { | |
212 parse(GIFFrameCountQuery); | |
213 // If decoding fails, |m_reader| will have been destroyed. Instead of | |
214 // returning 0 in this case, return the existing number of frames. This way | |
215 // if we get halfway through the image before decoding fails, we won't | |
216 // suddenly start reporting that the image has zero frames. | |
217 return failed() ? m_frameBufferCache.size() : m_reader->imagesCount(); | |
218 } | |
219 | |
220 void GIFImageDecoder::initializeNewFrame(size_t index) { | |
221 ImageFrame* buffer = &m_frameBufferCache[index]; | |
222 const GIFFrameContext* frameContext = m_reader->frameContext(index); | |
223 buffer->setOriginalFrameRect( | |
224 intersection(frameContext->frameRect(), IntRect(IntPoint(), size()))); | |
225 buffer->setDuration(frameContext->delayTime()); | |
226 buffer->setDisposalMethod(frameContext->getDisposalMethod()); | |
227 buffer->setRequiredPreviousFrameIndex( | |
228 findRequiredPreviousFrame(index, false)); | |
229 } | |
230 | |
231 void GIFImageDecoder::decode(size_t index) { | |
232 parse(GIFFrameCountQuery); | |
233 | |
234 if (failed()) | |
235 return; | |
236 | |
237 updateAggressivePurging(index); | |
238 | |
239 Vector<size_t> framesToDecode = findFramesToDecode(index); | |
240 for (auto i = framesToDecode.rbegin(); i != framesToDecode.rend(); ++i) { | |
241 if (!m_reader->decode(*i)) { | |
242 setFailed(); | 242 setFailed(); |
243 return; | 243 return; |
244 } | 244 } |
245 | 245 |
246 // If this returns false, we need more data to continue decoding. | 246 if (!postDecodeProcessing(index)) { |
247 if (!postDecodeProcessing(*i)) | 247 return; |
248 break; | 248 } |
249 } | 249 } |
250 | 250 |
251 // It is also a fatal error if all data is received and we have decoded all | 251 bool GIFImageDecoder::canReusePreviousFrameBuffer(size_t index) const { |
252 // frames available but the file is truncated. | 252 DCHECK(index < m_frameBufferCache.size()); |
253 if (index >= m_frameBufferCache.size() - 1 && isAllDataReceived() && | 253 |
254 m_reader && !m_reader->parseCompleted()) | 254 // If the current frame and the next frame depend on the same frame, we cannot |
255 setFailed(); | 255 // reuse the old frame. We must preserve it for the next frame. |
256 } | 256 // |
257 | 257 // However, if the current and next frame depend on different frames then we |
258 void GIFImageDecoder::parse(GIFParseQuery query) { | 258 // know the current frame is the last one to use the frame it depends on. That |
259 if (failed()) | 259 // means the current frame can reuse the previous frame buffer. |
260 return; | 260 // |
261 | 261 // If we do not have information about the next frame yet, we cannot assume it |
262 if (!m_reader) { | 262 // is safe to reuse the previous frame buffer. |
263 m_reader = WTF::makeUnique<GIFImageReader>(this); | 263 |
264 m_reader->setData(m_data); | 264 if (index + 1 >= m_frameBufferCache.size()) { |
265 } | 265 return false; |
266 | 266 } |
267 if (!m_reader->parse(query)) | 267 |
268 setFailed(); | 268 const ImageFrame& frame = m_frameBufferCache[index]; |
269 } | 269 size_t requiredFrameIndex = frame.requiredPreviousFrameIndex(); |
270 | 270 |
271 void GIFImageDecoder::onInitFrameBuffer(size_t frameIndex) { | 271 const ImageFrame& nextFrame = m_frameBufferCache[index + 1]; |
272 m_currentBufferSawAlpha = false; | 272 size_t nextRequiredFrameIndex = nextFrame.requiredPreviousFrameIndex(); |
273 } | 273 |
274 | 274 return requiredFrameIndex != nextRequiredFrameIndex; |
275 bool GIFImageDecoder::canReusePreviousFrameBuffer(size_t frameIndex) const { | |
276 DCHECK(frameIndex < m_frameBufferCache.size()); | |
277 return m_frameBufferCache[frameIndex].getDisposalMethod() != | |
278 ImageFrame::DisposeOverwritePrevious; | |
279 } | 275 } |
280 | 276 |
281 } // namespace blink | 277 } // namespace blink |
OLD | NEW |