annotate src/share/native/sun/font/layout/LookupProcessor.cpp @ 2362:00cd9dc3c2b5

6943119: Rebrand source copyright notices Reviewed-by: darcy, weijun
author ohair
date Tue, 25 May 2010 15:58:33 -0700
parents c74d38ef118c
children 1d4340015b85
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 *
duke@0 28 * (C) Copyright IBM Corp. 1998-2005 - 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"
duke@0 36 #include "Features.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,
duke@0 48 const LEFontInstance *fontInstance) const
duke@0 49 {
duke@0 50 le_uint16 lookupType = SWAPW(lookupTable->lookupType);
duke@0 51 le_uint16 subtableCount = SWAPW(lookupTable->subTableCount);
duke@0 52 le_int32 startPosition = glyphIterator->getCurrStreamPosition();
duke@0 53 le_uint32 delta;
duke@0 54
duke@0 55 for (le_uint16 subtable = 0; subtable < subtableCount; subtable += 1) {
duke@0 56 const LookupSubtable *lookupSubtable = lookupTable->getLookupSubtable(subtable);
duke@0 57
duke@0 58 delta = applySubtable(lookupSubtable, lookupType, glyphIterator, fontInstance);
duke@0 59
duke@0 60 if (delta > 0) {
duke@0 61 return 1;
duke@0 62 }
duke@0 63
duke@0 64 glyphIterator->setCurrStreamPosition(startPosition);
duke@0 65 }
duke@0 66
duke@0 67 return 1;
duke@0 68 }
duke@0 69
srl@1693 70 le_int32 LookupProcessor::process(LEGlyphStorage &glyphStorage, GlyphPositionAdjustments *glyphPositionAdjustments,
srl@1693 71 le_bool rightToLeft, const GlyphDefinitionTableHeader *glyphDefinitionTableHeader,
srl@1693 72 const LEFontInstance *fontInstance) const
duke@0 73 {
duke@0 74 le_int32 glyphCount = glyphStorage.getGlyphCount();
duke@0 75
duke@0 76 if (lookupSelectArray == NULL) {
duke@0 77 return glyphCount;
duke@0 78 }
duke@0 79
duke@0 80 GlyphIterator glyphIterator(glyphStorage, glyphPositionAdjustments,
duke@0 81 rightToLeft, 0, 0, glyphDefinitionTableHeader);
duke@0 82 le_int32 newGlyphCount = glyphCount;
duke@0 83
duke@0 84 for (le_uint16 order = 0; order < lookupOrderCount; order += 1) {
duke@0 85 le_uint16 lookup = lookupOrderArray[order];
duke@0 86 FeatureMask selectMask = lookupSelectArray[lookup];
duke@0 87
duke@0 88 if (selectMask != 0) {
duke@0 89 const LookupTable *lookupTable = lookupListTable->getLookupTable(lookup);
duke@0 90 le_uint16 lookupFlags = SWAPW(lookupTable->lookupFlags);
duke@0 91
duke@0 92 glyphIterator.reset(lookupFlags, selectMask);
duke@0 93
duke@0 94 while (glyphIterator.findFeatureTag()) {
duke@0 95 le_uint32 delta = 1;
duke@0 96
duke@0 97 while (glyphIterator.next(delta)) {
duke@0 98 delta = applyLookupTable(lookupTable, &glyphIterator, fontInstance);
duke@0 99 }
duke@0 100 }
duke@0 101
duke@0 102 newGlyphCount = glyphIterator.applyInsertions();
duke@0 103 }
duke@0 104 }
duke@0 105
duke@0 106 return newGlyphCount;
duke@0 107 }
duke@0 108
duke@0 109 le_uint32 LookupProcessor::applySingleLookup(le_uint16 lookupTableIndex, GlyphIterator *glyphIterator,
duke@0 110 const LEFontInstance *fontInstance) const
duke@0 111 {
duke@0 112 const LookupTable *lookupTable = lookupListTable->getLookupTable(lookupTableIndex);
duke@0 113 le_uint16 lookupFlags = SWAPW(lookupTable->lookupFlags);
duke@0 114 GlyphIterator tempIterator(*glyphIterator, lookupFlags);
duke@0 115 le_uint32 delta = applyLookupTable(lookupTable, &tempIterator, fontInstance);
duke@0 116
duke@0 117 return delta;
duke@0 118 }
duke@0 119
duke@0 120 le_int32 LookupProcessor::selectLookups(const FeatureTable *featureTable, FeatureMask featureMask, le_int32 order)
duke@0 121 {
duke@0 122 le_uint16 lookupCount = featureTable? SWAPW(featureTable->lookupCount) : 0;
duke@0 123 le_int32 store = order;
duke@0 124
duke@0 125 for (le_uint16 lookup = 0; lookup < lookupCount; lookup += 1) {
duke@0 126 le_uint16 lookupListIndex = SWAPW(featureTable->lookupListIndexArray[lookup]);
duke@0 127
duke@0 128 lookupSelectArray[lookupListIndex] |= featureMask;
duke@0 129 lookupOrderArray[store++] = lookupListIndex;
duke@0 130 }
duke@0 131
duke@0 132 return store - order;
duke@0 133 }
duke@0 134
duke@0 135 LookupProcessor::LookupProcessor(const char *baseAddress,
duke@0 136 Offset scriptListOffset, Offset featureListOffset, Offset lookupListOffset,
srl@1693 137 LETag scriptTag, LETag languageTag, const FeatureMap *featureMap, le_int32 featureMapCount, le_bool orderFeatures)
duke@0 138 : lookupListTable(NULL), featureListTable(NULL), lookupSelectArray(NULL),
duke@0 139 lookupOrderArray(NULL), lookupOrderCount(0)
duke@0 140 {
duke@0 141 const ScriptListTable *scriptListTable = NULL;
duke@0 142 const LangSysTable *langSysTable = NULL;
duke@0 143 le_uint16 featureCount = 0;
duke@0 144 le_uint16 lookupListCount = 0;
duke@0 145 le_uint16 requiredFeatureIndex;
duke@0 146
duke@0 147 if (scriptListOffset != 0) {
duke@0 148 scriptListTable = (const ScriptListTable *) (baseAddress + scriptListOffset);
duke@0 149 langSysTable = scriptListTable->findLanguage(scriptTag, languageTag);
duke@0 150
duke@0 151 if (langSysTable != 0) {
duke@0 152 featureCount = SWAPW(langSysTable->featureCount);
duke@0 153 }
duke@0 154 }
duke@0 155
duke@0 156 if (featureListOffset != 0) {
duke@0 157 featureListTable = (const FeatureListTable *) (baseAddress + featureListOffset);
duke@0 158 }
duke@0 159
duke@0 160 if (lookupListOffset != 0) {
duke@0 161 lookupListTable = (const LookupListTable *) (baseAddress + lookupListOffset);
duke@0 162 lookupListCount = SWAPW(lookupListTable->lookupCount);
duke@0 163 }
duke@0 164
duke@0 165 if (langSysTable == NULL || featureListTable == NULL || lookupListTable == NULL ||
duke@0 166 featureCount == 0 || lookupListCount == 0) {
duke@0 167 return;
duke@0 168 }
duke@0 169
duke@0 170 requiredFeatureIndex = SWAPW(langSysTable->reqFeatureIndex);
duke@0 171
duke@0 172 lookupSelectArray = LE_NEW_ARRAY(FeatureMask, lookupListCount);
duke@0 173
duke@0 174 for (int i = 0; i < lookupListCount; i += 1) {
duke@0 175 lookupSelectArray[i] = 0;
duke@0 176 }
duke@0 177
duke@0 178 le_int32 count, order = 0;
duke@0 179 le_int32 featureReferences = 0;
duke@0 180 const FeatureTable *featureTable = NULL;
duke@0 181 LETag featureTag;
duke@0 182
duke@0 183 const FeatureTable *requiredFeatureTable = NULL;
duke@0 184 LETag requiredFeatureTag = 0x00000000U;
duke@0 185
duke@0 186 // Count the total number of lookups referenced by all features. This will
duke@0 187 // be the maximum number of entries in the lookupOrderArray. We can't use
duke@0 188 // lookupListCount because some lookups might be referenced by more than
duke@0 189 // one feature.
duke@0 190 for (le_int32 feature = 0; feature < featureCount; feature += 1) {
duke@0 191 le_uint16 featureIndex = SWAPW(langSysTable->featureIndexArray[feature]);
duke@0 192
duke@0 193 featureTable = featureListTable->getFeatureTable(featureIndex, &featureTag);
duke@0 194 featureReferences += SWAPW(featureTable->lookupCount);
duke@0 195 }
duke@0 196
duke@0 197 if (requiredFeatureIndex != 0xFFFF) {
duke@0 198 requiredFeatureTable = featureListTable->getFeatureTable(requiredFeatureIndex, &requiredFeatureTag);
duke@0 199 featureReferences += SWAPW(featureTable->lookupCount);
duke@0 200 }
duke@0 201
duke@0 202 lookupOrderArray = LE_NEW_ARRAY(le_uint16, featureReferences);
duke@0 203
duke@0 204 for (le_int32 f = 0; f < featureMapCount; f += 1) {
duke@0 205 FeatureMap fm = featureMap[f];
duke@0 206 count = 0;
duke@0 207
duke@0 208 // If this is the required feature, add its lookups
duke@0 209 if (requiredFeatureTag == fm.tag) {
duke@0 210 count += selectLookups(requiredFeatureTable, fm.mask, order);
duke@0 211 }
duke@0 212
duke@0 213 if (orderFeatures) {
duke@0 214 // If we added lookups from the required feature, sort them
duke@0 215 if (count > 1) {
duke@0 216 OpenTypeUtilities::sort(lookupOrderArray, order);
duke@0 217 }
duke@0 218
duke@0 219 for (le_uint16 feature = 0; feature < featureCount; feature += 1) {
duke@0 220 le_uint16 featureIndex = SWAPW(langSysTable->featureIndexArray[feature]);
duke@0 221
duke@0 222 // don't add the required feature to the list more than once...
duke@0 223 // TODO: Do we need this check? (Spec. says required feature won't be in feature list...)
duke@0 224 if (featureIndex == requiredFeatureIndex) {
duke@0 225 continue;
duke@0 226 }
duke@0 227
duke@0 228 featureTable = featureListTable->getFeatureTable(featureIndex, &featureTag);
duke@0 229
duke@0 230 if (featureTag == fm.tag) {
duke@0 231 count += selectLookups(featureTable, fm.mask, order + count);
duke@0 232 }
duke@0 233 }
duke@0 234
duke@0 235 if (count > 1) {
duke@0 236 OpenTypeUtilities::sort(&lookupOrderArray[order], count);
duke@0 237 }
duke@0 238
duke@0 239 order += count;
duke@0 240 } else {
duke@0 241 for (le_uint16 feature = 0; feature < featureCount; feature += 1) {
duke@0 242 le_uint16 featureIndex = SWAPW(langSysTable->featureIndexArray[feature]);
duke@0 243
duke@0 244 // don't add the required feature to the list more than once...
duke@0 245 // NOTE: This check is commented out because the spec. says that
duke@0 246 // the required feature won't be in the feature list, and because
duke@0 247 // any duplicate entries will be removed below.
duke@0 248 #if 0
duke@0 249 if (featureIndex == requiredFeatureIndex) {
duke@0 250 continue;
duke@0 251 }
duke@0 252 #endif
duke@0 253
duke@0 254 featureTable = featureListTable->getFeatureTable(featureIndex, &featureTag);
duke@0 255
duke@0 256 if (featureTag == fm.tag) {
duke@0 257 order += selectLookups(featureTable, fm.mask, order);
duke@0 258 }
duke@0 259 }
duke@0 260 }
duke@0 261 }
duke@0 262
duke@0 263 if (!orderFeatures && (order > 1)) {
duke@0 264 OpenTypeUtilities::sort(lookupOrderArray, order);
duke@0 265
duke@0 266 // If there's no specified feature order,
duke@0 267 // we will apply the lookups in the order
duke@0 268 // that they're in the font. If a particular
duke@0 269 // lookup may be referenced by more than one feature,
duke@0 270 // it will apprear in the lookupOrderArray more than
duke@0 271 // once, so remove any duplicate entries in the sorted array.
duke@0 272 le_int32 out = 1;
duke@0 273
duke@0 274 for (le_int32 in = 1; in < order; in += 1) {
duke@0 275 if (lookupOrderArray[out - 1] != lookupOrderArray[in]) {
duke@0 276 if (out != in) {
duke@0 277 lookupOrderArray[out] = lookupOrderArray[in];
duke@0 278 }
duke@0 279
duke@0 280 out += 1;
duke@0 281 }
duke@0 282 }
duke@0 283
duke@0 284 order = out;
duke@0 285 }
duke@0 286
duke@0 287 lookupOrderCount = order;
duke@0 288 }
duke@0 289
duke@0 290 LookupProcessor::LookupProcessor()
duke@0 291 {
duke@0 292 }
duke@0 293
duke@0 294 LookupProcessor::~LookupProcessor()
duke@0 295 {
duke@0 296 LE_DELETE_ARRAY(lookupOrderArray);
duke@0 297 LE_DELETE_ARRAY(lookupSelectArray);
duke@0 298 }
srl@1693 299
srl@1693 300 U_NAMESPACE_END