/external/valgrind/main/drd/tests/ |
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++)
|
pth_detached.c | 48 const int count1 = argc > 1 ? atoi(argv[1]) : 100; local 50 int thread_arg[count1 > count2 ? count1 : count2]; 55 for (i = 0; i < count1 || i < count2; i++) 65 // Create count1 detached threads by setting the "detached" property via 67 for (i = 0; i < count1; i++) 84 while (get_finished_count() < count1 + count2)
|
/external/stlport/test/unit/ |
count_test.cpp | 16 CPPUNIT_TEST(count1); 22 void count1(); 44 void CountTest::count1() function in class:CountTest
|
/ndk/tests/device/test-gnustl-full/unit/ |
count_test.cpp | 16 CPPUNIT_TEST(count1); 22 void count1(); 44 void CountTest::count1() function in class:CountTest
|
/ndk/tests/device/test-stlport/unit/ |
count_test.cpp | 16 CPPUNIT_TEST(count1); 22 void count1(); 44 void CountTest::count1() function in class:CountTest
|
/packages/apps/Contacts/src/com/android/contacts/format/ |
FormatUtils.java | 64 int count1 = array1.length; local 68 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) { 69 count1--; 74 for (int i = 0; i < count1; i++) { 75 if (i + size > count1) { 76 size = count1 - i;
|
/libcore/luni/src/main/java/java/util/ |
ComparableTimSort.java | 641 int count1 = 0; // Number of times in a row that first run won 653 count1 = 0; 658 count1++; 663 } while ((count1 | count2) < minGallop); 672 count1 = gallopRight((Comparable) a[cursor2], tmp, cursor1, len1, 0); 673 if (count1 != 0) { 674 System.arraycopy(tmp, cursor1, a, dest, count1); 675 dest += count1; 676 cursor1 += count1; 677 len1 -= count1; [all...] |
TimSort.java | 674 int count1 = 0; // Number of times in a row that first run won 686 count1 = 0; 691 count1++; 696 } while ((count1 | count2) < minGallop); 705 count1 = gallopRight(a[cursor2], tmp, cursor1, len1, 0, c); 706 if (count1 != 0) { 707 System.arraycopy(tmp, cursor1, a, dest, count1); 708 dest += count1; 709 cursor1 += count1; 710 len1 -= count1; 793 int count1 = 0; \/\/ Number of times in a row that first run won local [all...] |
/ndk/build/awk/ |
gen-windows-host-path.awk | 71 count1 = count 72 for (nn = 1; nn <= count1; nn++) {
|
/external/webkit/PerformanceTests/SunSpider/resources/ |
sunspider-compare-results.js | 28 var count1 = output1.length; 32 itemTotals1.length = count1; 96 for (var i = 0; i < count1; i++) { 301 var df = count1 + count2 - 2; 326 return result + pad(diffSummary, 18) + formatMean(meanWidth1, mean1, stdErr1, count1) + " " + formatMean(meanWidth2, mean2, stdErr2, count2) + diffDetail; 370 mean1 = computeMeans(count1, total1, categoryTotals1, categoryMeans1, testTotalsByCategory1, testMeansByCategory1); 376 stdErr1 = computeStdErrors(count1, stdDev1, categoryStdErrs1, categoryStdDevs1, testStdErrsByCategory1, testStdDevsByCategory1);
|
/external/freetype/src/pshinter/ |
pshrec.c | 382 FT_UInt count1 = mask1->num_bits; local 387 count = ( count1 <= count2 ) ? 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 )) 1052 FT_UInt count1 = dim[0].hints.num_hints; local [all...] |
pshglob.c | 476 FT_UInt count1, count2; local 493 count1 = normal->count; 495 for ( ; count1 > 0; count1--, zone1++ )
|
/dalvik/tests/055-enum-performance/src/ |
Main.java | 16 int count1 = test1(500); local 26 System.out.println("test1: performed " + count1 + " iterations"); 30 double msec1 = (time1 - time0) / (double) count1 / 1000000;
|
/dalvik/vm/ |
ReferenceTable.cpp | 199 size_t count1 = getElementCount(obj1); local 201 if (count1 != count2) { 202 return count1 - count2;
|
/external/icu4c/i18n/ |
ucol_wgt.cpp | 385 uint32_t count1, count2, power_1, power; local 389 /* calculate how to split the range between maxLength-1 (count1) and maxLength (count2) */ 393 count1=ranges[0].count-count2; 397 printf("split the first range %ld:%ld\n", count1, count2); 399 if(count1<1) { 414 /* set the end of the first range according to count1 */ 416 byte=getWeightByte(ranges[0].start, i)+count1-1; 419 * ranges[0].count and count1 may be >countBytes 438 ranges[0].count=count1; 441 ranges[0].count2=count1*power_1 [all...] |
/external/guava/src/com/google/common/collect/ |
Multisets.java | 346 int count1 = multiset1.count(element); 347 return (count1 == 0) ? 0 : Math.min(count1, multiset2.count(element));
|
/ndk/sources/host-tools/sed-4.2.1/testsuite/ |
dc.sed | 154 : count1 159 /a/b count1
|
/external/icu4c/test/intltest/ |
apicoll.cpp | 1036 int32_t count1, count2; local [all...] |
/frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
wb_vad.c | 132 * (data[count1 - count2]) is stored to (*sub_level) 141 /* (count2 - count1) samples */ 142 Word16 count1, /* i : number of samples to be counted */ 153 for (i = count1; i < count2; i++) 161 for (i = 0; i < count1; i++)
|
/frameworks/opt/calendar/src/com/android/calendarcommon/ |
EventRecurrence.java | 455 private static boolean arraysEqual(int[] array1, int count1, int[] array2, int count2) { 456 if (count1 != count2) { 460 for (int i = 0; i < count1; i++) { [all...] |
/bionic/libc/netbsd/resolv/ |
res_cache.c | 946 int count1, count2; local 963 count1 = _dnsPacket_readInt16(pack1); 965 if (count1 != count2 || count1 < 0) { 975 for ( ; count1 > 0; count1-- ) { [all...] |
/external/icu4c/common/ |
uhash.c | 882 int32_t count1, count2, pos, i; local 908 count1 = uhash_count(hash1); 910 if(count1!=count2){ 915 for(i=0; i<count1; i++){ [all...] |
/system/media/mca/filterfw/native/core/ |
shader_program.cpp | 664 GLint count1, count2; local 665 glGetIntegerv(GL_MAX_VERTEX_UNIFORM_VECTORS, &count1); 667 return count1 < count2 ? count1 : count2; [all...] |
/external/qemu/ |
block.c | 974 void *buf, int count1) 981 count = count1; 993 return count1; 1015 return count1; 1019 const void *buf, int count1) 1026 count = count1; 1040 return count1; 1064 return count1; [all...] |
/frameworks/base/media/libstagefright/codecs/amrnb/common/src/ |
vad1.cpp | 442 count1 -- Word16 -- number of samples to be counted 450 last (count2 - count1) samples. 510 /* (count2 - count1) samples */ 511 Word16 count1, /* i : number of samples to be counted */ 526 for (i = count1; i < count2; i++) 534 for (i = 0; i < count1; i++) [all...] |