0N/A/*
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A *
0N/A */
0N/A
0N/A/*
0N/A *
3171N/A * (C) Copyright IBM Corp. 1998-2008 - All Rights Reserved
0N/A *
0N/A */
0N/A
0N/A#include "LETypes.h"
0N/A#include "LEGlyphFilter.h"
0N/A#include "OpenTypeTables.h"
0N/A#include "GlyphSubstitutionTables.h"
0N/A#include "MultipleSubstSubtables.h"
0N/A#include "GlyphIterator.h"
0N/A#include "LESwaps.h"
0N/A
1693N/AU_NAMESPACE_BEGIN
1693N/A
5980N/Ale_uint32 MultipleSubstitutionSubtable::process(const LETableReference &base, GlyphIterator *glyphIterator, LEErrorCode& success, const LEGlyphFilter *filter) const
0N/A{
3171N/A if (LE_FAILURE(success)) {
3171N/A return 0;
3171N/A }
3171N/A
0N/A LEGlyphID glyph = glyphIterator->getCurrGlyphID();
0N/A
0N/A // If there's a filter, we only want to do the
0N/A // substitution if the *input* glyphs doesn't
0N/A // exist.
0N/A //
0N/A // FIXME: is this always the right thing to do?
0N/A // FIXME: should this only be done for a non-zero
0N/A // glyphCount?
0N/A if (filter != NULL && filter->accept(glyph)) {
0N/A return 0;
0N/A }
0N/A
5980N/A le_int32 coverageIndex = getGlyphCoverage(base, glyph, success);
0N/A le_uint16 seqCount = SWAPW(sequenceCount);
0N/A
6371N/A if (LE_FAILURE(success)) {
6371N/A return 0;
6371N/A }
6371N/A
0N/A if (coverageIndex >= 0 && coverageIndex < seqCount) {
0N/A Offset sequenceTableOffset = SWAPW(sequenceTableOffsetArray[coverageIndex]);
0N/A const SequenceTable *sequenceTable = (const SequenceTable *) ((char *) this + sequenceTableOffset);
0N/A le_uint16 glyphCount = SWAPW(sequenceTable->glyphCount);
0N/A
0N/A if (glyphCount == 0) {
0N/A glyphIterator->setCurrGlyphID(0xFFFF);
0N/A return 1;
0N/A } else if (glyphCount == 1) {
0N/A TTGlyphID substitute = SWAPW(sequenceTable->substituteArray[0]);
0N/A
0N/A if (filter != NULL && ! filter->accept(LE_SET_GLYPH(glyph, substitute))) {
0N/A return 0;
0N/A }
0N/A
0N/A glyphIterator->setCurrGlyphID(substitute);
0N/A return 1;
0N/A } else {
0N/A // If there's a filter, make sure all of the output glyphs
0N/A // exist.
0N/A if (filter != NULL) {
0N/A for (le_int32 i = 0; i < glyphCount; i += 1) {
0N/A TTGlyphID substitute = SWAPW(sequenceTable->substituteArray[i]);
0N/A
0N/A if (! filter->accept(substitute)) {
0N/A return 0;
0N/A }
0N/A }
0N/A }
0N/A
3171N/A LEGlyphID *newGlyphs = glyphIterator->insertGlyphs(glyphCount, success);
3171N/A if (LE_FAILURE(success)) {
3171N/A return 0;
3171N/A }
3171N/A
0N/A le_int32 insert = 0, direction = 1;
0N/A
0N/A if (glyphIterator->isRightToLeft()) {
0N/A insert = glyphCount - 1;
0N/A direction = -1;
0N/A }
0N/A
0N/A for (le_int32 i = 0; i < glyphCount; i += 1) {
0N/A TTGlyphID substitute = SWAPW(sequenceTable->substituteArray[i]);
0N/A
0N/A newGlyphs[insert] = LE_SET_GLYPH(glyph, substitute);
0N/A insert += direction;
0N/A }
0N/A
0N/A return 1;
0N/A }
0N/A }
0N/A
0N/A return 0;
0N/A}
1693N/A
1693N/AU_NAMESPACE_END