79 #define COVERAGE_MINIMUM 0x2
80 #define COVERAGE_CROSS 0x4
81 #define COVERAGE_OVERRIDE 0x8
82
83 /*
84 * This implementation has support for only one subtable, so if the font has
85 * multiple subtables, only the first will be used. If this turns out to
86 * be a problem in practice we should add it.
87 *
88 * This also supports only version 0 of the kern table header, only
89 * Apple supports the latter.
90 *
91 * This implementation isn't careful about the kern table flags, and
92 * might invoke kerning when it is not supposed to. That too I'm
93 * leaving for a bug fix.
94 *
95 * TODO: support multiple subtables
96 * TODO: respect header flags
97 */
98 KernTable::KernTable(const LETableReference& base, LEErrorCode &success)
99 : pairs(), pairsSwapped(NULL), fTable(base)
100 {
101 if(LE_FAILURE(success) || (fTable.isEmpty())) {
102 #if DEBUG
103 fprintf(stderr, "no kern data\n");
104 #endif
105 return;
106 }
107 LEReferenceTo<KernTableHeader> header(fTable, success);
108
109 #if DEBUG
110 // dump first 32 bytes of header
111 for (int i = 0; i < 64; ++i) {
112 fprintf(stderr, "%0.2x ", ((const char*)header.getAlias())[i]&0xff);
113 if (((i+1)&0xf) == 0) {
114 fprintf(stderr, "\n");
115 } else if (((i+1)&0x7) == 0) {
116 fprintf(stderr, " ");
117 }
118 }
119 #endif
126 if (LE_SUCCESS(success) && !subhead.isEmpty() && subhead->version == 0) {
127 coverage = SWAPW(subhead->coverage);
128 if (coverage & COVERAGE_HORIZONTAL) { // only handle horizontal kerning
129 LEReferenceTo<Subtable_0> table(subhead, success, KERN_SUBTABLE_HEADER_SIZE);
130
131 if(table.isEmpty() || LE_FAILURE(success)) return;
132
133 nPairs = SWAPW(table->nPairs);
134
135 #if 0 // some old fonts have bad values here...
136 searchRange = SWAPW(table->searchRange);
137 entrySelector = SWAPW(table->entrySelector);
138 rangeShift = SWAPW(table->rangeShift);
139 #else
140 entrySelector = OpenTypeUtilities::highBit(nPairs);
141 searchRange = (1 << entrySelector) * KERN_PAIRINFO_SIZE;
142 rangeShift = (nPairs * KERN_PAIRINFO_SIZE) - searchRange;
143 #endif
144
145 if(LE_SUCCESS(success) && nPairs>0) {
146 // pairs is an instance member, and table is on the stack.
147 // set 'pairs' based on table.getAlias(). This will range check it.
148
149 pairs = LEReferenceToArrayOf<PairInfo>(fTable, // based on overall table
150 success,
151 (const PairInfo*)table.getAlias(), // subtable 0 + ..
152 KERN_SUBTABLE_0_HEADER_SIZE, // .. offset of header size
153 nPairs); // count
154 }
155 if (LE_SUCCESS(success) && pairs.isValid()) {
156 pairsSwapped = (PairInfo*)(malloc(nPairs*sizeof(PairInfo)));
157 PairInfo *p = (PairInfo*)pairsSwapped;
158 for (int i = 0; LE_SUCCESS(success) && i < nPairs; i++, p++) {
159 memcpy(p, pairs.getAlias(i,success), KERN_PAIRINFO_SIZE);
160 p->key = SWAPL(p->key);
161 }
162 fTable.getFont()->setKernPairs((void*)pairsSwapped); // store it
163 }
164
165 #if 0
166 fprintf(stderr, "coverage: %0.4x nPairs: %d pairs %p\n", coverage, nPairs, pairs.getAlias());
167 fprintf(stderr, " searchRange: %d entrySelector: %d rangeShift: %d\n", searchRange, entrySelector, rangeShift);
168 fprintf(stderr, "[[ ignored font table entries: range %d selector %d shift %d ]]\n", SWAPW(table->searchRange), SWAPW(table->entrySelector), SWAPW(table->rangeShift));
169 #endif
170 #if DEBUG
171 fprintf(stderr, "coverage: %0.4x nPairs: %d pairs 0x%x\n", coverage, nPairs, pairs);
172 fprintf(stderr,
173 " searchRange(pairs): %d entrySelector: %d rangeShift(pairs): %d\n",
174 searchRange, entrySelector, rangeShift);
175
176 {
177 // dump part of the pair list
178 char ids[256];
179 for (int i = 256; --i >= 0;) {
180 LEGlyphID id = font->mapCharToGlyph(i);
181 if (id < 256) {
182 ids[id] = (char)i;
183 }
184 }
185 PairInfo *p = pairs;
186 for (int i = 0; i < nPairs; ++i, p++) {
187 le_uint32 k = p->key;
188 le_uint16 left = (k >> 16) & 0xffff;
189 le_uint16 right = k & 0xffff;
190 if (left < 256 && right < 256) {
191 char c = ids[left];
192 if (c > 0x20 && c < 0x7f) {
193 fprintf(stderr, "%c/", c & 0xff);
194 } else {
195 fprintf(stderr, "%0.2x/", c & 0xff);
196 }
197 c = ids[right];
198 if (c > 0x20 && c < 0x7f) {
199 fprintf(stderr, "%c ", c & 0xff);
200 } else {
201 fprintf(stderr, "%0.2x ", c & 0xff);
202 }
203 }
204 }
205 }
|
79 #define COVERAGE_MINIMUM 0x2
80 #define COVERAGE_CROSS 0x4
81 #define COVERAGE_OVERRIDE 0x8
82
83 /*
84 * This implementation has support for only one subtable, so if the font has
85 * multiple subtables, only the first will be used. If this turns out to
86 * be a problem in practice we should add it.
87 *
88 * This also supports only version 0 of the kern table header, only
89 * Apple supports the latter.
90 *
91 * This implementation isn't careful about the kern table flags, and
92 * might invoke kerning when it is not supposed to. That too I'm
93 * leaving for a bug fix.
94 *
95 * TODO: support multiple subtables
96 * TODO: respect header flags
97 */
98 KernTable::KernTable(const LETableReference& base, LEErrorCode &success)
99 : pairsSwapped(NULL), fTable(base)
100 {
101 if(LE_FAILURE(success) || (fTable.isEmpty())) {
102 #if DEBUG
103 fprintf(stderr, "no kern data\n");
104 #endif
105 return;
106 }
107 LEReferenceTo<KernTableHeader> header(fTable, success);
108
109 #if DEBUG
110 // dump first 32 bytes of header
111 for (int i = 0; i < 64; ++i) {
112 fprintf(stderr, "%0.2x ", ((const char*)header.getAlias())[i]&0xff);
113 if (((i+1)&0xf) == 0) {
114 fprintf(stderr, "\n");
115 } else if (((i+1)&0x7) == 0) {
116 fprintf(stderr, " ");
117 }
118 }
119 #endif
126 if (LE_SUCCESS(success) && !subhead.isEmpty() && subhead->version == 0) {
127 coverage = SWAPW(subhead->coverage);
128 if (coverage & COVERAGE_HORIZONTAL) { // only handle horizontal kerning
129 LEReferenceTo<Subtable_0> table(subhead, success, KERN_SUBTABLE_HEADER_SIZE);
130
131 if(table.isEmpty() || LE_FAILURE(success)) return;
132
133 nPairs = SWAPW(table->nPairs);
134
135 #if 0 // some old fonts have bad values here...
136 searchRange = SWAPW(table->searchRange);
137 entrySelector = SWAPW(table->entrySelector);
138 rangeShift = SWAPW(table->rangeShift);
139 #else
140 entrySelector = OpenTypeUtilities::highBit(nPairs);
141 searchRange = (1 << entrySelector) * KERN_PAIRINFO_SIZE;
142 rangeShift = (nPairs * KERN_PAIRINFO_SIZE) - searchRange;
143 #endif
144
145 if(LE_SUCCESS(success) && nPairs>0) {
146 // pairsSwapped is an instance member, and table is on the stack.
147 // set 'pairsSwapped' based on table.getAlias(). This will range check it.
148
149 pairsSwapped = (PairInfo*)(fTable.getFont()->getKernPairs());
150 if (pairsSwapped == NULL) {
151 LEReferenceToArrayOf<PairInfo>pairs =
152 LEReferenceToArrayOf<PairInfo>(fTable, // based on overall table
153 success,
154 (const PairInfo*)table.getAlias(), // subtable 0 + ..
155 KERN_SUBTABLE_0_HEADER_SIZE, // .. offset of header size
156 nPairs); // count
157 if (LE_SUCCESS(success) && pairs.isValid()) {
158 pairsSwapped = (PairInfo*)(malloc(nPairs*sizeof(PairInfo)));
159 PairInfo *p = (PairInfo*)pairsSwapped;
160 for (int i = 0; LE_SUCCESS(success) && i < nPairs; i++, p++) {
161 memcpy(p, pairs.getAlias(i,success), KERN_PAIRINFO_SIZE);
162 p->key = SWAPL(p->key);
163 }
164 fTable.getFont()->setKernPairs((void*)pairsSwapped); // store it
165 }
166 }
167 }
168
169 #if 0
170 fprintf(stderr, "coverage: %0.4x nPairs: %d pairs %p\n", coverage, nPairs, pairsSwapped);
171 fprintf(stderr, " searchRange: %d entrySelector: %d rangeShift: %d\n", searchRange, entrySelector, rangeShift);
172 fprintf(stderr, "[[ ignored font table entries: range %d selector %d shift %d ]]\n", SWAPW(table->searchRange), SWAPW(table->entrySelector), SWAPW(table->rangeShift));
173 #endif
174 #if DEBUG
175 fprintf(stderr, "coverage: %0.4x nPairs: %d pairs 0x%x\n", coverage, nPairs, pairsSwapped);
176 fprintf(stderr,
177 " searchRange(pairs): %d entrySelector: %d rangeShift(pairs): %d\n",
178 searchRange, entrySelector, rangeShift);
179
180 {
181 // dump part of the pair list
182 char ids[256];
183 for (int i = 256; --i >= 0;) {
184 LEGlyphID id = font->mapCharToGlyph(i);
185 if (id < 256) {
186 ids[id] = (char)i;
187 }
188 }
189 PairInfo *p = pairsSwapped;
190 for (int i = 0; i < nPairs; ++i, p++) {
191 le_uint32 k = p->key;
192 le_uint16 left = (k >> 16) & 0xffff;
193 le_uint16 right = k & 0xffff;
194 if (left < 256 && right < 256) {
195 char c = ids[left];
196 if (c > 0x20 && c < 0x7f) {
197 fprintf(stderr, "%c/", c & 0xff);
198 } else {
199 fprintf(stderr, "%0.2x/", c & 0xff);
200 }
201 c = ids[right];
202 if (c > 0x20 && c < 0x7f) {
203 fprintf(stderr, "%c ", c & 0xff);
204 } else {
205 fprintf(stderr, "%0.2x ", c & 0xff);
206 }
207 }
208 }
209 }
|