Home
last modified time | relevance | path

Searched refs:limit2 (Results 1 - 23 of 23) sorted by relevance

/third_party/icu/icu4c/source/common/
H A Dunormcmp.cpp150 const UChar *start1, *start2, *limit1, *limit2; in unorm_cmpEquivFold() local
199 limit2=NULL; in unorm_cmpEquivFold()
201 limit2=s2+length2; in unorm_cmpEquivFold()
240 if(s2==limit2 || ((c2=*s2)==0 && (limit2==NULL || (options&_STRNCMP_STYLE)))) { in unorm_cmpEquivFold()
256 limit2=stack2[level2].limit; /*Not uninitialized*/ in unorm_cmpEquivFold()
299 if(s2!=limit2 && U16_IS_TRAIL(c=*s2)) { in unorm_cmpEquivFold()
384 stack2[0].limit=limit2; in unorm_cmpEquivFold()
398 limit2=fold2+length; in unorm_cmpEquivFold()
470 stack2[level2].limit=limit2; in unorm_cmpEquivFold()
[all...]
H A Dustrcase.cpp1485 const UChar *start1, *start2, *limit1, *limit2;
1535 limit2=NULL;
1537 limit2=s2+length2;
1576 if(s2==limit2 || ((c2=*s2)==0 && (limit2==NULL || (options&_STRNCMP_STYLE)))) {
1592 limit2=stack2[level2].limit; /*Not uninitialized*/
1635 } else if(s2==limit2) {
1679 if(s2!=limit2 && U16_IS_TRAIL(c=*s2)) {
1766 stack2[0].limit=limit2;
1780 limit2
[all...]
H A Dustring.cpp690 const UChar *start1, *start2, *limit1, *limit2; in uprv_strCompare() local
718 limit1=limit2=NULL; in uprv_strCompare()
746 limit2=start2+length1; /* use length1 here, too, to enforce assumption */ in uprv_strCompare()
791 limit2=start2+length2; in uprv_strCompare()
808 (c2<=0xdbff && (s2+1)!=limit2 && U16_IS_TRAIL(*(s2+1))) || in uprv_strCompare()
/third_party/node/deps/icu-small/source/common/
H A Dunormcmp.cpp150 const char16_t *start1, *start2, *limit1, *limit2; in unorm_cmpEquivFold() local
199 limit2=nullptr; in unorm_cmpEquivFold()
201 limit2=s2+length2; in unorm_cmpEquivFold()
240 if(s2==limit2 || ((c2=*s2)==0 && (limit2==nullptr || (options&_STRNCMP_STYLE)))) { in unorm_cmpEquivFold()
256 limit2=stack2[level2].limit; /*Not uninitialized*/ in unorm_cmpEquivFold()
299 if(s2!=limit2 && U16_IS_TRAIL(c=*s2)) { in unorm_cmpEquivFold()
384 stack2[0].limit=limit2; in unorm_cmpEquivFold()
398 limit2=fold2+length; in unorm_cmpEquivFold()
470 stack2[level2].limit=limit2; in unorm_cmpEquivFold()
[all...]
H A Dustrcase.cpp1490 const char16_t *start1, *start2, *limit1, *limit2;
1540 limit2=nullptr;
1542 limit2=s2+length2;
1581 if(s2==limit2 || ((c2=*s2)==0 && (limit2==nullptr || (options&_STRNCMP_STYLE)))) {
1597 limit2=stack2[level2].limit; /*Not uninitialized*/
1640 } else if(s2==limit2) {
1684 if(s2!=limit2 && U16_IS_TRAIL(c=*s2)) {
1771 stack2[0].limit=limit2;
1785 limit2
[all...]
H A Dustring.cpp690 const char16_t *start1, *start2, *limit1, *limit2; in uprv_strCompare() local
718 limit1=limit2=nullptr; in uprv_strCompare()
746 limit2=start2+length1; /* use length1 here, too, to enforce assumption */ in uprv_strCompare()
791 limit2=start2+length2; in uprv_strCompare()
808 (c2<=0xdbff && (s2+1)!=limit2 && U16_IS_TRAIL(*(s2+1))) || in uprv_strCompare()
/third_party/skia/third_party/externals/icu/source/common/
H A Dunormcmp.cpp150 const UChar *start1, *start2, *limit1, *limit2; in unorm_cmpEquivFold() local
199 limit2=NULL; in unorm_cmpEquivFold()
201 limit2=s2+length2; in unorm_cmpEquivFold()
240 if(s2==limit2 || ((c2=*s2)==0 && (limit2==NULL || (options&_STRNCMP_STYLE)))) { in unorm_cmpEquivFold()
256 limit2=stack2[level2].limit; /*Not uninitialized*/ in unorm_cmpEquivFold()
299 if(s2!=limit2 && U16_IS_TRAIL(c=*s2)) { in unorm_cmpEquivFold()
384 stack2[0].limit=limit2; in unorm_cmpEquivFold()
398 limit2=fold2+length; in unorm_cmpEquivFold()
470 stack2[level2].limit=limit2; in unorm_cmpEquivFold()
[all...]
H A Dustrcase.cpp1403 const UChar *start1, *start2, *limit1, *limit2; in _cmpFold() local
1453 limit2=NULL; in _cmpFold()
1455 limit2=s2+length2; in _cmpFold()
1494 if(s2==limit2 || ((c2=*s2)==0 && (limit2==NULL || (options&_STRNCMP_STYLE)))) { in _cmpFold()
1510 limit2=stack2[level2].limit; /*Not uninitialized*/ in _cmpFold()
1553 } else if(s2==limit2) { in _cmpFold()
1597 if(s2!=limit2 && U16_IS_TRAIL(c=*s2)) { in _cmpFold()
1684 stack2[0].limit=limit2; in _cmpFold()
1698 limit2 in _cmpFold()
[all...]
H A Dustring.cpp690 const UChar *start1, *start2, *limit1, *limit2; in uprv_strCompare() local
718 limit1=limit2=NULL; in uprv_strCompare()
746 limit2=start2+length1; /* use length1 here, too, to enforce assumption */ in uprv_strCompare()
791 limit2=start2+length2; in uprv_strCompare()
808 (c2<=0xdbff && (s2+1)!=limit2 && U16_IS_TRAIL(*(s2+1))) || in uprv_strCompare()
/third_party/lzma/CPP/7zip/Archive/Common/
H A DHandlerOut.h36 const UInt32 limit2 = (UInt32)7 << 28; in InitCommon() local
37 if (memAvail > limit2) in InitCommon()
38 memAvail = limit2; in InitCommon()
/third_party/icu/icu4c/source/i18n/
H A Dformattedval_iterimpl.cpp139 int32_t limit2 = fFields.elementAti(i*4 + 7); in sort() local
144 } else if (limit1 != limit2) { in sort()
146 comparison = limit1 - limit2; in sort()
160 fFields.setElementAt(limit2, i*4 + 3); in sort()
/third_party/node/deps/icu-small/source/i18n/
H A Dformattedval_iterimpl.cpp139 int32_t limit2 = fFields.elementAti(i*4 + 7); in sort() local
144 } else if (limit1 != limit2) { in sort()
146 comparison = limit1 - limit2; in sort()
160 fFields.setElementAt(limit2, i*4 + 3); in sort()
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dformattedval_iterimpl.cpp139 int32_t limit2 = fFields.elementAti(i*4 + 7); in sort() local
144 } else if (limit1 != limit2) { in sort()
146 comparison = limit1 - limit2; in sort()
160 fFields.setElementAt(limit2, i*4 + 3); in sort()
/third_party/node/deps/brotli/c/enc/
H A Dfind_match_length.h25 size_t limit2 = (limit >> 3) + 1; /* + 1 is for pre-decrement in while */ in FindMatchLengthWithLimit() local
26 while (BROTLI_PREDICT_TRUE(--limit2)) { in FindMatchLengthWithLimit()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dfind_match_length.h25 size_t limit2 = (limit >> 3) + 1; /* + 1 is for pre-decrement in while */ in FindMatchLengthWithLimit() local
26 while (BROTLI_PREDICT_TRUE(--limit2)) { in FindMatchLengthWithLimit()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DNormalizer.java2116 int s1, s2, limit1, limit2; in cmpEquivFold()
2163 limit2=cs2.length(); in cmpEquivFold()
2201 if(s2==limit2) { in cmpEquivFold()
2217 limit2=cs2.length(); in cmpEquivFold()
2260 if(s2!=limit2 && Character.isLowSurrogate(c=cs2.charAt(s2))) { in cmpEquivFold()
2365 limit2=fold2.length(); in cmpEquivFold()
2453 limit2=decomp2.length(); in cmpEquivFold()
2490 (c2<=0xdbff && s2!=limit2 && Character.isLowSurrogate(cs2.charAt(s2))) || in cmpEquivFold()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DNormalizer.java2176 int s1, s2, limit1, limit2; in cmpEquivFold()
2223 limit2=cs2.length(); in cmpEquivFold()
2261 if(s2==limit2) { in cmpEquivFold()
2277 limit2=cs2.length(); in cmpEquivFold()
2320 if(s2!=limit2 && Character.isLowSurrogate(c=cs2.charAt(s2))) { in cmpEquivFold()
2425 limit2=fold2.length(); in cmpEquivFold()
2513 limit2=decomp2.length(); in cmpEquivFold()
2550 (c2<=0xdbff && s2!=limit2 && Character.isLowSurrogate(cs2.charAt(s2))) || in cmpEquivFold()
/third_party/protobuf/src/google/protobuf/io/
H A Dcoded_stream_unittest.cc1054 CodedInputStream::Limit limit2 = coded_input.PushLimit(4); in TEST_1D() local
1058 // Read until we hit limit2, the top and shortest limit. in TEST_1D()
1065 coded_input.PopLimit(limit2); in TEST_1D()
1096 CodedInputStream::Limit limit2 = coded_input.PushLimit(8); in TEST_1D() local
1100 // Read until we hit limit2. Except, wait! limit1 is shorter, so in TEST_1D()
1102 // limit2. in TEST_1D()
1109 coded_input.PopLimit(limit2); in TEST_1D()
1111 // OK, popped limit2, now limit1 is on top, which we've already hit. in TEST_1D()
/third_party/ffmpeg/libavcodec/
H A Dhevcdsp_template.c233 int limit2 = FFMIN(col_limit + 4, H)
236 int limit2 = FFMIN(col_limit + 4, H)
251 TR_ ## H(src, src, H, H, SCALE, limit2); \
252 if (limit2 < H && i%4 == 0 && !!i) \
253 limit2 -= 4; \
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DNormalizer2Impl.java419 * @param limit2 limit offset in second sequence
421 * as s2.subSequence(start2, limit2)
424 CharSequence s2, int start2, int limit2) { in equal()
425 if((limit1-start1)!=(limit2-start2)) { in equal()
423 equal(CharSequence s1, int start1, int limit1, CharSequence s2, int start2, int limit2) equal() argument
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DNormalizer2Impl.java428 * @param limit2 limit offset in second sequence
430 * as s2.subSequence(start2, limit2)
433 CharSequence s2, int start2, int limit2) { in equal()
434 if((limit1-start1)!=(limit2-start2)) { in equal()
432 equal(CharSequence s1, int start1, int limit1, CharSequence s2, int start2, int limit2) equal() argument
/third_party/vk-gl-cts/modules/glshared/
H A DglsDrawTest.cpp1644 const deUint32 limit2 = (1 << 2); in generatePackedArray() local
1659 const deUint32 w = deRandom_getUint32(&rnd) % limit2; in generatePackedArray()
/third_party/skia/third_party/externals/sfntly/java/lib/
H A Dicu4j-4_8_1_1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/ibm/ com/ibm/icu/ com/ibm/icu/impl/ ...

Completed in 47 milliseconds