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
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
// Description:
// Parse a string of features specified as & separated pairs.
// e.g.
// 1001=1&2002=2&fav1=0
#include <sal/types.h>
#include <osl/endian.h>
#ifdef WNT
#include <windows.h>
#endif
#include <graphite_features.hxx>
using namespace grutils;
// These mustn't conflict with font name lists which use ; and ,
const char GrFeatureParser::FEAT_PREFIX = ':';
const char GrFeatureParser::FEAT_SEPARATOR = '&';
const char GrFeatureParser::FEAT_ID_VALUE_SEPARATOR = '=';
GrFeatureParser::GrFeatureParser(const gr_face * pFace, const OString& lang)
: mnNumSettings(0), mbErrors(false), mpSettings(NULL)
{
maLang.label[0] = maLang.label[1] = maLang.label[2] = maLang.label[3] = '\0';
setLang(pFace, lang);
}
GrFeatureParser::GrFeatureParser(const gr_face * pFace, const OString& features, const OString& lang)
: mnNumSettings(0), mbErrors(false), mpSettings(NULL)
{
sal_Int32 nEquals = 0;
sal_Int32 nFeatEnd = 0;
sal_Int32 pos = 0;
maLang.num = 0u;
setLang(pFace, lang);
while ((pos < features.getLength()) && (mnNumSettings < MAX_FEATURES))
{
nEquals = features.indexOf(FEAT_ID_VALUE_SEPARATOR, pos);
if (nEquals == -1)
{
mbErrors = true;
break;
}
// check for a lang=xxx specification
const OString aLangPrefix("lang");
if (features.match(aLangPrefix, pos ))
{
pos = nEquals + 1;
nFeatEnd = features.indexOf(FEAT_SEPARATOR, pos);
if (nFeatEnd == -1)
{
nFeatEnd = features.getLength();
}
if (nFeatEnd - pos > 3)
mbErrors = true;
else
{
FeatId aLang = maLang;
aLang.num = 0;
for (sal_Int32 i = pos; i < nFeatEnd; i++)
aLang.label[i-pos] = features[i];
//ext_std::pair<gr::LanguageIterator,gr::LanguageIterator> aSupported
// = font.getSupportedLanguages();
//gr::LanguageIterator iL = aSupported.first;
unsigned short i = 0;
for (; i < gr_face_n_languages(pFace); i++)
{
gr_uint32 nFaceLang = gr_face_lang_by_index(pFace, i);
FeatId aSupportedLang;
aSupportedLang.num = nFaceLang;
#ifdef OSL_BIGENDIAN
// here we only expect full 3 letter codes
if (aLang.label[0] == aSupportedLang.label[0] &&
aLang.label[1] == aSupportedLang.label[1] &&
aLang.label[2] == aSupportedLang.label[2] &&
aLang.label[3] == aSupportedLang.label[3])
#else
if (aLang.label[0] == aSupportedLang.label[3] &&
aLang.label[1] == aSupportedLang.label[2] &&
aLang.label[2] == aSupportedLang.label[1] &&
aLang.label[3] == aSupportedLang.label[0])
#endif
{
maLang = aSupportedLang;
break;
}
}
if (i == gr_face_n_languages(pFace)) mbErrors = true;
else
{
mnHash = maLang.num;
mpSettings = gr_face_featureval_for_lang(pFace, maLang.num);
}
}
}
else
{
sal_uInt32 featId = 0;
if (isCharId(features, pos, nEquals - pos))
{
featId = getCharId(features, pos, nEquals - pos);
}
else
{
featId = getIntValue(features, pos, nEquals - pos);
}
const gr_feature_ref * pFref = gr_face_find_fref(pFace, featId);
pos = nEquals + 1;
nFeatEnd = features.indexOf(FEAT_SEPARATOR, pos);
if (nFeatEnd == -1)
{
nFeatEnd = features.getLength();
}
sal_Int16 featValue = 0;
featValue = getIntValue(features, pos, nFeatEnd - pos);
if (pFref && gr_fref_set_feature_value(pFref, featValue, mpSettings))
{
mnHash = (mnHash << 16) ^ ((featId << 8) | featValue);
mnNumSettings++;
}
else
mbErrors = true;
}
pos = nFeatEnd + 1;
}
}
void GrFeatureParser::setLang(const gr_face * pFace, const OString & lang)
{
FeatId aLang;
aLang.num = 0;
if (lang.getLength() >= 2)
{
for (sal_Int32 i = 0; i < lang.getLength() && i < 3; i++)
{
if (lang[i] == '-') break;
aLang.label[i] = lang[i];
}
unsigned short i = 0;
for (; i < gr_face_n_languages(pFace); i++)
{
gr_uint32 nFaceLang = gr_face_lang_by_index(pFace, i);
FeatId aSupportedLang;
aSupportedLang.num = nFaceLang;
// here we only expect full 2 & 3 letter codes
#ifdef OSL_BIGENDIAN
if (aLang.label[0] == aSupportedLang.label[0] &&
aLang.label[1] == aSupportedLang.label[1] &&
aLang.label[2] == aSupportedLang.label[2] &&
aLang.label[3] == aSupportedLang.label[3])
#else
if (aLang.label[0] == aSupportedLang.label[3] &&
aLang.label[1] == aSupportedLang.label[2] &&
aLang.label[2] == aSupportedLang.label[1] &&
aLang.label[3] == aSupportedLang.label[0])
#endif
{
maLang = aSupportedLang;
break;
}
}
if (i != gr_face_n_languages(pFace))
{
if (mpSettings)
gr_featureval_destroy(mpSettings);
mpSettings = gr_face_featureval_for_lang(pFace, maLang.num);
mnHash = maLang.num;
}
}
if (!mpSettings)
mpSettings = gr_face_featureval_for_lang(pFace, 0);
}
GrFeatureParser::~GrFeatureParser()
{
if (mpSettings)
{
gr_featureval_destroy(mpSettings);
mpSettings = NULL;
}
}
bool GrFeatureParser::isCharId(const OString & id, size_t offset, size_t length)
{
if (length > 4) return false;
for (size_t i = 0; i < length; i++)
{
if (i > 0 && id[offset+i] == '\0') continue;
if (id[offset+i] < 0x20 || static_cast<signed char>(id[offset+i]) < 0)
return false;
if (i==0 && (id[offset+i] < 0x41))
return false;
}
return true;
}
gr_uint32 GrFeatureParser::getCharId(const OString & id, size_t offset, size_t length)
{
FeatId charId;
charId.num = 0;
#ifdef OSL_BIGENDIAN
for (size_t i = 0; i < length; i++)
{
charId.label[i] = id[offset+i];
}
#else
for (size_t i = 0; i < length; i++)
{
charId.label[3-i] = id[offset+i];
}
#endif
return charId.num;
}
short GrFeatureParser::getIntValue(const OString & id, size_t offset, size_t length)
{
short value = 0;
int sign = 1;
for (size_t i = 0; i < length; i++)
{
switch (id[offset + i])
{
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
value *= 10;
if (sign < 0)
{
value = -(id[offset + i] - '0');
sign = 1;
}
value += (id[offset + i] - '0');
break;
case '-':
if (i == 0)
sign = -1;
else
{
mbErrors = true;
break;
}
default:
mbErrors = true;
break;
}
}
return value;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
