annotate src/share/native/sun/font/layout/LookupProcessor.cpp @ 6934:4267ae18e13a

8008249: Sync ICU into JDK Reviewed-by: bae, jgodinez
author prr
date Fri, 15 Feb 2013 13:07:17 -0800
parents 4b11045a9c4c
children 43f2d3d715c5
rev   line source
duke@0 1 /*
duke@0 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 3 *
duke@0 4 * This code is free software; you can redistribute it and/or modify it
duke@0 5 * under the terms of the GNU General Public License version 2 only, as
ohair@2362 6 * published by the Free Software Foundation. Oracle designates this
duke@0 7 * particular file as subject to the "Classpath" exception as provided
ohair@2362 8 * by Oracle in the LICENSE file that accompanied this code.
duke@0 9 *
duke@0 10 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 13 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 14 * accompanied this code).
duke@0 15 *
duke@0 16 * You should have received a copy of the GNU General Public License version
duke@0 17 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 19 *
ohair@2362 20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
ohair@2362 21 * or visit www.oracle.com if you need additional information or have any
ohair@2362 22 * questions.
duke@0 23 *
duke@0 24 */
duke@0 25
duke@0 26 /*
duke@0 27 *
prr@6934 28 * (C) Copyright IBM Corp. 1998-2013 - All Rights Reserved
duke@0 29 *
duke@0 30 */
duke@0 31
duke@0 32 #include "LETypes.h"
duke@0 33 #include "OpenTypeUtilities.h"
duke@0 34 #include "LEFontInstance.h"
duke@0 35 #include "OpenTypeTables.h"
srl@3171 36 #include "ICUFeatures.h"
duke@0 37 #include "Lookups.h"
duke@0 38 #include "ScriptAndLanguage.h"
duke@0 39 #include "GlyphDefinitionTables.h"
duke@0 40 #include "GlyphIterator.h"
duke@0 41 #include "LookupProcessor.h"
duke@0 42 #include "LEGlyphStorage.h"
duke@0 43 #include "LESwaps.h"
duke@0 44
srl@1693 45 U_NAMESPACE_BEGIN
srl@1693 46
duke@0 47 le_uint32 LookupProcessor::applyLookupTable(const LookupTable *lookupTable, GlyphIterator *glyphIterator,
srl@3171 48 const LEFontInstance *fontInstance, LEErrorCode& success) const
duke@0 49 {
srl@3171 50 if (LE_FAILURE(success)) {
srl@3171 51 return 0;
srl@3171 52 }
srl@3171 53
duke@0 54 le_uint16 lookupType = SWAPW(lookupTable->lookupType);
duke@0 55 le_uint16 subtableCount = SWAPW(lookupTable->subTableCount);
duke@0 56 le_int32 startPosition = glyphIterator->getCurrStreamPosition();
duke@0 57 le_uint32 delta;
duke@0 58
duke@0 59 for (le_uint16 subtable = 0; subtable < subtableCount; subtable += 1) {
duke@0 60 const LookupSubtable *lookupSubtable = lookupTable->getLookupSubtable(subtable);
duke@0 61
srl@3171 62 delta = applySubtable(lookupSubtable, lookupType, glyphIterator, fontInstance, success);
duke@0 63
srl@3171 64 if (delta > 0 && LE_FAILURE(success)) {
duke@0 65 return 1;
duke@0 66 }
duke@0 67
duke@0 68 glyphIterator->setCurrStreamPosition(startPosition);
duke@0 69 }
duke@0 70
duke@0 71 return 1;
duke@0 72 }
duke@0 73
srl@1693 74 le_int32 LookupProcessor::process(LEGlyphStorage &glyphStorage, GlyphPositionAdjustments *glyphPositionAdjustments,
srl@1693 75 le_bool rightToLeft, const GlyphDefinitionTableHeader *glyphDefinitionTableHeader,
srl@3171 76 const LEFontInstance *fontInstance, LEErrorCode& success) const
duke@0 77 {
srl@3171 78 if (LE_FAILURE(success)) {
srl@3171 79 return 0;
srl@3171 80 }
srl@3171 81
duke@0 82 le_int32 glyphCount = glyphStorage.getGlyphCount();
duke@0 83
duke@0 84 if (lookupSelectArray == NULL) {
duke@0 85 return glyphCount;
duke@0 86 }
duke@0 87
duke@0 88 GlyphIterator glyphIterator(glyphStorage, glyphPositionAdjustments,
duke@0 89 rightToLeft, 0, 0, glyphDefinitionTableHeader);
duke@0 90 le_int32 newGlyphCount = glyphCount;
duke@0 91
duke@0 92 for (le_uint16 order = 0; order < lookupOrderCount; order += 1) {
duke@0 93 le_uint16 lookup = lookupOrderArray[order];
duke@0 94 FeatureMask selectMask = lookupSelectArray[lookup];
duke@0 95
duke@0 96 if (selectMask != 0) {
duke@0 97 const LookupTable *lookupTable = lookupListTable->getLookupTable(lookup);
prr@6934 98 if (!lookupTable) {
bae@5555 99 continue;
prr@6934 100 }
duke@0 101 le_uint16 lookupFlags = SWAPW(lookupTable->lookupFlags);
duke@0 102
duke@0 103 glyphIterator.reset(lookupFlags, selectMask);
duke@0 104
duke@0 105 while (glyphIterator.findFeatureTag()) {
srl@3171 106 applyLookupTable(lookupTable, &glyphIterator, fontInstance, success);
srl@3171 107 if (LE_FAILURE(success)) {
srl@3171 108 return 0;
duke@0 109 }
duke@0 110 }
duke@0 111
duke@0 112 newGlyphCount = glyphIterator.applyInsertions();
duke@0 113 }
duke@0 114 }
duke@0 115
duke@0 116 return newGlyphCount;
duke@0 117 }
duke@0 118
duke@0 119 le_uint32 LookupProcessor::applySingleLookup(le_uint16 lookupTableIndex, GlyphIterator *glyphIterator,
srl@3171 120 const LEFontInstance *fontInstance, LEErrorCode& success) const
duke@0 121 {
srl@3171 122 if (LE_FAILURE(success)) {
srl@3171 123 return 0;
srl@3171 124 }
srl@3171 125
duke@0 126 const LookupTable *lookupTable = lookupListTable->getLookupTable(lookupTableIndex);
jgodinez@6605 127 if (lookupTable == NULL) {
jgodinez@6605 128 success = LE_INTERNAL_ERROR;
jgodinez@6605 129 return 0;
jgodinez@6605 130 }
duke@0 131 le_uint16 lookupFlags = SWAPW(lookupTable->lookupFlags);
duke@0 132 GlyphIterator tempIterator(*glyphIterator, lookupFlags);
srl@3171 133 le_uint32 delta = applyLookupTable(lookupTable, &tempIterator, fontInstance, success);
duke@0 134
duke@0 135 return delta;
duke@0 136 }
duke@0 137
duke@0 138 le_int32 LookupProcessor::selectLookups(const FeatureTable *featureTable, FeatureMask featureMask, le_int32 order)
duke@0 139 {
duke@0 140 le_uint16 lookupCount = featureTable? SWAPW(featureTable->lookupCount) : 0;
duke@0 141 le_int32 store = order;
duke@0 142
duke@0 143 for (le_uint16 lookup = 0; lookup < lookupCount; lookup += 1) {
duke@0 144 le_uint16 lookupListIndex = SWAPW(featureTable->lookupListIndexArray[lookup]);
prr@6934 145 if (lookupListIndex >= lookupSelectCount) {
bae@5555 146 continue;
prr@6934 147 }
bae@5555 148
duke@0 149 lookupSelectArray[lookupListIndex] |= featureMask;
duke@0 150 lookupOrderArray[store++] = lookupListIndex;
duke@0 151 }
duke@0 152
duke@0 153 return store - order;
duke@0 154 }
duke@0 155
duke@0 156 LookupProcessor::LookupProcessor(const char *baseAddress,
duke@0 157 Offset scriptListOffset, Offset featureListOffset, Offset lookupListOffset,
srl@3171 158 LETag scriptTag, LETag languageTag, const FeatureMap *featureMap, le_int32 featureMapCount, le_bool orderFeatures,
srl@3171 159 LEErrorCode& success)
bae@5555 160 : lookupListTable(NULL), featureListTable(NULL), lookupSelectArray(NULL), lookupSelectCount(0),
duke@0 161 lookupOrderArray(NULL), lookupOrderCount(0)
duke@0 162 {
duke@0 163 const ScriptListTable *scriptListTable = NULL;
duke@0 164 const LangSysTable *langSysTable = NULL;
duke@0 165 le_uint16 featureCount = 0;
duke@0 166 le_uint16 lookupListCount = 0;
duke@0 167 le_uint16 requiredFeatureIndex;
duke@0 168
srl@3171 169 if (LE_FAILURE(success)) {
srl@3171 170 return;
srl@3171 171 }
srl@3171 172
duke@0 173 if (scriptListOffset != 0) {
duke@0 174 scriptListTable = (const ScriptListTable *) (baseAddress + scriptListOffset);
duke@0 175 langSysTable = scriptListTable->findLanguage(scriptTag, languageTag);
duke@0 176
duke@0 177 if (langSysTable != 0) {
duke@0 178 featureCount = SWAPW(langSysTable->featureCount);
duke@0 179 }
duke@0 180 }
duke@0 181
duke@0 182 if (featureListOffset != 0) {
duke@0 183 featureListTable = (const FeatureListTable *) (baseAddress + featureListOffset);
duke@0 184 }
duke@0 185
duke@0 186 if (lookupListOffset != 0) {
duke@0 187 lookupListTable = (const LookupListTable *) (baseAddress + lookupListOffset);
duke@0 188 lookupListCount = SWAPW(lookupListTable->lookupCount);
duke@0 189 }
duke@0 190
duke@0 191 if (langSysTable == NULL || featureListTable == NULL || lookupListTable == NULL ||
duke@0 192 featureCount == 0 || lookupListCount == 0) {
duke@0 193 return;
duke@0 194 }
duke@0 195
duke@0 196 requiredFeatureIndex = SWAPW(langSysTable->reqFeatureIndex);
duke@0 197
duke@0 198 lookupSelectArray = LE_NEW_ARRAY(FeatureMask, lookupListCount);
srl@3171 199 if (lookupSelectArray == NULL) {
srl@3171 200 success = LE_MEMORY_ALLOCATION_ERROR;
srl@3171 201 return;
srl@3171 202 }
duke@0 203
duke@0 204 for (int i = 0; i < lookupListCount; i += 1) {
duke@0 205 lookupSelectArray[i] = 0;
duke@0 206 }
duke@0 207
bae@5555 208 lookupSelectCount = lookupListCount;
bae@5555 209
duke@0 210 le_int32 count, order = 0;
duke@0 211 le_int32 featureReferences = 0;
duke@0 212 const FeatureTable *featureTable = NULL;
duke@0 213 LETag featureTag;
duke@0 214
duke@0 215 const FeatureTable *requiredFeatureTable = NULL;
duke@0 216 LETag requiredFeatureTag = 0x00000000U;
duke@0 217
duke@0 218 // Count the total number of lookups referenced by all features. This will
duke@0 219 // be the maximum number of entries in the lookupOrderArray. We can't use
duke@0 220 // lookupListCount because some lookups might be referenced by more than
duke@0 221 // one feature.
duke@0 222 for (le_int32 feature = 0; feature < featureCount; feature += 1) {
duke@0 223 le_uint16 featureIndex = SWAPW(langSysTable->featureIndexArray[feature]);
duke@0 224
duke@0 225 featureTable = featureListTable->getFeatureTable(featureIndex, &featureTag);
prr@6934 226 if (!featureTable) {
prr@6934 227 continue;
prr@6934 228 }
prr@6934 229 featureReferences += SWAPW(featureTable->lookupCount);
prr@6934 230 }
bae@5555 231
prr@6934 232 if (!featureTable) {
prr@6934 233 success = LE_INTERNAL_ERROR;
prr@6934 234 return;
duke@0 235 }
duke@0 236
duke@0 237 if (requiredFeatureIndex != 0xFFFF) {
duke@0 238 requiredFeatureTable = featureListTable->getFeatureTable(requiredFeatureIndex, &requiredFeatureTag);
duke@0 239 featureReferences += SWAPW(featureTable->lookupCount);
duke@0 240 }
duke@0 241
duke@0 242 lookupOrderArray = LE_NEW_ARRAY(le_uint16, featureReferences);
srl@3171 243 if (lookupOrderArray == NULL) {
srl@3171 244 success = LE_MEMORY_ALLOCATION_ERROR;
srl@3171 245 return;
srl@3171 246 }
duke@0 247
duke@0 248 for (le_int32 f = 0; f < featureMapCount; f += 1) {
duke@0 249 FeatureMap fm = featureMap[f];
duke@0 250 count = 0;
duke@0 251
duke@0 252 // If this is the required feature, add its lookups
duke@0 253 if (requiredFeatureTag == fm.tag) {
duke@0 254 count += selectLookups(requiredFeatureTable, fm.mask, order);
duke@0 255 }
duke@0 256
duke@0 257 if (orderFeatures) {
duke@0 258 // If we added lookups from the required feature, sort them
duke@0 259 if (count > 1) {
duke@0 260 OpenTypeUtilities::sort(lookupOrderArray, order);
duke@0 261 }
duke@0 262
duke@0 263 for (le_uint16 feature = 0; feature < featureCount; feature += 1) {
duke@0 264 le_uint16 featureIndex = SWAPW(langSysTable->featureIndexArray[feature]);
duke@0 265
duke@0 266 // don't add the required feature to the list more than once...
duke@0 267 // TODO: Do we need this check? (Spec. says required feature won't be in feature list...)
duke@0 268 if (featureIndex == requiredFeatureIndex) {
duke@0 269 continue;
duke@0 270 }
duke@0 271
duke@0 272 featureTable = featureListTable->getFeatureTable(featureIndex, &featureTag);
duke@0 273
duke@0 274 if (featureTag == fm.tag) {
duke@0 275 count += selectLookups(featureTable, fm.mask, order + count);
duke@0 276 }
duke@0 277 }
duke@0 278
duke@0 279 if (count > 1) {
duke@0 280 OpenTypeUtilities::sort(&lookupOrderArray[order], count);
duke@0 281 }
duke@0 282
duke@0 283 order += count;
duke@0 284 } else {
duke@0 285 for (le_uint16 feature = 0; feature < featureCount; feature += 1) {
duke@0 286 le_uint16 featureIndex = SWAPW(langSysTable->featureIndexArray[feature]);
duke@0 287
duke@0 288 // don't add the required feature to the list more than once...
duke@0 289 // NOTE: This check is commented out because the spec. says that
duke@0 290 // the required feature won't be in the feature list, and because
duke@0 291 // any duplicate entries will be removed below.
duke@0 292 #if 0
duke@0 293 if (featureIndex == requiredFeatureIndex) {
duke@0 294 continue;
duke@0 295 }
duke@0 296 #endif
duke@0 297
duke@0 298 featureTable = featureListTable->getFeatureTable(featureIndex, &featureTag);
duke@0 299
duke@0 300 if (featureTag == fm.tag) {
duke@0 301 order += selectLookups(featureTable, fm.mask, order);
duke@0 302 }
duke@0 303 }
duke@0 304 }
duke@0 305 }
duke@0 306
duke@0 307 if (!orderFeatures && (order > 1)) {
duke@0 308 OpenTypeUtilities::sort(lookupOrderArray, order);
duke@0 309
duke@0 310 // If there's no specified feature order,
duke@0 311 // we will apply the lookups in the order
duke@0 312 // that they're in the font. If a particular
duke@0 313 // lookup may be referenced by more than one feature,
duke@0 314 // it will apprear in the lookupOrderArray more than
duke@0 315 // once, so remove any duplicate entries in the sorted array.
duke@0 316 le_int32 out = 1;
duke@0 317
duke@0 318 for (le_int32 in = 1; in < order; in += 1) {
duke@0 319 if (lookupOrderArray[out - 1] != lookupOrderArray[in]) {
duke@0 320 if (out != in) {
duke@0 321 lookupOrderArray[out] = lookupOrderArray[in];
duke@0 322 }
duke@0 323
duke@0 324 out += 1;
duke@0 325 }
duke@0 326 }
duke@0 327
duke@0 328 order = out;
duke@0 329 }
duke@0 330
duke@0 331 lookupOrderCount = order;
duke@0 332 }
duke@0 333
duke@0 334 LookupProcessor::LookupProcessor()
duke@0 335 {
srl@3171 336 lookupOrderArray = NULL;
srl@3171 337 lookupSelectArray = NULL;
duke@0 338 }
duke@0 339
duke@0 340 LookupProcessor::~LookupProcessor()
duke@0 341 {
duke@0 342 LE_DELETE_ARRAY(lookupOrderArray);
duke@0 343 LE_DELETE_ARRAY(lookupSelectArray);
duke@0 344 }
srl@1693 345
srl@1693 346 U_NAMESPACE_END