| /external/libchrome/base/third_party/icu/ |
| icu_utf.cc | 140 uint8_t trail, illegal = 0; local
143 /* count==0 for illegally leading trail bytes and the illegal bytes 0xfe and 0xff */
148 /* count>=4 is always illegal: no more than 3 trail bytes in Unicode's UTF-8 */
152 trail=s[(i)++];
153 (c)=((c)<<6)|(trail&0x3f);
155 illegal|=(trail&0xc0)^0x80;
162 trail=s[(i)++];
163 (c)=((c)<<6)|(trail&0x3f);
164 illegal|=(trail&0xc0)^0x80;
166 trail=s[(i)++]
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| IterCollationIterator.java | 63 int trail = iter.next(); local
64 if(!isTrailSurrogate(trail) && trail >= 0) { iter.previous(); }
65 return (char)trail;
|
| UTF16CollationIterator.java | 78 char trail; local
80 Character.isLowSurrogate(trail = seq.charAt(pos))) {
82 return Character.toCodePoint(c, trail);
116 char trail; local
117 if(Character.isLowSurrogate(trail = seq.charAt(pos))) { ++pos; }
118 return trail;
|
| FCDIterCollationIterator.java | 73 int trail = iter.next(); local
74 if(isTrailSurrogate(trail)) {
75 return Character.toCodePoint((char)c, (char)trail);
76 } else if(trail >= 0) {
121 // hasLccc(trail)=true for all trail surrogates
190 int trail = iter.next(); local
191 if(isTrailSurrogate(trail)) {
193 } else if(trail >= 0) {
196 return (char)trail;
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| IterCollationIterator.java | 61 int trail = iter.next(); local
62 if(!isTrailSurrogate(trail) && trail >= 0) { iter.previous(); }
63 return (char)trail;
|
| UTF16CollationIterator.java | 76 char trail; local
78 Character.isLowSurrogate(trail = seq.charAt(pos))) {
80 return Character.toCodePoint(c, trail);
114 char trail; local
115 if(Character.isLowSurrogate(trail = seq.charAt(pos))) { ++pos; }
116 return trail;
|
| FCDIterCollationIterator.java | 71 int trail = iter.next(); local
72 if(isTrailSurrogate(trail)) {
73 return Character.toCodePoint((char)c, (char)trail);
74 } else if(trail >= 0) {
119 // hasLccc(trail)=true for all trail surrogates
188 int trail = iter.next(); local
189 if(isTrailSurrogate(trail)) {
191 } else if(trail >= 0) {
194 return (char)trail;
[all...] |
| /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/ |
| utils.c | 16 uint32_t bytes_left=n,trail = 0; local
22 trail = ((uint32_t)ptr8_frm) & 0x3;
23 if((trail == (((uint32_t)ptr8_to) & 0x3)) && (n > 4))
26 bytes_left -= trail;
29 trail--;
32 trail = bytes_left & 0x3;
44 while(trail > 0){
46 trail--;
77 uint32_t trail=0; local
78 trail = 4 - (((uint32_t)ptr8) & 0x3)
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| CharacterIteration.java | 36 // If the current position is at a surrogate pair, move to the trail surrogate
49 // If we might have a lead surrogate, we need to peak ahead to get the trail
93 char trail = ci.previous(); local
94 int retVal = trail;
95 if (UTF16.isTrailSurrogate(trail) && ci.getIndex()>ci.getBeginIndex()) {
99 ((int)trail - UTF16.TRAIL_SURROGATE_MIN_VALUE) +
115 int trail = (int)ci.next(); local
117 if (UTF16.isTrailSurrogate((char)trail)) {
119 (trail - UTF16.TRAIL_SURROGATE_MIN_VALUE) +
|
| CharTrie.java | 140 * This method does not guarantee correct results for trail surrogates.
164 * @param trail a trail surrogate
166 public final char getSurrogateValue(char lead, char trail)
168 int offset = getSurrogateOffset(lead, trail);
177 * and a trail surrogate.</p>
181 * @param trail surrogate
182 * @return trie data value associated with the trail character
184 public final char getTrailValue(int leadvalue, char trail)
193 (char)(trail & SURROGATE_MASK_))]
[all...] |
| BMPSet.java | 39 * trail=c{5..0} it is set.contains(c)==(table7FF[trail] bit lead)
137 * sufficient length for trail unit for each surrogate pair. Handle single surrogates as surrogate code points
332 int trail = start & 0x3f; // Named for UTF-8 2-byte trail byte with lower 6 bits. local
337 table[trail] |= bits;
346 while (trail < limitTrail) {
347 table[trail++] |= bits;
353 if (trail > 0) {
355 table[trail++] |= bits
[all...] |
| IntTrie.java | 141 * This method does not guarantee correct results for trail surrogates.
165 * @param trail a trail surrogate
167 public final int getSurrogateValue(char lead, char trail)
169 if (!UTF16.isLeadSurrogate(lead) || !UTF16.isTrailSurrogate(trail)) {
173 // get fold position for the next trail surrogate
174 int offset = getSurrogateOffset(lead, trail);
176 // get the real data from the folded lead/trail units
187 * and a trail surrogate.
190 * @param trail surrogat
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| CharacterIteration.java | 32 // If the current position is at a surrogate pair, move to the trail surrogate
45 // If we might have a lead surrogate, we need to peak ahead to get the trail
89 char trail = ci.previous(); local
90 int retVal = trail;
91 if (UTF16.isTrailSurrogate(trail) && ci.getIndex()>ci.getBeginIndex()) {
95 ((int)trail - UTF16.TRAIL_SURROGATE_MIN_VALUE) +
111 int trail = (int)ci.next(); local
113 if (UTF16.isTrailSurrogate((char)trail)) {
115 (trail - UTF16.TRAIL_SURROGATE_MIN_VALUE) +
|
| CharTrie.java | 139 * This method does not guarantee correct results for trail surrogates.
163 * @param trail a trail surrogate
165 public final char getSurrogateValue(char lead, char trail)
167 int offset = getSurrogateOffset(lead, trail);
176 * and a trail surrogate.</p>
180 * @param trail surrogate
181 * @return trie data value associated with the trail character
183 public final char getTrailValue(int leadvalue, char trail)
192 (char)(trail & SURROGATE_MASK_))]
[all...] |
| BMPSet.java | 37 * trail=c{5..0} it is set.contains(c)==(table7FF[trail] bit lead)
135 * sufficient length for trail unit for each surrogate pair. Handle single surrogates as surrogate code points
330 int trail = start & 0x3f; // Named for UTF-8 2-byte trail byte with lower 6 bits. local
335 table[trail] |= bits;
344 while (trail < limitTrail) {
345 table[trail++] |= bits;
351 if (trail > 0) {
353 table[trail++] |= bits
[all...] |
| IntTrie.java | 140 * This method does not guarantee correct results for trail surrogates.
164 * @param trail a trail surrogate
166 public final int getSurrogateValue(char lead, char trail)
168 if (!UTF16.isLeadSurrogate(lead) || !UTF16.isTrailSurrogate(trail)) {
172 // get fold position for the next trail surrogate
173 int offset = getSurrogateOffset(lead, trail);
175 // get the real data from the folded lead/trail units
186 * and a trail surrogate.
189 * @param trail surrogat
[all...] |
| /bionic/libc/bionic/ |
| mbrtoc16.cpp | 43 char16_t trail = (c32 & 0x3ff) | 0xdc00; local
45 mbstate_set_byte(state, 0, trail & 0x00ff);
46 mbstate_set_byte(state, 1, (trail & 0xff00) >> 8);
55 char16_t trail = mbstate_get_byte(state, 1) << 8 | local
57 *pc16 = trail;
|
| /external/icu/icu4c/source/common/ |
| ucnv_u16.cpp | 60 UChar c, trail; local
95 if((c=(UChar)cnv->fromUChar32)!=0 && U16_IS_TRAIL(trail=*source) && targetCapacity>=4) {
101 target[2]=(uint8_t)(trail>>8);
102 target[3]=(uint8_t)trail;
133 } else if(U16_IS_SURROGATE_LEAD(c) && count>=2 && U16_IS_TRAIL(trail=*source)) {
138 target[2]=(uint8_t)(trail>>8);
139 target[3]=(uint8_t)trail;
155 } else if(U16_IS_SURROGATE_LEAD(c) && count>=2 && U16_IS_TRAIL(trail=*source)) {
160 target[2]=(uint8_t)(trail>>8);
161 target[3]=(uint8_t)trail;
264 UChar c, trail; local
528 UChar trail; local
661 UChar c, trail; local
865 UChar c, trail; local
1129 UChar trail; local
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| GestureTrailsDrawingPreview.java | 46 private final Rect mGestureTrailBoundsRect = new Rect(); // per trail
109 final GestureTrailDrawingPoints trail = mGestureTrails.valueAt(index); local
110 needsUpdatingGestureTrail |= trail.drawGestureTrail(offscreenCanvas, paint,
112 // {@link #mGestureTrailBoundsRect} has bounding box of the trail.
161 GestureTrailDrawingPoints trail; local
163 trail = mGestureTrails.get(tracker.mPointerId);
164 if (trail == null) {
165 trail = new GestureTrailDrawingPoints();
166 mGestureTrails.put(tracker.mPointerId, trail);
169 trail.addStroke(tracker.getGestureStrokeDrawingPoints(), tracker.getDownTime())
[all...] |
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-scripts/ |
| rgn-at4.t | 12 .trail : { LONG(5) } >ram
|
| /external/icu/icu4c/source/tools/gennorm2/ |
| norms.cpp | 55 UChar32 Norm::combine(UChar32 trail) const {
59 if(trail==pairs[i].trail) {
62 if(trail<pairs[i].trail) {
147 uint8_t trailCC=getCC(pairs[i].trail);
198 UChar32 trail=m.char32At(m.length()-1); local
208 norms.createNorm(trail)->combinesBack=TRUE;
209 // Insert (trail, composite) pair into compositions list for the lead character.
218 // Insertion sort, and check for duplicate trail characters
[all...] |
| /external/icu/icu4c/source/i18n/ |
| uitercollationiterator.cpp | 55 UChar32 trail = iter.next(&iter); local
56 if(!U16_IS_TRAIL(trail) && trail >= 0) { iter.previous(&iter); }
57 return (UChar)trail;
146 UChar32 trail = iter.next(&iter); local
147 if(U16_IS_TRAIL(trail)) {
149 } else if(trail >= 0) {
152 return (UChar)trail;
155 UChar trail;
156 if(U16_IS_TRAIL(trail = normalized[pos])) { ++pos;
[all...] |
| /bionic/libc/tzcode/ |
| strftime.c | 691 register int trail; local
694 trail = a % DIVISOR + b % DIVISOR;
695 lead = a / DIVISOR + b / DIVISOR + trail / DIVISOR;
696 trail %= DIVISOR;
697 if (trail < 0 && lead > 0) {
698 trail += DIVISOR;
700 } else if (lead < 0 && trail > 0) {
701 trail -= DIVISOR;
705 if (lead == 0 && trail < 0)
710 pt = _conv(((trail < 0) ? -trail : trail), getformat(modifier, "%02d", "%2d", "%d", "%02d"), pt, ptlim)
[all...] |
| /bionic/libc/upstream-openbsd/lib/libc/time/ |
| wcsftime.c | 528 int trail; local
531 trail = a % DIVISOR + b % DIVISOR;
532 lead = a / DIVISOR + b / DIVISOR + trail / DIVISOR;
533 trail %= DIVISOR;
534 if (trail < 0 && lead > 0) {
535 trail += DIVISOR;
537 } else if (lead < 0 && trail > 0) {
538 trail -= DIVISOR;
542 if (lead == 0 && trail < 0)
547 pt = _conv(((trail < 0) ? -trail : trail), L"%02d", pt, ptlim)
[all...] |
| /frameworks/base/core/java/android/text/format/ |
| TimeFormatter.java | 420 int trail; local
423 trail = value % DIVISOR;
424 lead = value / DIVISOR + trail / DIVISOR;
425 trail %= DIVISOR;
426 if (trail < 0 && lead > 0) {
427 trail += DIVISOR;
429 } else if (lead < 0 && trail > 0) {
430 trail -= DIVISOR;
434 if (lead == 0 && trail < 0) {
441 int n = ((trail < 0) ? -trail : trail)
[all...] |
