1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
|
/*
* Copyright (c) 2008, Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "SkiaFontWin.h"
#include "SkCanvas.h"
#include "SkPaint.h"
#include <wtf/ListHashSet.h>
#include <wtf/Vector.h>
namespace WebCore {
struct CachedOutlineKey {
CachedOutlineKey() : font(0), glyph(0), path(0) {}
CachedOutlineKey(HFONT f, WORD g) : font(f), glyph(g), path(0) {}
HFONT font;
WORD glyph;
// The lifetime of this pointer is managed externally to this class. Be sure
// to call DeleteOutline to remove items.
SkPath* path;
};
const bool operator==(const CachedOutlineKey& a, const CachedOutlineKey& b)
{
return a.font == b.font && a.glyph == b.glyph;
}
struct CachedOutlineKeyHash {
static unsigned hash(const CachedOutlineKey& key)
{
unsigned keyBytes;
memcpy(&keyBytes, &key.font, sizeof(unsigned));
return keyBytes + key.glyph;
}
static unsigned equal(const CachedOutlineKey& a, const CachedOutlineKey& b)
{
return a.font == b.font && a.glyph == b.glyph;
}
static const bool safeToCompareToEmptyOrDeleted = true;
};
typedef ListHashSet<CachedOutlineKey, CachedOutlineKeyHash> OutlineCache;
// FIXME: Convert from static constructor to accessor function. WebCore tries to
// avoid global constructors to save on start-up time.
static OutlineCache outlineCache;
// The global number of glyph outlines we'll cache.
static const int outlineCacheSize = 256;
static SkScalar FIXEDToSkScalar(FIXED fixed)
{
SkFixed skFixed;
memcpy(&skFixed, &fixed, sizeof(SkFixed));
return SkFixedToScalar(skFixed);
}
// Removes the given key from the cached outlines, also deleting the path.
static void deleteOutline(OutlineCache::iterator deleteMe)
{
delete deleteMe->path;
outlineCache.remove(deleteMe);
}
static void addPolyCurveToPath(const TTPOLYCURVE* polyCurve, SkPath* path)
{
switch (polyCurve->wType) {
case TT_PRIM_LINE:
for (WORD i = 0; i < polyCurve->cpfx; i++) {
path->lineTo(FIXEDToSkScalar(polyCurve->apfx[i].x), -FIXEDToSkScalar(polyCurve->apfx[i].y));
}
break;
case TT_PRIM_QSPLINE:
// FIXME: doesn't this duplicate points if we do the loop > once?
for (WORD i = 0; i < polyCurve->cpfx - 1; i++) {
SkScalar bx = FIXEDToSkScalar(polyCurve->apfx[i].x);
SkScalar by = FIXEDToSkScalar(polyCurve->apfx[i].y);
SkScalar cx = FIXEDToSkScalar(polyCurve->apfx[i + 1].x);
SkScalar cy = FIXEDToSkScalar(polyCurve->apfx[i + 1].y);
if (i < polyCurve->cpfx - 2) {
// We're not the last point, compute C.
cx = SkScalarAve(bx, cx);
cy = SkScalarAve(by, cy);
}
// Need to flip the y coordinates since the font's coordinate system is
// flipped from ours vertically.
path->quadTo(bx, -by, cx, -cy);
}
break;
case TT_PRIM_CSPLINE:
// FIXME
break;
}
}
// The size of the glyph path buffer.
static const int glyphPathBufferSize = 4096;
// Fills the given SkPath with the outline for the given glyph index. The font
// currently selected into the given DC is used. Returns true on success.
static bool getPathForGlyph(HDC dc, WORD glyph, SkPath* path)
{
char buffer[glyphPathBufferSize];
GLYPHMETRICS gm;
MAT2 mat = {{0, 1}, {0, 0}, {0, 0}, {0, 1}}; // Each one is (fract,value).
DWORD totalSize = GetGlyphOutlineW(dc, glyph, GGO_GLYPH_INDEX | GGO_NATIVE,
&gm, glyphPathBufferSize, buffer, &mat);
if (totalSize == GDI_ERROR)
return false;
const char* curGlyph = buffer;
const char* endGlyph = &buffer[totalSize];
while (curGlyph < endGlyph) {
const TTPOLYGONHEADER* polyHeader =
reinterpret_cast<const TTPOLYGONHEADER*>(curGlyph);
path->moveTo(FIXEDToSkScalar(polyHeader->pfxStart.x),
-FIXEDToSkScalar(polyHeader->pfxStart.y));
const char* curPoly = curGlyph + sizeof(TTPOLYGONHEADER);
const char* endPoly = curGlyph + polyHeader->cb;
while (curPoly < endPoly) {
const TTPOLYCURVE* polyCurve =
reinterpret_cast<const TTPOLYCURVE*>(curPoly);
addPolyCurveToPath(polyCurve, path);
curPoly += sizeof(WORD) * 2 + sizeof(POINTFX) * polyCurve->cpfx;
}
curGlyph += polyHeader->cb;
}
path->close();
return true;
}
// Returns a SkPath corresponding to the give glyph in the given font. The font
// should be selected into the given DC. The returned path is owned by the
// hashtable. Returns 0 on error.
const SkPath* SkiaWinOutlineCache::lookupOrCreatePathForGlyph(HDC hdc, HFONT font, WORD glyph)
{
CachedOutlineKey key(font, glyph);
OutlineCache::iterator found = outlineCache.find(key);
if (found != outlineCache.end()) {
// Keep in MRU order by removing & reinserting the value.
key = *found;
outlineCache.remove(found);
outlineCache.add(key);
return key.path;
}
key.path = new SkPath;
if (!getPathForGlyph(hdc, glyph, key.path))
return 0;
if (outlineCache.size() > outlineCacheSize)
// The cache is too big, find the oldest value (first in the list).
deleteOutline(outlineCache.begin());
outlineCache.add(key);
return key.path;
}
void SkiaWinOutlineCache::removePathsForFont(HFONT hfont)
{
// ListHashSet isn't the greatest structure for deleting stuff out of, but
// removing entries will be relatively rare (we don't remove fonts much, nor
// do we draw out own glyphs using these routines much either).
//
// We keep a list of all glyphs we're removing which we do in a separate
// pass.
Vector<CachedOutlineKey> outlinesToDelete;
for (OutlineCache::iterator i = outlineCache.begin();
i != outlineCache.end(); ++i)
outlinesToDelete.append(*i);
for (Vector<CachedOutlineKey>::iterator i = outlinesToDelete.begin();
i != outlinesToDelete.end(); ++i)
deleteOutline(outlineCache.find(*i));
}
} // namespace WebCore
|
