• Home
  • Raw
  • Download

Lines Matching refs:limit

45     limit=start+length;  in init()
48 if(start==limit) { in init()
63 int32_t length=(int32_t)(limit-start); in equals()
74 limit[0]=U16_LEAD(c); in appendSupplementary()
75 limit[1]=U16_TRAIL(c); in appendSupplementary()
76 limit+=2; in appendSupplementary()
79 reorderStart=limit; in appendSupplementary()
100 reorderStart=limit+length; in append()
102 reorderStart=limit+1; // Ok if not a code point boundary. in append()
105 do { *limit++=*s++; } while(s!=sLimit); in append()
133 *limit++=(UChar)c; in appendZeroCC()
135 limit[0]=U16_LEAD(c); in appendZeroCC()
136 limit[1]=U16_TRAIL(c); in appendZeroCC()
137 limit+=2; in appendZeroCC()
140 reorderStart=limit; in appendZeroCC()
152 u_memcpy(limit, s, length); in appendZeroCC()
153 limit+=length; in appendZeroCC()
156 reorderStart=limit; in appendZeroCC()
161 reorderStart=limit=start; in remove()
167 if(suffixLength<(limit-start)) { in removeSuffix()
168 limit-=suffixLength; in removeSuffix()
171 limit=start; in removeSuffix()
175 reorderStart=limit; in removeSuffix()
180 int32_t length=(int32_t)(limit-start); in resize()
197 limit=start+length; in resize()
233 UChar *q=limit; in insert()
234 UChar *r=limit+=U16_LENGTH(c); in insert()
404 Normalizer2Impl::decompose(const UChar *src, const UChar *limit, in decompose() argument
408 if(limit==NULL) { in decompose()
413 limit=u_strchr(src, 0); in decompose()
426 for(prevSrc=src; src!=limit;) { in decompose()
436 if((src+1)!=limit && U16_IS_TRAIL(c2=src[1])) { in decompose()
463 if(src==limit) { in decompose()
494 UBool Normalizer2Impl::decomposeShort(const UChar *src, const UChar *limit, in decomposeShort() argument
497 while(src<limit) { in decomposeShort()
500 UTRIE2_U16_NEXT16(normTrie, src, limit, c, norm16); in decomposeShort()
571 void Normalizer2Impl::decomposeAndAppend(const UChar *src, const UChar *limit, in decomposeAndAppend() argument
576 decompose(src, limit, &buffer, errorCode); in decomposeAndAppend()
580 ForwardUTrie2StringIterator iter(normTrie, src, limit); in decomposeAndAppend()
588 buffer.appendZeroCC(iter.codePointStart, limit, errorCode); in decomposeAndAppend()
736 UChar *limit=buffer.getLimit(); in recompose() local
737 if(p==limit) { in recompose()
756 UTRIE2_U16_NEXT16(normTrie, p, limit, c, norm16); in recompose()
777 if(p!=limit && (t=(UChar)(*p-Hangul::JAMO_T_BASE))<Hangul::JAMO_T_COUNT) { in recompose()
785 while(r<limit) { in recompose()
788 limit=q; in recompose()
798 if(p==limit) { in recompose()
847 while(r<limit) { in recompose()
850 limit=q; in recompose()
855 if(p==limit) { in recompose()
873 if(p==limit) { in recompose()
895 buffer.setReorderingLimit(limit); in recompose()
902 Normalizer2Impl::compose(const UChar *src, const UChar *limit, in compose() argument
921 if(limit==NULL) { in compose()
932 limit=u_strchr(src, 0); in compose()
944 for(prevSrc=src; src!=limit;) { in compose()
954 if((src+1)!=limit && U16_IS_TRAIL(c2=src[1])) { in compose()
979 if(src==limit) { in compose()
991 } else if(src==limit) { in compose()
1018 if(src!=limit && (t=(UChar)(*src-Hangul::JAMO_T_BASE))<Hangul::JAMO_T_COUNT) { in compose()
1136 src=(UChar *)findNextCompBoundary(src, limit); in compose()
1162 Normalizer2Impl::composeQuickCheck(const UChar *src, const UChar *limit, in composeQuickCheck() argument
1171 if(limit==NULL) { in composeQuickCheck()
1178 limit=u_strchr(src, 0); in composeQuickCheck()
1189 if(src==limit) { in composeQuickCheck()
1201 if((src+1)!=limit && U16_IS_TRAIL(c2=src[1])) { in composeQuickCheck()
1271 void Normalizer2Impl::composeAndAppend(const UChar *src, const UChar *limit, in composeAndAppend() argument
1277 const UChar *firstStarterInSrc=findNextCompBoundary(src, limit); in composeAndAppend()
1295 compose(src, limit, onlyContiguous, TRUE, buffer, errorCode); in composeAndAppend()
1297 buffer.appendZeroCC(src, limit, errorCode); in composeAndAppend()
1377 const UChar *Normalizer2Impl::findNextCompBoundary(const UChar *p, const UChar *limit) const { in findNextCompBoundary()
1378 ForwardUTrie2StringIterator iter(normTrie, p, limit); in findNextCompBoundary()
1508 Normalizer2Impl::makeFCD(const UChar *src, const UChar *limit, in makeFCD() argument
1515 if(limit==NULL) { in makeFCD()
1529 limit=u_strchr(src, 0); in makeFCD()
1546 for(prevSrc=src; src!=limit;) { in makeFCD()
1558 if((src+1)!=limit && U16_IS_TRAIL(c2=src[1])) { in makeFCD()
1580 if(src==limit) { in makeFCD()
1606 } else if(src==limit) { in makeFCD()
1636 src=findNextFCDBoundary(src, limit); in makeFCD()
1651 void Normalizer2Impl::makeFCDAndAppend(const UChar *src, const UChar *limit, in makeFCDAndAppend() argument
1656 const UChar *firstBoundaryInSrc=findNextFCDBoundary(src, limit); in makeFCDAndAppend()
1673 makeFCD(src, limit, &buffer, errorCode); in makeFCDAndAppend()
1675 buffer.appendZeroCC(src, limit, errorCode); in makeFCDAndAppend()
1688 const UChar *Normalizer2Impl::findNextFCDBoundary(const UChar *p, const UChar *limit) const { in findNextFCDBoundary()
1689 ForwardUTrie2StringIterator iter(fcdTrie(), p, limit); in findNextFCDBoundary()