2
|
1 |
/*
|
|
2 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
3 |
*
|
|
4 |
* This code is free software; you can redistribute it and/or modify it
|
|
5 |
* under the terms of the GNU General Public License version 2 only, as
|
|
6 |
* published by the Free Software Foundation. Sun designates this
|
|
7 |
* particular file as subject to the "Classpath" exception as provided
|
|
8 |
* by Sun in the LICENSE file that accompanied this code.
|
|
9 |
*
|
|
10 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
11 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
12 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
13 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
14 |
* accompanied this code).
|
|
15 |
*
|
|
16 |
* You should have received a copy of the GNU General Public License version
|
|
17 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
18 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
19 |
*
|
|
20 |
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
21 |
* CA 95054 USA or visit www.sun.com if you need additional information or
|
|
22 |
* have any questions.
|
|
23 |
*
|
|
24 |
*/
|
|
25 |
|
|
26 |
/*
|
|
27 |
*
|
|
28 |
* (C) Copyright IBM Corp. 1998-2004 - All Rights Reserved
|
|
29 |
*
|
|
30 |
*/
|
|
31 |
|
|
32 |
#include "LETypes.h"
|
|
33 |
#include "MorphTables.h"
|
|
34 |
#include "StateTables.h"
|
|
35 |
#include "MorphStateTables.h"
|
|
36 |
#include "SubtableProcessor.h"
|
|
37 |
#include "StateTableProcessor.h"
|
|
38 |
#include "LEGlyphStorage.h"
|
|
39 |
#include "LESwaps.h"
|
|
40 |
|
|
41 |
StateTableProcessor::StateTableProcessor()
|
|
42 |
{
|
|
43 |
}
|
|
44 |
|
|
45 |
StateTableProcessor::StateTableProcessor(const MorphSubtableHeader *morphSubtableHeader)
|
|
46 |
: SubtableProcessor(morphSubtableHeader)
|
|
47 |
{
|
|
48 |
stateTableHeader = (const MorphStateTableHeader *) morphSubtableHeader;
|
|
49 |
|
|
50 |
stateSize = SWAPW(stateTableHeader->stHeader.stateSize);
|
|
51 |
classTableOffset = SWAPW(stateTableHeader->stHeader.classTableOffset);
|
|
52 |
stateArrayOffset = SWAPW(stateTableHeader->stHeader.stateArrayOffset);
|
|
53 |
entryTableOffset = SWAPW(stateTableHeader->stHeader.entryTableOffset);
|
|
54 |
|
|
55 |
classTable = (const ClassTable *) ((char *) &stateTableHeader->stHeader + classTableOffset);
|
|
56 |
firstGlyph = SWAPW(classTable->firstGlyph);
|
|
57 |
lastGlyph = firstGlyph + SWAPW(classTable->nGlyphs);
|
|
58 |
}
|
|
59 |
|
|
60 |
StateTableProcessor::~StateTableProcessor()
|
|
61 |
{
|
|
62 |
}
|
|
63 |
|
|
64 |
void StateTableProcessor::process(LEGlyphStorage &glyphStorage)
|
|
65 |
{
|
|
66 |
// Start at state 0
|
|
67 |
// XXX: How do we know when to start at state 1?
|
|
68 |
ByteOffset currentState = stateArrayOffset;
|
|
69 |
|
|
70 |
// XXX: reverse?
|
|
71 |
le_int32 currGlyph = 0;
|
|
72 |
le_int32 glyphCount = glyphStorage.getGlyphCount();
|
|
73 |
|
|
74 |
beginStateTable();
|
|
75 |
|
|
76 |
while (currGlyph <= glyphCount) {
|
|
77 |
ClassCode classCode = classCodeOOB;
|
|
78 |
if (currGlyph == glyphCount) {
|
|
79 |
// XXX: How do we handle EOT vs. EOL?
|
|
80 |
classCode = classCodeEOT;
|
|
81 |
} else {
|
|
82 |
TTGlyphID glyphCode = (TTGlyphID) LE_GET_GLYPH(glyphStorage[currGlyph]);
|
|
83 |
|
|
84 |
if (glyphCode == 0xFFFF) {
|
|
85 |
classCode = classCodeDEL;
|
|
86 |
} else if ((glyphCode >= firstGlyph) && (glyphCode < lastGlyph)) {
|
|
87 |
classCode = classTable->classArray[glyphCode - firstGlyph];
|
|
88 |
}
|
|
89 |
}
|
|
90 |
|
|
91 |
const EntryTableIndex *stateArray = (const EntryTableIndex *) ((char *) &stateTableHeader->stHeader + currentState);
|
|
92 |
EntryTableIndex entryTableIndex = stateArray[(le_uint8)classCode];
|
|
93 |
|
|
94 |
currentState = processStateEntry(glyphStorage, currGlyph, entryTableIndex);
|
|
95 |
}
|
|
96 |
|
|
97 |
endStateTable();
|
|
98 |
}
|