/external/valgrind/drd/tests/ |
D | pth_detached_sem.c | 43 const int count1 = argc > 1 ? atoi(argv[1]) : 100; in main() local 45 int thread_arg[count1 > count2 ? count1 : count2]; in main() 50 for (i = 0; i < count1 || i < count2; i++) in main() 62 for (i = 0; i < count1; i++) in main() 79 for (i = 0; i < count1 + count2; i++) in main()
|
D | pth_detached.c | 39 const int count1 = argc > 1 ? atoi(argv[1]) : 100; in main() local 55 for (i = 0; i < count1; i++) in main() 73 while (s_finished_count < count1 + count2) { in main()
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/compression/ |
D | DecompressionTest.java | 40 int count1 = 0, count2 = 0; in decompressTest() local 42 count1 = myDecompressor.decompress(segment1, 0, segment1.length, in decompressTest() 47 "decompressed into " + count1 + " chars"); in decompressTest() 51 logln(charBuffer, 0, count1); in decompressTest() 52 s.append(charBuffer, 0, count1); in decompressTest() 56 charBuffer, count1, in decompressTest() 64 logln(charBuffer, count1, count2); in decompressTest() 66 s.append(charBuffer, count1, count2); in decompressTest() 69 logln(charBuffer, 0, count1 + count2); in decompressTest()
|
/external/linux-tools-perf/src/tools/perf/tests/ |
D | bp_signal.c | 115 long long count1, count2; in test__bp_signal() local 168 count1 = bp_count(fd1); in test__bp_signal() 175 count1, count2, overflows); in test__bp_signal() 177 if (count1 != 1) { in test__bp_signal() 178 if (count1 == 11) in test__bp_signal() 181 pr_debug("failed: wrong count for bp1%lld\n", count1); in test__bp_signal() 190 return count1 == 1 && overflows == 1 && count2 == 1 ? in test__bp_signal()
|
/external/pdfium/third_party/freetype/src/pshinter/ |
D | pshrec.c | 382 FT_UInt count1 = mask1->num_bits; in ps_mask_table_test_intersect() local 387 count = FT_MIN( count1, count2 ); in ps_mask_table_test_intersect() 429 FT_UInt count1 = mask1->num_bits; in ps_mask_table_merge() local 443 if ( count2 > count1 ) in ps_mask_table_merge() 449 for ( pos = count1; pos < count2; pos++ ) in ps_mask_table_merge() 1007 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2mask() local 1012 if ( bit_count != count1 + count2 ) in ps_hints_t2mask() 1016 bit_count, count1 + count2 )); in ps_hints_t2mask() 1023 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1, in ps_hints_t2mask() 1052 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2counter() local [all …]
|
D | pshglob.c | 476 FT_UInt count1, count2; in psh_blues_scale_zones() local 493 count1 = normal->count; in psh_blues_scale_zones() 495 for ( ; count1 > 0; count1--, zone1++ ) in psh_blues_scale_zones()
|
/external/freetype/src/pshinter/ |
D | pshrec.c | 379 FT_UInt count1 = mask1->num_bits; in ps_mask_table_test_intersect() local 384 count = FT_MIN( count1, count2 ); in ps_mask_table_test_intersect() 428 FT_UInt count1 = mask1->num_bits; in ps_mask_table_merge() local 442 if ( count2 > count1 ) in ps_mask_table_merge() 448 for ( pos = count1; pos < count2; pos++ ) in ps_mask_table_merge() 1003 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2mask() local 1008 if ( bit_count != count1 + count2 ) in ps_hints_t2mask() 1012 bit_count, count1 + count2 )); in ps_hints_t2mask() 1019 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1, in ps_hints_t2mask() 1048 FT_UInt count1 = dim[0].hints.num_hints; in ps_hints_t2counter() local [all …]
|
D | pshglob.c | 476 FT_UInt count1, count2; in psh_blues_scale_zones() local 493 count1 = normal->count; in psh_blues_scale_zones() 495 for ( ; count1 > 0; count1--, zone1++ ) in psh_blues_scale_zones()
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
D | CollationWeights.java | 493 int count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges() local 494 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges() 497 --count1; in allocWeightsInMinLengthRanges() 498 assert((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges() 503 if(count1 == 0) { in allocWeightsInMinLengthRanges() 515 ranges[0].end = incWeightByOffset(start, minLength, count1 - 1); in allocWeightsInMinLengthRanges() 516 ranges[0].count = count1; in allocWeightsInMinLengthRanges()
|
/external/icu/icu4c/source/i18n/ |
D | collationweights.cpp | 427 int32_t count1 = count - count2; // number of minLength weights in allocWeightsInMinLengthRanges() local 428 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { in allocWeightsInMinLengthRanges() 431 --count1; in allocWeightsInMinLengthRanges() 432 U_ASSERT((count1 + count2 * nextCountBytes) >= n); in allocWeightsInMinLengthRanges() 437 if(count1 == 0) { in allocWeightsInMinLengthRanges() 447 splitRange, rangeCount, count1, count2); in allocWeightsInMinLengthRanges() 451 ranges[0].end = incWeightByOffset(start, minLength, count1 - 1); in allocWeightsInMinLengthRanges() 452 ranges[0].count = count1; in allocWeightsInMinLengthRanges()
|
/external/llvm/test/CodeGen/SystemZ/ |
D | frame-11.ll | 10 define void @f1(i32 %count1, i32 %count2) { 19 %array1 = alloca i8, i32 %count1
|
/external/freetype/src/cff/ |
D | cf2intrp.c | 1301 CF2_UInt count, count1 = cf2_stack_count( opStack ); in cf2_interpT2CharString() local 1308 count = count1 & ~2; in cf2_interpT2CharString() 1309 index += count1 - count; in cf2_interpT2CharString() 1346 CF2_UInt count, count1 = cf2_stack_count( opStack ); in cf2_interpT2CharString() local 1353 count = count1 & ~2; in cf2_interpT2CharString() 1354 index += count1 - count; in cf2_interpT2CharString() 1392 CF2_UInt count, count1 = cf2_stack_count( opStack ); in cf2_interpT2CharString() local 1402 count = count1 & ~2; in cf2_interpT2CharString() 1403 index += count1 - count; in cf2_interpT2CharString()
|
/external/google-breakpad/src/testing/test/ |
D | gmock_stress_test.cc | 211 int count1 = 0; in TestConcurrentCallsOnSameObject() local 212 const Helper1Param param = { &foo, &count1 }; in TestConcurrentCallsOnSameObject() 221 EXPECT_EQ(kRepeat, count1 + count2); in TestConcurrentCallsOnSameObject()
|
/external/libvpx/libvpx/vp9/encoder/ |
D | vp9_segmentation.c | 257 const int count1 = temporal_predictor_count[i][1]; in vp9_choose_segmap_coding_method() local 259 t_nopred_prob[i] = get_binary_prob(count0, count1); in vp9_choose_segmap_coding_method() 263 count1 * vp9_cost_one(t_nopred_prob[i]); in vp9_choose_segmap_coding_method()
|
/external/guava/guava/src/com/google/common/collect/ |
D | Multisets.java | 463 int count1 = multiset1.count(element); 464 return (count1 == 0) ? 0 : Math.min(count1, multiset2.count(element)); 607 int count1 = multiset1.count(element); 608 return (count1 == 0) ? 0 : 609 Math.max(0, count1 - multiset2.count(element));
|
/external/pdfium/core/src/fpdftext/ |
D | fpdf_text.cpp | 352 int count1 = order.GetAt(j - 1); in NormalizeString() local 354 for(int i = start + count1 - 1; i >= start; i--) { in NormalizeString() 364 int end = start + count1 ; in NormalizeString() 380 int count1 = order.GetAt(n - 1); in NormalizeString() local 381 int end = start + count1 ; in NormalizeString() 395 int count1 = order.GetAt(j + 1); in NormalizeString() local 419 int end = start + count1 ; in NormalizeString()
|
D | fpdf_text_int.cpp | 1224 int count1 = m_TempCharList.GetSize(); in CloseTempLine() local 1225 if (count1 <= 0) { in CloseTempLine() 1241 count1--; in CloseTempLine() 1284 int count1 = order.GetAt(i - 1); in CloseTempLine() local 1286 for(int j = start + count1 - 1; j >= start; j--) { in CloseTempLine() 1296 int end = start + count1 ; in CloseTempLine() 1312 int count1 = order.GetAt(n - 1); in CloseTempLine() local 1313 int end = start + count1 ; in CloseTempLine() 1327 int count1 = order.GetAt(i + 1); in CloseTempLine() local 1351 int end = start + count1 ; in CloseTempLine()
|
/external/icu/icu4c/source/test/intltest/ |
D | apicoll.cpp | 1000 int32_t count1, count2; in TestGetAll() local 1005 const Locale* list = Collator::getAvailableLocales(count1); in TestGetAll() 1006 for (int32_t i = 0; i < count1; ++i) { in TestGetAll() 1014 if (count1 == 0 || list == NULL) { in TestGetAll() 1034 if (count1 != count2) { in TestGetAll() 1035 …errln("getAvailableLocales(int&) returned %d and getAvailableLocales() returned %d", count1, count… in TestGetAll() 1039 count1 = 0; in TestGetAll() 1045 count1++; in TestGetAll() 1047 if (count1 != count2) { in TestGetAll() 1048 …lableLocales(3rd time) returned %d and getAvailableLocales(2nd time) returned %d", count1, count2); in TestGetAll() [all …]
|
D | loctest.cpp | 2106 int32_t count1=0,count2=0; in checkRegisteredCollators() local 2114 const Locale* oldList = Collator::getAvailableLocales(count1); in checkRegisteredCollators() 2132 for(int32_t i=0;i<count1;i++) { in checkRegisteredCollators() 2169 for(int32_t i=0;i<count1;i++) { in checkRegisteredCollators() 2178 int32_t expectCount2 = count1; in checkRegisteredCollators()
|
D | msfmrgts.cpp | 766 int32_t count1 = 0; in Test4118594() local 768 Formattable *newobjs = mf->parse(result, pp, count1); in Test4118594()
|
/external/icu/icu4c/source/common/ |
D | uhash.c | 856 int32_t count1, count2, pos, i; in uhash_equals() local 882 count1 = uhash_count(hash1); in uhash_equals() 884 if(count1!=count2){ in uhash_equals() 889 for(i=0; i<count1; i++){ in uhash_equals()
|
/external/skia/gm/ |
D | techtalk1.cpp | 95 int count1 = d1.getPoints(pts1, SK_ARRAY_COUNT(pts1)); in show_mesh_between() local 96 SkASSERT(count == count1); in show_mesh_between()
|
/external/mesa3d/src/mesa/main/ |
D | atifragshader.c | 427 GLuint count1 = curProg->Instructions[j][i].ArgCount[1]; in _mesa_EndFragmentShaderATI() local 429 op1, op1_enum, count1); in _mesa_EndFragmentShaderATI()
|
/external/freetype/src/base/ |
D | ftstroke.c | 2008 FT_UInt count1, count2, num_points = 0; in FT_Stroker_GetCounts() local 2020 &count1, &count2 ); in FT_Stroker_GetCounts() 2029 num_points = count1 + count3; in FT_Stroker_GetCounts()
|
/external/pdfium/third_party/freetype/src/base/ |
D | ftstroke.c | 2012 FT_UInt count1, count2, num_points = 0; in FT_Stroker_GetCounts() local 2024 &count1, &count2 ); in FT_Stroker_GetCounts() 2033 num_points = count1 + count3; in FT_Stroker_GetCounts()
|