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-2010 - All Rights Reserved
0N/A *
0N/A */
0N/A
0N/A#include "LETypes.h"
0N/A#include "LEFontInstance.h"
0N/A#include "OpenTypeTables.h"
0N/A#include "AnchorTables.h"
0N/A#include "MarkArrays.h"
0N/A#include "GlyphPositioningTables.h"
0N/A#include "AttachmentPosnSubtables.h"
0N/A#include "MarkToBasePosnSubtables.h"
0N/A#include "GlyphIterator.h"
0N/A#include "LESwaps.h"
0N/A
1693N/AU_NAMESPACE_BEGIN
1693N/A
0N/ALEGlyphID MarkToBasePositioningSubtable::findBaseGlyph(GlyphIterator *glyphIterator) const
0N/A{
0N/A if (glyphIterator->prev()) {
0N/A return glyphIterator->getCurrGlyphID();
0N/A }
0N/A
0N/A return 0xFFFF;
0N/A}
0N/A
5980N/Ale_int32 MarkToBasePositioningSubtable::process(const LETableReference &base, GlyphIterator *glyphIterator, const LEFontInstance *fontInstance, LEErrorCode &success) const
0N/A{
0N/A LEGlyphID markGlyph = glyphIterator->getCurrGlyphID();
5980N/A le_int32 markCoverage = getGlyphCoverage(base, (LEGlyphID) markGlyph, success);
0N/A
6371N/A if (LE_FAILURE(success)) {
6371N/A return 0;
6371N/A }
6371N/A
0N/A if (markCoverage < 0) {
0N/A // markGlyph isn't a covered mark glyph
0N/A return 0;
0N/A }
0N/A
0N/A LEPoint markAnchor;
0N/A const MarkArray *markArray = (const MarkArray *) ((char *) this + SWAPW(markArrayOffset));
0N/A le_int32 markClass = markArray->getMarkClass(markGlyph, markCoverage, fontInstance, markAnchor);
0N/A le_uint16 mcCount = SWAPW(classCount);
0N/A
0N/A if (markClass < 0 || markClass >= mcCount) {
0N/A // markGlyph isn't in the mark array or its
0N/A // mark class is too big. The table is mal-formed!
0N/A return 0;
0N/A }
0N/A
0N/A // FIXME: We probably don't want to find a base glyph before a previous ligature...
0N/A GlyphIterator baseIterator(*glyphIterator, (le_uint16) (lfIgnoreMarks /*| lfIgnoreLigatures*/));
0N/A LEGlyphID baseGlyph = findBaseGlyph(&baseIterator);
5980N/A le_int32 baseCoverage = getBaseCoverage(base, (LEGlyphID) baseGlyph, success);
0N/A const BaseArray *baseArray = (const BaseArray *) ((char *) this + SWAPW(baseArrayOffset));
0N/A le_uint16 baseCount = SWAPW(baseArray->baseRecordCount);
0N/A
0N/A if (baseCoverage < 0 || baseCoverage >= baseCount) {
0N/A // The base glyph isn't covered, or the coverage
0N/A // index is too big. The latter means that the
0N/A // table is mal-formed...
0N/A return 0;
0N/A }
0N/A
0N/A const BaseRecord *baseRecord = &baseArray->baseRecordArray[baseCoverage * mcCount];
0N/A Offset anchorTableOffset = SWAPW(baseRecord->baseAnchorTableOffsetArray[markClass]);
0N/A const AnchorTable *anchorTable = (const AnchorTable *) ((char *) baseArray + anchorTableOffset);
0N/A LEPoint baseAnchor, markAdvance, pixels;
0N/A
0N/A if (anchorTableOffset == 0) {
0N/A // this means the table is mal-formed...
0N/A glyphIterator->setCurrGlyphBaseOffset(baseIterator.getCurrStreamPosition());
0N/A return 0;
0N/A }
0N/A
0N/A anchorTable->getAnchor(baseGlyph, fontInstance, baseAnchor);
0N/A
0N/A fontInstance->getGlyphAdvance(markGlyph, pixels);
0N/A fontInstance->pixelsToUnits(pixels, markAdvance);
0N/A
0N/A float anchorDiffX = baseAnchor.fX - markAnchor.fX;
0N/A float anchorDiffY = baseAnchor.fY - markAnchor.fY;
0N/A
0N/A glyphIterator->setCurrGlyphBaseOffset(baseIterator.getCurrStreamPosition());
0N/A
0N/A if (glyphIterator->isRightToLeft()) {
3171N/A // FIXME: need similar patch to below; also in MarkToLigature and MarkToMark
3171N/A // (is there a better way to approach this for all the cases?)
0N/A glyphIterator->setCurrGlyphPositionAdjustment(anchorDiffX, anchorDiffY, -markAdvance.fX, -markAdvance.fY);
0N/A } else {
0N/A LEPoint baseAdvance;
0N/A
0N/A fontInstance->getGlyphAdvance(baseGlyph, pixels);
3171N/A
3171N/A //JK: adjustment needs to account for non-zero advance of any marks between base glyph and current mark
3171N/A GlyphIterator gi(baseIterator, (le_uint16)0); // copy of baseIterator that won't ignore marks
3171N/A gi.next(); // point beyond the base glyph
3171N/A while (gi.getCurrStreamPosition() < glyphIterator->getCurrStreamPosition()) { // for all intervening glyphs (marks)...
3171N/A LEGlyphID otherMark = gi.getCurrGlyphID();
3171N/A LEPoint px;
3171N/A fontInstance->getGlyphAdvance(otherMark, px); // get advance, in case it's non-zero
3171N/A pixels.fX += px.fX; // and add that to the base glyph's advance
3171N/A pixels.fY += px.fY;
3171N/A gi.next();
3171N/A }
3171N/A // end of JK patch
3171N/A
0N/A fontInstance->pixelsToUnits(pixels, baseAdvance);
0N/A
0N/A glyphIterator->setCurrGlyphPositionAdjustment(anchorDiffX - baseAdvance.fX, anchorDiffY - baseAdvance.fY, -markAdvance.fX, -markAdvance.fY);
0N/A }
0N/A
0N/A return 1;
0N/A}
1693N/A
1693N/AU_NAMESPACE_END