/third_party/skia/third_party/externals/icu/source/common/ |
D | unormcmp.cpp | 150 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() 480 limit2=p+length; in unorm_cmpEquivFold() [all …]
|
D | ustrcase.cpp | 1403 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=fold2+length; in _cmpFold() 1735 (c2<=0xdbff && s2!=limit2 && U16_IS_TRAIL(*s2)) || in _cmpFold()
|
D | ustring.cpp | 690 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/ |
D | unormcmp.cpp | 150 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() 480 limit2=p+length; in unorm_cmpEquivFold() [all …]
|
D | ustrcase.cpp | 1485 const char16_t *start1, *start2, *limit1, *limit2; in _cmpFold() local 1535 limit2=nullptr; in _cmpFold() 1537 limit2=s2+length2; in _cmpFold() 1576 if(s2==limit2 || ((c2=*s2)==0 && (limit2==nullptr || (options&_STRNCMP_STYLE)))) { in _cmpFold() 1592 limit2=stack2[level2].limit; /*Not uninitialized*/ in _cmpFold() 1635 } else if(s2==limit2) { in _cmpFold() 1679 if(s2!=limit2 && U16_IS_TRAIL(c=*s2)) { in _cmpFold() 1766 stack2[0].limit=limit2; in _cmpFold() 1780 limit2=fold2+length; in _cmpFold() 1817 (c2<=0xdbff && s2!=limit2 && U16_IS_TRAIL(*s2)) || in _cmpFold()
|
D | ustring.cpp | 690 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/icu/icu4c/source/common/ |
D | unormcmp.cpp | 150 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() 480 limit2=p+length; in unorm_cmpEquivFold() [all …]
|
D | ustrcase.cpp | 1485 const UChar *start1, *start2, *limit1, *limit2; in _cmpFold() local 1535 limit2=NULL; in _cmpFold() 1537 limit2=s2+length2; in _cmpFold() 1576 if(s2==limit2 || ((c2=*s2)==0 && (limit2==NULL || (options&_STRNCMP_STYLE)))) { in _cmpFold() 1592 limit2=stack2[level2].limit; /*Not uninitialized*/ in _cmpFold() 1635 } else if(s2==limit2) { in _cmpFold() 1679 if(s2!=limit2 && U16_IS_TRAIL(c=*s2)) { in _cmpFold() 1766 stack2[0].limit=limit2; in _cmpFold() 1780 limit2=fold2+length; in _cmpFold() 1817 (c2<=0xdbff && s2!=limit2 && U16_IS_TRAIL(*s2)) || in _cmpFold()
|
D | ustring.cpp | 690 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/icu/icu4c/source/i18n/ |
D | formattedval_iterimpl.cpp | 139 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/ |
D | formattedval_iterimpl.cpp | 139 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/ |
D | formattedval_iterimpl.cpp | 139 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/test/fixtures/workload/ |
D | grow-and-set-near-heap-limit.js | 6 if (process.env.limit2) { 7 v8.setHeapSnapshotNearHeapLimit(+process.env.limit2);
|
/third_party/lzma/CPP/7zip/Archive/Common/ |
D | HandlerOut.h | 36 const UInt32 limit2 = (UInt32)7 << 28; in InitCommon() local 37 if (memAvail > limit2) in InitCommon() 38 memAvail = limit2; in InitCommon()
|
/third_party/skia/third_party/externals/brotli/c/enc/ |
D | find_match_length.h | 25 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/node/deps/brotli/c/enc/ |
D | find_match_length.h | 25 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/ |
D | Normalizer.java | 2116 int s1, s2, limit1, limit2; in cmpEquivFold() local 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/ |
D | Normalizer.java | 2176 int s1, s2, limit1, limit2; in cmpEquivFold() local 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/node/test/pummel/ |
D | test-heapsnapshot-near-heap-limit-by-api.js | 101 limit2: 2, property
|
/third_party/protobuf/src/google/protobuf/io/ |
D | coded_stream_unittest.cc | 1054 CodedInputStream::Limit limit2 = coded_input.PushLimit(4); in TEST_1D() local 1065 coded_input.PopLimit(limit2); in TEST_1D() 1096 CodedInputStream::Limit limit2 = coded_input.PushLimit(8); in TEST_1D() local 1109 coded_input.PopLimit(limit2); in TEST_1D()
|
/third_party/ffmpeg/libavcodec/ |
D | hevcdsp_template.c | 233 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/ |
D | Normalizer2Impl.java | 424 CharSequence s2, int start2, int limit2) { in equal() argument 425 if((limit1-start1)!=(limit2-start2)) { in equal()
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/ |
D | Normalizer2Impl.java | 433 CharSequence s2, int start2, int limit2) { in equal() argument 434 if((limit1-start1)!=(limit2-start2)) { in equal()
|
/third_party/vk-gl-cts/modules/glshared/ |
D | glsDrawTest.cpp | 1613 const deUint32 limit2 = (1 << 2); in generatePackedArray() local 1628 const deUint32 w = deRandom_getUint32(&rnd) % limit2; in generatePackedArray()
|