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
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
|
/*******************************************************************
*
* ftxcmap.h 1.0
*
* API extension for iterating over Cmaps
*
* Copyright 1996-1999 by Juliusz Chroboczek,
* David Turner, Robert Wilhelm, and Werner Lemberg.
*
* This file is part of the FreeType project, and may only be used
* modified and distributed under the terms of the FreeType project
* license, LICENSE.TXT. By continuing to use, modify, or distribute
* this file you indicate that you have read the license and
* understand and accept it fully.
*
*
******************************************************************/
#include "ttconfig.h"
#include "ftxcmap.h"
#include "tttypes.h"
#include "ttobjs.h"
#include "tttables.h"
static Long charmap_first4 ( PCMap4, UShort* );
static Long charmap_next4 ( PCMap4, UShort, UShort* );
static Long charmap_last4 ( PCMap4, UShort* );
static UShort charmap_find_id4( PCMap4, UShort, TCMap4Segment*, UShort );
/*******************************************************************
*
* Function : TT_CharMap_First
*
* Description : Returns the first valid character code in a
* given character map. Also returns the corresponding
* glyph index.
*
* Input : charMap handle to the target character map
* id address where the glyph index will be
* be returned in case of success
*
* Output : First valid character code. -1 in case of failure.
*
* Notes :
*
******************************************************************/
EXPORT_FUNC
TT_Long TT_CharMap_First( TT_CharMap charMap,
TT_UShort* id )
{
PCMapTable cmap;
UShort i, c;
if ( !( cmap = HANDLE_CharMap( charMap ) ) )
return -1;
switch ( cmap->format )
{
case 0:
if ( id )
*id = cmap->c.cmap0.glyphIdArray[0];
return 0;
case 4:
return charmap_first4( &cmap->c.cmap4, id );
case 6:
if ( cmap->c.cmap6.entryCount < 1 )
return -1;
if ( id )
*id = cmap->c.cmap6.glyphIdArray[0];
return cmap->c.cmap6.firstCode;
default:
/* Now loop from 0 to 65535. We can't use a simple "for' on */
/* 16-bits systems, hence the "strange" loop here.. */
i = 0;
do
{
c = TT_Char_Index( charMap, i );
if ( c > 0 )
{
if ( id )
*id = c;
return i;
}
i++;
} while ( i != 0 ); /* because i is UShort! */
return -1;
}
}
static Long charmap_first4( PCMap4 cmap4,
UShort* id )
{
UShort firstCode;
if ( cmap4->segCountX2 / 2 < 1 )
return -1;
firstCode = cmap4->segments[0].startCount;
if ( id )
*id = charmap_find_id4( cmap4, firstCode, &(cmap4->segments[0]), 0 );
return firstCode;
}
/*******************************************************************
*
* Function : TT_CharMap_Next
*
* Description : Returns the next valid character code in a given
* charMap.
*
* Input : charMap handle to the target char. map
* index starting character code
* id address where the glyph index of the next
* character will be returned
*
* Output : Next valid character code after 'index'. -1 in case
* of failure.
*
* Notes :
*
******************************************************************/
EXPORT_FUNC
TT_Long TT_CharMap_Next( TT_CharMap charMap,
TT_UShort index,
TT_UShort* id )
{
PCMapTable cmap;
UShort i, c;
cmap = HANDLE_CharMap( charMap );
if ( !cmap )
return -1;
switch ( cmap->format )
{
case 0:
if ( index < 255 )
{
if ( id )
*id = cmap->c.cmap0.glyphIdArray[index + 1];
return index + 1;
}
else
return -1;
case 4:
return charmap_next4( &cmap->c.cmap4, index, id );
case 6:
{
UShort firstCode = cmap->c.cmap6.firstCode;
if ( index + 1 < firstCode + cmap->c.cmap6.entryCount )
{
if ( id )
*id = cmap->c.cmap6.glyphIdArray[index + 1 - firstCode];
return index + 1;
}
else
return -1;
}
default:
/* Now loop from 0 to 65535. We can't use a simple "for" on */
/* 16-bits systems, hence the "strange" loop here.. */
i = 0;
do
{
c = TT_Char_Index( charMap, i );
if ( c > 0 )
{
if ( id )
*id = c;
return i;
}
i++;
} while ( i != 0 ); /* because i is UShort! */
return -1;
}
}
static Long charmap_next4( PCMap4 cmap4,
UShort charCode,
UShort* id)
{
UShort segCount, nextCode;
UShort i;
TCMap4Segment seg4;
if ( charCode == 0xFFFF )
return -1; /* get it out of the way now */
segCount = cmap4->segCountX2 / 2;
for ( i = 0; i < segCount; i++ )
if ( charCode < cmap4->segments[i].endCount )
break;
/* Safety check - even though the last endCount should be 0xFFFF */
if ( i >= segCount )
return -1;
seg4 = cmap4->segments[i];
if ( charCode < seg4.startCount )
nextCode = seg4.startCount;
else
nextCode = charCode + 1;
if ( id )
*id = charmap_find_id4( cmap4, nextCode, &seg4, i );
return nextCode;
}
static UShort
charmap_find_id4( PCMap4 cmap4,
UShort charCode,
TCMap4Segment* seg4,
UShort i )
{
UShort index1;
if ( seg4->idRangeOffset == 0 )
return (charCode + seg4->idDelta) & 0xFFFF;
else
{
index1 = seg4->idRangeOffset / 2 + charCode-seg4->startCount -
( cmap4->segCountX2 / 2 - i );
if ( index1 >= cmap4->numGlyphId || cmap4->glyphIdArray[index1] == 0 )
return 0;
else
return (cmap4->glyphIdArray[index1] + seg4->idDelta) & 0xFFFF;
}
}
/*******************************************************************
*
* Function : TT_CharMap_Last
*
* Description : Returns the last valid character code in a
* given character map. Also returns the corresponding
* glyph index.
*
* Input : charMap handle to the target character map
* id address where the glyph index will be
* be returned in case of success
*
* Output : Last valid character code. -1 in case of failure.
*
* Notes :
*
******************************************************************/
EXPORT_FUNC
TT_Long TT_CharMap_Last( TT_CharMap charMap,
TT_UShort* id )
{
PCMapTable cmap;
UShort i, c;
if ( !( cmap = HANDLE_CharMap( charMap ) ) )
return -1;
switch ( cmap->format )
{
case 0:
if ( id )
*id = cmap->c.cmap0.glyphIdArray[255];
return 255;
case 4:
return charmap_last4( &cmap->c.cmap4, id );
case 6:
if ( cmap->c.cmap6.entryCount < 1 )
return -1;
if ( id )
*id = cmap->c.cmap6.glyphIdArray[cmap->c.cmap6.entryCount - 1];
return cmap->c.cmap6.firstCode + cmap->c.cmap6.entryCount - 1;
default:
i = 65535;
do
{
c = TT_Char_Index( charMap, i );
if ( c > 0 )
{
if ( id )
*id = c;
return i;
}
i--;
} while ( i != 0 );
return -1;
}
}
static Long charmap_last4( PCMap4 cmap4,
UShort* id )
{
UShort lastCode;
if ( cmap4->segCountX2 / 2 < 1 )
return -1;
lastCode = cmap4->segments[cmap4->segCountX2 / 2 - 1].endCount;
if ( id )
*id = charmap_find_id4( cmap4,
lastCode,
&(cmap4->segments[cmap4->segCountX2 / 2 - 1]),
0 );
return lastCode;
}
/* END */
|