/*

 * 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.  Sun designates this

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

 * by Sun 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

 * CA 95054 USA or visit www.sun.com if you need additional information or

 * have any questions.

 *

 */

/*

 *

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

 *

 */

#include "LETypes.h"

#include "LayoutTables.h"

#include "LookupTables.h"

#include "LESwaps.h"

/*

    These are the rolled-up versions of the uniform binary search.

    Someday, if we need more performance, we can un-roll them.

    Note: I put these in the base class, so they only have to

    be written once. Since the base class doesn't define the

    segment table, these routines assume that it's right after

    the binary search header.

    Another way to do this is to put each of these routines in one

    of the derived classes, and implement it in the others by casting

    the "this" pointer to the type that has the implementation.

*/

const LookupSegment *BinarySearchLookupTable::lookupSegment(const LookupSegment *segments, LEGlyphID glyph) const

{

    le_int16  unity = SWAPW(unitSize);

    le_int16  probe = SWAPW(searchRange);

    le_int16  extra = SWAPW(rangeShift);

    TTGlyphID ttGlyph = (TTGlyphID) LE_GET_GLYPH(glyph);

    const LookupSegment *entry = segments;

    const LookupSegment *trial = (const LookupSegment *) ((char *) entry + extra);

    if (SWAPW(trial->lastGlyph) <= ttGlyph) {

        entry = trial;

    }

    while (probe > unity) {

        probe >>= 1;

        trial = (const LookupSegment *) ((char *) entry + probe);

        if (SWAPW(trial->lastGlyph) <= ttGlyph) {

            entry = trial;

        }

    }

    if (SWAPW(entry->firstGlyph) <= ttGlyph) {

        return entry;

    }

    return NULL;

}

const LookupSingle *BinarySearchLookupTable::lookupSingle(const LookupSingle *entries, LEGlyphID glyph) const

{

    le_int16  unity = SWAPW(unitSize);

    le_int16  probe = SWAPW(searchRange);

    le_int16  extra = SWAPW(rangeShift);

    TTGlyphID ttGlyph = (TTGlyphID) LE_GET_GLYPH(glyph);

    const LookupSingle *entry = entries;

    const LookupSingle *trial = (const LookupSingle *) ((char *) entry + extra);

    if (SWAPW(trial->glyph) <= ttGlyph) {

        entry = trial;

    }

    while (probe > unity) {

        probe >>= 1;

        trial = (const LookupSingle *) ((char *) entry + probe);

        if (SWAPW(trial->glyph) <= ttGlyph) {

            entry = trial;

        }

    }

    if (SWAPW(entry->glyph) == ttGlyph) {

        return entry;

    }

    return NULL;

}