| /art/runtime/ |
| jobject_comparator.cc | 48 const size_t count2 = obj2->SizeOf(); local
49 if (count1 != count2) {
50 return count1 < count2;
|
| /external/autotest/client/site_tests/hardware_PerfCallgraphVerification/src/ |
| graph.c | 20 float count2 = 0; local
29 count2 += count;
31 printf("%f", count2);
|
| /art/runtime/arch/ |
| memcmp16_test.cc | 54 size_t count1, count2; local
63 count2 = (r.next() % max_length) + min_length;
68 count2 = 0U;
73 count2 = (r.next() % max_length) + min_length;
78 count2 = 0U;
94 if (count2 > 0U) {
95 s2 = new uint16_t[count2];
101 size_t min = count1 < count2 ? count1 : count2;
112 for (size_t i = min; i < count2; ++i)
[all...] |
| /external/valgrind/drd/tests/ |
| pth_detached.c | 40 const int count2 = argc > 2 ? atoi(argv[2]) : 100; local
60 // Create count2 detached threads by letting the threads detach themselves.
64 for (i = 0; i < count2; i++)
73 while (s_finished_count < count1 + count2) {
|
| pth_detached_sem.c | 44 const int count2 = argc > 2 ? atoi(argv[2]) : 100; local
45 int thread_arg[count1 > count2 ? count1 : count2];
50 for (i = 0; i < count1 || i < count2; i++)
67 // Create count2 detached threads by letting the threads detach themselves.
71 for (i = 0; i < count2; i++)
79 for (i = 0; i < count1 + count2; i++)
|
| /art/test/133-static-invoke-super/src/ |
| Main.java | 43 int count2 = testStatic(50000000); local
47 System.out.println("test1: performed " + count2 + " iterations");
50 double msec1 = (time2 - time1) / (double) count2 / 1000000;
|
| /packages/apps/ContactsCommon/src/com/android/contacts/common/format/ |
| FormatUtils.java | 65 int count2 = array2.length; local
68 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) {
70 count2--;
73 int size = count2;
|
| /art/test/055-enum-performance/src/ |
| Main.java | 38 int count2 = test2(500); local
47 System.out.println("test2: performed " + count2 + " iterations");
51 double msec2 = (time2 - time1) / (double) count2 / 1000000;
|
| /external/freetype/src/sfnt/ |
| ttkern.c | 261 FT_UInt count2; local
264 for ( count2 = num_pairs; count2 > 0; count2-- )
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/compression/ |
| DecompressionTest.java | 44 int count1 = 0, count2 = 0; local
58 count2 = myDecompressor.decompress(segment2, 0, segment2.length,
64 "decompressed into " + count2 + " chars");
68 logln(charBuffer, count1, count2);
70 s.append(charBuffer, count1, count2);
73 logln(charBuffer, 0, count1 + count2);
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/compression/ |
| DecompressionTest.java | 40 int count1 = 0, count2 = 0; local
54 count2 = myDecompressor.decompress(segment2, 0, segment2.length,
60 "decompressed into " + count2 + " chars");
64 logln(charBuffer, count1, count2);
66 s.append(charBuffer, count1, count2);
69 logln(charBuffer, 0, count1 + count2);
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2CollidePolygon.cpp | 28 int32 count2 = poly2->m_count;
local
44 for (int32 j = 0; j < count2; ++j)
70 int32 count2 = poly2->m_count; local
82 for (int32 i = 0; i < count2; ++i)
94 int32 i2 = i1 + 1 < count2 ? i1 + 1 : 0;
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Rope/ |
| b2Rope.cpp | 72 int32 count2 = m_count - 1; local
74 m_Ls = (float32*)b2Alloc(count2 * sizeof(float32));
77 for (int32 i = 0; i < count2; ++i)
142 int32 count2 = m_count - 1; local
144 for (int32 i = 0; i < count2; ++i)
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/sfnt/ |
| ttkern.c | 261 FT_UInt count2; local
264 for ( count2 = num_pairs; count2 > 0; count2-- )
|
| /external/pdfium/third_party/freetype/src/sfnt/ |
| ttkern.c | 261 FT_UInt count2; local
264 for ( count2 = num_pairs; count2 > 0; count2-- )
|
| /external/skia/tests/ |
| UtilsTest.cpp | 177 size_t count2 = SkUTF16_CountUnichars(buf, 2); local
178 REPORTER_ASSERT(reporter, count2 == 1);
|
| /cts/tests/tests/provider/src/android/provider/cts/ |
| MediaStore_Video_ThumbnailsTest.java | 103 int count2 = getThumbnailCount(Thumbnails.EXTERNAL_CONTENT_URI); local
104 assertTrue(count2 > count);
|
| /external/freetype/src/pshinter/ |
| pshglob.c | 476 FT_UInt count1, count2; local
500 count2 = family->count;
502 for ( ; count2 > 0; count2--, zone2++ )
|
| /external/gmock/test/ |
| gmock_stress_test.cc | 216 int count2 = 0; local
217 const Helper1Param param2 = { &foo, &count2 };
221 EXPECT_EQ(kRepeat, count1 + count2);
|
| /external/google-breakpad/src/testing/test/ |
| gmock_stress_test.cc | 216 int count2 = 0; local
217 const Helper1Param param2 = { &foo, &count2 };
221 EXPECT_EQ(kRepeat, count1 + count2);
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationWeights.java | 507 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
509 // count1 + count2 * nextCountBytes = n
510 // count1 + count2 = count
512 // (count - count2) + count2 * nextCountBytes = n
513 // and then into the following count1 & count2 computations.
514 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened local
515 int count1 = count - count2; // number of minLength weights
516 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n)
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationweights.cpp | 444 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
446 // count1 + count2 * nextCountBytes = n
447 // count1 + count2 = count
449 // (count - count2) + count2 * nextCountBytes = n
450 // and then into the following count1 & count2 computations.
451 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened local
452 int32_t count1 = count - count2; // number of minLength weights
453 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n)
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationWeights.java | 505 // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
507 // count1 + count2 * nextCountBytes = n
508 // count1 + count2 = count
510 // (count - count2) + count2 * nextCountBytes = n
511 // and then into the following count1 & count2 computations.
512 int count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened local
513 int count1 = count - count2; // number of minLength weights
514 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n)
[all...] |
| /external/libavc/encoder/ |
| ime_distortion_metrics.c | 228 WORD32 count2, count3; local
234 for(count2 = MB_SIZE; count2 > 0; count2--)
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btBox2dBox2dCollisionAlgorithm.cpp | 141 int count2 = poly2->getVertexCount(); local
154 if( count2 > 0 )
155 index = (int) normal1.minDot( vertices2, count2, minDot);
261 int count2 = poly2->getVertexCount(); local
273 for (int i = 0; i < count2; ++i)
285 int i2 = i1 + 1 < count2 ? i1 + 1 : 0;
|
