]>
Commit | Line | Data |
---|---|---|
b75a7d8f | 1 | /* |
b75a7d8f | 2 | * |
374ca955 | 3 | * (C) Copyright IBM Corp. 2002-2004 - All Rights Reserved |
b75a7d8f A |
4 | * |
5 | */ | |
6 | ||
7 | #include "LETypes.h" | |
374ca955 | 8 | #include "LEGlyphStorage.h" |
b75a7d8f A |
9 | #include "MPreFixups.h" |
10 | ||
11 | U_NAMESPACE_BEGIN | |
12 | ||
13 | struct FixupData | |
14 | { | |
15 | le_int32 fBaseIndex; | |
16 | le_int32 fMPreIndex; | |
17 | }; | |
18 | ||
19 | MPreFixups::MPreFixups(le_int32 charCount) | |
20 | : fFixupData(NULL), fFixupCount(0) | |
21 | { | |
22 | fFixupData = LE_NEW_ARRAY(FixupData, charCount); | |
23 | } | |
24 | ||
25 | MPreFixups::~MPreFixups() | |
26 | { | |
27 | LE_DELETE_ARRAY(fFixupData); | |
28 | fFixupData = NULL; | |
29 | } | |
30 | ||
31 | void MPreFixups::add(le_int32 baseIndex, le_int32 mpreIndex) | |
32 | { | |
33 | // NOTE: don't add the fixup data if the mpre is right | |
34 | // before the base consonant glyph. | |
35 | if (baseIndex - mpreIndex > 1) { | |
36 | fFixupData[fFixupCount].fBaseIndex = baseIndex; | |
37 | fFixupData[fFixupCount].fMPreIndex = mpreIndex; | |
38 | ||
39 | fFixupCount += 1; | |
40 | } | |
41 | } | |
42 | ||
374ca955 | 43 | void MPreFixups::apply(LEGlyphStorage &glyphStorage) |
b75a7d8f A |
44 | { |
45 | for (le_int32 fixup = 0; fixup < fFixupCount; fixup += 1) { | |
46 | le_int32 baseIndex = fFixupData[fixup].fBaseIndex; | |
47 | le_int32 mpreIndex = fFixupData[fixup].fMPreIndex; | |
48 | le_int32 mpreLimit = mpreIndex + 1; | |
49 | ||
374ca955 | 50 | while (glyphStorage[baseIndex] == 0xFFFF || glyphStorage[baseIndex] == 0xFFFE) { |
b75a7d8f A |
51 | baseIndex -= 1; |
52 | } | |
53 | ||
374ca955 | 54 | while (glyphStorage[mpreLimit] == 0xFFFF || glyphStorage[mpreLimit] == 0xFFFE) { |
b75a7d8f A |
55 | mpreLimit += 1; |
56 | } | |
57 | ||
58 | if (mpreLimit == baseIndex) { | |
59 | continue; | |
60 | } | |
61 | ||
374ca955 | 62 | LEErrorCode success = LE_NO_ERROR; |
b75a7d8f A |
63 | le_int32 mpreCount = mpreLimit - mpreIndex; |
64 | le_int32 moveCount = baseIndex - mpreLimit; | |
65 | le_int32 mpreDest = baseIndex - mpreCount; | |
66 | LEGlyphID *mpreSave = LE_NEW_ARRAY(LEGlyphID, mpreCount); | |
67 | le_int32 *indexSave = LE_NEW_ARRAY(le_int32, mpreCount); | |
68 | le_int32 i; | |
69 | ||
70 | for (i = 0; i < mpreCount; i += 1) { | |
374ca955 A |
71 | mpreSave[i] = glyphStorage[mpreIndex + i]; |
72 | indexSave[i] = glyphStorage.getCharIndex(mpreIndex + i, success); //charIndices[mpreIndex + i]; | |
b75a7d8f A |
73 | } |
74 | ||
75 | for (i = 0; i < moveCount; i += 1) { | |
374ca955 A |
76 | LEGlyphID glyph = glyphStorage[mpreLimit + i]; |
77 | le_int32 charIndex = glyphStorage.getCharIndex(mpreLimit + i, success); | |
78 | ||
79 | glyphStorage[mpreIndex + i] = glyph; | |
80 | glyphStorage.setCharIndex(mpreIndex + i, charIndex, success); | |
b75a7d8f A |
81 | } |
82 | ||
83 | for (i = 0; i < mpreCount; i += 1) { | |
374ca955 A |
84 | glyphStorage[mpreDest + i] = mpreSave[i]; |
85 | glyphStorage.setCharIndex(mpreDest, indexSave[i], success); | |
b75a7d8f A |
86 | } |
87 | ||
88 | LE_DELETE_ARRAY(indexSave); | |
89 | LE_DELETE_ARRAY(mpreSave); | |
90 | } | |
91 | } | |
92 | ||
93 | U_NAMESPACE_END |