OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2008, 2009 Google Inc. All rights reserved. | 2 * Copyright (c) 2008, 2009 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 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 | 30 |
31 #include "config.h" | 31 #include "config.h" |
32 #include "core/platform/graphics/GlyphPageTreeNode.h" | |
33 | 32 |
34 #include "core/platform/graphics/Font.h" | |
35 #include "core/platform/graphics/SimpleFontData.h" | 33 #include "core/platform/graphics/SimpleFontData.h" |
36 | 34 |
37 #include "SkPaint.h" | 35 #include "SkPaint.h" |
38 #include "SkTemplates.h" | 36 #include "SkTemplates.h" |
39 #include "SkUtils.h" | 37 #include "SkUtils.h" |
40 | 38 |
41 namespace WebCore { | 39 namespace WebCore { |
42 | 40 |
43 bool GlyphPage::fill(unsigned offset, unsigned length, UChar* buffer, unsigned b
ufferLength, const SimpleFontData* fontData) | 41 bool GlyphPage::fill(unsigned offset, unsigned length, UChar* buffer, unsigned b
ufferLength, const SimpleFontData* fontData) |
44 { | 42 { |
(...skipping 18 matching lines...) Expand all Loading... |
63 unsigned allGlyphs = 0; // track if any of the glyphIDs are non-zero | 61 unsigned allGlyphs = 0; // track if any of the glyphIDs are non-zero |
64 for (unsigned i = 0; i < length; i++) { | 62 for (unsigned i = 0; i < length; i++) { |
65 setGlyphDataForIndex(offset + i, glyphs[i], glyphs[i] ? fontData : NULL)
; | 63 setGlyphDataForIndex(offset + i, glyphs[i], glyphs[i] ? fontData : NULL)
; |
66 allGlyphs |= glyphs[i]; | 64 allGlyphs |= glyphs[i]; |
67 } | 65 } |
68 | 66 |
69 return allGlyphs != 0; | 67 return allGlyphs != 0; |
70 } | 68 } |
71 | 69 |
72 } // namespace WebCore | 70 } // namespace WebCore |
OLD | NEW |