2000-11-28 20:56:52 +00:00
|
|
|
/*
|
|
|
|
* %W% %E%
|
|
|
|
*
|
2001-01-19 00:30:17 +00:00
|
|
|
* (C) Copyright IBM Corp. 1998, 1999, 2000, 2001 - All Rights Reserved
|
2000-11-28 20:56:52 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "LETypes.h"
|
|
|
|
#include "OpenTypeTables.h"
|
|
|
|
#include "GlyphDefinitionTables.h"
|
|
|
|
#include "GlyphPositionAdjustments.h"
|
|
|
|
#include "GlyphIterator.h"
|
|
|
|
#include "Lookups.h"
|
|
|
|
#include "LESwaps.h"
|
|
|
|
|
2001-10-16 00:39:01 +00:00
|
|
|
U_NAMESPACE_BEGIN
|
|
|
|
|
2000-11-28 20:56:52 +00:00
|
|
|
GlyphIterator::GlyphIterator(LEGlyphID *theGlyphs, GlyphPositionAdjustment *theGlyphPositionAdjustments, le_int32 theGlyphCount,
|
|
|
|
le_bool rightToLeft, le_uint16 theLookupFlags, LETag theFeatureTag, const LETag *theGlyphTags[],
|
2001-01-19 00:30:17 +00:00
|
|
|
const GlyphDefinitionTableHeader *theGlyphDefinitionTableHeader)
|
2000-11-28 20:56:52 +00:00
|
|
|
: direction(1), position(-1), nextLimit(theGlyphCount), prevLimit(-1),
|
|
|
|
glyphs(theGlyphs), glyphPositionAdjustments(theGlyphPositionAdjustments), lookupFlags(theLookupFlags),
|
|
|
|
featureTag(theFeatureTag), glyphTags(theGlyphTags),
|
|
|
|
glyphClassDefinitionTable(NULL),
|
|
|
|
markAttachClassDefinitionTable(NULL)
|
|
|
|
|
|
|
|
{
|
2001-01-19 00:30:17 +00:00
|
|
|
if (theGlyphDefinitionTableHeader != NULL) {
|
2000-11-28 20:56:52 +00:00
|
|
|
glyphClassDefinitionTable = theGlyphDefinitionTableHeader->getGlyphClassDefinitionTable();
|
|
|
|
markAttachClassDefinitionTable = theGlyphDefinitionTableHeader->getMarkAttachClassDefinitionTable();
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
if (rightToLeft) {
|
2000-11-28 20:56:52 +00:00
|
|
|
direction = -1;
|
|
|
|
position = theGlyphCount;
|
|
|
|
nextLimit = -1;
|
|
|
|
prevLimit = theGlyphCount;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
GlyphIterator::GlyphIterator(GlyphIterator &that)
|
|
|
|
{
|
|
|
|
direction = that.direction;
|
|
|
|
position = that.position;
|
|
|
|
nextLimit = that.nextLimit;
|
|
|
|
prevLimit = that.prevLimit;
|
|
|
|
|
|
|
|
glyphs = that.glyphs;
|
|
|
|
glyphPositionAdjustments = that.glyphPositionAdjustments;
|
|
|
|
lookupFlags = that.lookupFlags;
|
|
|
|
featureTag = that.featureTag;
|
|
|
|
glyphTags = that.glyphTags;
|
|
|
|
glyphClassDefinitionTable = that.glyphClassDefinitionTable;
|
|
|
|
markAttachClassDefinitionTable = that.markAttachClassDefinitionTable;
|
|
|
|
}
|
|
|
|
|
|
|
|
GlyphIterator::GlyphIterator(GlyphIterator &that, le_uint16 newLookupFlags)
|
|
|
|
{
|
|
|
|
direction = that.direction;
|
|
|
|
position = that.position;
|
|
|
|
nextLimit = that.nextLimit;
|
|
|
|
prevLimit = that.prevLimit;
|
|
|
|
|
|
|
|
glyphs = that.glyphs;
|
|
|
|
glyphPositionAdjustments = that.glyphPositionAdjustments;
|
|
|
|
lookupFlags = newLookupFlags;
|
|
|
|
featureTag = that.featureTag;
|
|
|
|
glyphTags = that.glyphTags;
|
|
|
|
glyphClassDefinitionTable = that.glyphClassDefinitionTable;
|
|
|
|
markAttachClassDefinitionTable = that.markAttachClassDefinitionTable;
|
|
|
|
}
|
|
|
|
|
|
|
|
GlyphIterator::GlyphIterator()
|
|
|
|
{
|
|
|
|
};
|
|
|
|
|
|
|
|
GlyphIterator::~GlyphIterator()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
le_int32 GlyphIterator::getCurrStreamPosition() const
|
2000-11-28 20:56:52 +00:00
|
|
|
{
|
|
|
|
return position;
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
le_bool GlyphIterator::isRightToLeft() const
|
2000-11-28 20:56:52 +00:00
|
|
|
{
|
|
|
|
return direction < 0;
|
|
|
|
}
|
|
|
|
|
2001-09-20 00:37:55 +00:00
|
|
|
le_bool GlyphIterator::ignoresMarks() const
|
|
|
|
{
|
|
|
|
return (lookupFlags & lfIgnoreMarks) != 0;
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
LEGlyphID GlyphIterator::getCurrGlyphID() const
|
2000-11-28 20:56:52 +00:00
|
|
|
{
|
2001-01-19 00:30:17 +00:00
|
|
|
if (direction < 0) {
|
|
|
|
if (position <= nextLimit || position >= prevLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return 0xFFFF;
|
|
|
|
}
|
2001-01-19 00:30:17 +00:00
|
|
|
} else {
|
|
|
|
if (position <= prevLimit || position >= nextLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return 0xFFFF;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return glyphs[position];
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
void GlyphIterator::getCurrGlyphPositionAdjustment(GlyphPositionAdjustment &adjustment) const
|
2000-11-28 20:56:52 +00:00
|
|
|
{
|
|
|
|
if (direction < 0)
|
|
|
|
{
|
|
|
|
if (position <= nextLimit || position >= prevLimit)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
2001-01-19 00:30:17 +00:00
|
|
|
} else {
|
|
|
|
if (position <= prevLimit || position >= nextLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
adjustment = glyphPositionAdjustments[position];
|
|
|
|
}
|
|
|
|
|
|
|
|
void GlyphIterator::setCurrGlyphID(LEGlyphID glyphID)
|
|
|
|
{
|
|
|
|
glyphs[position] = glyphID;
|
|
|
|
}
|
|
|
|
|
|
|
|
void GlyphIterator::setCurrStreamPosition(le_int32 newPosition)
|
|
|
|
{
|
2001-01-19 00:30:17 +00:00
|
|
|
if (direction < 0) {
|
|
|
|
if (newPosition >= prevLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
position = prevLimit;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
if (newPosition <= nextLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
position = nextLimit;
|
|
|
|
return;
|
|
|
|
}
|
2001-01-19 00:30:17 +00:00
|
|
|
} else {
|
|
|
|
if (newPosition <= prevLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
position = prevLimit;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
if (newPosition >= nextLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
position = nextLimit;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
position = newPosition - direction;
|
|
|
|
next();
|
|
|
|
}
|
|
|
|
|
|
|
|
void GlyphIterator::setCurrGlyphPositionAdjustment(const GlyphPositionAdjustment *adjustment)
|
|
|
|
{
|
2001-01-19 00:30:17 +00:00
|
|
|
if (direction < 0) {
|
|
|
|
if (position <= nextLimit || position >= prevLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return;
|
|
|
|
}
|
2001-01-19 00:30:17 +00:00
|
|
|
} else {
|
|
|
|
if (position <= prevLimit || position >= nextLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
glyphPositionAdjustments[position] = *adjustment;
|
|
|
|
}
|
|
|
|
|
|
|
|
void GlyphIterator::adjustCurrGlyphPositionAdjustment(float xPlacementAdjust, float yPlacementAdjust,
|
|
|
|
float xAdvanceAdjust, float yAdvanceAdjust)
|
|
|
|
{
|
2001-01-19 00:30:17 +00:00
|
|
|
if (direction < 0) {
|
|
|
|
if (position <= nextLimit || position >= prevLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return;
|
|
|
|
}
|
2001-01-19 00:30:17 +00:00
|
|
|
} else {
|
|
|
|
if (position <= prevLimit || position >= nextLimit) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
glyphPositionAdjustments[position].adjustXPlacement(xPlacementAdjust);
|
|
|
|
glyphPositionAdjustments[position].adjustYPlacement(yPlacementAdjust);
|
|
|
|
glyphPositionAdjustments[position].adjustXAdvance(xAdvanceAdjust);
|
|
|
|
glyphPositionAdjustments[position].adjustYAdvance(yAdvanceAdjust);
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
le_bool GlyphIterator::filterGlyph(le_uint32 index) const
|
2000-11-28 20:56:52 +00:00
|
|
|
{
|
|
|
|
LEGlyphID glyphID = (LEGlyphID) glyphs[index];
|
|
|
|
le_int32 glyphClass = gcdNoGlyphClass;
|
|
|
|
|
2001-09-20 00:37:55 +00:00
|
|
|
// FIXME: is this test really safe?
|
|
|
|
if (glyphID >= 0xFFFE) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
if (glyphClassDefinitionTable != NULL) {
|
2000-11-28 20:56:52 +00:00
|
|
|
glyphClass = glyphClassDefinitionTable->getGlyphClass(glyphID);
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (glyphClass)
|
|
|
|
{
|
|
|
|
case gcdNoGlyphClass:
|
|
|
|
return false;
|
|
|
|
|
|
|
|
case gcdSimpleGlyph:
|
|
|
|
return (lookupFlags & lfIgnoreBaseGlyphs) != 0;
|
|
|
|
|
|
|
|
case gcdLigatureGlyph:
|
|
|
|
return (lookupFlags & lfIgnoreLigatures) != 0;
|
|
|
|
|
|
|
|
case gcdMarkGlyph:
|
|
|
|
{
|
2001-01-19 00:30:17 +00:00
|
|
|
if ((lookupFlags & lfIgnoreMarks) != 0) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
le_uint16 markAttachType = (lookupFlags & lfMarkAttachTypeMask) >> lfMarkAttachTypeShift;
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
if ((markAttachType != 0) && (markAttachClassDefinitionTable != NULL)) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return markAttachClassDefinitionTable->getGlyphClass(glyphID) != markAttachType;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
case gcdComponentGlyph:
|
|
|
|
return (lookupFlags & lfIgnoreBaseGlyphs) != 0;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
const LETag emptyTag = 0;
|
|
|
|
const LETag defaultTag = 0xFFFFFFFF;
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
le_bool GlyphIterator::hasFeatureTag() const
|
2000-11-28 20:56:52 +00:00
|
|
|
{
|
2001-01-19 00:30:17 +00:00
|
|
|
if (featureTag == defaultTag || featureTag == emptyTag) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (glyphTags != NULL) {
|
|
|
|
const LETag *tagList = glyphTags[position];
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
for (le_int32 tag = 0; tagList[tag] != emptyTag; tag += 1) {
|
|
|
|
if (tagList[tag] == featureTag) {
|
2000-11-28 20:56:52 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
le_bool GlyphIterator::findFeatureTag()
|
|
|
|
{
|
2001-01-19 00:30:17 +00:00
|
|
|
while (nextInternal()) {
|
|
|
|
if (hasFeatureTag()) {
|
2000-11-28 20:56:52 +00:00
|
|
|
prevInternal();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
le_bool GlyphIterator::nextInternal(le_uint32 delta)
|
|
|
|
{
|
|
|
|
le_int32 newPosition = position;
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
while (newPosition != nextLimit && delta > 0) {
|
|
|
|
do {
|
2000-11-28 20:56:52 +00:00
|
|
|
newPosition += direction;
|
2001-01-19 00:30:17 +00:00
|
|
|
} while (newPosition != nextLimit && filterGlyph(newPosition));
|
2000-11-28 20:56:52 +00:00
|
|
|
|
|
|
|
delta -= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
position = newPosition;
|
|
|
|
|
|
|
|
return position != nextLimit;
|
|
|
|
}
|
|
|
|
|
|
|
|
le_bool GlyphIterator::next(le_uint32 delta)
|
|
|
|
{
|
|
|
|
return nextInternal(delta) && hasFeatureTag();
|
|
|
|
}
|
|
|
|
|
|
|
|
le_bool GlyphIterator::prevInternal(le_uint32 delta)
|
|
|
|
{
|
|
|
|
le_int32 newPosition = position;
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
while (newPosition != prevLimit && delta > 0) {
|
|
|
|
do {
|
2000-11-28 20:56:52 +00:00
|
|
|
newPosition -= direction;
|
2001-01-19 00:30:17 +00:00
|
|
|
} while (newPosition != prevLimit && filterGlyph(newPosition));
|
2000-11-28 20:56:52 +00:00
|
|
|
|
|
|
|
delta -= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
position = newPosition;
|
|
|
|
|
|
|
|
return position != prevLimit;
|
|
|
|
}
|
|
|
|
|
|
|
|
le_bool GlyphIterator::prev(le_uint32 delta)
|
|
|
|
{
|
|
|
|
return prevInternal(delta) && hasFeatureTag();
|
|
|
|
}
|
|
|
|
|
2001-01-19 00:30:17 +00:00
|
|
|
le_int32 GlyphIterator::getMarkComponent(le_int32 markPosition) const
|
2000-11-28 20:56:52 +00:00
|
|
|
{
|
|
|
|
le_int32 component = 0;
|
|
|
|
le_int32 posn, start = position, end = markPosition;
|
|
|
|
|
|
|
|
if (markPosition < position) {
|
|
|
|
start = markPosition;
|
|
|
|
end = position;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (posn = start; posn <= end; posn += 1) {
|
2001-09-20 00:37:55 +00:00
|
|
|
if (glyphs[posn] == 0xFFFE) {
|
2000-11-28 20:56:52 +00:00
|
|
|
component += 1;
|
2001-01-19 00:30:17 +00:00
|
|
|
}
|
2000-11-28 20:56:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return component;
|
|
|
|
}
|
|
|
|
|
2001-10-16 00:39:01 +00:00
|
|
|
U_NAMESPACE_END
|