/*

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.  Oracle designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Oracle in the LICENSE file that accompanied this code.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 *

 */

/*

 * (C) Copyright IBM Corp. 1998-2005 - All Rights Reserved

 *

 */

#include "LETypes.h"

#include "LEFontInstance.h"

#include "OpenTypeTables.h"

#include "GlyphSubstitutionTables.h"

#include "ContextualSubstSubtables.h"

#include "GlyphIterator.h"

#include "LookupProcessor.h"

#include "CoverageTables.h"

#include "LESwaps.h"

U_NAMESPACE_BEGIN

/*

    NOTE: This could be optimized somewhat by keeping track

    of the previous sequenceIndex in the loop and doing next()

    or prev() of the delta between that and the current

    sequenceIndex instead of always resetting to the front.

*/

void ContextualSubstitutionBase::applySubstitutionLookups(

        const LookupProcessor *lookupProcessor,

        le_uint16 substCount,

        GlyphIterator *glyphIterator,

        const LEFontInstance *fontInstance,

        le_int32 position,

        LEErrorCode& success)

{

    if (LE_FAILURE(success)) {

        return;

    }

    GlyphIterator tempIterator(*glyphIterator);

    for (le_int16 subst = 0; subst < substCount && LE_SUCCESS(success); subst += 1) {

        tempIterator.setCurrStreamPosition(position);

        tempIterator.next(sequenceIndex);

        lookupProcessor->applySingleLookup(lookupListIndex, &tempIterator, fontInstance, success);

    }

}

                                               GlyphIterator *glyphIterator, le_bool backtrack)

{

    le_int32 direction = 1;

    le_int32 match = 0;

    if (backtrack) {

        match = glyphCount -1;

        direction = -1;

    }

    while (glyphCount > 0) {

        if (! glyphIterator->next()) {

            return FALSE;

        }

        TTGlyphID glyph = (TTGlyphID) glyphIterator->getCurrGlyphID();

        if (glyph != SWAPW(glyphArray[match])) {

            return FALSE;

        }

        glyphCount -= 1;

        match += direction;

    }

    return TRUE;

}

{

    le_int32 direction = 1;

    le_int32 match = 0;

    if (backtrack) {

        match = glyphCount - 1;

        direction = -1;

    }

    while (glyphCount > 0) {

        if (! glyphIterator->next()) {

            return FALSE;

        }

        LEGlyphID glyph = glyphIterator->getCurrGlyphID();

        le_int32 matchClass = SWAPW(classArray[match]);

        if (glyphClass != matchClass) {

            // Some fonts, e.g. Traditional Arabic, have classes

            // in the class array which aren't in the class definition

            // table. If we're looking for such a class, pretend that

            // we found it.

                return FALSE;

            }

        }

        glyphCount -= 1;

        match += direction;

    }

    return TRUE;

}

{

    le_int32 direction = 1;

    le_int32 glyph = 0;

    if (backtrack) {

        glyph = glyphCount - 1;

        direction = -1;

    }

    while (glyphCount > 0) {

        Offset coverageTableOffset = SWAPW(coverageTableOffsetArray[glyph]);

            return FALSE;

        }

            return FALSE;

        }

        glyphCount -= 1;

        glyph += direction;

    }

    return TRUE;

}

                                                  GlyphIterator *glyphIterator,

                                                  const LEFontInstance *fontInstance,

                                                  LEErrorCode& success) const

{

    if (LE_FAILURE(success)) {

        return 0;

    }

    switch(SWAPW(subtableFormat))

    {

    case 0:

        return 0;

    case 1:

    {

    }

    case 2:

    {

    }

    case 3:

    {

    }

    default:

        return 0;

    }

}

                                                         GlyphIterator *glyphIterator,

                                                         const LEFontInstance *fontInstance,

                                                         LEErrorCode& success) const

{

    if (LE_FAILURE(success)) {

        return 0;

    }

    LEGlyphID glyph = glyphIterator->getCurrGlyphID();

    le_int32 coverageIndex = getGlyphCoverage(lookupProcessor->getReference(), glyph, success);

    if (LE_FAILURE(success)) {

        return 0;

    }

    if (coverageIndex >= 0) {

        le_uint16 srSetCount = SWAPW(subRuleSetCount);

        if (coverageIndex < srSetCount) {

            Offset subRuleSetTableOffset = SWAPW(subRuleSetTableOffsetArray[coverageIndex]);

            le_uint16 subRuleCount = SWAPW(subRuleSetTable->subRuleCount);

            le_int32 position = glyphIterator->getCurrStreamPosition();

            for (le_uint16 subRule = 0; subRule < subRuleCount; subRule += 1) {

                Offset subRuleTableOffset =

                    SWAPW(subRuleSetTable->subRuleTableOffsetArray[subRule]);

                le_uint16 matchCount = SWAPW(subRuleTable->glyphCount) - 1;

                le_uint16 substCount = SWAPW(subRuleTable->substCount);

                    applySubstitutionLookups(lookupProcessor, substLookupRecordArray, substCount, glyphIterator, fontInstance, position, success);

                    return matchCount + 1;

                }

                glyphIterator->setCurrStreamPosition(position);

            }

        }

        // XXX If we get here, the table is mal-formed...

    }

    return 0;

}

{

    if (LE_FAILURE(success)) {

        return 0;

    }

    LEGlyphID glyph = glyphIterator->getCurrGlyphID();

    le_int32 coverageIndex = getGlyphCoverage(lookupProcessor->getReference(), glyph, success);

    if (LE_FAILURE(success)) {

        return 0;

    }

    if (coverageIndex >= 0) {

        le_uint16 scSetCount = SWAPW(subClassSetCount);

        if (setClass < scSetCount && subClassSetTableOffsetArray[setClass] != 0) {

            Offset subClassSetTableOffset = SWAPW(subClassSetTableOffsetArray[setClass]);

            le_uint16 subClassRuleCount = SWAPW(subClassSetTable->subClassRuleCount);

            le_int32 position = glyphIterator->getCurrStreamPosition();

            for (le_uint16 scRule = 0; scRule < subClassRuleCount; scRule += 1) {

                Offset subClassRuleTableOffset =

                    SWAPW(subClassSetTable->subClassRuleTableOffsetArray[scRule]);

                le_uint16 matchCount = SWAPW(subClassRuleTable->glyphCount) - 1;

                le_uint16 substCount = SWAPW(subClassRuleTable->substCount);

                    applySubstitutionLookups(lookupProcessor, substLookupRecordArray, substCount, glyphIterator, fontInstance, position, success);

                    return matchCount + 1;

                }

                glyphIterator->setCurrStreamPosition(position);

            }

        }

        // XXX If we get here, the table is mal-formed...

    }

    return 0;

}

                                                         GlyphIterator *glyphIterator,

                                                         const LEFontInstance *fontInstance,

                                                         LEErrorCode& success)const

{

    if (LE_FAILURE(success)) {

        return 0;

    }

    le_uint16 gCount = SWAPW(glyphCount);

    le_uint16 subCount = SWAPW(substCount);

    le_int32 position = glyphIterator->getCurrStreamPosition();

    // Back up the glyph iterator so that we

    // can call next() before the check, which

    // will leave it pointing at the last glyph

    // that matched when we're done.

    glyphIterator->prev();

        ContextualSubstitutionBase::applySubstitutionLookups(lookupProcessor, substLookupRecordArray, subCount, glyphIterator, fontInstance, position, success);

        return gCount + 1;

    }

    glyphIterator->setCurrStreamPosition(position);

    return 0;

}

                                                          GlyphIterator *glyphIterator,

                                                          const LEFontInstance *fontInstance,

                                                          LEErrorCode& success) const

{

    if (LE_FAILURE(success)) {

        return 0;

    }

    switch(SWAPW(subtableFormat))

    {

    case 0:

        return 0;

    case 1:

    {

    }

    case 2:

    {

    }

    case 3:

    {

    }

    default:

        return 0;

    }

}

// NOTE: This could be a #define, but that seems to confuse

// the Visual Studio .NET 2003 compiler on the calls to the

// GlyphIterator constructor. It somehow can't decide if

// emptyFeatureList matches an le_uint32 or an le_uint16...

static const FeatureMask emptyFeatureList = 0x00000000UL;

                                                                 GlyphIterator *glyphIterator,

                                                                 const LEFontInstance *fontInstance,

                                                                 LEErrorCode& success) const

{

    if (LE_FAILURE(success)) {

        return 0;

    }

    LEGlyphID glyph = glyphIterator->getCurrGlyphID();

    le_int32 coverageIndex = getGlyphCoverage(lookupProcessor->getReference(), glyph, success);

    if (LE_FAILURE(success)) {

        return 0;

    }

    if (coverageIndex >= 0) {

        le_uint16 srSetCount = SWAPW(chainSubRuleSetCount);

        if (coverageIndex < srSetCount) {

            Offset chainSubRuleSetTableOffset = SWAPW(chainSubRuleSetTableOffsetArray[coverageIndex]);

            le_uint16 chainSubRuleCount = SWAPW(chainSubRuleSetTable->chainSubRuleCount);

            le_int32 position = glyphIterator->getCurrStreamPosition();

            GlyphIterator tempIterator(*glyphIterator, emptyFeatureList);

            for (le_uint16 subRule = 0; subRule < chainSubRuleCount; subRule += 1) {

                Offset chainSubRuleTableOffset =

                    SWAPW(chainSubRuleSetTable->chainSubRuleTableOffsetArray[subRule]);

                le_uint16 backtrackGlyphCount = SWAPW(chainSubRuleTable->backtrackGlyphCount);

                le_uint16 inputGlyphCount = (le_uint16) SWAPW(chainSubRuleTable->backtrackGlyphArray[backtrackGlyphCount]) - 1;

                le_uint16 lookaheadGlyphCount = (le_uint16) SWAPW(inputGlyphArray[inputGlyphCount]);

                le_uint16 substCount = (le_uint16) SWAPW(lookaheadGlyphArray[lookaheadGlyphCount]);

                tempIterator.setCurrStreamPosition(position);

                if (! tempIterator.prev(backtrackGlyphCount)) {

                    continue;

                }

                tempIterator.prev();

                    continue;

                }

                tempIterator.setCurrStreamPosition(position);

                tempIterator.next(inputGlyphCount);

                if (!matchGlyphIDs(lookaheadGlyphArray, lookaheadGlyphCount, &tempIterator)) {

                    continue;

                }

                if (matchGlyphIDs(inputGlyphArray, inputGlyphCount, glyphIterator)) {

                    applySubstitutionLookups(lookupProcessor, substLookupRecordArray, substCount, glyphIterator, fontInstance, position, success);

                    return inputGlyphCount + 1;

                }

                glyphIterator->setCurrStreamPosition(position);

            }

        }

        // XXX If we get here, the table is mal-formed...

    }

    return 0;

}

                                                                 GlyphIterator *glyphIterator,

                                                                 const LEFontInstance *fontInstance,

                                                                 LEErrorCode& success) const

{

    if (LE_FAILURE(success)) {