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
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* (C) 1988, 1989, 1990 by Adobe Systems Incorporated. All rights reserved.
*
* This file may be freely copied and redistributed as long as:
* 1) This entire notice continues to be included in the file,
* 2) If the file has been modified in any way, a notice of such
* modification is conspicuously indicated.
*
* PostScript, Display PostScript, and Adobe are registered trademarks of
* Adobe Systems Incorporated.
*
* ************************************************************************
* THE INFORMATION BELOW IS FURNISHED AS IS, IS SUBJECT TO CHANGE WITHOUT
* NOTICE, AND SHOULD NOT BE CONSTRUED AS A COMMITMENT BY ADOBE SYSTEMS
* INCORPORATED. ADOBE SYSTEMS INCORPORATED ASSUMES NO RESPONSIBILITY OR
* LIABILITY FOR ANY ERRORS OR INACCURACIES, MAKES NO WARRANTY OF ANY
* KIND (EXPRESS, IMPLIED OR STATUTORY) WITH RESPECT TO THIS INFORMATION,
* AND EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR PARTICULAR PURPOSES AND NONINFRINGEMENT OF THIRD PARTY RIGHTS.
* ************************************************************************
*/
/*
* Changes made for OpenOffice.org
*
* 10/24/2000 pl - changed code to compile with c++-compilers
* - added namespace to avoid symbol clashes
* - replaced BOOL by bool
* - added function to free space allocated by parseFile
* 10/26/2000 pl - added additional keys
* - added ability to parse slightly broken files
* - added charwidth member to GlobalFontInfo
* 04/26/2001 pl - added OpenOffice header
* 10/19/2005 pl - performance increase:
* - fread file in one pass
* - replace file io by buffer access
* 10/20/2005 pl - performance increase:
* - use one table lookup in token() routine
* instead of many conditions
* - return token length in token() routine
* - use hash lookup instead of binary search
* in recognize() routine
*/
/* parseAFM.c
*
* This file is used in conjunction with the parseAFM.h header file.
* This file contains several procedures that are used to parse AFM
* files. It is intended to work with an application program that needs
* font metric information. The program can be used as is by making a
* procedure call to "parseFile" (passing in the expected parameters)
* and having it fill in a data structure with the data from the
* AFM file, or an application developer may wish to customize this
* code.
*
* There is also a file, parseAFMclient.c, that is a sample application
* showing how to call the "parseFile" procedure and how to use the data
* after "parseFile" has returned.
*
* Please read the comments in parseAFM.h and parseAFMclient.c.
*
* History:
* original: DSM Thu Oct 20 17:39:59 PDT 1988
* modified: DSM Mon Jul 3 14:17:50 PDT 1989
* - added 'storageProblem' return code
* - fixed bug of not allocating extra byte for string duplication
* - fixed typos
* modified: DSM Tue Apr 3 11:18:34 PDT 1990
* - added free(ident) at end of parseFile routine
* modified: DSM Tue Jun 19 10:16:29 PDT 1990
* - changed (width == 250) to (width = 250) in initializeArray
*/
#include <string.h>
#include <stdlib.h>
#include <sys/stat.h>
#include "parseAFM.hxx"
#include <vcl/strhelper.hxx>
#include "rtl/alloc.h"
#define lineterm EOL /* line terminating character */
#define normalEOF 1 /* return code from parsing routines used only */
/* in this module */
#define False "false" /* used in string comparison to check the value of */
/* boolean keys (e.g. IsFixedPitch) */
#define MATCH(A,B) (strncmp((A),(B), MAX_NAME) == 0)
namespace psp {
class FileInputStream
{
char* m_pMemory;
unsigned int m_nPos;
unsigned int m_nLen;
public:
explicit FileInputStream( const char* pFilename );
~FileInputStream();
int getChar() { return (m_nPos < m_nLen) ? int(m_pMemory[m_nPos++]) : -1; }
void ungetChar()
{
if( m_nPos > 0 )
m_nPos--;
}
};
FileInputStream::FileInputStream(const char* pFilename)
: m_pMemory(nullptr)
, m_nPos(0)
, m_nLen(0)
{
FILE* fp = fopen( pFilename, "r" );
if( fp )
{
struct stat aStat;
if (!fstat(fileno(fp), &aStat) && S_ISREG(aStat.st_mode) && aStat.st_size > 0)
{
m_pMemory = static_cast<char*>(rtl_allocateMemory( aStat.st_size ));
m_nLen = (unsigned int)fread( m_pMemory, 1, aStat.st_size, fp );
}
fclose( fp );
}
}
FileInputStream::~FileInputStream()
{
rtl_freeMemory( m_pMemory );
}
/*************************** GLOBALS ***********************/
/* "shorts" for fast case statement
* The values of each of these enumerated items correspond to an entry in the
* table of strings defined below. Therefore, if you add a new string as
* new keyword into the keyStrings table, you must also add a corresponding
* parseKey AND it MUST be in the same position!
*
* IMPORTANT: since the sorting algorithm is a binary search, the strings of
* keywords must be placed in lexicographical order, below. [Therefore, the
* enumerated items are not necessarily in lexicographical order, depending
* on the name chosen. BUT, they must be placed in the same position as the
* corresponding key string.] The NOPE shall remain in the last position,
* since it does not correspond to any key string, and it is used in the
* "recognize" procedure to calculate how many possible keys there are.
*/
// some metrics have Ascent, Descent instead Ascender, Descender or Em
// which is not allowed per afm spcification, but let us handle
// this gently
enum parseKey {
ASCENDER, ASCENT, CHARBBOX, CODE, COMPCHAR, CODEHEX, CAPHEIGHT, CHARWIDTH, CHARACTERSET, CHARACTERS, COMMENT,
DESCENDER, DESCENT, EM, ENCODINGSCHEME, ENDCHARMETRICS, ENDCOMPOSITES, ENDDIRECTION,
ENDFONTMETRICS, ENDKERNDATA, ENDKERNPAIRS, ENDTRACKKERN,
FAMILYNAME, FONTBBOX, FONTNAME, FULLNAME, ISBASEFONT, ISFIXEDPITCH,
ITALICANGLE, KERNPAIR, KERNPAIRXAMT, LIGATURE, MAPPINGSCHEME, METRICSSETS, CHARNAME,
NOTICE, COMPCHARPIECE, STARTCHARMETRICS, STARTCOMPOSITES, STARTDIRECTION,
STARTFONTMETRICS, STARTKERNDATA, STARTKERNPAIRS,
STARTTRACKKERN, STDHW, STDVW, TRACKKERN, UNDERLINEPOSITION,
UNDERLINETHICKNESS, VVECTOR, VERSION, XYWIDTH, X0WIDTH, XWIDTH, WEIGHT, XHEIGHT,
NOPE
};
/*************************** PARSING ROUTINES **************/
/*************************** token *************************/
/* A "AFM file Conventions" tokenizer. That means that it will
* return the next token delimited by white space. See also
* the `linetoken' routine, which does a similar thing but
* reads all tokens until the next end-of-line.
*/
// token white space is ' ', '\n', '\r', ',', '\t', ';'
static const bool is_white_Array[ 256 ] =
{ false, false, false, false, false, false, false, false, // 0-7
false, true, true, false, false, true, false, false, // 8-15
false, false, false, false, false, false, false, false, // 16-23
false, false, false, false, false, false, false, false, // 24-31
true, false, false, false, false, false, false, false, // 32-39
false, false, false, false, true, false, false, false, // 40-47
false, false, false, false, false, false, false, false, // 48-55
false, false, false, true, false, false, false, false, // 56-63
false, false, false, false, false, false, false, false, // 64 -
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, // 127
false, false, false, false, false, false, false, false, // 128 -
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, // 191
false, false, false, false, false, false, false, false, // 192 -
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, // 255
};
// token delimiters are ' ', '\n', '\r', '\t', ':', ';'
static const bool is_delimiter_Array[ 256 ] =
{ false, false, false, false, false, false, false, false, // 0-7
false, true, true, false, false, true, false, false, // 8-15
false, false, false, false, false, false, false, false, // 16-23
false, false, false, false, false, false, false, false, // 24-31
true, false, false, false, false, false, false, false, // 32-39
false, false, false, false, false, false, false, false, // 40-47
false, false, false, false, false, false, false, false, // 48-55
false, false, true, true, false, false, false, false, // 56-63
false, false, false, false, false, false, false, false, // 64 -
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, // 127
false, false, false, false, false, false, false, false, // 128 -
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, // 191
false, false, false, false, false, false, false, false, // 192 -
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, // 255
};
static char *token( FileInputStream* stream, int& rLen )
{
static char ident[MAX_NAME]; /* storage buffer for keywords */
int ch, idx;
/* skip over white space */
// relies on EOF = -1
while( is_white_Array[ (ch = stream->getChar()) & 255 ] )
;
idx = 0;
while( ch != -1 && ! is_delimiter_Array[ ch & 255 ] && idx < MAX_NAME-1 )
{
ident[idx++] = ch;
ch = stream->getChar();
}
if (ch == -1 && idx < 1) return (nullptr);
if (idx >= 1 && ch != ':' && ch != -1) stream->ungetChar();
if (idx < 1 ) ident[idx++] = ch; /* single-character token */
ident[idx] = 0;
rLen = idx;
return ident; /* returns pointer to the token */
} /* token */
/*************************** linetoken *************************/
/* "linetoken" will get read all tokens until the EOL character from
* the given stream. This is used to get any arguments that can be
* more than one word (like Comment lines and FullName).
*/
static char *linetoken( FileInputStream* stream )
{
static char ident[MAX_NAME]; /* storage buffer for keywords */
int ch, idx;
while ((ch = stream->getChar()) == ' ' || ch == '\t' ) ;
idx = 0;
while (ch != -1 && ch != lineterm && ch != '\r' && idx < MAX_NAME-1 )
{
ident[idx++] = ch;
ch = stream->getChar();
} /* while */
stream->ungetChar();
ident[idx] = 0;
return ident; /* returns pointer to the token */
} /* linetoken */
/*************************** recognize *************************/
/* This function tries to match a string to a known list of
* valid AFM entries (check the keyStrings array above).
* "ident" contains everything from white space through the
* next space, tab, or ":" character.
*
* The algorithm is a standard Knuth binary search.
*/
#if defined __clang__
#if __has_warning("-Wdeprecated-register")
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wdeprecated-register"
#endif
#endif
#include "afm_hash.hpp"
#if defined __clang__
#if __has_warning("-Wdeprecated-register")
#pragma GCC diagnostic pop
#endif
#endif
static inline enum parseKey recognize( char* ident, int len)
{
const hash_entry* pEntry = AfmKeywordHash::in_word_set( ident, len );
return pEntry ? pEntry->eKey : NOPE;
} /* recognize */
/************************* parseGlobals *****************************/
/* This function is called by "parseFile". It will parse the AFM file
* up to the "StartCharMetrics" keyword, which essentially marks the
* end of the Global Font Information and the beginning of the character
* metrics information.
*
* If the caller of "parseFile" specified that it wanted the Global
* Font Information (as defined by the "AFM file Specification"
* document), then that information will be stored in the returned
* data structure.
*
* Any Global Font Information entries that are not found in a
* given file, will have the usual default initialization value
* for its type (i.e. entries of type int will be 0, etc).
*
* This function returns an error code specifying whether there was
* a premature EOF or a parsing error. This return value is used by
* parseFile to determine if there is more file to parse.
*/
static int parseGlobals( FileInputStream* fp, GlobalFontInfo* gfi )
{
bool cont = true, save = (gfi != nullptr);
int error = ok;
int direction = -1;
int tokenlen;
while (cont)
{
char *keyword = token(fp, tokenlen);
if (keyword == nullptr)
/* Have reached an early and unexpected EOF. */
/* Set flag and stop parsing */
{
error = earlyEOF;
break; /* get out of loop */
}
if (!save)
/* get tokens until the end of the Global Font info section */
/* without saving any of the data */
switch (recognize(keyword, tokenlen))
{
case STARTCHARMETRICS:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
default:
break;
} /* switch */
else
/* otherwise parse entire global font info section, */
/* saving the data */
switch(recognize(keyword, tokenlen))
{
case STARTFONTMETRICS:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->afmVersion = strdup( keyword );
break;
case COMMENT:
linetoken(fp);
break;
case FONTNAME:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->fontName = strdup( keyword );
break;
case ENCODINGSCHEME:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->encodingScheme = strdup( keyword );
break;
case FULLNAME:
if ((keyword = linetoken(fp)) != nullptr)
gfi->fullName = strdup( keyword );
break;
case FAMILYNAME:
if ((keyword = linetoken(fp)) != nullptr)
gfi->familyName = strdup( keyword );
break;
case WEIGHT:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->weight = strdup( keyword );
break;
case ITALICANGLE:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->italicAngle = StringToDouble( keyword );
break;
case ISFIXEDPITCH:
if ((keyword = token(fp,tokenlen)) != nullptr)
{
if (MATCH(keyword, False))
gfi->isFixedPitch = false;
else
gfi->isFixedPitch = true;
}
break;
case UNDERLINEPOSITION:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->underlinePosition = atoi(keyword);
break;
case UNDERLINETHICKNESS:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->underlineThickness = atoi(keyword);
break;
case VERSION:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->version = strdup( keyword );
break;
case NOTICE:
if ((keyword = linetoken(fp)) != nullptr)
gfi->notice = strdup( keyword );
break;
case FONTBBOX:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->fontBBox.llx = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->fontBBox.lly = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->fontBBox.urx = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->fontBBox.ury = atoi(keyword);
break;
case CAPHEIGHT:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->capHeight = atoi(keyword);
break;
case XHEIGHT:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->xHeight = atoi(keyword);
break;
case DESCENT:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->descender = -atoi(keyword);
break;
case DESCENDER:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->descender = atoi(keyword);
break;
case ASCENT:
case ASCENDER:
if ((keyword = token(fp,tokenlen)) != nullptr)
gfi->ascender = atoi(keyword);
break;
case STARTCHARMETRICS:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
case EM:
// skip one token
token(fp,tokenlen);
break;
case STARTDIRECTION:
if ((keyword = token(fp,tokenlen)) != nullptr)
direction = atoi(keyword);
break; /* ignore this for now */
case ENDDIRECTION:
break; /* ignore this for now */
case MAPPINGSCHEME:
token(fp,tokenlen);
break; /* ignore this for now */
case CHARACTERS:
token(fp,tokenlen);
break; /* ignore this for now */
case ISBASEFONT:
token(fp,tokenlen);
break; /* ignore this for now */
case CHARACTERSET:
token(fp,tokenlen); //ignore
break;
case STDHW:
token(fp,tokenlen); //ignore
break;
case STDVW:
token(fp,tokenlen); //ignore
break;
case CHARWIDTH:
if ((keyword = token(fp,tokenlen)) != nullptr)
{
if (direction == 0)
gfi->charwidth = atoi(keyword);
}
token(fp,tokenlen);
/* ignore y-width for now */
break;
case METRICSSETS:
token(fp,tokenlen); /*eat token*/
break; /* ignore this for now */
case NOPE:
default:
error = parseError;
break;
} /* switch */
} /* while */
return error;
} /* parseGlobals */
/************************* parseCharWidths **************************/
/* This function is called by "parseFile". It will parse the AFM file
* up to the "EndCharMetrics" keyword. It will save the character
* width info (as opposed to all of the character metric information)
* if requested by the caller of parseFile. Otherwise, it will just
* parse through the section without saving any information.
*
* If data is to be saved, parseCharWidths is passed in a pointer
* to an array of widths that has already been initialized by the
* standard value for unmapped character codes. This function parses
* the Character Metrics section only storing the width information
* for the encoded characters into the array using the character code
* as the index into that array.
*
* This function returns an error code specifying whether there was
* a premature EOF or a parsing error. This return value is used by
* parseFile to determine if there is more file to parse.
*/
static int parseCharWidths( FileInputStream* fp, int* cwi)
{
bool cont = true, save = (cwi != nullptr);
int pos = 0, error = ok, tokenlen;
while (cont)
{
char *keyword = token(fp,tokenlen);
/* Have reached an early and unexpected EOF. */
/* Set flag and stop parsing */
if (keyword == nullptr)
{
error = earlyEOF;
break; /* get out of loop */
}
if (!save)
/* get tokens until the end of the Char Metrics section without */
/* saving any of the data*/
switch (recognize(keyword,tokenlen))
{
case ENDCHARMETRICS:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
default:
break;
} /* switch */
else
/* otherwise parse entire char metrics section, saving */
/* only the char x-width info */
switch(recognize(keyword,tokenlen))
{
case COMMENT:
linetoken(fp); /*eat token*/
break;
case CODE:
if ((keyword = token(fp,tokenlen)) != nullptr)
pos = atoi(keyword);
break;
case XYWIDTH:
/* PROBLEM: Should be no Y-WIDTH when doing "quick & dirty" */
token(fp,tokenlen); token(fp,tokenlen); /* eat values */
error = parseError;
break;
case CODEHEX:
if ((keyword = token(fp,tokenlen)) != nullptr)
sscanf(keyword, "<%x>", &pos);
break;
case X0WIDTH:
(void) token(fp,tokenlen);
break;
case XWIDTH:
if ((keyword = token(fp,tokenlen)) != nullptr)
if (pos >= 0) /* ignore unmapped chars */
cwi[pos] = atoi(keyword);
break;
case ENDCHARMETRICS:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
case CHARNAME: /* eat values (so doesn't cause parseError) */
token(fp,tokenlen);
break;
case CHARBBOX:
token(fp,tokenlen); token(fp,tokenlen);
token(fp,tokenlen); token(fp,tokenlen);
break;
case LIGATURE:
token(fp,tokenlen); token(fp,tokenlen);
break;
case VVECTOR:
token(fp,tokenlen); /*eat token*/
token(fp,tokenlen); /*eat token*/
break;
case NOPE:
default:
error = parseError;
break;
} /* switch */
} /* while */
return error;
} /* parseCharWidths */
/*
* number of char metrics is almost always inaccurate, so be gentle and try to
* adapt our internal storage by adjusting the allocated list
*/
static int
reallocFontMetrics( void **pp_fontmetrics, int *p_oldcount, int n_newcount, unsigned int n_size )
{
char *p_tmpmetrics = nullptr;
if ((pp_fontmetrics == nullptr) || (*pp_fontmetrics == nullptr))
return storageProblem;
if (*p_oldcount == n_newcount)
return ok;
p_tmpmetrics = static_cast<char*>(realloc(*pp_fontmetrics, n_newcount * n_size));
if (p_tmpmetrics == nullptr)
return storageProblem;
if ( n_newcount > *p_oldcount )
{
char *p_inimetrics = p_tmpmetrics + n_size * *p_oldcount;
int n_inimetrics = n_size * (n_newcount - *p_oldcount);
memset( p_inimetrics, 0, n_inimetrics );
}
*pp_fontmetrics = p_tmpmetrics;
*p_oldcount = n_newcount;
return ok;
}
static unsigned int
enlargeCount( unsigned int n_oldcount )
{
unsigned int n_newcount = n_oldcount + n_oldcount / 5;
if (n_oldcount == n_newcount )
n_newcount = n_oldcount + 5;
return n_newcount;
}
/************************* parseCharMetrics ************************/
/* This function is called by parseFile if the caller of parseFile
* requested that all character metric information be saved
* (as opposed to only the character width information).
*
* parseCharMetrics is passed in a pointer to an array of records
* to hold information on a per character basis. This function
* parses the Character Metrics section storing all character
* metric information for the ALL characters (mapped and unmapped)
* into the array.
*
* This function returns an error code specifying whether there was
* a premature EOF or a parsing error. This return value is used by
* parseFile to determine if there is more file to parse.
*/
static int parseCharMetrics( FileInputStream* fp, FontInfo* fi)
{
bool cont = true, firstTime = true;
int error = ok, count = 0, tokenlen;
CharMetricInfo *temp = fi->cmi;
while (cont)
{
char *keyword = token(fp,tokenlen);
if (keyword == nullptr)
{
error = earlyEOF;
break; /* get out of loop */
}
switch(recognize(keyword,tokenlen))
{
case COMMENT:
linetoken(fp); /*eat token*/
break;
case CODE:
if (!(count < fi->numOfChars))
{
reallocFontMetrics( reinterpret_cast<void**>(&fi->cmi),
&(fi->numOfChars), enlargeCount(fi->numOfChars),
sizeof(CharMetricInfo) );
temp = &(fi->cmi[ count - 1 ]);
}
if (count < fi->numOfChars)
{
if (firstTime) firstTime = false;
else temp++;
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->code = atoi(keyword);
if (fi->gfi && fi->gfi->charwidth)
temp->wx = fi->gfi->charwidth;
count++;
}
else
{
error = parseError;
cont = false;
}
break;
case CODEHEX:
if (!(count < fi->numOfChars ))
{
reallocFontMetrics( reinterpret_cast<void**>(&fi->cmi),
&(fi->numOfChars), enlargeCount(fi->numOfChars),
sizeof(CharMetricInfo) );
temp = &(fi->cmi[ count - 1 ]);
}
if (count < fi->numOfChars) {
if (firstTime)
firstTime = false;
else
temp++;
if ((keyword = token(fp,tokenlen)) != nullptr)
sscanf(keyword,"<%x>", &temp->code);
if (fi->gfi && fi->gfi->charwidth)
temp->wx = fi->gfi->charwidth;
count++;
}
else {
error = parseError;
cont = false;
}
break;
case XYWIDTH:
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->wx = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->wy = atoi(keyword);
break;
case X0WIDTH:
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->wx = atoi(keyword);
break;
case XWIDTH:
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->wx = atoi(keyword);
break;
case CHARNAME:
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->name = strdup(keyword);
break;
case CHARBBOX:
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->charBBox.llx = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->charBBox.lly = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->charBBox.urx = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
temp->charBBox.ury = atoi(keyword);
break;
case LIGATURE: {
Ligature **tail = &(temp->ligs);
Ligature *node = *tail;
if (*tail != nullptr)
{
while (node->next != nullptr)
node = node->next;
tail = &(node->next);
}
*tail = static_cast<Ligature *>(calloc(1, sizeof(Ligature)));
if ((keyword = token(fp,tokenlen)) != nullptr)
(*tail)->succ = strdup(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
(*tail)->lig = strdup(keyword);
break; }
case ENDCHARMETRICS:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
case VVECTOR:
token(fp,tokenlen); /*eat token*/
token(fp,tokenlen); /*eat token*/
break;
case NOPE:
default:
error = parseError;
break;
} /* switch */
} /* while */
if ((error == ok) && (count != fi->numOfChars))
error = reallocFontMetrics( reinterpret_cast<void**>(&fi->cmi), &(fi->numOfChars),
count, sizeof(CharMetricInfo) );
if ((error == ok) && (count != fi->numOfChars))
error = parseError;
return error;
} /* parseCharMetrics */
/************************* parseTrackKernData ***********************/
/* This function is called by "parseFile". It will parse the AFM file
* up to the "EndTrackKern" or "EndKernData" keywords. It will save the
* track kerning data if requested by the caller of parseFile.
*
* parseTrackKernData is passed in a pointer to the FontInfo record.
* If data is to be saved, the FontInfo record will already contain
* a valid pointer to storage for the track kerning data.
*
* This function returns an error code specifying whether there was
* a premature EOF or a parsing error. This return value is used by
* parseFile to determine if there is more file to parse.
*/
static int parseTrackKernData( FileInputStream* fp, FontInfo* fi)
{
bool cont = true, save = (fi->tkd != nullptr);
int pos = 0, error = ok, tcount = 0, tokenlen;
while (cont)
{
char *keyword = token(fp,tokenlen);
if (keyword == nullptr)
{
error = earlyEOF;
break; /* get out of loop */
}
if (!save)
/* get tokens until the end of the Track Kerning Data */
/* section without saving any of the data */
switch(recognize(keyword,tokenlen))
{
case ENDTRACKKERN:
case ENDKERNDATA:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
default:
break;
} /* switch */
else
/* otherwise parse entire Track Kerning Data section, */
/* saving the data */
switch(recognize(keyword,tokenlen))
{
case COMMENT:
linetoken(fp); /*eat token*/
break;
case TRACKKERN:
if (!(tcount < fi->numOfTracks))
{
reallocFontMetrics( reinterpret_cast<void**>(&fi->tkd), &(fi->numOfTracks),
enlargeCount(fi->numOfTracks), sizeof(TrackKernData) );
}
if (tcount < fi->numOfTracks)
{
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->tkd[pos].degree = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->tkd[pos].minPtSize = StringToDouble(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->tkd[pos].minKernAmt = StringToDouble(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->tkd[pos].maxPtSize = StringToDouble(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->tkd[pos++].maxKernAmt = StringToDouble(keyword);
tcount++;
}
else
{
error = parseError;
cont = false;
}
break;
case ENDTRACKKERN:
case ENDKERNDATA:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
case NOPE:
default:
error = parseError;
break;
} /* switch */
} /* while */
if (error == ok && tcount != fi->numOfTracks)
error = reallocFontMetrics( reinterpret_cast<void**>(&fi->tkd), &(fi->numOfTracks),
tcount, sizeof(TrackKernData) );
if (error == ok && tcount != fi->numOfTracks)
error = parseError;
return error;
} /* parseTrackKernData */
/************************* parsePairKernData ************************/
/* This function is called by "parseFile". It will parse the AFM file
* up to the "EndKernPairs" or "EndKernData" keywords. It will save
* the pair kerning data if requested by the caller of parseFile.
*
* parsePairKernData is passed in a pointer to the FontInfo record.
* If data is to be saved, the FontInfo record will already contain
* a valid pointer to storage for the pair kerning data.
*
* This function returns an error code specifying whether there was
* a premature EOF or a parsing error. This return value is used by
* parseFile to determine if there is more file to parse.
*/
static int parsePairKernData( FileInputStream* fp, FontInfo* fi)
{
bool cont = true, save = (fi->pkd != nullptr);
int pos = 0, error = ok, pcount = 0, tokenlen;
while (cont)
{
char *keyword = token(fp,tokenlen);
if (keyword == nullptr)
{
error = earlyEOF;
break; /* get out of loop */
}
if (!save)
/* get tokens until the end of the Pair Kerning Data */
/* section without saving any of the data */
switch(recognize(keyword,tokenlen))
{
case ENDKERNPAIRS:
case ENDKERNDATA:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
default:
break;
} /* switch */
else
/* otherwise parse entire Pair Kerning Data section, */
/* saving the data */
switch(recognize(keyword,tokenlen))
{
case COMMENT:
linetoken(fp); /*eat token*/
break;
case KERNPAIR:
if (!(pcount < fi->numOfPairs))
{
reallocFontMetrics( reinterpret_cast<void**>(&fi->pkd), &(fi->numOfPairs),
enlargeCount(fi->numOfPairs), sizeof(PairKernData) );
}
if (pcount < fi->numOfPairs)
{
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->pkd[pos].name1 = strdup( keyword );
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->pkd[pos].name2 = strdup( keyword );
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->pkd[pos].xamt = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->pkd[pos++].yamt = atoi(keyword);
pcount++;
}
else
{
error = parseError;
cont = false;
}
break;
case KERNPAIRXAMT:
if (!(pcount < fi->numOfPairs))
{
reallocFontMetrics( reinterpret_cast<void**>(&fi->pkd), &(fi->numOfPairs),
enlargeCount(fi->numOfPairs), sizeof(PairKernData) );
}
if (pcount < fi->numOfPairs)
{
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->pkd[pos].name1 = strdup( keyword );
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->pkd[pos].name2 = strdup( keyword );
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->pkd[pos++].xamt = atoi(keyword);
pcount++;
}
else
{
error = parseError;
cont = false;
}
break;
case ENDKERNPAIRS:
case ENDKERNDATA:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
case NOPE:
default:
error = parseError;
break;
} /* switch */
} /* while */
if ((error == ok) && (pcount != fi->numOfPairs))
error = reallocFontMetrics( reinterpret_cast<void**>(&fi->pkd), &(fi->numOfPairs),
pcount, sizeof(PairKernData) );
if (error == ok && pcount != fi->numOfPairs)
error = parseError;
return error;
} /* parsePairKernData */
/************************* parseCompCharData **************************/
/* This function is called by "parseFile". It will parse the AFM file
* up to the "EndComposites" keyword. It will save the composite
* character data if requested by the caller of parseFile.
*
* parseCompCharData is passed in a pointer to the FontInfo record, and
* a boolean representing if the data should be saved.
*
* This function will create the appropriate amount of storage for
* the composite character data and store a pointer to the storage
* in the FontInfo record.
*
* This function returns an error code specifying whether there was
* a premature EOF or a parsing error. This return value is used by
* parseFile to determine if there is more file to parse.
*/
static int parseCompCharData( FileInputStream* fp, FontInfo* fi)
{
bool cont = true, firstTime = true, save = (fi->ccd != nullptr);
int pos = 0, j = 0, error = ok, ccount = 0, pcount = 0, tokenlen;
while (cont)
{
char *keyword = token(fp,tokenlen);
if (keyword == nullptr)
/* Have reached an early and unexpected EOF. */
/* Set flag and stop parsing */
{
error = earlyEOF;
break; /* get out of loop */
}
if (ccount > fi->numOfComps)
{
reallocFontMetrics( reinterpret_cast<void**>(&fi->ccd), &(fi->numOfComps),
enlargeCount(fi->numOfComps), sizeof(CompCharData) );
}
if (ccount > fi->numOfComps)
{
error = parseError;
break; /* get out of loop */
}
if (!save)
/* get tokens until the end of the Composite Character info */
/* section without saving any of the data */
switch(recognize(keyword,tokenlen))
{
case ENDCOMPOSITES:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
case COMMENT:
case COMPCHAR:
linetoken(fp);
break;
default:
break;
} /* switch */
else
/* otherwise parse entire Composite Character info section, */
/* saving the data */
switch(recognize(keyword,tokenlen))
{
case COMMENT:
linetoken(fp); /*eat token*/
break;
case COMPCHAR:
if (!(ccount < fi->numOfComps))
{
reallocFontMetrics( reinterpret_cast<void**>(&fi->ccd), &(fi->numOfComps),
enlargeCount(fi->numOfComps), sizeof(CompCharData) );
}
if (ccount < fi->numOfComps)
{
keyword = token(fp,tokenlen);
if (pcount != fi->ccd[pos].numOfPieces)
error = parseError;
pcount = 0;
if (firstTime) firstTime = false;
else pos++;
fi->ccd[pos].ccName = strdup( keyword );
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->ccd[pos].numOfPieces = atoi(keyword);
fi->ccd[pos].pieces = static_cast<Pcc *>(
calloc(fi->ccd[pos].numOfPieces, sizeof(Pcc)));
j = 0;
ccount++;
}
else
{
error = parseError;
cont = false;
}
break;
case COMPCHARPIECE:
if (pcount < fi->ccd[pos].numOfPieces)
{
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->ccd[pos].pieces[j].pccName = strdup( keyword );
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->ccd[pos].pieces[j].deltax = atoi(keyword);
if ((keyword = token(fp,tokenlen)) != nullptr)
fi->ccd[pos].pieces[j++].deltay = atoi(keyword);
pcount++;
}
else
error = parseError;
break;
case ENDCOMPOSITES:
cont = false;
break;
case ENDFONTMETRICS:
cont = false;
error = normalEOF;
break;
case NOPE:
default:
error = parseError;
break;
} /* switch */
} /* while */
if (error == ok && ccount != fi->numOfComps)
reallocFontMetrics( reinterpret_cast<void**>(&fi->ccd), &(fi->numOfComps),
ccount, sizeof(CompCharData) );
if (error == ok && ccount != fi->numOfComps)
error = parseError;
return error;
} /* parseCompCharData */
/*************************** 'PUBLIC' FUNCTION ********************/
/*************************** parseFile *****************************/
/* parseFile is the only 'public' procedure available. It is called
* from an application wishing to get information from an AFM file.
* The caller of this function is responsible for locating and opening
* an AFM file and handling all errors associated with that task.
*
* parseFile expects 3 parameters: a filename pointer, a pointer
* to a (FontInfo *) variable (for which storage will be allocated and
* the data requested filled in), and a mask specifying which
* data from the AFM file should be saved in the FontInfo structure.
*
* The file will be parsed and the requested data will be stored in
* a record of type FontInfo (refer to ParseAFM.h).
*
* parseFile returns an error code as defined in parseAFM.h.
*
* The position of the read/write pointer associated with the file
* pointer upon return of this function is undefined.
*/
int parseFile( const char* pFilename, FontInfo** fi, FLAGS flags)
{
FileInputStream aFile( pFilename );
int code = ok; /* return code from each of the parsing routines */
int error = ok; /* used as the return code from this function */
int tokenlen;
char *keyword; /* used to store a token */
(*fi) = static_cast<FontInfo *>(calloc(1, sizeof(FontInfo)));
if ((*fi) == nullptr) { error = storageProblem; return error; }
if (flags & P_G)
{
(*fi)->gfi = static_cast<GlobalFontInfo *>(calloc(1, sizeof(GlobalFontInfo)));
if ((*fi)->gfi == nullptr) { error = storageProblem; return error; }
}
/* The AFM file begins with Global Font Information. This section */
/* will be parsed whether or not information should be saved. */
code = parseGlobals(&aFile, (*fi)->gfi);
if (code < 0) error = code;
/* The Global Font Information is followed by the Character Metrics */
/* section. Which procedure is used to parse this section depends on */
/* how much information should be saved. If all of the metrics info */
/* is wanted, parseCharMetrics is called. If only the character widths */
/* is wanted, parseCharWidths is called. parseCharWidths will also */
/* be called in the case that no character data is to be saved, just */
/* to parse through the section. */
if ((code != normalEOF) && (code != earlyEOF))
{
if ((keyword = token(&aFile,tokenlen)) != nullptr)
(*fi)->numOfChars = atoi(keyword);
if (flags & (P_M ^ P_W))
{
(*fi)->cmi = static_cast<CharMetricInfo *>(
calloc((*fi)->numOfChars, sizeof(CharMetricInfo)));
if ((*fi)->cmi == nullptr) { error = storageProblem; return error; }
code = parseCharMetrics(&aFile, *fi);
}
else
{
if (flags & P_W)
{
(*fi)->cwi = static_cast<int *>(calloc(256, sizeof(int)));
if ((*fi)->cwi == nullptr)
{
error = storageProblem;
return error;
}
}
/* parse section regardless */
code = parseCharWidths(&aFile, (*fi)->cwi);
} /* else */
} /* if */
if ((error != earlyEOF) && (code < 0)) error = code;
/* The remaining sections of the AFM are optional. This code will */
/* look at the next keyword in the file to determine what section */
/* is next, and then allocate the appropriate amount of storage */
/* for the data (if the data is to be saved) and call the */
/* appropriate parsing routine to parse the section. */
while ((code != normalEOF) && (code != earlyEOF))
{
keyword = token(&aFile,tokenlen);
if (keyword == nullptr)
/* Have reached an early and unexpected EOF. */
/* Set flag and stop parsing */
{
code = earlyEOF;
break; /* get out of loop */
}
switch(recognize(keyword,tokenlen))
{
case STARTKERNDATA:
break;
case ENDKERNDATA:
break;
case STARTTRACKKERN:
keyword = token(&aFile,tokenlen);
if ((flags & P_T) && keyword)
{
(*fi)->numOfTracks = atoi(keyword);
(*fi)->tkd = static_cast<TrackKernData *>(
calloc((*fi)->numOfTracks, sizeof(TrackKernData)));
if ((*fi)->tkd == nullptr)
{
error = storageProblem;
return error;
}
} /* if */
code = parseTrackKernData(&aFile, *fi);
break;
case STARTKERNPAIRS:
keyword = token(&aFile,tokenlen);
if ((flags & P_P) && keyword)
{
(*fi)->numOfPairs = atoi(keyword);
(*fi)->pkd = static_cast<PairKernData *>(
calloc((*fi)->numOfPairs, sizeof(PairKernData)));
if ((*fi)->pkd == nullptr)
{
error = storageProblem;
return error;
}
} /* if */
code = parsePairKernData(&aFile, *fi);
break;
case STARTCOMPOSITES:
keyword = token(&aFile,tokenlen);
if ((flags & P_C) && keyword)
{
(*fi)->numOfComps = atoi(keyword);
(*fi)->ccd = static_cast<CompCharData *>(
calloc((*fi)->numOfComps, sizeof(CompCharData)));
if ((*fi)->ccd == nullptr)
{
error = storageProblem;
return error;
}
} /* if */
code = parseCompCharData(&aFile, *fi);
break;
case ENDFONTMETRICS:
code = normalEOF;
break;
case COMMENT:
linetoken(&aFile);
break;
case NOPE:
default:
code = parseError;
break;
} /* switch */
if ((error != earlyEOF) && (code < 0)) error = code;
} /* while */
if ((error != earlyEOF) && (code < 0)) error = code;
return error;
} /* parseFile */
void
freeFontInfo (FontInfo *fi)
{
int i;
if (fi->gfi)
{
free (fi->gfi->afmVersion);
free (fi->gfi->fontName);
free (fi->gfi->fullName);
free (fi->gfi->familyName);
free (fi->gfi->weight);
free (fi->gfi->version);
free (fi->gfi->notice);
free (fi->gfi->encodingScheme);
free (fi->gfi);
}
free (fi->cwi);
if (fi->cmi)
{
for (i = 0; i < fi->numOfChars; i++)
{
Ligature *ligs;
free (fi->cmi[i].name);
ligs = fi->cmi[i].ligs;
while (ligs)
{
Ligature *tmp;
tmp = ligs;
ligs = ligs->next;
free (tmp->succ);
free (tmp->lig);
free (tmp);
}
}
free (fi->cmi);
}
free (fi->tkd);
if (fi->pkd)
{
for ( i = 0; i < fi->numOfPairs; i++)
{
free (fi->pkd[i].name1);
free (fi->pkd[i].name2);
}
free (fi->pkd);
}
if (fi->ccd)
{
for (i = 0; i < fi->numOfComps; i++)
{
free (fi->ccd[i].ccName);
int j;
for (j = 0; j < fi->ccd[i].numOfPieces; j++)
free (fi->ccd[i].pieces[j].pccName);
free (fi->ccd[i].pieces);
}
free (fi->ccd);
}
free (fi);
}
} // namspace
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|