OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2010, Google Inc. All rights reserved. | 2 * Copyright (c) 2010, Google 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 are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 10 matching lines...) Expand all Loading... |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #include "platform/image-encoders/skia/PNGImageEncoder.h" | 31 #include "platform/image-encoders/PNGImageEncoder.h" |
32 | 32 |
33 #include "platform/graphics/ImageBuffer.h" | 33 #include "platform/graphics/ImageBuffer.h" |
34 #include "wtf/OwnPtr.h" | 34 #include "wtf/OwnPtr.h" |
35 | 35 |
36 namespace blink { | 36 namespace blink { |
37 | 37 |
38 PNGImageEncoderState::~PNGImageEncoderState() | 38 PNGImageEncoderState::~PNGImageEncoderState() |
39 { | 39 { |
40 png_destroy_write_struct(&m_png, &m_info); | 40 png_destroy_write_struct(&m_png, &m_info); |
41 } | 41 } |
(...skipping 21 matching lines...) Expand all Loading... |
63 // - the delta filter is 1 ("sub") instead of 5 ("all"), to reduce the filte
r computations. | 63 // - the delta filter is 1 ("sub") instead of 5 ("all"), to reduce the filte
r computations. |
64 // The zlib memory level (8) and strategy (Z_FILTERED) will be set inside li
bpng. | 64 // The zlib memory level (8) and strategy (Z_FILTERED) will be set inside li
bpng. |
65 // | 65 // |
66 // Avoid the zlib strategies Z_HUFFMAN_ONLY or Z_RLE. | 66 // Avoid the zlib strategies Z_HUFFMAN_ONLY or Z_RLE. |
67 // Although they are the fastest for poorly-compressible images (e.g. photog
raphs), | 67 // Although they are the fastest for poorly-compressible images (e.g. photog
raphs), |
68 // they are very slow for highly-compressible images (e.g. text, drawings or
business graphics) | 68 // they are very slow for highly-compressible images (e.g. text, drawings or
business graphics) |
69 png_set_compression_level(png, 3); | 69 png_set_compression_level(png, 3); |
70 png_set_filter(png, PNG_FILTER_TYPE_BASE, PNG_FILTER_SUB); | 70 png_set_filter(png, PNG_FILTER_TYPE_BASE, PNG_FILTER_SUB); |
71 | 71 |
72 png_set_write_fn(png, output, writeOutput, 0); | 72 png_set_write_fn(png, output, writeOutput, 0); |
73 png_set_IHDR(png, info, imageSize.width(), imageSize.height(), | 73 png_set_IHDR(png, info, imageSize.width(), imageSize.height(), 8, PNG_COLOR_
TYPE_RGB_ALPHA, 0, 0, 0); |
74 8, PNG_COLOR_TYPE_RGB_ALPHA, 0, 0, 0); | |
75 png_write_info(png, info); | 74 png_write_info(png, info); |
76 | 75 |
77 return adoptPtr(new PNGImageEncoderState(png, info)); | 76 return adoptPtr(new PNGImageEncoderState(png, info)); |
78 } | 77 } |
79 | 78 |
80 void PNGImageEncoder::writeOneRowToPng(unsigned char* pixels, PNGImageEncoderSta
te* encoderState) | 79 void PNGImageEncoder::writeOneRowToPng(unsigned char* pixels, PNGImageEncoderSta
te* encoderState) |
81 { | 80 { |
82 png_write_row(encoderState->png(), pixels); | 81 png_write_row(encoderState->png(), pixels); |
83 } | 82 } |
84 | 83 |
(...skipping 21 matching lines...) Expand all Loading... |
106 | 105 |
107 bool PNGImageEncoder::encode(const ImageDataBuffer& imageData, Vector<unsigned c
har>* output) | 106 bool PNGImageEncoder::encode(const ImageDataBuffer& imageData, Vector<unsigned c
har>* output) |
108 { | 107 { |
109 if (!imageData.pixels()) | 108 if (!imageData.pixels()) |
110 return false; | 109 return false; |
111 | 110 |
112 return encodePixels(imageData.size(), imageData.pixels(), output); | 111 return encodePixels(imageData.size(), imageData.pixels(), output); |
113 } | 112 } |
114 | 113 |
115 } // namespace blink | 114 } // namespace blink |
OLD | NEW |