| /art/runtime/ |
| jobject_comparator.cc | 47 const size_t count1 = obj1->SizeOf(); local
49 if (count1 != count2) {
50 return count1 < count2;
|
| /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
|
| /art/runtime/arch/ |
| memcmp16_test.cc | 54 size_t count1, count2; local
62 count1 = (r.next() % max_length) + min_length;
67 count1 = (r.next() % max_length) + min_length;
72 count1 = 0U;
77 count1 = 0U;
87 if (count1 > 0U) {
88 s1 = new uint16_t[count1];
101 size_t min = count1 < count2 ? count1 : count2;
109 for (size_t i = min; i < count1; ++i)
[all...] |
| /external/valgrind/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++)
|
| /art/test/133-static-invoke-super/src/ |
| Main.java | 41 int count1 = testBasis(50000000); local
46 System.out.println("basis: performed " + count1 + " iterations");
49 double basisMsec = (time1 - time0) / (double) count1 / 1000000;
|
| /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;
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/compression/ |
| DecompressionTest.java | 44 int count1 = 0, count2 = 0; local
46 count1 = myDecompressor.decompress(segment1, 0, segment1.length,
51 "decompressed into " + count1 + " chars");
55 logln(charBuffer, 0, count1);
56 s.append(charBuffer, 0, count1);
60 charBuffer, count1,
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
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/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2CollidePolygon.cpp | 27 int32 count1 = poly1->m_count; local
36 for (int32 i = 0; i < count1; ++i)
164 int32 count1 = poly1->m_count; local
168 int32 iv2 = edge1 + 1 < count1 ? edge1 + 1 : 0;
|
| /external/freetype/src/pshinter/ |
| pshglob.c | 476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
|
| /external/gmock/test/ |
| gmock_stress_test.cc | 211 int count1 = 0; local
212 const Helper1Param param = { &foo, &count1 };
221 EXPECT_EQ(kRepeat, count1 + count2);
|
| /external/google-breakpad/src/testing/test/ |
| gmock_stress_test.cc | 211 int count1 = 0; local
212 const Helper1Param param = { &foo, &count1 };
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
513 // and then into the following count1 & count2 computations.
515 int count1 = count - count2; // number of minLength weights local
516 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
519 --count1;
520 assert((count1 + count2 * nextCountBytes) >= n);
525 if(count1 == 0) {
534 // splitRange, rangeCount, count1, count2)
[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
450 // and then into the following count1 & count2 computations.
452 int32_t count1 = count - count2; // number of minLength weights local
453 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
456 --count1;
457 U_ASSERT((count1 + count2 * nextCountBytes) >= n);
462 if(count1 == 0) {
472 splitRange, rangeCount, count1, count2)
[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
511 // and then into the following count1 & count2 computations.
513 int count1 = count - count2; // number of minLength weights local
514 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
517 --count1;
518 assert((count1 + count2 * nextCountBytes) >= n);
523 if(count1 == 0) {
532 // splitRange, rangeCount, count1, count2)
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btBox2dBox2dCollisionAlgorithm.cpp | 168 int count1 = poly1->getVertexCount(); local
178 if( count1 > 0 )
179 edge = (int) dLocal1.maxDot( normals1, count1, maxDot);
189 int prevEdge = edge - 1 >= 0 ? edge - 1 : count1 - 1;
197 int nextEdge = edge + 1 < count1 ? edge + 1 : 0;
230 edge = bestEdge - 1 >= 0 ? bestEdge - 1 : count1 - 1;
232 edge = bestEdge + 1 < count1 ? bestEdge + 1 : 0;
351 int count1 = poly1->getVertexCount(); local
355 btVector3 v12 = edge1 + 1 < count1 ? vertices1[edge1+1] : vertices1[0];
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/pshinter/ |
| pshglob.c | 476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_segmentation.c | 253 const int count1 = temporal_predictor_count[i][1]; local
255 t_nopred_prob[i] = get_binary_prob(count0, count1);
259 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/pdfium/third_party/freetype/src/pshinter/ |
| pshglob.c | 476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_segmentation.c | 273 const int count1 = temporal_predictor_count[i][1]; local
275 t_nopred_prob[i] = get_binary_prob(count0, count1);
279 count1 * vp9_cost_one(t_nopred_prob[i]);
|
| /art/test/115-native-bridge/ |
| nativebridge.cc | 56 int i, count1, count2; local
57 count1 = gNativeBridgeArtCallbacks->getNativeMethodCount(env, klass);
58 std::unique_ptr<JNINativeMethod[]> methods(new JNINativeMethod[count1]);
62 count2 = gNativeBridgeArtCallbacks->getNativeMethods(env, klass, methods.get(), count1);
63 if (count1 == count2) {
64 printf("Test ART callbacks: all JNI function number is %d.\n", count1);
67 for (i = 0; i < count1; i++) {
|
