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 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254
|
/*
* Copyright (C) 2008 Apple Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#ifndef SVGGlyphMap_h
#define SVGGlyphMap_h
#if ENABLE(SVG_FONTS)
#include "core/svg/SVGParserUtilities.h"
#include "platform/fonts/Latin1TextIterator.h"
#include "platform/fonts/SVGGlyph.h"
#include "platform/text/SurrogatePairAwareTextIterator.h"
#include "wtf/HashMap.h"
#include "wtf/Vector.h"
namespace WebCore {
struct GlyphMapNode;
typedef HashMap<UChar32, RefPtr<GlyphMapNode> > GlyphMapLayer;
struct GlyphMapNode : public RefCounted<GlyphMapNode> {
private:
GlyphMapNode() { }
public:
static PassRefPtr<GlyphMapNode> create() { return adoptRef(new GlyphMapNode); }
Vector<SVGGlyph> glyphs;
GlyphMapLayer children;
};
class SVGGlyphMap {
public:
SVGGlyphMap() : m_currentPriority(0) { }
void addGlyph(const String& glyphIdentifier, const String& unicodeString, SVGGlyph glyph)
{
ASSERT(!glyphIdentifier.isEmpty() || !unicodeString.isEmpty());
bool hasGlyphIdentifier = !glyphIdentifier.isEmpty();
if (unicodeString.isEmpty()) {
// Register glyphs with 'id's in the id glyph map and in the glyph table.
ASSERT(hasGlyphIdentifier);
appendToGlyphTable(glyph);
m_idGlyphs.add(glyphIdentifier, glyph.tableEntry);
return;
}
unsigned length = unicodeString.length();
RefPtr<GlyphMapNode> node;
if (unicodeString.is8Bit()) {
Latin1TextIterator textIterator(unicodeString.characters8(), 0, length, length);
node = findOrCreateNode(textIterator);
} else {
SurrogatePairAwareTextIterator textIterator(unicodeString.characters16(), 0, length, length);
node = findOrCreateNode(textIterator);
}
if (!node)
return;
// Register glyph associated with an unicode string into the glyph map.
node->glyphs.append(glyph);
SVGGlyph& lastGlyph = node->glyphs.last();
lastGlyph.priority = m_currentPriority++;
lastGlyph.unicodeStringLength = length;
// If the glyph is named, also add it to the named glyph name, and to the glyph table in both cases.
appendToGlyphTable(lastGlyph);
if (!lastGlyph.glyphName.isEmpty())
m_namedGlyphs.add(lastGlyph.glyphName, lastGlyph.tableEntry);
if (hasGlyphIdentifier)
m_idGlyphs.add(glyphIdentifier, lastGlyph.tableEntry);
}
void appendToGlyphTable(SVGGlyph& glyph)
{
size_t tableEntry = m_glyphTable.size();
ASSERT(tableEntry < std::numeric_limits<unsigned short>::max());
// The first table entry starts with 1. 0 denotes an unknown glyph.
glyph.tableEntry = tableEntry + 1;
m_glyphTable.append(glyph);
}
static inline bool compareGlyphPriority(const SVGGlyph& first, const SVGGlyph& second)
{
return first.priority < second.priority;
}
void collectGlyphsForString(const String& string, Vector<SVGGlyph>& glyphs)
{
unsigned length = string.length();
if (!length)
return;
if (string.is8Bit()) {
Latin1TextIterator textIterator(string.characters8(), 0, length, length);
collectGlyphsForIterator(textIterator, glyphs);
} else {
SurrogatePairAwareTextIterator textIterator(string.characters16(), 0, length, length);
collectGlyphsForIterator(textIterator, glyphs);
}
std::sort(glyphs.begin(), glyphs.end(), compareGlyphPriority);
}
void collectGlyphsForStringExact(const String& string, Vector<SVGGlyph>& glyphs) const
{
unsigned length = string.length();
if (!length)
return;
RefPtr<GlyphMapNode> node;
if (string.is8Bit()) {
Latin1TextIterator textIterator(string.characters8(), 0, length, length);
node = findNode(textIterator);
} else {
SurrogatePairAwareTextIterator textIterator(string.characters16(), 0, length, length);
node = findNode(textIterator);
}
if (node)
glyphs.appendVector(node->glyphs);
}
void collectGlyphsForUnicodeRange(const UnicodeRange& unicodeRange, Vector<SVGGlyph>& glyphs) const
{
for (unsigned character = unicodeRange.first; character <= unicodeRange.second; ++character) {
if (RefPtr<GlyphMapNode> node = m_rootLayer.get(character))
glyphs.appendVector(node->glyphs);
}
}
void clear()
{
m_rootLayer.clear();
m_glyphTable.clear();
m_idGlyphs.clear();
m_namedGlyphs.clear();
m_currentPriority = 0;
}
void dropNamedGlyphMap()
{
m_namedGlyphs.clear();
}
const SVGGlyph& svgGlyphForGlyph(Glyph glyph) const
{
if (!glyph || glyph > m_glyphTable.size()) {
DEFINE_STATIC_LOCAL(SVGGlyph, defaultGlyph, ());
return defaultGlyph;
}
return m_glyphTable[glyph - 1];
}
const SVGGlyph& glyphIdentifierForAltGlyphReference(const String& glyphIdentifier) const
{
return svgGlyphForGlyph(m_idGlyphs.get(glyphIdentifier));
}
const SVGGlyph& glyphIdentifierForGlyphName(const String& glyphName) const
{
return svgGlyphForGlyph(m_namedGlyphs.get(glyphName));
}
private:
template<typename Iterator>
PassRefPtr<GlyphMapNode> findOrCreateNode(Iterator& textIterator)
{
GlyphMapLayer* currentLayer = &m_rootLayer;
RefPtr<GlyphMapNode> node;
UChar32 character = 0;
unsigned clusterLength = 0;
while (textIterator.consume(character, clusterLength)) {
node = currentLayer->get(character);
if (!node) {
node = GlyphMapNode::create();
currentLayer->set(character, node);
}
currentLayer = &node->children;
textIterator.advance(clusterLength);
}
return node.release();
}
template<typename Iterator>
PassRefPtr<GlyphMapNode> findNode(Iterator& textIterator) const
{
const GlyphMapLayer* currentLayer = &m_rootLayer;
RefPtr<GlyphMapNode> node;
UChar32 character = 0;
unsigned clusterLength = 0;
while (textIterator.consume(character, clusterLength)) {
node = currentLayer->get(character);
if (!node)
break;
currentLayer = &node->children;
textIterator.advance(clusterLength);
}
return node.release();
}
template<typename Iterator>
void collectGlyphsForIterator(Iterator& textIterator, Vector<SVGGlyph>& glyphs)
{
GlyphMapLayer* currentLayer = &m_rootLayer;
UChar32 character = 0;
unsigned clusterLength = 0;
while (textIterator.consume(character, clusterLength)) {
RefPtr<GlyphMapNode> node = currentLayer->get(character);
if (!node)
break;
glyphs.appendVector(node->glyphs);
currentLayer = &node->children;
textIterator.advance(clusterLength);
}
}
GlyphMapLayer m_rootLayer;
Vector<SVGGlyph> m_glyphTable;
HashMap<String, Glyph> m_namedGlyphs;
HashMap<String, Glyph> m_idGlyphs;
int m_currentPriority;
};
}
#endif // ENABLE(SVG_FONTS)
#endif // SVGGlyphMap_h
|