Lines Matching refs:frame
204 const SkWuffsFrame* frame(int i) const;
334 return fCodec->frame(i);
389 const SkWuffsFrame* SkWuffsCodec::frame(int i) const {
504 // SRC is usually faster than SRC_OVER, but for a dependent frame, dst is
505 // assumed to hold the previous frame's pixels (after processing the
508 (this->frame(options.fFrameIndex)->getRequiredFrame() != SkCodec::kNoFrame)) {
616 const SkWuffsFrame* f = this->frame(index);
629 // For a dependent frame, we cannot blend the partial result, since
650 // If the frame rect does not fill the output, ensure that those pixels are not
659 // look jarring to draw a partial frame over an existing frame. If they
661 // frame after the first one, we'll need to update our blending code.
662 // Otherwise, if the frame were interlaced and not independent, the
668 // If the frame's dirty rect is empty, no need to swizzle.
673 // The Wuffs model is that the dst buffer is the image, not the frame.
675 // for the N frames, regardless of each frame's top-left co-ordinate.
711 // frame. We have the option of releasing its memory, but there is a
712 // trade-off. If decoding a subsequent frame will also need "two pass"
714 // re-using it. On the other hand, if there is no subsequent frame, and
723 // renderer layer) may mean that each frame is only decoded once (at
727 // the last frame of the animation (or, for still images, the only
728 // frame). The output of the next decode request (if any) should be the
758 // store, for each frame walked past when merely counting the number of
759 // frames, the I/O position of each of the frame's GIF data blocks. (A GIF
760 // frame's compressed data can have multiple data blocks, each at most 255
771 // of an animation frame's data, but does not provide arbitrary save and
772 // load of its internal state whilst in the middle of an animation frame.
813 const SkWuffsFrame* f = this->frame(i);
998 // first frame.