Branch libreoffice-5-0-4
[LibreOffice.git] / vcl / generic / glyphs / scrptrun.cxx
blobd6557d79a89483d1d3a1fec67286b34850a3c857
1 /*
2 *******************************************************************************
4 * Copyright (c) 1995-2013 International Business Machines Corporation and others
6 * All rights reserved.
8 * Permission is hereby granted, free of charge, to any person obtaining a copy of
9 * this software and associated documentation files (the "Software"), to deal in
10 * the Software without restriction, including without limitation the rights to
11 * use, copy, modify, merge, publish, distribute, and/or sell copies of the
12 * Software, and to permit persons to whom the Software is furnished to do so,
13 * provided that the above copyright notice(s) and this permission notice appear
14 * in all copies of the Software and that both the above copyright notice(s) and
15 * this permission notice appear in supporting documentation.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. IN
20 * NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE
21 * LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY
22 * DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
23 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
24 * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
26 * Except as contained in this notice, the name of a copyright holder shall not be
27 * used in advertising or otherwise to promote the sale, use or other dealings in
28 * this Software without prior written authorization of the copyright holder.
30 *******************************************************************************
31 * file name: scrptrun.cpp
33 * created on: 10/17/2001
34 * created by: Eric R. Mader
36 /**
37 * This file is largely copied from the ICU project,
38 * under folder source/extra/scrptrun/scrptrun.cpp
40 #include "unicode/utypes.h"
41 #include "unicode/uscript.h"
43 #include "scrptrun.h"
44 #include <algorithm>
46 namespace {
48 struct PairIndices
50 int8_t ma00[0xff];
51 int8_t ma20[0x7f];
52 int8_t ma30[0x7f];
54 PairIndices()
56 std::fill_n(ma00, 0xff, -1);
57 std::fill_n(ma20, 0x7f, -1);
58 std::fill_n(ma30, 0x7f, -1);
60 // characters in the range 0x0000 - 0x007e (inclusive)
61 // ascii paired punctuation
62 ma00[0x28] = 0;
63 ma00[0x29] = 1;
64 ma00[0x3c] = 2;
65 ma00[0x3e] = 3;
66 ma00[0x5b] = 4;
67 ma00[0x5d] = 5;
68 ma00[0x7b] = 6;
69 ma00[0x7d] = 7;
70 // guillemets
71 ma00[0xab] = 8;
72 ma00[0xbb] = 9;
74 // characters in the range 0x2000 - 0x207e (inclusive)
75 // general punctuation
76 ma20[0x18] = 10;
77 ma20[0x19] = 11;
78 ma20[0x1c] = 12;
79 ma20[0x1d] = 13;
80 ma20[0x39] = 14;
81 ma20[0x3a] = 15;
83 // characters in the range 0x3000 - 0x307e (inclusive)
84 // chinese paired punctuation
85 ma30[0x08] = 16;
86 ma30[0x09] = 17;
87 ma30[0x0a] = 18;
88 ma30[0x0b] = 19;
89 ma30[0x0c] = 20;
90 ma30[0x0d] = 21;
91 ma30[0x0e] = 22;
92 ma30[0x0f] = 23;
93 ma30[0x10] = 24;
94 ma30[0x11] = 25;
95 ma30[0x14] = 26;
96 ma30[0x15] = 27;
97 ma30[0x16] = 28;
98 ma30[0x17] = 29;
99 ma30[0x18] = 30;
100 ma30[0x19] = 31;
101 ma30[0x1a] = 32;
102 ma30[0x1b] = 33;
105 inline int32_t getPairIndex(UChar32 ch) const
107 if (ch < 0xff)
108 return ma00[ch];
109 if (ch >= 0x2000 && ch < 0x207f)
110 return ma20[ch - 0x2000];
111 if (ch >= 0x3000 && ch < 0x307f)
112 return ma30[ch - 0x3000];
113 return -1;
120 static const PairIndices gPairIndices;
123 namespace vcl {
125 const char ScriptRun::fgClassID=0;
127 static inline UBool sameScript(int32_t scriptOne, int32_t scriptTwo)
129 return scriptOne <= USCRIPT_INHERITED || scriptTwo <= USCRIPT_INHERITED || scriptOne == scriptTwo;
132 UBool ScriptRun::next()
134 int32_t startSP = parenSP; // used to find the first new open character
135 UErrorCode error = U_ZERO_ERROR;
137 // if we've fallen off the end of the text, we're done
138 if (scriptEnd >= charLimit) {
139 return false;
142 scriptCode = USCRIPT_COMMON;
144 for (scriptStart = scriptEnd; scriptEnd < charLimit; scriptEnd += 1) {
145 UChar high = charArray[scriptEnd];
146 UChar32 ch = high;
148 // if the character is a high surrogate and it's not the last one
149 // in the text, see if it's followed by a low surrogate
150 if (high >= 0xD800 && high <= 0xDBFF && scriptEnd < charLimit - 1)
152 UChar low = charArray[scriptEnd + 1];
154 // if it is followed by a low surrogate,
155 // consume it and form the full character
156 if (low >= 0xDC00 && low <= 0xDFFF) {
157 ch = (high - 0xD800) * 0x0400 + low - 0xDC00 + 0x10000;
158 scriptEnd += 1;
162 UScriptCode sc = uscript_getScript(ch, &error);
163 int32_t pairIndex = gPairIndices.getPairIndex(ch);
165 // Paired character handling:
167 // if it's an open character, push it onto the stack.
168 // if it's a close character, find the matching open on the
169 // stack, and use that script code. Any non-matching open
170 // characters above it on the stack will be poped.
171 if (pairIndex >= 0) {
172 if ((pairIndex & 1) == 0) {
173 ++parenSP;
174 int32_t nVecSize = parenStack.size();
175 if (parenSP == nVecSize)
176 parenStack.resize(nVecSize + 128);
177 parenStack[parenSP].pairIndex = pairIndex;
178 parenStack[parenSP].scriptCode = scriptCode;
179 } else if (parenSP >= 0) {
180 int32_t pi = pairIndex & ~1;
182 while (parenSP >= 0 && parenStack[parenSP].pairIndex != pi) {
183 parenSP -= 1;
186 if (parenSP < startSP) {
187 startSP = parenSP;
190 if (parenSP >= 0) {
191 sc = parenStack[parenSP].scriptCode;
196 if (sameScript(scriptCode, sc)) {
197 if (scriptCode <= USCRIPT_INHERITED && sc > USCRIPT_INHERITED) {
198 scriptCode = sc;
200 // now that we have a final script code, fix any open
201 // characters we pushed before we knew the script code.
202 while (startSP < parenSP) {
203 parenStack[++startSP].scriptCode = scriptCode;
207 // if this character is a close paired character,
208 // pop it from the stack
209 if (pairIndex >= 0 && (pairIndex & 1) != 0 && parenSP >= 0) {
210 parenSP -= 1;
211 /* decrement startSP only if it is >= 0,
212 decrementing it unnecessarily will lead to memory corruption
213 while processing the above while block.
214 e.g. startSP = -4 , parenSP = -1
216 if (startSP >= 0) {
217 startSP -= 1;
220 } else {
221 // if the run broke on a surrogate pair,
222 // end it before the high surrogate
223 if (ch >= 0x10000) {
224 scriptEnd -= 1;
227 break;
231 return true;