/third_party/icu/icu4c/source/common/ |
H A D | unormcmp.cpp | 150 const UChar *start1, *start2, *limit1, *limit2; in unorm_cmpEquivFold() local 192 limit1=NULL; in unorm_cmpEquivFold() 194 limit1=s1+length1; in unorm_cmpEquivFold() 217 if(s1==limit1 || ((c1=*s1)==0 && (limit1==NULL || (options&_STRNCMP_STYLE)))) { in unorm_cmpEquivFold() 233 limit1=stack1[level1].limit; /*Not uninitialized*/ in unorm_cmpEquivFold() 283 if(s1!=limit1 && U16_IS_TRAIL(c=*s1)) { in unorm_cmpEquivFold() 339 stack1[0].limit=limit1; in unorm_cmpEquivFold() 353 limit1=fold1+length; in unorm_cmpEquivFold() 429 stack1[level1].limit=limit1; in unorm_cmpEquivFold() [all...] |
H A D | ustring.cpp | 690 const UChar *start1, *start2, *limit1, *limit2; in uprv_strCompare() local 718 limit1=limit2=NULL; in uprv_strCompare() 725 limit1=start1+length1; in uprv_strCompare() 729 if(s1==limit1) { in uprv_strCompare() 758 /* limit1=start1+min(length1, length2) */ in uprv_strCompare() 761 limit1=start1+length1; in uprv_strCompare() 764 limit1=start1+length1; in uprv_strCompare() 767 limit1=start1+length2; in uprv_strCompare() 776 if(s1==limit1) { in uprv_strCompare() 790 limit1 in uprv_strCompare() [all...] |
H A D | ustrcase.cpp | 1485 const UChar *start1, *start2, *limit1, *limit2; 1528 limit1=NULL; 1530 limit1=s1+length1; 1553 if(s1==limit1 || ((c1=*s1)==0 && (limit1==NULL || (options&_STRNCMP_STYLE)))) { 1569 limit1=stack1[level1].limit; /*Not uninitialized*/ 1620 } else if(s1==limit1) { 1663 if(s1!=limit1 && U16_IS_TRAIL(c=*s1)) { 1720 stack1[0].limit=limit1; 1734 limit1 [all...] |
/third_party/node/deps/icu-small/source/common/ |
H A D | unormcmp.cpp | 150 const char16_t *start1, *start2, *limit1, *limit2; in unorm_cmpEquivFold() local 192 limit1=nullptr; in unorm_cmpEquivFold() 194 limit1=s1+length1; in unorm_cmpEquivFold() 217 if(s1==limit1 || ((c1=*s1)==0 && (limit1==nullptr || (options&_STRNCMP_STYLE)))) { in unorm_cmpEquivFold() 233 limit1=stack1[level1].limit; /*Not uninitialized*/ in unorm_cmpEquivFold() 283 if(s1!=limit1 && U16_IS_TRAIL(c=*s1)) { in unorm_cmpEquivFold() 339 stack1[0].limit=limit1; in unorm_cmpEquivFold() 353 limit1=fold1+length; in unorm_cmpEquivFold() 429 stack1[level1].limit=limit1; in unorm_cmpEquivFold() [all...] |
H A D | ustring.cpp | 690 const char16_t *start1, *start2, *limit1, *limit2; in uprv_strCompare() local 718 limit1=limit2=nullptr; in uprv_strCompare() 725 limit1=start1+length1; in uprv_strCompare() 729 if(s1==limit1) { in uprv_strCompare() 758 /* limit1=start1+min(length1, length2) */ in uprv_strCompare() 761 limit1=start1+length1; in uprv_strCompare() 764 limit1=start1+length1; in uprv_strCompare() 767 limit1=start1+length2; in uprv_strCompare() 776 if(s1==limit1) { in uprv_strCompare() 790 limit1 in uprv_strCompare() [all...] |
H A D | ustrcase.cpp | 1490 const char16_t *start1, *start2, *limit1, *limit2; 1533 limit1=nullptr; 1535 limit1=s1+length1; 1558 if(s1==limit1 || ((c1=*s1)==0 && (limit1==nullptr || (options&_STRNCMP_STYLE)))) { 1574 limit1=stack1[level1].limit; /*Not uninitialized*/ 1625 } else if(s1==limit1) { 1668 if(s1!=limit1 && U16_IS_TRAIL(c=*s1)) { 1725 stack1[0].limit=limit1; 1739 limit1 [all...] |
/third_party/skia/third_party/externals/icu/source/common/ |
H A D | unormcmp.cpp | 150 const UChar *start1, *start2, *limit1, *limit2; in unorm_cmpEquivFold() local 192 limit1=NULL; in unorm_cmpEquivFold() 194 limit1=s1+length1; in unorm_cmpEquivFold() 217 if(s1==limit1 || ((c1=*s1)==0 && (limit1==NULL || (options&_STRNCMP_STYLE)))) { in unorm_cmpEquivFold() 233 limit1=stack1[level1].limit; /*Not uninitialized*/ in unorm_cmpEquivFold() 283 if(s1!=limit1 && U16_IS_TRAIL(c=*s1)) { in unorm_cmpEquivFold() 339 stack1[0].limit=limit1; in unorm_cmpEquivFold() 353 limit1=fold1+length; in unorm_cmpEquivFold() 429 stack1[level1].limit=limit1; in unorm_cmpEquivFold() [all...] |
H A D | ustring.cpp | 690 const UChar *start1, *start2, *limit1, *limit2; in uprv_strCompare() local 718 limit1=limit2=NULL; in uprv_strCompare() 725 limit1=start1+length1; in uprv_strCompare() 729 if(s1==limit1) { in uprv_strCompare() 758 /* limit1=start1+min(lenght1, length2) */ in uprv_strCompare() 761 limit1=start1+length1; in uprv_strCompare() 764 limit1=start1+length1; in uprv_strCompare() 767 limit1=start1+length2; in uprv_strCompare() 776 if(s1==limit1) { in uprv_strCompare() 790 limit1 in uprv_strCompare() [all...] |
H A D | ustrcase.cpp | 1403 const UChar *start1, *start2, *limit1, *limit2; in _cmpFold() local 1446 limit1=NULL; in _cmpFold() 1448 limit1=s1+length1; in _cmpFold() 1471 if(s1==limit1 || ((c1=*s1)==0 && (limit1==NULL || (options&_STRNCMP_STYLE)))) { in _cmpFold() 1487 limit1=stack1[level1].limit; /*Not uninitialized*/ in _cmpFold() 1538 } else if(s1==limit1) { in _cmpFold() 1581 if(s1!=limit1 && U16_IS_TRAIL(c=*s1)) { in _cmpFold() 1638 stack1[0].limit=limit1; in _cmpFold() 1652 limit1 in _cmpFold() [all...] |
/third_party/skia/src/core/ |
H A D | SkLineClipper.cpp | 13 template <typename T> T pin_unsorted(T value, T limit0, T limit1) { in pin_unsorted() argument 14 if (limit1 < limit0) { in pin_unsorted() 16 swap(limit0, limit1); in pin_unsorted() 19 SkASSERT(limit0 <= limit1); in pin_unsorted() 23 } else if (value > limit1) { in pin_unsorted() 24 value = limit1; in pin_unsorted() 166 SkScalar limit0, SkScalar limit1) { in is_between_unsorted() 167 if (limit0 < limit1) { in is_between_unsorted() 168 return limit0 <= value && value <= limit1; in is_between_unsorted() 170 return limit1 < in is_between_unsorted() 165 is_between_unsorted(SkScalar value, SkScalar limit0, SkScalar limit1) is_between_unsorted() argument [all...] |
/third_party/icu/icu4c/source/i18n/ |
H A D | formattedval_iterimpl.cpp | 135 int32_t limit1 = fFields.elementAti(i*4 + 3); in sort() local 144 } else if (limit1 != limit2) { in sort() 146 comparison = limit1 - limit2; in sort() 164 fFields.setElementAt(limit1, i*4 + 7); in sort()
|
H A D | collationsettings.cpp | 161 int32_t limit1 = (int32_t)(pair >> 24); in setReordering() local 162 while(b < limit1) { in setReordering() 168 table[limit1] = 0; in setReordering() 169 b = limit1 + 1; in setReordering()
|
/third_party/node/deps/icu-small/source/i18n/ |
H A D | formattedval_iterimpl.cpp | 135 int32_t limit1 = fFields.elementAti(i*4 + 3); in sort() local 144 } else if (limit1 != limit2) { in sort() 146 comparison = limit1 - limit2; in sort() 164 fFields.setElementAt(limit1, i*4 + 7); in sort()
|
H A D | collationsettings.cpp | 161 int32_t limit1 = (int32_t)(pair >> 24); in setReordering() local 162 while(b < limit1) { in setReordering() 168 table[limit1] = 0; in setReordering() 169 b = limit1 + 1; in setReordering()
|
/third_party/skia/third_party/externals/icu/source/i18n/ |
H A D | formattedval_iterimpl.cpp | 135 int32_t limit1 = fFields.elementAti(i*4 + 3); in sort() local 144 } else if (limit1 != limit2) { in sort() 146 comparison = limit1 - limit2; in sort() 164 fFields.setElementAt(limit1, i*4 + 7); in sort()
|
H A D | collationsettings.cpp | 161 int32_t limit1 = (int32_t)(pair >> 24); in setReordering() local 162 while(b < limit1) { in setReordering() 168 table[limit1] = 0; in setReordering() 169 b = limit1 + 1; in setReordering()
|
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
H A D | CollationSettings.java | 206 int limit1 = pair >>> 24; in setReordering() 207 while(b < limit1) { in setReordering() 213 table[limit1] = 0; in setReordering() 214 b = limit1 + 1; in setReordering()
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/ |
H A D | CollationSettings.java | 208 int limit1 = pair >>> 24; in setReordering() 209 while(b < limit1) { in setReordering() 215 table[limit1] = 0; in setReordering() 216 b = limit1 + 1; in setReordering()
|
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | Normalizer.java | 2116 int s1, s2, limit1, limit2; in cmpEquivFold() 2161 limit1=cs1.length(); in cmpEquivFold() 2178 if(s1==limit1) { in cmpEquivFold() 2194 limit1=cs1.length(); in cmpEquivFold() 2244 if(s1!=limit1 && Character.isLowSurrogate(c=cs1.charAt(s1))) { in cmpEquivFold() 2317 limit1=fold1.length(); in cmpEquivFold() 2409 limit1=decomp1.length(); in cmpEquivFold() 2480 (c1<=0xdbff && s1!=limit1 && Character.isLowSurrogate(cs1.charAt(s1))) || in cmpEquivFold()
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
H A D | Normalizer.java | 2176 int s1, s2, limit1, limit2; in cmpEquivFold() 2221 limit1=cs1.length(); in cmpEquivFold() 2238 if(s1==limit1) { in cmpEquivFold() 2254 limit1=cs1.length(); in cmpEquivFold() 2304 if(s1!=limit1 && Character.isLowSurrogate(c=cs1.charAt(s1))) { in cmpEquivFold() 2377 limit1=fold1.length(); in cmpEquivFold() 2469 limit1=decomp1.length(); in cmpEquivFold() 2540 (c1<=0xdbff && s1!=limit1 && Character.isLowSurrogate(cs1.charAt(s1))) || in cmpEquivFold()
|
/third_party/protobuf/src/google/protobuf/io/ |
H A D | coded_stream_unittest.cc | 1052 CodedInputStream::Limit limit1 = coded_input.PushLimit(8); in TEST_1D() local 1067 // Read until we hit limit1. in TEST_1D() 1074 coded_input.PopLimit(limit1); in TEST_1D() 1094 CodedInputStream::Limit limit1 = coded_input.PushLimit(4); in TEST_1D() local 1100 // Read until we hit limit2. Except, wait! limit1 is shorter, so in TEST_1D() 1111 // OK, popped limit2, now limit1 is on top, which we've already hit. in TEST_1D() 1116 coded_input.PopLimit(limit1); in TEST_1D()
|
/third_party/ffmpeg/libavcodec/ |
H A D | huffyuvdec.c | 176 int limit1 = limit0 - len1; in generate_joint_tables() local 177 if (limit1 < 1 || !len1) in generate_joint_tables() 182 if (len2 > limit1 || !len2) in generate_joint_tables()
|
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | Normalizer2Impl.java | 416 * @param limit1 limit offset in first sequence 420 * @return true if s1.subSequence(start1, limit1) contains the same text 423 public static boolean equal(CharSequence s1, int start1, int limit1, in equal() argument 425 if((limit1-start1)!=(limit2-start2)) { in equal() 431 while(start1<limit1) { in equal()
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/ |
H A D | Normalizer2Impl.java | 425 * @param limit1 limit offset in first sequence 429 * @return true if s1.subSequence(start1, limit1) contains the same text 432 public static boolean equal(CharSequence s1, int start1, int limit1, in equal() argument 434 if((limit1-start1)!=(limit2-start2)) { in equal() 440 while(start1<limit1) { in equal()
|
/third_party/ffmpeg/libavcodec/loongarch/ |
H A D | vp9_lpf_lsx.c | 271 __m128i limit0, thresh1, b_limit1, limit1; in ff_loop_filter_v_44_16_lsx() local 289 limit1 = __lsx_vreplgr2vr_b(limit_ptr >> 8); in ff_loop_filter_v_44_16_lsx() 290 limit0 = __lsx_vilvl_d(limit1, limit0); in ff_loop_filter_v_44_16_lsx() 1406 __m128i thresh0, b_limit0, limit0, thresh1, b_limit1, limit1; in ff_loop_filter_h_44_16_lsx() local 1441 limit1 = __lsx_vreplgr2vr_b(limit_ptr >> 8); in ff_loop_filter_h_44_16_lsx() 1442 limit0 = __lsx_vilvl_d(limit1, limit0); in ff_loop_filter_h_44_16_lsx()
|