HomeSort by relevance Sort by last modified time
    Searched refs:count1 (Results 1 - 25 of 91) sorted by null

1 2 3 4

  /external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/tests/
nasmpp-nested.asm 2 %ASSIGN %%count1 4
3 %error %%count1
4 %REP %%count1
9 %ASSIGN %%count1 4
10 %error %%count1
11 %REP %%count1
18 %ASSIGN %%count1 4
20 %error %%count1 %%count2
21 %REP %%count1
  /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 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) {
  /art/runtime/
jobject_comparator.cc 46 size_t count1 = obj1->SizeOf(); local
48 if (count1 != count2) {
49 return count1 < count2;
barrier_test.cc 30 CheckWaitTask(Barrier* barrier, AtomicInteger* count1, AtomicInteger* count2,
33 count1_(count1),
71 AtomicInteger count1(0);
75 thread_pool.AddTask(self, new CheckWaitTask(&barrier, &count1, &count2, &count3));
81 EXPECT_EQ(num_threads, count1);
92 EXPECT_EQ(count1, count2);
reference_table.cc 91 size_t count1 = obj1->SizeOf(); variable
93 if (count1 != count2) {
94 return 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/ContactsCommon/src/com/android/contacts/common/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;
  /external/chromium_org/tools/idl_parser/
idl_lexer_test.py 53 count1 = len(tokens1)
55 self.assertEqual(count1, count2)
57 for i in range(count1):
  /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/chromium_org/ppapi/generators/
idl_lexer.py 274 count1 = len(values1)
276 if count1 != count2:
277 print "Size mismatch original %d vs %d\n" % (count1, count2)
278 if count1 > count2: count1 = count2
280 for i in range(count1):
  /external/chromium_org/content/test/data/indexeddb/
cursor_prefetch.js 278 count1 = 0;
284 shouldBe("count1", "kNumberOfItems");
293 if (cursor1.key !== count1)
294 shouldBe("cursor1.key", "count1");
295 if (cursor1.value !== count1)
296 shouldBe("cursor1.value", "count1");
298 ++count1;
300 if (count1 % 20 === 0) {
  /external/chromium_org/third_party/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/chromium_org/third_party/freetype/src/pshinter/
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++ )
1008 FT_UInt count1 = dim[0].hints.num_hints; local
1013 if ( bit_count != count1 + count2 )
1017 bit_count, count1 + count2 ));
1024 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1,
1053 FT_UInt count1 = dim[0].hints.num_hints; local
    [all...]
  /external/freetype/src/pshinter/
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++ )
1008 FT_UInt count1 = dim[0].hints.num_hints; local
1013 if ( bit_count != count1 + count2 )
1017 bit_count, count1 + count2 ));
1024 error = ps_dimension_set_mask_bits( &dim[0], bytes, count2, count1,
1053 FT_UInt count1 = dim[0].hints.num_hints; local
    [all...]
  /art/test/055-enum-performance/src/
Main.java 36 int count1 = test1(500); local
46 System.out.println("test1: performed " + count1 + " iterations");
50 double msec1 = (time1 - time0) / (double) count1 / 1000000;
  /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/chromium_org/third_party/icu/source/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/icu4c/i18n/
ucol_wgt.cpp 398 uint32_t count1, count2, power_1, power; local
402 /* calculate how to split the range between maxLength-1 (count1) and maxLength (count2) */
406 count1=ranges[0].count-count2;
410 printf("split the first range %ld:%ld\n", count1, count2);
412 if(count1<1) {
427 /* set the end of the first range according to count1 */
429 byte=getWeightByte(ranges[0].start, i)+count1-1;
432 * ranges[0].count and count1 may be >countBytes
451 ranges[0].count=count1;
454 ranges[0].count2=count1*power_1
    [all...]
  /external/libvpx/libvpx/vp9/encoder/
vp9_segmentation.c 270 const int count1 = temporal_predictor_count[i][1]; local
272 t_nopred_prob[i] = get_binary_prob(count0, count1);
276 count1 * vp9_cost_one(t_nopred_prob[i]);

Completed in 1910 milliseconds

1 2 3 4