| /art/runtime/ |
| jobject_comparator.cc | 46 size_t count1 = obj1->SizeOf(); local
48 if (count1 != count2) {
49 return 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
|
| /external/valgrind/main/drd/tests/ |
| 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) {
|
| 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++)
|
| /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;
|
| /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/freetype/src/pshinter/ |
| pshglob.c | 476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
|
| 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...] |
| /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/chromium_org/third_party/mesa/src/src/mesa/main/ |
| atifragshader.c | 427 GLuint count1 = curProg->Instructions[j][i].ArgCount[1]; local
429 op1, op1_enum, count1);
|
| /external/freetype/src/pshinter/ |
| pshglob.c | 476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
|
| 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/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 | 263 const int count1 = temporal_predictor_count[i][1]; local
265 t_nopred_prob[i] = get_binary_prob(count0, count1);
269 count1 * vp9_cost_one(t_nopred_prob[i]);
|
| /external/mesa3d/src/mesa/main/ |
| atifragshader.c | 427 GLuint count1 = curProg->Instructions[j][i].ArgCount[1]; local
429 op1, op1_enum, count1);
|
| /external/skia/gm/ |
| techtalk1.cpp | 95 int count1 = d1.getPoints(pts1, SK_ARRAY_COUNT(pts1)); local
96 SkASSERT(count == count1);
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| msfmrgts.cpp | 764 int32_t count1 = 0; local
766 Formattable *newobjs = mf->parse(result, pp, count1);
[all...] |
| /external/icu4c/test/intltest/ |
| msfmrgts.cpp | 766 int32_t count1 = 0; local
768 Formattable *newobjs = mf->parse(result, pp, count1);
[all...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/ |
| motion_comp.cpp | 1909 Int i, j, count = 0, count1 = 0; local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| 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...] |
