/external/valgrind/drd/tests/ |
H A D | pth_detached_sem.c | 43 const int count1 = argc > 1 ? atoi(argv[1]) : 100; local 45 int thread_arg[count1 > count2 ? count1 : count2]; 50 for (i = 0; i < count1 || i < count2; i++) 60 // Create count1 detached threads by setting the "detached" property via 62 for (i = 0; i < count1; i++) 79 for (i = 0; i < count1 + count2; i++)
|
H A D | pth_detached.c | 39 const int count1 = argc > 1 ? atoi(argv[1]) : 100; local 53 // Create count1 detached threads by setting the "detached" property via 55 for (i = 0; i < count1; i++) 73 while (s_finished_count < count1 + count2) {
|
/external/linux-tools-perf/src/tools/perf/tests/ |
H A D | bp_signal.c | 115 long long count1, count2; local 139 * - fd1 event breakpoint hit -> count1 == 1 168 count1 = bp_count(fd1); 174 pr_debug("count1 %lld, count2 %lld, overflow %d\n", 175 count1, count2, overflows); 177 if (count1 != 1) { 178 if (count1 == 11) 181 pr_debug("failed: wrong count for bp1%lld\n", count1); 190 return count1 == 1 && overflows == 1 && count2 == 1 ?
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/compression/ |
H A D | DecompressionTest.java | 40 int count1 = 0, count2 = 0; 42 count1 = myDecompressor.decompress(segment1, 0, segment1.length, 47 "decompressed into " + count1 + " chars"); 51 logln(charBuffer, 0, count1); 52 s.append(charBuffer, 0, count1); 56 charBuffer, count1, 64 logln(charBuffer, count1, count2); 66 s.append(charBuffer, count1, count2); 69 logln(charBuffer, 0, count1 + count2);
|
/external/icu/icu4c/source/i18n/ |
H A D | collationweights.cpp | 419 // Calculate how to split the range between minLength (count1) and minLength+1 (count2). 421 // count1 + count2 * nextCountBytes = n 422 // count1 + count2 = count 425 // and then into the following count1 & count2 computations. 427 int32_t count1 = count - count2; // number of minLength weights local 428 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { 431 --count1; 432 U_ASSERT((count1 + count2 * nextCountBytes) >= n); 437 if(count1 == 0) { 447 splitRange, rangeCount, count1, count [all...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
H A D | CollationWeights.java | 485 // Calculate how to split the range between minLength (count1) and minLength+1 (count2). 487 // count1 + count2 * nextCountBytes = n 488 // count1 + count2 = count 491 // and then into the following count1 & count2 computations. 493 int count1 = count - count2; // number of minLength weights 494 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) { 497 --count1; 498 assert((count1 + count2 * nextCountBytes) >= n); 503 if(count1 == 0) { 512 // splitRange, rangeCount, count1, count [all...] |
/external/freetype/src/pshinter/ |
H A D | pshrec.c | 379 FT_UInt count1 = mask1->num_bits; local 384 count = FT_MIN( count1, count2 ); 428 FT_UInt count1 = mask1->num_bits; local 440 /* if "count2" is greater than "count1", we need to grow the */ 442 if ( count2 > count1 ) 448 for ( pos = count1; pos < count2; pos++ ) 1003 FT_UInt count1 = dim[0].hints.num_hints; local 1008 if ( bit_count != count1 + count2 ) 1012 bit_count, count1 + count2 )); 1019 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1, 1048 FT_UInt count1 = dim[0].hints.num_hints; local [all...] |
H A D | pshglob.c | 476 FT_UInt count1, count2; local 493 count1 = normal->count; 495 for ( ; count1 > 0; count1--, zone1++ )
|
/external/pdfium/third_party/freetype/src/pshinter/ |
H A D | pshrec.c | 382 FT_UInt count1 = mask1->num_bits; local 387 count = FT_MIN( count1, count2 ); 429 FT_UInt count1 = mask1->num_bits; local 441 /* if "count2" is greater than "count1", we need to grow the */ 443 if ( count2 > count1 ) 449 for ( pos = count1; pos < count2; pos++ ) 1007 FT_UInt count1 = dim[0].hints.num_hints; local 1012 if ( bit_count != count1 + count2 ) 1016 bit_count, count1 + count2 )); 1023 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1, 1052 FT_UInt count1 = dim[0].hints.num_hints; local [all...] |
H A D | pshglob.c | 476 FT_UInt count1, count2; local 493 count1 = normal->count; 495 for ( ; count1 > 0; count1--, zone1++ )
|
/external/google-breakpad/src/testing/test/ |
H A D | gmock_stress_test.cc | 211 int count1 = 0; local 212 const Helper1Param param = { &foo, &count1 }; 221 EXPECT_EQ(kRepeat, count1 + count2);
|
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_segmentation.c | 257 const int count1 = temporal_predictor_count[i][1]; local 259 t_nopred_prob[i] = get_binary_prob(count0, count1); 263 count1 * vp9_cost_one(t_nopred_prob[i]);
|
/external/freetype/src/cff/ |
H A D | cf2intrp.c | 1301 CF2_UInt count, count1 = cf2_stack_count( opStack ); local 1308 count = count1 & ~2; 1309 index += count1 - count; 1346 CF2_UInt count, count1 = cf2_stack_count( opStack ); local 1353 count = count1 & ~2; 1354 index += count1 - count; 1392 CF2_UInt count, count1 = cf2_stack_count( opStack ); local 1402 count = count1 & ~2; 1403 index += count1 - count;
|
/external/pdfium/core/src/fpdftext/ |
H A D | fpdf_text.cpp | 352 int count1 = order.GetAt(j - 1); local 354 for(int i = start + count1 - 1; i >= start; i--) { 364 int end = start + count1 ; 380 int count1 = order.GetAt(n - 1); local 381 int end = start + count1 ; 395 int count1 = order.GetAt(j + 1); local 419 int end = start + count1 ;
|
H A D | fpdf_text_int.cpp | 1224 int count1 = m_TempCharList.GetSize(); local 1225 if (count1 <= 0) { 1241 count1--; 1284 int count1 = order.GetAt(i - 1); local 1286 for(int j = start + count1 - 1; j >= start; j--) { 1296 int end = start + count1 ; 1312 int count1 = order.GetAt(n - 1); local 1313 int end = start + count1 ; 1327 int count1 = order.GetAt(i + 1); local 1351 int end = start + count1 ; [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A 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/icu/icu4c/source/test/intltest/ |
H A D | apicoll.cpp | 1000 int32_t count1, count2; local 1005 const Locale* list = Collator::getAvailableLocales(count1); 1006 for (int32_t i = 0; i < count1; ++i) { 1014 if (count1 == 0 || list == NULL) { 1034 if (count1 != count2) { 1035 errln("getAvailableLocales(int&) returned %d and getAvailableLocales() returned %d", count1, count2); 1039 count1 = 0; 1045 count1++; 1047 if (count1 != count2) { 1048 errln("getAvailableLocales(3rd time) returned %d and getAvailableLocales(2nd time) returned %d", count1, count [all...] |
H A D | msfmrgts.cpp | 766 int32_t count1 = 0; local 768 Formattable *newobjs = mf->parse(result, pp, count1);
|
H A D | loctest.cpp | 2106 int32_t count1=0,count2=0; local 2114 const Locale* oldList = Collator::getAvailableLocales(count1); 2132 for(int32_t i=0;i<count1;i++) { 2169 for(int32_t i=0;i<count1;i++) { 2178 int32_t expectCount2 = count1;
|
/external/skia/gm/ |
H A D | techtalk1.cpp | 95 int count1 = d1.getPoints(pts1, SK_ARRAY_COUNT(pts1)); local 96 SkASSERT(count == count1);
|
/external/icu/icu4c/source/common/ |
H A D | uhash.c | 856 int32_t count1, count2, pos, i; local 882 count1 = uhash_count(hash1); 884 if(count1!=count2){ 889 for(i=0; i<count1; i++){
|
/external/mesa3d/src/mesa/main/ |
H A D | atifragshader.c | 427 GLuint count1 = curProg->Instructions[j][i].ArgCount[1]; local 429 op1, op1_enum, count1);
|
/external/freetype/src/base/ |
H A D | ftstroke.c | 2008 FT_UInt count1, count2, num_points = 0; local 2020 &count1, &count2 ); 2029 num_points = count1 + count3;
|
/external/pdfium/third_party/freetype/src/base/ |
H A D | ftstroke.c | 2012 FT_UInt count1, count2, num_points = 0; local 2024 &count1, &count2 ); 2033 num_points = count1 + count3;
|
/external/harfbuzz_ng/src/ |
H A D | hb-ot-layout-gpos-table.hh | 735 unsigned int count1 = class1Count; local 737 for (unsigned int i = 0; i < count1; i++)
|