OLD | NEW |
1 // Copyright (c) 2008, Google Inc. | 1 // Copyright (c) 2008, Google Inc. |
2 // All rights reserved. | 2 // 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 11 matching lines...) Expand all Loading... |
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 #include "config.h" | 30 #include "config.h" |
31 | 31 |
32 #include "base/gfx/image_operations.h" | 32 #include "skia/ext/image_operations.h" |
33 | 33 |
34 #include "NativeImageSkia.h" | 34 #include "NativeImageSkia.h" |
35 #include "SkiaUtils.h" | 35 #include "SkiaUtils.h" |
36 | 36 |
37 NativeImageSkia::NativeImageSkia() | 37 NativeImageSkia::NativeImageSkia() |
38 : SkBitmap(), | 38 : SkBitmap(), |
39 m_isDataComplete(false), | 39 m_isDataComplete(false), |
40 m_resizedImage(), | 40 m_resizedImage(), |
41 m_lastRequestSize(0, 0), | 41 m_lastRequestSize(0, 0), |
42 m_resizeRequests(0) { | 42 m_resizeRequests(0) { |
(...skipping 55 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
98 m_lastRequestSize = WebCore::IntSize(dest_width, dest_height); | 98 m_lastRequestSize = WebCore::IntSize(dest_width, dest_height); |
99 m_resizeRequests = 0; | 99 m_resizeRequests = 0; |
100 } | 100 } |
101 | 101 |
102 // Otherwise, use the heuristic that if more than 1/4 of the image is | 102 // Otherwise, use the heuristic that if more than 1/4 of the image is |
103 // requested, it's worth caching. | 103 // requested, it's worth caching. |
104 int dest_size = dest_width * dest_height; | 104 int dest_size = dest_width * dest_height; |
105 int dest_subset_size = dest_subset_width * dest_subset_height; | 105 int dest_subset_size = dest_subset_width * dest_subset_height; |
106 return dest_size / 4 < dest_subset_size; | 106 return dest_size / 4 < dest_subset_size; |
107 } | 107 } |
OLD | NEW |