/src/icu/source/common/ubidi_props.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | // © 2016 and later: Unicode, Inc. and others. |
2 | | // License & terms of use: http://www.unicode.org/copyright.html |
3 | | /* |
4 | | ******************************************************************************* |
5 | | * |
6 | | * Copyright (C) 2004-2014, International Business Machines |
7 | | * Corporation and others. All Rights Reserved. |
8 | | * |
9 | | ******************************************************************************* |
10 | | * file name: ubidi_props.c |
11 | | * encoding: UTF-8 |
12 | | * tab size: 8 (not used) |
13 | | * indentation:4 |
14 | | * |
15 | | * created on: 2004dec30 |
16 | | * created by: Markus W. Scherer |
17 | | * |
18 | | * Low-level Unicode bidi/shaping properties access. |
19 | | */ |
20 | | |
21 | | #include "unicode/utypes.h" |
22 | | #include "unicode/uset.h" |
23 | | #include "unicode/udata.h" /* UDataInfo */ |
24 | | #include "ucmndata.h" /* DataHeader */ |
25 | | #include "udatamem.h" |
26 | | #include "uassert.h" |
27 | | #include "cmemory.h" |
28 | | #include "utrie2.h" |
29 | | #include "ubidi_props.h" |
30 | | #include "ucln_cmn.h" |
31 | | |
32 | | struct UBiDiProps { |
33 | | UDataMemory *mem; |
34 | | const int32_t *indexes; |
35 | | const uint32_t *mirrors; |
36 | | const uint8_t *jgArray; |
37 | | const uint8_t *jgArray2; |
38 | | |
39 | | UTrie2 trie; |
40 | | uint8_t formatVersion[4]; |
41 | | }; |
42 | | |
43 | | /* ubidi_props_data.h is machine-generated by genbidi --csource */ |
44 | | #define INCLUDED_FROM_UBIDI_PROPS_C |
45 | | #include "ubidi_props_data.h" |
46 | | |
47 | | /* UBiDiProps singleton ----------------------------------------------------- */ |
48 | | |
49 | | U_CFUNC const UBiDiProps * |
50 | 0 | ubidi_getSingleton() { |
51 | 0 | return &ubidi_props_singleton; |
52 | 0 | } |
53 | | |
54 | | /* set of property starts for UnicodeSet ------------------------------------ */ |
55 | | |
56 | | static UBool U_CALLCONV |
57 | 0 | _enumPropertyStartsRange(const void *context, UChar32 start, UChar32 end, uint32_t value) { |
58 | 0 | (void)end; |
59 | 0 | (void)value; |
60 | | /* add the start code point to the USet */ |
61 | 0 | const USetAdder *sa=(const USetAdder *)context; |
62 | 0 | sa->add(sa->set, start); |
63 | 0 | return TRUE; |
64 | 0 | } |
65 | | |
66 | | U_CFUNC void |
67 | 0 | ubidi_addPropertyStarts(const UBiDiProps *bdp, const USetAdder *sa, UErrorCode *pErrorCode) { |
68 | 0 | int32_t i, length; |
69 | 0 | UChar32 c, start, limit; |
70 | |
|
71 | 0 | const uint8_t *jgArray; |
72 | 0 | uint8_t prev, jg; |
73 | |
|
74 | 0 | if(U_FAILURE(*pErrorCode)) { |
75 | 0 | return; |
76 | 0 | } |
77 | | |
78 | | /* add the start code point of each same-value range of the trie */ |
79 | 0 | utrie2_enum(&bdp->trie, NULL, _enumPropertyStartsRange, sa); |
80 | | |
81 | | /* add the code points from the bidi mirroring table */ |
82 | 0 | length=bdp->indexes[UBIDI_IX_MIRROR_LENGTH]; |
83 | 0 | for(i=0; i<length; ++i) { |
84 | 0 | c=UBIDI_GET_MIRROR_CODE_POINT(bdp->mirrors[i]); |
85 | 0 | sa->addRange(sa->set, c, c+1); |
86 | 0 | } |
87 | | |
88 | | /* add the code points from the Joining_Group array where the value changes */ |
89 | 0 | start=bdp->indexes[UBIDI_IX_JG_START]; |
90 | 0 | limit=bdp->indexes[UBIDI_IX_JG_LIMIT]; |
91 | 0 | jgArray=bdp->jgArray; |
92 | 0 | for(;;) { |
93 | 0 | prev=0; |
94 | 0 | while(start<limit) { |
95 | 0 | jg=*jgArray++; |
96 | 0 | if(jg!=prev) { |
97 | 0 | sa->add(sa->set, start); |
98 | 0 | prev=jg; |
99 | 0 | } |
100 | 0 | ++start; |
101 | 0 | } |
102 | 0 | if(prev!=0) { |
103 | | /* add the limit code point if the last value was not 0 (it is now start==limit) */ |
104 | 0 | sa->add(sa->set, limit); |
105 | 0 | } |
106 | 0 | if(limit==bdp->indexes[UBIDI_IX_JG_LIMIT]) { |
107 | | /* switch to the second Joining_Group range */ |
108 | 0 | start=bdp->indexes[UBIDI_IX_JG_START2]; |
109 | 0 | limit=bdp->indexes[UBIDI_IX_JG_LIMIT2]; |
110 | 0 | jgArray=bdp->jgArray2; |
111 | 0 | } else { |
112 | 0 | break; |
113 | 0 | } |
114 | 0 | } |
115 | | |
116 | | /* add code points with hardcoded properties, plus the ones following them */ |
117 | | |
118 | | /* (none right now) */ |
119 | 0 | } |
120 | | |
121 | | /* property access functions ------------------------------------------------ */ |
122 | | |
123 | | U_CFUNC int32_t |
124 | 0 | ubidi_getMaxValue(const UBiDiProps *bdp, UProperty which) { |
125 | 0 | int32_t max; |
126 | |
|
127 | 0 | if(bdp==NULL) { |
128 | 0 | return -1; |
129 | 0 | } |
130 | | |
131 | 0 | max=bdp->indexes[UBIDI_MAX_VALUES_INDEX]; |
132 | 0 | switch(which) { |
133 | 0 | case UCHAR_BIDI_CLASS: |
134 | 0 | return (max&UBIDI_CLASS_MASK); |
135 | 0 | case UCHAR_JOINING_GROUP: |
136 | 0 | return (max&UBIDI_MAX_JG_MASK)>>UBIDI_MAX_JG_SHIFT; |
137 | 0 | case UCHAR_JOINING_TYPE: |
138 | 0 | return (max&UBIDI_JT_MASK)>>UBIDI_JT_SHIFT; |
139 | 0 | case UCHAR_BIDI_PAIRED_BRACKET_TYPE: |
140 | 0 | return (max&UBIDI_BPT_MASK)>>UBIDI_BPT_SHIFT; |
141 | 0 | default: |
142 | 0 | return -1; /* undefined */ |
143 | 0 | } |
144 | 0 | } |
145 | | |
146 | | U_CAPI UCharDirection |
147 | 0 | ubidi_getClass(const UBiDiProps *bdp, UChar32 c) { |
148 | 0 | uint16_t props=UTRIE2_GET16(&bdp->trie, c); |
149 | 0 | return (UCharDirection)UBIDI_GET_CLASS(props); |
150 | 0 | } |
151 | | |
152 | | U_CFUNC UBool |
153 | 0 | ubidi_isMirrored(const UBiDiProps *bdp, UChar32 c) { |
154 | 0 | uint16_t props=UTRIE2_GET16(&bdp->trie, c); |
155 | 0 | return (UBool)UBIDI_GET_FLAG(props, UBIDI_IS_MIRRORED_SHIFT); |
156 | 0 | } |
157 | | |
158 | | static UChar32 |
159 | 0 | getMirror(const UBiDiProps *bdp, UChar32 c, uint16_t props) { |
160 | 0 | int32_t delta=UBIDI_GET_MIRROR_DELTA(props); |
161 | 0 | if(delta!=UBIDI_ESC_MIRROR_DELTA) { |
162 | 0 | return c+delta; |
163 | 0 | } else { |
164 | | /* look for mirror code point in the mirrors[] table */ |
165 | 0 | const uint32_t *mirrors; |
166 | 0 | uint32_t m; |
167 | 0 | int32_t i, length; |
168 | 0 | UChar32 c2; |
169 | |
|
170 | 0 | mirrors=bdp->mirrors; |
171 | 0 | length=bdp->indexes[UBIDI_IX_MIRROR_LENGTH]; |
172 | | |
173 | | /* linear search */ |
174 | 0 | for(i=0; i<length; ++i) { |
175 | 0 | m=mirrors[i]; |
176 | 0 | c2=UBIDI_GET_MIRROR_CODE_POINT(m); |
177 | 0 | if(c==c2) { |
178 | | /* found c, return its mirror code point using the index in m */ |
179 | 0 | return UBIDI_GET_MIRROR_CODE_POINT(mirrors[UBIDI_GET_MIRROR_INDEX(m)]); |
180 | 0 | } else if(c<c2) { |
181 | 0 | break; |
182 | 0 | } |
183 | 0 | } |
184 | | |
185 | | /* c not found, return it itself */ |
186 | 0 | return c; |
187 | 0 | } |
188 | 0 | } |
189 | | |
190 | | U_CFUNC UChar32 |
191 | 0 | ubidi_getMirror(const UBiDiProps *bdp, UChar32 c) { |
192 | 0 | uint16_t props=UTRIE2_GET16(&bdp->trie, c); |
193 | 0 | return getMirror(bdp, c, props); |
194 | 0 | } |
195 | | |
196 | | U_CFUNC UBool |
197 | 0 | ubidi_isBidiControl(const UBiDiProps *bdp, UChar32 c) { |
198 | 0 | uint16_t props=UTRIE2_GET16(&bdp->trie, c); |
199 | 0 | return (UBool)UBIDI_GET_FLAG(props, UBIDI_BIDI_CONTROL_SHIFT); |
200 | 0 | } |
201 | | |
202 | | U_CFUNC UBool |
203 | 0 | ubidi_isJoinControl(const UBiDiProps *bdp, UChar32 c) { |
204 | 0 | uint16_t props=UTRIE2_GET16(&bdp->trie, c); |
205 | 0 | return (UBool)UBIDI_GET_FLAG(props, UBIDI_JOIN_CONTROL_SHIFT); |
206 | 0 | } |
207 | | |
208 | | U_CFUNC UJoiningType |
209 | 0 | ubidi_getJoiningType(const UBiDiProps *bdp, UChar32 c) { |
210 | 0 | uint16_t props=UTRIE2_GET16(&bdp->trie, c); |
211 | 0 | return (UJoiningType)((props&UBIDI_JT_MASK)>>UBIDI_JT_SHIFT); |
212 | 0 | } |
213 | | |
214 | | U_CFUNC UJoiningGroup |
215 | 0 | ubidi_getJoiningGroup(const UBiDiProps *bdp, UChar32 c) { |
216 | 0 | UChar32 start, limit; |
217 | |
|
218 | 0 | start=bdp->indexes[UBIDI_IX_JG_START]; |
219 | 0 | limit=bdp->indexes[UBIDI_IX_JG_LIMIT]; |
220 | 0 | if(start<=c && c<limit) { |
221 | 0 | return (UJoiningGroup)bdp->jgArray[c-start]; |
222 | 0 | } |
223 | 0 | start=bdp->indexes[UBIDI_IX_JG_START2]; |
224 | 0 | limit=bdp->indexes[UBIDI_IX_JG_LIMIT2]; |
225 | 0 | if(start<=c && c<limit) { |
226 | 0 | return (UJoiningGroup)bdp->jgArray2[c-start]; |
227 | 0 | } |
228 | 0 | return U_JG_NO_JOINING_GROUP; |
229 | 0 | } |
230 | | |
231 | | U_CFUNC UBidiPairedBracketType |
232 | 0 | ubidi_getPairedBracketType(const UBiDiProps *bdp, UChar32 c) { |
233 | 0 | uint16_t props=UTRIE2_GET16(&bdp->trie, c); |
234 | 0 | return (UBidiPairedBracketType)((props&UBIDI_BPT_MASK)>>UBIDI_BPT_SHIFT); |
235 | 0 | } |
236 | | |
237 | | U_CFUNC UChar32 |
238 | 0 | ubidi_getPairedBracket(const UBiDiProps *bdp, UChar32 c) { |
239 | 0 | uint16_t props=UTRIE2_GET16(&bdp->trie, c); |
240 | 0 | if((props&UBIDI_BPT_MASK)==0) { |
241 | 0 | return c; |
242 | 0 | } else { |
243 | 0 | return getMirror(bdp, c, props); |
244 | 0 | } |
245 | 0 | } |
246 | | |
247 | | /* public API (see uchar.h) ------------------------------------------------- */ |
248 | | |
249 | | U_CFUNC UCharDirection |
250 | 0 | u_charDirection(UChar32 c) { |
251 | 0 | return ubidi_getClass(&ubidi_props_singleton, c); |
252 | 0 | } |
253 | | |
254 | | U_CFUNC UBool |
255 | 0 | u_isMirrored(UChar32 c) { |
256 | 0 | return ubidi_isMirrored(&ubidi_props_singleton, c); |
257 | 0 | } |
258 | | |
259 | | U_CFUNC UChar32 |
260 | 0 | u_charMirror(UChar32 c) { |
261 | 0 | return ubidi_getMirror(&ubidi_props_singleton, c); |
262 | 0 | } |
263 | | |
264 | | U_STABLE UChar32 U_EXPORT2 |
265 | 0 | u_getBidiPairedBracket(UChar32 c) { |
266 | 0 | return ubidi_getPairedBracket(&ubidi_props_singleton, c); |
267 | 0 | } |