| /third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/compression/ |
| D | DecompressionTest.java | 46 int count1 = 0, count2 = 0; in decompressTest() local
60 count2 = myDecompressor.decompress(segment2, 0, segment2.length, in decompressTest()
66 "decompressed into " + count2 + " chars"); in decompressTest()
70 logln(charBuffer, count1, count2); in decompressTest()
72 s.append(charBuffer, count1, count2); in decompressTest()
75 logln(charBuffer, 0, count1 + count2); in decompressTest()
|
| /third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/compression/ |
| D | DecompressionTest.java | 43 int count1 = 0, count2 = 0; in decompressTest() local
57 count2 = myDecompressor.decompress(segment2, 0, segment2.length, in decompressTest()
63 "decompressed into " + count2 + " chars"); in decompressTest()
67 logln(charBuffer, count1, count2); in decompressTest()
69 s.append(charBuffer, count1, count2); in decompressTest()
72 logln(charBuffer, 0, count1 + count2); in decompressTest()
|
| /third_party/skia/third_party/externals/dng_sdk/source/ |
| D | dng_utils.cpp | 439 uint32 count2 = tile.W (); in HistogramArea() local
449 count2, in HistogramArea()
464 for (uint32 col = 0; col < count2; col++) in HistogramArea()
480 for (uint32 col = 0; col < count2; col++) in HistogramArea()
572 uint32 count2 = fDstImage.Planes (); in Process() local
596 count2, in Process()
630 memcpy (dPtr1, sPtr1, count2 * (uint32) sizeof (real32)); in Process()
642 for (uint32 index2 = 0; index2 < count2; index2++) in Process()
665 for (uint32 index2 = 0; index2 < count2; index2++) in Process()
687 for (uint32 index2 = 0; index2 < count2; index2++) in Process()
|
| D | dng_pixel_buffer.cpp | 46 uint32 &count2, in OptimizeOrder() argument
63 Abs_int32 (sStep2) * (count2 - 1); in OptimizeOrder()
67 Abs_int32 (dStep2) * (count2 - 1); in OptimizeOrder()
104 (((const uint8 *) sPtr) + (int32)(count2 - 1) * sStep2 * (int32)sPixelSize); in OptimizeOrder()
107 (((uint8 *) dPtr) + (int32)(count2 - 1) * dStep2 * (int32)dPixelSize); in OptimizeOrder()
155 (((const uint8 *) sPtr) + (int32)(count2 - 1) * sStep2 * (int32)sPixelSize); in OptimizeOrder()
158 (((uint8 *) dPtr) + (int32)(count2 - 1) * dStep2 * (int32)dPixelSize); in OptimizeOrder()
173 if (count2 == 1) step2 = 0xFFFFFFFF; in OptimizeOrder()
235 count [2] = count2; in OptimizeOrder()
239 count2 = count [index2]; in OptimizeOrder()
[all …]
|
| D | dng_fingerprint.h | 367 uint32 count2, in DoWrite() argument
376 Process (data, count2); in DoWrite()
378 fNextOffset += count2; in DoWrite()
|
| /third_party/skia/third_party/externals/freetype/src/pshinter/ |
| D | pshrec.c | 379 FT_UInt count2 = mask2->num_bits; in ps_mask_table_test_intersect() local
383 count = FT_MIN( count1, count2 ); in ps_mask_table_test_intersect()
428 FT_UInt count2 = mask2->num_bits; in ps_mask_table_merge() local
432 if ( count2 > 0 ) in ps_mask_table_merge()
441 if ( count2 > count1 ) in ps_mask_table_merge()
443 error = ps_mask_ensure( mask1, count2, memory ); in ps_mask_table_merge()
447 for ( pos = count1; pos < count2; pos++ ) in ps_mask_table_merge()
454 pos = ( count2 + 7 ) >> 3; in ps_mask_table_merge()
998 FT_UInt count2 = dim[1].hints.num_hints; in ps_hints_t2mask() local
1002 if ( bit_count != count1 + count2 ) in ps_hints_t2mask()
[all …]
|
| /third_party/skia/tests/ |
| D | GrFinishedFlushTest.cpp | 125 int count2 = 0; in DEF_GPUTEST_FOR_RENDERING_CONTEXTS() local
131 flushInfoFinishedProc.fFinishedContext = (void*)&count2; in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
134 REPORTER_ASSERT(reporter, count <= 1 && count2 <= count); in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
140 REPORTER_ASSERT(reporter, count == count2); in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
|
| /third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | CollationWeights.java | 514 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
515 int count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
516 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
518 ++count2; in allocWeightsInMinLengthRanges()
520 assert((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
546 ranges[1].count = count2; // *countBytes when lengthened in allocWeightsInMinLengthRanges()
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/ |
| D | CollationWeights.java | 516 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
517 int count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
518 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
520 ++count2; in allocWeightsInMinLengthRanges()
522 assert((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
548 ranges[1].count = count2; // *countBytes when lengthened in allocWeightsInMinLengthRanges()
|
| /third_party/ltp/testcases/kernel/security/integrity/ima/tests/ |
| D | ima_violations.sh | 74 local count2 i num_violations_new
78 count2="$(get_count $search)"
80 if [ $count2 -gt $count ]; then
|
| /third_party/skia/third_party/externals/icu/source/i18n/ |
| D | collationweights.cpp | 453 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
455 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
457 ++count2; in allocWeightsInMinLengthRanges()
459 U_ASSERT((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
474 splitRange, rangeCount, count1, count2); in allocWeightsInMinLengthRanges()
484 ranges[1].count = count2; // *countBytes when lengthened in allocWeightsInMinLengthRanges()
|
| /third_party/node/deps/icu-small/source/i18n/ |
| D | collationweights.cpp | 453 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
455 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
457 ++count2; in allocWeightsInMinLengthRanges()
459 U_ASSERT((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
474 splitRange, rangeCount, count1, count2); in allocWeightsInMinLengthRanges()
484 ranges[1].count = count2; // *countBytes when lengthened in allocWeightsInMinLengthRanges()
|
| /third_party/icu/icu4c/source/i18n/ |
| D | collationweights.cpp | 453 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened in allocWeightsInMinLengthRanges() local
454 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges()
455 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges()
457 ++count2; in allocWeightsInMinLengthRanges()
459 U_ASSERT((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges()
474 splitRange, rangeCount, count1, count2); in allocWeightsInMinLengthRanges()
484 ranges[1].count = count2; // *countBytes when lengthened in allocWeightsInMinLengthRanges()
|
| /third_party/skia/third_party/externals/freetype/src/sfnt/ |
| D | ttkern.c | 265 FT_UInt count2; in tt_face_get_kerning() local
268 for ( count2 = num_pairs; count2 > 0; count2-- ) in tt_face_get_kerning()
|
| /third_party/ffmpeg/libavcodec/mips/ |
| D | aaccoder_mips.c | 471 int curidx1, curidx2, sign1, count1, sign2, count2; in quantize_and_encode_band_cost_UPAIR7_mips() local
526 [sign2]"=&r"(sign2), [count2]"=&r"(count2), in quantize_and_encode_band_cost_UPAIR7_mips()
544 v_codes = (p_codes[curidx2] << count2) | sign2; in quantize_and_encode_band_cost_UPAIR7_mips()
545 v_bits = p_bits[curidx2] + count2; in quantize_and_encode_band_cost_UPAIR7_mips()
589 int curidx1, curidx2, sign1, count1, sign2, count2; in quantize_and_encode_band_cost_UPAIR12_mips() local
644 [sign2]"=&r"(sign2), [count2]"=&r"(count2), in quantize_and_encode_band_cost_UPAIR12_mips()
661 v_codes = (p_codes[curidx2] << count2) | sign2; in quantize_and_encode_band_cost_UPAIR12_mips()
662 v_bits = p_bits[curidx2] + count2; in quantize_and_encode_band_cost_UPAIR12_mips()
708 int curidx, curidx2, sign1, count1, sign2, count2; in quantize_and_encode_band_cost_ESC_mips() local
763 [sign2]"=&r"(sign2), [count2]"=&r"(count2), in quantize_and_encode_band_cost_ESC_mips()
[all …]
|
| /third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_destroy/ |
| D | 2-1.c | 200 int count2; /* number of children currently waiting (2nd pass) */ member
271 td->count2++; in child()
273 timed = td->count2 & 1; in child()
529 td->count2 = 0; in main()
670 ch = td->count2; in main()
684 ch = td->count2; in main()
|
| /third_party/ltp/testcases/kernel/mce-test/tsrc/ |
| D | tsoftinj.c | 161 unsigned count2 = hardware_corrupted(); in check() local
162 unsigned diff = count2 - *count; in check()
170 *count = count2; in check()
|
| /third_party/googletest/googlemock/test/ |
| D | gmock_stress_test.cc | 127 int count2 = 0; in TestConcurrentCallsOnSameObject() local
128 const Helper1Param param2 = {&foo, &count2}; in TestConcurrentCallsOnSameObject()
132 EXPECT_EQ(kRepeat, count1 + count2); in TestConcurrentCallsOnSameObject()
|
| /third_party/icu/icu4c/source/test/intltest/ |
| D | tchcfmt.cpp | 504 int32_t count2 = 0; in TestClosures()
505 const double *limits2 = fmt2.getLimits(count2); in TestClosures()
506 const UBool *closures2 = fmt2.getClosures(count2); in TestClosures()
508 if((count2 != 6) || !limits2 || !closures2) { in TestClosures()
511 for(i=0;i<count2;i++) { in TestClosures()
513 i, count2, in TestClosures()
|
| /third_party/littlefs/scripts/ |
| D | prefix.py | 23 name, count2 = re.subn('\\b'+from_prefix.upper(), to_prefix.upper(), name)
26 return name, count1+count2+count3
|
| /third_party/pcre2/pcre2/src/ |
| D | pcre2_substring.c | 375 int i, count, count2; in pcre2_substring_list_get() local
386 count2 = 2*count; in pcre2_substring_list_get()
391 for (i = 0; i < count2; i += 2) in pcre2_substring_list_get()
414 for (i = 0; i < count2; i += 2) in pcre2_substring_list_get()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | regcomp.c | 441 int count2; in p_ere_exp() local
582 count2 = p_count(p); in p_ere_exp()
583 REQUIRE(count <= count2, REG_BADBR); in p_ere_exp()
585 count2 = INFINITY; in p_ere_exp()
587 count2 = count; in p_ere_exp()
588 repeat(p, pos, count, count2); in p_ere_exp()
665 int count2; in p_simp_re() local
753 count2 = p_count(p); in p_simp_re()
754 REQUIRE(count <= count2, REG_BADBR); in p_simp_re()
756 count2 = INFINITY; in p_simp_re()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Support/ |
| D | regcomp.c | 313 int count2; in p_ere_exp() local
454 count2 = p_count(p); in p_ere_exp()
455 REQUIRE(count <= count2, REG_BADBR); in p_ere_exp()
457 count2 = INFINITY; in p_ere_exp()
459 count2 = count; in p_ere_exp()
460 repeat(p, pos, count, count2); in p_ere_exp()
537 int count2; in p_simp_re() local
625 count2 = p_count(p); in p_simp_re()
626 REQUIRE(count <= count2, REG_BADBR); in p_simp_re()
628 count2 = INFINITY; in p_simp_re()
[all …]
|
| /third_party/skia/third_party/externals/freetype/src/otvalid/ |
| D | otvcommn.c | 995 FT_UInt count1, count2; in otv_u_x_Ox_y_Oy_z_Oz_p_sp() local
1030 count2 = FT_NEXT_USHORT( p ); in otv_u_x_Ox_y_Oy_z_Oz_p_sp()
1032 OTV_TRACE(( " (Count = %d)\n", count2 )); in otv_u_x_Ox_y_Oy_z_Oz_p_sp()
1034 OTV_LIMIT_CHECK( count2 * 4 ); in otv_u_x_Ox_y_Oy_z_Oz_p_sp()
1036 for ( ; count2 > 0; count2-- ) in otv_u_x_Ox_y_Oy_z_Oz_p_sp()
|
| /third_party/protobuf/src/google/protobuf/util/ |
| D | message_differencer.cc | 927 const int count2 = reflection2->FieldSize(message2, repeated_field); in CompareRepeatedField() local
933 if (count1 != count2 && reporter_ == NULL && !treated_as_subset) { in CompareRepeatedField()
937 if (count1 > count2 && reporter_ == NULL) { in CompareRepeatedField()
973 if (simple_list && i >= count2) { in CompareRepeatedField()
1038 for (int i = 0; i < count2; ++i) { in CompareRepeatedField()
1055 if (simple_list && i < count2) continue; in CompareRepeatedField()
1480 MaximumMatcher(int count1, int count2, NodeMatchCallback callback,
1505 MaximumMatcher::MaximumMatcher(int count1, int count2, in MaximumMatcher() argument
1510 count2_(count2), in MaximumMatcher()
1515 match_list2_->assign(count2, -1); in MaximumMatcher()
[all …]
|