/external/lz4/lib/ |
D | lz4hc.c | 331 const BYTE* start2 = NULL; in LZ4HC_compress_hashChain() local 355 …HC_InsertAndGetWiderMatch(ctx, ip + ml - 2, ip + 0, matchlimit, ml, &ref2, &start2, maxNbAttempts); in LZ4HC_compress_hashChain() 364 if (start2 < ip + ml0) { /* empirical */ in LZ4HC_compress_hashChain() 372 if ((start2 - ip) < 3) { /* First Match too small : removed */ in LZ4HC_compress_hashChain() 374 ip = start2; in LZ4HC_compress_hashChain() 385 if ((start2 - ip) < OPTIMAL_ML) { in LZ4HC_compress_hashChain() 389 if (ip+new_ml > start2 + ml2 - MINMATCH) new_ml = (int)(start2 - ip) + ml2 - MINMATCH; in LZ4HC_compress_hashChain() 390 correction = new_ml - (int)(start2 - ip); in LZ4HC_compress_hashChain() 392 start2 += correction; in LZ4HC_compress_hashChain() 399 if (start2 + ml2 < mflimit) in LZ4HC_compress_hashChain() [all …]
|
/external/icu/icu4c/source/common/ |
D | unormcmp.cpp | 151 const UChar *start1, *start2, *limit1, *limit2; in unorm_cmpEquivFold() local 203 start2=s2; in unorm_cmpEquivFold() 259 start2=stack2[level2].start; /*Not uninitialized*/ in unorm_cmpEquivFold() 260 } while(start2==NULL); in unorm_cmpEquivFold() 310 if(start2<=(s2-2) && U16_IS_LEAD(c=*(s2-2))) { in unorm_cmpEquivFold() 388 stack2[0].start=start2; in unorm_cmpEquivFold() 403 start2=s2=fold2; in unorm_cmpEquivFold() 474 stack2[level2].start=start2; in unorm_cmpEquivFold() 485 start2=s2=p; in unorm_cmpEquivFold() 524 (U16_IS_TRAIL(c2) && start2!=(s2-1) && U16_IS_LEAD(*(s2-2))) in unorm_cmpEquivFold()
|
D | ustrcase.cpp | 1140 const UChar *start1, *start2, *limit1, *limit2; in _cmpFold() local 1189 start2=m2=org2=s2; in _cmpFold() 1245 start2=stack2[level2].start; /*Not uninitialized*/ in _cmpFold() 1246 } while(start2==NULL); in _cmpFold() 1340 if(start2<=(s2-2) && U16_IS_LEAD(c=*(s2-2))) { in _cmpFold() 1420 stack2[0].start=start2; in _cmpFold() 1435 start2=s2=fold2; in _cmpFold() 1474 (U16_IS_TRAIL(c2) && start2!=(s2-1) && U16_IS_LEAD(*(s2-2))) in _cmpFold()
|
D | ustring.cpp | 689 const UChar *start1, *start2, *limit1, *limit2; in uprv_strCompare() local 694 start2=s2; in uprv_strCompare() 745 limit2=start2+length1; /* use length1 here, too, to enforce assumption */ in uprv_strCompare() 790 limit2=start2+length2; in uprv_strCompare() 808 (U16_IS_TRAIL(c2) && start2!=s2 && U16_IS_LEAD(*(s2-1))) in uprv_strCompare()
|
D | ubidi.c | 2108 int32_t i, start1, start2; in resolveImplicitLevels() local 2159 start2=start; /* to make Java compiler happy */ in resolveImplicitLevels() 2217 start2=i; in resolveImplicitLevels() 2220 processPropertySeq(pBiDi, &levState, resProp, start1, start2); in resolveImplicitLevels() 2221 processPropertySeq(pBiDi, &levState, DirProp_ON, start2, i); in resolveImplicitLevels() 2225 processPropertySeq(pBiDi, &levState, resProp, start1, start2); in resolveImplicitLevels() 2226 start1=start2; in resolveImplicitLevels() 2227 start2=i; in resolveImplicitLevels()
|
/external/llvm/test/CodeGen/SystemZ/ |
D | frame-15.ll | 40 %start2 = getelementptr inbounds [978 x float], [978 x float]* %region2, i64 0, i64 0 41 call void @foo(float *%start1, float *%start2) 67 %start2 = getelementptr inbounds [978 x float], [978 x float]* %region2, i64 0, i64 0 68 call void @foo(float *%start1, float *%start2) 94 %start2 = getelementptr inbounds [978 x float], [978 x float]* %region2, i64 0, i64 0 95 call void @foo(float *%start1, float *%start2) 121 %start2 = getelementptr inbounds [2002 x float], [2002 x float]* %region2, i64 0, i64 0 122 call void @foo(float *%start1, float *%start2) 148 %start2 = getelementptr inbounds [2002 x float], [2002 x float]* %region2, i64 0, i64 0 149 call void @foo(float *%start1, float *%start2) [all …]
|
/external/v8/tools/ |
D | codemap.js | 157 var start2 = node.key, end2 = start2 + node.value.size; 158 if (start2 < end && start < end2) to_delete.push(start2); 159 addr = start2 - 1;
|
/external/libcxx/test/support/ |
D | filesystem_test_helper.hpp | 355 , Iter2 start2, Iter2 const end2 in checkCollectionsEqual() argument 358 while (start1 != end1 && start2 != end2) { in checkCollectionsEqual() 359 if (*start1 != *start2) { in checkCollectionsEqual() 362 ++start1; ++start2; in checkCollectionsEqual() 364 return (start1 == end1 && start2 == end2); in checkCollectionsEqual() 371 , Iter2 const start2, Iter2 end2 in checkCollectionsEqualBackwards() argument 374 while (start1 != end1 && start2 != end2) { in checkCollectionsEqualBackwards() 380 return (start1 == end1 && start2 == end2); in checkCollectionsEqualBackwards()
|
D | rapid-cxx-test.hpp | 827 , Iter2 start2, Iter2 const end2 in check_equal_collections_impl() argument 830 while (start1 != end1 && start2 != end2) { in check_equal_collections_impl() 831 if (*start1 != *start2) { in check_equal_collections_impl() 834 ++start1; ++start2; in check_equal_collections_impl() 836 return (start1 == end1 && start2 == end2); in check_equal_collections_impl()
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
D | TrieBuilder.java | 205 protected static final boolean equal_int(int[] array, int start1, int start2, int length) { in equal_int() argument 206 while(length>0 && array[start1]==array[start2]) { in equal_int() 208 ++start2; in equal_int()
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
D | TrieBuilder.java | 203 protected static final boolean equal_int(int[] array, int start1, int start2, int length) { in equal_int() argument 204 while(length>0 && array[start1]==array[start2]) { in equal_int() 206 ++start2; in equal_int()
|
D | Normalizer2Impl.java | 399 CharSequence s2, int start2, int limit2) { in equal() argument 400 if((limit1-start1)!=(limit2-start2)) { in equal() 403 if(s1==s2 && start1==start2) { in equal() 407 if(s1.charAt(start1++)!=s2.charAt(start2++)) { in equal()
|
/external/scrypt/lib/crypto/ |
D | crypto_scrypt-neon-salsa208.h | 59 uint32x4_t start2 = x8x13x2x7; in salsa20_8_intrinsic() local 65 uint32x4_t diag2 = start2; in salsa20_8_intrinsic() 103 x8x13x2x7 = diag2 + start2; in salsa20_8_intrinsic()
|
/external/skia/src/pathops/ |
D | SkOpSpan.h | 122 const SkOpPtT* start2 = s2->fT < e2->fT ? s2 : e2; in Overlaps() local 123 *sOut = between(s1->fT, start2->fT, e1->fT) ? start2 in Overlaps() 130 SkASSERT(start1->fT >= end2->fT || start2->fT >= end1->fT); in Overlaps()
|
/external/dtc/tests/ |
D | value-labels.dts | 5 prop2: prop2 = start2: < innerstart2: 0xdeadbeef innermid2: 0xabcd1234 innerend2: > end2:;
|
D | sourceoutput.dts | 12 prop2 = start2: [66 6f 6f], mid2: "bar" end2: ;
|
/external/compiler-rt/lib/sanitizer_common/ |
D | sanitizer_posix.cc | 275 uptr start2, uptr end2) { in IntervalsAreSeparate() argument 277 CHECK(start2 <= end2); in IntervalsAreSeparate() 278 return (end1 < start2) || (end2 < start1); in IntervalsAreSeparate()
|
/external/toybox/toys/pending/ |
D | diff.c | 516 start1, end1, start2, end2; in do_diff() local 606 start2 = MAX(1, ptr1->c - (ptr1->a - ptr1->suff)); in do_diff() 613 printf("+%ld", (end2 - start2 + 1) ? start2: (start2 -1)); in do_diff() 614 if ((end2 - start2 +1) != 1) printf(",%ld ", (end2 - start2 +1)); in do_diff()
|
/external/e2fsprogs/lib/ext2fs/ |
D | punch.c | 71 blk_t start2; in ind_punch() local 78 start2 = (start > offset) ? start - offset : 0; in ind_punch() 81 start2, count - offset, in ind_punch()
|
/external/ltp/testcases/kernel/mem/lib/ |
D | mem.c | 332 int start, int end, int start2, int end2) in verify() argument 337 s = malloc((end - start) * (end2 - start2)); in verify() 342 memset(s, value, (end - start) * (end2 - start2)); in verify() 343 if (memcmp(memory[start], s, (end - start) * (end2 - start2)) in verify() 346 for (i = start2; i < end2; i++) in verify()
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | Bidi.java | 3346 int i, start1, start2; in resolveImplicitLevels() local 3395 start2 = start; /* to make the Java compiler happy */ in resolveImplicitLevels() 3455 start2 = i; in resolveImplicitLevels() 3458 processPropertySeq(levState, resProp, start1, start2); in resolveImplicitLevels() 3459 processPropertySeq(levState, _ON, start2, i); in resolveImplicitLevels() 3463 processPropertySeq(levState, resProp, start1, start2); in resolveImplicitLevels() 3464 start1 = start2; in resolveImplicitLevels() 3465 start2 = i; in resolveImplicitLevels()
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
D | Bidi.java | 3381 int i, start1, start2; in resolveImplicitLevels() local 3430 start2 = start; /* to make the Java compiler happy */ in resolveImplicitLevels() 3490 start2 = i; in resolveImplicitLevels() 3493 processPropertySeq(levState, resProp, start1, start2); in resolveImplicitLevels() 3494 processPropertySeq(levState, _ON, start2, i); in resolveImplicitLevels() 3498 processPropertySeq(levState, resProp, start1, start2); in resolveImplicitLevels() 3499 start1 = start2; in resolveImplicitLevels() 3500 start2 = i; in resolveImplicitLevels()
|
/external/scrypt/patches/ |
D | arm-neon.patch | 65 + uint32x4_t start2 = x8x13x2x7; 71 + uint32x4_t diag2 = start2; 109 + x8x13x2x7 = diag2 + start2;
|
/external/valgrind/memcheck/ |
D | mc_leakcheck.c | 1837 Addr start2 = ch2->data; in MC_() local 1843 if (end1 < start2) { in MC_() 1850 } else if (start1 >= start2 && end1 <= end2 && isCustom1 && !isCustom2) { in MC_() 1858 } else if (start2 >= start1 && end2 <= end1 && isCustom2 && !isCustom1) { in MC_() 1868 start1, end1, start2, end2); in MC_()
|
/external/archive-patcher/applier/src/test/java/com/google/archivepatcher/applier/bsdiff/ |
D | BsPatchTest.java | 679 final int start2, in regionEquals() argument 682 if (data1[x + start1] != data2[x + start2]) { in regionEquals()
|