/*

 * 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-2013 - All Rights Reserved

 *

 */

#include "LETypes.h"

#include "OpenTypeUtilities.h"

#include "LEFontInstance.h"

#include "OpenTypeTables.h"

#include "ICUFeatures.h"

#include "Lookups.h"

#include "ScriptAndLanguage.h"

#include "GlyphDefinitionTables.h"

#include "GlyphIterator.h"

#include "LookupProcessor.h"

#include "LEGlyphStorage.h"

#include "LESwaps.h"

U_NAMESPACE_BEGIN

                                         const LEFontInstance *fontInstance, LEErrorCode& success) const

{

    if (LE_FAILURE(success)) {

        return 0;

    }

    le_uint16 lookupType = SWAPW(lookupTable->lookupType);

    le_uint16 subtableCount = SWAPW(lookupTable->subTableCount);

    le_int32 startPosition = glyphIterator->getCurrStreamPosition();

    le_uint32 delta;

    for (le_uint16 subtable = 0; subtable < subtableCount; subtable += 1) {

        delta = applySubtable(lookupSubtable, lookupType, glyphIterator, fontInstance, success);

        if (delta > 0 && LE_FAILURE(success)) {

            return 1;

        }

        glyphIterator->setCurrStreamPosition(startPosition);

    }

    return 1;

}

le_int32 LookupProcessor::process(LEGlyphStorage &glyphStorage, GlyphPositionAdjustments *glyphPositionAdjustments,

                              const LEFontInstance *fontInstance, LEErrorCode& success) const

{

    if (LE_FAILURE(success)) {

        return 0;

    }

    le_int32 glyphCount = glyphStorage.getGlyphCount();

    if (lookupSelectArray == NULL) {

        return glyphCount;

    }

    GlyphIterator glyphIterator(glyphStorage, glyphPositionAdjustments,

                                rightToLeft, 0, 0, glyphDefinitionTableHeader);

    le_int32 newGlyphCount = glyphCount;

        le_uint16 lookup = lookupOrderArray[order];

        FeatureMask selectMask = lookupSelectArray[lookup];

        if (selectMask != 0) {

                continue;

            }

            le_uint16 lookupFlags = SWAPW(lookupTable->lookupFlags);

            glyphIterator.reset(lookupFlags, selectMask);

            while (glyphIterator.findFeatureTag()) {

                if (LE_FAILURE(success)) {

                    return 0;

                }

            }

            newGlyphCount = glyphIterator.applyInsertions();

        }

    }

    return newGlyphCount;

}

le_uint32 LookupProcessor::applySingleLookup(le_uint16 lookupTableIndex, GlyphIterator *glyphIterator,

                                          const LEFontInstance *fontInstance, LEErrorCode& success) const

{

    if (LE_FAILURE(success)) {

        return 0;

    }

        success = LE_INTERNAL_ERROR;

        return 0;

    }

    le_uint16 lookupFlags = SWAPW(lookupTable->lookupFlags);

    GlyphIterator tempIterator(*glyphIterator, lookupFlags);

    le_uint32 delta = applyLookupTable(lookupTable, &tempIterator, fontInstance, success);

    return delta;

}

{

    le_int32  store = order;

    }

    return store - order;

}

        Offset scriptListOffset, Offset featureListOffset, Offset lookupListOffset,

        LETag scriptTag, LETag languageTag, const FeatureMap *featureMap, le_int32 featureMapCount, le_bool orderFeatures,

        LEErrorCode& success)

{

    le_uint16 featureCount = 0;

    le_uint16 lookupListCount = 0;

    le_uint16 requiredFeatureIndex;

    if (LE_FAILURE(success)) {

        return;

    }

    if (scriptListOffset != 0) {

    }

    if (featureListOffset != 0) {

    }

    if (lookupListOffset != 0) {

        lookupListCount = SWAPW(lookupListTable->lookupCount);

    }

        featureCount == 0 || lookupListCount == 0) {

        return;

    }

    lookupSelectArray = LE_NEW_ARRAY(FeatureMask, lookupListCount);

    if (lookupSelectArray == NULL) {

        success = LE_MEMORY_ALLOCATION_ERROR;

        return;

    }

    for (int i = 0; i < lookupListCount; i += 1) {

        lookupSelectArray[i] = 0;

    }

    lookupSelectCount = lookupListCount;

    le_int32 count, order = 0;

    le_uint32 featureReferences = 0;

    LETag featureTag;

    LETag requiredFeatureTag = 0x00000000U;

    // Count the total number of lookups referenced by all features. This will

    // be the maximum number of entries in the lookupOrderArray. We can't use

    // lookupListCount because some lookups might be referenced by more than

    // one feature.

        }

        featureReferences += SWAPW(featureTable->lookupCount);

    }

        success = LE_INTERNAL_ERROR;

        return;

    }

    if (requiredFeatureIndex != 0xFFFF) {

    }

    lookupOrderArray = LE_NEW_ARRAY(le_uint16, featureReferences);

    if (lookupOrderArray == NULL) {

        success = LE_MEMORY_ALLOCATION_ERROR;

        return;

    }

    for (le_int32 f = 0; f < featureMapCount; f += 1) {

        FeatureMap fm = featureMap[f];

        count = 0;

        // If this is the required feature, add its lookups

        if (requiredFeatureTag == fm.tag) {

        }

        if (orderFeatures) {

            // If we added lookups from the required feature, sort them

            if (count > 1) {

                OpenTypeUtilities::sort(lookupOrderArray, order);

            }

            for (le_uint16 feature = 0; feature < featureCount; feature += 1) {

                // don't add the required feature to the list more than once...

                // TODO: Do we need this check? (Spec. says required feature won't be in feature list...)

                if (featureIndex == requiredFeatureIndex) {

                    continue;

                }

                if (featureTag == fm.tag) {

                }

            }

            if (count > 1) {

                OpenTypeUtilities::sort(&lookupOrderArray[order], count);

            }

            order += count;

                // don't add the required feature to the list more than once...

                // NOTE: This check is commented out because the spec. says that

                // the required feature won't be in the feature list, and because

                // any duplicate entries will be removed below.

#if 0

                if (featureIndex == requiredFeatureIndex) {

                    continue;

                }

#endif

                if (featureTag == fm.tag) {

                }

            }

        }

    }

    if (!orderFeatures && (order > 1)) {

        OpenTypeUtilities::sort(lookupOrderArray, order);

        // If there's no specified feature order,

        // we will apply the lookups in the order

        // that they're in the font. If a particular

        // lookup may be referenced by more than one feature,

        // it will apprear in the lookupOrderArray more than

        // once, so remove any duplicate entries in the sorted array.

        le_int32 out = 1;

        for (le_int32 in = 1; in < order; in += 1) {

            if (lookupOrderArray[out - 1] != lookupOrderArray[in]) {

                if (out != in) {

                    lookupOrderArray[out] = lookupOrderArray[in];

                }

                out += 1;

            }

        }

        order = out;

    }

    lookupOrderCount = order;

}

LookupProcessor::LookupProcessor()

{

        lookupOrderArray = NULL;

        lookupSelectArray = NULL;

}

LookupProcessor::~LookupProcessor()

{

    LE_DELETE_ARRAY(lookupOrderArray);

    LE_DELETE_ARRAY(lookupSelectArray);

}

U_NAMESPACE_END